blob: 0d7a1c4801affa1512e6bed31cf977fd27695c3e [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
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +020045 /* listner_queue lock (same for global and per proxy queues) */
Willy Tarreau86abe442018-11-25 20:12:18 +010046__decl_spinlock(lq_lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +020047
Willy Tarreau26982662012-09-12 23:17:10 +020048/* List head of all known bind keywords */
49static struct bind_kw_list bind_keywords = {
50 .list = LIST_HEAD_INIT(bind_keywords.list)
51};
52
Olivier Houchardf73629d2017-04-05 22:33:04 +020053struct xfer_sock_list *xfer_sock_list = NULL;
54
Willy Tarreau1efafce2019-01-27 15:37:19 +010055#if defined(USE_THREAD)
56
57struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
58
59/* dequeue and process a pending connection from the local accept queue (single
60 * consumer). Returns the accepted fd or -1 if none was found. The listener is
61 * placed into *li. The address is copied into *addr for no more than *addr_len
62 * bytes, and the address length is returned into *addr_len.
63 */
64int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
65{
66 struct accept_queue_entry *e;
67 unsigned int pos, next;
68 struct listener *ptr;
69 int len;
70 int fd;
71
72 pos = ring->head;
73
74 if (pos == ring->tail)
75 return -1;
76
77 next = pos + 1;
78 if (next >= ACCEPT_QUEUE_SIZE)
79 next = 0;
80
81 e = &ring->entry[pos];
82
83 /* wait for the producer to update the listener's pointer */
84 while (1) {
85 ptr = e->listener;
86 __ha_barrier_load();
87 if (ptr)
88 break;
89 pl_cpu_relax();
90 }
91
92 fd = e->fd;
93 len = e->addr_len;
94 if (len > *addr_len)
95 len = *addr_len;
96
97 if (likely(len > 0))
98 memcpy(addr, &e->addr, len);
99
100 /* release the entry */
101 e->listener = NULL;
102
103 __ha_barrier_store();
104 ring->head = next;
105
106 *addr_len = len;
107 *li = ptr;
108
109 return fd;
110}
111
112
113/* tries to push a new accepted connection <fd> into ring <ring> for listener
114 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
115 * succeeds, or zero if the ring is full. Supports multiple producers.
116 */
117int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
118 struct listener *li, const void *addr, int addr_len)
119{
120 struct accept_queue_entry *e;
121 unsigned int pos, next;
122
123 pos = ring->tail;
124 do {
125 next = pos + 1;
126 if (next >= ACCEPT_QUEUE_SIZE)
127 next = 0;
128 if (next == ring->head)
129 return 0; // ring full
130 } while (unlikely(!HA_ATOMIC_CAS(&ring->tail, &pos, next)));
131
132
133 e = &ring->entry[pos];
134
135 if (addr_len > sizeof(e->addr))
136 addr_len = sizeof(e->addr);
137
138 if (addr_len)
139 memcpy(&e->addr, addr, addr_len);
140
141 e->addr_len = addr_len;
142 e->fd = fd;
143
144 __ha_barrier_store();
145 /* now commit the change */
146
147 e->listener = li;
148 return 1;
149}
150
151/* proceed with accepting new connections */
152static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
153{
154 struct accept_queue_ring *ring = context;
155 struct listener *li;
156 struct sockaddr_storage addr;
157 int max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
158 int addr_len;
159 int ret;
160 int fd;
161
162 while (max_accept--) {
163 addr_len = sizeof(addr);
164 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
165 if (fd < 0)
166 break;
167
168 HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
169 ret = li->accept(li, fd, &addr);
170 if (ret <= 0) {
171 /* connection was terminated by the application */
172 continue;
173 }
174
175 /* increase the per-process number of cumulated sessions, this
176 * may only be done once l->accept() has accepted the connection.
177 */
178 if (!(li->options & LI_O_UNLIMITED)) {
179 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
180 update_freq_ctr(&global.sess_per_sec, 1));
181 if (li->bind_conf && li->bind_conf->is_ssl) {
182 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
183 update_freq_ctr(&global.ssl_per_sec, 1));
184 }
185 }
186 }
187
188 /* ran out of budget ? Let's come here ASAP */
189 if (max_accept < 0)
190 task_wakeup(t, TASK_WOKEN_IO);
191
192 return t;
193}
194
195/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
196static int accept_queue_init()
197{
198 struct task *t;
199 int i;
200
201 for (i = 0; i < global.nbthread; i++) {
202 t = task_new(1UL << i);
203 if (!t) {
204 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
205 return ERR_FATAL|ERR_ABORT;
206 }
207 t->process = accept_queue_process;
208 t->context = &accept_queue_rings[i];
209 accept_queue_rings[i].task = t;
210 }
211 return 0;
212}
213
214REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
215
216#endif // USE_THREAD
217
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100218/* This function adds the specified listener's file descriptor to the polling
219 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Willy Tarreauae302532014-05-07 19:22:24 +0200220 * LI_FULL state depending on its number of connections. In deamon mode, we
221 * also support binding only the relevant processes to their respective
222 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100223 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200224static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100225{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100226 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100227 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200228 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100229 !(proc_mask(listener->bind_conf->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200230 /* we don't want to enable this listener and don't
231 * want any fd event to reach it.
232 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200233 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100234 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200235 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100236 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200237 listener->state = LI_LISTEN;
238 }
Willy Tarreauae302532014-05-07 19:22:24 +0200239 }
240 else if (listener->nbconn < listener->maxconn) {
Willy Tarreau49b046d2012-08-09 12:11:58 +0200241 fd_want_recv(listener->fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100242 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200243 }
244 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100245 listener->state = LI_FULL;
246 }
247 }
William Lallemande22f11f2018-09-11 10:06:27 +0200248 /* if this listener is supposed to be only in the master, close it in the workers */
249 if ((global.mode & MODE_MWORKER) &&
250 (listener->options & LI_O_MWORKER) &&
251 master == 0) {
252 do_unbind_listener(listener, 1);
253 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100254 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100255}
256
257/* This function removes the specified listener's file descriptor from the
258 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
259 * enters LI_LISTEN.
260 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200261static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100262{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100263 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100264 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200265 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100266 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200267 fd_stop_recv(listener->fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200268 if (listener->state == LI_LIMITED) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100269 HA_SPIN_LOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200270 LIST_DEL(&listener->wait_queue);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100271 HA_SPIN_UNLOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200272 }
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100273 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200274 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100275 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100276}
277
Willy Tarreaube58c382011-07-24 18:28:10 +0200278/* This function tries to temporarily disable a listener, depending on the OS
279 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
280 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
281 * closes upon SHUT_WR and refuses to rebind. So a common validation path
282 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
283 * is disabled. It normally returns non-zero, unless an error is reported.
284 */
285int pause_listener(struct listener *l)
286{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200287 int ret = 1;
288
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100289 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200290
Olivier Houchard1fc05162017-04-06 01:05:05 +0200291 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200292 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200293
Willy Tarreau092d8652014-07-07 20:22:12 +0200294 if (l->proto->pause) {
295 /* Returns < 0 in case of failure, 0 if the listener
296 * was totally stopped, or > 0 if correctly paused.
297 */
298 int ret = l->proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200299
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200300 if (ret < 0) {
301 ret = 0;
302 goto end;
303 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200304 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200305 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200306 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200307
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200308 if (l->state == LI_LIMITED) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100309 HA_SPIN_LOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200310 LIST_DEL(&l->wait_queue);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100311 HA_SPIN_UNLOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200312 }
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200313
Willy Tarreau49b046d2012-08-09 12:11:58 +0200314 fd_stop_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200315 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200316 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100317 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200318 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200319}
320
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200321/* This function tries to resume a temporarily disabled listener. Paused, full,
322 * limited and disabled listeners are handled, which means that this function
323 * may replace enable_listener(). The resulting state will either be LI_READY
324 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200325 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200326 * foreground mode, and are ignored. If the listener was only in the assigned
327 * state, it's totally rebound. This can happen if a pause() has completely
328 * stopped it. If the resume fails, 0 is returned and an error might be
329 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200330 */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200331static int __resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200332{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200333 int ret = 1;
334
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100335 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200336
William Lallemand095ba4c2017-06-01 17:38:50 +0200337 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100338 !(proc_mask(l->bind_conf->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200339 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100340
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200341 if (l->state == LI_ASSIGNED) {
342 char msg[100];
343 int err;
344
345 err = l->proto->bind(l, msg, sizeof(msg));
346 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100347 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200348 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100349 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200350
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200351 if (err & (ERR_FATAL | ERR_ABORT)) {
352 ret = 0;
353 goto end;
354 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200355 }
356
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200357 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
358 ret = 0;
359 goto end;
360 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200361
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200362 if (l->proto->sock_prot == IPPROTO_TCP &&
363 l->state == LI_PAUSED &&
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200364 listen(l->fd, l->backlog ? l->backlog : l->maxconn) != 0) {
365 ret = 0;
366 goto end;
367 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200368
369 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200370 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200371
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200372 if (l->state == LI_LIMITED)
373 LIST_DEL(&l->wait_queue);
374
Willy Tarreaube58c382011-07-24 18:28:10 +0200375 if (l->nbconn >= l->maxconn) {
376 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200377 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200378 }
379
Willy Tarreau49b046d2012-08-09 12:11:58 +0200380 fd_want_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200381 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200382 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100383 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200384 return ret;
385}
386
387int resume_listener(struct listener *l)
388{
389 int ret;
390
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100391 HA_SPIN_LOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200392 ret = __resume_listener(l);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100393 HA_SPIN_UNLOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200394 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200395}
396
Willy Tarreau87b09662015-04-03 00:22:06 +0200397/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200398 * it upon next close() using resume_listener().
399 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200400static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200401{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100402 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200403 if (l->state >= LI_READY) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200404 if (l->state == LI_LIMITED) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100405 HA_SPIN_LOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200406 LIST_DEL(&l->wait_queue);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100407 HA_SPIN_UNLOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200408 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100409 if (l->state != LI_FULL) {
410 fd_stop_recv(l->fd);
411 l->state = LI_FULL;
412 }
Willy Tarreau62793712011-07-24 19:23:38 +0200413 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100414 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200415}
416
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200417/* Marks a ready listener as limited so that we only try to re-enable it when
418 * resources are free again. It will be queued into the specified queue.
419 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200420static void limit_listener(struct listener *l, struct list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200421{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100422 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200423 if (l->state == LI_READY) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100424 HA_SPIN_LOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200425 LIST_ADDQ(list, &l->wait_queue);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100426 HA_SPIN_UNLOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreau49b046d2012-08-09 12:11:58 +0200427 fd_stop_recv(l->fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200428 l->state = LI_LIMITED;
429 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100430 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200431}
432
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100433/* This function adds all of the protocol's listener's file descriptors to the
434 * polling lists when they are in the LI_LISTEN state. It is intended to be
435 * used as a protocol's generic enable_all() primitive, for use after the
436 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
437 * their number of connections. It always returns ERR_NONE.
438 */
439int enable_all_listeners(struct protocol *proto)
440{
441 struct listener *listener;
442
443 list_for_each_entry(listener, &proto->listeners, proto_list)
444 enable_listener(listener);
445 return ERR_NONE;
446}
447
448/* This function removes all of the protocol's listener's file descriptors from
449 * the polling lists when they are in the LI_READY or LI_FULL states. It is
450 * intended to be used as a protocol's generic disable_all() primitive. It puts
451 * the listeners into LI_LISTEN, and always returns ERR_NONE.
452 */
453int disable_all_listeners(struct protocol *proto)
454{
455 struct listener *listener;
456
457 list_for_each_entry(listener, &proto->listeners, proto_list)
458 disable_listener(listener);
459 return ERR_NONE;
460}
461
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200462/* Dequeues all of the listeners waiting for a resource in wait queue <queue>. */
463void dequeue_all_listeners(struct list *list)
464{
465 struct listener *listener, *l_back;
466
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100467 HA_SPIN_LOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200468 list_for_each_entry_safe(listener, l_back, list, wait_queue) {
469 /* This cannot fail because the listeners are by definition in
470 * the LI_LIMITED state. The function also removes the entry
471 * from the queue.
472 */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200473 __resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200474 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100475 HA_SPIN_UNLOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200476}
477
Christopher Faulet510c0d62018-03-16 10:04:47 +0100478/* Must be called with the lock held. Depending on <do_close> value, it does
479 * what unbind_listener or unbind_listener_no_close should do.
480 */
481void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100482{
483 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200484 fd_stop_recv(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100485
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200486 if (listener->state == LI_LIMITED) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100487 HA_SPIN_LOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200488 LIST_DEL(&listener->wait_queue);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100489 HA_SPIN_UNLOCK(LISTENER_QUEUE_LOCK, &lq_lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200490 }
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200491
Willy Tarreaube58c382011-07-24 18:28:10 +0200492 if (listener->state >= LI_PAUSED) {
Olivier Houchard1fc05162017-04-06 01:05:05 +0200493 if (do_close) {
494 fd_delete(listener->fd);
495 listener->fd = -1;
496 }
497 else
498 fd_remove(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100499 listener->state = LI_ASSIGNED;
500 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100501}
502
Olivier Houchard1fc05162017-04-06 01:05:05 +0200503/* This function closes the listening socket for the specified listener,
504 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100505 * LI_ASSIGNED state. This function is intended to be used as a generic
506 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200507 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100508void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200509{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100510 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100511 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100512 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200513}
514
515/* This function pretends the listener is dead, but keeps the FD opened, so
516 * that we can provide it, for conf reloading.
517 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100518void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200519{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100520 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100521 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100522 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200523}
524
Willy Tarreau3acf8c32007-10-28 22:35:41 +0100525/* This function closes all listening sockets bound to the protocol <proto>,
526 * and the listeners end in LI_ASSIGNED state if they were higher. It does not
527 * detach them from the protocol. It always returns ERR_NONE.
528 */
529int unbind_all_listeners(struct protocol *proto)
530{
531 struct listener *listener;
532
533 list_for_each_entry(listener, &proto->listeners, proto_list)
534 unbind_listener(listener);
535 return ERR_NONE;
536}
537
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200538/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
539 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
540 * allocation). The address family is taken from ss->ss_family. The number of
541 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100542 * created. If the <inherited> argument is set to 1, it specifies that the FD
543 * was obtained from a parent process.
544 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200545 * set in <err>.
546 */
547int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100548 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200549{
550 struct protocol *proto = protocol_by_family(ss->ss_family);
551 struct listener *l;
552 int port;
553
554 if (!proto) {
555 memprintf(err, "unsupported protocol family %d", ss->ss_family);
556 return 0;
557 }
558
559 for (port = portl; port <= porth; port++) {
560 l = calloc(1, sizeof(*l));
561 if (!l) {
562 memprintf(err, "out of memory");
563 return 0;
564 }
565 l->obj_type = OBJ_TYPE_LISTENER;
566 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
567 LIST_ADDQ(&bc->listeners, &l->by_bind);
568 l->bind_conf = bc;
569
570 l->fd = fd;
571 memcpy(&l->addr, ss, sizeof(*ss));
572 l->state = LI_INIT;
573
574 proto->add(l, port);
575
William Lallemand75ea0a02017-11-15 19:02:58 +0100576 if (inherited)
577 l->options |= LI_O_INHERITED;
578
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100579 HA_SPIN_INIT(&l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200580 HA_ATOMIC_ADD(&jobs, 1);
581 HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200582 }
583 return 1;
584}
585
Willy Tarreau1a64d162007-10-28 22:26:05 +0100586/* Delete a listener from its protocol's list of listeners. The listener's
587 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200588 * number of listeners is updated, as well as the global number of listeners
589 * and jobs. Note that the listener must have previously been unbound. This
590 * is the generic function to use to remove a listener.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100591 */
592void delete_listener(struct listener *listener)
593{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100594 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100595 if (listener->state == LI_ASSIGNED) {
596 listener->state = LI_INIT;
597 LIST_DEL(&listener->proto_list);
598 listener->proto->nb_listeners--;
599 HA_ATOMIC_SUB(&jobs, 1);
600 HA_ATOMIC_SUB(&listeners, 1);
601 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100602 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100603}
604
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200605/* This function is called on a read event from a listening socket, corresponding
606 * to an accept. It tries to accept as many connections as possible, and for each
607 * calls the listener's accept handler (generally the frontend's accept handler).
608 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200609void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200610{
611 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100612 struct proxy *p;
613 int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100614 int next_conn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200615 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200616 int cfd;
617 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100618#ifdef USE_ACCEPT4
619 static int accept4_broken;
620#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200621
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100622 if (!l)
623 return;
624 p = l->bind_conf->frontend;
625 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200626
Willy Tarreau93e7c002013-10-07 18:51:07 +0200627 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
628 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200629
630 if (unlikely(!max)) {
631 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200632 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200633 goto wait_expire;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200634 }
635
636 if (max_accept > max)
637 max_accept = max;
638 }
639
640 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200641 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
642
643 if (unlikely(!max)) {
644 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200645 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200646 goto wait_expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200647 }
648
649 if (max_accept > max)
650 max_accept = max;
651 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200652#ifdef USE_OPENSSL
653 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
654 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200655
Willy Tarreaue43d5322013-10-07 20:01:52 +0200656 if (unlikely(!max)) {
657 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200658 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200659 goto wait_expire;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200660 }
661
662 if (max_accept > max)
663 max_accept = max;
664 }
665#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200666 if (p && p->fe_sps_lim) {
667 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
668
669 if (unlikely(!max)) {
670 /* frontend accept rate limit was reached */
671 limit_listener(l, &p->listener_queue);
672 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 +0200673 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200674 }
675
676 if (max_accept > max)
677 max_accept = max;
678 }
679
680 /* Note: if we fail to allocate a connection because of configured
681 * limits, we'll schedule a new attempt worst 1 second later in the
682 * worst case. If we fail due to system limits or temporary resource
683 * shortage, we try again 100ms later in the worst case.
684 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100685 for (; max_accept-- > 0; next_conn = 0) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200686 struct sockaddr_storage addr;
687 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200688 unsigned int count;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200689
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100690 /* pre-increase the number of connections without going too far */
691 do {
692 count = l->nbconn;
693 if (count >= l->maxconn) {
694 /* the listener was marked full or another
695 * thread is going to do it.
696 */
697 next_conn = 0;
698 goto end;
699 }
700 next_conn = count + 1;
701 } while (!HA_ATOMIC_CAS(&l->nbconn, &count, next_conn));
702
703 if (next_conn == l->maxconn) {
704 /* we filled it, mark it full */
705 listener_full(l);
706 }
707
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200708 if (unlikely(actconn >= global.maxconn) && !(l->options & LI_O_UNLIMITED)) {
709 limit_listener(l, &global_listener_queue);
710 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200711 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200712 }
713
714 if (unlikely(p && p->feconn >= p->maxconn)) {
715 limit_listener(l, &p->listener_queue);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200716 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200717 }
718
William Lallemand2fe7dd02018-09-11 16:51:29 +0200719 /* with sockpair@ we don't want to do an accept */
720 if (unlikely(l->addr.ss_family == AF_CUST_SOCKPAIR)) {
721 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100722 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100723 /* just like with UNIX sockets, only the family is filled */
724 addr.ss_family = AF_UNIX;
725 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200726 } else
727
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200728#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100729 /* only call accept4() if it's known to be safe, otherwise
730 * fallback to the legacy accept() + fcntl().
731 */
732 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100733 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100734 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
735 (accept4_broken = 1))))
736#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200737 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100738 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100739
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200740 if (unlikely(cfd == -1)) {
741 switch (errno) {
742 case EAGAIN:
Willy Tarreaubb660302014-05-07 19:47:02 +0200743 if (fdtab[fd].ev & FD_POLL_HUP) {
744 /* the listening socket might have been disabled in a shared
745 * process and we're a collateral victim. We'll just pause for
746 * a while in case it comes back. In the mean time, we need to
747 * clear this sticky flag.
748 */
749 fdtab[fd].ev &= ~FD_POLL_HUP;
750 goto transient_error;
751 }
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100752 fd_cant_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200753 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200754 case EINVAL:
755 /* might be trying to accept on a shut fd (eg: soft stop) */
756 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100757 case EINTR:
758 case ECONNABORTED:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100759 HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100760 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200761 case ENFILE:
762 if (p)
763 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100764 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
765 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200766 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200767 case EMFILE:
768 if (p)
769 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100770 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
771 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200772 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200773 case ENOBUFS:
774 case ENOMEM:
775 if (p)
776 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100777 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
778 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200779 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200780 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100781 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100782 goto stop;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200783 }
784 }
785
William Lallemandd9138002018-11-27 12:02:39 +0100786 /* we don't want to leak the FD upon reload if it's in the master */
787 if (unlikely(master == 1))
788 fcntl(cfd, F_SETFD, FD_CLOEXEC);
789
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100790 /* The connection was accepted, it must be counted as such */
791 if (l->counters)
792 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
793
794 if (!(l->options & LI_O_UNLIMITED)) {
795 count = update_freq_ctr(&global.conn_per_sec, 1);
796 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
797 HA_ATOMIC_ADD(&actconn, 1);
798 }
799
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200800 if (unlikely(cfd >= global.maxsock)) {
801 send_log(p, LOG_EMERG,
802 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
803 p->id);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100804 if (!(l->options & LI_O_UNLIMITED))
805 HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200806 close(cfd);
807 limit_listener(l, &global_listener_queue);
808 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200809 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200810 }
811
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100812 /* past this point, l->accept() will automatically decrement
813 * l->nbconn and actconn once done. Setting next_conn=0 allows
814 * the error path not to rollback on nbconn. It's more convenient
815 * than duplicating all exit labels.
816 */
817 next_conn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200818
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100819#if defined(USE_THREAD)
820 count = l->bind_conf->thr_count;
821 if (count > 1) {
822 struct accept_queue_ring *ring;
823 int r, t1, t2, q1, q2;
824
825 /* pick two small distinct random values and drop lower bits */
826 r = (random() >> 8) % ((count - 1) * count);
827 t2 = r / count; // 0..thr_count-2
828 t1 = r % count; // 0..thr_count-1
829 t2 += t1 + 1; // necessarily different from t1
830
831 if (t2 >= count)
832 t2 -= count;
833
834 t1 = bind_map_thread_id(l->bind_conf, t1);
835 t2 = bind_map_thread_id(l->bind_conf, t2);
836
837 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
838 if (q1 >= ACCEPT_QUEUE_SIZE)
839 q1 -= ACCEPT_QUEUE_SIZE;
840
841 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
842 if (q2 >= ACCEPT_QUEUE_SIZE)
843 q2 -= ACCEPT_QUEUE_SIZE;
844
845 /* make t1 the lowest loaded thread */
846 if (q1 >= ACCEPT_QUEUE_SIZE || l->thr_conn[t1] + q1 > l->thr_conn[t2] + q2)
847 t1 = t2;
848
849 /* We use deferred accepts even if it's the local thread because
850 * tests show that it's the best performing model, likely due to
851 * better cache locality when processing this loop.
852 */
853 ring = &accept_queue_rings[t1];
854 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Willy Tarreau8a034082019-02-27 10:45:55 +0100855 HA_ATOMIC_ADD(&activity[t1].accq_pushed, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100856 task_wakeup(ring->task, TASK_WOKEN_IO);
857 continue;
858 }
859 /* If the ring is full we do a synchronous accept on
860 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100861 */
Willy Tarreau8a034082019-02-27 10:45:55 +0100862 HA_ATOMIC_ADD(&activity[t1].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100863 }
864#endif // USE_THREAD
865
Willy Tarreau9e853182019-02-03 10:36:29 +0100866 HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200867 ret = l->accept(l, cfd, &addr);
868 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +0200869 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200870 * we just have to ignore it (ret == 0) or it's a critical
871 * error due to a resource shortage, and we must stop the
872 * listener (ret < 0).
873 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200874 if (ret == 0) /* successful termination */
875 continue;
876
Willy Tarreaubb660302014-05-07 19:47:02 +0200877 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200878 }
879
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100880 /* increase the per-process number of cumulated sessions, this
881 * may only be done once l->accept() has accepted the connection.
882 */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200883 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200884 count = update_freq_ctr(&global.sess_per_sec, 1);
885 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200886 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200887#ifdef USE_OPENSSL
888 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200889 count = update_freq_ctr(&global.ssl_per_sec, 1);
890 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +0200891 }
892#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +0200893
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100894 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200895
Willy Tarreauaece46a2012-07-06 12:25:58 +0200896 /* we've exhausted max_accept, so there is no need to poll again */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100897 stop:
898 fd_done_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200899 goto end;
Willy Tarreaubb660302014-05-07 19:47:02 +0200900
901 transient_error:
902 /* pause the listener and try again in 100 ms */
903 expire = tick_add(now_ms, 100);
904
905 wait_expire:
906 limit_listener(l, &global_listener_queue);
907 task_schedule(global_listener_queue_task, tick_first(expire, global_listener_queue_task->expire));
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200908 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100909 if (next_conn)
910 HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +0100911
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100912 if (l->nbconn < l->maxconn && l->state == LI_FULL) {
913 /* at least one thread has to this when quitting */
914 resume_listener(l);
915
916 /* Dequeues all of the listeners waiting for a resource */
917 if (!LIST_ISEMPTY(&global_listener_queue))
918 dequeue_all_listeners(&global_listener_queue);
919
920 if (!LIST_ISEMPTY(&p->listener_queue) &&
921 (!p->fe_sps_lim || freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0) > 0))
922 dequeue_all_listeners(&p->listener_queue);
923 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200924}
925
Willy Tarreau05f50472017-09-15 09:19:58 +0200926/* Notify the listener that a connection initiated from it was released. This
927 * is used to keep the connection count consistent and to possibly re-open
928 * listening when it was limited.
929 */
930void listener_release(struct listener *l)
931{
932 struct proxy *fe = l->bind_conf->frontend;
933
934 if (!(l->options & LI_O_UNLIMITED))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200935 HA_ATOMIC_SUB(&actconn, 1);
936 HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau9e853182019-02-03 10:36:29 +0100937 HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau05f50472017-09-15 09:19:58 +0200938 if (l->state == LI_FULL)
939 resume_listener(l);
940
941 /* Dequeues all of the listeners waiting for a resource */
942 if (!LIST_ISEMPTY(&global_listener_queue))
943 dequeue_all_listeners(&global_listener_queue);
944
945 if (!LIST_ISEMPTY(&fe->listener_queue) &&
946 (!fe->fe_sps_lim || freq_ctr_remain(&fe->fe_sess_per_sec, fe->fe_sps_lim, 0) > 0))
947 dequeue_all_listeners(&fe->listener_queue);
948}
949
Willy Tarreau26982662012-09-12 23:17:10 +0200950/*
951 * Registers the bind keyword list <kwl> as a list of valid keywords for next
952 * parsing sessions.
953 */
954void bind_register_keywords(struct bind_kw_list *kwl)
955{
956 LIST_ADDQ(&bind_keywords.list, &kwl->list);
957}
958
959/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
960 * keyword is found with a NULL ->parse() function, then an attempt is made to
961 * find one with a valid ->parse() function. This way it is possible to declare
962 * platform-dependant, known keywords as NULL, then only declare them as valid
963 * if some options are met. Note that if the requested keyword contains an
964 * opening parenthesis, everything from this point is ignored.
965 */
966struct bind_kw *bind_find_kw(const char *kw)
967{
968 int index;
969 const char *kwend;
970 struct bind_kw_list *kwl;
971 struct bind_kw *ret = NULL;
972
973 kwend = strchr(kw, '(');
974 if (!kwend)
975 kwend = kw + strlen(kw);
976
977 list_for_each_entry(kwl, &bind_keywords.list, list) {
978 for (index = 0; kwl->kw[index].kw != NULL; index++) {
979 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
980 kwl->kw[index].kw[kwend-kw] == 0) {
981 if (kwl->kw[index].parse)
982 return &kwl->kw[index]; /* found it !*/
983 else
984 ret = &kwl->kw[index]; /* may be OK */
985 }
986 }
987 }
988 return ret;
989}
990
Willy Tarreau8638f482012-09-18 18:01:17 +0200991/* Dumps all registered "bind" keywords to the <out> string pointer. The
992 * unsupported keywords are only dumped if their supported form was not
993 * found.
994 */
995void bind_dump_kws(char **out)
996{
997 struct bind_kw_list *kwl;
998 int index;
999
1000 *out = NULL;
1001 list_for_each_entry(kwl, &bind_keywords.list, list) {
1002 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1003 if (kwl->kw[index].parse ||
1004 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001005 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1006 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001007 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001008 kwl->kw[index].skip ? " <arg>" : "",
1009 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001010 }
1011 }
1012 }
1013}
1014
Willy Tarreaub2b50a72019-02-03 11:14:25 +01001015/* recompute the bit counts per parity for the bind_thread value. This will be
1016 * used to quickly map a thread number from 1 to #thread to a thread ID among
1017 * the ones bound. This is the preparation phase of the bit rank counting algo
1018 * described here: https://graphics.stanford.edu/~seander/bithacks.html
1019 */
1020void bind_recount_thread_bits(struct bind_conf *conf)
1021{
1022 unsigned long m;
1023
1024 m = thread_mask(conf->bind_thread);
1025 conf->thr_count = my_popcountl(m);
1026 mask_prep_rank_map(m, &conf->thr_2, &conf->thr_4, &conf->thr_8, &conf->thr_16);
1027}
1028
1029/* Report the ID of thread <r> in bind_conf <conf> according to its thread_mask.
1030 * <r> must be between 0 and LONGBITS-1. This makes use of the pre-computed
1031 * bits resulting from bind_recount_thread_bits. See this function for more
1032 * info.
1033 */
1034unsigned int bind_map_thread_id(const struct bind_conf *conf, unsigned int r)
1035{
1036 unsigned long m;
1037
1038 m = thread_mask(conf->bind_thread);
1039 return mask_find_rank_bit_fast(r, m, conf->thr_2, conf->thr_4, conf->thr_8, conf->thr_16);
1040}
1041
Willy Tarreau645513a2010-05-24 20:55:15 +02001042/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001043/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001044/************************************************************************/
1045
Willy Tarreaua5e37562011-12-16 17:06:15 +01001046/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001047static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001048smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001049{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001050 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001051 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001052 return 1;
1053}
1054
Willy Tarreaua5e37562011-12-16 17:06:15 +01001055/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001056static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001057smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001058{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001059 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001060 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001061 return 1;
1062}
1063
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001064/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001065static 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 +02001066{
1067 struct listener *l;
1068
Willy Tarreau4348fad2012-09-20 16:48:07 +02001069 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001070 l->options |= LI_O_ACC_PROXY;
1071
1072 return 0;
1073}
1074
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001075/* parse the "accept-netscaler-cip" bind keyword */
1076static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1077{
1078 struct listener *l;
1079 uint32_t val;
1080
1081 if (!*args[cur_arg + 1]) {
1082 memprintf(err, "'%s' : missing value", args[cur_arg]);
1083 return ERR_ALERT | ERR_FATAL;
1084 }
1085
1086 val = atol(args[cur_arg + 1]);
1087 if (val <= 0) {
1088 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
1089 return ERR_ALERT | ERR_FATAL;
1090 }
1091
1092 list_for_each_entry(l, &conf->listeners, by_bind) {
1093 l->options |= LI_O_ACC_CIP;
1094 conf->ns_cip_magic = val;
1095 }
1096
1097 return 0;
1098}
1099
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001100/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001101static 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 +02001102{
1103 struct listener *l;
1104 int val;
1105
1106 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001107 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001108 return ERR_ALERT | ERR_FATAL;
1109 }
1110
1111 val = atol(args[cur_arg + 1]);
1112 if (val <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001113 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001114 return ERR_ALERT | ERR_FATAL;
1115 }
1116
Willy Tarreau4348fad2012-09-20 16:48:07 +02001117 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001118 l->backlog = val;
1119
1120 return 0;
1121}
1122
1123/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001124static 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 +02001125{
1126 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001127 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001128 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001129
Willy Tarreau4348fad2012-09-20 16:48:07 +02001130 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001131 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001132 return ERR_ALERT | ERR_FATAL;
1133 }
1134
1135 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001136 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001137 return ERR_ALERT | ERR_FATAL;
1138 }
1139
Willy Tarreau4348fad2012-09-20 16:48:07 +02001140 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001141 new->luid = strtol(args[cur_arg + 1], &error, 10);
1142 if (*error != '\0') {
1143 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1144 return ERR_ALERT | ERR_FATAL;
1145 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001146 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001147
Willy Tarreau4348fad2012-09-20 16:48:07 +02001148 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001149 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001150 return ERR_ALERT | ERR_FATAL;
1151 }
1152
Willy Tarreau4348fad2012-09-20 16:48:07 +02001153 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001154 if (node) {
1155 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001156 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1157 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1158 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001159 return ERR_ALERT | ERR_FATAL;
1160 }
1161
Willy Tarreau4348fad2012-09-20 16:48:07 +02001162 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001163 return 0;
1164}
1165
1166/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001167static 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 +02001168{
1169 struct listener *l;
1170 int val;
1171
1172 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001173 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001174 return ERR_ALERT | ERR_FATAL;
1175 }
1176
1177 val = atol(args[cur_arg + 1]);
1178 if (val <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001179 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001180 return ERR_ALERT | ERR_FATAL;
1181 }
1182
Willy Tarreau4348fad2012-09-20 16:48:07 +02001183 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001184 l->maxconn = val;
1185
1186 return 0;
1187}
1188
1189/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001190static 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 +02001191{
1192 struct listener *l;
1193
1194 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001195 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001196 return ERR_ALERT | ERR_FATAL;
1197 }
1198
Willy Tarreau4348fad2012-09-20 16:48:07 +02001199 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001200 l->name = strdup(args[cur_arg + 1]);
1201
1202 return 0;
1203}
1204
1205/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001206static 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 +02001207{
1208 struct listener *l;
1209 int val;
1210
1211 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001212 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001213 return ERR_ALERT | ERR_FATAL;
1214 }
1215
1216 val = atol(args[cur_arg + 1]);
1217 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001218 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001219 return ERR_ALERT | ERR_FATAL;
1220 }
1221
Willy Tarreau4348fad2012-09-20 16:48:07 +02001222 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001223 l->nice = val;
1224
1225 return 0;
1226}
1227
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001228/* parse the "process" bind keyword */
1229static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1230{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001231 char *slash;
1232 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001233
Christopher Fauletc644fa92017-11-23 22:44:11 +01001234 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1235 *slash = 0;
1236
Willy Tarreauff9c9142019-02-07 10:39:36 +01001237 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001238 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001239 return ERR_ALERT | ERR_FATAL;
1240 }
1241
Christopher Fauletc644fa92017-11-23 22:44:11 +01001242 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001243 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001244 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1245 return ERR_ALERT | ERR_FATAL;
1246 }
1247 *slash = '/';
1248 }
1249
1250 conf->bind_proc |= proc;
Willy Tarreaua36b3242019-02-02 13:14:34 +01001251 conf->bind_thread |= thread;
Willy Tarreaub2b50a72019-02-03 11:14:25 +01001252 bind_recount_thread_bits(conf);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001253 return 0;
1254}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001255
Christopher Fauleta717b992018-04-10 14:43:00 +02001256/* parse the "proto" bind keyword */
1257static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1258{
1259 struct ist proto;
1260
1261 if (!*args[cur_arg + 1]) {
1262 memprintf(err, "'%s' : missing value", args[cur_arg]);
1263 return ERR_ALERT | ERR_FATAL;
1264 }
1265
1266 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1267 conf->mux_proto = get_mux_proto(proto);
1268 if (!conf->mux_proto) {
1269 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1270 return ERR_ALERT | ERR_FATAL;
1271 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001272 return 0;
1273}
1274
Willy Tarreau61612d42012-04-19 18:42:05 +02001275/* Note: must not be declared <const> as its list will be overwritten.
1276 * Please take care of keeping this list alphabetically sorted.
1277 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001278static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001279 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1280 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001281 { /* END */ },
1282}};
1283
Willy Tarreau0108d902018-11-25 19:14:37 +01001284INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1285
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001286/* Note: must not be declared <const> as its list will be overwritten.
1287 * Please take care of keeping this list alphabetically sorted.
1288 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001289static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001290 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001291}};
1292
Willy Tarreau0108d902018-11-25 19:14:37 +01001293INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1294
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001295/* Note: must not be declared <const> as its list will be overwritten.
1296 * Please take care of keeping this list alphabetically sorted, doing so helps
1297 * all code contributors.
1298 * Optional keywords are also declared with a NULL ->parse() function so that
1299 * the config parser can report an appropriate error when a known keyword was
1300 * not enabled.
1301 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001302static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001303 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001304 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1305 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1306 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1307 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1308 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1309 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001310 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001311 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001312 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001313}};
1314
Willy Tarreau0108d902018-11-25 19:14:37 +01001315INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1316
Willy Tarreau645513a2010-05-24 20:55:15 +02001317/*
1318 * Local variables:
1319 * c-indent-level: 8
1320 * c-basic-offset: 8
1321 * End:
1322 */