blob: 3e305c73a95ef0eba5498d0e04781d036730730a [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 Tarreau44489252014-01-14 17:52:01 +010013#define _GNU_SOURCE
Willy Tarreau6ae1ba62014-05-07 19:01:58 +020014#include <ctype.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020015#include <errno.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020016#include <stdio.h>
17#include <string.h>
Willy Tarreau95ccdde2014-02-01 09:28:36 +010018#include <unistd.h>
19#include <fcntl.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020020
Willy Tarreaudcc048a2020-06-04 19:11:43 +020021#include <haproxy/acl.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020022#include <haproxy/api.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020023#include <haproxy/cfgparse.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/proto_sockpair.h>
33#include <haproxy/protocol-t.h>
34#include <haproxy/protocol.h>
35#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 Tarreau92b4f132020-06-01 11:05:15 +020038#include <haproxy/time.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 */
43static struct bind_kw_list bind_keywords = {
44 .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;
50static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state);
51
52
Willy Tarreau1efafce2019-01-27 15:37:19 +010053#if defined(USE_THREAD)
54
55struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
56
57/* dequeue and process a pending connection from the local accept queue (single
58 * consumer). Returns the accepted fd or -1 if none was found. The listener is
59 * placed into *li. The address is copied into *addr for no more than *addr_len
60 * bytes, and the address length is returned into *addr_len.
61 */
62int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
63{
64 struct accept_queue_entry *e;
65 unsigned int pos, next;
66 struct listener *ptr;
67 int len;
68 int fd;
69
70 pos = ring->head;
71
72 if (pos == ring->tail)
73 return -1;
74
75 next = pos + 1;
76 if (next >= ACCEPT_QUEUE_SIZE)
77 next = 0;
78
79 e = &ring->entry[pos];
80
81 /* wait for the producer to update the listener's pointer */
82 while (1) {
83 ptr = e->listener;
84 __ha_barrier_load();
85 if (ptr)
86 break;
87 pl_cpu_relax();
88 }
89
90 fd = e->fd;
91 len = e->addr_len;
92 if (len > *addr_len)
93 len = *addr_len;
94
95 if (likely(len > 0))
96 memcpy(addr, &e->addr, len);
97
98 /* release the entry */
99 e->listener = NULL;
100
101 __ha_barrier_store();
102 ring->head = next;
103
104 *addr_len = len;
105 *li = ptr;
106
107 return fd;
108}
109
110
111/* tries to push a new accepted connection <fd> into ring <ring> for listener
112 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
113 * succeeds, or zero if the ring is full. Supports multiple producers.
114 */
115int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
116 struct listener *li, const void *addr, int addr_len)
117{
118 struct accept_queue_entry *e;
119 unsigned int pos, next;
120
121 pos = ring->tail;
122 do {
123 next = pos + 1;
124 if (next >= ACCEPT_QUEUE_SIZE)
125 next = 0;
126 if (next == ring->head)
127 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100128 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100129
130
131 e = &ring->entry[pos];
132
133 if (addr_len > sizeof(e->addr))
134 addr_len = sizeof(e->addr);
135
136 if (addr_len)
137 memcpy(&e->addr, addr, addr_len);
138
139 e->addr_len = addr_len;
140 e->fd = fd;
141
142 __ha_barrier_store();
143 /* now commit the change */
144
145 e->listener = li;
146 return 1;
147}
148
149/* proceed with accepting new connections */
150static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
151{
152 struct accept_queue_ring *ring = context;
153 struct listener *li;
154 struct sockaddr_storage addr;
Christopher Faulet102854c2019-04-30 12:17:13 +0200155 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100156 int addr_len;
157 int ret;
158 int fd;
159
Christopher Faulet102854c2019-04-30 12:17:13 +0200160 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
161 * is not really illimited, but it is probably enough.
162 */
163 max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
164 for (; max_accept; max_accept--) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100165 addr_len = sizeof(addr);
166 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
167 if (fd < 0)
168 break;
169
Olivier Houchard64213e92019-03-08 18:52:57 +0100170 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100171 ret = li->accept(li, fd, &addr);
172 if (ret <= 0) {
173 /* connection was terminated by the application */
174 continue;
175 }
176
177 /* increase the per-process number of cumulated sessions, this
178 * may only be done once l->accept() has accepted the connection.
179 */
180 if (!(li->options & LI_O_UNLIMITED)) {
181 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
182 update_freq_ctr(&global.sess_per_sec, 1));
183 if (li->bind_conf && li->bind_conf->is_ssl) {
184 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
185 update_freq_ctr(&global.ssl_per_sec, 1));
186 }
187 }
188 }
189
190 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200191 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200192 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100193
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200194 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100195}
196
197/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
198static int accept_queue_init()
199{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200200 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100201 int i;
202
203 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200204 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100205 if (!t) {
206 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
207 return ERR_FATAL|ERR_ABORT;
208 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200209 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100210 t->process = accept_queue_process;
211 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200212 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100213 }
214 return 0;
215}
216
217REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
218
219#endif // USE_THREAD
220
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200221/* adjust the listener's state and its proxy's listener counters if needed.
222 * It must be called under the listener's lock, but uses atomic ops to change
223 * the proxy's counters so that the proxy lock is not needed.
224 */
Willy Tarreaua37b2442020-09-24 07:23:45 +0200225void listener_set_state(struct listener *l, enum li_state st)
226{
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200227 struct proxy *px = l->bind_conf->frontend;
228
229 if (px) {
230 /* from state */
231 switch (l->state) {
232 case LI_NEW: /* first call */
233 _HA_ATOMIC_ADD(&px->li_all, 1);
234 break;
235 case LI_INIT:
236 case LI_ASSIGNED:
237 break;
238 case LI_PAUSED:
239 _HA_ATOMIC_SUB(&px->li_paused, 1);
240 break;
241 case LI_LISTEN:
242 _HA_ATOMIC_SUB(&px->li_bound, 1);
243 break;
244 case LI_READY:
245 case LI_FULL:
246 case LI_LIMITED:
247 _HA_ATOMIC_SUB(&px->li_ready, 1);
248 break;
249 }
250
251 /* to state */
252 switch (st) {
253 case LI_NEW:
254 case LI_INIT:
255 case LI_ASSIGNED:
256 break;
257 case LI_PAUSED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200258 BUG_ON(l->rx.fd == -1);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200259 _HA_ATOMIC_ADD(&px->li_paused, 1);
260 break;
261 case LI_LISTEN:
Willy Tarreau95a34602020-10-08 15:32:21 +0200262 BUG_ON(l->rx.fd == -1);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200263 _HA_ATOMIC_ADD(&px->li_bound, 1);
264 break;
265 case LI_READY:
266 case LI_FULL:
267 case LI_LIMITED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200268 BUG_ON(l->rx.fd == -1);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200269 _HA_ATOMIC_ADD(&px->li_ready, 1);
270 break;
271 }
272 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200273 l->state = st;
274}
275
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100276/* This function adds the specified listener's file descriptor to the polling
277 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500278 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200279 * also support binding only the relevant processes to their respective
280 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100281 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200282void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100283{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100284 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200285
286 /* If this listener is supposed to be only in the master, close it in
287 * the workers. Conversely, if it's supposed to be only in the workers
288 * close it in the master.
289 */
Willy Tarreau18c20d22020-10-09 16:11:46 +0200290 if (!!master != !!(listener->rx.flags & RX_F_MWORKER))
Willy Tarreau75c98d12020-10-09 15:55:23 +0200291 do_unbind_listener(listener);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200292
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100293 if (listener->state == LI_LISTEN) {
Willy Tarreau95a34602020-10-08 15:32:21 +0200294 BUG_ON(listener->rx.fd == -1);
William Lallemand095ba4c2017-06-01 17:38:50 +0200295 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200296 !(proc_mask(listener->rx.settings->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200297 /* we don't want to enable this listener and don't
298 * want any fd event to reach it.
299 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200300 do_unbind_listener(listener);
Willy Tarreauae302532014-05-07 19:22:24 +0200301 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100302 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200303 listener->rx.proto->enable(listener);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200304 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200305 }
306 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200307 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100308 }
309 }
Willy Tarreaud6afb532020-10-09 10:35:40 +0200310
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100311 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100312}
313
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200314/*
315 * This function completely stops a listener. It will need to operate under the
316 * proxy's lock, the protocol's lock, and the listener's lock. The caller is
317 * responsible for indicating in lpx, lpr, lli whether the respective locks are
318 * already held (non-zero) or not (zero) so that the function picks the missing
319 * ones, in this order. The proxy's listeners count is updated and the proxy is
320 * disabled and woken up after the last one is gone.
321 */
322void stop_listener(struct listener *l, int lpx, int lpr, int lli)
323{
324 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200325
326 if (l->options & LI_O_NOSTOP) {
327 /* master-worker sockpairs are never closed but don't count as a
328 * job.
329 */
330 return;
331 }
332
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200333 if (!lpx)
334 HA_SPIN_LOCK(PROXY_LOCK, &px->lock);
335
336 if (!lpr)
337 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
338
339 if (!lli)
340 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
341
342 if (l->state > LI_INIT) {
Willy Tarreau75c98d12020-10-09 15:55:23 +0200343 do_unbind_listener(l);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200344
345 if (l->state >= LI_ASSIGNED)
346 __delete_listener(l);
347
Willy Tarreauacde1522020-10-07 16:31:39 +0200348 proxy_cond_disable(px);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200349 }
350
351 if (!lli)
352 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
353
354 if (!lpr)
355 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
356
357 if (!lpx)
358 HA_SPIN_UNLOCK(PROXY_LOCK, &px->lock);
359}
360
Willy Tarreaube58c382011-07-24 18:28:10 +0200361/* This function tries to temporarily disable a listener, depending on the OS
362 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
363 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
364 * closes upon SHUT_WR and refuses to rebind. So a common validation path
365 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
366 * is disabled. It normally returns non-zero, unless an error is reported.
367 */
368int pause_listener(struct listener *l)
369{
Willy Tarreau58651b42020-09-24 16:03:29 +0200370 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200371 int ret = 1;
372
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100373 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200374
Willy Tarreau02e19752020-09-23 17:17:22 +0200375 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
376 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
377 goto end;
378
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200379 if (l->state <= LI_PAUSED)
380 goto end;
381
Willy Tarreaucb66ea62020-09-25 17:12:32 +0200382 if (l->rx.proto->rx_suspend) {
Willy Tarreau092d8652014-07-07 20:22:12 +0200383 /* Returns < 0 in case of failure, 0 if the listener
384 * was totally stopped, or > 0 if correctly paused.
385 */
Willy Tarreaucb66ea62020-09-25 17:12:32 +0200386 ret = l->rx.proto->rx_suspend(&l->rx);
Willy Tarreaube58c382011-07-24 18:28:10 +0200387
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200388 if (ret < 0) {
389 ret = 0;
390 goto end;
391 }
Willy Tarreaufb76bd52020-09-24 18:07:48 +0200392 ret = 1;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200393 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200394
Olivier Houchard859dc802019-08-08 15:47:21 +0200395 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200396
Willy Tarreaua37b2442020-09-24 07:23:45 +0200397 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200398
399 if (px && !px->li_ready) {
400 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
401 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
402 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200403 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100404 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200405 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200406}
407
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200408/* This function tries to resume a temporarily disabled listener. Paused, full,
409 * limited and disabled listeners are handled, which means that this function
410 * may replace enable_listener(). The resulting state will either be LI_READY
411 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200412 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200413 * foreground mode, and are ignored. If the listener was only in the assigned
414 * state, it's totally rebound. This can happen if a pause() has completely
415 * stopped it. If the resume fails, 0 is returned and an error might be
416 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200417 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100418int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200419{
Willy Tarreau58651b42020-09-24 16:03:29 +0200420 struct proxy *px = l->bind_conf->frontend;
421 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200422 int ret = 1;
423
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100424 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200425
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200426 /* check that another thread didn't to the job in parallel (e.g. at the
427 * end of listen_accept() while we'd come from dequeue_all_listeners().
428 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200429 if (MT_LIST_ADDED(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200430 goto end;
431
William Lallemand095ba4c2017-06-01 17:38:50 +0200432 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200433 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200434 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100435
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200436 if (l->state == LI_READY)
437 goto end;
438
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200439 if (l->state == LI_ASSIGNED) {
440 char msg[100];
441 int err;
442
Willy Tarreaub3580b12020-09-01 10:26:22 +0200443 err = l->rx.proto->listen(l, msg, sizeof(msg));
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200444 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100445 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200446 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100447 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200448
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200449 if (err & (ERR_FATAL | ERR_ABORT)) {
450 ret = 0;
451 goto end;
452 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200453 }
454
Willy Tarreauc6dac6c2020-09-23 17:34:22 +0200455 if (l->state < LI_PAUSED) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200456 ret = 0;
457 goto end;
458 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200459
Willy Tarreau010fe152020-09-25 17:31:05 +0200460 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
461 l->rx.proto->rx_resume(&l->rx) <= 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200462 ret = 0;
463 goto end;
464 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200465
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100466 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200467 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200468 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200469 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200470 }
471
Willy Tarreau4b51f422020-09-25 20:32:28 +0200472 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200473 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200474
475 done:
476 if (was_paused && !px->li_paused) {
477 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
478 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
479 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200480 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100481 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200482 return ret;
483}
484
Willy Tarreau87b09662015-04-03 00:22:06 +0200485/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200486 * it upon next close() using resume_listener().
487 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200488static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200489{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100490 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200491 if (l->state >= LI_READY) {
Olivier Houchard859dc802019-08-08 15:47:21 +0200492 MT_LIST_DEL(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100493 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200494 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200495 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100496 }
Willy Tarreau62793712011-07-24 19:23:38 +0200497 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100498 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200499}
500
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200501/* Marks a ready listener as limited so that we only try to re-enable it when
502 * resources are free again. It will be queued into the specified queue.
503 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200504static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200505{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100506 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200507 if (l->state == LI_READY) {
Willy Tarreaude4db172020-07-10 08:10:29 +0200508 MT_LIST_TRY_ADDQ(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200509 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200510 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200511 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100512 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200513}
514
Willy Tarreau241797a2019-12-10 14:10:52 +0100515/* Dequeues all listeners waiting for a resource the global wait queue */
516void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200517{
Willy Tarreau01abd022019-02-28 10:27:18 +0100518 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200519
Willy Tarreau241797a2019-12-10 14:10:52 +0100520 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200521 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100522 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200523 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100524 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200525 }
526}
527
Willy Tarreau241797a2019-12-10 14:10:52 +0100528/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
529void dequeue_proxy_listeners(struct proxy *px)
530{
531 struct listener *listener;
532
533 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
534 /* This cannot fail because the listeners are by definition in
535 * the LI_LIMITED state.
536 */
537 resume_listener(listener);
538 }
539}
540
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200541
542/* default function used to unbind a listener. This is for use by standard
543 * protocols working on top of accepted sockets. The receiver's rx_unbind()
544 * will automatically be used after the listener is disabled if the socket is
545 * still bound. This must be used under the listener's lock.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100546 */
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200547void default_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100548{
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200549 if (listener->state <= LI_ASSIGNED)
550 goto out_close;
551
552 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200553 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200554 goto out_close;
555 }
556
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200557 if (listener->state >= LI_READY) {
558 listener->rx.proto->disable(listener);
559 if (listener->rx.flags & RX_F_BOUND)
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200560 listener_set_state(listener, LI_LISTEN);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200561 }
562
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200563 out_close:
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200564 if (listener->rx.flags & RX_F_BOUND)
565 listener->rx.proto->rx_unbind(&listener->rx);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200566}
567
568/* This function closes the listening socket for the specified listener,
569 * provided that it's already in a listening state. The protocol's unbind()
570 * is called to put the listener into LI_ASSIGNED or LI_LISTEN and handle
571 * the unbinding tasks. The listener enters then the LI_ASSIGNED state if
572 * the receiver is unbound. Must be called with the lock held.
573 */
574void do_unbind_listener(struct listener *listener)
575{
576 MT_LIST_DEL(&listener->wait_queue);
577
578 if (listener->rx.proto->unbind)
579 listener->rx.proto->unbind(listener);
Willy Tarreau374e9af2020-10-09 15:47:17 +0200580
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200581 /* we may have to downgrade the listener if the rx was closed */
582 if (!(listener->rx.flags & RX_F_BOUND) && listener->state > LI_ASSIGNED)
Willy Tarreau374e9af2020-10-09 15:47:17 +0200583 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100584}
585
Olivier Houchard1fc05162017-04-06 01:05:05 +0200586/* This function closes the listening socket for the specified listener,
587 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200588 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
589 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100590 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200591 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100592void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200593{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100594 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200595 do_unbind_listener(listener);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100596 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200597}
598
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200599/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
600 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200601 * allocation). The address family is taken from ss->ss_family, and the protocol
602 * passed in <proto> must be usable on this family. The number of jobs and
603 * listeners is automatically increased by the number of listeners created. It
604 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200605 */
606int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200607 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200608{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200609 struct listener *l;
610 int port;
611
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200612 for (port = portl; port <= porth; port++) {
613 l = calloc(1, sizeof(*l));
614 if (!l) {
615 memprintf(err, "out of memory");
616 return 0;
617 }
618 l->obj_type = OBJ_TYPE_LISTENER;
619 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
620 LIST_ADDQ(&bc->listeners, &l->by_bind);
621 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200622 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200623 l->rx.owner = l;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200624 l->rx.fd = fd;
Willy Tarreau37159062020-08-27 07:48:42 +0200625 memcpy(&l->rx.addr, ss, sizeof(*ss));
Olivier Houchard859dc802019-08-08 15:47:21 +0200626 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200627 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200628
629 proto->add(l, port);
630
Willy Tarreau909c23b2020-09-15 13:50:58 +0200631 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200632 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100633
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100634 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100635 _HA_ATOMIC_ADD(&jobs, 1);
636 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200637 }
638 return 1;
639}
640
Willy Tarreau1a64d162007-10-28 22:26:05 +0100641/* Delete a listener from its protocol's list of listeners. The listener's
642 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200643 * number of listeners is updated, as well as the global number of listeners
644 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200645 * is a low-level function expected to be called with the proto_lock and the
646 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100647 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200648void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100649{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100650 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200651 listener_set_state(listener, LI_INIT);
Willy Tarreaub7436612020-08-28 19:51:44 +0200652 LIST_DEL(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200653 listener->rx.proto->nb_receivers--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100654 _HA_ATOMIC_SUB(&jobs, 1);
655 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100656 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200657}
658
659/* Delete a listener from its protocol's list of listeners (please check
660 * __delete_listener() above). The proto_lock and the listener's lock will
661 * be grabbed in this order.
662 */
663void delete_listener(struct listener *listener)
664{
665 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
666 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
667 __delete_listener(listener);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100668 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200669 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100670}
671
Willy Tarreaue2711c72019-02-27 15:39:41 +0100672/* Returns a suitable value for a listener's backlog. It uses the listener's,
673 * otherwise the frontend's backlog, otherwise the listener's maxconn,
674 * otherwise the frontend's maxconn, otherwise 1024.
675 */
676int listener_backlog(const struct listener *l)
677{
678 if (l->backlog)
679 return l->backlog;
680
681 if (l->bind_conf->frontend->backlog)
682 return l->bind_conf->frontend->backlog;
683
684 if (l->maxconn)
685 return l->maxconn;
686
687 if (l->bind_conf->frontend->maxconn)
688 return l->bind_conf->frontend->maxconn;
689
690 return 1024;
691}
692
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200693/* This function is called on a read event from a listening socket, corresponding
694 * to an accept. It tries to accept as many connections as possible, and for each
695 * calls the listener's accept handler (generally the frontend's accept handler).
696 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200697void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200698{
699 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100700 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200701 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100702 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100703 int next_feconn = 0;
704 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200705 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200706 int cfd;
707 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100708#ifdef USE_ACCEPT4
709 static int accept4_broken;
710#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200711
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100712 if (!l)
713 return;
714 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200715
716 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
717 * illimited, but it is probably enough.
718 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100719 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200720
Willy Tarreau93e7c002013-10-07 18:51:07 +0200721 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
722 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200723
724 if (unlikely(!max)) {
725 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200726 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100727 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200728 }
729
730 if (max_accept > max)
731 max_accept = max;
732 }
733
734 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200735 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
736
737 if (unlikely(!max)) {
738 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200739 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100740 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200741 }
742
743 if (max_accept > max)
744 max_accept = max;
745 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200746#ifdef USE_OPENSSL
747 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
748 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200749
Willy Tarreaue43d5322013-10-07 20:01:52 +0200750 if (unlikely(!max)) {
751 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200752 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100753 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200754 }
755
756 if (max_accept > max)
757 max_accept = max;
758 }
759#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200760 if (p && p->fe_sps_lim) {
761 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
762
763 if (unlikely(!max)) {
764 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100765 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
766 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200767 }
768
769 if (max_accept > max)
770 max_accept = max;
771 }
772
773 /* Note: if we fail to allocate a connection because of configured
774 * limits, we'll schedule a new attempt worst 1 second later in the
775 * worst case. If we fail due to system limits or temporary resource
776 * shortage, we try again 100ms later in the worst case.
777 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200778 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200779 struct sockaddr_storage addr;
780 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200781 unsigned int count;
Willy Tarreauaf613e82020-06-05 08:40:51 +0200782 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200783
Willy Tarreau82c97892019-02-27 19:32:32 +0100784 /* pre-increase the number of connections without going too far.
785 * We process the listener, then the proxy, then the process.
786 * We know which ones to unroll based on the next_xxx value.
787 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100788 do {
789 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100790 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100791 /* the listener was marked full or another
792 * thread is going to do it.
793 */
794 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100795 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100796 goto end;
797 }
798 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000799 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100800
Willy Tarreau82c97892019-02-27 19:32:32 +0100801 if (p) {
802 do {
803 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100804 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100805 /* the frontend was marked full or another
806 * thread is going to do it.
807 */
808 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100809 expire = TICK_ETERNITY;
810 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100811 }
812 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100813 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200814 }
815
Willy Tarreau82c97892019-02-27 19:32:32 +0100816 if (!(l->options & LI_O_UNLIMITED)) {
817 do {
818 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100819 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100820 /* the process was marked full or another
821 * thread is going to do it.
822 */
823 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100824 expire = tick_add(now_ms, 1000); /* try again in 1 second */
825 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100826 }
827 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000828 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200829 }
830
William Lallemand2fe7dd02018-09-11 16:51:29 +0200831 /* with sockpair@ we don't want to do an accept */
Willy Tarreau37159062020-08-27 07:48:42 +0200832 if (unlikely(l->rx.addr.ss_family == AF_CUST_SOCKPAIR)) {
William Lallemand2fe7dd02018-09-11 16:51:29 +0200833 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100834 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100835 /* just like with UNIX sockets, only the family is filled */
836 addr.ss_family = AF_UNIX;
837 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200838 } else
839
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200840#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100841 /* only call accept4() if it's known to be safe, otherwise
842 * fallback to the legacy accept() + fcntl().
843 */
844 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100845 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100846 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
847 (accept4_broken = 1))))
848#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200849 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100850 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100851
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200852 if (unlikely(cfd == -1)) {
853 switch (errno) {
854 case EAGAIN:
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100855 if (fdtab[fd].ev & (FD_POLL_HUP|FD_POLL_ERR)) {
Willy Tarreaubb660302014-05-07 19:47:02 +0200856 /* the listening socket might have been disabled in a shared
857 * process and we're a collateral victim. We'll just pause for
858 * a while in case it comes back. In the mean time, we need to
859 * clear this sticky flag.
860 */
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100861 _HA_ATOMIC_AND(&fdtab[fd].ev, ~(FD_POLL_HUP|FD_POLL_ERR));
Willy Tarreaubb660302014-05-07 19:47:02 +0200862 goto transient_error;
863 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200864 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200865 case EINVAL:
866 /* might be trying to accept on a shut fd (eg: soft stop) */
867 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100868 case EINTR:
869 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100870 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100871 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100872 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100873 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100874 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100875 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200876 case ENFILE:
877 if (p)
878 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100879 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
880 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200881 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200882 case EMFILE:
883 if (p)
884 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100885 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
886 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200887 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200888 case ENOBUFS:
889 case ENOMEM:
890 if (p)
891 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100892 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
893 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200894 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200895 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100896 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau92079932019-12-10 09:30:05 +0100897 max_accept = 0;
898 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200899 }
900 }
901
William Lallemandd9138002018-11-27 12:02:39 +0100902 /* we don't want to leak the FD upon reload if it's in the master */
903 if (unlikely(master == 1))
904 fcntl(cfd, F_SETFD, FD_CLOEXEC);
905
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100906 /* The connection was accepted, it must be counted as such */
907 if (l->counters)
908 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
909
Willy Tarreau82c97892019-02-27 19:32:32 +0100910 if (p)
911 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
912
913 proxy_inc_fe_conn_ctr(l, p);
914
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100915 if (!(l->options & LI_O_UNLIMITED)) {
916 count = update_freq_ctr(&global.conn_per_sec, 1);
917 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100918 }
919
Willy Tarreau64a9c052019-04-12 15:27:17 +0200920 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
921
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200922 if (unlikely(cfd >= global.maxsock)) {
923 send_log(p, LOG_EMERG,
924 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
925 p->id);
926 close(cfd);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100927 expire = tick_add(now_ms, 1000); /* try again in 1 second */
928 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200929 }
930
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100931 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100932 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
933 * allows the error path not to rollback on nbconn. It's more
934 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100935 */
936 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100937 next_feconn = 0;
938 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200939
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100940#if defined(USE_THREAD)
Willy Tarreau818a92e2020-09-03 07:50:19 +0200941 mask = thread_mask(l->rx.settings->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100942 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100943 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100944 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100945
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100946 /* The principle is that we have two running indexes,
947 * each visiting in turn all threads bound to this
948 * listener. The connection will be assigned to the one
949 * with the least connections, and the other one will
950 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100951 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100952 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100953 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100954
955 /* keep a copy for the final update. thr_idx is composite
956 * and made of (t2<<16) + t1.
957 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100958 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100959 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100960 unsigned long m1, m2;
961 int q1, q2;
962
963 t2 = t1 = t0;
964 t2 >>= 16;
965 t1 &= 0xFFFF;
966
967 /* t1 walks low to high bits ;
968 * t2 walks high to low.
969 */
970 m1 = mask >> t1;
971 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
972
Willy Tarreau85d04242019-04-16 18:09:13 +0200973 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100974 m1 &= ~1UL;
975 if (!m1) {
976 m1 = mask;
977 t1 = 0;
978 }
979 t1 += my_ffsl(m1) - 1;
980 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100981
Willy Tarreau85d04242019-04-16 18:09:13 +0200982 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
983 /* highest bit not set */
984 if (!m2)
985 m2 = mask;
986
987 t2 = my_flsl(m2) - 1;
988 }
989
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100990 /* now we have two distinct thread IDs belonging to the mask */
991 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
992 if (q1 >= ACCEPT_QUEUE_SIZE)
993 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100994
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100995 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
996 if (q2 >= ACCEPT_QUEUE_SIZE)
997 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100998
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100999 /* we have 3 possibilities now :
1000 * q1 < q2 : t1 is less loaded than t2, so we pick it
1001 * and update t2 (since t1 might still be
1002 * lower than another thread)
1003 * q1 > q2 : t2 is less loaded than t1, so we pick it
1004 * and update t1 (since t2 might still be
1005 * lower than another thread)
1006 * q1 = q2 : both are equally loaded, thus we pick t1
1007 * and update t1 as it will become more loaded
1008 * than t2.
1009 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001010
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001011 q1 += l->thr_conn[t1];
1012 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001013
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001014 if (q1 - q2 < 0) {
1015 t = t1;
1016 t2 = t2 ? t2 - 1 : LONGBITS - 1;
1017 }
1018 else if (q1 - q2 > 0) {
1019 t = t2;
1020 t1++;
1021 if (t1 >= LONGBITS)
1022 t1 = 0;
1023 }
1024 else {
1025 t = t1;
1026 t1++;
1027 if (t1 >= LONGBITS)
1028 t1 = 0;
1029 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001030
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001031 /* new value for thr_idx */
1032 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001033 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001034
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001035 /* We successfully selected the best thread "t" for this
1036 * connection. We use deferred accepts even if it's the
1037 * local thread because tests show that it's the best
1038 * performing model, likely due to better cache locality
1039 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001040 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001041 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001042 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +01001043 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001044 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001045 continue;
1046 }
1047 /* If the ring is full we do a synchronous accept on
1048 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001049 */
Olivier Houchard64213e92019-03-08 18:52:57 +01001050 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001051 }
1052#endif // USE_THREAD
1053
Olivier Houchard64213e92019-03-08 18:52:57 +01001054 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001055 ret = l->accept(l, cfd, &addr);
1056 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001057 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001058 * we just have to ignore it (ret == 0) or it's a critical
1059 * error due to a resource shortage, and we must stop the
1060 * listener (ret < 0).
1061 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001062 if (ret == 0) /* successful termination */
1063 continue;
1064
Willy Tarreaubb660302014-05-07 19:47:02 +02001065 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001066 }
1067
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001068 /* increase the per-process number of cumulated sessions, this
1069 * may only be done once l->accept() has accepted the connection.
1070 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001071 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001072 count = update_freq_ctr(&global.sess_per_sec, 1);
1073 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001074 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001075#ifdef USE_OPENSSL
1076 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001077 count = update_freq_ctr(&global.ssl_per_sec, 1);
1078 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001079 }
1080#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001081
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001082 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001083 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001084
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001085 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001086 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001087 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001088
Willy Tarreau82c97892019-02-27 19:32:32 +01001089 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001090 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001091
1092 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001093 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001094
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001095 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreaucdcba112019-12-11 15:06:30 +01001096 (l->state == LI_LIMITED &&
1097 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1098 (!tick_isset(global_listener_queue_task->expire) ||
1099 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001100 /* at least one thread has to this when quitting */
1101 resume_listener(l);
1102
1103 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001104 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001105
Olivier Houchard859dc802019-08-08 15:47:21 +02001106 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001107 (!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 +01001108 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001109 }
Willy Tarreau4c044e22019-12-05 07:40:32 +01001110
Willy Tarreau92079932019-12-10 09:30:05 +01001111 /* Now it's getting tricky. The listener was supposed to be in LI_READY
1112 * state but in the mean time we might have changed it to LI_FULL or
1113 * LI_LIMITED, and another thread might also have turned it to
1114 * LI_PAUSED, LI_LISTEN or even LI_INI when stopping a proxy. We must
1115 * be certain to keep the FD enabled when in the READY state but we
1116 * must also stop it for other states that we might have switched to
1117 * while others re-enabled polling.
1118 */
1119 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
1120 if (l->state == LI_READY) {
1121 if (max_accept > 0)
1122 fd_cant_recv(fd);
1123 else
1124 fd_done_recv(fd);
1125 } else if (l->state > LI_ASSIGNED) {
Willy Tarreau38ba6472020-08-27 08:16:52 +02001126 fd_stop_recv(l->rx.fd);
Willy Tarreau92079932019-12-10 09:30:05 +01001127 }
1128 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001129 return;
1130
1131 transient_error:
1132 /* pause the listener for up to 100 ms */
1133 expire = tick_add(now_ms, 100);
1134
1135 limit_global:
1136 /* (re-)queue the listener to the global queue and set it to expire no
1137 * later than <expire> ahead. The listener turns to LI_LIMITED.
1138 */
1139 limit_listener(l, &global_listener_queue);
1140 task_schedule(global_listener_queue_task, expire);
1141 goto end;
1142
1143 limit_proxy:
1144 /* (re-)queue the listener to the proxy's queue and set it to expire no
1145 * later than <expire> ahead. The listener turns to LI_LIMITED.
1146 */
1147 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001148 if (p->task && tick_isset(expire))
1149 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001150 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001151}
1152
Willy Tarreau05f50472017-09-15 09:19:58 +02001153/* Notify the listener that a connection initiated from it was released. This
1154 * is used to keep the connection count consistent and to possibly re-open
1155 * listening when it was limited.
1156 */
1157void listener_release(struct listener *l)
1158{
1159 struct proxy *fe = l->bind_conf->frontend;
1160
1161 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001162 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001163 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001164 _HA_ATOMIC_SUB(&fe->feconn, 1);
1165 _HA_ATOMIC_SUB(&l->nbconn, 1);
1166 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001167
1168 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001169 resume_listener(l);
1170
1171 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001172 dequeue_all_listeners();
Willy Tarreau05f50472017-09-15 09:19:58 +02001173
Olivier Houchard859dc802019-08-08 15:47:21 +02001174 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001175 (!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 +01001176 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001177}
1178
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001179/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1180static int listener_queue_init()
1181{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001182 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1183 if (!global_listener_queue_task) {
1184 ha_alert("Out of memory when initializing global listener queue\n");
1185 return ERR_FATAL|ERR_ABORT;
1186 }
1187 /* very simple initialization, users will queue the task if needed */
1188 global_listener_queue_task->context = NULL; /* not even a context! */
1189 global_listener_queue_task->process = manage_global_listener_queue;
1190
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001191 return 0;
1192}
1193
1194static void listener_queue_deinit()
1195{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001196 task_destroy(global_listener_queue_task);
1197 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001198}
1199
1200REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1201REGISTER_POST_DEINIT(listener_queue_deinit);
1202
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001203
1204/* This is the global management task for listeners. It enables listeners waiting
1205 * for global resources when there are enough free resource, or at least once in
1206 * a while. It is designed to be called as a task.
1207 */
1208static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state)
1209{
1210 /* If there are still too many concurrent connections, let's wait for
1211 * some of them to go away. We don't need to re-arm the timer because
1212 * each of them will scan the queue anyway.
1213 */
1214 if (unlikely(actconn >= global.maxconn))
1215 goto out;
1216
1217 /* We should periodically try to enable listeners waiting for a global
1218 * resource here, because it is possible, though very unlikely, that
1219 * they have been blocked by a temporary lack of global resource such
1220 * as a file descriptor or memory and that the temporary condition has
1221 * disappeared.
1222 */
1223 dequeue_all_listeners();
1224
1225 out:
1226 t->expire = TICK_ETERNITY;
1227 task_queue(t);
1228 return t;
1229}
1230
Willy Tarreau26982662012-09-12 23:17:10 +02001231/*
1232 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1233 * parsing sessions.
1234 */
1235void bind_register_keywords(struct bind_kw_list *kwl)
1236{
1237 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1238}
1239
1240/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1241 * keyword is found with a NULL ->parse() function, then an attempt is made to
1242 * find one with a valid ->parse() function. This way it is possible to declare
1243 * platform-dependant, known keywords as NULL, then only declare them as valid
1244 * if some options are met. Note that if the requested keyword contains an
1245 * opening parenthesis, everything from this point is ignored.
1246 */
1247struct bind_kw *bind_find_kw(const char *kw)
1248{
1249 int index;
1250 const char *kwend;
1251 struct bind_kw_list *kwl;
1252 struct bind_kw *ret = NULL;
1253
1254 kwend = strchr(kw, '(');
1255 if (!kwend)
1256 kwend = kw + strlen(kw);
1257
1258 list_for_each_entry(kwl, &bind_keywords.list, list) {
1259 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1260 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1261 kwl->kw[index].kw[kwend-kw] == 0) {
1262 if (kwl->kw[index].parse)
1263 return &kwl->kw[index]; /* found it !*/
1264 else
1265 ret = &kwl->kw[index]; /* may be OK */
1266 }
1267 }
1268 }
1269 return ret;
1270}
1271
Willy Tarreau8638f482012-09-18 18:01:17 +02001272/* Dumps all registered "bind" keywords to the <out> string pointer. The
1273 * unsupported keywords are only dumped if their supported form was not
1274 * found.
1275 */
1276void bind_dump_kws(char **out)
1277{
1278 struct bind_kw_list *kwl;
1279 int index;
1280
Christopher Faulet784063e2020-05-18 12:14:18 +02001281 if (!out)
1282 return;
1283
Willy Tarreau8638f482012-09-18 18:01:17 +02001284 *out = NULL;
1285 list_for_each_entry(kwl, &bind_keywords.list, list) {
1286 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1287 if (kwl->kw[index].parse ||
1288 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001289 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1290 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001291 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001292 kwl->kw[index].skip ? " <arg>" : "",
1293 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001294 }
1295 }
1296 }
1297}
1298
Willy Tarreau645513a2010-05-24 20:55:15 +02001299/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001300/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001301/************************************************************************/
1302
Willy Tarreaua5e37562011-12-16 17:06:15 +01001303/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001304static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001305smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001306{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001307 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001308 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001309 return 1;
1310}
1311
Willy Tarreaua5e37562011-12-16 17:06:15 +01001312/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001313static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001314smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001315{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001316 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001317 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001318 return 1;
1319}
Jerome Magnineb421b22020-03-27 22:08:40 +01001320static int
1321smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1322{
1323 smp->data.u.str.area = smp->sess->listener->name;
1324 if (!smp->data.u.str.area)
1325 return 0;
1326
1327 smp->data.type = SMP_T_STR;
1328 smp->flags = SMP_F_CONST;
1329 smp->data.u.str.data = strlen(smp->data.u.str.area);
1330 return 1;
1331}
Willy Tarreau645513a2010-05-24 20:55:15 +02001332
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001333/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001334static 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 +02001335{
1336 struct listener *l;
1337
Willy Tarreau4348fad2012-09-20 16:48:07 +02001338 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001339 l->options |= LI_O_ACC_PROXY;
1340
1341 return 0;
1342}
1343
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001344/* parse the "accept-netscaler-cip" bind keyword */
1345static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1346{
1347 struct listener *l;
1348 uint32_t val;
1349
1350 if (!*args[cur_arg + 1]) {
1351 memprintf(err, "'%s' : missing value", args[cur_arg]);
1352 return ERR_ALERT | ERR_FATAL;
1353 }
1354
1355 val = atol(args[cur_arg + 1]);
1356 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001357 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001358 return ERR_ALERT | ERR_FATAL;
1359 }
1360
1361 list_for_each_entry(l, &conf->listeners, by_bind) {
1362 l->options |= LI_O_ACC_CIP;
1363 conf->ns_cip_magic = val;
1364 }
1365
1366 return 0;
1367}
1368
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001369/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001370static 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 +02001371{
1372 struct listener *l;
1373 int val;
1374
1375 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001376 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001377 return ERR_ALERT | ERR_FATAL;
1378 }
1379
1380 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001381 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001382 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001383 return ERR_ALERT | ERR_FATAL;
1384 }
1385
Willy Tarreau4348fad2012-09-20 16:48:07 +02001386 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001387 l->backlog = val;
1388
1389 return 0;
1390}
1391
1392/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001393static 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 +02001394{
1395 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001396 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001397 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001398
Willy Tarreau4348fad2012-09-20 16:48:07 +02001399 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001400 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001401 return ERR_ALERT | ERR_FATAL;
1402 }
1403
1404 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001405 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001406 return ERR_ALERT | ERR_FATAL;
1407 }
1408
Willy Tarreau4348fad2012-09-20 16:48:07 +02001409 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001410 new->luid = strtol(args[cur_arg + 1], &error, 10);
1411 if (*error != '\0') {
1412 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1413 return ERR_ALERT | ERR_FATAL;
1414 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001415 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001416
Willy Tarreau4348fad2012-09-20 16:48:07 +02001417 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001418 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001419 return ERR_ALERT | ERR_FATAL;
1420 }
1421
Willy Tarreau4348fad2012-09-20 16:48:07 +02001422 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001423 if (node) {
1424 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001425 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1426 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1427 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001428 return ERR_ALERT | ERR_FATAL;
1429 }
1430
Willy Tarreau4348fad2012-09-20 16:48:07 +02001431 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001432 return 0;
1433}
1434
1435/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001436static 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 +02001437{
1438 struct listener *l;
1439 int val;
1440
1441 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001442 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001443 return ERR_ALERT | ERR_FATAL;
1444 }
1445
1446 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001447 if (val < 0) {
1448 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001449 return ERR_ALERT | ERR_FATAL;
1450 }
1451
Willy Tarreau4348fad2012-09-20 16:48:07 +02001452 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001453 l->maxconn = val;
1454
1455 return 0;
1456}
1457
1458/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001459static 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 +02001460{
1461 struct listener *l;
1462
1463 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001464 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001465 return ERR_ALERT | ERR_FATAL;
1466 }
1467
Willy Tarreau4348fad2012-09-20 16:48:07 +02001468 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001469 l->name = strdup(args[cur_arg + 1]);
1470
1471 return 0;
1472}
1473
1474/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001475static 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 +02001476{
1477 struct listener *l;
1478 int val;
1479
1480 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001481 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001482 return ERR_ALERT | ERR_FATAL;
1483 }
1484
1485 val = atol(args[cur_arg + 1]);
1486 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001487 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001488 return ERR_ALERT | ERR_FATAL;
1489 }
1490
Willy Tarreau4348fad2012-09-20 16:48:07 +02001491 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001492 l->nice = val;
1493
1494 return 0;
1495}
1496
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001497/* parse the "process" bind keyword */
1498static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1499{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001500 char *slash;
1501 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001502
Christopher Fauletc644fa92017-11-23 22:44:11 +01001503 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1504 *slash = 0;
1505
Willy Tarreauff9c9142019-02-07 10:39:36 +01001506 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001507 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001508 return ERR_ALERT | ERR_FATAL;
1509 }
1510
Christopher Fauletc644fa92017-11-23 22:44:11 +01001511 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001512 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001513 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1514 return ERR_ALERT | ERR_FATAL;
1515 }
1516 *slash = '/';
1517 }
1518
Willy Tarreaue26993c2020-09-03 07:18:55 +02001519 conf->settings.bind_proc |= proc;
1520 conf->settings.bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001521 return 0;
1522}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001523
Christopher Fauleta717b992018-04-10 14:43:00 +02001524/* parse the "proto" bind keyword */
1525static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1526{
1527 struct ist proto;
1528
1529 if (!*args[cur_arg + 1]) {
1530 memprintf(err, "'%s' : missing value", args[cur_arg]);
1531 return ERR_ALERT | ERR_FATAL;
1532 }
1533
1534 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1535 conf->mux_proto = get_mux_proto(proto);
1536 if (!conf->mux_proto) {
1537 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1538 return ERR_ALERT | ERR_FATAL;
1539 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001540 return 0;
1541}
1542
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001543/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1544static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1545 struct proxy *defpx, const char *file, int line,
1546 char **err)
1547{
1548 if (too_many_args(1, args, err, NULL))
1549 return -1;
1550
1551 if (strcmp(args[1], "on") == 0)
1552 global.tune.options |= GTUNE_LISTENER_MQ;
1553 else if (strcmp(args[1], "off") == 0)
1554 global.tune.options &= ~GTUNE_LISTENER_MQ;
1555 else {
1556 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1557 return -1;
1558 }
1559 return 0;
1560}
1561
Willy Tarreau61612d42012-04-19 18:42:05 +02001562/* Note: must not be declared <const> as its list will be overwritten.
1563 * Please take care of keeping this list alphabetically sorted.
1564 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001565static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001566 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1567 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001568 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001569 { /* END */ },
1570}};
1571
Willy Tarreau0108d902018-11-25 19:14:37 +01001572INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1573
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001574/* Note: must not be declared <const> as its list will be overwritten.
1575 * Please take care of keeping this list alphabetically sorted.
1576 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001577static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001578 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001579}};
1580
Willy Tarreau0108d902018-11-25 19:14:37 +01001581INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1582
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001583/* Note: must not be declared <const> as its list will be overwritten.
1584 * Please take care of keeping this list alphabetically sorted, doing so helps
1585 * all code contributors.
1586 * Optional keywords are also declared with a NULL ->parse() function so that
1587 * the config parser can report an appropriate error when a known keyword was
1588 * not enabled.
1589 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001590static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001591 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001592 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1593 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1594 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1595 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1596 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1597 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001598 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001599 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001600 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001601}};
1602
Willy Tarreau0108d902018-11-25 19:14:37 +01001603INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1604
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001605/* config keyword parsers */
1606static struct cfg_kw_list cfg_kws = {ILH, {
1607 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1608 { 0, NULL, NULL }
1609}};
1610
1611INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1612
Willy Tarreau645513a2010-05-24 20:55:15 +02001613/*
1614 * Local variables:
1615 * c-indent-level: 8
1616 * c-basic-offset: 8
1617 * End:
1618 */