blob: 627f9200b802a7d3bd1217ae8ac1e1d003fbb78a [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 Tarreauf2cb1692019-07-11 10:08:31 +020047/* there is one listener queue per thread so that a thread unblocking the
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +050048 * global queue can wake up listeners bound only to foreign threads by
Willy Tarreau2bd65a72019-09-24 06:55:18 +020049 * moving them to the remote queues and waking up the associated tasklet.
Willy Tarreauf2cb1692019-07-11 10:08:31 +020050 */
51static struct work_list *local_listener_queue;
52
Willy Tarreaua1d97f82019-12-10 11:18:41 +010053/* list of the temporarily limited listeners because of lack of resource */
54static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
55static struct task *global_listener_queue_task;
56static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state);
57
58
Willy Tarreau1efafce2019-01-27 15:37:19 +010059#if defined(USE_THREAD)
60
61struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
62
63/* dequeue and process a pending connection from the local accept queue (single
64 * consumer). Returns the accepted fd or -1 if none was found. The listener is
65 * placed into *li. The address is copied into *addr for no more than *addr_len
66 * bytes, and the address length is returned into *addr_len.
67 */
68int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
69{
70 struct accept_queue_entry *e;
71 unsigned int pos, next;
72 struct listener *ptr;
73 int len;
74 int fd;
75
76 pos = ring->head;
77
78 if (pos == ring->tail)
79 return -1;
80
81 next = pos + 1;
82 if (next >= ACCEPT_QUEUE_SIZE)
83 next = 0;
84
85 e = &ring->entry[pos];
86
87 /* wait for the producer to update the listener's pointer */
88 while (1) {
89 ptr = e->listener;
90 __ha_barrier_load();
91 if (ptr)
92 break;
93 pl_cpu_relax();
94 }
95
96 fd = e->fd;
97 len = e->addr_len;
98 if (len > *addr_len)
99 len = *addr_len;
100
101 if (likely(len > 0))
102 memcpy(addr, &e->addr, len);
103
104 /* release the entry */
105 e->listener = NULL;
106
107 __ha_barrier_store();
108 ring->head = next;
109
110 *addr_len = len;
111 *li = ptr;
112
113 return fd;
114}
115
116
117/* tries to push a new accepted connection <fd> into ring <ring> for listener
118 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
119 * succeeds, or zero if the ring is full. Supports multiple producers.
120 */
121int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
122 struct listener *li, const void *addr, int addr_len)
123{
124 struct accept_queue_entry *e;
125 unsigned int pos, next;
126
127 pos = ring->tail;
128 do {
129 next = pos + 1;
130 if (next >= ACCEPT_QUEUE_SIZE)
131 next = 0;
132 if (next == ring->head)
133 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100134 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100135
136
137 e = &ring->entry[pos];
138
139 if (addr_len > sizeof(e->addr))
140 addr_len = sizeof(e->addr);
141
142 if (addr_len)
143 memcpy(&e->addr, addr, addr_len);
144
145 e->addr_len = addr_len;
146 e->fd = fd;
147
148 __ha_barrier_store();
149 /* now commit the change */
150
151 e->listener = li;
152 return 1;
153}
154
155/* proceed with accepting new connections */
156static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
157{
158 struct accept_queue_ring *ring = context;
159 struct listener *li;
160 struct sockaddr_storage addr;
Christopher Faulet102854c2019-04-30 12:17:13 +0200161 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100162 int addr_len;
163 int ret;
164 int fd;
165
Christopher Faulet102854c2019-04-30 12:17:13 +0200166 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
167 * is not really illimited, but it is probably enough.
168 */
169 max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
170 for (; max_accept; max_accept--) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100171 addr_len = sizeof(addr);
172 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
173 if (fd < 0)
174 break;
175
Olivier Houchard64213e92019-03-08 18:52:57 +0100176 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100177 ret = li->accept(li, fd, &addr);
178 if (ret <= 0) {
179 /* connection was terminated by the application */
180 continue;
181 }
182
183 /* increase the per-process number of cumulated sessions, this
184 * may only be done once l->accept() has accepted the connection.
185 */
186 if (!(li->options & LI_O_UNLIMITED)) {
187 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
188 update_freq_ctr(&global.sess_per_sec, 1));
189 if (li->bind_conf && li->bind_conf->is_ssl) {
190 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
191 update_freq_ctr(&global.ssl_per_sec, 1));
192 }
193 }
194 }
195
196 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200197 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200198 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100199
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200200 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100201}
202
203/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
204static int accept_queue_init()
205{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200206 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100207 int i;
208
209 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200210 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100211 if (!t) {
212 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
213 return ERR_FATAL|ERR_ABORT;
214 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200215 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100216 t->process = accept_queue_process;
217 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200218 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100219 }
220 return 0;
221}
222
223REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
224
225#endif // USE_THREAD
226
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100227/* This function adds the specified listener's file descriptor to the polling
228 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500229 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200230 * also support binding only the relevant processes to their respective
231 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100232 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200233static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100234{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100235 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100236 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200237 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200238 !(proc_mask(listener->rx.settings->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200239 /* we don't want to enable this listener and don't
240 * want any fd event to reach it.
241 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200242 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100243 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200244 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100245 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200246 listener->state = LI_LISTEN;
247 }
Willy Tarreauae302532014-05-07 19:22:24 +0200248 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100249 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau38ba6472020-08-27 08:16:52 +0200250 fd_want_recv(listener->rx.fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100251 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200252 }
253 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100254 listener->state = LI_FULL;
255 }
256 }
William Lallemande22f11f2018-09-11 10:06:27 +0200257 /* if this listener is supposed to be only in the master, close it in the workers */
258 if ((global.mode & MODE_MWORKER) &&
259 (listener->options & LI_O_MWORKER) &&
260 master == 0) {
261 do_unbind_listener(listener, 1);
262 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100263 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100264}
265
266/* This function removes the specified listener's file descriptor from the
267 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
268 * enters LI_LISTEN.
269 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200270static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100271{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100272 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100273 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200274 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100275 if (listener->state == LI_READY)
Willy Tarreau38ba6472020-08-27 08:16:52 +0200276 fd_stop_recv(listener->rx.fd);
Olivier Houchard859dc802019-08-08 15:47:21 +0200277 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100278 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200279 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100280 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100281}
282
Willy Tarreaube58c382011-07-24 18:28:10 +0200283/* This function tries to temporarily disable a listener, depending on the OS
284 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
285 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
286 * closes upon SHUT_WR and refuses to rebind. So a common validation path
287 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
288 * is disabled. It normally returns non-zero, unless an error is reported.
289 */
290int pause_listener(struct listener *l)
291{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200292 int ret = 1;
293
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100294 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200295
Olivier Houchard1fc05162017-04-06 01:05:05 +0200296 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200297 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200298
Willy Tarreaub7436612020-08-28 19:51:44 +0200299 if (l->rx.proto->pause) {
Willy Tarreau092d8652014-07-07 20:22:12 +0200300 /* Returns < 0 in case of failure, 0 if the listener
301 * was totally stopped, or > 0 if correctly paused.
302 */
Willy Tarreaub7436612020-08-28 19:51:44 +0200303 int ret = l->rx.proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200304
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200305 if (ret < 0) {
306 ret = 0;
307 goto end;
308 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200309 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200310 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200311 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200312
Olivier Houchard859dc802019-08-08 15:47:21 +0200313 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200314
Willy Tarreau38ba6472020-08-27 08:16:52 +0200315 fd_stop_recv(l->rx.fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200316 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200317 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100318 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200319 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200320}
321
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200322/* This function tries to resume a temporarily disabled listener. Paused, full,
323 * limited and disabled listeners are handled, which means that this function
324 * may replace enable_listener(). The resulting state will either be LI_READY
325 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200326 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200327 * foreground mode, and are ignored. If the listener was only in the assigned
328 * state, it's totally rebound. This can happen if a pause() has completely
329 * stopped it. If the resume fails, 0 is returned and an error might be
330 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200331 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100332int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200333{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200334 int ret = 1;
335
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100336 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200337
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200338 /* check that another thread didn't to the job in parallel (e.g. at the
339 * end of listen_accept() while we'd come from dequeue_all_listeners().
340 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200341 if (MT_LIST_ADDED(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200342 goto end;
343
William Lallemand095ba4c2017-06-01 17:38:50 +0200344 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200345 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200346 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100347
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200348 if (l->state == LI_ASSIGNED) {
349 char msg[100];
350 int err;
351
Willy Tarreaub3580b12020-09-01 10:26:22 +0200352 err = l->rx.proto->listen(l, msg, sizeof(msg));
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200353 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100354 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200355 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100356 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200357
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200358 if (err & (ERR_FATAL | ERR_ABORT)) {
359 ret = 0;
360 goto end;
361 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200362 }
363
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200364 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
365 ret = 0;
366 goto end;
367 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200368
Willy Tarreaub7436612020-08-28 19:51:44 +0200369 if (l->rx.proto->sock_prot == IPPROTO_TCP &&
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200370 l->state == LI_PAUSED &&
Willy Tarreau38ba6472020-08-27 08:16:52 +0200371 listen(l->rx.fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200372 ret = 0;
373 goto end;
374 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200375
376 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200377 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200378
Olivier Houchard859dc802019-08-08 15:47:21 +0200379 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200380
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100381 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaube58c382011-07-24 18:28:10 +0200382 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200383 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200384 }
385
Willy Tarreau818a92e2020-09-03 07:50:19 +0200386 if (!(thread_mask(l->rx.settings->bind_thread) & tid_bit)) {
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200387 /* we're not allowed to touch this listener's FD, let's requeue
388 * the listener into one of its owning thread's queue instead.
389 */
Willy Tarreau818a92e2020-09-03 07:50:19 +0200390 int first_thread = my_flsl(thread_mask(l->rx.settings->bind_thread) & all_threads_mask) - 1;
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200391 work_list_add(&local_listener_queue[first_thread], &l->wait_queue);
392 goto end;
393 }
394
Willy Tarreau38ba6472020-08-27 08:16:52 +0200395 fd_want_recv(l->rx.fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200396 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200397 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100398 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200399 return ret;
400}
401
Willy Tarreau87b09662015-04-03 00:22:06 +0200402/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200403 * it upon next close() using resume_listener().
404 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200405static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200406{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100407 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200408 if (l->state >= LI_READY) {
Olivier Houchard859dc802019-08-08 15:47:21 +0200409 MT_LIST_DEL(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100410 if (l->state != LI_FULL) {
Willy Tarreau38ba6472020-08-27 08:16:52 +0200411 fd_stop_recv(l->rx.fd);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100412 l->state = LI_FULL;
413 }
Willy Tarreau62793712011-07-24 19:23:38 +0200414 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100415 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200416}
417
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200418/* Marks a ready listener as limited so that we only try to re-enable it when
419 * resources are free again. It will be queued into the specified queue.
420 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200421static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200422{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100423 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200424 if (l->state == LI_READY) {
Willy Tarreaude4db172020-07-10 08:10:29 +0200425 MT_LIST_TRY_ADDQ(list, &l->wait_queue);
Willy Tarreau38ba6472020-08-27 08:16:52 +0200426 fd_stop_recv(l->rx.fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200427 l->state = LI_LIMITED;
428 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100429 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200430}
431
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100432/* This function adds all of the protocol's listener's file descriptors to the
433 * polling lists when they are in the LI_LISTEN state. It is intended to be
434 * used as a protocol's generic enable_all() primitive, for use after the
435 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
436 * their number of connections. It always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200437 *
438 * Must be called with proto_lock held.
439 *
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100440 */
441int enable_all_listeners(struct protocol *proto)
442{
443 struct listener *listener;
444
Willy Tarreaub7436612020-08-28 19:51:44 +0200445 list_for_each_entry(listener, &proto->listeners, rx.proto_list)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100446 enable_listener(listener);
447 return ERR_NONE;
448}
449
450/* This function removes all of the protocol's listener's file descriptors from
451 * the polling lists when they are in the LI_READY or LI_FULL states. It is
452 * intended to be used as a protocol's generic disable_all() primitive. It puts
453 * the listeners into LI_LISTEN, and always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200454 *
455 * Must be called with proto_lock held.
456 *
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100457 */
458int disable_all_listeners(struct protocol *proto)
459{
460 struct listener *listener;
461
Willy Tarreaub7436612020-08-28 19:51:44 +0200462 list_for_each_entry(listener, &proto->listeners, rx.proto_list)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100463 disable_listener(listener);
464 return ERR_NONE;
465}
466
Willy Tarreau241797a2019-12-10 14:10:52 +0100467/* Dequeues all listeners waiting for a resource the global wait queue */
468void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200469{
Willy Tarreau01abd022019-02-28 10:27:18 +0100470 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200471
Willy Tarreau241797a2019-12-10 14:10:52 +0100472 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200473 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100474 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200475 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100476 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200477 }
478}
479
Willy Tarreau241797a2019-12-10 14:10:52 +0100480/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
481void dequeue_proxy_listeners(struct proxy *px)
482{
483 struct listener *listener;
484
485 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
486 /* This cannot fail because the listeners are by definition in
487 * the LI_LIMITED state.
488 */
489 resume_listener(listener);
490 }
491}
492
Christopher Faulet510c0d62018-03-16 10:04:47 +0100493/* Must be called with the lock held. Depending on <do_close> value, it does
494 * what unbind_listener or unbind_listener_no_close should do.
495 */
496void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100497{
Olivier Houcharda5188562019-03-08 15:35:42 +0100498 if (listener->state == LI_READY && fd_updt)
Willy Tarreau38ba6472020-08-27 08:16:52 +0200499 fd_stop_recv(listener->rx.fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100500
Olivier Houchard859dc802019-08-08 15:47:21 +0200501 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200502
Willy Tarreaube58c382011-07-24 18:28:10 +0200503 if (listener->state >= LI_PAUSED) {
Willy Tarreau67672452020-08-26 11:44:17 +0200504 listener->state = LI_ASSIGNED;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200505 fd_stop_both(listener->rx.fd);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200506 if (do_close) {
Willy Tarreau38ba6472020-08-27 08:16:52 +0200507 fd_delete(listener->rx.fd);
Willy Tarreau0b915012020-09-01 10:47:07 +0200508 listener->rx.flags &= ~RX_F_BOUND;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200509 listener->rx.fd = -1;
Olivier Houchard1fc05162017-04-06 01:05:05 +0200510 }
Willy Tarreaub648d632007-10-28 22:13:50 +0100511 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100512}
513
Olivier Houchard1fc05162017-04-06 01:05:05 +0200514/* This function closes the listening socket for the specified listener,
515 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100516 * LI_ASSIGNED state. This function is intended to be used as a generic
517 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200518 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100519void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200520{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100521 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100522 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100523 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200524}
525
526/* This function pretends the listener is dead, but keeps the FD opened, so
527 * that we can provide it, for conf reloading.
528 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100529void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200530{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100531 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100532 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100533 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200534}
535
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200536/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
537 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
538 * allocation). The address family is taken from ss->ss_family. The number of
539 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100540 * created. If the <inherited> argument is set to 1, it specifies that the FD
541 * was obtained from a parent process.
542 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200543 * set in <err>.
544 */
545int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100546 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200547{
548 struct protocol *proto = protocol_by_family(ss->ss_family);
549 struct listener *l;
550 int port;
551
552 if (!proto) {
553 memprintf(err, "unsupported protocol family %d", ss->ss_family);
554 return 0;
555 }
556
557 for (port = portl; port <= porth; port++) {
558 l = calloc(1, sizeof(*l));
559 if (!l) {
560 memprintf(err, "out of memory");
561 return 0;
562 }
563 l->obj_type = OBJ_TYPE_LISTENER;
564 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
565 LIST_ADDQ(&bc->listeners, &l->by_bind);
566 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200567 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200568 l->rx.owner = l;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200569 l->rx.fd = fd;
Willy Tarreau37159062020-08-27 07:48:42 +0200570 memcpy(&l->rx.addr, ss, sizeof(*ss));
Olivier Houchard859dc802019-08-08 15:47:21 +0200571 MT_LIST_INIT(&l->wait_queue);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200572 l->state = LI_INIT;
573
574 proto->add(l, port);
575
William Lallemand75ea0a02017-11-15 19:02:58 +0100576 if (inherited)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200577 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100578
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100579 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100580 _HA_ATOMIC_ADD(&jobs, 1);
581 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200582 }
583 return 1;
584}
585
Willy Tarreau1a64d162007-10-28 22:26:05 +0100586/* Delete a listener from its protocol's list of listeners. The listener's
587 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200588 * number of listeners is updated, as well as the global number of listeners
589 * and jobs. Note that the listener must have previously been unbound. This
590 * is the generic function to use to remove a listener.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200591 *
592 * Will grab the proto_lock.
593 *
Willy Tarreau1a64d162007-10-28 22:26:05 +0100594 */
595void delete_listener(struct listener *listener)
596{
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200597 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100598 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100599 if (listener->state == LI_ASSIGNED) {
600 listener->state = LI_INIT;
Willy Tarreaub7436612020-08-28 19:51:44 +0200601 LIST_DEL(&listener->rx.proto_list);
602 listener->rx.proto->nb_listeners--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100603 _HA_ATOMIC_SUB(&jobs, 1);
604 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100605 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100606 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200607 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100608}
609
Willy Tarreaue2711c72019-02-27 15:39:41 +0100610/* Returns a suitable value for a listener's backlog. It uses the listener's,
611 * otherwise the frontend's backlog, otherwise the listener's maxconn,
612 * otherwise the frontend's maxconn, otherwise 1024.
613 */
614int listener_backlog(const struct listener *l)
615{
616 if (l->backlog)
617 return l->backlog;
618
619 if (l->bind_conf->frontend->backlog)
620 return l->bind_conf->frontend->backlog;
621
622 if (l->maxconn)
623 return l->maxconn;
624
625 if (l->bind_conf->frontend->maxconn)
626 return l->bind_conf->frontend->maxconn;
627
628 return 1024;
629}
630
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200631/* This function is called on a read event from a listening socket, corresponding
632 * to an accept. It tries to accept as many connections as possible, and for each
633 * calls the listener's accept handler (generally the frontend's accept handler).
634 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200635void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200636{
637 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100638 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200639 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100640 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100641 int next_feconn = 0;
642 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200643 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200644 int cfd;
645 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100646#ifdef USE_ACCEPT4
647 static int accept4_broken;
648#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200649
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100650 if (!l)
651 return;
652 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200653
654 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
655 * illimited, but it is probably enough.
656 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100657 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200658
Willy Tarreau93e7c002013-10-07 18:51:07 +0200659 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
660 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200661
662 if (unlikely(!max)) {
663 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200664 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100665 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200666 }
667
668 if (max_accept > max)
669 max_accept = max;
670 }
671
672 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200673 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
674
675 if (unlikely(!max)) {
676 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200677 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100678 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200679 }
680
681 if (max_accept > max)
682 max_accept = max;
683 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200684#ifdef USE_OPENSSL
685 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
686 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200687
Willy Tarreaue43d5322013-10-07 20:01:52 +0200688 if (unlikely(!max)) {
689 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200690 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100691 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200692 }
693
694 if (max_accept > max)
695 max_accept = max;
696 }
697#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200698 if (p && p->fe_sps_lim) {
699 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
700
701 if (unlikely(!max)) {
702 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100703 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
704 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200705 }
706
707 if (max_accept > max)
708 max_accept = max;
709 }
710
711 /* Note: if we fail to allocate a connection because of configured
712 * limits, we'll schedule a new attempt worst 1 second later in the
713 * worst case. If we fail due to system limits or temporary resource
714 * shortage, we try again 100ms later in the worst case.
715 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200716 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200717 struct sockaddr_storage addr;
718 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200719 unsigned int count;
Willy Tarreauaf613e82020-06-05 08:40:51 +0200720 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200721
Willy Tarreau82c97892019-02-27 19:32:32 +0100722 /* pre-increase the number of connections without going too far.
723 * We process the listener, then the proxy, then the process.
724 * We know which ones to unroll based on the next_xxx value.
725 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100726 do {
727 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100728 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100729 /* the listener was marked full or another
730 * thread is going to do it.
731 */
732 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100733 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100734 goto end;
735 }
736 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000737 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100738
Willy Tarreau82c97892019-02-27 19:32:32 +0100739 if (p) {
740 do {
741 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100742 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100743 /* the frontend was marked full or another
744 * thread is going to do it.
745 */
746 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100747 expire = TICK_ETERNITY;
748 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100749 }
750 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100751 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200752 }
753
Willy Tarreau82c97892019-02-27 19:32:32 +0100754 if (!(l->options & LI_O_UNLIMITED)) {
755 do {
756 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100757 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100758 /* the process was marked full or another
759 * thread is going to do it.
760 */
761 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100762 expire = tick_add(now_ms, 1000); /* try again in 1 second */
763 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100764 }
765 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000766 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200767 }
768
William Lallemand2fe7dd02018-09-11 16:51:29 +0200769 /* with sockpair@ we don't want to do an accept */
Willy Tarreau37159062020-08-27 07:48:42 +0200770 if (unlikely(l->rx.addr.ss_family == AF_CUST_SOCKPAIR)) {
William Lallemand2fe7dd02018-09-11 16:51:29 +0200771 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100772 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100773 /* just like with UNIX sockets, only the family is filled */
774 addr.ss_family = AF_UNIX;
775 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200776 } else
777
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200778#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100779 /* only call accept4() if it's known to be safe, otherwise
780 * fallback to the legacy accept() + fcntl().
781 */
782 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100783 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100784 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
785 (accept4_broken = 1))))
786#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200787 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100788 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100789
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200790 if (unlikely(cfd == -1)) {
791 switch (errno) {
792 case EAGAIN:
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100793 if (fdtab[fd].ev & (FD_POLL_HUP|FD_POLL_ERR)) {
Willy Tarreaubb660302014-05-07 19:47:02 +0200794 /* the listening socket might have been disabled in a shared
795 * process and we're a collateral victim. We'll just pause for
796 * a while in case it comes back. In the mean time, we need to
797 * clear this sticky flag.
798 */
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100799 _HA_ATOMIC_AND(&fdtab[fd].ev, ~(FD_POLL_HUP|FD_POLL_ERR));
Willy Tarreaubb660302014-05-07 19:47:02 +0200800 goto transient_error;
801 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200802 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200803 case EINVAL:
804 /* might be trying to accept on a shut fd (eg: soft stop) */
805 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100806 case EINTR:
807 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100808 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100809 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100810 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100811 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100812 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100813 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200814 case ENFILE:
815 if (p)
816 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100817 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
818 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200819 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200820 case EMFILE:
821 if (p)
822 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100823 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
824 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200825 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200826 case ENOBUFS:
827 case ENOMEM:
828 if (p)
829 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100830 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
831 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200832 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200833 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100834 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau92079932019-12-10 09:30:05 +0100835 max_accept = 0;
836 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200837 }
838 }
839
William Lallemandd9138002018-11-27 12:02:39 +0100840 /* we don't want to leak the FD upon reload if it's in the master */
841 if (unlikely(master == 1))
842 fcntl(cfd, F_SETFD, FD_CLOEXEC);
843
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100844 /* The connection was accepted, it must be counted as such */
845 if (l->counters)
846 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
847
Willy Tarreau82c97892019-02-27 19:32:32 +0100848 if (p)
849 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
850
851 proxy_inc_fe_conn_ctr(l, p);
852
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100853 if (!(l->options & LI_O_UNLIMITED)) {
854 count = update_freq_ctr(&global.conn_per_sec, 1);
855 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100856 }
857
Willy Tarreau64a9c052019-04-12 15:27:17 +0200858 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
859
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200860 if (unlikely(cfd >= global.maxsock)) {
861 send_log(p, LOG_EMERG,
862 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
863 p->id);
864 close(cfd);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100865 expire = tick_add(now_ms, 1000); /* try again in 1 second */
866 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200867 }
868
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100869 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100870 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
871 * allows the error path not to rollback on nbconn. It's more
872 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100873 */
874 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100875 next_feconn = 0;
876 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200877
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100878#if defined(USE_THREAD)
Willy Tarreau818a92e2020-09-03 07:50:19 +0200879 mask = thread_mask(l->rx.settings->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100880 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100881 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100882 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100883
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100884 /* The principle is that we have two running indexes,
885 * each visiting in turn all threads bound to this
886 * listener. The connection will be assigned to the one
887 * with the least connections, and the other one will
888 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100889 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100890 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100891 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100892
893 /* keep a copy for the final update. thr_idx is composite
894 * and made of (t2<<16) + t1.
895 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100896 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100897 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100898 unsigned long m1, m2;
899 int q1, q2;
900
901 t2 = t1 = t0;
902 t2 >>= 16;
903 t1 &= 0xFFFF;
904
905 /* t1 walks low to high bits ;
906 * t2 walks high to low.
907 */
908 m1 = mask >> t1;
909 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
910
Willy Tarreau85d04242019-04-16 18:09:13 +0200911 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100912 m1 &= ~1UL;
913 if (!m1) {
914 m1 = mask;
915 t1 = 0;
916 }
917 t1 += my_ffsl(m1) - 1;
918 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100919
Willy Tarreau85d04242019-04-16 18:09:13 +0200920 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
921 /* highest bit not set */
922 if (!m2)
923 m2 = mask;
924
925 t2 = my_flsl(m2) - 1;
926 }
927
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100928 /* now we have two distinct thread IDs belonging to the mask */
929 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
930 if (q1 >= ACCEPT_QUEUE_SIZE)
931 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100932
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100933 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
934 if (q2 >= ACCEPT_QUEUE_SIZE)
935 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100936
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100937 /* we have 3 possibilities now :
938 * q1 < q2 : t1 is less loaded than t2, so we pick it
939 * and update t2 (since t1 might still be
940 * lower than another thread)
941 * q1 > q2 : t2 is less loaded than t1, so we pick it
942 * and update t1 (since t2 might still be
943 * lower than another thread)
944 * q1 = q2 : both are equally loaded, thus we pick t1
945 * and update t1 as it will become more loaded
946 * than t2.
947 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100948
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100949 q1 += l->thr_conn[t1];
950 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100951
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100952 if (q1 - q2 < 0) {
953 t = t1;
954 t2 = t2 ? t2 - 1 : LONGBITS - 1;
955 }
956 else if (q1 - q2 > 0) {
957 t = t2;
958 t1++;
959 if (t1 >= LONGBITS)
960 t1 = 0;
961 }
962 else {
963 t = t1;
964 t1++;
965 if (t1 >= LONGBITS)
966 t1 = 0;
967 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100968
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100969 /* new value for thr_idx */
970 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +0100971 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100972
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100973 /* We successfully selected the best thread "t" for this
974 * connection. We use deferred accepts even if it's the
975 * local thread because tests show that it's the best
976 * performing model, likely due to better cache locality
977 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100978 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100979 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100980 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +0100981 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200982 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100983 continue;
984 }
985 /* If the ring is full we do a synchronous accept on
986 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100987 */
Olivier Houchard64213e92019-03-08 18:52:57 +0100988 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100989 }
990#endif // USE_THREAD
991
Olivier Houchard64213e92019-03-08 18:52:57 +0100992 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200993 ret = l->accept(l, cfd, &addr);
994 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +0200995 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200996 * we just have to ignore it (ret == 0) or it's a critical
997 * error due to a resource shortage, and we must stop the
998 * listener (ret < 0).
999 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001000 if (ret == 0) /* successful termination */
1001 continue;
1002
Willy Tarreaubb660302014-05-07 19:47:02 +02001003 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001004 }
1005
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001006 /* increase the per-process number of cumulated sessions, this
1007 * may only be done once l->accept() has accepted the connection.
1008 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001009 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001010 count = update_freq_ctr(&global.sess_per_sec, 1);
1011 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001012 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001013#ifdef USE_OPENSSL
1014 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001015 count = update_freq_ctr(&global.ssl_per_sec, 1);
1016 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001017 }
1018#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001019
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001020 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001021 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001022
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001023 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001024 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001025 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001026
Willy Tarreau82c97892019-02-27 19:32:32 +01001027 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001028 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001029
1030 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001031 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001032
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001033 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreaucdcba112019-12-11 15:06:30 +01001034 (l->state == LI_LIMITED &&
1035 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1036 (!tick_isset(global_listener_queue_task->expire) ||
1037 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001038 /* at least one thread has to this when quitting */
1039 resume_listener(l);
1040
1041 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001042 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001043
Olivier Houchard859dc802019-08-08 15:47:21 +02001044 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001045 (!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 +01001046 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001047 }
Willy Tarreau4c044e22019-12-05 07:40:32 +01001048
Willy Tarreau92079932019-12-10 09:30:05 +01001049 /* Now it's getting tricky. The listener was supposed to be in LI_READY
1050 * state but in the mean time we might have changed it to LI_FULL or
1051 * LI_LIMITED, and another thread might also have turned it to
1052 * LI_PAUSED, LI_LISTEN or even LI_INI when stopping a proxy. We must
1053 * be certain to keep the FD enabled when in the READY state but we
1054 * must also stop it for other states that we might have switched to
1055 * while others re-enabled polling.
1056 */
1057 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
1058 if (l->state == LI_READY) {
1059 if (max_accept > 0)
1060 fd_cant_recv(fd);
1061 else
1062 fd_done_recv(fd);
1063 } else if (l->state > LI_ASSIGNED) {
Willy Tarreau38ba6472020-08-27 08:16:52 +02001064 fd_stop_recv(l->rx.fd);
Willy Tarreau92079932019-12-10 09:30:05 +01001065 }
1066 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001067 return;
1068
1069 transient_error:
1070 /* pause the listener for up to 100 ms */
1071 expire = tick_add(now_ms, 100);
1072
1073 limit_global:
1074 /* (re-)queue the listener to the global queue and set it to expire no
1075 * later than <expire> ahead. The listener turns to LI_LIMITED.
1076 */
1077 limit_listener(l, &global_listener_queue);
1078 task_schedule(global_listener_queue_task, expire);
1079 goto end;
1080
1081 limit_proxy:
1082 /* (re-)queue the listener to the proxy's queue and set it to expire no
1083 * later than <expire> ahead. The listener turns to LI_LIMITED.
1084 */
1085 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001086 if (p->task && tick_isset(expire))
1087 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001088 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001089}
1090
Willy Tarreau05f50472017-09-15 09:19:58 +02001091/* Notify the listener that a connection initiated from it was released. This
1092 * is used to keep the connection count consistent and to possibly re-open
1093 * listening when it was limited.
1094 */
1095void listener_release(struct listener *l)
1096{
1097 struct proxy *fe = l->bind_conf->frontend;
1098
1099 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001100 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001101 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001102 _HA_ATOMIC_SUB(&fe->feconn, 1);
1103 _HA_ATOMIC_SUB(&l->nbconn, 1);
1104 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001105
1106 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001107 resume_listener(l);
1108
1109 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001110 dequeue_all_listeners();
Willy Tarreau05f50472017-09-15 09:19:58 +02001111
Olivier Houchard859dc802019-08-08 15:47:21 +02001112 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001113 (!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 +01001114 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001115}
1116
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001117/* resume listeners waiting in the local listener queue. They are still in LI_LIMITED state */
1118static struct task *listener_queue_process(struct task *t, void *context, unsigned short state)
1119{
1120 struct work_list *wl = context;
1121 struct listener *l;
1122
Olivier Houchard859dc802019-08-08 15:47:21 +02001123 while ((l = MT_LIST_POP(&wl->head, struct listener *, wait_queue))) {
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001124 /* The listeners are still in the LI_LIMITED state */
1125 resume_listener(l);
1126 }
1127 return t;
1128}
1129
1130/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1131static int listener_queue_init()
1132{
1133 local_listener_queue = work_list_create(global.nbthread, listener_queue_process, NULL);
1134 if (!local_listener_queue) {
1135 ha_alert("Out of memory while initializing listener queues.\n");
1136 return ERR_FATAL|ERR_ABORT;
1137 }
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001138
1139 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1140 if (!global_listener_queue_task) {
1141 ha_alert("Out of memory when initializing global listener queue\n");
1142 return ERR_FATAL|ERR_ABORT;
1143 }
1144 /* very simple initialization, users will queue the task if needed */
1145 global_listener_queue_task->context = NULL; /* not even a context! */
1146 global_listener_queue_task->process = manage_global_listener_queue;
1147
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001148 return 0;
1149}
1150
1151static void listener_queue_deinit()
1152{
1153 work_list_destroy(local_listener_queue, global.nbthread);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001154 task_destroy(global_listener_queue_task);
1155 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001156}
1157
1158REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1159REGISTER_POST_DEINIT(listener_queue_deinit);
1160
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001161
1162/* This is the global management task for listeners. It enables listeners waiting
1163 * for global resources when there are enough free resource, or at least once in
1164 * a while. It is designed to be called as a task.
1165 */
1166static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state)
1167{
1168 /* If there are still too many concurrent connections, let's wait for
1169 * some of them to go away. We don't need to re-arm the timer because
1170 * each of them will scan the queue anyway.
1171 */
1172 if (unlikely(actconn >= global.maxconn))
1173 goto out;
1174
1175 /* We should periodically try to enable listeners waiting for a global
1176 * resource here, because it is possible, though very unlikely, that
1177 * they have been blocked by a temporary lack of global resource such
1178 * as a file descriptor or memory and that the temporary condition has
1179 * disappeared.
1180 */
1181 dequeue_all_listeners();
1182
1183 out:
1184 t->expire = TICK_ETERNITY;
1185 task_queue(t);
1186 return t;
1187}
1188
Willy Tarreau26982662012-09-12 23:17:10 +02001189/*
1190 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1191 * parsing sessions.
1192 */
1193void bind_register_keywords(struct bind_kw_list *kwl)
1194{
1195 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1196}
1197
1198/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1199 * keyword is found with a NULL ->parse() function, then an attempt is made to
1200 * find one with a valid ->parse() function. This way it is possible to declare
1201 * platform-dependant, known keywords as NULL, then only declare them as valid
1202 * if some options are met. Note that if the requested keyword contains an
1203 * opening parenthesis, everything from this point is ignored.
1204 */
1205struct bind_kw *bind_find_kw(const char *kw)
1206{
1207 int index;
1208 const char *kwend;
1209 struct bind_kw_list *kwl;
1210 struct bind_kw *ret = NULL;
1211
1212 kwend = strchr(kw, '(');
1213 if (!kwend)
1214 kwend = kw + strlen(kw);
1215
1216 list_for_each_entry(kwl, &bind_keywords.list, list) {
1217 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1218 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1219 kwl->kw[index].kw[kwend-kw] == 0) {
1220 if (kwl->kw[index].parse)
1221 return &kwl->kw[index]; /* found it !*/
1222 else
1223 ret = &kwl->kw[index]; /* may be OK */
1224 }
1225 }
1226 }
1227 return ret;
1228}
1229
Willy Tarreau8638f482012-09-18 18:01:17 +02001230/* Dumps all registered "bind" keywords to the <out> string pointer. The
1231 * unsupported keywords are only dumped if their supported form was not
1232 * found.
1233 */
1234void bind_dump_kws(char **out)
1235{
1236 struct bind_kw_list *kwl;
1237 int index;
1238
Christopher Faulet784063e2020-05-18 12:14:18 +02001239 if (!out)
1240 return;
1241
Willy Tarreau8638f482012-09-18 18:01:17 +02001242 *out = NULL;
1243 list_for_each_entry(kwl, &bind_keywords.list, list) {
1244 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1245 if (kwl->kw[index].parse ||
1246 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001247 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1248 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001249 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001250 kwl->kw[index].skip ? " <arg>" : "",
1251 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001252 }
1253 }
1254 }
1255}
1256
Willy Tarreau645513a2010-05-24 20:55:15 +02001257/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001258/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001259/************************************************************************/
1260
Willy Tarreaua5e37562011-12-16 17:06:15 +01001261/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001262static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001263smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +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->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001267 return 1;
1268}
1269
Willy Tarreaua5e37562011-12-16 17:06:15 +01001270/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001271static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001272smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001273{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001274 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001275 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001276 return 1;
1277}
Jerome Magnineb421b22020-03-27 22:08:40 +01001278static int
1279smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1280{
1281 smp->data.u.str.area = smp->sess->listener->name;
1282 if (!smp->data.u.str.area)
1283 return 0;
1284
1285 smp->data.type = SMP_T_STR;
1286 smp->flags = SMP_F_CONST;
1287 smp->data.u.str.data = strlen(smp->data.u.str.area);
1288 return 1;
1289}
Willy Tarreau645513a2010-05-24 20:55:15 +02001290
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001291/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001292static 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 +02001293{
1294 struct listener *l;
1295
Willy Tarreau4348fad2012-09-20 16:48:07 +02001296 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001297 l->options |= LI_O_ACC_PROXY;
1298
1299 return 0;
1300}
1301
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001302/* parse the "accept-netscaler-cip" bind keyword */
1303static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1304{
1305 struct listener *l;
1306 uint32_t val;
1307
1308 if (!*args[cur_arg + 1]) {
1309 memprintf(err, "'%s' : missing value", args[cur_arg]);
1310 return ERR_ALERT | ERR_FATAL;
1311 }
1312
1313 val = atol(args[cur_arg + 1]);
1314 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001315 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001316 return ERR_ALERT | ERR_FATAL;
1317 }
1318
1319 list_for_each_entry(l, &conf->listeners, by_bind) {
1320 l->options |= LI_O_ACC_CIP;
1321 conf->ns_cip_magic = val;
1322 }
1323
1324 return 0;
1325}
1326
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001327/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001328static 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 +02001329{
1330 struct listener *l;
1331 int val;
1332
1333 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001334 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001335 return ERR_ALERT | ERR_FATAL;
1336 }
1337
1338 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001339 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001340 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001341 return ERR_ALERT | ERR_FATAL;
1342 }
1343
Willy Tarreau4348fad2012-09-20 16:48:07 +02001344 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001345 l->backlog = val;
1346
1347 return 0;
1348}
1349
1350/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001351static 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 +02001352{
1353 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001354 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001355 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001356
Willy Tarreau4348fad2012-09-20 16:48:07 +02001357 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001358 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001359 return ERR_ALERT | ERR_FATAL;
1360 }
1361
1362 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001363 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001364 return ERR_ALERT | ERR_FATAL;
1365 }
1366
Willy Tarreau4348fad2012-09-20 16:48:07 +02001367 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001368 new->luid = strtol(args[cur_arg + 1], &error, 10);
1369 if (*error != '\0') {
1370 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1371 return ERR_ALERT | ERR_FATAL;
1372 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001373 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001374
Willy Tarreau4348fad2012-09-20 16:48:07 +02001375 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001376 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001377 return ERR_ALERT | ERR_FATAL;
1378 }
1379
Willy Tarreau4348fad2012-09-20 16:48:07 +02001380 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001381 if (node) {
1382 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001383 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1384 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1385 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001386 return ERR_ALERT | ERR_FATAL;
1387 }
1388
Willy Tarreau4348fad2012-09-20 16:48:07 +02001389 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001390 return 0;
1391}
1392
1393/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001394static 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 +02001395{
1396 struct listener *l;
1397 int val;
1398
1399 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001400 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001401 return ERR_ALERT | ERR_FATAL;
1402 }
1403
1404 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001405 if (val < 0) {
1406 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001407 return ERR_ALERT | ERR_FATAL;
1408 }
1409
Willy Tarreau4348fad2012-09-20 16:48:07 +02001410 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001411 l->maxconn = val;
1412
1413 return 0;
1414}
1415
1416/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001417static 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 +02001418{
1419 struct listener *l;
1420
1421 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001422 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001423 return ERR_ALERT | ERR_FATAL;
1424 }
1425
Willy Tarreau4348fad2012-09-20 16:48:07 +02001426 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001427 l->name = strdup(args[cur_arg + 1]);
1428
1429 return 0;
1430}
1431
1432/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001433static 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 +02001434{
1435 struct listener *l;
1436 int val;
1437
1438 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001439 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001440 return ERR_ALERT | ERR_FATAL;
1441 }
1442
1443 val = atol(args[cur_arg + 1]);
1444 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001445 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001446 return ERR_ALERT | ERR_FATAL;
1447 }
1448
Willy Tarreau4348fad2012-09-20 16:48:07 +02001449 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001450 l->nice = val;
1451
1452 return 0;
1453}
1454
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001455/* parse the "process" bind keyword */
1456static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1457{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001458 char *slash;
1459 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001460
Christopher Fauletc644fa92017-11-23 22:44:11 +01001461 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1462 *slash = 0;
1463
Willy Tarreauff9c9142019-02-07 10:39:36 +01001464 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001465 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001466 return ERR_ALERT | ERR_FATAL;
1467 }
1468
Christopher Fauletc644fa92017-11-23 22:44:11 +01001469 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001470 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001471 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1472 return ERR_ALERT | ERR_FATAL;
1473 }
1474 *slash = '/';
1475 }
1476
Willy Tarreaue26993c2020-09-03 07:18:55 +02001477 conf->settings.bind_proc |= proc;
1478 conf->settings.bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001479 return 0;
1480}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001481
Christopher Fauleta717b992018-04-10 14:43:00 +02001482/* parse the "proto" bind keyword */
1483static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1484{
1485 struct ist proto;
1486
1487 if (!*args[cur_arg + 1]) {
1488 memprintf(err, "'%s' : missing value", args[cur_arg]);
1489 return ERR_ALERT | ERR_FATAL;
1490 }
1491
1492 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1493 conf->mux_proto = get_mux_proto(proto);
1494 if (!conf->mux_proto) {
1495 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1496 return ERR_ALERT | ERR_FATAL;
1497 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001498 return 0;
1499}
1500
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001501/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1502static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1503 struct proxy *defpx, const char *file, int line,
1504 char **err)
1505{
1506 if (too_many_args(1, args, err, NULL))
1507 return -1;
1508
1509 if (strcmp(args[1], "on") == 0)
1510 global.tune.options |= GTUNE_LISTENER_MQ;
1511 else if (strcmp(args[1], "off") == 0)
1512 global.tune.options &= ~GTUNE_LISTENER_MQ;
1513 else {
1514 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1515 return -1;
1516 }
1517 return 0;
1518}
1519
Willy Tarreau61612d42012-04-19 18:42:05 +02001520/* Note: must not be declared <const> as its list will be overwritten.
1521 * Please take care of keeping this list alphabetically sorted.
1522 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001523static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001524 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1525 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001526 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001527 { /* END */ },
1528}};
1529
Willy Tarreau0108d902018-11-25 19:14:37 +01001530INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1531
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001532/* Note: must not be declared <const> as its list will be overwritten.
1533 * Please take care of keeping this list alphabetically sorted.
1534 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001535static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001536 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001537}};
1538
Willy Tarreau0108d902018-11-25 19:14:37 +01001539INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1540
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001541/* Note: must not be declared <const> as its list will be overwritten.
1542 * Please take care of keeping this list alphabetically sorted, doing so helps
1543 * all code contributors.
1544 * Optional keywords are also declared with a NULL ->parse() function so that
1545 * the config parser can report an appropriate error when a known keyword was
1546 * not enabled.
1547 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001548static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001549 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001550 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1551 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1552 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1553 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1554 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1555 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001556 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001557 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001558 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001559}};
1560
Willy Tarreau0108d902018-11-25 19:14:37 +01001561INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1562
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001563/* config keyword parsers */
1564static struct cfg_kw_list cfg_kws = {ILH, {
1565 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1566 { 0, NULL, NULL }
1567}};
1568
1569INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1570
Willy Tarreau645513a2010-05-24 20:55:15 +02001571/*
1572 * Local variables:
1573 * c-indent-level: 8
1574 * c-basic-offset: 8
1575 * End:
1576 */