|
|
1 | =encoding utf-8 |
|
|
2 | |
1 | =head1 NAME |
3 | =head1 NAME |
2 | |
4 | |
3 | libev - a high performance full-featured event loop written in C |
5 | libev - a high performance full-featured event loop written in C |
4 | |
6 | |
5 | =head1 SYNOPSIS |
7 | =head1 SYNOPSIS |
… | |
… | |
82 | |
84 | |
83 | =head1 WHAT TO READ WHEN IN A HURRY |
85 | =head1 WHAT TO READ WHEN IN A HURRY |
84 | |
86 | |
85 | This manual tries to be very detailed, but unfortunately, this also makes |
87 | This manual tries to be very detailed, but unfortunately, this also makes |
86 | it very long. If you just want to know the basics of libev, I suggest |
88 | it very long. If you just want to know the basics of libev, I suggest |
87 | reading L</ANATOMY OF A WATCHER>, then the L<E/XAMPLE PROGRAM> above and |
89 | reading L</ANATOMY OF A WATCHER>, then the L</EXAMPLE PROGRAM> above and |
88 | look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and |
90 | look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and |
89 | C<ev_timer> sections in L</WATCHER TYPES>. |
91 | C<ev_timer> sections in L</WATCHER TYPES>. |
90 | |
92 | |
91 | =head1 ABOUT LIBEV |
93 | =head1 ABOUT LIBEV |
92 | |
94 | |
… | |
… | |
103 | details of the event, and then hand it over to libev by I<starting> the |
105 | details of the event, and then hand it over to libev by I<starting> the |
104 | watcher. |
106 | watcher. |
105 | |
107 | |
106 | =head2 FEATURES |
108 | =head2 FEATURES |
107 | |
109 | |
108 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
110 | Libev supports C<select>, C<poll>, the Linux-specific aio and C<epoll> |
109 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
111 | interfaces, the BSD-specific C<kqueue> and the Solaris-specific event port |
110 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
112 | mechanisms for file descriptor events (C<ev_io>), the Linux C<inotify> |
111 | (for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner |
113 | interface (for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner |
112 | inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative |
114 | inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative |
113 | timers (C<ev_timer>), absolute timers with customised rescheduling |
115 | timers (C<ev_timer>), absolute timers with customised rescheduling |
114 | (C<ev_periodic>), synchronous signals (C<ev_signal>), process status |
116 | (C<ev_periodic>), synchronous signals (C<ev_signal>), process status |
115 | change events (C<ev_child>), and event watchers dealing with the event |
117 | change events (C<ev_child>), and event watchers dealing with the event |
116 | loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and |
118 | loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and |
… | |
… | |
157 | When libev detects a usage error such as a negative timer interval, then |
159 | When libev detects a usage error such as a negative timer interval, then |
158 | it will print a diagnostic message and abort (via the C<assert> mechanism, |
160 | it will print a diagnostic message and abort (via the C<assert> mechanism, |
159 | so C<NDEBUG> will disable this checking): these are programming errors in |
161 | so C<NDEBUG> will disable this checking): these are programming errors in |
160 | the libev caller and need to be fixed there. |
162 | the libev caller and need to be fixed there. |
161 | |
163 | |
|
|
164 | Via the C<EV_FREQUENT> macro you can compile in and/or enable extensive |
|
|
165 | consistency checking code inside libev that can be used to check for |
|
|
166 | internal inconsistencies, suually caused by application bugs. |
|
|
167 | |
162 | Libev also has a few internal error-checking C<assert>ions, and also has |
168 | Libev also has a few internal error-checking C<assert>ions. These do not |
163 | extensive consistency checking code. These do not trigger under normal |
|
|
164 | circumstances, as they indicate either a bug in libev or worse. |
169 | trigger under normal circumstances, as they indicate either a bug in libev |
|
|
170 | or worse. |
165 | |
171 | |
166 | |
172 | |
167 | =head1 GLOBAL FUNCTIONS |
173 | =head1 GLOBAL FUNCTIONS |
168 | |
174 | |
169 | These functions can be called anytime, even before initialising the |
175 | These functions can be called anytime, even before initialising the |
… | |
… | |
263 | |
269 | |
264 | You could override this function in high-availability programs to, say, |
270 | You could override this function in high-availability programs to, say, |
265 | free some memory if it cannot allocate memory, to use a special allocator, |
271 | free some memory if it cannot allocate memory, to use a special allocator, |
266 | or even to sleep a while and retry until some memory is available. |
272 | or even to sleep a while and retry until some memory is available. |
267 | |
273 | |
|
|
274 | Example: The following is the C<realloc> function that libev itself uses |
|
|
275 | which should work with C<realloc> and C<free> functions of all kinds and |
|
|
276 | is probably a good basis for your own implementation. |
|
|
277 | |
|
|
278 | static void * |
|
|
279 | ev_realloc_emul (void *ptr, long size) EV_NOEXCEPT |
|
|
280 | { |
|
|
281 | if (size) |
|
|
282 | return realloc (ptr, size); |
|
|
283 | |
|
|
284 | free (ptr); |
|
|
285 | return 0; |
|
|
286 | } |
|
|
287 | |
268 | Example: Replace the libev allocator with one that waits a bit and then |
288 | Example: Replace the libev allocator with one that waits a bit and then |
269 | retries (example requires a standards-compliant C<realloc>). |
289 | retries. |
270 | |
290 | |
271 | static void * |
291 | static void * |
272 | persistent_realloc (void *ptr, size_t size) |
292 | persistent_realloc (void *ptr, size_t size) |
273 | { |
293 | { |
|
|
294 | if (!size) |
|
|
295 | { |
|
|
296 | free (ptr); |
|
|
297 | return 0; |
|
|
298 | } |
|
|
299 | |
274 | for (;;) |
300 | for (;;) |
275 | { |
301 | { |
276 | void *newptr = realloc (ptr, size); |
302 | void *newptr = realloc (ptr, size); |
277 | |
303 | |
278 | if (newptr) |
304 | if (newptr) |
… | |
… | |
396 | |
422 | |
397 | If this flag bit is or'ed into the flag value (or the program runs setuid |
423 | If this flag bit is or'ed into the flag value (or the program runs setuid |
398 | or setgid) then libev will I<not> look at the environment variable |
424 | or setgid) then libev will I<not> look at the environment variable |
399 | C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will |
425 | C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will |
400 | override the flags completely if it is found in the environment. This is |
426 | override the flags completely if it is found in the environment. This is |
401 | useful to try out specific backends to test their performance, or to work |
427 | useful to try out specific backends to test their performance, to work |
402 | around bugs. |
428 | around bugs, or to make libev threadsafe (accessing environment variables |
|
|
429 | cannot be done in a threadsafe way, but usually it works if no other |
|
|
430 | thread modifies them). |
403 | |
431 | |
404 | =item C<EVFLAG_FORKCHECK> |
432 | =item C<EVFLAG_FORKCHECK> |
405 | |
433 | |
406 | Instead of calling C<ev_loop_fork> manually after a fork, you can also |
434 | Instead of calling C<ev_loop_fork> manually after a fork, you can also |
407 | make libev check for a fork in each iteration by enabling this flag. |
435 | make libev check for a fork in each iteration by enabling this flag. |
408 | |
436 | |
409 | This works by calling C<getpid ()> on every iteration of the loop, |
437 | This works by calling C<getpid ()> on every iteration of the loop, |
410 | and thus this might slow down your event loop if you do a lot of loop |
438 | and thus this might slow down your event loop if you do a lot of loop |
411 | iterations and little real work, but is usually not noticeable (on my |
439 | iterations and little real work, but is usually not noticeable (on my |
412 | GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence |
440 | GNU/Linux system for example, C<getpid> is actually a simple 5-insn |
413 | without a system call and thus I<very> fast, but my GNU/Linux system also has |
441 | sequence without a system call and thus I<very> fast, but my GNU/Linux |
414 | C<pthread_atfork> which is even faster). |
442 | system also has C<pthread_atfork> which is even faster). (Update: glibc |
|
|
443 | versions 2.25 apparently removed the C<getpid> optimisation again). |
415 | |
444 | |
416 | The big advantage of this flag is that you can forget about fork (and |
445 | The big advantage of this flag is that you can forget about fork (and |
417 | forget about forgetting to tell libev about forking) when you use this |
446 | forget about forgetting to tell libev about forking, although you still |
418 | flag. |
447 | have to ignore C<SIGPIPE>) when you use this flag. |
419 | |
448 | |
420 | This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> |
449 | This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> |
421 | environment variable. |
450 | environment variable. |
422 | |
451 | |
423 | =item C<EVFLAG_NOINOTIFY> |
452 | =item C<EVFLAG_NOINOTIFY> |
… | |
… | |
451 | unblocking the signals. |
480 | unblocking the signals. |
452 | |
481 | |
453 | It's also required by POSIX in a threaded program, as libev calls |
482 | It's also required by POSIX in a threaded program, as libev calls |
454 | C<sigprocmask>, whose behaviour is officially unspecified. |
483 | C<sigprocmask>, whose behaviour is officially unspecified. |
455 | |
484 | |
456 | This flag's behaviour will become the default in future versions of libev. |
485 | =item C<EVFLAG_NOTIMERFD> |
|
|
486 | |
|
|
487 | When this flag is specified, the libev will avoid using a C<timerfd> to |
|
|
488 | detect time jumps. It will still be able to detect time jumps, but takes |
|
|
489 | longer and has a lower accuracy in doing so, but saves a file descriptor |
|
|
490 | per loop. |
|
|
491 | |
|
|
492 | The current implementation only tries to use a C<timerfd> when the first |
|
|
493 | C<ev_periodic> watcher is started and falls back on other methods if it |
|
|
494 | cannot be created, but this behaviour might change in the future. |
457 | |
495 | |
458 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
496 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
459 | |
497 | |
460 | This is your standard select(2) backend. Not I<completely> standard, as |
498 | This is your standard select(2) backend. Not I<completely> standard, as |
461 | libev tries to roll its own fd_set with no limits on the number of fds, |
499 | libev tries to roll its own fd_set with no limits on the number of fds, |
… | |
… | |
486 | This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and |
524 | This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and |
487 | C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. |
525 | C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. |
488 | |
526 | |
489 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
527 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
490 | |
528 | |
491 | Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9 |
529 | Use the Linux-specific epoll(7) interface (for both pre- and post-2.6.9 |
492 | kernels). |
530 | kernels). |
493 | |
531 | |
494 | For few fds, this backend is a bit little slower than poll and select, but |
532 | For few fds, this backend is a bit little slower than poll and select, but |
495 | it scales phenomenally better. While poll and select usually scale like |
533 | it scales phenomenally better. While poll and select usually scale like |
496 | O(total_fds) where total_fds is the total number of fds (or the highest |
534 | O(total_fds) where total_fds is the total number of fds (or the highest |
… | |
… | |
542 | All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or |
580 | All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or |
543 | faster than epoll for maybe up to a hundred file descriptors, depending on |
581 | faster than epoll for maybe up to a hundred file descriptors, depending on |
544 | the usage. So sad. |
582 | the usage. So sad. |
545 | |
583 | |
546 | While nominally embeddable in other event loops, this feature is broken in |
584 | While nominally embeddable in other event loops, this feature is broken in |
547 | all kernel versions tested so far. |
585 | a lot of kernel revisions, but probably(!) works in current versions. |
548 | |
586 | |
549 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
587 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
550 | C<EVBACKEND_POLL>. |
588 | C<EVBACKEND_POLL>. |
551 | |
589 | |
|
|
590 | =item C<EVBACKEND_LINUXAIO> (value 64, Linux) |
|
|
591 | |
|
|
592 | Use the Linux-specific Linux AIO (I<not> C<< aio(7) >> but C<< |
|
|
593 | io_submit(2) >>) event interface available in post-4.18 kernels (but libev |
|
|
594 | only tries to use it in 4.19+). |
|
|
595 | |
|
|
596 | This is another Linux train wreck of an event interface. |
|
|
597 | |
|
|
598 | If this backend works for you (as of this writing, it was very |
|
|
599 | experimental), it is the best event interface available on Linux and might |
|
|
600 | be well worth enabling it - if it isn't available in your kernel this will |
|
|
601 | be detected and this backend will be skipped. |
|
|
602 | |
|
|
603 | This backend can batch oneshot requests and supports a user-space ring |
|
|
604 | buffer to receive events. It also doesn't suffer from most of the design |
|
|
605 | problems of epoll (such as not being able to remove event sources from |
|
|
606 | the epoll set), and generally sounds too good to be true. Because, this |
|
|
607 | being the Linux kernel, of course it suffers from a whole new set of |
|
|
608 | limitations, forcing you to fall back to epoll, inheriting all its design |
|
|
609 | issues. |
|
|
610 | |
|
|
611 | For one, it is not easily embeddable (but probably could be done using |
|
|
612 | an event fd at some extra overhead). It also is subject to a system wide |
|
|
613 | limit that can be configured in F</proc/sys/fs/aio-max-nr>. If no AIO |
|
|
614 | requests are left, this backend will be skipped during initialisation, and |
|
|
615 | will switch to epoll when the loop is active. |
|
|
616 | |
|
|
617 | Most problematic in practice, however, is that not all file descriptors |
|
|
618 | work with it. For example, in Linux 5.1, TCP sockets, pipes, event fds, |
|
|
619 | files, F</dev/null> and many others are supported, but ttys do not work |
|
|
620 | properly (a known bug that the kernel developers don't care about, see |
|
|
621 | L<https://lore.kernel.org/patchwork/patch/1047453/>), so this is not |
|
|
622 | (yet?) a generic event polling interface. |
|
|
623 | |
|
|
624 | Overall, it seems the Linux developers just don't want it to have a |
|
|
625 | generic event handling mechanism other than C<select> or C<poll>. |
|
|
626 | |
|
|
627 | To work around all these problem, the current version of libev uses its |
|
|
628 | epoll backend as a fallback for file descriptor types that do not work. Or |
|
|
629 | falls back completely to epoll if the kernel acts up. |
|
|
630 | |
|
|
631 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
|
|
632 | C<EVBACKEND_POLL>. |
|
|
633 | |
552 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
634 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
553 | |
635 | |
554 | Kqueue deserves special mention, as at the time of this writing, it |
636 | Kqueue deserves special mention, as at the time this backend was |
555 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
637 | implemented, it was broken on all BSDs except NetBSD (usually it doesn't |
556 | with anything but sockets and pipes, except on Darwin, where of course |
638 | work reliably with anything but sockets and pipes, except on Darwin, |
557 | it's completely useless). Unlike epoll, however, whose brokenness |
639 | where of course it's completely useless). Unlike epoll, however, whose |
558 | is by design, these kqueue bugs can (and eventually will) be fixed |
640 | brokenness is by design, these kqueue bugs can be (and mostly have been) |
559 | without API changes to existing programs. For this reason it's not being |
641 | fixed without API changes to existing programs. For this reason it's not |
560 | "auto-detected" unless you explicitly specify it in the flags (i.e. using |
642 | being "auto-detected" on all platforms unless you explicitly specify it |
561 | C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) |
643 | in the flags (i.e. using C<EVBACKEND_KQUEUE>) or libev was compiled on a |
562 | system like NetBSD. |
644 | known-to-be-good (-enough) system like NetBSD. |
563 | |
645 | |
564 | You still can embed kqueue into a normal poll or select backend and use it |
646 | You still can embed kqueue into a normal poll or select backend and use it |
565 | only for sockets (after having made sure that sockets work with kqueue on |
647 | only for sockets (after having made sure that sockets work with kqueue on |
566 | the target platform). See C<ev_embed> watchers for more info. |
648 | the target platform). See C<ev_embed> watchers for more info. |
567 | |
649 | |
568 | It scales in the same way as the epoll backend, but the interface to the |
650 | It scales in the same way as the epoll backend, but the interface to the |
569 | kernel is more efficient (which says nothing about its actual speed, of |
651 | kernel is more efficient (which says nothing about its actual speed, of |
570 | course). While stopping, setting and starting an I/O watcher does never |
652 | course). While stopping, setting and starting an I/O watcher does never |
571 | cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to |
653 | cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to |
572 | two event changes per incident. Support for C<fork ()> is very bad (you |
654 | two event changes per incident. Support for C<fork ()> is very bad (you |
573 | might have to leak fd's on fork, but it's more sane than epoll) and it |
655 | might have to leak fds on fork, but it's more sane than epoll) and it |
574 | drops fds silently in similarly hard-to-detect cases |
656 | drops fds silently in similarly hard-to-detect cases. |
575 | |
657 | |
576 | This backend usually performs well under most conditions. |
658 | This backend usually performs well under most conditions. |
577 | |
659 | |
578 | While nominally embeddable in other event loops, this doesn't work |
660 | While nominally embeddable in other event loops, this doesn't work |
579 | everywhere, so you might need to test for this. And since it is broken |
661 | everywhere, so you might need to test for this. And since it is broken |
… | |
… | |
653 | Example: Use whatever libev has to offer, but make sure that kqueue is |
735 | Example: Use whatever libev has to offer, but make sure that kqueue is |
654 | used if available. |
736 | used if available. |
655 | |
737 | |
656 | struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE); |
738 | struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE); |
657 | |
739 | |
|
|
740 | Example: Similarly, on linux, you mgiht want to take advantage of the |
|
|
741 | linux aio backend if possible, but fall back to something else if that |
|
|
742 | isn't available. |
|
|
743 | |
|
|
744 | struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_LINUXAIO); |
|
|
745 | |
658 | =item ev_loop_destroy (loop) |
746 | =item ev_loop_destroy (loop) |
659 | |
747 | |
660 | Destroys an event loop object (frees all memory and kernel state |
748 | Destroys an event loop object (frees all memory and kernel state |
661 | etc.). None of the active event watchers will be stopped in the normal |
749 | etc.). None of the active event watchers will be stopped in the normal |
662 | sense, so e.g. C<ev_is_active> might still return true. It is your |
750 | sense, so e.g. C<ev_is_active> might still return true. It is your |
… | |
… | |
678 | If you need dynamically allocated loops it is better to use C<ev_loop_new> |
766 | If you need dynamically allocated loops it is better to use C<ev_loop_new> |
679 | and C<ev_loop_destroy>. |
767 | and C<ev_loop_destroy>. |
680 | |
768 | |
681 | =item ev_loop_fork (loop) |
769 | =item ev_loop_fork (loop) |
682 | |
770 | |
683 | This function sets a flag that causes subsequent C<ev_run> iterations to |
771 | This function sets a flag that causes subsequent C<ev_run> iterations |
684 | reinitialise the kernel state for backends that have one. Despite the |
772 | to reinitialise the kernel state for backends that have one. Despite |
685 | name, you can call it anytime, but it makes most sense after forking, in |
773 | the name, you can call it anytime you are allowed to start or stop |
686 | the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the |
774 | watchers (except inside an C<ev_prepare> callback), but it makes most |
|
|
775 | sense after forking, in the child process. You I<must> call it (or use |
687 | child before resuming or calling C<ev_run>. |
776 | C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>. |
688 | |
777 | |
|
|
778 | In addition, if you want to reuse a loop (via this function or |
|
|
779 | C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>. |
|
|
780 | |
689 | Again, you I<have> to call it on I<any> loop that you want to re-use after |
781 | Again, you I<have> to call it on I<any> loop that you want to re-use after |
690 | a fork, I<even if you do not plan to use the loop in the parent>. This is |
782 | a fork, I<even if you do not plan to use the loop in the parent>. This is |
691 | because some kernel interfaces *cough* I<kqueue> *cough* do funny things |
783 | because some kernel interfaces *cough* I<kqueue> *cough* do funny things |
692 | during fork. |
784 | during fork. |
693 | |
785 | |
694 | On the other hand, you only need to call this function in the child |
786 | On the other hand, you only need to call this function in the child |
… | |
… | |
1393 | transition between them will be described in more detail - and while these |
1485 | transition between them will be described in more detail - and while these |
1394 | rules might look complicated, they usually do "the right thing". |
1486 | rules might look complicated, they usually do "the right thing". |
1395 | |
1487 | |
1396 | =over 4 |
1488 | =over 4 |
1397 | |
1489 | |
1398 | =item initialiased |
1490 | =item initialised |
1399 | |
1491 | |
1400 | Before a watcher can be registered with the event loop it has to be |
1492 | Before a watcher can be registered with the event loop it has to be |
1401 | initialised. This can be done with a call to C<ev_TYPE_init>, or calls to |
1493 | initialised. This can be done with a call to C<ev_TYPE_init>, or calls to |
1402 | C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. |
1494 | C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. |
1403 | |
1495 | |
… | |
… | |
1452 | |
1544 | |
1453 | Many event loops support I<watcher priorities>, which are usually small |
1545 | Many event loops support I<watcher priorities>, which are usually small |
1454 | integers that influence the ordering of event callback invocation |
1546 | integers that influence the ordering of event callback invocation |
1455 | between watchers in some way, all else being equal. |
1547 | between watchers in some way, all else being equal. |
1456 | |
1548 | |
1457 | In libev, Watcher priorities can be set using C<ev_set_priority>. See its |
1549 | In libev, watcher priorities can be set using C<ev_set_priority>. See its |
1458 | description for the more technical details such as the actual priority |
1550 | description for the more technical details such as the actual priority |
1459 | range. |
1551 | range. |
1460 | |
1552 | |
1461 | There are two common ways how these these priorities are being interpreted |
1553 | There are two common ways how these these priorities are being interpreted |
1462 | by event loops: |
1554 | by event loops: |
… | |
… | |
1601 | |
1693 | |
1602 | But really, best use non-blocking mode. |
1694 | But really, best use non-blocking mode. |
1603 | |
1695 | |
1604 | =head3 The special problem of disappearing file descriptors |
1696 | =head3 The special problem of disappearing file descriptors |
1605 | |
1697 | |
1606 | Some backends (e.g. kqueue, epoll) need to be told about closing a file |
1698 | Some backends (e.g. kqueue, epoll, linuxaio) need to be told about closing |
1607 | descriptor (either due to calling C<close> explicitly or any other means, |
1699 | a file descriptor (either due to calling C<close> explicitly or any other |
1608 | such as C<dup2>). The reason is that you register interest in some file |
1700 | means, such as C<dup2>). The reason is that you register interest in some |
1609 | descriptor, but when it goes away, the operating system will silently drop |
1701 | file descriptor, but when it goes away, the operating system will silently |
1610 | this interest. If another file descriptor with the same number then is |
1702 | drop this interest. If another file descriptor with the same number then |
1611 | registered with libev, there is no efficient way to see that this is, in |
1703 | is registered with libev, there is no efficient way to see that this is, |
1612 | fact, a different file descriptor. |
1704 | in fact, a different file descriptor. |
1613 | |
1705 | |
1614 | To avoid having to explicitly tell libev about such cases, libev follows |
1706 | To avoid having to explicitly tell libev about such cases, libev follows |
1615 | the following policy: Each time C<ev_io_set> is being called, libev |
1707 | the following policy: Each time C<ev_io_set> is being called, libev |
1616 | will assume that this is potentially a new file descriptor, otherwise |
1708 | will assume that this is potentially a new file descriptor, otherwise |
1617 | it is assumed that the file descriptor stays the same. That means that |
1709 | it is assumed that the file descriptor stays the same. That means that |
… | |
… | |
1666 | when you rarely read from a file instead of from a socket, and want to |
1758 | when you rarely read from a file instead of from a socket, and want to |
1667 | reuse the same code path. |
1759 | reuse the same code path. |
1668 | |
1760 | |
1669 | =head3 The special problem of fork |
1761 | =head3 The special problem of fork |
1670 | |
1762 | |
1671 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
1763 | Some backends (epoll, kqueue, linuxaio, iouring) do not support C<fork ()> |
1672 | useless behaviour. Libev fully supports fork, but needs to be told about |
1764 | at all or exhibit useless behaviour. Libev fully supports fork, but needs |
1673 | it in the child if you want to continue to use it in the child. |
1765 | to be told about it in the child if you want to continue to use it in the |
|
|
1766 | child. |
1674 | |
1767 | |
1675 | To support fork in your child processes, you have to call C<ev_loop_fork |
1768 | To support fork in your child processes, you have to call C<ev_loop_fork |
1676 | ()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to |
1769 | ()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to |
1677 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1770 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1678 | |
1771 | |
… | |
… | |
2024 | |
2117 | |
2025 | The relative timeouts are calculated relative to the C<ev_now ()> |
2118 | The relative timeouts are calculated relative to the C<ev_now ()> |
2026 | time. This is usually the right thing as this timestamp refers to the time |
2119 | time. This is usually the right thing as this timestamp refers to the time |
2027 | of the event triggering whatever timeout you are modifying/starting. If |
2120 | of the event triggering whatever timeout you are modifying/starting. If |
2028 | you suspect event processing to be delayed and you I<need> to base the |
2121 | you suspect event processing to be delayed and you I<need> to base the |
2029 | timeout on the current time, use something like this to adjust for this: |
2122 | timeout on the current time, use something like the following to adjust |
|
|
2123 | for it: |
2030 | |
2124 | |
2031 | ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); |
2125 | ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.); |
2032 | |
2126 | |
2033 | If the event loop is suspended for a long time, you can also force an |
2127 | If the event loop is suspended for a long time, you can also force an |
2034 | update of the time returned by C<ev_now ()> by calling C<ev_now_update |
2128 | update of the time returned by C<ev_now ()> by calling C<ev_now_update |
2035 | ()>. |
2129 | ()>, although that will push the event time of all outstanding events |
|
|
2130 | further into the future. |
2036 | |
2131 | |
2037 | =head3 The special problem of unsynchronised clocks |
2132 | =head3 The special problem of unsynchronised clocks |
2038 | |
2133 | |
2039 | Modern systems have a variety of clocks - libev itself uses the normal |
2134 | Modern systems have a variety of clocks - libev itself uses the normal |
2040 | "wall clock" clock and, if available, the monotonic clock (to avoid time |
2135 | "wall clock" clock and, if available, the monotonic clock (to avoid time |
… | |
… | |
2103 | |
2198 | |
2104 | =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) |
2199 | =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) |
2105 | |
2200 | |
2106 | =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) |
2201 | =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) |
2107 | |
2202 | |
2108 | Configure the timer to trigger after C<after> seconds. If C<repeat> |
2203 | Configure the timer to trigger after C<after> seconds (fractional and |
2109 | is C<0.>, then it will automatically be stopped once the timeout is |
2204 | negative values are supported). If C<repeat> is C<0.>, then it will |
2110 | reached. If it is positive, then the timer will automatically be |
2205 | automatically be stopped once the timeout is reached. If it is positive, |
2111 | configured to trigger again C<repeat> seconds later, again, and again, |
2206 | then the timer will automatically be configured to trigger again C<repeat> |
2112 | until stopped manually. |
2207 | seconds later, again, and again, until stopped manually. |
2113 | |
2208 | |
2114 | The timer itself will do a best-effort at avoiding drift, that is, if |
2209 | The timer itself will do a best-effort at avoiding drift, that is, if |
2115 | you configure a timer to trigger every 10 seconds, then it will normally |
2210 | you configure a timer to trigger every 10 seconds, then it will normally |
2116 | trigger at exactly 10 second intervals. If, however, your program cannot |
2211 | trigger at exactly 10 second intervals. If, however, your program cannot |
2117 | keep up with the timer (because it takes longer than those 10 seconds to |
2212 | keep up with the timer (because it takes longer than those 10 seconds to |
… | |
… | |
2199 | Periodic watchers are also timers of a kind, but they are very versatile |
2294 | Periodic watchers are also timers of a kind, but they are very versatile |
2200 | (and unfortunately a bit complex). |
2295 | (and unfortunately a bit complex). |
2201 | |
2296 | |
2202 | Unlike C<ev_timer>, periodic watchers are not based on real time (or |
2297 | Unlike C<ev_timer>, periodic watchers are not based on real time (or |
2203 | relative time, the physical time that passes) but on wall clock time |
2298 | relative time, the physical time that passes) but on wall clock time |
2204 | (absolute time, the thing you can read on your calender or clock). The |
2299 | (absolute time, the thing you can read on your calendar or clock). The |
2205 | difference is that wall clock time can run faster or slower than real |
2300 | difference is that wall clock time can run faster or slower than real |
2206 | time, and time jumps are not uncommon (e.g. when you adjust your |
2301 | time, and time jumps are not uncommon (e.g. when you adjust your |
2207 | wrist-watch). |
2302 | wrist-watch). |
2208 | |
2303 | |
2209 | You can tell a periodic watcher to trigger after some specific point |
2304 | You can tell a periodic watcher to trigger after some specific point |
… | |
… | |
2214 | C<ev_timer>, which would still trigger roughly 10 seconds after starting |
2309 | C<ev_timer>, which would still trigger roughly 10 seconds after starting |
2215 | it, as it uses a relative timeout). |
2310 | it, as it uses a relative timeout). |
2216 | |
2311 | |
2217 | C<ev_periodic> watchers can also be used to implement vastly more complex |
2312 | C<ev_periodic> watchers can also be used to implement vastly more complex |
2218 | timers, such as triggering an event on each "midnight, local time", or |
2313 | timers, such as triggering an event on each "midnight, local time", or |
2219 | other complicated rules. This cannot be done with C<ev_timer> watchers, as |
2314 | other complicated rules. This cannot easily be done with C<ev_timer> |
2220 | those cannot react to time jumps. |
2315 | watchers, as those cannot react to time jumps. |
2221 | |
2316 | |
2222 | As with timers, the callback is guaranteed to be invoked only when the |
2317 | As with timers, the callback is guaranteed to be invoked only when the |
2223 | point in time where it is supposed to trigger has passed. If multiple |
2318 | point in time where it is supposed to trigger has passed. If multiple |
2224 | timers become ready during the same loop iteration then the ones with |
2319 | timers become ready during the same loop iteration then the ones with |
2225 | earlier time-out values are invoked before ones with later time-out values |
2320 | earlier time-out values are invoked before ones with later time-out values |
… | |
… | |
2311 | |
2406 | |
2312 | NOTE: I<< This callback must always return a time that is higher than or |
2407 | NOTE: I<< This callback must always return a time that is higher than or |
2313 | equal to the passed C<now> value >>. |
2408 | equal to the passed C<now> value >>. |
2314 | |
2409 | |
2315 | This can be used to create very complex timers, such as a timer that |
2410 | This can be used to create very complex timers, such as a timer that |
2316 | triggers on "next midnight, local time". To do this, you would calculate the |
2411 | triggers on "next midnight, local time". To do this, you would calculate |
2317 | next midnight after C<now> and return the timestamp value for this. How |
2412 | the next midnight after C<now> and return the timestamp value for |
2318 | you do this is, again, up to you (but it is not trivial, which is the main |
2413 | this. Here is a (completely untested, no error checking) example on how to |
2319 | reason I omitted it as an example). |
2414 | do this: |
|
|
2415 | |
|
|
2416 | #include <time.h> |
|
|
2417 | |
|
|
2418 | static ev_tstamp |
|
|
2419 | my_rescheduler (ev_periodic *w, ev_tstamp now) |
|
|
2420 | { |
|
|
2421 | time_t tnow = (time_t)now; |
|
|
2422 | struct tm tm; |
|
|
2423 | localtime_r (&tnow, &tm); |
|
|
2424 | |
|
|
2425 | tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day |
|
|
2426 | ++tm.tm_mday; // midnight next day |
|
|
2427 | |
|
|
2428 | return mktime (&tm); |
|
|
2429 | } |
|
|
2430 | |
|
|
2431 | Note: this code might run into trouble on days that have more then two |
|
|
2432 | midnights (beginning and end). |
2320 | |
2433 | |
2321 | =back |
2434 | =back |
2322 | |
2435 | |
2323 | =item ev_periodic_again (loop, ev_periodic *) |
2436 | =item ev_periodic_again (loop, ev_periodic *) |
2324 | |
2437 | |
… | |
… | |
2389 | |
2502 | |
2390 | ev_periodic hourly_tick; |
2503 | ev_periodic hourly_tick; |
2391 | ev_periodic_init (&hourly_tick, clock_cb, |
2504 | ev_periodic_init (&hourly_tick, clock_cb, |
2392 | fmod (ev_now (loop), 3600.), 3600., 0); |
2505 | fmod (ev_now (loop), 3600.), 3600., 0); |
2393 | ev_periodic_start (loop, &hourly_tick); |
2506 | ev_periodic_start (loop, &hourly_tick); |
2394 | |
2507 | |
2395 | |
2508 | |
2396 | =head2 C<ev_signal> - signal me when a signal gets signalled! |
2509 | =head2 C<ev_signal> - signal me when a signal gets signalled! |
2397 | |
2510 | |
2398 | Signal watchers will trigger an event when the process receives a specific |
2511 | Signal watchers will trigger an event when the process receives a specific |
2399 | signal one or more times. Even though signals are very asynchronous, libev |
2512 | signal one or more times. Even though signals are very asynchronous, libev |
… | |
… | |
2409 | only within the same loop, i.e. you can watch for C<SIGINT> in your |
2522 | only within the same loop, i.e. you can watch for C<SIGINT> in your |
2410 | default loop and for C<SIGIO> in another loop, but you cannot watch for |
2523 | default loop and for C<SIGIO> in another loop, but you cannot watch for |
2411 | C<SIGINT> in both the default loop and another loop at the same time. At |
2524 | C<SIGINT> in both the default loop and another loop at the same time. At |
2412 | the moment, C<SIGCHLD> is permanently tied to the default loop. |
2525 | the moment, C<SIGCHLD> is permanently tied to the default loop. |
2413 | |
2526 | |
2414 | When the first watcher gets started will libev actually register something |
2527 | Only after the first watcher for a signal is started will libev actually |
2415 | with the kernel (thus it coexists with your own signal handlers as long as |
2528 | register something with the kernel. It thus coexists with your own signal |
2416 | you don't register any with libev for the same signal). |
2529 | handlers as long as you don't register any with libev for the same signal. |
2417 | |
2530 | |
2418 | If possible and supported, libev will install its handlers with |
2531 | If possible and supported, libev will install its handlers with |
2419 | C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should |
2532 | C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should |
2420 | not be unduly interrupted. If you have a problem with system calls getting |
2533 | not be unduly interrupted. If you have a problem with system calls getting |
2421 | interrupted by signals you can block all signals in an C<ev_check> watcher |
2534 | interrupted by signals you can block all signals in an C<ev_check> watcher |
… | |
… | |
2606 | |
2719 | |
2607 | =head2 C<ev_stat> - did the file attributes just change? |
2720 | =head2 C<ev_stat> - did the file attributes just change? |
2608 | |
2721 | |
2609 | This watches a file system path for attribute changes. That is, it calls |
2722 | This watches a file system path for attribute changes. That is, it calls |
2610 | C<stat> on that path in regular intervals (or when the OS says it changed) |
2723 | C<stat> on that path in regular intervals (or when the OS says it changed) |
2611 | and sees if it changed compared to the last time, invoking the callback if |
2724 | and sees if it changed compared to the last time, invoking the callback |
2612 | it did. |
2725 | if it did. Starting the watcher C<stat>'s the file, so only changes that |
|
|
2726 | happen after the watcher has been started will be reported. |
2613 | |
2727 | |
2614 | The path does not need to exist: changing from "path exists" to "path does |
2728 | The path does not need to exist: changing from "path exists" to "path does |
2615 | not exist" is a status change like any other. The condition "path does not |
2729 | not exist" is a status change like any other. The condition "path does not |
2616 | exist" (or more correctly "path cannot be stat'ed") is signified by the |
2730 | exist" (or more correctly "path cannot be stat'ed") is signified by the |
2617 | C<st_nlink> field being zero (which is otherwise always forced to be at |
2731 | C<st_nlink> field being zero (which is otherwise always forced to be at |
… | |
… | |
2858 | |
2972 | |
2859 | This mode of operation can be useful together with an C<ev_check> watcher, |
2973 | This mode of operation can be useful together with an C<ev_check> watcher, |
2860 | to do something on each event loop iteration - for example to balance load |
2974 | to do something on each event loop iteration - for example to balance load |
2861 | between different connections. |
2975 | between different connections. |
2862 | |
2976 | |
2863 | See L<< /Abusing an C<ev_check> watcher for its side-effect >> for a longer |
2977 | See L</Abusing an ev_check watcher for its side-effect> for a longer |
2864 | example. |
2978 | example. |
2865 | |
2979 | |
2866 | =head3 Watcher-Specific Functions and Data Members |
2980 | =head3 Watcher-Specific Functions and Data Members |
2867 | |
2981 | |
2868 | =over 4 |
2982 | =over 4 |
… | |
… | |
2902 | |
3016 | |
2903 | Prepare and check watchers are often (but not always) used in pairs: |
3017 | Prepare and check watchers are often (but not always) used in pairs: |
2904 | prepare watchers get invoked before the process blocks and check watchers |
3018 | prepare watchers get invoked before the process blocks and check watchers |
2905 | afterwards. |
3019 | afterwards. |
2906 | |
3020 | |
2907 | You I<must not> call C<ev_run> or similar functions that enter |
3021 | You I<must not> call C<ev_run> (or similar functions that enter the |
2908 | the current event loop from either C<ev_prepare> or C<ev_check> |
3022 | current event loop) or C<ev_loop_fork> from either C<ev_prepare> or |
2909 | watchers. Other loops than the current one are fine, however. The |
3023 | C<ev_check> watchers. Other loops than the current one are fine, |
2910 | rationale behind this is that you do not need to check for recursion in |
3024 | however. The rationale behind this is that you do not need to check |
2911 | those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, |
3025 | for recursion in those watchers, i.e. the sequence will always be |
2912 | C<ev_check> so if you have one watcher of each kind they will always be |
3026 | C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each |
2913 | called in pairs bracketing the blocking call. |
3027 | kind they will always be called in pairs bracketing the blocking call. |
2914 | |
3028 | |
2915 | Their main purpose is to integrate other event mechanisms into libev and |
3029 | Their main purpose is to integrate other event mechanisms into libev and |
2916 | their use is somewhat advanced. They could be used, for example, to track |
3030 | their use is somewhat advanced. They could be used, for example, to track |
2917 | variable changes, implement your own watchers, integrate net-snmp or a |
3031 | variable changes, implement your own watchers, integrate net-snmp or a |
2918 | coroutine library and lots more. They are also occasionally useful if |
3032 | coroutine library and lots more. They are also occasionally useful if |
… | |
… | |
2962 | |
3076 | |
2963 | Using an C<ev_check> watcher is almost enough: it will be called on the |
3077 | Using an C<ev_check> watcher is almost enough: it will be called on the |
2964 | next event loop iteration. However, that isn't as soon as possible - |
3078 | next event loop iteration. However, that isn't as soon as possible - |
2965 | without external events, your C<ev_check> watcher will not be invoked. |
3079 | without external events, your C<ev_check> watcher will not be invoked. |
2966 | |
3080 | |
2967 | |
|
|
2968 | This is where C<ev_idle> watchers come in handy - all you need is a |
3081 | This is where C<ev_idle> watchers come in handy - all you need is a |
2969 | single global idle watcher that is active as long as you have one active |
3082 | single global idle watcher that is active as long as you have one active |
2970 | C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop |
3083 | C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop |
2971 | will not sleep, and the C<ev_check> watcher makes sure a callback gets |
3084 | will not sleep, and the C<ev_check> watcher makes sure a callback gets |
2972 | invoked. Neither watcher alone can do that. |
3085 | invoked. Neither watcher alone can do that. |
… | |
… | |
3178 | |
3291 | |
3179 | =over 4 |
3292 | =over 4 |
3180 | |
3293 | |
3181 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
3294 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
3182 | |
3295 | |
3183 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
3296 | =item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop) |
3184 | |
3297 | |
3185 | Configures the watcher to embed the given loop, which must be |
3298 | Configures the watcher to embed the given loop, which must be |
3186 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
3299 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
3187 | invoked automatically, otherwise it is the responsibility of the callback |
3300 | invoked automatically, otherwise it is the responsibility of the callback |
3188 | to invoke it (it will continue to be called until the sweep has been done, |
3301 | to invoke it (it will continue to be called until the sweep has been done, |
… | |
… | |
3209 | used). |
3322 | used). |
3210 | |
3323 | |
3211 | struct ev_loop *loop_hi = ev_default_init (0); |
3324 | struct ev_loop *loop_hi = ev_default_init (0); |
3212 | struct ev_loop *loop_lo = 0; |
3325 | struct ev_loop *loop_lo = 0; |
3213 | ev_embed embed; |
3326 | ev_embed embed; |
3214 | |
3327 | |
3215 | // see if there is a chance of getting one that works |
3328 | // see if there is a chance of getting one that works |
3216 | // (remember that a flags value of 0 means autodetection) |
3329 | // (remember that a flags value of 0 means autodetection) |
3217 | loop_lo = ev_embeddable_backends () & ev_recommended_backends () |
3330 | loop_lo = ev_embeddable_backends () & ev_recommended_backends () |
3218 | ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) |
3331 | ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) |
3219 | : 0; |
3332 | : 0; |
… | |
… | |
3233 | C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). |
3346 | C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). |
3234 | |
3347 | |
3235 | struct ev_loop *loop = ev_default_init (0); |
3348 | struct ev_loop *loop = ev_default_init (0); |
3236 | struct ev_loop *loop_socket = 0; |
3349 | struct ev_loop *loop_socket = 0; |
3237 | ev_embed embed; |
3350 | ev_embed embed; |
3238 | |
3351 | |
3239 | if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) |
3352 | if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) |
3240 | if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) |
3353 | if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) |
3241 | { |
3354 | { |
3242 | ev_embed_init (&embed, 0, loop_socket); |
3355 | ev_embed_init (&embed, 0, loop_socket); |
3243 | ev_embed_start (loop, &embed); |
3356 | ev_embed_start (loop, &embed); |
… | |
… | |
3251 | |
3364 | |
3252 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
3365 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
3253 | |
3366 | |
3254 | Fork watchers are called when a C<fork ()> was detected (usually because |
3367 | Fork watchers are called when a C<fork ()> was detected (usually because |
3255 | whoever is a good citizen cared to tell libev about it by calling |
3368 | whoever is a good citizen cared to tell libev about it by calling |
3256 | C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the |
3369 | C<ev_loop_fork>). The invocation is done before the event loop blocks next |
3257 | event loop blocks next and before C<ev_check> watchers are being called, |
3370 | and before C<ev_check> watchers are being called, and only in the child |
3258 | and only in the child after the fork. If whoever good citizen calling |
3371 | after the fork. If whoever good citizen calling C<ev_default_fork> cheats |
3259 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
3372 | and calls it in the wrong process, the fork handlers will be invoked, too, |
3260 | handlers will be invoked, too, of course. |
3373 | of course. |
3261 | |
3374 | |
3262 | =head3 The special problem of life after fork - how is it possible? |
3375 | =head3 The special problem of life after fork - how is it possible? |
3263 | |
3376 | |
3264 | Most uses of C<fork()> consist of forking, then some simple calls to set |
3377 | Most uses of C<fork ()> consist of forking, then some simple calls to set |
3265 | up/change the process environment, followed by a call to C<exec()>. This |
3378 | up/change the process environment, followed by a call to C<exec()>. This |
3266 | sequence should be handled by libev without any problems. |
3379 | sequence should be handled by libev without any problems. |
3267 | |
3380 | |
3268 | This changes when the application actually wants to do event handling |
3381 | This changes when the application actually wants to do event handling |
3269 | in the child, or both parent in child, in effect "continuing" after the |
3382 | in the child, or both parent in child, in effect "continuing" after the |
… | |
… | |
3507 | |
3620 | |
3508 | There are some other functions of possible interest. Described. Here. Now. |
3621 | There are some other functions of possible interest. Described. Here. Now. |
3509 | |
3622 | |
3510 | =over 4 |
3623 | =over 4 |
3511 | |
3624 | |
3512 | =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback) |
3625 | =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg) |
3513 | |
3626 | |
3514 | This function combines a simple timer and an I/O watcher, calls your |
3627 | This function combines a simple timer and an I/O watcher, calls your |
3515 | callback on whichever event happens first and automatically stops both |
3628 | callback on whichever event happens first and automatically stops both |
3516 | watchers. This is useful if you want to wait for a single event on an fd |
3629 | watchers. This is useful if you want to wait for a single event on an fd |
3517 | or timeout without having to allocate/configure/start/stop/free one or |
3630 | or timeout without having to allocate/configure/start/stop/free one or |
… | |
… | |
3659 | already been invoked. |
3772 | already been invoked. |
3660 | |
3773 | |
3661 | A common way around all these issues is to make sure that |
3774 | A common way around all these issues is to make sure that |
3662 | C<start_new_request> I<always> returns before the callback is invoked. If |
3775 | C<start_new_request> I<always> returns before the callback is invoked. If |
3663 | C<start_new_request> immediately knows the result, it can artificially |
3776 | C<start_new_request> immediately knows the result, it can artificially |
3664 | delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher |
3777 | delay invoking the callback by using a C<prepare> or C<idle> watcher for |
3665 | for example, or more sneakily, by reusing an existing (stopped) watcher |
3778 | example, or more sneakily, by reusing an existing (stopped) watcher and |
3666 | and pushing it into the pending queue: |
3779 | pushing it into the pending queue: |
3667 | |
3780 | |
3668 | ev_set_cb (watcher, callback); |
3781 | ev_set_cb (watcher, callback); |
3669 | ev_feed_event (EV_A_ watcher, 0); |
3782 | ev_feed_event (EV_A_ watcher, 0); |
3670 | |
3783 | |
3671 | This way, C<start_new_request> can safely return before the callback is |
3784 | This way, C<start_new_request> can safely return before the callback is |
… | |
… | |
3679 | |
3792 | |
3680 | This brings the problem of exiting - a callback might want to finish the |
3793 | This brings the problem of exiting - a callback might want to finish the |
3681 | main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but |
3794 | main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but |
3682 | a modal "Are you sure?" dialog is still waiting), or just the nested one |
3795 | a modal "Are you sure?" dialog is still waiting), or just the nested one |
3683 | and not the main one (e.g. user clocked "Ok" in a modal dialog), or some |
3796 | and not the main one (e.g. user clocked "Ok" in a modal dialog), or some |
3684 | other combination: In these cases, C<ev_break> will not work alone. |
3797 | other combination: In these cases, a simple C<ev_break> will not work. |
3685 | |
3798 | |
3686 | The solution is to maintain "break this loop" variable for each C<ev_run> |
3799 | The solution is to maintain "break this loop" variable for each C<ev_run> |
3687 | invocation, and use a loop around C<ev_run> until the condition is |
3800 | invocation, and use a loop around C<ev_run> until the condition is |
3688 | triggered, using C<EVRUN_ONCE>: |
3801 | triggered, using C<EVRUN_ONCE>: |
3689 | |
3802 | |
… | |
… | |
3893 | To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two |
4006 | To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two |
3894 | files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: |
4007 | files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: |
3895 | |
4008 | |
3896 | // my_ev.h |
4009 | // my_ev.h |
3897 | #define EV_CB_DECLARE(type) struct my_coro *cb; |
4010 | #define EV_CB_DECLARE(type) struct my_coro *cb; |
3898 | #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); |
4011 | #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb) |
3899 | #include "../libev/ev.h" |
4012 | #include "../libev/ev.h" |
3900 | |
4013 | |
3901 | // my_ev.c |
4014 | // my_ev.c |
3902 | #define EV_H "my_ev.h" |
4015 | #define EV_H "my_ev.h" |
3903 | #include "../libev/ev.c" |
4016 | #include "../libev/ev.c" |
… | |
… | |
3949 | The normal C API should work fine when used from C++: both ev.h and the |
4062 | The normal C API should work fine when used from C++: both ev.h and the |
3950 | libev sources can be compiled as C++. Therefore, code that uses the C API |
4063 | libev sources can be compiled as C++. Therefore, code that uses the C API |
3951 | will work fine. |
4064 | will work fine. |
3952 | |
4065 | |
3953 | Proper exception specifications might have to be added to callbacks passed |
4066 | Proper exception specifications might have to be added to callbacks passed |
3954 | to libev: exceptions may be thrown only from watcher callbacks, all |
4067 | to libev: exceptions may be thrown only from watcher callbacks, all other |
3955 | other callbacks (allocator, syserr, loop acquire/release and periodioc |
4068 | callbacks (allocator, syserr, loop acquire/release and periodic reschedule |
3956 | reschedule callbacks) must not throw exceptions, and might need a C<throw |
4069 | callbacks) must not throw exceptions, and might need a C<noexcept> |
3957 | ()> specification. If you have code that needs to be compiled as both C |
4070 | specification. If you have code that needs to be compiled as both C and |
3958 | and C++ you can use the C<EV_THROW> macro for this: |
4071 | C++ you can use the C<EV_NOEXCEPT> macro for this: |
3959 | |
4072 | |
3960 | static void |
4073 | static void |
3961 | fatal_error (const char *msg) EV_THROW |
4074 | fatal_error (const char *msg) EV_NOEXCEPT |
3962 | { |
4075 | { |
3963 | perror (msg); |
4076 | perror (msg); |
3964 | abort (); |
4077 | abort (); |
3965 | } |
4078 | } |
3966 | |
4079 | |
… | |
… | |
3980 | Libev comes with some simplistic wrapper classes for C++ that mainly allow |
4093 | Libev comes with some simplistic wrapper classes for C++ that mainly allow |
3981 | you to use some convenience methods to start/stop watchers and also change |
4094 | you to use some convenience methods to start/stop watchers and also change |
3982 | the callback model to a model using method callbacks on objects. |
4095 | the callback model to a model using method callbacks on objects. |
3983 | |
4096 | |
3984 | To use it, |
4097 | To use it, |
3985 | |
4098 | |
3986 | #include <ev++.h> |
4099 | #include <ev++.h> |
3987 | |
4100 | |
3988 | This automatically includes F<ev.h> and puts all of its definitions (many |
4101 | This automatically includes F<ev.h> and puts all of its definitions (many |
3989 | of them macros) into the global namespace. All C++ specific things are |
4102 | of them macros) into the global namespace. All C++ specific things are |
3990 | put into the C<ev> namespace. It should support all the same embedding |
4103 | put into the C<ev> namespace. It should support all the same embedding |
… | |
… | |
4093 | void operator() (ev::io &w, int revents) |
4206 | void operator() (ev::io &w, int revents) |
4094 | { |
4207 | { |
4095 | ... |
4208 | ... |
4096 | } |
4209 | } |
4097 | } |
4210 | } |
4098 | |
4211 | |
4099 | myfunctor f; |
4212 | myfunctor f; |
4100 | |
4213 | |
4101 | ev::io w; |
4214 | ev::io w; |
4102 | w.set (&f); |
4215 | w.set (&f); |
4103 | |
4216 | |
… | |
… | |
4121 | Associates a different C<struct ev_loop> with this watcher. You can only |
4234 | Associates a different C<struct ev_loop> with this watcher. You can only |
4122 | do this when the watcher is inactive (and not pending either). |
4235 | do this when the watcher is inactive (and not pending either). |
4123 | |
4236 | |
4124 | =item w->set ([arguments]) |
4237 | =item w->set ([arguments]) |
4125 | |
4238 | |
4126 | Basically the same as C<ev_TYPE_set>, with the same arguments. Either this |
4239 | Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>), |
4127 | method or a suitable start method must be called at least once. Unlike the |
4240 | with the same arguments. Either this method or a suitable start method |
4128 | C counterpart, an active watcher gets automatically stopped and restarted |
4241 | must be called at least once. Unlike the C counterpart, an active watcher |
4129 | when reconfiguring it with this method. |
4242 | gets automatically stopped and restarted when reconfiguring it with this |
|
|
4243 | method. |
|
|
4244 | |
|
|
4245 | For C<ev::embed> watchers this method is called C<set_embed>, to avoid |
|
|
4246 | clashing with the C<set (loop)> method. |
4130 | |
4247 | |
4131 | =item w->start () |
4248 | =item w->start () |
4132 | |
4249 | |
4133 | Starts the watcher. Note that there is no C<loop> argument, as the |
4250 | Starts the watcher. Note that there is no C<loop> argument, as the |
4134 | constructor already stores the event loop. |
4251 | constructor already stores the event loop. |
… | |
… | |
4238 | |
4355 | |
4239 | Brian Maher has written a partial interface to libev for lua (at the |
4356 | Brian Maher has written a partial interface to libev for lua (at the |
4240 | time of this writing, only C<ev_io> and C<ev_timer>), to be found at |
4357 | time of this writing, only C<ev_io> and C<ev_timer>), to be found at |
4241 | L<http://github.com/brimworks/lua-ev>. |
4358 | L<http://github.com/brimworks/lua-ev>. |
4242 | |
4359 | |
|
|
4360 | =item Javascript |
|
|
4361 | |
|
|
4362 | Node.js (L<http://nodejs.org>) uses libev as the underlying event library. |
|
|
4363 | |
|
|
4364 | =item Others |
|
|
4365 | |
|
|
4366 | There are others, and I stopped counting. |
|
|
4367 | |
4243 | =back |
4368 | =back |
4244 | |
4369 | |
4245 | |
4370 | |
4246 | =head1 MACRO MAGIC |
4371 | =head1 MACRO MAGIC |
4247 | |
4372 | |
… | |
… | |
4364 | ev_vars.h |
4489 | ev_vars.h |
4365 | ev_wrap.h |
4490 | ev_wrap.h |
4366 | |
4491 | |
4367 | ev_win32.c required on win32 platforms only |
4492 | ev_win32.c required on win32 platforms only |
4368 | |
4493 | |
4369 | ev_select.c only when select backend is enabled (which is enabled by default) |
4494 | ev_select.c only when select backend is enabled |
4370 | ev_poll.c only when poll backend is enabled (disabled by default) |
4495 | ev_poll.c only when poll backend is enabled |
4371 | ev_epoll.c only when the epoll backend is enabled (disabled by default) |
4496 | ev_epoll.c only when the epoll backend is enabled |
|
|
4497 | ev_linuxaio.c only when the linux aio backend is enabled |
|
|
4498 | ev_iouring.c only when the linux io_uring backend is enabled |
4372 | ev_kqueue.c only when the kqueue backend is enabled (disabled by default) |
4499 | ev_kqueue.c only when the kqueue backend is enabled |
4373 | ev_port.c only when the solaris port backend is enabled (disabled by default) |
4500 | ev_port.c only when the solaris port backend is enabled |
4374 | |
4501 | |
4375 | F<ev.c> includes the backend files directly when enabled, so you only need |
4502 | F<ev.c> includes the backend files directly when enabled, so you only need |
4376 | to compile this single file. |
4503 | to compile this single file. |
4377 | |
4504 | |
4378 | =head3 LIBEVENT COMPATIBILITY API |
4505 | =head3 LIBEVENT COMPATIBILITY API |
… | |
… | |
4497 | available and will probe for kernel support at runtime. This will improve |
4624 | available and will probe for kernel support at runtime. This will improve |
4498 | C<ev_signal> and C<ev_async> performance and reduce resource consumption. |
4625 | C<ev_signal> and C<ev_async> performance and reduce resource consumption. |
4499 | If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
4626 | If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
4500 | 2.7 or newer, otherwise disabled. |
4627 | 2.7 or newer, otherwise disabled. |
4501 | |
4628 | |
|
|
4629 | =item EV_USE_SIGNALFD |
|
|
4630 | |
|
|
4631 | If defined to be C<1>, then libev will assume that C<signalfd ()> is |
|
|
4632 | available and will probe for kernel support at runtime. This enables |
|
|
4633 | the use of EVFLAG_SIGNALFD for faster and simpler signal handling. If |
|
|
4634 | undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
|
|
4635 | 2.7 or newer, otherwise disabled. |
|
|
4636 | |
|
|
4637 | =item EV_USE_TIMERFD |
|
|
4638 | |
|
|
4639 | If defined to be C<1>, then libev will assume that C<timerfd ()> is |
|
|
4640 | available and will probe for kernel support at runtime. This allows |
|
|
4641 | libev to detect time jumps accurately. If undefined, it will be enabled |
|
|
4642 | if the headers indicate GNU/Linux + Glibc 2.8 or newer and define |
|
|
4643 | C<TFD_TIMER_CANCEL_ON_SET>, otherwise disabled. |
|
|
4644 | |
|
|
4645 | =item EV_USE_EVENTFD |
|
|
4646 | |
|
|
4647 | If defined to be C<1>, then libev will assume that C<eventfd ()> is |
|
|
4648 | available and will probe for kernel support at runtime. This will improve |
|
|
4649 | C<ev_signal> and C<ev_async> performance and reduce resource consumption. |
|
|
4650 | If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
|
|
4651 | 2.7 or newer, otherwise disabled. |
|
|
4652 | |
4502 | =item EV_USE_SELECT |
4653 | =item EV_USE_SELECT |
4503 | |
4654 | |
4504 | If undefined or defined to be C<1>, libev will compile in support for the |
4655 | If undefined or defined to be C<1>, libev will compile in support for the |
4505 | C<select>(2) backend. No attempt at auto-detection will be done: if no |
4656 | C<select>(2) backend. No attempt at auto-detection will be done: if no |
4506 | other method takes over, select will be it. Otherwise the select backend |
4657 | other method takes over, select will be it. Otherwise the select backend |
… | |
… | |
4546 | If programs implement their own fd to handle mapping on win32, then this |
4697 | If programs implement their own fd to handle mapping on win32, then this |
4547 | macro can be used to override the C<close> function, useful to unregister |
4698 | macro can be used to override the C<close> function, useful to unregister |
4548 | file descriptors again. Note that the replacement function has to close |
4699 | file descriptors again. Note that the replacement function has to close |
4549 | the underlying OS handle. |
4700 | the underlying OS handle. |
4550 | |
4701 | |
|
|
4702 | =item EV_USE_WSASOCKET |
|
|
4703 | |
|
|
4704 | If defined to be C<1>, libev will use C<WSASocket> to create its internal |
|
|
4705 | communication socket, which works better in some environments. Otherwise, |
|
|
4706 | the normal C<socket> function will be used, which works better in other |
|
|
4707 | environments. |
|
|
4708 | |
4551 | =item EV_USE_POLL |
4709 | =item EV_USE_POLL |
4552 | |
4710 | |
4553 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
4711 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
4554 | backend. Otherwise it will be enabled on non-win32 platforms. It |
4712 | backend. Otherwise it will be enabled on non-win32 platforms. It |
4555 | takes precedence over select. |
4713 | takes precedence over select. |
… | |
… | |
4559 | If defined to be C<1>, libev will compile in support for the Linux |
4717 | If defined to be C<1>, libev will compile in support for the Linux |
4560 | C<epoll>(7) backend. Its availability will be detected at runtime, |
4718 | C<epoll>(7) backend. Its availability will be detected at runtime, |
4561 | otherwise another method will be used as fallback. This is the preferred |
4719 | otherwise another method will be used as fallback. This is the preferred |
4562 | backend for GNU/Linux systems. If undefined, it will be enabled if the |
4720 | backend for GNU/Linux systems. If undefined, it will be enabled if the |
4563 | headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
4721 | headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
|
|
4722 | |
|
|
4723 | =item EV_USE_LINUXAIO |
|
|
4724 | |
|
|
4725 | If defined to be C<1>, libev will compile in support for the Linux aio |
|
|
4726 | backend (C<EV_USE_EPOLL> must also be enabled). If undefined, it will be |
|
|
4727 | enabled on linux, otherwise disabled. |
|
|
4728 | |
|
|
4729 | =item EV_USE_IOURING |
|
|
4730 | |
|
|
4731 | If defined to be C<1>, libev will compile in support for the Linux |
|
|
4732 | io_uring backend (C<EV_USE_EPOLL> must also be enabled). Due to it's |
|
|
4733 | current limitations it has to be requested explicitly. If undefined, it |
|
|
4734 | will be enabled on linux, otherwise disabled. |
4564 | |
4735 | |
4565 | =item EV_USE_KQUEUE |
4736 | =item EV_USE_KQUEUE |
4566 | |
4737 | |
4567 | If defined to be C<1>, libev will compile in support for the BSD style |
4738 | If defined to be C<1>, libev will compile in support for the BSD style |
4568 | C<kqueue>(2) backend. Its actual availability will be detected at runtime, |
4739 | C<kqueue>(2) backend. Its actual availability will be detected at runtime, |
… | |
… | |
4599 | different cpus (or different cpu cores). This reduces dependencies |
4770 | different cpus (or different cpu cores). This reduces dependencies |
4600 | and makes libev faster. |
4771 | and makes libev faster. |
4601 | |
4772 | |
4602 | =item EV_NO_THREADS |
4773 | =item EV_NO_THREADS |
4603 | |
4774 | |
4604 | If defined to be C<1>, libev will assume that it will never be called |
4775 | If defined to be C<1>, libev will assume that it will never be called from |
4605 | from different threads, which is a stronger assumption than C<EV_NO_SMP>, |
4776 | different threads (that includes signal handlers), which is a stronger |
4606 | above. This reduces dependencies and makes libev faster. |
4777 | assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes |
|
|
4778 | libev faster. |
4607 | |
4779 | |
4608 | =item EV_ATOMIC_T |
4780 | =item EV_ATOMIC_T |
4609 | |
4781 | |
4610 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4782 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4611 | access is atomic and serialised with respect to other threads or signal |
4783 | access is atomic with respect to other threads or signal contexts. No |
4612 | contexts. No such type is easily found in the C language, so you can |
4784 | such type is easily found in the C language, so you can provide your own |
4613 | provide your own type that you know is safe for your purposes. It is used |
4785 | type that you know is safe for your purposes. It is used both for signal |
4614 | both for signal handler "locking" as well as for signal and thread safety |
4786 | handler "locking" as well as for signal and thread safety in C<ev_async> |
4615 | in C<ev_async> watchers. |
4787 | watchers. |
4616 | |
4788 | |
4617 | In the absence of this define, libev will use C<sig_atomic_t volatile> |
4789 | In the absence of this define, libev will use C<sig_atomic_t volatile> |
4618 | (from F<signal.h>), which is usually good enough on most platforms, |
4790 | (from F<signal.h>), which is usually good enough on most platforms. |
4619 | although strictly speaking using a type that also implies a memory fence |
|
|
4620 | is required. |
|
|
4621 | |
4791 | |
4622 | =item EV_H (h) |
4792 | =item EV_H (h) |
4623 | |
4793 | |
4624 | The name of the F<ev.h> header file used to include it. The default if |
4794 | The name of the F<ev.h> header file used to include it. The default if |
4625 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
4795 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
… | |
… | |
4846 | in. If set to C<1>, then verification code will be compiled in, but not |
5016 | in. If set to C<1>, then verification code will be compiled in, but not |
4847 | called. If set to C<2>, then the internal verification code will be |
5017 | called. If set to C<2>, then the internal verification code will be |
4848 | called once per loop, which can slow down libev. If set to C<3>, then the |
5018 | called once per loop, which can slow down libev. If set to C<3>, then the |
4849 | verification code will be called very frequently, which will slow down |
5019 | verification code will be called very frequently, which will slow down |
4850 | libev considerably. |
5020 | libev considerably. |
|
|
5021 | |
|
|
5022 | Verification errors are reported via C's C<assert> mechanism, so if you |
|
|
5023 | disable that (e.g. by defining C<NDEBUG>) then no errors will be reported. |
4851 | |
5024 | |
4852 | The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it |
5025 | The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it |
4853 | will be C<0>. |
5026 | will be C<0>. |
4854 | |
5027 | |
4855 | =item EV_COMMON |
5028 | =item EV_COMMON |
… | |
… | |
5272 | structure (guaranteed by POSIX but not by ISO C for example), but it also |
5445 | structure (guaranteed by POSIX but not by ISO C for example), but it also |
5273 | assumes that the same (machine) code can be used to call any watcher |
5446 | assumes that the same (machine) code can be used to call any watcher |
5274 | callback: The watcher callbacks have different type signatures, but libev |
5447 | callback: The watcher callbacks have different type signatures, but libev |
5275 | calls them using an C<ev_watcher *> internally. |
5448 | calls them using an C<ev_watcher *> internally. |
5276 | |
5449 | |
|
|
5450 | =item null pointers and integer zero are represented by 0 bytes |
|
|
5451 | |
|
|
5452 | Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and |
|
|
5453 | relies on this setting pointers and integers to null. |
|
|
5454 | |
5277 | =item pointer accesses must be thread-atomic |
5455 | =item pointer accesses must be thread-atomic |
5278 | |
5456 | |
5279 | Accessing a pointer value must be atomic, it must both be readable and |
5457 | Accessing a pointer value must be atomic, it must both be readable and |
5280 | writable in one piece - this is the case on all current architectures. |
5458 | writable in one piece - this is the case on all current architectures. |
5281 | |
5459 | |
… | |
… | |
5294 | thread" or will block signals process-wide, both behaviours would |
5472 | thread" or will block signals process-wide, both behaviours would |
5295 | be compatible with libev. Interaction between C<sigprocmask> and |
5473 | be compatible with libev. Interaction between C<sigprocmask> and |
5296 | C<pthread_sigmask> could complicate things, however. |
5474 | C<pthread_sigmask> could complicate things, however. |
5297 | |
5475 | |
5298 | The most portable way to handle signals is to block signals in all threads |
5476 | The most portable way to handle signals is to block signals in all threads |
5299 | except the initial one, and run the default loop in the initial thread as |
5477 | except the initial one, and run the signal handling loop in the initial |
5300 | well. |
5478 | thread as well. |
5301 | |
5479 | |
5302 | =item C<long> must be large enough for common memory allocation sizes |
5480 | =item C<long> must be large enough for common memory allocation sizes |
5303 | |
5481 | |
5304 | To improve portability and simplify its API, libev uses C<long> internally |
5482 | To improve portability and simplify its API, libev uses C<long> internally |
5305 | instead of C<size_t> when allocating its data structures. On non-POSIX |
5483 | instead of C<size_t> when allocating its data structures. On non-POSIX |
… | |
… | |
5409 | =over 4 |
5587 | =over 4 |
5410 | |
5588 | |
5411 | =item C<EV_COMPAT3> backwards compatibility mechanism |
5589 | =item C<EV_COMPAT3> backwards compatibility mechanism |
5412 | |
5590 | |
5413 | The backward compatibility mechanism can be controlled by |
5591 | The backward compatibility mechanism can be controlled by |
5414 | C<EV_COMPAT3>. See L</PREPROCESSOR SYMBOLS/MACROS> in the L</EMBEDDING> |
5592 | C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING> |
5415 | section. |
5593 | section. |
5416 | |
5594 | |
5417 | =item C<ev_default_destroy> and C<ev_default_fork> have been removed |
5595 | =item C<ev_default_destroy> and C<ev_default_fork> have been removed |
5418 | |
5596 | |
5419 | These calls can be replaced easily by their C<ev_loop_xxx> counterparts: |
5597 | These calls can be replaced easily by their C<ev_loop_xxx> counterparts: |