blob: 42ab3f2a393dc74725bf8432cccc5741ebd095d1 [file] [log] [blame]
Willy Tarreaudd815982007-10-16 12:25:14 +02001/*
Willy Tarreaud1d54542012-09-12 22:58:11 +02002 * Listener management functions.
Willy Tarreaudd815982007-10-16 12:25:14 +02003 *
Willy Tarreau0ccb7442013-01-07 22:54:17 +01004 * Copyright 2000-2013 Willy Tarreau <w@1wt.eu>
Willy Tarreaudd815982007-10-16 12:25:14 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau44489252014-01-14 17:52:01 +010013#define _GNU_SOURCE
Willy Tarreau6ae1ba62014-05-07 19:01:58 +020014#include <ctype.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020015#include <errno.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020016#include <stdio.h>
17#include <string.h>
Willy Tarreau95ccdde2014-02-01 09:28:36 +010018#include <unistd.h>
19#include <fcntl.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020020
Willy Tarreaudcc048a2020-06-04 19:11:43 +020021#include <haproxy/acl.h>
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020022#include <haproxy/api.h>
Willy Tarreau6be78492020-06-05 00:00:29 +020023#include <haproxy/cfgparse.h>
Willy Tarreau7ea393d2020-06-04 18:02:10 +020024#include <haproxy/connection.h>
Willy Tarreau8d366972020-05-27 16:10:29 +020025#include <haproxy/errors.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020026#include <haproxy/fd.h>
27#include <haproxy/freq_ctr.h>
Willy Tarreauf268ee82020-06-04 17:05:57 +020028#include <haproxy/global.h>
Willy Tarreau853b2972020-05-27 18:01:47 +020029#include <haproxy/list.h>
Willy Tarreau213e9902020-06-04 14:58:24 +020030#include <haproxy/listener.h>
Willy Tarreauaeed4a82020-06-04 22:01:04 +020031#include <haproxy/log.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020032#include <haproxy/proto_sockpair.h>
33#include <haproxy/protocol-t.h>
34#include <haproxy/protocol.h>
35#include <haproxy/sample.h>
Willy Tarreaudfd3de82020-06-04 23:46:14 +020036#include <haproxy/stream.h>
Willy Tarreaucea0e1b2020-06-04 17:25:40 +020037#include <haproxy/task.h>
Willy Tarreau92b4f132020-06-01 11:05:15 +020038#include <haproxy/time.h>
Willy Tarreaub2551052020-06-09 09:07:15 +020039#include <haproxy/tools.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020040
Willy Tarreaub648d632007-10-28 22:13:50 +010041
Willy Tarreau26982662012-09-12 23:17:10 +020042/* List head of all known bind keywords */
43static struct bind_kw_list bind_keywords = {
44 .list = LIST_HEAD_INIT(bind_keywords.list)
45};
46
Willy Tarreauf2cb1692019-07-11 10:08:31 +020047/* there is one listener queue per thread so that a thread unblocking the
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +050048 * global queue can wake up listeners bound only to foreign threads by
Willy Tarreau2bd65a72019-09-24 06:55:18 +020049 * moving them to the remote queues and waking up the associated tasklet.
Willy Tarreauf2cb1692019-07-11 10:08:31 +020050 */
51static struct work_list *local_listener_queue;
52
Willy Tarreaua1d97f82019-12-10 11:18:41 +010053/* list of the temporarily limited listeners because of lack of resource */
54static struct mt_list global_listener_queue = MT_LIST_HEAD_INIT(global_listener_queue);
55static struct task *global_listener_queue_task;
56static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state);
57
58
Willy Tarreau1efafce2019-01-27 15:37:19 +010059#if defined(USE_THREAD)
60
61struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
62
63/* dequeue and process a pending connection from the local accept queue (single
64 * consumer). Returns the accepted fd or -1 if none was found. The listener is
65 * placed into *li. The address is copied into *addr for no more than *addr_len
66 * bytes, and the address length is returned into *addr_len.
67 */
68int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
69{
70 struct accept_queue_entry *e;
71 unsigned int pos, next;
72 struct listener *ptr;
73 int len;
74 int fd;
75
76 pos = ring->head;
77
78 if (pos == ring->tail)
79 return -1;
80
81 next = pos + 1;
82 if (next >= ACCEPT_QUEUE_SIZE)
83 next = 0;
84
85 e = &ring->entry[pos];
86
87 /* wait for the producer to update the listener's pointer */
88 while (1) {
89 ptr = e->listener;
90 __ha_barrier_load();
91 if (ptr)
92 break;
93 pl_cpu_relax();
94 }
95
96 fd = e->fd;
97 len = e->addr_len;
98 if (len > *addr_len)
99 len = *addr_len;
100
101 if (likely(len > 0))
102 memcpy(addr, &e->addr, len);
103
104 /* release the entry */
105 e->listener = NULL;
106
107 __ha_barrier_store();
108 ring->head = next;
109
110 *addr_len = len;
111 *li = ptr;
112
113 return fd;
114}
115
116
117/* tries to push a new accepted connection <fd> into ring <ring> for listener
118 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
119 * succeeds, or zero if the ring is full. Supports multiple producers.
120 */
121int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
122 struct listener *li, const void *addr, int addr_len)
123{
124 struct accept_queue_entry *e;
125 unsigned int pos, next;
126
127 pos = ring->tail;
128 do {
129 next = pos + 1;
130 if (next >= ACCEPT_QUEUE_SIZE)
131 next = 0;
132 if (next == ring->head)
133 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100134 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100135
136
137 e = &ring->entry[pos];
138
139 if (addr_len > sizeof(e->addr))
140 addr_len = sizeof(e->addr);
141
142 if (addr_len)
143 memcpy(&e->addr, addr, addr_len);
144
145 e->addr_len = addr_len;
146 e->fd = fd;
147
148 __ha_barrier_store();
149 /* now commit the change */
150
151 e->listener = li;
152 return 1;
153}
154
155/* proceed with accepting new connections */
156static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
157{
158 struct accept_queue_ring *ring = context;
159 struct listener *li;
160 struct sockaddr_storage addr;
Christopher Faulet102854c2019-04-30 12:17:13 +0200161 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100162 int addr_len;
163 int ret;
164 int fd;
165
Christopher Faulet102854c2019-04-30 12:17:13 +0200166 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
167 * is not really illimited, but it is probably enough.
168 */
169 max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
170 for (; max_accept; max_accept--) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100171 addr_len = sizeof(addr);
172 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
173 if (fd < 0)
174 break;
175
Olivier Houchard64213e92019-03-08 18:52:57 +0100176 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100177 ret = li->accept(li, fd, &addr);
178 if (ret <= 0) {
179 /* connection was terminated by the application */
180 continue;
181 }
182
183 /* increase the per-process number of cumulated sessions, this
184 * may only be done once l->accept() has accepted the connection.
185 */
186 if (!(li->options & LI_O_UNLIMITED)) {
187 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
188 update_freq_ctr(&global.sess_per_sec, 1));
189 if (li->bind_conf && li->bind_conf->is_ssl) {
190 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
191 update_freq_ctr(&global.ssl_per_sec, 1));
192 }
193 }
194 }
195
196 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200197 if (!max_accept)
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200198 tasklet_wakeup(ring->tasklet);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100199
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200200 return NULL;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100201}
202
203/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
204static int accept_queue_init()
205{
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200206 struct tasklet *t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100207 int i;
208
209 for (i = 0; i < global.nbthread; i++) {
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200210 t = tasklet_new();
Willy Tarreau1efafce2019-01-27 15:37:19 +0100211 if (!t) {
212 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
213 return ERR_FATAL|ERR_ABORT;
214 }
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200215 t->tid = i;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100216 t->process = accept_queue_process;
217 t->context = &accept_queue_rings[i];
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200218 accept_queue_rings[i].tasklet = t;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100219 }
220 return 0;
221}
222
223REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
224
225#endif // USE_THREAD
226
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100227/* This function adds the specified listener's file descriptor to the polling
228 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Ilya Shipitsin6fb0f212020-04-02 15:25:26 +0500229 * LI_FULL state depending on its number of connections. In daemon mode, we
Willy Tarreauae302532014-05-07 19:22:24 +0200230 * also support binding only the relevant processes to their respective
231 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100232 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200233static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100234{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100235 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100236 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200237 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100238 !(proc_mask(listener->bind_conf->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200239 /* we don't want to enable this listener and don't
240 * want any fd event to reach it.
241 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200242 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100243 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200244 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100245 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200246 listener->state = LI_LISTEN;
247 }
Willy Tarreauae302532014-05-07 19:22:24 +0200248 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100249 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau49b046d2012-08-09 12:11:58 +0200250 fd_want_recv(listener->fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100251 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200252 }
253 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100254 listener->state = LI_FULL;
255 }
256 }
William Lallemande22f11f2018-09-11 10:06:27 +0200257 /* if this listener is supposed to be only in the master, close it in the workers */
258 if ((global.mode & MODE_MWORKER) &&
259 (listener->options & LI_O_MWORKER) &&
260 master == 0) {
261 do_unbind_listener(listener, 1);
262 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100263 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100264}
265
266/* This function removes the specified listener's file descriptor from the
267 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
268 * enters LI_LISTEN.
269 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200270static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100271{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100272 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100273 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200274 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100275 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200276 fd_stop_recv(listener->fd);
Olivier Houchard859dc802019-08-08 15:47:21 +0200277 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100278 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200279 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100280 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100281}
282
Willy Tarreaube58c382011-07-24 18:28:10 +0200283/* This function tries to temporarily disable a listener, depending on the OS
284 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
285 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
286 * closes upon SHUT_WR and refuses to rebind. So a common validation path
287 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
288 * is disabled. It normally returns non-zero, unless an error is reported.
289 */
290int pause_listener(struct listener *l)
291{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200292 int ret = 1;
293
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100294 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200295
Olivier Houchard1fc05162017-04-06 01:05:05 +0200296 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200297 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200298
Willy Tarreau092d8652014-07-07 20:22:12 +0200299 if (l->proto->pause) {
300 /* Returns < 0 in case of failure, 0 if the listener
301 * was totally stopped, or > 0 if correctly paused.
302 */
303 int ret = l->proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200304
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200305 if (ret < 0) {
306 ret = 0;
307 goto end;
308 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200309 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200310 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200311 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200312
Olivier Houchard859dc802019-08-08 15:47:21 +0200313 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200314
Willy Tarreau49b046d2012-08-09 12:11:58 +0200315 fd_stop_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200316 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200317 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100318 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200319 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200320}
321
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200322/* This function tries to resume a temporarily disabled listener. Paused, full,
323 * limited and disabled listeners are handled, which means that this function
324 * may replace enable_listener(). The resulting state will either be LI_READY
325 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200326 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200327 * foreground mode, and are ignored. If the listener was only in the assigned
328 * state, it's totally rebound. This can happen if a pause() has completely
329 * stopped it. If the resume fails, 0 is returned and an error might be
330 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200331 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100332int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200333{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200334 int ret = 1;
335
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100336 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200337
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200338 /* check that another thread didn't to the job in parallel (e.g. at the
339 * end of listen_accept() while we'd come from dequeue_all_listeners().
340 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200341 if (MT_LIST_ADDED(&l->wait_queue))
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200342 goto end;
343
William Lallemand095ba4c2017-06-01 17:38:50 +0200344 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100345 !(proc_mask(l->bind_conf->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200346 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100347
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200348 if (l->state == LI_ASSIGNED) {
349 char msg[100];
350 int err;
351
352 err = l->proto->bind(l, msg, sizeof(msg));
353 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100354 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200355 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100356 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200357
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200358 if (err & (ERR_FATAL | ERR_ABORT)) {
359 ret = 0;
360 goto end;
361 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200362 }
363
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200364 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
365 ret = 0;
366 goto end;
367 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200368
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200369 if (l->proto->sock_prot == IPPROTO_TCP &&
370 l->state == LI_PAUSED &&
Willy Tarreaue2711c72019-02-27 15:39:41 +0100371 listen(l->fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200372 ret = 0;
373 goto end;
374 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200375
376 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200377 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200378
Olivier Houchard859dc802019-08-08 15:47:21 +0200379 MT_LIST_DEL(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200380
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100381 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaube58c382011-07-24 18:28:10 +0200382 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200383 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200384 }
385
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200386 if (!(thread_mask(l->bind_conf->bind_thread) & tid_bit)) {
387 /* we're not allowed to touch this listener's FD, let's requeue
388 * the listener into one of its owning thread's queue instead.
389 */
Willy Tarreau50b65942020-02-12 10:01:29 +0100390 int first_thread = my_flsl(thread_mask(l->bind_conf->bind_thread) & all_threads_mask) - 1;
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200391 work_list_add(&local_listener_queue[first_thread], &l->wait_queue);
392 goto end;
393 }
394
Willy Tarreau49b046d2012-08-09 12:11:58 +0200395 fd_want_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200396 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200397 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100398 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200399 return ret;
400}
401
Willy Tarreau87b09662015-04-03 00:22:06 +0200402/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200403 * it upon next close() using resume_listener().
404 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200405static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200406{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100407 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200408 if (l->state >= LI_READY) {
Olivier Houchard859dc802019-08-08 15:47:21 +0200409 MT_LIST_DEL(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100410 if (l->state != LI_FULL) {
411 fd_stop_recv(l->fd);
412 l->state = LI_FULL;
413 }
Willy Tarreau62793712011-07-24 19:23:38 +0200414 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100415 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200416}
417
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200418/* Marks a ready listener as limited so that we only try to re-enable it when
419 * resources are free again. It will be queued into the specified queue.
420 */
Olivier Houchard859dc802019-08-08 15:47:21 +0200421static void limit_listener(struct listener *l, struct mt_list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200422{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100423 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200424 if (l->state == LI_READY) {
Willy Tarreaude4db172020-07-10 08:10:29 +0200425 MT_LIST_TRY_ADDQ(list, &l->wait_queue);
Willy Tarreau49b046d2012-08-09 12:11:58 +0200426 fd_stop_recv(l->fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200427 l->state = LI_LIMITED;
428 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100429 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200430}
431
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100432/* This function adds all of the protocol's listener's file descriptors to the
433 * polling lists when they are in the LI_LISTEN state. It is intended to be
434 * used as a protocol's generic enable_all() primitive, for use after the
435 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
436 * their number of connections. It always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200437 *
438 * Must be called with proto_lock held.
439 *
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100440 */
441int enable_all_listeners(struct protocol *proto)
442{
443 struct listener *listener;
444
445 list_for_each_entry(listener, &proto->listeners, proto_list)
446 enable_listener(listener);
447 return ERR_NONE;
448}
449
450/* This function removes all of the protocol's listener's file descriptors from
451 * the polling lists when they are in the LI_READY or LI_FULL states. It is
452 * intended to be used as a protocol's generic disable_all() primitive. It puts
453 * the listeners into LI_LISTEN, and always returns ERR_NONE.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200454 *
455 * Must be called with proto_lock held.
456 *
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100457 */
458int disable_all_listeners(struct protocol *proto)
459{
460 struct listener *listener;
461
462 list_for_each_entry(listener, &proto->listeners, proto_list)
463 disable_listener(listener);
464 return ERR_NONE;
465}
466
Willy Tarreau241797a2019-12-10 14:10:52 +0100467/* Dequeues all listeners waiting for a resource the global wait queue */
468void dequeue_all_listeners()
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200469{
Willy Tarreau01abd022019-02-28 10:27:18 +0100470 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200471
Willy Tarreau241797a2019-12-10 14:10:52 +0100472 while ((listener = MT_LIST_POP(&global_listener_queue, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200473 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100474 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200475 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100476 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200477 }
478}
479
Willy Tarreau241797a2019-12-10 14:10:52 +0100480/* Dequeues all listeners waiting for a resource in proxy <px>'s queue */
481void dequeue_proxy_listeners(struct proxy *px)
482{
483 struct listener *listener;
484
485 while ((listener = MT_LIST_POP(&px->listener_queue, struct listener *, wait_queue))) {
486 /* This cannot fail because the listeners are by definition in
487 * the LI_LIMITED state.
488 */
489 resume_listener(listener);
490 }
491}
492
Christopher Faulet510c0d62018-03-16 10:04:47 +0100493/* Must be called with the lock held. Depending on <do_close> value, it does
494 * what unbind_listener or unbind_listener_no_close should do.
495 */
496void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100497{
Olivier Houcharda5188562019-03-08 15:35:42 +0100498 if (listener->state == LI_READY && fd_updt)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200499 fd_stop_recv(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100500
Olivier Houchard859dc802019-08-08 15:47:21 +0200501 MT_LIST_DEL(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200502
Willy Tarreaube58c382011-07-24 18:28:10 +0200503 if (listener->state >= LI_PAUSED) {
Willy Tarreau67672452020-08-26 11:44:17 +0200504 listener->state = LI_ASSIGNED;
505 fd_stop_both(listener->fd);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200506 if (do_close) {
507 fd_delete(listener->fd);
508 listener->fd = -1;
509 }
Willy Tarreaub648d632007-10-28 22:13:50 +0100510 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100511}
512
Olivier Houchard1fc05162017-04-06 01:05:05 +0200513/* This function closes the listening socket for the specified listener,
514 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100515 * LI_ASSIGNED state. This function is intended to be used as a generic
516 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200517 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100518void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200519{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100520 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100521 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100522 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200523}
524
525/* This function pretends the listener is dead, but keeps the FD opened, so
526 * that we can provide it, for conf reloading.
527 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100528void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200529{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100530 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100531 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100532 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200533}
534
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200535/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
536 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
537 * allocation). The address family is taken from ss->ss_family. The number of
538 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100539 * created. If the <inherited> argument is set to 1, it specifies that the FD
540 * was obtained from a parent process.
541 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200542 * set in <err>.
543 */
544int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100545 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200546{
547 struct protocol *proto = protocol_by_family(ss->ss_family);
548 struct listener *l;
549 int port;
550
551 if (!proto) {
552 memprintf(err, "unsupported protocol family %d", ss->ss_family);
553 return 0;
554 }
555
556 for (port = portl; port <= porth; port++) {
557 l = calloc(1, sizeof(*l));
558 if (!l) {
559 memprintf(err, "out of memory");
560 return 0;
561 }
562 l->obj_type = OBJ_TYPE_LISTENER;
563 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
564 LIST_ADDQ(&bc->listeners, &l->by_bind);
565 l->bind_conf = bc;
566
567 l->fd = fd;
568 memcpy(&l->addr, ss, sizeof(*ss));
Olivier Houchard859dc802019-08-08 15:47:21 +0200569 MT_LIST_INIT(&l->wait_queue);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200570 l->state = LI_INIT;
571
572 proto->add(l, port);
573
William Lallemand75ea0a02017-11-15 19:02:58 +0100574 if (inherited)
575 l->options |= LI_O_INHERITED;
576
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100577 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100578 _HA_ATOMIC_ADD(&jobs, 1);
579 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200580 }
581 return 1;
582}
583
Willy Tarreau1a64d162007-10-28 22:26:05 +0100584/* Delete a listener from its protocol's list of listeners. The listener's
585 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200586 * number of listeners is updated, as well as the global number of listeners
587 * and jobs. Note that the listener must have previously been unbound. This
588 * is the generic function to use to remove a listener.
Willy Tarreaudaacf362019-07-24 16:45:02 +0200589 *
590 * Will grab the proto_lock.
591 *
Willy Tarreau1a64d162007-10-28 22:26:05 +0100592 */
593void delete_listener(struct listener *listener)
594{
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200595 HA_SPIN_LOCK(PROTO_LOCK, &proto_lock);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100596 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100597 if (listener->state == LI_ASSIGNED) {
598 listener->state = LI_INIT;
599 LIST_DEL(&listener->proto_list);
600 listener->proto->nb_listeners--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100601 _HA_ATOMIC_SUB(&jobs, 1);
602 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100603 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100604 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau6ee9f8d2019-08-26 10:55:52 +0200605 HA_SPIN_UNLOCK(PROTO_LOCK, &proto_lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100606}
607
Willy Tarreaue2711c72019-02-27 15:39:41 +0100608/* Returns a suitable value for a listener's backlog. It uses the listener's,
609 * otherwise the frontend's backlog, otherwise the listener's maxconn,
610 * otherwise the frontend's maxconn, otherwise 1024.
611 */
612int listener_backlog(const struct listener *l)
613{
614 if (l->backlog)
615 return l->backlog;
616
617 if (l->bind_conf->frontend->backlog)
618 return l->bind_conf->frontend->backlog;
619
620 if (l->maxconn)
621 return l->maxconn;
622
623 if (l->bind_conf->frontend->maxconn)
624 return l->bind_conf->frontend->maxconn;
625
626 return 1024;
627}
628
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200629/* This function is called on a read event from a listening socket, corresponding
630 * to an accept. It tries to accept as many connections as possible, and for each
631 * calls the listener's accept handler (generally the frontend's accept handler).
632 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200633void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200634{
635 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100636 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200637 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100638 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100639 int next_feconn = 0;
640 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200641 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200642 int cfd;
643 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100644#ifdef USE_ACCEPT4
645 static int accept4_broken;
646#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200647
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100648 if (!l)
649 return;
650 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200651
652 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
653 * illimited, but it is probably enough.
654 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100655 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200656
Willy Tarreau93e7c002013-10-07 18:51:07 +0200657 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
658 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200659
660 if (unlikely(!max)) {
661 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200662 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100663 goto limit_global;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200664 }
665
666 if (max_accept > max)
667 max_accept = max;
668 }
669
670 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200671 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
672
673 if (unlikely(!max)) {
674 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200675 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100676 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200677 }
678
679 if (max_accept > max)
680 max_accept = max;
681 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200682#ifdef USE_OPENSSL
683 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
684 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200685
Willy Tarreaue43d5322013-10-07 20:01:52 +0200686 if (unlikely(!max)) {
687 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200688 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreau0591bf72019-12-10 12:01:21 +0100689 goto limit_global;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200690 }
691
692 if (max_accept > max)
693 max_accept = max;
694 }
695#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200696 if (p && p->fe_sps_lim) {
697 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
698
699 if (unlikely(!max)) {
700 /* frontend accept rate limit was reached */
Willy Tarreau0591bf72019-12-10 12:01:21 +0100701 expire = tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0));
702 goto limit_proxy;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200703 }
704
705 if (max_accept > max)
706 max_accept = max;
707 }
708
709 /* Note: if we fail to allocate a connection because of configured
710 * limits, we'll schedule a new attempt worst 1 second later in the
711 * worst case. If we fail due to system limits or temporary resource
712 * shortage, we try again 100ms later in the worst case.
713 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200714 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200715 struct sockaddr_storage addr;
716 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200717 unsigned int count;
Willy Tarreauaf613e82020-06-05 08:40:51 +0200718 __decl_thread(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200719
Willy Tarreau82c97892019-02-27 19:32:32 +0100720 /* pre-increase the number of connections without going too far.
721 * We process the listener, then the proxy, then the process.
722 * We know which ones to unroll based on the next_xxx value.
723 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100724 do {
725 count = l->nbconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100726 if (unlikely(l->maxconn && count >= l->maxconn)) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100727 /* the listener was marked full or another
728 * thread is going to do it.
729 */
730 next_conn = 0;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100731 listener_full(l);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100732 goto end;
733 }
734 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000735 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100736
Willy Tarreau82c97892019-02-27 19:32:32 +0100737 if (p) {
738 do {
739 count = p->feconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100740 if (unlikely(count >= p->maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100741 /* the frontend was marked full or another
742 * thread is going to do it.
743 */
744 next_feconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100745 expire = TICK_ETERNITY;
746 goto limit_proxy;
Willy Tarreau82c97892019-02-27 19:32:32 +0100747 }
748 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100749 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200750 }
751
Willy Tarreau82c97892019-02-27 19:32:32 +0100752 if (!(l->options & LI_O_UNLIMITED)) {
753 do {
754 count = actconn;
Willy Tarreau93604ed2019-11-15 10:20:07 +0100755 if (unlikely(count >= global.maxconn)) {
Willy Tarreau82c97892019-02-27 19:32:32 +0100756 /* the process was marked full or another
757 * thread is going to do it.
758 */
759 next_actconn = 0;
Willy Tarreau0591bf72019-12-10 12:01:21 +0100760 expire = tick_add(now_ms, 1000); /* try again in 1 second */
761 goto limit_global;
Willy Tarreau82c97892019-02-27 19:32:32 +0100762 }
763 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000764 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200765 }
766
William Lallemand2fe7dd02018-09-11 16:51:29 +0200767 /* with sockpair@ we don't want to do an accept */
768 if (unlikely(l->addr.ss_family == AF_CUST_SOCKPAIR)) {
769 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100770 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100771 /* just like with UNIX sockets, only the family is filled */
772 addr.ss_family = AF_UNIX;
773 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200774 } else
775
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200776#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100777 /* only call accept4() if it's known to be safe, otherwise
778 * fallback to the legacy accept() + fcntl().
779 */
780 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100781 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100782 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
783 (accept4_broken = 1))))
784#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200785 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100786 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100787
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200788 if (unlikely(cfd == -1)) {
789 switch (errno) {
790 case EAGAIN:
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100791 if (fdtab[fd].ev & (FD_POLL_HUP|FD_POLL_ERR)) {
Willy Tarreaubb660302014-05-07 19:47:02 +0200792 /* the listening socket might have been disabled in a shared
793 * process and we're a collateral victim. We'll just pause for
794 * a while in case it comes back. In the mean time, we need to
795 * clear this sticky flag.
796 */
Willy Tarreau20aeb1c2019-12-10 08:42:21 +0100797 _HA_ATOMIC_AND(&fdtab[fd].ev, ~(FD_POLL_HUP|FD_POLL_ERR));
Willy Tarreaubb660302014-05-07 19:47:02 +0200798 goto transient_error;
799 }
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200800 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200801 case EINVAL:
802 /* might be trying to accept on a shut fd (eg: soft stop) */
803 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100804 case EINTR:
805 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100806 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100807 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100808 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100809 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100810 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100811 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200812 case ENFILE:
813 if (p)
814 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100815 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
816 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200817 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200818 case EMFILE:
819 if (p)
820 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100821 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
822 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200823 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200824 case ENOBUFS:
825 case ENOMEM:
826 if (p)
827 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100828 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
829 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200830 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200831 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100832 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau92079932019-12-10 09:30:05 +0100833 max_accept = 0;
834 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200835 }
836 }
837
William Lallemandd9138002018-11-27 12:02:39 +0100838 /* we don't want to leak the FD upon reload if it's in the master */
839 if (unlikely(master == 1))
840 fcntl(cfd, F_SETFD, FD_CLOEXEC);
841
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100842 /* The connection was accepted, it must be counted as such */
843 if (l->counters)
844 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
845
Willy Tarreau82c97892019-02-27 19:32:32 +0100846 if (p)
847 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
848
849 proxy_inc_fe_conn_ctr(l, p);
850
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100851 if (!(l->options & LI_O_UNLIMITED)) {
852 count = update_freq_ctr(&global.conn_per_sec, 1);
853 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100854 }
855
Willy Tarreau64a9c052019-04-12 15:27:17 +0200856 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
857
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200858 if (unlikely(cfd >= global.maxsock)) {
859 send_log(p, LOG_EMERG,
860 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
861 p->id);
862 close(cfd);
Willy Tarreau0591bf72019-12-10 12:01:21 +0100863 expire = tick_add(now_ms, 1000); /* try again in 1 second */
864 goto limit_global;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200865 }
866
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100867 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100868 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
869 * allows the error path not to rollback on nbconn. It's more
870 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100871 */
872 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100873 next_feconn = 0;
874 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200875
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100876#if defined(USE_THREAD)
Willy Tarreau897e2c52019-03-13 15:03:53 +0100877 mask = thread_mask(l->bind_conf->bind_thread) & all_threads_mask;
Willy Tarreaua7da5e82020-03-12 17:33:29 +0100878 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ) && !stopping) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100879 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100880 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100881
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100882 /* The principle is that we have two running indexes,
883 * each visiting in turn all threads bound to this
884 * listener. The connection will be assigned to the one
885 * with the least connections, and the other one will
886 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100887 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100888 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100889 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100890
891 /* keep a copy for the final update. thr_idx is composite
892 * and made of (t2<<16) + t1.
893 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100894 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100895 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100896 unsigned long m1, m2;
897 int q1, q2;
898
899 t2 = t1 = t0;
900 t2 >>= 16;
901 t1 &= 0xFFFF;
902
903 /* t1 walks low to high bits ;
904 * t2 walks high to low.
905 */
906 m1 = mask >> t1;
907 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
908
Willy Tarreau85d04242019-04-16 18:09:13 +0200909 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100910 m1 &= ~1UL;
911 if (!m1) {
912 m1 = mask;
913 t1 = 0;
914 }
915 t1 += my_ffsl(m1) - 1;
916 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100917
Willy Tarreau85d04242019-04-16 18:09:13 +0200918 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
919 /* highest bit not set */
920 if (!m2)
921 m2 = mask;
922
923 t2 = my_flsl(m2) - 1;
924 }
925
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100926 /* now we have two distinct thread IDs belonging to the mask */
927 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
928 if (q1 >= ACCEPT_QUEUE_SIZE)
929 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100930
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100931 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
932 if (q2 >= ACCEPT_QUEUE_SIZE)
933 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100934
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100935 /* we have 3 possibilities now :
936 * q1 < q2 : t1 is less loaded than t2, so we pick it
937 * and update t2 (since t1 might still be
938 * lower than another thread)
939 * q1 > q2 : t2 is less loaded than t1, so we pick it
940 * and update t1 (since t2 might still be
941 * lower than another thread)
942 * q1 = q2 : both are equally loaded, thus we pick t1
943 * and update t1 as it will become more loaded
944 * than t2.
945 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100946
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100947 q1 += l->thr_conn[t1];
948 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100949
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100950 if (q1 - q2 < 0) {
951 t = t1;
952 t2 = t2 ? t2 - 1 : LONGBITS - 1;
953 }
954 else if (q1 - q2 > 0) {
955 t = t2;
956 t1++;
957 if (t1 >= LONGBITS)
958 t1 = 0;
959 }
960 else {
961 t = t1;
962 t1++;
963 if (t1 >= LONGBITS)
964 t1 = 0;
965 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100966
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100967 /* new value for thr_idx */
968 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +0100969 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100970
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100971 /* We successfully selected the best thread "t" for this
972 * connection. We use deferred accepts even if it's the
973 * local thread because tests show that it's the best
974 * performing model, likely due to better cache locality
975 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100976 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100977 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100978 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +0100979 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreau2bd65a72019-09-24 06:55:18 +0200980 tasklet_wakeup(ring->tasklet);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100981 continue;
982 }
983 /* If the ring is full we do a synchronous accept on
984 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100985 */
Olivier Houchard64213e92019-03-08 18:52:57 +0100986 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100987 }
988#endif // USE_THREAD
989
Olivier Houchard64213e92019-03-08 18:52:57 +0100990 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200991 ret = l->accept(l, cfd, &addr);
992 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +0200993 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200994 * we just have to ignore it (ret == 0) or it's a critical
995 * error due to a resource shortage, and we must stop the
996 * listener (ret < 0).
997 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200998 if (ret == 0) /* successful termination */
999 continue;
1000
Willy Tarreaubb660302014-05-07 19:47:02 +02001001 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001002 }
1003
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001004 /* increase the per-process number of cumulated sessions, this
1005 * may only be done once l->accept() has accepted the connection.
1006 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001007 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001008 count = update_freq_ctr(&global.sess_per_sec, 1);
1009 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001010 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001011#ifdef USE_OPENSSL
1012 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001013 count = update_freq_ctr(&global.ssl_per_sec, 1);
1014 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001015 }
1016#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001017
Willy Tarreau8d2c98b2020-05-01 09:51:11 +02001018 ti->flags &= ~TI_FL_STUCK; // this thread is still running
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001019 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001020
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001021 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001022 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001023 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001024
Willy Tarreau82c97892019-02-27 19:32:32 +01001025 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001026 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001027
1028 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001029 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001030
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001031 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreaucdcba112019-12-11 15:06:30 +01001032 (l->state == LI_LIMITED &&
1033 ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn) &&
1034 (!tick_isset(global_listener_queue_task->expire) ||
1035 tick_is_expired(global_listener_queue_task->expire, now_ms))))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001036 /* at least one thread has to this when quitting */
1037 resume_listener(l);
1038
1039 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001040 dequeue_all_listeners();
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001041
Olivier Houchard859dc802019-08-08 15:47:21 +02001042 if (p && !MT_LIST_ISEMPTY(&p->listener_queue) &&
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001043 (!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 +01001044 dequeue_proxy_listeners(p);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001045 }
Willy Tarreau4c044e22019-12-05 07:40:32 +01001046
Willy Tarreau92079932019-12-10 09:30:05 +01001047 /* Now it's getting tricky. The listener was supposed to be in LI_READY
1048 * state but in the mean time we might have changed it to LI_FULL or
1049 * LI_LIMITED, and another thread might also have turned it to
1050 * LI_PAUSED, LI_LISTEN or even LI_INI when stopping a proxy. We must
1051 * be certain to keep the FD enabled when in the READY state but we
1052 * must also stop it for other states that we might have switched to
1053 * while others re-enabled polling.
1054 */
1055 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
1056 if (l->state == LI_READY) {
1057 if (max_accept > 0)
1058 fd_cant_recv(fd);
1059 else
1060 fd_done_recv(fd);
1061 } else if (l->state > LI_ASSIGNED) {
Willy Tarreau4c044e22019-12-05 07:40:32 +01001062 fd_stop_recv(l->fd);
Willy Tarreau92079932019-12-10 09:30:05 +01001063 }
1064 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001065 return;
1066
1067 transient_error:
1068 /* pause the listener for up to 100 ms */
1069 expire = tick_add(now_ms, 100);
1070
1071 limit_global:
1072 /* (re-)queue the listener to the global queue and set it to expire no
1073 * later than <expire> ahead. The listener turns to LI_LIMITED.
1074 */
1075 limit_listener(l, &global_listener_queue);
1076 task_schedule(global_listener_queue_task, expire);
1077 goto end;
1078
1079 limit_proxy:
1080 /* (re-)queue the listener to the proxy's queue and set it to expire no
1081 * later than <expire> ahead. The listener turns to LI_LIMITED.
1082 */
1083 limit_listener(l, &p->listener_queue);
Willy Tarreaueeea8082020-01-08 19:15:07 +01001084 if (p->task && tick_isset(expire))
1085 task_schedule(p->task, expire);
Willy Tarreau0591bf72019-12-10 12:01:21 +01001086 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001087}
1088
Willy Tarreau05f50472017-09-15 09:19:58 +02001089/* Notify the listener that a connection initiated from it was released. This
1090 * is used to keep the connection count consistent and to possibly re-open
1091 * listening when it was limited.
1092 */
1093void listener_release(struct listener *l)
1094{
1095 struct proxy *fe = l->bind_conf->frontend;
1096
1097 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001098 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001099 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001100 _HA_ATOMIC_SUB(&fe->feconn, 1);
1101 _HA_ATOMIC_SUB(&l->nbconn, 1);
1102 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001103
1104 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001105 resume_listener(l);
1106
1107 /* Dequeues all of the listeners waiting for a resource */
Willy Tarreau241797a2019-12-10 14:10:52 +01001108 dequeue_all_listeners();
Willy Tarreau05f50472017-09-15 09:19:58 +02001109
Olivier Houchard859dc802019-08-08 15:47:21 +02001110 if (!MT_LIST_ISEMPTY(&fe->listener_queue) &&
Willy Tarreau05f50472017-09-15 09:19:58 +02001111 (!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 +01001112 dequeue_proxy_listeners(fe);
Willy Tarreau05f50472017-09-15 09:19:58 +02001113}
1114
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001115/* resume listeners waiting in the local listener queue. They are still in LI_LIMITED state */
1116static struct task *listener_queue_process(struct task *t, void *context, unsigned short state)
1117{
1118 struct work_list *wl = context;
1119 struct listener *l;
1120
Olivier Houchard859dc802019-08-08 15:47:21 +02001121 while ((l = MT_LIST_POP(&wl->head, struct listener *, wait_queue))) {
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001122 /* The listeners are still in the LI_LIMITED state */
1123 resume_listener(l);
1124 }
1125 return t;
1126}
1127
1128/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1129static int listener_queue_init()
1130{
1131 local_listener_queue = work_list_create(global.nbthread, listener_queue_process, NULL);
1132 if (!local_listener_queue) {
1133 ha_alert("Out of memory while initializing listener queues.\n");
1134 return ERR_FATAL|ERR_ABORT;
1135 }
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001136
1137 global_listener_queue_task = task_new(MAX_THREADS_MASK);
1138 if (!global_listener_queue_task) {
1139 ha_alert("Out of memory when initializing global listener queue\n");
1140 return ERR_FATAL|ERR_ABORT;
1141 }
1142 /* very simple initialization, users will queue the task if needed */
1143 global_listener_queue_task->context = NULL; /* not even a context! */
1144 global_listener_queue_task->process = manage_global_listener_queue;
1145
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001146 return 0;
1147}
1148
1149static void listener_queue_deinit()
1150{
1151 work_list_destroy(local_listener_queue, global.nbthread);
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001152 task_destroy(global_listener_queue_task);
1153 global_listener_queue_task = NULL;
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001154}
1155
1156REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1157REGISTER_POST_DEINIT(listener_queue_deinit);
1158
Willy Tarreaua1d97f82019-12-10 11:18:41 +01001159
1160/* This is the global management task for listeners. It enables listeners waiting
1161 * for global resources when there are enough free resource, or at least once in
1162 * a while. It is designed to be called as a task.
1163 */
1164static struct task *manage_global_listener_queue(struct task *t, void *context, unsigned short state)
1165{
1166 /* If there are still too many concurrent connections, let's wait for
1167 * some of them to go away. We don't need to re-arm the timer because
1168 * each of them will scan the queue anyway.
1169 */
1170 if (unlikely(actconn >= global.maxconn))
1171 goto out;
1172
1173 /* We should periodically try to enable listeners waiting for a global
1174 * resource here, because it is possible, though very unlikely, that
1175 * they have been blocked by a temporary lack of global resource such
1176 * as a file descriptor or memory and that the temporary condition has
1177 * disappeared.
1178 */
1179 dequeue_all_listeners();
1180
1181 out:
1182 t->expire = TICK_ETERNITY;
1183 task_queue(t);
1184 return t;
1185}
1186
Willy Tarreau26982662012-09-12 23:17:10 +02001187/*
1188 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1189 * parsing sessions.
1190 */
1191void bind_register_keywords(struct bind_kw_list *kwl)
1192{
1193 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1194}
1195
1196/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1197 * keyword is found with a NULL ->parse() function, then an attempt is made to
1198 * find one with a valid ->parse() function. This way it is possible to declare
1199 * platform-dependant, known keywords as NULL, then only declare them as valid
1200 * if some options are met. Note that if the requested keyword contains an
1201 * opening parenthesis, everything from this point is ignored.
1202 */
1203struct bind_kw *bind_find_kw(const char *kw)
1204{
1205 int index;
1206 const char *kwend;
1207 struct bind_kw_list *kwl;
1208 struct bind_kw *ret = NULL;
1209
1210 kwend = strchr(kw, '(');
1211 if (!kwend)
1212 kwend = kw + strlen(kw);
1213
1214 list_for_each_entry(kwl, &bind_keywords.list, list) {
1215 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1216 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1217 kwl->kw[index].kw[kwend-kw] == 0) {
1218 if (kwl->kw[index].parse)
1219 return &kwl->kw[index]; /* found it !*/
1220 else
1221 ret = &kwl->kw[index]; /* may be OK */
1222 }
1223 }
1224 }
1225 return ret;
1226}
1227
Willy Tarreau8638f482012-09-18 18:01:17 +02001228/* Dumps all registered "bind" keywords to the <out> string pointer. The
1229 * unsupported keywords are only dumped if their supported form was not
1230 * found.
1231 */
1232void bind_dump_kws(char **out)
1233{
1234 struct bind_kw_list *kwl;
1235 int index;
1236
Christopher Faulet784063e2020-05-18 12:14:18 +02001237 if (!out)
1238 return;
1239
Willy Tarreau8638f482012-09-18 18:01:17 +02001240 *out = NULL;
1241 list_for_each_entry(kwl, &bind_keywords.list, list) {
1242 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1243 if (kwl->kw[index].parse ||
1244 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001245 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1246 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001247 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001248 kwl->kw[index].skip ? " <arg>" : "",
1249 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001250 }
1251 }
1252 }
1253}
1254
Willy Tarreau645513a2010-05-24 20:55:15 +02001255/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001256/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001257/************************************************************************/
1258
Willy Tarreaua5e37562011-12-16 17:06:15 +01001259/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001260static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001261smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001262{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001263 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001264 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001265 return 1;
1266}
1267
Willy Tarreaua5e37562011-12-16 17:06:15 +01001268/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001269static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001270smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001271{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001272 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001273 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001274 return 1;
1275}
Jerome Magnineb421b22020-03-27 22:08:40 +01001276static int
1277smp_fetch_so_name(const struct arg *args, struct sample *smp, const char *kw, void *private)
1278{
1279 smp->data.u.str.area = smp->sess->listener->name;
1280 if (!smp->data.u.str.area)
1281 return 0;
1282
1283 smp->data.type = SMP_T_STR;
1284 smp->flags = SMP_F_CONST;
1285 smp->data.u.str.data = strlen(smp->data.u.str.area);
1286 return 1;
1287}
Willy Tarreau645513a2010-05-24 20:55:15 +02001288
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001289/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001290static 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 +02001291{
1292 struct listener *l;
1293
Willy Tarreau4348fad2012-09-20 16:48:07 +02001294 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001295 l->options |= LI_O_ACC_PROXY;
1296
1297 return 0;
1298}
1299
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001300/* parse the "accept-netscaler-cip" bind keyword */
1301static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1302{
1303 struct listener *l;
1304 uint32_t val;
1305
1306 if (!*args[cur_arg + 1]) {
1307 memprintf(err, "'%s' : missing value", args[cur_arg]);
1308 return ERR_ALERT | ERR_FATAL;
1309 }
1310
1311 val = atol(args[cur_arg + 1]);
1312 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001313 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001314 return ERR_ALERT | ERR_FATAL;
1315 }
1316
1317 list_for_each_entry(l, &conf->listeners, by_bind) {
1318 l->options |= LI_O_ACC_CIP;
1319 conf->ns_cip_magic = val;
1320 }
1321
1322 return 0;
1323}
1324
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001325/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001326static 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 +02001327{
1328 struct listener *l;
1329 int val;
1330
1331 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001332 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001333 return ERR_ALERT | ERR_FATAL;
1334 }
1335
1336 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001337 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001338 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001339 return ERR_ALERT | ERR_FATAL;
1340 }
1341
Willy Tarreau4348fad2012-09-20 16:48:07 +02001342 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001343 l->backlog = val;
1344
1345 return 0;
1346}
1347
1348/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001349static 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 +02001350{
1351 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001352 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001353 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001354
Willy Tarreau4348fad2012-09-20 16:48:07 +02001355 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001356 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001357 return ERR_ALERT | ERR_FATAL;
1358 }
1359
1360 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001361 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001362 return ERR_ALERT | ERR_FATAL;
1363 }
1364
Willy Tarreau4348fad2012-09-20 16:48:07 +02001365 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001366 new->luid = strtol(args[cur_arg + 1], &error, 10);
1367 if (*error != '\0') {
1368 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1369 return ERR_ALERT | ERR_FATAL;
1370 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001371 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001372
Willy Tarreau4348fad2012-09-20 16:48:07 +02001373 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001374 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001375 return ERR_ALERT | ERR_FATAL;
1376 }
1377
Willy Tarreau4348fad2012-09-20 16:48:07 +02001378 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001379 if (node) {
1380 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001381 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1382 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1383 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001384 return ERR_ALERT | ERR_FATAL;
1385 }
1386
Willy Tarreau4348fad2012-09-20 16:48:07 +02001387 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001388 return 0;
1389}
1390
1391/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001392static 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 +02001393{
1394 struct listener *l;
1395 int val;
1396
1397 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001398 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001399 return ERR_ALERT | ERR_FATAL;
1400 }
1401
1402 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001403 if (val < 0) {
1404 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001405 return ERR_ALERT | ERR_FATAL;
1406 }
1407
Willy Tarreau4348fad2012-09-20 16:48:07 +02001408 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001409 l->maxconn = val;
1410
1411 return 0;
1412}
1413
1414/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001415static 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 +02001416{
1417 struct listener *l;
1418
1419 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001420 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001421 return ERR_ALERT | ERR_FATAL;
1422 }
1423
Willy Tarreau4348fad2012-09-20 16:48:07 +02001424 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001425 l->name = strdup(args[cur_arg + 1]);
1426
1427 return 0;
1428}
1429
1430/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001431static 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 +02001432{
1433 struct listener *l;
1434 int val;
1435
1436 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001437 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001438 return ERR_ALERT | ERR_FATAL;
1439 }
1440
1441 val = atol(args[cur_arg + 1]);
1442 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001443 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001444 return ERR_ALERT | ERR_FATAL;
1445 }
1446
Willy Tarreau4348fad2012-09-20 16:48:07 +02001447 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001448 l->nice = val;
1449
1450 return 0;
1451}
1452
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001453/* parse the "process" bind keyword */
1454static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1455{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001456 char *slash;
1457 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001458
Christopher Fauletc644fa92017-11-23 22:44:11 +01001459 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1460 *slash = 0;
1461
Willy Tarreauff9c9142019-02-07 10:39:36 +01001462 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001463 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001464 return ERR_ALERT | ERR_FATAL;
1465 }
1466
Christopher Fauletc644fa92017-11-23 22:44:11 +01001467 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001468 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001469 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1470 return ERR_ALERT | ERR_FATAL;
1471 }
1472 *slash = '/';
1473 }
1474
1475 conf->bind_proc |= proc;
Willy Tarreaua36b3242019-02-02 13:14:34 +01001476 conf->bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001477 return 0;
1478}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001479
Christopher Fauleta717b992018-04-10 14:43:00 +02001480/* parse the "proto" bind keyword */
1481static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1482{
1483 struct ist proto;
1484
1485 if (!*args[cur_arg + 1]) {
1486 memprintf(err, "'%s' : missing value", args[cur_arg]);
1487 return ERR_ALERT | ERR_FATAL;
1488 }
1489
1490 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1491 conf->mux_proto = get_mux_proto(proto);
1492 if (!conf->mux_proto) {
1493 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1494 return ERR_ALERT | ERR_FATAL;
1495 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001496 return 0;
1497}
1498
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001499/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1500static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1501 struct proxy *defpx, const char *file, int line,
1502 char **err)
1503{
1504 if (too_many_args(1, args, err, NULL))
1505 return -1;
1506
1507 if (strcmp(args[1], "on") == 0)
1508 global.tune.options |= GTUNE_LISTENER_MQ;
1509 else if (strcmp(args[1], "off") == 0)
1510 global.tune.options &= ~GTUNE_LISTENER_MQ;
1511 else {
1512 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1513 return -1;
1514 }
1515 return 0;
1516}
1517
Willy Tarreau61612d42012-04-19 18:42:05 +02001518/* Note: must not be declared <const> as its list will be overwritten.
1519 * Please take care of keeping this list alphabetically sorted.
1520 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001521static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001522 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1523 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Jerome Magnineb421b22020-03-27 22:08:40 +01001524 { "so_name", smp_fetch_so_name, 0, NULL, SMP_T_STR, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001525 { /* END */ },
1526}};
1527
Willy Tarreau0108d902018-11-25 19:14:37 +01001528INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1529
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001530/* Note: must not be declared <const> as its list will be overwritten.
1531 * Please take care of keeping this list alphabetically sorted.
1532 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001533static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001534 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001535}};
1536
Willy Tarreau0108d902018-11-25 19:14:37 +01001537INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1538
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001539/* Note: must not be declared <const> as its list will be overwritten.
1540 * Please take care of keeping this list alphabetically sorted, doing so helps
1541 * all code contributors.
1542 * Optional keywords are also declared with a NULL ->parse() function so that
1543 * the config parser can report an appropriate error when a known keyword was
1544 * not enabled.
1545 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001546static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001547 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001548 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1549 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1550 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1551 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1552 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1553 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001554 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001555 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001556 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001557}};
1558
Willy Tarreau0108d902018-11-25 19:14:37 +01001559INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1560
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001561/* config keyword parsers */
1562static struct cfg_kw_list cfg_kws = {ILH, {
1563 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1564 { 0, NULL, NULL }
1565}};
1566
1567INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1568
Willy Tarreau645513a2010-05-24 20:55:15 +02001569/*
1570 * Local variables:
1571 * c-indent-level: 8
1572 * c-basic-offset: 8
1573 * End:
1574 */