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.9 by root, Fri Dec 27 16:15:58 2019 UTC vs.
Revision 1.15 by root, Sat Dec 28 05:53:48 2019 UTC

87/* TODO: resize cq/sq size independently */ 87/* TODO: resize cq/sq size independently */
88 88
89#include <sys/timerfd.h> 89#include <sys/timerfd.h>
90#include <sys/mman.h> 90#include <sys/mman.h>
91#include <poll.h> 91#include <poll.h>
92#include <stdint.h>
92 93
93#define IOURING_INIT_ENTRIES 32 94#define IOURING_INIT_ENTRIES 32
94 95
95/*****************************************************************************/ 96/*****************************************************************************/
96/* syscall wrapdadoop - this section has the raw api/abi definitions */ 97/* syscall wrapdadoop - this section has the raw api/abi definitions */
173 __u32 resv[4]; 174 __u32 resv[4];
174 struct io_sqring_offsets sq_off; 175 struct io_sqring_offsets sq_off;
175 struct io_cqring_offsets cq_off; 176 struct io_cqring_offsets cq_off;
176}; 177};
177 178
179#define IORING_SETUP_CQSIZE 0x00000008
180
178#define IORING_OP_POLL_ADD 6 181#define IORING_OP_POLL_ADD 6
179#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
180 194
181#define IORING_ENTER_GETEVENTS 0x01 195#define IORING_ENTER_GETEVENTS 0x01
182 196
183#define IORING_OFF_SQ_RING 0x00000000ULL 197#define IORING_OFF_SQ_RING 0x00000000ULL
184#define IORING_OFF_CQ_RING 0x08000000ULL 198#define IORING_OFF_CQ_RING 0x08000000ULL
185#define IORING_OFF_SQES 0x10000000ULL 199#define IORING_OFF_SQES 0x10000000ULL
186 200
187#define IORING_FEAT_SINGLE_MMAP 0x1 201#define IORING_FEAT_SINGLE_MMAP 0x00000001
188#define IORING_FEAT_NODROP 0x2 202#define IORING_FEAT_NODROP 0x00000002
189#define IORING_FEAT_SUBMIT_STABLE 0x4 203#define IORING_FEAT_SUBMIT_STABLE 0x00000004
190 204
191inline_size 205inline_size
192int 206int
193evsys_io_uring_setup (unsigned entries, struct io_uring_params *params) 207evsys_io_uring_setup (unsigned entries, struct io_uring_params *params)
194{ 208{
214 228
215/* the submit/completion queue entries */ 229/* the submit/completion queue entries */
216#define EV_SQES ((struct io_uring_sqe *) iouring_sqes) 230#define EV_SQES ((struct io_uring_sqe *) iouring_sqes)
217#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))
218 232
233/* TODO: this is not enough, we might have to reap events */
234/* TODO: but we can't, as that will re-arm events, causing */
235/* TODO: an endless loop in fd_reify */
236static int
237iouring_enter (EV_P_ ev_tstamp timeout)
238{
239 int res;
240
241 EV_RELEASE_CB;
242
243 res = evsys_io_uring_enter (iouring_fd, iouring_to_submit, 1,
244 timeout > EV_TS_CONST (0.) ? IORING_ENTER_GETEVENTS : 0, 0, 0);
245
246 assert (("libev: io_uring_enter did not consume all sqes", (res < 0 || res == iouring_to_submit)));
247
248 iouring_to_submit = 0;
249
250 EV_ACQUIRE_CB;
251
252 return res;
253}
254
219static 255static
220struct io_uring_sqe * 256struct io_uring_sqe *
221iouring_sqe_get (EV_P) 257iouring_sqe_get (EV_P)
222{ 258{
223 unsigned tail = EV_SQ_VAR (tail); 259 unsigned tail = EV_SQ_VAR (tail);
224 260
225 if (tail + 1 - EV_SQ_VAR (head) > EV_SQ_VAR (ring_entries)) 261 while (ecb_expect_false (tail + 1 - EV_SQ_VAR (head) > EV_SQ_VAR (ring_entries)))
226 { 262 {
227 /* queue full, flush */ 263 /* queue full, need to flush */
228 evsys_io_uring_enter (iouring_fd, iouring_to_submit, 0, 0, 0, 0);
229 iouring_to_submit = 0;
230 }
231 264
265 int res = iouring_enter (EV_A_ EV_TS_CONST (0.));
266
267 /* io_uring_enter might fail with EBUSY and won't submit anything */
268 /* unfortunately, we can't handle this at the moment */
269
270 if (res < 0 && errno == EBUSY)
271 /* the sane thing might be to resize, but we can't */
272 //TODO
273 ev_syserr ("(libev) io_uring_enter could not clear sq");
274 else
275 break;
276
277 /* iouring_poll should have done ECB_MEMORY_FENCE_ACQUIRE */
278 }
279
232 assert (("libev: io_uring queue full after flush", tail + 1 - EV_SQ_VAR (head) <= EV_SQ_VAR (ring_entries))); 280 /*assert (("libev: io_uring queue full after flush", tail + 1 - EV_SQ_VAR (head) <= EV_SQ_VAR (ring_entries)));*/
233 281
234 return EV_SQES + (tail & EV_SQ_VAR (ring_mask)); 282 return EV_SQES + (tail & EV_SQ_VAR (ring_mask));
235} 283}
236 284
237inline_size 285inline_size
289 iouring_tfd = -1; 337 iouring_tfd = -1;
290 iouring_sq_ring = MAP_FAILED; 338 iouring_sq_ring = MAP_FAILED;
291 iouring_cq_ring = MAP_FAILED; 339 iouring_cq_ring = MAP_FAILED;
292 iouring_sqes = MAP_FAILED; 340 iouring_sqes = MAP_FAILED;
293 341
342 if (!have_monotonic) /* cannot really happen, but what if11 */
343 return -1;
344
294 for (;;) 345 for (;;)
295 { 346 {
296 iouring_fd = evsys_io_uring_setup (iouring_entries, &params); 347 iouring_fd = evsys_io_uring_setup (iouring_entries, &params);
297 348
298 if (iouring_fd >= 0) 349 if (iouring_fd >= 0)
299 break; /* yippie */ 350 break; /* yippie */
300 351
301 if (errno != EINVAL) 352 if (errno != EINVAL)
302 return -1; /* we failed */ 353 return -1; /* we failed */
354
355#if TODO
356 if ((~params.features) & (IORING_FEAT_NODROP | IORING_FEATURE_SINGLE_MMAP))
357 return -1; /* we require the above features */
358#endif
303 359
304 /* EINVAL: lots of possible reasons, but maybe 360 /* EINVAL: lots of possible reasons, but maybe
305 * it is because we hit the unqueryable hardcoded size limit 361 * it is because we hit the unqueryable hardcoded size limit
306 */ 362 */
307 363
378 { 434 {
379 /* we assume the sqe's are all "properly" initialised */ 435 /* we assume the sqe's are all "properly" initialised */
380 struct io_uring_sqe *sqe = iouring_sqe_get (EV_A); 436 struct io_uring_sqe *sqe = iouring_sqe_get (EV_A);
381 sqe->opcode = IORING_OP_POLL_REMOVE; 437 sqe->opcode = IORING_OP_POLL_REMOVE;
382 sqe->fd = fd; 438 sqe->fd = fd;
439 /* Jens Axboe notified me that user_data is not what is documented, but is
440 * some kind of unique ID that has to match, otherwise the request cannot
441 * be removed. Since we don't *really* have that, we pass in the old
442 * generation counter - if that fails, too bad, it will hopefully be removed
443 * at close time and then be ignored. */
444 sqe->addr = (uint32_t)fd | ((__u64)(uint32_t)anfds [fd].egen << 32);
383 sqe->user_data = -1; 445 sqe->user_data = (uint64_t)-1;
384 iouring_sqe_submit (EV_A_ sqe); 446 iouring_sqe_submit (EV_A_ sqe);
385 447
386 /* increment generation counter to avoid handling old events */ 448 /* increment generation counter to avoid handling old events */
387 ++anfds [fd].egen; 449 ++anfds [fd].egen;
388 } 450 }
429{ 491{
430 int fd = cqe->user_data & 0xffffffffU; 492 int fd = cqe->user_data & 0xffffffffU;
431 uint32_t gen = cqe->user_data >> 32; 493 uint32_t gen = cqe->user_data >> 32;
432 int res = cqe->res; 494 int res = cqe->res;
433 495
434 /* ignore fd removal events, if there are any. TODO: verify */ 496 /* user_data -1 is a remove that we are not atm. interested in */
435 if (cqe->user_data == (__u64)-1) 497 if (cqe->user_data == (uint64_t)-1)
436 abort ();//D 498 return;
437 499
438 assert (("libev: io_uring fd must be in-bounds", fd >= 0 && fd < anfdmax)); 500 assert (("libev: io_uring fd must be in-bounds", fd >= 0 && fd < anfdmax));
439 501
440 /* documentation lies, of course. the result value is NOT like 502 /* documentation lies, of course. the result value is NOT like
441 * normal syscalls, but like linux raw syscalls, i.e. negative 503 * normal syscalls, but like linux raw syscalls, i.e. negative
442 * error numbers. fortunate, as otherwise there would be no way 504 * error numbers. fortunate, as otherwise there would be no way
443 * to get error codes at all. still, why not document this? 505 * to get error codes at all. still, why not document this?
444 */ 506 */
445 507
446 /* ignore event if generation doesn't match */ 508 /* ignore event if generation doesn't match */
509 /* other than skipping removal events, */
447 /* this should actually be very rare */ 510 /* this should actually be very rare */
448 if (ecb_expect_false (gen != (uint32_t)anfds [fd].egen)) 511 if (ecb_expect_false (gen != (uint32_t)anfds [fd].egen))
449 return; 512 return;
450 513
451 if (ecb_expect_false (res < 0)) 514 if (ecb_expect_false (res < 0))
452 { 515 {
453 //TODO: EINVAL handling (was something failed with this fd) 516 /*TODO: EINVAL handling (was something failed with this fd)*/
454 //TODO: EBUSY happens when? 517 /*TODO: EBUSY happens when?*/
455 518
456 if (res == -EBADF) 519 if (res == -EBADF)
457 { 520 {
458 assert (("libev: event loop rejected bad fd", res != -EBADF)); 521 assert (("libev: event loop rejected bad fd", res != -EBADF));
459 fd_kill (EV_A_ fd); 522 fd_kill (EV_A_ fd);
487iouring_overflow (EV_P) 550iouring_overflow (EV_P)
488{ 551{
489 /* we have two options, resize the queue (by tearing down 552 /* we have two options, resize the queue (by tearing down
490 * everything and recreating it, or living with it 553 * everything and recreating it, or living with it
491 * and polling. 554 * and polling.
492 * we implement this by resizing tghe queue, and, if that fails, 555 * we implement this by resizing the queue, and, if that fails,
493 * we just recreate the state on every failure, which 556 * we just recreate the state on every failure, which
494 * kind of is a very inefficient poll. 557 * kind of is a very inefficient poll.
495 * one danger is, due to the bios toward lower fds, 558 * one danger is, due to the bios toward lower fds,
496 * we will only really get events for those, so 559 * we will only really get events for those, so
497 * maybe we need a poll() fallback, after all. 560 * maybe we need a poll() fallback, after all.
509 else 572 else
510 { 573 {
511 /* we hit the kernel limit, we should fall back to something else. 574 /* we hit the kernel limit, we should fall back to something else.
512 * we can either poll() a few times and hope for the best, 575 * we can either poll() a few times and hope for the best,
513 * poll always, or switch to epoll. 576 * poll always, or switch to epoll.
514 * since we use epoll anyways, go epoll. 577 * TODO: is this necessary with newer kernels?
515 */ 578 */
516 579
517 iouring_internal_destroy (EV_A); 580 iouring_internal_destroy (EV_A);
518 581
519 /* this should make it so that on return, we don'T call any uring functions */ 582 /* this should make it so that on return, we don't call any uring functions */
520 iouring_to_submit = 0; 583 iouring_to_submit = 0;
521 584
522 for (;;) 585 for (;;)
523 { 586 {
524 backend = epoll_init (EV_A_ 0); 587 backend = epoll_init (EV_A_ 0);
574 iouring_tfd_update (EV_A_ timeout); 637 iouring_tfd_update (EV_A_ timeout);
575 638
576 /* only enter the kernel if we have something to submit, or we need to wait */ 639 /* only enter the kernel if we have something to submit, or we need to wait */
577 if (timeout || iouring_to_submit) 640 if (timeout || iouring_to_submit)
578 { 641 {
579 int res; 642 int res = iouring_enter (EV_A_ timeout);
580
581 EV_RELEASE_CB;
582
583 res = evsys_io_uring_enter (iouring_fd, iouring_to_submit, 1,
584 timeout > EV_TS_CONST (0.) ? IORING_ENTER_GETEVENTS : 0, 0, 0);
585 iouring_to_submit = 0;
586
587 EV_ACQUIRE_CB;
588 643
589 if (ecb_expect_false (res < 0)) 644 if (ecb_expect_false (res < 0))
590 if (errno == EINTR) 645 if (errno == EINTR)
591 /* ignore */; 646 /* ignore */;
647 else if (errno == EBUSY)
648 /* cq full, cannot submit - should be rare because we flush the cq first, so simply ignore */;
592 else 649 else
593 ev_syserr ("(libev) iouring setup"); 650 ev_syserr ("(libev) iouring setup");
594 else 651 else
595 iouring_handle_cq (EV_A); 652 iouring_handle_cq (EV_A);
596 } 653 }

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines