blob: 4a38ab5d90c718bbd772e901af035b171bc94942 [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>
18#include <fcntl.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020019
Willy Tarreaudcc048a2020-06-04 19:11:43 +020020#include <haproxy/acl.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020021#include <haproxy/api.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020022#include <haproxy/cfgparse.h>
Willy Tarreau7ea393d2020-06-04 18:02:10 +020023#include <haproxy/connection.h>
Willy Tarreau8d366972020-05-27 16:10:29 +020024#include <haproxy/errors.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020025#include <haproxy/fd.h>
26#include <haproxy/freq_ctr.h>
Willy Tarreauf268ee82020-06-04 17:05:57 +020027#include <haproxy/global.h>
Willy Tarreau853b2972020-05-27 18:01:47 +020028#include <haproxy/list.h>
Willy Tarreau213e9902020-06-04 14:58:24 +020029#include <haproxy/listener.h>
Willy Tarreauaeed4a82020-06-04 22:01:04 +020030#include <haproxy/log.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020031#include <haproxy/protocol.h>
Willy Tarreau5958c432021-05-08 20:30:37 +020032#include <haproxy/proxy.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020033#include <haproxy/sample.h>
Willy Tarreaudfd3de82020-06-04 23:46:14 +020034#include <haproxy/stream.h>
Willy Tarreaucea0e1b2020-06-04 17:25:40 +020035#include <haproxy/task.h>
Willy Tarreau92b4f132020-06-01 11:05:15 +020036#include <haproxy/time.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020037#include <haproxy/tools.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020038
Willy Tarreaub648d632007-10-28 22:13:50 +010039
Willy Tarreau26982662012-09-12 23:17:10 +020040/* List head of all known bind keywords */
41static struct bind_kw_list bind_keywords = {
42 .list = LIST_HEAD_INIT(bind_keywords.list)
43};
44
Willy Tarreaua1d97f82019-12-10 11:18:41 +010045/* list of the temporarily limited listeners because of lack of resource */
46static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
47static struct task *global_listener_queue_task;
Willy Tarreau49a2f602022-11-22 09:08:23 +010048__decl_thread(static HA_RWLOCK_T global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +010049
William Dauchy3679d0c2021-02-14 23:22:55 +010050/* listener status for stats */
51const char* li_status_st[LI_STATE_COUNT] = {
52 [LI_STATUS_WAITING] = "WAITING",
53 [LI_STATUS_OPEN] = "OPEN",
54 [LI_STATUS_FULL] = "FULL",
55};
Willy Tarreaua1d97f82019-12-10 11:18:41 +010056
Willy Tarreau1efafce2019-01-27 15:37:19 +010057#if defined(USE_THREAD)
58
59struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
60
61/* dequeue and process a pending connection from the local accept queue (single
Willy Tarreau83efc322020-10-14 17:37:17 +020062 * consumer). Returns the accepted connection or NULL if none was found.
Willy Tarreau1efafce2019-01-27 15:37:19 +010063 */
Willy Tarreau83efc322020-10-14 17:37:17 +020064struct connection *accept_queue_pop_sc(struct accept_queue_ring *ring)
Willy Tarreau1efafce2019-01-27 15:37:19 +010065{
Willy Tarreau1efafce2019-01-27 15:37:19 +010066 unsigned int pos, next;
Willy Tarreau83efc322020-10-14 17:37:17 +020067 struct connection *ptr;
68 struct connection **e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010069
70 pos = ring->head;
71
72 if (pos == ring->tail)
Willy Tarreau83efc322020-10-14 17:37:17 +020073 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010074
75 next = pos + 1;
76 if (next >= ACCEPT_QUEUE_SIZE)
77 next = 0;
78
79 e = &ring->entry[pos];
80
81 /* wait for the producer to update the listener's pointer */
82 while (1) {
Willy Tarreau83efc322020-10-14 17:37:17 +020083 ptr = *e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010084 __ha_barrier_load();
85 if (ptr)
86 break;
87 pl_cpu_relax();
88 }
89
Willy Tarreau1efafce2019-01-27 15:37:19 +010090 /* release the entry */
Willy Tarreau83efc322020-10-14 17:37:17 +020091 *e = NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010092
93 __ha_barrier_store();
94 ring->head = next;
Willy Tarreau83efc322020-10-14 17:37:17 +020095 return ptr;
Willy Tarreau1efafce2019-01-27 15:37:19 +010096}
97
98
Willy Tarreau83efc322020-10-14 17:37:17 +020099/* tries to push a new accepted connection <conn> into ring <ring>. Returns
100 * non-zero if it succeeds, or zero if the ring is full. Supports multiple
101 * producers.
Willy Tarreau1efafce2019-01-27 15:37:19 +0100102 */
Willy Tarreau83efc322020-10-14 17:37:17 +0200103int accept_queue_push_mp(struct accept_queue_ring *ring, struct connection *conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100104{
Willy Tarreau1efafce2019-01-27 15:37:19 +0100105 unsigned int pos, next;
106
107 pos = ring->tail;
108 do {
109 next = pos + 1;
110 if (next >= ACCEPT_QUEUE_SIZE)
111 next = 0;
112 if (next == ring->head)
113 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100114 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100115
Willy Tarreau83efc322020-10-14 17:37:17 +0200116 ring->entry[pos] = conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100117 __ha_barrier_store();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100118 return 1;
119}
120
Willy Tarreaufb5401f2021-01-29 12:25:23 +0100121/* proceed with accepting new connections. Don't mark it static so that it appears
122 * in task dumps.
123 */
Willy Tarreau144f84a2021-03-02 16:09:26 +0100124struct task *accept_queue_process(struct task *t, void *context, unsigned int state)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100125{
126 struct accept_queue_ring *ring = context;
Willy Tarreau83efc322020-10-14 17:37:17 +0200127 struct connection *conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100128 struct listener *li;
Christopher Faulet102854c2019-04-30 12:17:13 +0200129 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100130 int ret;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100131
Christopher Faulet102854c2019-04-30 12:17:13 +0200132 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
133 * is not really illimited, but it is probably enough.
134 */
Willy Tarreau66161322021-02-19 15:50:27 +0100135 max_accept = global.tune.maxaccept ? global.tune.maxaccept : MAX_ACCEPT;
Christopher Faulet102854c2019-04-30 12:17:13 +0200136 for (; max_accept; max_accept--) {
Willy Tarreau83efc322020-10-14 17:37:17 +0200137 conn = accept_queue_pop_sc(ring);
138 if (!conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100139 break;
140
Willy Tarreau83efc322020-10-14 17:37:17 +0200141 li = __objt_listener(conn->target);
Willy Tarreau4781b152021-04-06 13:53:36 +0200142 _HA_ATOMIC_INC(&li->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +0200143 ret = li->accept(conn);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100144 if (ret <= 0) {
145 /* connection was terminated by the application */
146 continue;
147 }
148
149 /* increase the per-process number of cumulated sessions, this
150 * may only be done once l->accept() has accepted the connection.
151 */
152 if (!(li->options & LI_O_UNLIMITED)) {
153 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
154 update_freq_ctr(&global.sess_per_sec, 1));
155 if (li->bind_conf && li->bind_conf->is_ssl) {
156 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
157 update_freq_ctr(&global.ssl_per_sec, 1));
158 }
159 }
160 }
161
162 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200163 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200164 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100165
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200166 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100167}
168
169/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
170static int accept_queue_init()
171{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200172 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100173 int i;
174
175 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200176 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100177 if (!t) {
178 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
179 return ERR_FATAL|ERR_ABORT;
180 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200181 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100182 t->process = accept_queue_process;
183 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200184 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100185 }
186 return 0;
187}
188
189REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
190
191#endif // USE_THREAD
192
William Dauchy3679d0c2021-02-14 23:22:55 +0100193/* helper to get listener status for stats */
194enum li_status get_li_status(struct listener *l)
195{
196 if (!l->maxconn || l->nbconn < l->maxconn) {
197 if (l->state == LI_LIMITED)
198 return LI_STATUS_WAITING;
199 else
200 return LI_STATUS_OPEN;
201 }
202 return LI_STATUS_FULL;
203}
204
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200205/* adjust the listener's state and its proxy's listener counters if needed.
206 * It must be called under the listener's lock, but uses atomic ops to change
207 * the proxy's counters so that the proxy lock is not needed.
208 */
Willy Tarreaua37b2442020-09-24 07:23:45 +0200209void listener_set_state(struct listener *l, enum li_state st)
210{
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200211 struct proxy *px = l->bind_conf->frontend;
212
213 if (px) {
214 /* from state */
215 switch (l->state) {
216 case LI_NEW: /* first call */
Willy Tarreau4781b152021-04-06 13:53:36 +0200217 _HA_ATOMIC_INC(&px->li_all);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200218 break;
219 case LI_INIT:
220 case LI_ASSIGNED:
221 break;
222 case LI_PAUSED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200223 _HA_ATOMIC_DEC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200224 break;
225 case LI_LISTEN:
Willy Tarreau4781b152021-04-06 13:53:36 +0200226 _HA_ATOMIC_DEC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200227 break;
228 case LI_READY:
229 case LI_FULL:
230 case LI_LIMITED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200231 _HA_ATOMIC_DEC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200232 break;
233 }
234
235 /* to state */
236 switch (st) {
237 case LI_NEW:
238 case LI_INIT:
239 case LI_ASSIGNED:
240 break;
241 case LI_PAUSED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200242 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200243 _HA_ATOMIC_INC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200244 break;
245 case LI_LISTEN:
Willy Tarreau95a34602020-10-08 15:32:21 +0200246 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200247 _HA_ATOMIC_INC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200248 break;
249 case LI_READY:
250 case LI_FULL:
251 case LI_LIMITED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200252 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200253 _HA_ATOMIC_INC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200254 break;
255 }
256 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200257 l->state = st;
258}
259
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100260/* This function adds the specified listener's file descriptor to the polling
261 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500262 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200263 * also support binding only the relevant processes to their respective
264 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100265 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200266void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100267{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100268 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200269
270 /* If this listener is supposed to be only in the master, close it in
271 * the workers. Conversely, if it's supposed to be only in the workers
272 * close it in the master.
273 */
Willy Tarreau18c20d22020-10-09 16:11:46 +0200274 if (!!master != !!(listener->rx.flags & RX_F_MWORKER))
Willy Tarreau75c98d12020-10-09 15:55:23 +0200275 do_unbind_listener(listener);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200276
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100277 if (listener->state == LI_LISTEN) {
Willy Tarreau95a34602020-10-08 15:32:21 +0200278 BUG_ON(listener->rx.fd == -1);
William Lallemand095ba4c2017-06-01 17:38:50 +0200279 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau38dba272020-11-04 13:54:00 +0100280 (!!master != !!(listener->rx.flags & RX_F_MWORKER) ||
281 !(proc_mask(listener->rx.settings->bind_proc) & pid_bit))) {
Willy Tarreauae302532014-05-07 19:22:24 +0200282 /* we don't want to enable this listener and don't
283 * want any fd event to reach it.
284 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200285 do_unbind_listener(listener);
Willy Tarreauae302532014-05-07 19:22:24 +0200286 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100287 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200288 listener->rx.proto->enable(listener);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200289 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200290 }
291 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200292 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100293 }
294 }
Willy Tarreaud6afb532020-10-09 10:35:40 +0200295
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100296 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100297}
298
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200299/*
300 * This function completely stops a listener. It will need to operate under the
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200301 * It will need to operate under the proxy's lock and the protocol's lock.
302 * The caller is responsible for indicating in lpx, lpr whether the
303 * respective locks are already held (non-zero) or not (zero) so that the
304 * function picks the missing ones, in this order.
305 * The proxy's listeners count is updated and the proxy is
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200306 * disabled and woken up after the last one is gone.
307 */
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200308void stop_listener(struct listener *l, int lpx, int lpr)
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200309{
310 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200311
312 if (l->options & LI_O_NOSTOP) {
313 /* master-worker sockpairs are never closed but don't count as a
314 * job.
315 */
316 return;
317 }
318
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200319 if (!lpx)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200320 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200321
322 if (!lpr)
323 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
324
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200325 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200326
327 if (l->state > LI_INIT) {
Willy Tarreau75c98d12020-10-09 15:55:23 +0200328 do_unbind_listener(l);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200329
330 if (l->state >= LI_ASSIGNED)
331 __delete_listener(l);
332
Willy Tarreauacde1522020-10-07 16:31:39 +0200333 proxy_cond_disable(px);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200334 }
335
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200336 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200337
338 if (!lpr)
339 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
340
341 if (!lpx)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200342 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200343}
344
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100345/* This function adds the specified <listener> to the protocol <proto>. It
346 * does nothing if the protocol was already added. The listener's state is
347 * automatically updated from LI_INIT to LI_ASSIGNED. The number of listeners
348 * for the protocol is updated. This must be called with the proto lock held.
349 */
350void default_add_listener(struct protocol *proto, struct listener *listener)
351{
352 if (listener->state != LI_INIT)
353 return;
354 listener_set_state(listener, LI_ASSIGNED);
355 listener->rx.proto = proto;
Willy Tarreau2b718102021-04-21 07:32:39 +0200356 LIST_APPEND(&proto->receivers, &listener->rx.proto_list);
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100357 proto->nb_receivers++;
358}
359
Willy Tarreaue03204c2020-10-09 17:02:21 +0200360/* default function called to suspend a listener: it simply passes the call to
361 * the underlying receiver. This is find for most socket-based protocols. This
362 * must be called under the listener's lock. It will return non-zero on success,
363 * 0 on failure. If no receiver-level suspend is provided, the operation is
364 * assumed to succeed.
365 */
366int default_suspend_listener(struct listener *l)
367{
368 int ret = 1;
369
370 if (!l->rx.proto->rx_suspend)
371 return 1;
372
373 ret = l->rx.proto->rx_suspend(&l->rx);
374 return ret > 0 ? ret : 0;
375}
376
377
378/* Tries to resume a suspended listener, and returns non-zero on success or
379 * zero on failure. On certain errors, an alert or a warning might be displayed.
380 * It must be called with the listener's lock held. Depending on the listener's
381 * state and protocol, a listen() call might be used to resume operations, or a
382 * call to the receiver's resume() function might be used as well. This is
383 * suitable as a default function for TCP and UDP. This must be called with the
384 * listener's lock held.
385 */
386int default_resume_listener(struct listener *l)
387{
388 int ret = 1;
389
390 if (l->state == LI_ASSIGNED) {
391 char msg[100];
392 int err;
393
394 err = l->rx.proto->listen(l, msg, sizeof(msg));
395 if (err & ERR_ALERT)
396 ha_alert("Resuming listener: %s\n", msg);
397 else if (err & ERR_WARN)
398 ha_warning("Resuming listener: %s\n", msg);
399
400 if (err & (ERR_FATAL | ERR_ABORT)) {
401 ret = 0;
402 goto end;
403 }
404 }
405
406 if (l->state < LI_PAUSED) {
407 ret = 0;
408 goto end;
409 }
410
411 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
412 l->rx.proto->rx_resume(&l->rx) <= 0)
413 ret = 0;
414 end:
415 return ret;
416}
417
418
Willy Tarreaube58c382011-07-24 18:28:10 +0200419/* This function tries to temporarily disable a listener, depending on the OS
420 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
421 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
422 * closes upon SHUT_WR and refuses to rebind. So a common validation path
423 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
424 * is disabled. It normally returns non-zero, unless an error is reported.
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200425 * It will need to operate under the proxy's lock. The caller is
426 * responsible for indicating in lpx whether the proxy locks is
427 * already held (non-zero) or not (zero) so that the function picks it.
Willy Tarreaube58c382011-07-24 18:28:10 +0200428 */
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200429int pause_listener(struct listener *l, int lpx)
Willy Tarreaube58c382011-07-24 18:28:10 +0200430{
Willy Tarreau58651b42020-09-24 16:03:29 +0200431 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200432 int ret = 1;
433
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200434 if (!lpx)
435 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
436
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100437 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200438
Willy Tarreau02e19752020-09-23 17:17:22 +0200439 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
440 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
441 goto end;
442
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200443 if (l->state <= LI_PAUSED)
444 goto end;
445
Willy Tarreaue03204c2020-10-09 17:02:21 +0200446 if (l->rx.proto->suspend)
447 ret = l->rx.proto->suspend(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200448
Willy Tarreau2b718102021-04-21 07:32:39 +0200449 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200450
Willy Tarreaua37b2442020-09-24 07:23:45 +0200451 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200452
453 if (px && !px->li_ready) {
454 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
455 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
456 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200457 end:
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100458 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200459
460 if (!lpx)
461 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
462
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200463 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200464}
465
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200466/* This function tries to resume a temporarily disabled listener. Paused, full,
467 * limited and disabled listeners are handled, which means that this function
468 * may replace enable_listener(). The resulting state will either be LI_READY
469 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200470 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200471 * foreground mode, and are ignored. If the listener was only in the assigned
472 * state, it's totally rebound. This can happen if a pause() has completely
473 * stopped it. If the resume fails, 0 is returned and an error might be
474 * displayed.
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200475 * It will need to operate under the proxy's lock. The caller is
476 * responsible for indicating in lpx whether the proxy locks is
477 * already held (non-zero) or not (zero) so that the function picks it.
Willy Tarreaube58c382011-07-24 18:28:10 +0200478 */
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200479int resume_listener(struct listener *l, int lpx)
Willy Tarreaube58c382011-07-24 18:28:10 +0200480{
Willy Tarreau58651b42020-09-24 16:03:29 +0200481 struct proxy *px = l->bind_conf->frontend;
482 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200483 int ret = 1;
484
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200485 if (!lpx)
486 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
487
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100488 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200489
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200490 /* check that another thread didn't to the job in parallel (e.g. at the
491 * end of listen_accept() while we'd come from dequeue_all_listeners().
492 */
Willy Tarreau2b718102021-04-21 07:32:39 +0200493 if (MT_LIST_INLIST(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200494 goto end;
495
William Lallemand095ba4c2017-06-01 17:38:50 +0200496 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200497 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200498 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100499
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200500 if (l->state == LI_READY)
501 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200502
Willy Tarreaue03204c2020-10-09 17:02:21 +0200503 if (l->rx.proto->resume)
504 ret = l->rx.proto->resume(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200505
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100506 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200507 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200508 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200509 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200510 }
511
Willy Tarreau4b51f422020-09-25 20:32:28 +0200512 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200513 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200514
515 done:
516 if (was_paused && !px->li_paused) {
517 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
518 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
519 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200520 end:
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100521 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200522
523 if (!lpx)
524 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
525
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200526 return ret;
527}
528
Willy Tarreau87b09662015-04-03 00:22:06 +0200529/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200530 * it upon next close() using resume_listener().
531 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200532static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200533{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100534 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200535 if (l->state >= LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200536 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100537 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200538 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200539 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100540 }
Willy Tarreau62793712011-07-24 19:23:38 +0200541 }
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100542 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200543}
544
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200545/* Marks a ready listener as limited so that we only try to re-enable it when
546 * resources are free again. It will be queued into the specified queue.
547 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200548static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200549{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100550 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200551 if (l->state == LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200552 MT_LIST_TRY_APPEND(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200553 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200554 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200555 }
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100556 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200557}
558
Willy Tarreau241797a2019-12-10 14:10:52 +0100559/* Dequeues all listeners waiting for a resource the global wait queue */
560void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200561{
Willy Tarreau01abd022019-02-28 10:27:18 +0100562 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200563
Willy Tarreau241797a2019-12-10 14:10:52 +0100564 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200565 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100566 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200567 */
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200568 resume_listener(listener, 0);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200569 }
570}
571
Willy Tarreau241797a2019-12-10 14:10:52 +0100572/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
573void dequeue_proxy_listeners(struct proxy *px)
574{
575 struct listener *listener;
576
577 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
578 /* This cannot fail because the listeners are by definition in
579 * the LI_LIMITED state.
580 */
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200581 resume_listener(listener, 0);
Willy Tarreau241797a2019-12-10 14:10:52 +0100582 }
583}
584
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200585
586/* default function used to unbind a listener. This is for use by standard
587 * protocols working on top of accepted sockets. The receiver's rx_unbind()
588 * will automatically be used after the listener is disabled if the socket is
589 * still bound. This must be used under the listener's lock.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100590 */
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200591void default_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100592{
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200593 if (listener->state <= LI_ASSIGNED)
594 goto out_close;
595
596 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200597 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200598 goto out_close;
599 }
600
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200601 if (listener->state >= LI_READY) {
602 listener->rx.proto->disable(listener);
603 if (listener->rx.flags & RX_F_BOUND)
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200604 listener_set_state(listener, LI_LISTEN);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200605 }
606
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200607 out_close:
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200608 if (listener->rx.flags & RX_F_BOUND)
609 listener->rx.proto->rx_unbind(&listener->rx);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200610}
611
612/* This function closes the listening socket for the specified listener,
613 * provided that it's already in a listening state. The protocol's unbind()
614 * is called to put the listener into LI_ASSIGNED or LI_LISTEN and handle
615 * the unbinding tasks. The listener enters then the LI_ASSIGNED state if
616 * the receiver is unbound. Must be called with the lock held.
617 */
618void do_unbind_listener(struct listener *listener)
619{
Willy Tarreau2b718102021-04-21 07:32:39 +0200620 MT_LIST_DELETE(&listener->wait_queue);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200621
622 if (listener->rx.proto->unbind)
623 listener->rx.proto->unbind(listener);
Willy Tarreau374e9af2020-10-09 15:47:17 +0200624
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200625 /* we may have to downgrade the listener if the rx was closed */
626 if (!(listener->rx.flags & RX_F_BOUND) && listener->state > LI_ASSIGNED)
Willy Tarreau374e9af2020-10-09 15:47:17 +0200627 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100628}
629
Olivier Houchard1fc05162017-04-06 01:05:05 +0200630/* This function closes the listening socket for the specified listener,
631 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200632 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
633 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100634 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200635 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100636void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200637{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100638 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200639 do_unbind_listener(listener);
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100640 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200641}
642
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200643/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
644 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200645 * allocation). The address family is taken from ss->ss_family, and the protocol
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200646 * passed in <proto> must be usable on this family. The protocol's default iocb
647 * is automatically preset as the receivers' iocb. The number of jobs and
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200648 * listeners is automatically increased by the number of listeners created. It
649 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200650 */
651int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200652 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200653{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200654 struct listener *l;
655 int port;
656
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200657 for (port = portl; port <= porth; port++) {
658 l = calloc(1, sizeof(*l));
659 if (!l) {
660 memprintf(err, "out of memory");
661 return 0;
662 }
663 l->obj_type = OBJ_TYPE_LISTENER;
Willy Tarreau2b718102021-04-21 07:32:39 +0200664 LIST_APPEND(&bc->frontend->conf.listeners, &l->by_fe);
665 LIST_APPEND(&bc->listeners, &l->by_bind);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200666 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200667 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200668 l->rx.owner = l;
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200669 l->rx.iocb = proto->default_iocb;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200670 l->rx.fd = fd;
Willy Tarreau07400c52020-12-04 14:49:11 +0100671
Willy Tarreau37159062020-08-27 07:48:42 +0200672 memcpy(&l->rx.addr, ss, sizeof(*ss));
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100673 if (proto->fam->set_port)
674 proto->fam->set_port(&l->rx.addr, port);
Willy Tarreau07400c52020-12-04 14:49:11 +0100675
Olivier Houchard859dc802019-08-08 15:47:21 +0200676 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200677 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200678
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100679 proto->add(proto, l);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200680
Willy Tarreau909c23b2020-09-15 13:50:58 +0200681 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200682 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100683
Amaury Denoyelle7f8f6cb2020-11-10 14:24:31 +0100684 l->extra_counters = NULL;
685
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100686 HA_RWLOCK_INIT(&l->lock);
Willy Tarreau4781b152021-04-06 13:53:36 +0200687 _HA_ATOMIC_INC(&jobs);
688 _HA_ATOMIC_INC(&listeners);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200689 }
690 return 1;
691}
692
Willy Tarreau1a64d162007-10-28 22:26:05 +0100693/* Delete a listener from its protocol's list of listeners. The listener's
694 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200695 * number of listeners is updated, as well as the global number of listeners
696 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200697 * is a low-level function expected to be called with the proto_lock and the
698 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100699 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200700void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100701{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100702 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200703 listener_set_state(listener, LI_INIT);
Willy Tarreau2b718102021-04-21 07:32:39 +0200704 LIST_DELETE(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200705 listener->rx.proto->nb_receivers--;
Willy Tarreau4781b152021-04-06 13:53:36 +0200706 _HA_ATOMIC_DEC(&jobs);
707 _HA_ATOMIC_DEC(&listeners);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100708 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200709}
710
711/* Delete a listener from its protocol's list of listeners (please check
712 * __delete_listener() above). The proto_lock and the listener's lock will
713 * be grabbed in this order.
714 */
715void delete_listener(struct listener *listener)
716{
717 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100718 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200719 __delete_listener(listener);
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100720 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200721 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100722}
723
Willy Tarreaue2711c72019-02-27 15:39:41 +0100724/* Returns a suitable value for a listener's backlog. It uses the listener's,
725 * otherwise the frontend's backlog, otherwise the listener's maxconn,
726 * otherwise the frontend's maxconn, otherwise 1024.
727 */
728int listener_backlog(const struct listener *l)
729{
730 if (l->backlog)
731 return l->backlog;
732
733 if (l->bind_conf->frontend->backlog)
734 return l->bind_conf->frontend->backlog;
735
736 if (l->maxconn)
737 return l->maxconn;
738
739 if (l->bind_conf->frontend->maxconn)
740 return l->bind_conf->frontend->maxconn;
741
742 return 1024;
743}
744
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200745/* This function is called on a read event from a listening socket, corresponding
746 * to an accept. It tries to accept as many connections as possible, and for each
747 * calls the listener's accept handler (generally the frontend's accept handler).
748 */
Willy Tarreaua74cb382020-10-15 21:29:49 +0200749void listener_accept(struct listener *l)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200750{
Willy Tarreau83efc322020-10-14 17:37:17 +0200751 struct connection *cli_conn;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100752 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200753 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100754 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100755 int next_feconn = 0;
756 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200757 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200758 int ret;
759
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100760 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200761
762 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
763 * illimited, but it is probably enough.
764 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100765 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200766
Willy Tarreau93e7c002013-10-07 18:51:07 +0200767 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
768 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200769
770 if (unlikely(!max)) {
771 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200772 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100773 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200774 }
775
776 if (max_accept > max)
777 max_accept = max;
778 }
779
780 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200781 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
782
783 if (unlikely(!max)) {
784 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200785 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100786 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200787 }
788
789 if (max_accept > max)
790 max_accept = max;
791 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200792#ifdef USE_OPENSSL
793 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
794 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200795
Willy Tarreaue43d5322013-10-07 20:01:52 +0200796 if (unlikely(!max)) {
797 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200798 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100799 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200800 }
801
802 if (max_accept > max)
803 max_accept = max;
804 }
805#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200806 if (p && p->fe_sps_lim) {
807 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
808
809 if (unlikely(!max)) {
810 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100811 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
812 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200813 }
814
815 if (max_accept > max)
816 max_accept = max;
817 }
818
819 /* Note: if we fail to allocate a connection because of configured
820 * limits, we'll schedule a new attempt worst 1 second later in the
821 * worst case. If we fail due to system limits or temporary resource
822 * shortage, we try again 100ms later in the worst case.
823 */
Willy Tarreau02757d02021-01-28 18:07:24 +0100824 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200825 unsigned int count;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200826 int status;
Willy Tarreau0aa5a5b2020-10-16 17:43:04 +0200827 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200828
Willy Tarreau82c97892019-02-27 19:32:32 +0100829 /* pre-increase the number of connections without going too far.
830 * We process the listener, then the proxy, then the process.
831 * We know which ones to unroll based on the next_xxx value.
832 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100833 do {
834 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100835 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100836 /* the listener was marked full or another
837 * thread is going to do it.
838 */
839 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100840 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100841 goto end;
842 }
843 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000844 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100845
Willy Tarreau82c97892019-02-27 19:32:32 +0100846 if (p) {
847 do {
848 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100849 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100850 /* the frontend was marked full or another
851 * thread is going to do it.
852 */
853 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100854 expire = TICK_ETERNITY;
855 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100856 }
857 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100858 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200859 }
860
Willy Tarreau82c97892019-02-27 19:32:32 +0100861 if (!(l->options & LI_O_UNLIMITED)) {
862 do {
863 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100864 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100865 /* the process was marked full or another
866 * thread is going to do it.
867 */
868 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100869 expire = tick_add(now_ms, 1000); /* try again in 1 second */
870 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100871 }
872 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000873 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200874 }
875
Willy Tarreaud276ee52022-02-01 16:37:00 +0100876 /* be careful below, the listener might be shutting down in
877 * another thread on error and we must not dereference its
878 * FD without a bit of protection.
879 */
880 cli_conn = NULL;
881 status = CO_AC_PERMERR;
882
883 HA_RWLOCK_RDLOCK(LISTENER_LOCK, &l->lock);
884 if (l->rx.flags & RX_F_BOUND)
885 cli_conn = l->rx.proto->accept_conn(l, &status);
886 HA_RWLOCK_RDUNLOCK(LISTENER_LOCK, &l->lock);
887
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200888 if (!cli_conn) {
889 switch (status) {
890 case CO_AC_DONE:
891 goto end;
Willy Tarreau818dca52014-01-31 19:40:19 +0100892
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200893 case CO_AC_RETRY: /* likely a signal */
Willy Tarreau4781b152021-04-06 13:53:36 +0200894 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100895 if (p)
Willy Tarreau4781b152021-04-06 13:53:36 +0200896 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100897 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +0200898 _HA_ATOMIC_DEC(&actconn);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100899 continue;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200900
901 case CO_AC_YIELD:
Willy Tarreau92079932019-12-10 09:30:05 +0100902 max_accept = 0;
903 goto end;
William Lallemandd9138002018-11-27 12:02:39 +0100904
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200905 default:
906 goto transient_error;
Willy Tarreau83efc322020-10-14 17:37:17 +0200907 }
908 }
909
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100910 /* The connection was accepted, it must be counted as such */
911 if (l->counters)
912 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
913
Willy Tarreauee3ec402022-05-09 20:41:54 +0200914 if (p) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100915 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
Willy Tarreauee3ec402022-05-09 20:41:54 +0200916 proxy_inc_fe_conn_ctr(l, p);
917 }
Willy Tarreau82c97892019-02-27 19:32:32 +0100918
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100919 if (!(l->options & LI_O_UNLIMITED)) {
920 count = update_freq_ctr(&global.conn_per_sec, 1);
921 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100922 }
923
Willy Tarreau4781b152021-04-06 13:53:36 +0200924 _HA_ATOMIC_INC(&activity[tid].accepted);
Willy Tarreau64a9c052019-04-12 15:27:17 +0200925
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200926 if (unlikely(cli_conn->handle.fd >= global.maxsock)) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200927 send_log(p, LOG_EMERG,
928 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
929 p->id);
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200930 close(cli_conn->handle.fd);
William Dauchy835712a2020-10-18 18:37:43 +0200931 conn_free(cli_conn);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100932 expire = tick_add(now_ms, 1000); /* try again in 1 second */
933 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200934 }
935
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100936 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100937 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
938 * allows the error path not to rollback on nbconn. It's more
939 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100940 */
941 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100942 next_feconn = 0;
943 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200944
Willy Tarreau83efc322020-10-14 17:37:17 +0200945
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100946#if defined(USE_THREAD)
Willy Tarreau818a92e2020-09-03 07:50:19 +0200947 mask = thread_mask(l->rx.settings->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100948 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100949 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100950 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100951
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100952 /* The principle is that we have two running indexes,
953 * each visiting in turn all threads bound to this
954 * listener. The connection will be assigned to the one
955 * with the least connections, and the other one will
956 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100957 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100958 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100959 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100960
961 /* keep a copy for the final update. thr_idx is composite
962 * and made of (t2<<16) + t1.
963 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100964 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100965 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100966 unsigned long m1, m2;
967 int q1, q2;
968
969 t2 = t1 = t0;
970 t2 >>= 16;
971 t1 &= 0xFFFF;
972
973 /* t1 walks low to high bits ;
974 * t2 walks high to low.
975 */
976 m1 = mask >> t1;
977 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
978
Willy Tarreau85d04242019-04-16 18:09:13 +0200979 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100980 m1 &= ~1UL;
981 if (!m1) {
982 m1 = mask;
983 t1 = 0;
984 }
985 t1 += my_ffsl(m1) - 1;
986 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100987
Willy Tarreau85d04242019-04-16 18:09:13 +0200988 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
989 /* highest bit not set */
990 if (!m2)
991 m2 = mask;
992
993 t2 = my_flsl(m2) - 1;
994 }
995
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100996 /* now we have two distinct thread IDs belonging to the mask */
997 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
998 if (q1 >= ACCEPT_QUEUE_SIZE)
999 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001000
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001001 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
1002 if (q2 >= ACCEPT_QUEUE_SIZE)
1003 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001004
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001005 /* we have 3 possibilities now :
1006 * q1 < q2 : t1 is less loaded than t2, so we pick it
1007 * and update t2 (since t1 might still be
1008 * lower than another thread)
1009 * q1 > q2 : t2 is less loaded than t1, so we pick it
1010 * and update t1 (since t2 might still be
1011 * lower than another thread)
1012 * q1 = q2 : both are equally loaded, thus we pick t1
1013 * and update t1 as it will become more loaded
1014 * than t2.
1015 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001016
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001017 q1 += l->thr_conn[t1];
1018 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001019
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001020 if (q1 - q2 < 0) {
1021 t = t1;
1022 t2 = t2 ? t2 - 1 : LONGBITS - 1;
1023 }
1024 else if (q1 - q2 > 0) {
1025 t = t2;
1026 t1++;
1027 if (t1 >= LONGBITS)
1028 t1 = 0;
1029 }
1030 else {
1031 t = t1;
1032 t1++;
1033 if (t1 >= LONGBITS)
1034 t1 = 0;
1035 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001036
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001037 /* new value for thr_idx */
1038 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001039 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001040
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001041 /* We successfully selected the best thread "t" for this
1042 * connection. We use deferred accepts even if it's the
1043 * local thread because tests show that it's the best
1044 * performing model, likely due to better cache locality
1045 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001046 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001047 ring = &accept_queue_rings[t];
Willy Tarreau83efc322020-10-14 17:37:17 +02001048 if (accept_queue_push_mp(ring, cli_conn)) {
Willy Tarreau4781b152021-04-06 13:53:36 +02001049 _HA_ATOMIC_INC(&activity[t].accq_pushed);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001050 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001051 continue;
1052 }
1053 /* If the ring is full we do a synchronous accept on
1054 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001055 */
Willy Tarreau4781b152021-04-06 13:53:36 +02001056 _HA_ATOMIC_INC(&activity[t].accq_full);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001057 }
1058#endif // USE_THREAD
1059
Willy Tarreau4781b152021-04-06 13:53:36 +02001060 _HA_ATOMIC_INC(&l->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +02001061 ret = l->accept(cli_conn);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001062 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001063 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001064 * we just have to ignore it (ret == 0) or it's a critical
1065 * error due to a resource shortage, and we must stop the
1066 * listener (ret < 0).
1067 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001068 if (ret == 0) /* successful termination */
1069 continue;
1070
Willy Tarreaubb660302014-05-07 19:47:02 +02001071 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001072 }
1073
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001074 /* increase the per-process number of cumulated sessions, this
1075 * may only be done once l->accept() has accepted the connection.
1076 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001077 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001078 count = update_freq_ctr(&global.sess_per_sec, 1);
1079 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001080 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001081#ifdef USE_OPENSSL
1082 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001083 count = update_freq_ctr(&global.ssl_per_sec, 1);
1084 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001085 }
1086#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001087
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001088 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001089 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001090
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001091 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001092 if (next_conn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001093 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001094
Willy Tarreau82c97892019-02-27 19:32:32 +01001095 if (p && next_feconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001096 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001097
1098 if (next_actconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001099 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001100
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001101 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau02757d02021-01-28 18:07:24 +01001102 (l->state == LI_LIMITED &&
Willy Tarreaucdcba112019-12-11 15:06:30 +01001103 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1104 (!tick_isset(global_listener_queue_task->expire) ||
1105 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001106 /* at least one thread has to this when quitting */
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +02001107 resume_listener(l, 0);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001108
Willy Tarreau02757d02021-01-28 18:07:24 +01001109 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001110 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001111
Olivier Houchard859dc802019-08-08 15:47:21 +02001112 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001113 (!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 +01001114 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001115 }
Willy Tarreau0591bf72019-12-10 12:01:21 +01001116 return;
1117
1118 transient_error:
1119 /* pause the listener for up to 100 ms */
1120 expire = tick_add(now_ms, 100);
1121
Willy Tarreau258b3512020-10-13 17:46:05 +02001122 /* This may be a shared socket that was paused by another process.
1123 * Let's put it to pause in this case.
1124 */
1125 if (l->rx.proto && l->rx.proto->rx_listening(&l->rx) == 0) {
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +02001126 pause_listener(l, 0);
Willy Tarreau258b3512020-10-13 17:46:05 +02001127 goto end;
1128 }
1129
Willy Tarreau0591bf72019-12-10 12:01:21 +01001130 limit_global:
1131 /* (re-)queue the listener to the global queue and set it to expire no
1132 * later than <expire> ahead. The listener turns to LI_LIMITED.
1133 */
1134 limit_listener(l, &global_listener_queue);
Christopher Faulete088fb32022-11-17 14:40:20 +01001135 HA_RWLOCK_RDLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001136 task_schedule(global_listener_queue_task, expire);
Christopher Faulete088fb32022-11-17 14:40:20 +01001137 HA_RWLOCK_RDUNLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001138 goto end;
1139
1140 limit_proxy:
1141 /* (re-)queue the listener to the proxy's queue and set it to expire no
1142 * later than <expire> ahead. The listener turns to LI_LIMITED.
1143 */
1144 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001145 if (p->task && tick_isset(expire))
1146 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001147 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001148}
1149
Willy Tarreau05f50472017-09-15 09:19:58 +02001150/* Notify the listener that a connection initiated from it was released. This
1151 * is used to keep the connection count consistent and to possibly re-open
1152 * listening when it was limited.
1153 */
1154void listener_release(struct listener *l)
1155{
1156 struct proxy *fe = l->bind_conf->frontend;
1157
1158 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +02001159 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001160 if (fe)
Willy Tarreau4781b152021-04-06 13:53:36 +02001161 _HA_ATOMIC_DEC(&fe->feconn);
1162 _HA_ATOMIC_DEC(&l->nbconn);
1163 _HA_ATOMIC_DEC(&l->thr_conn[tid]);
Willy Tarreau82c97892019-02-27 19:32:32 +01001164
1165 if (l->state == LI_FULL || l->state == LI_LIMITED)
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +02001166 resume_listener(l, 0);
Willy Tarreau05f50472017-09-15 09:19:58 +02001167
Willy Tarreau02757d02021-01-28 18:07:24 +01001168 /* Dequeues all of the listeners waiting for a resource */
1169 dequeue_all_listeners();
1170
Olivier Houchard859dc802019-08-08 15:47:21 +02001171 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001172 (!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 +01001173 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001174}
1175
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001176/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1177static int listener_queue_init()
1178{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001179 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1180 if (!global_listener_queue_task) {
1181 ha_alert("Out of memory when initializing global listener queue\n");
1182 return ERR_FATAL|ERR_ABORT;
1183 }
1184 /* very simple initialization, users will queue the task if needed */
1185 global_listener_queue_task->context = NULL; /* not even a context! */
1186 global_listener_queue_task->process = manage_global_listener_queue;
Christopher Faulete088fb32022-11-17 14:40:20 +01001187 HA_RWLOCK_INIT(&global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001188
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001189 return 0;
1190}
1191
1192static void listener_queue_deinit()
1193{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001194 task_destroy(global_listener_queue_task);
1195 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001196}
1197
1198REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1199REGISTER_POST_DEINIT(listener_queue_deinit);
1200
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001201
1202/* This is the global management task for listeners. It enables listeners waiting
1203 * for global resources when there are enough free resource, or at least once in
Willy Tarreaud597ec22021-01-29 14:29:06 +01001204 * a while. It is designed to be called as a task. It's exported so that it's easy
1205 * to spot in "show tasks" or "show profiling".
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001206 */
Willy Tarreau144f84a2021-03-02 16:09:26 +01001207struct task *manage_global_listener_queue(struct task *t, void *context, unsigned int state)
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001208{
1209 /* If there are still too many concurrent connections, let's wait for
1210 * some of them to go away. We don't need to re-arm the timer because
1211 * each of them will scan the queue anyway.
1212 */
1213 if (unlikely(actconn >= global.maxconn))
1214 goto out;
1215
1216 /* We should periodically try to enable listeners waiting for a global
1217 * resource here, because it is possible, though very unlikely, that
1218 * they have been blocked by a temporary lack of global resource such
1219 * as a file descriptor or memory and that the temporary condition has
1220 * disappeared.
1221 */
1222 dequeue_all_listeners();
1223
1224 out:
Christopher Faulete088fb32022-11-17 14:40:20 +01001225 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001226 t->expire = TICK_ETERNITY;
Christopher Faulete088fb32022-11-17 14:40:20 +01001227 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001228 task_queue(t);
1229 return t;
1230}
1231
Willy Tarreau26982662012-09-12 23:17:10 +02001232/*
1233 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1234 * parsing sessions.
1235 */
1236void bind_register_keywords(struct bind_kw_list *kwl)
1237{
Willy Tarreau2b718102021-04-21 07:32:39 +02001238 LIST_APPEND(&bind_keywords.list, &kwl->list);
Willy Tarreau26982662012-09-12 23:17:10 +02001239}
1240
1241/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1242 * keyword is found with a NULL ->parse() function, then an attempt is made to
1243 * find one with a valid ->parse() function. This way it is possible to declare
1244 * platform-dependant, known keywords as NULL, then only declare them as valid
1245 * if some options are met. Note that if the requested keyword contains an
1246 * opening parenthesis, everything from this point is ignored.
1247 */
1248struct bind_kw *bind_find_kw(const char *kw)
1249{
1250 int index;
1251 const char *kwend;
1252 struct bind_kw_list *kwl;
1253 struct bind_kw *ret = NULL;
1254
1255 kwend = strchr(kw, '(');
1256 if (!kwend)
1257 kwend = kw + strlen(kw);
1258
1259 list_for_each_entry(kwl, &bind_keywords.list, list) {
1260 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1261 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1262 kwl->kw[index].kw[kwend-kw] == 0) {
1263 if (kwl->kw[index].parse)
1264 return &kwl->kw[index]; /* found it !*/
1265 else
1266 ret = &kwl->kw[index]; /* may be OK */
1267 }
1268 }
1269 }
1270 return ret;
1271}
1272
Willy Tarreau8638f482012-09-18 18:01:17 +02001273/* Dumps all registered "bind" keywords to the <out> string pointer. The
1274 * unsupported keywords are only dumped if their supported form was not
1275 * found.
1276 */
1277void bind_dump_kws(char **out)
1278{
1279 struct bind_kw_list *kwl;
1280 int index;
1281
Christopher Faulet784063e2020-05-18 12:14:18 +02001282 if (!out)
1283 return;
1284
Willy Tarreau8638f482012-09-18 18:01:17 +02001285 *out = NULL;
1286 list_for_each_entry(kwl, &bind_keywords.list, list) {
1287 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1288 if (kwl->kw[index].parse ||
1289 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001290 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1291 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001292 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001293 kwl->kw[index].skip ? " <arg>" : "",
1294 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001295 }
1296 }
1297 }
1298}
1299
Willy Tarreau433b05f2021-03-12 10:14:07 +01001300/* Try to find in srv_keyword the word that looks closest to <word> by counting
1301 * transitions between letters, digits and other characters. Will return the
1302 * best matching word if found, otherwise NULL.
1303 */
1304const char *bind_find_best_kw(const char *word)
1305{
1306 uint8_t word_sig[1024];
1307 uint8_t list_sig[1024];
1308 const struct bind_kw_list *kwl;
1309 const char *best_ptr = NULL;
1310 int dist, best_dist = INT_MAX;
1311 int index;
1312
1313 make_word_fingerprint(word_sig, word);
1314 list_for_each_entry(kwl, &bind_keywords.list, list) {
1315 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1316 make_word_fingerprint(list_sig, kwl->kw[index].kw);
1317 dist = word_fingerprint_distance(word_sig, list_sig);
1318 if (dist < best_dist) {
1319 best_dist = dist;
1320 best_ptr = kwl->kw[index].kw;
1321 }
1322 }
1323 }
1324
1325 if (best_dist > 2 * strlen(word) || (best_ptr && best_dist > 2 * strlen(best_ptr)))
1326 best_ptr = NULL;
1327
1328 return best_ptr;
1329}
1330
Willy Tarreau645513a2010-05-24 20:55:15 +02001331/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001332/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001333/************************************************************************/
1334
Willy Tarreaua5e37562011-12-16 17:06:15 +01001335/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001336static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001337smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001338{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001339 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001340 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001341 return 1;
1342}
1343
Willy Tarreaua5e37562011-12-16 17:06:15 +01001344/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001345static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001346smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001347{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001348 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001349 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001350 return 1;
1351}
Jerome Magnineb421b22020-03-27 22:08:40 +01001352static int
1353smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1354{
1355 smp->data.u.str.area = smp->sess->listener->name;
1356 if (!smp->data.u.str.area)
1357 return 0;
1358
1359 smp->data.type = SMP_T_STR;
1360 smp->flags = SMP_F_CONST;
1361 smp->data.u.str.data = strlen(smp->data.u.str.area);
1362 return 1;
1363}
Willy Tarreau645513a2010-05-24 20:55:15 +02001364
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001365/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001366static 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 +02001367{
1368 struct listener *l;
1369
Willy Tarreau4348fad2012-09-20 16:48:07 +02001370 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001371 l->options |= LI_O_ACC_PROXY;
1372
1373 return 0;
1374}
1375
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001376/* parse the "accept-netscaler-cip" bind keyword */
1377static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1378{
1379 struct listener *l;
1380 uint32_t val;
1381
1382 if (!*args[cur_arg + 1]) {
1383 memprintf(err, "'%s' : missing value", args[cur_arg]);
1384 return ERR_ALERT | ERR_FATAL;
1385 }
1386
1387 val = atol(args[cur_arg + 1]);
1388 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001389 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001390 return ERR_ALERT | ERR_FATAL;
1391 }
1392
1393 list_for_each_entry(l, &conf->listeners, by_bind) {
1394 l->options |= LI_O_ACC_CIP;
1395 conf->ns_cip_magic = val;
1396 }
1397
1398 return 0;
1399}
1400
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001401/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001402static 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 +02001403{
1404 struct listener *l;
1405 int val;
1406
1407 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001408 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001409 return ERR_ALERT | ERR_FATAL;
1410 }
1411
1412 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001413 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001414 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001415 return ERR_ALERT | ERR_FATAL;
1416 }
1417
Willy Tarreau4348fad2012-09-20 16:48:07 +02001418 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001419 l->backlog = val;
1420
1421 return 0;
1422}
1423
1424/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001425static 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 +02001426{
1427 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001428 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001429 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001430
Willy Tarreau4348fad2012-09-20 16:48:07 +02001431 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001432 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001433 return ERR_ALERT | ERR_FATAL;
1434 }
1435
1436 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001437 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001438 return ERR_ALERT | ERR_FATAL;
1439 }
1440
Willy Tarreau4348fad2012-09-20 16:48:07 +02001441 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001442 new->luid = strtol(args[cur_arg + 1], &error, 10);
1443 if (*error != '\0') {
1444 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1445 return ERR_ALERT | ERR_FATAL;
1446 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001447 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001448
Willy Tarreau4348fad2012-09-20 16:48:07 +02001449 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001450 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001451 return ERR_ALERT | ERR_FATAL;
1452 }
1453
Willy Tarreau4348fad2012-09-20 16:48:07 +02001454 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001455 if (node) {
1456 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001457 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1458 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1459 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001460 return ERR_ALERT | ERR_FATAL;
1461 }
1462
Willy Tarreau4348fad2012-09-20 16:48:07 +02001463 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001464 return 0;
1465}
1466
1467/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001468static 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 +02001469{
1470 struct listener *l;
1471 int val;
1472
1473 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001474 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001475 return ERR_ALERT | ERR_FATAL;
1476 }
1477
1478 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001479 if (val < 0) {
1480 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001481 return ERR_ALERT | ERR_FATAL;
1482 }
1483
Willy Tarreau4348fad2012-09-20 16:48:07 +02001484 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001485 l->maxconn = val;
1486
1487 return 0;
1488}
1489
1490/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001491static 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 +02001492{
1493 struct listener *l;
1494
1495 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001496 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001497 return ERR_ALERT | ERR_FATAL;
1498 }
1499
Willy Tarreau4348fad2012-09-20 16:48:07 +02001500 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001501 l->name = strdup(args[cur_arg + 1]);
1502
1503 return 0;
1504}
1505
1506/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001507static 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 +02001508{
1509 struct listener *l;
1510 int val;
1511
1512 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001513 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001514 return ERR_ALERT | ERR_FATAL;
1515 }
1516
1517 val = atol(args[cur_arg + 1]);
1518 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001519 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001520 return ERR_ALERT | ERR_FATAL;
1521 }
1522
Willy Tarreau4348fad2012-09-20 16:48:07 +02001523 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001524 l->nice = val;
1525
1526 return 0;
1527}
1528
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001529/* parse the "process" bind keyword */
1530static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1531{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001532 char *slash;
1533 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001534
Christopher Fauletc644fa92017-11-23 22:44:11 +01001535 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1536 *slash = 0;
1537
Willy Tarreauff9c9142019-02-07 10:39:36 +01001538 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001539 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001540 return ERR_ALERT | ERR_FATAL;
1541 }
1542
Christopher Fauletc644fa92017-11-23 22:44:11 +01001543 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001544 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001545 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1546 return ERR_ALERT | ERR_FATAL;
1547 }
1548 *slash = '/';
1549 }
1550
Willy Tarreaue26993c2020-09-03 07:18:55 +02001551 conf->settings.bind_proc |= proc;
1552 conf->settings.bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001553 return 0;
1554}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001555
Christopher Fauleta717b992018-04-10 14:43:00 +02001556/* parse the "proto" bind keyword */
1557static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1558{
1559 struct ist proto;
1560
1561 if (!*args[cur_arg + 1]) {
1562 memprintf(err, "'%s' : missing value", args[cur_arg]);
1563 return ERR_ALERT | ERR_FATAL;
1564 }
1565
Tim Duesterhusdcf753a2021-03-04 17:31:47 +01001566 proto = ist(args[cur_arg + 1]);
Christopher Fauleta717b992018-04-10 14:43:00 +02001567 conf->mux_proto = get_mux_proto(proto);
1568 if (!conf->mux_proto) {
1569 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1570 return ERR_ALERT | ERR_FATAL;
1571 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001572 return 0;
1573}
1574
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001575/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1576static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
Willy Tarreau01825162021-03-09 09:53:46 +01001577 const struct proxy *defpx, const char *file, int line,
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001578 char **err)
1579{
1580 if (too_many_args(1, args, err, NULL))
1581 return -1;
1582
1583 if (strcmp(args[1], "on") == 0)
1584 global.tune.options |= GTUNE_LISTENER_MQ;
1585 else if (strcmp(args[1], "off") == 0)
1586 global.tune.options &= ~GTUNE_LISTENER_MQ;
1587 else {
1588 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1589 return -1;
1590 }
1591 return 0;
1592}
1593
Willy Tarreau61612d42012-04-19 18:42:05 +02001594/* Note: must not be declared <const> as its list will be overwritten.
1595 * Please take care of keeping this list alphabetically sorted.
1596 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001597static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001598 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1599 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001600 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001601 { /* END */ },
1602}};
1603
Willy Tarreau0108d902018-11-25 19:14:37 +01001604INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1605
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001606/* Note: must not be declared <const> as its list will be overwritten.
1607 * Please take care of keeping this list alphabetically sorted.
1608 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001609static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001610 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001611}};
1612
Willy Tarreau0108d902018-11-25 19:14:37 +01001613INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1614
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001615/* Note: must not be declared <const> as its list will be overwritten.
1616 * Please take care of keeping this list alphabetically sorted, doing so helps
1617 * all code contributors.
1618 * Optional keywords are also declared with a NULL ->parse() function so that
1619 * the config parser can report an appropriate error when a known keyword was
1620 * not enabled.
1621 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001622static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001623 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001624 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1625 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1626 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1627 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1628 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1629 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001630 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001631 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001632 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001633}};
1634
Willy Tarreau0108d902018-11-25 19:14:37 +01001635INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1636
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001637/* config keyword parsers */
1638static struct cfg_kw_list cfg_kws = {ILH, {
1639 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1640 { 0, NULL, NULL }
1641}};
1642
1643INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1644
Willy Tarreau645513a2010-05-24 20:55:15 +02001645/*
1646 * Local variables:
1647 * c-indent-level: 8
1648 * c-basic-offset: 8
1649 * End:
1650 */