|
|
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<EXAMPLE 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 | |
93 | Libev is an event loop: you register interest in certain events (such as a |
95 | Libev is an event loop: you register interest in certain events (such as a |
94 | file descriptor being readable or a timeout occurring), and it will manage |
96 | file descriptor being readable or a timeout occurring), and it will manage |
… | |
… | |
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 |
… | |
… | |
247 | the current system, you would need to look at C<ev_embeddable_backends () |
253 | the current system, you would need to look at C<ev_embeddable_backends () |
248 | & ev_supported_backends ()>, likewise for recommended ones. |
254 | & ev_supported_backends ()>, likewise for recommended ones. |
249 | |
255 | |
250 | See the description of C<ev_embed> watchers for more info. |
256 | See the description of C<ev_embed> watchers for more info. |
251 | |
257 | |
252 | =item ev_set_allocator (void *(*cb)(void *ptr, long size)) |
258 | =item ev_set_allocator (void *(*cb)(void *ptr, long size) throw ()) |
253 | |
259 | |
254 | Sets the allocation function to use (the prototype is similar - the |
260 | Sets the allocation function to use (the prototype is similar - the |
255 | semantics are identical to the C<realloc> C89/SuS/POSIX function). It is |
261 | semantics are identical to the C<realloc> C89/SuS/POSIX function). It is |
256 | used to allocate and free memory (no surprises here). If it returns zero |
262 | used to allocate and free memory (no surprises here). If it returns zero |
257 | when memory needs to be allocated (C<size != 0>), the library might abort |
263 | when memory needs to be allocated (C<size != 0>), the library might abort |
… | |
… | |
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) |
… | |
… | |
283 | } |
309 | } |
284 | |
310 | |
285 | ... |
311 | ... |
286 | ev_set_allocator (persistent_realloc); |
312 | ev_set_allocator (persistent_realloc); |
287 | |
313 | |
288 | =item ev_set_syserr_cb (void (*cb)(const char *msg)) |
314 | =item ev_set_syserr_cb (void (*cb)(const char *msg) throw ()) |
289 | |
315 | |
290 | Set the callback function to call on a retryable system call error (such |
316 | Set the callback function to call on a retryable system call error (such |
291 | as failed select, poll, epoll_wait). The message is a printable string |
317 | as failed select, poll, epoll_wait). The message is a printable string |
292 | indicating the system call or subsystem causing the problem. If this |
318 | indicating the system call or subsystem causing the problem. If this |
293 | callback is set, then libev will expect it to remedy the situation, no |
319 | callback is set, then libev will expect it to remedy the situation, no |
… | |
… | |
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 |
… | |
… | |
593 | and is not embeddable, which would limit the usefulness of this backend |
675 | and is not embeddable, which would limit the usefulness of this backend |
594 | immensely. |
676 | immensely. |
595 | |
677 | |
596 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
678 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
597 | |
679 | |
598 | This uses the Solaris 10 event port mechanism. As with everything on Solaris, |
680 | This uses the Solaris 10 event port mechanism. As with everything on |
599 | it's really slow, but it still scales very well (O(active_fds)). |
681 | Solaris, it's really slow, but it still scales very well (O(active_fds)). |
600 | |
682 | |
601 | While this backend scales well, it requires one system call per active |
683 | While this backend scales well, it requires one system call per active |
602 | file descriptor per loop iteration. For small and medium numbers of file |
684 | file descriptor per loop iteration. For small and medium numbers of file |
603 | descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend |
685 | descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend |
604 | might perform better. |
686 | might perform better. |
… | |
… | |
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 |
… | |
… | |
764 | |
856 | |
765 | This function is rarely useful, but when some event callback runs for a |
857 | This function is rarely useful, but when some event callback runs for a |
766 | very long time without entering the event loop, updating libev's idea of |
858 | very long time without entering the event loop, updating libev's idea of |
767 | the current time is a good idea. |
859 | the current time is a good idea. |
768 | |
860 | |
769 | See also L<The special problem of time updates> in the C<ev_timer> section. |
861 | See also L</The special problem of time updates> in the C<ev_timer> section. |
770 | |
862 | |
771 | =item ev_suspend (loop) |
863 | =item ev_suspend (loop) |
772 | |
864 | |
773 | =item ev_resume (loop) |
865 | =item ev_resume (loop) |
774 | |
866 | |
… | |
… | |
867 | - Queue all expired timers. |
959 | - Queue all expired timers. |
868 | - Queue all expired periodics. |
960 | - Queue all expired periodics. |
869 | - Queue all idle watchers with priority higher than that of pending events. |
961 | - Queue all idle watchers with priority higher than that of pending events. |
870 | - Queue all check watchers. |
962 | - Queue all check watchers. |
871 | - Call all queued watchers in reverse order (i.e. check watchers first). |
963 | - Call all queued watchers in reverse order (i.e. check watchers first). |
872 | Signals and child watchers are implemented as I/O watchers, and will |
964 | Signals, async and child watchers are implemented as I/O watchers, and |
873 | be handled here by queueing them when their watcher gets executed. |
965 | will be handled here by queueing them when their watcher gets executed. |
874 | - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT |
966 | - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT |
875 | were used, or there are no active watchers, goto FINISH, otherwise |
967 | were used, or there are no active watchers, goto FINISH, otherwise |
876 | continue with step LOOP. |
968 | continue with step LOOP. |
877 | FINISH: |
969 | FINISH: |
878 | - Reset the ev_break status iff it was EVBREAK_ONE. |
970 | - Reset the ev_break status iff it was EVBREAK_ONE. |
… | |
… | |
1016 | invoke the actual watchers inside another context (another thread etc.). |
1108 | invoke the actual watchers inside another context (another thread etc.). |
1017 | |
1109 | |
1018 | If you want to reset the callback, use C<ev_invoke_pending> as new |
1110 | If you want to reset the callback, use C<ev_invoke_pending> as new |
1019 | callback. |
1111 | callback. |
1020 | |
1112 | |
1021 | =item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P)) |
1113 | =item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ()) |
1022 | |
1114 | |
1023 | Sometimes you want to share the same loop between multiple threads. This |
1115 | Sometimes you want to share the same loop between multiple threads. This |
1024 | can be done relatively simply by putting mutex_lock/unlock calls around |
1116 | can be done relatively simply by putting mutex_lock/unlock calls around |
1025 | each call to a libev function. |
1117 | each call to a libev function. |
1026 | |
1118 | |
… | |
… | |
1126 | with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher |
1218 | with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher |
1127 | *) >>), and you can stop watching for events at any time by calling the |
1219 | *) >>), and you can stop watching for events at any time by calling the |
1128 | corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>. |
1220 | corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>. |
1129 | |
1221 | |
1130 | As long as your watcher is active (has been started but not stopped) you |
1222 | As long as your watcher is active (has been started but not stopped) you |
1131 | must not touch the values stored in it. Most specifically you must never |
1223 | must not touch the values stored in it except when explicitly documented |
1132 | reinitialise it or call its C<ev_TYPE_set> macro. |
1224 | otherwise. Most specifically you must never reinitialise it or call its |
|
|
1225 | C<ev_TYPE_set> macro. |
1133 | |
1226 | |
1134 | Each and every callback receives the event loop pointer as first, the |
1227 | Each and every callback receives the event loop pointer as first, the |
1135 | registered watcher structure as second, and a bitset of received events as |
1228 | registered watcher structure as second, and a bitset of received events as |
1136 | third argument. |
1229 | third argument. |
1137 | |
1230 | |
… | |
… | |
1174 | |
1267 | |
1175 | =item C<EV_PREPARE> |
1268 | =item C<EV_PREPARE> |
1176 | |
1269 | |
1177 | =item C<EV_CHECK> |
1270 | =item C<EV_CHECK> |
1178 | |
1271 | |
1179 | All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts |
1272 | All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to |
1180 | to gather new events, and all C<ev_check> watchers are invoked just after |
1273 | gather new events, and all C<ev_check> watchers are queued (not invoked) |
1181 | C<ev_run> has gathered them, but before it invokes any callbacks for any |
1274 | just after C<ev_run> has gathered them, but before it queues any callbacks |
|
|
1275 | for any received events. That means C<ev_prepare> watchers are the last |
|
|
1276 | watchers invoked before the event loop sleeps or polls for new events, and |
|
|
1277 | C<ev_check> watchers will be invoked before any other watchers of the same |
|
|
1278 | or lower priority within an event loop iteration. |
|
|
1279 | |
1182 | received events. Callbacks of both watcher types can start and stop as |
1280 | Callbacks of both watcher types can start and stop as many watchers as |
1183 | many watchers as they want, and all of them will be taken into account |
1281 | they want, and all of them will be taken into account (for example, a |
1184 | (for example, a C<ev_prepare> watcher might start an idle watcher to keep |
1282 | C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from |
1185 | C<ev_run> from blocking). |
1283 | blocking). |
1186 | |
1284 | |
1187 | =item C<EV_EMBED> |
1285 | =item C<EV_EMBED> |
1188 | |
1286 | |
1189 | The embedded event loop specified in the C<ev_embed> watcher needs attention. |
1287 | The embedded event loop specified in the C<ev_embed> watcher needs attention. |
1190 | |
1288 | |
… | |
… | |
1298 | |
1396 | |
1299 | =item bool ev_is_active (ev_TYPE *watcher) |
1397 | =item bool ev_is_active (ev_TYPE *watcher) |
1300 | |
1398 | |
1301 | Returns a true value iff the watcher is active (i.e. it has been started |
1399 | Returns a true value iff the watcher is active (i.e. it has been started |
1302 | and not yet been stopped). As long as a watcher is active you must not modify |
1400 | and not yet been stopped). As long as a watcher is active you must not modify |
1303 | it. |
1401 | it unless documented otherwise. |
|
|
1402 | |
|
|
1403 | Obviously, it is safe to call this on an active watcher, or actually any |
|
|
1404 | watcher that is initialised. |
1304 | |
1405 | |
1305 | =item bool ev_is_pending (ev_TYPE *watcher) |
1406 | =item bool ev_is_pending (ev_TYPE *watcher) |
1306 | |
1407 | |
1307 | Returns a true value iff the watcher is pending, (i.e. it has outstanding |
1408 | Returns a true value iff the watcher is pending, (i.e. it has outstanding |
1308 | events but its callback has not yet been invoked). As long as a watcher |
1409 | events but its callback has not yet been invoked). As long as a watcher |
1309 | is pending (but not active) you must not call an init function on it (but |
1410 | is pending (but not active) you must not call an init function on it (but |
1310 | C<ev_TYPE_set> is safe), you must not change its priority, and you must |
1411 | C<ev_TYPE_set> is safe), you must not change its priority, and you must |
1311 | make sure the watcher is available to libev (e.g. you cannot C<free ()> |
1412 | make sure the watcher is available to libev (e.g. you cannot C<free ()> |
1312 | it). |
1413 | it). |
1313 | |
1414 | |
|
|
1415 | It is safe to call this on any watcher in any state as long as it is |
|
|
1416 | initialised. |
|
|
1417 | |
1314 | =item callback ev_cb (ev_TYPE *watcher) |
1418 | =item callback ev_cb (ev_TYPE *watcher) |
1315 | |
1419 | |
1316 | Returns the callback currently set on the watcher. |
1420 | Returns the callback currently set on the watcher. |
1317 | |
1421 | |
1318 | =item ev_cb_set (ev_TYPE *watcher, callback) |
1422 | =item ev_set_cb (ev_TYPE *watcher, callback) |
1319 | |
1423 | |
1320 | Change the callback. You can change the callback at virtually any time |
1424 | Change the callback. You can change the callback at virtually any time |
1321 | (modulo threads). |
1425 | (modulo threads). |
1322 | |
1426 | |
1323 | =item ev_set_priority (ev_TYPE *watcher, int priority) |
1427 | =item ev_set_priority (ev_TYPE *watcher, int priority) |
… | |
… | |
1331 | from being executed (except for C<ev_idle> watchers). |
1435 | from being executed (except for C<ev_idle> watchers). |
1332 | |
1436 | |
1333 | If you need to suppress invocation when higher priority events are pending |
1437 | If you need to suppress invocation when higher priority events are pending |
1334 | you need to look at C<ev_idle> watchers, which provide this functionality. |
1438 | you need to look at C<ev_idle> watchers, which provide this functionality. |
1335 | |
1439 | |
1336 | You I<must not> change the priority of a watcher as long as it is active or |
1440 | You I<must not> change the priority of a watcher as long as it is active |
1337 | pending. |
1441 | or pending. Reading the priority with C<ev_priority> is fine in any state. |
1338 | |
1442 | |
1339 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
1443 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
1340 | fine, as long as you do not mind that the priority value you query might |
1444 | fine, as long as you do not mind that the priority value you query might |
1341 | or might not have been clamped to the valid range. |
1445 | or might not have been clamped to the valid range. |
1342 | |
1446 | |
1343 | The default priority used by watchers when no priority has been set is |
1447 | The default priority used by watchers when no priority has been set is |
1344 | always C<0>, which is supposed to not be too high and not be too low :). |
1448 | always C<0>, which is supposed to not be too high and not be too low :). |
1345 | |
1449 | |
1346 | See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of |
1450 | See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of |
1347 | priorities. |
1451 | priorities. |
1348 | |
1452 | |
1349 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1453 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1350 | |
1454 | |
1351 | Invoke the C<watcher> with the given C<loop> and C<revents>. Neither |
1455 | Invoke the C<watcher> with the given C<loop> and C<revents>. Neither |
… | |
… | |
1364 | |
1468 | |
1365 | =item ev_feed_event (loop, ev_TYPE *watcher, int revents) |
1469 | =item ev_feed_event (loop, ev_TYPE *watcher, int revents) |
1366 | |
1470 | |
1367 | Feeds the given event set into the event loop, as if the specified event |
1471 | Feeds the given event set into the event loop, as if the specified event |
1368 | had happened for the specified watcher (which must be a pointer to an |
1472 | had happened for the specified watcher (which must be a pointer to an |
1369 | initialised but not necessarily started event watcher). Obviously you must |
1473 | initialised but not necessarily started event watcher, though it can be |
1370 | not free the watcher as long as it has pending events. |
1474 | active). Obviously you must not free the watcher as long as it has pending |
|
|
1475 | events. |
1371 | |
1476 | |
1372 | Stopping the watcher, letting libev invoke it, or calling |
1477 | Stopping the watcher, letting libev invoke it, or calling |
1373 | C<ev_clear_pending> will clear the pending event, even if the watcher was |
1478 | C<ev_clear_pending> will clear the pending event, even if the watcher was |
1374 | not started in the first place. |
1479 | not started in the first place. |
1375 | |
1480 | |
1376 | See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related |
1481 | See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related |
1377 | functions that do not need a watcher. |
1482 | functions that do not need a watcher. |
1378 | |
1483 | |
1379 | =back |
1484 | =back |
1380 | |
1485 | |
1381 | See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR |
1486 | See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR |
1382 | OWN COMPOSITE WATCHERS> idioms. |
1487 | OWN COMPOSITE WATCHERS> idioms. |
1383 | |
1488 | |
1384 | =head2 WATCHER STATES |
1489 | =head2 WATCHER STATES |
1385 | |
1490 | |
1386 | There are various watcher states mentioned throughout this manual - |
1491 | There are various watcher states mentioned throughout this manual - |
… | |
… | |
1388 | transition between them will be described in more detail - and while these |
1493 | transition between them will be described in more detail - and while these |
1389 | rules might look complicated, they usually do "the right thing". |
1494 | rules might look complicated, they usually do "the right thing". |
1390 | |
1495 | |
1391 | =over 4 |
1496 | =over 4 |
1392 | |
1497 | |
1393 | =item initialiased |
1498 | =item initialised |
1394 | |
1499 | |
1395 | Before a watcher can be registered with the event loop it has to be |
1500 | Before a watcher can be registered with the event loop it has to be |
1396 | initialised. This can be done with a call to C<ev_TYPE_init>, or calls to |
1501 | initialised. This can be done with a call to C<ev_TYPE_init>, or calls to |
1397 | C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. |
1502 | C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. |
1398 | |
1503 | |
… | |
… | |
1403 | |
1508 | |
1404 | =item started/running/active |
1509 | =item started/running/active |
1405 | |
1510 | |
1406 | Once a watcher has been started with a call to C<ev_TYPE_start> it becomes |
1511 | Once a watcher has been started with a call to C<ev_TYPE_start> it becomes |
1407 | property of the event loop, and is actively waiting for events. While in |
1512 | property of the event loop, and is actively waiting for events. While in |
1408 | this state it cannot be accessed (except in a few documented ways), moved, |
1513 | this state it cannot be accessed (except in a few documented ways, such as |
1409 | freed or anything else - the only legal thing is to keep a pointer to it, |
1514 | stoping it), moved, freed or anything else - the only legal thing is to |
1410 | and call libev functions on it that are documented to work on active watchers. |
1515 | keep a pointer to it, and call libev functions on it that are documented |
|
|
1516 | to work on active watchers. |
|
|
1517 | |
|
|
1518 | As a rule of thumb, before accessing a member or calling any function on |
|
|
1519 | a watcher, it should be stopped (or freshly initialised). If that is not |
|
|
1520 | convenient, you can check the documentation for that function or member to |
|
|
1521 | see if it is safe to use on an active watcher. |
1411 | |
1522 | |
1412 | =item pending |
1523 | =item pending |
1413 | |
1524 | |
1414 | If a watcher is active and libev determines that an event it is interested |
1525 | If a watcher is active and libev determines that an event it is interested |
1415 | in has occurred (such as a timer expiring), it will become pending. It will |
1526 | in has occurred (such as a timer expiring), it will become pending. It |
1416 | stay in this pending state until either it is stopped or its callback is |
1527 | will stay in this pending state until either it is explicitly stopped or |
1417 | about to be invoked, so it is not normally pending inside the watcher |
1528 | its callback is about to be invoked, so it is not normally pending inside |
1418 | callback. |
1529 | the watcher callback. |
1419 | |
1530 | |
1420 | The watcher might or might not be active while it is pending (for example, |
1531 | Generally, the watcher might or might not be active while it is pending |
1421 | an expired non-repeating timer can be pending but no longer active). If it |
1532 | (for example, an expired non-repeating timer can be pending but no longer |
1422 | is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>), |
1533 | active). If it is pending but not active, it can be freely accessed (e.g. |
1423 | but it is still property of the event loop at this time, so cannot be |
1534 | by calling C<ev_TYPE_set>), but it is still property of the event loop at |
1424 | moved, freed or reused. And if it is active the rules described in the |
1535 | this time, so cannot be moved, freed or reused. And if it is active the |
1425 | previous item still apply. |
1536 | rules described in the previous item still apply. |
|
|
1537 | |
|
|
1538 | Explicitly stopping a watcher will also clear the pending state |
|
|
1539 | unconditionally, so it is safe to stop a watcher and then free it. |
1426 | |
1540 | |
1427 | It is also possible to feed an event on a watcher that is not active (e.g. |
1541 | It is also possible to feed an event on a watcher that is not active (e.g. |
1428 | via C<ev_feed_event>), in which case it becomes pending without being |
1542 | via C<ev_feed_event>), in which case it becomes pending without being |
1429 | active. |
1543 | active. |
1430 | |
1544 | |
… | |
… | |
1447 | |
1561 | |
1448 | Many event loops support I<watcher priorities>, which are usually small |
1562 | Many event loops support I<watcher priorities>, which are usually small |
1449 | integers that influence the ordering of event callback invocation |
1563 | integers that influence the ordering of event callback invocation |
1450 | between watchers in some way, all else being equal. |
1564 | between watchers in some way, all else being equal. |
1451 | |
1565 | |
1452 | In libev, Watcher priorities can be set using C<ev_set_priority>. See its |
1566 | In libev, watcher priorities can be set using C<ev_set_priority>. See its |
1453 | description for the more technical details such as the actual priority |
1567 | description for the more technical details such as the actual priority |
1454 | range. |
1568 | range. |
1455 | |
1569 | |
1456 | There are two common ways how these these priorities are being interpreted |
1570 | There are two common ways how these these priorities are being interpreted |
1457 | by event loops: |
1571 | by event loops: |
… | |
… | |
1551 | |
1665 | |
1552 | This section describes each watcher in detail, but will not repeat |
1666 | This section describes each watcher in detail, but will not repeat |
1553 | information given in the last section. Any initialisation/set macros, |
1667 | information given in the last section. Any initialisation/set macros, |
1554 | functions and members specific to the watcher type are explained. |
1668 | functions and members specific to the watcher type are explained. |
1555 | |
1669 | |
1556 | Members are additionally marked with either I<[read-only]>, meaning that, |
1670 | Most members are additionally marked with either I<[read-only]>, meaning |
1557 | while the watcher is active, you can look at the member and expect some |
1671 | that, while the watcher is active, you can look at the member and expect |
1558 | sensible content, but you must not modify it (you can modify it while the |
1672 | some sensible content, but you must not modify it (you can modify it while |
1559 | watcher is stopped to your hearts content), or I<[read-write]>, which |
1673 | the watcher is stopped to your hearts content), or I<[read-write]>, which |
1560 | means you can expect it to have some sensible content while the watcher |
1674 | means you can expect it to have some sensible content while the watcher is |
1561 | is active, but you can also modify it. Modifying it may not do something |
1675 | active, but you can also modify it (within the same thread as the event |
|
|
1676 | loop, i.e. without creating data races). Modifying it may not do something |
1562 | sensible or take immediate effect (or do anything at all), but libev will |
1677 | sensible or take immediate effect (or do anything at all), but libev will |
1563 | not crash or malfunction in any way. |
1678 | not crash or malfunction in any way. |
1564 | |
1679 | |
|
|
1680 | In any case, the documentation for each member will explain what the |
|
|
1681 | effects are, and if there are any additional access restrictions. |
1565 | |
1682 | |
1566 | =head2 C<ev_io> - is this file descriptor readable or writable? |
1683 | =head2 C<ev_io> - is this file descriptor readable or writable? |
1567 | |
1684 | |
1568 | I/O watchers check whether a file descriptor is readable or writable |
1685 | I/O watchers check whether a file descriptor is readable or writable |
1569 | in each iteration of the event loop, or, more precisely, when reading |
1686 | in each iteration of the event loop, or, more precisely, when reading |
… | |
… | |
1596 | |
1713 | |
1597 | But really, best use non-blocking mode. |
1714 | But really, best use non-blocking mode. |
1598 | |
1715 | |
1599 | =head3 The special problem of disappearing file descriptors |
1716 | =head3 The special problem of disappearing file descriptors |
1600 | |
1717 | |
1601 | Some backends (e.g. kqueue, epoll) need to be told about closing a file |
1718 | Some backends (e.g. kqueue, epoll, linuxaio) need to be told about closing |
1602 | descriptor (either due to calling C<close> explicitly or any other means, |
1719 | a file descriptor (either due to calling C<close> explicitly or any other |
1603 | such as C<dup2>). The reason is that you register interest in some file |
1720 | means, such as C<dup2>). The reason is that you register interest in some |
1604 | descriptor, but when it goes away, the operating system will silently drop |
1721 | file descriptor, but when it goes away, the operating system will silently |
1605 | this interest. If another file descriptor with the same number then is |
1722 | drop this interest. If another file descriptor with the same number then |
1606 | registered with libev, there is no efficient way to see that this is, in |
1723 | is registered with libev, there is no efficient way to see that this is, |
1607 | fact, a different file descriptor. |
1724 | in fact, a different file descriptor. |
1608 | |
1725 | |
1609 | To avoid having to explicitly tell libev about such cases, libev follows |
1726 | To avoid having to explicitly tell libev about such cases, libev follows |
1610 | the following policy: Each time C<ev_io_set> is being called, libev |
1727 | the following policy: Each time C<ev_io_set> is being called, libev |
1611 | will assume that this is potentially a new file descriptor, otherwise |
1728 | will assume that this is potentially a new file descriptor, otherwise |
1612 | it is assumed that the file descriptor stays the same. That means that |
1729 | it is assumed that the file descriptor stays the same. That means that |
… | |
… | |
1661 | when you rarely read from a file instead of from a socket, and want to |
1778 | when you rarely read from a file instead of from a socket, and want to |
1662 | reuse the same code path. |
1779 | reuse the same code path. |
1663 | |
1780 | |
1664 | =head3 The special problem of fork |
1781 | =head3 The special problem of fork |
1665 | |
1782 | |
1666 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
1783 | Some backends (epoll, kqueue, linuxaio, iouring) do not support C<fork ()> |
1667 | useless behaviour. Libev fully supports fork, but needs to be told about |
1784 | at all or exhibit useless behaviour. Libev fully supports fork, but needs |
1668 | it in the child if you want to continue to use it in the child. |
1785 | to be told about it in the child if you want to continue to use it in the |
|
|
1786 | child. |
1669 | |
1787 | |
1670 | To support fork in your child processes, you have to call C<ev_loop_fork |
1788 | To support fork in your child processes, you have to call C<ev_loop_fork |
1671 | ()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to |
1789 | ()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to |
1672 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1790 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1673 | |
1791 | |
… | |
… | |
1728 | =item ev_io_init (ev_io *, callback, int fd, int events) |
1846 | =item ev_io_init (ev_io *, callback, int fd, int events) |
1729 | |
1847 | |
1730 | =item ev_io_set (ev_io *, int fd, int events) |
1848 | =item ev_io_set (ev_io *, int fd, int events) |
1731 | |
1849 | |
1732 | Configures an C<ev_io> watcher. The C<fd> is the file descriptor to |
1850 | Configures an C<ev_io> watcher. The C<fd> is the file descriptor to |
1733 | receive events for and C<events> is either C<EV_READ>, C<EV_WRITE> or |
1851 | receive events for and C<events> is either C<EV_READ>, C<EV_WRITE>, both |
1734 | C<EV_READ | EV_WRITE>, to express the desire to receive the given events. |
1852 | C<EV_READ | EV_WRITE> or C<0>, to express the desire to receive the given |
|
|
1853 | events. |
1735 | |
1854 | |
1736 | =item int fd [read-only] |
1855 | Note that setting the C<events> to C<0> and starting the watcher is |
|
|
1856 | supported, but not specially optimized - if your program sometimes happens |
|
|
1857 | to generate this combination this is fine, but if it is easy to avoid |
|
|
1858 | starting an io watcher watching for no events you should do so. |
1737 | |
1859 | |
1738 | The file descriptor being watched. |
1860 | =item ev_io_modify (ev_io *, int events) |
1739 | |
1861 | |
|
|
1862 | Similar to C<ev_io_set>, but only changes the requested events. Using this |
|
|
1863 | might be faster with some backends, as libev can assume that the C<fd> |
|
|
1864 | still refers to the same underlying file description, something it cannot |
|
|
1865 | do when using C<ev_io_set>. |
|
|
1866 | |
|
|
1867 | =item int fd [no-modify] |
|
|
1868 | |
|
|
1869 | The file descriptor being watched. While it can be read at any time, you |
|
|
1870 | must not modify this member even when the watcher is stopped - always use |
|
|
1871 | C<ev_io_set> for that. |
|
|
1872 | |
1740 | =item int events [read-only] |
1873 | =item int events [no-modify] |
1741 | |
1874 | |
1742 | The events being watched. |
1875 | The set of events the fd is being watched for, among other flags. Remember |
|
|
1876 | that this is a bit set - to test for C<EV_READ>, use C<< w->events & |
|
|
1877 | EV_READ >>, and similarly for C<EV_WRITE>. |
|
|
1878 | |
|
|
1879 | As with C<fd>, you must not modify this member even when the watcher is |
|
|
1880 | stopped, always use C<ev_io_set> or C<ev_io_modify> for that. |
1743 | |
1881 | |
1744 | =back |
1882 | =back |
1745 | |
1883 | |
1746 | =head3 Examples |
1884 | =head3 Examples |
1747 | |
1885 | |
… | |
… | |
1874 | callback (EV_P_ ev_timer *w, int revents) |
2012 | callback (EV_P_ ev_timer *w, int revents) |
1875 | { |
2013 | { |
1876 | // calculate when the timeout would happen |
2014 | // calculate when the timeout would happen |
1877 | ev_tstamp after = last_activity - ev_now (EV_A) + timeout; |
2015 | ev_tstamp after = last_activity - ev_now (EV_A) + timeout; |
1878 | |
2016 | |
1879 | // if negative, it means we the timeout already occured |
2017 | // if negative, it means we the timeout already occurred |
1880 | if (after < 0.) |
2018 | if (after < 0.) |
1881 | { |
2019 | { |
1882 | // timeout occurred, take action |
2020 | // timeout occurred, take action |
1883 | } |
2021 | } |
1884 | else |
2022 | else |
… | |
… | |
1902 | |
2040 | |
1903 | Otherwise, we now the earliest time at which the timeout would trigger, |
2041 | Otherwise, we now the earliest time at which the timeout would trigger, |
1904 | and simply start the timer with this timeout value. |
2042 | and simply start the timer with this timeout value. |
1905 | |
2043 | |
1906 | In other words, each time the callback is invoked it will check whether |
2044 | In other words, each time the callback is invoked it will check whether |
1907 | the timeout cocured. If not, it will simply reschedule itself to check |
2045 | the timeout occurred. If not, it will simply reschedule itself to check |
1908 | again at the earliest time it could time out. Rinse. Repeat. |
2046 | again at the earliest time it could time out. Rinse. Repeat. |
1909 | |
2047 | |
1910 | This scheme causes more callback invocations (about one every 60 seconds |
2048 | This scheme causes more callback invocations (about one every 60 seconds |
1911 | minus half the average time between activity), but virtually no calls to |
2049 | minus half the average time between activity), but virtually no calls to |
1912 | libev to change the timeout. |
2050 | libev to change the timeout. |
… | |
… | |
1926 | if (activity detected) |
2064 | if (activity detected) |
1927 | last_activity = ev_now (EV_A); |
2065 | last_activity = ev_now (EV_A); |
1928 | |
2066 | |
1929 | When your timeout value changes, then the timeout can be changed by simply |
2067 | When your timeout value changes, then the timeout can be changed by simply |
1930 | providing a new value, stopping the timer and calling the callback, which |
2068 | providing a new value, stopping the timer and calling the callback, which |
1931 | will agaion do the right thing (for example, time out immediately :). |
2069 | will again do the right thing (for example, time out immediately :). |
1932 | |
2070 | |
1933 | timeout = new_value; |
2071 | timeout = new_value; |
1934 | ev_timer_stop (EV_A_ &timer); |
2072 | ev_timer_stop (EV_A_ &timer); |
1935 | callback (EV_A_ &timer, 0); |
2073 | callback (EV_A_ &timer, 0); |
1936 | |
2074 | |
… | |
… | |
2019 | |
2157 | |
2020 | The relative timeouts are calculated relative to the C<ev_now ()> |
2158 | The relative timeouts are calculated relative to the C<ev_now ()> |
2021 | time. This is usually the right thing as this timestamp refers to the time |
2159 | time. This is usually the right thing as this timestamp refers to the time |
2022 | of the event triggering whatever timeout you are modifying/starting. If |
2160 | of the event triggering whatever timeout you are modifying/starting. If |
2023 | you suspect event processing to be delayed and you I<need> to base the |
2161 | you suspect event processing to be delayed and you I<need> to base the |
2024 | timeout on the current time, use something like this to adjust for this: |
2162 | timeout on the current time, use something like the following to adjust |
|
|
2163 | for it: |
2025 | |
2164 | |
2026 | ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); |
2165 | ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.); |
2027 | |
2166 | |
2028 | If the event loop is suspended for a long time, you can also force an |
2167 | If the event loop is suspended for a long time, you can also force an |
2029 | update of the time returned by C<ev_now ()> by calling C<ev_now_update |
2168 | update of the time returned by C<ev_now ()> by calling C<ev_now_update |
2030 | ()>. |
2169 | ()>, although that will push the event time of all outstanding events |
|
|
2170 | further into the future. |
2031 | |
2171 | |
2032 | =head3 The special problem of unsynchronised clocks |
2172 | =head3 The special problem of unsynchronised clocks |
2033 | |
2173 | |
2034 | Modern systems have a variety of clocks - libev itself uses the normal |
2174 | Modern systems have a variety of clocks - libev itself uses the normal |
2035 | "wall clock" clock and, if available, the monotonic clock (to avoid time |
2175 | "wall clock" clock and, if available, the monotonic clock (to avoid time |
… | |
… | |
2098 | |
2238 | |
2099 | =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) |
2239 | =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) |
2100 | |
2240 | |
2101 | =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) |
2241 | =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) |
2102 | |
2242 | |
2103 | Configure the timer to trigger after C<after> seconds. If C<repeat> |
2243 | Configure the timer to trigger after C<after> seconds (fractional and |
2104 | is C<0.>, then it will automatically be stopped once the timeout is |
2244 | negative values are supported). If C<repeat> is C<0.>, then it will |
2105 | reached. If it is positive, then the timer will automatically be |
2245 | automatically be stopped once the timeout is reached. If it is positive, |
2106 | configured to trigger again C<repeat> seconds later, again, and again, |
2246 | then the timer will automatically be configured to trigger again C<repeat> |
2107 | until stopped manually. |
2247 | seconds later, again, and again, until stopped manually. |
2108 | |
2248 | |
2109 | The timer itself will do a best-effort at avoiding drift, that is, if |
2249 | The timer itself will do a best-effort at avoiding drift, that is, if |
2110 | you configure a timer to trigger every 10 seconds, then it will normally |
2250 | you configure a timer to trigger every 10 seconds, then it will normally |
2111 | trigger at exactly 10 second intervals. If, however, your program cannot |
2251 | trigger at exactly 10 second intervals. If, however, your program cannot |
2112 | keep up with the timer (because it takes longer than those 10 seconds to |
2252 | keep up with the timer (because it takes longer than those 10 seconds to |
… | |
… | |
2131 | =item If the timer is repeating, make the C<repeat> value the new timeout |
2271 | =item If the timer is repeating, make the C<repeat> value the new timeout |
2132 | and start the timer, if necessary. |
2272 | and start the timer, if necessary. |
2133 | |
2273 | |
2134 | =back |
2274 | =back |
2135 | |
2275 | |
2136 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
2276 | This sounds a bit complicated, see L</Be smart about timeouts>, above, for a |
2137 | usage example. |
2277 | usage example. |
2138 | |
2278 | |
2139 | =item ev_tstamp ev_timer_remaining (loop, ev_timer *) |
2279 | =item ev_tstamp ev_timer_remaining (loop, ev_timer *) |
2140 | |
2280 | |
2141 | Returns the remaining time until a timer fires. If the timer is active, |
2281 | Returns the remaining time until a timer fires. If the timer is active, |
… | |
… | |
2194 | Periodic watchers are also timers of a kind, but they are very versatile |
2334 | Periodic watchers are also timers of a kind, but they are very versatile |
2195 | (and unfortunately a bit complex). |
2335 | (and unfortunately a bit complex). |
2196 | |
2336 | |
2197 | Unlike C<ev_timer>, periodic watchers are not based on real time (or |
2337 | Unlike C<ev_timer>, periodic watchers are not based on real time (or |
2198 | relative time, the physical time that passes) but on wall clock time |
2338 | relative time, the physical time that passes) but on wall clock time |
2199 | (absolute time, the thing you can read on your calender or clock). The |
2339 | (absolute time, the thing you can read on your calendar or clock). The |
2200 | difference is that wall clock time can run faster or slower than real |
2340 | difference is that wall clock time can run faster or slower than real |
2201 | time, and time jumps are not uncommon (e.g. when you adjust your |
2341 | time, and time jumps are not uncommon (e.g. when you adjust your |
2202 | wrist-watch). |
2342 | wrist-watch). |
2203 | |
2343 | |
2204 | You can tell a periodic watcher to trigger after some specific point |
2344 | You can tell a periodic watcher to trigger after some specific point |
… | |
… | |
2209 | C<ev_timer>, which would still trigger roughly 10 seconds after starting |
2349 | C<ev_timer>, which would still trigger roughly 10 seconds after starting |
2210 | it, as it uses a relative timeout). |
2350 | it, as it uses a relative timeout). |
2211 | |
2351 | |
2212 | C<ev_periodic> watchers can also be used to implement vastly more complex |
2352 | C<ev_periodic> watchers can also be used to implement vastly more complex |
2213 | timers, such as triggering an event on each "midnight, local time", or |
2353 | timers, such as triggering an event on each "midnight, local time", or |
2214 | other complicated rules. This cannot be done with C<ev_timer> watchers, as |
2354 | other complicated rules. This cannot easily be done with C<ev_timer> |
2215 | those cannot react to time jumps. |
2355 | watchers, as those cannot react to time jumps. |
2216 | |
2356 | |
2217 | As with timers, the callback is guaranteed to be invoked only when the |
2357 | As with timers, the callback is guaranteed to be invoked only when the |
2218 | point in time where it is supposed to trigger has passed. If multiple |
2358 | point in time where it is supposed to trigger has passed. If multiple |
2219 | timers become ready during the same loop iteration then the ones with |
2359 | timers become ready during the same loop iteration then the ones with |
2220 | earlier time-out values are invoked before ones with later time-out values |
2360 | earlier time-out values are invoked before ones with later time-out values |
… | |
… | |
2306 | |
2446 | |
2307 | NOTE: I<< This callback must always return a time that is higher than or |
2447 | NOTE: I<< This callback must always return a time that is higher than or |
2308 | equal to the passed C<now> value >>. |
2448 | equal to the passed C<now> value >>. |
2309 | |
2449 | |
2310 | This can be used to create very complex timers, such as a timer that |
2450 | This can be used to create very complex timers, such as a timer that |
2311 | triggers on "next midnight, local time". To do this, you would calculate the |
2451 | triggers on "next midnight, local time". To do this, you would calculate |
2312 | next midnight after C<now> and return the timestamp value for this. How |
2452 | the next midnight after C<now> and return the timestamp value for |
2313 | you do this is, again, up to you (but it is not trivial, which is the main |
2453 | this. Here is a (completely untested, no error checking) example on how to |
2314 | reason I omitted it as an example). |
2454 | do this: |
|
|
2455 | |
|
|
2456 | #include <time.h> |
|
|
2457 | |
|
|
2458 | static ev_tstamp |
|
|
2459 | my_rescheduler (ev_periodic *w, ev_tstamp now) |
|
|
2460 | { |
|
|
2461 | time_t tnow = (time_t)now; |
|
|
2462 | struct tm tm; |
|
|
2463 | localtime_r (&tnow, &tm); |
|
|
2464 | |
|
|
2465 | tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day |
|
|
2466 | ++tm.tm_mday; // midnight next day |
|
|
2467 | |
|
|
2468 | return mktime (&tm); |
|
|
2469 | } |
|
|
2470 | |
|
|
2471 | Note: this code might run into trouble on days that have more then two |
|
|
2472 | midnights (beginning and end). |
2315 | |
2473 | |
2316 | =back |
2474 | =back |
2317 | |
2475 | |
2318 | =item ev_periodic_again (loop, ev_periodic *) |
2476 | =item ev_periodic_again (loop, ev_periodic *) |
2319 | |
2477 | |
… | |
… | |
2384 | |
2542 | |
2385 | ev_periodic hourly_tick; |
2543 | ev_periodic hourly_tick; |
2386 | ev_periodic_init (&hourly_tick, clock_cb, |
2544 | ev_periodic_init (&hourly_tick, clock_cb, |
2387 | fmod (ev_now (loop), 3600.), 3600., 0); |
2545 | fmod (ev_now (loop), 3600.), 3600., 0); |
2388 | ev_periodic_start (loop, &hourly_tick); |
2546 | ev_periodic_start (loop, &hourly_tick); |
2389 | |
2547 | |
2390 | |
2548 | |
2391 | =head2 C<ev_signal> - signal me when a signal gets signalled! |
2549 | =head2 C<ev_signal> - signal me when a signal gets signalled! |
2392 | |
2550 | |
2393 | Signal watchers will trigger an event when the process receives a specific |
2551 | Signal watchers will trigger an event when the process receives a specific |
2394 | signal one or more times. Even though signals are very asynchronous, libev |
2552 | signal one or more times. Even though signals are very asynchronous, libev |
… | |
… | |
2404 | only within the same loop, i.e. you can watch for C<SIGINT> in your |
2562 | only within the same loop, i.e. you can watch for C<SIGINT> in your |
2405 | default loop and for C<SIGIO> in another loop, but you cannot watch for |
2563 | default loop and for C<SIGIO> in another loop, but you cannot watch for |
2406 | C<SIGINT> in both the default loop and another loop at the same time. At |
2564 | C<SIGINT> in both the default loop and another loop at the same time. At |
2407 | the moment, C<SIGCHLD> is permanently tied to the default loop. |
2565 | the moment, C<SIGCHLD> is permanently tied to the default loop. |
2408 | |
2566 | |
2409 | When the first watcher gets started will libev actually register something |
2567 | Only after the first watcher for a signal is started will libev actually |
2410 | with the kernel (thus it coexists with your own signal handlers as long as |
2568 | register something with the kernel. It thus coexists with your own signal |
2411 | you don't register any with libev for the same signal). |
2569 | handlers as long as you don't register any with libev for the same signal. |
2412 | |
2570 | |
2413 | If possible and supported, libev will install its handlers with |
2571 | If possible and supported, libev will install its handlers with |
2414 | C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should |
2572 | C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should |
2415 | not be unduly interrupted. If you have a problem with system calls getting |
2573 | not be unduly interrupted. If you have a problem with system calls getting |
2416 | interrupted by signals you can block all signals in an C<ev_check> watcher |
2574 | interrupted by signals you can block all signals in an C<ev_check> watcher |
… | |
… | |
2601 | |
2759 | |
2602 | =head2 C<ev_stat> - did the file attributes just change? |
2760 | =head2 C<ev_stat> - did the file attributes just change? |
2603 | |
2761 | |
2604 | This watches a file system path for attribute changes. That is, it calls |
2762 | This watches a file system path for attribute changes. That is, it calls |
2605 | C<stat> on that path in regular intervals (or when the OS says it changed) |
2763 | C<stat> on that path in regular intervals (or when the OS says it changed) |
2606 | and sees if it changed compared to the last time, invoking the callback if |
2764 | and sees if it changed compared to the last time, invoking the callback |
2607 | it did. |
2765 | if it did. Starting the watcher C<stat>'s the file, so only changes that |
|
|
2766 | happen after the watcher has been started will be reported. |
2608 | |
2767 | |
2609 | The path does not need to exist: changing from "path exists" to "path does |
2768 | The path does not need to exist: changing from "path exists" to "path does |
2610 | not exist" is a status change like any other. The condition "path does not |
2769 | not exist" is a status change like any other. The condition "path does not |
2611 | exist" (or more correctly "path cannot be stat'ed") is signified by the |
2770 | exist" (or more correctly "path cannot be stat'ed") is signified by the |
2612 | C<st_nlink> field being zero (which is otherwise always forced to be at |
2771 | C<st_nlink> field being zero (which is otherwise always forced to be at |
… | |
… | |
2842 | Apart from keeping your process non-blocking (which is a useful |
3001 | Apart from keeping your process non-blocking (which is a useful |
2843 | effect on its own sometimes), idle watchers are a good place to do |
3002 | effect on its own sometimes), idle watchers are a good place to do |
2844 | "pseudo-background processing", or delay processing stuff to after the |
3003 | "pseudo-background processing", or delay processing stuff to after the |
2845 | event loop has handled all outstanding events. |
3004 | event loop has handled all outstanding events. |
2846 | |
3005 | |
|
|
3006 | =head3 Abusing an C<ev_idle> watcher for its side-effect |
|
|
3007 | |
|
|
3008 | As long as there is at least one active idle watcher, libev will never |
|
|
3009 | sleep unnecessarily. Or in other words, it will loop as fast as possible. |
|
|
3010 | For this to work, the idle watcher doesn't need to be invoked at all - the |
|
|
3011 | lowest priority will do. |
|
|
3012 | |
|
|
3013 | This mode of operation can be useful together with an C<ev_check> watcher, |
|
|
3014 | to do something on each event loop iteration - for example to balance load |
|
|
3015 | between different connections. |
|
|
3016 | |
|
|
3017 | See L</Abusing an ev_check watcher for its side-effect> for a longer |
|
|
3018 | example. |
|
|
3019 | |
2847 | =head3 Watcher-Specific Functions and Data Members |
3020 | =head3 Watcher-Specific Functions and Data Members |
2848 | |
3021 | |
2849 | =over 4 |
3022 | =over 4 |
2850 | |
3023 | |
2851 | =item ev_idle_init (ev_idle *, callback) |
3024 | =item ev_idle_init (ev_idle *, callback) |
… | |
… | |
2862 | callback, free it. Also, use no error checking, as usual. |
3035 | callback, free it. Also, use no error checking, as usual. |
2863 | |
3036 | |
2864 | static void |
3037 | static void |
2865 | idle_cb (struct ev_loop *loop, ev_idle *w, int revents) |
3038 | idle_cb (struct ev_loop *loop, ev_idle *w, int revents) |
2866 | { |
3039 | { |
|
|
3040 | // stop the watcher |
|
|
3041 | ev_idle_stop (loop, w); |
|
|
3042 | |
|
|
3043 | // now we can free it |
2867 | free (w); |
3044 | free (w); |
|
|
3045 | |
2868 | // now do something you wanted to do when the program has |
3046 | // now do something you wanted to do when the program has |
2869 | // no longer anything immediate to do. |
3047 | // no longer anything immediate to do. |
2870 | } |
3048 | } |
2871 | |
3049 | |
2872 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
3050 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
… | |
… | |
2874 | ev_idle_start (loop, idle_watcher); |
3052 | ev_idle_start (loop, idle_watcher); |
2875 | |
3053 | |
2876 | |
3054 | |
2877 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
3055 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
2878 | |
3056 | |
2879 | Prepare and check watchers are usually (but not always) used in pairs: |
3057 | Prepare and check watchers are often (but not always) used in pairs: |
2880 | prepare watchers get invoked before the process blocks and check watchers |
3058 | prepare watchers get invoked before the process blocks and check watchers |
2881 | afterwards. |
3059 | afterwards. |
2882 | |
3060 | |
2883 | You I<must not> call C<ev_run> or similar functions that enter |
3061 | You I<must not> call C<ev_run> (or similar functions that enter the |
2884 | the current event loop from either C<ev_prepare> or C<ev_check> |
3062 | current event loop) or C<ev_loop_fork> from either C<ev_prepare> or |
2885 | watchers. Other loops than the current one are fine, however. The |
3063 | C<ev_check> watchers. Other loops than the current one are fine, |
2886 | rationale behind this is that you do not need to check for recursion in |
3064 | however. The rationale behind this is that you do not need to check |
2887 | those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, |
3065 | for recursion in those watchers, i.e. the sequence will always be |
2888 | C<ev_check> so if you have one watcher of each kind they will always be |
3066 | C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each |
2889 | called in pairs bracketing the blocking call. |
3067 | kind they will always be called in pairs bracketing the blocking call. |
2890 | |
3068 | |
2891 | Their main purpose is to integrate other event mechanisms into libev and |
3069 | Their main purpose is to integrate other event mechanisms into libev and |
2892 | their use is somewhat advanced. They could be used, for example, to track |
3070 | their use is somewhat advanced. They could be used, for example, to track |
2893 | variable changes, implement your own watchers, integrate net-snmp or a |
3071 | variable changes, implement your own watchers, integrate net-snmp or a |
2894 | coroutine library and lots more. They are also occasionally useful if |
3072 | coroutine library and lots more. They are also occasionally useful if |
… | |
… | |
2912 | with priority higher than or equal to the event loop and one coroutine |
3090 | with priority higher than or equal to the event loop and one coroutine |
2913 | of lower priority, but only once, using idle watchers to keep the event |
3091 | of lower priority, but only once, using idle watchers to keep the event |
2914 | loop from blocking if lower-priority coroutines are active, thus mapping |
3092 | loop from blocking if lower-priority coroutines are active, thus mapping |
2915 | low-priority coroutines to idle/background tasks). |
3093 | low-priority coroutines to idle/background tasks). |
2916 | |
3094 | |
2917 | It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) |
3095 | When used for this purpose, it is recommended to give C<ev_check> watchers |
2918 | priority, to ensure that they are being run before any other watchers |
3096 | highest (C<EV_MAXPRI>) priority, to ensure that they are being run before |
2919 | after the poll (this doesn't matter for C<ev_prepare> watchers). |
3097 | any other watchers after the poll (this doesn't matter for C<ev_prepare> |
|
|
3098 | watchers). |
2920 | |
3099 | |
2921 | Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not |
3100 | Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not |
2922 | activate ("feed") events into libev. While libev fully supports this, they |
3101 | activate ("feed") events into libev. While libev fully supports this, they |
2923 | might get executed before other C<ev_check> watchers did their job. As |
3102 | might get executed before other C<ev_check> watchers did their job. As |
2924 | C<ev_check> watchers are often used to embed other (non-libev) event |
3103 | C<ev_check> watchers are often used to embed other (non-libev) event |
2925 | loops those other event loops might be in an unusable state until their |
3104 | loops those other event loops might be in an unusable state until their |
2926 | C<ev_check> watcher ran (always remind yourself to coexist peacefully with |
3105 | C<ev_check> watcher ran (always remind yourself to coexist peacefully with |
2927 | others). |
3106 | others). |
|
|
3107 | |
|
|
3108 | =head3 Abusing an C<ev_check> watcher for its side-effect |
|
|
3109 | |
|
|
3110 | C<ev_check> (and less often also C<ev_prepare>) watchers can also be |
|
|
3111 | useful because they are called once per event loop iteration. For |
|
|
3112 | example, if you want to handle a large number of connections fairly, you |
|
|
3113 | normally only do a bit of work for each active connection, and if there |
|
|
3114 | is more work to do, you wait for the next event loop iteration, so other |
|
|
3115 | connections have a chance of making progress. |
|
|
3116 | |
|
|
3117 | Using an C<ev_check> watcher is almost enough: it will be called on the |
|
|
3118 | next event loop iteration. However, that isn't as soon as possible - |
|
|
3119 | without external events, your C<ev_check> watcher will not be invoked. |
|
|
3120 | |
|
|
3121 | This is where C<ev_idle> watchers come in handy - all you need is a |
|
|
3122 | single global idle watcher that is active as long as you have one active |
|
|
3123 | C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop |
|
|
3124 | will not sleep, and the C<ev_check> watcher makes sure a callback gets |
|
|
3125 | invoked. Neither watcher alone can do that. |
2928 | |
3126 | |
2929 | =head3 Watcher-Specific Functions and Data Members |
3127 | =head3 Watcher-Specific Functions and Data Members |
2930 | |
3128 | |
2931 | =over 4 |
3129 | =over 4 |
2932 | |
3130 | |
… | |
… | |
3133 | |
3331 | |
3134 | =over 4 |
3332 | =over 4 |
3135 | |
3333 | |
3136 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
3334 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
3137 | |
3335 | |
3138 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
3336 | =item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop) |
3139 | |
3337 | |
3140 | Configures the watcher to embed the given loop, which must be |
3338 | Configures the watcher to embed the given loop, which must be |
3141 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
3339 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
3142 | invoked automatically, otherwise it is the responsibility of the callback |
3340 | invoked automatically, otherwise it is the responsibility of the callback |
3143 | to invoke it (it will continue to be called until the sweep has been done, |
3341 | to invoke it (it will continue to be called until the sweep has been done, |
… | |
… | |
3164 | used). |
3362 | used). |
3165 | |
3363 | |
3166 | struct ev_loop *loop_hi = ev_default_init (0); |
3364 | struct ev_loop *loop_hi = ev_default_init (0); |
3167 | struct ev_loop *loop_lo = 0; |
3365 | struct ev_loop *loop_lo = 0; |
3168 | ev_embed embed; |
3366 | ev_embed embed; |
3169 | |
3367 | |
3170 | // see if there is a chance of getting one that works |
3368 | // see if there is a chance of getting one that works |
3171 | // (remember that a flags value of 0 means autodetection) |
3369 | // (remember that a flags value of 0 means autodetection) |
3172 | loop_lo = ev_embeddable_backends () & ev_recommended_backends () |
3370 | loop_lo = ev_embeddable_backends () & ev_recommended_backends () |
3173 | ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) |
3371 | ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) |
3174 | : 0; |
3372 | : 0; |
… | |
… | |
3188 | C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). |
3386 | C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). |
3189 | |
3387 | |
3190 | struct ev_loop *loop = ev_default_init (0); |
3388 | struct ev_loop *loop = ev_default_init (0); |
3191 | struct ev_loop *loop_socket = 0; |
3389 | struct ev_loop *loop_socket = 0; |
3192 | ev_embed embed; |
3390 | ev_embed embed; |
3193 | |
3391 | |
3194 | if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) |
3392 | if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) |
3195 | if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) |
3393 | if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) |
3196 | { |
3394 | { |
3197 | ev_embed_init (&embed, 0, loop_socket); |
3395 | ev_embed_init (&embed, 0, loop_socket); |
3198 | ev_embed_start (loop, &embed); |
3396 | ev_embed_start (loop, &embed); |
… | |
… | |
3206 | |
3404 | |
3207 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
3405 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
3208 | |
3406 | |
3209 | Fork watchers are called when a C<fork ()> was detected (usually because |
3407 | Fork watchers are called when a C<fork ()> was detected (usually because |
3210 | whoever is a good citizen cared to tell libev about it by calling |
3408 | whoever is a good citizen cared to tell libev about it by calling |
3211 | C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the |
3409 | C<ev_loop_fork>). The invocation is done before the event loop blocks next |
3212 | event loop blocks next and before C<ev_check> watchers are being called, |
3410 | and before C<ev_check> watchers are being called, and only in the child |
3213 | and only in the child after the fork. If whoever good citizen calling |
3411 | after the fork. If whoever good citizen calling C<ev_default_fork> cheats |
3214 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
3412 | and calls it in the wrong process, the fork handlers will be invoked, too, |
3215 | handlers will be invoked, too, of course. |
3413 | of course. |
3216 | |
3414 | |
3217 | =head3 The special problem of life after fork - how is it possible? |
3415 | =head3 The special problem of life after fork - how is it possible? |
3218 | |
3416 | |
3219 | Most uses of C<fork()> consist of forking, then some simple calls to set |
3417 | Most uses of C<fork ()> consist of forking, then some simple calls to set |
3220 | up/change the process environment, followed by a call to C<exec()>. This |
3418 | up/change the process environment, followed by a call to C<exec()>. This |
3221 | sequence should be handled by libev without any problems. |
3419 | sequence should be handled by libev without any problems. |
3222 | |
3420 | |
3223 | This changes when the application actually wants to do event handling |
3421 | This changes when the application actually wants to do event handling |
3224 | in the child, or both parent in child, in effect "continuing" after the |
3422 | in the child, or both parent in child, in effect "continuing" after the |
… | |
… | |
3313 | it by calling C<ev_async_send>, which is thread- and signal safe. |
3511 | it by calling C<ev_async_send>, which is thread- and signal safe. |
3314 | |
3512 | |
3315 | This functionality is very similar to C<ev_signal> watchers, as signals, |
3513 | This functionality is very similar to C<ev_signal> watchers, as signals, |
3316 | too, are asynchronous in nature, and signals, too, will be compressed |
3514 | too, are asynchronous in nature, and signals, too, will be compressed |
3317 | (i.e. the number of callback invocations may be less than the number of |
3515 | (i.e. the number of callback invocations may be less than the number of |
3318 | C<ev_async_sent> calls). In fact, you could use signal watchers as a kind |
3516 | C<ev_async_send> calls). In fact, you could use signal watchers as a kind |
3319 | of "global async watchers" by using a watcher on an otherwise unused |
3517 | of "global async watchers" by using a watcher on an otherwise unused |
3320 | signal, and C<ev_feed_signal> to signal this watcher from another thread, |
3518 | signal, and C<ev_feed_signal> to signal this watcher from another thread, |
3321 | even without knowing which loop owns the signal. |
3519 | even without knowing which loop owns the signal. |
3322 | |
3520 | |
3323 | =head3 Queueing |
3521 | =head3 Queueing |
… | |
… | |
3462 | |
3660 | |
3463 | There are some other functions of possible interest. Described. Here. Now. |
3661 | There are some other functions of possible interest. Described. Here. Now. |
3464 | |
3662 | |
3465 | =over 4 |
3663 | =over 4 |
3466 | |
3664 | |
3467 | =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback) |
3665 | =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg) |
3468 | |
3666 | |
3469 | This function combines a simple timer and an I/O watcher, calls your |
3667 | This function combines a simple timer and an I/O watcher, calls your |
3470 | callback on whichever event happens first and automatically stops both |
3668 | callback on whichever event happens first and automatically stops both |
3471 | watchers. This is useful if you want to wait for a single event on an fd |
3669 | watchers. This is useful if you want to wait for a single event on an fd |
3472 | or timeout without having to allocate/configure/start/stop/free one or |
3670 | or timeout without having to allocate/configure/start/stop/free one or |
… | |
… | |
3614 | already been invoked. |
3812 | already been invoked. |
3615 | |
3813 | |
3616 | A common way around all these issues is to make sure that |
3814 | A common way around all these issues is to make sure that |
3617 | C<start_new_request> I<always> returns before the callback is invoked. If |
3815 | C<start_new_request> I<always> returns before the callback is invoked. If |
3618 | C<start_new_request> immediately knows the result, it can artificially |
3816 | C<start_new_request> immediately knows the result, it can artificially |
3619 | delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher |
3817 | delay invoking the callback by using a C<prepare> or C<idle> watcher for |
3620 | for example, or more sneakily, by reusing an existing (stopped) watcher |
3818 | example, or more sneakily, by reusing an existing (stopped) watcher and |
3621 | and pushing it into the pending queue: |
3819 | pushing it into the pending queue: |
3622 | |
3820 | |
3623 | ev_set_cb (watcher, callback); |
3821 | ev_set_cb (watcher, callback); |
3624 | ev_feed_event (EV_A_ watcher, 0); |
3822 | ev_feed_event (EV_A_ watcher, 0); |
3625 | |
3823 | |
3626 | This way, C<start_new_request> can safely return before the callback is |
3824 | This way, C<start_new_request> can safely return before the callback is |
… | |
… | |
3634 | |
3832 | |
3635 | This brings the problem of exiting - a callback might want to finish the |
3833 | This brings the problem of exiting - a callback might want to finish the |
3636 | main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but |
3834 | main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but |
3637 | a modal "Are you sure?" dialog is still waiting), or just the nested one |
3835 | a modal "Are you sure?" dialog is still waiting), or just the nested one |
3638 | and not the main one (e.g. user clocked "Ok" in a modal dialog), or some |
3836 | and not the main one (e.g. user clocked "Ok" in a modal dialog), or some |
3639 | other combination: In these cases, C<ev_break> will not work alone. |
3837 | other combination: In these cases, a simple C<ev_break> will not work. |
3640 | |
3838 | |
3641 | The solution is to maintain "break this loop" variable for each C<ev_run> |
3839 | The solution is to maintain "break this loop" variable for each C<ev_run> |
3642 | invocation, and use a loop around C<ev_run> until the condition is |
3840 | invocation, and use a loop around C<ev_run> until the condition is |
3643 | triggered, using C<EVRUN_ONCE>: |
3841 | triggered, using C<EVRUN_ONCE>: |
3644 | |
3842 | |
… | |
… | |
3680 | event loop thread and an unspecified mechanism to wake up the main thread. |
3878 | event loop thread and an unspecified mechanism to wake up the main thread. |
3681 | |
3879 | |
3682 | First, you need to associate some data with the event loop: |
3880 | First, you need to associate some data with the event loop: |
3683 | |
3881 | |
3684 | typedef struct { |
3882 | typedef struct { |
3685 | mutex_t lock; /* global loop lock */ |
3883 | pthread_mutex_t lock; /* global loop lock */ |
|
|
3884 | pthread_t tid; |
|
|
3885 | pthread_cond_t invoke_cv; |
3686 | ev_async async_w; |
3886 | ev_async async_w; |
3687 | thread_t tid; |
|
|
3688 | cond_t invoke_cv; |
|
|
3689 | } userdata; |
3887 | } userdata; |
3690 | |
3888 | |
3691 | void prepare_loop (EV_P) |
3889 | void prepare_loop (EV_P) |
3692 | { |
3890 | { |
3693 | // for simplicity, we use a static userdata struct. |
3891 | // for simplicity, we use a static userdata struct. |
3694 | static userdata u; |
3892 | static userdata u; |
3695 | |
3893 | |
3696 | ev_async_init (&u->async_w, async_cb); |
3894 | ev_async_init (&u.async_w, async_cb); |
3697 | ev_async_start (EV_A_ &u->async_w); |
3895 | ev_async_start (EV_A_ &u.async_w); |
3698 | |
3896 | |
3699 | pthread_mutex_init (&u->lock, 0); |
3897 | pthread_mutex_init (&u.lock, 0); |
3700 | pthread_cond_init (&u->invoke_cv, 0); |
3898 | pthread_cond_init (&u.invoke_cv, 0); |
3701 | |
3899 | |
3702 | // now associate this with the loop |
3900 | // now associate this with the loop |
3703 | ev_set_userdata (EV_A_ u); |
3901 | ev_set_userdata (EV_A_ &u); |
3704 | ev_set_invoke_pending_cb (EV_A_ l_invoke); |
3902 | ev_set_invoke_pending_cb (EV_A_ l_invoke); |
3705 | ev_set_loop_release_cb (EV_A_ l_release, l_acquire); |
3903 | ev_set_loop_release_cb (EV_A_ l_release, l_acquire); |
3706 | |
3904 | |
3707 | // then create the thread running ev_run |
3905 | // then create the thread running ev_run |
3708 | pthread_create (&u->tid, 0, l_run, EV_A); |
3906 | pthread_create (&u.tid, 0, l_run, EV_A); |
3709 | } |
3907 | } |
3710 | |
3908 | |
3711 | The callback for the C<ev_async> watcher does nothing: the watcher is used |
3909 | The callback for the C<ev_async> watcher does nothing: the watcher is used |
3712 | solely to wake up the event loop so it takes notice of any new watchers |
3910 | solely to wake up the event loop so it takes notice of any new watchers |
3713 | that might have been added: |
3911 | that might have been added: |
… | |
… | |
3830 | called): |
4028 | called): |
3831 | |
4029 | |
3832 | void |
4030 | void |
3833 | wait_for_event (ev_watcher *w) |
4031 | wait_for_event (ev_watcher *w) |
3834 | { |
4032 | { |
3835 | ev_cb_set (w) = current_coro; |
4033 | ev_set_cb (w, current_coro); |
3836 | switch_to (libev_coro); |
4034 | switch_to (libev_coro); |
3837 | } |
4035 | } |
3838 | |
4036 | |
3839 | That basically suspends the coroutine inside C<wait_for_event> and |
4037 | That basically suspends the coroutine inside C<wait_for_event> and |
3840 | continues the libev coroutine, which, when appropriate, switches back to |
4038 | continues the libev coroutine, which, when appropriate, switches back to |
… | |
… | |
3843 | You can do similar tricks if you have, say, threads with an event queue - |
4041 | You can do similar tricks if you have, say, threads with an event queue - |
3844 | instead of storing a coroutine, you store the queue object and instead of |
4042 | instead of storing a coroutine, you store the queue object and instead of |
3845 | switching to a coroutine, you push the watcher onto the queue and notify |
4043 | switching to a coroutine, you push the watcher onto the queue and notify |
3846 | any waiters. |
4044 | any waiters. |
3847 | |
4045 | |
3848 | To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two |
4046 | To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two |
3849 | files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: |
4047 | files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: |
3850 | |
4048 | |
3851 | // my_ev.h |
4049 | // my_ev.h |
3852 | #define EV_CB_DECLARE(type) struct my_coro *cb; |
4050 | #define EV_CB_DECLARE(type) struct my_coro *cb; |
3853 | #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); |
4051 | #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb) |
3854 | #include "../libev/ev.h" |
4052 | #include "../libev/ev.h" |
3855 | |
4053 | |
3856 | // my_ev.c |
4054 | // my_ev.c |
3857 | #define EV_H "my_ev.h" |
4055 | #define EV_H "my_ev.h" |
3858 | #include "../libev/ev.c" |
4056 | #include "../libev/ev.c" |
… | |
… | |
3897 | |
4095 | |
3898 | =back |
4096 | =back |
3899 | |
4097 | |
3900 | =head1 C++ SUPPORT |
4098 | =head1 C++ SUPPORT |
3901 | |
4099 | |
|
|
4100 | =head2 C API |
|
|
4101 | |
|
|
4102 | The normal C API should work fine when used from C++: both ev.h and the |
|
|
4103 | libev sources can be compiled as C++. Therefore, code that uses the C API |
|
|
4104 | will work fine. |
|
|
4105 | |
|
|
4106 | Proper exception specifications might have to be added to callbacks passed |
|
|
4107 | to libev: exceptions may be thrown only from watcher callbacks, all other |
|
|
4108 | callbacks (allocator, syserr, loop acquire/release and periodic reschedule |
|
|
4109 | callbacks) must not throw exceptions, and might need a C<noexcept> |
|
|
4110 | specification. If you have code that needs to be compiled as both C and |
|
|
4111 | C++ you can use the C<EV_NOEXCEPT> macro for this: |
|
|
4112 | |
|
|
4113 | static void |
|
|
4114 | fatal_error (const char *msg) EV_NOEXCEPT |
|
|
4115 | { |
|
|
4116 | perror (msg); |
|
|
4117 | abort (); |
|
|
4118 | } |
|
|
4119 | |
|
|
4120 | ... |
|
|
4121 | ev_set_syserr_cb (fatal_error); |
|
|
4122 | |
|
|
4123 | The only API functions that can currently throw exceptions are C<ev_run>, |
|
|
4124 | C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter |
|
|
4125 | because it runs cleanup watchers). |
|
|
4126 | |
|
|
4127 | Throwing exceptions in watcher callbacks is only supported if libev itself |
|
|
4128 | is compiled with a C++ compiler or your C and C++ environments allow |
|
|
4129 | throwing exceptions through C libraries (most do). |
|
|
4130 | |
|
|
4131 | =head2 C++ API |
|
|
4132 | |
3902 | Libev comes with some simplistic wrapper classes for C++ that mainly allow |
4133 | Libev comes with some simplistic wrapper classes for C++ that mainly allow |
3903 | you to use some convenience methods to start/stop watchers and also change |
4134 | you to use some convenience methods to start/stop watchers and also change |
3904 | the callback model to a model using method callbacks on objects. |
4135 | the callback model to a model using method callbacks on objects. |
3905 | |
4136 | |
3906 | To use it, |
4137 | To use it, |
3907 | |
4138 | |
3908 | #include <ev++.h> |
4139 | #include <ev++.h> |
3909 | |
4140 | |
3910 | This automatically includes F<ev.h> and puts all of its definitions (many |
4141 | This automatically includes F<ev.h> and puts all of its definitions (many |
3911 | of them macros) into the global namespace. All C++ specific things are |
4142 | of them macros) into the global namespace. All C++ specific things are |
3912 | put into the C<ev> namespace. It should support all the same embedding |
4143 | put into the C<ev> namespace. It should support all the same embedding |
… | |
… | |
4015 | void operator() (ev::io &w, int revents) |
4246 | void operator() (ev::io &w, int revents) |
4016 | { |
4247 | { |
4017 | ... |
4248 | ... |
4018 | } |
4249 | } |
4019 | } |
4250 | } |
4020 | |
4251 | |
4021 | myfunctor f; |
4252 | myfunctor f; |
4022 | |
4253 | |
4023 | ev::io w; |
4254 | ev::io w; |
4024 | w.set (&f); |
4255 | w.set (&f); |
4025 | |
4256 | |
… | |
… | |
4043 | Associates a different C<struct ev_loop> with this watcher. You can only |
4274 | Associates a different C<struct ev_loop> with this watcher. You can only |
4044 | do this when the watcher is inactive (and not pending either). |
4275 | do this when the watcher is inactive (and not pending either). |
4045 | |
4276 | |
4046 | =item w->set ([arguments]) |
4277 | =item w->set ([arguments]) |
4047 | |
4278 | |
4048 | Basically the same as C<ev_TYPE_set>, with the same arguments. Either this |
4279 | Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>), |
4049 | method or a suitable start method must be called at least once. Unlike the |
4280 | with the same arguments. Either this method or a suitable start method |
4050 | C counterpart, an active watcher gets automatically stopped and restarted |
4281 | must be called at least once. Unlike the C counterpart, an active watcher |
4051 | when reconfiguring it with this method. |
4282 | gets automatically stopped and restarted when reconfiguring it with this |
|
|
4283 | method. |
|
|
4284 | |
|
|
4285 | For C<ev::embed> watchers this method is called C<set_embed>, to avoid |
|
|
4286 | clashing with the C<set (loop)> method. |
|
|
4287 | |
|
|
4288 | For C<ev::io> watchers there is an additional C<set> method that acepts a |
|
|
4289 | new event mask only, and internally calls C<ev_io_modify>. |
4052 | |
4290 | |
4053 | =item w->start () |
4291 | =item w->start () |
4054 | |
4292 | |
4055 | Starts the watcher. Note that there is no C<loop> argument, as the |
4293 | Starts the watcher. Note that there is no C<loop> argument, as the |
4056 | constructor already stores the event loop. |
4294 | constructor already stores the event loop. |
… | |
… | |
4160 | |
4398 | |
4161 | Brian Maher has written a partial interface to libev for lua (at the |
4399 | Brian Maher has written a partial interface to libev for lua (at the |
4162 | time of this writing, only C<ev_io> and C<ev_timer>), to be found at |
4400 | time of this writing, only C<ev_io> and C<ev_timer>), to be found at |
4163 | L<http://github.com/brimworks/lua-ev>. |
4401 | L<http://github.com/brimworks/lua-ev>. |
4164 | |
4402 | |
|
|
4403 | =item Javascript |
|
|
4404 | |
|
|
4405 | Node.js (L<http://nodejs.org>) uses libev as the underlying event library. |
|
|
4406 | |
|
|
4407 | =item Others |
|
|
4408 | |
|
|
4409 | There are others, and I stopped counting. |
|
|
4410 | |
4165 | =back |
4411 | =back |
4166 | |
4412 | |
4167 | |
4413 | |
4168 | =head1 MACRO MAGIC |
4414 | =head1 MACRO MAGIC |
4169 | |
4415 | |
… | |
… | |
4286 | ev_vars.h |
4532 | ev_vars.h |
4287 | ev_wrap.h |
4533 | ev_wrap.h |
4288 | |
4534 | |
4289 | ev_win32.c required on win32 platforms only |
4535 | ev_win32.c required on win32 platforms only |
4290 | |
4536 | |
4291 | ev_select.c only when select backend is enabled (which is enabled by default) |
4537 | ev_select.c only when select backend is enabled |
4292 | ev_poll.c only when poll backend is enabled (disabled by default) |
4538 | ev_poll.c only when poll backend is enabled |
4293 | ev_epoll.c only when the epoll backend is enabled (disabled by default) |
4539 | ev_epoll.c only when the epoll backend is enabled |
|
|
4540 | ev_linuxaio.c only when the linux aio backend is enabled |
|
|
4541 | ev_iouring.c only when the linux io_uring backend is enabled |
4294 | ev_kqueue.c only when the kqueue backend is enabled (disabled by default) |
4542 | ev_kqueue.c only when the kqueue backend is enabled |
4295 | ev_port.c only when the solaris port backend is enabled (disabled by default) |
4543 | ev_port.c only when the solaris port backend is enabled |
4296 | |
4544 | |
4297 | F<ev.c> includes the backend files directly when enabled, so you only need |
4545 | F<ev.c> includes the backend files directly when enabled, so you only need |
4298 | to compile this single file. |
4546 | to compile this single file. |
4299 | |
4547 | |
4300 | =head3 LIBEVENT COMPATIBILITY API |
4548 | =head3 LIBEVENT COMPATIBILITY API |
… | |
… | |
4419 | available and will probe for kernel support at runtime. This will improve |
4667 | available and will probe for kernel support at runtime. This will improve |
4420 | C<ev_signal> and C<ev_async> performance and reduce resource consumption. |
4668 | C<ev_signal> and C<ev_async> performance and reduce resource consumption. |
4421 | If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
4669 | If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
4422 | 2.7 or newer, otherwise disabled. |
4670 | 2.7 or newer, otherwise disabled. |
4423 | |
4671 | |
|
|
4672 | =item EV_USE_SIGNALFD |
|
|
4673 | |
|
|
4674 | If defined to be C<1>, then libev will assume that C<signalfd ()> is |
|
|
4675 | available and will probe for kernel support at runtime. This enables |
|
|
4676 | the use of EVFLAG_SIGNALFD for faster and simpler signal handling. If |
|
|
4677 | undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
|
|
4678 | 2.7 or newer, otherwise disabled. |
|
|
4679 | |
|
|
4680 | =item EV_USE_TIMERFD |
|
|
4681 | |
|
|
4682 | If defined to be C<1>, then libev will assume that C<timerfd ()> is |
|
|
4683 | available and will probe for kernel support at runtime. This allows |
|
|
4684 | libev to detect time jumps accurately. If undefined, it will be enabled |
|
|
4685 | if the headers indicate GNU/Linux + Glibc 2.8 or newer and define |
|
|
4686 | C<TFD_TIMER_CANCEL_ON_SET>, otherwise disabled. |
|
|
4687 | |
|
|
4688 | =item EV_USE_EVENTFD |
|
|
4689 | |
|
|
4690 | If defined to be C<1>, then libev will assume that C<eventfd ()> is |
|
|
4691 | available and will probe for kernel support at runtime. This will improve |
|
|
4692 | C<ev_signal> and C<ev_async> performance and reduce resource consumption. |
|
|
4693 | If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
|
|
4694 | 2.7 or newer, otherwise disabled. |
|
|
4695 | |
4424 | =item EV_USE_SELECT |
4696 | =item EV_USE_SELECT |
4425 | |
4697 | |
4426 | If undefined or defined to be C<1>, libev will compile in support for the |
4698 | If undefined or defined to be C<1>, libev will compile in support for the |
4427 | C<select>(2) backend. No attempt at auto-detection will be done: if no |
4699 | C<select>(2) backend. No attempt at auto-detection will be done: if no |
4428 | other method takes over, select will be it. Otherwise the select backend |
4700 | other method takes over, select will be it. Otherwise the select backend |
… | |
… | |
4468 | If programs implement their own fd to handle mapping on win32, then this |
4740 | If programs implement their own fd to handle mapping on win32, then this |
4469 | macro can be used to override the C<close> function, useful to unregister |
4741 | macro can be used to override the C<close> function, useful to unregister |
4470 | file descriptors again. Note that the replacement function has to close |
4742 | file descriptors again. Note that the replacement function has to close |
4471 | the underlying OS handle. |
4743 | the underlying OS handle. |
4472 | |
4744 | |
|
|
4745 | =item EV_USE_WSASOCKET |
|
|
4746 | |
|
|
4747 | If defined to be C<1>, libev will use C<WSASocket> to create its internal |
|
|
4748 | communication socket, which works better in some environments. Otherwise, |
|
|
4749 | the normal C<socket> function will be used, which works better in other |
|
|
4750 | environments. |
|
|
4751 | |
4473 | =item EV_USE_POLL |
4752 | =item EV_USE_POLL |
4474 | |
4753 | |
4475 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
4754 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
4476 | backend. Otherwise it will be enabled on non-win32 platforms. It |
4755 | backend. Otherwise it will be enabled on non-win32 platforms. It |
4477 | takes precedence over select. |
4756 | takes precedence over select. |
… | |
… | |
4481 | If defined to be C<1>, libev will compile in support for the Linux |
4760 | If defined to be C<1>, libev will compile in support for the Linux |
4482 | C<epoll>(7) backend. Its availability will be detected at runtime, |
4761 | C<epoll>(7) backend. Its availability will be detected at runtime, |
4483 | otherwise another method will be used as fallback. This is the preferred |
4762 | otherwise another method will be used as fallback. This is the preferred |
4484 | backend for GNU/Linux systems. If undefined, it will be enabled if the |
4763 | backend for GNU/Linux systems. If undefined, it will be enabled if the |
4485 | headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
4764 | headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
|
|
4765 | |
|
|
4766 | =item EV_USE_LINUXAIO |
|
|
4767 | |
|
|
4768 | If defined to be C<1>, libev will compile in support for the Linux aio |
|
|
4769 | backend (C<EV_USE_EPOLL> must also be enabled). If undefined, it will be |
|
|
4770 | enabled on linux, otherwise disabled. |
|
|
4771 | |
|
|
4772 | =item EV_USE_IOURING |
|
|
4773 | |
|
|
4774 | If defined to be C<1>, libev will compile in support for the Linux |
|
|
4775 | io_uring backend (C<EV_USE_EPOLL> must also be enabled). Due to it's |
|
|
4776 | current limitations it has to be requested explicitly. If undefined, it |
|
|
4777 | will be enabled on linux, otherwise disabled. |
4486 | |
4778 | |
4487 | =item EV_USE_KQUEUE |
4779 | =item EV_USE_KQUEUE |
4488 | |
4780 | |
4489 | If defined to be C<1>, libev will compile in support for the BSD style |
4781 | If defined to be C<1>, libev will compile in support for the BSD style |
4490 | C<kqueue>(2) backend. Its actual availability will be detected at runtime, |
4782 | C<kqueue>(2) backend. Its actual availability will be detected at runtime, |
… | |
… | |
4521 | different cpus (or different cpu cores). This reduces dependencies |
4813 | different cpus (or different cpu cores). This reduces dependencies |
4522 | and makes libev faster. |
4814 | and makes libev faster. |
4523 | |
4815 | |
4524 | =item EV_NO_THREADS |
4816 | =item EV_NO_THREADS |
4525 | |
4817 | |
4526 | If defined to be C<1>, libev will assume that it will never be called |
4818 | If defined to be C<1>, libev will assume that it will never be called from |
4527 | from different threads, which is a stronger assumption than C<EV_NO_SMP>, |
4819 | different threads (that includes signal handlers), which is a stronger |
4528 | above. This reduces dependencies and makes libev faster. |
4820 | assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes |
|
|
4821 | libev faster. |
4529 | |
4822 | |
4530 | =item EV_ATOMIC_T |
4823 | =item EV_ATOMIC_T |
4531 | |
4824 | |
4532 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4825 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4533 | access is atomic and serialised with respect to other threads or signal |
4826 | access is atomic with respect to other threads or signal contexts. No |
4534 | contexts. No such type is easily found in the C language, so you can |
4827 | such type is easily found in the C language, so you can provide your own |
4535 | provide your own type that you know is safe for your purposes. It is used |
4828 | type that you know is safe for your purposes. It is used both for signal |
4536 | both for signal handler "locking" as well as for signal and thread safety |
4829 | handler "locking" as well as for signal and thread safety in C<ev_async> |
4537 | in C<ev_async> watchers. |
4830 | watchers. |
4538 | |
4831 | |
4539 | In the absence of this define, libev will use C<sig_atomic_t volatile> |
4832 | In the absence of this define, libev will use C<sig_atomic_t volatile> |
4540 | (from F<signal.h>), which is usually good enough on most platforms, |
4833 | (from F<signal.h>), which is usually good enough on most platforms. |
4541 | although strictly speaking using a type that also implies a memory fence |
|
|
4542 | is required. |
|
|
4543 | |
4834 | |
4544 | =item EV_H (h) |
4835 | =item EV_H (h) |
4545 | |
4836 | |
4546 | The name of the F<ev.h> header file used to include it. The default if |
4837 | The name of the F<ev.h> header file used to include it. The default if |
4547 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
4838 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
… | |
… | |
4768 | in. If set to C<1>, then verification code will be compiled in, but not |
5059 | in. If set to C<1>, then verification code will be compiled in, but not |
4769 | called. If set to C<2>, then the internal verification code will be |
5060 | called. If set to C<2>, then the internal verification code will be |
4770 | called once per loop, which can slow down libev. If set to C<3>, then the |
5061 | called once per loop, which can slow down libev. If set to C<3>, then the |
4771 | verification code will be called very frequently, which will slow down |
5062 | verification code will be called very frequently, which will slow down |
4772 | libev considerably. |
5063 | libev considerably. |
|
|
5064 | |
|
|
5065 | Verification errors are reported via C's C<assert> mechanism, so if you |
|
|
5066 | disable that (e.g. by defining C<NDEBUG>) then no errors will be reported. |
4773 | |
5067 | |
4774 | The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it |
5068 | The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it |
4775 | will be C<0>. |
5069 | will be C<0>. |
4776 | |
5070 | |
4777 | =item EV_COMMON |
5071 | =item EV_COMMON |
… | |
… | |
4915 | default loop and triggering an C<ev_async> watcher from the default loop |
5209 | default loop and triggering an C<ev_async> watcher from the default loop |
4916 | watcher callback into the event loop interested in the signal. |
5210 | watcher callback into the event loop interested in the signal. |
4917 | |
5211 | |
4918 | =back |
5212 | =back |
4919 | |
5213 | |
4920 | See also L<THREAD LOCKING EXAMPLE>. |
5214 | See also L</THREAD LOCKING EXAMPLE>. |
4921 | |
5215 | |
4922 | =head3 COROUTINES |
5216 | =head3 COROUTINES |
4923 | |
5217 | |
4924 | Libev is very accommodating to coroutines ("cooperative threads"): |
5218 | Libev is very accommodating to coroutines ("cooperative threads"): |
4925 | libev fully supports nesting calls to its functions from different |
5219 | libev fully supports nesting calls to its functions from different |
… | |
… | |
5194 | structure (guaranteed by POSIX but not by ISO C for example), but it also |
5488 | structure (guaranteed by POSIX but not by ISO C for example), but it also |
5195 | assumes that the same (machine) code can be used to call any watcher |
5489 | assumes that the same (machine) code can be used to call any watcher |
5196 | callback: The watcher callbacks have different type signatures, but libev |
5490 | callback: The watcher callbacks have different type signatures, but libev |
5197 | calls them using an C<ev_watcher *> internally. |
5491 | calls them using an C<ev_watcher *> internally. |
5198 | |
5492 | |
|
|
5493 | =item null pointers and integer zero are represented by 0 bytes |
|
|
5494 | |
|
|
5495 | Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and |
|
|
5496 | relies on this setting pointers and integers to null. |
|
|
5497 | |
5199 | =item pointer accesses must be thread-atomic |
5498 | =item pointer accesses must be thread-atomic |
5200 | |
5499 | |
5201 | Accessing a pointer value must be atomic, it must both be readable and |
5500 | Accessing a pointer value must be atomic, it must both be readable and |
5202 | writable in one piece - this is the case on all current architectures. |
5501 | writable in one piece - this is the case on all current architectures. |
5203 | |
5502 | |
… | |
… | |
5216 | thread" or will block signals process-wide, both behaviours would |
5515 | thread" or will block signals process-wide, both behaviours would |
5217 | be compatible with libev. Interaction between C<sigprocmask> and |
5516 | be compatible with libev. Interaction between C<sigprocmask> and |
5218 | C<pthread_sigmask> could complicate things, however. |
5517 | C<pthread_sigmask> could complicate things, however. |
5219 | |
5518 | |
5220 | The most portable way to handle signals is to block signals in all threads |
5519 | The most portable way to handle signals is to block signals in all threads |
5221 | except the initial one, and run the default loop in the initial thread as |
5520 | except the initial one, and run the signal handling loop in the initial |
5222 | well. |
5521 | thread as well. |
5223 | |
5522 | |
5224 | =item C<long> must be large enough for common memory allocation sizes |
5523 | =item C<long> must be large enough for common memory allocation sizes |
5225 | |
5524 | |
5226 | To improve portability and simplify its API, libev uses C<long> internally |
5525 | To improve portability and simplify its API, libev uses C<long> internally |
5227 | instead of C<size_t> when allocating its data structures. On non-POSIX |
5526 | instead of C<size_t> when allocating its data structures. On non-POSIX |
… | |
… | |
5331 | =over 4 |
5630 | =over 4 |
5332 | |
5631 | |
5333 | =item C<EV_COMPAT3> backwards compatibility mechanism |
5632 | =item C<EV_COMPAT3> backwards compatibility mechanism |
5334 | |
5633 | |
5335 | The backward compatibility mechanism can be controlled by |
5634 | The backward compatibility mechanism can be controlled by |
5336 | C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> |
5635 | C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING> |
5337 | section. |
5636 | section. |
5338 | |
5637 | |
5339 | =item C<ev_default_destroy> and C<ev_default_fork> have been removed |
5638 | =item C<ev_default_destroy> and C<ev_default_fork> have been removed |
5340 | |
5639 | |
5341 | These calls can be replaced easily by their C<ev_loop_xxx> counterparts: |
5640 | These calls can be replaced easily by their C<ev_loop_xxx> counterparts: |
… | |
… | |
5384 | =over 4 |
5683 | =over 4 |
5385 | |
5684 | |
5386 | =item active |
5685 | =item active |
5387 | |
5686 | |
5388 | A watcher is active as long as it has been started and not yet stopped. |
5687 | A watcher is active as long as it has been started and not yet stopped. |
5389 | See L<WATCHER STATES> for details. |
5688 | See L</WATCHER STATES> for details. |
5390 | |
5689 | |
5391 | =item application |
5690 | =item application |
5392 | |
5691 | |
5393 | In this document, an application is whatever is using libev. |
5692 | In this document, an application is whatever is using libev. |
5394 | |
5693 | |
… | |
… | |
5430 | watchers and events. |
5729 | watchers and events. |
5431 | |
5730 | |
5432 | =item pending |
5731 | =item pending |
5433 | |
5732 | |
5434 | A watcher is pending as soon as the corresponding event has been |
5733 | A watcher is pending as soon as the corresponding event has been |
5435 | detected. See L<WATCHER STATES> for details. |
5734 | detected. See L</WATCHER STATES> for details. |
5436 | |
5735 | |
5437 | =item real time |
5736 | =item real time |
5438 | |
5737 | |
5439 | The physical time that is observed. It is apparently strictly monotonic :) |
5738 | The physical time that is observed. It is apparently strictly monotonic :) |
5440 | |
5739 | |