blob: 25b22e13c442fd64246a6370b3eb1aae05e26d70 [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 Tarreau6ae1ba62014-05-07 19:01:58 +020013#include <ctype.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020014#include <errno.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020015#include <stdio.h>
16#include <string.h>
Willy Tarreau95ccdde2014-02-01 09:28:36 +010017#include <unistd.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020018
Willy Tarreaudcc048a2020-06-04 19:11:43 +020019#include <haproxy/acl.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020020#include <haproxy/api.h>
Willy Tarreau5d9ddc52021-10-06 19:54:09 +020021#include <haproxy/activity.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020022#include <haproxy/cfgparse.h>
Willy Tarreaudbf78022021-10-06 09:05:08 +020023#include <haproxy/cli-t.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/protocol.h>
Willy Tarreau5958c432021-05-08 20:30:37 +020033#include <haproxy/proxy.h>
Frédéric Lécaille748ece62022-05-21 23:58:40 +020034#include <haproxy/quic_tp.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020035#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 Tarreau9310f482021-10-06 16:18:40 +020038#include <haproxy/ticks.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 */
Willy Tarreauca1acd62022-03-29 15:02:44 +020043struct bind_kw_list bind_keywords = {
Willy Tarreau26982662012-09-12 23:17:10 +020044 .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;
Willy Tarreau469fa472022-11-22 09:08:23 +010050__decl_thread(static HA_RWLOCK_T global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +010051
William Dauchy3679d0c2021-02-14 23:22:55 +010052/* listener status for stats */
53const char* li_status_st[LI_STATE_COUNT] = {
54 [LI_STATUS_WAITING] = "WAITING",
55 [LI_STATUS_OPEN] = "OPEN",
56 [LI_STATUS_FULL] = "FULL",
57};
Willy Tarreaua1d97f82019-12-10 11:18:41 +010058
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
Willy Tarreau83efc322020-10-14 17:37:17 +020064 * consumer). Returns the accepted connection or NULL if none was found.
Willy Tarreau1efafce2019-01-27 15:37:19 +010065 */
Willy Tarreau83efc322020-10-14 17:37:17 +020066struct connection *accept_queue_pop_sc(struct accept_queue_ring *ring)
Willy Tarreau1efafce2019-01-27 15:37:19 +010067{
Willy Tarreau1efafce2019-01-27 15:37:19 +010068 unsigned int pos, next;
Willy Tarreau83efc322020-10-14 17:37:17 +020069 struct connection *ptr;
70 struct connection **e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010071
72 pos = ring->head;
73
74 if (pos == ring->tail)
Willy Tarreau83efc322020-10-14 17:37:17 +020075 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010076
77 next = pos + 1;
78 if (next >= ACCEPT_QUEUE_SIZE)
79 next = 0;
80
81 e = &ring->entry[pos];
82
83 /* wait for the producer to update the listener's pointer */
84 while (1) {
Willy Tarreau83efc322020-10-14 17:37:17 +020085 ptr = *e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010086 __ha_barrier_load();
87 if (ptr)
88 break;
89 pl_cpu_relax();
90 }
91
Willy Tarreau1efafce2019-01-27 15:37:19 +010092 /* release the entry */
Willy Tarreau83efc322020-10-14 17:37:17 +020093 *e = NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010094
95 __ha_barrier_store();
96 ring->head = next;
Willy Tarreau83efc322020-10-14 17:37:17 +020097 return ptr;
Willy Tarreau1efafce2019-01-27 15:37:19 +010098}
99
100
Willy Tarreau83efc322020-10-14 17:37:17 +0200101/* tries to push a new accepted connection <conn> into ring <ring>. Returns
102 * non-zero if it succeeds, or zero if the ring is full. Supports multiple
103 * producers.
Willy Tarreau1efafce2019-01-27 15:37:19 +0100104 */
Willy Tarreau83efc322020-10-14 17:37:17 +0200105int accept_queue_push_mp(struct accept_queue_ring *ring, struct connection *conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100106{
Willy Tarreau1efafce2019-01-27 15:37:19 +0100107 unsigned int pos, next;
108
109 pos = ring->tail;
110 do {
111 next = pos + 1;
112 if (next >= ACCEPT_QUEUE_SIZE)
113 next = 0;
114 if (next == ring->head)
115 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100116 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100117
Willy Tarreau83efc322020-10-14 17:37:17 +0200118 ring->entry[pos] = conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100119 __ha_barrier_store();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100120 return 1;
121}
122
Willy Tarreaufb5401f2021-01-29 12:25:23 +0100123/* proceed with accepting new connections. Don't mark it static so that it appears
124 * in task dumps.
125 */
Willy Tarreau144f84a2021-03-02 16:09:26 +0100126struct task *accept_queue_process(struct task *t, void *context, unsigned int state)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100127{
128 struct accept_queue_ring *ring = context;
Willy Tarreau83efc322020-10-14 17:37:17 +0200129 struct connection *conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100130 struct listener *li;
Christopher Faulet102854c2019-04-30 12:17:13 +0200131 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100132 int ret;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100133
Christopher Faulet102854c2019-04-30 12:17:13 +0200134 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
135 * is not really illimited, but it is probably enough.
136 */
Willy Tarreau66161322021-02-19 15:50:27 +0100137 max_accept = global.tune.maxaccept ? global.tune.maxaccept : MAX_ACCEPT;
Christopher Faulet102854c2019-04-30 12:17:13 +0200138 for (; max_accept; max_accept--) {
Willy Tarreau83efc322020-10-14 17:37:17 +0200139 conn = accept_queue_pop_sc(ring);
140 if (!conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100141 break;
142
Willy Tarreau83efc322020-10-14 17:37:17 +0200143 li = __objt_listener(conn->target);
Willy Tarreau4781b152021-04-06 13:53:36 +0200144 _HA_ATOMIC_INC(&li->thr_conn[tid]);
Willy Tarreau30836152023-01-12 19:10:17 +0100145 ret = li->bind_conf->accept(conn);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100146 if (ret <= 0) {
147 /* connection was terminated by the application */
148 continue;
149 }
150
151 /* increase the per-process number of cumulated sessions, this
Willy Tarreau30836152023-01-12 19:10:17 +0100152 * may only be done once l->bind_conf->accept() has accepted the
153 * connection.
Willy Tarreau1efafce2019-01-27 15:37:19 +0100154 */
Willy Tarreau17146802023-01-12 19:58:42 +0100155 if (!(li->bind_conf->options & BC_O_UNLIMITED)) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100156 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
157 update_freq_ctr(&global.sess_per_sec, 1));
Willy Tarreau11ba4042022-05-20 15:56:32 +0200158 if (li->bind_conf && li->bind_conf->options & BC_O_USE_SSL) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100159 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
160 update_freq_ctr(&global.ssl_per_sec, 1));
161 }
162 }
163 }
164
165 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200166 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200167 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100168
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200169 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100170}
171
172/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
173static int accept_queue_init()
174{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200175 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100176 int i;
177
178 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200179 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100180 if (!t) {
181 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
182 return ERR_FATAL|ERR_ABORT;
183 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200184 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100185 t->process = accept_queue_process;
186 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200187 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100188 }
189 return 0;
190}
191
192REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
193
Willy Tarreaue01b08d2022-04-27 18:42:47 +0200194static void accept_queue_deinit()
195{
196 int i;
197
198 for (i = 0; i < global.nbthread; i++) {
199 if (accept_queue_rings[i].tasklet)
200 tasklet_free(accept_queue_rings[i].tasklet);
201 }
202}
203
204REGISTER_POST_DEINIT(accept_queue_deinit);
205
Willy Tarreau1efafce2019-01-27 15:37:19 +0100206#endif // USE_THREAD
207
Amaury Denoyellef68b2cb2022-01-25 16:21:47 +0100208/* Memory allocation and initialization of the per_thr field.
209 * Returns 0 if the field has been successfully initialized, -1 on failure.
210 */
211int li_init_per_thr(struct listener *li)
212{
213 int i;
214
215 /* allocate per-thread elements for listener */
216 li->per_thr = calloc(global.nbthread, sizeof(*li->per_thr));
217 if (!li->per_thr)
218 return -1;
219
220 for (i = 0; i < global.nbthread; ++i) {
221 MT_LIST_INIT(&li->per_thr[i].quic_accept.list);
222 MT_LIST_INIT(&li->per_thr[i].quic_accept.conns);
223
224 li->per_thr[i].li = li;
225 }
226
227 return 0;
228}
229
William Dauchy3679d0c2021-02-14 23:22:55 +0100230/* helper to get listener status for stats */
231enum li_status get_li_status(struct listener *l)
232{
Willy Tarreau758c69d2023-01-12 18:59:37 +0100233 if (!l->bind_conf->maxconn || l->nbconn < l->bind_conf->maxconn) {
William Dauchy3679d0c2021-02-14 23:22:55 +0100234 if (l->state == LI_LIMITED)
235 return LI_STATUS_WAITING;
236 else
237 return LI_STATUS_OPEN;
238 }
239 return LI_STATUS_FULL;
240}
241
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200242/* adjust the listener's state and its proxy's listener counters if needed.
243 * It must be called under the listener's lock, but uses atomic ops to change
244 * the proxy's counters so that the proxy lock is not needed.
245 */
Willy Tarreaua37b2442020-09-24 07:23:45 +0200246void listener_set_state(struct listener *l, enum li_state st)
247{
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200248 struct proxy *px = l->bind_conf->frontend;
249
250 if (px) {
251 /* from state */
252 switch (l->state) {
253 case LI_NEW: /* first call */
Willy Tarreau4781b152021-04-06 13:53:36 +0200254 _HA_ATOMIC_INC(&px->li_all);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200255 break;
256 case LI_INIT:
257 case LI_ASSIGNED:
258 break;
259 case LI_PAUSED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200260 _HA_ATOMIC_DEC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200261 break;
262 case LI_LISTEN:
Willy Tarreau4781b152021-04-06 13:53:36 +0200263 _HA_ATOMIC_DEC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200264 break;
265 case LI_READY:
266 case LI_FULL:
267 case LI_LIMITED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200268 _HA_ATOMIC_DEC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200269 break;
270 }
271
272 /* to state */
273 switch (st) {
274 case LI_NEW:
275 case LI_INIT:
276 case LI_ASSIGNED:
277 break;
278 case LI_PAUSED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200279 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200280 _HA_ATOMIC_INC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200281 break;
282 case LI_LISTEN:
Willy Tarreau95a34602020-10-08 15:32:21 +0200283 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200284 _HA_ATOMIC_INC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200285 break;
286 case LI_READY:
287 case LI_FULL:
288 case LI_LIMITED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200289 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200290 _HA_ATOMIC_INC(&px->li_ready);
Aurelien DARRAGON23705992023-02-14 08:51:14 +0100291 l->flags |= LI_F_FINALIZED;
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200292 break;
293 }
294 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200295 l->state = st;
296}
297
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100298/* This function adds the specified listener's file descriptor to the polling
299 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500300 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200301 * also support binding only the relevant processes to their respective
302 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100303 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200304void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100305{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100306 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200307
308 /* If this listener is supposed to be only in the master, close it in
309 * the workers. Conversely, if it's supposed to be only in the workers
310 * close it in the master.
311 */
Willy Tarreau18c20d22020-10-09 16:11:46 +0200312 if (!!master != !!(listener->rx.flags & RX_F_MWORKER))
Willy Tarreau75c98d12020-10-09 15:55:23 +0200313 do_unbind_listener(listener);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200314
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100315 if (listener->state == LI_LISTEN) {
Willy Tarreau95a34602020-10-08 15:32:21 +0200316 BUG_ON(listener->rx.fd == -1);
William Lallemand095ba4c2017-06-01 17:38:50 +0200317 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau72faef32021-06-15 08:36:30 +0200318 (!!master != !!(listener->rx.flags & RX_F_MWORKER))) {
Willy Tarreauae302532014-05-07 19:22:24 +0200319 /* we don't want to enable this listener and don't
320 * want any fd event to reach it.
321 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200322 do_unbind_listener(listener);
Willy Tarreauae302532014-05-07 19:22:24 +0200323 }
Willy Tarreau758c69d2023-01-12 18:59:37 +0100324 else if (!listener->bind_conf->maxconn || listener->nbconn < listener->bind_conf->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200325 listener->rx.proto->enable(listener);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200326 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200327 }
328 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200329 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100330 }
331 }
Willy Tarreaud6afb532020-10-09 10:35:40 +0200332
Willy Tarreau08b6f962022-02-01 16:23:00 +0100333 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100334}
335
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200336/*
Aurelien DARRAGON187396e2022-09-11 16:19:49 +0200337 * This function completely stops a listener.
338 * The proxy's listeners count is updated and the proxy is
339 * disabled and woken up after the last one is gone.
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100340 * It will need to operate under the proxy's lock, the protocol's lock and
341 * the listener's lock. The caller is responsible for indicating in lpx,
342 * lpr, lli whether the respective locks are already held (non-zero) or
343 * not (zero) so that the function picks the missing ones, in this order.
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200344 */
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100345void stop_listener(struct listener *l, int lpx, int lpr, int lli)
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200346{
347 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200348
Willy Tarreau17146802023-01-12 19:58:42 +0100349 if (l->bind_conf->options & BC_O_NOSTOP) {
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200350 /* master-worker sockpairs are never closed but don't count as a
351 * job.
352 */
353 return;
354 }
355
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200356 if (!lpx && px)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200357 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200358
359 if (!lpr)
360 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
361
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100362 if (!lli)
363 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200364
365 if (l->state > LI_INIT) {
Willy Tarreau75c98d12020-10-09 15:55:23 +0200366 do_unbind_listener(l);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200367
368 if (l->state >= LI_ASSIGNED)
369 __delete_listener(l);
370
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200371 if (px)
372 proxy_cond_disable(px);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200373 }
374
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100375 if (!lli)
376 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200377
378 if (!lpr)
379 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
380
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200381 if (!lpx && px)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200382 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200383}
384
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100385/* This function adds the specified <listener> to the protocol <proto>. It
386 * does nothing if the protocol was already added. The listener's state is
387 * automatically updated from LI_INIT to LI_ASSIGNED. The number of listeners
388 * for the protocol is updated. This must be called with the proto lock held.
389 */
390void default_add_listener(struct protocol *proto, struct listener *listener)
391{
392 if (listener->state != LI_INIT)
393 return;
394 listener_set_state(listener, LI_ASSIGNED);
395 listener->rx.proto = proto;
Willy Tarreau2b718102021-04-21 07:32:39 +0200396 LIST_APPEND(&proto->receivers, &listener->rx.proto_list);
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100397 proto->nb_receivers++;
398}
399
Willy Tarreaue03204c2020-10-09 17:02:21 +0200400/* default function called to suspend a listener: it simply passes the call to
401 * the underlying receiver. This is find for most socket-based protocols. This
402 * must be called under the listener's lock. It will return non-zero on success,
403 * 0 on failure. If no receiver-level suspend is provided, the operation is
404 * assumed to succeed.
405 */
406int default_suspend_listener(struct listener *l)
407{
408 int ret = 1;
409
410 if (!l->rx.proto->rx_suspend)
411 return 1;
412
413 ret = l->rx.proto->rx_suspend(&l->rx);
414 return ret > 0 ? ret : 0;
415}
416
417
418/* Tries to resume a suspended listener, and returns non-zero on success or
419 * zero on failure. On certain errors, an alert or a warning might be displayed.
420 * It must be called with the listener's lock held. Depending on the listener's
421 * state and protocol, a listen() call might be used to resume operations, or a
422 * call to the receiver's resume() function might be used as well. This is
423 * suitable as a default function for TCP and UDP. This must be called with the
424 * listener's lock held.
425 */
426int default_resume_listener(struct listener *l)
427{
428 int ret = 1;
429
430 if (l->state == LI_ASSIGNED) {
431 char msg[100];
432 int err;
433
434 err = l->rx.proto->listen(l, msg, sizeof(msg));
435 if (err & ERR_ALERT)
436 ha_alert("Resuming listener: %s\n", msg);
437 else if (err & ERR_WARN)
438 ha_warning("Resuming listener: %s\n", msg);
439
440 if (err & (ERR_FATAL | ERR_ABORT)) {
441 ret = 0;
442 goto end;
443 }
444 }
445
446 if (l->state < LI_PAUSED) {
447 ret = 0;
448 goto end;
449 }
450
451 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
452 l->rx.proto->rx_resume(&l->rx) <= 0)
453 ret = 0;
454 end:
455 return ret;
456}
457
458
Willy Tarreaube58c382011-07-24 18:28:10 +0200459/* This function tries to temporarily disable a listener, depending on the OS
460 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
461 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
462 * closes upon SHUT_WR and refuses to rebind. So a common validation path
463 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
464 * is disabled. It normally returns non-zero, unless an error is reported.
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100465 * It will need to operate under the proxy's lock and the listener's lock.
466 * The caller is responsible for indicating in lpx, lli whether the respective
467 * locks are already held (non-zero) or not (zero) so that the function pick
468 * the missing ones, in this order.
Willy Tarreaube58c382011-07-24 18:28:10 +0200469 */
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100470int pause_listener(struct listener *l, int lpx, int lli)
Willy Tarreaube58c382011-07-24 18:28:10 +0200471{
Willy Tarreau58651b42020-09-24 16:03:29 +0200472 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200473 int ret = 1;
474
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200475 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200476 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
477
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100478 if (!lli)
479 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200480
Aurelien DARRAGON23705992023-02-14 08:51:14 +0100481 if (!(l->flags & LI_F_FINALIZED) || l->state <= LI_PAUSED)
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200482 goto end;
483
Willy Tarreaue03204c2020-10-09 17:02:21 +0200484 if (l->rx.proto->suspend)
485 ret = l->rx.proto->suspend(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200486
Willy Tarreau2b718102021-04-21 07:32:39 +0200487 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200488
Willy Tarreaua37b2442020-09-24 07:23:45 +0200489 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200490
491 if (px && !px->li_ready) {
Aurelien DARRAGONd46f4372022-09-09 15:51:37 +0200492 /* PROXY_LOCK is required */
493 proxy_cond_pause(px);
Willy Tarreau58651b42020-09-24 16:03:29 +0200494 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
495 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
496 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200497 end:
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100498 if (!lli)
499 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200500
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200501 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200502 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
503
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200504 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200505}
506
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200507/* This function tries to resume a temporarily disabled listener. Paused, full,
508 * limited and disabled listeners are handled, which means that this function
509 * may replace enable_listener(). The resulting state will either be LI_READY
510 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200511 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200512 * foreground mode, and are ignored. If the listener was only in the assigned
513 * state, it's totally rebound. This can happen if a pause() has completely
514 * stopped it. If the resume fails, 0 is returned and an error might be
515 * displayed.
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100516 * It will need to operate under the proxy's lock and the listener's lock.
517 * The caller is responsible for indicating in lpx, lli whether the respective
518 * locks are already held (non-zero) or not (zero) so that the function pick
519 * the missing ones, in this order.
Willy Tarreaube58c382011-07-24 18:28:10 +0200520 */
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100521int resume_listener(struct listener *l, int lpx, int lli)
Willy Tarreaube58c382011-07-24 18:28:10 +0200522{
Willy Tarreau58651b42020-09-24 16:03:29 +0200523 struct proxy *px = l->bind_conf->frontend;
524 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200525 int ret = 1;
526
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200527 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200528 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
529
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100530 if (!lli)
531 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200532
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200533 /* check that another thread didn't to the job in parallel (e.g. at the
534 * end of listen_accept() while we'd come from dequeue_all_listeners().
535 */
Willy Tarreau2b718102021-04-21 07:32:39 +0200536 if (MT_LIST_INLIST(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200537 goto end;
538
Aurelien DARRAGON23705992023-02-14 08:51:14 +0100539 if (!(l->flags & LI_F_FINALIZED) || l->state == LI_READY)
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200540 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200541
Willy Tarreaue03204c2020-10-09 17:02:21 +0200542 if (l->rx.proto->resume)
543 ret = l->rx.proto->resume(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200544
Willy Tarreau758c69d2023-01-12 18:59:37 +0100545 if (l->bind_conf->maxconn && l->nbconn >= l->bind_conf->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200546 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200547 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200548 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200549 }
550
Willy Tarreau4b51f422020-09-25 20:32:28 +0200551 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200552 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200553
554 done:
555 if (was_paused && !px->li_paused) {
Aurelien DARRAGONd46f4372022-09-09 15:51:37 +0200556 /* PROXY_LOCK is required */
557 proxy_cond_resume(px);
Willy Tarreau58651b42020-09-24 16:03:29 +0200558 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
559 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
560 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200561 end:
Aurelien DARRAGON4059e092023-02-06 17:06:03 +0100562 if (!lli)
563 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200564
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +0200565 if (!lpx && px)
Aurelien DARRAGON00132882022-09-09 15:32:57 +0200566 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
567
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200568 return ret;
569}
570
Aurelien DARRAGONbcad7e62023-02-15 09:30:54 +0100571/* Same as resume_listener(), but will only work to resume from
572 * LI_FULL or LI_LIMITED states because we try to relax listeners that
573 * were temporarily restricted and not to resume inactive listeners that
574 * may have been paused or completely stopped in the meantime.
575 * Returns positive value for success and 0 for failure.
576 * It will need to operate under the proxy's lock and the listener's lock.
577 * The caller is responsible for indicating in lpx, lli whether the respective
578 * locks are already held (non-zero) or not (zero) so that the function pick
579 * the missing ones, in this order.
580 */
581int relax_listener(struct listener *l, int lpx, int lli)
582{
583 int ret = 1;
584
585 if (!lli)
586 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
587
588 if (l->state != LI_FULL && l->state != LI_LIMITED)
589 goto end; /* listener may be suspended or even stopped */
590 ret = resume_listener(l, lpx, 1);
591
592 end:
593 if (!lli)
594 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
595 return ret;
596}
597
Willy Tarreau87b09662015-04-03 00:22:06 +0200598/* Marks a ready listener as full so that the stream code tries to re-enable
Aurelien DARRAGONf5d98932023-02-06 17:19:58 +0100599 * it upon next close() using relax_listener().
Willy Tarreau62793712011-07-24 19:23:38 +0200600 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200601static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200602{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100603 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200604 if (l->state >= LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200605 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100606 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200607 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200608 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100609 }
Willy Tarreau62793712011-07-24 19:23:38 +0200610 }
Willy Tarreau08b6f962022-02-01 16:23:00 +0100611 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200612}
613
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200614/* Marks a ready listener as limited so that we only try to re-enable it when
615 * resources are free again. It will be queued into the specified queue.
616 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200617static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200618{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100619 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200620 if (l->state == LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200621 MT_LIST_TRY_APPEND(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200622 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200623 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200624 }
Willy Tarreau08b6f962022-02-01 16:23:00 +0100625 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200626}
627
Willy Tarreau241797a2019-12-10 14:10:52 +0100628/* Dequeues all listeners waiting for a resource the global wait queue */
629void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200630{
Willy Tarreau01abd022019-02-28 10:27:18 +0100631 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200632
Willy Tarreau241797a2019-12-10 14:10:52 +0100633 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200634 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100635 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200636 */
Aurelien DARRAGONf5d98932023-02-06 17:19:58 +0100637 relax_listener(listener, 0, 0);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200638 }
639}
640
Willy Tarreau241797a2019-12-10 14:10:52 +0100641/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
642void dequeue_proxy_listeners(struct proxy *px)
643{
644 struct listener *listener;
645
646 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
647 /* This cannot fail because the listeners are by definition in
648 * the LI_LIMITED state.
649 */
Aurelien DARRAGONf5d98932023-02-06 17:19:58 +0100650 relax_listener(listener, 0, 0);
Willy Tarreau241797a2019-12-10 14:10:52 +0100651 }
652}
653
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200654
655/* default function used to unbind a listener. This is for use by standard
656 * protocols working on top of accepted sockets. The receiver's rx_unbind()
657 * will automatically be used after the listener is disabled if the socket is
658 * still bound. This must be used under the listener's lock.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100659 */
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200660void default_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100661{
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200662 if (listener->state <= LI_ASSIGNED)
663 goto out_close;
664
665 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200666 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200667 goto out_close;
668 }
669
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200670 if (listener->state >= LI_READY) {
671 listener->rx.proto->disable(listener);
672 if (listener->rx.flags & RX_F_BOUND)
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200673 listener_set_state(listener, LI_LISTEN);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200674 }
675
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200676 out_close:
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200677 if (listener->rx.flags & RX_F_BOUND)
678 listener->rx.proto->rx_unbind(&listener->rx);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200679}
680
681/* This function closes the listening socket for the specified listener,
682 * provided that it's already in a listening state. The protocol's unbind()
683 * is called to put the listener into LI_ASSIGNED or LI_LISTEN and handle
684 * the unbinding tasks. The listener enters then the LI_ASSIGNED state if
685 * the receiver is unbound. Must be called with the lock held.
686 */
687void do_unbind_listener(struct listener *listener)
688{
Willy Tarreau2b718102021-04-21 07:32:39 +0200689 MT_LIST_DELETE(&listener->wait_queue);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200690
691 if (listener->rx.proto->unbind)
692 listener->rx.proto->unbind(listener);
Willy Tarreau374e9af2020-10-09 15:47:17 +0200693
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200694 /* we may have to downgrade the listener if the rx was closed */
695 if (!(listener->rx.flags & RX_F_BOUND) && listener->state > LI_ASSIGNED)
Willy Tarreau374e9af2020-10-09 15:47:17 +0200696 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100697}
698
Olivier Houchard1fc05162017-04-06 01:05:05 +0200699/* This function closes the listening socket for the specified listener,
700 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200701 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
702 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100703 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200704 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100705void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200706{
Willy Tarreau08b6f962022-02-01 16:23:00 +0100707 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200708 do_unbind_listener(listener);
Willy Tarreau08b6f962022-02-01 16:23:00 +0100709 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200710}
711
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200712/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
713 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200714 * allocation). The address family is taken from ss->ss_family, and the protocol
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200715 * passed in <proto> must be usable on this family. The protocol's default iocb
716 * is automatically preset as the receivers' iocb. The number of jobs and
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200717 * listeners is automatically increased by the number of listeners created. It
718 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200719 */
720int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200721 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200722{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200723 struct listener *l;
724 int port;
725
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200726 for (port = portl; port <= porth; port++) {
727 l = calloc(1, sizeof(*l));
728 if (!l) {
729 memprintf(err, "out of memory");
730 return 0;
731 }
732 l->obj_type = OBJ_TYPE_LISTENER;
Willy Tarreau2b718102021-04-21 07:32:39 +0200733 LIST_APPEND(&bc->frontend->conf.listeners, &l->by_fe);
734 LIST_APPEND(&bc->listeners, &l->by_bind);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200735 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200736 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200737 l->rx.owner = l;
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200738 l->rx.iocb = proto->default_iocb;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200739 l->rx.fd = fd;
Willy Tarreau07400c52020-12-04 14:49:11 +0100740
Willy Tarreau37159062020-08-27 07:48:42 +0200741 memcpy(&l->rx.addr, ss, sizeof(*ss));
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100742 if (proto->fam->set_port)
743 proto->fam->set_port(&l->rx.addr, port);
Willy Tarreau07400c52020-12-04 14:49:11 +0100744
Olivier Houchard859dc802019-08-08 15:47:21 +0200745 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200746 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200747
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100748 proto->add(proto, l);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200749
Willy Tarreau909c23b2020-09-15 13:50:58 +0200750 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200751 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100752
Amaury Denoyelle7f8f6cb2020-11-10 14:24:31 +0100753 l->extra_counters = NULL;
754
Willy Tarreau08b6f962022-02-01 16:23:00 +0100755 HA_RWLOCK_INIT(&l->lock);
Willy Tarreau4781b152021-04-06 13:53:36 +0200756 _HA_ATOMIC_INC(&jobs);
757 _HA_ATOMIC_INC(&listeners);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200758 }
759 return 1;
760}
761
Willy Tarreau59a877d2021-10-12 09:36:10 +0200762/* clones listener <src> and returns the new one. All dynamically allocated
763 * fields are reallocated (name for now). The new listener is inserted before
764 * the original one in the bind_conf and frontend lists. This allows it to be
765 * duplicated while iterating over the current list. The original listener must
766 * only be in the INIT or ASSIGNED states, and the new listener will only be
767 * placed into the INIT state. The counters are always set to NULL. Maxsock is
768 * updated. Returns NULL on allocation error.
769 */
770struct listener *clone_listener(struct listener *src)
771{
772 struct listener *l;
773
774 l = calloc(1, sizeof(*l));
775 if (!l)
776 goto oom1;
777 memcpy(l, src, sizeof(*l));
778
779 if (l->name) {
780 l->name = strdup(l->name);
781 if (!l->name)
782 goto oom2;
783 }
784
785 l->rx.owner = l;
786 l->state = LI_INIT;
787 l->counters = NULL;
788 l->extra_counters = NULL;
789
790 LIST_APPEND(&src->by_fe, &l->by_fe);
791 LIST_APPEND(&src->by_bind, &l->by_bind);
792
793 MT_LIST_INIT(&l->wait_queue);
794
795 l->rx.proto->add(l->rx.proto, l);
796
Willy Tarreau08b6f962022-02-01 16:23:00 +0100797 HA_RWLOCK_INIT(&l->lock);
Willy Tarreau59a877d2021-10-12 09:36:10 +0200798 _HA_ATOMIC_INC(&jobs);
799 _HA_ATOMIC_INC(&listeners);
800 global.maxsock++;
801 return l;
802
Willy Tarreau59a877d2021-10-12 09:36:10 +0200803 oom2:
804 free(l);
805 oom1:
Willy Tarreaua1462892021-10-16 14:45:29 +0200806 return NULL;
Willy Tarreau59a877d2021-10-12 09:36:10 +0200807}
808
Willy Tarreau1a64d162007-10-28 22:26:05 +0100809/* Delete a listener from its protocol's list of listeners. The listener's
810 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200811 * number of listeners is updated, as well as the global number of listeners
812 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200813 * is a low-level function expected to be called with the proto_lock and the
814 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100815 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200816void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100817{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100818 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200819 listener_set_state(listener, LI_INIT);
Willy Tarreau2b718102021-04-21 07:32:39 +0200820 LIST_DELETE(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200821 listener->rx.proto->nb_receivers--;
Willy Tarreau4781b152021-04-06 13:53:36 +0200822 _HA_ATOMIC_DEC(&jobs);
823 _HA_ATOMIC_DEC(&listeners);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100824 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200825}
826
827/* Delete a listener from its protocol's list of listeners (please check
828 * __delete_listener() above). The proto_lock and the listener's lock will
829 * be grabbed in this order.
830 */
831void delete_listener(struct listener *listener)
832{
833 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau08b6f962022-02-01 16:23:00 +0100834 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200835 __delete_listener(listener);
Willy Tarreau08b6f962022-02-01 16:23:00 +0100836 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200837 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100838}
839
Willy Tarreaue2711c72019-02-27 15:39:41 +0100840/* Returns a suitable value for a listener's backlog. It uses the listener's,
841 * otherwise the frontend's backlog, otherwise the listener's maxconn,
842 * otherwise the frontend's maxconn, otherwise 1024.
843 */
844int listener_backlog(const struct listener *l)
845{
Willy Tarreau1920f892023-01-12 18:55:13 +0100846 if (l->bind_conf->backlog)
847 return l->bind_conf->backlog;
Willy Tarreaue2711c72019-02-27 15:39:41 +0100848
849 if (l->bind_conf->frontend->backlog)
850 return l->bind_conf->frontend->backlog;
851
Willy Tarreau758c69d2023-01-12 18:59:37 +0100852 if (l->bind_conf->maxconn)
853 return l->bind_conf->maxconn;
Willy Tarreaue2711c72019-02-27 15:39:41 +0100854
855 if (l->bind_conf->frontend->maxconn)
856 return l->bind_conf->frontend->maxconn;
857
858 return 1024;
859}
860
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200861/* This function is called on a read event from a listening socket, corresponding
862 * to an accept. It tries to accept as many connections as possible, and for each
863 * calls the listener's accept handler (generally the frontend's accept handler).
864 */
Willy Tarreaua74cb382020-10-15 21:29:49 +0200865void listener_accept(struct listener *l)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200866{
Willy Tarreau83efc322020-10-14 17:37:17 +0200867 struct connection *cli_conn;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100868 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200869 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100870 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100871 int next_feconn = 0;
872 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200873 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200874 int ret;
875
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100876 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200877
Willy Tarreau882f2482023-01-12 18:52:23 +0100878 /* if l->bind_conf->maxaccept is -1, then max_accept is UINT_MAX. It is
879 * not really illimited, but it is probably enough.
Christopher Faulet102854c2019-04-30 12:17:13 +0200880 */
Willy Tarreau882f2482023-01-12 18:52:23 +0100881 max_accept = l->bind_conf->maxaccept ? l->bind_conf->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200882
Willy Tarreau17146802023-01-12 19:58:42 +0100883 if (!(l->bind_conf->options & BC_O_UNLIMITED) && global.sps_lim) {
Willy Tarreau93e7c002013-10-07 18:51:07 +0200884 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200885
886 if (unlikely(!max)) {
887 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200888 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100889 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200890 }
891
892 if (max_accept > max)
893 max_accept = max;
894 }
895
Willy Tarreau17146802023-01-12 19:58:42 +0100896 if (!(l->bind_conf->options & BC_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200897 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
898
899 if (unlikely(!max)) {
900 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200901 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100902 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200903 }
904
905 if (max_accept > max)
906 max_accept = max;
907 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200908#ifdef USE_OPENSSL
Willy Tarreau17146802023-01-12 19:58:42 +0100909 if (!(l->bind_conf->options & BC_O_UNLIMITED) && global.ssl_lim &&
Willy Tarreau11ba4042022-05-20 15:56:32 +0200910 l->bind_conf && l->bind_conf->options & BC_O_USE_SSL) {
Willy Tarreaue43d5322013-10-07 20:01:52 +0200911 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200912
Willy Tarreaue43d5322013-10-07 20:01:52 +0200913 if (unlikely(!max)) {
914 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200915 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100916 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200917 }
918
919 if (max_accept > max)
920 max_accept = max;
921 }
922#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200923 if (p && p->fe_sps_lim) {
924 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
925
926 if (unlikely(!max)) {
927 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100928 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
929 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200930 }
931
932 if (max_accept > max)
933 max_accept = max;
934 }
935
936 /* Note: if we fail to allocate a connection because of configured
937 * limits, we'll schedule a new attempt worst 1 second later in the
938 * worst case. If we fail due to system limits or temporary resource
939 * shortage, we try again 100ms later in the worst case.
940 */
Willy Tarreau02757d02021-01-28 18:07:24 +0100941 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200942 unsigned int count;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200943 int status;
Willy Tarreau0aa5a5b2020-10-16 17:43:04 +0200944 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200945
Willy Tarreau82c97892019-02-27 19:32:32 +0100946 /* pre-increase the number of connections without going too far.
947 * We process the listener, then the proxy, then the process.
948 * We know which ones to unroll based on the next_xxx value.
949 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100950 do {
951 count = l->nbconn;
Willy Tarreau758c69d2023-01-12 18:59:37 +0100952 if (unlikely(l->bind_conf->maxconn && count >= l->bind_conf->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100953 /* the listener was marked full or another
954 * thread is going to do it.
955 */
956 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100957 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100958 goto end;
959 }
960 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000961 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100962
Willy Tarreau82c97892019-02-27 19:32:32 +0100963 if (p) {
964 do {
965 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100966 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100967 /* the frontend was marked full or another
968 * thread is going to do it.
969 */
970 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100971 expire = TICK_ETERNITY;
972 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100973 }
974 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100975 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200976 }
977
Willy Tarreau17146802023-01-12 19:58:42 +0100978 if (!(l->bind_conf->options & BC_O_UNLIMITED)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100979 do {
980 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100981 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100982 /* the process was marked full or another
983 * thread is going to do it.
984 */
985 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100986 expire = tick_add(now_ms, 1000); /* try again in 1 second */
987 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100988 }
989 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000990 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200991 }
992
Willy Tarreaufed93d32022-02-01 16:37:00 +0100993 /* be careful below, the listener might be shutting down in
994 * another thread on error and we must not dereference its
995 * FD without a bit of protection.
996 */
997 cli_conn = NULL;
998 status = CO_AC_PERMERR;
999
1000 HA_RWLOCK_RDLOCK(LISTENER_LOCK, &l->lock);
1001 if (l->rx.flags & RX_F_BOUND)
1002 cli_conn = l->rx.proto->accept_conn(l, &status);
1003 HA_RWLOCK_RDUNLOCK(LISTENER_LOCK, &l->lock);
1004
Willy Tarreau9378bbe2020-10-15 10:09:31 +02001005 if (!cli_conn) {
1006 switch (status) {
1007 case CO_AC_DONE:
1008 goto end;
Willy Tarreau818dca52014-01-31 19:40:19 +01001009
Willy Tarreau9378bbe2020-10-15 10:09:31 +02001010 case CO_AC_RETRY: /* likely a signal */
Willy Tarreau4781b152021-04-06 13:53:36 +02001011 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001012 if (p)
Willy Tarreau4781b152021-04-06 13:53:36 +02001013 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau17146802023-01-12 19:58:42 +01001014 if (!(l->bind_conf->options & BC_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +02001015 _HA_ATOMIC_DEC(&actconn);
Willy Tarreaua593ec52014-01-20 21:21:30 +01001016 continue;
Willy Tarreau9378bbe2020-10-15 10:09:31 +02001017
1018 case CO_AC_YIELD:
Willy Tarreau92079932019-12-10 09:30:05 +01001019 max_accept = 0;
1020 goto end;
William Lallemandd9138002018-11-27 12:02:39 +01001021
Willy Tarreau9378bbe2020-10-15 10:09:31 +02001022 default:
1023 goto transient_error;
Willy Tarreau83efc322020-10-14 17:37:17 +02001024 }
1025 }
1026
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001027 /* The connection was accepted, it must be counted as such */
1028 if (l->counters)
1029 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
1030
Willy Tarreaud8679342022-05-09 20:41:54 +02001031 if (p) {
Willy Tarreau82c97892019-02-27 19:32:32 +01001032 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
Willy Tarreaud8679342022-05-09 20:41:54 +02001033 proxy_inc_fe_conn_ctr(l, p);
1034 }
Willy Tarreau82c97892019-02-27 19:32:32 +01001035
Willy Tarreau17146802023-01-12 19:58:42 +01001036 if (!(l->bind_conf->options & BC_O_UNLIMITED)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001037 count = update_freq_ctr(&global.conn_per_sec, 1);
1038 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001039 }
1040
Willy Tarreau4781b152021-04-06 13:53:36 +02001041 _HA_ATOMIC_INC(&activity[tid].accepted);
Willy Tarreau64a9c052019-04-12 15:27:17 +02001042
Willy Tarreau30836152023-01-12 19:10:17 +01001043 /* past this point, l->bind_conf->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +01001044 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
1045 * allows the error path not to rollback on nbconn. It's more
1046 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001047 */
1048 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +01001049 next_feconn = 0;
1050 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001051
Willy Tarreau83efc322020-10-14 17:37:17 +02001052
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001053#if defined(USE_THREAD)
Amaury Denoyelle7f7713d2022-01-19 11:37:50 +01001054 if (l->rx.flags & RX_F_LOCAL_ACCEPT)
1055 goto local_accept;
1056
Willy Tarreaub2f38c12023-01-19 19:14:18 +01001057 mask = l->rx.bind_thread & _HA_ATOMIC_LOAD(&tg->threads_enabled);
Willy Tarreaua7da5e82020-03-12 17:33:29 +01001058 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001059 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001060 unsigned int t, t0, t1, t2;
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001061 int base = tg->base;
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001062
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001063 /* The principle is that we have two running indexes,
1064 * each visiting in turn all threads bound to this
1065 * listener. The connection will be assigned to the one
1066 * with the least connections, and the other one will
1067 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001068 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001069 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001070 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001071
1072 /* keep a copy for the final update. thr_idx is composite
1073 * and made of (t2<<16) + t1.
1074 */
Willy Tarreau0cf33172019-03-06 15:26:33 +01001075 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001076 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001077 unsigned long m1, m2;
1078 int q1, q2;
1079
1080 t2 = t1 = t0;
1081 t2 >>= 16;
1082 t1 &= 0xFFFF;
1083
1084 /* t1 walks low to high bits ;
1085 * t2 walks high to low.
1086 */
1087 m1 = mask >> t1;
1088 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
1089
Willy Tarreau85d04242019-04-16 18:09:13 +02001090 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001091 m1 &= ~1UL;
1092 if (!m1) {
1093 m1 = mask;
1094 t1 = 0;
1095 }
1096 t1 += my_ffsl(m1) - 1;
1097 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001098
Willy Tarreau85d04242019-04-16 18:09:13 +02001099 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
1100 /* highest bit not set */
1101 if (!m2)
1102 m2 = mask;
1103
1104 t2 = my_flsl(m2) - 1;
1105 }
1106
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001107 /* now we have two distinct thread IDs belonging to the mask */
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001108 q1 = accept_queue_rings[base + t1].tail - accept_queue_rings[base + t1].head + ACCEPT_QUEUE_SIZE;
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001109 if (q1 >= ACCEPT_QUEUE_SIZE)
1110 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001111
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001112 q2 = accept_queue_rings[base + t2].tail - accept_queue_rings[base + t2].head + ACCEPT_QUEUE_SIZE;
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001113 if (q2 >= ACCEPT_QUEUE_SIZE)
1114 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001115
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001116 /* we have 3 possibilities now :
1117 * q1 < q2 : t1 is less loaded than t2, so we pick it
1118 * and update t2 (since t1 might still be
1119 * lower than another thread)
1120 * q1 > q2 : t2 is less loaded than t1, so we pick it
1121 * and update t1 (since t2 might still be
1122 * lower than another thread)
1123 * q1 = q2 : both are equally loaded, thus we pick t1
1124 * and update t1 as it will become more loaded
1125 * than t2.
1126 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001127
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001128 q1 += l->thr_conn[base + t1];
1129 q2 += l->thr_conn[base + t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001130
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001131 if (q1 - q2 < 0) {
1132 t = t1;
1133 t2 = t2 ? t2 - 1 : LONGBITS - 1;
1134 }
1135 else if (q1 - q2 > 0) {
1136 t = t2;
1137 t1++;
1138 if (t1 >= LONGBITS)
1139 t1 = 0;
1140 }
1141 else {
1142 t = t1;
1143 t1++;
1144 if (t1 >= LONGBITS)
1145 t1 = 0;
1146 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001147
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001148 /* new value for thr_idx */
1149 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001150 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001151
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001152 /* We successfully selected the best thread "t" for this
1153 * connection. We use deferred accepts even if it's the
1154 * local thread because tests show that it's the best
1155 * performing model, likely due to better cache locality
1156 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001157 */
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001158 ring = &accept_queue_rings[base + t];
Willy Tarreau83efc322020-10-14 17:37:17 +02001159 if (accept_queue_push_mp(ring, cli_conn)) {
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001160 _HA_ATOMIC_INC(&activity[base + t].accq_pushed);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001161 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001162 continue;
1163 }
1164 /* If the ring is full we do a synchronous accept on
1165 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001166 */
Willy Tarreaud0b73bc2022-06-28 08:30:43 +02001167 _HA_ATOMIC_INC(&activity[base + t].accq_full);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001168 }
1169#endif // USE_THREAD
1170
Amaury Denoyelle7f7713d2022-01-19 11:37:50 +01001171 local_accept:
Willy Tarreau4781b152021-04-06 13:53:36 +02001172 _HA_ATOMIC_INC(&l->thr_conn[tid]);
Willy Tarreau30836152023-01-12 19:10:17 +01001173 ret = l->bind_conf->accept(cli_conn);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001174 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001175 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001176 * we just have to ignore it (ret == 0) or it's a critical
1177 * error due to a resource shortage, and we must stop the
1178 * listener (ret < 0).
1179 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001180 if (ret == 0) /* successful termination */
1181 continue;
1182
Willy Tarreaubb660302014-05-07 19:47:02 +02001183 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001184 }
1185
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001186 /* increase the per-process number of cumulated sessions, this
Willy Tarreau30836152023-01-12 19:10:17 +01001187 * may only be done once l->bind_conf->accept() has accepted the
1188 * connection.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001189 */
Willy Tarreau17146802023-01-12 19:58:42 +01001190 if (!(l->bind_conf->options & BC_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001191 count = update_freq_ctr(&global.sess_per_sec, 1);
1192 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001193 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001194#ifdef USE_OPENSSL
Willy Tarreau17146802023-01-12 19:58:42 +01001195 if (!(l->bind_conf->options & BC_O_UNLIMITED) &&
Willy Tarreau11ba4042022-05-20 15:56:32 +02001196 l->bind_conf && l->bind_conf->options & BC_O_USE_SSL) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001197 count = update_freq_ctr(&global.ssl_per_sec, 1);
1198 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001199 }
1200#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001201
Willy Tarreaubdcd3252022-06-22 09:19:46 +02001202 _HA_ATOMIC_AND(&th_ctx->flags, ~TH_FL_STUCK); // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001203 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001204
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001205 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001206 if (next_conn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001207 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001208
Willy Tarreau82c97892019-02-27 19:32:32 +01001209 if (p && next_feconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001210 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001211
1212 if (next_actconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001213 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001214
Willy Tarreau758c69d2023-01-12 18:59:37 +01001215 if ((l->state == LI_FULL && (!l->bind_conf->maxconn || l->nbconn < l->bind_conf->maxconn)) ||
Willy Tarreau02757d02021-01-28 18:07:24 +01001216 (l->state == LI_LIMITED &&
Willy Tarreaucdcba112019-12-11 15:06:30 +01001217 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1218 (!tick_isset(global_listener_queue_task->expire) ||
1219 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001220 /* at least one thread has to this when quitting */
Aurelien DARRAGONf5d98932023-02-06 17:19:58 +01001221 relax_listener(l, 0, 0);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001222
Willy Tarreau02757d02021-01-28 18:07:24 +01001223 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001224 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001225
Olivier Houchard859dc802019-08-08 15:47:21 +02001226 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001227 (!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 +01001228 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001229 }
Willy Tarreau0591bf72019-12-10 12:01:21 +01001230 return;
1231
1232 transient_error:
1233 /* pause the listener for up to 100 ms */
1234 expire = tick_add(now_ms, 100);
1235
Willy Tarreau258b3512020-10-13 17:46:05 +02001236 /* This may be a shared socket that was paused by another process.
1237 * Let's put it to pause in this case.
1238 */
1239 if (l->rx.proto && l->rx.proto->rx_listening(&l->rx) == 0) {
Aurelien DARRAGON4059e092023-02-06 17:06:03 +01001240 pause_listener(l, 0, 0);
Willy Tarreau258b3512020-10-13 17:46:05 +02001241 goto end;
1242 }
1243
Willy Tarreau0591bf72019-12-10 12:01:21 +01001244 limit_global:
1245 /* (re-)queue the listener to the global queue and set it to expire no
1246 * later than <expire> ahead. The listener turns to LI_LIMITED.
1247 */
1248 limit_listener(l, &global_listener_queue);
Christopher Faulet13e86d92022-11-17 14:40:20 +01001249 HA_RWLOCK_RDLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001250 task_schedule(global_listener_queue_task, expire);
Christopher Faulet13e86d92022-11-17 14:40:20 +01001251 HA_RWLOCK_RDUNLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001252 goto end;
1253
1254 limit_proxy:
1255 /* (re-)queue the listener to the proxy's queue and set it to expire no
1256 * later than <expire> ahead. The listener turns to LI_LIMITED.
1257 */
1258 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001259 if (p->task && tick_isset(expire))
1260 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001261 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001262}
1263
Willy Tarreau05f50472017-09-15 09:19:58 +02001264/* Notify the listener that a connection initiated from it was released. This
1265 * is used to keep the connection count consistent and to possibly re-open
1266 * listening when it was limited.
1267 */
1268void listener_release(struct listener *l)
1269{
1270 struct proxy *fe = l->bind_conf->frontend;
1271
Willy Tarreau17146802023-01-12 19:58:42 +01001272 if (!(l->bind_conf->options & BC_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +02001273 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001274 if (fe)
Willy Tarreau4781b152021-04-06 13:53:36 +02001275 _HA_ATOMIC_DEC(&fe->feconn);
1276 _HA_ATOMIC_DEC(&l->nbconn);
1277 _HA_ATOMIC_DEC(&l->thr_conn[tid]);
Willy Tarreau82c97892019-02-27 19:32:32 +01001278
1279 if (l->state == LI_FULL || l->state == LI_LIMITED)
Aurelien DARRAGONf5d98932023-02-06 17:19:58 +01001280 relax_listener(l, 0, 0);
Willy Tarreau05f50472017-09-15 09:19:58 +02001281
Willy Tarreau02757d02021-01-28 18:07:24 +01001282 /* Dequeues all of the listeners waiting for a resource */
1283 dequeue_all_listeners();
1284
Aurelien DARRAGONa57786e2022-09-12 09:26:21 +02001285 if (fe && !MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001286 (!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 +01001287 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001288}
1289
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001290/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1291static int listener_queue_init()
1292{
Willy Tarreaubeeabf52021-10-01 18:23:30 +02001293 global_listener_queue_task = task_new_anywhere();
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001294 if (!global_listener_queue_task) {
1295 ha_alert("Out of memory when initializing global listener queue\n");
1296 return ERR_FATAL|ERR_ABORT;
1297 }
1298 /* very simple initialization, users will queue the task if needed */
1299 global_listener_queue_task->context = NULL; /* not even a context! */
1300 global_listener_queue_task->process = manage_global_listener_queue;
Christopher Faulet13e86d92022-11-17 14:40:20 +01001301 HA_RWLOCK_INIT(&global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001302
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001303 return 0;
1304}
1305
1306static void listener_queue_deinit()
1307{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001308 task_destroy(global_listener_queue_task);
1309 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001310}
1311
1312REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1313REGISTER_POST_DEINIT(listener_queue_deinit);
1314
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001315
1316/* This is the global management task for listeners. It enables listeners waiting
1317 * for global resources when there are enough free resource, or at least once in
Willy Tarreaud597ec22021-01-29 14:29:06 +01001318 * a while. It is designed to be called as a task. It's exported so that it's easy
1319 * to spot in "show tasks" or "show profiling".
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001320 */
Willy Tarreau144f84a2021-03-02 16:09:26 +01001321struct task *manage_global_listener_queue(struct task *t, void *context, unsigned int state)
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001322{
1323 /* If there are still too many concurrent connections, let's wait for
1324 * some of them to go away. We don't need to re-arm the timer because
1325 * each of them will scan the queue anyway.
1326 */
1327 if (unlikely(actconn >= global.maxconn))
1328 goto out;
1329
1330 /* We should periodically try to enable listeners waiting for a global
1331 * resource here, because it is possible, though very unlikely, that
1332 * they have been blocked by a temporary lack of global resource such
1333 * as a file descriptor or memory and that the temporary condition has
1334 * disappeared.
1335 */
1336 dequeue_all_listeners();
1337
1338 out:
Christopher Faulet13e86d92022-11-17 14:40:20 +01001339 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001340 t->expire = TICK_ETERNITY;
Christopher Faulet13e86d92022-11-17 14:40:20 +01001341 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001342 return t;
1343}
1344
Willy Tarreau26982662012-09-12 23:17:10 +02001345/*
1346 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1347 * parsing sessions.
1348 */
1349void bind_register_keywords(struct bind_kw_list *kwl)
1350{
Willy Tarreau2b718102021-04-21 07:32:39 +02001351 LIST_APPEND(&bind_keywords.list, &kwl->list);
Willy Tarreau26982662012-09-12 23:17:10 +02001352}
1353
1354/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1355 * keyword is found with a NULL ->parse() function, then an attempt is made to
1356 * find one with a valid ->parse() function. This way it is possible to declare
1357 * platform-dependant, known keywords as NULL, then only declare them as valid
1358 * if some options are met. Note that if the requested keyword contains an
1359 * opening parenthesis, everything from this point is ignored.
1360 */
1361struct bind_kw *bind_find_kw(const char *kw)
1362{
1363 int index;
1364 const char *kwend;
1365 struct bind_kw_list *kwl;
1366 struct bind_kw *ret = NULL;
1367
1368 kwend = strchr(kw, '(');
1369 if (!kwend)
1370 kwend = kw + strlen(kw);
1371
1372 list_for_each_entry(kwl, &bind_keywords.list, list) {
1373 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1374 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1375 kwl->kw[index].kw[kwend-kw] == 0) {
1376 if (kwl->kw[index].parse)
1377 return &kwl->kw[index]; /* found it !*/
1378 else
1379 ret = &kwl->kw[index]; /* may be OK */
1380 }
1381 }
1382 }
1383 return ret;
1384}
1385
Willy Tarreau8638f482012-09-18 18:01:17 +02001386/* Dumps all registered "bind" keywords to the <out> string pointer. The
1387 * unsupported keywords are only dumped if their supported form was not
1388 * found.
1389 */
1390void bind_dump_kws(char **out)
1391{
1392 struct bind_kw_list *kwl;
1393 int index;
1394
Christopher Faulet784063e2020-05-18 12:14:18 +02001395 if (!out)
1396 return;
1397
Willy Tarreau8638f482012-09-18 18:01:17 +02001398 *out = NULL;
1399 list_for_each_entry(kwl, &bind_keywords.list, list) {
1400 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1401 if (kwl->kw[index].parse ||
1402 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001403 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1404 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001405 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001406 kwl->kw[index].skip ? " <arg>" : "",
1407 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001408 }
1409 }
1410 }
1411}
1412
Willy Tarreau433b05f2021-03-12 10:14:07 +01001413/* Try to find in srv_keyword the word that looks closest to <word> by counting
1414 * transitions between letters, digits and other characters. Will return the
1415 * best matching word if found, otherwise NULL.
1416 */
1417const char *bind_find_best_kw(const char *word)
1418{
1419 uint8_t word_sig[1024];
1420 uint8_t list_sig[1024];
1421 const struct bind_kw_list *kwl;
1422 const char *best_ptr = NULL;
1423 int dist, best_dist = INT_MAX;
1424 int index;
1425
1426 make_word_fingerprint(word_sig, word);
1427 list_for_each_entry(kwl, &bind_keywords.list, list) {
1428 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1429 make_word_fingerprint(list_sig, kwl->kw[index].kw);
1430 dist = word_fingerprint_distance(word_sig, list_sig);
1431 if (dist < best_dist) {
1432 best_dist = dist;
1433 best_ptr = kwl->kw[index].kw;
1434 }
1435 }
1436 }
1437
1438 if (best_dist > 2 * strlen(word) || (best_ptr && best_dist > 2 * strlen(best_ptr)))
1439 best_ptr = NULL;
1440
1441 return best_ptr;
1442}
1443
Willy Tarreaudbf78022021-10-06 09:05:08 +02001444/* allocate an bind_conf struct for a bind line, and chain it to the frontend <fe>.
1445 * If <arg> is not NULL, it is duplicated into ->arg to store useful config
1446 * information for error reporting. NULL is returned on error.
1447 */
1448struct bind_conf *bind_conf_alloc(struct proxy *fe, const char *file,
1449 int line, const char *arg, struct xprt_ops *xprt)
1450{
1451 struct bind_conf *bind_conf = calloc(1, sizeof(*bind_conf));
1452
1453 if (!bind_conf)
1454 goto err;
1455
1456 bind_conf->file = strdup(file);
1457 if (!bind_conf->file)
1458 goto err;
1459 bind_conf->line = line;
1460 if (arg) {
1461 bind_conf->arg = strdup(arg);
1462 if (!bind_conf->arg)
1463 goto err;
1464 }
1465
1466 LIST_APPEND(&fe->conf.bind, &bind_conf->by_fe);
1467 bind_conf->settings.ux.uid = -1;
1468 bind_conf->settings.ux.gid = -1;
1469 bind_conf->settings.ux.mode = 0;
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001470 bind_conf->settings.shards = 1;
Willy Tarreaudbf78022021-10-06 09:05:08 +02001471 bind_conf->xprt = xprt;
1472 bind_conf->frontend = fe;
Willy Tarreau7866e8e2023-01-12 18:39:42 +01001473 bind_conf->analysers = fe->fe_req_ana;
Willy Tarreaudbf78022021-10-06 09:05:08 +02001474 bind_conf->severity_output = CLI_SEVERITY_NONE;
1475#ifdef USE_OPENSSL
1476 HA_RWLOCK_INIT(&bind_conf->sni_lock);
1477 bind_conf->sni_ctx = EB_ROOT;
1478 bind_conf->sni_w_ctx = EB_ROOT;
1479#endif
1480 LIST_INIT(&bind_conf->listeners);
1481 return bind_conf;
1482
1483 err:
1484 if (bind_conf) {
1485 ha_free(&bind_conf->file);
1486 ha_free(&bind_conf->arg);
1487 }
1488 ha_free(&bind_conf);
1489 return NULL;
1490}
1491
1492const char *listener_state_str(const struct listener *l)
1493{
1494 static const char *states[8] = {
1495 "NEW", "INI", "ASS", "PAU", "LIS", "RDY", "FUL", "LIM",
1496 };
1497 unsigned int st = l->state;
1498
1499 if (st >= sizeof(states) / sizeof(*states))
1500 return "INVALID";
1501 return states[st];
1502}
1503
Willy Tarreau645513a2010-05-24 20:55:15 +02001504/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001505/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001506/************************************************************************/
1507
Willy Tarreaua5e37562011-12-16 17:06:15 +01001508/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001509static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001510smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001511{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001512 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001513 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001514 return 1;
1515}
1516
Willy Tarreaua5e37562011-12-16 17:06:15 +01001517/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001518static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001519smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001520{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001521 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001522 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001523 return 1;
1524}
Jerome Magnineb421b22020-03-27 22:08:40 +01001525static int
1526smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1527{
1528 smp->data.u.str.area = smp->sess->listener->name;
1529 if (!smp->data.u.str.area)
1530 return 0;
1531
1532 smp->data.type = SMP_T_STR;
1533 smp->flags = SMP_F_CONST;
1534 smp->data.u.str.data = strlen(smp->data.u.str.area);
1535 return 1;
1536}
Willy Tarreau645513a2010-05-24 20:55:15 +02001537
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001538/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001539static 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 +02001540{
Willy Tarreauf1b47302023-01-12 19:48:50 +01001541 conf->options |= BC_O_ACC_PROXY;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001542 return 0;
1543}
1544
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001545/* parse the "accept-netscaler-cip" bind keyword */
1546static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1547{
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001548 uint32_t val;
1549
1550 if (!*args[cur_arg + 1]) {
1551 memprintf(err, "'%s' : missing value", args[cur_arg]);
1552 return ERR_ALERT | ERR_FATAL;
1553 }
1554
1555 val = atol(args[cur_arg + 1]);
1556 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001557 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001558 return ERR_ALERT | ERR_FATAL;
1559 }
1560
Willy Tarreauf1b47302023-01-12 19:48:50 +01001561 conf->options |= BC_O_ACC_CIP;
1562 conf->ns_cip_magic = val;
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001563 return 0;
1564}
1565
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001566/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001567static 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 +02001568{
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001569 int val;
1570
1571 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001572 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001573 return ERR_ALERT | ERR_FATAL;
1574 }
1575
1576 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001577 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001578 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001579 return ERR_ALERT | ERR_FATAL;
1580 }
1581
Willy Tarreau1920f892023-01-12 18:55:13 +01001582 conf->backlog = val;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001583 return 0;
1584}
1585
1586/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001587static 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 +02001588{
1589 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001590 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001591 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001592
Willy Tarreau4348fad2012-09-20 16:48:07 +02001593 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001594 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001595 return ERR_ALERT | ERR_FATAL;
1596 }
1597
1598 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001599 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001600 return ERR_ALERT | ERR_FATAL;
1601 }
1602
Willy Tarreau4348fad2012-09-20 16:48:07 +02001603 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001604 new->luid = strtol(args[cur_arg + 1], &error, 10);
1605 if (*error != '\0') {
1606 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1607 return ERR_ALERT | ERR_FATAL;
1608 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001609 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001610
Willy Tarreau4348fad2012-09-20 16:48:07 +02001611 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001612 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001613 return ERR_ALERT | ERR_FATAL;
1614 }
1615
Willy Tarreau4348fad2012-09-20 16:48:07 +02001616 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001617 if (node) {
1618 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001619 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1620 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1621 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001622 return ERR_ALERT | ERR_FATAL;
1623 }
1624
Willy Tarreau4348fad2012-09-20 16:48:07 +02001625 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001626 return 0;
1627}
1628
Willy Tarreau3882d2a2022-05-20 15:41:45 +02001629/* Complete a bind_conf by parsing the args after the address. <args> is the
1630 * arguments array, <cur_arg> is the first one to be considered. <section> is
1631 * the section name to report in error messages, and <file> and <linenum> are
1632 * the file name and line number respectively. Note that args[0..1] are used
1633 * in error messages to provide some context. The return value is an error
1634 * code, zero on success or an OR of ERR_{FATAL,ABORT,ALERT,WARN}.
1635 */
1636int bind_parse_args_list(struct bind_conf *bind_conf, char **args, int cur_arg, const char *section, const char *file, int linenum)
1637{
1638 int err_code = 0;
1639
1640 while (*(args[cur_arg])) {
1641 struct bind_kw *kw;
1642 const char *best;
1643
1644 kw = bind_find_kw(args[cur_arg]);
1645 if (kw) {
1646 char *err = NULL;
1647 int code;
1648
1649 if (!kw->parse) {
1650 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : '%s' option is not implemented in this version (check build options).\n",
1651 file, linenum, args[0], args[1], section, args[cur_arg]);
1652 cur_arg += 1 + kw->skip ;
1653 err_code |= ERR_ALERT | ERR_FATAL;
1654 goto out;
1655 }
1656
1657 code = kw->parse(args, cur_arg, bind_conf->frontend, bind_conf, &err);
1658 err_code |= code;
1659
1660 if (code) {
1661 if (err && *err) {
1662 indent_msg(&err, 2);
1663 if (((code & (ERR_WARN|ERR_ALERT)) == ERR_WARN))
1664 ha_warning("parsing [%s:%d] : '%s %s' in section '%s' : %s\n", file, linenum, args[0], args[1], section, err);
1665 else
1666 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : %s\n", file, linenum, args[0], args[1], section, err);
1667 }
1668 else
1669 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : error encountered while processing '%s'.\n",
1670 file, linenum, args[0], args[1], section, args[cur_arg]);
1671 if (code & ERR_FATAL) {
1672 free(err);
1673 cur_arg += 1 + kw->skip;
1674 goto out;
1675 }
1676 }
1677 free(err);
1678 cur_arg += 1 + kw->skip;
1679 continue;
1680 }
1681
1682 best = bind_find_best_kw(args[cur_arg]);
1683 if (best)
1684 ha_alert("parsing [%s:%d] : '%s %s' in section '%s': unknown keyword '%s'; did you mean '%s' maybe ?\n",
1685 file, linenum, args[0], args[1], section, args[cur_arg], best);
1686 else
1687 ha_alert("parsing [%s:%d] : '%s %s' in section '%s': unknown keyword '%s'.\n",
1688 file, linenum, args[0], args[1], section, args[cur_arg]);
1689
1690 err_code |= ERR_ALERT | ERR_FATAL;
1691 goto out;
1692 }
Willy Tarreau64306cc2022-05-20 16:20:52 +02001693
1694 if ((bind_conf->options & (BC_O_USE_SOCK_DGRAM|BC_O_USE_SOCK_STREAM)) == (BC_O_USE_SOCK_DGRAM|BC_O_USE_SOCK_STREAM) ||
1695 (bind_conf->options & (BC_O_USE_XPRT_DGRAM|BC_O_USE_XPRT_STREAM)) == (BC_O_USE_XPRT_DGRAM|BC_O_USE_XPRT_STREAM)) {
1696 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : cannot mix datagram and stream protocols.\n",
1697 file, linenum, args[0], args[1], section);
1698 err_code |= ERR_ALERT | ERR_FATAL;
1699 goto out;
1700 }
1701
Willy Tarreau78d0dcd2022-05-20 17:10:00 +02001702 /* The transport layer automatically switches to QUIC when QUIC is
1703 * selected, regardless of bind_conf settings. We then need to
1704 * initialize QUIC params.
1705 */
1706 if ((bind_conf->options & (BC_O_USE_SOCK_DGRAM|BC_O_USE_XPRT_STREAM)) == (BC_O_USE_SOCK_DGRAM|BC_O_USE_XPRT_STREAM)) {
1707#ifdef USE_QUIC
1708 bind_conf->xprt = xprt_get(XPRT_QUIC);
Willy Tarreau287f32f2022-05-20 18:16:52 +02001709 if (!(bind_conf->options & BC_O_USE_SSL)) {
1710 bind_conf->options |= BC_O_USE_SSL;
1711 ha_warning("parsing [%s:%d] : '%s %s' in section '%s' : QUIC protocol detected, enabling ssl. Use 'ssl' to shut this warning.\n",
1712 file, linenum, args[0], args[1], section);
1713 }
Willy Tarreau78d0dcd2022-05-20 17:10:00 +02001714 quic_transport_params_init(&bind_conf->quic_params, 1);
1715#else
1716 ha_alert("parsing [%s:%d] : '%s %s' in section '%s' : QUIC protocol selected but support not compiled in (check build options).\n",
1717 file, linenum, args[0], args[1], section);
1718 err_code |= ERR_ALERT | ERR_FATAL;
1719 goto out;
1720#endif
1721 }
Willy Tarreau2071a992022-05-20 17:14:31 +02001722 else if (bind_conf->options & BC_O_USE_SSL) {
1723 bind_conf->xprt = xprt_get(XPRT_SSL);
1724 }
Willy Tarreau78d0dcd2022-05-20 17:10:00 +02001725
Willy Tarreau3882d2a2022-05-20 15:41:45 +02001726 out:
1727 return err_code;
1728}
1729
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001730/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001731static 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 +02001732{
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001733 int val;
1734
1735 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001736 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001737 return ERR_ALERT | ERR_FATAL;
1738 }
1739
1740 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001741 if (val < 0) {
1742 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001743 return ERR_ALERT | ERR_FATAL;
1744 }
1745
Willy Tarreau758c69d2023-01-12 18:59:37 +01001746 conf->maxconn = val;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001747 return 0;
1748}
1749
1750/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001751static 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 +02001752{
1753 struct listener *l;
1754
1755 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001756 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001757 return ERR_ALERT | ERR_FATAL;
1758 }
1759
Willy Tarreau4348fad2012-09-20 16:48:07 +02001760 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001761 l->name = strdup(args[cur_arg + 1]);
1762
1763 return 0;
1764}
1765
1766/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001767static 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 +02001768{
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001769 int val;
1770
1771 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001772 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001773 return ERR_ALERT | ERR_FATAL;
1774 }
1775
1776 val = atol(args[cur_arg + 1]);
1777 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001778 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001779 return ERR_ALERT | ERR_FATAL;
1780 }
1781
Willy Tarreau7dbd4182023-01-12 19:32:45 +01001782 conf->nice = val;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001783 return 0;
1784}
1785
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001786/* parse the "process" bind keyword */
1787static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1788{
Willy Tarreauacd64412022-07-15 17:16:01 +02001789 memprintf(err, "'process %s' on 'bind' lines is not supported anymore, please use 'thread' instead.", args[cur_arg+1]);
1790 return ERR_ALERT | ERR_FATAL;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001791}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001792
Christopher Fauleta717b992018-04-10 14:43:00 +02001793/* parse the "proto" bind keyword */
1794static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1795{
1796 struct ist proto;
1797
1798 if (!*args[cur_arg + 1]) {
1799 memprintf(err, "'%s' : missing value", args[cur_arg]);
1800 return ERR_ALERT | ERR_FATAL;
1801 }
1802
Tim Duesterhusdcf753a2021-03-04 17:31:47 +01001803 proto = ist(args[cur_arg + 1]);
Christopher Fauleta717b992018-04-10 14:43:00 +02001804 conf->mux_proto = get_mux_proto(proto);
1805 if (!conf->mux_proto) {
1806 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1807 return ERR_ALERT | ERR_FATAL;
1808 }
Willy Tarreauc8cac042021-09-21 14:31:29 +02001809 return 0;
1810}
1811
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001812/* parse the "shards" bind keyword. Takes an integer or "by-thread" */
1813static int bind_parse_shards(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1814{
1815 int val;
1816
1817 if (!*args[cur_arg + 1]) {
1818 memprintf(err, "'%s' : missing value", args[cur_arg]);
1819 return ERR_ALERT | ERR_FATAL;
1820 }
1821
1822 if (strcmp(args[cur_arg + 1], "by-thread") == 0) {
1823 val = MAX_THREADS; /* will be trimmed later anyway */
1824 } else {
1825 val = atol(args[cur_arg + 1]);
1826 if (val < 1 || val > MAX_THREADS) {
1827 memprintf(err, "'%s' : invalid value %d, allowed range is %d..%d or 'by-thread'", args[cur_arg], val, 1, MAX_THREADS);
1828 return ERR_ALERT | ERR_FATAL;
1829 }
1830 }
1831
1832 conf->settings.shards = val;
1833 return 0;
1834}
1835
Willy Tarreauf0de8ca2023-01-31 19:31:27 +01001836/* parse the "thread" bind keyword. This will replace any preset thread_set */
Willy Tarreauc8cac042021-09-21 14:31:29 +02001837static int bind_parse_thread(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1838{
Willy Tarreauf0de8ca2023-01-31 19:31:27 +01001839 /* note that the thread set is zeroed before first call, and we don't
1840 * want to reset it so that it remains possible to chain multiple
1841 * "thread" directives.
1842 */
1843 if (parse_thread_set(args[cur_arg+1], &conf->thread_set, err) < 0)
Willy Tarreauc8cac042021-09-21 14:31:29 +02001844 return ERR_ALERT | ERR_FATAL;
Christopher Fauleta717b992018-04-10 14:43:00 +02001845 return 0;
1846}
1847
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001848/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1849static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
Willy Tarreau01825162021-03-09 09:53:46 +01001850 const struct proxy *defpx, const char *file, int line,
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001851 char **err)
1852{
1853 if (too_many_args(1, args, err, NULL))
1854 return -1;
1855
1856 if (strcmp(args[1], "on") == 0)
1857 global.tune.options |= GTUNE_LISTENER_MQ;
1858 else if (strcmp(args[1], "off") == 0)
1859 global.tune.options &= ~GTUNE_LISTENER_MQ;
1860 else {
1861 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1862 return -1;
1863 }
1864 return 0;
1865}
1866
Willy Tarreau61612d42012-04-19 18:42:05 +02001867/* Note: must not be declared <const> as its list will be overwritten.
1868 * Please take care of keeping this list alphabetically sorted.
1869 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001870static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001871 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1872 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001873 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001874 { /* END */ },
1875}};
1876
Willy Tarreau0108d902018-11-25 19:14:37 +01001877INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1878
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001879/* Note: must not be declared <const> as its list will be overwritten.
1880 * Please take care of keeping this list alphabetically sorted.
1881 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001882static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001883 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001884}};
1885
Willy Tarreau0108d902018-11-25 19:14:37 +01001886INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1887
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001888/* Note: must not be declared <const> as its list will be overwritten.
1889 * Please take care of keeping this list alphabetically sorted, doing so helps
1890 * all code contributors.
1891 * Optional keywords are also declared with a NULL ->parse() function so that
1892 * the config parser can report an appropriate error when a known keyword was
1893 * not enabled.
1894 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001895static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001896 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001897 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1898 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1899 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1900 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1901 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1902 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001903 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001904 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001905 { "shards", bind_parse_shards, 1 }, /* set number of shards */
Willy Tarreauc8cac042021-09-21 14:31:29 +02001906 { "thread", bind_parse_thread, 1 }, /* set list of allowed threads for this socket */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001907 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001908}};
1909
Willy Tarreau0108d902018-11-25 19:14:37 +01001910INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1911
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001912/* config keyword parsers */
1913static struct cfg_kw_list cfg_kws = {ILH, {
1914 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1915 { 0, NULL, NULL }
1916}};
1917
1918INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1919
Willy Tarreau645513a2010-05-24 20:55:15 +02001920/*
1921 * Local variables:
1922 * c-indent-level: 8
1923 * c-basic-offset: 8
1924 * End:
1925 */