blob: 3656c821b4b7d729daf38c11bfb05ee3ca2e50e5 [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 Tarreau1efafce2019-01-27 15:37:19 +010052#if defined(USE_THREAD)
53
54struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
55
56/* dequeue and process a pending connection from the local accept queue (single
57 * consumer). Returns the accepted fd or -1 if none was found. The listener is
58 * placed into *li. The address is copied into *addr for no more than *addr_len
59 * bytes, and the address length is returned into *addr_len.
60 */
61int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
62{
63 struct accept_queue_entry *e;
64 unsigned int pos, next;
65 struct listener *ptr;
66 int len;
67 int fd;
68
69 pos = ring->head;
70
71 if (pos == ring->tail)
72 return -1;
73
74 next = pos + 1;
75 if (next >= ACCEPT_QUEUE_SIZE)
76 next = 0;
77
78 e = &ring->entry[pos];
79
80 /* wait for the producer to update the listener's pointer */
81 while (1) {
82 ptr = e->listener;
83 __ha_barrier_load();
84 if (ptr)
85 break;
86 pl_cpu_relax();
87 }
88
89 fd = e->fd;
90 len = e->addr_len;
91 if (len > *addr_len)
92 len = *addr_len;
93
94 if (likely(len > 0))
95 memcpy(addr, &e->addr, len);
96
97 /* release the entry */
98 e->listener = NULL;
99
100 __ha_barrier_store();
101 ring->head = next;
102
103 *addr_len = len;
104 *li = ptr;
105
106 return fd;
107}
108
109
110/* tries to push a new accepted connection <fd> into ring <ring> for listener
111 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
112 * succeeds, or zero if the ring is full. Supports multiple producers.
113 */
114int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
115 struct listener *li, const void *addr, int addr_len)
116{
117 struct accept_queue_entry *e;
118 unsigned int pos, next;
119
120 pos = ring->tail;
121 do {
122 next = pos + 1;
123 if (next >= ACCEPT_QUEUE_SIZE)
124 next = 0;
125 if (next == ring->head)
126 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100127 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100128
129
130 e = &ring->entry[pos];
131
132 if (addr_len > sizeof(e->addr))
133 addr_len = sizeof(e->addr);
134
135 if (addr_len)
136 memcpy(&e->addr, addr, addr_len);
137
138 e->addr_len = addr_len;
139 e->fd = fd;
140
141 __ha_barrier_store();
142 /* now commit the change */
143
144 e->listener = li;
145 return 1;
146}
147
148/* proceed with accepting new connections */
149static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
150{
151 struct accept_queue_ring *ring = context;
152 struct listener *li;
153 struct sockaddr_storage addr;
154 int max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
155 int addr_len;
156 int ret;
157 int fd;
158
159 while (max_accept--) {
160 addr_len = sizeof(addr);
161 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
162 if (fd < 0)
163 break;
164
Olivier Houchard64213e92019-03-08 18:52:57 +0100165 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100166 ret = li->accept(li, fd, &addr);
167 if (ret <= 0) {
168 /* connection was terminated by the application */
169 continue;
170 }
171
172 /* increase the per-process number of cumulated sessions, this
173 * may only be done once l->accept() has accepted the connection.
174 */
175 if (!(li->options & LI_O_UNLIMITED)) {
176 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
177 update_freq_ctr(&global.sess_per_sec, 1));
178 if (li->bind_conf && li->bind_conf->is_ssl) {
179 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
180 update_freq_ctr(&global.ssl_per_sec, 1));
181 }
182 }
183 }
184
185 /* ran out of budget ? Let's come here ASAP */
186 if (max_accept < 0)
187 task_wakeup(t, TASK_WOKEN_IO);
188
189 return t;
190}
191
192/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
193static int accept_queue_init()
194{
195 struct task *t;
196 int i;
197
198 for (i = 0; i < global.nbthread; i++) {
199 t = task_new(1UL << i);
200 if (!t) {
201 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
202 return ERR_FATAL|ERR_ABORT;
203 }
Willy Tarreau0d858442019-04-12 15:25:04 +0200204 t->nice = -1024;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100205 t->process = accept_queue_process;
206 t->context = &accept_queue_rings[i];
207 accept_queue_rings[i].task = t;
208 }
209 return 0;
210}
211
212REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
213
214#endif // USE_THREAD
215
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100216/* This function adds the specified listener's file descriptor to the polling
217 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Willy Tarreauae302532014-05-07 19:22:24 +0200218 * LI_FULL state depending on its number of connections. In deamon mode, we
219 * also support binding only the relevant processes to their respective
220 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100221 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200222static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100223{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100224 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100225 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200226 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100227 !(proc_mask(listener->bind_conf->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200228 /* we don't want to enable this listener and don't
229 * want any fd event to reach it.
230 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200231 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100232 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200233 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100234 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200235 listener->state = LI_LISTEN;
236 }
Willy Tarreauae302532014-05-07 19:22:24 +0200237 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100238 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau49b046d2012-08-09 12:11:58 +0200239 fd_want_recv(listener->fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100240 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200241 }
242 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100243 listener->state = LI_FULL;
244 }
245 }
William Lallemande22f11f2018-09-11 10:06:27 +0200246 /* if this listener is supposed to be only in the master, close it in the workers */
247 if ((global.mode & MODE_MWORKER) &&
248 (listener->options & LI_O_MWORKER) &&
249 master == 0) {
250 do_unbind_listener(listener, 1);
251 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100252 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100253}
254
255/* This function removes the specified listener's file descriptor from the
256 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
257 * enters LI_LISTEN.
258 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200259static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100260{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100261 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100262 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200263 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100264 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200265 fd_stop_recv(listener->fd);
Willy Tarreau01abd022019-02-28 10:27:18 +0100266 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100267 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200268 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100269 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100270}
271
Willy Tarreaube58c382011-07-24 18:28:10 +0200272/* This function tries to temporarily disable a listener, depending on the OS
273 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
274 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
275 * closes upon SHUT_WR and refuses to rebind. So a common validation path
276 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
277 * is disabled. It normally returns non-zero, unless an error is reported.
278 */
279int pause_listener(struct listener *l)
280{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200281 int ret = 1;
282
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100283 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200284
Olivier Houchard1fc05162017-04-06 01:05:05 +0200285 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200286 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200287
Willy Tarreau092d8652014-07-07 20:22:12 +0200288 if (l->proto->pause) {
289 /* Returns < 0 in case of failure, 0 if the listener
290 * was totally stopped, or > 0 if correctly paused.
291 */
292 int ret = l->proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200293
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200294 if (ret < 0) {
295 ret = 0;
296 goto end;
297 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200298 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200299 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200300 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200301
Willy Tarreau01abd022019-02-28 10:27:18 +0100302 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200303
Willy Tarreau49b046d2012-08-09 12:11:58 +0200304 fd_stop_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200305 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200306 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100307 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200308 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200309}
310
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200311/* This function tries to resume a temporarily disabled listener. Paused, full,
312 * limited and disabled listeners are handled, which means that this function
313 * may replace enable_listener(). The resulting state will either be LI_READY
314 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200315 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200316 * foreground mode, and are ignored. If the listener was only in the assigned
317 * state, it's totally rebound. This can happen if a pause() has completely
318 * stopped it. If the resume fails, 0 is returned and an error might be
319 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200320 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100321int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200322{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200323 int ret = 1;
324
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100325 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200326
William Lallemand095ba4c2017-06-01 17:38:50 +0200327 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100328 !(proc_mask(l->bind_conf->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200329 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100330
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200331 if (l->state == LI_ASSIGNED) {
332 char msg[100];
333 int err;
334
335 err = l->proto->bind(l, msg, sizeof(msg));
336 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100337 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200338 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100339 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200340
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200341 if (err & (ERR_FATAL | ERR_ABORT)) {
342 ret = 0;
343 goto end;
344 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200345 }
346
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200347 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
348 ret = 0;
349 goto end;
350 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200351
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200352 if (l->proto->sock_prot == IPPROTO_TCP &&
353 l->state == LI_PAUSED &&
Willy Tarreaue2711c72019-02-27 15:39:41 +0100354 listen(l->fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200355 ret = 0;
356 goto end;
357 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200358
359 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200360 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200361
Willy Tarreau01abd022019-02-28 10:27:18 +0100362 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200363
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100364 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaube58c382011-07-24 18:28:10 +0200365 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200366 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200367 }
368
Willy Tarreau49b046d2012-08-09 12:11:58 +0200369 fd_want_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200370 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200371 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100372 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200373 return ret;
374}
375
Willy Tarreau87b09662015-04-03 00:22:06 +0200376/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200377 * it upon next close() using resume_listener().
378 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200379static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200380{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100381 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200382 if (l->state >= LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100383 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100384 if (l->state != LI_FULL) {
385 fd_stop_recv(l->fd);
386 l->state = LI_FULL;
387 }
Willy Tarreau62793712011-07-24 19:23:38 +0200388 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100389 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200390}
391
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200392/* Marks a ready listener as limited so that we only try to re-enable it when
393 * resources are free again. It will be queued into the specified queue.
394 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200395static void limit_listener(struct listener *l, struct list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200396{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100397 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200398 if (l->state == LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100399 LIST_ADDQ_LOCKED(list, &l->wait_queue);
Willy Tarreau49b046d2012-08-09 12:11:58 +0200400 fd_stop_recv(l->fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200401 l->state = LI_LIMITED;
402 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100403 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200404}
405
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100406/* This function adds all of the protocol's listener's file descriptors to the
407 * polling lists when they are in the LI_LISTEN state. It is intended to be
408 * used as a protocol's generic enable_all() primitive, for use after the
409 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
410 * their number of connections. It always returns ERR_NONE.
411 */
412int enable_all_listeners(struct protocol *proto)
413{
414 struct listener *listener;
415
416 list_for_each_entry(listener, &proto->listeners, proto_list)
417 enable_listener(listener);
418 return ERR_NONE;
419}
420
421/* This function removes all of the protocol's listener's file descriptors from
422 * the polling lists when they are in the LI_READY or LI_FULL states. It is
423 * intended to be used as a protocol's generic disable_all() primitive. It puts
424 * the listeners into LI_LISTEN, and always returns ERR_NONE.
425 */
426int disable_all_listeners(struct protocol *proto)
427{
428 struct listener *listener;
429
430 list_for_each_entry(listener, &proto->listeners, proto_list)
431 disable_listener(listener);
432 return ERR_NONE;
433}
434
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200435/* Dequeues all of the listeners waiting for a resource in wait queue <queue>. */
436void dequeue_all_listeners(struct list *list)
437{
Willy Tarreau01abd022019-02-28 10:27:18 +0100438 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200439
Willy Tarreau01abd022019-02-28 10:27:18 +0100440 while ((listener = LIST_POP_LOCKED(list, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200441 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100442 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200443 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100444 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200445 }
446}
447
Christopher Faulet510c0d62018-03-16 10:04:47 +0100448/* Must be called with the lock held. Depending on <do_close> value, it does
449 * what unbind_listener or unbind_listener_no_close should do.
450 */
451void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100452{
Olivier Houcharda5188562019-03-08 15:35:42 +0100453 if (listener->state == LI_READY && fd_updt)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200454 fd_stop_recv(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100455
Willy Tarreau01abd022019-02-28 10:27:18 +0100456 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200457
Willy Tarreaube58c382011-07-24 18:28:10 +0200458 if (listener->state >= LI_PAUSED) {
Olivier Houchard1fc05162017-04-06 01:05:05 +0200459 if (do_close) {
460 fd_delete(listener->fd);
461 listener->fd = -1;
462 }
463 else
464 fd_remove(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100465 listener->state = LI_ASSIGNED;
466 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100467}
468
Olivier Houchard1fc05162017-04-06 01:05:05 +0200469/* This function closes the listening socket for the specified listener,
470 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100471 * LI_ASSIGNED state. This function is intended to be used as a generic
472 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200473 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100474void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200475{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100476 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100477 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100478 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200479}
480
481/* This function pretends the listener is dead, but keeps the FD opened, so
482 * that we can provide it, for conf reloading.
483 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100484void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200485{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100486 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100487 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100488 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200489}
490
Willy Tarreau3acf8c32007-10-28 22:35:41 +0100491/* This function closes all listening sockets bound to the protocol <proto>,
492 * and the listeners end in LI_ASSIGNED state if they were higher. It does not
493 * detach them from the protocol. It always returns ERR_NONE.
494 */
495int unbind_all_listeners(struct protocol *proto)
496{
497 struct listener *listener;
498
499 list_for_each_entry(listener, &proto->listeners, proto_list)
500 unbind_listener(listener);
501 return ERR_NONE;
502}
503
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200504/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
505 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
506 * allocation). The address family is taken from ss->ss_family. The number of
507 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100508 * created. If the <inherited> argument is set to 1, it specifies that the FD
509 * was obtained from a parent process.
510 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200511 * set in <err>.
512 */
513int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100514 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200515{
516 struct protocol *proto = protocol_by_family(ss->ss_family);
517 struct listener *l;
518 int port;
519
520 if (!proto) {
521 memprintf(err, "unsupported protocol family %d", ss->ss_family);
522 return 0;
523 }
524
525 for (port = portl; port <= porth; port++) {
526 l = calloc(1, sizeof(*l));
527 if (!l) {
528 memprintf(err, "out of memory");
529 return 0;
530 }
531 l->obj_type = OBJ_TYPE_LISTENER;
532 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
533 LIST_ADDQ(&bc->listeners, &l->by_bind);
534 l->bind_conf = bc;
535
536 l->fd = fd;
537 memcpy(&l->addr, ss, sizeof(*ss));
Willy Tarreau01abd022019-02-28 10:27:18 +0100538 LIST_INIT(&l->wait_queue);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200539 l->state = LI_INIT;
540
541 proto->add(l, port);
542
William Lallemand75ea0a02017-11-15 19:02:58 +0100543 if (inherited)
544 l->options |= LI_O_INHERITED;
545
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100546 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100547 _HA_ATOMIC_ADD(&jobs, 1);
548 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200549 }
550 return 1;
551}
552
Willy Tarreau1a64d162007-10-28 22:26:05 +0100553/* Delete a listener from its protocol's list of listeners. The listener's
554 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200555 * number of listeners is updated, as well as the global number of listeners
556 * and jobs. Note that the listener must have previously been unbound. This
557 * is the generic function to use to remove a listener.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100558 */
559void delete_listener(struct listener *listener)
560{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100561 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100562 if (listener->state == LI_ASSIGNED) {
563 listener->state = LI_INIT;
564 LIST_DEL(&listener->proto_list);
565 listener->proto->nb_listeners--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100566 _HA_ATOMIC_SUB(&jobs, 1);
567 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100568 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100569 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100570}
571
Willy Tarreaue2711c72019-02-27 15:39:41 +0100572/* Returns a suitable value for a listener's backlog. It uses the listener's,
573 * otherwise the frontend's backlog, otherwise the listener's maxconn,
574 * otherwise the frontend's maxconn, otherwise 1024.
575 */
576int listener_backlog(const struct listener *l)
577{
578 if (l->backlog)
579 return l->backlog;
580
581 if (l->bind_conf->frontend->backlog)
582 return l->bind_conf->frontend->backlog;
583
584 if (l->maxconn)
585 return l->maxconn;
586
587 if (l->bind_conf->frontend->maxconn)
588 return l->bind_conf->frontend->maxconn;
589
590 return 1024;
591}
592
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200593/* This function is called on a read event from a listening socket, corresponding
594 * to an accept. It tries to accept as many connections as possible, and for each
595 * calls the listener's accept handler (generally the frontend's accept handler).
596 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200597void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200598{
599 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100600 struct proxy *p;
601 int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100602 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100603 int next_feconn = 0;
604 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200605 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200606 int cfd;
607 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100608#ifdef USE_ACCEPT4
609 static int accept4_broken;
610#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200611
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100612 if (!l)
613 return;
614 p = l->bind_conf->frontend;
615 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200616
Willy Tarreau93e7c002013-10-07 18:51:07 +0200617 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
618 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200619
620 if (unlikely(!max)) {
621 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200622 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200623 goto wait_expire;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200624 }
625
626 if (max_accept > max)
627 max_accept = max;
628 }
629
630 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200631 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
632
633 if (unlikely(!max)) {
634 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200635 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200636 goto wait_expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200637 }
638
639 if (max_accept > max)
640 max_accept = max;
641 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200642#ifdef USE_OPENSSL
643 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
644 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200645
Willy Tarreaue43d5322013-10-07 20:01:52 +0200646 if (unlikely(!max)) {
647 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200648 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200649 goto wait_expire;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200650 }
651
652 if (max_accept > max)
653 max_accept = max;
654 }
655#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200656 if (p && p->fe_sps_lim) {
657 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
658
659 if (unlikely(!max)) {
660 /* frontend accept rate limit was reached */
661 limit_listener(l, &p->listener_queue);
662 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 +0200663 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200664 }
665
666 if (max_accept > max)
667 max_accept = max;
668 }
669
670 /* Note: if we fail to allocate a connection because of configured
671 * limits, we'll schedule a new attempt worst 1 second later in the
672 * worst case. If we fail due to system limits or temporary resource
673 * shortage, we try again 100ms later in the worst case.
674 */
Willy Tarreau82c97892019-02-27 19:32:32 +0100675 for (; max_accept-- > 0; next_conn = next_feconn = next_actconn = 0) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200676 struct sockaddr_storage addr;
677 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200678 unsigned int count;
Willy Tarreau57cb5062019-03-15 17:16:34 +0100679 __decl_hathreads(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200680
Willy Tarreau82c97892019-02-27 19:32:32 +0100681 /* pre-increase the number of connections without going too far.
682 * We process the listener, then the proxy, then the process.
683 * We know which ones to unroll based on the next_xxx value.
684 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100685 do {
686 count = l->nbconn;
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100687 if (l->maxconn && count >= l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100688 /* the listener was marked full or another
689 * thread is going to do it.
690 */
691 next_conn = 0;
692 goto end;
693 }
694 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000695 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100696
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100697 if (l->maxconn && next_conn == l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100698 /* we filled it, mark it full */
699 listener_full(l);
700 }
701
Willy Tarreau82c97892019-02-27 19:32:32 +0100702 if (p) {
703 do {
704 count = p->feconn;
705 if (count >= p->maxconn) {
706 /* the frontend was marked full or another
707 * thread is going to do it.
708 */
709 next_feconn = 0;
710 goto end;
711 }
712 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100713 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreau82c97892019-02-27 19:32:32 +0100714
715 if (unlikely(next_feconn == p->maxconn)) {
716 /* we just filled it */
717 limit_listener(l, &p->listener_queue);
718 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200719 }
720
Willy Tarreau82c97892019-02-27 19:32:32 +0100721 if (!(l->options & LI_O_UNLIMITED)) {
722 do {
723 count = actconn;
724 if (count >= global.maxconn) {
725 /* the process was marked full or another
726 * thread is going to do it.
727 */
728 next_actconn = 0;
729 goto end;
730 }
731 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000732 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreau82c97892019-02-27 19:32:32 +0100733
734 if (unlikely(next_actconn == global.maxconn)) {
735 limit_listener(l, &global_listener_queue);
736 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
737 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200738 }
739
William Lallemand2fe7dd02018-09-11 16:51:29 +0200740 /* with sockpair@ we don't want to do an accept */
741 if (unlikely(l->addr.ss_family == AF_CUST_SOCKPAIR)) {
742 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100743 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100744 /* just like with UNIX sockets, only the family is filled */
745 addr.ss_family = AF_UNIX;
746 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200747 } else
748
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200749#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100750 /* only call accept4() if it's known to be safe, otherwise
751 * fallback to the legacy accept() + fcntl().
752 */
753 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100754 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100755 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
756 (accept4_broken = 1))))
757#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200758 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100759 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100760
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200761 if (unlikely(cfd == -1)) {
762 switch (errno) {
763 case EAGAIN:
Willy Tarreaubb660302014-05-07 19:47:02 +0200764 if (fdtab[fd].ev & FD_POLL_HUP) {
765 /* the listening socket might have been disabled in a shared
766 * process and we're a collateral victim. We'll just pause for
767 * a while in case it comes back. In the mean time, we need to
768 * clear this sticky flag.
769 */
770 fdtab[fd].ev &= ~FD_POLL_HUP;
771 goto transient_error;
772 }
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100773 fd_cant_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200774 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200775 case EINVAL:
776 /* might be trying to accept on a shut fd (eg: soft stop) */
777 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100778 case EINTR:
779 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100780 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100781 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100782 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100783 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100784 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100785 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200786 case ENFILE:
787 if (p)
788 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100789 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
790 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200791 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200792 case EMFILE:
793 if (p)
794 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100795 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
796 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200797 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200798 case ENOBUFS:
799 case ENOMEM:
800 if (p)
801 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100802 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
803 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200804 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200805 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100806 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100807 goto stop;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200808 }
809 }
810
William Lallemandd9138002018-11-27 12:02:39 +0100811 /* we don't want to leak the FD upon reload if it's in the master */
812 if (unlikely(master == 1))
813 fcntl(cfd, F_SETFD, FD_CLOEXEC);
814
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100815 /* The connection was accepted, it must be counted as such */
816 if (l->counters)
817 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
818
Willy Tarreau82c97892019-02-27 19:32:32 +0100819 if (p)
820 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
821
822 proxy_inc_fe_conn_ctr(l, p);
823
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100824 if (!(l->options & LI_O_UNLIMITED)) {
825 count = update_freq_ctr(&global.conn_per_sec, 1);
826 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100827 }
828
Willy Tarreau64a9c052019-04-12 15:27:17 +0200829 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
830
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200831 if (unlikely(cfd >= global.maxsock)) {
832 send_log(p, LOG_EMERG,
833 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
834 p->id);
835 close(cfd);
836 limit_listener(l, &global_listener_queue);
837 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200838 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200839 }
840
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100841 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100842 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
843 * allows the error path not to rollback on nbconn. It's more
844 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100845 */
846 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100847 next_feconn = 0;
848 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200849
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100850#if defined(USE_THREAD)
Willy Tarreau897e2c52019-03-13 15:03:53 +0100851 mask = thread_mask(l->bind_conf->bind_thread) & all_threads_mask;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100852 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ)) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100853 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100854 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100855
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100856 /* The principle is that we have two running indexes,
857 * each visiting in turn all threads bound to this
858 * listener. The connection will be assigned to the one
859 * with the least connections, and the other one will
860 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100861 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100862 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100863 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100864
865 /* keep a copy for the final update. thr_idx is composite
866 * and made of (t2<<16) + t1.
867 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100868 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100869 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100870 unsigned long m1, m2;
871 int q1, q2;
872
873 t2 = t1 = t0;
874 t2 >>= 16;
875 t1 &= 0xFFFF;
876
877 /* t1 walks low to high bits ;
878 * t2 walks high to low.
879 */
880 m1 = mask >> t1;
881 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
882
Willy Tarreau85d04242019-04-16 18:09:13 +0200883 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100884 m1 &= ~1UL;
885 if (!m1) {
886 m1 = mask;
887 t1 = 0;
888 }
889 t1 += my_ffsl(m1) - 1;
890 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100891
Willy Tarreau85d04242019-04-16 18:09:13 +0200892 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
893 /* highest bit not set */
894 if (!m2)
895 m2 = mask;
896
897 t2 = my_flsl(m2) - 1;
898 }
899
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100900 /* now we have two distinct thread IDs belonging to the mask */
901 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
902 if (q1 >= ACCEPT_QUEUE_SIZE)
903 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100904
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100905 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
906 if (q2 >= ACCEPT_QUEUE_SIZE)
907 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100908
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100909 /* we have 3 possibilities now :
910 * q1 < q2 : t1 is less loaded than t2, so we pick it
911 * and update t2 (since t1 might still be
912 * lower than another thread)
913 * q1 > q2 : t2 is less loaded than t1, so we pick it
914 * and update t1 (since t2 might still be
915 * lower than another thread)
916 * q1 = q2 : both are equally loaded, thus we pick t1
917 * and update t1 as it will become more loaded
918 * than t2.
919 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100920
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100921 q1 += l->thr_conn[t1];
922 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100923
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100924 if (q1 - q2 < 0) {
925 t = t1;
926 t2 = t2 ? t2 - 1 : LONGBITS - 1;
927 }
928 else if (q1 - q2 > 0) {
929 t = t2;
930 t1++;
931 if (t1 >= LONGBITS)
932 t1 = 0;
933 }
934 else {
935 t = t1;
936 t1++;
937 if (t1 >= LONGBITS)
938 t1 = 0;
939 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100940
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100941 /* new value for thr_idx */
942 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +0100943 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100944
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100945 /* We successfully selected the best thread "t" for this
946 * connection. We use deferred accepts even if it's the
947 * local thread because tests show that it's the best
948 * performing model, likely due to better cache locality
949 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100950 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100951 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100952 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +0100953 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100954 task_wakeup(ring->task, TASK_WOKEN_IO);
955 continue;
956 }
957 /* If the ring is full we do a synchronous accept on
958 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100959 */
Olivier Houchard64213e92019-03-08 18:52:57 +0100960 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100961 }
962#endif // USE_THREAD
963
Olivier Houchard64213e92019-03-08 18:52:57 +0100964 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200965 ret = l->accept(l, cfd, &addr);
966 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +0200967 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200968 * we just have to ignore it (ret == 0) or it's a critical
969 * error due to a resource shortage, and we must stop the
970 * listener (ret < 0).
971 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200972 if (ret == 0) /* successful termination */
973 continue;
974
Willy Tarreaubb660302014-05-07 19:47:02 +0200975 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200976 }
977
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100978 /* increase the per-process number of cumulated sessions, this
979 * may only be done once l->accept() has accepted the connection.
980 */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200981 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200982 count = update_freq_ctr(&global.sess_per_sec, 1);
983 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200984 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200985#ifdef USE_OPENSSL
986 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200987 count = update_freq_ctr(&global.ssl_per_sec, 1);
988 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +0200989 }
990#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +0200991
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100992 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200993
Willy Tarreauaece46a2012-07-06 12:25:58 +0200994 /* we've exhausted max_accept, so there is no need to poll again */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100995 stop:
996 fd_done_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200997 goto end;
Willy Tarreaubb660302014-05-07 19:47:02 +0200998
999 transient_error:
1000 /* pause the listener and try again in 100 ms */
1001 expire = tick_add(now_ms, 100);
1002
1003 wait_expire:
1004 limit_listener(l, &global_listener_queue);
1005 task_schedule(global_listener_queue_task, tick_first(expire, global_listener_queue_task->expire));
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001006 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001007 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001008 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001009
Willy Tarreau82c97892019-02-27 19:32:32 +01001010 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001011 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001012
1013 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001014 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001015
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001016 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau82c97892019-02-27 19:32:32 +01001017 (l->state == LI_LIMITED && ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn)))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001018 /* at least one thread has to this when quitting */
1019 resume_listener(l);
1020
1021 /* Dequeues all of the listeners waiting for a resource */
1022 if (!LIST_ISEMPTY(&global_listener_queue))
1023 dequeue_all_listeners(&global_listener_queue);
1024
1025 if (!LIST_ISEMPTY(&p->listener_queue) &&
1026 (!p->fe_sps_lim || freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0) > 0))
1027 dequeue_all_listeners(&p->listener_queue);
1028 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001029}
1030
Willy Tarreau05f50472017-09-15 09:19:58 +02001031/* Notify the listener that a connection initiated from it was released. This
1032 * is used to keep the connection count consistent and to possibly re-open
1033 * listening when it was limited.
1034 */
1035void listener_release(struct listener *l)
1036{
1037 struct proxy *fe = l->bind_conf->frontend;
1038
1039 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001040 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001041 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001042 _HA_ATOMIC_SUB(&fe->feconn, 1);
1043 _HA_ATOMIC_SUB(&l->nbconn, 1);
1044 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001045
1046 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001047 resume_listener(l);
1048
1049 /* Dequeues all of the listeners waiting for a resource */
1050 if (!LIST_ISEMPTY(&global_listener_queue))
1051 dequeue_all_listeners(&global_listener_queue);
1052
1053 if (!LIST_ISEMPTY(&fe->listener_queue) &&
1054 (!fe->fe_sps_lim || freq_ctr_remain(&fe->fe_sess_per_sec, fe->fe_sps_lim, 0) > 0))
1055 dequeue_all_listeners(&fe->listener_queue);
1056}
1057
Willy Tarreau26982662012-09-12 23:17:10 +02001058/*
1059 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1060 * parsing sessions.
1061 */
1062void bind_register_keywords(struct bind_kw_list *kwl)
1063{
1064 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1065}
1066
1067/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1068 * keyword is found with a NULL ->parse() function, then an attempt is made to
1069 * find one with a valid ->parse() function. This way it is possible to declare
1070 * platform-dependant, known keywords as NULL, then only declare them as valid
1071 * if some options are met. Note that if the requested keyword contains an
1072 * opening parenthesis, everything from this point is ignored.
1073 */
1074struct bind_kw *bind_find_kw(const char *kw)
1075{
1076 int index;
1077 const char *kwend;
1078 struct bind_kw_list *kwl;
1079 struct bind_kw *ret = NULL;
1080
1081 kwend = strchr(kw, '(');
1082 if (!kwend)
1083 kwend = kw + strlen(kw);
1084
1085 list_for_each_entry(kwl, &bind_keywords.list, list) {
1086 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1087 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1088 kwl->kw[index].kw[kwend-kw] == 0) {
1089 if (kwl->kw[index].parse)
1090 return &kwl->kw[index]; /* found it !*/
1091 else
1092 ret = &kwl->kw[index]; /* may be OK */
1093 }
1094 }
1095 }
1096 return ret;
1097}
1098
Willy Tarreau8638f482012-09-18 18:01:17 +02001099/* Dumps all registered "bind" keywords to the <out> string pointer. The
1100 * unsupported keywords are only dumped if their supported form was not
1101 * found.
1102 */
1103void bind_dump_kws(char **out)
1104{
1105 struct bind_kw_list *kwl;
1106 int index;
1107
1108 *out = NULL;
1109 list_for_each_entry(kwl, &bind_keywords.list, list) {
1110 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1111 if (kwl->kw[index].parse ||
1112 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001113 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1114 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001115 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001116 kwl->kw[index].skip ? " <arg>" : "",
1117 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001118 }
1119 }
1120 }
1121}
1122
Willy Tarreau645513a2010-05-24 20:55:15 +02001123/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001124/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001125/************************************************************************/
1126
Willy Tarreaua5e37562011-12-16 17:06:15 +01001127/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001128static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001129smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001130{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001131 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001132 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001133 return 1;
1134}
1135
Willy Tarreaua5e37562011-12-16 17:06:15 +01001136/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001137static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001138smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001139{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001140 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001141 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001142 return 1;
1143}
1144
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001145/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001146static 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 +02001147{
1148 struct listener *l;
1149
Willy Tarreau4348fad2012-09-20 16:48:07 +02001150 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001151 l->options |= LI_O_ACC_PROXY;
1152
1153 return 0;
1154}
1155
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001156/* parse the "accept-netscaler-cip" bind keyword */
1157static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1158{
1159 struct listener *l;
1160 uint32_t val;
1161
1162 if (!*args[cur_arg + 1]) {
1163 memprintf(err, "'%s' : missing value", args[cur_arg]);
1164 return ERR_ALERT | ERR_FATAL;
1165 }
1166
1167 val = atol(args[cur_arg + 1]);
1168 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001169 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001170 return ERR_ALERT | ERR_FATAL;
1171 }
1172
1173 list_for_each_entry(l, &conf->listeners, by_bind) {
1174 l->options |= LI_O_ACC_CIP;
1175 conf->ns_cip_magic = val;
1176 }
1177
1178 return 0;
1179}
1180
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001181/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001182static 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 +02001183{
1184 struct listener *l;
1185 int val;
1186
1187 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001188 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001189 return ERR_ALERT | ERR_FATAL;
1190 }
1191
1192 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001193 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001194 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001195 return ERR_ALERT | ERR_FATAL;
1196 }
1197
Willy Tarreau4348fad2012-09-20 16:48:07 +02001198 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001199 l->backlog = val;
1200
1201 return 0;
1202}
1203
1204/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001205static 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 +02001206{
1207 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001208 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001209 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001210
Willy Tarreau4348fad2012-09-20 16:48:07 +02001211 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001212 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001213 return ERR_ALERT | ERR_FATAL;
1214 }
1215
1216 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001217 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001218 return ERR_ALERT | ERR_FATAL;
1219 }
1220
Willy Tarreau4348fad2012-09-20 16:48:07 +02001221 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001222 new->luid = strtol(args[cur_arg + 1], &error, 10);
1223 if (*error != '\0') {
1224 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1225 return ERR_ALERT | ERR_FATAL;
1226 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001227 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001228
Willy Tarreau4348fad2012-09-20 16:48:07 +02001229 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001230 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001231 return ERR_ALERT | ERR_FATAL;
1232 }
1233
Willy Tarreau4348fad2012-09-20 16:48:07 +02001234 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001235 if (node) {
1236 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001237 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1238 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1239 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001240 return ERR_ALERT | ERR_FATAL;
1241 }
1242
Willy Tarreau4348fad2012-09-20 16:48:07 +02001243 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001244 return 0;
1245}
1246
1247/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001248static 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 +02001249{
1250 struct listener *l;
1251 int val;
1252
1253 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001254 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001255 return ERR_ALERT | ERR_FATAL;
1256 }
1257
1258 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001259 if (val < 0) {
1260 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001261 return ERR_ALERT | ERR_FATAL;
1262 }
1263
Willy Tarreau4348fad2012-09-20 16:48:07 +02001264 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001265 l->maxconn = val;
1266
1267 return 0;
1268}
1269
1270/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001271static 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 +02001272{
1273 struct listener *l;
1274
1275 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001276 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001277 return ERR_ALERT | ERR_FATAL;
1278 }
1279
Willy Tarreau4348fad2012-09-20 16:48:07 +02001280 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001281 l->name = strdup(args[cur_arg + 1]);
1282
1283 return 0;
1284}
1285
1286/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001287static 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 +02001288{
1289 struct listener *l;
1290 int val;
1291
1292 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001293 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001294 return ERR_ALERT | ERR_FATAL;
1295 }
1296
1297 val = atol(args[cur_arg + 1]);
1298 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001299 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001300 return ERR_ALERT | ERR_FATAL;
1301 }
1302
Willy Tarreau4348fad2012-09-20 16:48:07 +02001303 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001304 l->nice = val;
1305
1306 return 0;
1307}
1308
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001309/* parse the "process" bind keyword */
1310static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1311{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001312 char *slash;
1313 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001314
Christopher Fauletc644fa92017-11-23 22:44:11 +01001315 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1316 *slash = 0;
1317
Willy Tarreauff9c9142019-02-07 10:39:36 +01001318 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001319 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001320 return ERR_ALERT | ERR_FATAL;
1321 }
1322
Christopher Fauletc644fa92017-11-23 22:44:11 +01001323 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001324 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001325 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1326 return ERR_ALERT | ERR_FATAL;
1327 }
1328 *slash = '/';
1329 }
1330
1331 conf->bind_proc |= proc;
Willy Tarreaua36b3242019-02-02 13:14:34 +01001332 conf->bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001333 return 0;
1334}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001335
Christopher Fauleta717b992018-04-10 14:43:00 +02001336/* parse the "proto" bind keyword */
1337static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1338{
1339 struct ist proto;
1340
1341 if (!*args[cur_arg + 1]) {
1342 memprintf(err, "'%s' : missing value", args[cur_arg]);
1343 return ERR_ALERT | ERR_FATAL;
1344 }
1345
1346 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1347 conf->mux_proto = get_mux_proto(proto);
1348 if (!conf->mux_proto) {
1349 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1350 return ERR_ALERT | ERR_FATAL;
1351 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001352 return 0;
1353}
1354
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001355/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1356static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1357 struct proxy *defpx, const char *file, int line,
1358 char **err)
1359{
1360 if (too_many_args(1, args, err, NULL))
1361 return -1;
1362
1363 if (strcmp(args[1], "on") == 0)
1364 global.tune.options |= GTUNE_LISTENER_MQ;
1365 else if (strcmp(args[1], "off") == 0)
1366 global.tune.options &= ~GTUNE_LISTENER_MQ;
1367 else {
1368 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1369 return -1;
1370 }
1371 return 0;
1372}
1373
Willy Tarreau61612d42012-04-19 18:42:05 +02001374/* Note: must not be declared <const> as its list will be overwritten.
1375 * Please take care of keeping this list alphabetically sorted.
1376 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001377static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001378 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1379 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001380 { /* END */ },
1381}};
1382
Willy Tarreau0108d902018-11-25 19:14:37 +01001383INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1384
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001385/* Note: must not be declared <const> as its list will be overwritten.
1386 * Please take care of keeping this list alphabetically sorted.
1387 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001388static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001389 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001390}};
1391
Willy Tarreau0108d902018-11-25 19:14:37 +01001392INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1393
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001394/* Note: must not be declared <const> as its list will be overwritten.
1395 * Please take care of keeping this list alphabetically sorted, doing so helps
1396 * all code contributors.
1397 * Optional keywords are also declared with a NULL ->parse() function so that
1398 * the config parser can report an appropriate error when a known keyword was
1399 * not enabled.
1400 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001401static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001402 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001403 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1404 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1405 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1406 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1407 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1408 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001409 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001410 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001411 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001412}};
1413
Willy Tarreau0108d902018-11-25 19:14:37 +01001414INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1415
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001416/* config keyword parsers */
1417static struct cfg_kw_list cfg_kws = {ILH, {
1418 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1419 { 0, NULL, NULL }
1420}};
1421
1422INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1423
Willy Tarreau645513a2010-05-24 20:55:15 +02001424/*
1425 * Local variables:
1426 * c-indent-level: 8
1427 * c-basic-offset: 8
1428 * End:
1429 */