blob: 8b167bd7215d8797ce16a88e429929cc6919bd71 [file] [log] [blame]
Willy Tarreaudd815982007-10-16 12:25:14 +02001/*
Willy Tarreaud1d54542012-09-12 22:58:11 +02002 * Listener management functions.
Willy Tarreaudd815982007-10-16 12:25:14 +02003 *
Willy Tarreau0ccb7442013-01-07 22:54:17 +01004 * Copyright 2000-2013 Willy Tarreau <w@1wt.eu>
Willy Tarreaudd815982007-10-16 12:25:14 +02005 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 *
11 */
12
Willy Tarreau44489252014-01-14 17:52:01 +010013#define _GNU_SOURCE
Willy Tarreau6ae1ba62014-05-07 19:01:58 +020014#include <ctype.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020015#include <errno.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020016#include <stdio.h>
17#include <string.h>
Willy Tarreau95ccdde2014-02-01 09:28:36 +010018#include <unistd.h>
19#include <fcntl.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020020
Willy Tarreau1bc4aab2012-10-08 20:11:03 +020021#include <common/accept4.h>
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +010022#include <common/cfgparse.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020023#include <common/config.h>
Willy Tarreaudabf2e22007-10-28 21:59:24 +010024#include <common/errors.h>
Willy Tarreau0108d902018-11-25 19:14:37 +010025#include <common/initcall.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020026#include <common/mini-clist.h>
27#include <common/standard.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020028#include <common/time.h>
29
30#include <types/global.h>
Willy Tarreaud1d54542012-09-12 22:58:11 +020031#include <types/protocol.h>
Willy Tarreaudd815982007-10-16 12:25:14 +020032
Willy Tarreau645513a2010-05-24 20:55:15 +020033#include <proto/acl.h>
Christopher Fauleta717b992018-04-10 14:43:00 +020034#include <proto/connection.h>
Willy Tarreaub648d632007-10-28 22:13:50 +010035#include <proto/fd.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020036#include <proto/freq_ctr.h>
37#include <proto/log.h>
Willy Tarreau7a798e52016-04-14 11:13:20 +020038#include <proto/listener.h>
Willy Tarreau0de59fd2017-09-15 08:10:44 +020039#include <proto/protocol.h>
William Lallemand2fe7dd02018-09-11 16:51:29 +020040#include <proto/proto_sockpair.h>
Willy Tarreau0ccb7442013-01-07 22:54:17 +010041#include <proto/sample.h>
Willy Tarreaufb0afa72015-04-03 14:46:27 +020042#include <proto/stream.h>
Willy Tarreaubbebbbf2012-05-07 21:22:09 +020043#include <proto/task.h>
Willy Tarreaub648d632007-10-28 22:13:50 +010044
Willy Tarreau26982662012-09-12 23:17:10 +020045/* List head of all known bind keywords */
46static struct bind_kw_list bind_keywords = {
47 .list = LIST_HEAD_INIT(bind_keywords.list)
48};
49
Olivier Houchardf73629d2017-04-05 22:33:04 +020050struct xfer_sock_list *xfer_sock_list = NULL;
51
Willy Tarreau1efafce2019-01-27 15:37:19 +010052#if defined(USE_THREAD)
53
54struct accept_queue_ring accept_queue_rings[MAX_THREADS] __attribute__((aligned(64))) = { };
55
56/* dequeue and process a pending connection from the local accept queue (single
57 * consumer). Returns the accepted fd or -1 if none was found. The listener is
58 * placed into *li. The address is copied into *addr for no more than *addr_len
59 * bytes, and the address length is returned into *addr_len.
60 */
61int accept_queue_pop_sc(struct accept_queue_ring *ring, struct listener **li, void *addr, int *addr_len)
62{
63 struct accept_queue_entry *e;
64 unsigned int pos, next;
65 struct listener *ptr;
66 int len;
67 int fd;
68
69 pos = ring->head;
70
71 if (pos == ring->tail)
72 return -1;
73
74 next = pos + 1;
75 if (next >= ACCEPT_QUEUE_SIZE)
76 next = 0;
77
78 e = &ring->entry[pos];
79
80 /* wait for the producer to update the listener's pointer */
81 while (1) {
82 ptr = e->listener;
83 __ha_barrier_load();
84 if (ptr)
85 break;
86 pl_cpu_relax();
87 }
88
89 fd = e->fd;
90 len = e->addr_len;
91 if (len > *addr_len)
92 len = *addr_len;
93
94 if (likely(len > 0))
95 memcpy(addr, &e->addr, len);
96
97 /* release the entry */
98 e->listener = NULL;
99
100 __ha_barrier_store();
101 ring->head = next;
102
103 *addr_len = len;
104 *li = ptr;
105
106 return fd;
107}
108
109
110/* tries to push a new accepted connection <fd> into ring <ring> for listener
111 * <li>, from address <addr> whose length is <addr_len>. Returns non-zero if it
112 * succeeds, or zero if the ring is full. Supports multiple producers.
113 */
114int accept_queue_push_mp(struct accept_queue_ring *ring, int fd,
115 struct listener *li, const void *addr, int addr_len)
116{
117 struct accept_queue_entry *e;
118 unsigned int pos, next;
119
120 pos = ring->tail;
121 do {
122 next = pos + 1;
123 if (next >= ACCEPT_QUEUE_SIZE)
124 next = 0;
125 if (next == ring->head)
126 return 0; // ring full
Olivier Houchard64213e92019-03-08 18:52:57 +0100127 } while (unlikely(!_HA_ATOMIC_CAS(&ring->tail, &pos, next)));
Willy Tarreau1efafce2019-01-27 15:37:19 +0100128
129
130 e = &ring->entry[pos];
131
132 if (addr_len > sizeof(e->addr))
133 addr_len = sizeof(e->addr);
134
135 if (addr_len)
136 memcpy(&e->addr, addr, addr_len);
137
138 e->addr_len = addr_len;
139 e->fd = fd;
140
141 __ha_barrier_store();
142 /* now commit the change */
143
144 e->listener = li;
145 return 1;
146}
147
148/* proceed with accepting new connections */
149static struct task *accept_queue_process(struct task *t, void *context, unsigned short state)
150{
151 struct accept_queue_ring *ring = context;
152 struct listener *li;
153 struct sockaddr_storage addr;
Christopher Faulet102854c2019-04-30 12:17:13 +0200154 unsigned int max_accept;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100155 int addr_len;
156 int ret;
157 int fd;
158
Christopher Faulet102854c2019-04-30 12:17:13 +0200159 /* if global.tune.maxaccept is -1, then max_accept is UINT_MAX. It
160 * is not really illimited, but it is probably enough.
161 */
162 max_accept = global.tune.maxaccept ? global.tune.maxaccept : 64;
163 for (; max_accept; max_accept--) {
Willy Tarreau1efafce2019-01-27 15:37:19 +0100164 addr_len = sizeof(addr);
165 fd = accept_queue_pop_sc(ring, &li, &addr, &addr_len);
166 if (fd < 0)
167 break;
168
Olivier Houchard64213e92019-03-08 18:52:57 +0100169 _HA_ATOMIC_ADD(&li->thr_conn[tid], 1);
Willy Tarreau1efafce2019-01-27 15:37:19 +0100170 ret = li->accept(li, fd, &addr);
171 if (ret <= 0) {
172 /* connection was terminated by the application */
173 continue;
174 }
175
176 /* increase the per-process number of cumulated sessions, this
177 * may only be done once l->accept() has accepted the connection.
178 */
179 if (!(li->options & LI_O_UNLIMITED)) {
180 HA_ATOMIC_UPDATE_MAX(&global.sps_max,
181 update_freq_ctr(&global.sess_per_sec, 1));
182 if (li->bind_conf && li->bind_conf->is_ssl) {
183 HA_ATOMIC_UPDATE_MAX(&global.ssl_max,
184 update_freq_ctr(&global.ssl_per_sec, 1));
185 }
186 }
187 }
188
189 /* ran out of budget ? Let's come here ASAP */
Christopher Faulet102854c2019-04-30 12:17:13 +0200190 if (!max_accept)
Willy Tarreau1efafce2019-01-27 15:37:19 +0100191 task_wakeup(t, TASK_WOKEN_IO);
192
193 return t;
194}
195
196/* Initializes the accept-queues. Returns 0 on success, otherwise ERR_* flags */
197static int accept_queue_init()
198{
199 struct task *t;
200 int i;
201
202 for (i = 0; i < global.nbthread; i++) {
203 t = task_new(1UL << i);
204 if (!t) {
205 ha_alert("Out of memory while initializing accept queue for thread %d\n", i);
206 return ERR_FATAL|ERR_ABORT;
207 }
Willy Tarreau0d858442019-04-12 15:25:04 +0200208 t->nice = -1024;
Willy Tarreau1efafce2019-01-27 15:37:19 +0100209 t->process = accept_queue_process;
210 t->context = &accept_queue_rings[i];
211 accept_queue_rings[i].task = t;
212 }
213 return 0;
214}
215
216REGISTER_CONFIG_POSTPARSER("multi-threaded accept queue", accept_queue_init);
217
218#endif // USE_THREAD
219
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100220/* This function adds the specified listener's file descriptor to the polling
221 * lists if it is in the LI_LISTEN state. The listener enters LI_READY or
Willy Tarreauae302532014-05-07 19:22:24 +0200222 * LI_FULL state depending on its number of connections. In deamon mode, we
223 * also support binding only the relevant processes to their respective
224 * listeners. We don't do that in debug mode however.
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100225 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200226static void enable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100227{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100228 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100229 if (listener->state == LI_LISTEN) {
William Lallemand095ba4c2017-06-01 17:38:50 +0200230 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100231 !(proc_mask(listener->bind_conf->bind_proc) & pid_bit)) {
Willy Tarreauae302532014-05-07 19:22:24 +0200232 /* we don't want to enable this listener and don't
233 * want any fd event to reach it.
234 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200235 if (!(global.tune.options & GTUNE_SOCKET_TRANSFER))
Christopher Faulet510c0d62018-03-16 10:04:47 +0100236 do_unbind_listener(listener, 1);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200237 else {
Christopher Faulet510c0d62018-03-16 10:04:47 +0100238 do_unbind_listener(listener, 0);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200239 listener->state = LI_LISTEN;
240 }
Willy Tarreauae302532014-05-07 19:22:24 +0200241 }
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100242 else if (!listener->maxconn || listener->nbconn < listener->maxconn) {
Willy Tarreau49b046d2012-08-09 12:11:58 +0200243 fd_want_recv(listener->fd);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100244 listener->state = LI_READY;
Willy Tarreauae302532014-05-07 19:22:24 +0200245 }
246 else {
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100247 listener->state = LI_FULL;
248 }
249 }
William Lallemande22f11f2018-09-11 10:06:27 +0200250 /* if this listener is supposed to be only in the master, close it in the workers */
251 if ((global.mode & MODE_MWORKER) &&
252 (listener->options & LI_O_MWORKER) &&
253 master == 0) {
254 do_unbind_listener(listener, 1);
255 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100256 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100257}
258
259/* This function removes the specified listener's file descriptor from the
260 * polling lists if it is in the LI_READY or in the LI_FULL state. The listener
261 * enters LI_LISTEN.
262 */
Christopher Fauletf5b8adc2017-06-02 10:00:35 +0200263static void disable_listener(struct listener *listener)
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100264{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100265 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100266 if (listener->state < LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200267 goto end;
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100268 if (listener->state == LI_READY)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200269 fd_stop_recv(listener->fd);
Willy Tarreau01abd022019-02-28 10:27:18 +0100270 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100271 listener->state = LI_LISTEN;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200272 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100273 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100274}
275
Willy Tarreaube58c382011-07-24 18:28:10 +0200276/* This function tries to temporarily disable a listener, depending on the OS
277 * capabilities. Linux unbinds the listen socket after a SHUT_RD, and ignores
278 * SHUT_WR. Solaris refuses either shutdown(). OpenBSD ignores SHUT_RD but
279 * closes upon SHUT_WR and refuses to rebind. So a common validation path
280 * involves SHUT_WR && listen && SHUT_RD. In case of success, the FD's polling
281 * is disabled. It normally returns non-zero, unless an error is reported.
282 */
283int pause_listener(struct listener *l)
284{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200285 int ret = 1;
286
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100287 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200288
Olivier Houchard1fc05162017-04-06 01:05:05 +0200289 if (l->state <= LI_ZOMBIE)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200290 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200291
Willy Tarreau092d8652014-07-07 20:22:12 +0200292 if (l->proto->pause) {
293 /* Returns < 0 in case of failure, 0 if the listener
294 * was totally stopped, or > 0 if correctly paused.
295 */
296 int ret = l->proto->pause(l);
Willy Tarreaube58c382011-07-24 18:28:10 +0200297
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200298 if (ret < 0) {
299 ret = 0;
300 goto end;
301 }
Willy Tarreau092d8652014-07-07 20:22:12 +0200302 else if (ret == 0)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200303 goto end;
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200304 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200305
Willy Tarreau01abd022019-02-28 10:27:18 +0100306 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200307
Willy Tarreau49b046d2012-08-09 12:11:58 +0200308 fd_stop_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200309 l->state = LI_PAUSED;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200310 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100311 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200312 return ret;
Willy Tarreaube58c382011-07-24 18:28:10 +0200313}
314
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200315/* This function tries to resume a temporarily disabled listener. Paused, full,
316 * limited and disabled listeners are handled, which means that this function
317 * may replace enable_listener(). The resulting state will either be LI_READY
318 * or LI_FULL. 0 is returned in case of failure to resume (eg: dead socket).
Willy Tarreauae302532014-05-07 19:22:24 +0200319 * Listeners bound to a different process are not woken up unless we're in
Willy Tarreauaf2fd582015-04-14 12:07:16 +0200320 * foreground mode, and are ignored. If the listener was only in the assigned
321 * state, it's totally rebound. This can happen if a pause() has completely
322 * stopped it. If the resume fails, 0 is returned and an error might be
323 * displayed.
Willy Tarreaube58c382011-07-24 18:28:10 +0200324 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100325int resume_listener(struct listener *l)
Willy Tarreaube58c382011-07-24 18:28:10 +0200326{
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200327 int ret = 1;
328
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100329 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200330
William Lallemand095ba4c2017-06-01 17:38:50 +0200331 if ((global.mode & (MODE_DAEMON | MODE_MWORKER)) &&
Willy Tarreau6daac192019-02-02 17:39:53 +0100332 !(proc_mask(l->bind_conf->bind_proc) & pid_bit))
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200333 goto end;
Willy Tarreau3569df32017-03-15 12:47:46 +0100334
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200335 if (l->state == LI_ASSIGNED) {
336 char msg[100];
337 int err;
338
339 err = l->proto->bind(l, msg, sizeof(msg));
340 if (err & ERR_ALERT)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100341 ha_alert("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200342 else if (err & ERR_WARN)
Christopher Faulet767a84b2017-11-24 16:50:31 +0100343 ha_warning("Resuming listener: %s\n", msg);
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200344
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200345 if (err & (ERR_FATAL | ERR_ABORT)) {
346 ret = 0;
347 goto end;
348 }
Willy Tarreau1c4b8142014-07-07 21:06:24 +0200349 }
350
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200351 if (l->state < LI_PAUSED || l->state == LI_ZOMBIE) {
352 ret = 0;
353 goto end;
354 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200355
Willy Tarreaub3fb60b2012-10-04 08:56:31 +0200356 if (l->proto->sock_prot == IPPROTO_TCP &&
357 l->state == LI_PAUSED &&
Willy Tarreaue2711c72019-02-27 15:39:41 +0100358 listen(l->fd, listener_backlog(l)) != 0) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200359 ret = 0;
360 goto end;
361 }
Willy Tarreaube58c382011-07-24 18:28:10 +0200362
363 if (l->state == LI_READY)
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200364 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200365
Willy Tarreau01abd022019-02-28 10:27:18 +0100366 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200367
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100368 if (l->maxconn && l->nbconn >= l->maxconn) {
Willy Tarreaube58c382011-07-24 18:28:10 +0200369 l->state = LI_FULL;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200370 goto end;
Willy Tarreaube58c382011-07-24 18:28:10 +0200371 }
372
Willy Tarreau49b046d2012-08-09 12:11:58 +0200373 fd_want_recv(l->fd);
Willy Tarreaube58c382011-07-24 18:28:10 +0200374 l->state = LI_READY;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200375 end:
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100376 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200377 return ret;
378}
379
Willy Tarreau87b09662015-04-03 00:22:06 +0200380/* Marks a ready listener as full so that the stream code tries to re-enable
Willy Tarreau62793712011-07-24 19:23:38 +0200381 * it upon next close() using resume_listener().
382 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200383static void listener_full(struct listener *l)
Willy Tarreau62793712011-07-24 19:23:38 +0200384{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100385 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200386 if (l->state >= LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100387 LIST_DEL_LOCKED(&l->wait_queue);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100388 if (l->state != LI_FULL) {
389 fd_stop_recv(l->fd);
390 l->state = LI_FULL;
391 }
Willy Tarreau62793712011-07-24 19:23:38 +0200392 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100393 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreau62793712011-07-24 19:23:38 +0200394}
395
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200396/* Marks a ready listener as limited so that we only try to re-enable it when
397 * resources are free again. It will be queued into the specified queue.
398 */
Christopher Faulet5580ba22017-08-28 15:29:20 +0200399static void limit_listener(struct listener *l, struct list *list)
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200400{
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100401 HA_SPIN_LOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200402 if (l->state == LI_READY) {
Willy Tarreau01abd022019-02-28 10:27:18 +0100403 LIST_ADDQ_LOCKED(list, &l->wait_queue);
Willy Tarreau49b046d2012-08-09 12:11:58 +0200404 fd_stop_recv(l->fd);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200405 l->state = LI_LIMITED;
406 }
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100407 HA_SPIN_UNLOCK(LISTENER_LOCK, &l->lock);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200408}
409
Willy Tarreaudabf2e22007-10-28 21:59:24 +0100410/* This function adds all of the protocol's listener's file descriptors to the
411 * polling lists when they are in the LI_LISTEN state. It is intended to be
412 * used as a protocol's generic enable_all() primitive, for use after the
413 * fork(). It puts the listeners into LI_READY or LI_FULL states depending on
414 * their number of connections. It always returns ERR_NONE.
415 */
416int enable_all_listeners(struct protocol *proto)
417{
418 struct listener *listener;
419
420 list_for_each_entry(listener, &proto->listeners, proto_list)
421 enable_listener(listener);
422 return ERR_NONE;
423}
424
425/* This function removes all of the protocol's listener's file descriptors from
426 * the polling lists when they are in the LI_READY or LI_FULL states. It is
427 * intended to be used as a protocol's generic disable_all() primitive. It puts
428 * the listeners into LI_LISTEN, and always returns ERR_NONE.
429 */
430int disable_all_listeners(struct protocol *proto)
431{
432 struct listener *listener;
433
434 list_for_each_entry(listener, &proto->listeners, proto_list)
435 disable_listener(listener);
436 return ERR_NONE;
437}
438
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200439/* Dequeues all of the listeners waiting for a resource in wait queue <queue>. */
440void dequeue_all_listeners(struct list *list)
441{
Willy Tarreau01abd022019-02-28 10:27:18 +0100442 struct listener *listener;
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200443
Willy Tarreau01abd022019-02-28 10:27:18 +0100444 while ((listener = LIST_POP_LOCKED(list, struct listener *, wait_queue))) {
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200445 /* This cannot fail because the listeners are by definition in
Willy Tarreau01abd022019-02-28 10:27:18 +0100446 * the LI_LIMITED state.
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200447 */
Willy Tarreau01abd022019-02-28 10:27:18 +0100448 resume_listener(listener);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200449 }
450}
451
Christopher Faulet510c0d62018-03-16 10:04:47 +0100452/* Must be called with the lock held. Depending on <do_close> value, it does
453 * what unbind_listener or unbind_listener_no_close should do.
454 */
455void do_unbind_listener(struct listener *listener, int do_close)
Willy Tarreaub648d632007-10-28 22:13:50 +0100456{
Olivier Houcharda5188562019-03-08 15:35:42 +0100457 if (listener->state == LI_READY && fd_updt)
Willy Tarreau49b046d2012-08-09 12:11:58 +0200458 fd_stop_recv(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100459
Willy Tarreau01abd022019-02-28 10:27:18 +0100460 LIST_DEL_LOCKED(&listener->wait_queue);
Willy Tarreaue6ca1fc2011-07-24 22:03:52 +0200461
Willy Tarreaube58c382011-07-24 18:28:10 +0200462 if (listener->state >= LI_PAUSED) {
Olivier Houchard1fc05162017-04-06 01:05:05 +0200463 if (do_close) {
464 fd_delete(listener->fd);
465 listener->fd = -1;
466 }
467 else
468 fd_remove(listener->fd);
Willy Tarreaub648d632007-10-28 22:13:50 +0100469 listener->state = LI_ASSIGNED;
470 }
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100471}
472
Olivier Houchard1fc05162017-04-06 01:05:05 +0200473/* This function closes the listening socket for the specified listener,
474 * provided that it's already in a listening state. The listener enters the
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100475 * LI_ASSIGNED state. This function is intended to be used as a generic
476 * function for standard protocols.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200477 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100478void unbind_listener(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200479{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100480 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100481 do_unbind_listener(listener, 1);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100482 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200483}
484
485/* This function pretends the listener is dead, but keeps the FD opened, so
486 * that we can provide it, for conf reloading.
487 */
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100488void unbind_listener_no_close(struct listener *listener)
Olivier Houchard1fc05162017-04-06 01:05:05 +0200489{
Christopher Faulet510c0d62018-03-16 10:04:47 +0100490 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreaubbd09b92017-11-05 11:38:44 +0100491 do_unbind_listener(listener, 0);
Christopher Faulet510c0d62018-03-16 10:04:47 +0100492 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Olivier Houchard1fc05162017-04-06 01:05:05 +0200493}
494
Willy Tarreau3acf8c32007-10-28 22:35:41 +0100495/* This function closes all listening sockets bound to the protocol <proto>,
496 * and the listeners end in LI_ASSIGNED state if they were higher. It does not
497 * detach them from the protocol. It always returns ERR_NONE.
498 */
499int unbind_all_listeners(struct protocol *proto)
500{
501 struct listener *listener;
502
503 list_for_each_entry(listener, &proto->listeners, proto_list)
504 unbind_listener(listener);
505 return ERR_NONE;
506}
507
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200508/* creates one or multiple listeners for bind_conf <bc> on sockaddr <ss> on port
509 * range <portl> to <porth>, and possibly attached to fd <fd> (or -1 for auto
510 * allocation). The address family is taken from ss->ss_family. The number of
511 * jobs and listeners is automatically increased by the number of listeners
William Lallemand75ea0a02017-11-15 19:02:58 +0100512 * created. If the <inherited> argument is set to 1, it specifies that the FD
513 * was obtained from a parent process.
514 * It returns non-zero on success, zero on error with the error message
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200515 * set in <err>.
516 */
517int create_listeners(struct bind_conf *bc, const struct sockaddr_storage *ss,
William Lallemand75ea0a02017-11-15 19:02:58 +0100518 int portl, int porth, int fd, int inherited, char **err)
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200519{
520 struct protocol *proto = protocol_by_family(ss->ss_family);
521 struct listener *l;
522 int port;
523
524 if (!proto) {
525 memprintf(err, "unsupported protocol family %d", ss->ss_family);
526 return 0;
527 }
528
529 for (port = portl; port <= porth; port++) {
530 l = calloc(1, sizeof(*l));
531 if (!l) {
532 memprintf(err, "out of memory");
533 return 0;
534 }
535 l->obj_type = OBJ_TYPE_LISTENER;
536 LIST_ADDQ(&bc->frontend->conf.listeners, &l->by_fe);
537 LIST_ADDQ(&bc->listeners, &l->by_bind);
538 l->bind_conf = bc;
539
540 l->fd = fd;
541 memcpy(&l->addr, ss, sizeof(*ss));
Willy Tarreau01abd022019-02-28 10:27:18 +0100542 LIST_INIT(&l->wait_queue);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200543 l->state = LI_INIT;
544
545 proto->add(l, port);
546
William Lallemand75ea0a02017-11-15 19:02:58 +0100547 if (inherited)
548 l->options |= LI_O_INHERITED;
549
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100550 HA_SPIN_INIT(&l->lock);
Olivier Houchard64213e92019-03-08 18:52:57 +0100551 _HA_ATOMIC_ADD(&jobs, 1);
552 _HA_ATOMIC_ADD(&listeners, 1);
Willy Tarreau0de59fd2017-09-15 08:10:44 +0200553 }
554 return 1;
555}
556
Willy Tarreau1a64d162007-10-28 22:26:05 +0100557/* Delete a listener from its protocol's list of listeners. The listener's
558 * state is automatically updated from LI_ASSIGNED to LI_INIT. The protocol's
Willy Tarreau2cc5bae2017-09-15 08:18:11 +0200559 * number of listeners is updated, as well as the global number of listeners
560 * and jobs. Note that the listener must have previously been unbound. This
561 * is the generic function to use to remove a listener.
Willy Tarreau1a64d162007-10-28 22:26:05 +0100562 */
563void delete_listener(struct listener *listener)
564{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100565 HA_SPIN_LOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100566 if (listener->state == LI_ASSIGNED) {
567 listener->state = LI_INIT;
568 LIST_DEL(&listener->proto_list);
569 listener->proto->nb_listeners--;
Olivier Houchard64213e92019-03-08 18:52:57 +0100570 _HA_ATOMIC_SUB(&jobs, 1);
571 _HA_ATOMIC_SUB(&listeners, 1);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100572 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100573 HA_SPIN_UNLOCK(LISTENER_LOCK, &listener->lock);
Willy Tarreau1a64d162007-10-28 22:26:05 +0100574}
575
Willy Tarreaue2711c72019-02-27 15:39:41 +0100576/* Returns a suitable value for a listener's backlog. It uses the listener's,
577 * otherwise the frontend's backlog, otherwise the listener's maxconn,
578 * otherwise the frontend's maxconn, otherwise 1024.
579 */
580int listener_backlog(const struct listener *l)
581{
582 if (l->backlog)
583 return l->backlog;
584
585 if (l->bind_conf->frontend->backlog)
586 return l->bind_conf->frontend->backlog;
587
588 if (l->maxconn)
589 return l->maxconn;
590
591 if (l->bind_conf->frontend->maxconn)
592 return l->bind_conf->frontend->maxconn;
593
594 return 1024;
595}
596
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200597/* This function is called on a read event from a listening socket, corresponding
598 * to an accept. It tries to accept as many connections as possible, and for each
599 * calls the listener's accept handler (generally the frontend's accept handler).
600 */
Willy Tarreauafad0e02012-08-09 14:45:22 +0200601void listener_accept(int fd)
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200602{
603 struct listener *l = fdtab[fd].owner;
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100604 struct proxy *p;
Christopher Faulet102854c2019-04-30 12:17:13 +0200605 unsigned int max_accept;
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100606 int next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100607 int next_feconn = 0;
608 int next_actconn = 0;
Willy Tarreaubb660302014-05-07 19:47:02 +0200609 int expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200610 int cfd;
611 int ret;
Willy Tarreau818dca52014-01-31 19:40:19 +0100612#ifdef USE_ACCEPT4
613 static int accept4_broken;
614#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200615
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100616 if (!l)
617 return;
618 p = l->bind_conf->frontend;
Christopher Faulet102854c2019-04-30 12:17:13 +0200619
620 /* if l->maxaccept is -1, then max_accept is UINT_MAX. It is not really
621 * illimited, but it is probably enough.
622 */
Olivier Houchardd16a9df2019-02-25 16:18:16 +0100623 max_accept = l->maxaccept ? l->maxaccept : 1;
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200624
Willy Tarreau93e7c002013-10-07 18:51:07 +0200625 if (!(l->options & LI_O_UNLIMITED) && global.sps_lim) {
626 int max = freq_ctr_remain(&global.sess_per_sec, global.sps_lim, 0);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200627
628 if (unlikely(!max)) {
629 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200630 expire = tick_add(now_ms, next_event_delay(&global.sess_per_sec, global.sps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200631 goto wait_expire;
Willy Tarreau93e7c002013-10-07 18:51:07 +0200632 }
633
634 if (max_accept > max)
635 max_accept = max;
636 }
637
638 if (!(l->options & LI_O_UNLIMITED) && global.cps_lim) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200639 int max = freq_ctr_remain(&global.conn_per_sec, global.cps_lim, 0);
640
641 if (unlikely(!max)) {
642 /* frontend accept rate limit was reached */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200643 expire = tick_add(now_ms, next_event_delay(&global.conn_per_sec, global.cps_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200644 goto wait_expire;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200645 }
646
647 if (max_accept > max)
648 max_accept = max;
649 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200650#ifdef USE_OPENSSL
651 if (!(l->options & LI_O_UNLIMITED) && global.ssl_lim && l->bind_conf && l->bind_conf->is_ssl) {
652 int max = freq_ctr_remain(&global.ssl_per_sec, global.ssl_lim, 0);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200653
Willy Tarreaue43d5322013-10-07 20:01:52 +0200654 if (unlikely(!max)) {
655 /* frontend accept rate limit was reached */
Willy Tarreaue43d5322013-10-07 20:01:52 +0200656 expire = tick_add(now_ms, next_event_delay(&global.ssl_per_sec, global.ssl_lim, 0));
Willy Tarreaubb660302014-05-07 19:47:02 +0200657 goto wait_expire;
Willy Tarreaue43d5322013-10-07 20:01:52 +0200658 }
659
660 if (max_accept > max)
661 max_accept = max;
662 }
663#endif
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200664 if (p && p->fe_sps_lim) {
665 int max = freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0);
666
667 if (unlikely(!max)) {
668 /* frontend accept rate limit was reached */
669 limit_listener(l, &p->listener_queue);
670 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 +0200671 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200672 }
673
674 if (max_accept > max)
675 max_accept = max;
676 }
677
678 /* Note: if we fail to allocate a connection because of configured
679 * limits, we'll schedule a new attempt worst 1 second later in the
680 * worst case. If we fail due to system limits or temporary resource
681 * shortage, we try again 100ms later in the worst case.
682 */
Christopher Faulet102854c2019-04-30 12:17:13 +0200683 for (; max_accept; next_conn = next_feconn = next_actconn = 0, max_accept--) {
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200684 struct sockaddr_storage addr;
685 socklen_t laddr = sizeof(addr);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200686 unsigned int count;
Willy Tarreau57cb5062019-03-15 17:16:34 +0100687 __decl_hathreads(unsigned long mask);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200688
Willy Tarreau82c97892019-02-27 19:32:32 +0100689 /* pre-increase the number of connections without going too far.
690 * We process the listener, then the proxy, then the process.
691 * We know which ones to unroll based on the next_xxx value.
692 */
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100693 do {
694 count = l->nbconn;
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100695 if (l->maxconn && count >= l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100696 /* the listener was marked full or another
697 * thread is going to do it.
698 */
699 next_conn = 0;
700 goto end;
701 }
702 next_conn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000703 } while (!_HA_ATOMIC_CAS(&l->nbconn, (int *)(&count), next_conn));
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100704
Willy Tarreaua8cf66b2019-02-27 16:49:00 +0100705 if (l->maxconn && next_conn == l->maxconn) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100706 /* we filled it, mark it full */
707 listener_full(l);
708 }
709
Willy Tarreau82c97892019-02-27 19:32:32 +0100710 if (p) {
711 do {
712 count = p->feconn;
713 if (count >= p->maxconn) {
714 /* the frontend was marked full or another
715 * thread is going to do it.
716 */
717 next_feconn = 0;
718 goto end;
719 }
720 next_feconn = count + 1;
Olivier Houchard64213e92019-03-08 18:52:57 +0100721 } while (!_HA_ATOMIC_CAS(&p->feconn, &count, next_feconn));
Willy Tarreau82c97892019-02-27 19:32:32 +0100722
723 if (unlikely(next_feconn == p->maxconn)) {
724 /* we just filled it */
725 limit_listener(l, &p->listener_queue);
726 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200727 }
728
Willy Tarreau82c97892019-02-27 19:32:32 +0100729 if (!(l->options & LI_O_UNLIMITED)) {
730 do {
731 count = actconn;
732 if (count >= global.maxconn) {
733 /* the process was marked full or another
734 * thread is going to do it.
735 */
736 next_actconn = 0;
737 goto end;
738 }
739 next_actconn = count + 1;
David Carlier56716622019-03-27 16:08:42 +0000740 } while (!_HA_ATOMIC_CAS(&actconn, (int *)(&count), next_actconn));
Willy Tarreau82c97892019-02-27 19:32:32 +0100741
742 if (unlikely(next_actconn == global.maxconn)) {
743 limit_listener(l, &global_listener_queue);
744 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
745 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200746 }
747
William Lallemand2fe7dd02018-09-11 16:51:29 +0200748 /* with sockpair@ we don't want to do an accept */
749 if (unlikely(l->addr.ss_family == AF_CUST_SOCKPAIR)) {
750 if ((cfd = recv_fd_uxst(fd)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100751 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau888d5672019-01-27 18:34:12 +0100752 /* just like with UNIX sockets, only the family is filled */
753 addr.ss_family = AF_UNIX;
754 laddr = sizeof(addr.ss_family);
William Lallemand2fe7dd02018-09-11 16:51:29 +0200755 } else
756
Willy Tarreau1bc4aab2012-10-08 20:11:03 +0200757#ifdef USE_ACCEPT4
Willy Tarreau818dca52014-01-31 19:40:19 +0100758 /* only call accept4() if it's known to be safe, otherwise
759 * fallback to the legacy accept() + fcntl().
760 */
761 if (unlikely(accept4_broken ||
William Lallemandd9138002018-11-27 12:02:39 +0100762 ((cfd = accept4(fd, (struct sockaddr *)&addr, &laddr, SOCK_NONBLOCK)) == -1 &&
Willy Tarreau818dca52014-01-31 19:40:19 +0100763 (errno == ENOSYS || errno == EINVAL || errno == EBADF) &&
764 (accept4_broken = 1))))
765#endif
Willy Tarreau6b3b0d42012-10-22 19:32:55 +0200766 if ((cfd = accept(fd, (struct sockaddr *)&addr, &laddr)) != -1)
William Lallemandd9138002018-11-27 12:02:39 +0100767 fcntl(cfd, F_SETFL, O_NONBLOCK);
Willy Tarreau818dca52014-01-31 19:40:19 +0100768
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200769 if (unlikely(cfd == -1)) {
770 switch (errno) {
771 case EAGAIN:
Willy Tarreaubb660302014-05-07 19:47:02 +0200772 if (fdtab[fd].ev & FD_POLL_HUP) {
773 /* the listening socket might have been disabled in a shared
774 * process and we're a collateral victim. We'll just pause for
775 * a while in case it comes back. In the mean time, we need to
776 * clear this sticky flag.
777 */
778 fdtab[fd].ev &= ~FD_POLL_HUP;
779 goto transient_error;
780 }
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100781 fd_cant_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200782 goto end; /* nothing more to accept */
Willy Tarreaubb660302014-05-07 19:47:02 +0200783 case EINVAL:
784 /* might be trying to accept on a shut fd (eg: soft stop) */
785 goto transient_error;
Willy Tarreaua593ec52014-01-20 21:21:30 +0100786 case EINTR:
787 case ECONNABORTED:
Olivier Houchard64213e92019-03-08 18:52:57 +0100788 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100789 if (p)
Olivier Houchard64213e92019-03-08 18:52:57 +0100790 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +0100791 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +0100792 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreaua593ec52014-01-20 21:21:30 +0100793 continue;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200794 case ENFILE:
795 if (p)
796 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100797 "Proxy %s reached system FD limit (maxsock=%d). Please check system tunables.\n",
798 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200799 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200800 case EMFILE:
801 if (p)
802 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100803 "Proxy %s reached process FD limit (maxsock=%d). Please check 'ulimit-n' and restart.\n",
804 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200805 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200806 case ENOBUFS:
807 case ENOMEM:
808 if (p)
809 send_log(p, LOG_EMERG,
Willy Tarreauc5532ac2018-01-29 15:06:04 +0100810 "Proxy %s reached system memory limit (maxsock=%d). Please check system tunables.\n",
811 p->id, global.maxsock);
Willy Tarreaubb660302014-05-07 19:47:02 +0200812 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200813 default:
Willy Tarreaua593ec52014-01-20 21:21:30 +0100814 /* unexpected result, let's give up and let other tasks run */
Willy Tarreau6c11bd22014-01-24 00:54:27 +0100815 goto stop;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200816 }
817 }
818
William Lallemandd9138002018-11-27 12:02:39 +0100819 /* we don't want to leak the FD upon reload if it's in the master */
820 if (unlikely(master == 1))
821 fcntl(cfd, F_SETFD, FD_CLOEXEC);
822
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100823 /* The connection was accepted, it must be counted as such */
824 if (l->counters)
825 HA_ATOMIC_UPDATE_MAX(&l->counters->conn_max, next_conn);
826
Willy Tarreau82c97892019-02-27 19:32:32 +0100827 if (p)
828 HA_ATOMIC_UPDATE_MAX(&p->fe_counters.conn_max, next_feconn);
829
830 proxy_inc_fe_conn_ctr(l, p);
831
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100832 if (!(l->options & LI_O_UNLIMITED)) {
833 count = update_freq_ctr(&global.conn_per_sec, 1);
834 HA_ATOMIC_UPDATE_MAX(&global.cps_max, count);
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100835 }
836
Willy Tarreau64a9c052019-04-12 15:27:17 +0200837 _HA_ATOMIC_ADD(&activity[tid].accepted, 1);
838
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200839 if (unlikely(cfd >= global.maxsock)) {
840 send_log(p, LOG_EMERG,
841 "Proxy %s reached the configured maximum connection limit. Please check the global 'maxconn' value.\n",
842 p->id);
843 close(cfd);
844 limit_listener(l, &global_listener_queue);
845 task_schedule(global_listener_queue_task, tick_add(now_ms, 1000)); /* try again in 1 second */
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200846 goto end;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200847 }
848
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100849 /* past this point, l->accept() will automatically decrement
Willy Tarreau82c97892019-02-27 19:32:32 +0100850 * l->nbconn, feconn and actconn once done. Setting next_*conn=0
851 * allows the error path not to rollback on nbconn. It's more
852 * convenient than duplicating all exit labels.
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100853 */
854 next_conn = 0;
Willy Tarreau82c97892019-02-27 19:32:32 +0100855 next_feconn = 0;
856 next_actconn = 0;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200857
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100858#if defined(USE_THREAD)
Willy Tarreau897e2c52019-03-13 15:03:53 +0100859 mask = thread_mask(l->bind_conf->bind_thread) & all_threads_mask;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100860 if (atleast2(mask) && (global.tune.options & GTUNE_LISTENER_MQ)) {
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100861 struct accept_queue_ring *ring;
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100862 unsigned int t, t0, t1, t2;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100863
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100864 /* The principle is that we have two running indexes,
865 * each visiting in turn all threads bound to this
866 * listener. The connection will be assigned to the one
867 * with the least connections, and the other one will
868 * be updated. This provides a good fairness on short
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100869 * connections (round robin) and on long ones (conn
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100870 * count), without ever missing any idle thread.
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100871 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100872
873 /* keep a copy for the final update. thr_idx is composite
874 * and made of (t2<<16) + t1.
875 */
Willy Tarreau0cf33172019-03-06 15:26:33 +0100876 t0 = l->thr_idx;
Willy Tarreaufc630bd2019-03-04 19:57:34 +0100877 do {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100878 unsigned long m1, m2;
879 int q1, q2;
880
881 t2 = t1 = t0;
882 t2 >>= 16;
883 t1 &= 0xFFFF;
884
885 /* t1 walks low to high bits ;
886 * t2 walks high to low.
887 */
888 m1 = mask >> t1;
889 m2 = mask & (t2 ? nbits(t2 + 1) : ~0UL);
890
Willy Tarreau85d04242019-04-16 18:09:13 +0200891 if (unlikely(!(m1 & 1))) {
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100892 m1 &= ~1UL;
893 if (!m1) {
894 m1 = mask;
895 t1 = 0;
896 }
897 t1 += my_ffsl(m1) - 1;
898 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100899
Willy Tarreau85d04242019-04-16 18:09:13 +0200900 if (unlikely(!(m2 & (1UL << t2)) || t1 == t2)) {
901 /* highest bit not set */
902 if (!m2)
903 m2 = mask;
904
905 t2 = my_flsl(m2) - 1;
906 }
907
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100908 /* now we have two distinct thread IDs belonging to the mask */
909 q1 = accept_queue_rings[t1].tail - accept_queue_rings[t1].head + ACCEPT_QUEUE_SIZE;
910 if (q1 >= ACCEPT_QUEUE_SIZE)
911 q1 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100912
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100913 q2 = accept_queue_rings[t2].tail - accept_queue_rings[t2].head + ACCEPT_QUEUE_SIZE;
914 if (q2 >= ACCEPT_QUEUE_SIZE)
915 q2 -= ACCEPT_QUEUE_SIZE;
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100916
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100917 /* we have 3 possibilities now :
918 * q1 < q2 : t1 is less loaded than t2, so we pick it
919 * and update t2 (since t1 might still be
920 * lower than another thread)
921 * q1 > q2 : t2 is less loaded than t1, so we pick it
922 * and update t1 (since t2 might still be
923 * lower than another thread)
924 * q1 = q2 : both are equally loaded, thus we pick t1
925 * and update t1 as it will become more loaded
926 * than t2.
927 */
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100928
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100929 q1 += l->thr_conn[t1];
930 q2 += l->thr_conn[t2];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100931
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100932 if (q1 - q2 < 0) {
933 t = t1;
934 t2 = t2 ? t2 - 1 : LONGBITS - 1;
935 }
936 else if (q1 - q2 > 0) {
937 t = t2;
938 t1++;
939 if (t1 >= LONGBITS)
940 t1 = 0;
941 }
942 else {
943 t = t1;
944 t1++;
945 if (t1 >= LONGBITS)
946 t1 = 0;
947 }
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100948
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100949 /* new value for thr_idx */
950 t1 += (t2 << 16);
Olivier Houchard64213e92019-03-08 18:52:57 +0100951 } while (unlikely(!_HA_ATOMIC_CAS(&l->thr_idx, &t0, t1)));
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100952
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100953 /* We successfully selected the best thread "t" for this
954 * connection. We use deferred accepts even if it's the
955 * local thread because tests show that it's the best
956 * performing model, likely due to better cache locality
957 * when processing this loop.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100958 */
Willy Tarreau0fe703b2019-03-05 08:46:28 +0100959 ring = &accept_queue_rings[t];
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100960 if (accept_queue_push_mp(ring, cfd, l, &addr, laddr)) {
Olivier Houchard64213e92019-03-08 18:52:57 +0100961 _HA_ATOMIC_ADD(&activity[t].accq_pushed, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100962 task_wakeup(ring->task, TASK_WOKEN_IO);
963 continue;
964 }
965 /* If the ring is full we do a synchronous accept on
966 * the local thread here.
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100967 */
Olivier Houchard64213e92019-03-08 18:52:57 +0100968 _HA_ATOMIC_ADD(&activity[t].accq_full, 1);
Willy Tarreaue0e9c482019-01-27 15:37:19 +0100969 }
970#endif // USE_THREAD
971
Olivier Houchard64213e92019-03-08 18:52:57 +0100972 _HA_ATOMIC_ADD(&l->thr_conn[tid], 1);
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200973 ret = l->accept(l, cfd, &addr);
974 if (unlikely(ret <= 0)) {
Willy Tarreau87b09662015-04-03 00:22:06 +0200975 /* The connection was closed by stream_accept(). Either
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200976 * we just have to ignore it (ret == 0) or it's a critical
977 * error due to a resource shortage, and we must stop the
978 * listener (ret < 0).
979 */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200980 if (ret == 0) /* successful termination */
981 continue;
982
Willy Tarreaubb660302014-05-07 19:47:02 +0200983 goto transient_error;
Willy Tarreaubbebbbf2012-05-07 21:22:09 +0200984 }
985
Willy Tarreau3f0d02b2019-02-25 19:23:37 +0100986 /* increase the per-process number of cumulated sessions, this
987 * may only be done once l->accept() has accepted the connection.
988 */
Willy Tarreau93e7c002013-10-07 18:51:07 +0200989 if (!(l->options & LI_O_UNLIMITED)) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200990 count = update_freq_ctr(&global.sess_per_sec, 1);
991 HA_ATOMIC_UPDATE_MAX(&global.sps_max, count);
Willy Tarreau93e7c002013-10-07 18:51:07 +0200992 }
Willy Tarreaue43d5322013-10-07 20:01:52 +0200993#ifdef USE_OPENSSL
994 if (!(l->options & LI_O_UNLIMITED) && l->bind_conf && l->bind_conf->is_ssl) {
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +0200995 count = update_freq_ctr(&global.ssl_per_sec, 1);
996 HA_ATOMIC_UPDATE_MAX(&global.ssl_max, count);
Willy Tarreaue43d5322013-10-07 20:01:52 +0200997 }
998#endif
Willy Tarreau93e7c002013-10-07 18:51:07 +0200999
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001000 } /* end of for (max_accept--) */
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001001
Willy Tarreauaece46a2012-07-06 12:25:58 +02001002 /* we've exhausted max_accept, so there is no need to poll again */
Willy Tarreau6c11bd22014-01-24 00:54:27 +01001003 stop:
1004 fd_done_recv(fd);
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001005 goto end;
Willy Tarreaubb660302014-05-07 19:47:02 +02001006
1007 transient_error:
1008 /* pause the listener and try again in 100 ms */
1009 expire = tick_add(now_ms, 100);
1010
1011 wait_expire:
1012 limit_listener(l, &global_listener_queue);
1013 task_schedule(global_listener_queue_task, tick_first(expire, global_listener_queue_task->expire));
Christopher Faulet8d8aa0d2017-05-30 15:36:50 +02001014 end:
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001015 if (next_conn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001016 _HA_ATOMIC_SUB(&l->nbconn, 1);
Willy Tarreau741b4d62019-02-25 15:02:04 +01001017
Willy Tarreau82c97892019-02-27 19:32:32 +01001018 if (p && next_feconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001019 _HA_ATOMIC_SUB(&p->feconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001020
1021 if (next_actconn)
Olivier Houchard64213e92019-03-08 18:52:57 +01001022 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001023
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001024 if ((l->state == LI_FULL && (!l->maxconn || l->nbconn < l->maxconn)) ||
Willy Tarreau82c97892019-02-27 19:32:32 +01001025 (l->state == LI_LIMITED && ((!p || p->feconn < p->maxconn) && (actconn < global.maxconn)))) {
Willy Tarreau3f0d02b2019-02-25 19:23:37 +01001026 /* at least one thread has to this when quitting */
1027 resume_listener(l);
1028
1029 /* Dequeues all of the listeners waiting for a resource */
1030 if (!LIST_ISEMPTY(&global_listener_queue))
1031 dequeue_all_listeners(&global_listener_queue);
1032
1033 if (!LIST_ISEMPTY(&p->listener_queue) &&
1034 (!p->fe_sps_lim || freq_ctr_remain(&p->fe_sess_per_sec, p->fe_sps_lim, 0) > 0))
1035 dequeue_all_listeners(&p->listener_queue);
1036 }
Willy Tarreaubbebbbf2012-05-07 21:22:09 +02001037}
1038
Willy Tarreau05f50472017-09-15 09:19:58 +02001039/* Notify the listener that a connection initiated from it was released. This
1040 * is used to keep the connection count consistent and to possibly re-open
1041 * listening when it was limited.
1042 */
1043void listener_release(struct listener *l)
1044{
1045 struct proxy *fe = l->bind_conf->frontend;
1046
1047 if (!(l->options & LI_O_UNLIMITED))
Olivier Houchard64213e92019-03-08 18:52:57 +01001048 _HA_ATOMIC_SUB(&actconn, 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001049 if (fe)
Olivier Houchard64213e92019-03-08 18:52:57 +01001050 _HA_ATOMIC_SUB(&fe->feconn, 1);
1051 _HA_ATOMIC_SUB(&l->nbconn, 1);
1052 _HA_ATOMIC_SUB(&l->thr_conn[tid], 1);
Willy Tarreau82c97892019-02-27 19:32:32 +01001053
1054 if (l->state == LI_FULL || l->state == LI_LIMITED)
Willy Tarreau05f50472017-09-15 09:19:58 +02001055 resume_listener(l);
1056
1057 /* Dequeues all of the listeners waiting for a resource */
1058 if (!LIST_ISEMPTY(&global_listener_queue))
1059 dequeue_all_listeners(&global_listener_queue);
1060
1061 if (!LIST_ISEMPTY(&fe->listener_queue) &&
1062 (!fe->fe_sps_lim || freq_ctr_remain(&fe->fe_sess_per_sec, fe->fe_sps_lim, 0) > 0))
1063 dequeue_all_listeners(&fe->listener_queue);
1064}
1065
Willy Tarreau26982662012-09-12 23:17:10 +02001066/*
1067 * Registers the bind keyword list <kwl> as a list of valid keywords for next
1068 * parsing sessions.
1069 */
1070void bind_register_keywords(struct bind_kw_list *kwl)
1071{
1072 LIST_ADDQ(&bind_keywords.list, &kwl->list);
1073}
1074
1075/* Return a pointer to the bind keyword <kw>, or NULL if not found. If the
1076 * keyword is found with a NULL ->parse() function, then an attempt is made to
1077 * find one with a valid ->parse() function. This way it is possible to declare
1078 * platform-dependant, known keywords as NULL, then only declare them as valid
1079 * if some options are met. Note that if the requested keyword contains an
1080 * opening parenthesis, everything from this point is ignored.
1081 */
1082struct bind_kw *bind_find_kw(const char *kw)
1083{
1084 int index;
1085 const char *kwend;
1086 struct bind_kw_list *kwl;
1087 struct bind_kw *ret = NULL;
1088
1089 kwend = strchr(kw, '(');
1090 if (!kwend)
1091 kwend = kw + strlen(kw);
1092
1093 list_for_each_entry(kwl, &bind_keywords.list, list) {
1094 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1095 if ((strncmp(kwl->kw[index].kw, kw, kwend - kw) == 0) &&
1096 kwl->kw[index].kw[kwend-kw] == 0) {
1097 if (kwl->kw[index].parse)
1098 return &kwl->kw[index]; /* found it !*/
1099 else
1100 ret = &kwl->kw[index]; /* may be OK */
1101 }
1102 }
1103 }
1104 return ret;
1105}
1106
Willy Tarreau8638f482012-09-18 18:01:17 +02001107/* Dumps all registered "bind" keywords to the <out> string pointer. The
1108 * unsupported keywords are only dumped if their supported form was not
1109 * found.
1110 */
1111void bind_dump_kws(char **out)
1112{
1113 struct bind_kw_list *kwl;
1114 int index;
1115
1116 *out = NULL;
1117 list_for_each_entry(kwl, &bind_keywords.list, list) {
1118 for (index = 0; kwl->kw[index].kw != NULL; index++) {
1119 if (kwl->kw[index].parse ||
1120 bind_find_kw(kwl->kw[index].kw) == &kwl->kw[index]) {
Willy Tarreau51fb7652012-09-18 18:24:39 +02001121 memprintf(out, "%s[%4s] %s%s%s\n", *out ? *out : "",
1122 kwl->scope,
Willy Tarreau8638f482012-09-18 18:01:17 +02001123 kwl->kw[index].kw,
Willy Tarreau51fb7652012-09-18 18:24:39 +02001124 kwl->kw[index].skip ? " <arg>" : "",
1125 kwl->kw[index].parse ? "" : " (not supported)");
Willy Tarreau8638f482012-09-18 18:01:17 +02001126 }
1127 }
1128 }
1129}
1130
Willy Tarreau645513a2010-05-24 20:55:15 +02001131/************************************************************************/
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001132/* All supported sample and ACL keywords must be declared here. */
Willy Tarreau645513a2010-05-24 20:55:15 +02001133/************************************************************************/
1134
Willy Tarreaua5e37562011-12-16 17:06:15 +01001135/* set temp integer to the number of connexions to the same listening socket */
Willy Tarreau645513a2010-05-24 20:55:15 +02001136static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001137smp_fetch_dconn(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau645513a2010-05-24 20:55:15 +02001138{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001139 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001140 smp->data.u.sint = smp->sess->listener->nbconn;
Willy Tarreau645513a2010-05-24 20:55:15 +02001141 return 1;
1142}
1143
Willy Tarreaua5e37562011-12-16 17:06:15 +01001144/* set temp integer to the id of the socket (listener) */
Willy Tarreau645513a2010-05-24 20:55:15 +02001145static int
Thierry FOURNIER0786d052015-05-11 15:42:45 +02001146smp_fetch_so_id(const struct arg *args, struct sample *smp, const char *kw, void *private)
Willy Tarreau37406352012-04-23 16:16:37 +02001147{
Thierry FOURNIER8c542ca2015-08-19 09:00:18 +02001148 smp->data.type = SMP_T_SINT;
Thierry FOURNIER136f9d32015-08-19 09:07:19 +02001149 smp->data.u.sint = smp->sess->listener->luid;
Willy Tarreau645513a2010-05-24 20:55:15 +02001150 return 1;
1151}
1152
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001153/* parse the "accept-proxy" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001154static 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 +02001155{
1156 struct listener *l;
1157
Willy Tarreau4348fad2012-09-20 16:48:07 +02001158 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001159 l->options |= LI_O_ACC_PROXY;
1160
1161 return 0;
1162}
1163
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001164/* parse the "accept-netscaler-cip" bind keyword */
1165static int bind_parse_accept_netscaler_cip(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1166{
1167 struct listener *l;
1168 uint32_t val;
1169
1170 if (!*args[cur_arg + 1]) {
1171 memprintf(err, "'%s' : missing value", args[cur_arg]);
1172 return ERR_ALERT | ERR_FATAL;
1173 }
1174
1175 val = atol(args[cur_arg + 1]);
1176 if (val <= 0) {
Willy Tarreaue2711c72019-02-27 15:39:41 +01001177 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001178 return ERR_ALERT | ERR_FATAL;
1179 }
1180
1181 list_for_each_entry(l, &conf->listeners, by_bind) {
1182 l->options |= LI_O_ACC_CIP;
1183 conf->ns_cip_magic = val;
1184 }
1185
1186 return 0;
1187}
1188
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001189/* parse the "backlog" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001190static 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 +02001191{
1192 struct listener *l;
1193 int val;
1194
1195 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001196 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001197 return ERR_ALERT | ERR_FATAL;
1198 }
1199
1200 val = atol(args[cur_arg + 1]);
Willy Tarreaue2711c72019-02-27 15:39:41 +01001201 if (val < 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001202 memprintf(err, "'%s' : invalid value %d, must be > 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001203 return ERR_ALERT | ERR_FATAL;
1204 }
1205
Willy Tarreau4348fad2012-09-20 16:48:07 +02001206 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001207 l->backlog = val;
1208
1209 return 0;
1210}
1211
1212/* parse the "id" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001213static 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 +02001214{
1215 struct eb32_node *node;
Willy Tarreau4348fad2012-09-20 16:48:07 +02001216 struct listener *l, *new;
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001217 char *error;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001218
Willy Tarreau4348fad2012-09-20 16:48:07 +02001219 if (conf->listeners.n != conf->listeners.p) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001220 memprintf(err, "'%s' can only be used with a single socket", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001221 return ERR_ALERT | ERR_FATAL;
1222 }
1223
1224 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001225 memprintf(err, "'%s' : expects an integer argument", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001226 return ERR_ALERT | ERR_FATAL;
1227 }
1228
Willy Tarreau4348fad2012-09-20 16:48:07 +02001229 new = LIST_NEXT(&conf->listeners, struct listener *, by_bind);
Thierry Fourniere7fe8eb2016-02-26 08:45:58 +01001230 new->luid = strtol(args[cur_arg + 1], &error, 10);
1231 if (*error != '\0') {
1232 memprintf(err, "'%s' : expects an integer argument, found '%s'", args[cur_arg], args[cur_arg + 1]);
1233 return ERR_ALERT | ERR_FATAL;
1234 }
Willy Tarreau4348fad2012-09-20 16:48:07 +02001235 new->conf.id.key = new->luid;
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001236
Willy Tarreau4348fad2012-09-20 16:48:07 +02001237 if (new->luid <= 0) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001238 memprintf(err, "'%s' : custom id has to be > 0", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001239 return ERR_ALERT | ERR_FATAL;
1240 }
1241
Willy Tarreau4348fad2012-09-20 16:48:07 +02001242 node = eb32_lookup(&px->conf.used_listener_id, new->luid);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001243 if (node) {
1244 l = container_of(node, struct listener, conf.id);
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001245 memprintf(err, "'%s' : custom id %d already used at %s:%d ('bind %s')",
1246 args[cur_arg], l->luid, l->bind_conf->file, l->bind_conf->line,
1247 l->bind_conf->arg);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001248 return ERR_ALERT | ERR_FATAL;
1249 }
1250
Willy Tarreau4348fad2012-09-20 16:48:07 +02001251 eb32_insert(&px->conf.used_listener_id, &new->conf.id);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001252 return 0;
1253}
1254
1255/* parse the "maxconn" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001256static 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 +02001257{
1258 struct listener *l;
1259 int val;
1260
1261 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001262 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001263 return ERR_ALERT | ERR_FATAL;
1264 }
1265
1266 val = atol(args[cur_arg + 1]);
Willy Tarreaua8cf66b2019-02-27 16:49:00 +01001267 if (val < 0) {
1268 memprintf(err, "'%s' : invalid value %d, must be >= 0", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001269 return ERR_ALERT | ERR_FATAL;
1270 }
1271
Willy Tarreau4348fad2012-09-20 16:48:07 +02001272 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001273 l->maxconn = val;
1274
1275 return 0;
1276}
1277
1278/* parse the "name" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001279static 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 +02001280{
1281 struct listener *l;
1282
1283 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001284 memprintf(err, "'%s' : missing name", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001285 return ERR_ALERT | ERR_FATAL;
1286 }
1287
Willy Tarreau4348fad2012-09-20 16:48:07 +02001288 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001289 l->name = strdup(args[cur_arg + 1]);
1290
1291 return 0;
1292}
1293
1294/* parse the "nice" bind keyword */
Willy Tarreau4348fad2012-09-20 16:48:07 +02001295static 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 +02001296{
1297 struct listener *l;
1298 int val;
1299
1300 if (!*args[cur_arg + 1]) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001301 memprintf(err, "'%s' : missing value", args[cur_arg]);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001302 return ERR_ALERT | ERR_FATAL;
1303 }
1304
1305 val = atol(args[cur_arg + 1]);
1306 if (val < -1024 || val > 1024) {
Willy Tarreaueb6cead2012-09-20 19:43:14 +02001307 memprintf(err, "'%s' : invalid value %d, allowed range is -1024..1024", args[cur_arg], val);
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001308 return ERR_ALERT | ERR_FATAL;
1309 }
1310
Willy Tarreau4348fad2012-09-20 16:48:07 +02001311 list_for_each_entry(l, &conf->listeners, by_bind)
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001312 l->nice = val;
1313
1314 return 0;
1315}
1316
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001317/* parse the "process" bind keyword */
1318static int bind_parse_process(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1319{
Christopher Fauletc644fa92017-11-23 22:44:11 +01001320 char *slash;
1321 unsigned long proc = 0, thread = 0;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001322
Christopher Fauletc644fa92017-11-23 22:44:11 +01001323 if ((slash = strchr(args[cur_arg + 1], '/')) != NULL)
1324 *slash = 0;
1325
Willy Tarreauff9c9142019-02-07 10:39:36 +01001326 if (parse_process_number(args[cur_arg + 1], &proc, MAX_PROCS, NULL, err)) {
Christopher Fauletf1f0c5f2017-11-22 12:06:43 +01001327 memprintf(err, "'%s' : %s", args[cur_arg], *err);
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001328 return ERR_ALERT | ERR_FATAL;
1329 }
1330
Christopher Fauletc644fa92017-11-23 22:44:11 +01001331 if (slash) {
Willy Tarreauc9a82e42019-01-26 13:25:14 +01001332 if (parse_process_number(slash+1, &thread, MAX_THREADS, NULL, err)) {
Christopher Fauletc644fa92017-11-23 22:44:11 +01001333 memprintf(err, "'%s' : %s", args[cur_arg], *err);
1334 return ERR_ALERT | ERR_FATAL;
1335 }
1336 *slash = '/';
1337 }
1338
1339 conf->bind_proc |= proc;
Willy Tarreaua36b3242019-02-02 13:14:34 +01001340 conf->bind_thread |= thread;
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001341 return 0;
1342}
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001343
Christopher Fauleta717b992018-04-10 14:43:00 +02001344/* parse the "proto" bind keyword */
1345static int bind_parse_proto(char **args, int cur_arg, struct proxy *px, struct bind_conf *conf, char **err)
1346{
1347 struct ist proto;
1348
1349 if (!*args[cur_arg + 1]) {
1350 memprintf(err, "'%s' : missing value", args[cur_arg]);
1351 return ERR_ALERT | ERR_FATAL;
1352 }
1353
1354 proto = ist2(args[cur_arg + 1], strlen(args[cur_arg + 1]));
1355 conf->mux_proto = get_mux_proto(proto);
1356 if (!conf->mux_proto) {
1357 memprintf(err, "'%s' : unknown MUX protocol '%s'", args[cur_arg], args[cur_arg+1]);
1358 return ERR_ALERT | ERR_FATAL;
1359 }
Christopher Fauleta717b992018-04-10 14:43:00 +02001360 return 0;
1361}
1362
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001363/* config parser for global "tune.listener.multi-queue", accepts "on" or "off" */
1364static int cfg_parse_tune_listener_mq(char **args, int section_type, struct proxy *curpx,
1365 struct proxy *defpx, const char *file, int line,
1366 char **err)
1367{
1368 if (too_many_args(1, args, err, NULL))
1369 return -1;
1370
1371 if (strcmp(args[1], "on") == 0)
1372 global.tune.options |= GTUNE_LISTENER_MQ;
1373 else if (strcmp(args[1], "off") == 0)
1374 global.tune.options &= ~GTUNE_LISTENER_MQ;
1375 else {
1376 memprintf(err, "'%s' expects either 'on' or 'off' but got '%s'.", args[0], args[1]);
1377 return -1;
1378 }
1379 return 0;
1380}
1381
Willy Tarreau61612d42012-04-19 18:42:05 +02001382/* Note: must not be declared <const> as its list will be overwritten.
1383 * Please take care of keeping this list alphabetically sorted.
1384 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001385static struct sample_fetch_kw_list smp_kws = {ILH, {
Thierry FOURNIER07ee64e2015-07-06 23:43:03 +02001386 { "dst_conn", smp_fetch_dconn, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
1387 { "so_id", smp_fetch_so_id, 0, NULL, SMP_T_SINT, SMP_USE_FTEND, },
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001388 { /* END */ },
1389}};
1390
Willy Tarreau0108d902018-11-25 19:14:37 +01001391INITCALL1(STG_REGISTER, sample_register_fetches, &smp_kws);
1392
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001393/* Note: must not be declared <const> as its list will be overwritten.
1394 * Please take care of keeping this list alphabetically sorted.
1395 */
Willy Tarreaudc13c112013-06-21 23:16:39 +02001396static struct acl_kw_list acl_kws = {ILH, {
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001397 { /* END */ },
Willy Tarreau645513a2010-05-24 20:55:15 +02001398}};
1399
Willy Tarreau0108d902018-11-25 19:14:37 +01001400INITCALL1(STG_REGISTER, acl_register_keywords, &acl_kws);
1401
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001402/* Note: must not be declared <const> as its list will be overwritten.
1403 * Please take care of keeping this list alphabetically sorted, doing so helps
1404 * all code contributors.
1405 * Optional keywords are also declared with a NULL ->parse() function so that
1406 * the config parser can report an appropriate error when a known keyword was
1407 * not enabled.
1408 */
Willy Tarreau51fb7652012-09-18 18:24:39 +02001409static struct bind_kw_list bind_kws = { "ALL", { }, {
Bertrand Jacquin93b227d2016-06-04 15:11:10 +01001410 { "accept-netscaler-cip", bind_parse_accept_netscaler_cip, 1 }, /* enable NetScaler Client IP insertion protocol */
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001411 { "accept-proxy", bind_parse_accept_proxy, 0 }, /* enable PROXY protocol */
1412 { "backlog", bind_parse_backlog, 1 }, /* set backlog of listening socket */
1413 { "id", bind_parse_id, 1 }, /* set id of listening socket */
1414 { "maxconn", bind_parse_maxconn, 1 }, /* set maxconn of listening socket */
1415 { "name", bind_parse_name, 1 }, /* set name of listening socket */
1416 { "nice", bind_parse_nice, 1 }, /* set nice of listening socket */
Willy Tarreau6ae1ba62014-05-07 19:01:58 +02001417 { "process", bind_parse_process, 1 }, /* set list of allowed process for this socket */
Christopher Fauleta717b992018-04-10 14:43:00 +02001418 { "proto", bind_parse_proto, 1 }, /* set the proto to use for all incoming connections */
Willy Tarreau0ccb7442013-01-07 22:54:17 +01001419 { /* END */ },
Willy Tarreau3dcc3412012-09-18 17:17:28 +02001420}};
1421
Willy Tarreau0108d902018-11-25 19:14:37 +01001422INITCALL1(STG_REGISTER, bind_register_keywords, &bind_kws);
1423
Willy Tarreau7ac908b2019-02-27 12:02:18 +01001424/* config keyword parsers */
1425static struct cfg_kw_list cfg_kws = {ILH, {
1426 { CFG_GLOBAL, "tune.listener.multi-queue", cfg_parse_tune_listener_mq },
1427 { 0, NULL, NULL }
1428}};
1429
1430INITCALL1(STG_REGISTER, cfg_register_keywords, &cfg_kws);
1431
Willy Tarreau645513a2010-05-24 20:55:15 +02001432/*
1433 * Local variables:
1434 * c-indent-level: 8
1435 * c-basic-offset: 8
1436 * End:
1437 */