blob: 40a774ed5768cda2c7933ca4b4ba488354062743 [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 Tarreau1bc4aab2012-10-08 20:11:03 +020021#include <common/accept4.h>
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +010022#include <common/cfgparse.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020023#include <common/config.h>
Willy Tarreaudabf2e22007-10-28 21:59:24 +010024#include <common/errors.h>
Willy Tarreau0108d902018-11-25 19:14:37 +010025#include <common/initcall.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020026#include <common/mini-clist.h>
27#include <common/standard.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020028#include <common/time.h>
29
30#include <types/global.h>
Willy Tarreaud1d54542012-09-12 22:58:11 +020031#include <types/protocol.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020032
Willy Tarreau645513a2010-05-24 20:55:15 +020033#include <proto/acl.h>
Christopher Fauleta717b992018-04-10 14:43:00 +020034#include <proto/connection.h>
Willy Tarreaub648d632007-10-28 22:13:50 +010035#include <proto/fd.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020036#include <proto/freq_ctr.h>
37#include <proto/log.h>
Willy Tarreau7a798e52016-04-14 11:13:20 +020038#include <proto/listener.h>
Willy Tarreau0de59fd2017-09-15 08:10:44 +020039#include <proto/protocol.h>
William Lallemand2fe7dd02018-09-11 16:51:29 +020040#include <proto/proto_sockpair.h>
Willy Tarreau0ccb7442013-01-07 22:54:17 +010041#include <proto/sample.h>
Willy Tarreaufb0afa72015-04-03 14:46:27 +020042#include <proto/stream.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020043#include <proto/task.h>
Willy Tarreaub648d632007-10-28 22:13:50 +010044
Willy Tarreau26982662012-09-12 23:17:10 +020045/* List head of all known bind keywords */
46static struct bind_kw_list bind_keywords = {
47 .list = LIST_HEAD_INIT(bind_keywords.list)
48};
49
Olivier Houchardf73629d2017-04-05 22:33:04 +020050struct xfer_sock_list *xfer_sock_list = NULL;
51
Willy Tarreauf2cb1692019-07-11 10:08:31 +020052/* there is one listener queue per thread so that a thread unblocking the
53 * global queue can wake up listeners bound only to foreing threads by
54 * moving them to the remote queues and waking up the associated task.
55 */
56static struct work_list *local_listener_queue;
57
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
63 * consumer). Returns the accepted fd or -1 if none was found. The listener is
64 * placed into *li. The address is copied into *addr for no more than *addr_len
65 * bytes, and the address length is returned into *addr_len.
66 */
67int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
68{
69 struct accept_queue_entry *e;
70 unsigned int pos, next;
71 struct listener *ptr;
72 int len;
73 int fd;
74
75 pos = ring->head;
76
77 if (pos == ring->tail)
78 return -1;
79
80 next = pos + 1;
81 if (next >= ACCEPT_QUEUE_SIZE)
82 next = 0;
83
84 e = &ring->entry[pos];
85
86 /* wait for the producer to update the listener's pointer */
87 while (1) {
88 ptr = e->listener;
89 __ha_barrier_load();
90 if (ptr)
91 break;
92 pl_cpu_relax();
93 }
94
95 fd = e->fd;
96 len = e->addr_len;
97 if (len > *addr_len)
98 len = *addr_len;
99
100 if (likely(len > 0))
101 memcpy(addr, &e->addr, len);
102
103 /* release the entry */
104 e->listener = NULL;
105
106 __ha_barrier_store();
107 ring->head = next;
108
109 *addr_len = len;
110 *li = ptr;
111
112 return fd;
113}
114
115
116/* tries to push a new accepted connection <fd> into ring <ring> for listener
117 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
118 * succeeds, or zero if the ring is full. Supports multiple producers.
119 */
120int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
121 struct listener *li, const void *addr, int addr_len)
122{
123 struct accept_queue_entry *e;
124 unsigned int pos, next;
125
126 pos = ring->tail;
127 do {
128 next = pos + 1;
129 if (next >= ACCEPT_QUEUE_SIZE)
130 next = 0;
131 if (next == ring->head)
132 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100133 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100134
135
136 e = &ring->entry[pos];
137
138 if (addr_len > sizeof(e->addr))
139 addr_len = sizeof(e->addr);
140
141 if (addr_len)
142 memcpy(&e->addr, addr, addr_len);
143
144 e->addr_len = addr_len;
145 e->fd = fd;
146
147 __ha_barrier_store();
148 /* now commit the change */
149
150 e->listener = li;
151 return 1;
152}
153
154/* proceed with accepting new connections */
155static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
156{
157 struct accept_queue_ring *ring = context;
158 struct listener *li;
159 struct sockaddr_storage addr;
Christopher Faulet102854c2019-04-30 12:17:13 +0200160 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100161 int addr_len;
162 int ret;
163 int fd;
164
Christopher Faulet102854c2019-04-30 12:17:13 +0200165 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
166 * is not really illimited, but it is probably enough.
167 */
168 max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
169 for (; max_accept; max_accept--) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100170 addr_len = sizeof(addr);
171 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
172 if (fd < 0)
173 break;
174
Olivier Houchard64213e92019-03-08 18:52:57 +0100175 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100176 ret = li->accept(li, fd, &addr);
177 if (ret <= 0) {
178 /* connection was terminated by the application */
179 continue;
180 }
181
182 /* increase the per-process number of cumulated sessions, this
183 * may only be done once l->accept() has accepted the connection.
184 */
185 if (!(li->options & LI_O_UNLIMITED)) {
186 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
187 update_freq_ctr(&global.sess_per_sec, 1));
188 if (li->bind_conf && li->bind_conf->is_ssl) {
189 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
190 update_freq_ctr(&global.ssl_per_sec, 1));
191 }
192 }
193 }
194
195 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200196 if (!max_accept)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100197 task_wakeup(t, TASK_WOKEN_IO);
198
199 return t;
200}
201
202/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
203static int accept_queue_init()
204{
205 struct task *t;
206 int i;
207
208 for (i = 0; i < global.nbthread; i++) {
209 t = task_new(1UL << i);
210 if (!t) {
211 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
212 return ERR_FATAL|ERR_ABORT;
213 }
Willy Tarreau0d858442019-04-12 15:25:04 +0200214 t->nice = -1024;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100215 t->process = accept_queue_process;
216 t->context = &accept_queue_rings[i];
217 accept_queue_rings[i].task = t;
218 }
219 return 0;
220}
221
222REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
223
224#endif // USE_THREAD
225
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100226/* This function adds the specified listener's file descriptor to the polling
227 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Willy Tarreauae302532014-05-07 19:22:24 +0200228 * LI_FULL state depending on its number of connections. In deamon mode, we
229 * also support binding only the relevant processes to their respective
230 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100231 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200232static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100233{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100234 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100235 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200236 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100237 !(proc_mask(listener->bind_conf->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200238 /* we don't want to enable this listener and don't
239 * want any fd event to reach it.
240 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200241 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100242 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200243 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100244 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200245 listener->state = LI_LISTEN;
246 }
Willy Tarreauae302532014-05-07 19:22:24 +0200247 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100248 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau49b046d2012-08-09 12:11:58 +0200249 fd_want_recv(listener->fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100250 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200251 }
252 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100253 listener->state = LI_FULL;
254 }
255 }
William Lallemande22f11f2018-09-11 10:06:27 +0200256 /* if this listener is supposed to be only in the master, close it in the workers */
257 if ((global.mode & MODE_MWORKER) &&
258 (listener->options & LI_O_MWORKER) &&
259 master == 0) {
260 do_unbind_listener(listener, 1);
261 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100262 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100263}
264
265/* This function removes the specified listener's file descriptor from the
266 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
267 * enters LI_LISTEN.
268 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200269static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100270{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100271 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100272 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200273 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100274 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200275 fd_stop_recv(listener->fd);
Willy Tarreau01abd022019-02-28 10:27:18 +0100276 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100277 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200278 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100279 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100280}
281
Willy Tarreaube58c382011-07-24 18:28:10 +0200282/* This function tries to temporarily disable a listener, depending on the OS
283 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
284 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
285 * closes upon SHUT_WR and refuses to rebind. So a common validation path
286 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
287 * is disabled. It normally returns non-zero, unless an error is reported.
288 */
289int pause_listener(struct listener *l)
290{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200291 int ret = 1;
292
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100293 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200294
Olivier Houchard1fc05162017-04-06 01:05:05 +0200295 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200296 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200297
Willy Tarreau092d8652014-07-07 20:22:12 +0200298 if (l->proto->pause) {
299 /* Returns < 0 in case of failure, 0 if the listener
300 * was totally stopped, or > 0 if correctly paused.
301 */
302 int ret = l->proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200303
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200304 if (ret < 0) {
305 ret = 0;
306 goto end;
307 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200308 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200309 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200310 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200311
Willy Tarreau01abd022019-02-28 10:27:18 +0100312 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200313
Willy Tarreau49b046d2012-08-09 12:11:58 +0200314 fd_stop_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200315 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200316 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100317 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200318 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200319}
320
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200321/* This function tries to resume a temporarily disabled listener. Paused, full,
322 * limited and disabled listeners are handled, which means that this function
323 * may replace enable_listener(). The resulting state will either be LI_READY
324 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200325 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200326 * foreground mode, and are ignored. If the listener was only in the assigned
327 * state, it's totally rebound. This can happen if a pause() has completely
328 * stopped it. If the resume fails, 0 is returned and an error might be
329 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200330 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100331int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200332{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200333 int ret = 1;
334
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100335 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200336
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200337 /* check that another thread didn't to the job in parallel (e.g. at the
338 * end of listen_accept() while we'd come from dequeue_all_listeners().
339 */
340 if (LIST_ADDED(&l->wait_queue))
341 goto end;
342
William Lallemand095ba4c2017-06-01 17:38:50 +0200343 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100344 !(proc_mask(l->bind_conf->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200345 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100346
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200347 if (l->state == LI_ASSIGNED) {
348 char msg[100];
349 int err;
350
351 err = l->proto->bind(l, msg, sizeof(msg));
352 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100353 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200354 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100355 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200356
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200357 if (err & (ERR_FATAL | ERR_ABORT)) {
358 ret = 0;
359 goto end;
360 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200361 }
362
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200363 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
364 ret = 0;
365 goto end;
366 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200367
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200368 if (l->proto->sock_prot == IPPROTO_TCP &&
369 l->state == LI_PAUSED &&
Willy Tarreaue2711c72019-02-27 15:39:41 +0100370 listen(l->fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200371 ret = 0;
372 goto end;
373 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200374
375 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200376 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200377
Willy Tarreau01abd022019-02-28 10:27:18 +0100378 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200379
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100380 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaube58c382011-07-24 18:28:10 +0200381 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200382 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200383 }
384
Willy Tarreauf2cb1692019-07-11 10:08:31 +0200385 if (!(thread_mask(l->bind_conf->bind_thread) & tid_bit)) {
386 /* we're not allowed to touch this listener's FD, let's requeue
387 * the listener into one of its owning thread's queue instead.
388 */
389 int first_thread = my_flsl(thread_mask(l->bind_conf->bind_thread)) - 1;
390 work_list_add(&local_listener_queue[first_thread], &l->wait_queue);
391 goto end;
392 }
393
Willy Tarreau49b046d2012-08-09 12:11:58 +0200394 fd_want_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200395 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200396 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100397 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200398 return ret;
399}
400
Willy Tarreau87b09662015-04-03 00:22:06 +0200401/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200402 * it upon next close() using resume_listener().
403 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200404static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200405{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100406 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200407 if (l->state >= LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100408 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100409 if (l->state != LI_FULL) {
410 fd_stop_recv(l->fd);
411 l->state = LI_FULL;
412 }
Willy Tarreau62793712011-07-24 19:23:38 +0200413 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100414 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200415}
416
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200417/* Marks a ready listener as limited so that we only try to re-enable it when
418 * resources are free again. It will be queued into the specified queue.
419 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200420static void limit_listener(struct listener *l, struct list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200421{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100422 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200423 if (l->state == LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100424 LIST_ADDQ_LOCKED(list, &l->wait_queue);
Willy Tarreau49b046d2012-08-09 12:11:58 +0200425 fd_stop_recv(l->fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200426 l->state = LI_LIMITED;
427 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100428 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200429}
430
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100431/* This function adds all of the protocol's listener's file descriptors to the
432 * polling lists when they are in the LI_LISTEN state. It is intended to be
433 * used as a protocol's generic enable_all() primitive, for use after the
434 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
435 * their number of connections. It always returns ERR_NONE.
436 */
437int enable_all_listeners(struct protocol *proto)
438{
439 struct listener *listener;
440
441 list_for_each_entry(listener, &proto->listeners, proto_list)
442 enable_listener(listener);
443 return ERR_NONE;
444}
445
446/* This function removes all of the protocol's listener's file descriptors from
447 * the polling lists when they are in the LI_READY or LI_FULL states. It is
448 * intended to be used as a protocol's generic disable_all() primitive. It puts
449 * the listeners into LI_LISTEN, and always returns ERR_NONE.
450 */
451int disable_all_listeners(struct protocol *proto)
452{
453 struct listener *listener;
454
455 list_for_each_entry(listener, &proto->listeners, proto_list)
456 disable_listener(listener);
457 return ERR_NONE;
458}
459
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200460/* Dequeues all of the listeners waiting for a resource in wait queue <queue>. */
461void dequeue_all_listeners(struct list *list)
462{
Willy Tarreau01abd022019-02-28 10:27:18 +0100463 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200464
Willy Tarreau01abd022019-02-28 10:27:18 +0100465 while ((listener = LIST_POP_LOCKED(list, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200466 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100467 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200468 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100469 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200470 }
471}
472
Christopher Faulet510c0d62018-03-16 10:04:47 +0100473/* Must be called with the lock held. Depending on <do_close> value, it does
474 * what unbind_listener or unbind_listener_no_close should do.
475 */
476void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100477{
Olivier Houcharda5188562019-03-08 15:35:42 +0100478 if (listener->state == LI_READY && fd_updt)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200479 fd_stop_recv(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100480
Willy Tarreau01abd022019-02-28 10:27:18 +0100481 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200482
Willy Tarreaube58c382011-07-24 18:28:10 +0200483 if (listener->state >= LI_PAUSED) {
Olivier Houchard1fc05162017-04-06 01:05:05 +0200484 if (do_close) {
485 fd_delete(listener->fd);
486 listener->fd = -1;
487 }
488 else
489 fd_remove(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100490 listener->state = LI_ASSIGNED;
491 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100492}
493
Olivier Houchard1fc05162017-04-06 01:05:05 +0200494/* This function closes the listening socket for the specified listener,
495 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100496 * LI_ASSIGNED state. This function is intended to be used as a generic
497 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200498 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100499void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200500{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100501 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100502 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100503 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200504}
505
506/* This function pretends the listener is dead, but keeps the FD opened, so
507 * that we can provide it, for conf reloading.
508 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100509void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200510{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100511 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100512 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100513 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200514}
515
Willy Tarreau3acf8c32007-10-28 22:35:41 +0100516/* This function closes all listening sockets bound to the protocol <proto>,
517 * and the listeners end in LI_ASSIGNED state if they were higher. It does not
518 * detach them from the protocol. It always returns ERR_NONE.
519 */
520int unbind_all_listeners(struct protocol *proto)
521{
522 struct listener *listener;
523
524 list_for_each_entry(listener, &proto->listeners, proto_list)
525 unbind_listener(listener);
526 return ERR_NONE;
527}
528
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200529/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
530 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
531 * allocation). The address family is taken from ss->ss_family. The number of
532 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100533 * created. If the <inherited> argument is set to 1, it specifies that the FD
534 * was obtained from a parent process.
535 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200536 * set in <err>.
537 */
538int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100539 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200540{
541 struct protocol *proto = protocol_by_family(ss->ss_family);
542 struct listener *l;
543 int port;
544
545 if (!proto) {
546 memprintf(err, "unsupported protocol family %d", ss->ss_family);
547 return 0;
548 }
549
550 for (port = portl; port <= porth; port++) {
551 l = calloc(1, sizeof(*l));
552 if (!l) {
553 memprintf(err, "out of memory");
554 return 0;
555 }
556 l->obj_type = OBJ_TYPE_LISTENER;
557 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
558 LIST_ADDQ(&bc->listeners, &l->by_bind);
559 l->bind_conf = bc;
560
561 l->fd = fd;
562 memcpy(&l->addr, ss, sizeof(*ss));
Willy Tarreau01abd022019-02-28 10:27:18 +0100563 LIST_INIT(&l->wait_queue);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200564 l->state = LI_INIT;
565
566 proto->add(l, port);
567
William Lallemand75ea0a02017-11-15 19:02:58 +0100568 if (inherited)
569 l->options |= LI_O_INHERITED;
570
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100571 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100572 _HA_ATOMIC_ADD(&jobs, 1);
573 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200574 }
575 return 1;
576}
577
Willy Tarreau1a64d162007-10-28 22:26:05 +0100578/* Delete a listener from its protocol's list of listeners. The listener's
579 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200580 * number of listeners is updated, as well as the global number of listeners
581 * and jobs. Note that the listener must have previously been unbound. This
582 * is the generic function to use to remove a listener.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100583 */
584void delete_listener(struct listener *listener)
585{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100586 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100587 if (listener->state == LI_ASSIGNED) {
588 listener->state = LI_INIT;
589 LIST_DEL(&listener->proto_list);
590 listener->proto->nb_listeners--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100591 _HA_ATOMIC_SUB(&jobs, 1);
592 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100593 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100594 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100595}
596
Willy Tarreaue2711c72019-02-27 15:39:41 +0100597/* Returns a suitable value for a listener's backlog. It uses the listener's,
598 * otherwise the frontend's backlog, otherwise the listener's maxconn,
599 * otherwise the frontend's maxconn, otherwise 1024.
600 */
601int listener_backlog(const struct listener *l)
602{
603 if (l->backlog)
604 return l->backlog;
605
606 if (l->bind_conf->frontend->backlog)
607 return l->bind_conf->frontend->backlog;
608
609 if (l->maxconn)
610 return l->maxconn;
611
612 if (l->bind_conf->frontend->maxconn)
613 return l->bind_conf->frontend->maxconn;
614
615 return 1024;
616}
617
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200618/* This function is called on a read event from a listening socket, corresponding
619 * to an accept. It tries to accept as many connections as possible, and for each
620 * calls the listener's accept handler (generally the frontend's accept handler).
621 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200622void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200623{
624 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100625 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200626 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100627 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100628 int next_feconn = 0;
629 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200630 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200631 int cfd;
632 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100633#ifdef USE_ACCEPT4
634 static int accept4_broken;
635#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200636
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100637 if (!l)
638 return;
639 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200640
641 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
642 * illimited, but it is probably enough.
643 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100644 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200645
Willy Tarreau93e7c002013-10-07 18:51:07 +0200646 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
647 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200648
649 if (unlikely(!max)) {
650 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200651 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200652 goto wait_expire;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200653 }
654
655 if (max_accept > max)
656 max_accept = max;
657 }
658
659 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200660 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
661
662 if (unlikely(!max)) {
663 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200664 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200665 goto wait_expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200666 }
667
668 if (max_accept > max)
669 max_accept = max;
670 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200671#ifdef USE_OPENSSL
672 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
673 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200674
Willy Tarreaue43d5322013-10-07 20:01:52 +0200675 if (unlikely(!max)) {
676 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200677 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200678 goto wait_expire;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200679 }
680
681 if (max_accept > max)
682 max_accept = max;
683 }
684#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200685 if (p && p->fe_sps_lim) {
686 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
687
688 if (unlikely(!max)) {
689 /* frontend accept rate limit was reached */
690 limit_listener(l, &p->listener_queue);
691 task_schedule(p->task, tick_add(now_ms, next_event_delay(&p->fe_sess_per_sec, p->fe_sps_lim, 0)));
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200692 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200693 }
694
695 if (max_accept > max)
696 max_accept = max;
697 }
698
699 /* Note: if we fail to allocate a connection because of configured
700 * limits, we'll schedule a new attempt worst 1 second later in the
701 * worst case. If we fail due to system limits or temporary resource
702 * shortage, we try again 100ms later in the worst case.
703 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200704 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200705 struct sockaddr_storage addr;
706 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200707 unsigned int count;
Willy Tarreau57cb5062019-03-15 17:16:34 +0100708 __decl_hathreads(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200709
Willy Tarreau82c97892019-02-27 19:32:32 +0100710 /* pre-increase the number of connections without going too far.
711 * We process the listener, then the proxy, then the process.
712 * We know which ones to unroll based on the next_xxx value.
713 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100714 do {
715 count = l->nbconn;
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100716 if (l->maxconn && count >= l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100717 /* the listener was marked full or another
718 * thread is going to do it.
719 */
720 next_conn = 0;
721 goto end;
722 }
723 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000724 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100725
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100726 if (l->maxconn && next_conn == l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100727 /* we filled it, mark it full */
728 listener_full(l);
729 }
730
Willy Tarreau82c97892019-02-27 19:32:32 +0100731 if (p) {
732 do {
733 count = p->feconn;
734 if (count >= p->maxconn) {
735 /* the frontend was marked full or another
736 * thread is going to do it.
737 */
738 next_feconn = 0;
739 goto end;
740 }
741 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100742 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreau82c97892019-02-27 19:32:32 +0100743
744 if (unlikely(next_feconn == p->maxconn)) {
745 /* we just filled it */
746 limit_listener(l, &p->listener_queue);
747 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200748 }
749
Willy Tarreau82c97892019-02-27 19:32:32 +0100750 if (!(l->options & LI_O_UNLIMITED)) {
751 do {
752 count = actconn;
753 if (count >= global.maxconn) {
754 /* the process was marked full or another
755 * thread is going to do it.
756 */
757 next_actconn = 0;
758 goto end;
759 }
760 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000761 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreau82c97892019-02-27 19:32:32 +0100762
763 if (unlikely(next_actconn == global.maxconn)) {
764 limit_listener(l, &global_listener_queue);
765 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
766 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200767 }
768
William Lallemand2fe7dd02018-09-11 16:51:29 +0200769 /* with sockpair@ we don't want to do an accept */
770 if (unlikely(l->addr.ss_family == AF_CUST_SOCKPAIR)) {
771 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100772 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100773 /* just like with UNIX sockets, only the family is filled */
774 addr.ss_family = AF_UNIX;
775 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200776 } else
777
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200778#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100779 /* only call accept4() if it's known to be safe, otherwise
780 * fallback to the legacy accept() + fcntl().
781 */
782 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100783 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100784 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
785 (accept4_broken = 1))))
786#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200787 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100788 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100789
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200790 if (unlikely(cfd == -1)) {
791 switch (errno) {
792 case EAGAIN:
Willy Tarreaubb660302014-05-07 19:47:02 +0200793 if (fdtab[fd].ev & FD_POLL_HUP) {
794 /* the listening socket might have been disabled in a shared
795 * process and we're a collateral victim. We'll just pause for
796 * a while in case it comes back. In the mean time, we need to
797 * clear this sticky flag.
798 */
799 fdtab[fd].ev &= ~FD_POLL_HUP;
800 goto transient_error;
801 }
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100802 fd_cant_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200803 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200804 case EINVAL:
805 /* might be trying to accept on a shut fd (eg: soft stop) */
806 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100807 case EINTR:
808 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100809 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100810 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100811 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100812 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100813 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100814 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200815 case ENFILE:
816 if (p)
817 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100818 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
819 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200820 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200821 case EMFILE:
822 if (p)
823 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100824 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
825 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200826 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200827 case ENOBUFS:
828 case ENOMEM:
829 if (p)
830 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100831 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
832 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200833 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200834 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100835 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100836 goto stop;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200837 }
838 }
839
William Lallemandd9138002018-11-27 12:02:39 +0100840 /* we don't want to leak the FD upon reload if it's in the master */
841 if (unlikely(master == 1))
842 fcntl(cfd, F_SETFD, FD_CLOEXEC);
843
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100844 /* The connection was accepted, it must be counted as such */
845 if (l->counters)
846 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
847
Willy Tarreau82c97892019-02-27 19:32:32 +0100848 if (p)
849 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
850
851 proxy_inc_fe_conn_ctr(l, p);
852
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100853 if (!(l->options & LI_O_UNLIMITED)) {
854 count = update_freq_ctr(&global.conn_per_sec, 1);
855 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100856 }
857
Willy Tarreau64a9c052019-04-12 15:27:17 +0200858 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
859
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200860 if (unlikely(cfd >= global.maxsock)) {
861 send_log(p, LOG_EMERG,
862 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
863 p->id);
864 close(cfd);
865 limit_listener(l, &global_listener_queue);
866 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200867 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200868 }
869
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100870 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100871 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
872 * allows the error path not to rollback on nbconn. It's more
873 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100874 */
875 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100876 next_feconn = 0;
877 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200878
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100879#if defined(USE_THREAD)
Willy Tarreau897e2c52019-03-13 15:03:53 +0100880 mask = thread_mask(l->bind_conf->bind_thread) & all_threads_mask;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100881 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ)) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100882 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100883 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100884
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100885 /* The principle is that we have two running indexes,
886 * each visiting in turn all threads bound to this
887 * listener. The connection will be assigned to the one
888 * with the least connections, and the other one will
889 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100890 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100891 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100892 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100893
894 /* keep a copy for the final update. thr_idx is composite
895 * and made of (t2<<16) + t1.
896 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100897 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100898 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100899 unsigned long m1, m2;
900 int q1, q2;
901
902 t2 = t1 = t0;
903 t2 >>= 16;
904 t1 &= 0xFFFF;
905
906 /* t1 walks low to high bits ;
907 * t2 walks high to low.
908 */
909 m1 = mask >> t1;
910 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
911
Willy Tarreau85d04242019-04-16 18:09:13 +0200912 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100913 m1 &= ~1UL;
914 if (!m1) {
915 m1 = mask;
916 t1 = 0;
917 }
918 t1 += my_ffsl(m1) - 1;
919 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100920
Willy Tarreau85d04242019-04-16 18:09:13 +0200921 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
922 /* highest bit not set */
923 if (!m2)
924 m2 = mask;
925
926 t2 = my_flsl(m2) - 1;
927 }
928
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100929 /* now we have two distinct thread IDs belonging to the mask */
930 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
931 if (q1 >= ACCEPT_QUEUE_SIZE)
932 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100933
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100934 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
935 if (q2 >= ACCEPT_QUEUE_SIZE)
936 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100937
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100938 /* we have 3 possibilities now :
939 * q1 < q2 : t1 is less loaded than t2, so we pick it
940 * and update t2 (since t1 might still be
941 * lower than another thread)
942 * q1 > q2 : t2 is less loaded than t1, so we pick it
943 * and update t1 (since t2 might still be
944 * lower than another thread)
945 * q1 = q2 : both are equally loaded, thus we pick t1
946 * and update t1 as it will become more loaded
947 * than t2.
948 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100949
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100950 q1 += l->thr_conn[t1];
951 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100952
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100953 if (q1 - q2 < 0) {
954 t = t1;
955 t2 = t2 ? t2 - 1 : LONGBITS - 1;
956 }
957 else if (q1 - q2 > 0) {
958 t = t2;
959 t1++;
960 if (t1 >= LONGBITS)
961 t1 = 0;
962 }
963 else {
964 t = t1;
965 t1++;
966 if (t1 >= LONGBITS)
967 t1 = 0;
968 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100969
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100970 /* new value for thr_idx */
971 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +0100972 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100973
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100974 /* We successfully selected the best thread "t" for this
975 * connection. We use deferred accepts even if it's the
976 * local thread because tests show that it's the best
977 * performing model, likely due to better cache locality
978 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100979 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100980 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100981 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +0100982 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100983 task_wakeup(ring->task, TASK_WOKEN_IO);
984 continue;
985 }
986 /* If the ring is full we do a synchronous accept on
987 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100988 */
Olivier Houchard64213e92019-03-08 18:52:57 +0100989 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100990 }
991#endif // USE_THREAD
992
Olivier Houchard64213e92019-03-08 18:52:57 +0100993 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200994 ret = l->accept(l, cfd, &addr);
995 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +0200996 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200997 * we just have to ignore it (ret == 0) or it's a critical
998 * error due to a resource shortage, and we must stop the
999 * listener (ret < 0).
1000 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001001 if (ret == 0) /* successful termination */
1002 continue;
1003
Willy Tarreaubb660302014-05-07 19:47:02 +02001004 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001005 }
1006
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001007 /* increase the per-process number of cumulated sessions, this
1008 * may only be done once l->accept() has accepted the connection.
1009 */
Willy Tarreau93e7c002013-10-07 18:51:07 +02001010 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001011 count = update_freq_ctr(&global.sess_per_sec, 1);
1012 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +02001013 }
Willy Tarreaue43d5322013-10-07 20:01:52 +02001014#ifdef USE_OPENSSL
1015 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001016 count = update_freq_ctr(&global.ssl_per_sec, 1);
1017 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +02001018 }
1019#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +02001020
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001021 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001022
Willy Tarreauaece46a2012-07-06 12:25:58 +02001023 /* we've exhausted max_accept, so there is no need to poll again */
Willy Tarreau6c11bd22014-01-24 00:54:27 +01001024 stop:
1025 fd_done_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001026 goto end;
Willy Tarreaubb660302014-05-07 19:47:02 +02001027
1028 transient_error:
1029 /* pause the listener and try again in 100 ms */
1030 expire = tick_add(now_ms, 100);
1031
1032 wait_expire:
1033 limit_listener(l, &global_listener_queue);
1034 task_schedule(global_listener_queue_task, tick_first(expire, global_listener_queue_task->expire));
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001035 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001036 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001037 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001038
Willy Tarreau82c97892019-02-27 19:32:32 +01001039 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001040 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001041
1042 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001043 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001044
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001045 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau82c97892019-02-27 19:32:32 +01001046 (l->state == LI_LIMITED && ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn)))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001047 /* at least one thread has to this when quitting */
1048 resume_listener(l);
1049
1050 /* Dequeues all of the listeners waiting for a resource */
1051 if (!LIST_ISEMPTY(&global_listener_queue))
1052 dequeue_all_listeners(&global_listener_queue);
1053
1054 if (!LIST_ISEMPTY(&p->listener_queue) &&
1055 (!p->fe_sps_lim || freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0) > 0))
1056 dequeue_all_listeners(&p->listener_queue);
1057 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001058}
1059
Willy Tarreau05f50472017-09-15 09:19:58 +02001060/* Notify the listener that a connection initiated from it was released. This
1061 * is used to keep the connection count consistent and to possibly re-open
1062 * listening when it was limited.
1063 */
1064void listener_release(struct listener *l)
1065{
1066 struct proxy *fe = l->bind_conf->frontend;
1067
1068 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001069 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001070 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001071 _HA_ATOMIC_SUB(&fe->feconn, 1);
1072 _HA_ATOMIC_SUB(&l->nbconn, 1);
1073 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001074
1075 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001076 resume_listener(l);
1077
1078 /* Dequeues all of the listeners waiting for a resource */
1079 if (!LIST_ISEMPTY(&global_listener_queue))
1080 dequeue_all_listeners(&global_listener_queue);
1081
1082 if (!LIST_ISEMPTY(&fe->listener_queue) &&
1083 (!fe->fe_sps_lim || freq_ctr_remain(&fe->fe_sess_per_sec, fe->fe_sps_lim, 0) > 0))
1084 dequeue_all_listeners(&fe->listener_queue);
1085}
1086
Willy Tarreauf2cb1692019-07-11 10:08:31 +02001087/* resume listeners waiting in the local listener queue. They are still in LI_LIMITED state */
1088static struct task *listener_queue_process(struct task *t, void *context, unsigned short state)
1089{
1090 struct work_list *wl = context;
1091 struct listener *l;
1092
1093 while ((l = LIST_POP_LOCKED(&wl->head, struct listener *, wait_queue))) {
1094 /* The listeners are still in the LI_LIMITED state */
1095 resume_listener(l);
1096 }
1097 return t;
1098}
1099
1100/* Initializes the listener queues. Returns 0 on success, otherwise ERR_* flags */
1101static int listener_queue_init()
1102{
1103 local_listener_queue = work_list_create(global.nbthread, listener_queue_process, NULL);
1104 if (!local_listener_queue) {
1105 ha_alert("Out of memory while initializing listener queues.\n");
1106 return ERR_FATAL|ERR_ABORT;
1107 }
1108 return 0;
1109}
1110
1111static void listener_queue_deinit()
1112{
1113 work_list_destroy(local_listener_queue, global.nbthread);
1114}
1115
1116REGISTER_CONFIG_POSTPARSER("multi-threaded listener queue", listener_queue_init);
1117REGISTER_POST_DEINIT(listener_queue_deinit);
1118
Willy Tarreau26982662012-09-12 23:17:10 +02001119/*
1120 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1121 * parsing sessions.
1122 */
1123void bind_register_keywords(struct bind_kw_list *kwl)
1124{
1125 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1126}
1127
1128/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1129 * keyword is found with a NULL ->parse() function, then an attempt is made to
1130 * find one with a valid ->parse() function. This way it is possible to declare
1131 * platform-dependant, known keywords as NULL, then only declare them as valid
1132 * if some options are met. Note that if the requested keyword contains an
1133 * opening parenthesis, everything from this point is ignored.
1134 */
1135struct bind_kw *bind_find_kw(const char *kw)
1136{
1137 int index;
1138 const char *kwend;
1139 struct bind_kw_list *kwl;
1140 struct bind_kw *ret = NULL;
1141
1142 kwend = strchr(kw, '(');
1143 if (!kwend)
1144 kwend = kw + strlen(kw);
1145
1146 list_for_each_entry(kwl, &bind_keywords.list, list) {
1147 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1148 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1149 kwl->kw[index].kw[kwend-kw] == 0) {
1150 if (kwl->kw[index].parse)
1151 return &kwl->kw[index]; /* found it !*/
1152 else
1153 ret = &kwl->kw[index]; /* may be OK */
1154 }
1155 }
1156 }
1157 return ret;
1158}
1159
Willy Tarreau8638f482012-09-18 18:01:17 +02001160/* Dumps all registered "bind" keywords to the <out> string pointer. The
1161 * unsupported keywords are only dumped if their supported form was not
1162 * found.
1163 */
1164void bind_dump_kws(char **out)
1165{
1166 struct bind_kw_list *kwl;
1167 int index;
1168
1169 *out = NULL;
1170 list_for_each_entry(kwl, &bind_keywords.list, list) {
1171 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1172 if (kwl->kw[index].parse ||
1173 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001174 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1175 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001176 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001177 kwl->kw[index].skip ? " <arg>" : "",
1178 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001179 }
1180 }
1181 }
1182}
1183
Willy Tarreau645513a2010-05-24 20:55:15 +02001184/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001185/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001186/************************************************************************/
1187
Willy Tarreaua5e37562011-12-16 17:06:15 +01001188/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001189static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001190smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001191{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001192 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001193 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001194 return 1;
1195}
1196
Willy Tarreaua5e37562011-12-16 17:06:15 +01001197/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001198static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001199smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001200{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001201 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001202 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001203 return 1;
1204}
1205
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001206/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001207static 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 +02001208{
1209 struct listener *l;
1210
Willy Tarreau4348fad2012-09-20 16:48:07 +02001211 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001212 l->options |= LI_O_ACC_PROXY;
1213
1214 return 0;
1215}
1216
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001217/* parse the "accept-netscaler-cip" bind keyword */
1218static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1219{
1220 struct listener *l;
1221 uint32_t val;
1222
1223 if (!*args[cur_arg + 1]) {
1224 memprintf(err, "'%s' : missing value", args[cur_arg]);
1225 return ERR_ALERT | ERR_FATAL;
1226 }
1227
1228 val = atol(args[cur_arg + 1]);
1229 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001230 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001231 return ERR_ALERT | ERR_FATAL;
1232 }
1233
1234 list_for_each_entry(l, &conf->listeners, by_bind) {
1235 l->options |= LI_O_ACC_CIP;
1236 conf->ns_cip_magic = val;
1237 }
1238
1239 return 0;
1240}
1241
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001242/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001243static 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 +02001244{
1245 struct listener *l;
1246 int val;
1247
1248 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001249 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001250 return ERR_ALERT | ERR_FATAL;
1251 }
1252
1253 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001254 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001255 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001256 return ERR_ALERT | ERR_FATAL;
1257 }
1258
Willy Tarreau4348fad2012-09-20 16:48:07 +02001259 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001260 l->backlog = val;
1261
1262 return 0;
1263}
1264
1265/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001266static 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 +02001267{
1268 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001269 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001270 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001271
Willy Tarreau4348fad2012-09-20 16:48:07 +02001272 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001273 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001274 return ERR_ALERT | ERR_FATAL;
1275 }
1276
1277 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001278 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001279 return ERR_ALERT | ERR_FATAL;
1280 }
1281
Willy Tarreau4348fad2012-09-20 16:48:07 +02001282 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001283 new->luid = strtol(args[cur_arg + 1], &error, 10);
1284 if (*error != '\0') {
1285 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1286 return ERR_ALERT | ERR_FATAL;
1287 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001288 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001289
Willy Tarreau4348fad2012-09-20 16:48:07 +02001290 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001291 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001292 return ERR_ALERT | ERR_FATAL;
1293 }
1294
Willy Tarreau4348fad2012-09-20 16:48:07 +02001295 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001296 if (node) {
1297 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001298 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1299 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1300 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001301 return ERR_ALERT | ERR_FATAL;
1302 }
1303
Willy Tarreau4348fad2012-09-20 16:48:07 +02001304 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001305 return 0;
1306}
1307
1308/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001309static 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 +02001310{
1311 struct listener *l;
1312 int val;
1313
1314 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001315 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001316 return ERR_ALERT | ERR_FATAL;
1317 }
1318
1319 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001320 if (val < 0) {
1321 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001322 return ERR_ALERT | ERR_FATAL;
1323 }
1324
Willy Tarreau4348fad2012-09-20 16:48:07 +02001325 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001326 l->maxconn = val;
1327
1328 return 0;
1329}
1330
1331/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001332static 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 +02001333{
1334 struct listener *l;
1335
1336 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001337 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001338 return ERR_ALERT | ERR_FATAL;
1339 }
1340
Willy Tarreau4348fad2012-09-20 16:48:07 +02001341 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001342 l->name = strdup(args[cur_arg + 1]);
1343
1344 return 0;
1345}
1346
1347/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001348static 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 +02001349{
1350 struct listener *l;
1351 int val;
1352
1353 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001354 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001355 return ERR_ALERT | ERR_FATAL;
1356 }
1357
1358 val = atol(args[cur_arg + 1]);
1359 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001360 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001361 return ERR_ALERT | ERR_FATAL;
1362 }
1363
Willy Tarreau4348fad2012-09-20 16:48:07 +02001364 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001365 l->nice = val;
1366
1367 return 0;
1368}
1369
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001370/* parse the "process" bind keyword */
1371static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1372{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001373 char *slash;
1374 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001375
Christopher Fauletc644fa92017-11-23 22:44:11 +01001376 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1377 *slash = 0;
1378
Willy Tarreauff9c9142019-02-07 10:39:36 +01001379 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001380 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001381 return ERR_ALERT | ERR_FATAL;
1382 }
1383
Christopher Fauletc644fa92017-11-23 22:44:11 +01001384 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001385 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001386 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1387 return ERR_ALERT | ERR_FATAL;
1388 }
1389 *slash = '/';
1390 }
1391
1392 conf->bind_proc |= proc;
Willy Tarreaua36b3242019-02-02 13:14:34 +01001393 conf->bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001394 return 0;
1395}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001396
Christopher Fauleta717b992018-04-10 14:43:00 +02001397/* parse the "proto" bind keyword */
1398static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1399{
1400 struct ist proto;
1401
1402 if (!*args[cur_arg + 1]) {
1403 memprintf(err, "'%s' : missing value", args[cur_arg]);
1404 return ERR_ALERT | ERR_FATAL;
1405 }
1406
1407 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1408 conf->mux_proto = get_mux_proto(proto);
1409 if (!conf->mux_proto) {
1410 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1411 return ERR_ALERT | ERR_FATAL;
1412 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001413 return 0;
1414}
1415
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001416/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1417static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1418 struct proxy *defpx, const char *file, int line,
1419 char **err)
1420{
1421 if (too_many_args(1, args, err, NULL))
1422 return -1;
1423
1424 if (strcmp(args[1], "on") == 0)
1425 global.tune.options |= GTUNE_LISTENER_MQ;
1426 else if (strcmp(args[1], "off") == 0)
1427 global.tune.options &= ~GTUNE_LISTENER_MQ;
1428 else {
1429 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1430 return -1;
1431 }
1432 return 0;
1433}
1434
Willy Tarreau61612d42012-04-19 18:42:05 +02001435/* Note: must not be declared <const> as its list will be overwritten.
1436 * Please take care of keeping this list alphabetically sorted.
1437 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001438static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001439 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1440 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001441 { /* END */ },
1442}};
1443
Willy Tarreau0108d902018-11-25 19:14:37 +01001444INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1445
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001446/* Note: must not be declared <const> as its list will be overwritten.
1447 * Please take care of keeping this list alphabetically sorted.
1448 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001449static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001450 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001451}};
1452
Willy Tarreau0108d902018-11-25 19:14:37 +01001453INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1454
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001455/* Note: must not be declared <const> as its list will be overwritten.
1456 * Please take care of keeping this list alphabetically sorted, doing so helps
1457 * all code contributors.
1458 * Optional keywords are also declared with a NULL ->parse() function so that
1459 * the config parser can report an appropriate error when a known keyword was
1460 * not enabled.
1461 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001462static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001463 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001464 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1465 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1466 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1467 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1468 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1469 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001470 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001471 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001472 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001473}};
1474
Willy Tarreau0108d902018-11-25 19:14:37 +01001475INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1476
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001477/* config keyword parsers */
1478static struct cfg_kw_list cfg_kws = {ILH, {
1479 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1480 { 0, NULL, NULL }
1481}};
1482
1483INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1484
Willy Tarreau645513a2010-05-24 20:55:15 +02001485/*
1486 * Local variables:
1487 * c-indent-level: 8
1488 * c-basic-offset: 8
1489 * End:
1490 */