blob: 9a9699c94dbd36b1302c31ce4ee43b921a2b10a2 [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
127 } while (unlikely(!HA_ATOMIC_CAS(&ring->tail, &pos, next)));
128
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
165 HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
166 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 }
204 t->process = accept_queue_process;
205 t->context = &accept_queue_rings[i];
206 accept_queue_rings[i].task = t;
207 }
208 return 0;
209}
210
211REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
212
213#endif // USE_THREAD
214
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100215/* This function adds the specified listener's file descriptor to the polling
216 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Willy Tarreauae302532014-05-07 19:22:24 +0200217 * LI_FULL state depending on its number of connections. In deamon mode, we
218 * also support binding only the relevant processes to their respective
219 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100220 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200221static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100222{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100223 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100224 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200225 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100226 !(proc_mask(listener->bind_conf->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200227 /* we don't want to enable this listener and don't
228 * want any fd event to reach it.
229 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200230 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100231 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200232 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100233 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200234 listener->state = LI_LISTEN;
235 }
Willy Tarreauae302532014-05-07 19:22:24 +0200236 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100237 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau49b046d2012-08-09 12:11:58 +0200238 fd_want_recv(listener->fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100239 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200240 }
241 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100242 listener->state = LI_FULL;
243 }
244 }
William Lallemande22f11f2018-09-11 10:06:27 +0200245 /* if this listener is supposed to be only in the master, close it in the workers */
246 if ((global.mode & MODE_MWORKER) &&
247 (listener->options & LI_O_MWORKER) &&
248 master == 0) {
249 do_unbind_listener(listener, 1);
250 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100251 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100252}
253
254/* This function removes the specified listener's file descriptor from the
255 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
256 * enters LI_LISTEN.
257 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200258static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100259{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100260 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100261 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200262 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100263 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200264 fd_stop_recv(listener->fd);
Willy Tarreau01abd022019-02-28 10:27:18 +0100265 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100266 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200267 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100268 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100269}
270
Willy Tarreaube58c382011-07-24 18:28:10 +0200271/* This function tries to temporarily disable a listener, depending on the OS
272 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
273 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
274 * closes upon SHUT_WR and refuses to rebind. So a common validation path
275 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
276 * is disabled. It normally returns non-zero, unless an error is reported.
277 */
278int pause_listener(struct listener *l)
279{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200280 int ret = 1;
281
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100282 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200283
Olivier Houchard1fc05162017-04-06 01:05:05 +0200284 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200285 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200286
Willy Tarreau092d8652014-07-07 20:22:12 +0200287 if (l->proto->pause) {
288 /* Returns < 0 in case of failure, 0 if the listener
289 * was totally stopped, or > 0 if correctly paused.
290 */
291 int ret = l->proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200292
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200293 if (ret < 0) {
294 ret = 0;
295 goto end;
296 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200297 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200298 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200299 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200300
Willy Tarreau01abd022019-02-28 10:27:18 +0100301 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200302
Willy Tarreau49b046d2012-08-09 12:11:58 +0200303 fd_stop_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200304 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200305 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100306 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200307 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200308}
309
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200310/* This function tries to resume a temporarily disabled listener. Paused, full,
311 * limited and disabled listeners are handled, which means that this function
312 * may replace enable_listener(). The resulting state will either be LI_READY
313 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200314 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200315 * foreground mode, and are ignored. If the listener was only in the assigned
316 * state, it's totally rebound. This can happen if a pause() has completely
317 * stopped it. If the resume fails, 0 is returned and an error might be
318 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200319 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100320int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200321{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200322 int ret = 1;
323
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100324 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200325
William Lallemand095ba4c2017-06-01 17:38:50 +0200326 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100327 !(proc_mask(l->bind_conf->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200328 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100329
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200330 if (l->state == LI_ASSIGNED) {
331 char msg[100];
332 int err;
333
334 err = l->proto->bind(l, msg, sizeof(msg));
335 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100336 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200337 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100338 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200339
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200340 if (err & (ERR_FATAL | ERR_ABORT)) {
341 ret = 0;
342 goto end;
343 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200344 }
345
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200346 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
347 ret = 0;
348 goto end;
349 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200350
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200351 if (l->proto->sock_prot == IPPROTO_TCP &&
352 l->state == LI_PAUSED &&
Willy Tarreaue2711c72019-02-27 15:39:41 +0100353 listen(l->fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200354 ret = 0;
355 goto end;
356 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200357
358 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200359 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200360
Willy Tarreau01abd022019-02-28 10:27:18 +0100361 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200362
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100363 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaube58c382011-07-24 18:28:10 +0200364 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200365 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200366 }
367
Willy Tarreau49b046d2012-08-09 12:11:58 +0200368 fd_want_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200369 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200370 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100371 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200372 return ret;
373}
374
Willy Tarreau87b09662015-04-03 00:22:06 +0200375/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200376 * it upon next close() using resume_listener().
377 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200378static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200379{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100380 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200381 if (l->state >= LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100382 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100383 if (l->state != LI_FULL) {
384 fd_stop_recv(l->fd);
385 l->state = LI_FULL;
386 }
Willy Tarreau62793712011-07-24 19:23:38 +0200387 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100388 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200389}
390
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200391/* Marks a ready listener as limited so that we only try to re-enable it when
392 * resources are free again. It will be queued into the specified queue.
393 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200394static void limit_listener(struct listener *l, struct list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200395{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100396 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200397 if (l->state == LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100398 LIST_ADDQ_LOCKED(list, &l->wait_queue);
Willy Tarreau49b046d2012-08-09 12:11:58 +0200399 fd_stop_recv(l->fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200400 l->state = LI_LIMITED;
401 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100402 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200403}
404
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100405/* This function adds all of the protocol's listener's file descriptors to the
406 * polling lists when they are in the LI_LISTEN state. It is intended to be
407 * used as a protocol's generic enable_all() primitive, for use after the
408 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
409 * their number of connections. It always returns ERR_NONE.
410 */
411int enable_all_listeners(struct protocol *proto)
412{
413 struct listener *listener;
414
415 list_for_each_entry(listener, &proto->listeners, proto_list)
416 enable_listener(listener);
417 return ERR_NONE;
418}
419
420/* This function removes all of the protocol's listener's file descriptors from
421 * the polling lists when they are in the LI_READY or LI_FULL states. It is
422 * intended to be used as a protocol's generic disable_all() primitive. It puts
423 * the listeners into LI_LISTEN, and always returns ERR_NONE.
424 */
425int disable_all_listeners(struct protocol *proto)
426{
427 struct listener *listener;
428
429 list_for_each_entry(listener, &proto->listeners, proto_list)
430 disable_listener(listener);
431 return ERR_NONE;
432}
433
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200434/* Dequeues all of the listeners waiting for a resource in wait queue <queue>. */
435void dequeue_all_listeners(struct list *list)
436{
Willy Tarreau01abd022019-02-28 10:27:18 +0100437 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200438
Willy Tarreau01abd022019-02-28 10:27:18 +0100439 while ((listener = LIST_POP_LOCKED(list, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200440 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100441 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200442 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100443 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200444 }
445}
446
Christopher Faulet510c0d62018-03-16 10:04:47 +0100447/* Must be called with the lock held. Depending on <do_close> value, it does
448 * what unbind_listener or unbind_listener_no_close should do.
449 */
450void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100451{
452 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200453 fd_stop_recv(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100454
Willy Tarreau01abd022019-02-28 10:27:18 +0100455 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200456
Willy Tarreaube58c382011-07-24 18:28:10 +0200457 if (listener->state >= LI_PAUSED) {
Olivier Houchard1fc05162017-04-06 01:05:05 +0200458 if (do_close) {
459 fd_delete(listener->fd);
460 listener->fd = -1;
461 }
462 else
463 fd_remove(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100464 listener->state = LI_ASSIGNED;
465 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100466}
467
Olivier Houchard1fc05162017-04-06 01:05:05 +0200468/* This function closes the listening socket for the specified listener,
469 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100470 * LI_ASSIGNED state. This function is intended to be used as a generic
471 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200472 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100473void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200474{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100475 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100476 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100477 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200478}
479
480/* This function pretends the listener is dead, but keeps the FD opened, so
481 * that we can provide it, for conf reloading.
482 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100483void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200484{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100485 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100486 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100487 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200488}
489
Willy Tarreau3acf8c32007-10-28 22:35:41 +0100490/* This function closes all listening sockets bound to the protocol <proto>,
491 * and the listeners end in LI_ASSIGNED state if they were higher. It does not
492 * detach them from the protocol. It always returns ERR_NONE.
493 */
494int unbind_all_listeners(struct protocol *proto)
495{
496 struct listener *listener;
497
498 list_for_each_entry(listener, &proto->listeners, proto_list)
499 unbind_listener(listener);
500 return ERR_NONE;
501}
502
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200503/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
504 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
505 * allocation). The address family is taken from ss->ss_family. The number of
506 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100507 * created. If the <inherited> argument is set to 1, it specifies that the FD
508 * was obtained from a parent process.
509 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200510 * set in <err>.
511 */
512int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100513 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200514{
515 struct protocol *proto = protocol_by_family(ss->ss_family);
516 struct listener *l;
517 int port;
518
519 if (!proto) {
520 memprintf(err, "unsupported protocol family %d", ss->ss_family);
521 return 0;
522 }
523
524 for (port = portl; port <= porth; port++) {
525 l = calloc(1, sizeof(*l));
526 if (!l) {
527 memprintf(err, "out of memory");
528 return 0;
529 }
530 l->obj_type = OBJ_TYPE_LISTENER;
531 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
532 LIST_ADDQ(&bc->listeners, &l->by_bind);
533 l->bind_conf = bc;
534
535 l->fd = fd;
536 memcpy(&l->addr, ss, sizeof(*ss));
Willy Tarreau01abd022019-02-28 10:27:18 +0100537 LIST_INIT(&l->wait_queue);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200538 l->state = LI_INIT;
539
540 proto->add(l, port);
541
William Lallemand75ea0a02017-11-15 19:02:58 +0100542 if (inherited)
543 l->options |= LI_O_INHERITED;
544
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100545 HA_SPIN_INIT(&l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200546 HA_ATOMIC_ADD(&jobs, 1);
547 HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200548 }
549 return 1;
550}
551
Willy Tarreau1a64d162007-10-28 22:26:05 +0100552/* Delete a listener from its protocol's list of listeners. The listener's
553 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200554 * number of listeners is updated, as well as the global number of listeners
555 * and jobs. Note that the listener must have previously been unbound. This
556 * is the generic function to use to remove a listener.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100557 */
558void delete_listener(struct listener *listener)
559{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100560 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100561 if (listener->state == LI_ASSIGNED) {
562 listener->state = LI_INIT;
563 LIST_DEL(&listener->proto_list);
564 listener->proto->nb_listeners--;
565 HA_ATOMIC_SUB(&jobs, 1);
566 HA_ATOMIC_SUB(&listeners, 1);
567 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100568 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100569}
570
Willy Tarreaue2711c72019-02-27 15:39:41 +0100571/* Returns a suitable value for a listener's backlog. It uses the listener's,
572 * otherwise the frontend's backlog, otherwise the listener's maxconn,
573 * otherwise the frontend's maxconn, otherwise 1024.
574 */
575int listener_backlog(const struct listener *l)
576{
577 if (l->backlog)
578 return l->backlog;
579
580 if (l->bind_conf->frontend->backlog)
581 return l->bind_conf->frontend->backlog;
582
583 if (l->maxconn)
584 return l->maxconn;
585
586 if (l->bind_conf->frontend->maxconn)
587 return l->bind_conf->frontend->maxconn;
588
589 return 1024;
590}
591
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200592/* This function is called on a read event from a listening socket, corresponding
593 * to an accept. It tries to accept as many connections as possible, and for each
594 * calls the listener's accept handler (generally the frontend's accept handler).
595 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200596void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200597{
598 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100599 struct proxy *p;
600 int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100601 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100602 int next_feconn = 0;
603 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200604 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200605 int cfd;
606 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100607#ifdef USE_ACCEPT4
608 static int accept4_broken;
609#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200610
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100611 if (!l)
612 return;
613 p = l->bind_conf->frontend;
614 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200615
Willy Tarreau93e7c002013-10-07 18:51:07 +0200616 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
617 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200618
619 if (unlikely(!max)) {
620 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200621 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200622 goto wait_expire;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200623 }
624
625 if (max_accept > max)
626 max_accept = max;
627 }
628
629 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200630 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
631
632 if (unlikely(!max)) {
633 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200634 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200635 goto wait_expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200636 }
637
638 if (max_accept > max)
639 max_accept = max;
640 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200641#ifdef USE_OPENSSL
642 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
643 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200644
Willy Tarreaue43d5322013-10-07 20:01:52 +0200645 if (unlikely(!max)) {
646 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200647 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200648 goto wait_expire;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200649 }
650
651 if (max_accept > max)
652 max_accept = max;
653 }
654#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200655 if (p && p->fe_sps_lim) {
656 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
657
658 if (unlikely(!max)) {
659 /* frontend accept rate limit was reached */
660 limit_listener(l, &p->listener_queue);
661 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 +0200662 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200663 }
664
665 if (max_accept > max)
666 max_accept = max;
667 }
668
669 /* Note: if we fail to allocate a connection because of configured
670 * limits, we'll schedule a new attempt worst 1 second later in the
671 * worst case. If we fail due to system limits or temporary resource
672 * shortage, we try again 100ms later in the worst case.
673 */
Willy Tarreau82c97892019-02-27 19:32:32 +0100674 for (; max_accept-- > 0; next_conn = next_feconn = next_actconn = 0) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200675 struct sockaddr_storage addr;
676 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200677 unsigned int count;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200678
Willy Tarreau82c97892019-02-27 19:32:32 +0100679 /* pre-increase the number of connections without going too far.
680 * We process the listener, then the proxy, then the process.
681 * We know which ones to unroll based on the next_xxx value.
682 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100683 do {
684 count = l->nbconn;
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100685 if (l->maxconn && count >= l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100686 /* the listener was marked full or another
687 * thread is going to do it.
688 */
689 next_conn = 0;
690 goto end;
691 }
692 next_conn = count + 1;
693 } while (!HA_ATOMIC_CAS(&l->nbconn, &count, next_conn));
694
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100695 if (l->maxconn && next_conn == l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100696 /* we filled it, mark it full */
697 listener_full(l);
698 }
699
Willy Tarreau82c97892019-02-27 19:32:32 +0100700 if (p) {
701 do {
702 count = p->feconn;
703 if (count >= p->maxconn) {
704 /* the frontend was marked full or another
705 * thread is going to do it.
706 */
707 next_feconn = 0;
708 goto end;
709 }
710 next_feconn = count + 1;
711 } while (!HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
712
713 if (unlikely(next_feconn == p->maxconn)) {
714 /* we just filled it */
715 limit_listener(l, &p->listener_queue);
716 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200717 }
718
Willy Tarreau82c97892019-02-27 19:32:32 +0100719 if (!(l->options & LI_O_UNLIMITED)) {
720 do {
721 count = actconn;
722 if (count >= global.maxconn) {
723 /* the process was marked full or another
724 * thread is going to do it.
725 */
726 next_actconn = 0;
727 goto end;
728 }
729 next_actconn = count + 1;
730 } while (!HA_ATOMIC_CAS(&actconn, &count, next_actconn));
731
732 if (unlikely(next_actconn == global.maxconn)) {
733 limit_listener(l, &global_listener_queue);
734 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
735 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200736 }
737
William Lallemand2fe7dd02018-09-11 16:51:29 +0200738 /* with sockpair@ we don't want to do an accept */
739 if (unlikely(l->addr.ss_family == AF_CUST_SOCKPAIR)) {
740 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100741 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100742 /* just like with UNIX sockets, only the family is filled */
743 addr.ss_family = AF_UNIX;
744 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200745 } else
746
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200747#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100748 /* only call accept4() if it's known to be safe, otherwise
749 * fallback to the legacy accept() + fcntl().
750 */
751 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100752 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100753 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
754 (accept4_broken = 1))))
755#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200756 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100757 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100758
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200759 if (unlikely(cfd == -1)) {
760 switch (errno) {
761 case EAGAIN:
Willy Tarreaubb660302014-05-07 19:47:02 +0200762 if (fdtab[fd].ev & FD_POLL_HUP) {
763 /* the listening socket might have been disabled in a shared
764 * process and we're a collateral victim. We'll just pause for
765 * a while in case it comes back. In the mean time, we need to
766 * clear this sticky flag.
767 */
768 fdtab[fd].ev &= ~FD_POLL_HUP;
769 goto transient_error;
770 }
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100771 fd_cant_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200772 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200773 case EINVAL:
774 /* might be trying to accept on a shut fd (eg: soft stop) */
775 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100776 case EINTR:
777 case ECONNABORTED:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100778 HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100779 if (p)
780 HA_ATOMIC_SUB(&p->feconn, 1);
781 if (!(l->options & LI_O_UNLIMITED))
782 HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100783 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200784 case ENFILE:
785 if (p)
786 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100787 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
788 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200789 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200790 case EMFILE:
791 if (p)
792 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100793 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
794 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200795 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200796 case ENOBUFS:
797 case ENOMEM:
798 if (p)
799 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100800 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
801 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200802 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200803 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100804 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100805 goto stop;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200806 }
807 }
808
William Lallemandd9138002018-11-27 12:02:39 +0100809 /* we don't want to leak the FD upon reload if it's in the master */
810 if (unlikely(master == 1))
811 fcntl(cfd, F_SETFD, FD_CLOEXEC);
812
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100813 /* The connection was accepted, it must be counted as such */
814 if (l->counters)
815 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
816
Willy Tarreau82c97892019-02-27 19:32:32 +0100817 if (p)
818 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
819
820 proxy_inc_fe_conn_ctr(l, p);
821
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100822 if (!(l->options & LI_O_UNLIMITED)) {
823 count = update_freq_ctr(&global.conn_per_sec, 1);
824 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100825 }
826
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200827 if (unlikely(cfd >= global.maxsock)) {
828 send_log(p, LOG_EMERG,
829 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
830 p->id);
831 close(cfd);
832 limit_listener(l, &global_listener_queue);
833 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200834 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200835 }
836
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100837 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100838 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
839 * allows the error path not to rollback on nbconn. It's more
840 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100841 */
842 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100843 next_feconn = 0;
844 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200845
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100846#if defined(USE_THREAD)
847 count = l->bind_conf->thr_count;
Willy Tarreau7ac908b2019-02-27 12:02:18 +0100848 if (count > 1 && (global.tune.options & GTUNE_LISTENER_MQ)) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100849 struct accept_queue_ring *ring;
850 int r, t1, t2, q1, q2;
851
852 /* pick two small distinct random values and drop lower bits */
853 r = (random() >> 8) % ((count - 1) * count);
854 t2 = r / count; // 0..thr_count-2
855 t1 = r % count; // 0..thr_count-1
856 t2 += t1 + 1; // necessarily different from t1
857
858 if (t2 >= count)
859 t2 -= count;
860
861 t1 = bind_map_thread_id(l->bind_conf, t1);
862 t2 = bind_map_thread_id(l->bind_conf, t2);
863
864 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
865 if (q1 >= ACCEPT_QUEUE_SIZE)
866 q1 -= ACCEPT_QUEUE_SIZE;
867
868 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
869 if (q2 >= ACCEPT_QUEUE_SIZE)
870 q2 -= ACCEPT_QUEUE_SIZE;
871
872 /* make t1 the lowest loaded thread */
873 if (q1 >= ACCEPT_QUEUE_SIZE || l->thr_conn[t1] + q1 > l->thr_conn[t2] + q2)
874 t1 = t2;
875
876 /* We use deferred accepts even if it's the local thread because
877 * tests show that it's the best performing model, likely due to
878 * better cache locality when processing this loop.
879 */
880 ring = &accept_queue_rings[t1];
881 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Willy Tarreau8a034082019-02-27 10:45:55 +0100882 HA_ATOMIC_ADD(&activity[t1].accq_pushed, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100883 task_wakeup(ring->task, TASK_WOKEN_IO);
884 continue;
885 }
886 /* If the ring is full we do a synchronous accept on
887 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100888 */
Willy Tarreau8a034082019-02-27 10:45:55 +0100889 HA_ATOMIC_ADD(&activity[t1].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100890 }
891#endif // USE_THREAD
892
Willy Tarreau9e853182019-02-03 10:36:29 +0100893 HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200894 ret = l->accept(l, cfd, &addr);
895 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +0200896 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200897 * we just have to ignore it (ret == 0) or it's a critical
898 * error due to a resource shortage, and we must stop the
899 * listener (ret < 0).
900 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200901 if (ret == 0) /* successful termination */
902 continue;
903
Willy Tarreaubb660302014-05-07 19:47:02 +0200904 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200905 }
906
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100907 /* increase the per-process number of cumulated sessions, this
908 * may only be done once l->accept() has accepted the connection.
909 */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200910 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200911 count = update_freq_ctr(&global.sess_per_sec, 1);
912 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200913 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200914#ifdef USE_OPENSSL
915 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200916 count = update_freq_ctr(&global.ssl_per_sec, 1);
917 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +0200918 }
919#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +0200920
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100921 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200922
Willy Tarreauaece46a2012-07-06 12:25:58 +0200923 /* we've exhausted max_accept, so there is no need to poll again */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100924 stop:
925 fd_done_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200926 goto end;
Willy Tarreaubb660302014-05-07 19:47:02 +0200927
928 transient_error:
929 /* pause the listener and try again in 100 ms */
930 expire = tick_add(now_ms, 100);
931
932 wait_expire:
933 limit_listener(l, &global_listener_queue);
934 task_schedule(global_listener_queue_task, tick_first(expire, global_listener_queue_task->expire));
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200935 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100936 if (next_conn)
937 HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +0100938
Willy Tarreau82c97892019-02-27 19:32:32 +0100939 if (p && next_feconn)
940 HA_ATOMIC_SUB(&p->feconn, 1);
941
942 if (next_actconn)
943 HA_ATOMIC_SUB(&actconn, 1);
944
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100945 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau82c97892019-02-27 19:32:32 +0100946 (l->state == LI_LIMITED && ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn)))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100947 /* at least one thread has to this when quitting */
948 resume_listener(l);
949
950 /* Dequeues all of the listeners waiting for a resource */
951 if (!LIST_ISEMPTY(&global_listener_queue))
952 dequeue_all_listeners(&global_listener_queue);
953
954 if (!LIST_ISEMPTY(&p->listener_queue) &&
955 (!p->fe_sps_lim || freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0) > 0))
956 dequeue_all_listeners(&p->listener_queue);
957 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200958}
959
Willy Tarreau05f50472017-09-15 09:19:58 +0200960/* Notify the listener that a connection initiated from it was released. This
961 * is used to keep the connection count consistent and to possibly re-open
962 * listening when it was limited.
963 */
964void listener_release(struct listener *l)
965{
966 struct proxy *fe = l->bind_conf->frontend;
967
968 if (!(l->options & LI_O_UNLIMITED))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200969 HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100970 if (fe)
971 HA_ATOMIC_SUB(&fe->feconn, 1);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200972 HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau9e853182019-02-03 10:36:29 +0100973 HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100974
975 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +0200976 resume_listener(l);
977
978 /* Dequeues all of the listeners waiting for a resource */
979 if (!LIST_ISEMPTY(&global_listener_queue))
980 dequeue_all_listeners(&global_listener_queue);
981
982 if (!LIST_ISEMPTY(&fe->listener_queue) &&
983 (!fe->fe_sps_lim || freq_ctr_remain(&fe->fe_sess_per_sec, fe->fe_sps_lim, 0) > 0))
984 dequeue_all_listeners(&fe->listener_queue);
985}
986
Willy Tarreau26982662012-09-12 23:17:10 +0200987/*
988 * Registers the bind keyword list <kwl> as a list of valid keywords for next
989 * parsing sessions.
990 */
991void bind_register_keywords(struct bind_kw_list *kwl)
992{
993 LIST_ADDQ(&bind_keywords.list, &kwl->list);
994}
995
996/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
997 * keyword is found with a NULL ->parse() function, then an attempt is made to
998 * find one with a valid ->parse() function. This way it is possible to declare
999 * platform-dependant, known keywords as NULL, then only declare them as valid
1000 * if some options are met. Note that if the requested keyword contains an
1001 * opening parenthesis, everything from this point is ignored.
1002 */
1003struct bind_kw *bind_find_kw(const char *kw)
1004{
1005 int index;
1006 const char *kwend;
1007 struct bind_kw_list *kwl;
1008 struct bind_kw *ret = NULL;
1009
1010 kwend = strchr(kw, '(');
1011 if (!kwend)
1012 kwend = kw + strlen(kw);
1013
1014 list_for_each_entry(kwl, &bind_keywords.list, list) {
1015 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1016 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1017 kwl->kw[index].kw[kwend-kw] == 0) {
1018 if (kwl->kw[index].parse)
1019 return &kwl->kw[index]; /* found it !*/
1020 else
1021 ret = &kwl->kw[index]; /* may be OK */
1022 }
1023 }
1024 }
1025 return ret;
1026}
1027
Willy Tarreau8638f482012-09-18 18:01:17 +02001028/* Dumps all registered "bind" keywords to the <out> string pointer. The
1029 * unsupported keywords are only dumped if their supported form was not
1030 * found.
1031 */
1032void bind_dump_kws(char **out)
1033{
1034 struct bind_kw_list *kwl;
1035 int index;
1036
1037 *out = NULL;
1038 list_for_each_entry(kwl, &bind_keywords.list, list) {
1039 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1040 if (kwl->kw[index].parse ||
1041 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001042 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1043 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001044 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001045 kwl->kw[index].skip ? " <arg>" : "",
1046 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001047 }
1048 }
1049 }
1050}
1051
Willy Tarreaub2b50a72019-02-03 11:14:25 +01001052/* recompute the bit counts per parity for the bind_thread value. This will be
1053 * used to quickly map a thread number from 1 to #thread to a thread ID among
1054 * the ones bound. This is the preparation phase of the bit rank counting algo
1055 * described here: https://graphics.stanford.edu/~seander/bithacks.html
1056 */
1057void bind_recount_thread_bits(struct bind_conf *conf)
1058{
1059 unsigned long m;
1060
1061 m = thread_mask(conf->bind_thread);
1062 conf->thr_count = my_popcountl(m);
1063 mask_prep_rank_map(m, &conf->thr_2, &conf->thr_4, &conf->thr_8, &conf->thr_16);
1064}
1065
1066/* Report the ID of thread <r> in bind_conf <conf> according to its thread_mask.
1067 * <r> must be between 0 and LONGBITS-1. This makes use of the pre-computed
1068 * bits resulting from bind_recount_thread_bits. See this function for more
1069 * info.
1070 */
1071unsigned int bind_map_thread_id(const struct bind_conf *conf, unsigned int r)
1072{
1073 unsigned long m;
1074
1075 m = thread_mask(conf->bind_thread);
1076 return mask_find_rank_bit_fast(r, m, conf->thr_2, conf->thr_4, conf->thr_8, conf->thr_16);
1077}
1078
Willy Tarreau645513a2010-05-24 20:55:15 +02001079/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001080/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001081/************************************************************************/
1082
Willy Tarreaua5e37562011-12-16 17:06:15 +01001083/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001084static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001085smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001086{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001087 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001088 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001089 return 1;
1090}
1091
Willy Tarreaua5e37562011-12-16 17:06:15 +01001092/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001093static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001094smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001095{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001096 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001097 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001098 return 1;
1099}
1100
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001101/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001102static 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 +02001103{
1104 struct listener *l;
1105
Willy Tarreau4348fad2012-09-20 16:48:07 +02001106 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001107 l->options |= LI_O_ACC_PROXY;
1108
1109 return 0;
1110}
1111
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001112/* parse the "accept-netscaler-cip" bind keyword */
1113static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1114{
1115 struct listener *l;
1116 uint32_t val;
1117
1118 if (!*args[cur_arg + 1]) {
1119 memprintf(err, "'%s' : missing value", args[cur_arg]);
1120 return ERR_ALERT | ERR_FATAL;
1121 }
1122
1123 val = atol(args[cur_arg + 1]);
1124 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001125 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001126 return ERR_ALERT | ERR_FATAL;
1127 }
1128
1129 list_for_each_entry(l, &conf->listeners, by_bind) {
1130 l->options |= LI_O_ACC_CIP;
1131 conf->ns_cip_magic = val;
1132 }
1133
1134 return 0;
1135}
1136
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001137/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001138static 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 +02001139{
1140 struct listener *l;
1141 int val;
1142
1143 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001144 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001145 return ERR_ALERT | ERR_FATAL;
1146 }
1147
1148 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001149 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001150 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001151 return ERR_ALERT | ERR_FATAL;
1152 }
1153
Willy Tarreau4348fad2012-09-20 16:48:07 +02001154 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001155 l->backlog = val;
1156
1157 return 0;
1158}
1159
1160/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001161static 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 +02001162{
1163 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001164 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001165 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001166
Willy Tarreau4348fad2012-09-20 16:48:07 +02001167 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001168 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001169 return ERR_ALERT | ERR_FATAL;
1170 }
1171
1172 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001173 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001174 return ERR_ALERT | ERR_FATAL;
1175 }
1176
Willy Tarreau4348fad2012-09-20 16:48:07 +02001177 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001178 new->luid = strtol(args[cur_arg + 1], &error, 10);
1179 if (*error != '\0') {
1180 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1181 return ERR_ALERT | ERR_FATAL;
1182 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001183 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001184
Willy Tarreau4348fad2012-09-20 16:48:07 +02001185 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001186 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001187 return ERR_ALERT | ERR_FATAL;
1188 }
1189
Willy Tarreau4348fad2012-09-20 16:48:07 +02001190 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001191 if (node) {
1192 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001193 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1194 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1195 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001196 return ERR_ALERT | ERR_FATAL;
1197 }
1198
Willy Tarreau4348fad2012-09-20 16:48:07 +02001199 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001200 return 0;
1201}
1202
1203/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001204static 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 +02001205{
1206 struct listener *l;
1207 int val;
1208
1209 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001210 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001211 return ERR_ALERT | ERR_FATAL;
1212 }
1213
1214 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001215 if (val < 0) {
1216 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001217 return ERR_ALERT | ERR_FATAL;
1218 }
1219
Willy Tarreau4348fad2012-09-20 16:48:07 +02001220 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001221 l->maxconn = val;
1222
1223 return 0;
1224}
1225
1226/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001227static 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 +02001228{
1229 struct listener *l;
1230
1231 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001232 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001233 return ERR_ALERT | ERR_FATAL;
1234 }
1235
Willy Tarreau4348fad2012-09-20 16:48:07 +02001236 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001237 l->name = strdup(args[cur_arg + 1]);
1238
1239 return 0;
1240}
1241
1242/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001243static 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 +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]);
1254 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001255 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", 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->nice = val;
1261
1262 return 0;
1263}
1264
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001265/* parse the "process" bind keyword */
1266static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1267{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001268 char *slash;
1269 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001270
Christopher Fauletc644fa92017-11-23 22:44:11 +01001271 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1272 *slash = 0;
1273
Willy Tarreauff9c9142019-02-07 10:39:36 +01001274 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001275 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001276 return ERR_ALERT | ERR_FATAL;
1277 }
1278
Christopher Fauletc644fa92017-11-23 22:44:11 +01001279 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001280 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001281 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1282 return ERR_ALERT | ERR_FATAL;
1283 }
1284 *slash = '/';
1285 }
1286
1287 conf->bind_proc |= proc;
Willy Tarreaua36b3242019-02-02 13:14:34 +01001288 conf->bind_thread |= thread;
Willy Tarreaub2b50a72019-02-03 11:14:25 +01001289 bind_recount_thread_bits(conf);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001290 return 0;
1291}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001292
Christopher Fauleta717b992018-04-10 14:43:00 +02001293/* parse the "proto" bind keyword */
1294static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1295{
1296 struct ist proto;
1297
1298 if (!*args[cur_arg + 1]) {
1299 memprintf(err, "'%s' : missing value", args[cur_arg]);
1300 return ERR_ALERT | ERR_FATAL;
1301 }
1302
1303 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1304 conf->mux_proto = get_mux_proto(proto);
1305 if (!conf->mux_proto) {
1306 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1307 return ERR_ALERT | ERR_FATAL;
1308 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001309 return 0;
1310}
1311
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001312/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1313static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1314 struct proxy *defpx, const char *file, int line,
1315 char **err)
1316{
1317 if (too_many_args(1, args, err, NULL))
1318 return -1;
1319
1320 if (strcmp(args[1], "on") == 0)
1321 global.tune.options |= GTUNE_LISTENER_MQ;
1322 else if (strcmp(args[1], "off") == 0)
1323 global.tune.options &= ~GTUNE_LISTENER_MQ;
1324 else {
1325 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1326 return -1;
1327 }
1328 return 0;
1329}
1330
Willy Tarreau61612d42012-04-19 18:42:05 +02001331/* Note: must not be declared <const> as its list will be overwritten.
1332 * Please take care of keeping this list alphabetically sorted.
1333 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001334static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001335 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1336 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001337 { /* END */ },
1338}};
1339
Willy Tarreau0108d902018-11-25 19:14:37 +01001340INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1341
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001342/* Note: must not be declared <const> as its list will be overwritten.
1343 * Please take care of keeping this list alphabetically sorted.
1344 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001345static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001346 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001347}};
1348
Willy Tarreau0108d902018-11-25 19:14:37 +01001349INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1350
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001351/* Note: must not be declared <const> as its list will be overwritten.
1352 * Please take care of keeping this list alphabetically sorted, doing so helps
1353 * all code contributors.
1354 * Optional keywords are also declared with a NULL ->parse() function so that
1355 * the config parser can report an appropriate error when a known keyword was
1356 * not enabled.
1357 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001358static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001359 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001360 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1361 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1362 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1363 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1364 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1365 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001366 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001367 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001368 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001369}};
1370
Willy Tarreau0108d902018-11-25 19:14:37 +01001371INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1372
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001373/* config keyword parsers */
1374static struct cfg_kw_list cfg_kws = {ILH, {
1375 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1376 { 0, NULL, NULL }
1377}};
1378
1379INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1380
Willy Tarreau645513a2010-05-24 20:55:15 +02001381/*
1382 * Local variables:
1383 * c-indent-level: 8
1384 * c-basic-offset: 8
1385 * End:
1386 */