blob: 9bc109702a90c2e6b7fbc16dd86be0ee710bc230 [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:
258 _HA_ATOMIC_ADD(&px->li_paused, 1);
259 break;
260 case LI_LISTEN:
261 _HA_ATOMIC_ADD(&px->li_bound, 1);
262 break;
263 case LI_READY:
264 case LI_FULL:
265 case LI_LIMITED:
266 _HA_ATOMIC_ADD(&px->li_ready, 1);
267 break;
268 }
269 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200270 l->state = st;
271}
272
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100273/* This function adds the specified listener's file descriptor to the polling
274 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500275 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200276 * also support binding only the relevant processes to their respective
277 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100278 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200279void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100280{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100281 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100282 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200283 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200284 !(proc_mask(listener->rx.settings->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200285 /* we don't want to enable this listener and don't
286 * want any fd event to reach it.
287 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200288 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100289 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200290 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100291 do_unbind_listener(listener, 0);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200292 listener_set_state(listener, LI_LISTEN);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200293 }
Willy Tarreauae302532014-05-07 19:22:24 +0200294 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100295 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau38ba6472020-08-27 08:16:52 +0200296 fd_want_recv(listener->rx.fd);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200297 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200298 }
299 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200300 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100301 }
302 }
William Lallemande22f11f2018-09-11 10:06:27 +0200303 /* if this listener is supposed to be only in the master, close it in the workers */
304 if ((global.mode & MODE_MWORKER) &&
305 (listener->options & LI_O_MWORKER) &&
306 master == 0) {
307 do_unbind_listener(listener, 1);
308 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100309 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100310}
311
Willy Tarreaube58c382011-07-24 18:28:10 +0200312/* This function tries to temporarily disable a listener, depending on the OS
313 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
314 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
315 * closes upon SHUT_WR and refuses to rebind. So a common validation path
316 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
317 * is disabled. It normally returns non-zero, unless an error is reported.
318 */
319int pause_listener(struct listener *l)
320{
Willy Tarreau58651b42020-09-24 16:03:29 +0200321 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200322 int ret = 1;
323
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100324 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200325
Willy Tarreau02e19752020-09-23 17:17:22 +0200326 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
327 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
328 goto end;
329
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200330 if (l->state <= LI_PAUSED)
331 goto end;
332
Willy Tarreaub7436612020-08-28 19:51:44 +0200333 if (l->rx.proto->pause) {
Willy Tarreau092d8652014-07-07 20:22:12 +0200334 /* Returns < 0 in case of failure, 0 if the listener
335 * was totally stopped, or > 0 if correctly paused.
336 */
Willy Tarreaufb76bd52020-09-24 18:07:48 +0200337 ret = l->rx.proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200338
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200339 if (ret < 0) {
340 ret = 0;
341 goto end;
342 }
Willy Tarreaufb76bd52020-09-24 18:07:48 +0200343 ret = 1;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200344 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200345
Olivier Houchard859dc802019-08-08 15:47:21 +0200346 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200347
Willy Tarreaua37b2442020-09-24 07:23:45 +0200348 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200349
350 if (px && !px->li_ready) {
351 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
352 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
353 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200354 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100355 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200356 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200357}
358
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200359/* This function tries to resume a temporarily disabled listener. Paused, full,
360 * limited and disabled listeners are handled, which means that this function
361 * may replace enable_listener(). The resulting state will either be LI_READY
362 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200363 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200364 * foreground mode, and are ignored. If the listener was only in the assigned
365 * state, it's totally rebound. This can happen if a pause() has completely
366 * stopped it. If the resume fails, 0 is returned and an error might be
367 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200368 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100369int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200370{
Willy Tarreau58651b42020-09-24 16:03:29 +0200371 struct proxy *px = l->bind_conf->frontend;
372 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200373 int ret = 1;
374
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100375 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200376
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200377 /* check that another thread didn't to the job in parallel (e.g. at the
378 * end of listen_accept() while we'd come from dequeue_all_listeners().
379 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200380 if (MT_LIST_ADDED(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200381 goto end;
382
William Lallemand095ba4c2017-06-01 17:38:50 +0200383 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200384 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200385 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100386
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200387 if (l->state == LI_READY)
388 goto end;
389
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200390 if (l->state == LI_ASSIGNED) {
391 char msg[100];
392 int err;
393
Willy Tarreaub3580b12020-09-01 10:26:22 +0200394 err = l->rx.proto->listen(l, msg, sizeof(msg));
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200395 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100396 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200397 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100398 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200399
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200400 if (err & (ERR_FATAL | ERR_ABORT)) {
401 ret = 0;
402 goto end;
403 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200404 }
405
Willy Tarreauc6dac6c2020-09-23 17:34:22 +0200406 if (l->state < LI_PAUSED) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200407 ret = 0;
408 goto end;
409 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200410
Willy Tarreaub7436612020-08-28 19:51:44 +0200411 if (l->rx.proto->sock_prot == IPPROTO_TCP &&
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200412 l->state == LI_PAUSED &&
Willy Tarreau38ba6472020-08-27 08:16:52 +0200413 listen(l->rx.fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200414 ret = 0;
415 goto end;
416 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200417
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100418 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200419 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200420 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200421 }
422
Willy Tarreau38ba6472020-08-27 08:16:52 +0200423 fd_want_recv(l->rx.fd);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200424 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200425
426 done:
427 if (was_paused && !px->li_paused) {
428 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
429 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
430 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200431 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100432 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200433 return ret;
434}
435
Willy Tarreau87b09662015-04-03 00:22:06 +0200436/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200437 * it upon next close() using resume_listener().
438 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200439static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200440{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100441 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200442 if (l->state >= LI_READY) {
Olivier Houchard859dc802019-08-08 15:47:21 +0200443 MT_LIST_DEL(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100444 if (l->state != LI_FULL) {
Willy Tarreau38ba6472020-08-27 08:16:52 +0200445 fd_stop_recv(l->rx.fd);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200446 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100447 }
Willy Tarreau62793712011-07-24 19:23:38 +0200448 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100449 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200450}
451
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200452/* Marks a ready listener as limited so that we only try to re-enable it when
453 * resources are free again. It will be queued into the specified queue.
454 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200455static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200456{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100457 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200458 if (l->state == LI_READY) {
Willy Tarreaude4db172020-07-10 08:10:29 +0200459 MT_LIST_TRY_ADDQ(list, &l->wait_queue);
Willy Tarreau38ba6472020-08-27 08:16:52 +0200460 fd_stop_recv(l->rx.fd);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200461 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200462 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100463 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200464}
465
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100466/* This function adds all of the protocol's listener's file descriptors to the
467 * polling lists when they are in the LI_LISTEN state. It is intended to be
468 * used as a protocol's generic enable_all() primitive, for use after the
469 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
470 * their number of connections. It always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200471 *
472 * Must be called with proto_lock held.
473 *
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100474 */
475int enable_all_listeners(struct protocol *proto)
476{
477 struct listener *listener;
478
Willy Tarreaub7436612020-08-28 19:51:44 +0200479 list_for_each_entry(listener, &proto->listeners, rx.proto_list)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100480 enable_listener(listener);
481 return ERR_NONE;
482}
483
Willy Tarreau241797a2019-12-10 14:10:52 +0100484/* Dequeues all listeners waiting for a resource the global wait queue */
485void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200486{
Willy Tarreau01abd022019-02-28 10:27:18 +0100487 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200488
Willy Tarreau241797a2019-12-10 14:10:52 +0100489 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200490 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100491 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200492 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100493 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200494 }
495}
496
Willy Tarreau241797a2019-12-10 14:10:52 +0100497/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
498void dequeue_proxy_listeners(struct proxy *px)
499{
500 struct listener *listener;
501
502 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
503 /* This cannot fail because the listeners are by definition in
504 * the LI_LIMITED state.
505 */
506 resume_listener(listener);
507 }
508}
509
Christopher Faulet510c0d62018-03-16 10:04:47 +0100510/* Must be called with the lock held. Depending on <do_close> value, it does
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200511 * what unbind_listener or unbind_listener_no_close should do. It can also
512 * close a zombie listener's FD when called in early states.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100513 */
514void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100515{
Olivier Houcharda5188562019-03-08 15:35:42 +0100516 if (listener->state == LI_READY && fd_updt)
Willy Tarreau38ba6472020-08-27 08:16:52 +0200517 fd_stop_recv(listener->rx.fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100518
Olivier Houchard859dc802019-08-08 15:47:21 +0200519 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200520
Willy Tarreaube58c382011-07-24 18:28:10 +0200521 if (listener->state >= LI_PAUSED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200522 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau38ba6472020-08-27 08:16:52 +0200523 fd_stop_both(listener->rx.fd);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200524 }
525
526 if (do_close && listener->rx.fd != -1) {
527 fd_delete(listener->rx.fd);
528 listener->rx.flags &= ~RX_F_BOUND;
529 listener->rx.fd = -1;
Willy Tarreaub648d632007-10-28 22:13:50 +0100530 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100531}
532
Olivier Houchard1fc05162017-04-06 01:05:05 +0200533/* This function closes the listening socket for the specified listener,
534 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100535 * LI_ASSIGNED state. This function is intended to be used as a generic
536 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200537 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100538void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200539{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100540 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100541 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100542 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200543}
544
545/* This function pretends the listener is dead, but keeps the FD opened, so
546 * that we can provide it, for conf reloading.
547 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100548void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200549{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100550 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100551 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100552 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200553}
554
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200555/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
556 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200557 * allocation). The address family is taken from ss->ss_family, and the protocol
558 * passed in <proto> must be usable on this family. The number of jobs and
559 * listeners is automatically increased by the number of listeners created. It
560 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200561 */
562int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200563 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200564{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200565 struct listener *l;
566 int port;
567
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200568 for (port = portl; port <= porth; port++) {
569 l = calloc(1, sizeof(*l));
570 if (!l) {
571 memprintf(err, "out of memory");
572 return 0;
573 }
574 l->obj_type = OBJ_TYPE_LISTENER;
575 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
576 LIST_ADDQ(&bc->listeners, &l->by_bind);
577 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200578 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200579 l->rx.owner = l;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200580 l->rx.fd = fd;
Willy Tarreau37159062020-08-27 07:48:42 +0200581 memcpy(&l->rx.addr, ss, sizeof(*ss));
Olivier Houchard859dc802019-08-08 15:47:21 +0200582 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200583 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200584
585 proto->add(l, port);
586
Willy Tarreau909c23b2020-09-15 13:50:58 +0200587 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200588 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100589
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100590 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100591 _HA_ATOMIC_ADD(&jobs, 1);
592 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200593 }
594 return 1;
595}
596
Willy Tarreau1a64d162007-10-28 22:26:05 +0100597/* Delete a listener from its protocol's list of listeners. The listener's
598 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200599 * number of listeners is updated, as well as the global number of listeners
600 * and jobs. Note that the listener must have previously been unbound. This
601 * is the generic function to use to remove a listener.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200602 *
603 * Will grab the proto_lock.
604 *
Willy Tarreau1a64d162007-10-28 22:26:05 +0100605 */
606void delete_listener(struct listener *listener)
607{
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200608 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100609 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100610 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200611 listener_set_state(listener, LI_INIT);
Willy Tarreaub7436612020-08-28 19:51:44 +0200612 LIST_DEL(&listener->rx.proto_list);
613 listener->rx.proto->nb_listeners--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100614 _HA_ATOMIC_SUB(&jobs, 1);
615 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100616 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100617 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200618 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100619}
620
Willy Tarreaue2711c72019-02-27 15:39:41 +0100621/* Returns a suitable value for a listener's backlog. It uses the listener's,
622 * otherwise the frontend's backlog, otherwise the listener's maxconn,
623 * otherwise the frontend's maxconn, otherwise 1024.
624 */
625int listener_backlog(const struct listener *l)
626{
627 if (l->backlog)
628 return l->backlog;
629
630 if (l->bind_conf->frontend->backlog)
631 return l->bind_conf->frontend->backlog;
632
633 if (l->maxconn)
634 return l->maxconn;
635
636 if (l->bind_conf->frontend->maxconn)
637 return l->bind_conf->frontend->maxconn;
638
639 return 1024;
640}
641
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200642/* This function is called on a read event from a listening socket, corresponding
643 * to an accept. It tries to accept as many connections as possible, and for each
644 * calls the listener's accept handler (generally the frontend's accept handler).
645 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200646void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200647{
648 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100649 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200650 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100651 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100652 int next_feconn = 0;
653 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200654 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200655 int cfd;
656 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100657#ifdef USE_ACCEPT4
658 static int accept4_broken;
659#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200660
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100661 if (!l)
662 return;
663 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200664
665 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
666 * illimited, but it is probably enough.
667 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100668 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200669
Willy Tarreau93e7c002013-10-07 18:51:07 +0200670 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
671 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200672
673 if (unlikely(!max)) {
674 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200675 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100676 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200677 }
678
679 if (max_accept > max)
680 max_accept = max;
681 }
682
683 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200684 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
685
686 if (unlikely(!max)) {
687 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200688 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100689 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200690 }
691
692 if (max_accept > max)
693 max_accept = max;
694 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200695#ifdef USE_OPENSSL
696 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
697 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200698
Willy Tarreaue43d5322013-10-07 20:01:52 +0200699 if (unlikely(!max)) {
700 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200701 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100702 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200703 }
704
705 if (max_accept > max)
706 max_accept = max;
707 }
708#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200709 if (p && p->fe_sps_lim) {
710 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
711
712 if (unlikely(!max)) {
713 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100714 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
715 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200716 }
717
718 if (max_accept > max)
719 max_accept = max;
720 }
721
722 /* Note: if we fail to allocate a connection because of configured
723 * limits, we'll schedule a new attempt worst 1 second later in the
724 * worst case. If we fail due to system limits or temporary resource
725 * shortage, we try again 100ms later in the worst case.
726 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200727 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200728 struct sockaddr_storage addr;
729 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200730 unsigned int count;
Willy Tarreauaf613e82020-06-05 08:40:51 +0200731 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200732
Willy Tarreau82c97892019-02-27 19:32:32 +0100733 /* pre-increase the number of connections without going too far.
734 * We process the listener, then the proxy, then the process.
735 * We know which ones to unroll based on the next_xxx value.
736 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100737 do {
738 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100739 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100740 /* the listener was marked full or another
741 * thread is going to do it.
742 */
743 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100744 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100745 goto end;
746 }
747 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000748 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100749
Willy Tarreau82c97892019-02-27 19:32:32 +0100750 if (p) {
751 do {
752 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100753 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100754 /* the frontend was marked full or another
755 * thread is going to do it.
756 */
757 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100758 expire = TICK_ETERNITY;
759 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100760 }
761 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100762 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200763 }
764
Willy Tarreau82c97892019-02-27 19:32:32 +0100765 if (!(l->options & LI_O_UNLIMITED)) {
766 do {
767 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100768 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100769 /* the process was marked full or another
770 * thread is going to do it.
771 */
772 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100773 expire = tick_add(now_ms, 1000); /* try again in 1 second */
774 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100775 }
776 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000777 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200778 }
779
William Lallemand2fe7dd02018-09-11 16:51:29 +0200780 /* with sockpair@ we don't want to do an accept */
Willy Tarreau37159062020-08-27 07:48:42 +0200781 if (unlikely(l->rx.addr.ss_family == AF_CUST_SOCKPAIR)) {
William Lallemand2fe7dd02018-09-11 16:51:29 +0200782 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100783 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100784 /* just like with UNIX sockets, only the family is filled */
785 addr.ss_family = AF_UNIX;
786 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200787 } else
788
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200789#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100790 /* only call accept4() if it's known to be safe, otherwise
791 * fallback to the legacy accept() + fcntl().
792 */
793 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100794 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100795 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
796 (accept4_broken = 1))))
797#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200798 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100799 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100800
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200801 if (unlikely(cfd == -1)) {
802 switch (errno) {
803 case EAGAIN:
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100804 if (fdtab[fd].ev & (FD_POLL_HUP|FD_POLL_ERR)) {
Willy Tarreaubb660302014-05-07 19:47:02 +0200805 /* the listening socket might have been disabled in a shared
806 * process and we're a collateral victim. We'll just pause for
807 * a while in case it comes back. In the mean time, we need to
808 * clear this sticky flag.
809 */
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100810 _HA_ATOMIC_AND(&fdtab[fd].ev, ~(FD_POLL_HUP|FD_POLL_ERR));
Willy Tarreaubb660302014-05-07 19:47:02 +0200811 goto transient_error;
812 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200813 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200814 case EINVAL:
815 /* might be trying to accept on a shut fd (eg: soft stop) */
816 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100817 case EINTR:
818 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100819 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100820 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100821 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100822 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100823 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100824 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200825 case ENFILE:
826 if (p)
827 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100828 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
829 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200830 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200831 case EMFILE:
832 if (p)
833 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100834 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
835 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200836 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200837 case ENOBUFS:
838 case ENOMEM:
839 if (p)
840 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100841 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
842 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200843 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200844 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100845 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau92079932019-12-10 09:30:05 +0100846 max_accept = 0;
847 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200848 }
849 }
850
William Lallemandd9138002018-11-27 12:02:39 +0100851 /* we don't want to leak the FD upon reload if it's in the master */
852 if (unlikely(master == 1))
853 fcntl(cfd, F_SETFD, FD_CLOEXEC);
854
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100855 /* The connection was accepted, it must be counted as such */
856 if (l->counters)
857 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
858
Willy Tarreau82c97892019-02-27 19:32:32 +0100859 if (p)
860 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
861
862 proxy_inc_fe_conn_ctr(l, p);
863
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100864 if (!(l->options & LI_O_UNLIMITED)) {
865 count = update_freq_ctr(&global.conn_per_sec, 1);
866 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100867 }
868
Willy Tarreau64a9c052019-04-12 15:27:17 +0200869 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
870
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200871 if (unlikely(cfd >= global.maxsock)) {
872 send_log(p, LOG_EMERG,
873 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
874 p->id);
875 close(cfd);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100876 expire = tick_add(now_ms, 1000); /* try again in 1 second */
877 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200878 }
879
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100880 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100881 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
882 * allows the error path not to rollback on nbconn. It's more
883 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100884 */
885 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100886 next_feconn = 0;
887 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200888
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100889#if defined(USE_THREAD)
Willy Tarreau818a92e2020-09-03 07:50:19 +0200890 mask = thread_mask(l->rx.settings->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100891 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100892 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100893 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100894
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100895 /* The principle is that we have two running indexes,
896 * each visiting in turn all threads bound to this
897 * listener. The connection will be assigned to the one
898 * with the least connections, and the other one will
899 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100900 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100901 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100902 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100903
904 /* keep a copy for the final update. thr_idx is composite
905 * and made of (t2<<16) + t1.
906 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100907 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100908 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100909 unsigned long m1, m2;
910 int q1, q2;
911
912 t2 = t1 = t0;
913 t2 >>= 16;
914 t1 &= 0xFFFF;
915
916 /* t1 walks low to high bits ;
917 * t2 walks high to low.
918 */
919 m1 = mask >> t1;
920 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
921
Willy Tarreau85d04242019-04-16 18:09:13 +0200922 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100923 m1 &= ~1UL;
924 if (!m1) {
925 m1 = mask;
926 t1 = 0;
927 }
928 t1 += my_ffsl(m1) - 1;
929 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100930
Willy Tarreau85d04242019-04-16 18:09:13 +0200931 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
932 /* highest bit not set */
933 if (!m2)
934 m2 = mask;
935
936 t2 = my_flsl(m2) - 1;
937 }
938
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100939 /* now we have two distinct thread IDs belonging to the mask */
940 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
941 if (q1 >= ACCEPT_QUEUE_SIZE)
942 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100943
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100944 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
945 if (q2 >= ACCEPT_QUEUE_SIZE)
946 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100947
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100948 /* we have 3 possibilities now :
949 * q1 < q2 : t1 is less loaded than t2, so we pick it
950 * and update t2 (since t1 might still be
951 * lower than another thread)
952 * q1 > q2 : t2 is less loaded than t1, so we pick it
953 * and update t1 (since t2 might still be
954 * lower than another thread)
955 * q1 = q2 : both are equally loaded, thus we pick t1
956 * and update t1 as it will become more loaded
957 * than t2.
958 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100959
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100960 q1 += l->thr_conn[t1];
961 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100962
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100963 if (q1 - q2 < 0) {
964 t = t1;
965 t2 = t2 ? t2 - 1 : LONGBITS - 1;
966 }
967 else if (q1 - q2 > 0) {
968 t = t2;
969 t1++;
970 if (t1 >= LONGBITS)
971 t1 = 0;
972 }
973 else {
974 t = t1;
975 t1++;
976 if (t1 >= LONGBITS)
977 t1 = 0;
978 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100979
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100980 /* new value for thr_idx */
981 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +0100982 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100983
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100984 /* We successfully selected the best thread "t" for this
985 * connection. We use deferred accepts even if it's the
986 * local thread because tests show that it's the best
987 * performing model, likely due to better cache locality
988 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100989 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100990 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100991 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +0100992 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200993 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100994 continue;
995 }
996 /* If the ring is full we do a synchronous accept on
997 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100998 */
Olivier Houchard64213e92019-03-08 18:52:57 +0100999 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001000 }
1001#endif // USE_THREAD
1002
Olivier Houchard64213e92019-03-08 18:52:57 +01001003 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001004 ret = l->accept(l, cfd, &addr);
1005 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001006 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001007 * we just have to ignore it (ret == 0) or it's a critical
1008 * error due to a resource shortage, and we must stop the
1009 * listener (ret < 0).
1010 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001011 if (ret == 0) /* successful termination */
1012 continue;
1013
Willy Tarreaubb660302014-05-07 19:47:02 +02001014 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001015 }
1016
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001017 /* increase the per-process number of cumulated sessions, this
1018 * may only be done once l->accept() has accepted the connection.
1019 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001020 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001021 count = update_freq_ctr(&global.sess_per_sec, 1);
1022 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001023 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001024#ifdef USE_OPENSSL
1025 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001026 count = update_freq_ctr(&global.ssl_per_sec, 1);
1027 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001028 }
1029#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001030
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001031 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001032 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001033
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001034 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001035 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001036 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001037
Willy Tarreau82c97892019-02-27 19:32:32 +01001038 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001039 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001040
1041 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001042 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001043
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001044 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreaucdcba112019-12-11 15:06:30 +01001045 (l->state == LI_LIMITED &&
1046 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1047 (!tick_isset(global_listener_queue_task->expire) ||
1048 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001049 /* at least one thread has to this when quitting */
1050 resume_listener(l);
1051
1052 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001053 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001054
Olivier Houchard859dc802019-08-08 15:47:21 +02001055 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001056 (!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 +01001057 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001058 }
Willy Tarreau4c044e22019-12-05 07:40:32 +01001059
Willy Tarreau92079932019-12-10 09:30:05 +01001060 /* Now it's getting tricky. The listener was supposed to be in LI_READY
1061 * state but in the mean time we might have changed it to LI_FULL or
1062 * LI_LIMITED, and another thread might also have turned it to
1063 * LI_PAUSED, LI_LISTEN or even LI_INI when stopping a proxy. We must
1064 * be certain to keep the FD enabled when in the READY state but we
1065 * must also stop it for other states that we might have switched to
1066 * while others re-enabled polling.
1067 */
1068 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
1069 if (l->state == LI_READY) {
1070 if (max_accept > 0)
1071 fd_cant_recv(fd);
1072 else
1073 fd_done_recv(fd);
1074 } else if (l->state > LI_ASSIGNED) {
Willy Tarreau38ba6472020-08-27 08:16:52 +02001075 fd_stop_recv(l->rx.fd);
Willy Tarreau92079932019-12-10 09:30:05 +01001076 }
1077 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001078 return;
1079
1080 transient_error:
1081 /* pause the listener for up to 100 ms */
1082 expire = tick_add(now_ms, 100);
1083
1084 limit_global:
1085 /* (re-)queue the listener to the global queue and set it to expire no
1086 * later than <expire> ahead. The listener turns to LI_LIMITED.
1087 */
1088 limit_listener(l, &global_listener_queue);
1089 task_schedule(global_listener_queue_task, expire);
1090 goto end;
1091
1092 limit_proxy:
1093 /* (re-)queue the listener to the proxy's queue and set it to expire no
1094 * later than <expire> ahead. The listener turns to LI_LIMITED.
1095 */
1096 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001097 if (p->task && tick_isset(expire))
1098 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001099 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001100}
1101
Willy Tarreau05f50472017-09-15 09:19:58 +02001102/* Notify the listener that a connection initiated from it was released. This
1103 * is used to keep the connection count consistent and to possibly re-open
1104 * listening when it was limited.
1105 */
1106void listener_release(struct listener *l)
1107{
1108 struct proxy *fe = l->bind_conf->frontend;
1109
1110 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001111 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001112 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001113 _HA_ATOMIC_SUB(&fe->feconn, 1);
1114 _HA_ATOMIC_SUB(&l->nbconn, 1);
1115 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001116
1117 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001118 resume_listener(l);
1119
1120 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001121 dequeue_all_listeners();
Willy Tarreau05f50472017-09-15 09:19:58 +02001122
Olivier Houchard859dc802019-08-08 15:47:21 +02001123 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001124 (!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 +01001125 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001126}
1127
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001128/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1129static int listener_queue_init()
1130{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001131 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1132 if (!global_listener_queue_task) {
1133 ha_alert("Out of memory when initializing global listener queue\n");
1134 return ERR_FATAL|ERR_ABORT;
1135 }
1136 /* very simple initialization, users will queue the task if needed */
1137 global_listener_queue_task->context = NULL; /* not even a context! */
1138 global_listener_queue_task->process = manage_global_listener_queue;
1139
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001140 return 0;
1141}
1142
1143static void listener_queue_deinit()
1144{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001145 task_destroy(global_listener_queue_task);
1146 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001147}
1148
1149REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1150REGISTER_POST_DEINIT(listener_queue_deinit);
1151
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001152
1153/* This is the global management task for listeners. It enables listeners waiting
1154 * for global resources when there are enough free resource, or at least once in
1155 * a while. It is designed to be called as a task.
1156 */
1157static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state)
1158{
1159 /* If there are still too many concurrent connections, let's wait for
1160 * some of them to go away. We don't need to re-arm the timer because
1161 * each of them will scan the queue anyway.
1162 */
1163 if (unlikely(actconn >= global.maxconn))
1164 goto out;
1165
1166 /* We should periodically try to enable listeners waiting for a global
1167 * resource here, because it is possible, though very unlikely, that
1168 * they have been blocked by a temporary lack of global resource such
1169 * as a file descriptor or memory and that the temporary condition has
1170 * disappeared.
1171 */
1172 dequeue_all_listeners();
1173
1174 out:
1175 t->expire = TICK_ETERNITY;
1176 task_queue(t);
1177 return t;
1178}
1179
Willy Tarreau26982662012-09-12 23:17:10 +02001180/*
1181 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1182 * parsing sessions.
1183 */
1184void bind_register_keywords(struct bind_kw_list *kwl)
1185{
1186 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1187}
1188
1189/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1190 * keyword is found with a NULL ->parse() function, then an attempt is made to
1191 * find one with a valid ->parse() function. This way it is possible to declare
1192 * platform-dependant, known keywords as NULL, then only declare them as valid
1193 * if some options are met. Note that if the requested keyword contains an
1194 * opening parenthesis, everything from this point is ignored.
1195 */
1196struct bind_kw *bind_find_kw(const char *kw)
1197{
1198 int index;
1199 const char *kwend;
1200 struct bind_kw_list *kwl;
1201 struct bind_kw *ret = NULL;
1202
1203 kwend = strchr(kw, '(');
1204 if (!kwend)
1205 kwend = kw + strlen(kw);
1206
1207 list_for_each_entry(kwl, &bind_keywords.list, list) {
1208 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1209 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1210 kwl->kw[index].kw[kwend-kw] == 0) {
1211 if (kwl->kw[index].parse)
1212 return &kwl->kw[index]; /* found it !*/
1213 else
1214 ret = &kwl->kw[index]; /* may be OK */
1215 }
1216 }
1217 }
1218 return ret;
1219}
1220
Willy Tarreau8638f482012-09-18 18:01:17 +02001221/* Dumps all registered "bind" keywords to the <out> string pointer. The
1222 * unsupported keywords are only dumped if their supported form was not
1223 * found.
1224 */
1225void bind_dump_kws(char **out)
1226{
1227 struct bind_kw_list *kwl;
1228 int index;
1229
Christopher Faulet784063e2020-05-18 12:14:18 +02001230 if (!out)
1231 return;
1232
Willy Tarreau8638f482012-09-18 18:01:17 +02001233 *out = NULL;
1234 list_for_each_entry(kwl, &bind_keywords.list, list) {
1235 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1236 if (kwl->kw[index].parse ||
1237 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001238 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1239 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001240 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001241 kwl->kw[index].skip ? " <arg>" : "",
1242 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001243 }
1244 }
1245 }
1246}
1247
Willy Tarreau645513a2010-05-24 20:55:15 +02001248/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001249/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001250/************************************************************************/
1251
Willy Tarreaua5e37562011-12-16 17:06:15 +01001252/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001253static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001254smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001255{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001256 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001257 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001258 return 1;
1259}
1260
Willy Tarreaua5e37562011-12-16 17:06:15 +01001261/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001262static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001263smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001264{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001265 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001266 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001267 return 1;
1268}
Jerome Magnineb421b22020-03-27 22:08:40 +01001269static int
1270smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1271{
1272 smp->data.u.str.area = smp->sess->listener->name;
1273 if (!smp->data.u.str.area)
1274 return 0;
1275
1276 smp->data.type = SMP_T_STR;
1277 smp->flags = SMP_F_CONST;
1278 smp->data.u.str.data = strlen(smp->data.u.str.area);
1279 return 1;
1280}
Willy Tarreau645513a2010-05-24 20:55:15 +02001281
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001282/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001283static 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 +02001284{
1285 struct listener *l;
1286
Willy Tarreau4348fad2012-09-20 16:48:07 +02001287 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001288 l->options |= LI_O_ACC_PROXY;
1289
1290 return 0;
1291}
1292
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001293/* parse the "accept-netscaler-cip" bind keyword */
1294static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1295{
1296 struct listener *l;
1297 uint32_t val;
1298
1299 if (!*args[cur_arg + 1]) {
1300 memprintf(err, "'%s' : missing value", args[cur_arg]);
1301 return ERR_ALERT | ERR_FATAL;
1302 }
1303
1304 val = atol(args[cur_arg + 1]);
1305 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001306 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001307 return ERR_ALERT | ERR_FATAL;
1308 }
1309
1310 list_for_each_entry(l, &conf->listeners, by_bind) {
1311 l->options |= LI_O_ACC_CIP;
1312 conf->ns_cip_magic = val;
1313 }
1314
1315 return 0;
1316}
1317
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001318/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001319static 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 +02001320{
1321 struct listener *l;
1322 int val;
1323
1324 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001325 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001326 return ERR_ALERT | ERR_FATAL;
1327 }
1328
1329 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001330 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001331 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001332 return ERR_ALERT | ERR_FATAL;
1333 }
1334
Willy Tarreau4348fad2012-09-20 16:48:07 +02001335 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001336 l->backlog = val;
1337
1338 return 0;
1339}
1340
1341/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001342static 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 +02001343{
1344 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001345 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001346 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001347
Willy Tarreau4348fad2012-09-20 16:48:07 +02001348 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001349 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001350 return ERR_ALERT | ERR_FATAL;
1351 }
1352
1353 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001354 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001355 return ERR_ALERT | ERR_FATAL;
1356 }
1357
Willy Tarreau4348fad2012-09-20 16:48:07 +02001358 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001359 new->luid = strtol(args[cur_arg + 1], &error, 10);
1360 if (*error != '\0') {
1361 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1362 return ERR_ALERT | ERR_FATAL;
1363 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001364 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001365
Willy Tarreau4348fad2012-09-20 16:48:07 +02001366 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001367 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001368 return ERR_ALERT | ERR_FATAL;
1369 }
1370
Willy Tarreau4348fad2012-09-20 16:48:07 +02001371 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001372 if (node) {
1373 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001374 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1375 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1376 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001377 return ERR_ALERT | ERR_FATAL;
1378 }
1379
Willy Tarreau4348fad2012-09-20 16:48:07 +02001380 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001381 return 0;
1382}
1383
1384/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001385static 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 +02001386{
1387 struct listener *l;
1388 int val;
1389
1390 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001391 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001392 return ERR_ALERT | ERR_FATAL;
1393 }
1394
1395 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001396 if (val < 0) {
1397 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001398 return ERR_ALERT | ERR_FATAL;
1399 }
1400
Willy Tarreau4348fad2012-09-20 16:48:07 +02001401 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001402 l->maxconn = val;
1403
1404 return 0;
1405}
1406
1407/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001408static 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 +02001409{
1410 struct listener *l;
1411
1412 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001413 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001414 return ERR_ALERT | ERR_FATAL;
1415 }
1416
Willy Tarreau4348fad2012-09-20 16:48:07 +02001417 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001418 l->name = strdup(args[cur_arg + 1]);
1419
1420 return 0;
1421}
1422
1423/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001424static 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 +02001425{
1426 struct listener *l;
1427 int val;
1428
1429 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001430 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001431 return ERR_ALERT | ERR_FATAL;
1432 }
1433
1434 val = atol(args[cur_arg + 1]);
1435 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001436 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001437 return ERR_ALERT | ERR_FATAL;
1438 }
1439
Willy Tarreau4348fad2012-09-20 16:48:07 +02001440 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001441 l->nice = val;
1442
1443 return 0;
1444}
1445
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001446/* parse the "process" bind keyword */
1447static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1448{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001449 char *slash;
1450 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001451
Christopher Fauletc644fa92017-11-23 22:44:11 +01001452 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1453 *slash = 0;
1454
Willy Tarreauff9c9142019-02-07 10:39:36 +01001455 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001456 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001457 return ERR_ALERT | ERR_FATAL;
1458 }
1459
Christopher Fauletc644fa92017-11-23 22:44:11 +01001460 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001461 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001462 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1463 return ERR_ALERT | ERR_FATAL;
1464 }
1465 *slash = '/';
1466 }
1467
Willy Tarreaue26993c2020-09-03 07:18:55 +02001468 conf->settings.bind_proc |= proc;
1469 conf->settings.bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001470 return 0;
1471}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001472
Christopher Fauleta717b992018-04-10 14:43:00 +02001473/* parse the "proto" bind keyword */
1474static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1475{
1476 struct ist proto;
1477
1478 if (!*args[cur_arg + 1]) {
1479 memprintf(err, "'%s' : missing value", args[cur_arg]);
1480 return ERR_ALERT | ERR_FATAL;
1481 }
1482
1483 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1484 conf->mux_proto = get_mux_proto(proto);
1485 if (!conf->mux_proto) {
1486 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1487 return ERR_ALERT | ERR_FATAL;
1488 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001489 return 0;
1490}
1491
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001492/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1493static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1494 struct proxy *defpx, const char *file, int line,
1495 char **err)
1496{
1497 if (too_many_args(1, args, err, NULL))
1498 return -1;
1499
1500 if (strcmp(args[1], "on") == 0)
1501 global.tune.options |= GTUNE_LISTENER_MQ;
1502 else if (strcmp(args[1], "off") == 0)
1503 global.tune.options &= ~GTUNE_LISTENER_MQ;
1504 else {
1505 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1506 return -1;
1507 }
1508 return 0;
1509}
1510
Willy Tarreau61612d42012-04-19 18:42:05 +02001511/* Note: must not be declared <const> as its list will be overwritten.
1512 * Please take care of keeping this list alphabetically sorted.
1513 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001514static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001515 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1516 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001517 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001518 { /* END */ },
1519}};
1520
Willy Tarreau0108d902018-11-25 19:14:37 +01001521INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1522
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001523/* Note: must not be declared <const> as its list will be overwritten.
1524 * Please take care of keeping this list alphabetically sorted.
1525 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001526static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001527 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001528}};
1529
Willy Tarreau0108d902018-11-25 19:14:37 +01001530INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1531
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001532/* Note: must not be declared <const> as its list will be overwritten.
1533 * Please take care of keeping this list alphabetically sorted, doing so helps
1534 * all code contributors.
1535 * Optional keywords are also declared with a NULL ->parse() function so that
1536 * the config parser can report an appropriate error when a known keyword was
1537 * not enabled.
1538 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001539static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001540 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001541 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1542 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1543 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1544 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1545 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1546 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001547 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001548 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001549 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001550}};
1551
Willy Tarreau0108d902018-11-25 19:14:37 +01001552INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1553
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001554/* config keyword parsers */
1555static struct cfg_kw_list cfg_kws = {ILH, {
1556 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1557 { 0, NULL, NULL }
1558}};
1559
1560INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1561
Willy Tarreau645513a2010-05-24 20:55:15 +02001562/*
1563 * Local variables:
1564 * c-indent-level: 8
1565 * c-basic-offset: 8
1566 * End:
1567 */