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

Comparing libev/ev_iouring.c (file contents):
Revision 1.8 by root, Fri Dec 27 16:08:24 2019 UTC vs.
Revision 1.17 by root, Sat Dec 28 07:39:18 2019 UTC

80 * k) overall, the *API* itself is, I dare to say, not a total trainwreck. 80 * k) overall, the *API* itself is, I dare to say, not a total trainwreck.
81 * the big isuess with it are the bugs requiring epoll, which might 81 * the big isuess with it are the bugs requiring epoll, which might
82 * or might not get fixed (do I hold my breath?). 82 * or might not get fixed (do I hold my breath?).
83 */ 83 */
84 84
85/* TODO: use internal TIMEOUT */
86/* TODO: take advantage of single mmap, NODROP etc. */
87/* TODO: resize cq/sq size independently */
88
85#include <sys/timerfd.h> 89#include <sys/timerfd.h>
86#include <sys/mman.h> 90#include <sys/mman.h>
87#include <poll.h> 91#include <poll.h>
92#include <stdint.h>
88 93
89#define IOURING_INIT_ENTRIES 32 94#define IOURING_INIT_ENTRIES 32
90 95
91/*****************************************************************************/ 96/*****************************************************************************/
92/* syscall wrapdadoop - this section has the raw api/abi definitions */ 97/* syscall wrapdadoop - this section has the raw api/abi definitions */
169 __u32 resv[4]; 174 __u32 resv[4];
170 struct io_sqring_offsets sq_off; 175 struct io_sqring_offsets sq_off;
171 struct io_cqring_offsets cq_off; 176 struct io_cqring_offsets cq_off;
172}; 177};
173 178
179#define IORING_SETUP_CQSIZE 0x00000008
180
174#define IORING_OP_POLL_ADD 6 181#define IORING_OP_POLL_ADD 6
175#define IORING_OP_POLL_REMOVE 7 182#define IORING_OP_POLL_REMOVE 7
183#define IORING_OP_TIMEOUT 11
184#define IORING_OP_TIMEOUT_REMOVE 12
185
186/* relative or absolute, reference clock is CLOCK_MONOTONIC */
187struct iouring_kernel_timespec
188{
189 int64_t tv_sec;
190 long long tv_nsec;
191};
192
193#define IORING_TIMEOUT_ABS 0x00000001
176 194
177#define IORING_ENTER_GETEVENTS 0x01 195#define IORING_ENTER_GETEVENTS 0x01
178 196
179#define IORING_OFF_SQ_RING 0x00000000ULL 197#define IORING_OFF_SQ_RING 0x00000000ULL
180#define IORING_OFF_CQ_RING 0x08000000ULL 198#define IORING_OFF_CQ_RING 0x08000000ULL
181#define IORING_OFF_SQES 0x10000000ULL 199#define IORING_OFF_SQES 0x10000000ULL
182 200
183#define IORING_FEAT_SINGLE_MMAP 0x1 201#define IORING_FEAT_SINGLE_MMAP 0x00000001
184#define IORING_FEAT_NODROP 0x2 202#define IORING_FEAT_NODROP 0x00000002
185#define IORING_FEAT_SUBMIT_STABLE 0x4 203#define IORING_FEAT_SUBMIT_STABLE 0x00000004
186 204
187inline_size 205inline_size
188int 206int
189evsys_io_uring_setup (unsigned entries, struct io_uring_params *params) 207evsys_io_uring_setup (unsigned entries, struct io_uring_params *params)
190{ 208{
210 228
211/* the submit/completion queue entries */ 229/* the submit/completion queue entries */
212#define EV_SQES ((struct io_uring_sqe *) iouring_sqes) 230#define EV_SQES ((struct io_uring_sqe *) iouring_sqes)
213#define EV_CQES ((struct io_uring_cqe *)((char *)iouring_cq_ring + iouring_cq_cqes)) 231#define EV_CQES ((struct io_uring_cqe *)((char *)iouring_cq_ring + iouring_cq_cqes))
214 232
233inline_speed
234int
235iouring_enter (EV_P_ ev_tstamp timeout)
236{
237 int res;
238
239 EV_RELEASE_CB;
240
241 res = evsys_io_uring_enter (iouring_fd, iouring_to_submit, 1,
242 timeout > EV_TS_CONST (0.) ? IORING_ENTER_GETEVENTS : 0, 0, 0);
243
244 assert (("libev: io_uring_enter did not consume all sqes", (res < 0 || res == iouring_to_submit)));
245
246 iouring_to_submit = 0;
247
248 EV_ACQUIRE_CB;
249
250 return res;
251}
252
253/* TODO: can we move things around so we don't need this forward-reference? */
254static void
255iouring_poll (EV_P_ ev_tstamp timeout);
256
215static 257static
216struct io_uring_sqe * 258struct io_uring_sqe *
217iouring_sqe_get (EV_P) 259iouring_sqe_get (EV_P)
218{ 260{
261 unsigned tail;
262
263 for (;;)
264 {
219 unsigned tail = EV_SQ_VAR (tail); 265 tail = EV_SQ_VAR (tail);
220 266
221 if (tail + 1 - EV_SQ_VAR (head) > EV_SQ_VAR (ring_entries)) 267 if (ecb_expect_true (tail + 1 - EV_SQ_VAR (head) <= EV_SQ_VAR (ring_entries)))
268 break; /* whats the problem, we have free sqes */
269
270 /* queue full, need to flush and possibly handle some events */
271
272#if EV_FEATURE_CODE
273 /* first we ask the kernel nicely, most often this frees up some sqes */
274 int res = iouring_enter (EV_A_ EV_TS_CONST (0.));
275
276 ECB_MEMORY_FENCE_ACQUIRE; /* better safe than sorry */
277
278 if (res >= 0)
279 continue; /* yes, it worked, try again */
280#endif
281
282 /* some problem, possibly EBUSY - do the full poll and let it handle any issues */
283
284 iouring_poll (EV_A_ EV_TS_CONST (0.));
285 /* iouring_poll should have done ECB_MEMORY_FENCE_ACQUIRE for us */
222 { 286 }
223 /* queue full, flush */
224 evsys_io_uring_enter (iouring_fd, iouring_to_submit, 0, 0, 0, 0);
225 iouring_to_submit = 0;
226 }
227 287
228 assert (("libev: io_uring queue full after flush", tail + 1 - EV_SQ_VAR (head) <= EV_SQ_VAR (ring_entries))); 288 /*assert (("libev: io_uring queue full after flush", tail + 1 - EV_SQ_VAR (head) <= EV_SQ_VAR (ring_entries)));*/
229 289
230 return EV_SQES + (tail & EV_SQ_VAR (ring_mask)); 290 return EV_SQES + (tail & EV_SQ_VAR (ring_mask));
231} 291}
232 292
233inline_size 293inline_size
285 iouring_tfd = -1; 345 iouring_tfd = -1;
286 iouring_sq_ring = MAP_FAILED; 346 iouring_sq_ring = MAP_FAILED;
287 iouring_cq_ring = MAP_FAILED; 347 iouring_cq_ring = MAP_FAILED;
288 iouring_sqes = MAP_FAILED; 348 iouring_sqes = MAP_FAILED;
289 349
350 if (!have_monotonic) /* cannot really happen, but what if11 */
351 return -1;
352
290 for (;;) 353 for (;;)
291 { 354 {
292 iouring_fd = evsys_io_uring_setup (iouring_entries, &params); 355 iouring_fd = evsys_io_uring_setup (iouring_entries, &params);
293 356
294 if (iouring_fd >= 0) 357 if (iouring_fd >= 0)
295 break; /* yippie */ 358 break; /* yippie */
296 359
297 if (errno != EINVAL) 360 if (errno != EINVAL)
298 return -1; /* we failed */ 361 return -1; /* we failed */
362
363#if TODO
364 if ((~params.features) & (IORING_FEAT_NODROP | IORING_FEATURE_SINGLE_MMAP | IORING_FEAT_SUBMIT_STABLE))
365 return -1; /* we require the above features */
366#endif
299 367
300 /* EINVAL: lots of possible reasons, but maybe 368 /* EINVAL: lots of possible reasons, but maybe
301 * it is because we hit the unqueryable hardcoded size limit 369 * it is because we hit the unqueryable hardcoded size limit
302 */ 370 */
303 371
374 { 442 {
375 /* we assume the sqe's are all "properly" initialised */ 443 /* we assume the sqe's are all "properly" initialised */
376 struct io_uring_sqe *sqe = iouring_sqe_get (EV_A); 444 struct io_uring_sqe *sqe = iouring_sqe_get (EV_A);
377 sqe->opcode = IORING_OP_POLL_REMOVE; 445 sqe->opcode = IORING_OP_POLL_REMOVE;
378 sqe->fd = fd; 446 sqe->fd = fd;
447 /* Jens Axboe notified me that user_data is not what is documented, but is
448 * some kind of unique ID that has to match, otherwise the request cannot
449 * be removed. Since we don't *really* have that, we pass in the old
450 * generation counter - if that fails, too bad, it will hopefully be removed
451 * at close time and then be ignored. */
452 sqe->addr = (uint32_t)fd | ((__u64)(uint32_t)anfds [fd].egen << 32);
379 sqe->user_data = -1; 453 sqe->user_data = (uint64_t)-1;
380 iouring_sqe_submit (EV_A_ sqe); 454 iouring_sqe_submit (EV_A_ sqe);
381 455
382 /* increment generation counter to avoid handling old events */ 456 /* increment generation counter to avoid handling old events */
383 ++anfds [fd].egen; 457 ++anfds [fd].egen;
384 } 458 }
425{ 499{
426 int fd = cqe->user_data & 0xffffffffU; 500 int fd = cqe->user_data & 0xffffffffU;
427 uint32_t gen = cqe->user_data >> 32; 501 uint32_t gen = cqe->user_data >> 32;
428 int res = cqe->res; 502 int res = cqe->res;
429 503
430 /* ignore fd removal events, if there are any. TODO: verify */ 504 /* user_data -1 is a remove that we are not atm. interested in */
431 if (cqe->user_data == (__u64)-1) 505 if (cqe->user_data == (uint64_t)-1)
432 abort ();//D 506 return;
433 507
434 assert (("libev: io_uring fd must be in-bounds", fd >= 0 && fd < anfdmax)); 508 assert (("libev: io_uring fd must be in-bounds", fd >= 0 && fd < anfdmax));
435 509
436 /* documentation lies, of course. the result value is NOT like 510 /* documentation lies, of course. the result value is NOT like
437 * normal syscalls, but like linux raw syscalls, i.e. negative 511 * normal syscalls, but like linux raw syscalls, i.e. negative
438 * error numbers. fortunate, as otherwise there would be no way 512 * error numbers. fortunate, as otherwise there would be no way
439 * to get error codes at all. still, why not document this? 513 * to get error codes at all. still, why not document this?
440 */ 514 */
441 515
442 /* ignore event if generation doesn't match */ 516 /* ignore event if generation doesn't match */
517 /* other than skipping removal events, */
443 /* this should actually be very rare */ 518 /* this should actually be very rare */
444 if (ecb_expect_false (gen != (uint32_t)anfds [fd].egen)) 519 if (ecb_expect_false (gen != (uint32_t)anfds [fd].egen))
445 return; 520 return;
446 521
447 if (ecb_expect_false (res < 0)) 522 if (ecb_expect_false (res < 0))
448 { 523 {
449 //TODO: EINVAL handling (was something failed with this fd) 524 /*TODO: EINVAL handling (was something failed with this fd)*/
450 //TODO: EBUSY happens when? 525 /*TODO: EBUSY happens when?*/
451 526
452 if (res == -EBADF) 527 if (res == -EBADF)
453 { 528 {
454 assert (("libev: event loop rejected bad fd", res != -EBADF)); 529 assert (("libev: event loop rejected bad fd", res != -EBADF));
455 fd_kill (EV_A_ fd); 530 fd_kill (EV_A_ fd);
483iouring_overflow (EV_P) 558iouring_overflow (EV_P)
484{ 559{
485 /* we have two options, resize the queue (by tearing down 560 /* we have two options, resize the queue (by tearing down
486 * everything and recreating it, or living with it 561 * everything and recreating it, or living with it
487 * and polling. 562 * and polling.
488 * we implement this by resizing tghe queue, and, if that fails, 563 * we implement this by resizing the queue, and, if that fails,
489 * we just recreate the state on every failure, which 564 * we just recreate the state on every failure, which
490 * kind of is a very inefficient poll. 565 * kind of is a very inefficient poll.
491 * one danger is, due to the bios toward lower fds, 566 * one danger is, due to the bios toward lower fds,
492 * we will only really get events for those, so 567 * we will only really get events for those, so
493 * maybe we need a poll() fallback, after all. 568 * maybe we need a poll() fallback, after all.
505 else 580 else
506 { 581 {
507 /* we hit the kernel limit, we should fall back to something else. 582 /* we hit the kernel limit, we should fall back to something else.
508 * we can either poll() a few times and hope for the best, 583 * we can either poll() a few times and hope for the best,
509 * poll always, or switch to epoll. 584 * poll always, or switch to epoll.
510 * since we use epoll anyways, go epoll. 585 * TODO: is this necessary with newer kernels?
511 */ 586 */
512 587
513 iouring_internal_destroy (EV_A); 588 iouring_internal_destroy (EV_A);
514 589
515 /* this should make it so that on return, we don'T call any uring functions */ 590 /* this should make it so that on return, we don't call any uring functions */
516 iouring_to_submit = 0; 591 iouring_to_submit = 0;
517 592
518 for (;;) 593 for (;;)
519 { 594 {
520 backend = epoll_init (EV_A_ 0); 595 backend = epoll_init (EV_A_ 0);
561 636
562static void 637static void
563iouring_poll (EV_P_ ev_tstamp timeout) 638iouring_poll (EV_P_ ev_tstamp timeout)
564{ 639{
565 /* if we have events, no need for extra syscalls, but we might have to queue events */ 640 /* if we have events, no need for extra syscalls, but we might have to queue events */
641 /* we also clar the timeout if there are outstanding fdchanges */
642 /* the latter should only happen if both the sq and cq are full, most likely */
643 /* because we have a lot of event sources that immediately complete */
644 /* TODO: fdchacngecnt is always 0 because fd_reify does not have two buffers yet */
566 if (iouring_handle_cq (EV_A)) 645 if (iouring_handle_cq (EV_A) || fdchangecnt)
567 timeout = EV_TS_CONST (0.); 646 timeout = EV_TS_CONST (0.);
568 else 647 else
569 /* no events, so maybe wait for some */ 648 /* no events, so maybe wait for some */
570 iouring_tfd_update (EV_A_ timeout); 649 iouring_tfd_update (EV_A_ timeout);
571 650
572 /* only enter the kernel if we have something to submit, or we need to wait */ 651 /* only enter the kernel if we have something to submit, or we need to wait */
573 if (timeout || iouring_to_submit) 652 if (timeout || iouring_to_submit)
574 { 653 {
575 int res; 654 int res = iouring_enter (EV_A_ timeout);
576
577 EV_RELEASE_CB;
578
579 res = evsys_io_uring_enter (iouring_fd, iouring_to_submit, 1,
580 timeout > EV_TS_CONST (0.) ? IORING_ENTER_GETEVENTS : 0, 0, 0);
581 iouring_to_submit = 0;
582
583 EV_ACQUIRE_CB;
584 655
585 if (ecb_expect_false (res < 0)) 656 if (ecb_expect_false (res < 0))
586 if (errno == EINTR) 657 if (errno == EINTR)
587 /* ignore */; 658 /* ignore */;
659 else if (errno == EBUSY)
660 /* cq full, cannot submit - should be rare because we flush the cq first, so simply ignore */;
588 else 661 else
589 ev_syserr ("(libev) iouring setup"); 662 ev_syserr ("(libev) iouring setup");
590 else 663 else
591 iouring_handle_cq (EV_A); 664 iouring_handle_cq (EV_A);
592 } 665 }

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines