blob: 3b023a8b05bd4ef14f03f2bfcfbf815120982969 [file] [log] [blame]
Willy Tarreaubaaee002006-06-26 02:48:02 +02001/*
2 * File descriptors management functions.
3 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +01004 * Copyright 2000-2014 Willy Tarreau <w@1wt.eu>
Willy Tarreaubaaee002006-06-26 02:48:02 +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 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010011 * This code implements an events cache for file descriptors. It remembers the
12 * readiness of a file descriptor after a return from poll() and the fact that
13 * an I/O attempt failed on EAGAIN. Events in the cache which are still marked
14 * ready and active are processed just as if they were reported by poll().
Willy Tarreau7be79a42012-11-11 15:02:54 +010015 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010016 * This serves multiple purposes. First, it significantly improves performance
17 * by avoiding to subscribe to polling unless absolutely necessary, so most
18 * events are processed without polling at all, especially send() which
19 * benefits from the socket buffers. Second, it is the only way to support
20 * edge-triggered pollers (eg: EPOLL_ET). And third, it enables I/O operations
21 * that are backed by invisible buffers. For example, SSL is able to read a
22 * whole socket buffer and not deliver it to the application buffer because
23 * it's full. Unfortunately, it won't be reported by a poller anymore until
24 * some new activity happens. The only way to call it again thus is to keep
25 * this readiness information in the cache and to access it without polling
26 * once the FD is enabled again.
Willy Tarreau7be79a42012-11-11 15:02:54 +010027 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010028 * One interesting feature of the cache is that it maintains the principle
29 * of speculative I/O introduced in haproxy 1.3 : the first time an event is
30 * enabled, the FD is considered as ready so that the I/O attempt is performed
31 * via the cache without polling. And the polling happens only when EAGAIN is
32 * first met. This avoids polling for HTTP requests, especially when the
33 * defer-accept mode is used. It also avoids polling for sending short data
34 * such as requests to servers or short responses to clients.
35 *
36 * The cache consists in a list of active events and a list of updates.
37 * Active events are events that are expected to come and that we must report
38 * to the application until it asks to stop or asks to poll. Updates are new
39 * requests for changing an FD state. Updates are the only way to create new
40 * events. This is important because it means that the number of cached events
41 * cannot increase between updates and will only grow one at a time while
42 * processing updates. All updates must always be processed, though events
43 * might be processed by small batches if required.
Willy Tarreau7be79a42012-11-11 15:02:54 +010044 *
45 * There is no direct link between the FD and the updates list. There is only a
46 * bit in the fdtab[] to indicate than a file descriptor is already present in
47 * the updates list. Once an fd is present in the updates list, it will have to
48 * be considered even if its changes are reverted in the middle or if the fd is
49 * replaced.
50 *
51 * It is important to understand that as long as all expected events are
52 * processed, they might starve the polled events, especially because polled
Willy Tarreauf817e9f2014-01-10 16:58:45 +010053 * I/O starvation quickly induces more cached I/O. One solution to this
Willy Tarreau7be79a42012-11-11 15:02:54 +010054 * consists in only processing a part of the events at once, but one drawback
Willy Tarreauf817e9f2014-01-10 16:58:45 +010055 * is that unhandled events will still wake the poller up. Using an edge-
56 * triggered poller such as EPOLL_ET will solve this issue though.
Willy Tarreau7be79a42012-11-11 15:02:54 +010057 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010058 * Since we do not want to scan all the FD list to find cached I/O events,
59 * we store them in a list consisting in a linear array holding only the FD
60 * indexes right now. Note that a closed FD cannot exist in the cache, because
61 * it is closed by fd_delete() which in turn calls fd_release_cache_entry()
62 * which always removes it from the list.
Willy Tarreau7be79a42012-11-11 15:02:54 +010063 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010064 * The FD array has to hold a back reference to the cache. This reference is
65 * always valid unless the FD is not in the cache and is not updated, in which
66 * case the reference points to index 0.
Willy Tarreau7be79a42012-11-11 15:02:54 +010067 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010068 * The event state for an FD, as found in fdtab[].state, is maintained for each
69 * direction. The state field is built this way, with R bits in the low nibble
70 * and W bits in the high nibble for ease of access and debugging :
Willy Tarreau7be79a42012-11-11 15:02:54 +010071 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010072 * 7 6 5 4 3 2 1 0
73 * [ 0 | PW | RW | AW | 0 | PR | RR | AR ]
74 *
75 * A* = active *R = read
76 * P* = polled *W = write
77 * R* = ready
78 *
79 * An FD is marked "active" when there is a desire to use it.
80 * An FD is marked "polled" when it is registered in the polling.
81 * An FD is marked "ready" when it has not faced a new EAGAIN since last wake-up
82 * (it is a cache of the last EAGAIN regardless of polling changes).
Willy Tarreau7be79a42012-11-11 15:02:54 +010083 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010084 * We have 8 possible states for each direction based on these 3 flags :
Willy Tarreau7be79a42012-11-11 15:02:54 +010085 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010086 * +---+---+---+----------+---------------------------------------------+
87 * | P | R | A | State | Description |
88 * +---+---+---+----------+---------------------------------------------+
89 * | 0 | 0 | 0 | DISABLED | No activity desired, not ready. |
90 * | 0 | 0 | 1 | MUSTPOLL | Activity desired via polling. |
91 * | 0 | 1 | 0 | STOPPED | End of activity without polling. |
92 * | 0 | 1 | 1 | ACTIVE | Activity desired without polling. |
93 * | 1 | 0 | 0 | ABORT | Aborted poll(). Not frequently seen. |
94 * | 1 | 0 | 1 | POLLED | FD is being polled. |
95 * | 1 | 1 | 0 | PAUSED | FD was paused while ready (eg: buffer full) |
96 * | 1 | 1 | 1 | READY | FD was marked ready by poll() |
97 * +---+---+---+----------+---------------------------------------------+
Willy Tarreau7be79a42012-11-11 15:02:54 +010098 *
Willy Tarreauf817e9f2014-01-10 16:58:45 +010099 * The transitions are pretty simple :
100 * - fd_want_*() : set flag A
101 * - fd_stop_*() : clear flag A
102 * - fd_cant_*() : clear flag R (when facing EAGAIN)
103 * - fd_may_*() : set flag R (upon return from poll())
104 * - sync() : if (A) { if (!R) P := 1 } else { P := 0 }
105 *
106 * The PAUSED, ABORT and MUSTPOLL states are transient for level-trigerred
107 * pollers and are fixed by the sync() which happens at the beginning of the
108 * poller. For event-triggered pollers, only the MUSTPOLL state will be
109 * transient and ABORT will lead to PAUSED. The ACTIVE state is the only stable
110 * one which has P != A.
111 *
112 * The READY state is a bit special as activity on the FD might be notified
113 * both by the poller or by the cache. But it is needed for some multi-layer
114 * protocols (eg: SSL) where connection activity is not 100% linked to FD
115 * activity. Also some pollers might prefer to implement it as ACTIVE if
116 * enabling/disabling the FD is cheap. The READY and ACTIVE states are the
117 * two states for which a cache entry is allocated.
118 *
119 * The state transitions look like the diagram below. Only the 4 right states
120 * have polling enabled :
121 *
122 * (POLLED=0) (POLLED=1)
123 *
124 * +----------+ sync +-------+
125 * | DISABLED | <----- | ABORT | (READY=0, ACTIVE=0)
126 * +----------+ +-------+
127 * clr | ^ set | ^
128 * | | | |
129 * v | set v | clr
130 * +----------+ sync +--------+
131 * | MUSTPOLL | -----> | POLLED | (READY=0, ACTIVE=1)
132 * +----------+ +--------+
133 * ^ poll | ^
134 * | | |
135 * | EAGAIN v | EAGAIN
136 * +--------+ +-------+
137 * | ACTIVE | | READY | (READY=1, ACTIVE=1)
138 * +--------+ +-------+
139 * clr | ^ set | ^
140 * | | | |
141 * v | set v | clr
142 * +---------+ sync +--------+
143 * | STOPPED | <------ | PAUSED | (READY=1, ACTIVE=0)
144 * +---------+ +--------+
Willy Tarreaubaaee002006-06-26 02:48:02 +0200145 */
146
Willy Tarreau2ff76222007-04-09 19:29:56 +0200147#include <stdio.h>
Willy Tarreau4f60f162007-04-08 16:39:58 +0200148#include <string.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +0200149#include <unistd.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +0200150#include <sys/types.h>
151
Willy Tarreau2dd0d472006-06-29 17:53:05 +0200152#include <common/compat.h>
153#include <common/config.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +0200154
Willy Tarreau7be79a42012-11-11 15:02:54 +0100155#include <types/global.h>
156
Willy Tarreau2a429502006-10-15 14:52:29 +0200157#include <proto/fd.h>
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200158#include <proto/log.h>
Willy Tarreauc6f4ce82009-06-10 11:09:37 +0200159#include <proto/port_range.h>
Willy Tarreaubaaee002006-06-26 02:48:02 +0200160
161struct fdtab *fdtab = NULL; /* array of all the file descriptors */
Olivier Houchardcb92f5c2018-04-26 14:23:07 +0200162unsigned long *polled_mask = NULL; /* Array for the polled_mask of each fd */
Willy Tarreau8d5d77e2009-10-18 07:25:52 +0200163struct fdinfo *fdinfo = NULL; /* less-often used infos for file descriptors */
Willy Tarreaubaaee002006-06-26 02:48:02 +0200164int totalconn; /* total # of terminated sessions */
165int actconn; /* # of active sessions */
166
Willy Tarreau4f60f162007-04-08 16:39:58 +0200167struct poller pollers[MAX_POLLERS];
168struct poller cur_poller;
169int nbpollers = 0;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200170
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100171volatile struct fdlist fd_cache ; // FD events cache
172volatile struct fdlist fd_cache_local[MAX_THREADS]; // FD events local for each thread
Olivier Houchard6b96f722018-04-25 16:58:25 +0200173volatile struct fdlist update_list; // Global update list
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100174
Christopher Faulet69553fe2018-01-15 11:57:03 +0100175unsigned long fd_cache_mask = 0; // Mask of threads with events in the cache
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200176
177THREAD_LOCAL int *fd_updt = NULL; // FD updates list
178THREAD_LOCAL int fd_nbupdt = 0; // number of updates in the list
179
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200180#define _GET_NEXT(fd, off) ((struct fdlist_entry *)(void *)((char *)(&fdtab[fd]) + off))->next
181#define _GET_PREV(fd, off) ((struct fdlist_entry *)(void *)((char *)(&fdtab[fd]) + off))->prev
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100182/* adds fd <fd> to fd list <list> if it was not yet in it */
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200183void fd_add_to_fd_list(volatile struct fdlist *list, int fd, int off)
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100184{
185 int next;
186 int new;
187 int old;
188 int last;
189
190redo_next:
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200191 next = _GET_NEXT(fd, off);
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100192 /* Check that we're not already in the cache, and if not, lock us. */
193 if (next >= -2)
194 goto done;
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200195 if (!HA_ATOMIC_CAS(&_GET_NEXT(fd, off), &next, -2))
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100196 goto redo_next;
197 __ha_barrier_store();
Willy Tarreau11559a72018-02-05 17:52:24 +0100198
199 new = fd;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100200redo_last:
201 /* First, insert in the linked list */
202 last = list->last;
203 old = -1;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100204
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200205 _GET_PREV(fd, off) = -2;
Willy Tarreau11559a72018-02-05 17:52:24 +0100206 /* Make sure the "prev" store is visible before we update the last entry */
207 __ha_barrier_store();
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100208
Willy Tarreau11559a72018-02-05 17:52:24 +0100209 if (unlikely(last == -1)) {
210 /* list is empty, try to add ourselves alone so that list->last=fd */
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100211 if (unlikely(!HA_ATOMIC_CAS(&list->last, &old, new)))
212 goto redo_last;
213
214 /* list->first was necessary -1, we're guaranteed to be alone here */
215 list->first = fd;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100216 } else {
Willy Tarreau11559a72018-02-05 17:52:24 +0100217 /* adding ourselves past the last element
218 * The CAS will only succeed if its next is -1,
219 * which means it's in the cache, and the last element.
220 */
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200221 if (unlikely(!HA_ATOMIC_CAS(&_GET_NEXT(last, off), &old, new)))
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100222 goto redo_last;
Willy Tarreau11559a72018-02-05 17:52:24 +0100223
224 /* Then, update the last entry */
225 list->last = fd;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100226 }
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100227 __ha_barrier_store();
Willy Tarreau11559a72018-02-05 17:52:24 +0100228 /* since we're alone at the end of the list and still locked(-2),
229 * we know noone tried to add past us. Mark the end of list.
230 */
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200231 _GET_PREV(fd, off) = last;
232 _GET_NEXT(fd, off) = -1;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100233 __ha_barrier_store();
234done:
235 return;
236}
237
238/* removes fd <fd> from fd list <list> */
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200239void fd_rm_from_fd_list(volatile struct fdlist *list, int fd, int off)
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100240{
241#if defined(HA_HAVE_CAS_DW) || defined(HA_CAS_IS_8B)
242 volatile struct fdlist_entry cur_list, next_list;
243#endif
244 int old;
245 int new = -2;
246 int prev;
247 int next;
248 int last;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100249lock_self:
250#if (defined(HA_CAS_IS_8B) || defined(HA_HAVE_CAS_DW))
251 next_list.next = next_list.prev = -2;
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200252 cur_list = *(volatile struct fdlist_entry *)(((char *)&fdtab[fd]) + off);
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100253 /* First, attempt to lock our own entries */
254 do {
255 /* The FD is not in the FD cache, give up */
256 if (unlikely(cur_list.next <= -3))
257 return;
258 if (unlikely(cur_list.prev == -2 || cur_list.next == -2))
259 goto lock_self;
260 } while (
261#ifdef HA_CAS_IS_8B
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200262 unlikely(!HA_ATOMIC_CAS(((void **)(void *)&_GET_NEXT(fd, off)), ((void **)(void *)&cur_list), (*(void **)(void *)&next_list))))
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100263#else
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200264 unlikely(!__ha_cas_dw((void *)&_GET_NEXT(fd, off), (void *)&cur_list, (void *)&next_list)))
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100265#endif
266 ;
267 next = cur_list.next;
268 prev = cur_list.prev;
269
270#else
271lock_self_next:
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200272 next = ({ volatile int *next = &_GET_NEXT(fd, off); *next; });
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100273 if (next == -2)
274 goto lock_self_next;
275 if (next <= -3)
276 goto done;
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200277 if (unlikely(!HA_ATOMIC_CAS(&_GET_NEXT(fd, off), &next, -2)))
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100278 goto lock_self_next;
279lock_self_prev:
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200280 prev = ({ volatile int *prev = &_GET_PREV(fd, off); *prev; });
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100281 if (prev == -2)
282 goto lock_self_prev;
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200283 if (unlikely(!HA_ATOMIC_CAS(&_GET_PREV(fd, off), &prev, -2)))
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100284 goto lock_self_prev;
285#endif
286 __ha_barrier_store();
287
288 /* Now, lock the entries of our neighbours */
289 if (likely(prev != -1)) {
290redo_prev:
291 old = fd;
292
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200293 if (unlikely(!HA_ATOMIC_CAS(&_GET_NEXT(prev, off), &old, new))) {
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100294 if (unlikely(old == -2)) {
295 /* Neighbour already locked, give up and
296 * retry again once he's done
297 */
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200298 _GET_PREV(fd, off) = prev;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100299 __ha_barrier_store();
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200300 _GET_NEXT(fd, off) = next;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100301 __ha_barrier_store();
302 goto lock_self;
303 }
304 goto redo_prev;
305 }
306 }
307 if (likely(next != -1)) {
308redo_next:
309 old = fd;
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200310 if (unlikely(!HA_ATOMIC_CAS(&_GET_PREV(next, off), &old, new))) {
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100311 if (unlikely(old == -2)) {
312 /* Neighbour already locked, give up and
313 * retry again once he's done
314 */
315 if (prev != -1) {
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200316 _GET_NEXT(prev, off) = fd;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100317 __ha_barrier_store();
318 }
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200319 _GET_PREV(fd, off) = prev;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100320 __ha_barrier_store();
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200321 _GET_NEXT(fd, off) = next;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100322 __ha_barrier_store();
323 goto lock_self;
324 }
325 goto redo_next;
326 }
327 }
328 if (list->first == fd)
329 list->first = next;
330 __ha_barrier_store();
331 last = list->last;
332 while (unlikely(last == fd && (!HA_ATOMIC_CAS(&list->last, &last, prev))))
333 __ha_compiler_barrier();
334 /* Make sure we let other threads know we're no longer in cache,
335 * before releasing our neighbours.
336 */
337 __ha_barrier_store();
338 if (likely(prev != -1))
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200339 _GET_NEXT(prev, off) = next;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100340 __ha_barrier_store();
341 if (likely(next != -1))
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200342 _GET_PREV(next, off) = prev;
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100343 __ha_barrier_store();
344 /* Ok, now we're out of the fd cache */
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200345 _GET_NEXT(fd, off) = -(next + 4);
Willy Tarreau4cc67a22018-02-05 17:14:55 +0100346 __ha_barrier_store();
347done:
348 return;
349}
350
Olivier Houchard6a2cf872018-04-25 15:10:30 +0200351#undef _GET_NEXT
352#undef _GET_PREV
353
Willy Tarreau173d9952018-01-26 21:48:23 +0100354/* Deletes an FD from the fdsets.
Willy Tarreau4f60f162007-04-08 16:39:58 +0200355 * The file descriptor is also closed.
356 */
Olivier Houchard1fc05162017-04-06 01:05:05 +0200357static void fd_dodelete(int fd, int do_close)
Willy Tarreaubaaee002006-06-26 02:48:02 +0200358{
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100359 HA_SPIN_LOCK(FD_LOCK, &fdtab[fd].lock);
Willy Tarreauad38ace2013-12-15 14:19:38 +0100360 if (fdtab[fd].linger_risk) {
361 /* this is generally set when connecting to servers */
362 setsockopt(fd, SOL_SOCKET, SO_LINGER,
363 (struct linger *) &nolinger, sizeof(struct linger));
364 }
Willy Tarreau6ea20b12012-11-11 16:05:19 +0100365 if (cur_poller.clo)
366 cur_poller.clo(fd);
367
Willy Tarreau899d9572014-01-25 19:20:35 +0100368 fd_release_cache_entry(fd);
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100369 fdtab[fd].state = 0;
Willy Tarreau6ea20b12012-11-11 16:05:19 +0100370
Willy Tarreau8d5d77e2009-10-18 07:25:52 +0200371 port_range_release_port(fdinfo[fd].port_range, fdinfo[fd].local_port);
372 fdinfo[fd].port_range = NULL;
Willy Tarreaudb3b3262012-07-05 23:19:22 +0200373 fdtab[fd].owner = NULL;
Willy Tarreauf65610a2017-10-31 16:06:06 +0100374 fdtab[fd].thread_mask = 0;
Willy Tarreauc9c83782018-01-17 18:44:46 +0100375 if (do_close) {
Olivier Houchardcb92f5c2018-04-26 14:23:07 +0200376 polled_mask[fd] = 0;
Christopher Fauletd531f882017-06-01 16:55:03 +0200377 close(fd);
Willy Tarreauc9c83782018-01-17 18:44:46 +0100378 }
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100379 HA_SPIN_UNLOCK(FD_LOCK, &fdtab[fd].lock);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200380}
Willy Tarreaubaaee002006-06-26 02:48:02 +0200381
Willy Tarreau173d9952018-01-26 21:48:23 +0100382/* Deletes an FD from the fdsets.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200383 * The file descriptor is also closed.
384 */
385void fd_delete(int fd)
386{
387 fd_dodelete(fd, 1);
388}
389
Willy Tarreau173d9952018-01-26 21:48:23 +0100390/* Deletes an FD from the fdsets.
Olivier Houchard1fc05162017-04-06 01:05:05 +0200391 * The file descriptor is kept open.
392 */
393void fd_remove(int fd)
394{
395 fd_dodelete(fd, 0);
396}
397
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100398static inline void fdlist_process_cached_events(volatile struct fdlist *fdlist)
Willy Tarreau09f24562012-11-11 16:43:45 +0100399{
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100400 int fd, old_fd, e;
Willy Tarreau09f24562012-11-11 16:43:45 +0100401
Olivier Houchard12568362018-01-31 18:07:29 +0100402 for (old_fd = fd = fdlist->first; fd != -1; fd = fdtab[fd].cache.next) {
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100403 if (fd == -2) {
404 fd = old_fd;
405 continue;
406 } else if (fd <= -3)
407 fd = -fd - 4;
408 if (fd == -1)
409 break;
410 old_fd = fd;
411 if (!(fdtab[fd].thread_mask & tid_bit))
412 continue;
Olivier Houchard12568362018-01-31 18:07:29 +0100413 if (fdtab[fd].cache.next < -3)
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100414 continue;
Christopher Faulet69553fe2018-01-15 11:57:03 +0100415
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100416 HA_ATOMIC_OR(&fd_cache_mask, tid_bit);
Willy Tarreaud80cb4e2018-01-20 19:30:13 +0100417 if (HA_SPIN_TRYLOCK(FD_LOCK, &fdtab[fd].lock)) {
418 activity[tid].fd_lock++;
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100419 continue;
Willy Tarreaud80cb4e2018-01-20 19:30:13 +0100420 }
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200421
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200422 e = fdtab[fd].state;
Willy Tarreau09f24562012-11-11 16:43:45 +0100423 fdtab[fd].ev &= FD_POLL_STICKY;
424
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100425 if ((e & (FD_EV_READY_R | FD_EV_ACTIVE_R)) == (FD_EV_READY_R | FD_EV_ACTIVE_R))
Willy Tarreau09f24562012-11-11 16:43:45 +0100426 fdtab[fd].ev |= FD_POLL_IN;
427
Willy Tarreauf817e9f2014-01-10 16:58:45 +0100428 if ((e & (FD_EV_READY_W | FD_EV_ACTIVE_W)) == (FD_EV_READY_W | FD_EV_ACTIVE_W))
Willy Tarreau09f24562012-11-11 16:43:45 +0100429 fdtab[fd].ev |= FD_POLL_OUT;
430
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200431 if (fdtab[fd].iocb && fdtab[fd].owner && fdtab[fd].ev) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100432 HA_SPIN_UNLOCK(FD_LOCK, &fdtab[fd].lock);
Willy Tarreau09f24562012-11-11 16:43:45 +0100433 fdtab[fd].iocb(fd);
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200434 }
435 else {
Willy Tarreau5be2f352014-11-19 19:43:05 +0100436 fd_release_cache_entry(fd);
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100437 HA_SPIN_UNLOCK(FD_LOCK, &fdtab[fd].lock);
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200438 }
Willy Tarreau09f24562012-11-11 16:43:45 +0100439 }
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100440}
441
442/* Scan and process the cached events. This should be called right after
443 * the poller. The loop may cause new entries to be created, for example
444 * if a listener causes an accept() to initiate a new incoming connection
445 * wanting to attempt an recv().
446 */
447void fd_process_cached_events()
448{
449 HA_ATOMIC_AND(&fd_cache_mask, ~tid_bit);
450 fdlist_process_cached_events(&fd_cache_local[tid]);
451 fdlist_process_cached_events(&fd_cache);
Willy Tarreau09f24562012-11-11 16:43:45 +0100452}
Willy Tarreaubaaee002006-06-26 02:48:02 +0200453
Willy Tarreau4f60f162007-04-08 16:39:58 +0200454/* disable the specified poller */
455void disable_poller(const char *poller_name)
456{
457 int p;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200458
Willy Tarreau4f60f162007-04-08 16:39:58 +0200459 for (p = 0; p < nbpollers; p++)
460 if (strcmp(pollers[p].name, poller_name) == 0)
461 pollers[p].pref = 0;
462}
Willy Tarreaubaaee002006-06-26 02:48:02 +0200463
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200464/* Initialize the pollers per thread */
465static int init_pollers_per_thread()
466{
467 if ((fd_updt = calloc(global.maxsock, sizeof(*fd_updt))) == NULL)
468 return 0;
469 return 1;
470}
471
472/* Deinitialize the pollers per thread */
473static void deinit_pollers_per_thread()
474{
475 free(fd_updt);
476 fd_updt = NULL;
477}
478
Willy Tarreaubaaee002006-06-26 02:48:02 +0200479/*
Willy Tarreau4f60f162007-04-08 16:39:58 +0200480 * Initialize the pollers till the best one is found.
481 * If none works, returns 0, otherwise 1.
Willy Tarreaubaaee002006-06-26 02:48:02 +0200482 */
Willy Tarreau4f60f162007-04-08 16:39:58 +0200483int init_pollers()
Willy Tarreaubaaee002006-06-26 02:48:02 +0200484{
Willy Tarreau4f60f162007-04-08 16:39:58 +0200485 int p;
486 struct poller *bp;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200487
Christopher Faulet63fe6522017-08-31 17:52:09 +0200488 if ((fdtab = calloc(global.maxsock, sizeof(struct fdtab))) == NULL)
489 goto fail_tab;
490
Olivier Houchardcb92f5c2018-04-26 14:23:07 +0200491 if ((polled_mask = calloc(global.maxsock, sizeof(unsigned long))) == NULL)
492 goto fail_polledmask;
Christopher Faulet63fe6522017-08-31 17:52:09 +0200493 if ((fdinfo = calloc(global.maxsock, sizeof(struct fdinfo))) == NULL)
494 goto fail_info;
495
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100496 fd_cache.first = fd_cache.last = -1;
Olivier Houchard6b96f722018-04-25 16:58:25 +0200497 update_list.first = update_list.last = -1;
Christopher Fauletcd7879a2017-10-27 13:53:47 +0200498 hap_register_per_thread_init(init_pollers_per_thread);
499 hap_register_per_thread_deinit(deinit_pollers_per_thread);
Willy Tarreaubaaee002006-06-26 02:48:02 +0200500
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100501 for (p = 0; p < global.maxsock; p++) {
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100502 HA_SPIN_INIT(&fdtab[p].lock);
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100503 /* Mark the fd as out of the fd cache */
Olivier Houchard12568362018-01-31 18:07:29 +0100504 fdtab[p].cache.next = -3;
Olivier Houchard6b96f722018-04-25 16:58:25 +0200505 fdtab[p].update.next = -3;
Olivier Houchard4815c8c2018-01-24 18:17:56 +0100506 }
507 for (p = 0; p < global.nbthread; p++)
508 fd_cache_local[p].first = fd_cache_local[p].last = -1;
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200509
Willy Tarreau4f60f162007-04-08 16:39:58 +0200510 do {
511 bp = NULL;
512 for (p = 0; p < nbpollers; p++)
513 if (!bp || (pollers[p].pref > bp->pref))
514 bp = &pollers[p];
Willy Tarreaubaaee002006-06-26 02:48:02 +0200515
Willy Tarreau4f60f162007-04-08 16:39:58 +0200516 if (!bp || bp->pref == 0)
Willy Tarreaubaaee002006-06-26 02:48:02 +0200517 break;
518
Willy Tarreau4f60f162007-04-08 16:39:58 +0200519 if (bp->init(bp)) {
520 memcpy(&cur_poller, bp, sizeof(*bp));
521 return 1;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200522 }
Willy Tarreau4f60f162007-04-08 16:39:58 +0200523 } while (!bp || bp->pref == 0);
524 return 0;
Willy Tarreau7be79a42012-11-11 15:02:54 +0100525
Willy Tarreau16f649c2014-01-25 19:10:48 +0100526 fail_cache:
Christopher Faulet63fe6522017-08-31 17:52:09 +0200527 free(fdinfo);
528 fail_info:
529 free(fdtab);
530 fail_tab:
Olivier Houchardcb92f5c2018-04-26 14:23:07 +0200531 free(polled_mask);
532 fail_polledmask:
Willy Tarreau7be79a42012-11-11 15:02:54 +0100533 return 0;
Willy Tarreaubaaee002006-06-26 02:48:02 +0200534}
535
Willy Tarreaubaaee002006-06-26 02:48:02 +0200536/*
Krzysztof Piotr Oledzkia643baf2008-05-29 23:53:44 +0200537 * Deinitialize the pollers.
538 */
539void deinit_pollers() {
540
541 struct poller *bp;
542 int p;
543
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200544 for (p = 0; p < global.maxsock; p++)
Christopher Faulet2a944ee2017-11-07 10:42:54 +0100545 HA_SPIN_DESTROY(&fdtab[p].lock);
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200546
Krzysztof Piotr Oledzkia643baf2008-05-29 23:53:44 +0200547 for (p = 0; p < nbpollers; p++) {
548 bp = &pollers[p];
549
550 if (bp && bp->pref)
551 bp->term(bp);
552 }
Christopher Fauletd4604ad2017-05-29 10:40:41 +0200553
Christopher Faulet63fe6522017-08-31 17:52:09 +0200554 free(fdinfo); fdinfo = NULL;
555 free(fdtab); fdtab = NULL;
Olivier Houchardcb92f5c2018-04-26 14:23:07 +0200556 free(polled_mask); polled_mask = NULL;
Krzysztof Piotr Oledzkia643baf2008-05-29 23:53:44 +0200557}
558
559/*
Willy Tarreau2ff76222007-04-09 19:29:56 +0200560 * Lists the known pollers on <out>.
561 * Should be performed only before initialization.
562 */
563int list_pollers(FILE *out)
564{
565 int p;
566 int last, next;
567 int usable;
568 struct poller *bp;
569
570 fprintf(out, "Available polling systems :\n");
571
572 usable = 0;
573 bp = NULL;
574 last = next = -1;
575 while (1) {
576 for (p = 0; p < nbpollers; p++) {
Willy Tarreau2ff76222007-04-09 19:29:56 +0200577 if ((next < 0 || pollers[p].pref > next)
Willy Tarreaue79c3b22010-11-19 10:20:36 +0100578 && (last < 0 || pollers[p].pref < last)) {
Willy Tarreau2ff76222007-04-09 19:29:56 +0200579 next = pollers[p].pref;
Willy Tarreaue79c3b22010-11-19 10:20:36 +0100580 if (!bp || (pollers[p].pref > bp->pref))
581 bp = &pollers[p];
582 }
Willy Tarreau2ff76222007-04-09 19:29:56 +0200583 }
584
585 if (next == -1)
586 break;
587
588 for (p = 0; p < nbpollers; p++) {
589 if (pollers[p].pref == next) {
590 fprintf(out, " %10s : ", pollers[p].name);
591 if (pollers[p].pref == 0)
592 fprintf(out, "disabled, ");
593 else
594 fprintf(out, "pref=%3d, ", pollers[p].pref);
595 if (pollers[p].test(&pollers[p])) {
596 fprintf(out, " test result OK");
597 if (next > 0)
598 usable++;
Willy Tarreaue79c3b22010-11-19 10:20:36 +0100599 } else {
Willy Tarreau2ff76222007-04-09 19:29:56 +0200600 fprintf(out, " test result FAILED");
Willy Tarreaue79c3b22010-11-19 10:20:36 +0100601 if (bp == &pollers[p])
602 bp = NULL;
603 }
Willy Tarreau2ff76222007-04-09 19:29:56 +0200604 fprintf(out, "\n");
605 }
606 }
607 last = next;
608 next = -1;
609 };
610 fprintf(out, "Total: %d (%d usable), will use %s.\n", nbpollers, usable, bp ? bp->name : "none");
611 return 0;
612}
613
614/*
615 * Some pollers may lose their connection after a fork(). It may be necessary
616 * to create initialize part of them again. Returns 0 in case of failure,
617 * otherwise 1. The fork() function may be NULL if unused. In case of error,
618 * the the current poller is destroyed and the caller is responsible for trying
619 * another one by calling init_pollers() again.
620 */
621int fork_poller()
622{
Conrad Hoffmann041751c2014-05-20 14:28:24 +0200623 int fd;
Willy Tarreauce036bc2018-01-29 14:58:02 +0100624 for (fd = 0; fd < global.maxsock; fd++) {
Conrad Hoffmann041751c2014-05-20 14:28:24 +0200625 if (fdtab[fd].owner) {
626 fdtab[fd].cloned = 1;
627 }
628 }
629
Willy Tarreau2ff76222007-04-09 19:29:56 +0200630 if (cur_poller.fork) {
631 if (cur_poller.fork(&cur_poller))
632 return 1;
633 cur_poller.term(&cur_poller);
634 return 0;
635 }
636 return 1;
637}
638
639/*
Willy Tarreaubaaee002006-06-26 02:48:02 +0200640 * Local variables:
641 * c-indent-level: 8
642 * c-basic-offset: 8
643 * End:
644 */