blob: c4be8dd0a02f02b9314f597b39030b359958d204 [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 Tarreau5d9ddc52021-10-06 19:54:09 +020022#include <haproxy/activity.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020023#include <haproxy/cfgparse.h>
Willy Tarreaudbf78022021-10-06 09:05:08 +020024#include <haproxy/cli-t.h>
Willy Tarreau7ea393d2020-06-04 18:02:10 +020025#include <haproxy/connection.h>
Willy Tarreau8d366972020-05-27 16:10:29 +020026#include <haproxy/errors.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020027#include <haproxy/fd.h>
28#include <haproxy/freq_ctr.h>
Willy Tarreauf268ee82020-06-04 17:05:57 +020029#include <haproxy/global.h>
Willy Tarreau853b2972020-05-27 18:01:47 +020030#include <haproxy/list.h>
Willy Tarreau213e9902020-06-04 14:58:24 +020031#include <haproxy/listener.h>
Willy Tarreauaeed4a82020-06-04 22:01:04 +020032#include <haproxy/log.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020033#include <haproxy/protocol.h>
Willy Tarreau5958c432021-05-08 20:30:37 +020034#include <haproxy/proxy.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020035#include <haproxy/sample.h>
Willy Tarreaudfd3de82020-06-04 23:46:14 +020036#include <haproxy/stream.h>
Willy Tarreaucea0e1b2020-06-04 17:25:40 +020037#include <haproxy/task.h>
Willy Tarreau9310f482021-10-06 16:18:40 +020038#include <haproxy/ticks.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020039#include <haproxy/tools.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020040
Willy Tarreaub648d632007-10-28 22:13:50 +010041
Willy Tarreau26982662012-09-12 23:17:10 +020042/* List head of all known bind keywords */
43static struct bind_kw_list bind_keywords = {
44 .list = LIST_HEAD_INIT(bind_keywords.list)
45};
46
Willy Tarreaua1d97f82019-12-10 11:18:41 +010047/* list of the temporarily limited listeners because of lack of resource */
48static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
49static struct task *global_listener_queue_task;
Willy Tarreaua1d97f82019-12-10 11:18:41 +010050
William Dauchy3679d0c2021-02-14 23:22:55 +010051/* listener status for stats */
52const char* li_status_st[LI_STATE_COUNT] = {
53 [LI_STATUS_WAITING] = "WAITING",
54 [LI_STATUS_OPEN] = "OPEN",
55 [LI_STATUS_FULL] = "FULL",
56};
Willy Tarreaua1d97f82019-12-10 11:18:41 +010057
Willy Tarreau1efafce2019-01-27 15:37:19 +010058#if defined(USE_THREAD)
59
60struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
61
62/* dequeue and process a pending connection from the local accept queue (single
Willy Tarreau83efc322020-10-14 17:37:17 +020063 * consumer). Returns the accepted connection or NULL if none was found.
Willy Tarreau1efafce2019-01-27 15:37:19 +010064 */
Willy Tarreau83efc322020-10-14 17:37:17 +020065struct connection *accept_queue_pop_sc(struct accept_queue_ring *ring)
Willy Tarreau1efafce2019-01-27 15:37:19 +010066{
Willy Tarreau1efafce2019-01-27 15:37:19 +010067 unsigned int pos, next;
Willy Tarreau83efc322020-10-14 17:37:17 +020068 struct connection *ptr;
69 struct connection **e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010070
71 pos = ring->head;
72
73 if (pos == ring->tail)
Willy Tarreau83efc322020-10-14 17:37:17 +020074 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010075
76 next = pos + 1;
77 if (next >= ACCEPT_QUEUE_SIZE)
78 next = 0;
79
80 e = &ring->entry[pos];
81
82 /* wait for the producer to update the listener's pointer */
83 while (1) {
Willy Tarreau83efc322020-10-14 17:37:17 +020084 ptr = *e;
Willy Tarreau1efafce2019-01-27 15:37:19 +010085 __ha_barrier_load();
86 if (ptr)
87 break;
88 pl_cpu_relax();
89 }
90
Willy Tarreau1efafce2019-01-27 15:37:19 +010091 /* release the entry */
Willy Tarreau83efc322020-10-14 17:37:17 +020092 *e = NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +010093
94 __ha_barrier_store();
95 ring->head = next;
Willy Tarreau83efc322020-10-14 17:37:17 +020096 return ptr;
Willy Tarreau1efafce2019-01-27 15:37:19 +010097}
98
99
Willy Tarreau83efc322020-10-14 17:37:17 +0200100/* tries to push a new accepted connection <conn> into ring <ring>. Returns
101 * non-zero if it succeeds, or zero if the ring is full. Supports multiple
102 * producers.
Willy Tarreau1efafce2019-01-27 15:37:19 +0100103 */
Willy Tarreau83efc322020-10-14 17:37:17 +0200104int accept_queue_push_mp(struct accept_queue_ring *ring, struct connection *conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100105{
Willy Tarreau1efafce2019-01-27 15:37:19 +0100106 unsigned int pos, next;
107
108 pos = ring->tail;
109 do {
110 next = pos + 1;
111 if (next >= ACCEPT_QUEUE_SIZE)
112 next = 0;
113 if (next == ring->head)
114 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100115 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100116
Willy Tarreau83efc322020-10-14 17:37:17 +0200117 ring->entry[pos] = conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100118 __ha_barrier_store();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100119 return 1;
120}
121
Willy Tarreaufb5401f2021-01-29 12:25:23 +0100122/* proceed with accepting new connections. Don't mark it static so that it appears
123 * in task dumps.
124 */
Willy Tarreau144f84a2021-03-02 16:09:26 +0100125struct task *accept_queue_process(struct task *t, void *context, unsigned int state)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100126{
127 struct accept_queue_ring *ring = context;
Willy Tarreau83efc322020-10-14 17:37:17 +0200128 struct connection *conn;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100129 struct listener *li;
Christopher Faulet102854c2019-04-30 12:17:13 +0200130 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100131 int ret;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100132
Christopher Faulet102854c2019-04-30 12:17:13 +0200133 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
134 * is not really illimited, but it is probably enough.
135 */
Willy Tarreau66161322021-02-19 15:50:27 +0100136 max_accept = global.tune.maxaccept ? global.tune.maxaccept : MAX_ACCEPT;
Christopher Faulet102854c2019-04-30 12:17:13 +0200137 for (; max_accept; max_accept--) {
Willy Tarreau83efc322020-10-14 17:37:17 +0200138 conn = accept_queue_pop_sc(ring);
139 if (!conn)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100140 break;
141
Willy Tarreau83efc322020-10-14 17:37:17 +0200142 li = __objt_listener(conn->target);
Willy Tarreau4781b152021-04-06 13:53:36 +0200143 _HA_ATOMIC_INC(&li->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +0200144 ret = li->accept(conn);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100145 if (ret <= 0) {
146 /* connection was terminated by the application */
147 continue;
148 }
149
150 /* increase the per-process number of cumulated sessions, this
151 * may only be done once l->accept() has accepted the connection.
152 */
153 if (!(li->options & LI_O_UNLIMITED)) {
154 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
155 update_freq_ctr(&global.sess_per_sec, 1));
156 if (li->bind_conf && li->bind_conf->is_ssl) {
157 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
158 update_freq_ctr(&global.ssl_per_sec, 1));
159 }
160 }
161 }
162
163 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200164 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200165 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100166
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200167 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100168}
169
170/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
171static int accept_queue_init()
172{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200173 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100174 int i;
175
176 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200177 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100178 if (!t) {
179 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
180 return ERR_FATAL|ERR_ABORT;
181 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200182 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100183 t->process = accept_queue_process;
184 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200185 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100186 }
187 return 0;
188}
189
190REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
191
192#endif // USE_THREAD
193
William Dauchy3679d0c2021-02-14 23:22:55 +0100194/* helper to get listener status for stats */
195enum li_status get_li_status(struct listener *l)
196{
197 if (!l->maxconn || l->nbconn < l->maxconn) {
198 if (l->state == LI_LIMITED)
199 return LI_STATUS_WAITING;
200 else
201 return LI_STATUS_OPEN;
202 }
203 return LI_STATUS_FULL;
204}
205
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200206/* adjust the listener's state and its proxy's listener counters if needed.
207 * It must be called under the listener's lock, but uses atomic ops to change
208 * the proxy's counters so that the proxy lock is not needed.
209 */
Willy Tarreaua37b2442020-09-24 07:23:45 +0200210void listener_set_state(struct listener *l, enum li_state st)
211{
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200212 struct proxy *px = l->bind_conf->frontend;
213
214 if (px) {
215 /* from state */
216 switch (l->state) {
217 case LI_NEW: /* first call */
Willy Tarreau4781b152021-04-06 13:53:36 +0200218 _HA_ATOMIC_INC(&px->li_all);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200219 break;
220 case LI_INIT:
221 case LI_ASSIGNED:
222 break;
223 case LI_PAUSED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200224 _HA_ATOMIC_DEC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200225 break;
226 case LI_LISTEN:
Willy Tarreau4781b152021-04-06 13:53:36 +0200227 _HA_ATOMIC_DEC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200228 break;
229 case LI_READY:
230 case LI_FULL:
231 case LI_LIMITED:
Willy Tarreau4781b152021-04-06 13:53:36 +0200232 _HA_ATOMIC_DEC(&px->li_ready);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200233 break;
234 }
235
236 /* to state */
237 switch (st) {
238 case LI_NEW:
239 case LI_INIT:
240 case LI_ASSIGNED:
241 break;
242 case LI_PAUSED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200243 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200244 _HA_ATOMIC_INC(&px->li_paused);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200245 break;
246 case LI_LISTEN:
Willy Tarreau95a34602020-10-08 15:32:21 +0200247 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200248 _HA_ATOMIC_INC(&px->li_bound);
Willy Tarreauefc0eec2020-09-24 07:27:06 +0200249 break;
250 case LI_READY:
251 case LI_FULL:
252 case LI_LIMITED:
Willy Tarreau95a34602020-10-08 15:32:21 +0200253 BUG_ON(l->rx.fd == -1);
Willy Tarreau4781b152021-04-06 13:53:36 +0200254 _HA_ATOMIC_INC(&px->li_ready);
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{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100269 HA_SPIN_LOCK(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 Tarreau72faef32021-06-15 08:36:30 +0200281 (!!master != !!(listener->rx.flags & RX_F_MWORKER))) {
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
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100296 HA_SPIN_UNLOCK(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
301 * proxy's lock, the protocol's lock, and the listener's lock. The caller is
302 * responsible for indicating in lpx, lpr, lli whether the respective locks are
303 * already held (non-zero) or not (zero) so that the function picks the missing
304 * ones, in this order. The proxy's listeners count is updated and the proxy is
305 * disabled and woken up after the last one is gone.
306 */
307void stop_listener(struct listener *l, int lpx, int lpr, int lli)
308{
309 struct proxy *px = l->bind_conf->frontend;
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200310
311 if (l->options & LI_O_NOSTOP) {
312 /* master-worker sockpairs are never closed but don't count as a
313 * job.
314 */
315 return;
316 }
317
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200318 if (!lpx)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200319 HA_RWLOCK_WRLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200320
321 if (!lpr)
322 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
323
324 if (!lli)
325 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
326
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
336 if (!lli)
337 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
338
339 if (!lpr)
340 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
341
342 if (!lpx)
Willy Tarreauac66d6b2020-10-20 17:24:27 +0200343 HA_RWLOCK_WRUNLOCK(PROXY_LOCK, &px->lock);
Willy Tarreaucaa7df12020-10-07 15:58:50 +0200344}
345
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100346/* This function adds the specified <listener> to the protocol <proto>. It
347 * does nothing if the protocol was already added. The listener's state is
348 * automatically updated from LI_INIT to LI_ASSIGNED. The number of listeners
349 * for the protocol is updated. This must be called with the proto lock held.
350 */
351void default_add_listener(struct protocol *proto, struct listener *listener)
352{
353 if (listener->state != LI_INIT)
354 return;
355 listener_set_state(listener, LI_ASSIGNED);
356 listener->rx.proto = proto;
Willy Tarreau2b718102021-04-21 07:32:39 +0200357 LIST_APPEND(&proto->receivers, &listener->rx.proto_list);
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100358 proto->nb_receivers++;
359}
360
Willy Tarreaue03204c2020-10-09 17:02:21 +0200361/* default function called to suspend a listener: it simply passes the call to
362 * the underlying receiver. This is find for most socket-based protocols. This
363 * must be called under the listener's lock. It will return non-zero on success,
364 * 0 on failure. If no receiver-level suspend is provided, the operation is
365 * assumed to succeed.
366 */
367int default_suspend_listener(struct listener *l)
368{
369 int ret = 1;
370
371 if (!l->rx.proto->rx_suspend)
372 return 1;
373
374 ret = l->rx.proto->rx_suspend(&l->rx);
375 return ret > 0 ? ret : 0;
376}
377
378
379/* Tries to resume a suspended listener, and returns non-zero on success or
380 * zero on failure. On certain errors, an alert or a warning might be displayed.
381 * It must be called with the listener's lock held. Depending on the listener's
382 * state and protocol, a listen() call might be used to resume operations, or a
383 * call to the receiver's resume() function might be used as well. This is
384 * suitable as a default function for TCP and UDP. This must be called with the
385 * listener's lock held.
386 */
387int default_resume_listener(struct listener *l)
388{
389 int ret = 1;
390
391 if (l->state == LI_ASSIGNED) {
392 char msg[100];
393 int err;
394
395 err = l->rx.proto->listen(l, msg, sizeof(msg));
396 if (err & ERR_ALERT)
397 ha_alert("Resuming listener: %s\n", msg);
398 else if (err & ERR_WARN)
399 ha_warning("Resuming listener: %s\n", msg);
400
401 if (err & (ERR_FATAL | ERR_ABORT)) {
402 ret = 0;
403 goto end;
404 }
405 }
406
407 if (l->state < LI_PAUSED) {
408 ret = 0;
409 goto end;
410 }
411
412 if (l->state == LI_PAUSED && l->rx.proto->rx_resume &&
413 l->rx.proto->rx_resume(&l->rx) <= 0)
414 ret = 0;
415 end:
416 return ret;
417}
418
419
Willy Tarreaube58c382011-07-24 18:28:10 +0200420/* This function tries to temporarily disable a listener, depending on the OS
421 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
422 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
423 * closes upon SHUT_WR and refuses to rebind. So a common validation path
424 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
425 * is disabled. It normally returns non-zero, unless an error is reported.
426 */
427int pause_listener(struct listener *l)
428{
Willy Tarreau58651b42020-09-24 16:03:29 +0200429 struct proxy *px = l->bind_conf->frontend;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200430 int ret = 1;
431
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100432 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200433
Willy Tarreau9b3a9322020-09-24 14:46:34 +0200434 if (l->state <= LI_PAUSED)
435 goto end;
436
Willy Tarreaue03204c2020-10-09 17:02:21 +0200437 if (l->rx.proto->suspend)
438 ret = l->rx.proto->suspend(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200439
Willy Tarreau2b718102021-04-21 07:32:39 +0200440 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200441
Willy Tarreaua37b2442020-09-24 07:23:45 +0200442 listener_set_state(l, LI_PAUSED);
Willy Tarreau58651b42020-09-24 16:03:29 +0200443
444 if (px && !px->li_ready) {
445 ha_warning("Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
446 send_log(px, LOG_WARNING, "Paused %s %s.\n", proxy_cap_str(px->cap), px->id);
447 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200448 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100449 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200450 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200451}
452
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200453/* This function tries to resume a temporarily disabled listener. Paused, full,
454 * limited and disabled listeners are handled, which means that this function
455 * may replace enable_listener(). The resulting state will either be LI_READY
456 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200457 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200458 * foreground mode, and are ignored. If the listener was only in the assigned
459 * state, it's totally rebound. This can happen if a pause() has completely
460 * stopped it. If the resume fails, 0 is returned and an error might be
461 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200462 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100463int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200464{
Willy Tarreau58651b42020-09-24 16:03:29 +0200465 struct proxy *px = l->bind_conf->frontend;
466 int was_paused = px && px->li_paused;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200467 int ret = 1;
468
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100469 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200470
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200471 /* check that another thread didn't to the job in parallel (e.g. at the
472 * end of listen_accept() while we'd come from dequeue_all_listeners().
473 */
Willy Tarreau2b718102021-04-21 07:32:39 +0200474 if (MT_LIST_INLIST(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200475 goto end;
476
Willy Tarreau5d7f9ce2020-09-24 18:54:11 +0200477 if (l->state == LI_READY)
478 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200479
Willy Tarreaue03204c2020-10-09 17:02:21 +0200480 if (l->rx.proto->resume)
481 ret = l->rx.proto->resume(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200482
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100483 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200484 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200485 listener_set_state(l, LI_FULL);
Willy Tarreau58651b42020-09-24 16:03:29 +0200486 goto done;
Willy Tarreaube58c382011-07-24 18:28:10 +0200487 }
488
Willy Tarreau4b51f422020-09-25 20:32:28 +0200489 l->rx.proto->enable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200490 listener_set_state(l, LI_READY);
Willy Tarreau58651b42020-09-24 16:03:29 +0200491
492 done:
493 if (was_paused && !px->li_paused) {
494 ha_warning("Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
495 send_log(px, LOG_WARNING, "Resumed %s %s.\n", proxy_cap_str(px->cap), px->id);
496 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200497 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100498 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200499 return ret;
500}
501
Willy Tarreau87b09662015-04-03 00:22:06 +0200502/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200503 * it upon next close() using resume_listener().
504 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200505static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200506{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100507 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200508 if (l->state >= LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200509 MT_LIST_DELETE(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100510 if (l->state != LI_FULL) {
Willy Tarreau4b51f422020-09-25 20:32:28 +0200511 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200512 listener_set_state(l, LI_FULL);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100513 }
Willy Tarreau62793712011-07-24 19:23:38 +0200514 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100515 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200516}
517
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200518/* Marks a ready listener as limited so that we only try to re-enable it when
519 * resources are free again. It will be queued into the specified queue.
520 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200521static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200522{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100523 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200524 if (l->state == LI_READY) {
Willy Tarreau2b718102021-04-21 07:32:39 +0200525 MT_LIST_TRY_APPEND(list, &l->wait_queue);
Willy Tarreau4b51f422020-09-25 20:32:28 +0200526 l->rx.proto->disable(l);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200527 listener_set_state(l, LI_LIMITED);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200528 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100529 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200530}
531
Willy Tarreau241797a2019-12-10 14:10:52 +0100532/* Dequeues all listeners waiting for a resource the global wait queue */
533void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200534{
Willy Tarreau01abd022019-02-28 10:27:18 +0100535 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200536
Willy Tarreau241797a2019-12-10 14:10:52 +0100537 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200538 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100539 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200540 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100541 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200542 }
543}
544
Willy Tarreau241797a2019-12-10 14:10:52 +0100545/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
546void dequeue_proxy_listeners(struct proxy *px)
547{
548 struct listener *listener;
549
550 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
551 /* This cannot fail because the listeners are by definition in
552 * the LI_LIMITED state.
553 */
554 resume_listener(listener);
555 }
556}
557
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200558
559/* default function used to unbind a listener. This is for use by standard
560 * protocols working on top of accepted sockets. The receiver's rx_unbind()
561 * will automatically be used after the listener is disabled if the socket is
562 * still bound. This must be used under the listener's lock.
Christopher Faulet510c0d62018-03-16 10:04:47 +0100563 */
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200564void default_unbind_listener(struct listener *listener)
Willy Tarreaub648d632007-10-28 22:13:50 +0100565{
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200566 if (listener->state <= LI_ASSIGNED)
567 goto out_close;
568
569 if (listener->rx.fd == -1) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200570 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200571 goto out_close;
572 }
573
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200574 if (listener->state >= LI_READY) {
575 listener->rx.proto->disable(listener);
576 if (listener->rx.flags & RX_F_BOUND)
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200577 listener_set_state(listener, LI_LISTEN);
Willy Tarreaub6607bf2020-09-23 16:24:23 +0200578 }
579
Willy Tarreau87acd4e2020-10-08 15:36:46 +0200580 out_close:
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200581 if (listener->rx.flags & RX_F_BOUND)
582 listener->rx.proto->rx_unbind(&listener->rx);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200583}
584
585/* This function closes the listening socket for the specified listener,
586 * provided that it's already in a listening state. The protocol's unbind()
587 * is called to put the listener into LI_ASSIGNED or LI_LISTEN and handle
588 * the unbinding tasks. The listener enters then the LI_ASSIGNED state if
589 * the receiver is unbound. Must be called with the lock held.
590 */
591void do_unbind_listener(struct listener *listener)
592{
Willy Tarreau2b718102021-04-21 07:32:39 +0200593 MT_LIST_DELETE(&listener->wait_queue);
Willy Tarreau7b2febd2020-10-09 17:18:29 +0200594
595 if (listener->rx.proto->unbind)
596 listener->rx.proto->unbind(listener);
Willy Tarreau374e9af2020-10-09 15:47:17 +0200597
Willy Tarreauf58b8db2020-10-09 16:32:08 +0200598 /* we may have to downgrade the listener if the rx was closed */
599 if (!(listener->rx.flags & RX_F_BOUND) && listener->state > LI_ASSIGNED)
Willy Tarreau374e9af2020-10-09 15:47:17 +0200600 listener_set_state(listener, LI_ASSIGNED);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100601}
602
Olivier Houchard1fc05162017-04-06 01:05:05 +0200603/* This function closes the listening socket for the specified listener,
604 * provided that it's already in a listening state. The listener enters the
Willy Tarreau75c98d12020-10-09 15:55:23 +0200605 * LI_ASSIGNED state, except if the FD is not closed, in which case it may
606 * remain in LI_LISTEN. This function is intended to be used as a generic
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100607 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200608 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100609void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200610{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100611 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau75c98d12020-10-09 15:55:23 +0200612 do_unbind_listener(listener);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100613 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200614}
615
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200616/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
617 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200618 * allocation). The address family is taken from ss->ss_family, and the protocol
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200619 * passed in <proto> must be usable on this family. The protocol's default iocb
620 * is automatically preset as the receivers' iocb. The number of jobs and
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200621 * listeners is automatically increased by the number of listeners created. It
622 * returns non-zero on success, zero on error with the error message set in <err>.
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200623 */
624int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
Willy Tarreau9b3178d2020-09-16 17:58:55 +0200625 int portl, int porth, int fd, struct protocol *proto, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200626{
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200627 struct listener *l;
628 int port;
629
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200630 for (port = portl; port <= porth; port++) {
631 l = calloc(1, sizeof(*l));
632 if (!l) {
633 memprintf(err, "out of memory");
634 return 0;
635 }
636 l->obj_type = OBJ_TYPE_LISTENER;
Willy Tarreau2b718102021-04-21 07:32:39 +0200637 LIST_APPEND(&bc->frontend->conf.listeners, &l->by_fe);
638 LIST_APPEND(&bc->listeners, &l->by_bind);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200639 l->bind_conf = bc;
Willy Tarreau0fce6bc2020-09-03 07:46:06 +0200640 l->rx.settings = &bc->settings;
Willy Tarreaueef45422020-09-03 10:05:03 +0200641 l->rx.owner = l;
Willy Tarreaud2fb99f2020-10-15 21:22:29 +0200642 l->rx.iocb = proto->default_iocb;
Willy Tarreau38ba6472020-08-27 08:16:52 +0200643 l->rx.fd = fd;
Willy Tarreau07400c52020-12-04 14:49:11 +0100644
Willy Tarreau37159062020-08-27 07:48:42 +0200645 memcpy(&l->rx.addr, ss, sizeof(*ss));
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100646 if (proto->fam->set_port)
647 proto->fam->set_port(&l->rx.addr, port);
Willy Tarreau07400c52020-12-04 14:49:11 +0100648
Olivier Houchard859dc802019-08-08 15:47:21 +0200649 MT_LIST_INIT(&l->wait_queue);
Willy Tarreaua37b2442020-09-24 07:23:45 +0200650 listener_set_state(l, LI_INIT);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200651
Willy Tarreaud1f250f2020-12-04 15:03:36 +0100652 proto->add(proto, l);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200653
Willy Tarreau909c23b2020-09-15 13:50:58 +0200654 if (fd != -1)
Willy Tarreau43046fa2020-09-01 15:41:59 +0200655 l->rx.flags |= RX_F_INHERITED;
William Lallemand75ea0a02017-11-15 19:02:58 +0100656
Amaury Denoyelle7f8f6cb2020-11-10 14:24:31 +0100657 l->extra_counters = NULL;
658
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100659 HA_SPIN_INIT(&l->lock);
Willy Tarreau4781b152021-04-06 13:53:36 +0200660 _HA_ATOMIC_INC(&jobs);
661 _HA_ATOMIC_INC(&listeners);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200662 }
663 return 1;
664}
665
Willy Tarreau59a877d2021-10-12 09:36:10 +0200666/* clones listener <src> and returns the new one. All dynamically allocated
667 * fields are reallocated (name for now). The new listener is inserted before
668 * the original one in the bind_conf and frontend lists. This allows it to be
669 * duplicated while iterating over the current list. The original listener must
670 * only be in the INIT or ASSIGNED states, and the new listener will only be
671 * placed into the INIT state. The counters are always set to NULL. Maxsock is
672 * updated. Returns NULL on allocation error.
673 */
674struct listener *clone_listener(struct listener *src)
675{
676 struct listener *l;
677
678 l = calloc(1, sizeof(*l));
679 if (!l)
680 goto oom1;
681 memcpy(l, src, sizeof(*l));
682
683 if (l->name) {
684 l->name = strdup(l->name);
685 if (!l->name)
686 goto oom2;
687 }
688
689 l->rx.owner = l;
690 l->state = LI_INIT;
691 l->counters = NULL;
692 l->extra_counters = NULL;
693
694 LIST_APPEND(&src->by_fe, &l->by_fe);
695 LIST_APPEND(&src->by_bind, &l->by_bind);
696
697 MT_LIST_INIT(&l->wait_queue);
698
699 l->rx.proto->add(l->rx.proto, l);
700
701 HA_SPIN_INIT(&l->lock);
702 _HA_ATOMIC_INC(&jobs);
703 _HA_ATOMIC_INC(&listeners);
704 global.maxsock++;
705 return l;
706
Willy Tarreau59a877d2021-10-12 09:36:10 +0200707 oom2:
708 free(l);
709 oom1:
Willy Tarreaua1462892021-10-16 14:45:29 +0200710 return NULL;
Willy Tarreau59a877d2021-10-12 09:36:10 +0200711}
712
Willy Tarreau1a64d162007-10-28 22:26:05 +0100713/* Delete a listener from its protocol's list of listeners. The listener's
714 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200715 * number of listeners is updated, as well as the global number of listeners
716 * and jobs. Note that the listener must have previously been unbound. This
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200717 * is a low-level function expected to be called with the proto_lock and the
718 * listener's lock held.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100719 */
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200720void __delete_listener(struct listener *listener)
Willy Tarreau1a64d162007-10-28 22:26:05 +0100721{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100722 if (listener->state == LI_ASSIGNED) {
Willy Tarreaua37b2442020-09-24 07:23:45 +0200723 listener_set_state(listener, LI_INIT);
Willy Tarreau2b718102021-04-21 07:32:39 +0200724 LIST_DELETE(&listener->rx.proto_list);
Willy Tarreaud7f331c2020-09-25 17:01:43 +0200725 listener->rx.proto->nb_receivers--;
Willy Tarreau4781b152021-04-06 13:53:36 +0200726 _HA_ATOMIC_DEC(&jobs);
727 _HA_ATOMIC_DEC(&listeners);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100728 }
Willy Tarreaub4c083f2020-10-07 15:36:16 +0200729}
730
731/* Delete a listener from its protocol's list of listeners (please check
732 * __delete_listener() above). The proto_lock and the listener's lock will
733 * be grabbed in this order.
734 */
735void delete_listener(struct listener *listener)
736{
737 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
738 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
739 __delete_listener(listener);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100740 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200741 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100742}
743
Willy Tarreaue2711c72019-02-27 15:39:41 +0100744/* Returns a suitable value for a listener's backlog. It uses the listener's,
745 * otherwise the frontend's backlog, otherwise the listener's maxconn,
746 * otherwise the frontend's maxconn, otherwise 1024.
747 */
748int listener_backlog(const struct listener *l)
749{
750 if (l->backlog)
751 return l->backlog;
752
753 if (l->bind_conf->frontend->backlog)
754 return l->bind_conf->frontend->backlog;
755
756 if (l->maxconn)
757 return l->maxconn;
758
759 if (l->bind_conf->frontend->maxconn)
760 return l->bind_conf->frontend->maxconn;
761
762 return 1024;
763}
764
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200765/* This function is called on a read event from a listening socket, corresponding
766 * to an accept. It tries to accept as many connections as possible, and for each
767 * calls the listener's accept handler (generally the frontend's accept handler).
768 */
Willy Tarreaua74cb382020-10-15 21:29:49 +0200769void listener_accept(struct listener *l)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200770{
Willy Tarreau83efc322020-10-14 17:37:17 +0200771 struct connection *cli_conn;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100772 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200773 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100774 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100775 int next_feconn = 0;
776 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200777 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200778 int ret;
779
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100780 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200781
782 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
783 * illimited, but it is probably enough.
784 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100785 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200786
Willy Tarreau93e7c002013-10-07 18:51:07 +0200787 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
788 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200789
790 if (unlikely(!max)) {
791 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200792 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100793 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200794 }
795
796 if (max_accept > max)
797 max_accept = max;
798 }
799
800 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200801 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
802
803 if (unlikely(!max)) {
804 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200805 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100806 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200807 }
808
809 if (max_accept > max)
810 max_accept = max;
811 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200812#ifdef USE_OPENSSL
813 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
814 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200815
Willy Tarreaue43d5322013-10-07 20:01:52 +0200816 if (unlikely(!max)) {
817 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200818 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100819 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200820 }
821
822 if (max_accept > max)
823 max_accept = max;
824 }
825#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200826 if (p && p->fe_sps_lim) {
827 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
828
829 if (unlikely(!max)) {
830 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100831 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
832 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200833 }
834
835 if (max_accept > max)
836 max_accept = max;
837 }
838
839 /* Note: if we fail to allocate a connection because of configured
840 * limits, we'll schedule a new attempt worst 1 second later in the
841 * worst case. If we fail due to system limits or temporary resource
842 * shortage, we try again 100ms later in the worst case.
843 */
Willy Tarreau02757d02021-01-28 18:07:24 +0100844 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200845 unsigned int count;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200846 int status;
Willy Tarreau0aa5a5b2020-10-16 17:43:04 +0200847 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200848
Willy Tarreau82c97892019-02-27 19:32:32 +0100849 /* pre-increase the number of connections without going too far.
850 * We process the listener, then the proxy, then the process.
851 * We know which ones to unroll based on the next_xxx value.
852 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100853 do {
854 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100855 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100856 /* the listener was marked full or another
857 * thread is going to do it.
858 */
859 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100860 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100861 goto end;
862 }
863 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000864 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100865
Willy Tarreau82c97892019-02-27 19:32:32 +0100866 if (p) {
867 do {
868 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100869 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100870 /* the frontend was marked full or another
871 * thread is going to do it.
872 */
873 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100874 expire = TICK_ETERNITY;
875 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100876 }
877 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100878 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200879 }
880
Willy Tarreau82c97892019-02-27 19:32:32 +0100881 if (!(l->options & LI_O_UNLIMITED)) {
882 do {
883 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100884 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100885 /* the process was marked full or another
886 * thread is going to do it.
887 */
888 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100889 expire = tick_add(now_ms, 1000); /* try again in 1 second */
890 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100891 }
892 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000893 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200894 }
895
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200896 cli_conn = l->rx.proto->accept_conn(l, &status);
897 if (!cli_conn) {
898 switch (status) {
899 case CO_AC_DONE:
900 goto end;
Willy Tarreau818dca52014-01-31 19:40:19 +0100901
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200902 case CO_AC_RETRY: /* likely a signal */
Willy Tarreau4781b152021-04-06 13:53:36 +0200903 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100904 if (p)
Willy Tarreau4781b152021-04-06 13:53:36 +0200905 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +0100906 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +0200907 _HA_ATOMIC_DEC(&actconn);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100908 continue;
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200909
910 case CO_AC_YIELD:
Willy Tarreau92079932019-12-10 09:30:05 +0100911 max_accept = 0;
912 goto end;
William Lallemandd9138002018-11-27 12:02:39 +0100913
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200914 default:
915 goto transient_error;
Willy Tarreau83efc322020-10-14 17:37:17 +0200916 }
917 }
918
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100919 /* The connection was accepted, it must be counted as such */
920 if (l->counters)
921 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
922
Willy Tarreau82c97892019-02-27 19:32:32 +0100923 if (p)
924 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
925
926 proxy_inc_fe_conn_ctr(l, p);
927
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100928 if (!(l->options & LI_O_UNLIMITED)) {
929 count = update_freq_ctr(&global.conn_per_sec, 1);
930 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100931 }
932
Willy Tarreau4781b152021-04-06 13:53:36 +0200933 _HA_ATOMIC_INC(&activity[tid].accepted);
Willy Tarreau64a9c052019-04-12 15:27:17 +0200934
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200935 if (unlikely(cli_conn->handle.fd >= global.maxsock)) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200936 send_log(p, LOG_EMERG,
937 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
938 p->id);
Willy Tarreau9378bbe2020-10-15 10:09:31 +0200939 close(cli_conn->handle.fd);
William Dauchy835712a2020-10-18 18:37:43 +0200940 conn_free(cli_conn);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100941 expire = tick_add(now_ms, 1000); /* try again in 1 second */
942 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200943 }
944
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100945 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100946 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
947 * allows the error path not to rollback on nbconn. It's more
948 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100949 */
950 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100951 next_feconn = 0;
952 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200953
Willy Tarreau83efc322020-10-14 17:37:17 +0200954
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100955#if defined(USE_THREAD)
Willy Tarreau01cac3f2021-10-12 08:47:54 +0200956 mask = thread_mask(l->rx.bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100957 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100958 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100959 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100960
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100961 /* The principle is that we have two running indexes,
962 * each visiting in turn all threads bound to this
963 * listener. The connection will be assigned to the one
964 * with the least connections, and the other one will
965 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100966 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100967 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100968 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100969
970 /* keep a copy for the final update. thr_idx is composite
971 * and made of (t2<<16) + t1.
972 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100973 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100974 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100975 unsigned long m1, m2;
976 int q1, q2;
977
978 t2 = t1 = t0;
979 t2 >>= 16;
980 t1 &= 0xFFFF;
981
982 /* t1 walks low to high bits ;
983 * t2 walks high to low.
984 */
985 m1 = mask >> t1;
986 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
987
Willy Tarreau85d04242019-04-16 18:09:13 +0200988 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100989 m1 &= ~1UL;
990 if (!m1) {
991 m1 = mask;
992 t1 = 0;
993 }
994 t1 += my_ffsl(m1) - 1;
995 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100996
Willy Tarreau85d04242019-04-16 18:09:13 +0200997 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
998 /* highest bit not set */
999 if (!m2)
1000 m2 = mask;
1001
1002 t2 = my_flsl(m2) - 1;
1003 }
1004
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001005 /* now we have two distinct thread IDs belonging to the mask */
1006 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
1007 if (q1 >= ACCEPT_QUEUE_SIZE)
1008 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001009
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001010 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
1011 if (q2 >= ACCEPT_QUEUE_SIZE)
1012 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001013
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001014 /* we have 3 possibilities now :
1015 * q1 < q2 : t1 is less loaded than t2, so we pick it
1016 * and update t2 (since t1 might still be
1017 * lower than another thread)
1018 * q1 > q2 : t2 is less loaded than t1, so we pick it
1019 * and update t1 (since t2 might still be
1020 * lower than another thread)
1021 * q1 = q2 : both are equally loaded, thus we pick t1
1022 * and update t1 as it will become more loaded
1023 * than t2.
1024 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001025
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001026 q1 += l->thr_conn[t1];
1027 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001028
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001029 if (q1 - q2 < 0) {
1030 t = t1;
1031 t2 = t2 ? t2 - 1 : LONGBITS - 1;
1032 }
1033 else if (q1 - q2 > 0) {
1034 t = t2;
1035 t1++;
1036 if (t1 >= LONGBITS)
1037 t1 = 0;
1038 }
1039 else {
1040 t = t1;
1041 t1++;
1042 if (t1 >= LONGBITS)
1043 t1 = 0;
1044 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001045
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001046 /* new value for thr_idx */
1047 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +01001048 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001049
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001050 /* We successfully selected the best thread "t" for this
1051 * connection. We use deferred accepts even if it's the
1052 * local thread because tests show that it's the best
1053 * performing model, likely due to better cache locality
1054 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001055 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +01001056 ring = &accept_queue_rings[t];
Willy Tarreau83efc322020-10-14 17:37:17 +02001057 if (accept_queue_push_mp(ring, cli_conn)) {
Willy Tarreau4781b152021-04-06 13:53:36 +02001058 _HA_ATOMIC_INC(&activity[t].accq_pushed);
Willy Tarreau2bd65a72019-09-24 06:55:18 +02001059 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001060 continue;
1061 }
1062 /* If the ring is full we do a synchronous accept on
1063 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001064 */
Willy Tarreau4781b152021-04-06 13:53:36 +02001065 _HA_ATOMIC_INC(&activity[t].accq_full);
Willy Tarreaue0e9c482019-01-27 15:37:19 +01001066 }
1067#endif // USE_THREAD
1068
Willy Tarreau4781b152021-04-06 13:53:36 +02001069 _HA_ATOMIC_INC(&l->thr_conn[tid]);
Willy Tarreau83efc322020-10-14 17:37:17 +02001070 ret = l->accept(cli_conn);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001071 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +02001072 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001073 * we just have to ignore it (ret == 0) or it's a critical
1074 * error due to a resource shortage, and we must stop the
1075 * listener (ret < 0).
1076 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001077 if (ret == 0) /* successful termination */
1078 continue;
1079
Willy Tarreaubb660302014-05-07 19:47:02 +02001080 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001081 }
1082
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001083 /* increase the per-process number of cumulated sessions, this
1084 * may only be done once l->accept() has accepted the connection.
1085 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001086 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001087 count = update_freq_ctr(&global.sess_per_sec, 1);
1088 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001089 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001090#ifdef USE_OPENSSL
1091 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001092 count = update_freq_ctr(&global.ssl_per_sec, 1);
1093 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001094 }
1095#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001096
Willy Tarreaua0b99532021-09-30 18:48:37 +02001097 th_ctx->flags &= ~TH_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001098 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001099
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001100 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001101 if (next_conn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001102 _HA_ATOMIC_DEC(&l->nbconn);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001103
Willy Tarreau82c97892019-02-27 19:32:32 +01001104 if (p && next_feconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001105 _HA_ATOMIC_DEC(&p->feconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001106
1107 if (next_actconn)
Willy Tarreau4781b152021-04-06 13:53:36 +02001108 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001109
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001110 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau02757d02021-01-28 18:07:24 +01001111 (l->state == LI_LIMITED &&
Willy Tarreaucdcba112019-12-11 15:06:30 +01001112 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1113 (!tick_isset(global_listener_queue_task->expire) ||
1114 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001115 /* at least one thread has to this when quitting */
1116 resume_listener(l);
1117
Willy Tarreau02757d02021-01-28 18:07:24 +01001118 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001119 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001120
Olivier Houchard859dc802019-08-08 15:47:21 +02001121 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001122 (!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 +01001123 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001124 }
Willy Tarreau0591bf72019-12-10 12:01:21 +01001125 return;
1126
1127 transient_error:
1128 /* pause the listener for up to 100 ms */
1129 expire = tick_add(now_ms, 100);
1130
Willy Tarreau258b3512020-10-13 17:46:05 +02001131 /* This may be a shared socket that was paused by another process.
1132 * Let's put it to pause in this case.
1133 */
1134 if (l->rx.proto && l->rx.proto->rx_listening(&l->rx) == 0) {
1135 pause_listener(l);
1136 goto end;
1137 }
1138
Willy Tarreau0591bf72019-12-10 12:01:21 +01001139 limit_global:
1140 /* (re-)queue the listener to the global queue and set it to expire no
1141 * later than <expire> ahead. The listener turns to LI_LIMITED.
1142 */
1143 limit_listener(l, &global_listener_queue);
1144 task_schedule(global_listener_queue_task, expire);
1145 goto end;
1146
1147 limit_proxy:
1148 /* (re-)queue the listener to the proxy's queue and set it to expire no
1149 * later than <expire> ahead. The listener turns to LI_LIMITED.
1150 */
1151 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001152 if (p->task && tick_isset(expire))
1153 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001154 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001155}
1156
Willy Tarreau05f50472017-09-15 09:19:58 +02001157/* Notify the listener that a connection initiated from it was released. This
1158 * is used to keep the connection count consistent and to possibly re-open
1159 * listening when it was limited.
1160 */
1161void listener_release(struct listener *l)
1162{
1163 struct proxy *fe = l->bind_conf->frontend;
1164
1165 if (!(l->options & LI_O_UNLIMITED))
Willy Tarreau4781b152021-04-06 13:53:36 +02001166 _HA_ATOMIC_DEC(&actconn);
Willy Tarreau82c97892019-02-27 19:32:32 +01001167 if (fe)
Willy Tarreau4781b152021-04-06 13:53:36 +02001168 _HA_ATOMIC_DEC(&fe->feconn);
1169 _HA_ATOMIC_DEC(&l->nbconn);
1170 _HA_ATOMIC_DEC(&l->thr_conn[tid]);
Willy Tarreau82c97892019-02-27 19:32:32 +01001171
1172 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001173 resume_listener(l);
1174
Willy Tarreau02757d02021-01-28 18:07:24 +01001175 /* Dequeues all of the listeners waiting for a resource */
1176 dequeue_all_listeners();
1177
Olivier Houchard859dc802019-08-08 15:47:21 +02001178 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001179 (!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 +01001180 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001181}
1182
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001183/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1184static int listener_queue_init()
1185{
Willy Tarreaubeeabf52021-10-01 18:23:30 +02001186 global_listener_queue_task = task_new_anywhere();
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001187 if (!global_listener_queue_task) {
1188 ha_alert("Out of memory when initializing global listener queue\n");
1189 return ERR_FATAL|ERR_ABORT;
1190 }
1191 /* very simple initialization, users will queue the task if needed */
1192 global_listener_queue_task->context = NULL; /* not even a context! */
1193 global_listener_queue_task->process = manage_global_listener_queue;
1194
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001195 return 0;
1196}
1197
1198static void listener_queue_deinit()
1199{
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001200 task_destroy(global_listener_queue_task);
1201 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001202}
1203
1204REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1205REGISTER_POST_DEINIT(listener_queue_deinit);
1206
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001207
1208/* This is the global management task for listeners. It enables listeners waiting
1209 * for global resources when there are enough free resource, or at least once in
Willy Tarreaud597ec22021-01-29 14:29:06 +01001210 * a while. It is designed to be called as a task. It's exported so that it's easy
1211 * to spot in "show tasks" or "show profiling".
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001212 */
Willy Tarreau144f84a2021-03-02 16:09:26 +01001213struct task *manage_global_listener_queue(struct task *t, void *context, unsigned int state)
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001214{
1215 /* If there are still too many concurrent connections, let's wait for
1216 * some of them to go away. We don't need to re-arm the timer because
1217 * each of them will scan the queue anyway.
1218 */
1219 if (unlikely(actconn >= global.maxconn))
1220 goto out;
1221
1222 /* We should periodically try to enable listeners waiting for a global
1223 * resource here, because it is possible, though very unlikely, that
1224 * they have been blocked by a temporary lack of global resource such
1225 * as a file descriptor or memory and that the temporary condition has
1226 * disappeared.
1227 */
1228 dequeue_all_listeners();
1229
1230 out:
1231 t->expire = TICK_ETERNITY;
1232 task_queue(t);
1233 return t;
1234}
1235
Willy Tarreau26982662012-09-12 23:17:10 +02001236/*
1237 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1238 * parsing sessions.
1239 */
1240void bind_register_keywords(struct bind_kw_list *kwl)
1241{
Willy Tarreau2b718102021-04-21 07:32:39 +02001242 LIST_APPEND(&bind_keywords.list, &kwl->list);
Willy Tarreau26982662012-09-12 23:17:10 +02001243}
1244
1245/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1246 * keyword is found with a NULL ->parse() function, then an attempt is made to
1247 * find one with a valid ->parse() function. This way it is possible to declare
1248 * platform-dependant, known keywords as NULL, then only declare them as valid
1249 * if some options are met. Note that if the requested keyword contains an
1250 * opening parenthesis, everything from this point is ignored.
1251 */
1252struct bind_kw *bind_find_kw(const char *kw)
1253{
1254 int index;
1255 const char *kwend;
1256 struct bind_kw_list *kwl;
1257 struct bind_kw *ret = NULL;
1258
1259 kwend = strchr(kw, '(');
1260 if (!kwend)
1261 kwend = kw + strlen(kw);
1262
1263 list_for_each_entry(kwl, &bind_keywords.list, list) {
1264 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1265 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1266 kwl->kw[index].kw[kwend-kw] == 0) {
1267 if (kwl->kw[index].parse)
1268 return &kwl->kw[index]; /* found it !*/
1269 else
1270 ret = &kwl->kw[index]; /* may be OK */
1271 }
1272 }
1273 }
1274 return ret;
1275}
1276
Willy Tarreau8638f482012-09-18 18:01:17 +02001277/* Dumps all registered "bind" keywords to the <out> string pointer. The
1278 * unsupported keywords are only dumped if their supported form was not
1279 * found.
1280 */
1281void bind_dump_kws(char **out)
1282{
1283 struct bind_kw_list *kwl;
1284 int index;
1285
Christopher Faulet784063e2020-05-18 12:14:18 +02001286 if (!out)
1287 return;
1288
Willy Tarreau8638f482012-09-18 18:01:17 +02001289 *out = NULL;
1290 list_for_each_entry(kwl, &bind_keywords.list, list) {
1291 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1292 if (kwl->kw[index].parse ||
1293 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001294 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1295 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001296 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001297 kwl->kw[index].skip ? " <arg>" : "",
1298 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001299 }
1300 }
1301 }
1302}
1303
Willy Tarreau433b05f2021-03-12 10:14:07 +01001304/* Try to find in srv_keyword the word that looks closest to <word> by counting
1305 * transitions between letters, digits and other characters. Will return the
1306 * best matching word if found, otherwise NULL.
1307 */
1308const char *bind_find_best_kw(const char *word)
1309{
1310 uint8_t word_sig[1024];
1311 uint8_t list_sig[1024];
1312 const struct bind_kw_list *kwl;
1313 const char *best_ptr = NULL;
1314 int dist, best_dist = INT_MAX;
1315 int index;
1316
1317 make_word_fingerprint(word_sig, word);
1318 list_for_each_entry(kwl, &bind_keywords.list, list) {
1319 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1320 make_word_fingerprint(list_sig, kwl->kw[index].kw);
1321 dist = word_fingerprint_distance(word_sig, list_sig);
1322 if (dist < best_dist) {
1323 best_dist = dist;
1324 best_ptr = kwl->kw[index].kw;
1325 }
1326 }
1327 }
1328
1329 if (best_dist > 2 * strlen(word) || (best_ptr && best_dist > 2 * strlen(best_ptr)))
1330 best_ptr = NULL;
1331
1332 return best_ptr;
1333}
1334
Willy Tarreaudbf78022021-10-06 09:05:08 +02001335/* allocate an bind_conf struct for a bind line, and chain it to the frontend <fe>.
1336 * If <arg> is not NULL, it is duplicated into ->arg to store useful config
1337 * information for error reporting. NULL is returned on error.
1338 */
1339struct bind_conf *bind_conf_alloc(struct proxy *fe, const char *file,
1340 int line, const char *arg, struct xprt_ops *xprt)
1341{
1342 struct bind_conf *bind_conf = calloc(1, sizeof(*bind_conf));
1343
1344 if (!bind_conf)
1345 goto err;
1346
1347 bind_conf->file = strdup(file);
1348 if (!bind_conf->file)
1349 goto err;
1350 bind_conf->line = line;
1351 if (arg) {
1352 bind_conf->arg = strdup(arg);
1353 if (!bind_conf->arg)
1354 goto err;
1355 }
1356
1357 LIST_APPEND(&fe->conf.bind, &bind_conf->by_fe);
1358 bind_conf->settings.ux.uid = -1;
1359 bind_conf->settings.ux.gid = -1;
1360 bind_conf->settings.ux.mode = 0;
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001361 bind_conf->settings.shards = 1;
Willy Tarreaudbf78022021-10-06 09:05:08 +02001362 bind_conf->xprt = xprt;
1363 bind_conf->frontend = fe;
1364 bind_conf->severity_output = CLI_SEVERITY_NONE;
1365#ifdef USE_OPENSSL
1366 HA_RWLOCK_INIT(&bind_conf->sni_lock);
1367 bind_conf->sni_ctx = EB_ROOT;
1368 bind_conf->sni_w_ctx = EB_ROOT;
1369#endif
1370 LIST_INIT(&bind_conf->listeners);
1371 return bind_conf;
1372
1373 err:
1374 if (bind_conf) {
1375 ha_free(&bind_conf->file);
1376 ha_free(&bind_conf->arg);
1377 }
1378 ha_free(&bind_conf);
1379 return NULL;
1380}
1381
1382const char *listener_state_str(const struct listener *l)
1383{
1384 static const char *states[8] = {
1385 "NEW", "INI", "ASS", "PAU", "LIS", "RDY", "FUL", "LIM",
1386 };
1387 unsigned int st = l->state;
1388
1389 if (st >= sizeof(states) / sizeof(*states))
1390 return "INVALID";
1391 return states[st];
1392}
1393
Willy Tarreau645513a2010-05-24 20:55:15 +02001394/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001395/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001396/************************************************************************/
1397
Willy Tarreaua5e37562011-12-16 17:06:15 +01001398/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001399static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001400smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001401{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001402 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001403 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001404 return 1;
1405}
1406
Willy Tarreaua5e37562011-12-16 17:06:15 +01001407/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001408static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001409smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001410{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001411 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001412 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001413 return 1;
1414}
Jerome Magnineb421b22020-03-27 22:08:40 +01001415static int
1416smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1417{
1418 smp->data.u.str.area = smp->sess->listener->name;
1419 if (!smp->data.u.str.area)
1420 return 0;
1421
1422 smp->data.type = SMP_T_STR;
1423 smp->flags = SMP_F_CONST;
1424 smp->data.u.str.data = strlen(smp->data.u.str.area);
1425 return 1;
1426}
Willy Tarreau645513a2010-05-24 20:55:15 +02001427
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001428/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001429static 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 +02001430{
1431 struct listener *l;
1432
Willy Tarreau4348fad2012-09-20 16:48:07 +02001433 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001434 l->options |= LI_O_ACC_PROXY;
1435
1436 return 0;
1437}
1438
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001439/* parse the "accept-netscaler-cip" bind keyword */
1440static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1441{
1442 struct listener *l;
1443 uint32_t val;
1444
1445 if (!*args[cur_arg + 1]) {
1446 memprintf(err, "'%s' : missing value", args[cur_arg]);
1447 return ERR_ALERT | ERR_FATAL;
1448 }
1449
1450 val = atol(args[cur_arg + 1]);
1451 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001452 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001453 return ERR_ALERT | ERR_FATAL;
1454 }
1455
1456 list_for_each_entry(l, &conf->listeners, by_bind) {
1457 l->options |= LI_O_ACC_CIP;
1458 conf->ns_cip_magic = val;
1459 }
1460
1461 return 0;
1462}
1463
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001464/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001465static 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 +02001466{
1467 struct listener *l;
1468 int val;
1469
1470 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001471 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001472 return ERR_ALERT | ERR_FATAL;
1473 }
1474
1475 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001476 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001477 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001478 return ERR_ALERT | ERR_FATAL;
1479 }
1480
Willy Tarreau4348fad2012-09-20 16:48:07 +02001481 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001482 l->backlog = val;
1483
1484 return 0;
1485}
1486
1487/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001488static 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 +02001489{
1490 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001491 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001492 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001493
Willy Tarreau4348fad2012-09-20 16:48:07 +02001494 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001495 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001496 return ERR_ALERT | ERR_FATAL;
1497 }
1498
1499 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001500 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001501 return ERR_ALERT | ERR_FATAL;
1502 }
1503
Willy Tarreau4348fad2012-09-20 16:48:07 +02001504 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001505 new->luid = strtol(args[cur_arg + 1], &error, 10);
1506 if (*error != '\0') {
1507 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1508 return ERR_ALERT | ERR_FATAL;
1509 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001510 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001511
Willy Tarreau4348fad2012-09-20 16:48:07 +02001512 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001513 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001514 return ERR_ALERT | ERR_FATAL;
1515 }
1516
Willy Tarreau4348fad2012-09-20 16:48:07 +02001517 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001518 if (node) {
1519 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001520 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1521 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1522 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001523 return ERR_ALERT | ERR_FATAL;
1524 }
1525
Willy Tarreau4348fad2012-09-20 16:48:07 +02001526 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001527 return 0;
1528}
1529
1530/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001531static 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 +02001532{
1533 struct listener *l;
1534 int val;
1535
1536 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001537 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001538 return ERR_ALERT | ERR_FATAL;
1539 }
1540
1541 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001542 if (val < 0) {
1543 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001544 return ERR_ALERT | ERR_FATAL;
1545 }
1546
Willy Tarreau4348fad2012-09-20 16:48:07 +02001547 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001548 l->maxconn = val;
1549
1550 return 0;
1551}
1552
1553/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001554static 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 +02001555{
1556 struct listener *l;
1557
1558 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001559 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001560 return ERR_ALERT | ERR_FATAL;
1561 }
1562
Willy Tarreau4348fad2012-09-20 16:48:07 +02001563 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001564 l->name = strdup(args[cur_arg + 1]);
1565
1566 return 0;
1567}
1568
1569/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001570static 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 +02001571{
1572 struct listener *l;
1573 int val;
1574
1575 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001576 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001577 return ERR_ALERT | ERR_FATAL;
1578 }
1579
1580 val = atol(args[cur_arg + 1]);
1581 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001582 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001583 return ERR_ALERT | ERR_FATAL;
1584 }
1585
Willy Tarreau4348fad2012-09-20 16:48:07 +02001586 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001587 l->nice = val;
1588
1589 return 0;
1590}
1591
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001592/* parse the "process" bind keyword */
1593static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1594{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001595 char *slash;
1596 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001597
Christopher Fauletc644fa92017-11-23 22:44:11 +01001598 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1599 *slash = 0;
1600
Willy Tarreau72faef32021-06-15 08:36:30 +02001601 if (parse_process_number(args[cur_arg + 1], &proc, 1, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001602 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001603 return ERR_ALERT | ERR_FATAL;
1604 }
1605
Christopher Fauletc644fa92017-11-23 22:44:11 +01001606 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001607 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001608 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1609 return ERR_ALERT | ERR_FATAL;
1610 }
1611 *slash = '/';
1612 }
1613
Willy Tarreau01cac3f2021-10-12 08:47:54 +02001614 conf->bind_thread |= thread;
Willy Tarreauc8cac042021-09-21 14:31:29 +02001615
1616 memprintf(err, "'process %s' on 'bind' lines is deprecated and will be removed in 2.7.", args[cur_arg+1]);
1617 if (slash)
1618 memprintf(err, "%s Please use 'thread %s' instead.", *err, slash + 1);
1619 return ERR_WARN;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001620}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001621
Christopher Fauleta717b992018-04-10 14:43:00 +02001622/* parse the "proto" bind keyword */
1623static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1624{
1625 struct ist proto;
1626
1627 if (!*args[cur_arg + 1]) {
1628 memprintf(err, "'%s' : missing value", args[cur_arg]);
1629 return ERR_ALERT | ERR_FATAL;
1630 }
1631
Tim Duesterhusdcf753a2021-03-04 17:31:47 +01001632 proto = ist(args[cur_arg + 1]);
Christopher Fauleta717b992018-04-10 14:43:00 +02001633 conf->mux_proto = get_mux_proto(proto);
1634 if (!conf->mux_proto) {
1635 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1636 return ERR_ALERT | ERR_FATAL;
1637 }
Willy Tarreauc8cac042021-09-21 14:31:29 +02001638 return 0;
1639}
1640
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001641/* parse the "shards" bind keyword. Takes an integer or "by-thread" */
1642static int bind_parse_shards(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1643{
1644 int val;
1645
1646 if (!*args[cur_arg + 1]) {
1647 memprintf(err, "'%s' : missing value", args[cur_arg]);
1648 return ERR_ALERT | ERR_FATAL;
1649 }
1650
1651 if (strcmp(args[cur_arg + 1], "by-thread") == 0) {
1652 val = MAX_THREADS; /* will be trimmed later anyway */
1653 } else {
1654 val = atol(args[cur_arg + 1]);
1655 if (val < 1 || val > MAX_THREADS) {
1656 memprintf(err, "'%s' : invalid value %d, allowed range is %d..%d or 'by-thread'", args[cur_arg], val, 1, MAX_THREADS);
1657 return ERR_ALERT | ERR_FATAL;
1658 }
1659 }
1660
1661 conf->settings.shards = val;
1662 return 0;
1663}
1664
Willy Tarreauc8cac042021-09-21 14:31:29 +02001665/* parse the "thread" bind keyword */
1666static int bind_parse_thread(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1667{
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001668 char *sep = NULL;
1669 ulong thread = 0;
1670 long tgroup = 0;
Willy Tarreauc8cac042021-09-21 14:31:29 +02001671
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001672 tgroup = strtol(args[cur_arg + 1], &sep, 10);
1673 if (*sep == '/') {
1674 /* a thread group was present */
1675 if (tgroup < 1 || tgroup > MAX_TGROUPS) {
1676 memprintf(err, "'%s' thread-group number must be between 1 and %d (was %ld)", args[cur_arg + 1], MAX_TGROUPS, tgroup);
1677 return ERR_ALERT | ERR_FATAL;
1678 }
1679 sep++;
1680 }
1681 else {
1682 /* no thread group */
1683 tgroup = 0;
1684 sep = args[cur_arg + 1];
1685 }
Willy Tarreauc8cac042021-09-21 14:31:29 +02001686
Willy Tarreau01cac3f2021-10-12 08:47:54 +02001687 if ((conf->bind_tgroup || conf->bind_thread) &&
1688 conf->bind_tgroup != tgroup) {
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001689 memprintf(err, "'%s' multiple thread-groups are not supported", args[cur_arg + 1]);
Willy Tarreauc8cac042021-09-21 14:31:29 +02001690 return ERR_ALERT | ERR_FATAL;
1691 }
Willy Tarreaud57b9ff2021-09-29 18:50:31 +02001692
1693 if (parse_process_number(sep, &thread, MAX_THREADS, NULL, err)) {
1694 memprintf(err, "'%s' : %s", sep, *err);
Willy Tarreauc8cac042021-09-21 14:31:29 +02001695 return ERR_ALERT | ERR_FATAL;
1696 }
1697
Willy Tarreau01cac3f2021-10-12 08:47:54 +02001698 conf->bind_thread |= thread;
1699 conf->bind_tgroup = tgroup;
Christopher Fauleta717b992018-04-10 14:43:00 +02001700 return 0;
1701}
1702
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001703/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1704static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
Willy Tarreau01825162021-03-09 09:53:46 +01001705 const struct proxy *defpx, const char *file, int line,
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001706 char **err)
1707{
1708 if (too_many_args(1, args, err, NULL))
1709 return -1;
1710
1711 if (strcmp(args[1], "on") == 0)
1712 global.tune.options |= GTUNE_LISTENER_MQ;
1713 else if (strcmp(args[1], "off") == 0)
1714 global.tune.options &= ~GTUNE_LISTENER_MQ;
1715 else {
1716 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1717 return -1;
1718 }
1719 return 0;
1720}
1721
Willy Tarreau61612d42012-04-19 18:42:05 +02001722/* Note: must not be declared <const> as its list will be overwritten.
1723 * Please take care of keeping this list alphabetically sorted.
1724 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001725static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001726 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1727 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001728 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001729 { /* END */ },
1730}};
1731
Willy Tarreau0108d902018-11-25 19:14:37 +01001732INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1733
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001734/* Note: must not be declared <const> as its list will be overwritten.
1735 * Please take care of keeping this list alphabetically sorted.
1736 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001737static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001738 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001739}};
1740
Willy Tarreau0108d902018-11-25 19:14:37 +01001741INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1742
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001743/* Note: must not be declared <const> as its list will be overwritten.
1744 * Please take care of keeping this list alphabetically sorted, doing so helps
1745 * all code contributors.
1746 * Optional keywords are also declared with a NULL ->parse() function so that
1747 * the config parser can report an appropriate error when a known keyword was
1748 * not enabled.
1749 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001750static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001751 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001752 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1753 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1754 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1755 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1756 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1757 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001758 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001759 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau6dfbef42021-10-12 15:23:03 +02001760 { "shards", bind_parse_shards, 1 }, /* set number of shards */
Willy Tarreauc8cac042021-09-21 14:31:29 +02001761 { "thread", bind_parse_thread, 1 }, /* set list of allowed threads for this socket */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001762 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001763}};
1764
Willy Tarreau0108d902018-11-25 19:14:37 +01001765INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1766
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001767/* config keyword parsers */
1768static struct cfg_kw_list cfg_kws = {ILH, {
1769 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1770 { 0, NULL, NULL }
1771}};
1772
1773INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1774
Willy Tarreau645513a2010-05-24 20:55:15 +02001775/*
1776 * Local variables:
1777 * c-indent-level: 8
1778 * c-basic-offset: 8
1779 * End:
1780 */