blob: 26b51ab2d0f4cc75ffd83b19f6c52aac8c1d0e64 [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);
Aurelien DARRAGON3b78de12023-02-14 08:51:14 +0100254 l->flags |= LI_F_FINALIZED;
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200255 break;
256 }
257 }
Willy Tarreaua37b2442020-09-24 07:23:45 +0200258 l->state = st;
259}
260
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100261/* This function adds the specified listener's file descriptor to the polling
262 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500263 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200264 * also support binding only the relevant processes to their respective
265 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100266 */
Willy Tarreau7834a3f2020-09-25 16:40:18 +0200267void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100268{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100269 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200270
271 /* If this listener is supposed to be only in the master, close it in
272 * the workers. Conversely, if it's supposed to be only in the workers
273 * close it in the master.
274 */
Willy Tarreau18c20d22020-10-09 16:11:46 +0200275 if (!!master != !!(listener->rx.flags & RX_F_MWORKER))
Willy Tarreau75c98d12020-10-09 15:55:23 +0200276 do_unbind_listener(listener);
Willy Tarreaud6afb532020-10-09 10:35:40 +0200277
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100278 if (listener->state == LI_LISTEN) {
Willy Tarreau95a34602020-10-08 15:32:21 +0200279 BUG_ON(listener->rx.fd == -1);
William Lallemand095ba4c2017-06-01 17:38:50 +0200280 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau38dba272020-11-04 13:54:00 +0100281 (!!master != !!(listener->rx.flags & RX_F_MWORKER) ||
282 !(proc_mask(listener->rx.settings->bind_proc) & pid_bit))) {
Willy Tarreauae302532014-05-07 19:22:24 +0200283 /* we don't want to enable this listener and don't
284 * want any fd event to reach it.
285 */
Willy Tarreau75c98d12020-10-09 15:55:23 +0200286 do_unbind_listener(listener);
Willy Tarreauae302532014-05-07 19:22:24 +0200287 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100288 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200289 listener->rx.proto->enable(listener);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200290 listener_set_state(listener, LI_READY);
Willy Tarreauae302532014-05-07 19:22:24 +0200291 }
292 else {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200293 listener_set_state(listener, LI_FULL);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100294 }
295 }
Willy Tarreaud6afb532020-10-09 10:35:40 +0200296
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100297 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100298}
299
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200300/*
Aurelien DARRAGON7c9e1f92022-09-11 16:19:49 +0200301 * This function completely stops a listener.
302 * The proxy's listeners count is updated and the proxy is
303 * disabled and woken up after the last one is gone.
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100304 * It will need to operate under the proxy's lock, the protocol's lock and
305 * the listener's lock. The caller is responsible for indicating in lpx,
306 * lpr, lli whether the respective locks are already held (non-zero) or
307 * not (zero) so that the function picks the missing ones, in this order.
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200308 */
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100309void stop_listener(struct listener *l, int lpx, int lpr, int lli)
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200310{
311 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200312
313 if (l->options & LI_O_NOSTOP) {
314 /* master-worker sockpairs are never closed but don't count as a
315 * job.
316 */
317 return;
318 }
319
Aurelien DARRAGON15c43862022-09-12 09:26:21 +0200320 if (!lpx && px)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200321 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200322
323 if (!lpr)
324 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
325
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100326 if (!lli)
327 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200328
329 if (l->state > LI_INIT) {
Willy Tarreau75c98d12020-10-09 15:55:23 +0200330 do_unbind_listener(l);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200331
332 if (l->state >= LI_ASSIGNED)
333 __delete_listener(l);
334
Aurelien DARRAGON15c43862022-09-12 09:26:21 +0200335 if (px)
336 proxy_cond_disable(px);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200337 }
338
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100339 if (!lli)
340 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200341
342 if (!lpr)
343 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
344
Aurelien DARRAGON15c43862022-09-12 09:26:21 +0200345 if (!lpx && px)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200346 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200347}
348
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100349/* This function adds the specified <listener> to the protocol <proto>. It
350 * does nothing if the protocol was already added. The listener's state is
351 * automatically updated from LI_INIT to LI_ASSIGNED. The number of listeners
352 * for the protocol is updated. This must be called with the proto lock held.
353 */
354void default_add_listener(struct protocol *proto, struct listener *listener)
355{
356 if (listener->state != LI_INIT)
357 return;
358 listener_set_state(listener, LI_ASSIGNED);
359 listener->rx.proto = proto;
Willy Tarreau2b718102021-04-21 07:32:39 +0200360 LIST_APPEND(&proto->receivers, &listener->rx.proto_list);
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100361 proto->nb_receivers++;
362}
363
Willy Tarreaue03204c2020-10-09 17:02:21 +0200364/* default function called to suspend a listener: it simply passes the call to
365 * the underlying receiver. This is find for most socket-based protocols. This
Aurelien DARRAGON39f16152023-02-07 11:23:38 +0100366 * must be called under the listener's lock. It will return < 0 in case of
367 * failure, 0 if the listener was totally stopped, or > 0 if correctly paused..
368 * If no receiver-level suspend is provided, the operation is assumed
369 * to succeed.
Willy Tarreaue03204c2020-10-09 17:02:21 +0200370 */
371int default_suspend_listener(struct listener *l)
372{
Willy Tarreaue03204c2020-10-09 17:02:21 +0200373 if (!l->rx.proto->rx_suspend)
374 return 1;
375
Aurelien DARRAGON39f16152023-02-07 11:23:38 +0100376 return l->rx.proto->rx_suspend(&l->rx);
Willy Tarreaue03204c2020-10-09 17:02:21 +0200377}
378
379
380/* Tries to resume a suspended listener, and returns non-zero on success or
381 * zero on failure. On certain errors, an alert or a warning might be displayed.
382 * It must be called with the listener's lock held. Depending on the listener's
383 * state and protocol, a listen() call might be used to resume operations, or a
384 * call to the receiver's resume() function might be used as well. This is
385 * suitable as a default function for TCP and UDP. This must be called with the
386 * listener's lock held.
387 */
388int default_resume_listener(struct listener *l)
389{
390 int ret = 1;
391
392 if (l->state == LI_ASSIGNED) {
393 char msg[100];
Aurelien DARRAGONd41af3e2023-02-07 12:17:20 +0100394 char *errmsg;
Willy Tarreaue03204c2020-10-09 17:02:21 +0200395 int err;
396
Aurelien DARRAGONd41af3e2023-02-07 12:17:20 +0100397 /* first, try to bind the receiver */
398 err = l->rx.proto->fam->bind(&l->rx, &errmsg);
399 if (err != ERR_NONE) {
400 if (err & ERR_WARN)
401 ha_warning("Resuming listener: %s\n", errmsg);
402 else if (err & ERR_ALERT)
403 ha_alert("Resuming listener: %s\n", errmsg);
404 ha_free(&errmsg);
405 if (err & (ERR_FATAL | ERR_ABORT)) {
406 ret = 0;
407 goto end;
408 }
409 }
410
411 /* then, try to listen:
412 * for now there's still always a listening function
413 * (same check performed in protocol_bind_all()
414 */
415 BUG_ON(!l->rx.proto->listen);
Willy Tarreaue03204c2020-10-09 17:02:21 +0200416 err = l->rx.proto->listen(l, msg, sizeof(msg));
417 if (err & ERR_ALERT)
418 ha_alert("Resuming listener: %s\n", msg);
419 else if (err & ERR_WARN)
420 ha_warning("Resuming listener: %s\n", msg);
421
422 if (err & (ERR_FATAL | ERR_ABORT)) {
423 ret = 0;
424 goto end;
425 }
426 }
427
428 if (l->state < LI_PAUSED) {
429 ret = 0;
430 goto end;
431 }
432
433 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
434 l->rx.proto->rx_resume(&l->rx) <= 0)
435 ret = 0;
436 end:
437 return ret;
438}
439
440
Willy Tarreaube58c382011-07-24 18:28:10 +0200441/* This function tries to temporarily disable a listener, depending on the OS
442 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
443 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
444 * closes upon SHUT_WR and refuses to rebind. So a common validation path
445 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
446 * is disabled. It normally returns non-zero, unless an error is reported.
Aurelien DARRAGON8283d592023-02-13 17:45:08 +0100447 * suspend() may totally stop a listener if it doesn't support the PAUSED
448 * state, in which case state will be set to ASSIGNED.
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100449 * It will need to operate under the proxy's lock and the listener's lock.
450 * The caller is responsible for indicating in lpx, lli whether the respective
451 * locks are already held (non-zero) or not (zero) so that the function pick
452 * the missing ones, in this order.
Willy Tarreaube58c382011-07-24 18:28:10 +0200453 */
Aurelien DARRAGON8283d592023-02-13 17:45:08 +0100454int suspend_listener(struct listener *l, int lpx, int lli)
Willy Tarreaube58c382011-07-24 18:28:10 +0200455{
Willy Tarreau58651b42020-09-24 16:03:29 +0200456 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200457 int ret = 1;
458
Aurelien DARRAGON15c43862022-09-12 09:26:21 +0200459 if (!lpx && px)
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200460 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
461
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100462 if (!lli)
463 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200464
Willy Tarreau02e19752020-09-23 17:17:22 +0200465 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
466 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
467 goto end;
468
Aurelien DARRAGON3b78de12023-02-14 08:51:14 +0100469 if (!(l->flags & LI_F_FINALIZED) || l->state <= LI_PAUSED)
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200470 goto end;
471
Aurelien DARRAGON39f16152023-02-07 11:23:38 +0100472 if (l->rx.proto->suspend) {
Willy Tarreaue03204c2020-10-09 17:02:21 +0200473 ret = l->rx.proto->suspend(l);
Aurelien DARRAGON39f16152023-02-07 11:23:38 +0100474 /* if the suspend() fails, we don't want to change the
475 * current listener state
476 */
477 if (ret < 0)
478 goto end;
479 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200480
Willy Tarreau2b718102021-04-21 07:32:39 +0200481 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200482
Aurelien DARRAGON39f16152023-02-07 11:23:38 +0100483 /* ret == 0 means that the suspend() has been turned into
484 * an unbind(), meaning the listener is now stopped (ie: ABNS), we need
485 * to report this state change properly
486 */
487 listener_set_state(l, ((ret) ? LI_PAUSED : LI_ASSIGNED));
488
Aurelien DARRAGON8283d592023-02-13 17:45:08 +0100489 if (px && !(l->flags & LI_F_SUSPENDED))
490 px->li_suspended++;
491 l->flags |= LI_F_SUSPENDED;
492
Aurelien DARRAGON39f16152023-02-07 11:23:38 +0100493 /* at this point, everything is under control, no error should be
494 * returned to calling function
495 */
496 ret = 1;
Willy Tarreau58651b42020-09-24 16:03:29 +0200497
498 if (px && !px->li_ready) {
499 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
500 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
501 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200502 end:
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100503 if (!lli)
504 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200505
Aurelien DARRAGON15c43862022-09-12 09:26:21 +0200506 if (!lpx && px)
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200507 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
508
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200509 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200510}
511
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200512/* This function tries to resume a temporarily disabled listener. Paused, full,
513 * limited and disabled listeners are handled, which means that this function
514 * may replace enable_listener(). The resulting state will either be LI_READY
515 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200516 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200517 * foreground mode, and are ignored. If the listener was only in the assigned
Aurelien DARRAGON8283d592023-02-13 17:45:08 +0100518 * state, it's totally rebound. This can happen if a suspend() has completely
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200519 * stopped it. If the resume fails, 0 is returned and an error might be
520 * displayed.
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100521 * It will need to operate under the proxy's lock and the listener's lock.
522 * The caller is responsible for indicating in lpx, lli whether the respective
523 * locks are already held (non-zero) or not (zero) so that the function pick
524 * the missing ones, in this order.
Willy Tarreaube58c382011-07-24 18:28:10 +0200525 */
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100526int resume_listener(struct listener *l, int lpx, int lli)
Willy Tarreaube58c382011-07-24 18:28:10 +0200527{
Willy Tarreau58651b42020-09-24 16:03:29 +0200528 struct proxy *px = l->bind_conf->frontend;
Aurelien DARRAGON659a23b2023-11-17 20:36:16 +0100529 int was_suspended = px && px->li_suspended;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200530 int ret = 1;
531
Aurelien DARRAGON15c43862022-09-12 09:26:21 +0200532 if (!lpx && px)
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200533 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
534
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100535 if (!lli)
536 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200537
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200538 /* check that another thread didn't to the job in parallel (e.g. at the
539 * end of listen_accept() while we'd come from dequeue_all_listeners().
540 */
Willy Tarreau2b718102021-04-21 07:32:39 +0200541 if (MT_LIST_INLIST(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200542 goto end;
543
William Lallemand095ba4c2017-06-01 17:38:50 +0200544 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau818a92e2020-09-03 07:50:19 +0200545 !(proc_mask(l->rx.settings->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200546 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100547
Aurelien DARRAGON3b78de12023-02-14 08:51:14 +0100548 if (!(l->flags & LI_F_FINALIZED) || l->state == LI_READY)
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200549 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200550
Aurelien DARRAGON4713adc2023-02-07 13:26:14 +0100551 if (l->rx.proto->resume) {
Willy Tarreaue03204c2020-10-09 17:02:21 +0200552 ret = l->rx.proto->resume(l);
Aurelien DARRAGON4713adc2023-02-07 13:26:14 +0100553 if (!ret)
554 goto end; /* failure to resume */
555 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200556
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100557 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200558 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200559 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200560 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200561 }
562
Willy Tarreau4b51f422020-09-25 20:32:28 +0200563 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200564 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200565
566 done:
Aurelien DARRAGON8283d592023-02-13 17:45:08 +0100567 if (px && (l->flags & LI_F_SUSPENDED))
568 px->li_suspended--;
569 l->flags &= ~LI_F_SUSPENDED;
570
Aurelien DARRAGON659a23b2023-11-17 20:36:16 +0100571 if (was_suspended && !px->li_suspended) {
Willy Tarreau58651b42020-09-24 16:03:29 +0200572 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
573 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
574 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200575 end:
Aurelien DARRAGON7e2eee02023-02-06 17:06:03 +0100576 if (!lli)
577 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200578
Aurelien DARRAGON15c43862022-09-12 09:26:21 +0200579 if (!lpx && px)
Aurelien DARRAGONa225fe82022-09-09 15:32:57 +0200580 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
581
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200582 return ret;
583}
584
Aurelien DARRAGON3e931a42023-02-15 09:30:54 +0100585/* Same as resume_listener(), but will only work to resume from
586 * LI_FULL or LI_LIMITED states because we try to relax listeners that
587 * were temporarily restricted and not to resume inactive listeners that
588 * may have been paused or completely stopped in the meantime.
589 * Returns positive value for success and 0 for failure.
590 * It will need to operate under the proxy's lock and the listener's lock.
591 * The caller is responsible for indicating in lpx, lli whether the respective
592 * locks are already held (non-zero) or not (zero) so that the function pick
593 * the missing ones, in this order.
594 */
595int relax_listener(struct listener *l, int lpx, int lli)
596{
Christopher Faulet793a4b52023-07-20 14:53:50 +0200597 struct proxy *px = l->bind_conf->frontend;
Aurelien DARRAGON3e931a42023-02-15 09:30:54 +0100598 int ret = 1;
599
Christopher Faulet793a4b52023-07-20 14:53:50 +0200600 if (!lpx && px)
601 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
602
Aurelien DARRAGON3e931a42023-02-15 09:30:54 +0100603 if (!lli)
604 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
605
606 if (l->state != LI_FULL && l->state != LI_LIMITED)
607 goto end; /* listener may be suspended or even stopped */
Christopher Faulet793a4b52023-07-20 14:53:50 +0200608 ret = resume_listener(l, 1, 1);
Aurelien DARRAGON3e931a42023-02-15 09:30:54 +0100609
610 end:
611 if (!lli)
612 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet793a4b52023-07-20 14:53:50 +0200613
614 if (!lpx && px)
615 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
616
Aurelien DARRAGON3e931a42023-02-15 09:30:54 +0100617 return ret;
618}
619
Willy Tarreau87b09662015-04-03 00:22:06 +0200620/* Marks a ready listener as full so that the stream code tries to re-enable
Aurelien DARRAGONb1918b12023-02-06 17:19:58 +0100621 * it upon next close() using relax_listener().
Willy Tarreau62793712011-07-24 19:23:38 +0200622 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200623static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200624{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100625 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200626 if (l->state >= LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200627 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100628 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200629 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200630 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100631 }
Willy Tarreau62793712011-07-24 19:23:38 +0200632 }
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100633 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200634}
635
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200636/* Marks a ready listener as limited so that we only try to re-enable it when
637 * resources are free again. It will be queued into the specified queue.
638 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200639static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200640{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100641 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200642 if (l->state == LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200643 MT_LIST_TRY_APPEND(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200644 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200645 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200646 }
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100647 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200648}
649
Willy Tarreau241797a2019-12-10 14:10:52 +0100650/* Dequeues all listeners waiting for a resource the global wait queue */
651void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200652{
Willy Tarreau01abd022019-02-28 10:27:18 +0100653 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200654
Willy Tarreau241797a2019-12-10 14:10:52 +0100655 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200656 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100657 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200658 */
Aurelien DARRAGONb1918b12023-02-06 17:19:58 +0100659 relax_listener(listener, 0, 0);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200660 }
661}
662
Willy Tarreau241797a2019-12-10 14:10:52 +0100663/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
664void dequeue_proxy_listeners(struct proxy *px)
665{
666 struct listener *listener;
667
668 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
669 /* This cannot fail because the listeners are by definition in
670 * the LI_LIMITED state.
671 */
Aurelien DARRAGONb1918b12023-02-06 17:19:58 +0100672 relax_listener(listener, 0, 0);
Willy Tarreau241797a2019-12-10 14:10:52 +0100673 }
674}
675
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200676
677/* default function used to unbind a listener. This is for use by standard
678 * protocols working on top of accepted sockets. The receiver's rx_unbind()
679 * will automatically be used after the listener is disabled if the socket is
680 * still bound. This must be used under the listener's lock.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100681 */
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200682void default_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100683{
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200684 if (listener->state <= LI_ASSIGNED)
685 goto out_close;
686
687 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200688 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200689 goto out_close;
690 }
691
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200692 if (listener->state >= LI_READY) {
693 listener->rx.proto->disable(listener);
694 if (listener->rx.flags & RX_F_BOUND)
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200695 listener_set_state(listener, LI_LISTEN);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200696 }
697
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200698 out_close:
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200699 if (listener->rx.flags & RX_F_BOUND)
700 listener->rx.proto->rx_unbind(&listener->rx);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200701}
702
703/* This function closes the listening socket for the specified listener,
704 * provided that it's already in a listening state. The protocol's unbind()
705 * is called to put the listener into LI_ASSIGNED or LI_LISTEN and handle
706 * the unbinding tasks. The listener enters then the LI_ASSIGNED state if
707 * the receiver is unbound. Must be called with the lock held.
708 */
709void do_unbind_listener(struct listener *listener)
710{
Willy Tarreau2b718102021-04-21 07:32:39 +0200711 MT_LIST_DELETE(&listener->wait_queue);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200712
713 if (listener->rx.proto->unbind)
714 listener->rx.proto->unbind(listener);
Willy Tarreau374e9af2020-10-09 15:47:17 +0200715
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200716 /* we may have to downgrade the listener if the rx was closed */
717 if (!(listener->rx.flags & RX_F_BOUND) && listener->state > LI_ASSIGNED)
Willy Tarreau374e9af2020-10-09 15:47:17 +0200718 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100719}
720
Olivier Houchard1fc05162017-04-06 01:05:05 +0200721/* This function closes the listening socket for the specified listener,
722 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200723 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
724 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100725 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200726 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100727void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200728{
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100729 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200730 do_unbind_listener(listener);
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100731 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200732}
733
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200734/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
735 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200736 * allocation). The address family is taken from ss->ss_family, and the protocol
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200737 * passed in <proto> must be usable on this family. The protocol's default iocb
738 * is automatically preset as the receivers' iocb. The number of jobs and
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200739 * listeners is automatically increased by the number of listeners created. It
740 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200741 */
742int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200743 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200744{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200745 struct listener *l;
746 int port;
747
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200748 for (port = portl; port <= porth; port++) {
749 l = calloc(1, sizeof(*l));
750 if (!l) {
751 memprintf(err, "out of memory");
752 return 0;
753 }
754 l->obj_type = OBJ_TYPE_LISTENER;
Willy Tarreau2b718102021-04-21 07:32:39 +0200755 LIST_APPEND(&bc->frontend->conf.listeners, &l->by_fe);
756 LIST_APPEND(&bc->listeners, &l->by_bind);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200757 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200758 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200759 l->rx.owner = l;
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200760 l->rx.iocb = proto->default_iocb;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200761 l->rx.fd = fd;
Willy Tarreau07400c52020-12-04 14:49:11 +0100762
Willy Tarreau37159062020-08-27 07:48:42 +0200763 memcpy(&l->rx.addr, ss, sizeof(*ss));
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100764 if (proto->fam->set_port)
765 proto->fam->set_port(&l->rx.addr, port);
Willy Tarreau07400c52020-12-04 14:49:11 +0100766
Olivier Houchard859dc802019-08-08 15:47:21 +0200767 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200768 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200769
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100770 proto->add(proto, l);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200771
Willy Tarreau909c23b2020-09-15 13:50:58 +0200772 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200773 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100774
Amaury Denoyelle7f8f6cb2020-11-10 14:24:31 +0100775 l->extra_counters = NULL;
776
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100777 HA_RWLOCK_INIT(&l->lock);
Willy Tarreau4781b152021-04-06 13:53:36 +0200778 _HA_ATOMIC_INC(&jobs);
779 _HA_ATOMIC_INC(&listeners);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200780 }
781 return 1;
782}
783
Willy Tarreau1a64d162007-10-28 22:26:05 +0100784/* Delete a listener from its protocol's list of listeners. The listener's
785 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200786 * number of listeners is updated, as well as the global number of listeners
787 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200788 * is a low-level function expected to be called with the proto_lock and the
789 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100790 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200791void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100792{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100793 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200794 listener_set_state(listener, LI_INIT);
Willy Tarreau2b718102021-04-21 07:32:39 +0200795 LIST_DELETE(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200796 listener->rx.proto->nb_receivers--;
Willy Tarreau4781b152021-04-06 13:53:36 +0200797 _HA_ATOMIC_DEC(&jobs);
798 _HA_ATOMIC_DEC(&listeners);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100799 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200800}
801
802/* Delete a listener from its protocol's list of listeners (please check
803 * __delete_listener() above). The proto_lock and the listener's lock will
804 * be grabbed in this order.
805 */
806void delete_listener(struct listener *listener)
807{
808 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100809 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200810 __delete_listener(listener);
Willy Tarreauae3f22f2022-02-01 16:23:00 +0100811 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200812 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100813}
814
Willy Tarreaue2711c72019-02-27 15:39:41 +0100815/* Returns a suitable value for a listener's backlog. It uses the listener's,
816 * otherwise the frontend's backlog, otherwise the listener's maxconn,
817 * otherwise the frontend's maxconn, otherwise 1024.
818 */
819int listener_backlog(const struct listener *l)
820{
821 if (l->backlog)
822 return l->backlog;
823
824 if (l->bind_conf->frontend->backlog)
825 return l->bind_conf->frontend->backlog;
826
827 if (l->maxconn)
828 return l->maxconn;
829
830 if (l->bind_conf->frontend->maxconn)
831 return l->bind_conf->frontend->maxconn;
832
833 return 1024;
834}
835
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200836/* This function is called on a read event from a listening socket, corresponding
837 * to an accept. It tries to accept as many connections as possible, and for each
838 * calls the listener's accept handler (generally the frontend's accept handler).
839 */
Willy Tarreaua74cb382020-10-15 21:29:49 +0200840void listener_accept(struct listener *l)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200841{
Willy Tarreau83efc322020-10-14 17:37:17 +0200842 struct connection *cli_conn;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100843 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200844 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100845 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100846 int next_feconn = 0;
847 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200848 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200849 int ret;
850
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100851 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200852
853 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
854 * illimited, but it is probably enough.
855 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100856 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200857
Willy Tarreau93e7c002013-10-07 18:51:07 +0200858 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
859 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200860
861 if (unlikely(!max)) {
862 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200863 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100864 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200865 }
866
867 if (max_accept > max)
868 max_accept = max;
869 }
870
871 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200872 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
873
874 if (unlikely(!max)) {
875 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200876 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100877 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200878 }
879
880 if (max_accept > max)
881 max_accept = max;
882 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200883#ifdef USE_OPENSSL
884 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
885 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200886
Willy Tarreaue43d5322013-10-07 20:01:52 +0200887 if (unlikely(!max)) {
888 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200889 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100890 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200891 }
892
893 if (max_accept > max)
894 max_accept = max;
895 }
896#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200897 if (p && p->fe_sps_lim) {
898 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
899
900 if (unlikely(!max)) {
901 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100902 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
903 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200904 }
905
906 if (max_accept > max)
907 max_accept = max;
908 }
909
910 /* Note: if we fail to allocate a connection because of configured
911 * limits, we'll schedule a new attempt worst 1 second later in the
912 * worst case. If we fail due to system limits or temporary resource
913 * shortage, we try again 100ms later in the worst case.
914 */
Willy Tarreau02757d02021-01-28 18:07:24 +0100915 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200916 unsigned int count;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200917 int status;
Willy Tarreau0aa5a5b2020-10-16 17:43:04 +0200918 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200919
Willy Tarreau82c97892019-02-27 19:32:32 +0100920 /* pre-increase the number of connections without going too far.
921 * We process the listener, then the proxy, then the process.
922 * We know which ones to unroll based on the next_xxx value.
923 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100924 do {
925 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100926 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100927 /* the listener was marked full or another
928 * thread is going to do it.
929 */
930 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100931 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100932 goto end;
933 }
934 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000935 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100936
Willy Tarreau82c97892019-02-27 19:32:32 +0100937 if (p) {
938 do {
939 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100940 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100941 /* the frontend was marked full or another
942 * thread is going to do it.
943 */
944 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100945 expire = TICK_ETERNITY;
946 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100947 }
948 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100949 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200950 }
951
Willy Tarreau82c97892019-02-27 19:32:32 +0100952 if (!(l->options & LI_O_UNLIMITED)) {
953 do {
954 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100955 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100956 /* the process was marked full or another
957 * thread is going to do it.
958 */
959 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100960 expire = tick_add(now_ms, 1000); /* try again in 1 second */
961 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100962 }
963 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000964 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200965 }
966
Willy Tarreaud276ee52022-02-01 16:37:00 +0100967 /* be careful below, the listener might be shutting down in
968 * another thread on error and we must not dereference its
969 * FD without a bit of protection.
970 */
971 cli_conn = NULL;
972 status = CO_AC_PERMERR;
973
974 HA_RWLOCK_RDLOCK(LISTENER_LOCK, &l->lock);
975 if (l->rx.flags & RX_F_BOUND)
976 cli_conn = l->rx.proto->accept_conn(l, &status);
977 HA_RWLOCK_RDUNLOCK(LISTENER_LOCK, &l->lock);
978
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200979 if (!cli_conn) {
980 switch (status) {
981 case CO_AC_DONE:
982 goto end;
Willy Tarreau818dca52014-01-31 19:40:19 +0100983
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200984 case CO_AC_RETRY: /* likely a signal */
Willy Tarreau4781b152021-04-06 13:53:36 +0200985 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100986 if (p)
Willy Tarreau4781b152021-04-06 13:53:36 +0200987 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100988 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +0200989 _HA_ATOMIC_DEC(&actconn);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100990 continue;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200991
992 case CO_AC_YIELD:
Willy Tarreau92079932019-12-10 09:30:05 +0100993 max_accept = 0;
994 goto end;
William Lallemandd9138002018-11-27 12:02:39 +0100995
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200996 default:
997 goto transient_error;
Willy Tarreau83efc322020-10-14 17:37:17 +0200998 }
999 }
1000
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001001 /* The connection was accepted, it must be counted as such */
1002 if (l->counters)
1003 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
1004
Willy Tarreauee3ec402022-05-09 20:41:54 +02001005 if (p) {
Willy Tarreau82c97892019-02-27 19:32:32 +01001006 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
Willy Tarreauee3ec402022-05-09 20:41:54 +02001007 proxy_inc_fe_conn_ctr(l, p);
1008 }
Willy Tarreau82c97892019-02-27 19:32:32 +01001009
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001010 if (!(l->options & LI_O_UNLIMITED)) {
1011 count = update_freq_ctr(&global.conn_per_sec, 1);
1012 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001013 }
1014
Willy Tarreau4781b152021-04-06 13:53:36 +02001015 _HA_ATOMIC_INC(&activity[tid].accepted);
Willy Tarreau64a9c052019-04-12 15:27:17 +02001016
Willy Tarreau9378bbe2020-10-15 10:09:31 +02001017 if (unlikely(cli_conn->handle.fd >= global.maxsock)) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001018 send_log(p, LOG_EMERG,
1019 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
1020 p->id);
Willy Tarreau9378bbe2020-10-15 10:09:31 +02001021 close(cli_conn->handle.fd);
William Dauchy835712a2020-10-18 18:37:43 +02001022 conn_free(cli_conn);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001023 expire = tick_add(now_ms, 1000); /* try again in 1 second */
1024 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001025 }
1026
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001027 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +01001028 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
1029 * allows the error path not to rollback on nbconn. It's more
1030 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001031 */
1032 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +01001033 next_feconn = 0;
1034 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001035
Willy Tarreau83efc322020-10-14 17:37:17 +02001036
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001037#if defined(USE_THREAD)
Willy Tarreau818a92e2020-09-03 07:50:19 +02001038 mask = thread_mask(l->rx.settings->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +01001039 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001040 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001041 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001042
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001043 /* The principle is that we have two running indexes,
1044 * each visiting in turn all threads bound to this
1045 * listener. The connection will be assigned to the one
1046 * with the least connections, and the other one will
1047 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001048 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001049 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001050 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001051
1052 /* keep a copy for the final update. thr_idx is composite
1053 * and made of (t2<<16) + t1.
1054 */
Willy Tarreau0cf33172019-03-06 15:26:33 +01001055 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +01001056 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001057 unsigned long m1, m2;
1058 int q1, q2;
1059
1060 t2 = t1 = t0;
1061 t2 >>= 16;
1062 t1 &= 0xFFFF;
1063
1064 /* t1 walks low to high bits ;
1065 * t2 walks high to low.
1066 */
1067 m1 = mask >> t1;
1068 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
1069
Willy Tarreau85d04242019-04-16 18:09:13 +02001070 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001071 m1 &= ~1UL;
1072 if (!m1) {
1073 m1 = mask;
1074 t1 = 0;
1075 }
1076 t1 += my_ffsl(m1) - 1;
1077 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001078
Willy Tarreau85d04242019-04-16 18:09:13 +02001079 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
1080 /* highest bit not set */
1081 if (!m2)
1082 m2 = mask;
1083
1084 t2 = my_flsl(m2) - 1;
1085 }
1086
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001087 /* now we have two distinct thread IDs belonging to the mask */
1088 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
1089 if (q1 >= ACCEPT_QUEUE_SIZE)
1090 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001091
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001092 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
1093 if (q2 >= ACCEPT_QUEUE_SIZE)
1094 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001095
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001096 /* we have 3 possibilities now :
1097 * q1 < q2 : t1 is less loaded than t2, so we pick it
1098 * and update t2 (since t1 might still be
1099 * lower than another thread)
1100 * q1 > q2 : t2 is less loaded than t1, so we pick it
1101 * and update t1 (since t2 might still be
1102 * lower than another thread)
1103 * q1 = q2 : both are equally loaded, thus we pick t1
1104 * and update t1 as it will become more loaded
1105 * than t2.
1106 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001107
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001108 q1 += l->thr_conn[t1];
1109 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001110
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001111 if (q1 - q2 < 0) {
1112 t = t1;
1113 t2 = t2 ? t2 - 1 : LONGBITS - 1;
1114 }
1115 else if (q1 - q2 > 0) {
1116 t = t2;
1117 t1++;
1118 if (t1 >= LONGBITS)
1119 t1 = 0;
1120 }
1121 else {
1122 t = t1;
1123 t1++;
1124 if (t1 >= LONGBITS)
1125 t1 = 0;
1126 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001127
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001128 /* new value for thr_idx */
1129 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001130 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001131
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001132 /* We successfully selected the best thread "t" for this
1133 * connection. We use deferred accepts even if it's the
1134 * local thread because tests show that it's the best
1135 * performing model, likely due to better cache locality
1136 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001137 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001138 ring = &accept_queue_rings[t];
Willy Tarreau83efc322020-10-14 17:37:17 +02001139 if (accept_queue_push_mp(ring, cli_conn)) {
Willy Tarreau4781b152021-04-06 13:53:36 +02001140 _HA_ATOMIC_INC(&activity[t].accq_pushed);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001141 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001142 continue;
1143 }
1144 /* If the ring is full we do a synchronous accept on
1145 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001146 */
Willy Tarreau4781b152021-04-06 13:53:36 +02001147 _HA_ATOMIC_INC(&activity[t].accq_full);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001148 }
1149#endif // USE_THREAD
1150
Willy Tarreau4781b152021-04-06 13:53:36 +02001151 _HA_ATOMIC_INC(&l->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +02001152 ret = l->accept(cli_conn);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001153 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001154 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001155 * we just have to ignore it (ret == 0) or it's a critical
1156 * error due to a resource shortage, and we must stop the
1157 * listener (ret < 0).
1158 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001159 if (ret == 0) /* successful termination */
1160 continue;
1161
Willy Tarreaubb660302014-05-07 19:47:02 +02001162 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001163 }
1164
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001165 /* increase the per-process number of cumulated sessions, this
1166 * may only be done once l->accept() has accepted the connection.
1167 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001168 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001169 count = update_freq_ctr(&global.sess_per_sec, 1);
1170 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001171 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001172#ifdef USE_OPENSSL
1173 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001174 count = update_freq_ctr(&global.ssl_per_sec, 1);
1175 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001176 }
1177#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001178
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001179 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001180 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001181
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001182 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001183 if (next_conn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001184 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001185
Willy Tarreau82c97892019-02-27 19:32:32 +01001186 if (p && next_feconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001187 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001188
1189 if (next_actconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001190 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001191
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001192 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau02757d02021-01-28 18:07:24 +01001193 (l->state == LI_LIMITED &&
Willy Tarreaucdcba112019-12-11 15:06:30 +01001194 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1195 (!tick_isset(global_listener_queue_task->expire) ||
1196 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001197 /* at least one thread has to this when quitting */
Aurelien DARRAGONb1918b12023-02-06 17:19:58 +01001198 relax_listener(l, 0, 0);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001199
Willy Tarreau02757d02021-01-28 18:07:24 +01001200 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001201 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001202
Olivier Houchard859dc802019-08-08 15:47:21 +02001203 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001204 (!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 +01001205 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001206 }
Willy Tarreau0591bf72019-12-10 12:01:21 +01001207 return;
1208
1209 transient_error:
1210 /* pause the listener for up to 100 ms */
1211 expire = tick_add(now_ms, 100);
1212
Willy Tarreau258b3512020-10-13 17:46:05 +02001213 /* This may be a shared socket that was paused by another process.
1214 * Let's put it to pause in this case.
1215 */
1216 if (l->rx.proto && l->rx.proto->rx_listening(&l->rx) == 0) {
Aurelien DARRAGON8283d592023-02-13 17:45:08 +01001217 suspend_listener(l, 0, 0);
Willy Tarreau258b3512020-10-13 17:46:05 +02001218 goto end;
1219 }
1220
Willy Tarreau0591bf72019-12-10 12:01:21 +01001221 limit_global:
1222 /* (re-)queue the listener to the global queue and set it to expire no
1223 * later than <expire> ahead. The listener turns to LI_LIMITED.
1224 */
1225 limit_listener(l, &global_listener_queue);
Christopher Faulete088fb32022-11-17 14:40:20 +01001226 HA_RWLOCK_RDLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001227 task_schedule(global_listener_queue_task, expire);
Christopher Faulete088fb32022-11-17 14:40:20 +01001228 HA_RWLOCK_RDUNLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001229 goto end;
1230
1231 limit_proxy:
1232 /* (re-)queue the listener to the proxy's queue and set it to expire no
1233 * later than <expire> ahead. The listener turns to LI_LIMITED.
1234 */
1235 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001236 if (p->task && tick_isset(expire))
1237 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001238 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001239}
1240
Willy Tarreau05f50472017-09-15 09:19:58 +02001241/* Notify the listener that a connection initiated from it was released. This
1242 * is used to keep the connection count consistent and to possibly re-open
1243 * listening when it was limited.
1244 */
1245void listener_release(struct listener *l)
1246{
1247 struct proxy *fe = l->bind_conf->frontend;
1248
1249 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +02001250 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001251 if (fe)
Willy Tarreau4781b152021-04-06 13:53:36 +02001252 _HA_ATOMIC_DEC(&fe->feconn);
1253 _HA_ATOMIC_DEC(&l->nbconn);
1254 _HA_ATOMIC_DEC(&l->thr_conn[tid]);
Willy Tarreau82c97892019-02-27 19:32:32 +01001255
1256 if (l->state == LI_FULL || l->state == LI_LIMITED)
Aurelien DARRAGONb1918b12023-02-06 17:19:58 +01001257 relax_listener(l, 0, 0);
Willy Tarreau05f50472017-09-15 09:19:58 +02001258
Willy Tarreau02757d02021-01-28 18:07:24 +01001259 /* Dequeues all of the listeners waiting for a resource */
1260 dequeue_all_listeners();
1261
Aurelien DARRAGON15c43862022-09-12 09:26:21 +02001262 if (fe && !MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001263 (!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 +01001264 dequeue_proxy_listeners(fe);
Christopher Faulet34c38592024-03-12 07:31:56 +01001265 else {
1266 unsigned int wait;
1267 int expire = TICK_ETERNITY;
1268
Christopher Faulet62de60d2024-03-14 09:29:09 +01001269 if (fe->task && fe->fe_sps_lim &&
Christopher Faulet34c38592024-03-12 07:31:56 +01001270 (wait = next_event_delay(&fe->fe_sess_per_sec,fe->fe_sps_lim, 0))) {
1271 /* we're blocking because a limit was reached on the number of
1272 * requests/s on the frontend. We want to re-check ASAP, which
1273 * means in 1 ms before estimated expiration date, because the
1274 * timer will have settled down.
1275 */
1276 expire = tick_first(fe->task->expire, tick_add(now_ms, wait));
Christopher Faulet62de60d2024-03-14 09:29:09 +01001277 if (tick_isset(expire))
Christopher Faulet34c38592024-03-12 07:31:56 +01001278 task_schedule(fe->task, expire);
1279 }
1280 }
Willy Tarreau05f50472017-09-15 09:19:58 +02001281}
1282
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001283/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1284static int listener_queue_init()
1285{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001286 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1287 if (!global_listener_queue_task) {
1288 ha_alert("Out of memory when initializing global listener queue\n");
1289 return ERR_FATAL|ERR_ABORT;
1290 }
1291 /* very simple initialization, users will queue the task if needed */
1292 global_listener_queue_task->context = NULL; /* not even a context! */
1293 global_listener_queue_task->process = manage_global_listener_queue;
Christopher Faulete088fb32022-11-17 14:40:20 +01001294 HA_RWLOCK_INIT(&global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001295
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001296 return 0;
1297}
1298
1299static void listener_queue_deinit()
1300{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001301 task_destroy(global_listener_queue_task);
1302 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001303}
1304
1305REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1306REGISTER_POST_DEINIT(listener_queue_deinit);
1307
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001308
1309/* This is the global management task for listeners. It enables listeners waiting
1310 * for global resources when there are enough free resource, or at least once in
Willy Tarreaud597ec22021-01-29 14:29:06 +01001311 * a while. It is designed to be called as a task. It's exported so that it's easy
1312 * to spot in "show tasks" or "show profiling".
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001313 */
Willy Tarreau144f84a2021-03-02 16:09:26 +01001314struct task *manage_global_listener_queue(struct task *t, void *context, unsigned int state)
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001315{
1316 /* If there are still too many concurrent connections, let's wait for
1317 * some of them to go away. We don't need to re-arm the timer because
1318 * each of them will scan the queue anyway.
1319 */
1320 if (unlikely(actconn >= global.maxconn))
1321 goto out;
1322
1323 /* We should periodically try to enable listeners waiting for a global
1324 * resource here, because it is possible, though very unlikely, that
1325 * they have been blocked by a temporary lack of global resource such
1326 * as a file descriptor or memory and that the temporary condition has
1327 * disappeared.
1328 */
1329 dequeue_all_listeners();
1330
1331 out:
Christopher Faulete088fb32022-11-17 14:40:20 +01001332 HA_RWLOCK_WRLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001333 t->expire = TICK_ETERNITY;
Christopher Faulete088fb32022-11-17 14:40:20 +01001334 HA_RWLOCK_WRUNLOCK(LISTENER_LOCK, &global_listener_rwlock);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001335 task_queue(t);
1336 return t;
1337}
1338
Willy Tarreau26982662012-09-12 23:17:10 +02001339/*
1340 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1341 * parsing sessions.
1342 */
1343void bind_register_keywords(struct bind_kw_list *kwl)
1344{
Willy Tarreau2b718102021-04-21 07:32:39 +02001345 LIST_APPEND(&bind_keywords.list, &kwl->list);
Willy Tarreau26982662012-09-12 23:17:10 +02001346}
1347
1348/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1349 * keyword is found with a NULL ->parse() function, then an attempt is made to
1350 * find one with a valid ->parse() function. This way it is possible to declare
1351 * platform-dependant, known keywords as NULL, then only declare them as valid
1352 * if some options are met. Note that if the requested keyword contains an
1353 * opening parenthesis, everything from this point is ignored.
1354 */
1355struct bind_kw *bind_find_kw(const char *kw)
1356{
1357 int index;
1358 const char *kwend;
1359 struct bind_kw_list *kwl;
1360 struct bind_kw *ret = NULL;
1361
1362 kwend = strchr(kw, '(');
1363 if (!kwend)
1364 kwend = kw + strlen(kw);
1365
1366 list_for_each_entry(kwl, &bind_keywords.list, list) {
1367 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1368 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1369 kwl->kw[index].kw[kwend-kw] == 0) {
1370 if (kwl->kw[index].parse)
1371 return &kwl->kw[index]; /* found it !*/
1372 else
1373 ret = &kwl->kw[index]; /* may be OK */
1374 }
1375 }
1376 }
1377 return ret;
1378}
1379
Willy Tarreau8638f482012-09-18 18:01:17 +02001380/* Dumps all registered "bind" keywords to the <out> string pointer. The
1381 * unsupported keywords are only dumped if their supported form was not
1382 * found.
1383 */
1384void bind_dump_kws(char **out)
1385{
1386 struct bind_kw_list *kwl;
1387 int index;
1388
Christopher Faulet784063e2020-05-18 12:14:18 +02001389 if (!out)
1390 return;
1391
Willy Tarreau8638f482012-09-18 18:01:17 +02001392 *out = NULL;
1393 list_for_each_entry(kwl, &bind_keywords.list, list) {
1394 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1395 if (kwl->kw[index].parse ||
1396 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001397 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1398 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001399 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001400 kwl->kw[index].skip ? " <arg>" : "",
1401 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001402 }
1403 }
1404 }
1405}
1406
Willy Tarreau433b05f2021-03-12 10:14:07 +01001407/* Try to find in srv_keyword the word that looks closest to <word> by counting
1408 * transitions between letters, digits and other characters. Will return the
1409 * best matching word if found, otherwise NULL.
1410 */
1411const char *bind_find_best_kw(const char *word)
1412{
1413 uint8_t word_sig[1024];
1414 uint8_t list_sig[1024];
1415 const struct bind_kw_list *kwl;
1416 const char *best_ptr = NULL;
1417 int dist, best_dist = INT_MAX;
1418 int index;
1419
1420 make_word_fingerprint(word_sig, word);
1421 list_for_each_entry(kwl, &bind_keywords.list, list) {
1422 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1423 make_word_fingerprint(list_sig, kwl->kw[index].kw);
1424 dist = word_fingerprint_distance(word_sig, list_sig);
1425 if (dist < best_dist) {
1426 best_dist = dist;
1427 best_ptr = kwl->kw[index].kw;
1428 }
1429 }
1430 }
1431
1432 if (best_dist > 2 * strlen(word) || (best_ptr && best_dist > 2 * strlen(best_ptr)))
1433 best_ptr = NULL;
1434
1435 return best_ptr;
1436}
1437
Willy Tarreau645513a2010-05-24 20:55:15 +02001438/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001439/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001440/************************************************************************/
1441
Willy Tarreaua5e37562011-12-16 17:06:15 +01001442/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001443static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001444smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001445{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001446 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001447 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001448 return 1;
1449}
1450
Willy Tarreaua5e37562011-12-16 17:06:15 +01001451/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001452static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001453smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001454{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001455 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001456 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001457 return 1;
1458}
Jerome Magnineb421b22020-03-27 22:08:40 +01001459static int
1460smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1461{
1462 smp->data.u.str.area = smp->sess->listener->name;
1463 if (!smp->data.u.str.area)
1464 return 0;
1465
1466 smp->data.type = SMP_T_STR;
1467 smp->flags = SMP_F_CONST;
1468 smp->data.u.str.data = strlen(smp->data.u.str.area);
1469 return 1;
1470}
Willy Tarreau645513a2010-05-24 20:55:15 +02001471
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001472/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001473static 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 +02001474{
1475 struct listener *l;
1476
Willy Tarreau4348fad2012-09-20 16:48:07 +02001477 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001478 l->options |= LI_O_ACC_PROXY;
1479
1480 return 0;
1481}
1482
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001483/* parse the "accept-netscaler-cip" bind keyword */
1484static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1485{
1486 struct listener *l;
1487 uint32_t val;
1488
1489 if (!*args[cur_arg + 1]) {
1490 memprintf(err, "'%s' : missing value", args[cur_arg]);
1491 return ERR_ALERT | ERR_FATAL;
1492 }
1493
1494 val = atol(args[cur_arg + 1]);
1495 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001496 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001497 return ERR_ALERT | ERR_FATAL;
1498 }
1499
1500 list_for_each_entry(l, &conf->listeners, by_bind) {
1501 l->options |= LI_O_ACC_CIP;
1502 conf->ns_cip_magic = val;
1503 }
1504
1505 return 0;
1506}
1507
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001508/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001509static 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 +02001510{
1511 struct listener *l;
1512 int val;
1513
1514 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001515 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001516 return ERR_ALERT | ERR_FATAL;
1517 }
1518
1519 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001520 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001521 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001522 return ERR_ALERT | ERR_FATAL;
1523 }
1524
Willy Tarreau4348fad2012-09-20 16:48:07 +02001525 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001526 l->backlog = val;
1527
1528 return 0;
1529}
1530
1531/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001532static 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 +02001533{
1534 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001535 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001536 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001537
Willy Tarreau4348fad2012-09-20 16:48:07 +02001538 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001539 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001540 return ERR_ALERT | ERR_FATAL;
1541 }
1542
1543 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001544 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001545 return ERR_ALERT | ERR_FATAL;
1546 }
1547
Willy Tarreau4348fad2012-09-20 16:48:07 +02001548 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001549 new->luid = strtol(args[cur_arg + 1], &error, 10);
1550 if (*error != '\0') {
1551 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1552 return ERR_ALERT | ERR_FATAL;
1553 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001554 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001555
Willy Tarreau4348fad2012-09-20 16:48:07 +02001556 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001557 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001558 return ERR_ALERT | ERR_FATAL;
1559 }
1560
Willy Tarreau4348fad2012-09-20 16:48:07 +02001561 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001562 if (node) {
1563 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001564 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1565 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1566 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001567 return ERR_ALERT | ERR_FATAL;
1568 }
1569
Willy Tarreau4348fad2012-09-20 16:48:07 +02001570 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001571 return 0;
1572}
1573
1574/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001575static 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 +02001576{
1577 struct listener *l;
1578 int val;
1579
1580 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001581 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001582 return ERR_ALERT | ERR_FATAL;
1583 }
1584
1585 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001586 if (val < 0) {
1587 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001588 return ERR_ALERT | ERR_FATAL;
1589 }
1590
Willy Tarreau4348fad2012-09-20 16:48:07 +02001591 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001592 l->maxconn = val;
1593
1594 return 0;
1595}
1596
1597/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001598static 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 +02001599{
1600 struct listener *l;
1601
1602 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001603 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001604 return ERR_ALERT | ERR_FATAL;
1605 }
1606
Willy Tarreau4348fad2012-09-20 16:48:07 +02001607 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001608 l->name = strdup(args[cur_arg + 1]);
1609
1610 return 0;
1611}
1612
1613/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001614static 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 +02001615{
1616 struct listener *l;
1617 int val;
1618
1619 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001620 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001621 return ERR_ALERT | ERR_FATAL;
1622 }
1623
1624 val = atol(args[cur_arg + 1]);
1625 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001626 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001627 return ERR_ALERT | ERR_FATAL;
1628 }
1629
Willy Tarreau4348fad2012-09-20 16:48:07 +02001630 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001631 l->nice = val;
1632
1633 return 0;
1634}
1635
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001636/* parse the "process" bind keyword */
1637static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1638{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001639 char *slash;
1640 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001641
Christopher Fauletc644fa92017-11-23 22:44:11 +01001642 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1643 *slash = 0;
1644
Willy Tarreauff9c9142019-02-07 10:39:36 +01001645 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001646 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001647 return ERR_ALERT | ERR_FATAL;
1648 }
1649
Christopher Fauletc644fa92017-11-23 22:44:11 +01001650 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001651 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001652 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1653 return ERR_ALERT | ERR_FATAL;
1654 }
1655 *slash = '/';
1656 }
1657
Willy Tarreaue26993c2020-09-03 07:18:55 +02001658 conf->settings.bind_proc |= proc;
1659 conf->settings.bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001660 return 0;
1661}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001662
Christopher Fauleta717b992018-04-10 14:43:00 +02001663/* parse the "proto" bind keyword */
1664static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1665{
1666 struct ist proto;
1667
1668 if (!*args[cur_arg + 1]) {
1669 memprintf(err, "'%s' : missing value", args[cur_arg]);
1670 return ERR_ALERT | ERR_FATAL;
1671 }
1672
Tim Duesterhusdcf753a2021-03-04 17:31:47 +01001673 proto = ist(args[cur_arg + 1]);
Christopher Fauleta717b992018-04-10 14:43:00 +02001674 conf->mux_proto = get_mux_proto(proto);
1675 if (!conf->mux_proto) {
1676 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1677 return ERR_ALERT | ERR_FATAL;
1678 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001679 return 0;
1680}
1681
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001682/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1683static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
Willy Tarreau01825162021-03-09 09:53:46 +01001684 const struct proxy *defpx, const char *file, int line,
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001685 char **err)
1686{
1687 if (too_many_args(1, args, err, NULL))
1688 return -1;
1689
1690 if (strcmp(args[1], "on") == 0)
1691 global.tune.options |= GTUNE_LISTENER_MQ;
1692 else if (strcmp(args[1], "off") == 0)
1693 global.tune.options &= ~GTUNE_LISTENER_MQ;
1694 else {
1695 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1696 return -1;
1697 }
1698 return 0;
1699}
1700
Willy Tarreau61612d42012-04-19 18:42:05 +02001701/* Note: must not be declared <const> as its list will be overwritten.
1702 * Please take care of keeping this list alphabetically sorted.
1703 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001704static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001705 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1706 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001707 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001708 { /* END */ },
1709}};
1710
Willy Tarreau0108d902018-11-25 19:14:37 +01001711INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1712
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001713/* Note: must not be declared <const> as its list will be overwritten.
1714 * Please take care of keeping this list alphabetically sorted.
1715 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001716static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001717 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001718}};
1719
Willy Tarreau0108d902018-11-25 19:14:37 +01001720INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1721
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001722/* Note: must not be declared <const> as its list will be overwritten.
1723 * Please take care of keeping this list alphabetically sorted, doing so helps
1724 * all code contributors.
1725 * Optional keywords are also declared with a NULL ->parse() function so that
1726 * the config parser can report an appropriate error when a known keyword was
1727 * not enabled.
1728 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001729static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001730 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001731 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1732 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1733 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1734 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1735 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1736 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001737 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001738 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001739 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001740}};
1741
Willy Tarreau0108d902018-11-25 19:14:37 +01001742INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1743
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001744/* config keyword parsers */
1745static struct cfg_kw_list cfg_kws = {ILH, {
1746 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1747 { 0, NULL, NULL }
1748}};
1749
1750INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1751
Willy Tarreau645513a2010-05-24 20:55:15 +02001752/*
1753 * Local variables:
1754 * c-indent-level: 8
1755 * c-basic-offset: 8
1756 * End:
1757 */