ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev_linuxaio.c
(Generate patch)

Comparing libev/ev_linuxaio.c (file contents):
Revision 1.23 by root, Mon Jun 24 21:34:47 2019 UTC vs.
Revision 1.52 by root, Wed Aug 28 10:05:23 2019 UTC

… …
35 * and other provisions required by the GPL. If you do not delete the 35 * and other provisions required by the GPL. If you do not delete the
36 * provisions above, a recipient may use your version of this file under 36 * provisions above, a recipient may use your version of this file under
37 * either the BSD or the GPL. 37 * either the BSD or the GPL.
38 */ 38 */
39 39
40#define EPOLL_FALLBACK 1 40/*
41 * general notes about linux aio:
42 *
43 * a) at first, the linux aio IOCB_CMD_POLL functionality introduced in
44 * 4.18 looks too good to be true: both watchers and events can be
45 * batched, and events can even be handled in userspace using
46 * a ring buffer shared with the kernel. watchers can be canceled
47 * regardless of whether the fd has been closed. no problems with fork.
48 * ok, the ring buffer is 200% undocumented (there isn't even a
49 * header file), but otherwise, it's pure bliss!
50 * b) ok, watchers are one-shot, so you have to re-arm active ones
51 * on every iteration. so much for syscall-less event handling,
52 * but at least these re-arms can be batched, no big deal, right?
53 * c) well, linux as usual: the documentation lies to you: io_submit
54 * sometimes returns EINVAL because the kernel doesn't feel like
55 * handling your poll mask - ttys can be polled for POLLOUT,
56 * POLLOUT|POLLIN, but polling for POLLIN fails. just great,
57 * so we have to fall back to something else (hello, epoll),
58 * but at least the fallback can be slow, because these are
59 * exceptional cases, right?
60 * d) hmm, you have to tell the kernel the maximum number of watchers
61 * you want to queue when initialising the aio context. but of
62 * course the real limit is magically calculated in the kernel, and
63 * is often higher then we asked for. so we just have to destroy
64 * the aio context and re-create it a bit larger if we hit the limit.
65 * (starts to remind you of epoll? well, it's a bit more deterministic
66 * and less gambling, but still ugly as hell).
67 * e) that's when you find out you can also hit an arbitrary system-wide
68 * limit. or the kernel simply doesn't want to handle your watchers.
69 * what the fuck do we do then? you guessed it, in the middle
70 * of event handling we have to switch to 100% epoll polling. and
71 * that better is as fast as normal epoll polling, so you practically
72 * have to use the normal epoll backend with all its quirks.
73 * f) end result of this train wreck: it inherits all the disadvantages
74 * from epoll, while adding a number on its own. why even bother to use
75 * it? because if conditions are right and your fds are supported and you
76 * don't hit a limit, this backend is actually faster, doesn't gamble with
77 * your fds, batches watchers and events and doesn't require costly state
78 * recreates. well, until it does.
79 * g) all of this makes this backend use almost twice as much code as epoll.
80 * which in turn uses twice as much code as poll. and that#s not counting
81 * the fact that this backend also depends on the epoll backend, making
82 * it three times as much code as poll, or kqueue.
83 * h) bleah. why can't linux just do kqueue. sure kqueue is ugly, but by now
84 * it's clear that whatever linux comes up with is far, far, far worse.
85 */
41 86
42#include <sys/time.h> /* actually linux/time.h, but we must assume they are compatible */ 87#include <sys/time.h> /* actually linux/time.h, but we must assume they are compatible */
43#include <poll.h> 88#include <poll.h>
44#include <linux/aio_abi.h> 89#include <linux/aio_abi.h>
45 90
46#if EPOLL_FALLBACK
47# include <sys/epoll.h>
48#endif
49
50/* we try to fill 4kB pages exactly.
51 * the ring buffer header is 32 bytes, every io event is 32 bytes.
52 * the kernel takes the io event number, doubles it, adds 2, adds the ring buffer.
53 * therefore the calculation below will use "exactly" 4kB for the ring buffer
54 */
55#define EV_LINUXAIO_DEPTH (128 / 2 - 2 - 1) /* max. number of io events per batch */
56
57/*****************************************************************************/ 91/*****************************************************************************/
58/* syscall wrapdadoop - this section has the raw syscall definitions */ 92/* syscall wrapdadoop - this section has the raw api/abi definitions */
59 93
60#include <sys/syscall.h> /* no glibc wrappers */ 94#include <sys/syscall.h> /* no glibc wrappers */
61 95
62/* aio_abi.h is not versioned in any way, so we cannot test for its existance */ 96/* aio_abi.h is not versioned in any way, so we cannot test for its existance */
63#define IOCB_CMD_POLL 5 97#define IOCB_CMD_POLL 5
64 98
65/* taken from linux/fs/aio.c */ 99/* taken from linux/fs/aio.c. yup, that's a .c file.
100 * not only is this totally undocumented, not even the source code
101 * can tell you what the future semantics of compat_features and
102 * incompat_features are, or what header_length actually is for.
103 */
66#define AIO_RING_MAGIC 0xa10a10a1 104#define AIO_RING_MAGIC 0xa10a10a1
67#define AIO_RING_INCOMPAT_FEATURES 0 105#define EV_AIO_RING_INCOMPAT_FEATURES 0
68struct aio_ring 106struct aio_ring
69{ 107{
70 unsigned id; /* kernel internal index number */ 108 unsigned id; /* kernel internal index number */
71 unsigned nr; /* number of io_events */ 109 unsigned nr; /* number of io_events */
72 unsigned head; /* Written to by userland or by kernel. */ 110 unsigned head; /* Written to by userland or by kernel. */
… …
82 120
83inline_size 121inline_size
84int 122int
85evsys_io_setup (unsigned nr_events, aio_context_t *ctx_idp) 123evsys_io_setup (unsigned nr_events, aio_context_t *ctx_idp)
86{ 124{
87 return syscall (SYS_io_setup, nr_events, ctx_idp); 125 return ev_syscall2 (SYS_io_setup, nr_events, ctx_idp);
88} 126}
89 127
90inline_size 128inline_size
91int 129int
92evsys_io_destroy (aio_context_t ctx_id) 130evsys_io_destroy (aio_context_t ctx_id)
93{ 131{
94 return syscall (SYS_io_destroy, ctx_id); 132 return ev_syscall1 (SYS_io_destroy, ctx_id);
95} 133}
96 134
97inline_size 135inline_size
98int 136int
99evsys_io_submit (aio_context_t ctx_id, long nr, struct iocb *cbp[]) 137evsys_io_submit (aio_context_t ctx_id, long nr, struct iocb *cbp[])
100{ 138{
101 return syscall (SYS_io_submit, ctx_id, nr, cbp); 139 return ev_syscall3 (SYS_io_submit, ctx_id, nr, cbp);
102} 140}
103 141
104inline_size 142inline_size
105int 143int
106evsys_io_cancel (aio_context_t ctx_id, struct iocb *cbp, struct io_event *result) 144evsys_io_cancel (aio_context_t ctx_id, struct iocb *cbp, struct io_event *result)
107{ 145{
108 return syscall (SYS_io_cancel, ctx_id, cbp, result); 146 return ev_syscall3 (SYS_io_cancel, ctx_id, cbp, result);
109} 147}
110 148
111inline_size 149inline_size
112int 150int
113evsys_io_getevents (aio_context_t ctx_id, long min_nr, long nr, struct io_event *events, struct timespec *timeout) 151evsys_io_getevents (aio_context_t ctx_id, long min_nr, long nr, struct io_event *events, struct timespec *timeout)
114{ 152{
115 return syscall (SYS_io_getevents, ctx_id, min_nr, nr, events, timeout); 153 return ev_syscall5 (SYS_io_getevents, ctx_id, min_nr, nr, events, timeout);
116} 154}
117 155
118/*****************************************************************************/ 156/*****************************************************************************/
119/* actual backed implementation */ 157/* actual backed implementation */
120 158
159ecb_cold
160static int
161linuxaio_nr_events (EV_P)
162{
163 /* we start with 16 iocbs and incraese from there
164 * that's tiny, but the kernel has a rather low system-wide
165 * limit that can be reached quickly, so let's be parsimonious
166 * with this resource.
167 * Rest assured, the kernel generously rounds up small and big numbers
168 * in different ways (but doesn't seem to charge you for it).
169 * The 15 here is because the kernel usually has a power of two as aio-max-nr,
170 * and this helps to take advantage of that limit.
171 */
172
173 /* we try to fill 4kB pages exactly.
174 * the ring buffer header is 32 bytes, every io event is 32 bytes.
175 * the kernel takes the io requests number, doubles it, adds 2
176 * and adds the ring buffer.
177 * the way we use this is by starting low, and then roughly doubling the
178 * size each time we hit a limit.
179 */
180
181 int requests = 15 << linuxaio_iteration;
182 int one_page = (4096
183 / sizeof (struct io_event) ) / 2; /* how many fit into one page */
184 int first_page = ((4096 - sizeof (struct aio_ring))
185 / sizeof (struct io_event) - 2) / 2; /* how many fit into the first page */
186
187 /* if everything fits into one page, use count exactly */
188 if (requests > first_page)
189 /* otherwise, round down to full pages and add the first page */
190 requests = requests / one_page * one_page + first_page;
191
192 return requests;
193}
194
121/* we use out own wrapper structure in acse we ever want to do something "clever" */ 195/* we use out own wrapper structure in case we ever want to do something "clever" */
122typedef struct aniocb 196typedef struct aniocb
123{ 197{
124 struct iocb io; 198 struct iocb io;
125 /*int inuse;*/ 199 /*int inuse;*/
126} *ANIOCBP; 200} *ANIOCBP;
… …
129void 203void
130linuxaio_array_needsize_iocbp (ANIOCBP *base, int offset, int count) 204linuxaio_array_needsize_iocbp (ANIOCBP *base, int offset, int count)
131{ 205{
132 while (count--) 206 while (count--)
133 { 207 {
134 /* TODO: quite the overhead to allocate every iocb separately, maybe use our own alocator? */ 208 /* TODO: quite the overhead to allocate every iocb separately, maybe use our own allocator? */
135 ANIOCBP iocb = (ANIOCBP)ev_malloc (sizeof (*iocb)); 209 ANIOCBP iocb = (ANIOCBP)ev_malloc (sizeof (*iocb));
136 210
137 /* full zero initialise is probably not required at the moment, but 211 /* full zero initialise is probably not required at the moment, but
138 * this is not well documented, so we better do it. 212 * this is not well documented, so we better do it.
139 */ 213 */
140 memset (iocb, 0, sizeof (*iocb)); 214 memset (iocb, 0, sizeof (*iocb));
141 215
142 iocb->io.aio_lio_opcode = IOCB_CMD_POLL; 216 iocb->io.aio_lio_opcode = IOCB_CMD_POLL;
143 iocb->io.aio_data = offset;
144 iocb->io.aio_fildes = offset; 217 iocb->io.aio_fildes = offset;
145 218
146 base [offset++] = iocb; 219 base [offset++] = iocb;
147 } 220 }
148} 221}
… …
160static void 233static void
161linuxaio_modify (EV_P_ int fd, int oev, int nev) 234linuxaio_modify (EV_P_ int fd, int oev, int nev)
162{ 235{
163 array_needsize (ANIOCBP, linuxaio_iocbps, linuxaio_iocbpmax, fd + 1, linuxaio_array_needsize_iocbp); 236 array_needsize (ANIOCBP, linuxaio_iocbps, linuxaio_iocbpmax, fd + 1, linuxaio_array_needsize_iocbp);
164 ANIOCBP iocb = linuxaio_iocbps [fd]; 237 ANIOCBP iocb = linuxaio_iocbps [fd];
238 ANFD *anfd = &anfds [fd];
165 239
166#if EPOLL_FALLBACK
167 if (iocb->io.aio_reqprio < 0) 240 if (ecb_expect_false (iocb->io.aio_reqprio < 0))
168 { 241 {
242 /* we handed this fd over to epoll, so undo this first */
243 /* we do it manually because the optimisations on epoll_modify won't do us any good */
169 epoll_ctl (backend_fd, EPOLL_CTL_DEL, fd, 0); 244 epoll_ctl (backend_fd, EPOLL_CTL_DEL, fd, 0);
245 anfd->emask = 0;
170 iocb->io.aio_reqprio = 0; 246 iocb->io.aio_reqprio = 0;
171 } 247 }
172#endif 248 else if (ecb_expect_false (iocb->io.aio_buf))
249 {
250 /* iocb active, so cancel it first before resubmit */
251 /* this assumes we only ever get one call per fd per loop iteration */
252 for (;;)
253 {
254 /* on all relevant kernels, io_cancel fails with EINPROGRESS on "success" */
255 if (ecb_expect_false (evsys_io_cancel (linuxaio_ctx, &iocb->io, (struct io_event *)0) == 0))
256 break;
173 257
258 if (ecb_expect_true (errno == EINPROGRESS))
259 break;
260
261 /* the EINPROGRESS test is for nicer error message. clumsy. */
262 if (errno != EINTR)
263 {
264 assert (("libev: linuxaio unexpected io_cancel failed", errno != EINTR && errno != EINPROGRESS));
265 break;
266 }
267 }
268
269 /* increment generation counter to avoid handling old events */
270 ++anfd->egen;
271 }
272
174 if (iocb->io.aio_buf) 273 iocb->io.aio_buf =
175 evsys_io_cancel (linuxaio_ctx, &iocb->io, (struct io_event *)0); /* always returns an error relevant kernels */ 274 (nev & EV_READ ? POLLIN : 0)
275 | (nev & EV_WRITE ? POLLOUT : 0);
176 276
177 if (nev) 277 if (nev)
178 { 278 {
179 iocb->io.aio_buf = 279 iocb->io.aio_data = (uint32_t)fd | ((__u64)(uint32_t)anfd->egen << 32);
180 (nev & EV_READ ? POLLIN : 0)
181 | (nev & EV_WRITE ? POLLOUT : 0);
182 280
183 /* queue iocb up for io_submit */ 281 /* queue iocb up for io_submit */
184 /* this assumes we only ever get one call per fd per loop iteration */ 282 /* this assumes we only ever get one call per fd per loop iteration */
185 ++linuxaio_submitcnt; 283 ++linuxaio_submitcnt;
186 array_needsize (struct iocb *, linuxaio_submits, linuxaio_submitmax, linuxaio_submitcnt, array_needsize_noinit); 284 array_needsize (struct iocb *, linuxaio_submits, linuxaio_submitmax, linuxaio_submitcnt, array_needsize_noinit);
187 linuxaio_submits [linuxaio_submitcnt - 1] = &iocb->io; 285 linuxaio_submits [linuxaio_submitcnt - 1] = &iocb->io;
188 } 286 }
189} 287}
190 288
191#if EPOLL_FALLBACK
192
193static void
194linuxaio_rearm_epoll (EV_P_ struct iocb *iocb, int op)
195{
196 struct epoll_event eev;
197
198 eev.events = EPOLLONESHOT;
199 if (iocb->aio_buf & POLLIN ) eev.events |= EPOLLIN ;
200 if (iocb->aio_buf & POLLOUT) eev.events |= EPOLLOUT;
201 eev.data.fd = iocb->aio_fildes;
202
203 if (epoll_ctl (backend_fd, op, iocb->aio_fildes, &eev) < 0)
204 ev_syserr ("(libeio) linuxaio epoll_ctl");
205}
206
207static void 289static void
208linuxaio_epoll_cb (EV_P_ struct ev_io *w, int revents) 290linuxaio_epoll_cb (EV_P_ struct ev_io *w, int revents)
209{ 291{
210 struct epoll_event events[16]; 292 epoll_poll (EV_A_ 0);
211
212 for (;;)
213 {
214 int idx;
215 int res = epoll_wait (backend_fd, events, sizeof (events) / sizeof (events [0]), 0);
216
217 if (expect_false (res < 0))
218 ev_syserr ("(libev) linuxaio epoll_wait");
219 else if (!res)
220 break;
221
222 for (idx = res; idx--; )
223 {
224 int fd = events [idx].data.fd;
225 uint32_t ev = events [idx].events;
226
227 assert (("libev: iocb fd must be in-bounds", fd >= 0 && fd < anfdmax));
228
229 linuxaio_rearm_epoll (EV_A_ &linuxaio_iocbps [fd]->io, EPOLL_CTL_MOD);
230
231 fd_event (EV_A_ fd,
232 (ev & (EPOLLOUT | EPOLLERR | EPOLLHUP) ? EV_WRITE : 0)
233 | (ev & (EPOLLIN | EPOLLERR | EPOLLHUP) ? EV_READ : 0));
234 }
235
236 if (res < sizeof (events) / sizeof (events [0]))
237 break;
238 }
239} 293}
240 294
241#endif 295inline_speed
296void
297linuxaio_fd_rearm (EV_P_ int fd)
298{
299 anfds [fd].events = 0;
300 linuxaio_iocbps [fd]->io.aio_buf = 0;
301 fd_change (EV_A_ fd, EV_ANFD_REIFY);
302}
242 303
243static void 304static void
244linuxaio_parse_events (EV_P_ struct io_event *ev, int nr) 305linuxaio_parse_events (EV_P_ struct io_event *ev, int nr)
245{ 306{
246 while (nr) 307 while (nr)
247 { 308 {
248 int fd = ev->data; 309 int fd = ev->data & 0xffffffff;
310 uint32_t gen = ev->data >> 32;
249 int res = ev->res; 311 int res = ev->res;
250 312
251 assert (("libev: iocb fd must be in-bounds", fd >= 0 && fd < anfdmax)); 313 assert (("libev: iocb fd must be in-bounds", fd >= 0 && fd < anfdmax));
252 314
253 /* linux aio is oneshot: rearm fd. TODO: this does more work than needed */ 315 /* only accept events if generation counter matches */
254 linuxaio_iocbps [fd]->io.aio_buf = 0; 316 if (ecb_expect_true (gen == (uint32_t)anfds [fd].egen))
255 anfds [fd].events = 0; 317 {
256 fd_change (EV_A_ fd, 0);
257
258 /* feed events, we do not expect or handle POLLNVAL */ 318 /* feed events, we do not expect or handle POLLNVAL */
259 fd_event ( 319 fd_event (
260 EV_A_ 320 EV_A_
261 fd, 321 fd,
262 (res & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 322 (res & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
263 | (res & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 323 | (res & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
264 ); 324 );
325
326 /* linux aio is oneshot: rearm fd. TODO: this does more work than strictly needed */
327 linuxaio_fd_rearm (EV_A_ fd);
328 }
265 329
266 --nr; 330 --nr;
267 ++ev; 331 ++ev;
268 } 332 }
269} 333}
270 334
271/* get any events from ringbuffer, return true if any were handled */ 335/* get any events from ring buffer, return true if any were handled */
272static int 336static int
273linuxaio_get_events_from_ring (EV_P) 337linuxaio_get_events_from_ring (EV_P)
274{ 338{
275 struct aio_ring *ring = (struct aio_ring *)linuxaio_ctx; 339 struct aio_ring *ring = (struct aio_ring *)linuxaio_ctx;
340 unsigned head, tail;
276 341
277 /* the kernel reads and writes both of these variables, */ 342 /* the kernel reads and writes both of these variables, */
278 /* as a C extension, we assume that volatile use here */ 343 /* as a C extension, we assume that volatile use here */
279 /* both makes reads atomic and once-only */ 344 /* both makes reads atomic and once-only */
280 unsigned head = *(volatile unsigned *)&ring->head; 345 head = *(volatile unsigned *)&ring->head;
346 ECB_MEMORY_FENCE_ACQUIRE;
281 unsigned tail = *(volatile unsigned *)&ring->tail; 347 tail = *(volatile unsigned *)&ring->tail;
282 348
283 if (head == tail) 349 if (head == tail)
284 return 0; 350 return 0;
285 351
286 /* bail out if the ring buffer doesn't match the expected layout */
287 if (expect_false (ring->magic != AIO_RING_MAGIC)
288 || ring->incompat_features != AIO_RING_INCOMPAT_FEATURES
289 || ring->header_length != sizeof (struct aio_ring)) /* TODO: or use it to find io_event[0]? */
290 return 0;
291
292 /* make sure the events up to tail are visible */
293 ECB_MEMORY_FENCE_ACQUIRE;
294
295 /* parse all available events, but only once, to avoid starvation */ 352 /* parse all available events, but only once, to avoid starvation */
296 if (tail > head) /* normal case around */ 353 if (ecb_expect_true (tail > head)) /* normal case around */
297 linuxaio_parse_events (EV_A_ ring->io_events + head, tail - head); 354 linuxaio_parse_events (EV_A_ ring->io_events + head, tail - head);
298 else /* wrapped around */ 355 else /* wrapped around */
299 { 356 {
300 linuxaio_parse_events (EV_A_ ring->io_events + head, ring->nr - head); 357 linuxaio_parse_events (EV_A_ ring->io_events + head, ring->nr - head);
301 linuxaio_parse_events (EV_A_ ring->io_events, tail); 358 linuxaio_parse_events (EV_A_ ring->io_events, tail);
302 } 359 }
303 360
304 /* TODO: we only need a compiler barrier here, not a read fence */
305 ECB_MEMORY_FENCE_RELEASE; 361 ECB_MEMORY_FENCE_RELEASE;
306 /* as an extension to C, we hope that the volatile will make this atomic and once-only */ 362 /* as an extension to C, we hope that the volatile will make this atomic and once-only */
307 *(volatile unsigned *)&ring->head = tail; 363 *(volatile unsigned *)&ring->head = tail;
308 /* make sure kernel can see our new head value - probably not required */
309 ECB_MEMORY_FENCE_RELEASE;
310 364
311 return 1; 365 return 1;
366}
367
368inline_size
369int
370linuxaio_ringbuf_valid (EV_P)
371{
372 struct aio_ring *ring = (struct aio_ring *)linuxaio_ctx;
373
374 return ecb_expect_true (ring->magic == AIO_RING_MAGIC)
375 && ring->incompat_features == EV_AIO_RING_INCOMPAT_FEATURES
376 && ring->header_length == sizeof (struct aio_ring); /* TODO: or use it to find io_event[0]? */
312} 377}
313 378
314/* read at least one event from kernel, or timeout */ 379/* read at least one event from kernel, or timeout */
315inline_size 380inline_size
316void 381void
317linuxaio_get_events (EV_P_ ev_tstamp timeout) 382linuxaio_get_events (EV_P_ ev_tstamp timeout)
318{ 383{
319 struct timespec ts; 384 struct timespec ts;
320 struct io_event ioev[1]; 385 struct io_event ioev[8]; /* 256 octet stack space */
321 int res; 386 int want = 1; /* how many events to request */
387 int ringbuf_valid = linuxaio_ringbuf_valid (EV_A);
322 388
389 if (ecb_expect_true (ringbuf_valid))
390 {
391 /* if the ring buffer has any events, we don't wait or call the kernel at all */
323 if (linuxaio_get_events_from_ring (EV_A)) 392 if (linuxaio_get_events_from_ring (EV_A))
324 return; 393 return;
325 394
326 /* no events, so wait for at least one, then poll ring buffer again */ 395 /* if the ring buffer is empty, and we don't have a timeout, then don't call the kernel */
327 /* this degrades to one event per loop iteration */ 396 if (!timeout)
328 /* if the ring buffer changes layout, but so be it */ 397 return;
398 }
399 else
400 /* no ringbuffer, request slightly larger batch */
401 want = sizeof (ioev) / sizeof (ioev [0]);
329 402
403 /* no events, so wait for some
404 * for fairness reasons, we do this in a loop, to fetch all events
405 */
406 for (;;)
407 {
408 int res;
409
330 EV_RELEASE_CB; 410 EV_RELEASE_CB;
331 411
332 ts.tv_sec = (long)timeout; 412 EV_TS_SET (ts, timeout);
333 ts.tv_nsec = (long)((timeout - ts.tv_sec) * 1e9); 413 res = evsys_io_getevents (linuxaio_ctx, 1, want, ioev, &ts);
334 414
335 res = evsys_io_getevents (linuxaio_ctx, 1, sizeof (ioev) / sizeof (ioev [0]), ioev, &ts);
336
337 EV_ACQUIRE_CB; 415 EV_ACQUIRE_CB;
338 416
339 if (res < 0) 417 if (res < 0)
340 if (errno == EINTR) 418 if (errno == EINTR)
341 /* ignored */; 419 /* ignored, retry */;
342 else 420 else
343 ev_syserr ("(libev) linuxaio io_getevents"); 421 ev_syserr ("(libev) linuxaio io_getevents");
344 else if (res) 422 else if (res)
345 { 423 {
346 /* at least one event received, handle it and any remaining ones in the ring buffer */ 424 /* at least one event available, handle them */
347 linuxaio_parse_events (EV_A_ ioev, res); 425 linuxaio_parse_events (EV_A_ ioev, res);
426
427 if (ecb_expect_true (ringbuf_valid))
428 {
429 /* if we have a ring buffer, handle any remaining events in it */
348 linuxaio_get_events_from_ring (EV_A); 430 linuxaio_get_events_from_ring (EV_A);
431
432 /* at this point, we should have handled all outstanding events */
433 break;
434 }
435 else if (res < want)
436 /* otherwise, if there were fewere events than we wanted, we assume there are no more */
437 break;
438 }
439 else
440 break; /* no events from the kernel, we are done */
441
442 timeout = EV_TS_CONST (0.); /* only wait in the first iteration */
349 } 443 }
444}
445
446inline_size
447int
448linuxaio_io_setup (EV_P)
449{
450 linuxaio_ctx = 0;
451 return evsys_io_setup (linuxaio_nr_events (EV_A), &linuxaio_ctx);
350} 452}
351 453
352static void 454static void
353linuxaio_poll (EV_P_ ev_tstamp timeout) 455linuxaio_poll (EV_P_ ev_tstamp timeout)
354{ 456{
… …
356 458
357 /* first phase: submit new iocbs */ 459 /* first phase: submit new iocbs */
358 460
359 /* io_submit might return less than the requested number of iocbs */ 461 /* io_submit might return less than the requested number of iocbs */
360 /* this is, afaics, only because of errors, but we go by the book and use a loop, */ 462 /* this is, afaics, only because of errors, but we go by the book and use a loop, */
361 /* which allows us to pinpoint the errornous iocb */ 463 /* which allows us to pinpoint the erroneous iocb */
362 for (submitted = 0; submitted < linuxaio_submitcnt; ) 464 for (submitted = 0; submitted < linuxaio_submitcnt; )
363 { 465 {
364#if 0
365 int res;
366 if (linuxaio_submits[submitted]->aio_fildes == backend_fd)
367 res = evsys_io_submit (linuxaio_ctx, 1, linuxaio_submits + submitted);
368 else
369 { res = -1; errno = EINVAL; };
370#else
371 int res = evsys_io_submit (linuxaio_ctx, linuxaio_submitcnt - submitted, linuxaio_submits + submitted); 466 int res = evsys_io_submit (linuxaio_ctx, linuxaio_submitcnt - submitted, linuxaio_submits + submitted);
372#endif
373 467
374 if (expect_false (res < 0)) 468 if (ecb_expect_false (res < 0))
375 if (errno == EAGAIN)
376 {
377 /* This happens when the ring buffer is full, at least. I assume this means
378 * that the event was queued synchronously during io_submit, and thus
379 * the buffer overflowed.
380 * In this case, we just try in next loop iteration.
381 * This should not result in a few fds taking priority, as the interface
382 * is one-shot, and we submit iocb's in a round-robin fashion.
383 * TODO: maybe make "submitted" persistent, so we don't have to memmove?
384 */
385 if (ecb_expect_false (submitted))
386 {
387 memmove (linuxaio_submits, linuxaio_submits + submitted, (linuxaio_submitcnt - submitted) * sizeof (*linuxaio_submits));
388 linuxaio_submitcnt -= submitted;
389 }
390
391 timeout = 0;
392 break;
393 }
394#if EPOLL_FALLBACK
395 else if (errno == EINVAL) 469 if (errno == EINVAL)
396 { 470 {
397 /* This happens for unsupported fds, officially, but in my testing, 471 /* This happens for unsupported fds, officially, but in my testing,
398 * also randomly happens for supported fds. We fall back to good old 472 * also randomly happens for supported fds. We fall back to good old
399 * poll() here, under the assumption that this is a very rare case. 473 * poll() here, under the assumption that this is a very rare case.
400 * See https://lore.kernel.org/patchwork/patch/1047453/ to see 474 * See https://lore.kernel.org/patchwork/patch/1047453/ to see
401 * discussion about such a case (ttys) where polling for POLLIN 475 * discussion about such a case (ttys) where polling for POLLIN
402 * fails but POLLIN|POLLOUT works. 476 * fails but POLLIN|POLLOUT works.
403 */ 477 */
404 struct iocb *iocb = linuxaio_submits [submitted]; 478 struct iocb *iocb = linuxaio_submits [submitted];
405 479 epoll_modify (EV_A_ iocb->aio_fildes, 0, anfds [iocb->aio_fildes].events);
406 linuxaio_rearm_epoll (EV_A_ linuxaio_submits [submitted], EPOLL_CTL_ADD);
407 iocb->aio_reqprio = -1; /* mark iocb as epoll */ 480 iocb->aio_reqprio = -1; /* mark iocb as epoll */
481
482 res = 1; /* skip this iocb - another iocb, another chance */
483 }
484 else if (errno == EAGAIN)
485 {
486 /* This happens when the ring buffer is full, or some other shit we
487 * don't know and isn't documented. Most likely because we have too
488 * many requests and linux aio can't be assed to handle them.
489 * In this case, we try to allocate a larger ring buffer, freeing
490 * ours first. This might fail, in which case we have to fall back to 100%
491 * epoll.
492 * God, how I hate linux not getting its act together. Ever.
493 */
494 evsys_io_destroy (linuxaio_ctx);
495 linuxaio_submitcnt = 0;
496
497 /* rearm all fds with active iocbs */
498 {
499 int fd;
500 for (fd = 0; fd < linuxaio_iocbpmax; ++fd)
501 if (linuxaio_iocbps [fd]->io.aio_buf)
502 linuxaio_fd_rearm (EV_A_ fd);
503 }
504
505 ++linuxaio_iteration;
506 if (linuxaio_io_setup (EV_A) < 0)
507 {
508 /* TODO: rearm all and recreate epoll backend from scratch */
509 /* TODO: might be more prudent? */
510
511 /* to bad, we can't get a new aio context, go 100% epoll */
512 linuxaio_free_iocbp (EV_A);
513 ev_io_stop (EV_A_ &linuxaio_epoll_w);
514 ev_ref (EV_A);
515 linuxaio_ctx = 0;
516
517 backend = EVBACKEND_EPOLL;
518 backend_modify = epoll_modify;
519 backend_poll = epoll_poll;
520 }
521
522 timeout = EV_TS_CONST (0.);
523 /* it's easiest to handle this mess in another iteration */
524 return;
525 }
526 else if (errno == EBADF)
527 {
528 assert (("libev: event loop rejected bad fd", errno != EBADF));
529 fd_kill (EV_A_ linuxaio_submits [submitted]->aio_fildes);
408 530
409 res = 1; /* skip this iocb */ 531 res = 1; /* skip this iocb */
410 } 532 }
411#endif 533 else if (errno == EINTR) /* not seen in reality, not documented */
412 else if (errno == EBADF) 534 res = 0; /* silently ignore and retry */
535 else
413 { 536 {
414 fd_kill (EV_A_ linuxaio_submits [submitted]->aio_fildes); 537 ev_syserr ("(libev) linuxaio io_submit");
415 538 res = 0;
416 res = 1; /* skip this iocb */
417 } 539 }
418 else
419 ev_syserr ("(libev) linuxaio io_submit");
420 540
421 submitted += res; 541 submitted += res;
422 } 542 }
423 543
424 linuxaio_submitcnt = 0; 544 linuxaio_submitcnt = 0;
… …
432int 552int
433linuxaio_init (EV_P_ int flags) 553linuxaio_init (EV_P_ int flags)
434{ 554{
435 /* would be great to have a nice test for IOCB_CMD_POLL instead */ 555 /* would be great to have a nice test for IOCB_CMD_POLL instead */
436 /* also: test some semi-common fd types, such as files and ttys in recommended_backends */ 556 /* also: test some semi-common fd types, such as files and ttys in recommended_backends */
437#if EPOLL_FALLBACK 557 /* 4.18 introduced IOCB_CMD_POLL, 4.19 made epoll work, and we need that */
438 /* 4.19 made epoll work */
439 if (ev_linux_version () < 0x041300) 558 if (ev_linux_version () < 0x041300)
440 return 0; 559 return 0;
441#else 560
442 /* 4.18 introduced IOCB_CMD_POLL */ 561 if (!epoll_init (EV_A_ 0))
443 if (ev_linux_version () < 0x041200)
444 return 0; 562 return 0;
445#endif
446 563
447 linuxaio_ctx = 0; 564 linuxaio_iteration = 0;
448 if (evsys_io_setup (EV_LINUXAIO_DEPTH, &linuxaio_ctx) < 0)
449 return 0;
450 565
451#if EPOLL_FALLBACK 566 if (linuxaio_io_setup (EV_A) < 0)
452 backend_fd = ev_epoll_create ();
453 if (backend_fd < 0)
454 { 567 {
455 evsys_io_destroy (linuxaio_ctx); 568 epoll_destroy (EV_A);
456 return 0; 569 return 0;
457 } 570 }
458 571
459 ev_io_init (EV_A_ &linuxaio_epoll_w, linuxaio_epoll_cb, backend_fd, EV_READ); 572 ev_io_init (&linuxaio_epoll_w, linuxaio_epoll_cb, backend_fd, EV_READ);
460 ev_set_priority (&linuxaio_epoll_w, EV_MAXPRI); 573 ev_set_priority (&linuxaio_epoll_w, EV_MAXPRI);
461 ev_io_start (EV_A_ &linuxaio_epoll_w); 574 ev_io_start (EV_A_ &linuxaio_epoll_w);
462 ev_unref (EV_A); /* watcher should not keep loop alive */ 575 ev_unref (EV_A); /* watcher should not keep loop alive */
463#endif
464 576
465 backend_modify = linuxaio_modify; 577 backend_modify = linuxaio_modify;
466 backend_poll = linuxaio_poll; 578 backend_poll = linuxaio_poll;
467 579
468 linuxaio_iocbpmax = 0; 580 linuxaio_iocbpmax = 0;
469 linuxaio_iocbps = 0; 581 linuxaio_iocbps = 0;
470 582
471 linuxaio_submits = 0; 583 linuxaio_submits = 0;
… …
477 589
478inline_size 590inline_size
479void 591void
480linuxaio_destroy (EV_P) 592linuxaio_destroy (EV_P)
481{ 593{
482#if EPOLL_FALLBACK 594 epoll_destroy (EV_A);
483 close (backend_fd);
484#endif
485 linuxaio_free_iocbp (EV_A); 595 linuxaio_free_iocbp (EV_A);
486 evsys_io_destroy (linuxaio_ctx); 596 evsys_io_destroy (linuxaio_ctx); /* fails in child, aio context is destroyed */
487} 597}
488 598
489inline_size 599ecb_cold
490void 600static void
491linuxaio_fork (EV_P) 601linuxaio_fork (EV_P)
492{ 602{
493 /* this frees all iocbs, which is very heavy-handed */
494 linuxaio_destroy (EV_A);
495 linuxaio_submitcnt = 0; /* all pointers were invalidated */ 603 linuxaio_submitcnt = 0; /* all pointers were invalidated */
604 linuxaio_free_iocbp (EV_A); /* this frees all iocbs, which is very heavy-handed */
605 evsys_io_destroy (linuxaio_ctx); /* fails in child, aio context is destroyed */
496 606
497 linuxaio_ctx = 0; 607 linuxaio_iteration = 0; /* we start over in the child */
498 while (evsys_io_setup (EV_LINUXAIO_DEPTH, &linuxaio_ctx) < 0) 608
609 while (linuxaio_io_setup (EV_A) < 0)
499 ev_syserr ("(libev) linuxaio io_setup"); 610 ev_syserr ("(libev) linuxaio io_setup");
500 611
501#if EPOLL_FALLBACK 612 /* forking epoll should also effectively unregister all fds from the backend */
502 while ((backend_fd = ev_epoll_create ()) < 0) 613 epoll_fork (EV_A);
503 ev_syserr ("(libev) linuxaio epoll_create"); 614 /* epoll_fork already did this. hopefully */
615 /*fd_rearm_all (EV_A);*/
504 616
505 ev_io_stop (EV_A_ &linuxaio_epoll_w); 617 ev_io_stop (EV_A_ &linuxaio_epoll_w);
506 ev_io_init (EV_A_ &linuxaio_epoll_w, linuxaio_epoll_cb, backend_fd, EV_READ); 618 ev_io_set (EV_A_ &linuxaio_epoll_w, backend_fd, EV_READ);
507 ev_io_start (EV_A_ &linuxaio_epoll_w); 619 ev_io_start (EV_A_ &linuxaio_epoll_w);
508#endif
509
510 fd_rearm_all (EV_A);
511} 620}
512 621

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines