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.1 by root, Thu Jun 20 22:44:59 2019 UTC vs.
Revision 1.30 by root, Tue Jun 25 17:54:02 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/*
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 */
86
40#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 */
88#include <poll.h>
41#include <linux/aio_abi.h> 89#include <linux/aio_abi.h>
42 90
43/* we try to fill 4kn pages exactly. 91/*****************************************************************************/
44 * the ring buffer header is 32 bytes, every io event is 32 bytes. 92/* syscall wrapdadoop - this section has the raw api/abi definitions */
45 * the kernel takes the io event number, doubles it, adds 2, adds the ring buffer 93
46 * so the calculation below will use "exactly" 8kB for the ring buffer 94#include <sys/syscall.h> /* no glibc wrappers */
95
96/* aio_abi.h is not versioned in any way, so we cannot test for its existance */
97#define IOCB_CMD_POLL 5
98
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.
47 */ 103 */
48#define EV_LINUXAIO_DEPTH (256 / 2 - 2 - 1) /* max. number of io events per batch */
49
50/*****************************************************************************/
51/* syscall wrapdadoop */
52
53#include <sys/syscall.h> /* no glibc wrappers */
54
55/* aio_abi.h is not verioned in any way, so we cannot test for its existance */
56#define IOCB_CMD_POLL 5
57
58/* taken from linux/fs/aio.c */
59#define AIO_RING_MAGIC 0xa10a10a1 104#define AIO_RING_MAGIC 0xa10a10a1
60#define AIO_RING_INCOMPAT_FEATURES 0 105#define AIO_RING_INCOMPAT_FEATURES 0
61struct aio_ring 106struct aio_ring
62{ 107{
63 unsigned id; /* kernel internal index number */ 108 unsigned id; /* kernel internal index number */
… …
71 unsigned header_length; /* size of aio_ring */ 116 unsigned header_length; /* size of aio_ring */
72 117
73 struct io_event io_events[0]; 118 struct io_event io_events[0];
74}; 119};
75 120
76static int 121/*
122 * define some syscall wrappers for common architectures
123 * this is mostly for nice looks during debugging, not performance.
124 * our syscalls return < 0, not == -1, on error. which is good
125 * enough for linux aio.
126 * TODO: arm is also common nowadays, maybe even mips and x86
127 * TODO: after implementing this, it suddenly looks like overkill, but its hard to remove...
128 */
129#if __GNUC__ && __linux && ECB_AMD64
130
131 #define ev_syscall(nr,narg,arg1,arg2,arg3,arg4,arg5) \
132 ({ \
133 long res; \
134 register unsigned long r5 __asm__ ("r8" ); \
135 register unsigned long r4 __asm__ ("r10"); \
136 register unsigned long r3 __asm__ ("rdx"); \
137 register unsigned long r2 __asm__ ("rsi"); \
138 register unsigned long r1 __asm__ ("rdi"); \
139 if (narg >= 5) r5 = (unsigned long)(arg5); \
140 if (narg >= 4) r4 = (unsigned long)(arg4); \
141 if (narg >= 3) r3 = (unsigned long)(arg3); \
142 if (narg >= 2) r2 = (unsigned long)(arg2); \
143 if (narg >= 1) r1 = (unsigned long)(arg1); \
144 __asm__ __volatile__ ( \
145 "syscall\n\t" \
146 : "=a" (res) \
147 : "0" (nr), "r" (r1), "r" (r2), "r" (r3), "r" (r4), "r" (r5) \
148 : "cc", "r11", "cx", "memory"); \
149 errno = -res; \
150 res; \
151 })
152
153#endif
154
155#ifdef ev_syscall
156 #define ev_syscall0(nr) ev_syscall (nr, 0, 0, 0, 0, 0, 0
157 #define ev_syscall1(nr,arg1) ev_syscall (nr, 1, arg1, 0, 0, 0, 0)
158 #define ev_syscall2(nr,arg1,arg2) ev_syscall (nr, 2, arg1, arg2, 0, 0, 0)
159 #define ev_syscall3(nr,arg1,arg2,arg3) ev_syscall (nr, 3, arg1, arg2, arg3, 0, 0)
160 #define ev_syscall4(nr,arg1,arg2,arg3,arg4) ev_syscall (nr, 3, arg1, arg2, arg3, arg4, 0)
161 #define ev_syscall5(nr,arg1,arg2,arg3,arg4,arg5) ev_syscall (nr, 5, arg1, arg2, arg3, arg4, arg5)
162#else
163 #define ev_syscall0(nr) syscall (nr)
164 #define ev_syscall1(nr,arg1) syscall (nr, arg1)
165 #define ev_syscall2(nr,arg1,arg2) syscall (nr, arg1, arg2)
166 #define ev_syscall3(nr,arg1,arg2,arg3) syscall (nr, arg1, arg2, arg3)
167 #define ev_syscall4(nr,arg1,arg2,arg3,arg4) syscall (nr, arg1, arg2, arg3, arg4)
168 #define ev_syscall5(nr,arg1,arg2,arg3,arg4,arg5) syscall (nr, arg1, arg2, arg3, arg4, arg5)
169#endif
170
171inline_size
172int
77ev_io_setup (unsigned nr_events, aio_context_t *ctx_idp) 173evsys_io_setup (unsigned nr_events, aio_context_t *ctx_idp)
78{ 174{
79 return syscall (SYS_io_setup, nr_events, ctx_idp); 175 return ev_syscall2 (SYS_io_setup, nr_events, ctx_idp);
80} 176}
81 177
82static int 178inline_size
179int
83ev_io_destroy (aio_context_t ctx_id) 180evsys_io_destroy (aio_context_t ctx_id)
84{ 181{
85 return syscall (SYS_io_destroy, ctx_id); 182 return ev_syscall1 (SYS_io_destroy, ctx_id);
86} 183}
87 184
88static int 185inline_size
186int
89ev_io_submit (aio_context_t ctx_id, long nr, struct iocb *cbp[]) 187evsys_io_submit (aio_context_t ctx_id, long nr, struct iocb *cbp[])
90{ 188{
91 return syscall (SYS_io_submit, ctx_id, nr, cbp); 189 return ev_syscall3 (SYS_io_submit, ctx_id, nr, cbp);
92} 190}
93 191
94static int 192inline_size
193int
95ev_io_cancel (aio_context_t ctx_id, struct iocb *cbp, struct io_event *result) 194evsys_io_cancel (aio_context_t ctx_id, struct iocb *cbp, struct io_event *result)
96{ 195{
97 return syscall (SYS_io_cancel, ctx_id, cbp, result); 196 return ev_syscall3 (SYS_io_cancel, ctx_id, cbp, result);
98} 197}
99 198
100static int 199inline_size
200int
101ev_io_getevents (aio_context_t ctx_id, long min_nr, long nr, struct io_event *events, struct timespec *timeout) 201evsys_io_getevents (aio_context_t ctx_id, long min_nr, long nr, struct io_event *events, struct timespec *timeout)
102{ 202{
103 return syscall (SYS_io_getevents, ctx_id, min_nr, nr, events, timeout); 203 return ev_syscall5 (SYS_io_getevents, ctx_id, min_nr, nr, events, timeout);
104} 204}
105
106typedef void (*ev_io_cb) (long nr, struct io_event *events);
107 205
108/*****************************************************************************/ 206/*****************************************************************************/
109/* actual backed implementation */ 207/* actual backed implementation */
110 208
111/* two iocbs for every fd, one for read, one for write */ 209ecb_cold
210static int
211linuxaio_nr_events (EV_P)
212{
213 /* we start with 16 iocbs and incraese from there
214 * that's tiny, but the kernel has a rather low system-wide
215 * limit that can be reached quickly, so let's be parsimonious
216 * with this resource.
217 * Rest assured, the kernel generously rounds up small and big numbers
218 * in different ways (but doesn't seem to charge you for it).
219 * The 15 here is because the kernel usually has a power of two as aio-max-nr,
220 * and this helps to take advantage of that limit.
221 */
222
223 /* we try to fill 4kB pages exactly.
224 * the ring buffer header is 32 bytes, every io event is 32 bytes.
225 * the kernel takes the io requests number, doubles it, adds 2
226 * and adds the ring buffer.
227 * the way we use this is by starting low, and then roughly doubling the
228 * size each time we hit a limit.
229 */
230
231 int requests = 15 << linuxaio_iteration;
232 int one_page = (4096
233 / sizeof (struct io_event) ) / 2; /* how many fit into one page */
234 int first_page = ((4096 - sizeof (struct aio_ring))
235 / sizeof (struct io_event) - 2) / 2; /* how many fit into the first page */
236
237 /* if everything fits into one page, use count exactly */
238 if (requests > first_page)
239 /* otherwise, round down to full pages and add the first page */
240 requests = requests / one_page * one_page + first_page;
241
242 return requests;
243}
244
245/* we use out own wrapper structure in case we ever want to do something "clever" */
112typedef struct aniocb 246typedef struct aniocb
113{ 247{
114 struct iocb io; 248 struct iocb io;
115 /*int inuse;*/ 249 /*int inuse;*/
116} *ANIOCBP; 250} *ANIOCBP;
117 251
118inline_size 252inline_size
119void 253void
120linuxaio_array_needsize_iocbp (ANIOCBP *base, int count) 254linuxaio_array_needsize_iocbp (ANIOCBP *base, int offset, int count)
121{ 255{
122 /* TODO: quite the overhead to allocate every iocb separately */
123 while (count--) 256 while (count--)
124 { 257 {
258 /* TODO: quite the overhead to allocate every iocb separately, maybe use our own allocator? */
125 *base = (ANIOCBP)ev_malloc (sizeof (**base)); 259 ANIOCBP iocb = (ANIOCBP)ev_malloc (sizeof (*iocb));
260
261 /* full zero initialise is probably not required at the moment, but
262 * this is not well documented, so we better do it.
263 */
126 memset (*base, 0, sizeof (**base)); 264 memset (iocb, 0, sizeof (*iocb));
127 /* would be nice to initialize fd/data as well */ 265
128 (*base)->io.aio_lio_opcode = IOCB_CMD_POLL; 266 iocb->io.aio_lio_opcode = IOCB_CMD_POLL;
129 ++base; 267 iocb->io.aio_data = offset;
130 } 268 iocb->io.aio_fildes = offset;
131}
132 269
270 base [offset++] = iocb;
271 }
272}
273
274ecb_cold
133static void 275static void
134linuxaio_free_iocbp (EV_P) 276linuxaio_free_iocbp (EV_P)
135{ 277{
136 while (linuxaio_iocbpmax--) 278 while (linuxaio_iocbpmax--)
137 ev_free (linuxaio_iocbps [linuxaio_iocbpmax]); 279 ev_free (linuxaio_iocbps [linuxaio_iocbpmax]);
138 280
139 linuxaio_iocbpmax = 0; 281 linuxaio_iocbpmax = 0; /* next resize will completely reallocate the array, at some overhead */
140} 282}
141 283
142static void 284static void
143linuxaio_modify (EV_P_ int fd, int oev, int nev) 285linuxaio_modify (EV_P_ int fd, int oev, int nev)
144{ 286{
145 /* TODO: full zero initialize required? */
146 array_needsize (ANIOCBP, linuxaio_iocbps, linuxaio_iocbpmax, fd + 1, linuxaio_array_needsize_iocbp); 287 array_needsize (ANIOCBP, linuxaio_iocbps, linuxaio_iocbpmax, fd + 1, linuxaio_array_needsize_iocbp);
147 struct aniocb *iocb = linuxaio_iocbps [fd]; 288 ANIOCBP iocb = linuxaio_iocbps [fd];
289
290 if (iocb->io.aio_reqprio < 0)
291 {
292 /* we handed this fd over to epoll, so undo this first */
293 /* we do it manually because the optimisations on epoll_modfy won't do us any good */
294 epoll_ctl (backend_fd, EPOLL_CTL_DEL, fd, 0);
295 anfds [fd].emask = 0;
296 iocb->io.aio_reqprio = 0;
297 }
148 298
149 if (iocb->io.aio_buf) 299 if (iocb->io.aio_buf)
300 /* io_cancel always returns some error on relevant kernels, but works */
150 ev_io_cancel (linuxaio_ctx, &iocb->io, (void *)0); 301 evsys_io_cancel (linuxaio_ctx, &iocb->io, (struct io_event *)0);
151 302
152 if (nev) 303 if (nev)
153 { 304 {
154 iocb->io.aio_data = fd;
155 iocb->io.aio_fildes = fd;
156 iocb->io.aio_buf = 305 iocb->io.aio_buf =
157 (nev & EV_READ ? POLLIN : 0) 306 (nev & EV_READ ? POLLIN : 0)
158 | (nev & EV_WRITE ? POLLOUT : 0); 307 | (nev & EV_WRITE ? POLLOUT : 0);
159 308
160 /* queue iocb up for io_submit */ 309 /* queue iocb up for io_submit */
161 /* this assumes we only ever get one call per fd per loop iteration */ 310 /* this assumes we only ever get one call per fd per loop iteration */
… …
164 linuxaio_submits [linuxaio_submitcnt - 1] = &iocb->io; 313 linuxaio_submits [linuxaio_submitcnt - 1] = &iocb->io;
165 } 314 }
166} 315}
167 316
168static void 317static void
318linuxaio_epoll_cb (EV_P_ struct ev_io *w, int revents)
319{
320 epoll_poll (EV_A_ 0);
321}
322
323static void
324linuxaio_fd_rearm (EV_P_ int fd)
325{
326 anfds [fd].events = 0;
327 linuxaio_iocbps [fd]->io.aio_buf = 0;
328 fd_change (EV_A_ fd, EV_ANFD_REIFY);
329}
330
331static void
169linuxaio_parse_events (EV_P_ struct io_event *ev, int nr) 332linuxaio_parse_events (EV_P_ struct io_event *ev, int nr)
170{ 333{
171 while (nr) 334 while (nr)
172 { 335 {
173 int fd = ev->data; 336 int fd = ev->data;
174 int res = ev->res; 337 int res = ev->res;
175 338
176 assert (("libev: iocb fd must be in-bounds", fd >= 0 && fd < anfdxmax)); 339 assert (("libev: iocb fd must be in-bounds", fd >= 0 && fd < anfdmax));
177
178 /* linux aio is oneshot: rearm fd */
179 linuxaio_iocbps [fd]->io.aio_buf = 0;
180 anfds [fd].events = 0;
181 fd_change (EV_A_ fd, 0);
182 340
183 /* feed events, we do not expect or handle POLLNVAL */ 341 /* feed events, we do not expect or handle POLLNVAL */
184 if (ecb_expect_false (res & POLLNVAL))
185 fd_kill (EV_A_ fd);
186 else
187 fd_event ( 342 fd_event (
188 EV_A_ 343 EV_A_
189 fd, 344 fd,
190 (res & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 345 (res & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
191 | (res & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 346 | (res & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
192 ); 347 );
348
349 /* linux aio is oneshot: rearm fd. TODO: this does more work than needed */
350 linuxaio_fd_rearm (EV_A_ fd);
193 351
194 --nr; 352 --nr;
195 ++ev; 353 ++ev;
196 } 354 }
197} 355}
198 356
199/* get any events from ringbuffer, return true if any were handled */ 357/* get any events from ring buffer, return true if any were handled */
200static int 358static int
201linuxaio_get_events_from_ring (EV_P) 359linuxaio_get_events_from_ring (EV_P)
202{ 360{
203 struct aio_ring *ring = (struct aio_ring *)linuxaio_ctx; 361 struct aio_ring *ring = (struct aio_ring *)linuxaio_ctx;
204 362
363 /* the kernel reads and writes both of these variables, */
364 /* as a C extension, we assume that volatile use here */
365 /* both makes reads atomic and once-only */
366 unsigned head = *(volatile unsigned *)&ring->head;
367 unsigned tail = *(volatile unsigned *)&ring->tail;
368
369 if (head == tail)
370 return 0;
371
372 /* bail out if the ring buffer doesn't match the expected layout */
373 if (expect_false (ring->magic != AIO_RING_MAGIC)
374 || ring->incompat_features != AIO_RING_INCOMPAT_FEATURES
375 || ring->header_length != sizeof (struct aio_ring)) /* TODO: or use it to find io_event[0]? */
376 return 0;
377
378 /* make sure the events up to tail are visible */
205 ECB_MEMORY_FENCE_ACQUIRE; 379 ECB_MEMORY_FENCE_ACQUIRE;
206
207 unsigned head = ring->head;
208 unsigned tail = *(volatile unsigned *)&ring->tail;
209
210 if (ring->magic != AIO_RING_MAGIC
211 || ring->incompat_features != AIO_RING_INCOMPAT_FEATURES
212 || ring->header_length != sizeof (struct aio_ring) /* TODO: or use it to find io_event[0]? */
213 || head == tail)
214 return 0;
215 380
216 /* parse all available events, but only once, to avoid starvation */ 381 /* parse all available events, but only once, to avoid starvation */
217 if (tail > head) /* normal case around */ 382 if (tail > head) /* normal case around */
218 linuxaio_parse_events (EV_A_ ring->io_events + head, tail - head); 383 linuxaio_parse_events (EV_A_ ring->io_events + head, tail - head);
219 else
220 {
221 /* wrapped around */ 384 else /* wrapped around */
385 {
222 linuxaio_parse_events (EV_A_ ring->io_events + head, ring->nr - head); 386 linuxaio_parse_events (EV_A_ ring->io_events + head, ring->nr - head);
223 linuxaio_parse_events (EV_A_ ring->io_events, tail); 387 linuxaio_parse_events (EV_A_ ring->io_events, tail);
224 } 388 }
225 389
226 ring->head = tail; 390 ECB_MEMORY_FENCE_RELEASE;
391 /* as an extension to C, we hope that the volatile will make this atomic and once-only */
392 *(volatile unsigned *)&ring->head = tail;
227 393
228 return 1; 394 return 1;
229} 395}
230 396
231/* read at least one event from kernel, or timeout */ 397/* read at least one event from kernel, or timeout */
232inline_size 398inline_size
233void 399void
234linuxaio_get_events (EV_P_ ev_tstamp timeout) 400linuxaio_get_events (EV_P_ ev_tstamp timeout)
235{ 401{
236 struct timespec ts; 402 struct timespec ts;
237 struct io_event ioev; 403 struct io_event ioev[1];
238 int res; 404 int res;
239 405
240 if (linuxaio_get_events_from_ring (EV_A)) 406 if (linuxaio_get_events_from_ring (EV_A))
241 return; 407 return;
242 408
243 /* no events, so wait for at least one, then poll ring buffer again */ 409 /* no events, so wait for at least one, then poll ring buffer again */
244 /* this degraded to one event per loop iteration */ 410 /* this degrades to one event per loop iteration */
245 /* if the ring buffer changes layout, but so be it */ 411 /* if the ring buffer changes layout, but so be it */
412
413 EV_RELEASE_CB;
246 414
247 ts.tv_sec = (long)timeout; 415 ts.tv_sec = (long)timeout;
248 ts.tv_nsec = (long)((timeout - ts.tv_sec) * 1e9); 416 ts.tv_nsec = (long)((timeout - ts.tv_sec) * 1e9);
249 417
250 res = ev_io_getevents (linuxaio_ctx, 1, 1, &ioev, &ts); 418 res = evsys_io_getevents (linuxaio_ctx, 1, sizeof (ioev) / sizeof (ioev [0]), ioev, &ts);
419
420 EV_ACQUIRE_CB;
251 421
252 if (res < 0) 422 if (res < 0)
423 if (errno == EINTR)
424 /* ignored */;
425 else
253 ev_syserr ("(libev) io_getevents"); 426 ev_syserr ("(libev) linuxaio io_getevents");
254 else if (res) 427 else if (res)
255 { 428 {
256 /* at least one event received, handle it and any remaining ones in the ring buffer */ 429 /* at least one event received, handle it and any remaining ones in the ring buffer */
257 linuxaio_parse_events (EV_A_ &ioev, 1); 430 linuxaio_parse_events (EV_A_ ioev, res);
258 linuxaio_get_events_from_ring (EV_A); 431 linuxaio_get_events_from_ring (EV_A);
259 } 432 }
433}
434
435static int
436linuxaio_io_setup (EV_P)
437{
438 linuxaio_ctx = 0;
439 return evsys_io_setup (linuxaio_nr_events (EV_A), &linuxaio_ctx);
260} 440}
261 441
262static void 442static void
263linuxaio_poll (EV_P_ ev_tstamp timeout) 443linuxaio_poll (EV_P_ ev_tstamp timeout)
264{ 444{
… …
266 446
267 /* first phase: submit new iocbs */ 447 /* first phase: submit new iocbs */
268 448
269 /* io_submit might return less than the requested number of iocbs */ 449 /* io_submit might return less than the requested number of iocbs */
270 /* this is, afaics, only because of errors, but we go by the book and use a loop, */ 450 /* this is, afaics, only because of errors, but we go by the book and use a loop, */
271 /* which allows us to pinpoint the errornous iocb */ 451 /* which allows us to pinpoint the erroneous iocb */
272 for (submitted = 0; submitted < linuxaio_submitcnt; ) 452 for (submitted = 0; submitted < linuxaio_submitcnt; )
273 { 453 {
274 int res = ev_io_submit (linuxaio_ctx, linuxaio_submitcnt - submitted, linuxaio_submits + submitted); 454 int res = evsys_io_submit (linuxaio_ctx, linuxaio_submitcnt - submitted, linuxaio_submits + submitted);
275 455
276 if (res < 0) 456 if (expect_false (res < 0))
277 if (errno == EAGAIN) 457 if (errno == EINVAL)
278 { 458 {
279 /* This happens when the ring buffer is full, at least. I assume this means 459 /* This happens for unsupported fds, officially, but in my testing,
280 * that the event was queued synchronously during io_submit, and thus 460 * also randomly happens for supported fds. We fall back to good old
281 * the buffer overflowd. 461 * poll() here, under the assumption that this is a very rare case.
282 * In this case, we just try next loop iteration. 462 * See https://lore.kernel.org/patchwork/patch/1047453/ to see
463 * discussion about such a case (ttys) where polling for POLLIN
464 * fails but POLLIN|POLLOUT works.
283 */ 465 */
284 memcpy (linuxaio_submits, linuxaio_submits + submitted, (linuxaio_submitcnt - submitted) * sizeof (*linuxaio_submits)); 466 struct iocb *iocb = linuxaio_submits [submitted];
467 epoll_modify (EV_A_ iocb->aio_fildes, 0, anfds [iocb->aio_fildes].events);
468 iocb->aio_reqprio = -1; /* mark iocb as epoll */
469
470 res = 1; /* skip this iocb - another iocb, another chance */
471 }
472 else if (errno == EAGAIN)
473 {
474 /* This happens when the ring buffer is full, or some other shit we
475 * don't know and isn't documented. Most likely because we have too
476 * many requests and linux aio can't be assed to handle them.
477 * In this case, we try to allocate a larger ring buffer, freeing
478 * ours first. This might fail, in which case we have to fall back to 100%
479 * epoll.
480 * God, how I hate linux not getting its act together. Ever.
481 */
482 evsys_io_destroy (linuxaio_ctx);
285 linuxaio_submitcnt -= submitted; 483 linuxaio_submitcnt = 0;
484
485 /* rearm all fds with active iocbs */
486 {
487 int fd;
488 for (fd = 0; fd < linuxaio_iocbpmax; ++fd)
489 if (linuxaio_iocbps [fd]->io.aio_buf)
490 linuxaio_fd_rearm (EV_A_ fd);
491 }
492
493 ++linuxaio_iteration;
494 if (linuxaio_io_setup (EV_A) < 0)
495 {
496 /* to bad, we can't get a new aio context, go 100% epoll */
497 linuxaio_free_iocbp (EV_A);
498 ev_io_stop (EV_A_ &linuxaio_epoll_w);
499 ev_ref (EV_A);
500 linuxaio_ctx = 0;
501 backend_modify = epoll_modify;
502 backend_poll = epoll_poll;
503 }
504
286 timeout = 0; 505 timeout = 0;
506 /* it's easiest to handle this mess in another iteration */
287 break; 507 return;
508 }
509 else if (errno == EBADF)
510 {
511 fd_kill (EV_A_ linuxaio_submits [submitted]->aio_fildes);
512
513 res = 1; /* skip this iocb */
288 } 514 }
289 else 515 else
290 /* TODO: we get EAGAIN when the ring buffer is full for some reason */
291 /* TODO: should we always just try next time? */
292 ev_syserr ("(libev) io_submit"); 516 ev_syserr ("(libev) linuxaio io_submit");
293 517
294 submitted += res; 518 submitted += res;
295 } 519 }
296 520
297 linuxaio_submitcnt = 0; 521 linuxaio_submitcnt = 0;
… …
304inline_size 528inline_size
305int 529int
306linuxaio_init (EV_P_ int flags) 530linuxaio_init (EV_P_ int flags)
307{ 531{
308 /* would be great to have a nice test for IOCB_CMD_POLL instead */ 532 /* would be great to have a nice test for IOCB_CMD_POLL instead */
309 if (ev_linux_version () < 0x041200) /* 4.18 introduced IOCB_CMD_POLL */ 533 /* also: test some semi-common fd types, such as files and ttys in recommended_backends */
534 /* 4.18 introduced IOCB_CMD_POLL, 4.19 made epoll work, and we need that */
535 if (ev_linux_version () < 0x041300)
310 return 0; 536 return 0;
311 537
312 if (ev_io_setup (EV_LINUXAIO_DEPTH, &linuxaio_ctx) < 0) 538 if (!epoll_init (EV_A_ 0))
313 return 0; 539 return 0;
540
541 linuxaio_iteration = 0;
542
543 if (linuxaio_io_setup (EV_A) < 0)
544 {
545 epoll_destroy (EV_A);
546 return 0;
547 }
548
549 ev_io_init (EV_A_ &linuxaio_epoll_w, linuxaio_epoll_cb, backend_fd, EV_READ);
550 ev_set_priority (&linuxaio_epoll_w, EV_MAXPRI);
551 ev_io_start (EV_A_ &linuxaio_epoll_w);
552 ev_unref (EV_A); /* watcher should not keep loop alive */
314 553
315 backend_modify = linuxaio_modify; 554 backend_modify = linuxaio_modify;
316 backend_poll = linuxaio_poll; 555 backend_poll = linuxaio_poll;
317 556
318 linuxaio_iocbpmax = 0; 557 linuxaio_iocbpmax = 0;
… …
327 566
328inline_size 567inline_size
329void 568void
330linuxaio_destroy (EV_P) 569linuxaio_destroy (EV_P)
331{ 570{
571 epoll_destroy (EV_A);
332 linuxaio_free_iocbp (EV_A); 572 linuxaio_free_iocbp (EV_A);
333 ev_io_destroy (linuxaio_ctx); 573 evsys_io_destroy (linuxaio_ctx);
334} 574}
335 575
336inline_size 576inline_size
337void 577void
338linuxaio_fork (EV_P) 578linuxaio_fork (EV_P)
339{ 579{
340 abort ();//D 580 /* this frees all iocbs, which is very heavy-handed */
341} 581 linuxaio_destroy (EV_A);
582 linuxaio_submitcnt = 0; /* all pointers were invalidated */
342 583
584 linuxaio_iteration = 0; /* we start over in the child */
585
586 while (linuxaio_io_setup (EV_A) < 0)
587 ev_syserr ("(libev) linuxaio io_setup");
588
589 epoll_fork (EV_A);
590
591 ev_io_stop (EV_A_ &linuxaio_epoll_w);
592 ev_io_set (EV_A_ &linuxaio_epoll_w, backend_fd, EV_READ);
593 ev_io_start (EV_A_ &linuxaio_epoll_w);
594
595 /* epoll_fork already did this. hopefully */
596 /*fd_rearm_all (EV_A);*/
597}
598

Diff Legend

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