blob: 412af94a160662aa11802dd58512c6410c9b56da [file] [log] [blame]
Willy Tarreaudd815982007-10-16 12:25:14 +02001/*
Willy Tarreaud1d54542012-09-12 22:58:11 +02002 * Listener management functions.
Willy Tarreaudd815982007-10-16 12:25:14 +02003 *
Willy Tarreau0ccb7442013-01-07 22:54:17 +01004 * Copyright 2000-2013 Willy Tarreau <w@1wt.eu>
Willy Tarreaudd815982007-10-16 12:25:14 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau6ae1ba62014-05-07 19:01:58 +020013#include <ctype.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020014#include <errno.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020015#include <stdio.h>
16#include <string.h>
Willy Tarreau95ccdde2014-02-01 09:28:36 +010017#include <unistd.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020018
Willy Tarreaudcc048a2020-06-04 19:11:43 +020019#include <haproxy/acl.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020020#include <haproxy/api.h>
Willy Tarreau5d9ddc52021-10-06 19:54:09 +020021#include <haproxy/activity.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020022#include <haproxy/cfgparse.h>
Willy Tarreaudbf78022021-10-06 09:05:08 +020023#include <haproxy/cli-t.h>
Willy Tarreau7ea393d2020-06-04 18:02:10 +020024#include <haproxy/connection.h>
Willy Tarreau8d366972020-05-27 16:10:29 +020025#include <haproxy/errors.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020026#include <haproxy/fd.h>
27#include <haproxy/freq_ctr.h>
Willy Tarreauf268ee82020-06-04 17:05:57 +020028#include <haproxy/global.h>
Willy Tarreau853b2972020-05-27 18:01:47 +020029#include <haproxy/list.h>
Willy Tarreau213e9902020-06-04 14:58:24 +020030#include <haproxy/listener.h>
Willy Tarreauaeed4a82020-06-04 22:01:04 +020031#include <haproxy/log.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020032#include <haproxy/protocol.h>
Willy Tarreau5958c432021-05-08 20:30:37 +020033#include <haproxy/proxy.h>
Frédéric Lécaille748ece62022-05-21 23:58:40 +020034#include <haproxy/quic_tp.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020035#include <haproxy/sample.h>
Willy Tarreaudfd3de82020-06-04 23:46:14 +020036#include <haproxy/stream.h>
Willy Tarreaucea0e1b2020-06-04 17:25:40 +020037#include <haproxy/task.h>
Willy Tarreau9310f482021-10-06 16:18:40 +020038#include <haproxy/ticks.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020039#include <haproxy/tools.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020040
Willy Tarreaub648d632007-10-28 22:13:50 +010041
Willy Tarreau26982662012-09-12 23:17:10 +020042/* List head of all known bind keywords */
Willy Tarreauca1acd62022-03-29 15:02:44 +020043struct bind_kw_list bind_keywords = {
Willy Tarreau26982662012-09-12 23:17:10 +020044 .list = LIST_HEAD_INIT(bind_keywords.list)
45};
46
Willy Tarreaua1d97f82019-12-10 11:18:41 +010047/* list of the temporarily limited listeners because of lack of resource */
48static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
49static struct task *global_listener_queue_task;
Willy Tarreaua1d97f82019-12-10 11:18:41 +010050
William Dauchy3679d0c2021-02-14 23:22:55 +010051/* listener status for stats */
52const char* li_status_st[LI_STATE_COUNT] = {
53 [LI_STATUS_WAITING] = "WAITING",
54 [LI_STATUS_OPEN] = "OPEN",
55 [LI_STATUS_FULL] = "FULL",
56};
Willy Tarreaua1d97f82019-12-10 11:18:41 +010057
Willy Tarreau1efafce2019-01-27 15:37:19 +010058#if defined(USE_THREAD)
59
60struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
61
62/* dequeue and process a pending connection from the local accept queue (single
Willy Tarreau83efc322020-10-14 17:37:17 +020063 * consumer). Returns the accepted connection or NULL if none was found.
Willy Tarreau1efafce2019-01-27 15:37:19 +010064 */
Willy Tarreau83efc322020-10-14 17:37:17 +020065struct connection *accept_queue_pop_sc(struct accept_queue_ring *ring)
Willy Tarreau1efafce2019-01-27 15:37:19 +010066{
Willy Tarreau1efafce2019-01-27 15:37:19 +010067 unsigned int pos, next;
Willy Tarreau83efc322020-10-14 17:37:17 +020068 struct connection *ptr;
69 struct connection **e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010070
71 pos = ring->head;
72
73 if (pos == ring->tail)
Willy Tarreau83efc322020-10-14 17:37:17 +020074 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010075
76 next = pos + 1;
77 if (next >= ACCEPT_QUEUE_SIZE)
78 next = 0;
79
80 e = &ring->entry[pos];
81
82 /* wait for the producer to update the listener's pointer */
83 while (1) {
Willy Tarreau83efc322020-10-14 17:37:17 +020084 ptr = *e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010085 __ha_barrier_load();
86 if (ptr)
87 break;
88 pl_cpu_relax();
89 }
90
Willy Tarreau1efafce2019-01-27 15:37:19 +010091 /* release the entry */
Willy Tarreau83efc322020-10-14 17:37:17 +020092 *e = NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010093
94 __ha_barrier_store();
95 ring->head = next;
Willy Tarreau83efc322020-10-14 17:37:17 +020096 return ptr;
Willy Tarreau1efafce2019-01-27 15:37:19 +010097}
98
99
Willy Tarreau83efc322020-10-14 17:37:17 +0200100/* tries to push a new accepted connection <conn> into ring <ring>. Returns
101 * non-zero if it succeeds, or zero if the ring is full. Supports multiple
102 * producers.
Willy Tarreau1efafce2019-01-27 15:37:19 +0100103 */
Willy Tarreau83efc322020-10-14 17:37:17 +0200104int accept_queue_push_mp(struct accept_queue_ring *ring, struct connection *conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100105{
Willy Tarreau1efafce2019-01-27 15:37:19 +0100106 unsigned int pos, next;
107
108 pos = ring->tail;
109 do {
110 next = pos + 1;
111 if (next >= ACCEPT_QUEUE_SIZE)
112 next = 0;
113 if (next == ring->head)
114 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100115 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100116
Willy Tarreau83efc322020-10-14 17:37:17 +0200117 ring->entry[pos] = conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100118 __ha_barrier_store();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100119 return 1;
120}
121
Willy Tarreaufb5401f2021-01-29 12:25:23 +0100122/* proceed with accepting new connections. Don't mark it static so that it appears
123 * in task dumps.
124 */
Willy Tarreau144f84a2021-03-02 16:09:26 +0100125struct task *accept_queue_process(struct task *t, void *context, unsigned int state)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100126{
127 struct accept_queue_ring *ring = context;
Willy Tarreau83efc322020-10-14 17:37:17 +0200128 struct connection *conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100129 struct listener *li;
Christopher Faulet102854c2019-04-30 12:17:13 +0200130 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100131 int ret;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100132
Christopher Faulet102854c2019-04-30 12:17:13 +0200133 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
134 * is not really illimited, but it is probably enough.
135 */
Willy Tarreau66161322021-02-19 15:50:27 +0100136 max_accept = global.tune.maxaccept ? global.tune.maxaccept : MAX_ACCEPT;
Christopher Faulet102854c2019-04-30 12:17:13 +0200137 for (; max_accept; max_accept--) {
Willy Tarreau83efc322020-10-14 17:37:17 +0200138 conn = accept_queue_pop_sc(ring);
139 if (!conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100140 break;
141
Willy Tarreau83efc322020-10-14 17:37:17 +0200142 li = __objt_listener(conn->target);
Willy Tarreau4781b152021-04-06 13:53:36 +0200143 _HA_ATOMIC_INC(&li->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +0200144 ret = li->accept(conn);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100145 if (ret <= 0) {
146 /* connection was terminated by the application */
147 continue;
148 }
149
150 /* increase the per-process number of cumulated sessions, this
151 * may only be done once l->accept() has accepted the connection.
152 */
153 if (!(li->options & LI_O_UNLIMITED)) {
154 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
155 update_freq_ctr(&global.sess_per_sec, 1));
Willy Tarreau11ba4042022-05-20 15:56:32 +0200156 if (li->bind_conf && li->bind_conf->options & BC_O_USE_SSL) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100157 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
158 update_freq_ctr(&global.ssl_per_sec, 1));
159 }
160 }
161 }
162
163 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200164 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200165 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100166
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200167 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100168}
169
170/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
171static int accept_queue_init()
172{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200173 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100174 int i;
175
176 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200177 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100178 if (!t) {
179 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
180 return ERR_FATAL|ERR_ABORT;
181 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200182 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100183 t->process = accept_queue_process;
184 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200185 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100186 }
187 return 0;
188}
189
190REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
191
Willy Tarreaue01b08d2022-04-27 18:42:47 +0200192static void accept_queue_deinit()
193{
194 int i;
195
196 for (i = 0; i < global.nbthread; i++) {
197 if (accept_queue_rings[i].tasklet)
198 tasklet_free(accept_queue_rings[i].tasklet);
199 }
200}
201
202REGISTER_POST_DEINIT(accept_queue_deinit);
203
Willy Tarreau1efafce2019-01-27 15:37:19 +0100204#endif // USE_THREAD
205
Amaury Denoyellef68b2cb2022-01-25 16:21:47 +0100206/* Memory allocation and initialization of the per_thr field.
207 * Returns 0 if the field has been successfully initialized, -1 on failure.
208 */
209int li_init_per_thr(struct listener *li)
210{
211 int i;
212
213 /* allocate per-thread elements for listener */
214 li->per_thr = calloc(global.nbthread, sizeof(*li->per_thr));
215 if (!li->per_thr)
216 return -1;
217
218 for (i = 0; i < global.nbthread; ++i) {
219 MT_LIST_INIT(&li->per_thr[i].quic_accept.list);
220 MT_LIST_INIT(&li->per_thr[i].quic_accept.conns);
221
222 li->per_thr[i].li = li;
223 }
224
225 return 0;
226}
227
William Dauchy3679d0c2021-02-14 23:22:55 +0100228/* helper to get listener status for stats */
229enum li_status get_li_status(struct listener *l)
230{
231 if (!l->maxconn || l->nbconn < l->maxconn) {
232 if (l->state == LI_LIMITED)
233 return LI_STATUS_WAITING;
234 else
235 return LI_STATUS_OPEN;
236 }
237 return LI_STATUS_FULL;
238}
239
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200240/* adjust the listener's state and its proxy's listener counters if needed.
241 * It must be called under the listener's lock, but uses atomic ops to change
242 * the proxy's counters so that the proxy lock is not needed.
243 */
Willy Tarreaua37b2442020-09-24 07:23:45 +0200244void listener_set_state(struct listener *l, enum li_state st)
245{
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200246 struct proxy *px = l->bind_conf->frontend;
247
248 if (px) {
249 /* from state */
250 switch (l->state) {
251 case LI_NEW: /* first call */
Willy Tarreau4781b152021-04-06 13:53:36 +0200252 _HA_ATOMIC_INC(&px->li_all);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200253 break;
254 case LI_INIT:
255 case LI_ASSIGNED:
256 break;
257 case LI_PAUSED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200258 _HA_ATOMIC_DEC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200259 break;
260 case LI_LISTEN:
Willy Tarreau4781b152021-04-06 13:53:36 +0200261 _HA_ATOMIC_DEC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200262 break;
263 case LI_READY:
264 case LI_FULL:
265 case LI_LIMITED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200266 _HA_ATOMIC_DEC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200267 break;
268 }
269
270 /* to state */
271 switch (st) {
272 case LI_NEW:
273 case LI_INIT:
274 case LI_ASSIGNED:
275 break;
276 case LI_PAUSED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200277 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200278 _HA_ATOMIC_INC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200279 break;
280 case LI_LISTEN:
Willy Tarreau95a34602020-10-08 15:32:21 +0200281 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200282 _HA_ATOMIC_INC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200283 break;
284 case LI_READY:
285 case LI_FULL:
286 case LI_LIMITED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200287 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200288 _HA_ATOMIC_INC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200289 break;
290 }
291 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200292 l->state = st;
293}
294
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100295/* This function adds the specified listener's file descriptor to the polling
296 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500297 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200298 * also support binding only the relevant processes to their respective
299 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100300 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200301void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100302{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100303 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200304
305 /* If this listener is supposed to be only in the master, close it in
306 * the workers. Conversely, if it's supposed to be only in the workers
307 * close it in the master.
308 */
Willy Tarreau18c20d22020-10-09 16:11:46 +0200309 if (!!master != !!(listener->rx.flags & RX_F_MWORKER))
Willy Tarreau75c98d12020-10-09 15:55:23 +0200310 do_unbind_listener(listener);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200311
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100312 if (listener->state == LI_LISTEN) {
Willy Tarreau95a34602020-10-08 15:32:21 +0200313 BUG_ON(listener->rx.fd == -1);
William Lallemand095ba4c2017-06-01 17:38:50 +0200314 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau72faef32021-06-15 08:36:30 +0200315 (!!master != !!(listener->rx.flags & RX_F_MWORKER))) {
Willy Tarreauae302532014-05-07 19:22:24 +0200316 /* we don't want to enable this listener and don't
317 * want any fd event to reach it.
318 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200319 do_unbind_listener(listener);
Willy Tarreauae302532014-05-07 19:22:24 +0200320 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100321 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200322 listener->rx.proto->enable(listener);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200323 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200324 }
325 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200326 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100327 }
328 }
Willy Tarreaud6afb532020-10-09 10:35:40 +0200329
Willy Tarreau08b6f962022-02-01 16:23:00 +0100330 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100331}
332
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200333/*
Aurelien DARRAGON187396e2022-09-11 16:19:49 +0200334 * This function completely stops a listener.
335 * The proxy's listeners count is updated and the proxy is
336 * disabled and woken up after the last one is gone.
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200337 * It will need to operate under the proxy's lock and the protocol's lock.
338 * The caller is responsible for indicating in lpx, lpr whether the
339 * respective locks are already held (non-zero) or not (zero) so that the
340 * function picks the missing ones, in this order.
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200341 */
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200342void stop_listener(struct listener *l, int lpx, int lpr)
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200343{
344 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200345
346 if (l->options & LI_O_NOSTOP) {
347 /* master-worker sockpairs are never closed but don't count as a
348 * job.
349 */
350 return;
351 }
352
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200353 if (!lpx && px)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200354 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200355
356 if (!lpr)
357 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
358
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200359 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200360
361 if (l->state > LI_INIT) {
Willy Tarreau75c98d12020-10-09 15:55:23 +0200362 do_unbind_listener(l);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200363
364 if (l->state >= LI_ASSIGNED)
365 __delete_listener(l);
366
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200367 if (px)
368 proxy_cond_disable(px);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200369 }
370
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200371 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200372
373 if (!lpr)
374 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
375
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200376 if (!lpx && px)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200377 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200378}
379
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100380/* This function adds the specified <listener> to the protocol <proto>. It
381 * does nothing if the protocol was already added. The listener's state is
382 * automatically updated from LI_INIT to LI_ASSIGNED. The number of listeners
383 * for the protocol is updated. This must be called with the proto lock held.
384 */
385void default_add_listener(struct protocol *proto, struct listener *listener)
386{
387 if (listener->state != LI_INIT)
388 return;
389 listener_set_state(listener, LI_ASSIGNED);
390 listener->rx.proto = proto;
Willy Tarreau2b718102021-04-21 07:32:39 +0200391 LIST_APPEND(&proto->receivers, &listener->rx.proto_list);
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100392 proto->nb_receivers++;
393}
394
Willy Tarreaue03204c2020-10-09 17:02:21 +0200395/* default function called to suspend a listener: it simply passes the call to
396 * the underlying receiver. This is find for most socket-based protocols. This
397 * must be called under the listener's lock. It will return non-zero on success,
398 * 0 on failure. If no receiver-level suspend is provided, the operation is
399 * assumed to succeed.
400 */
401int default_suspend_listener(struct listener *l)
402{
403 int ret = 1;
404
405 if (!l->rx.proto->rx_suspend)
406 return 1;
407
408 ret = l->rx.proto->rx_suspend(&l->rx);
409 return ret > 0 ? ret : 0;
410}
411
412
413/* Tries to resume a suspended listener, and returns non-zero on success or
414 * zero on failure. On certain errors, an alert or a warning might be displayed.
415 * It must be called with the listener's lock held. Depending on the listener's
416 * state and protocol, a listen() call might be used to resume operations, or a
417 * call to the receiver's resume() function might be used as well. This is
418 * suitable as a default function for TCP and UDP. This must be called with the
419 * listener's lock held.
420 */
421int default_resume_listener(struct listener *l)
422{
423 int ret = 1;
424
425 if (l->state == LI_ASSIGNED) {
426 char msg[100];
427 int err;
428
429 err = l->rx.proto->listen(l, msg, sizeof(msg));
430 if (err & ERR_ALERT)
431 ha_alert("Resuming listener: %s\n", msg);
432 else if (err & ERR_WARN)
433 ha_warning("Resuming listener: %s\n", msg);
434
435 if (err & (ERR_FATAL | ERR_ABORT)) {
436 ret = 0;
437 goto end;
438 }
439 }
440
441 if (l->state < LI_PAUSED) {
442 ret = 0;
443 goto end;
444 }
445
446 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
447 l->rx.proto->rx_resume(&l->rx) <= 0)
448 ret = 0;
449 end:
450 return ret;
451}
452
453
Willy Tarreaube58c382011-07-24 18:28:10 +0200454/* This function tries to temporarily disable a listener, depending on the OS
455 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
456 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
457 * closes upon SHUT_WR and refuses to rebind. So a common validation path
458 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
459 * is disabled. It normally returns non-zero, unless an error is reported.
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200460 * It will need to operate under the proxy's lock. The caller is
461 * responsible for indicating in lpx whether the proxy locks is
462 * already held (non-zero) or not (zero) so that the function picks it.
Willy Tarreaube58c382011-07-24 18:28:10 +0200463 */
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200464int pause_listener(struct listener *l, int lpx)
Willy Tarreaube58c382011-07-24 18:28:10 +0200465{
Willy Tarreau58651b42020-09-24 16:03:29 +0200466 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200467 int ret = 1;
468
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200469 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200470 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
471
Willy Tarreau08b6f962022-02-01 16:23:00 +0100472 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200473
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200474 if (l->state <= LI_PAUSED)
475 goto end;
476
Willy Tarreaue03204c2020-10-09 17:02:21 +0200477 if (l->rx.proto->suspend)
478 ret = l->rx.proto->suspend(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200479
Willy Tarreau2b718102021-04-21 07:32:39 +0200480 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200481
Willy Tarreaua37b2442020-09-24 07:23:45 +0200482 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200483
484 if (px && !px->li_ready) {
Aurelien DARRAGONd46f4372022-09-09 15:51:37 +0200485 /* PROXY_LOCK is required */
486 proxy_cond_pause(px);
Willy Tarreau58651b42020-09-24 16:03:29 +0200487 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
488 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
489 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200490 end:
Willy Tarreau08b6f962022-02-01 16:23:00 +0100491 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200492
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200493 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200494 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
495
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200496 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200497}
498
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200499/* This function tries to resume a temporarily disabled listener. Paused, full,
500 * limited and disabled listeners are handled, which means that this function
501 * may replace enable_listener(). The resulting state will either be LI_READY
502 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200503 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200504 * foreground mode, and are ignored. If the listener was only in the assigned
505 * state, it's totally rebound. This can happen if a pause() has completely
506 * stopped it. If the resume fails, 0 is returned and an error might be
507 * displayed.
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200508 * It will need to operate under the proxy's lock. The caller is
509 * responsible for indicating in lpx whether the proxy locks is
510 * already held (non-zero) or not (zero) so that the function picks it.
Willy Tarreaube58c382011-07-24 18:28:10 +0200511 */
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200512int resume_listener(struct listener *l, int lpx)
Willy Tarreaube58c382011-07-24 18:28:10 +0200513{
Willy Tarreau58651b42020-09-24 16:03:29 +0200514 struct proxy *px = l->bind_conf->frontend;
515 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200516 int ret = 1;
517
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200518 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200519 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
520
Willy Tarreau08b6f962022-02-01 16:23:00 +0100521 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200522
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200523 /* check that another thread didn't to the job in parallel (e.g. at the
524 * end of listen_accept() while we'd come from dequeue_all_listeners().
525 */
Willy Tarreau2b718102021-04-21 07:32:39 +0200526 if (MT_LIST_INLIST(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200527 goto end;
528
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200529 if (l->state == LI_READY)
530 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200531
Willy Tarreaue03204c2020-10-09 17:02:21 +0200532 if (l->rx.proto->resume)
533 ret = l->rx.proto->resume(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200534
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100535 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200536 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200537 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200538 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200539 }
540
Willy Tarreau4b51f422020-09-25 20:32:28 +0200541 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200542 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200543
544 done:
545 if (was_paused && !px->li_paused) {
Aurelien DARRAGONd46f4372022-09-09 15:51:37 +0200546 /* PROXY_LOCK is required */
547 proxy_cond_resume(px);
Willy Tarreau58651b42020-09-24 16:03:29 +0200548 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
549 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
550 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200551 end:
Willy Tarreau08b6f962022-02-01 16:23:00 +0100552 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200553
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200554 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200555 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
556
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200557 return ret;
558}
559
Willy Tarreau87b09662015-04-03 00:22:06 +0200560/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200561 * it upon next close() using resume_listener().
562 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200563static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200564{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100565 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200566 if (l->state >= LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200567 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100568 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200569 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200570 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100571 }
Willy Tarreau62793712011-07-24 19:23:38 +0200572 }
Willy Tarreau08b6f962022-02-01 16:23:00 +0100573 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200574}
575
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200576/* Marks a ready listener as limited so that we only try to re-enable it when
577 * resources are free again. It will be queued into the specified queue.
578 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200579static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200580{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100581 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200582 if (l->state == LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200583 MT_LIST_TRY_APPEND(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200584 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200585 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200586 }
Willy Tarreau08b6f962022-02-01 16:23:00 +0100587 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200588}
589
Willy Tarreau241797a2019-12-10 14:10:52 +0100590/* Dequeues all listeners waiting for a resource the global wait queue */
591void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200592{
Willy Tarreau01abd022019-02-28 10:27:18 +0100593 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200594
Willy Tarreau241797a2019-12-10 14:10:52 +0100595 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200596 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100597 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200598 */
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200599 resume_listener(listener, 0);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200600 }
601}
602
Willy Tarreau241797a2019-12-10 14:10:52 +0100603/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
604void dequeue_proxy_listeners(struct proxy *px)
605{
606 struct listener *listener;
607
608 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
609 /* This cannot fail because the listeners are by definition in
610 * the LI_LIMITED state.
611 */
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200612 resume_listener(listener, 0);
Willy Tarreau241797a2019-12-10 14:10:52 +0100613 }
614}
615
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200616
617/* default function used to unbind a listener. This is for use by standard
618 * protocols working on top of accepted sockets. The receiver's rx_unbind()
619 * will automatically be used after the listener is disabled if the socket is
620 * still bound. This must be used under the listener's lock.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100621 */
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200622void default_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100623{
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200624 if (listener->state <= LI_ASSIGNED)
625 goto out_close;
626
627 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200628 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200629 goto out_close;
630 }
631
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200632 if (listener->state >= LI_READY) {
633 listener->rx.proto->disable(listener);
634 if (listener->rx.flags & RX_F_BOUND)
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200635 listener_set_state(listener, LI_LISTEN);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200636 }
637
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200638 out_close:
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200639 if (listener->rx.flags & RX_F_BOUND)
640 listener->rx.proto->rx_unbind(&listener->rx);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200641}
642
643/* This function closes the listening socket for the specified listener,
644 * provided that it's already in a listening state. The protocol's unbind()
645 * is called to put the listener into LI_ASSIGNED or LI_LISTEN and handle
646 * the unbinding tasks. The listener enters then the LI_ASSIGNED state if
647 * the receiver is unbound. Must be called with the lock held.
648 */
649void do_unbind_listener(struct listener *listener)
650{
Willy Tarreau2b718102021-04-21 07:32:39 +0200651 MT_LIST_DELETE(&listener->wait_queue);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200652
653 if (listener->rx.proto->unbind)
654 listener->rx.proto->unbind(listener);
Willy Tarreau374e9af2020-10-09 15:47:17 +0200655
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200656 /* we may have to downgrade the listener if the rx was closed */
657 if (!(listener->rx.flags & RX_F_BOUND) && listener->state > LI_ASSIGNED)
Willy Tarreau374e9af2020-10-09 15:47:17 +0200658 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100659}
660
Olivier Houchard1fc05162017-04-06 01:05:05 +0200661/* This function closes the listening socket for the specified listener,
662 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200663 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
664 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100665 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200666 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100667void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200668{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100669 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200670 do_unbind_listener(listener);
Willy Tarreau08b6f962022-02-01 16:23:00 +0100671 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200672}
673
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200674/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
675 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200676 * allocation). The address family is taken from ss->ss_family, and the protocol
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200677 * passed in <proto> must be usable on this family. The protocol's default iocb
678 * is automatically preset as the receivers' iocb. The number of jobs and
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200679 * listeners is automatically increased by the number of listeners created. It
680 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200681 */
682int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200683 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200684{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200685 struct listener *l;
686 int port;
687
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200688 for (port = portl; port <= porth; port++) {
689 l = calloc(1, sizeof(*l));
690 if (!l) {
691 memprintf(err, "out of memory");
692 return 0;
693 }
694 l->obj_type = OBJ_TYPE_LISTENER;
Willy Tarreau2b718102021-04-21 07:32:39 +0200695 LIST_APPEND(&bc->frontend->conf.listeners, &l->by_fe);
696 LIST_APPEND(&bc->listeners, &l->by_bind);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200697 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200698 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200699 l->rx.owner = l;
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200700 l->rx.iocb = proto->default_iocb;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200701 l->rx.fd = fd;
Willy Tarreau07400c52020-12-04 14:49:11 +0100702
Willy Tarreau37159062020-08-27 07:48:42 +0200703 memcpy(&l->rx.addr, ss, sizeof(*ss));
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100704 if (proto->fam->set_port)
705 proto->fam->set_port(&l->rx.addr, port);
Willy Tarreau07400c52020-12-04 14:49:11 +0100706
Olivier Houchard859dc802019-08-08 15:47:21 +0200707 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200708 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200709
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100710 proto->add(proto, l);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200711
Willy Tarreau909c23b2020-09-15 13:50:58 +0200712 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200713 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100714
Amaury Denoyelle7f8f6cb2020-11-10 14:24:31 +0100715 l->extra_counters = NULL;
716
Willy Tarreau08b6f962022-02-01 16:23:00 +0100717 HA_RWLOCK_INIT(&l->lock);
Willy Tarreau4781b152021-04-06 13:53:36 +0200718 _HA_ATOMIC_INC(&jobs);
719 _HA_ATOMIC_INC(&listeners);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200720 }
721 return 1;
722}
723
Willy Tarreau59a877d2021-10-12 09:36:10 +0200724/* clones listener <src> and returns the new one. All dynamically allocated
725 * fields are reallocated (name for now). The new listener is inserted before
726 * the original one in the bind_conf and frontend lists. This allows it to be
727 * duplicated while iterating over the current list. The original listener must
728 * only be in the INIT or ASSIGNED states, and the new listener will only be
729 * placed into the INIT state. The counters are always set to NULL. Maxsock is
730 * updated. Returns NULL on allocation error.
731 */
732struct listener *clone_listener(struct listener *src)
733{
734 struct listener *l;
735
736 l = calloc(1, sizeof(*l));
737 if (!l)
738 goto oom1;
739 memcpy(l, src, sizeof(*l));
740
741 if (l->name) {
742 l->name = strdup(l->name);
743 if (!l->name)
744 goto oom2;
745 }
746
747 l->rx.owner = l;
748 l->state = LI_INIT;
749 l->counters = NULL;
750 l->extra_counters = NULL;
751
752 LIST_APPEND(&src->by_fe, &l->by_fe);
753 LIST_APPEND(&src->by_bind, &l->by_bind);
754
755 MT_LIST_INIT(&l->wait_queue);
756
757 l->rx.proto->add(l->rx.proto, l);
758
Willy Tarreau08b6f962022-02-01 16:23:00 +0100759 HA_RWLOCK_INIT(&l->lock);
Willy Tarreau59a877d2021-10-12 09:36:10 +0200760 _HA_ATOMIC_INC(&jobs);
761 _HA_ATOMIC_INC(&listeners);
762 global.maxsock++;
763 return l;
764
Willy Tarreau59a877d2021-10-12 09:36:10 +0200765 oom2:
766 free(l);
767 oom1:
Willy Tarreaua1462892021-10-16 14:45:29 +0200768 return NULL;
Willy Tarreau59a877d2021-10-12 09:36:10 +0200769}
770
Willy Tarreau1a64d162007-10-28 22:26:05 +0100771/* Delete a listener from its protocol's list of listeners. The listener's
772 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200773 * number of listeners is updated, as well as the global number of listeners
774 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200775 * is a low-level function expected to be called with the proto_lock and the
776 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100777 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200778void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100779{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100780 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200781 listener_set_state(listener, LI_INIT);
Willy Tarreau2b718102021-04-21 07:32:39 +0200782 LIST_DELETE(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200783 listener->rx.proto->nb_receivers--;
Willy Tarreau4781b152021-04-06 13:53:36 +0200784 _HA_ATOMIC_DEC(&jobs);
785 _HA_ATOMIC_DEC(&listeners);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100786 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200787}
788
789/* Delete a listener from its protocol's list of listeners (please check
790 * __delete_listener() above). The proto_lock and the listener's lock will
791 * be grabbed in this order.
792 */
793void delete_listener(struct listener *listener)
794{
795 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau08b6f962022-02-01 16:23:00 +0100796 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200797 __delete_listener(listener);
Willy Tarreau08b6f962022-02-01 16:23:00 +0100798 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200799 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100800}
801
Willy Tarreaue2711c72019-02-27 15:39:41 +0100802/* Returns a suitable value for a listener's backlog. It uses the listener's,
803 * otherwise the frontend's backlog, otherwise the listener's maxconn,
804 * otherwise the frontend's maxconn, otherwise 1024.
805 */
806int listener_backlog(const struct listener *l)
807{
808 if (l->backlog)
809 return l->backlog;
810
811 if (l->bind_conf->frontend->backlog)
812 return l->bind_conf->frontend->backlog;
813
814 if (l->maxconn)
815 return l->maxconn;
816
817 if (l->bind_conf->frontend->maxconn)
818 return l->bind_conf->frontend->maxconn;
819
820 return 1024;
821}
822
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200823/* This function is called on a read event from a listening socket, corresponding
824 * to an accept. It tries to accept as many connections as possible, and for each
825 * calls the listener's accept handler (generally the frontend's accept handler).
826 */
Willy Tarreaua74cb382020-10-15 21:29:49 +0200827void listener_accept(struct listener *l)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200828{
Willy Tarreau83efc322020-10-14 17:37:17 +0200829 struct connection *cli_conn;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100830 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200831 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100832 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100833 int next_feconn = 0;
834 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200835 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200836 int ret;
837
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100838 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200839
840 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
841 * illimited, but it is probably enough.
842 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100843 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200844
Willy Tarreau93e7c002013-10-07 18:51:07 +0200845 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
846 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200847
848 if (unlikely(!max)) {
849 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200850 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100851 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200852 }
853
854 if (max_accept > max)
855 max_accept = max;
856 }
857
858 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200859 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
860
861 if (unlikely(!max)) {
862 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200863 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100864 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200865 }
866
867 if (max_accept > max)
868 max_accept = max;
869 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200870#ifdef USE_OPENSSL
Willy Tarreau11ba4042022-05-20 15:56:32 +0200871 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim &&
872 l->bind_conf && l->bind_conf->options & BC_O_USE_SSL) {
Willy Tarreaue43d5322013-10-07 20:01:52 +0200873 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200874
Willy Tarreaue43d5322013-10-07 20:01:52 +0200875 if (unlikely(!max)) {
876 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200877 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100878 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200879 }
880
881 if (max_accept > max)
882 max_accept = max;
883 }
884#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200885 if (p && p->fe_sps_lim) {
886 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
887
888 if (unlikely(!max)) {
889 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100890 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
891 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200892 }
893
894 if (max_accept > max)
895 max_accept = max;
896 }
897
898 /* Note: if we fail to allocate a connection because of configured
899 * limits, we'll schedule a new attempt worst 1 second later in the
900 * worst case. If we fail due to system limits or temporary resource
901 * shortage, we try again 100ms later in the worst case.
902 */
Willy Tarreau02757d02021-01-28 18:07:24 +0100903 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200904 unsigned int count;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200905 int status;
Willy Tarreau0aa5a5b2020-10-16 17:43:04 +0200906 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200907
Willy Tarreau82c97892019-02-27 19:32:32 +0100908 /* pre-increase the number of connections without going too far.
909 * We process the listener, then the proxy, then the process.
910 * We know which ones to unroll based on the next_xxx value.
911 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100912 do {
913 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100914 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100915 /* the listener was marked full or another
916 * thread is going to do it.
917 */
918 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100919 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100920 goto end;
921 }
922 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000923 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100924
Willy Tarreau82c97892019-02-27 19:32:32 +0100925 if (p) {
926 do {
927 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100928 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100929 /* the frontend was marked full or another
930 * thread is going to do it.
931 */
932 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100933 expire = TICK_ETERNITY;
934 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100935 }
936 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100937 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200938 }
939
Willy Tarreau82c97892019-02-27 19:32:32 +0100940 if (!(l->options & LI_O_UNLIMITED)) {
941 do {
942 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100943 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100944 /* the process was marked full or another
945 * thread is going to do it.
946 */
947 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100948 expire = tick_add(now_ms, 1000); /* try again in 1 second */
949 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100950 }
951 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000952 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200953 }
954
Willy Tarreaufed93d32022-02-01 16:37:00 +0100955 /* be careful below, the listener might be shutting down in
956 * another thread on error and we must not dereference its
957 * FD without a bit of protection.
958 */
959 cli_conn = NULL;
960 status = CO_AC_PERMERR;
961
962 HA_RWLOCK_RDLOCK(LISTENER_LOCK, &l->lock);
963 if (l->rx.flags & RX_F_BOUND)
964 cli_conn = l->rx.proto->accept_conn(l, &status);
965 HA_RWLOCK_RDUNLOCK(LISTENER_LOCK, &l->lock);
966
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200967 if (!cli_conn) {
968 switch (status) {
969 case CO_AC_DONE:
970 goto end;
Willy Tarreau818dca52014-01-31 19:40:19 +0100971
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200972 case CO_AC_RETRY: /* likely a signal */
Willy Tarreau4781b152021-04-06 13:53:36 +0200973 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100974 if (p)
Willy Tarreau4781b152021-04-06 13:53:36 +0200975 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100976 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +0200977 _HA_ATOMIC_DEC(&actconn);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100978 continue;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200979
980 case CO_AC_YIELD:
Willy Tarreau92079932019-12-10 09:30:05 +0100981 max_accept = 0;
982 goto end;
William Lallemandd9138002018-11-27 12:02:39 +0100983
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200984 default:
985 goto transient_error;
Willy Tarreau83efc322020-10-14 17:37:17 +0200986 }
987 }
988
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100989 /* The connection was accepted, it must be counted as such */
990 if (l->counters)
991 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
992
Willy Tarreaud8679342022-05-09 20:41:54 +0200993 if (p) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100994 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
Willy Tarreaud8679342022-05-09 20:41:54 +0200995 proxy_inc_fe_conn_ctr(l, p);
996 }
Willy Tarreau82c97892019-02-27 19:32:32 +0100997
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100998 if (!(l->options & LI_O_UNLIMITED)) {
999 count = update_freq_ctr(&global.conn_per_sec, 1);
1000 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001001 }
1002
Willy Tarreau4781b152021-04-06 13:53:36 +02001003 _HA_ATOMIC_INC(&activity[tid].accepted);
Willy Tarreau64a9c052019-04-12 15:27:17 +02001004
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001005 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +01001006 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
1007 * allows the error path not to rollback on nbconn. It's more
1008 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001009 */
1010 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +01001011 next_feconn = 0;
1012 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001013
Willy Tarreau83efc322020-10-14 17:37:17 +02001014
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001015#if defined(USE_THREAD)
Amaury Denoyelle7f7713d2022-01-19 11:37:50 +01001016 if (l->rx.flags & RX_F_LOCAL_ACCEPT)
1017 goto local_accept;
1018
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001019 mask = l->rx.bind_thread & tg->threads_enabled;
Willy Tarreaua7da5e82020-03-12 17:33:29 +01001020 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001021 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001022 unsigned int t, t0, t1, t2;
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001023 int base = tg->base;
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001024
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001025 /* The principle is that we have two running indexes,
1026 * each visiting in turn all threads bound to this
1027 * listener. The connection will be assigned to the one
1028 * with the least connections, and the other one will
1029 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001030 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001031 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001032 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001033
1034 /* keep a copy for the final update. thr_idx is composite
1035 * and made of (t2<<16) + t1.
1036 */
Willy Tarreau0cf33172019-03-06 15:26:33 +01001037 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001038 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001039 unsigned long m1, m2;
1040 int q1, q2;
1041
1042 t2 = t1 = t0;
1043 t2 >>= 16;
1044 t1 &= 0xFFFF;
1045
1046 /* t1 walks low to high bits ;
1047 * t2 walks high to low.
1048 */
1049 m1 = mask >> t1;
1050 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
1051
Willy Tarreau85d04242019-04-16 18:09:13 +02001052 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001053 m1 &= ~1UL;
1054 if (!m1) {
1055 m1 = mask;
1056 t1 = 0;
1057 }
1058 t1 += my_ffsl(m1) - 1;
1059 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001060
Willy Tarreau85d04242019-04-16 18:09:13 +02001061 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
1062 /* highest bit not set */
1063 if (!m2)
1064 m2 = mask;
1065
1066 t2 = my_flsl(m2) - 1;
1067 }
1068
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001069 /* now we have two distinct thread IDs belonging to the mask */
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001070 q1 = accept_queue_rings[base + t1].tail - accept_queue_rings[base + t1].head + ACCEPT_QUEUE_SIZE;
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001071 if (q1 >= ACCEPT_QUEUE_SIZE)
1072 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001073
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001074 q2 = accept_queue_rings[base + t2].tail - accept_queue_rings[base + t2].head + ACCEPT_QUEUE_SIZE;
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001075 if (q2 >= ACCEPT_QUEUE_SIZE)
1076 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001077
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001078 /* we have 3 possibilities now :
1079 * q1 < q2 : t1 is less loaded than t2, so we pick it
1080 * and update t2 (since t1 might still be
1081 * lower than another thread)
1082 * q1 > q2 : t2 is less loaded than t1, so we pick it
1083 * and update t1 (since t2 might still be
1084 * lower than another thread)
1085 * q1 = q2 : both are equally loaded, thus we pick t1
1086 * and update t1 as it will become more loaded
1087 * than t2.
1088 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001089
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001090 q1 += l->thr_conn[base + t1];
1091 q2 += l->thr_conn[base + t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001092
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001093 if (q1 - q2 < 0) {
1094 t = t1;
1095 t2 = t2 ? t2 - 1 : LONGBITS - 1;
1096 }
1097 else if (q1 - q2 > 0) {
1098 t = t2;
1099 t1++;
1100 if (t1 >= LONGBITS)
1101 t1 = 0;
1102 }
1103 else {
1104 t = t1;
1105 t1++;
1106 if (t1 >= LONGBITS)
1107 t1 = 0;
1108 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001109
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001110 /* new value for thr_idx */
1111 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001112 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001113
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001114 /* We successfully selected the best thread "t" for this
1115 * connection. We use deferred accepts even if it's the
1116 * local thread because tests show that it's the best
1117 * performing model, likely due to better cache locality
1118 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001119 */
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001120 ring = &accept_queue_rings[base + t];
Willy Tarreau83efc322020-10-14 17:37:17 +02001121 if (accept_queue_push_mp(ring, cli_conn)) {
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001122 _HA_ATOMIC_INC(&activity[base + t].accq_pushed);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001123 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001124 continue;
1125 }
1126 /* If the ring is full we do a synchronous accept on
1127 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001128 */
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001129 _HA_ATOMIC_INC(&activity[base + t].accq_full);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001130 }
1131#endif // USE_THREAD
1132
Amaury Denoyelle7f7713d2022-01-19 11:37:50 +01001133 local_accept:
Willy Tarreau4781b152021-04-06 13:53:36 +02001134 _HA_ATOMIC_INC(&l->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +02001135 ret = l->accept(cli_conn);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001136 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001137 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001138 * we just have to ignore it (ret == 0) or it's a critical
1139 * error due to a resource shortage, and we must stop the
1140 * listener (ret < 0).
1141 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001142 if (ret == 0) /* successful termination */
1143 continue;
1144
Willy Tarreaubb660302014-05-07 19:47:02 +02001145 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001146 }
1147
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001148 /* increase the per-process number of cumulated sessions, this
1149 * may only be done once l->accept() has accepted the connection.
1150 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001151 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001152 count = update_freq_ctr(&global.sess_per_sec, 1);
1153 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001154 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001155#ifdef USE_OPENSSL
Willy Tarreau11ba4042022-05-20 15:56:32 +02001156 if (!(l->options & LI_O_UNLIMITED) &&
1157 l->bind_conf && l->bind_conf->options & BC_O_USE_SSL) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001158 count = update_freq_ctr(&global.ssl_per_sec, 1);
1159 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001160 }
1161#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001162
Willy Tarreaubdcd3252022-06-22 09:19:46 +02001163 _HA_ATOMIC_AND(&th_ctx->flags, ~TH_FL_STUCK); // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001164 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001165
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001166 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001167 if (next_conn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001168 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001169
Willy Tarreau82c97892019-02-27 19:32:32 +01001170 if (p && next_feconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001171 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001172
1173 if (next_actconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001174 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001175
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001176 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau02757d02021-01-28 18:07:24 +01001177 (l->state == LI_LIMITED &&
Willy Tarreaucdcba112019-12-11 15:06:30 +01001178 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1179 (!tick_isset(global_listener_queue_task->expire) ||
1180 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001181 /* at least one thread has to this when quitting */
Aurelien DARRAGON00132882022-09-09 15:32:57 +02001182 resume_listener(l, 0);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001183
Willy Tarreau02757d02021-01-28 18:07:24 +01001184 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001185 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001186
Olivier Houchard859dc802019-08-08 15:47:21 +02001187 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001188 (!p->fe_sps_lim || freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0) > 0))
Willy Tarreau241797a2019-12-10 14:10:52 +01001189 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001190 }
Willy Tarreau0591bf72019-12-10 12:01:21 +01001191 return;
1192
1193 transient_error:
1194 /* pause the listener for up to 100 ms */
1195 expire = tick_add(now_ms, 100);
1196
Willy Tarreau258b3512020-10-13 17:46:05 +02001197 /* This may be a shared socket that was paused by another process.
1198 * Let's put it to pause in this case.
1199 */
1200 if (l->rx.proto && l->rx.proto->rx_listening(&l->rx) == 0) {
Aurelien DARRAGON00132882022-09-09 15:32:57 +02001201 pause_listener(l, 0);
Willy Tarreau258b3512020-10-13 17:46:05 +02001202 goto end;
1203 }
1204
Willy Tarreau0591bf72019-12-10 12:01:21 +01001205 limit_global:
1206 /* (re-)queue the listener to the global queue and set it to expire no
1207 * later than <expire> ahead. The listener turns to LI_LIMITED.
1208 */
1209 limit_listener(l, &global_listener_queue);
1210 task_schedule(global_listener_queue_task, expire);
1211 goto end;
1212
1213 limit_proxy:
1214 /* (re-)queue the listener to the proxy's queue and set it to expire no
1215 * later than <expire> ahead. The listener turns to LI_LIMITED.
1216 */
1217 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001218 if (p->task && tick_isset(expire))
1219 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001220 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001221}
1222
Willy Tarreau05f50472017-09-15 09:19:58 +02001223/* Notify the listener that a connection initiated from it was released. This
1224 * is used to keep the connection count consistent and to possibly re-open
1225 * listening when it was limited.
1226 */
1227void listener_release(struct listener *l)
1228{
1229 struct proxy *fe = l->bind_conf->frontend;
1230
1231 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +02001232 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001233 if (fe)
Willy Tarreau4781b152021-04-06 13:53:36 +02001234 _HA_ATOMIC_DEC(&fe->feconn);
1235 _HA_ATOMIC_DEC(&l->nbconn);
1236 _HA_ATOMIC_DEC(&l->thr_conn[tid]);
Willy Tarreau82c97892019-02-27 19:32:32 +01001237
1238 if (l->state == LI_FULL || l->state == LI_LIMITED)
Aurelien DARRAGON00132882022-09-09 15:32:57 +02001239 resume_listener(l, 0);
Willy Tarreau05f50472017-09-15 09:19:58 +02001240
Willy Tarreau02757d02021-01-28 18:07:24 +01001241 /* Dequeues all of the listeners waiting for a resource */
1242 dequeue_all_listeners();
1243
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +02001244 if (fe && !MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001245 (!fe->fe_sps_lim || freq_ctr_remain(&fe->fe_sess_per_sec, fe->fe_sps_lim, 0) > 0))
Willy Tarreau241797a2019-12-10 14:10:52 +01001246 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001247}
1248
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001249/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1250static int listener_queue_init()
1251{
Willy Tarreaubeeabf52021-10-01 18:23:30 +02001252 global_listener_queue_task = task_new_anywhere();
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001253 if (!global_listener_queue_task) {
1254 ha_alert("Out of memory when initializing global listener queue\n");
1255 return ERR_FATAL|ERR_ABORT;
1256 }
1257 /* very simple initialization, users will queue the task if needed */
1258 global_listener_queue_task->context = NULL; /* not even a context! */
1259 global_listener_queue_task->process = manage_global_listener_queue;
1260
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001261 return 0;
1262}
1263
1264static void listener_queue_deinit()
1265{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001266 task_destroy(global_listener_queue_task);
1267 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001268}
1269
1270REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1271REGISTER_POST_DEINIT(listener_queue_deinit);
1272
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001273
1274/* This is the global management task for listeners. It enables listeners waiting
1275 * for global resources when there are enough free resource, or at least once in
Willy Tarreaud597ec22021-01-29 14:29:06 +01001276 * a while. It is designed to be called as a task. It's exported so that it's easy
1277 * to spot in "show tasks" or "show profiling".
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001278 */
Willy Tarreau144f84a2021-03-02 16:09:26 +01001279struct task *manage_global_listener_queue(struct task *t, void *context, unsigned int state)
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001280{
1281 /* If there are still too many concurrent connections, let's wait for
1282 * some of them to go away. We don't need to re-arm the timer because
1283 * each of them will scan the queue anyway.
1284 */
1285 if (unlikely(actconn >= global.maxconn))
1286 goto out;
1287
1288 /* We should periodically try to enable listeners waiting for a global
1289 * resource here, because it is possible, though very unlikely, that
1290 * they have been blocked by a temporary lack of global resource such
1291 * as a file descriptor or memory and that the temporary condition has
1292 * disappeared.
1293 */
1294 dequeue_all_listeners();
1295
1296 out:
1297 t->expire = TICK_ETERNITY;
1298 task_queue(t);
1299 return t;
1300}
1301
Willy Tarreau26982662012-09-12 23:17:10 +02001302/*
1303 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1304 * parsing sessions.
1305 */
1306void bind_register_keywords(struct bind_kw_list *kwl)
1307{
Willy Tarreau2b718102021-04-21 07:32:39 +02001308 LIST_APPEND(&bind_keywords.list, &kwl->list);
Willy Tarreau26982662012-09-12 23:17:10 +02001309}
1310
1311/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1312 * keyword is found with a NULL ->parse() function, then an attempt is made to
1313 * find one with a valid ->parse() function. This way it is possible to declare
1314 * platform-dependant, known keywords as NULL, then only declare them as valid
1315 * if some options are met. Note that if the requested keyword contains an
1316 * opening parenthesis, everything from this point is ignored.
1317 */
1318struct bind_kw *bind_find_kw(const char *kw)
1319{
1320 int index;
1321 const char *kwend;
1322 struct bind_kw_list *kwl;
1323 struct bind_kw *ret = NULL;
1324
1325 kwend = strchr(kw, '(');
1326 if (!kwend)
1327 kwend = kw + strlen(kw);
1328
1329 list_for_each_entry(kwl, &bind_keywords.list, list) {
1330 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1331 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1332 kwl->kw[index].kw[kwend-kw] == 0) {
1333 if (kwl->kw[index].parse)
1334 return &kwl->kw[index]; /* found it !*/
1335 else
1336 ret = &kwl->kw[index]; /* may be OK */
1337 }
1338 }
1339 }
1340 return ret;
1341}
1342
Willy Tarreau8638f482012-09-18 18:01:17 +02001343/* Dumps all registered "bind" keywords to the <out> string pointer. The
1344 * unsupported keywords are only dumped if their supported form was not
1345 * found.
1346 */
1347void bind_dump_kws(char **out)
1348{
1349 struct bind_kw_list *kwl;
1350 int index;
1351
Christopher Faulet784063e2020-05-18 12:14:18 +02001352 if (!out)
1353 return;
1354
Willy Tarreau8638f482012-09-18 18:01:17 +02001355 *out = NULL;
1356 list_for_each_entry(kwl, &bind_keywords.list, list) {
1357 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1358 if (kwl->kw[index].parse ||
1359 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001360 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1361 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001362 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001363 kwl->kw[index].skip ? " <arg>" : "",
1364 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001365 }
1366 }
1367 }
1368}
1369
Willy Tarreau433b05f2021-03-12 10:14:07 +01001370/* Try to find in srv_keyword the word that looks closest to <word> by counting
1371 * transitions between letters, digits and other characters. Will return the
1372 * best matching word if found, otherwise NULL.
1373 */
1374const char *bind_find_best_kw(const char *word)
1375{
1376 uint8_t word_sig[1024];
1377 uint8_t list_sig[1024];
1378 const struct bind_kw_list *kwl;
1379 const char *best_ptr = NULL;
1380 int dist, best_dist = INT_MAX;
1381 int index;
1382
1383 make_word_fingerprint(word_sig, word);
1384 list_for_each_entry(kwl, &bind_keywords.list, list) {
1385 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1386 make_word_fingerprint(list_sig, kwl->kw[index].kw);
1387 dist = word_fingerprint_distance(word_sig, list_sig);
1388 if (dist < best_dist) {
1389 best_dist = dist;
1390 best_ptr = kwl->kw[index].kw;
1391 }
1392 }
1393 }
1394
1395 if (best_dist > 2 * strlen(word) || (best_ptr && best_dist > 2 * strlen(best_ptr)))
1396 best_ptr = NULL;
1397
1398 return best_ptr;
1399}
1400
Willy Tarreaudbf78022021-10-06 09:05:08 +02001401/* allocate an bind_conf struct for a bind line, and chain it to the frontend <fe>.
1402 * If <arg> is not NULL, it is duplicated into ->arg to store useful config
1403 * information for error reporting. NULL is returned on error.
1404 */
1405struct bind_conf *bind_conf_alloc(struct proxy *fe, const char *file,
1406 int line, const char *arg, struct xprt_ops *xprt)
1407{
1408 struct bind_conf *bind_conf = calloc(1, sizeof(*bind_conf));
1409
1410 if (!bind_conf)
1411 goto err;
1412
1413 bind_conf->file = strdup(file);
1414 if (!bind_conf->file)
1415 goto err;
1416 bind_conf->line = line;
1417 if (arg) {
1418 bind_conf->arg = strdup(arg);
1419 if (!bind_conf->arg)
1420 goto err;
1421 }
1422
1423 LIST_APPEND(&fe->conf.bind, &bind_conf->by_fe);
1424 bind_conf->settings.ux.uid = -1;
1425 bind_conf->settings.ux.gid = -1;
1426 bind_conf->settings.ux.mode = 0;
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001427 bind_conf->settings.shards = 1;
Willy Tarreaudbf78022021-10-06 09:05:08 +02001428 bind_conf->xprt = xprt;
1429 bind_conf->frontend = fe;
1430 bind_conf->severity_output = CLI_SEVERITY_NONE;
1431#ifdef USE_OPENSSL
1432 HA_RWLOCK_INIT(&bind_conf->sni_lock);
1433 bind_conf->sni_ctx = EB_ROOT;
1434 bind_conf->sni_w_ctx = EB_ROOT;
1435#endif
1436 LIST_INIT(&bind_conf->listeners);
1437 return bind_conf;
1438
1439 err:
1440 if (bind_conf) {
1441 ha_free(&bind_conf->file);
1442 ha_free(&bind_conf->arg);
1443 }
1444 ha_free(&bind_conf);
1445 return NULL;
1446}
1447
1448const char *listener_state_str(const struct listener *l)
1449{
1450 static const char *states[8] = {
1451 "NEW", "INI", "ASS", "PAU", "LIS", "RDY", "FUL", "LIM",
1452 };
1453 unsigned int st = l->state;
1454
1455 if (st >= sizeof(states) / sizeof(*states))
1456 return "INVALID";
1457 return states[st];
1458}
1459
Willy Tarreau645513a2010-05-24 20:55:15 +02001460/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001461/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001462/************************************************************************/
1463
Willy Tarreaua5e37562011-12-16 17:06:15 +01001464/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001465static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001466smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001467{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001468 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001469 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001470 return 1;
1471}
1472
Willy Tarreaua5e37562011-12-16 17:06:15 +01001473/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001474static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001475smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001476{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001477 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001478 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001479 return 1;
1480}
Jerome Magnineb421b22020-03-27 22:08:40 +01001481static int
1482smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1483{
1484 smp->data.u.str.area = smp->sess->listener->name;
1485 if (!smp->data.u.str.area)
1486 return 0;
1487
1488 smp->data.type = SMP_T_STR;
1489 smp->flags = SMP_F_CONST;
1490 smp->data.u.str.data = strlen(smp->data.u.str.area);
1491 return 1;
1492}
Willy Tarreau645513a2010-05-24 20:55:15 +02001493
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001494/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001495static int bind_parse_accept_proxy(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001496{
1497 struct listener *l;
1498
Willy Tarreau4348fad2012-09-20 16:48:07 +02001499 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001500 l->options |= LI_O_ACC_PROXY;
1501
1502 return 0;
1503}
1504
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001505/* parse the "accept-netscaler-cip" bind keyword */
1506static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1507{
1508 struct listener *l;
1509 uint32_t val;
1510
1511 if (!*args[cur_arg + 1]) {
1512 memprintf(err, "'%s' : missing value", args[cur_arg]);
1513 return ERR_ALERT | ERR_FATAL;
1514 }
1515
1516 val = atol(args[cur_arg + 1]);
1517 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001518 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001519 return ERR_ALERT | ERR_FATAL;
1520 }
1521
1522 list_for_each_entry(l, &conf->listeners, by_bind) {
1523 l->options |= LI_O_ACC_CIP;
1524 conf->ns_cip_magic = val;
1525 }
1526
1527 return 0;
1528}
1529
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001530/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001531static int bind_parse_backlog(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001532{
1533 struct listener *l;
1534 int val;
1535
1536 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001537 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001538 return ERR_ALERT | ERR_FATAL;
1539 }
1540
1541 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001542 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001543 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001544 return ERR_ALERT | ERR_FATAL;
1545 }
1546
Willy Tarreau4348fad2012-09-20 16:48:07 +02001547 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001548 l->backlog = val;
1549
1550 return 0;
1551}
1552
1553/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001554static int bind_parse_id(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001555{
1556 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001557 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001558 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001559
Willy Tarreau4348fad2012-09-20 16:48:07 +02001560 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001561 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001562 return ERR_ALERT | ERR_FATAL;
1563 }
1564
1565 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001566 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001567 return ERR_ALERT | ERR_FATAL;
1568 }
1569
Willy Tarreau4348fad2012-09-20 16:48:07 +02001570 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001571 new->luid = strtol(args[cur_arg + 1], &error, 10);
1572 if (*error != '\0') {
1573 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1574 return ERR_ALERT | ERR_FATAL;
1575 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001576 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001577
Willy Tarreau4348fad2012-09-20 16:48:07 +02001578 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001579 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001580 return ERR_ALERT | ERR_FATAL;
1581 }
1582
Willy Tarreau4348fad2012-09-20 16:48:07 +02001583 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001584 if (node) {
1585 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001586 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1587 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1588 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001589 return ERR_ALERT | ERR_FATAL;
1590 }
1591
Willy Tarreau4348fad2012-09-20 16:48:07 +02001592 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001593 return 0;
1594}
1595
Willy Tarreau3882d2a2022-05-20 15:41:45 +02001596/* Complete a bind_conf by parsing the args after the address. <args> is the
1597 * arguments array, <cur_arg> is the first one to be considered. <section> is
1598 * the section name to report in error messages, and <file> and <linenum> are
1599 * the file name and line number respectively. Note that args[0..1] are used
1600 * in error messages to provide some context. The return value is an error
1601 * code, zero on success or an OR of ERR_{FATAL,ABORT,ALERT,WARN}.
1602 */
1603int bind_parse_args_list(struct bind_conf *bind_conf, char **args, int cur_arg, const char *section, const char *file, int linenum)
1604{
1605 int err_code = 0;
1606
1607 while (*(args[cur_arg])) {
1608 struct bind_kw *kw;
1609 const char *best;
1610
1611 kw = bind_find_kw(args[cur_arg]);
1612 if (kw) {
1613 char *err = NULL;
1614 int code;
1615
1616 if (!kw->parse) {
1617 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : '%s' option is not implemented in this version (check build options).\n",
1618 file, linenum, args[0], args[1], section, args[cur_arg]);
1619 cur_arg += 1 + kw->skip ;
1620 err_code |= ERR_ALERT | ERR_FATAL;
1621 goto out;
1622 }
1623
1624 code = kw->parse(args, cur_arg, bind_conf->frontend, bind_conf, &err);
1625 err_code |= code;
1626
1627 if (code) {
1628 if (err && *err) {
1629 indent_msg(&err, 2);
1630 if (((code & (ERR_WARN|ERR_ALERT)) == ERR_WARN))
1631 ha_warning("parsing [%s:%d] : '%s %s' in section '%s' : %s\n", file, linenum, args[0], args[1], section, err);
1632 else
1633 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : %s\n", file, linenum, args[0], args[1], section, err);
1634 }
1635 else
1636 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : error encountered while processing '%s'.\n",
1637 file, linenum, args[0], args[1], section, args[cur_arg]);
1638 if (code & ERR_FATAL) {
1639 free(err);
1640 cur_arg += 1 + kw->skip;
1641 goto out;
1642 }
1643 }
1644 free(err);
1645 cur_arg += 1 + kw->skip;
1646 continue;
1647 }
1648
1649 best = bind_find_best_kw(args[cur_arg]);
1650 if (best)
1651 ha_alert("parsing [%s:%d] : '%s %s' in section '%s': unknown keyword '%s'; did you mean '%s' maybe ?\n",
1652 file, linenum, args[0], args[1], section, args[cur_arg], best);
1653 else
1654 ha_alert("parsing [%s:%d] : '%s %s' in section '%s': unknown keyword '%s'.\n",
1655 file, linenum, args[0], args[1], section, args[cur_arg]);
1656
1657 err_code |= ERR_ALERT | ERR_FATAL;
1658 goto out;
1659 }
Willy Tarreau64306cc2022-05-20 16:20:52 +02001660
1661 if ((bind_conf->options & (BC_O_USE_SOCK_DGRAM|BC_O_USE_SOCK_STREAM)) == (BC_O_USE_SOCK_DGRAM|BC_O_USE_SOCK_STREAM) ||
1662 (bind_conf->options & (BC_O_USE_XPRT_DGRAM|BC_O_USE_XPRT_STREAM)) == (BC_O_USE_XPRT_DGRAM|BC_O_USE_XPRT_STREAM)) {
1663 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : cannot mix datagram and stream protocols.\n",
1664 file, linenum, args[0], args[1], section);
1665 err_code |= ERR_ALERT | ERR_FATAL;
1666 goto out;
1667 }
1668
Willy Tarreau78d0dcd2022-05-20 17:10:00 +02001669 /* The transport layer automatically switches to QUIC when QUIC is
1670 * selected, regardless of bind_conf settings. We then need to
1671 * initialize QUIC params.
1672 */
1673 if ((bind_conf->options & (BC_O_USE_SOCK_DGRAM|BC_O_USE_XPRT_STREAM)) == (BC_O_USE_SOCK_DGRAM|BC_O_USE_XPRT_STREAM)) {
1674#ifdef USE_QUIC
1675 bind_conf->xprt = xprt_get(XPRT_QUIC);
Willy Tarreau287f32f2022-05-20 18:16:52 +02001676 if (!(bind_conf->options & BC_O_USE_SSL)) {
1677 bind_conf->options |= BC_O_USE_SSL;
1678 ha_warning("parsing [%s:%d] : '%s %s' in section '%s' : QUIC protocol detected, enabling ssl. Use 'ssl' to shut this warning.\n",
1679 file, linenum, args[0], args[1], section);
1680 }
Willy Tarreau78d0dcd2022-05-20 17:10:00 +02001681 quic_transport_params_init(&bind_conf->quic_params, 1);
1682#else
1683 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : QUIC protocol selected but support not compiled in (check build options).\n",
1684 file, linenum, args[0], args[1], section);
1685 err_code |= ERR_ALERT | ERR_FATAL;
1686 goto out;
1687#endif
1688 }
Willy Tarreau2071a992022-05-20 17:14:31 +02001689 else if (bind_conf->options & BC_O_USE_SSL) {
1690 bind_conf->xprt = xprt_get(XPRT_SSL);
1691 }
Willy Tarreau78d0dcd2022-05-20 17:10:00 +02001692
Willy Tarreau3882d2a2022-05-20 15:41:45 +02001693 out:
1694 return err_code;
1695}
1696
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001697/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001698static int bind_parse_maxconn(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001699{
1700 struct listener *l;
1701 int val;
1702
1703 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001704 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001705 return ERR_ALERT | ERR_FATAL;
1706 }
1707
1708 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001709 if (val < 0) {
1710 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001711 return ERR_ALERT | ERR_FATAL;
1712 }
1713
Willy Tarreau4348fad2012-09-20 16:48:07 +02001714 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001715 l->maxconn = val;
1716
1717 return 0;
1718}
1719
1720/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001721static int bind_parse_name(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001722{
1723 struct listener *l;
1724
1725 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001726 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001727 return ERR_ALERT | ERR_FATAL;
1728 }
1729
Willy Tarreau4348fad2012-09-20 16:48:07 +02001730 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001731 l->name = strdup(args[cur_arg + 1]);
1732
1733 return 0;
1734}
1735
1736/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001737static int bind_parse_nice(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001738{
1739 struct listener *l;
1740 int val;
1741
1742 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001743 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001744 return ERR_ALERT | ERR_FATAL;
1745 }
1746
1747 val = atol(args[cur_arg + 1]);
1748 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001749 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001750 return ERR_ALERT | ERR_FATAL;
1751 }
1752
Willy Tarreau4348fad2012-09-20 16:48:07 +02001753 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001754 l->nice = val;
1755
1756 return 0;
1757}
1758
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001759/* parse the "process" bind keyword */
1760static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1761{
Willy Tarreauacd64412022-07-15 17:16:01 +02001762 memprintf(err, "'process %s' on 'bind' lines is not supported anymore, please use 'thread' instead.", args[cur_arg+1]);
1763 return ERR_ALERT | ERR_FATAL;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001764}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001765
Christopher Fauleta717b992018-04-10 14:43:00 +02001766/* parse the "proto" bind keyword */
1767static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1768{
1769 struct ist proto;
1770
1771 if (!*args[cur_arg + 1]) {
1772 memprintf(err, "'%s' : missing value", args[cur_arg]);
1773 return ERR_ALERT | ERR_FATAL;
1774 }
1775
Tim Duesterhusdcf753a2021-03-04 17:31:47 +01001776 proto = ist(args[cur_arg + 1]);
Christopher Fauleta717b992018-04-10 14:43:00 +02001777 conf->mux_proto = get_mux_proto(proto);
1778 if (!conf->mux_proto) {
1779 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1780 return ERR_ALERT | ERR_FATAL;
1781 }
Willy Tarreauc8cac042021-09-21 14:31:29 +02001782 return 0;
1783}
1784
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001785/* parse the "shards" bind keyword. Takes an integer or "by-thread" */
1786static int bind_parse_shards(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1787{
1788 int val;
1789
1790 if (!*args[cur_arg + 1]) {
1791 memprintf(err, "'%s' : missing value", args[cur_arg]);
1792 return ERR_ALERT | ERR_FATAL;
1793 }
1794
1795 if (strcmp(args[cur_arg + 1], "by-thread") == 0) {
1796 val = MAX_THREADS; /* will be trimmed later anyway */
1797 } else {
1798 val = atol(args[cur_arg + 1]);
1799 if (val < 1 || val > MAX_THREADS) {
1800 memprintf(err, "'%s' : invalid value %d, allowed range is %d..%d or 'by-thread'", args[cur_arg], val, 1, MAX_THREADS);
1801 return ERR_ALERT | ERR_FATAL;
1802 }
1803 }
1804
1805 conf->settings.shards = val;
1806 return 0;
1807}
1808
Willy Tarreauc8cac042021-09-21 14:31:29 +02001809/* parse the "thread" bind keyword */
1810static int bind_parse_thread(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1811{
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001812 char *sep = NULL;
1813 ulong thread = 0;
1814 long tgroup = 0;
Willy Tarreauc8cac042021-09-21 14:31:29 +02001815
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001816 tgroup = strtol(args[cur_arg + 1], &sep, 10);
1817 if (*sep == '/') {
1818 /* a thread group was present */
1819 if (tgroup < 1 || tgroup > MAX_TGROUPS) {
1820 memprintf(err, "'%s' thread-group number must be between 1 and %d (was %ld)", args[cur_arg + 1], MAX_TGROUPS, tgroup);
1821 return ERR_ALERT | ERR_FATAL;
1822 }
1823 sep++;
1824 }
1825 else {
1826 /* no thread group */
1827 tgroup = 0;
1828 sep = args[cur_arg + 1];
1829 }
Willy Tarreauc8cac042021-09-21 14:31:29 +02001830
Willy Tarreau01cac3f2021-10-12 08:47:54 +02001831 if ((conf->bind_tgroup || conf->bind_thread) &&
1832 conf->bind_tgroup != tgroup) {
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001833 memprintf(err, "'%s' multiple thread-groups are not supported", args[cur_arg + 1]);
Willy Tarreauc8cac042021-09-21 14:31:29 +02001834 return ERR_ALERT | ERR_FATAL;
1835 }
Willy Tarreau740038c2022-07-15 17:18:23 +02001836
1837 if (parse_process_number(sep, &thread, LONGBITS, NULL, err)) {
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001838 memprintf(err, "'%s' : %s", sep, *err);
Willy Tarreauc8cac042021-09-21 14:31:29 +02001839 return ERR_ALERT | ERR_FATAL;
1840 }
1841
Willy Tarreau01cac3f2021-10-12 08:47:54 +02001842 conf->bind_thread |= thread;
1843 conf->bind_tgroup = tgroup;
Christopher Fauleta717b992018-04-10 14:43:00 +02001844 return 0;
1845}
1846
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001847/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1848static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
Willy Tarreau01825162021-03-09 09:53:46 +01001849 const struct proxy *defpx, const char *file, int line,
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001850 char **err)
1851{
1852 if (too_many_args(1, args, err, NULL))
1853 return -1;
1854
1855 if (strcmp(args[1], "on") == 0)
1856 global.tune.options |= GTUNE_LISTENER_MQ;
1857 else if (strcmp(args[1], "off") == 0)
1858 global.tune.options &= ~GTUNE_LISTENER_MQ;
1859 else {
1860 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1861 return -1;
1862 }
1863 return 0;
1864}
1865
Willy Tarreau61612d42012-04-19 18:42:05 +02001866/* Note: must not be declared <const> as its list will be overwritten.
1867 * Please take care of keeping this list alphabetically sorted.
1868 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001869static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001870 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1871 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001872 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001873 { /* END */ },
1874}};
1875
Willy Tarreau0108d902018-11-25 19:14:37 +01001876INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1877
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001878/* Note: must not be declared <const> as its list will be overwritten.
1879 * Please take care of keeping this list alphabetically sorted.
1880 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001881static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001882 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001883}};
1884
Willy Tarreau0108d902018-11-25 19:14:37 +01001885INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1886
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001887/* Note: must not be declared <const> as its list will be overwritten.
1888 * Please take care of keeping this list alphabetically sorted, doing so helps
1889 * all code contributors.
1890 * Optional keywords are also declared with a NULL ->parse() function so that
1891 * the config parser can report an appropriate error when a known keyword was
1892 * not enabled.
1893 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001894static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001895 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001896 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1897 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1898 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1899 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1900 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1901 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001902 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001903 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001904 { "shards", bind_parse_shards, 1 }, /* set number of shards */
Willy Tarreauc8cac042021-09-21 14:31:29 +02001905 { "thread", bind_parse_thread, 1 }, /* set list of allowed threads for this socket */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001906 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001907}};
1908
Willy Tarreau0108d902018-11-25 19:14:37 +01001909INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1910
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001911/* config keyword parsers */
1912static struct cfg_kw_list cfg_kws = {ILH, {
1913 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1914 { 0, NULL, NULL }
1915}};
1916
1917INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1918
Willy Tarreau645513a2010-05-24 20:55:15 +02001919/*
1920 * Local variables:
1921 * c-indent-level: 8
1922 * c-basic-offset: 8
1923 * End:
1924 */