blob: d28b8da4bd32d853827086601655ccea37790a19 [file] [log] [blame]
Willy Tarreaudd815982007-10-16 12:25:14 +02001/*
Willy Tarreaud1d54542012-09-12 22:58:11 +02002 * Listener management functions.
Willy Tarreaudd815982007-10-16 12:25:14 +02003 *
Willy Tarreau0ccb7442013-01-07 22:54:17 +01004 * Copyright 2000-2013 Willy Tarreau <w@1wt.eu>
Willy Tarreaudd815982007-10-16 12:25:14 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau44489252014-01-14 17:52:01 +010013#define _GNU_SOURCE
Willy Tarreau6ae1ba62014-05-07 19:01:58 +020014#include <ctype.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020015#include <errno.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020016#include <stdio.h>
17#include <string.h>
Willy Tarreau95ccdde2014-02-01 09:28:36 +010018#include <unistd.h>
19#include <fcntl.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020020
Willy Tarreaudcc048a2020-06-04 19:11:43 +020021#include <haproxy/acl.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020022#include <haproxy/api.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020023#include <haproxy/cfgparse.h>
Willy Tarreau7ea393d2020-06-04 18:02:10 +020024#include <haproxy/connection.h>
Willy Tarreau8d366972020-05-27 16:10:29 +020025#include <haproxy/errors.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020026#include <haproxy/fd.h>
27#include <haproxy/freq_ctr.h>
Willy Tarreauf268ee82020-06-04 17:05:57 +020028#include <haproxy/global.h>
Willy Tarreau853b2972020-05-27 18:01:47 +020029#include <haproxy/list.h>
Willy Tarreau213e9902020-06-04 14:58:24 +020030#include <haproxy/listener.h>
Willy Tarreauaeed4a82020-06-04 22:01:04 +020031#include <haproxy/log.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020032#include <haproxy/proto_sockpair.h>
33#include <haproxy/protocol-t.h>
34#include <haproxy/protocol.h>
35#include <haproxy/sample.h>
Willy Tarreaudfd3de82020-06-04 23:46:14 +020036#include <haproxy/stream.h>
Willy Tarreaucea0e1b2020-06-04 17:25:40 +020037#include <haproxy/task.h>
Willy Tarreau92b4f132020-06-01 11:05:15 +020038#include <haproxy/time.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020039#include <haproxy/tools.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020040
Willy Tarreaub648d632007-10-28 22:13:50 +010041
Willy Tarreau26982662012-09-12 23:17:10 +020042/* List head of all known bind keywords */
43static struct bind_kw_list bind_keywords = {
44 .list = LIST_HEAD_INIT(bind_keywords.list)
45};
46
Willy Tarreaua1d97f82019-12-10 11:18:41 +010047/* list of the temporarily limited listeners because of lack of resource */
48static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
49static struct task *global_listener_queue_task;
50static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state);
51
52
Willy Tarreau1efafce2019-01-27 15:37:19 +010053#if defined(USE_THREAD)
54
55struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
56
57/* dequeue and process a pending connection from the local accept queue (single
58 * consumer). Returns the accepted fd or -1 if none was found. The listener is
59 * placed into *li. The address is copied into *addr for no more than *addr_len
60 * bytes, and the address length is returned into *addr_len.
61 */
62int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
63{
64 struct accept_queue_entry *e;
65 unsigned int pos, next;
66 struct listener *ptr;
67 int len;
68 int fd;
69
70 pos = ring->head;
71
72 if (pos == ring->tail)
73 return -1;
74
75 next = pos + 1;
76 if (next >= ACCEPT_QUEUE_SIZE)
77 next = 0;
78
79 e = &ring->entry[pos];
80
81 /* wait for the producer to update the listener's pointer */
82 while (1) {
83 ptr = e->listener;
84 __ha_barrier_load();
85 if (ptr)
86 break;
87 pl_cpu_relax();
88 }
89
90 fd = e->fd;
91 len = e->addr_len;
92 if (len > *addr_len)
93 len = *addr_len;
94
95 if (likely(len > 0))
96 memcpy(addr, &e->addr, len);
97
98 /* release the entry */
99 e->listener = NULL;
100
101 __ha_barrier_store();
102 ring->head = next;
103
104 *addr_len = len;
105 *li = ptr;
106
107 return fd;
108}
109
110
111/* tries to push a new accepted connection <fd> into ring <ring> for listener
112 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
113 * succeeds, or zero if the ring is full. Supports multiple producers.
114 */
115int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
116 struct listener *li, const void *addr, int addr_len)
117{
118 struct accept_queue_entry *e;
119 unsigned int pos, next;
120
121 pos = ring->tail;
122 do {
123 next = pos + 1;
124 if (next >= ACCEPT_QUEUE_SIZE)
125 next = 0;
126 if (next == ring->head)
127 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100128 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100129
130
131 e = &ring->entry[pos];
132
133 if (addr_len > sizeof(e->addr))
134 addr_len = sizeof(e->addr);
135
136 if (addr_len)
137 memcpy(&e->addr, addr, addr_len);
138
139 e->addr_len = addr_len;
140 e->fd = fd;
141
142 __ha_barrier_store();
143 /* now commit the change */
144
145 e->listener = li;
146 return 1;
147}
148
149/* proceed with accepting new connections */
150static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
151{
152 struct accept_queue_ring *ring = context;
153 struct listener *li;
154 struct sockaddr_storage addr;
Christopher Faulet102854c2019-04-30 12:17:13 +0200155 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100156 int addr_len;
157 int ret;
158 int fd;
159
Christopher Faulet102854c2019-04-30 12:17:13 +0200160 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
161 * is not really illimited, but it is probably enough.
162 */
163 max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
164 for (; max_accept; max_accept--) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100165 addr_len = sizeof(addr);
166 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
167 if (fd < 0)
168 break;
169
Olivier Houchard64213e92019-03-08 18:52:57 +0100170 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100171 ret = li->accept(li, fd, &addr);
172 if (ret <= 0) {
173 /* connection was terminated by the application */
174 continue;
175 }
176
177 /* increase the per-process number of cumulated sessions, this
178 * may only be done once l->accept() has accepted the connection.
179 */
180 if (!(li->options & LI_O_UNLIMITED)) {
181 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
182 update_freq_ctr(&global.sess_per_sec, 1));
183 if (li->bind_conf && li->bind_conf->is_ssl) {
184 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
185 update_freq_ctr(&global.ssl_per_sec, 1));
186 }
187 }
188 }
189
190 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200191 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200192 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100193
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200194 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100195}
196
197/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
198static int accept_queue_init()
199{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200200 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100201 int i;
202
203 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200204 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100205 if (!t) {
206 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
207 return ERR_FATAL|ERR_ABORT;
208 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200209 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100210 t->process = accept_queue_process;
211 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200212 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100213 }
214 return 0;
215}
216
217REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
218
219#endif // USE_THREAD
220
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200221/* adjust the listener's state and its proxy's listener counters if needed.
222 * It must be called under the listener's lock, but uses atomic ops to change
223 * the proxy's counters so that the proxy lock is not needed.
224 */
Willy Tarreaua37b2442020-09-24 07:23:45 +0200225void listener_set_state(struct listener *l, enum li_state st)
226{
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200227 struct proxy *px = l->bind_conf->frontend;
228
229 if (px) {
230 /* from state */
231 switch (l->state) {
232 case LI_NEW: /* first call */
233 _HA_ATOMIC_ADD(&px->li_all, 1);
234 break;
235 case LI_INIT:
236 case LI_ASSIGNED:
237 break;
238 case LI_PAUSED:
239 _HA_ATOMIC_SUB(&px->li_paused, 1);
240 break;
241 case LI_LISTEN:
242 _HA_ATOMIC_SUB(&px->li_bound, 1);
243 break;
244 case LI_READY:
245 case LI_FULL:
246 case LI_LIMITED:
247 _HA_ATOMIC_SUB(&px->li_ready, 1);
248 break;
249 }
250
251 /* to state */
252 switch (st) {
253 case LI_NEW:
254 case LI_INIT:
255 case LI_ASSIGNED:
256 break;
257 case LI_PAUSED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200258 BUG_ON(l->rx.fd == -1);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200259 _HA_ATOMIC_ADD(&px->li_paused, 1);
260 break;
261 case LI_LISTEN:
Willy Tarreau95a34602020-10-08 15:32:21 +0200262 BUG_ON(l->rx.fd == -1);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200263 _HA_ATOMIC_ADD(&px->li_bound, 1);
264 break;
265 case LI_READY:
266 case LI_FULL:
267 case LI_LIMITED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200268 BUG_ON(l->rx.fd == -1);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200269 _HA_ATOMIC_ADD(&px->li_ready, 1);
270 break;
271 }
272 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200273 l->state = st;
274}
275
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100276/* This function adds the specified listener's file descriptor to the polling
277 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500278 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200279 * also support binding only the relevant processes to their respective
280 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100281 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200282void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100283{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100284 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200285
286 /* If this listener is supposed to be only in the master, close it in
287 * the workers. Conversely, if it's supposed to be only in the workers
288 * close it in the master.
289 */
Willy Tarreau18c20d22020-10-09 16:11:46 +0200290 if (!!master != !!(listener->rx.flags & RX_F_MWORKER))
Willy Tarreau75c98d12020-10-09 15:55:23 +0200291 do_unbind_listener(listener);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200292
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100293 if (listener->state == LI_LISTEN) {
Willy Tarreau95a34602020-10-08 15:32:21 +0200294 BUG_ON(listener->rx.fd == -1);
William Lallemand095ba4c2017-06-01 17:38:50 +0200295 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200296 !(proc_mask(listener->rx.settings->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200297 /* we don't want to enable this listener and don't
298 * want any fd event to reach it.
299 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200300 do_unbind_listener(listener);
Willy Tarreauae302532014-05-07 19:22:24 +0200301 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100302 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200303 listener->rx.proto->enable(listener);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200304 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200305 }
306 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200307 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100308 }
309 }
Willy Tarreaud6afb532020-10-09 10:35:40 +0200310
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100311 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100312}
313
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200314/*
315 * This function completely stops a listener. It will need to operate under the
316 * proxy's lock, the protocol's lock, and the listener's lock. The caller is
317 * responsible for indicating in lpx, lpr, lli whether the respective locks are
318 * already held (non-zero) or not (zero) so that the function picks the missing
319 * ones, in this order. The proxy's listeners count is updated and the proxy is
320 * disabled and woken up after the last one is gone.
321 */
322void stop_listener(struct listener *l, int lpx, int lpr, int lli)
323{
324 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200325
326 if (l->options & LI_O_NOSTOP) {
327 /* master-worker sockpairs are never closed but don't count as a
328 * job.
329 */
330 return;
331 }
332
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200333 if (!lpx)
334 HA_SPIN_LOCK(PROXY_LOCK, &px->lock);
335
336 if (!lpr)
337 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
338
339 if (!lli)
340 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
341
342 if (l->state > LI_INIT) {
Willy Tarreau75c98d12020-10-09 15:55:23 +0200343 do_unbind_listener(l);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200344
345 if (l->state >= LI_ASSIGNED)
346 __delete_listener(l);
347
Willy Tarreauacde1522020-10-07 16:31:39 +0200348 proxy_cond_disable(px);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200349 }
350
351 if (!lli)
352 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
353
354 if (!lpr)
355 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
356
357 if (!lpx)
358 HA_SPIN_UNLOCK(PROXY_LOCK, &px->lock);
359}
360
Willy Tarreaube58c382011-07-24 18:28:10 +0200361/* This function tries to temporarily disable a listener, depending on the OS
362 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
363 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
364 * closes upon SHUT_WR and refuses to rebind. So a common validation path
365 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
366 * is disabled. It normally returns non-zero, unless an error is reported.
367 */
368int pause_listener(struct listener *l)
369{
Willy Tarreau58651b42020-09-24 16:03:29 +0200370 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200371 int ret = 1;
372
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100373 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200374
Willy Tarreau02e19752020-09-23 17:17:22 +0200375 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
376 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
377 goto end;
378
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200379 if (l->state <= LI_PAUSED)
380 goto end;
381
Willy Tarreaucb66ea62020-09-25 17:12:32 +0200382 if (l->rx.proto->rx_suspend) {
Willy Tarreau092d8652014-07-07 20:22:12 +0200383 /* Returns < 0 in case of failure, 0 if the listener
384 * was totally stopped, or > 0 if correctly paused.
385 */
Willy Tarreaucb66ea62020-09-25 17:12:32 +0200386 ret = l->rx.proto->rx_suspend(&l->rx);
Willy Tarreaube58c382011-07-24 18:28:10 +0200387
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200388 if (ret < 0) {
389 ret = 0;
390 goto end;
391 }
Willy Tarreaufb76bd52020-09-24 18:07:48 +0200392 ret = 1;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200393 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200394
Olivier Houchard859dc802019-08-08 15:47:21 +0200395 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200396
Willy Tarreaua37b2442020-09-24 07:23:45 +0200397 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200398
399 if (px && !px->li_ready) {
400 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
401 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
402 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200403 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100404 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200405 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200406}
407
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200408/* This function tries to resume a temporarily disabled listener. Paused, full,
409 * limited and disabled listeners are handled, which means that this function
410 * may replace enable_listener(). The resulting state will either be LI_READY
411 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200412 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200413 * foreground mode, and are ignored. If the listener was only in the assigned
414 * state, it's totally rebound. This can happen if a pause() has completely
415 * stopped it. If the resume fails, 0 is returned and an error might be
416 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200417 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100418int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200419{
Willy Tarreau58651b42020-09-24 16:03:29 +0200420 struct proxy *px = l->bind_conf->frontend;
421 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200422 int ret = 1;
423
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100424 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200425
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200426 /* check that another thread didn't to the job in parallel (e.g. at the
427 * end of listen_accept() while we'd come from dequeue_all_listeners().
428 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200429 if (MT_LIST_ADDED(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200430 goto end;
431
William Lallemand095ba4c2017-06-01 17:38:50 +0200432 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200433 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200434 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100435
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200436 if (l->state == LI_READY)
437 goto end;
438
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200439 if (l->state == LI_ASSIGNED) {
440 char msg[100];
441 int err;
442
Willy Tarreaub3580b12020-09-01 10:26:22 +0200443 err = l->rx.proto->listen(l, msg, sizeof(msg));
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200444 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100445 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200446 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100447 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200448
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200449 if (err & (ERR_FATAL | ERR_ABORT)) {
450 ret = 0;
451 goto end;
452 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200453 }
454
Willy Tarreauc6dac6c2020-09-23 17:34:22 +0200455 if (l->state < LI_PAUSED) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200456 ret = 0;
457 goto end;
458 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200459
Willy Tarreau010fe152020-09-25 17:31:05 +0200460 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
461 l->rx.proto->rx_resume(&l->rx) <= 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200462 ret = 0;
463 goto end;
464 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200465
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100466 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200467 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200468 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200469 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200470 }
471
Willy Tarreau4b51f422020-09-25 20:32:28 +0200472 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200473 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200474
475 done:
476 if (was_paused && !px->li_paused) {
477 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
478 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
479 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200480 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100481 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200482 return ret;
483}
484
Willy Tarreau87b09662015-04-03 00:22:06 +0200485/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200486 * it upon next close() using resume_listener().
487 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200488static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200489{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100490 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200491 if (l->state >= LI_READY) {
Olivier Houchard859dc802019-08-08 15:47:21 +0200492 MT_LIST_DEL(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100493 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200494 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200495 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100496 }
Willy Tarreau62793712011-07-24 19:23:38 +0200497 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100498 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200499}
500
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200501/* Marks a ready listener as limited so that we only try to re-enable it when
502 * resources are free again. It will be queued into the specified queue.
503 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200504static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200505{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100506 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200507 if (l->state == LI_READY) {
Willy Tarreaude4db172020-07-10 08:10:29 +0200508 MT_LIST_TRY_ADDQ(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200509 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200510 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200511 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100512 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200513}
514
Willy Tarreau241797a2019-12-10 14:10:52 +0100515/* Dequeues all listeners waiting for a resource the global wait queue */
516void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200517{
Willy Tarreau01abd022019-02-28 10:27:18 +0100518 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200519
Willy Tarreau241797a2019-12-10 14:10:52 +0100520 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200521 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100522 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200523 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100524 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200525 }
526}
527
Willy Tarreau241797a2019-12-10 14:10:52 +0100528/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
529void dequeue_proxy_listeners(struct proxy *px)
530{
531 struct listener *listener;
532
533 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
534 /* This cannot fail because the listeners are by definition in
535 * the LI_LIMITED state.
536 */
537 resume_listener(listener);
538 }
539}
540
Willy Tarreau75c98d12020-10-09 15:55:23 +0200541/* This function closes the listening socket for the specified listener,
542 * provided that it's already in a listening state. The listener enters the
543 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
544 * remain in LI_LISTEN. Depending on the process' status (master or worker),
545 * the listener's bind options and the receiver's origin, it may or may not
546 * close the receiver's FD. Must be called with the lock held.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100547 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200548void do_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100549{
Olivier Houchard859dc802019-08-08 15:47:21 +0200550 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200551
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200552 if (listener->state <= LI_ASSIGNED)
553 goto out_close;
554
555 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200556 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200557 goto out_close;
558 }
559
560 if (listener->state >= LI_PAUSED) {
561 if (listener->state >= LI_READY) {
562 listener->rx.proto->disable(listener);
563 listener_set_state(listener, LI_LISTEN);
564 }
Willy Tarreau4b51f422020-09-25 20:32:28 +0200565 listener->rx.proto->rx_disable(&listener->rx);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200566 }
567
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200568 out_close:
Willy Tarreau374e9af2020-10-09 15:47:17 +0200569 /* There are a number of situations where we prefer to keep the FD and
570 * not to close it (unless we're stopping, of course):
571 * - worker process unbinding from a worker's FD with socket transfer enabled => keep
572 * - master process unbinding from a master's inherited FD => keep
573 * - master process unbinding from a master's FD => close
574 * - master process unbinding from a worker's FD => close
575 * - worker process unbinding from a master's FD => close
576 * - worker process unbinding from a worker's FD => close
577 */
578
579 if (!stopping && !master &&
Willy Tarreau18c20d22020-10-09 16:11:46 +0200580 !(listener->rx.flags & RX_F_MWORKER) &&
Willy Tarreau374e9af2020-10-09 15:47:17 +0200581 (global.tune.options & GTUNE_SOCKET_TRANSFER))
582 return;
583
584 if (!stopping && master &&
Willy Tarreau18c20d22020-10-09 16:11:46 +0200585 listener->rx.flags & RX_F_MWORKER &&
Willy Tarreau374e9af2020-10-09 15:47:17 +0200586 listener->rx.flags & RX_F_INHERITED)
587 return;
588
589 listener->rx.flags &= ~RX_F_BOUND;
590 if (listener->rx.fd != -1)
591 fd_delete(listener->rx.fd);
592 listener->rx.fd = -1;
593 if (listener->state > LI_ASSIGNED)
594 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100595}
596
Olivier Houchard1fc05162017-04-06 01:05:05 +0200597/* This function closes the listening socket for the specified listener,
598 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200599 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
600 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100601 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200602 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100603void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200604{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100605 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200606 do_unbind_listener(listener);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100607 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200608}
609
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200610/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
611 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200612 * allocation). The address family is taken from ss->ss_family, and the protocol
613 * passed in <proto> must be usable on this family. The number of jobs and
614 * listeners is automatically increased by the number of listeners created. It
615 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200616 */
617int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200618 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200619{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200620 struct listener *l;
621 int port;
622
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200623 for (port = portl; port <= porth; port++) {
624 l = calloc(1, sizeof(*l));
625 if (!l) {
626 memprintf(err, "out of memory");
627 return 0;
628 }
629 l->obj_type = OBJ_TYPE_LISTENER;
630 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
631 LIST_ADDQ(&bc->listeners, &l->by_bind);
632 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200633 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200634 l->rx.owner = l;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200635 l->rx.fd = fd;
Willy Tarreau37159062020-08-27 07:48:42 +0200636 memcpy(&l->rx.addr, ss, sizeof(*ss));
Olivier Houchard859dc802019-08-08 15:47:21 +0200637 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200638 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200639
640 proto->add(l, port);
641
Willy Tarreau909c23b2020-09-15 13:50:58 +0200642 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200643 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100644
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100645 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100646 _HA_ATOMIC_ADD(&jobs, 1);
647 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200648 }
649 return 1;
650}
651
Willy Tarreau1a64d162007-10-28 22:26:05 +0100652/* Delete a listener from its protocol's list of listeners. The listener's
653 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200654 * number of listeners is updated, as well as the global number of listeners
655 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200656 * is a low-level function expected to be called with the proto_lock and the
657 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100658 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200659void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100660{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100661 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200662 listener_set_state(listener, LI_INIT);
Willy Tarreaub7436612020-08-28 19:51:44 +0200663 LIST_DEL(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200664 listener->rx.proto->nb_receivers--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100665 _HA_ATOMIC_SUB(&jobs, 1);
666 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100667 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200668}
669
670/* Delete a listener from its protocol's list of listeners (please check
671 * __delete_listener() above). The proto_lock and the listener's lock will
672 * be grabbed in this order.
673 */
674void delete_listener(struct listener *listener)
675{
676 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
677 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
678 __delete_listener(listener);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100679 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200680 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100681}
682
Willy Tarreaue2711c72019-02-27 15:39:41 +0100683/* Returns a suitable value for a listener's backlog. It uses the listener's,
684 * otherwise the frontend's backlog, otherwise the listener's maxconn,
685 * otherwise the frontend's maxconn, otherwise 1024.
686 */
687int listener_backlog(const struct listener *l)
688{
689 if (l->backlog)
690 return l->backlog;
691
692 if (l->bind_conf->frontend->backlog)
693 return l->bind_conf->frontend->backlog;
694
695 if (l->maxconn)
696 return l->maxconn;
697
698 if (l->bind_conf->frontend->maxconn)
699 return l->bind_conf->frontend->maxconn;
700
701 return 1024;
702}
703
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200704/* This function is called on a read event from a listening socket, corresponding
705 * to an accept. It tries to accept as many connections as possible, and for each
706 * calls the listener's accept handler (generally the frontend's accept handler).
707 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200708void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200709{
710 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100711 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200712 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100713 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100714 int next_feconn = 0;
715 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200716 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200717 int cfd;
718 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100719#ifdef USE_ACCEPT4
720 static int accept4_broken;
721#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200722
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100723 if (!l)
724 return;
725 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200726
727 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
728 * illimited, but it is probably enough.
729 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100730 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200731
Willy Tarreau93e7c002013-10-07 18:51:07 +0200732 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
733 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200734
735 if (unlikely(!max)) {
736 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200737 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100738 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200739 }
740
741 if (max_accept > max)
742 max_accept = max;
743 }
744
745 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200746 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
747
748 if (unlikely(!max)) {
749 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200750 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100751 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200752 }
753
754 if (max_accept > max)
755 max_accept = max;
756 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200757#ifdef USE_OPENSSL
758 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
759 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200760
Willy Tarreaue43d5322013-10-07 20:01:52 +0200761 if (unlikely(!max)) {
762 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200763 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100764 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200765 }
766
767 if (max_accept > max)
768 max_accept = max;
769 }
770#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200771 if (p && p->fe_sps_lim) {
772 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
773
774 if (unlikely(!max)) {
775 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100776 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
777 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200778 }
779
780 if (max_accept > max)
781 max_accept = max;
782 }
783
784 /* Note: if we fail to allocate a connection because of configured
785 * limits, we'll schedule a new attempt worst 1 second later in the
786 * worst case. If we fail due to system limits or temporary resource
787 * shortage, we try again 100ms later in the worst case.
788 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200789 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200790 struct sockaddr_storage addr;
791 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200792 unsigned int count;
Willy Tarreauaf613e82020-06-05 08:40:51 +0200793 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200794
Willy Tarreau82c97892019-02-27 19:32:32 +0100795 /* pre-increase the number of connections without going too far.
796 * We process the listener, then the proxy, then the process.
797 * We know which ones to unroll based on the next_xxx value.
798 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100799 do {
800 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100801 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100802 /* the listener was marked full or another
803 * thread is going to do it.
804 */
805 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100806 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100807 goto end;
808 }
809 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000810 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100811
Willy Tarreau82c97892019-02-27 19:32:32 +0100812 if (p) {
813 do {
814 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100815 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100816 /* the frontend was marked full or another
817 * thread is going to do it.
818 */
819 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100820 expire = TICK_ETERNITY;
821 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100822 }
823 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100824 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200825 }
826
Willy Tarreau82c97892019-02-27 19:32:32 +0100827 if (!(l->options & LI_O_UNLIMITED)) {
828 do {
829 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100830 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100831 /* the process was marked full or another
832 * thread is going to do it.
833 */
834 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100835 expire = tick_add(now_ms, 1000); /* try again in 1 second */
836 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100837 }
838 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000839 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200840 }
841
William Lallemand2fe7dd02018-09-11 16:51:29 +0200842 /* with sockpair@ we don't want to do an accept */
Willy Tarreau37159062020-08-27 07:48:42 +0200843 if (unlikely(l->rx.addr.ss_family == AF_CUST_SOCKPAIR)) {
William Lallemand2fe7dd02018-09-11 16:51:29 +0200844 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100845 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100846 /* just like with UNIX sockets, only the family is filled */
847 addr.ss_family = AF_UNIX;
848 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200849 } else
850
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200851#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100852 /* only call accept4() if it's known to be safe, otherwise
853 * fallback to the legacy accept() + fcntl().
854 */
855 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100856 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100857 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
858 (accept4_broken = 1))))
859#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200860 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100861 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100862
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200863 if (unlikely(cfd == -1)) {
864 switch (errno) {
865 case EAGAIN:
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100866 if (fdtab[fd].ev & (FD_POLL_HUP|FD_POLL_ERR)) {
Willy Tarreaubb660302014-05-07 19:47:02 +0200867 /* the listening socket might have been disabled in a shared
868 * process and we're a collateral victim. We'll just pause for
869 * a while in case it comes back. In the mean time, we need to
870 * clear this sticky flag.
871 */
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100872 _HA_ATOMIC_AND(&fdtab[fd].ev, ~(FD_POLL_HUP|FD_POLL_ERR));
Willy Tarreaubb660302014-05-07 19:47:02 +0200873 goto transient_error;
874 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200875 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200876 case EINVAL:
877 /* might be trying to accept on a shut fd (eg: soft stop) */
878 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100879 case EINTR:
880 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100881 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100882 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100883 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100884 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100885 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100886 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200887 case ENFILE:
888 if (p)
889 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100890 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
891 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200892 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200893 case EMFILE:
894 if (p)
895 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100896 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
897 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200898 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200899 case ENOBUFS:
900 case ENOMEM:
901 if (p)
902 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100903 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
904 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200905 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200906 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100907 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau92079932019-12-10 09:30:05 +0100908 max_accept = 0;
909 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200910 }
911 }
912
William Lallemandd9138002018-11-27 12:02:39 +0100913 /* we don't want to leak the FD upon reload if it's in the master */
914 if (unlikely(master == 1))
915 fcntl(cfd, F_SETFD, FD_CLOEXEC);
916
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100917 /* The connection was accepted, it must be counted as such */
918 if (l->counters)
919 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
920
Willy Tarreau82c97892019-02-27 19:32:32 +0100921 if (p)
922 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
923
924 proxy_inc_fe_conn_ctr(l, p);
925
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100926 if (!(l->options & LI_O_UNLIMITED)) {
927 count = update_freq_ctr(&global.conn_per_sec, 1);
928 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100929 }
930
Willy Tarreau64a9c052019-04-12 15:27:17 +0200931 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
932
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200933 if (unlikely(cfd >= global.maxsock)) {
934 send_log(p, LOG_EMERG,
935 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
936 p->id);
937 close(cfd);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100938 expire = tick_add(now_ms, 1000); /* try again in 1 second */
939 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200940 }
941
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100942 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100943 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
944 * allows the error path not to rollback on nbconn. It's more
945 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100946 */
947 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100948 next_feconn = 0;
949 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200950
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100951#if defined(USE_THREAD)
Willy Tarreau818a92e2020-09-03 07:50:19 +0200952 mask = thread_mask(l->rx.settings->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100953 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100954 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100955 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100956
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100957 /* The principle is that we have two running indexes,
958 * each visiting in turn all threads bound to this
959 * listener. The connection will be assigned to the one
960 * with the least connections, and the other one will
961 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100962 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100963 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100964 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100965
966 /* keep a copy for the final update. thr_idx is composite
967 * and made of (t2<<16) + t1.
968 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100969 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100970 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100971 unsigned long m1, m2;
972 int q1, q2;
973
974 t2 = t1 = t0;
975 t2 >>= 16;
976 t1 &= 0xFFFF;
977
978 /* t1 walks low to high bits ;
979 * t2 walks high to low.
980 */
981 m1 = mask >> t1;
982 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
983
Willy Tarreau85d04242019-04-16 18:09:13 +0200984 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100985 m1 &= ~1UL;
986 if (!m1) {
987 m1 = mask;
988 t1 = 0;
989 }
990 t1 += my_ffsl(m1) - 1;
991 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100992
Willy Tarreau85d04242019-04-16 18:09:13 +0200993 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
994 /* highest bit not set */
995 if (!m2)
996 m2 = mask;
997
998 t2 = my_flsl(m2) - 1;
999 }
1000
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001001 /* now we have two distinct thread IDs belonging to the mask */
1002 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
1003 if (q1 >= ACCEPT_QUEUE_SIZE)
1004 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001005
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001006 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
1007 if (q2 >= ACCEPT_QUEUE_SIZE)
1008 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001009
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001010 /* we have 3 possibilities now :
1011 * q1 < q2 : t1 is less loaded than t2, so we pick it
1012 * and update t2 (since t1 might still be
1013 * lower than another thread)
1014 * q1 > q2 : t2 is less loaded than t1, so we pick it
1015 * and update t1 (since t2 might still be
1016 * lower than another thread)
1017 * q1 = q2 : both are equally loaded, thus we pick t1
1018 * and update t1 as it will become more loaded
1019 * than t2.
1020 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001021
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001022 q1 += l->thr_conn[t1];
1023 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001024
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001025 if (q1 - q2 < 0) {
1026 t = t1;
1027 t2 = t2 ? t2 - 1 : LONGBITS - 1;
1028 }
1029 else if (q1 - q2 > 0) {
1030 t = t2;
1031 t1++;
1032 if (t1 >= LONGBITS)
1033 t1 = 0;
1034 }
1035 else {
1036 t = t1;
1037 t1++;
1038 if (t1 >= LONGBITS)
1039 t1 = 0;
1040 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001041
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001042 /* new value for thr_idx */
1043 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001044 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001045
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001046 /* We successfully selected the best thread "t" for this
1047 * connection. We use deferred accepts even if it's the
1048 * local thread because tests show that it's the best
1049 * performing model, likely due to better cache locality
1050 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001051 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001052 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001053 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +01001054 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001055 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001056 continue;
1057 }
1058 /* If the ring is full we do a synchronous accept on
1059 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001060 */
Olivier Houchard64213e92019-03-08 18:52:57 +01001061 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001062 }
1063#endif // USE_THREAD
1064
Olivier Houchard64213e92019-03-08 18:52:57 +01001065 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001066 ret = l->accept(l, cfd, &addr);
1067 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001068 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001069 * we just have to ignore it (ret == 0) or it's a critical
1070 * error due to a resource shortage, and we must stop the
1071 * listener (ret < 0).
1072 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001073 if (ret == 0) /* successful termination */
1074 continue;
1075
Willy Tarreaubb660302014-05-07 19:47:02 +02001076 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001077 }
1078
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001079 /* increase the per-process number of cumulated sessions, this
1080 * may only be done once l->accept() has accepted the connection.
1081 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001082 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001083 count = update_freq_ctr(&global.sess_per_sec, 1);
1084 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001085 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001086#ifdef USE_OPENSSL
1087 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001088 count = update_freq_ctr(&global.ssl_per_sec, 1);
1089 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001090 }
1091#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001092
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001093 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001094 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001095
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001096 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001097 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001098 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001099
Willy Tarreau82c97892019-02-27 19:32:32 +01001100 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001101 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001102
1103 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001104 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001105
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001106 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreaucdcba112019-12-11 15:06:30 +01001107 (l->state == LI_LIMITED &&
1108 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1109 (!tick_isset(global_listener_queue_task->expire) ||
1110 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001111 /* at least one thread has to this when quitting */
1112 resume_listener(l);
1113
1114 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001115 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001116
Olivier Houchard859dc802019-08-08 15:47:21 +02001117 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001118 (!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 +01001119 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001120 }
Willy Tarreau4c044e22019-12-05 07:40:32 +01001121
Willy Tarreau92079932019-12-10 09:30:05 +01001122 /* Now it's getting tricky. The listener was supposed to be in LI_READY
1123 * state but in the mean time we might have changed it to LI_FULL or
1124 * LI_LIMITED, and another thread might also have turned it to
1125 * LI_PAUSED, LI_LISTEN or even LI_INI when stopping a proxy. We must
1126 * be certain to keep the FD enabled when in the READY state but we
1127 * must also stop it for other states that we might have switched to
1128 * while others re-enabled polling.
1129 */
1130 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
1131 if (l->state == LI_READY) {
1132 if (max_accept > 0)
1133 fd_cant_recv(fd);
1134 else
1135 fd_done_recv(fd);
1136 } else if (l->state > LI_ASSIGNED) {
Willy Tarreau38ba6472020-08-27 08:16:52 +02001137 fd_stop_recv(l->rx.fd);
Willy Tarreau92079932019-12-10 09:30:05 +01001138 }
1139 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001140 return;
1141
1142 transient_error:
1143 /* pause the listener for up to 100 ms */
1144 expire = tick_add(now_ms, 100);
1145
1146 limit_global:
1147 /* (re-)queue the listener to the global queue and set it to expire no
1148 * later than <expire> ahead. The listener turns to LI_LIMITED.
1149 */
1150 limit_listener(l, &global_listener_queue);
1151 task_schedule(global_listener_queue_task, expire);
1152 goto end;
1153
1154 limit_proxy:
1155 /* (re-)queue the listener to the proxy's queue and set it to expire no
1156 * later than <expire> ahead. The listener turns to LI_LIMITED.
1157 */
1158 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001159 if (p->task && tick_isset(expire))
1160 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001161 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001162}
1163
Willy Tarreau05f50472017-09-15 09:19:58 +02001164/* Notify the listener that a connection initiated from it was released. This
1165 * is used to keep the connection count consistent and to possibly re-open
1166 * listening when it was limited.
1167 */
1168void listener_release(struct listener *l)
1169{
1170 struct proxy *fe = l->bind_conf->frontend;
1171
1172 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001173 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001174 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001175 _HA_ATOMIC_SUB(&fe->feconn, 1);
1176 _HA_ATOMIC_SUB(&l->nbconn, 1);
1177 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001178
1179 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001180 resume_listener(l);
1181
1182 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001183 dequeue_all_listeners();
Willy Tarreau05f50472017-09-15 09:19:58 +02001184
Olivier Houchard859dc802019-08-08 15:47:21 +02001185 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001186 (!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 +01001187 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001188}
1189
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001190/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1191static int listener_queue_init()
1192{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001193 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1194 if (!global_listener_queue_task) {
1195 ha_alert("Out of memory when initializing global listener queue\n");
1196 return ERR_FATAL|ERR_ABORT;
1197 }
1198 /* very simple initialization, users will queue the task if needed */
1199 global_listener_queue_task->context = NULL; /* not even a context! */
1200 global_listener_queue_task->process = manage_global_listener_queue;
1201
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001202 return 0;
1203}
1204
1205static void listener_queue_deinit()
1206{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001207 task_destroy(global_listener_queue_task);
1208 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001209}
1210
1211REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1212REGISTER_POST_DEINIT(listener_queue_deinit);
1213
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001214
1215/* This is the global management task for listeners. It enables listeners waiting
1216 * for global resources when there are enough free resource, or at least once in
1217 * a while. It is designed to be called as a task.
1218 */
1219static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state)
1220{
1221 /* If there are still too many concurrent connections, let's wait for
1222 * some of them to go away. We don't need to re-arm the timer because
1223 * each of them will scan the queue anyway.
1224 */
1225 if (unlikely(actconn >= global.maxconn))
1226 goto out;
1227
1228 /* We should periodically try to enable listeners waiting for a global
1229 * resource here, because it is possible, though very unlikely, that
1230 * they have been blocked by a temporary lack of global resource such
1231 * as a file descriptor or memory and that the temporary condition has
1232 * disappeared.
1233 */
1234 dequeue_all_listeners();
1235
1236 out:
1237 t->expire = TICK_ETERNITY;
1238 task_queue(t);
1239 return t;
1240}
1241
Willy Tarreau26982662012-09-12 23:17:10 +02001242/*
1243 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1244 * parsing sessions.
1245 */
1246void bind_register_keywords(struct bind_kw_list *kwl)
1247{
1248 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1249}
1250
1251/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1252 * keyword is found with a NULL ->parse() function, then an attempt is made to
1253 * find one with a valid ->parse() function. This way it is possible to declare
1254 * platform-dependant, known keywords as NULL, then only declare them as valid
1255 * if some options are met. Note that if the requested keyword contains an
1256 * opening parenthesis, everything from this point is ignored.
1257 */
1258struct bind_kw *bind_find_kw(const char *kw)
1259{
1260 int index;
1261 const char *kwend;
1262 struct bind_kw_list *kwl;
1263 struct bind_kw *ret = NULL;
1264
1265 kwend = strchr(kw, '(');
1266 if (!kwend)
1267 kwend = kw + strlen(kw);
1268
1269 list_for_each_entry(kwl, &bind_keywords.list, list) {
1270 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1271 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1272 kwl->kw[index].kw[kwend-kw] == 0) {
1273 if (kwl->kw[index].parse)
1274 return &kwl->kw[index]; /* found it !*/
1275 else
1276 ret = &kwl->kw[index]; /* may be OK */
1277 }
1278 }
1279 }
1280 return ret;
1281}
1282
Willy Tarreau8638f482012-09-18 18:01:17 +02001283/* Dumps all registered "bind" keywords to the <out> string pointer. The
1284 * unsupported keywords are only dumped if their supported form was not
1285 * found.
1286 */
1287void bind_dump_kws(char **out)
1288{
1289 struct bind_kw_list *kwl;
1290 int index;
1291
Christopher Faulet784063e2020-05-18 12:14:18 +02001292 if (!out)
1293 return;
1294
Willy Tarreau8638f482012-09-18 18:01:17 +02001295 *out = NULL;
1296 list_for_each_entry(kwl, &bind_keywords.list, list) {
1297 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1298 if (kwl->kw[index].parse ||
1299 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001300 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1301 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001302 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001303 kwl->kw[index].skip ? " <arg>" : "",
1304 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001305 }
1306 }
1307 }
1308}
1309
Willy Tarreau645513a2010-05-24 20:55:15 +02001310/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001311/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001312/************************************************************************/
1313
Willy Tarreaua5e37562011-12-16 17:06:15 +01001314/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001315static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001316smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001317{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001318 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001319 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001320 return 1;
1321}
1322
Willy Tarreaua5e37562011-12-16 17:06:15 +01001323/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001324static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001325smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001326{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001327 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001328 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001329 return 1;
1330}
Jerome Magnineb421b22020-03-27 22:08:40 +01001331static int
1332smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1333{
1334 smp->data.u.str.area = smp->sess->listener->name;
1335 if (!smp->data.u.str.area)
1336 return 0;
1337
1338 smp->data.type = SMP_T_STR;
1339 smp->flags = SMP_F_CONST;
1340 smp->data.u.str.data = strlen(smp->data.u.str.area);
1341 return 1;
1342}
Willy Tarreau645513a2010-05-24 20:55:15 +02001343
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001344/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001345static 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 +02001346{
1347 struct listener *l;
1348
Willy Tarreau4348fad2012-09-20 16:48:07 +02001349 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001350 l->options |= LI_O_ACC_PROXY;
1351
1352 return 0;
1353}
1354
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001355/* parse the "accept-netscaler-cip" bind keyword */
1356static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1357{
1358 struct listener *l;
1359 uint32_t val;
1360
1361 if (!*args[cur_arg + 1]) {
1362 memprintf(err, "'%s' : missing value", args[cur_arg]);
1363 return ERR_ALERT | ERR_FATAL;
1364 }
1365
1366 val = atol(args[cur_arg + 1]);
1367 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001368 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001369 return ERR_ALERT | ERR_FATAL;
1370 }
1371
1372 list_for_each_entry(l, &conf->listeners, by_bind) {
1373 l->options |= LI_O_ACC_CIP;
1374 conf->ns_cip_magic = val;
1375 }
1376
1377 return 0;
1378}
1379
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001380/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001381static 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 +02001382{
1383 struct listener *l;
1384 int val;
1385
1386 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001387 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001388 return ERR_ALERT | ERR_FATAL;
1389 }
1390
1391 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001392 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001393 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001394 return ERR_ALERT | ERR_FATAL;
1395 }
1396
Willy Tarreau4348fad2012-09-20 16:48:07 +02001397 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001398 l->backlog = val;
1399
1400 return 0;
1401}
1402
1403/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001404static 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 +02001405{
1406 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001407 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001408 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001409
Willy Tarreau4348fad2012-09-20 16:48:07 +02001410 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001411 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001412 return ERR_ALERT | ERR_FATAL;
1413 }
1414
1415 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001416 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001417 return ERR_ALERT | ERR_FATAL;
1418 }
1419
Willy Tarreau4348fad2012-09-20 16:48:07 +02001420 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001421 new->luid = strtol(args[cur_arg + 1], &error, 10);
1422 if (*error != '\0') {
1423 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1424 return ERR_ALERT | ERR_FATAL;
1425 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001426 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001427
Willy Tarreau4348fad2012-09-20 16:48:07 +02001428 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001429 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001430 return ERR_ALERT | ERR_FATAL;
1431 }
1432
Willy Tarreau4348fad2012-09-20 16:48:07 +02001433 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001434 if (node) {
1435 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001436 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1437 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1438 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001439 return ERR_ALERT | ERR_FATAL;
1440 }
1441
Willy Tarreau4348fad2012-09-20 16:48:07 +02001442 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001443 return 0;
1444}
1445
1446/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001447static 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 +02001448{
1449 struct listener *l;
1450 int val;
1451
1452 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001453 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001454 return ERR_ALERT | ERR_FATAL;
1455 }
1456
1457 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001458 if (val < 0) {
1459 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001460 return ERR_ALERT | ERR_FATAL;
1461 }
1462
Willy Tarreau4348fad2012-09-20 16:48:07 +02001463 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001464 l->maxconn = val;
1465
1466 return 0;
1467}
1468
1469/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001470static 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 +02001471{
1472 struct listener *l;
1473
1474 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001475 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001476 return ERR_ALERT | ERR_FATAL;
1477 }
1478
Willy Tarreau4348fad2012-09-20 16:48:07 +02001479 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001480 l->name = strdup(args[cur_arg + 1]);
1481
1482 return 0;
1483}
1484
1485/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001486static 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 +02001487{
1488 struct listener *l;
1489 int val;
1490
1491 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001492 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001493 return ERR_ALERT | ERR_FATAL;
1494 }
1495
1496 val = atol(args[cur_arg + 1]);
1497 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001498 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001499 return ERR_ALERT | ERR_FATAL;
1500 }
1501
Willy Tarreau4348fad2012-09-20 16:48:07 +02001502 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001503 l->nice = val;
1504
1505 return 0;
1506}
1507
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001508/* parse the "process" bind keyword */
1509static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1510{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001511 char *slash;
1512 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001513
Christopher Fauletc644fa92017-11-23 22:44:11 +01001514 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1515 *slash = 0;
1516
Willy Tarreauff9c9142019-02-07 10:39:36 +01001517 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001518 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001519 return ERR_ALERT | ERR_FATAL;
1520 }
1521
Christopher Fauletc644fa92017-11-23 22:44:11 +01001522 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001523 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001524 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1525 return ERR_ALERT | ERR_FATAL;
1526 }
1527 *slash = '/';
1528 }
1529
Willy Tarreaue26993c2020-09-03 07:18:55 +02001530 conf->settings.bind_proc |= proc;
1531 conf->settings.bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001532 return 0;
1533}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001534
Christopher Fauleta717b992018-04-10 14:43:00 +02001535/* parse the "proto" bind keyword */
1536static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1537{
1538 struct ist proto;
1539
1540 if (!*args[cur_arg + 1]) {
1541 memprintf(err, "'%s' : missing value", args[cur_arg]);
1542 return ERR_ALERT | ERR_FATAL;
1543 }
1544
1545 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1546 conf->mux_proto = get_mux_proto(proto);
1547 if (!conf->mux_proto) {
1548 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1549 return ERR_ALERT | ERR_FATAL;
1550 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001551 return 0;
1552}
1553
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001554/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1555static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1556 struct proxy *defpx, const char *file, int line,
1557 char **err)
1558{
1559 if (too_many_args(1, args, err, NULL))
1560 return -1;
1561
1562 if (strcmp(args[1], "on") == 0)
1563 global.tune.options |= GTUNE_LISTENER_MQ;
1564 else if (strcmp(args[1], "off") == 0)
1565 global.tune.options &= ~GTUNE_LISTENER_MQ;
1566 else {
1567 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1568 return -1;
1569 }
1570 return 0;
1571}
1572
Willy Tarreau61612d42012-04-19 18:42:05 +02001573/* Note: must not be declared <const> as its list will be overwritten.
1574 * Please take care of keeping this list alphabetically sorted.
1575 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001576static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001577 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1578 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001579 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001580 { /* END */ },
1581}};
1582
Willy Tarreau0108d902018-11-25 19:14:37 +01001583INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1584
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001585/* Note: must not be declared <const> as its list will be overwritten.
1586 * Please take care of keeping this list alphabetically sorted.
1587 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001588static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001589 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001590}};
1591
Willy Tarreau0108d902018-11-25 19:14:37 +01001592INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1593
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001594/* Note: must not be declared <const> as its list will be overwritten.
1595 * Please take care of keeping this list alphabetically sorted, doing so helps
1596 * all code contributors.
1597 * Optional keywords are also declared with a NULL ->parse() function so that
1598 * the config parser can report an appropriate error when a known keyword was
1599 * not enabled.
1600 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001601static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001602 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001603 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1604 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1605 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1606 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1607 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1608 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001609 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001610 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001611 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001612}};
1613
Willy Tarreau0108d902018-11-25 19:14:37 +01001614INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1615
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001616/* config keyword parsers */
1617static struct cfg_kw_list cfg_kws = {ILH, {
1618 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1619 { 0, NULL, NULL }
1620}};
1621
1622INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1623
Willy Tarreau645513a2010-05-24 20:55:15 +02001624/*
1625 * Local variables:
1626 * c-indent-level: 8
1627 * c-basic-offset: 8
1628 * End:
1629 */