blob: cad0e0cc8474ac215f99cf3cf5aabb3e8dc3a575 [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
Olivier Houchardf73629d2017-04-05 22:33:04 +020047struct xfer_sock_list *xfer_sock_list = NULL;
48
Willy Tarreauf2cb1692019-07-11 10:08:31 +020049/* there is one listener queue per thread so that a thread unblocking the
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +050050 * global queue can wake up listeners bound only to foreign threads by
Willy Tarreau2bd65a72019-09-24 06:55:18 +020051 * moving them to the remote queues and waking up the associated tasklet.
Willy Tarreauf2cb1692019-07-11 10:08:31 +020052 */
53static struct work_list *local_listener_queue;
54
Willy Tarreaua1d97f82019-12-10 11:18:41 +010055/* list of the temporarily limited listeners because of lack of resource */
56static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
57static struct task *global_listener_queue_task;
58static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state);
59
60
Willy Tarreau1efafce2019-01-27 15:37:19 +010061#if defined(USE_THREAD)
62
63struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
64
65/* dequeue and process a pending connection from the local accept queue (single
66 * consumer). Returns the accepted fd or -1 if none was found. The listener is
67 * placed into *li. The address is copied into *addr for no more than *addr_len
68 * bytes, and the address length is returned into *addr_len.
69 */
70int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
71{
72 struct accept_queue_entry *e;
73 unsigned int pos, next;
74 struct listener *ptr;
75 int len;
76 int fd;
77
78 pos = ring->head;
79
80 if (pos == ring->tail)
81 return -1;
82
83 next = pos + 1;
84 if (next >= ACCEPT_QUEUE_SIZE)
85 next = 0;
86
87 e = &ring->entry[pos];
88
89 /* wait for the producer to update the listener's pointer */
90 while (1) {
91 ptr = e->listener;
92 __ha_barrier_load();
93 if (ptr)
94 break;
95 pl_cpu_relax();
96 }
97
98 fd = e->fd;
99 len = e->addr_len;
100 if (len > *addr_len)
101 len = *addr_len;
102
103 if (likely(len > 0))
104 memcpy(addr, &e->addr, len);
105
106 /* release the entry */
107 e->listener = NULL;
108
109 __ha_barrier_store();
110 ring->head = next;
111
112 *addr_len = len;
113 *li = ptr;
114
115 return fd;
116}
117
118
119/* tries to push a new accepted connection <fd> into ring <ring> for listener
120 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
121 * succeeds, or zero if the ring is full. Supports multiple producers.
122 */
123int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
124 struct listener *li, const void *addr, int addr_len)
125{
126 struct accept_queue_entry *e;
127 unsigned int pos, next;
128
129 pos = ring->tail;
130 do {
131 next = pos + 1;
132 if (next >= ACCEPT_QUEUE_SIZE)
133 next = 0;
134 if (next == ring->head)
135 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100136 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100137
138
139 e = &ring->entry[pos];
140
141 if (addr_len > sizeof(e->addr))
142 addr_len = sizeof(e->addr);
143
144 if (addr_len)
145 memcpy(&e->addr, addr, addr_len);
146
147 e->addr_len = addr_len;
148 e->fd = fd;
149
150 __ha_barrier_store();
151 /* now commit the change */
152
153 e->listener = li;
154 return 1;
155}
156
157/* proceed with accepting new connections */
158static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
159{
160 struct accept_queue_ring *ring = context;
161 struct listener *li;
162 struct sockaddr_storage addr;
Christopher Faulet102854c2019-04-30 12:17:13 +0200163 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100164 int addr_len;
165 int ret;
166 int fd;
167
Christopher Faulet102854c2019-04-30 12:17:13 +0200168 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
169 * is not really illimited, but it is probably enough.
170 */
171 max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
172 for (; max_accept; max_accept--) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100173 addr_len = sizeof(addr);
174 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
175 if (fd < 0)
176 break;
177
Olivier Houchard64213e92019-03-08 18:52:57 +0100178 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100179 ret = li->accept(li, fd, &addr);
180 if (ret <= 0) {
181 /* connection was terminated by the application */
182 continue;
183 }
184
185 /* increase the per-process number of cumulated sessions, this
186 * may only be done once l->accept() has accepted the connection.
187 */
188 if (!(li->options & LI_O_UNLIMITED)) {
189 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
190 update_freq_ctr(&global.sess_per_sec, 1));
191 if (li->bind_conf && li->bind_conf->is_ssl) {
192 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
193 update_freq_ctr(&global.ssl_per_sec, 1));
194 }
195 }
196 }
197
198 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200199 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200200 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100201
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200202 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100203}
204
205/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
206static int accept_queue_init()
207{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200208 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100209 int i;
210
211 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200212 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100213 if (!t) {
214 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
215 return ERR_FATAL|ERR_ABORT;
216 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200217 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100218 t->process = accept_queue_process;
219 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200220 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100221 }
222 return 0;
223}
224
225REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
226
227#endif // USE_THREAD
228
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100229/* This function adds the specified listener's file descriptor to the polling
230 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500231 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200232 * also support binding only the relevant processes to their respective
233 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100234 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200235static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100236{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100237 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100238 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200239 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100240 !(proc_mask(listener->bind_conf->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200241 /* we don't want to enable this listener and don't
242 * want any fd event to reach it.
243 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200244 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100245 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200246 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100247 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200248 listener->state = LI_LISTEN;
249 }
Willy Tarreauae302532014-05-07 19:22:24 +0200250 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100251 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau49b046d2012-08-09 12:11:58 +0200252 fd_want_recv(listener->fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100253 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200254 }
255 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100256 listener->state = LI_FULL;
257 }
258 }
William Lallemande22f11f2018-09-11 10:06:27 +0200259 /* if this listener is supposed to be only in the master, close it in the workers */
260 if ((global.mode & MODE_MWORKER) &&
261 (listener->options & LI_O_MWORKER) &&
262 master == 0) {
263 do_unbind_listener(listener, 1);
264 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100265 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100266}
267
268/* This function removes the specified listener's file descriptor from the
269 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
270 * enters LI_LISTEN.
271 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200272static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100273{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100274 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100275 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200276 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100277 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200278 fd_stop_recv(listener->fd);
Olivier Houchard859dc802019-08-08 15:47:21 +0200279 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100280 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200281 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100282 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100283}
284
Willy Tarreaube58c382011-07-24 18:28:10 +0200285/* This function tries to temporarily disable a listener, depending on the OS
286 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
287 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
288 * closes upon SHUT_WR and refuses to rebind. So a common validation path
289 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
290 * is disabled. It normally returns non-zero, unless an error is reported.
291 */
292int pause_listener(struct listener *l)
293{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200294 int ret = 1;
295
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100296 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200297
Olivier Houchard1fc05162017-04-06 01:05:05 +0200298 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200299 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200300
Willy Tarreau092d8652014-07-07 20:22:12 +0200301 if (l->proto->pause) {
302 /* Returns < 0 in case of failure, 0 if the listener
303 * was totally stopped, or > 0 if correctly paused.
304 */
305 int ret = l->proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200306
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200307 if (ret < 0) {
308 ret = 0;
309 goto end;
310 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200311 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200312 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200313 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200314
Olivier Houchard859dc802019-08-08 15:47:21 +0200315 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200316
Willy Tarreau49b046d2012-08-09 12:11:58 +0200317 fd_stop_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200318 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200319 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100320 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200321 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200322}
323
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200324/* This function tries to resume a temporarily disabled listener. Paused, full,
325 * limited and disabled listeners are handled, which means that this function
326 * may replace enable_listener(). The resulting state will either be LI_READY
327 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200328 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200329 * foreground mode, and are ignored. If the listener was only in the assigned
330 * state, it's totally rebound. This can happen if a pause() has completely
331 * stopped it. If the resume fails, 0 is returned and an error might be
332 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200333 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100334int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200335{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200336 int ret = 1;
337
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100338 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200339
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200340 /* check that another thread didn't to the job in parallel (e.g. at the
341 * end of listen_accept() while we'd come from dequeue_all_listeners().
342 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200343 if (MT_LIST_ADDED(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200344 goto end;
345
William Lallemand095ba4c2017-06-01 17:38:50 +0200346 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100347 !(proc_mask(l->bind_conf->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200348 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100349
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200350 if (l->state == LI_ASSIGNED) {
351 char msg[100];
352 int err;
353
354 err = l->proto->bind(l, msg, sizeof(msg));
355 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100356 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200357 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100358 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200359
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200360 if (err & (ERR_FATAL | ERR_ABORT)) {
361 ret = 0;
362 goto end;
363 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200364 }
365
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200366 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
367 ret = 0;
368 goto end;
369 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200370
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200371 if (l->proto->sock_prot == IPPROTO_TCP &&
372 l->state == LI_PAUSED &&
Willy Tarreaue2711c72019-02-27 15:39:41 +0100373 listen(l->fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200374 ret = 0;
375 goto end;
376 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200377
378 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200379 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200380
Olivier Houchard859dc802019-08-08 15:47:21 +0200381 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200382
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100383 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaube58c382011-07-24 18:28:10 +0200384 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200385 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200386 }
387
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200388 if (!(thread_mask(l->bind_conf->bind_thread) & tid_bit)) {
389 /* we're not allowed to touch this listener's FD, let's requeue
390 * the listener into one of its owning thread's queue instead.
391 */
Willy Tarreau50b65942020-02-12 10:01:29 +0100392 int first_thread = my_flsl(thread_mask(l->bind_conf->bind_thread) & all_threads_mask) - 1;
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200393 work_list_add(&local_listener_queue[first_thread], &l->wait_queue);
394 goto end;
395 }
396
Willy Tarreau49b046d2012-08-09 12:11:58 +0200397 fd_want_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200398 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200399 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100400 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200401 return ret;
402}
403
Willy Tarreau87b09662015-04-03 00:22:06 +0200404/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200405 * it upon next close() using resume_listener().
406 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200407static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200408{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100409 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200410 if (l->state >= LI_READY) {
Olivier Houchard859dc802019-08-08 15:47:21 +0200411 MT_LIST_DEL(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100412 if (l->state != LI_FULL) {
413 fd_stop_recv(l->fd);
414 l->state = LI_FULL;
415 }
Willy Tarreau62793712011-07-24 19:23:38 +0200416 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100417 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200418}
419
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200420/* Marks a ready listener as limited so that we only try to re-enable it when
421 * resources are free again. It will be queued into the specified queue.
422 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200423static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200424{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100425 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200426 if (l->state == LI_READY) {
Willy Tarreaude4db172020-07-10 08:10:29 +0200427 MT_LIST_TRY_ADDQ(list, &l->wait_queue);
Willy Tarreau49b046d2012-08-09 12:11:58 +0200428 fd_stop_recv(l->fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200429 l->state = LI_LIMITED;
430 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100431 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200432}
433
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100434/* This function adds all of the protocol's listener's file descriptors to the
435 * polling lists when they are in the LI_LISTEN state. It is intended to be
436 * used as a protocol's generic enable_all() primitive, for use after the
437 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
438 * their number of connections. It always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200439 *
440 * Must be called with proto_lock held.
441 *
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100442 */
443int enable_all_listeners(struct protocol *proto)
444{
445 struct listener *listener;
446
447 list_for_each_entry(listener, &proto->listeners, proto_list)
448 enable_listener(listener);
449 return ERR_NONE;
450}
451
452/* This function removes all of the protocol's listener's file descriptors from
453 * the polling lists when they are in the LI_READY or LI_FULL states. It is
454 * intended to be used as a protocol's generic disable_all() primitive. It puts
455 * the listeners into LI_LISTEN, and always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200456 *
457 * Must be called with proto_lock held.
458 *
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100459 */
460int disable_all_listeners(struct protocol *proto)
461{
462 struct listener *listener;
463
464 list_for_each_entry(listener, &proto->listeners, proto_list)
465 disable_listener(listener);
466 return ERR_NONE;
467}
468
Willy Tarreau241797a2019-12-10 14:10:52 +0100469/* Dequeues all listeners waiting for a resource the global wait queue */
470void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200471{
Willy Tarreau01abd022019-02-28 10:27:18 +0100472 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200473
Willy Tarreau241797a2019-12-10 14:10:52 +0100474 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200475 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100476 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200477 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100478 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200479 }
480}
481
Willy Tarreau241797a2019-12-10 14:10:52 +0100482/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
483void dequeue_proxy_listeners(struct proxy *px)
484{
485 struct listener *listener;
486
487 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
488 /* This cannot fail because the listeners are by definition in
489 * the LI_LIMITED state.
490 */
491 resume_listener(listener);
492 }
493}
494
Christopher Faulet510c0d62018-03-16 10:04:47 +0100495/* Must be called with the lock held. Depending on <do_close> value, it does
496 * what unbind_listener or unbind_listener_no_close should do.
497 */
498void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100499{
Olivier Houcharda5188562019-03-08 15:35:42 +0100500 if (listener->state == LI_READY && fd_updt)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200501 fd_stop_recv(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100502
Olivier Houchard859dc802019-08-08 15:47:21 +0200503 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200504
Willy Tarreaube58c382011-07-24 18:28:10 +0200505 if (listener->state >= LI_PAUSED) {
Olivier Houchard1fc05162017-04-06 01:05:05 +0200506 if (do_close) {
507 fd_delete(listener->fd);
508 listener->fd = -1;
509 }
510 else
511 fd_remove(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100512 listener->state = LI_ASSIGNED;
513 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100514}
515
Olivier Houchard1fc05162017-04-06 01:05:05 +0200516/* This function closes the listening socket for the specified listener,
517 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100518 * LI_ASSIGNED state. This function is intended to be used as a generic
519 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200520 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100521void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200522{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100523 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100524 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100525 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200526}
527
528/* This function pretends the listener is dead, but keeps the FD opened, so
529 * that we can provide it, for conf reloading.
530 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100531void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200532{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100533 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100534 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100535 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200536}
537
Willy Tarreau3acf8c32007-10-28 22:35:41 +0100538/* This function closes all listening sockets bound to the protocol <proto>,
539 * and the listeners end in LI_ASSIGNED state if they were higher. It does not
540 * detach them from the protocol. It always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200541 *
542 * Must be called with proto_lock held.
543 *
Willy Tarreau3acf8c32007-10-28 22:35:41 +0100544 */
545int unbind_all_listeners(struct protocol *proto)
546{
547 struct listener *listener;
548
549 list_for_each_entry(listener, &proto->listeners, proto_list)
550 unbind_listener(listener);
551 return ERR_NONE;
552}
553
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200554/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
555 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
556 * allocation). The address family is taken from ss->ss_family. The number of
557 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100558 * created. If the <inherited> argument is set to 1, it specifies that the FD
559 * was obtained from a parent process.
560 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200561 * set in <err>.
562 */
563int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100564 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200565{
566 struct protocol *proto = protocol_by_family(ss->ss_family);
567 struct listener *l;
568 int port;
569
570 if (!proto) {
571 memprintf(err, "unsupported protocol family %d", ss->ss_family);
572 return 0;
573 }
574
575 for (port = portl; port <= porth; port++) {
576 l = calloc(1, sizeof(*l));
577 if (!l) {
578 memprintf(err, "out of memory");
579 return 0;
580 }
581 l->obj_type = OBJ_TYPE_LISTENER;
582 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
583 LIST_ADDQ(&bc->listeners, &l->by_bind);
584 l->bind_conf = bc;
585
586 l->fd = fd;
587 memcpy(&l->addr, ss, sizeof(*ss));
Olivier Houchard859dc802019-08-08 15:47:21 +0200588 MT_LIST_INIT(&l->wait_queue);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200589 l->state = LI_INIT;
590
591 proto->add(l, port);
592
William Lallemand75ea0a02017-11-15 19:02:58 +0100593 if (inherited)
594 l->options |= LI_O_INHERITED;
595
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100596 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100597 _HA_ATOMIC_ADD(&jobs, 1);
598 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200599 }
600 return 1;
601}
602
Willy Tarreau1a64d162007-10-28 22:26:05 +0100603/* Delete a listener from its protocol's list of listeners. The listener's
604 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200605 * number of listeners is updated, as well as the global number of listeners
606 * and jobs. Note that the listener must have previously been unbound. This
607 * is the generic function to use to remove a listener.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200608 *
609 * Will grab the proto_lock.
610 *
Willy Tarreau1a64d162007-10-28 22:26:05 +0100611 */
612void delete_listener(struct listener *listener)
613{
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200614 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100615 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100616 if (listener->state == LI_ASSIGNED) {
617 listener->state = LI_INIT;
618 LIST_DEL(&listener->proto_list);
619 listener->proto->nb_listeners--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100620 _HA_ATOMIC_SUB(&jobs, 1);
621 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100622 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100623 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200624 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100625}
626
Willy Tarreaue2711c72019-02-27 15:39:41 +0100627/* Returns a suitable value for a listener's backlog. It uses the listener's,
628 * otherwise the frontend's backlog, otherwise the listener's maxconn,
629 * otherwise the frontend's maxconn, otherwise 1024.
630 */
631int listener_backlog(const struct listener *l)
632{
633 if (l->backlog)
634 return l->backlog;
635
636 if (l->bind_conf->frontend->backlog)
637 return l->bind_conf->frontend->backlog;
638
639 if (l->maxconn)
640 return l->maxconn;
641
642 if (l->bind_conf->frontend->maxconn)
643 return l->bind_conf->frontend->maxconn;
644
645 return 1024;
646}
647
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200648/* This function is called on a read event from a listening socket, corresponding
649 * to an accept. It tries to accept as many connections as possible, and for each
650 * calls the listener's accept handler (generally the frontend's accept handler).
651 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200652void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200653{
654 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100655 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200656 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100657 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100658 int next_feconn = 0;
659 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200660 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200661 int cfd;
662 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100663#ifdef USE_ACCEPT4
664 static int accept4_broken;
665#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200666
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100667 if (!l)
668 return;
669 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200670
671 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
672 * illimited, but it is probably enough.
673 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100674 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200675
Willy Tarreau93e7c002013-10-07 18:51:07 +0200676 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
677 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200678
679 if (unlikely(!max)) {
680 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200681 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100682 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200683 }
684
685 if (max_accept > max)
686 max_accept = max;
687 }
688
689 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200690 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
691
692 if (unlikely(!max)) {
693 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200694 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100695 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200696 }
697
698 if (max_accept > max)
699 max_accept = max;
700 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200701#ifdef USE_OPENSSL
702 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
703 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200704
Willy Tarreaue43d5322013-10-07 20:01:52 +0200705 if (unlikely(!max)) {
706 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200707 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100708 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200709 }
710
711 if (max_accept > max)
712 max_accept = max;
713 }
714#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200715 if (p && p->fe_sps_lim) {
716 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
717
718 if (unlikely(!max)) {
719 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100720 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
721 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200722 }
723
724 if (max_accept > max)
725 max_accept = max;
726 }
727
728 /* Note: if we fail to allocate a connection because of configured
729 * limits, we'll schedule a new attempt worst 1 second later in the
730 * worst case. If we fail due to system limits or temporary resource
731 * shortage, we try again 100ms later in the worst case.
732 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200733 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200734 struct sockaddr_storage addr;
735 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200736 unsigned int count;
Willy Tarreauaf613e82020-06-05 08:40:51 +0200737 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200738
Willy Tarreau82c97892019-02-27 19:32:32 +0100739 /* pre-increase the number of connections without going too far.
740 * We process the listener, then the proxy, then the process.
741 * We know which ones to unroll based on the next_xxx value.
742 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100743 do {
744 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100745 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100746 /* the listener was marked full or another
747 * thread is going to do it.
748 */
749 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100750 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100751 goto end;
752 }
753 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000754 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100755
Willy Tarreau82c97892019-02-27 19:32:32 +0100756 if (p) {
757 do {
758 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100759 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100760 /* the frontend was marked full or another
761 * thread is going to do it.
762 */
763 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100764 expire = TICK_ETERNITY;
765 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100766 }
767 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100768 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200769 }
770
Willy Tarreau82c97892019-02-27 19:32:32 +0100771 if (!(l->options & LI_O_UNLIMITED)) {
772 do {
773 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100774 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100775 /* the process was marked full or another
776 * thread is going to do it.
777 */
778 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100779 expire = tick_add(now_ms, 1000); /* try again in 1 second */
780 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100781 }
782 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000783 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200784 }
785
William Lallemand2fe7dd02018-09-11 16:51:29 +0200786 /* with sockpair@ we don't want to do an accept */
787 if (unlikely(l->addr.ss_family == AF_CUST_SOCKPAIR)) {
788 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100789 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100790 /* just like with UNIX sockets, only the family is filled */
791 addr.ss_family = AF_UNIX;
792 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200793 } else
794
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200795#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100796 /* only call accept4() if it's known to be safe, otherwise
797 * fallback to the legacy accept() + fcntl().
798 */
799 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100800 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100801 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
802 (accept4_broken = 1))))
803#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200804 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100805 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100806
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200807 if (unlikely(cfd == -1)) {
808 switch (errno) {
809 case EAGAIN:
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100810 if (fdtab[fd].ev & (FD_POLL_HUP|FD_POLL_ERR)) {
Willy Tarreaubb660302014-05-07 19:47:02 +0200811 /* the listening socket might have been disabled in a shared
812 * process and we're a collateral victim. We'll just pause for
813 * a while in case it comes back. In the mean time, we need to
814 * clear this sticky flag.
815 */
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100816 _HA_ATOMIC_AND(&fdtab[fd].ev, ~(FD_POLL_HUP|FD_POLL_ERR));
Willy Tarreaubb660302014-05-07 19:47:02 +0200817 goto transient_error;
818 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200819 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200820 case EINVAL:
821 /* might be trying to accept on a shut fd (eg: soft stop) */
822 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100823 case EINTR:
824 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100825 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100826 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100827 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100828 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100829 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100830 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200831 case ENFILE:
832 if (p)
833 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100834 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\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 EMFILE:
838 if (p)
839 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100840 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
841 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200842 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200843 case ENOBUFS:
844 case ENOMEM:
845 if (p)
846 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100847 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
848 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200849 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200850 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100851 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau92079932019-12-10 09:30:05 +0100852 max_accept = 0;
853 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200854 }
855 }
856
William Lallemandd9138002018-11-27 12:02:39 +0100857 /* we don't want to leak the FD upon reload if it's in the master */
858 if (unlikely(master == 1))
859 fcntl(cfd, F_SETFD, FD_CLOEXEC);
860
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100861 /* The connection was accepted, it must be counted as such */
862 if (l->counters)
863 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
864
Willy Tarreau82c97892019-02-27 19:32:32 +0100865 if (p)
866 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
867
868 proxy_inc_fe_conn_ctr(l, p);
869
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100870 if (!(l->options & LI_O_UNLIMITED)) {
871 count = update_freq_ctr(&global.conn_per_sec, 1);
872 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100873 }
874
Willy Tarreau64a9c052019-04-12 15:27:17 +0200875 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
876
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200877 if (unlikely(cfd >= global.maxsock)) {
878 send_log(p, LOG_EMERG,
879 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
880 p->id);
881 close(cfd);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100882 expire = tick_add(now_ms, 1000); /* try again in 1 second */
883 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200884 }
885
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100886 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100887 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
888 * allows the error path not to rollback on nbconn. It's more
889 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100890 */
891 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100892 next_feconn = 0;
893 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200894
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100895#if defined(USE_THREAD)
Willy Tarreau897e2c52019-03-13 15:03:53 +0100896 mask = thread_mask(l->bind_conf->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100897 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100898 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100899 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100900
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100901 /* The principle is that we have two running indexes,
902 * each visiting in turn all threads bound to this
903 * listener. The connection will be assigned to the one
904 * with the least connections, and the other one will
905 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100906 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100907 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100908 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100909
910 /* keep a copy for the final update. thr_idx is composite
911 * and made of (t2<<16) + t1.
912 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100913 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100914 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100915 unsigned long m1, m2;
916 int q1, q2;
917
918 t2 = t1 = t0;
919 t2 >>= 16;
920 t1 &= 0xFFFF;
921
922 /* t1 walks low to high bits ;
923 * t2 walks high to low.
924 */
925 m1 = mask >> t1;
926 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
927
Willy Tarreau85d04242019-04-16 18:09:13 +0200928 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100929 m1 &= ~1UL;
930 if (!m1) {
931 m1 = mask;
932 t1 = 0;
933 }
934 t1 += my_ffsl(m1) - 1;
935 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100936
Willy Tarreau85d04242019-04-16 18:09:13 +0200937 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
938 /* highest bit not set */
939 if (!m2)
940 m2 = mask;
941
942 t2 = my_flsl(m2) - 1;
943 }
944
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100945 /* now we have two distinct thread IDs belonging to the mask */
946 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
947 if (q1 >= ACCEPT_QUEUE_SIZE)
948 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100949
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100950 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
951 if (q2 >= ACCEPT_QUEUE_SIZE)
952 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100953
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100954 /* we have 3 possibilities now :
955 * q1 < q2 : t1 is less loaded than t2, so we pick it
956 * and update t2 (since t1 might still be
957 * lower than another thread)
958 * q1 > q2 : t2 is less loaded than t1, so we pick it
959 * and update t1 (since t2 might still be
960 * lower than another thread)
961 * q1 = q2 : both are equally loaded, thus we pick t1
962 * and update t1 as it will become more loaded
963 * than t2.
964 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100965
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100966 q1 += l->thr_conn[t1];
967 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100968
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100969 if (q1 - q2 < 0) {
970 t = t1;
971 t2 = t2 ? t2 - 1 : LONGBITS - 1;
972 }
973 else if (q1 - q2 > 0) {
974 t = t2;
975 t1++;
976 if (t1 >= LONGBITS)
977 t1 = 0;
978 }
979 else {
980 t = t1;
981 t1++;
982 if (t1 >= LONGBITS)
983 t1 = 0;
984 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100985
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100986 /* new value for thr_idx */
987 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +0100988 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100989
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100990 /* We successfully selected the best thread "t" for this
991 * connection. We use deferred accepts even if it's the
992 * local thread because tests show that it's the best
993 * performing model, likely due to better cache locality
994 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100995 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100996 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100997 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +0100998 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200999 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001000 continue;
1001 }
1002 /* If the ring is full we do a synchronous accept on
1003 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001004 */
Olivier Houchard64213e92019-03-08 18:52:57 +01001005 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001006 }
1007#endif // USE_THREAD
1008
Olivier Houchard64213e92019-03-08 18:52:57 +01001009 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001010 ret = l->accept(l, cfd, &addr);
1011 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001012 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001013 * we just have to ignore it (ret == 0) or it's a critical
1014 * error due to a resource shortage, and we must stop the
1015 * listener (ret < 0).
1016 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001017 if (ret == 0) /* successful termination */
1018 continue;
1019
Willy Tarreaubb660302014-05-07 19:47:02 +02001020 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001021 }
1022
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001023 /* increase the per-process number of cumulated sessions, this
1024 * may only be done once l->accept() has accepted the connection.
1025 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001026 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001027 count = update_freq_ctr(&global.sess_per_sec, 1);
1028 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001029 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001030#ifdef USE_OPENSSL
1031 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001032 count = update_freq_ctr(&global.ssl_per_sec, 1);
1033 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001034 }
1035#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001036
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001037 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001038 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001039
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001040 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001041 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001042 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001043
Willy Tarreau82c97892019-02-27 19:32:32 +01001044 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001045 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001046
1047 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001048 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001049
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001050 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreaucdcba112019-12-11 15:06:30 +01001051 (l->state == LI_LIMITED &&
1052 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1053 (!tick_isset(global_listener_queue_task->expire) ||
1054 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001055 /* at least one thread has to this when quitting */
1056 resume_listener(l);
1057
1058 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001059 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001060
Olivier Houchard859dc802019-08-08 15:47:21 +02001061 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001062 (!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 +01001063 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001064 }
Willy Tarreau4c044e22019-12-05 07:40:32 +01001065
Willy Tarreau92079932019-12-10 09:30:05 +01001066 /* Now it's getting tricky. The listener was supposed to be in LI_READY
1067 * state but in the mean time we might have changed it to LI_FULL or
1068 * LI_LIMITED, and another thread might also have turned it to
1069 * LI_PAUSED, LI_LISTEN or even LI_INI when stopping a proxy. We must
1070 * be certain to keep the FD enabled when in the READY state but we
1071 * must also stop it for other states that we might have switched to
1072 * while others re-enabled polling.
1073 */
1074 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
1075 if (l->state == LI_READY) {
1076 if (max_accept > 0)
1077 fd_cant_recv(fd);
1078 else
1079 fd_done_recv(fd);
1080 } else if (l->state > LI_ASSIGNED) {
Willy Tarreau4c044e22019-12-05 07:40:32 +01001081 fd_stop_recv(l->fd);
Willy Tarreau92079932019-12-10 09:30:05 +01001082 }
1083 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001084 return;
1085
1086 transient_error:
1087 /* pause the listener for up to 100 ms */
1088 expire = tick_add(now_ms, 100);
1089
1090 limit_global:
1091 /* (re-)queue the listener to the global queue and set it to expire no
1092 * later than <expire> ahead. The listener turns to LI_LIMITED.
1093 */
1094 limit_listener(l, &global_listener_queue);
1095 task_schedule(global_listener_queue_task, expire);
1096 goto end;
1097
1098 limit_proxy:
1099 /* (re-)queue the listener to the proxy's queue and set it to expire no
1100 * later than <expire> ahead. The listener turns to LI_LIMITED.
1101 */
1102 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001103 if (p->task && tick_isset(expire))
1104 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001105 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001106}
1107
Willy Tarreau05f50472017-09-15 09:19:58 +02001108/* Notify the listener that a connection initiated from it was released. This
1109 * is used to keep the connection count consistent and to possibly re-open
1110 * listening when it was limited.
1111 */
1112void listener_release(struct listener *l)
1113{
1114 struct proxy *fe = l->bind_conf->frontend;
1115
1116 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001117 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001118 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001119 _HA_ATOMIC_SUB(&fe->feconn, 1);
1120 _HA_ATOMIC_SUB(&l->nbconn, 1);
1121 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001122
1123 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001124 resume_listener(l);
1125
1126 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001127 dequeue_all_listeners();
Willy Tarreau05f50472017-09-15 09:19:58 +02001128
Olivier Houchard859dc802019-08-08 15:47:21 +02001129 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001130 (!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 +01001131 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001132}
1133
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001134/* resume listeners waiting in the local listener queue. They are still in LI_LIMITED state */
1135static struct task *listener_queue_process(struct task *t, void *context, unsigned short state)
1136{
1137 struct work_list *wl = context;
1138 struct listener *l;
1139
Olivier Houchard859dc802019-08-08 15:47:21 +02001140 while ((l = MT_LIST_POP(&wl->head, struct listener *, wait_queue))) {
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001141 /* The listeners are still in the LI_LIMITED state */
1142 resume_listener(l);
1143 }
1144 return t;
1145}
1146
1147/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1148static int listener_queue_init()
1149{
1150 local_listener_queue = work_list_create(global.nbthread, listener_queue_process, NULL);
1151 if (!local_listener_queue) {
1152 ha_alert("Out of memory while initializing listener queues.\n");
1153 return ERR_FATAL|ERR_ABORT;
1154 }
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001155
1156 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1157 if (!global_listener_queue_task) {
1158 ha_alert("Out of memory when initializing global listener queue\n");
1159 return ERR_FATAL|ERR_ABORT;
1160 }
1161 /* very simple initialization, users will queue the task if needed */
1162 global_listener_queue_task->context = NULL; /* not even a context! */
1163 global_listener_queue_task->process = manage_global_listener_queue;
1164
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001165 return 0;
1166}
1167
1168static void listener_queue_deinit()
1169{
1170 work_list_destroy(local_listener_queue, global.nbthread);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001171 task_destroy(global_listener_queue_task);
1172 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001173}
1174
1175REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1176REGISTER_POST_DEINIT(listener_queue_deinit);
1177
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001178
1179/* This is the global management task for listeners. It enables listeners waiting
1180 * for global resources when there are enough free resource, or at least once in
1181 * a while. It is designed to be called as a task.
1182 */
1183static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state)
1184{
1185 /* If there are still too many concurrent connections, let's wait for
1186 * some of them to go away. We don't need to re-arm the timer because
1187 * each of them will scan the queue anyway.
1188 */
1189 if (unlikely(actconn >= global.maxconn))
1190 goto out;
1191
1192 /* We should periodically try to enable listeners waiting for a global
1193 * resource here, because it is possible, though very unlikely, that
1194 * they have been blocked by a temporary lack of global resource such
1195 * as a file descriptor or memory and that the temporary condition has
1196 * disappeared.
1197 */
1198 dequeue_all_listeners();
1199
1200 out:
1201 t->expire = TICK_ETERNITY;
1202 task_queue(t);
1203 return t;
1204}
1205
Willy Tarreau26982662012-09-12 23:17:10 +02001206/*
1207 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1208 * parsing sessions.
1209 */
1210void bind_register_keywords(struct bind_kw_list *kwl)
1211{
1212 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1213}
1214
1215/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1216 * keyword is found with a NULL ->parse() function, then an attempt is made to
1217 * find one with a valid ->parse() function. This way it is possible to declare
1218 * platform-dependant, known keywords as NULL, then only declare them as valid
1219 * if some options are met. Note that if the requested keyword contains an
1220 * opening parenthesis, everything from this point is ignored.
1221 */
1222struct bind_kw *bind_find_kw(const char *kw)
1223{
1224 int index;
1225 const char *kwend;
1226 struct bind_kw_list *kwl;
1227 struct bind_kw *ret = NULL;
1228
1229 kwend = strchr(kw, '(');
1230 if (!kwend)
1231 kwend = kw + strlen(kw);
1232
1233 list_for_each_entry(kwl, &bind_keywords.list, list) {
1234 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1235 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1236 kwl->kw[index].kw[kwend-kw] == 0) {
1237 if (kwl->kw[index].parse)
1238 return &kwl->kw[index]; /* found it !*/
1239 else
1240 ret = &kwl->kw[index]; /* may be OK */
1241 }
1242 }
1243 }
1244 return ret;
1245}
1246
Willy Tarreau8638f482012-09-18 18:01:17 +02001247/* Dumps all registered "bind" keywords to the <out> string pointer. The
1248 * unsupported keywords are only dumped if their supported form was not
1249 * found.
1250 */
1251void bind_dump_kws(char **out)
1252{
1253 struct bind_kw_list *kwl;
1254 int index;
1255
Christopher Faulet784063e2020-05-18 12:14:18 +02001256 if (!out)
1257 return;
1258
Willy Tarreau8638f482012-09-18 18:01:17 +02001259 *out = NULL;
1260 list_for_each_entry(kwl, &bind_keywords.list, list) {
1261 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1262 if (kwl->kw[index].parse ||
1263 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001264 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1265 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001266 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001267 kwl->kw[index].skip ? " <arg>" : "",
1268 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001269 }
1270 }
1271 }
1272}
1273
Willy Tarreau645513a2010-05-24 20:55:15 +02001274/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001275/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001276/************************************************************************/
1277
Willy Tarreaua5e37562011-12-16 17:06:15 +01001278/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001279static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001280smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001281{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001282 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001283 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001284 return 1;
1285}
1286
Willy Tarreaua5e37562011-12-16 17:06:15 +01001287/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001288static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001289smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001290{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001291 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001292 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001293 return 1;
1294}
Jerome Magnineb421b22020-03-27 22:08:40 +01001295static int
1296smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1297{
1298 smp->data.u.str.area = smp->sess->listener->name;
1299 if (!smp->data.u.str.area)
1300 return 0;
1301
1302 smp->data.type = SMP_T_STR;
1303 smp->flags = SMP_F_CONST;
1304 smp->data.u.str.data = strlen(smp->data.u.str.area);
1305 return 1;
1306}
Willy Tarreau645513a2010-05-24 20:55:15 +02001307
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001308/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001309static 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 +02001310{
1311 struct listener *l;
1312
Willy Tarreau4348fad2012-09-20 16:48:07 +02001313 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001314 l->options |= LI_O_ACC_PROXY;
1315
1316 return 0;
1317}
1318
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001319/* parse the "accept-netscaler-cip" bind keyword */
1320static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1321{
1322 struct listener *l;
1323 uint32_t val;
1324
1325 if (!*args[cur_arg + 1]) {
1326 memprintf(err, "'%s' : missing value", args[cur_arg]);
1327 return ERR_ALERT | ERR_FATAL;
1328 }
1329
1330 val = atol(args[cur_arg + 1]);
1331 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001332 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001333 return ERR_ALERT | ERR_FATAL;
1334 }
1335
1336 list_for_each_entry(l, &conf->listeners, by_bind) {
1337 l->options |= LI_O_ACC_CIP;
1338 conf->ns_cip_magic = val;
1339 }
1340
1341 return 0;
1342}
1343
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001344/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001345static 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 +02001346{
1347 struct listener *l;
1348 int val;
1349
1350 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001351 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001352 return ERR_ALERT | ERR_FATAL;
1353 }
1354
1355 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001356 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001357 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001358 return ERR_ALERT | ERR_FATAL;
1359 }
1360
Willy Tarreau4348fad2012-09-20 16:48:07 +02001361 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001362 l->backlog = val;
1363
1364 return 0;
1365}
1366
1367/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001368static 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 +02001369{
1370 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001371 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001372 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001373
Willy Tarreau4348fad2012-09-20 16:48:07 +02001374 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001375 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001376 return ERR_ALERT | ERR_FATAL;
1377 }
1378
1379 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001380 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001381 return ERR_ALERT | ERR_FATAL;
1382 }
1383
Willy Tarreau4348fad2012-09-20 16:48:07 +02001384 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001385 new->luid = strtol(args[cur_arg + 1], &error, 10);
1386 if (*error != '\0') {
1387 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1388 return ERR_ALERT | ERR_FATAL;
1389 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001390 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001391
Willy Tarreau4348fad2012-09-20 16:48:07 +02001392 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001393 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001394 return ERR_ALERT | ERR_FATAL;
1395 }
1396
Willy Tarreau4348fad2012-09-20 16:48:07 +02001397 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001398 if (node) {
1399 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001400 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1401 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1402 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001403 return ERR_ALERT | ERR_FATAL;
1404 }
1405
Willy Tarreau4348fad2012-09-20 16:48:07 +02001406 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001407 return 0;
1408}
1409
1410/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001411static 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 +02001412{
1413 struct listener *l;
1414 int val;
1415
1416 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001417 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001418 return ERR_ALERT | ERR_FATAL;
1419 }
1420
1421 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001422 if (val < 0) {
1423 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001424 return ERR_ALERT | ERR_FATAL;
1425 }
1426
Willy Tarreau4348fad2012-09-20 16:48:07 +02001427 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001428 l->maxconn = val;
1429
1430 return 0;
1431}
1432
1433/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001434static 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 +02001435{
1436 struct listener *l;
1437
1438 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001439 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001440 return ERR_ALERT | ERR_FATAL;
1441 }
1442
Willy Tarreau4348fad2012-09-20 16:48:07 +02001443 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001444 l->name = strdup(args[cur_arg + 1]);
1445
1446 return 0;
1447}
1448
1449/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001450static 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 +02001451{
1452 struct listener *l;
1453 int val;
1454
1455 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001456 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001457 return ERR_ALERT | ERR_FATAL;
1458 }
1459
1460 val = atol(args[cur_arg + 1]);
1461 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001462 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001463 return ERR_ALERT | ERR_FATAL;
1464 }
1465
Willy Tarreau4348fad2012-09-20 16:48:07 +02001466 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001467 l->nice = val;
1468
1469 return 0;
1470}
1471
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001472/* parse the "process" bind keyword */
1473static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1474{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001475 char *slash;
1476 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001477
Christopher Fauletc644fa92017-11-23 22:44:11 +01001478 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1479 *slash = 0;
1480
Willy Tarreauff9c9142019-02-07 10:39:36 +01001481 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001482 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001483 return ERR_ALERT | ERR_FATAL;
1484 }
1485
Christopher Fauletc644fa92017-11-23 22:44:11 +01001486 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001487 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001488 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1489 return ERR_ALERT | ERR_FATAL;
1490 }
1491 *slash = '/';
1492 }
1493
1494 conf->bind_proc |= proc;
Willy Tarreaua36b3242019-02-02 13:14:34 +01001495 conf->bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001496 return 0;
1497}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001498
Christopher Fauleta717b992018-04-10 14:43:00 +02001499/* parse the "proto" bind keyword */
1500static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1501{
1502 struct ist proto;
1503
1504 if (!*args[cur_arg + 1]) {
1505 memprintf(err, "'%s' : missing value", args[cur_arg]);
1506 return ERR_ALERT | ERR_FATAL;
1507 }
1508
1509 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1510 conf->mux_proto = get_mux_proto(proto);
1511 if (!conf->mux_proto) {
1512 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1513 return ERR_ALERT | ERR_FATAL;
1514 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001515 return 0;
1516}
1517
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001518/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1519static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1520 struct proxy *defpx, const char *file, int line,
1521 char **err)
1522{
1523 if (too_many_args(1, args, err, NULL))
1524 return -1;
1525
1526 if (strcmp(args[1], "on") == 0)
1527 global.tune.options |= GTUNE_LISTENER_MQ;
1528 else if (strcmp(args[1], "off") == 0)
1529 global.tune.options &= ~GTUNE_LISTENER_MQ;
1530 else {
1531 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1532 return -1;
1533 }
1534 return 0;
1535}
1536
Willy Tarreau61612d42012-04-19 18:42:05 +02001537/* Note: must not be declared <const> as its list will be overwritten.
1538 * Please take care of keeping this list alphabetically sorted.
1539 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001540static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001541 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1542 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001543 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001544 { /* END */ },
1545}};
1546
Willy Tarreau0108d902018-11-25 19:14:37 +01001547INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1548
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001549/* Note: must not be declared <const> as its list will be overwritten.
1550 * Please take care of keeping this list alphabetically sorted.
1551 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001552static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001553 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001554}};
1555
Willy Tarreau0108d902018-11-25 19:14:37 +01001556INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1557
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001558/* Note: must not be declared <const> as its list will be overwritten.
1559 * Please take care of keeping this list alphabetically sorted, doing so helps
1560 * all code contributors.
1561 * Optional keywords are also declared with a NULL ->parse() function so that
1562 * the config parser can report an appropriate error when a known keyword was
1563 * not enabled.
1564 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001565static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001566 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001567 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1568 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1569 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1570 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1571 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1572 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001573 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001574 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001575 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001576}};
1577
Willy Tarreau0108d902018-11-25 19:14:37 +01001578INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1579
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001580/* config keyword parsers */
1581static struct cfg_kw_list cfg_kws = {ILH, {
1582 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1583 { 0, NULL, NULL }
1584}};
1585
1586INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1587
Willy Tarreau645513a2010-05-24 20:55:15 +02001588/*
1589 * Local variables:
1590 * c-indent-level: 8
1591 * c-basic-offset: 8
1592 * End:
1593 */