blob: 8031c750697d9df076cee387fda23c0aeda884bd [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>
18#include <fcntl.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020019
Willy Tarreaudcc048a2020-06-04 19:11:43 +020020#include <haproxy/acl.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020021#include <haproxy/api.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020022#include <haproxy/cfgparse.h>
Willy Tarreau7ea393d2020-06-04 18:02:10 +020023#include <haproxy/connection.h>
Willy Tarreau8d366972020-05-27 16:10:29 +020024#include <haproxy/errors.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020025#include <haproxy/fd.h>
26#include <haproxy/freq_ctr.h>
Willy Tarreauf268ee82020-06-04 17:05:57 +020027#include <haproxy/global.h>
Willy Tarreau853b2972020-05-27 18:01:47 +020028#include <haproxy/list.h>
Willy Tarreau213e9902020-06-04 14:58:24 +020029#include <haproxy/listener.h>
Willy Tarreauaeed4a82020-06-04 22:01:04 +020030#include <haproxy/log.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020031#include <haproxy/protocol.h>
Willy Tarreau5958c432021-05-08 20:30:37 +020032#include <haproxy/proxy.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020033#include <haproxy/sample.h>
Willy Tarreaudfd3de82020-06-04 23:46:14 +020034#include <haproxy/stream.h>
Willy Tarreaucea0e1b2020-06-04 17:25:40 +020035#include <haproxy/task.h>
Willy Tarreau92b4f132020-06-01 11:05:15 +020036#include <haproxy/time.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020037#include <haproxy/tools.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020038
Willy Tarreaub648d632007-10-28 22:13:50 +010039
Willy Tarreau26982662012-09-12 23:17:10 +020040/* List head of all known bind keywords */
41static struct bind_kw_list bind_keywords = {
42 .list = LIST_HEAD_INIT(bind_keywords.list)
43};
44
Willy Tarreaua1d97f82019-12-10 11:18:41 +010045/* list of the temporarily limited listeners because of lack of resource */
46static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
47static struct task *global_listener_queue_task;
Willy Tarreaua1d97f82019-12-10 11:18:41 +010048
William Dauchy3679d0c2021-02-14 23:22:55 +010049/* listener status for stats */
50const char* li_status_st[LI_STATE_COUNT] = {
51 [LI_STATUS_WAITING] = "WAITING",
52 [LI_STATUS_OPEN] = "OPEN",
53 [LI_STATUS_FULL] = "FULL",
54};
Willy Tarreaua1d97f82019-12-10 11:18:41 +010055
Willy Tarreau1efafce2019-01-27 15:37:19 +010056#if defined(USE_THREAD)
57
58struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
59
60/* dequeue and process a pending connection from the local accept queue (single
Willy Tarreau83efc322020-10-14 17:37:17 +020061 * consumer). Returns the accepted connection or NULL if none was found.
Willy Tarreau1efafce2019-01-27 15:37:19 +010062 */
Willy Tarreau83efc322020-10-14 17:37:17 +020063struct connection *accept_queue_pop_sc(struct accept_queue_ring *ring)
Willy Tarreau1efafce2019-01-27 15:37:19 +010064{
Willy Tarreau1efafce2019-01-27 15:37:19 +010065 unsigned int pos, next;
Willy Tarreau83efc322020-10-14 17:37:17 +020066 struct connection *ptr;
67 struct connection **e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010068
69 pos = ring->head;
70
71 if (pos == ring->tail)
Willy Tarreau83efc322020-10-14 17:37:17 +020072 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010073
74 next = pos + 1;
75 if (next >= ACCEPT_QUEUE_SIZE)
76 next = 0;
77
78 e = &ring->entry[pos];
79
80 /* wait for the producer to update the listener's pointer */
81 while (1) {
Willy Tarreau83efc322020-10-14 17:37:17 +020082 ptr = *e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010083 __ha_barrier_load();
84 if (ptr)
85 break;
86 pl_cpu_relax();
87 }
88
Willy Tarreau1efafce2019-01-27 15:37:19 +010089 /* release the entry */
Willy Tarreau83efc322020-10-14 17:37:17 +020090 *e = NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010091
92 __ha_barrier_store();
93 ring->head = next;
Willy Tarreau83efc322020-10-14 17:37:17 +020094 return ptr;
Willy Tarreau1efafce2019-01-27 15:37:19 +010095}
96
97
Willy Tarreau83efc322020-10-14 17:37:17 +020098/* tries to push a new accepted connection <conn> into ring <ring>. Returns
99 * non-zero if it succeeds, or zero if the ring is full. Supports multiple
100 * producers.
Willy Tarreau1efafce2019-01-27 15:37:19 +0100101 */
Willy Tarreau83efc322020-10-14 17:37:17 +0200102int accept_queue_push_mp(struct accept_queue_ring *ring, struct connection *conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100103{
Willy Tarreau1efafce2019-01-27 15:37:19 +0100104 unsigned int pos, next;
105
106 pos = ring->tail;
107 do {
108 next = pos + 1;
109 if (next >= ACCEPT_QUEUE_SIZE)
110 next = 0;
111 if (next == ring->head)
112 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100113 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100114
Willy Tarreau83efc322020-10-14 17:37:17 +0200115 ring->entry[pos] = conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100116 __ha_barrier_store();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100117 return 1;
118}
119
Willy Tarreaufb5401f2021-01-29 12:25:23 +0100120/* proceed with accepting new connections. Don't mark it static so that it appears
121 * in task dumps.
122 */
Willy Tarreau144f84a2021-03-02 16:09:26 +0100123struct task *accept_queue_process(struct task *t, void *context, unsigned int state)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100124{
125 struct accept_queue_ring *ring = context;
Willy Tarreau83efc322020-10-14 17:37:17 +0200126 struct connection *conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100127 struct listener *li;
Christopher Faulet102854c2019-04-30 12:17:13 +0200128 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100129 int ret;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100130
Christopher Faulet102854c2019-04-30 12:17:13 +0200131 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
132 * is not really illimited, but it is probably enough.
133 */
Willy Tarreau66161322021-02-19 15:50:27 +0100134 max_accept = global.tune.maxaccept ? global.tune.maxaccept : MAX_ACCEPT;
Christopher Faulet102854c2019-04-30 12:17:13 +0200135 for (; max_accept; max_accept--) {
Willy Tarreau83efc322020-10-14 17:37:17 +0200136 conn = accept_queue_pop_sc(ring);
137 if (!conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100138 break;
139
Willy Tarreau83efc322020-10-14 17:37:17 +0200140 li = __objt_listener(conn->target);
Willy Tarreau4781b152021-04-06 13:53:36 +0200141 _HA_ATOMIC_INC(&li->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +0200142 ret = li->accept(conn);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100143 if (ret <= 0) {
144 /* connection was terminated by the application */
145 continue;
146 }
147
148 /* increase the per-process number of cumulated sessions, this
149 * may only be done once l->accept() has accepted the connection.
150 */
151 if (!(li->options & LI_O_UNLIMITED)) {
152 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
153 update_freq_ctr(&global.sess_per_sec, 1));
154 if (li->bind_conf && li->bind_conf->is_ssl) {
155 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
156 update_freq_ctr(&global.ssl_per_sec, 1));
157 }
158 }
159 }
160
161 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200162 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200163 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100164
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200165 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100166}
167
168/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
169static int accept_queue_init()
170{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200171 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100172 int i;
173
174 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200175 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100176 if (!t) {
177 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
178 return ERR_FATAL|ERR_ABORT;
179 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200180 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100181 t->process = accept_queue_process;
182 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200183 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100184 }
185 return 0;
186}
187
188REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
189
190#endif // USE_THREAD
191
William Dauchy3679d0c2021-02-14 23:22:55 +0100192/* helper to get listener status for stats */
193enum li_status get_li_status(struct listener *l)
194{
195 if (!l->maxconn || l->nbconn < l->maxconn) {
196 if (l->state == LI_LIMITED)
197 return LI_STATUS_WAITING;
198 else
199 return LI_STATUS_OPEN;
200 }
201 return LI_STATUS_FULL;
202}
203
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200204/* adjust the listener's state and its proxy's listener counters if needed.
205 * It must be called under the listener's lock, but uses atomic ops to change
206 * the proxy's counters so that the proxy lock is not needed.
207 */
Willy Tarreaua37b2442020-09-24 07:23:45 +0200208void listener_set_state(struct listener *l, enum li_state st)
209{
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200210 struct proxy *px = l->bind_conf->frontend;
211
212 if (px) {
213 /* from state */
214 switch (l->state) {
215 case LI_NEW: /* first call */
Willy Tarreau4781b152021-04-06 13:53:36 +0200216 _HA_ATOMIC_INC(&px->li_all);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200217 break;
218 case LI_INIT:
219 case LI_ASSIGNED:
220 break;
221 case LI_PAUSED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200222 _HA_ATOMIC_DEC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200223 break;
224 case LI_LISTEN:
Willy Tarreau4781b152021-04-06 13:53:36 +0200225 _HA_ATOMIC_DEC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200226 break;
227 case LI_READY:
228 case LI_FULL:
229 case LI_LIMITED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200230 _HA_ATOMIC_DEC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200231 break;
232 }
233
234 /* to state */
235 switch (st) {
236 case LI_NEW:
237 case LI_INIT:
238 case LI_ASSIGNED:
239 break;
240 case LI_PAUSED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200241 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200242 _HA_ATOMIC_INC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200243 break;
244 case LI_LISTEN:
Willy Tarreau95a34602020-10-08 15:32:21 +0200245 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200246 _HA_ATOMIC_INC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200247 break;
248 case LI_READY:
249 case LI_FULL:
250 case LI_LIMITED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200251 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200252 _HA_ATOMIC_INC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200253 break;
254 }
255 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200256 l->state = st;
257}
258
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100259/* This function adds the specified listener's file descriptor to the polling
260 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500261 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200262 * also support binding only the relevant processes to their respective
263 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100264 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200265void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100266{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100267 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200268
269 /* If this listener is supposed to be only in the master, close it in
270 * the workers. Conversely, if it's supposed to be only in the workers
271 * close it in the master.
272 */
Willy Tarreau18c20d22020-10-09 16:11:46 +0200273 if (!!master != !!(listener->rx.flags & RX_F_MWORKER))
Willy Tarreau75c98d12020-10-09 15:55:23 +0200274 do_unbind_listener(listener);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200275
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100276 if (listener->state == LI_LISTEN) {
Willy Tarreau95a34602020-10-08 15:32:21 +0200277 BUG_ON(listener->rx.fd == -1);
William Lallemand095ba4c2017-06-01 17:38:50 +0200278 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau38dba272020-11-04 13:54:00 +0100279 (!!master != !!(listener->rx.flags & RX_F_MWORKER) ||
280 !(proc_mask(listener->rx.settings->bind_proc) & pid_bit))) {
Willy Tarreauae302532014-05-07 19:22:24 +0200281 /* we don't want to enable this listener and don't
282 * want any fd event to reach it.
283 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200284 do_unbind_listener(listener);
Willy Tarreauae302532014-05-07 19:22:24 +0200285 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100286 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200287 listener->rx.proto->enable(listener);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200288 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200289 }
290 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200291 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100292 }
293 }
Willy Tarreaud6afb532020-10-09 10:35:40 +0200294
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100295 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100296}
297
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200298/*
299 * This function completely stops a listener. It will need to operate under the
300 * proxy's lock, the protocol's lock, and the listener's lock. The caller is
301 * responsible for indicating in lpx, lpr, lli whether the respective locks are
302 * already held (non-zero) or not (zero) so that the function picks the missing
303 * ones, in this order. The proxy's listeners count is updated and the proxy is
304 * disabled and woken up after the last one is gone.
305 */
306void stop_listener(struct listener *l, int lpx, int lpr, int lli)
307{
308 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200309
310 if (l->options & LI_O_NOSTOP) {
311 /* master-worker sockpairs are never closed but don't count as a
312 * job.
313 */
314 return;
315 }
316
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200317 if (!lpx)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200318 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200319
320 if (!lpr)
321 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
322
323 if (!lli)
324 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
325
326 if (l->state > LI_INIT) {
Willy Tarreau75c98d12020-10-09 15:55:23 +0200327 do_unbind_listener(l);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200328
329 if (l->state >= LI_ASSIGNED)
330 __delete_listener(l);
331
Willy Tarreauacde1522020-10-07 16:31:39 +0200332 proxy_cond_disable(px);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200333 }
334
335 if (!lli)
336 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
337
338 if (!lpr)
339 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
340
341 if (!lpx)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200342 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200343}
344
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100345/* This function adds the specified <listener> to the protocol <proto>. It
346 * does nothing if the protocol was already added. The listener's state is
347 * automatically updated from LI_INIT to LI_ASSIGNED. The number of listeners
348 * for the protocol is updated. This must be called with the proto lock held.
349 */
350void default_add_listener(struct protocol *proto, struct listener *listener)
351{
352 if (listener->state != LI_INIT)
353 return;
354 listener_set_state(listener, LI_ASSIGNED);
355 listener->rx.proto = proto;
Willy Tarreau2b718102021-04-21 07:32:39 +0200356 LIST_APPEND(&proto->receivers, &listener->rx.proto_list);
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100357 proto->nb_receivers++;
358}
359
Willy Tarreaue03204c2020-10-09 17:02:21 +0200360/* default function called to suspend a listener: it simply passes the call to
361 * the underlying receiver. This is find for most socket-based protocols. This
362 * must be called under the listener's lock. It will return non-zero on success,
363 * 0 on failure. If no receiver-level suspend is provided, the operation is
364 * assumed to succeed.
365 */
366int default_suspend_listener(struct listener *l)
367{
368 int ret = 1;
369
370 if (!l->rx.proto->rx_suspend)
371 return 1;
372
373 ret = l->rx.proto->rx_suspend(&l->rx);
374 return ret > 0 ? ret : 0;
375}
376
377
378/* Tries to resume a suspended listener, and returns non-zero on success or
379 * zero on failure. On certain errors, an alert or a warning might be displayed.
380 * It must be called with the listener's lock held. Depending on the listener's
381 * state and protocol, a listen() call might be used to resume operations, or a
382 * call to the receiver's resume() function might be used as well. This is
383 * suitable as a default function for TCP and UDP. This must be called with the
384 * listener's lock held.
385 */
386int default_resume_listener(struct listener *l)
387{
388 int ret = 1;
389
390 if (l->state == LI_ASSIGNED) {
391 char msg[100];
392 int err;
393
394 err = l->rx.proto->listen(l, msg, sizeof(msg));
395 if (err & ERR_ALERT)
396 ha_alert("Resuming listener: %s\n", msg);
397 else if (err & ERR_WARN)
398 ha_warning("Resuming listener: %s\n", msg);
399
400 if (err & (ERR_FATAL | ERR_ABORT)) {
401 ret = 0;
402 goto end;
403 }
404 }
405
406 if (l->state < LI_PAUSED) {
407 ret = 0;
408 goto end;
409 }
410
411 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
412 l->rx.proto->rx_resume(&l->rx) <= 0)
413 ret = 0;
414 end:
415 return ret;
416}
417
418
Willy Tarreaube58c382011-07-24 18:28:10 +0200419/* This function tries to temporarily disable a listener, depending on the OS
420 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
421 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
422 * closes upon SHUT_WR and refuses to rebind. So a common validation path
423 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
424 * is disabled. It normally returns non-zero, unless an error is reported.
425 */
426int pause_listener(struct listener *l)
427{
Willy Tarreau58651b42020-09-24 16:03:29 +0200428 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200429 int ret = 1;
430
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100431 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200432
Willy Tarreau02e19752020-09-23 17:17:22 +0200433 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
434 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
435 goto end;
436
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200437 if (l->state <= LI_PAUSED)
438 goto end;
439
Willy Tarreaue03204c2020-10-09 17:02:21 +0200440 if (l->rx.proto->suspend)
441 ret = l->rx.proto->suspend(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200442
Willy Tarreau2b718102021-04-21 07:32:39 +0200443 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200444
Willy Tarreaua37b2442020-09-24 07:23:45 +0200445 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200446
447 if (px && !px->li_ready) {
448 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
449 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
450 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200451 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100452 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200453 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200454}
455
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200456/* This function tries to resume a temporarily disabled listener. Paused, full,
457 * limited and disabled listeners are handled, which means that this function
458 * may replace enable_listener(). The resulting state will either be LI_READY
459 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200460 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200461 * foreground mode, and are ignored. If the listener was only in the assigned
462 * state, it's totally rebound. This can happen if a pause() has completely
463 * stopped it. If the resume fails, 0 is returned and an error might be
464 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200465 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100466int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200467{
Willy Tarreau58651b42020-09-24 16:03:29 +0200468 struct proxy *px = l->bind_conf->frontend;
469 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200470 int ret = 1;
471
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100472 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200473
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200474 /* check that another thread didn't to the job in parallel (e.g. at the
475 * end of listen_accept() while we'd come from dequeue_all_listeners().
476 */
Willy Tarreau2b718102021-04-21 07:32:39 +0200477 if (MT_LIST_INLIST(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200478 goto end;
479
William Lallemand095ba4c2017-06-01 17:38:50 +0200480 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200481 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200482 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100483
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200484 if (l->state == LI_READY)
485 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200486
Willy Tarreaue03204c2020-10-09 17:02:21 +0200487 if (l->rx.proto->resume)
488 ret = l->rx.proto->resume(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200489
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100490 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200491 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200492 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200493 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200494 }
495
Willy Tarreau4b51f422020-09-25 20:32:28 +0200496 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200497 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200498
499 done:
500 if (was_paused && !px->li_paused) {
501 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
502 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
503 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200504 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100505 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200506 return ret;
507}
508
Willy Tarreau87b09662015-04-03 00:22:06 +0200509/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200510 * it upon next close() using resume_listener().
511 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200512static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200513{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100514 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200515 if (l->state >= LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200516 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100517 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200518 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200519 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100520 }
Willy Tarreau62793712011-07-24 19:23:38 +0200521 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100522 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200523}
524
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200525/* Marks a ready listener as limited so that we only try to re-enable it when
526 * resources are free again. It will be queued into the specified queue.
527 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200528static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200529{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100530 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200531 if (l->state == LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200532 MT_LIST_TRY_APPEND(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200533 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200534 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200535 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100536 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200537}
538
Willy Tarreau241797a2019-12-10 14:10:52 +0100539/* Dequeues all listeners waiting for a resource the global wait queue */
540void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200541{
Willy Tarreau01abd022019-02-28 10:27:18 +0100542 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200543
Willy Tarreau241797a2019-12-10 14:10:52 +0100544 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200545 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100546 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200547 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100548 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200549 }
550}
551
Willy Tarreau241797a2019-12-10 14:10:52 +0100552/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
553void dequeue_proxy_listeners(struct proxy *px)
554{
555 struct listener *listener;
556
557 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
558 /* This cannot fail because the listeners are by definition in
559 * the LI_LIMITED state.
560 */
561 resume_listener(listener);
562 }
563}
564
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200565
566/* default function used to unbind a listener. This is for use by standard
567 * protocols working on top of accepted sockets. The receiver's rx_unbind()
568 * will automatically be used after the listener is disabled if the socket is
569 * still bound. This must be used under the listener's lock.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100570 */
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200571void default_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100572{
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200573 if (listener->state <= LI_ASSIGNED)
574 goto out_close;
575
576 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200577 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200578 goto out_close;
579 }
580
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200581 if (listener->state >= LI_READY) {
582 listener->rx.proto->disable(listener);
583 if (listener->rx.flags & RX_F_BOUND)
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200584 listener_set_state(listener, LI_LISTEN);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200585 }
586
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200587 out_close:
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200588 if (listener->rx.flags & RX_F_BOUND)
589 listener->rx.proto->rx_unbind(&listener->rx);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200590}
591
592/* This function closes the listening socket for the specified listener,
593 * provided that it's already in a listening state. The protocol's unbind()
594 * is called to put the listener into LI_ASSIGNED or LI_LISTEN and handle
595 * the unbinding tasks. The listener enters then the LI_ASSIGNED state if
596 * the receiver is unbound. Must be called with the lock held.
597 */
598void do_unbind_listener(struct listener *listener)
599{
Willy Tarreau2b718102021-04-21 07:32:39 +0200600 MT_LIST_DELETE(&listener->wait_queue);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200601
602 if (listener->rx.proto->unbind)
603 listener->rx.proto->unbind(listener);
Willy Tarreau374e9af2020-10-09 15:47:17 +0200604
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200605 /* we may have to downgrade the listener if the rx was closed */
606 if (!(listener->rx.flags & RX_F_BOUND) && listener->state > LI_ASSIGNED)
Willy Tarreau374e9af2020-10-09 15:47:17 +0200607 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100608}
609
Olivier Houchard1fc05162017-04-06 01:05:05 +0200610/* This function closes the listening socket for the specified listener,
611 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200612 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
613 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100614 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200615 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100616void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200617{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100618 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200619 do_unbind_listener(listener);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100620 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200621}
622
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200623/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
624 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200625 * allocation). The address family is taken from ss->ss_family, and the protocol
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200626 * passed in <proto> must be usable on this family. The protocol's default iocb
627 * is automatically preset as the receivers' iocb. The number of jobs and
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200628 * listeners is automatically increased by the number of listeners created. It
629 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200630 */
631int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200632 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200633{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200634 struct listener *l;
635 int port;
636
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200637 for (port = portl; port <= porth; port++) {
638 l = calloc(1, sizeof(*l));
639 if (!l) {
640 memprintf(err, "out of memory");
641 return 0;
642 }
643 l->obj_type = OBJ_TYPE_LISTENER;
Willy Tarreau2b718102021-04-21 07:32:39 +0200644 LIST_APPEND(&bc->frontend->conf.listeners, &l->by_fe);
645 LIST_APPEND(&bc->listeners, &l->by_bind);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200646 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200647 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200648 l->rx.owner = l;
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200649 l->rx.iocb = proto->default_iocb;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200650 l->rx.fd = fd;
Willy Tarreau07400c52020-12-04 14:49:11 +0100651
Willy Tarreau37159062020-08-27 07:48:42 +0200652 memcpy(&l->rx.addr, ss, sizeof(*ss));
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100653 if (proto->fam->set_port)
654 proto->fam->set_port(&l->rx.addr, port);
Willy Tarreau07400c52020-12-04 14:49:11 +0100655
Olivier Houchard859dc802019-08-08 15:47:21 +0200656 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200657 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200658
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100659 proto->add(proto, l);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200660
Willy Tarreau909c23b2020-09-15 13:50:58 +0200661 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200662 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100663
Amaury Denoyelle7f8f6cb2020-11-10 14:24:31 +0100664 l->extra_counters = NULL;
665
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100666 HA_SPIN_INIT(&l->lock);
Willy Tarreau4781b152021-04-06 13:53:36 +0200667 _HA_ATOMIC_INC(&jobs);
668 _HA_ATOMIC_INC(&listeners);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200669 }
670 return 1;
671}
672
Willy Tarreau1a64d162007-10-28 22:26:05 +0100673/* Delete a listener from its protocol's list of listeners. The listener's
674 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200675 * number of listeners is updated, as well as the global number of listeners
676 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200677 * is a low-level function expected to be called with the proto_lock and the
678 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100679 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200680void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100681{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100682 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200683 listener_set_state(listener, LI_INIT);
Willy Tarreau2b718102021-04-21 07:32:39 +0200684 LIST_DELETE(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200685 listener->rx.proto->nb_receivers--;
Willy Tarreau4781b152021-04-06 13:53:36 +0200686 _HA_ATOMIC_DEC(&jobs);
687 _HA_ATOMIC_DEC(&listeners);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100688 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200689}
690
691/* Delete a listener from its protocol's list of listeners (please check
692 * __delete_listener() above). The proto_lock and the listener's lock will
693 * be grabbed in this order.
694 */
695void delete_listener(struct listener *listener)
696{
697 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
698 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
699 __delete_listener(listener);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100700 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200701 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100702}
703
Willy Tarreaue2711c72019-02-27 15:39:41 +0100704/* Returns a suitable value for a listener's backlog. It uses the listener's,
705 * otherwise the frontend's backlog, otherwise the listener's maxconn,
706 * otherwise the frontend's maxconn, otherwise 1024.
707 */
708int listener_backlog(const struct listener *l)
709{
710 if (l->backlog)
711 return l->backlog;
712
713 if (l->bind_conf->frontend->backlog)
714 return l->bind_conf->frontend->backlog;
715
716 if (l->maxconn)
717 return l->maxconn;
718
719 if (l->bind_conf->frontend->maxconn)
720 return l->bind_conf->frontend->maxconn;
721
722 return 1024;
723}
724
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200725/* This function is called on a read event from a listening socket, corresponding
726 * to an accept. It tries to accept as many connections as possible, and for each
727 * calls the listener's accept handler (generally the frontend's accept handler).
728 */
Willy Tarreaua74cb382020-10-15 21:29:49 +0200729void listener_accept(struct listener *l)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200730{
Willy Tarreau83efc322020-10-14 17:37:17 +0200731 struct connection *cli_conn;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100732 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200733 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100734 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100735 int next_feconn = 0;
736 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200737 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200738 int ret;
739
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100740 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200741
742 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
743 * illimited, but it is probably enough.
744 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100745 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200746
Willy Tarreau93e7c002013-10-07 18:51:07 +0200747 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
748 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200749
750 if (unlikely(!max)) {
751 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200752 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100753 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200754 }
755
756 if (max_accept > max)
757 max_accept = max;
758 }
759
760 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200761 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
762
763 if (unlikely(!max)) {
764 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200765 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100766 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200767 }
768
769 if (max_accept > max)
770 max_accept = max;
771 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200772#ifdef USE_OPENSSL
773 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
774 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200775
Willy Tarreaue43d5322013-10-07 20:01:52 +0200776 if (unlikely(!max)) {
777 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200778 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100779 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200780 }
781
782 if (max_accept > max)
783 max_accept = max;
784 }
785#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200786 if (p && p->fe_sps_lim) {
787 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
788
789 if (unlikely(!max)) {
790 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100791 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
792 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200793 }
794
795 if (max_accept > max)
796 max_accept = max;
797 }
798
799 /* Note: if we fail to allocate a connection because of configured
800 * limits, we'll schedule a new attempt worst 1 second later in the
801 * worst case. If we fail due to system limits or temporary resource
802 * shortage, we try again 100ms later in the worst case.
803 */
Willy Tarreau02757d02021-01-28 18:07:24 +0100804 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200805 unsigned int count;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200806 int status;
Willy Tarreau0aa5a5b2020-10-16 17:43:04 +0200807 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200808
Willy Tarreau82c97892019-02-27 19:32:32 +0100809 /* pre-increase the number of connections without going too far.
810 * We process the listener, then the proxy, then the process.
811 * We know which ones to unroll based on the next_xxx value.
812 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100813 do {
814 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100815 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100816 /* the listener was marked full or another
817 * thread is going to do it.
818 */
819 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100820 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100821 goto end;
822 }
823 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000824 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100825
Willy Tarreau82c97892019-02-27 19:32:32 +0100826 if (p) {
827 do {
828 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100829 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100830 /* the frontend was marked full or another
831 * thread is going to do it.
832 */
833 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100834 expire = TICK_ETERNITY;
835 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100836 }
837 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100838 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200839 }
840
Willy Tarreau82c97892019-02-27 19:32:32 +0100841 if (!(l->options & LI_O_UNLIMITED)) {
842 do {
843 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100844 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100845 /* the process was marked full or another
846 * thread is going to do it.
847 */
848 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100849 expire = tick_add(now_ms, 1000); /* try again in 1 second */
850 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100851 }
852 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000853 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200854 }
855
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200856 cli_conn = l->rx.proto->accept_conn(l, &status);
857 if (!cli_conn) {
858 switch (status) {
859 case CO_AC_DONE:
860 goto end;
Willy Tarreau818dca52014-01-31 19:40:19 +0100861
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200862 case CO_AC_RETRY: /* likely a signal */
Willy Tarreau4781b152021-04-06 13:53:36 +0200863 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100864 if (p)
Willy Tarreau4781b152021-04-06 13:53:36 +0200865 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100866 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +0200867 _HA_ATOMIC_DEC(&actconn);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100868 continue;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200869
870 case CO_AC_YIELD:
Willy Tarreau92079932019-12-10 09:30:05 +0100871 max_accept = 0;
872 goto end;
William Lallemandd9138002018-11-27 12:02:39 +0100873
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200874 default:
875 goto transient_error;
Willy Tarreau83efc322020-10-14 17:37:17 +0200876 }
877 }
878
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100879 /* The connection was accepted, it must be counted as such */
880 if (l->counters)
881 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
882
Willy Tarreau82c97892019-02-27 19:32:32 +0100883 if (p)
884 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
885
886 proxy_inc_fe_conn_ctr(l, p);
887
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100888 if (!(l->options & LI_O_UNLIMITED)) {
889 count = update_freq_ctr(&global.conn_per_sec, 1);
890 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100891 }
892
Willy Tarreau4781b152021-04-06 13:53:36 +0200893 _HA_ATOMIC_INC(&activity[tid].accepted);
Willy Tarreau64a9c052019-04-12 15:27:17 +0200894
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200895 if (unlikely(cli_conn->handle.fd >= global.maxsock)) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200896 send_log(p, LOG_EMERG,
897 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
898 p->id);
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200899 close(cli_conn->handle.fd);
William Dauchy835712a2020-10-18 18:37:43 +0200900 conn_free(cli_conn);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100901 expire = tick_add(now_ms, 1000); /* try again in 1 second */
902 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200903 }
904
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100905 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100906 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
907 * allows the error path not to rollback on nbconn. It's more
908 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100909 */
910 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100911 next_feconn = 0;
912 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200913
Willy Tarreau83efc322020-10-14 17:37:17 +0200914
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100915#if defined(USE_THREAD)
Willy Tarreau818a92e2020-09-03 07:50:19 +0200916 mask = thread_mask(l->rx.settings->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100917 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100918 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100919 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100920
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100921 /* The principle is that we have two running indexes,
922 * each visiting in turn all threads bound to this
923 * listener. The connection will be assigned to the one
924 * with the least connections, and the other one will
925 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100926 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100927 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100928 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100929
930 /* keep a copy for the final update. thr_idx is composite
931 * and made of (t2<<16) + t1.
932 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100933 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100934 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100935 unsigned long m1, m2;
936 int q1, q2;
937
938 t2 = t1 = t0;
939 t2 >>= 16;
940 t1 &= 0xFFFF;
941
942 /* t1 walks low to high bits ;
943 * t2 walks high to low.
944 */
945 m1 = mask >> t1;
946 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
947
Willy Tarreau85d04242019-04-16 18:09:13 +0200948 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100949 m1 &= ~1UL;
950 if (!m1) {
951 m1 = mask;
952 t1 = 0;
953 }
954 t1 += my_ffsl(m1) - 1;
955 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100956
Willy Tarreau85d04242019-04-16 18:09:13 +0200957 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
958 /* highest bit not set */
959 if (!m2)
960 m2 = mask;
961
962 t2 = my_flsl(m2) - 1;
963 }
964
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100965 /* now we have two distinct thread IDs belonging to the mask */
966 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
967 if (q1 >= ACCEPT_QUEUE_SIZE)
968 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100969
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100970 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
971 if (q2 >= ACCEPT_QUEUE_SIZE)
972 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100973
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100974 /* we have 3 possibilities now :
975 * q1 < q2 : t1 is less loaded than t2, so we pick it
976 * and update t2 (since t1 might still be
977 * lower than another thread)
978 * q1 > q2 : t2 is less loaded than t1, so we pick it
979 * and update t1 (since t2 might still be
980 * lower than another thread)
981 * q1 = q2 : both are equally loaded, thus we pick t1
982 * and update t1 as it will become more loaded
983 * than t2.
984 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100985
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100986 q1 += l->thr_conn[t1];
987 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100988
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100989 if (q1 - q2 < 0) {
990 t = t1;
991 t2 = t2 ? t2 - 1 : LONGBITS - 1;
992 }
993 else if (q1 - q2 > 0) {
994 t = t2;
995 t1++;
996 if (t1 >= LONGBITS)
997 t1 = 0;
998 }
999 else {
1000 t = t1;
1001 t1++;
1002 if (t1 >= LONGBITS)
1003 t1 = 0;
1004 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001005
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001006 /* new value for thr_idx */
1007 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001008 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001009
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001010 /* We successfully selected the best thread "t" for this
1011 * connection. We use deferred accepts even if it's the
1012 * local thread because tests show that it's the best
1013 * performing model, likely due to better cache locality
1014 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001015 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001016 ring = &accept_queue_rings[t];
Willy Tarreau83efc322020-10-14 17:37:17 +02001017 if (accept_queue_push_mp(ring, cli_conn)) {
Willy Tarreau4781b152021-04-06 13:53:36 +02001018 _HA_ATOMIC_INC(&activity[t].accq_pushed);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001019 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001020 continue;
1021 }
1022 /* If the ring is full we do a synchronous accept on
1023 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001024 */
Willy Tarreau4781b152021-04-06 13:53:36 +02001025 _HA_ATOMIC_INC(&activity[t].accq_full);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001026 }
1027#endif // USE_THREAD
1028
Willy Tarreau4781b152021-04-06 13:53:36 +02001029 _HA_ATOMIC_INC(&l->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +02001030 ret = l->accept(cli_conn);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001031 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001032 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001033 * we just have to ignore it (ret == 0) or it's a critical
1034 * error due to a resource shortage, and we must stop the
1035 * listener (ret < 0).
1036 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001037 if (ret == 0) /* successful termination */
1038 continue;
1039
Willy Tarreaubb660302014-05-07 19:47:02 +02001040 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001041 }
1042
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001043 /* increase the per-process number of cumulated sessions, this
1044 * may only be done once l->accept() has accepted the connection.
1045 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001046 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001047 count = update_freq_ctr(&global.sess_per_sec, 1);
1048 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001049 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001050#ifdef USE_OPENSSL
1051 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001052 count = update_freq_ctr(&global.ssl_per_sec, 1);
1053 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001054 }
1055#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001056
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001057 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001058 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001059
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001060 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001061 if (next_conn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001062 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001063
Willy Tarreau82c97892019-02-27 19:32:32 +01001064 if (p && next_feconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001065 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001066
1067 if (next_actconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001068 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001069
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001070 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau02757d02021-01-28 18:07:24 +01001071 (l->state == LI_LIMITED &&
Willy Tarreaucdcba112019-12-11 15:06:30 +01001072 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1073 (!tick_isset(global_listener_queue_task->expire) ||
1074 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001075 /* at least one thread has to this when quitting */
1076 resume_listener(l);
1077
Willy Tarreau02757d02021-01-28 18:07:24 +01001078 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001079 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001080
Olivier Houchard859dc802019-08-08 15:47:21 +02001081 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001082 (!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 +01001083 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001084 }
Willy Tarreau0591bf72019-12-10 12:01:21 +01001085 return;
1086
1087 transient_error:
1088 /* pause the listener for up to 100 ms */
1089 expire = tick_add(now_ms, 100);
1090
Willy Tarreau258b3512020-10-13 17:46:05 +02001091 /* This may be a shared socket that was paused by another process.
1092 * Let's put it to pause in this case.
1093 */
1094 if (l->rx.proto && l->rx.proto->rx_listening(&l->rx) == 0) {
1095 pause_listener(l);
1096 goto end;
1097 }
1098
Willy Tarreau0591bf72019-12-10 12:01:21 +01001099 limit_global:
1100 /* (re-)queue the listener to the global queue and set it to expire no
1101 * later than <expire> ahead. The listener turns to LI_LIMITED.
1102 */
1103 limit_listener(l, &global_listener_queue);
1104 task_schedule(global_listener_queue_task, expire);
1105 goto end;
1106
1107 limit_proxy:
1108 /* (re-)queue the listener to the proxy's queue and set it to expire no
1109 * later than <expire> ahead. The listener turns to LI_LIMITED.
1110 */
1111 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001112 if (p->task && tick_isset(expire))
1113 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001114 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001115}
1116
Willy Tarreau05f50472017-09-15 09:19:58 +02001117/* Notify the listener that a connection initiated from it was released. This
1118 * is used to keep the connection count consistent and to possibly re-open
1119 * listening when it was limited.
1120 */
1121void listener_release(struct listener *l)
1122{
1123 struct proxy *fe = l->bind_conf->frontend;
1124
1125 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +02001126 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001127 if (fe)
Willy Tarreau4781b152021-04-06 13:53:36 +02001128 _HA_ATOMIC_DEC(&fe->feconn);
1129 _HA_ATOMIC_DEC(&l->nbconn);
1130 _HA_ATOMIC_DEC(&l->thr_conn[tid]);
Willy Tarreau82c97892019-02-27 19:32:32 +01001131
1132 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001133 resume_listener(l);
1134
Willy Tarreau02757d02021-01-28 18:07:24 +01001135 /* Dequeues all of the listeners waiting for a resource */
1136 dequeue_all_listeners();
1137
Olivier Houchard859dc802019-08-08 15:47:21 +02001138 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001139 (!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 +01001140 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001141}
1142
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001143/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1144static int listener_queue_init()
1145{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001146 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1147 if (!global_listener_queue_task) {
1148 ha_alert("Out of memory when initializing global listener queue\n");
1149 return ERR_FATAL|ERR_ABORT;
1150 }
1151 /* very simple initialization, users will queue the task if needed */
1152 global_listener_queue_task->context = NULL; /* not even a context! */
1153 global_listener_queue_task->process = manage_global_listener_queue;
1154
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001155 return 0;
1156}
1157
1158static void listener_queue_deinit()
1159{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001160 task_destroy(global_listener_queue_task);
1161 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001162}
1163
1164REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1165REGISTER_POST_DEINIT(listener_queue_deinit);
1166
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001167
1168/* This is the global management task for listeners. It enables listeners waiting
1169 * for global resources when there are enough free resource, or at least once in
Willy Tarreaud597ec22021-01-29 14:29:06 +01001170 * a while. It is designed to be called as a task. It's exported so that it's easy
1171 * to spot in "show tasks" or "show profiling".
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001172 */
Willy Tarreau144f84a2021-03-02 16:09:26 +01001173struct task *manage_global_listener_queue(struct task *t, void *context, unsigned int state)
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001174{
1175 /* If there are still too many concurrent connections, let's wait for
1176 * some of them to go away. We don't need to re-arm the timer because
1177 * each of them will scan the queue anyway.
1178 */
1179 if (unlikely(actconn >= global.maxconn))
1180 goto out;
1181
1182 /* We should periodically try to enable listeners waiting for a global
1183 * resource here, because it is possible, though very unlikely, that
1184 * they have been blocked by a temporary lack of global resource such
1185 * as a file descriptor or memory and that the temporary condition has
1186 * disappeared.
1187 */
1188 dequeue_all_listeners();
1189
1190 out:
1191 t->expire = TICK_ETERNITY;
1192 task_queue(t);
1193 return t;
1194}
1195
Willy Tarreau26982662012-09-12 23:17:10 +02001196/*
1197 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1198 * parsing sessions.
1199 */
1200void bind_register_keywords(struct bind_kw_list *kwl)
1201{
Willy Tarreau2b718102021-04-21 07:32:39 +02001202 LIST_APPEND(&bind_keywords.list, &kwl->list);
Willy Tarreau26982662012-09-12 23:17:10 +02001203}
1204
1205/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1206 * keyword is found with a NULL ->parse() function, then an attempt is made to
1207 * find one with a valid ->parse() function. This way it is possible to declare
1208 * platform-dependant, known keywords as NULL, then only declare them as valid
1209 * if some options are met. Note that if the requested keyword contains an
1210 * opening parenthesis, everything from this point is ignored.
1211 */
1212struct bind_kw *bind_find_kw(const char *kw)
1213{
1214 int index;
1215 const char *kwend;
1216 struct bind_kw_list *kwl;
1217 struct bind_kw *ret = NULL;
1218
1219 kwend = strchr(kw, '(');
1220 if (!kwend)
1221 kwend = kw + strlen(kw);
1222
1223 list_for_each_entry(kwl, &bind_keywords.list, list) {
1224 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1225 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1226 kwl->kw[index].kw[kwend-kw] == 0) {
1227 if (kwl->kw[index].parse)
1228 return &kwl->kw[index]; /* found it !*/
1229 else
1230 ret = &kwl->kw[index]; /* may be OK */
1231 }
1232 }
1233 }
1234 return ret;
1235}
1236
Willy Tarreau8638f482012-09-18 18:01:17 +02001237/* Dumps all registered "bind" keywords to the <out> string pointer. The
1238 * unsupported keywords are only dumped if their supported form was not
1239 * found.
1240 */
1241void bind_dump_kws(char **out)
1242{
1243 struct bind_kw_list *kwl;
1244 int index;
1245
Christopher Faulet784063e2020-05-18 12:14:18 +02001246 if (!out)
1247 return;
1248
Willy Tarreau8638f482012-09-18 18:01:17 +02001249 *out = NULL;
1250 list_for_each_entry(kwl, &bind_keywords.list, list) {
1251 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1252 if (kwl->kw[index].parse ||
1253 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001254 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1255 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001256 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001257 kwl->kw[index].skip ? " <arg>" : "",
1258 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001259 }
1260 }
1261 }
1262}
1263
Willy Tarreau433b05f2021-03-12 10:14:07 +01001264/* Try to find in srv_keyword the word that looks closest to <word> by counting
1265 * transitions between letters, digits and other characters. Will return the
1266 * best matching word if found, otherwise NULL.
1267 */
1268const char *bind_find_best_kw(const char *word)
1269{
1270 uint8_t word_sig[1024];
1271 uint8_t list_sig[1024];
1272 const struct bind_kw_list *kwl;
1273 const char *best_ptr = NULL;
1274 int dist, best_dist = INT_MAX;
1275 int index;
1276
1277 make_word_fingerprint(word_sig, word);
1278 list_for_each_entry(kwl, &bind_keywords.list, list) {
1279 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1280 make_word_fingerprint(list_sig, kwl->kw[index].kw);
1281 dist = word_fingerprint_distance(word_sig, list_sig);
1282 if (dist < best_dist) {
1283 best_dist = dist;
1284 best_ptr = kwl->kw[index].kw;
1285 }
1286 }
1287 }
1288
1289 if (best_dist > 2 * strlen(word) || (best_ptr && best_dist > 2 * strlen(best_ptr)))
1290 best_ptr = NULL;
1291
1292 return best_ptr;
1293}
1294
Willy Tarreau645513a2010-05-24 20:55:15 +02001295/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001296/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001297/************************************************************************/
1298
Willy Tarreaua5e37562011-12-16 17:06:15 +01001299/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001300static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001301smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001302{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001303 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001304 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001305 return 1;
1306}
1307
Willy Tarreaua5e37562011-12-16 17:06:15 +01001308/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001309static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001310smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001311{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001312 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001313 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001314 return 1;
1315}
Jerome Magnineb421b22020-03-27 22:08:40 +01001316static int
1317smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1318{
1319 smp->data.u.str.area = smp->sess->listener->name;
1320 if (!smp->data.u.str.area)
1321 return 0;
1322
1323 smp->data.type = SMP_T_STR;
1324 smp->flags = SMP_F_CONST;
1325 smp->data.u.str.data = strlen(smp->data.u.str.area);
1326 return 1;
1327}
Willy Tarreau645513a2010-05-24 20:55:15 +02001328
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001329/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001330static 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 +02001331{
1332 struct listener *l;
1333
Willy Tarreau4348fad2012-09-20 16:48:07 +02001334 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001335 l->options |= LI_O_ACC_PROXY;
1336
1337 return 0;
1338}
1339
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001340/* parse the "accept-netscaler-cip" bind keyword */
1341static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1342{
1343 struct listener *l;
1344 uint32_t val;
1345
1346 if (!*args[cur_arg + 1]) {
1347 memprintf(err, "'%s' : missing value", args[cur_arg]);
1348 return ERR_ALERT | ERR_FATAL;
1349 }
1350
1351 val = atol(args[cur_arg + 1]);
1352 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001353 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001354 return ERR_ALERT | ERR_FATAL;
1355 }
1356
1357 list_for_each_entry(l, &conf->listeners, by_bind) {
1358 l->options |= LI_O_ACC_CIP;
1359 conf->ns_cip_magic = val;
1360 }
1361
1362 return 0;
1363}
1364
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001365/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001366static 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 +02001367{
1368 struct listener *l;
1369 int val;
1370
1371 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001372 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001373 return ERR_ALERT | ERR_FATAL;
1374 }
1375
1376 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001377 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001378 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001379 return ERR_ALERT | ERR_FATAL;
1380 }
1381
Willy Tarreau4348fad2012-09-20 16:48:07 +02001382 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001383 l->backlog = val;
1384
1385 return 0;
1386}
1387
1388/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001389static 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 +02001390{
1391 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001392 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001393 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001394
Willy Tarreau4348fad2012-09-20 16:48:07 +02001395 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001396 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001397 return ERR_ALERT | ERR_FATAL;
1398 }
1399
1400 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001401 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001402 return ERR_ALERT | ERR_FATAL;
1403 }
1404
Willy Tarreau4348fad2012-09-20 16:48:07 +02001405 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001406 new->luid = strtol(args[cur_arg + 1], &error, 10);
1407 if (*error != '\0') {
1408 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1409 return ERR_ALERT | ERR_FATAL;
1410 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001411 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001412
Willy Tarreau4348fad2012-09-20 16:48:07 +02001413 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001414 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001415 return ERR_ALERT | ERR_FATAL;
1416 }
1417
Willy Tarreau4348fad2012-09-20 16:48:07 +02001418 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001419 if (node) {
1420 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001421 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1422 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1423 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001424 return ERR_ALERT | ERR_FATAL;
1425 }
1426
Willy Tarreau4348fad2012-09-20 16:48:07 +02001427 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001428 return 0;
1429}
1430
1431/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001432static 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 +02001433{
1434 struct listener *l;
1435 int val;
1436
1437 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001438 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001439 return ERR_ALERT | ERR_FATAL;
1440 }
1441
1442 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001443 if (val < 0) {
1444 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001445 return ERR_ALERT | ERR_FATAL;
1446 }
1447
Willy Tarreau4348fad2012-09-20 16:48:07 +02001448 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001449 l->maxconn = val;
1450
1451 return 0;
1452}
1453
1454/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001455static 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 +02001456{
1457 struct listener *l;
1458
1459 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001460 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001461 return ERR_ALERT | ERR_FATAL;
1462 }
1463
Willy Tarreau4348fad2012-09-20 16:48:07 +02001464 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001465 l->name = strdup(args[cur_arg + 1]);
1466
1467 return 0;
1468}
1469
1470/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001471static 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 +02001472{
1473 struct listener *l;
1474 int val;
1475
1476 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001477 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001478 return ERR_ALERT | ERR_FATAL;
1479 }
1480
1481 val = atol(args[cur_arg + 1]);
1482 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001483 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001484 return ERR_ALERT | ERR_FATAL;
1485 }
1486
Willy Tarreau4348fad2012-09-20 16:48:07 +02001487 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001488 l->nice = val;
1489
1490 return 0;
1491}
1492
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001493/* parse the "process" bind keyword */
1494static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1495{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001496 char *slash;
1497 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001498
Christopher Fauletc644fa92017-11-23 22:44:11 +01001499 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1500 *slash = 0;
1501
Willy Tarreauff9c9142019-02-07 10:39:36 +01001502 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001503 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001504 return ERR_ALERT | ERR_FATAL;
1505 }
1506
Christopher Fauletc644fa92017-11-23 22:44:11 +01001507 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001508 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001509 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1510 return ERR_ALERT | ERR_FATAL;
1511 }
1512 *slash = '/';
1513 }
1514
Willy Tarreaue26993c2020-09-03 07:18:55 +02001515 conf->settings.bind_proc |= proc;
1516 conf->settings.bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001517 return 0;
1518}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001519
Christopher Fauleta717b992018-04-10 14:43:00 +02001520/* parse the "proto" bind keyword */
1521static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1522{
1523 struct ist proto;
1524
1525 if (!*args[cur_arg + 1]) {
1526 memprintf(err, "'%s' : missing value", args[cur_arg]);
1527 return ERR_ALERT | ERR_FATAL;
1528 }
1529
Tim Duesterhusdcf753a2021-03-04 17:31:47 +01001530 proto = ist(args[cur_arg + 1]);
Christopher Fauleta717b992018-04-10 14:43:00 +02001531 conf->mux_proto = get_mux_proto(proto);
1532 if (!conf->mux_proto) {
1533 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1534 return ERR_ALERT | ERR_FATAL;
1535 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001536 return 0;
1537}
1538
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001539/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1540static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
Willy Tarreau01825162021-03-09 09:53:46 +01001541 const struct proxy *defpx, const char *file, int line,
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001542 char **err)
1543{
1544 if (too_many_args(1, args, err, NULL))
1545 return -1;
1546
1547 if (strcmp(args[1], "on") == 0)
1548 global.tune.options |= GTUNE_LISTENER_MQ;
1549 else if (strcmp(args[1], "off") == 0)
1550 global.tune.options &= ~GTUNE_LISTENER_MQ;
1551 else {
1552 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1553 return -1;
1554 }
1555 return 0;
1556}
1557
Willy Tarreau61612d42012-04-19 18:42:05 +02001558/* Note: must not be declared <const> as its list will be overwritten.
1559 * Please take care of keeping this list alphabetically sorted.
1560 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001561static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001562 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1563 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001564 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001565 { /* END */ },
1566}};
1567
Willy Tarreau0108d902018-11-25 19:14:37 +01001568INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1569
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001570/* Note: must not be declared <const> as its list will be overwritten.
1571 * Please take care of keeping this list alphabetically sorted.
1572 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001573static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001574 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001575}};
1576
Willy Tarreau0108d902018-11-25 19:14:37 +01001577INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1578
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001579/* Note: must not be declared <const> as its list will be overwritten.
1580 * Please take care of keeping this list alphabetically sorted, doing so helps
1581 * all code contributors.
1582 * Optional keywords are also declared with a NULL ->parse() function so that
1583 * the config parser can report an appropriate error when a known keyword was
1584 * not enabled.
1585 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001586static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001587 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001588 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1589 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1590 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1591 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1592 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1593 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001594 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001595 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001596 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001597}};
1598
Willy Tarreau0108d902018-11-25 19:14:37 +01001599INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1600
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001601/* config keyword parsers */
1602static struct cfg_kw_list cfg_kws = {ILH, {
1603 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1604 { 0, NULL, NULL }
1605}};
1606
1607INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1608
Willy Tarreau645513a2010-05-24 20:55:15 +02001609/*
1610 * Local variables:
1611 * c-indent-level: 8
1612 * c-basic-offset: 8
1613 * End:
1614 */