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

Comparing libev/ev.pod (file contents):
Revision 1.397 by root, Mon Feb 13 01:52:14 2012 UTC vs.
Revision 1.468 by sf-exg, Sun May 14 19:02:31 2023 UTC

1=encoding utf-8
2
1=head1 NAME 3=head1 NAME
2 4
3libev - a high performance full-featured event loop written in C 5libev - 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
85This manual tries to be very detailed, but unfortunately, this also makes 87This manual tries to be very detailed, but unfortunately, this also makes
86it very long. If you just want to know the basics of libev, I suggest 88it very long. If you just want to know the basics of libev, I suggest
87reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and 89reading L</ANATOMY OF A WATCHER>, then the L</EXAMPLE PROGRAM> above and
88look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and 90look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and
89C<ev_timer> sections in L<WATCHER TYPES>. 91C<ev_timer> sections in L</WATCHER TYPES>.
90 92
91=head1 ABOUT LIBEV 93=head1 ABOUT LIBEV
92 94
93Libev is an event loop: you register interest in certain events (such as a 95Libev is an event loop: you register interest in certain events (such as a
94file descriptor being readable or a timeout occurring), and it will manage 96file descriptor being readable or a timeout occurring), and it will manage
103details of the event, and then hand it over to libev by I<starting> the 105details of the event, and then hand it over to libev by I<starting> the
104watcher. 106watcher.
105 107
106=head2 FEATURES 108=head2 FEATURES
107 109
108Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 110Libev supports C<select>, C<poll>, the Linux-specific aio and C<epoll>
109BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 111interfaces, the BSD-specific C<kqueue> and the Solaris-specific event port
110for file descriptor events (C<ev_io>), the Linux C<inotify> interface 112mechanisms for file descriptor events (C<ev_io>), the Linux C<inotify>
111(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner 113interface (for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
112inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative 114inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
113timers (C<ev_timer>), absolute timers with customised rescheduling 115timers (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
115change events (C<ev_child>), and event watchers dealing with the event 117change events (C<ev_child>), and event watchers dealing with the event
116loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and 118loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
157When libev detects a usage error such as a negative timer interval, then 159When libev detects a usage error such as a negative timer interval, then
158it will print a diagnostic message and abort (via the C<assert> mechanism, 160it will print a diagnostic message and abort (via the C<assert> mechanism,
159so C<NDEBUG> will disable this checking): these are programming errors in 161so C<NDEBUG> will disable this checking): these are programming errors in
160the libev caller and need to be fixed there. 162the libev caller and need to be fixed there.
161 163
164Via the C<EV_FREQUENT> macro you can compile in and/or enable extensive
165consistency checking code inside libev that can be used to check for
166internal inconsistencies, suually caused by application bugs.
167
162Libev also has a few internal error-checking C<assert>ions, and also has 168Libev also has a few internal error-checking C<assert>ions. These do not
163extensive consistency checking code. These do not trigger under normal
164circumstances, as they indicate either a bug in libev or worse. 169trigger under normal circumstances, as they indicate either a bug in libev
170or worse.
165 171
166 172
167=head1 GLOBAL FUNCTIONS 173=head1 GLOBAL FUNCTIONS
168 174
169These functions can be called anytime, even before initialising the 175These functions can be called anytime, even before initialising the
247the current system, you would need to look at C<ev_embeddable_backends () 253the 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
250See the description of C<ev_embed> watchers for more info. 256See 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
254Sets the allocation function to use (the prototype is similar - the 260Sets the allocation function to use (the prototype is similar - the
255semantics are identical to the C<realloc> C89/SuS/POSIX function). It is 261semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
256used to allocate and free memory (no surprises here). If it returns zero 262used to allocate and free memory (no surprises here). If it returns zero
257when memory needs to be allocated (C<size != 0>), the library might abort 263when memory needs to be allocated (C<size != 0>), the library might abort
263 269
264You could override this function in high-availability programs to, say, 270You could override this function in high-availability programs to, say,
265free some memory if it cannot allocate memory, to use a special allocator, 271free some memory if it cannot allocate memory, to use a special allocator,
266or even to sleep a while and retry until some memory is available. 272or even to sleep a while and retry until some memory is available.
267 273
274Example: The following is the C<realloc> function that libev itself uses
275which should work with C<realloc> and C<free> functions of all kinds and
276is 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
268Example: Replace the libev allocator with one that waits a bit and then 288Example: Replace the libev allocator with one that waits a bit and then
269retries (example requires a standards-compliant C<realloc>). 289retries.
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
290Set the callback function to call on a retryable system call error (such 316Set the callback function to call on a retryable system call error (such
291as failed select, poll, epoll_wait). The message is a printable string 317as failed select, poll, epoll_wait). The message is a printable string
292indicating the system call or subsystem causing the problem. If this 318indicating the system call or subsystem causing the problem. If this
293callback is set, then libev will expect it to remedy the situation, no 319callback is set, then libev will expect it to remedy the situation, no
396 422
397If this flag bit is or'ed into the flag value (or the program runs setuid 423If this flag bit is or'ed into the flag value (or the program runs setuid
398or setgid) then libev will I<not> look at the environment variable 424or setgid) then libev will I<not> look at the environment variable
399C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 425C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
400override the flags completely if it is found in the environment. This is 426override the flags completely if it is found in the environment. This is
401useful to try out specific backends to test their performance, or to work 427useful to try out specific backends to test their performance, to work
402around bugs. 428around bugs, or to make libev threadsafe (accessing environment variables
429cannot be done in a threadsafe way, but usually it works if no other
430thread modifies them).
403 431
404=item C<EVFLAG_FORKCHECK> 432=item C<EVFLAG_FORKCHECK>
405 433
406Instead of calling C<ev_loop_fork> manually after a fork, you can also 434Instead of calling C<ev_loop_fork> manually after a fork, you can also
407make libev check for a fork in each iteration by enabling this flag. 435make libev check for a fork in each iteration by enabling this flag.
408 436
409This works by calling C<getpid ()> on every iteration of the loop, 437This works by calling C<getpid ()> on every iteration of the loop,
410and thus this might slow down your event loop if you do a lot of loop 438and thus this might slow down your event loop if you do a lot of loop
411iterations and little real work, but is usually not noticeable (on my 439iterations and little real work, but is usually not noticeable (on my
412GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 440GNU/Linux system for example, C<getpid> is actually a simple 5-insn
413without a system call and thus I<very> fast, but my GNU/Linux system also has 441sequence without a system call and thus I<very> fast, but my GNU/Linux
414C<pthread_atfork> which is even faster). 442system also has C<pthread_atfork> which is even faster). (Update: glibc
443versions 2.25 apparently removed the C<getpid> optimisation again).
415 444
416The big advantage of this flag is that you can forget about fork (and 445The big advantage of this flag is that you can forget about fork (and
417forget about forgetting to tell libev about forking) when you use this 446forget about forgetting to tell libev about forking, although you still
418flag. 447have to ignore C<SIGPIPE>) when you use this flag.
419 448
420This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 449This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
421environment variable. 450environment variable.
422 451
423=item C<EVFLAG_NOINOTIFY> 452=item C<EVFLAG_NOINOTIFY>
451unblocking the signals. 480unblocking the signals.
452 481
453It's also required by POSIX in a threaded program, as libev calls 482It's also required by POSIX in a threaded program, as libev calls
454C<sigprocmask>, whose behaviour is officially unspecified. 483C<sigprocmask>, whose behaviour is officially unspecified.
455 484
456This flag's behaviour will become the default in future versions of libev. 485=item C<EVFLAG_NOTIMERFD>
486
487When this flag is specified, the libev will avoid using a C<timerfd> to
488detect time jumps. It will still be able to detect time jumps, but takes
489longer and has a lower accuracy in doing so, but saves a file descriptor
490per loop.
491
492The current implementation only tries to use a C<timerfd> when the first
493C<ev_periodic> watcher is started and falls back on other methods if it
494cannot 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
460This is your standard select(2) backend. Not I<completely> standard, as 498This is your standard select(2) backend. Not I<completely> standard, as
461libev tries to roll its own fd_set with no limits on the number of fds, 499libev tries to roll its own fd_set with no limits on the number of fds,
486This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 524This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
487C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 525C<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
491Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9 529Use the Linux-specific epoll(7) interface (for both pre- and post-2.6.9
492kernels). 530kernels).
493 531
494For few fds, this backend is a bit little slower than poll and select, but 532For few fds, this backend is a bit little slower than poll and select, but
495it scales phenomenally better. While poll and select usually scale like 533it scales phenomenally better. While poll and select usually scale like
496O(total_fds) where total_fds is the total number of fds (or the highest 534O(total_fds) where total_fds is the total number of fds (or the highest
542All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or 580All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
543faster than epoll for maybe up to a hundred file descriptors, depending on 581faster than epoll for maybe up to a hundred file descriptors, depending on
544the usage. So sad. 582the usage. So sad.
545 583
546While nominally embeddable in other event loops, this feature is broken in 584While nominally embeddable in other event loops, this feature is broken in
547all kernel versions tested so far. 585a lot of kernel revisions, but probably(!) works in current versions.
548 586
549This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 587This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
550C<EVBACKEND_POLL>. 588C<EVBACKEND_POLL>.
551 589
590=item C<EVBACKEND_LINUXAIO> (value 64, Linux)
591
592Use the Linux-specific Linux AIO (I<not> C<< aio(7) >> but C<<
593io_submit(2) >>) event interface available in post-4.18 kernels (but libev
594only tries to use it in 4.19+).
595
596This is another Linux train wreck of an event interface.
597
598If this backend works for you (as of this writing, it was very
599experimental), it is the best event interface available on Linux and might
600be well worth enabling it - if it isn't available in your kernel this will
601be detected and this backend will be skipped.
602
603This backend can batch oneshot requests and supports a user-space ring
604buffer to receive events. It also doesn't suffer from most of the design
605problems of epoll (such as not being able to remove event sources from
606the epoll set), and generally sounds too good to be true. Because, this
607being the Linux kernel, of course it suffers from a whole new set of
608limitations, forcing you to fall back to epoll, inheriting all its design
609issues.
610
611For one, it is not easily embeddable (but probably could be done using
612an event fd at some extra overhead). It also is subject to a system wide
613limit that can be configured in F</proc/sys/fs/aio-max-nr>. If no AIO
614requests are left, this backend will be skipped during initialisation, and
615will switch to epoll when the loop is active.
616
617Most problematic in practice, however, is that not all file descriptors
618work with it. For example, in Linux 5.1, TCP sockets, pipes, event fds,
619files, F</dev/null> and many others are supported, but ttys do not work
620properly (a known bug that the kernel developers don't care about, see
621L<https://lore.kernel.org/patchwork/patch/1047453/>), so this is not
622(yet?) a generic event polling interface.
623
624Overall, it seems the Linux developers just don't want it to have a
625generic event handling mechanism other than C<select> or C<poll>.
626
627To work around all these problem, the current version of libev uses its
628epoll backend as a fallback for file descriptor types that do not work. Or
629falls back completely to epoll if the kernel acts up.
630
631This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
632C<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
554Kqueue deserves special mention, as at the time of this writing, it 636Kqueue deserves special mention, as at the time this backend was
555was broken on all BSDs except NetBSD (usually it doesn't work reliably 637implemented, it was broken on all BSDs except NetBSD (usually it doesn't
556with anything but sockets and pipes, except on Darwin, where of course 638work reliably with anything but sockets and pipes, except on Darwin,
557it's completely useless). Unlike epoll, however, whose brokenness 639where of course it's completely useless). Unlike epoll, however, whose
558is by design, these kqueue bugs can (and eventually will) be fixed 640brokenness is by design, these kqueue bugs can be (and mostly have been)
559without API changes to existing programs. For this reason it's not being 641fixed 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 642being "auto-detected" on all platforms unless you explicitly specify it
561C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) 643in the flags (i.e. using C<EVBACKEND_KQUEUE>) or libev was compiled on a
562system like NetBSD. 644known-to-be-good (-enough) system like NetBSD.
563 645
564You still can embed kqueue into a normal poll or select backend and use it 646You still can embed kqueue into a normal poll or select backend and use it
565only for sockets (after having made sure that sockets work with kqueue on 647only for sockets (after having made sure that sockets work with kqueue on
566the target platform). See C<ev_embed> watchers for more info. 648the target platform). See C<ev_embed> watchers for more info.
567 649
568It scales in the same way as the epoll backend, but the interface to the 650It scales in the same way as the epoll backend, but the interface to the
569kernel is more efficient (which says nothing about its actual speed, of 651kernel is more efficient (which says nothing about its actual speed, of
570course). While stopping, setting and starting an I/O watcher does never 652course). While stopping, setting and starting an I/O watcher does never
571cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to 653cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
572two event changes per incident. Support for C<fork ()> is very bad (but 654two event changes per incident. Support for C<fork ()> is very bad (you
573sane, unlike epoll) and it drops fds silently in similarly hard-to-detect 655might have to leak fds on fork, but it's more sane than epoll) and it
574cases 656drops fds silently in similarly hard-to-detect cases.
575 657
576This backend usually performs well under most conditions. 658This backend usually performs well under most conditions.
577 659
578While nominally embeddable in other event loops, this doesn't work 660While nominally embeddable in other event loops, this doesn't work
579everywhere, so you might need to test for this. And since it is broken 661everywhere, so you might need to test for this. And since it is broken
653Example: Use whatever libev has to offer, but make sure that kqueue is 735Example: Use whatever libev has to offer, but make sure that kqueue is
654used if available. 736used 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
740Example: Similarly, on linux, you mgiht want to take advantage of the
741linux aio backend if possible, but fall back to something else if that
742isn'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
660Destroys an event loop object (frees all memory and kernel state 748Destroys an event loop object (frees all memory and kernel state
661etc.). None of the active event watchers will be stopped in the normal 749etc.). None of the active event watchers will be stopped in the normal
662sense, so e.g. C<ev_is_active> might still return true. It is your 750sense, so e.g. C<ev_is_active> might still return true. It is your
678If you need dynamically allocated loops it is better to use C<ev_loop_new> 766If you need dynamically allocated loops it is better to use C<ev_loop_new>
679and C<ev_loop_destroy>. 767and C<ev_loop_destroy>.
680 768
681=item ev_loop_fork (loop) 769=item ev_loop_fork (loop)
682 770
683This function sets a flag that causes subsequent C<ev_run> iterations to 771This function sets a flag that causes subsequent C<ev_run> iterations
684reinitialise the kernel state for backends that have one. Despite the 772to reinitialise the kernel state for backends that have one. Despite
685name, you can call it anytime, but it makes most sense after forking, in 773the name, you can call it anytime you are allowed to start or stop
686the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the 774watchers (except inside an C<ev_prepare> callback), but it makes most
775sense after forking, in the child process. You I<must> call it (or use
687child before resuming or calling C<ev_run>. 776C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
688 777
778In addition, if you want to reuse a loop (via this function or
779C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
780
689Again, you I<have> to call it on I<any> loop that you want to re-use after 781Again, you I<have> to call it on I<any> loop that you want to re-use after
690a fork, I<even if you do not plan to use the loop in the parent>. This is 782a fork, I<even if you do not plan to use the loop in the parent>. This is
691because some kernel interfaces *cough* I<kqueue> *cough* do funny things 783because some kernel interfaces *cough* I<kqueue> *cough* do funny things
692during fork. 784during fork.
693 785
694On the other hand, you only need to call this function in the child 786On the other hand, you only need to call this function in the child
764 856
765This function is rarely useful, but when some event callback runs for a 857This function is rarely useful, but when some event callback runs for a
766very long time without entering the event loop, updating libev's idea of 858very long time without entering the event loop, updating libev's idea of
767the current time is a good idea. 859the current time is a good idea.
768 860
769See also L<The special problem of time updates> in the C<ev_timer> section. 861See 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
792without a previous call to C<ev_suspend>. 884without a previous call to C<ev_suspend>.
793 885
794Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 886Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
795event loop time (see C<ev_now_update>). 887event loop time (see C<ev_now_update>).
796 888
797=item ev_run (loop, int flags) 889=item bool ev_run (loop, int flags)
798 890
799Finally, this is it, the event handler. This function usually is called 891Finally, this is it, the event handler. This function usually is called
800after you have initialised all your watchers and you want to start 892after you have initialised all your watchers and you want to start
801handling events. It will ask the operating system for any new events, call 893handling events. It will ask the operating system for any new events, call
802the watcher callbacks, an then repeat the whole process indefinitely: This 894the watcher callbacks, and then repeat the whole process indefinitely: This
803is why event loops are called I<loops>. 895is why event loops are called I<loops>.
804 896
805If the flags argument is specified as C<0>, it will keep handling events 897If the flags argument is specified as C<0>, it will keep handling events
806until either no event watchers are active anymore or C<ev_break> was 898until either no event watchers are active anymore or C<ev_break> was
807called. 899called.
900
901The return value is false if there are no more active watchers (which
902usually means "all jobs done" or "deadlock"), and true in all other cases
903(which usually means " you should call C<ev_run> again").
808 904
809Please note that an explicit C<ev_break> is usually better than 905Please note that an explicit C<ev_break> is usually better than
810relying on all watchers to be stopped when deciding when a program has 906relying on all watchers to be stopped when deciding when a program has
811finished (especially in interactive programs), but having a program 907finished (especially in interactive programs), but having a program
812that automatically loops as long as it has to and no longer by virtue 908that automatically loops as long as it has to and no longer by virtue
813of relying on its watchers stopping correctly, that is truly a thing of 909of relying on its watchers stopping correctly, that is truly a thing of
814beauty. 910beauty.
815 911
816This function is also I<mostly> exception-safe - you can break out of 912This function is I<mostly> exception-safe - you can break out of a
817a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++ 913C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
818exception and so on. This does not decrement the C<ev_depth> value, nor 914exception and so on. This does not decrement the C<ev_depth> value, nor
819will it clear any outstanding C<EVBREAK_ONE> breaks. 915will it clear any outstanding C<EVBREAK_ONE> breaks.
820 916
821A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 917A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
822those events and any already outstanding ones, but will not wait and 918those events and any already outstanding ones, but will not wait and
863 - Queue all expired timers. 959 - Queue all expired timers.
864 - Queue all expired periodics. 960 - Queue all expired periodics.
865 - 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.
866 - Queue all check watchers. 962 - Queue all check watchers.
867 - 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).
868 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
869 be handled here by queueing them when their watcher gets executed. 965 will be handled here by queueing them when their watcher gets executed.
870 - 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
871 were used, or there are no active watchers, goto FINISH, otherwise 967 were used, or there are no active watchers, goto FINISH, otherwise
872 continue with step LOOP. 968 continue with step LOOP.
873 FINISH: 969 FINISH:
874 - Reset the ev_break status iff it was EVBREAK_ONE. 970 - Reset the ev_break status iff it was EVBREAK_ONE.
1012invoke the actual watchers inside another context (another thread etc.). 1108invoke the actual watchers inside another context (another thread etc.).
1013 1109
1014If you want to reset the callback, use C<ev_invoke_pending> as new 1110If you want to reset the callback, use C<ev_invoke_pending> as new
1015callback. 1111callback.
1016 1112
1017=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 ())
1018 1114
1019Sometimes you want to share the same loop between multiple threads. This 1115Sometimes you want to share the same loop between multiple threads. This
1020can be done relatively simply by putting mutex_lock/unlock calls around 1116can be done relatively simply by putting mutex_lock/unlock calls around
1021each call to a libev function. 1117each call to a libev function.
1022 1118
1122with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher 1218with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher
1123*) >>), 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
1124corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>. 1220corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>.
1125 1221
1126As long as your watcher is active (has been started but not stopped) you 1222As long as your watcher is active (has been started but not stopped) you
1127must not touch the values stored in it. Most specifically you must never 1223must not touch the values stored in it except when explicitly documented
1128reinitialise it or call its C<ev_TYPE_set> macro. 1224otherwise. Most specifically you must never reinitialise it or call its
1225C<ev_TYPE_set> macro.
1129 1226
1130Each and every callback receives the event loop pointer as first, the 1227Each and every callback receives the event loop pointer as first, the
1131registered watcher structure as second, and a bitset of received events as 1228registered watcher structure as second, and a bitset of received events as
1132third argument. 1229third argument.
1133 1230
1170 1267
1171=item C<EV_PREPARE> 1268=item C<EV_PREPARE>
1172 1269
1173=item C<EV_CHECK> 1270=item C<EV_CHECK>
1174 1271
1175All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts 1272All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1176to gather new events, and all C<ev_check> watchers are invoked just after 1273gather new events, and all C<ev_check> watchers are queued (not invoked)
1177C<ev_run> has gathered them, but before it invokes any callbacks for any 1274just after C<ev_run> has gathered them, but before it queues any callbacks
1275for any received events. That means C<ev_prepare> watchers are the last
1276watchers invoked before the event loop sleeps or polls for new events, and
1277C<ev_check> watchers will be invoked before any other watchers of the same
1278or lower priority within an event loop iteration.
1279
1178received events. Callbacks of both watcher types can start and stop as 1280Callbacks of both watcher types can start and stop as many watchers as
1179many watchers as they want, and all of them will be taken into account 1281they want, and all of them will be taken into account (for example, a
1180(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1282C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1181C<ev_run> from blocking). 1283blocking).
1182 1284
1183=item C<EV_EMBED> 1285=item C<EV_EMBED>
1184 1286
1185The embedded event loop specified in the C<ev_embed> watcher needs attention. 1287The embedded event loop specified in the C<ev_embed> watcher needs attention.
1186 1288
1294 1396
1295=item bool ev_is_active (ev_TYPE *watcher) 1397=item bool ev_is_active (ev_TYPE *watcher)
1296 1398
1297Returns a true value iff the watcher is active (i.e. it has been started 1399Returns a true value iff the watcher is active (i.e. it has been started
1298and not yet been stopped). As long as a watcher is active you must not modify 1400and not yet been stopped). As long as a watcher is active you must not modify
1299it. 1401it unless documented otherwise.
1300 1402
1301=item bool ev_is_pending (ev_TYPE *watcher) 1403=item bool ev_is_pending (ev_TYPE *watcher)
1302 1404
1303Returns a true value iff the watcher is pending, (i.e. it has outstanding 1405Returns a true value iff the watcher is pending, (i.e. it has outstanding
1304events but its callback has not yet been invoked). As long as a watcher 1406events but its callback has not yet been invoked). As long as a watcher
1309 1411
1310=item callback ev_cb (ev_TYPE *watcher) 1412=item callback ev_cb (ev_TYPE *watcher)
1311 1413
1312Returns the callback currently set on the watcher. 1414Returns the callback currently set on the watcher.
1313 1415
1314=item ev_cb_set (ev_TYPE *watcher, callback) 1416=item ev_set_cb (ev_TYPE *watcher, callback)
1315 1417
1316Change the callback. You can change the callback at virtually any time 1418Change the callback. You can change the callback at virtually any time
1317(modulo threads). 1419(modulo threads).
1318 1420
1319=item ev_set_priority (ev_TYPE *watcher, int priority) 1421=item ev_set_priority (ev_TYPE *watcher, int priority)
1337or might not have been clamped to the valid range. 1439or might not have been clamped to the valid range.
1338 1440
1339The default priority used by watchers when no priority has been set is 1441The default priority used by watchers when no priority has been set is
1340always C<0>, which is supposed to not be too high and not be too low :). 1442always C<0>, which is supposed to not be too high and not be too low :).
1341 1443
1342See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of 1444See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1343priorities. 1445priorities.
1344 1446
1345=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1447=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1346 1448
1347Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1449Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1372See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1474See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1373functions that do not need a watcher. 1475functions that do not need a watcher.
1374 1476
1375=back 1477=back
1376 1478
1377See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR 1479See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1378OWN COMPOSITE WATCHERS> idioms. 1480OWN COMPOSITE WATCHERS> idioms.
1379 1481
1380=head2 WATCHER STATES 1482=head2 WATCHER STATES
1381 1483
1382There are various watcher states mentioned throughout this manual - 1484There are various watcher states mentioned throughout this manual -
1384transition between them will be described in more detail - and while these 1486transition between them will be described in more detail - and while these
1385rules might look complicated, they usually do "the right thing". 1487rules might look complicated, they usually do "the right thing".
1386 1488
1387=over 4 1489=over 4
1388 1490
1389=item initialiased 1491=item initialised
1390 1492
1391Before a watcher can be registered with the event loop it has to be 1493Before a watcher can be registered with the event loop it has to be
1392initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1494initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1393C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1495C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1394 1496
1443 1545
1444Many event loops support I<watcher priorities>, which are usually small 1546Many event loops support I<watcher priorities>, which are usually small
1445integers that influence the ordering of event callback invocation 1547integers that influence the ordering of event callback invocation
1446between watchers in some way, all else being equal. 1548between watchers in some way, all else being equal.
1447 1549
1448In libev, Watcher priorities can be set using C<ev_set_priority>. See its 1550In libev, watcher priorities can be set using C<ev_set_priority>. See its
1449description for the more technical details such as the actual priority 1551description for the more technical details such as the actual priority
1450range. 1552range.
1451 1553
1452There are two common ways how these these priorities are being interpreted 1554There are two common ways how these these priorities are being interpreted
1453by event loops: 1555by event loops:
1547 1649
1548This section describes each watcher in detail, but will not repeat 1650This section describes each watcher in detail, but will not repeat
1549information given in the last section. Any initialisation/set macros, 1651information given in the last section. Any initialisation/set macros,
1550functions and members specific to the watcher type are explained. 1652functions and members specific to the watcher type are explained.
1551 1653
1552Members are additionally marked with either I<[read-only]>, meaning that, 1654Most members are additionally marked with either I<[read-only]>, meaning
1553while the watcher is active, you can look at the member and expect some 1655that, while the watcher is active, you can look at the member and expect
1554sensible content, but you must not modify it (you can modify it while the 1656some sensible content, but you must not modify it (you can modify it while
1555watcher is stopped to your hearts content), or I<[read-write]>, which 1657the watcher is stopped to your hearts content), or I<[read-write]>, which
1556means you can expect it to have some sensible content while the watcher 1658means you can expect it to have some sensible content while the watcher is
1557is active, but you can also modify it. Modifying it may not do something 1659active, but you can also modify it (within the same thread as the event
1660loop, i.e. without creating data races). Modifying it may not do something
1558sensible or take immediate effect (or do anything at all), but libev will 1661sensible or take immediate effect (or do anything at all), but libev will
1559not crash or malfunction in any way. 1662not crash or malfunction in any way.
1560 1663
1664In any case, the documentation for each member will explain what the
1665effects are, and if there are any additional access restrictions.
1561 1666
1562=head2 C<ev_io> - is this file descriptor readable or writable? 1667=head2 C<ev_io> - is this file descriptor readable or writable?
1563 1668
1564I/O watchers check whether a file descriptor is readable or writable 1669I/O watchers check whether a file descriptor is readable or writable
1565in each iteration of the event loop, or, more precisely, when reading 1670in each iteration of the event loop, or, more precisely, when reading
1592 1697
1593But really, best use non-blocking mode. 1698But really, best use non-blocking mode.
1594 1699
1595=head3 The special problem of disappearing file descriptors 1700=head3 The special problem of disappearing file descriptors
1596 1701
1597Some backends (e.g. kqueue, epoll) need to be told about closing a file 1702Some backends (e.g. kqueue, epoll, linuxaio) need to be told about closing
1598descriptor (either due to calling C<close> explicitly or any other means, 1703a file descriptor (either due to calling C<close> explicitly or any other
1599such as C<dup2>). The reason is that you register interest in some file 1704means, such as C<dup2>). The reason is that you register interest in some
1600descriptor, but when it goes away, the operating system will silently drop 1705file descriptor, but when it goes away, the operating system will silently
1601this interest. If another file descriptor with the same number then is 1706drop this interest. If another file descriptor with the same number then
1602registered with libev, there is no efficient way to see that this is, in 1707is registered with libev, there is no efficient way to see that this is,
1603fact, a different file descriptor. 1708in fact, a different file descriptor.
1604 1709
1605To avoid having to explicitly tell libev about such cases, libev follows 1710To avoid having to explicitly tell libev about such cases, libev follows
1606the following policy: Each time C<ev_io_set> is being called, libev 1711the following policy: Each time C<ev_io_set> is being called, libev
1607will assume that this is potentially a new file descriptor, otherwise 1712will assume that this is potentially a new file descriptor, otherwise
1608it is assumed that the file descriptor stays the same. That means that 1713it is assumed that the file descriptor stays the same. That means that
1657when you rarely read from a file instead of from a socket, and want to 1762when you rarely read from a file instead of from a socket, and want to
1658reuse the same code path. 1763reuse the same code path.
1659 1764
1660=head3 The special problem of fork 1765=head3 The special problem of fork
1661 1766
1662Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1767Some backends (epoll, kqueue, linuxaio, iouring) do not support C<fork ()>
1663useless behaviour. Libev fully supports fork, but needs to be told about 1768at all or exhibit useless behaviour. Libev fully supports fork, but needs
1664it in the child if you want to continue to use it in the child. 1769to be told about it in the child if you want to continue to use it in the
1770child.
1665 1771
1666To support fork in your child processes, you have to call C<ev_loop_fork 1772To support fork in your child processes, you have to call C<ev_loop_fork
1667()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to 1773()> after a fork in the child, enable C<EVFLAG_FORKCHECK>, or resort to
1668C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1774C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1669 1775
1724=item ev_io_init (ev_io *, callback, int fd, int events) 1830=item ev_io_init (ev_io *, callback, int fd, int events)
1725 1831
1726=item ev_io_set (ev_io *, int fd, int events) 1832=item ev_io_set (ev_io *, int fd, int events)
1727 1833
1728Configures an C<ev_io> watcher. The C<fd> is the file descriptor to 1834Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1729receive events for and C<events> is either C<EV_READ>, C<EV_WRITE> or 1835receive events for and C<events> is either C<EV_READ>, C<EV_WRITE>, both
1730C<EV_READ | EV_WRITE>, to express the desire to receive the given events. 1836C<EV_READ | EV_WRITE> or C<0>, to express the desire to receive the given
1837events.
1731 1838
1732=item int fd [read-only] 1839Note that setting the C<events> to C<0> and starting the watcher is
1840supported, but not specially optimized - if your program sometimes happens
1841to generate this combination this is fine, but if it is easy to avoid
1842starting an io watcher watching for no events you should do so.
1733 1843
1734The file descriptor being watched. 1844=item ev_io_modify (ev_io *, int events)
1735 1845
1846Similar to C<ev_io_set>, but only changes the requested events. Using this
1847might be faster with some backends, as libev can assume that the C<fd>
1848still refers to the same underlying file description, something it cannot
1849do when using C<ev_io_set>.
1850
1851=item int fd [no-modify]
1852
1853The file descriptor being watched. While it can be read at any time, you
1854must not modify this member even when the watcher is stopped - always use
1855C<ev_io_set> for that.
1856
1736=item int events [read-only] 1857=item int events [no-modify]
1737 1858
1738The events being watched. 1859The set of events the fd is being watched for, among other flags. Remember
1860that this is a bit set - to test for C<EV_READ>, use C<< w->events &
1861EV_READ >>, and similarly for C<EV_WRITE>.
1862
1863As with C<fd>, you must not modify this member even when the watcher is
1864stopped, always use C<ev_io_set> or C<ev_io_modify> for that.
1739 1865
1740=back 1866=back
1741 1867
1742=head3 Examples 1868=head3 Examples
1743 1869
1870 callback (EV_P_ ev_timer *w, int revents) 1996 callback (EV_P_ ev_timer *w, int revents)
1871 { 1997 {
1872 // calculate when the timeout would happen 1998 // calculate when the timeout would happen
1873 ev_tstamp after = last_activity - ev_now (EV_A) + timeout; 1999 ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1874 2000
1875 // if negative, it means we the timeout already occured 2001 // if negative, it means we the timeout already occurred
1876 if (after < 0.) 2002 if (after < 0.)
1877 { 2003 {
1878 // timeout occurred, take action 2004 // timeout occurred, take action
1879 } 2005 }
1880 else 2006 else
1898 2024
1899Otherwise, we now the earliest time at which the timeout would trigger, 2025Otherwise, we now the earliest time at which the timeout would trigger,
1900and simply start the timer with this timeout value. 2026and simply start the timer with this timeout value.
1901 2027
1902In other words, each time the callback is invoked it will check whether 2028In other words, each time the callback is invoked it will check whether
1903the timeout cocured. If not, it will simply reschedule itself to check 2029the timeout occurred. If not, it will simply reschedule itself to check
1904again at the earliest time it could time out. Rinse. Repeat. 2030again at the earliest time it could time out. Rinse. Repeat.
1905 2031
1906This scheme causes more callback invocations (about one every 60 seconds 2032This scheme causes more callback invocations (about one every 60 seconds
1907minus half the average time between activity), but virtually no calls to 2033minus half the average time between activity), but virtually no calls to
1908libev to change the timeout. 2034libev to change the timeout.
1922 if (activity detected) 2048 if (activity detected)
1923 last_activity = ev_now (EV_A); 2049 last_activity = ev_now (EV_A);
1924 2050
1925When your timeout value changes, then the timeout can be changed by simply 2051When your timeout value changes, then the timeout can be changed by simply
1926providing a new value, stopping the timer and calling the callback, which 2052providing a new value, stopping the timer and calling the callback, which
1927will agaion do the right thing (for example, time out immediately :). 2053will again do the right thing (for example, time out immediately :).
1928 2054
1929 timeout = new_value; 2055 timeout = new_value;
1930 ev_timer_stop (EV_A_ &timer); 2056 ev_timer_stop (EV_A_ &timer);
1931 callback (EV_A_ &timer, 0); 2057 callback (EV_A_ &timer, 0);
1932 2058
2015 2141
2016The relative timeouts are calculated relative to the C<ev_now ()> 2142The relative timeouts are calculated relative to the C<ev_now ()>
2017time. This is usually the right thing as this timestamp refers to the time 2143time. This is usually the right thing as this timestamp refers to the time
2018of the event triggering whatever timeout you are modifying/starting. If 2144of the event triggering whatever timeout you are modifying/starting. If
2019you suspect event processing to be delayed and you I<need> to base the 2145you suspect event processing to be delayed and you I<need> to base the
2020timeout on the current time, use something like this to adjust for this: 2146timeout on the current time, use something like the following to adjust
2147for it:
2021 2148
2022 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 2149 ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
2023 2150
2024If the event loop is suspended for a long time, you can also force an 2151If the event loop is suspended for a long time, you can also force an
2025update of the time returned by C<ev_now ()> by calling C<ev_now_update 2152update of the time returned by C<ev_now ()> by calling C<ev_now_update
2026()>. 2153()>, although that will push the event time of all outstanding events
2154further into the future.
2027 2155
2028=head3 The special problem of unsynchronised clocks 2156=head3 The special problem of unsynchronised clocks
2029 2157
2030Modern systems have a variety of clocks - libev itself uses the normal 2158Modern systems have a variety of clocks - libev itself uses the normal
2031"wall clock" clock and, if available, the monotonic clock (to avoid time 2159"wall clock" clock and, if available, the monotonic clock (to avoid time
2094 2222
2095=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 2223=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
2096 2224
2097=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 2225=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
2098 2226
2099Configure the timer to trigger after C<after> seconds. If C<repeat> 2227Configure the timer to trigger after C<after> seconds (fractional and
2100is C<0.>, then it will automatically be stopped once the timeout is 2228negative values are supported). If C<repeat> is C<0.>, then it will
2101reached. If it is positive, then the timer will automatically be 2229automatically be stopped once the timeout is reached. If it is positive,
2102configured to trigger again C<repeat> seconds later, again, and again, 2230then the timer will automatically be configured to trigger again C<repeat>
2103until stopped manually. 2231seconds later, again, and again, until stopped manually.
2104 2232
2105The timer itself will do a best-effort at avoiding drift, that is, if 2233The timer itself will do a best-effort at avoiding drift, that is, if
2106you configure a timer to trigger every 10 seconds, then it will normally 2234you configure a timer to trigger every 10 seconds, then it will normally
2107trigger at exactly 10 second intervals. If, however, your program cannot 2235trigger at exactly 10 second intervals. If, however, your program cannot
2108keep up with the timer (because it takes longer than those 10 seconds to 2236keep up with the timer (because it takes longer than those 10 seconds to
2127=item If the timer is repeating, make the C<repeat> value the new timeout 2255=item If the timer is repeating, make the C<repeat> value the new timeout
2128and start the timer, if necessary. 2256and start the timer, if necessary.
2129 2257
2130=back 2258=back
2131 2259
2132This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2260This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2133usage example. 2261usage example.
2134 2262
2135=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2263=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2136 2264
2137Returns the remaining time until a timer fires. If the timer is active, 2265Returns the remaining time until a timer fires. If the timer is active,
2190Periodic watchers are also timers of a kind, but they are very versatile 2318Periodic watchers are also timers of a kind, but they are very versatile
2191(and unfortunately a bit complex). 2319(and unfortunately a bit complex).
2192 2320
2193Unlike C<ev_timer>, periodic watchers are not based on real time (or 2321Unlike C<ev_timer>, periodic watchers are not based on real time (or
2194relative time, the physical time that passes) but on wall clock time 2322relative time, the physical time that passes) but on wall clock time
2195(absolute time, the thing you can read on your calender or clock). The 2323(absolute time, the thing you can read on your calendar or clock). The
2196difference is that wall clock time can run faster or slower than real 2324difference is that wall clock time can run faster or slower than real
2197time, and time jumps are not uncommon (e.g. when you adjust your 2325time, and time jumps are not uncommon (e.g. when you adjust your
2198wrist-watch). 2326wrist-watch).
2199 2327
2200You can tell a periodic watcher to trigger after some specific point 2328You can tell a periodic watcher to trigger after some specific point
2205C<ev_timer>, which would still trigger roughly 10 seconds after starting 2333C<ev_timer>, which would still trigger roughly 10 seconds after starting
2206it, as it uses a relative timeout). 2334it, as it uses a relative timeout).
2207 2335
2208C<ev_periodic> watchers can also be used to implement vastly more complex 2336C<ev_periodic> watchers can also be used to implement vastly more complex
2209timers, such as triggering an event on each "midnight, local time", or 2337timers, such as triggering an event on each "midnight, local time", or
2210other complicated rules. This cannot be done with C<ev_timer> watchers, as 2338other complicated rules. This cannot easily be done with C<ev_timer>
2211those cannot react to time jumps. 2339watchers, as those cannot react to time jumps.
2212 2340
2213As with timers, the callback is guaranteed to be invoked only when the 2341As with timers, the callback is guaranteed to be invoked only when the
2214point in time where it is supposed to trigger has passed. If multiple 2342point in time where it is supposed to trigger has passed. If multiple
2215timers become ready during the same loop iteration then the ones with 2343timers become ready during the same loop iteration then the ones with
2216earlier time-out values are invoked before ones with later time-out values 2344earlier time-out values are invoked before ones with later time-out values
2302 2430
2303NOTE: I<< This callback must always return a time that is higher than or 2431NOTE: I<< This callback must always return a time that is higher than or
2304equal to the passed C<now> value >>. 2432equal to the passed C<now> value >>.
2305 2433
2306This can be used to create very complex timers, such as a timer that 2434This can be used to create very complex timers, such as a timer that
2307triggers on "next midnight, local time". To do this, you would calculate the 2435triggers on "next midnight, local time". To do this, you would calculate
2308next midnight after C<now> and return the timestamp value for this. How 2436the next midnight after C<now> and return the timestamp value for
2309you do this is, again, up to you (but it is not trivial, which is the main 2437this. Here is a (completely untested, no error checking) example on how to
2310reason I omitted it as an example). 2438do this:
2439
2440 #include <time.h>
2441
2442 static ev_tstamp
2443 my_rescheduler (ev_periodic *w, ev_tstamp now)
2444 {
2445 time_t tnow = (time_t)now;
2446 struct tm tm;
2447 localtime_r (&tnow, &tm);
2448
2449 tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day
2450 ++tm.tm_mday; // midnight next day
2451
2452 return mktime (&tm);
2453 }
2454
2455Note: this code might run into trouble on days that have more then two
2456midnights (beginning and end).
2311 2457
2312=back 2458=back
2313 2459
2314=item ev_periodic_again (loop, ev_periodic *) 2460=item ev_periodic_again (loop, ev_periodic *)
2315 2461
2380 2526
2381 ev_periodic hourly_tick; 2527 ev_periodic hourly_tick;
2382 ev_periodic_init (&hourly_tick, clock_cb, 2528 ev_periodic_init (&hourly_tick, clock_cb,
2383 fmod (ev_now (loop), 3600.), 3600., 0); 2529 fmod (ev_now (loop), 3600.), 3600., 0);
2384 ev_periodic_start (loop, &hourly_tick); 2530 ev_periodic_start (loop, &hourly_tick);
2385 2531
2386 2532
2387=head2 C<ev_signal> - signal me when a signal gets signalled! 2533=head2 C<ev_signal> - signal me when a signal gets signalled!
2388 2534
2389Signal watchers will trigger an event when the process receives a specific 2535Signal watchers will trigger an event when the process receives a specific
2390signal one or more times. Even though signals are very asynchronous, libev 2536signal one or more times. Even though signals are very asynchronous, libev
2400only within the same loop, i.e. you can watch for C<SIGINT> in your 2546only within the same loop, i.e. you can watch for C<SIGINT> in your
2401default loop and for C<SIGIO> in another loop, but you cannot watch for 2547default loop and for C<SIGIO> in another loop, but you cannot watch for
2402C<SIGINT> in both the default loop and another loop at the same time. At 2548C<SIGINT> in both the default loop and another loop at the same time. At
2403the moment, C<SIGCHLD> is permanently tied to the default loop. 2549the moment, C<SIGCHLD> is permanently tied to the default loop.
2404 2550
2405When the first watcher gets started will libev actually register something 2551Only after the first watcher for a signal is started will libev actually
2406with the kernel (thus it coexists with your own signal handlers as long as 2552register something with the kernel. It thus coexists with your own signal
2407you don't register any with libev for the same signal). 2553handlers as long as you don't register any with libev for the same signal.
2408 2554
2409If possible and supported, libev will install its handlers with 2555If possible and supported, libev will install its handlers with
2410C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should 2556C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2411not be unduly interrupted. If you have a problem with system calls getting 2557not be unduly interrupted. If you have a problem with system calls getting
2412interrupted by signals you can block all signals in an C<ev_check> watcher 2558interrupted by signals you can block all signals in an C<ev_check> watcher
2597 2743
2598=head2 C<ev_stat> - did the file attributes just change? 2744=head2 C<ev_stat> - did the file attributes just change?
2599 2745
2600This watches a file system path for attribute changes. That is, it calls 2746This watches a file system path for attribute changes. That is, it calls
2601C<stat> on that path in regular intervals (or when the OS says it changed) 2747C<stat> on that path in regular intervals (or when the OS says it changed)
2602and sees if it changed compared to the last time, invoking the callback if 2748and sees if it changed compared to the last time, invoking the callback
2603it did. 2749if it did. Starting the watcher C<stat>'s the file, so only changes that
2750happen after the watcher has been started will be reported.
2604 2751
2605The path does not need to exist: changing from "path exists" to "path does 2752The path does not need to exist: changing from "path exists" to "path does
2606not exist" is a status change like any other. The condition "path does not 2753not exist" is a status change like any other. The condition "path does not
2607exist" (or more correctly "path cannot be stat'ed") is signified by the 2754exist" (or more correctly "path cannot be stat'ed") is signified by the
2608C<st_nlink> field being zero (which is otherwise always forced to be at 2755C<st_nlink> field being zero (which is otherwise always forced to be at
2838Apart from keeping your process non-blocking (which is a useful 2985Apart from keeping your process non-blocking (which is a useful
2839effect on its own sometimes), idle watchers are a good place to do 2986effect on its own sometimes), idle watchers are a good place to do
2840"pseudo-background processing", or delay processing stuff to after the 2987"pseudo-background processing", or delay processing stuff to after the
2841event loop has handled all outstanding events. 2988event loop has handled all outstanding events.
2842 2989
2990=head3 Abusing an C<ev_idle> watcher for its side-effect
2991
2992As long as there is at least one active idle watcher, libev will never
2993sleep unnecessarily. Or in other words, it will loop as fast as possible.
2994For this to work, the idle watcher doesn't need to be invoked at all - the
2995lowest priority will do.
2996
2997This mode of operation can be useful together with an C<ev_check> watcher,
2998to do something on each event loop iteration - for example to balance load
2999between different connections.
3000
3001See L</Abusing an ev_check watcher for its side-effect> for a longer
3002example.
3003
2843=head3 Watcher-Specific Functions and Data Members 3004=head3 Watcher-Specific Functions and Data Members
2844 3005
2845=over 4 3006=over 4
2846 3007
2847=item ev_idle_init (ev_idle *, callback) 3008=item ev_idle_init (ev_idle *, callback)
2858callback, free it. Also, use no error checking, as usual. 3019callback, free it. Also, use no error checking, as usual.
2859 3020
2860 static void 3021 static void
2861 idle_cb (struct ev_loop *loop, ev_idle *w, int revents) 3022 idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2862 { 3023 {
3024 // stop the watcher
3025 ev_idle_stop (loop, w);
3026
3027 // now we can free it
2863 free (w); 3028 free (w);
3029
2864 // now do something you wanted to do when the program has 3030 // now do something you wanted to do when the program has
2865 // no longer anything immediate to do. 3031 // no longer anything immediate to do.
2866 } 3032 }
2867 3033
2868 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 3034 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2870 ev_idle_start (loop, idle_watcher); 3036 ev_idle_start (loop, idle_watcher);
2871 3037
2872 3038
2873=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 3039=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2874 3040
2875Prepare and check watchers are usually (but not always) used in pairs: 3041Prepare and check watchers are often (but not always) used in pairs:
2876prepare watchers get invoked before the process blocks and check watchers 3042prepare watchers get invoked before the process blocks and check watchers
2877afterwards. 3043afterwards.
2878 3044
2879You I<must not> call C<ev_run> or similar functions that enter 3045You I<must not> call C<ev_run> (or similar functions that enter the
2880the current event loop from either C<ev_prepare> or C<ev_check> 3046current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2881watchers. Other loops than the current one are fine, however. The 3047C<ev_check> watchers. Other loops than the current one are fine,
2882rationale behind this is that you do not need to check for recursion in 3048however. The rationale behind this is that you do not need to check
2883those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 3049for recursion in those watchers, i.e. the sequence will always be
2884C<ev_check> so if you have one watcher of each kind they will always be 3050C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2885called in pairs bracketing the blocking call. 3051kind they will always be called in pairs bracketing the blocking call.
2886 3052
2887Their main purpose is to integrate other event mechanisms into libev and 3053Their main purpose is to integrate other event mechanisms into libev and
2888their use is somewhat advanced. They could be used, for example, to track 3054their use is somewhat advanced. They could be used, for example, to track
2889variable changes, implement your own watchers, integrate net-snmp or a 3055variable changes, implement your own watchers, integrate net-snmp or a
2890coroutine library and lots more. They are also occasionally useful if 3056coroutine library and lots more. They are also occasionally useful if
2908with priority higher than or equal to the event loop and one coroutine 3074with priority higher than or equal to the event loop and one coroutine
2909of lower priority, but only once, using idle watchers to keep the event 3075of lower priority, but only once, using idle watchers to keep the event
2910loop from blocking if lower-priority coroutines are active, thus mapping 3076loop from blocking if lower-priority coroutines are active, thus mapping
2911low-priority coroutines to idle/background tasks). 3077low-priority coroutines to idle/background tasks).
2912 3078
2913It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 3079When used for this purpose, it is recommended to give C<ev_check> watchers
2914priority, to ensure that they are being run before any other watchers 3080highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2915after the poll (this doesn't matter for C<ev_prepare> watchers). 3081any other watchers after the poll (this doesn't matter for C<ev_prepare>
3082watchers).
2916 3083
2917Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not 3084Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2918activate ("feed") events into libev. While libev fully supports this, they 3085activate ("feed") events into libev. While libev fully supports this, they
2919might get executed before other C<ev_check> watchers did their job. As 3086might get executed before other C<ev_check> watchers did their job. As
2920C<ev_check> watchers are often used to embed other (non-libev) event 3087C<ev_check> watchers are often used to embed other (non-libev) event
2921loops those other event loops might be in an unusable state until their 3088loops those other event loops might be in an unusable state until their
2922C<ev_check> watcher ran (always remind yourself to coexist peacefully with 3089C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2923others). 3090others).
3091
3092=head3 Abusing an C<ev_check> watcher for its side-effect
3093
3094C<ev_check> (and less often also C<ev_prepare>) watchers can also be
3095useful because they are called once per event loop iteration. For
3096example, if you want to handle a large number of connections fairly, you
3097normally only do a bit of work for each active connection, and if there
3098is more work to do, you wait for the next event loop iteration, so other
3099connections have a chance of making progress.
3100
3101Using an C<ev_check> watcher is almost enough: it will be called on the
3102next event loop iteration. However, that isn't as soon as possible -
3103without external events, your C<ev_check> watcher will not be invoked.
3104
3105This is where C<ev_idle> watchers come in handy - all you need is a
3106single global idle watcher that is active as long as you have one active
3107C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
3108will not sleep, and the C<ev_check> watcher makes sure a callback gets
3109invoked. Neither watcher alone can do that.
2924 3110
2925=head3 Watcher-Specific Functions and Data Members 3111=head3 Watcher-Specific Functions and Data Members
2926 3112
2927=over 4 3113=over 4
2928 3114
3129 3315
3130=over 4 3316=over 4
3131 3317
3132=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3318=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3133 3319
3134=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3320=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3135 3321
3136Configures the watcher to embed the given loop, which must be 3322Configures the watcher to embed the given loop, which must be
3137embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3323embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3138invoked automatically, otherwise it is the responsibility of the callback 3324invoked automatically, otherwise it is the responsibility of the callback
3139to invoke it (it will continue to be called until the sweep has been done, 3325to invoke it (it will continue to be called until the sweep has been done,
3160used). 3346used).
3161 3347
3162 struct ev_loop *loop_hi = ev_default_init (0); 3348 struct ev_loop *loop_hi = ev_default_init (0);
3163 struct ev_loop *loop_lo = 0; 3349 struct ev_loop *loop_lo = 0;
3164 ev_embed embed; 3350 ev_embed embed;
3165 3351
3166 // see if there is a chance of getting one that works 3352 // see if there is a chance of getting one that works
3167 // (remember that a flags value of 0 means autodetection) 3353 // (remember that a flags value of 0 means autodetection)
3168 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 3354 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3169 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 3355 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3170 : 0; 3356 : 0;
3184C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 3370C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3185 3371
3186 struct ev_loop *loop = ev_default_init (0); 3372 struct ev_loop *loop = ev_default_init (0);
3187 struct ev_loop *loop_socket = 0; 3373 struct ev_loop *loop_socket = 0;
3188 ev_embed embed; 3374 ev_embed embed;
3189 3375
3190 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 3376 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3191 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 3377 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3192 { 3378 {
3193 ev_embed_init (&embed, 0, loop_socket); 3379 ev_embed_init (&embed, 0, loop_socket);
3194 ev_embed_start (loop, &embed); 3380 ev_embed_start (loop, &embed);
3202 3388
3203=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3389=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3204 3390
3205Fork watchers are called when a C<fork ()> was detected (usually because 3391Fork watchers are called when a C<fork ()> was detected (usually because
3206whoever is a good citizen cared to tell libev about it by calling 3392whoever is a good citizen cared to tell libev about it by calling
3207C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the 3393C<ev_loop_fork>). The invocation is done before the event loop blocks next
3208event loop blocks next and before C<ev_check> watchers are being called, 3394and before C<ev_check> watchers are being called, and only in the child
3209and only in the child after the fork. If whoever good citizen calling 3395after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3210C<ev_default_fork> cheats and calls it in the wrong process, the fork 3396and calls it in the wrong process, the fork handlers will be invoked, too,
3211handlers will be invoked, too, of course. 3397of course.
3212 3398
3213=head3 The special problem of life after fork - how is it possible? 3399=head3 The special problem of life after fork - how is it possible?
3214 3400
3215Most uses of C<fork()> consist of forking, then some simple calls to set 3401Most uses of C<fork ()> consist of forking, then some simple calls to set
3216up/change the process environment, followed by a call to C<exec()>. This 3402up/change the process environment, followed by a call to C<exec()>. This
3217sequence should be handled by libev without any problems. 3403sequence should be handled by libev without any problems.
3218 3404
3219This changes when the application actually wants to do event handling 3405This changes when the application actually wants to do event handling
3220in the child, or both parent in child, in effect "continuing" after the 3406in the child, or both parent in child, in effect "continuing" after the
3309it by calling C<ev_async_send>, which is thread- and signal safe. 3495it by calling C<ev_async_send>, which is thread- and signal safe.
3310 3496
3311This functionality is very similar to C<ev_signal> watchers, as signals, 3497This functionality is very similar to C<ev_signal> watchers, as signals,
3312too, are asynchronous in nature, and signals, too, will be compressed 3498too, are asynchronous in nature, and signals, too, will be compressed
3313(i.e. the number of callback invocations may be less than the number of 3499(i.e. the number of callback invocations may be less than the number of
3314C<ev_async_sent> calls). In fact, you could use signal watchers as a kind 3500C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3315of "global async watchers" by using a watcher on an otherwise unused 3501of "global async watchers" by using a watcher on an otherwise unused
3316signal, and C<ev_feed_signal> to signal this watcher from another thread, 3502signal, and C<ev_feed_signal> to signal this watcher from another thread,
3317even without knowing which loop owns the signal. 3503even without knowing which loop owns the signal.
3318 3504
3319=head3 Queueing 3505=head3 Queueing
3458 3644
3459There are some other functions of possible interest. Described. Here. Now. 3645There are some other functions of possible interest. Described. Here. Now.
3460 3646
3461=over 4 3647=over 4
3462 3648
3463=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback) 3649=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg)
3464 3650
3465This function combines a simple timer and an I/O watcher, calls your 3651This function combines a simple timer and an I/O watcher, calls your
3466callback on whichever event happens first and automatically stops both 3652callback on whichever event happens first and automatically stops both
3467watchers. This is useful if you want to wait for a single event on an fd 3653watchers. This is useful if you want to wait for a single event on an fd
3468or timeout without having to allocate/configure/start/stop/free one or 3654or timeout without having to allocate/configure/start/stop/free one or
3610already been invoked. 3796already been invoked.
3611 3797
3612A common way around all these issues is to make sure that 3798A common way around all these issues is to make sure that
3613C<start_new_request> I<always> returns before the callback is invoked. If 3799C<start_new_request> I<always> returns before the callback is invoked. If
3614C<start_new_request> immediately knows the result, it can artificially 3800C<start_new_request> immediately knows the result, it can artificially
3615delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher 3801delay invoking the callback by using a C<prepare> or C<idle> watcher for
3616for example, or more sneakily, by reusing an existing (stopped) watcher 3802example, or more sneakily, by reusing an existing (stopped) watcher and
3617and pushing it into the pending queue: 3803pushing it into the pending queue:
3618 3804
3619 ev_set_cb (watcher, callback); 3805 ev_set_cb (watcher, callback);
3620 ev_feed_event (EV_A_ watcher, 0); 3806 ev_feed_event (EV_A_ watcher, 0);
3621 3807
3622This way, C<start_new_request> can safely return before the callback is 3808This way, C<start_new_request> can safely return before the callback is
3630 3816
3631This brings the problem of exiting - a callback might want to finish the 3817This brings the problem of exiting - a callback might want to finish the
3632main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but 3818main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3633a modal "Are you sure?" dialog is still waiting), or just the nested one 3819a modal "Are you sure?" dialog is still waiting), or just the nested one
3634and not the main one (e.g. user clocked "Ok" in a modal dialog), or some 3820and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3635other combination: In these cases, C<ev_break> will not work alone. 3821other combination: In these cases, a simple C<ev_break> will not work.
3636 3822
3637The solution is to maintain "break this loop" variable for each C<ev_run> 3823The solution is to maintain "break this loop" variable for each C<ev_run>
3638invocation, and use a loop around C<ev_run> until the condition is 3824invocation, and use a loop around C<ev_run> until the condition is
3639triggered, using C<EVRUN_ONCE>: 3825triggered, using C<EVRUN_ONCE>:
3640 3826
3676event loop thread and an unspecified mechanism to wake up the main thread. 3862event loop thread and an unspecified mechanism to wake up the main thread.
3677 3863
3678First, you need to associate some data with the event loop: 3864First, you need to associate some data with the event loop:
3679 3865
3680 typedef struct { 3866 typedef struct {
3681 mutex_t lock; /* global loop lock */ 3867 pthread_mutex_t lock; /* global loop lock */
3868 pthread_t tid;
3869 pthread_cond_t invoke_cv;
3682 ev_async async_w; 3870 ev_async async_w;
3683 thread_t tid;
3684 cond_t invoke_cv;
3685 } userdata; 3871 } userdata;
3686 3872
3687 void prepare_loop (EV_P) 3873 void prepare_loop (EV_P)
3688 { 3874 {
3689 // for simplicity, we use a static userdata struct. 3875 // for simplicity, we use a static userdata struct.
3690 static userdata u; 3876 static userdata u;
3691 3877
3692 ev_async_init (&u->async_w, async_cb); 3878 ev_async_init (&u.async_w, async_cb);
3693 ev_async_start (EV_A_ &u->async_w); 3879 ev_async_start (EV_A_ &u.async_w);
3694 3880
3695 pthread_mutex_init (&u->lock, 0); 3881 pthread_mutex_init (&u.lock, 0);
3696 pthread_cond_init (&u->invoke_cv, 0); 3882 pthread_cond_init (&u.invoke_cv, 0);
3697 3883
3698 // now associate this with the loop 3884 // now associate this with the loop
3699 ev_set_userdata (EV_A_ u); 3885 ev_set_userdata (EV_A_ &u);
3700 ev_set_invoke_pending_cb (EV_A_ l_invoke); 3886 ev_set_invoke_pending_cb (EV_A_ l_invoke);
3701 ev_set_loop_release_cb (EV_A_ l_release, l_acquire); 3887 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
3702 3888
3703 // then create the thread running ev_run 3889 // then create the thread running ev_run
3704 pthread_create (&u->tid, 0, l_run, EV_A); 3890 pthread_create (&u.tid, 0, l_run, EV_A);
3705 } 3891 }
3706 3892
3707The callback for the C<ev_async> watcher does nothing: the watcher is used 3893The callback for the C<ev_async> watcher does nothing: the watcher is used
3708solely to wake up the event loop so it takes notice of any new watchers 3894solely to wake up the event loop so it takes notice of any new watchers
3709that might have been added: 3895that might have been added:
3826called): 4012called):
3827 4013
3828 void 4014 void
3829 wait_for_event (ev_watcher *w) 4015 wait_for_event (ev_watcher *w)
3830 { 4016 {
3831 ev_cb_set (w) = current_coro; 4017 ev_set_cb (w, current_coro);
3832 switch_to (libev_coro); 4018 switch_to (libev_coro);
3833 } 4019 }
3834 4020
3835That basically suspends the coroutine inside C<wait_for_event> and 4021That basically suspends the coroutine inside C<wait_for_event> and
3836continues the libev coroutine, which, when appropriate, switches back to 4022continues the libev coroutine, which, when appropriate, switches back to
3839You can do similar tricks if you have, say, threads with an event queue - 4025You can do similar tricks if you have, say, threads with an event queue -
3840instead of storing a coroutine, you store the queue object and instead of 4026instead of storing a coroutine, you store the queue object and instead of
3841switching to a coroutine, you push the watcher onto the queue and notify 4027switching to a coroutine, you push the watcher onto the queue and notify
3842any waiters. 4028any waiters.
3843 4029
3844To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two 4030To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
3845files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: 4031files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3846 4032
3847 // my_ev.h 4033 // my_ev.h
3848 #define EV_CB_DECLARE(type) struct my_coro *cb; 4034 #define EV_CB_DECLARE(type) struct my_coro *cb;
3849 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); 4035 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3850 #include "../libev/ev.h" 4036 #include "../libev/ev.h"
3851 4037
3852 // my_ev.c 4038 // my_ev.c
3853 #define EV_H "my_ev.h" 4039 #define EV_H "my_ev.h"
3854 #include "../libev/ev.c" 4040 #include "../libev/ev.c"
3893 4079
3894=back 4080=back
3895 4081
3896=head1 C++ SUPPORT 4082=head1 C++ SUPPORT
3897 4083
4084=head2 C API
4085
4086The normal C API should work fine when used from C++: both ev.h and the
4087libev sources can be compiled as C++. Therefore, code that uses the C API
4088will work fine.
4089
4090Proper exception specifications might have to be added to callbacks passed
4091to libev: exceptions may be thrown only from watcher callbacks, all other
4092callbacks (allocator, syserr, loop acquire/release and periodic reschedule
4093callbacks) must not throw exceptions, and might need a C<noexcept>
4094specification. If you have code that needs to be compiled as both C and
4095C++ you can use the C<EV_NOEXCEPT> macro for this:
4096
4097 static void
4098 fatal_error (const char *msg) EV_NOEXCEPT
4099 {
4100 perror (msg);
4101 abort ();
4102 }
4103
4104 ...
4105 ev_set_syserr_cb (fatal_error);
4106
4107The only API functions that can currently throw exceptions are C<ev_run>,
4108C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
4109because it runs cleanup watchers).
4110
4111Throwing exceptions in watcher callbacks is only supported if libev itself
4112is compiled with a C++ compiler or your C and C++ environments allow
4113throwing exceptions through C libraries (most do).
4114
4115=head2 C++ API
4116
3898Libev comes with some simplistic wrapper classes for C++ that mainly allow 4117Libev comes with some simplistic wrapper classes for C++ that mainly allow
3899you to use some convenience methods to start/stop watchers and also change 4118you to use some convenience methods to start/stop watchers and also change
3900the callback model to a model using method callbacks on objects. 4119the callback model to a model using method callbacks on objects.
3901 4120
3902To use it, 4121To use it,
3903 4122
3904 #include <ev++.h> 4123 #include <ev++.h>
3905 4124
3906This automatically includes F<ev.h> and puts all of its definitions (many 4125This automatically includes F<ev.h> and puts all of its definitions (many
3907of them macros) into the global namespace. All C++ specific things are 4126of them macros) into the global namespace. All C++ specific things are
3908put into the C<ev> namespace. It should support all the same embedding 4127put into the C<ev> namespace. It should support all the same embedding
4011 void operator() (ev::io &w, int revents) 4230 void operator() (ev::io &w, int revents)
4012 { 4231 {
4013 ... 4232 ...
4014 } 4233 }
4015 } 4234 }
4016 4235
4017 myfunctor f; 4236 myfunctor f;
4018 4237
4019 ev::io w; 4238 ev::io w;
4020 w.set (&f); 4239 w.set (&f);
4021 4240
4039Associates a different C<struct ev_loop> with this watcher. You can only 4258Associates a different C<struct ev_loop> with this watcher. You can only
4040do this when the watcher is inactive (and not pending either). 4259do this when the watcher is inactive (and not pending either).
4041 4260
4042=item w->set ([arguments]) 4261=item w->set ([arguments])
4043 4262
4044Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4263Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
4045method or a suitable start method must be called at least once. Unlike the 4264with the same arguments. Either this method or a suitable start method
4046C counterpart, an active watcher gets automatically stopped and restarted 4265must be called at least once. Unlike the C counterpart, an active watcher
4047when reconfiguring it with this method. 4266gets automatically stopped and restarted when reconfiguring it with this
4267method.
4268
4269For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4270clashing with the C<set (loop)> method.
4271
4272For C<ev::io> watchers there is an additional C<set> method that acepts a
4273new event mask only, and internally calls C<ev_io_modify>.
4048 4274
4049=item w->start () 4275=item w->start ()
4050 4276
4051Starts the watcher. Note that there is no C<loop> argument, as the 4277Starts the watcher. Note that there is no C<loop> argument, as the
4052constructor already stores the event loop. 4278constructor already stores the event loop.
4156 4382
4157Brian Maher has written a partial interface to libev for lua (at the 4383Brian Maher has written a partial interface to libev for lua (at the
4158time of this writing, only C<ev_io> and C<ev_timer>), to be found at 4384time of this writing, only C<ev_io> and C<ev_timer>), to be found at
4159L<http://github.com/brimworks/lua-ev>. 4385L<http://github.com/brimworks/lua-ev>.
4160 4386
4387=item Javascript
4388
4389Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
4390
4391=item Others
4392
4393There are others, and I stopped counting.
4394
4161=back 4395=back
4162 4396
4163 4397
4164=head1 MACRO MAGIC 4398=head1 MACRO MAGIC
4165 4399
4282 ev_vars.h 4516 ev_vars.h
4283 ev_wrap.h 4517 ev_wrap.h
4284 4518
4285 ev_win32.c required on win32 platforms only 4519 ev_win32.c required on win32 platforms only
4286 4520
4287 ev_select.c only when select backend is enabled (which is enabled by default) 4521 ev_select.c only when select backend is enabled
4288 ev_poll.c only when poll backend is enabled (disabled by default) 4522 ev_poll.c only when poll backend is enabled
4289 ev_epoll.c only when the epoll backend is enabled (disabled by default) 4523 ev_epoll.c only when the epoll backend is enabled
4524 ev_linuxaio.c only when the linux aio backend is enabled
4525 ev_iouring.c only when the linux io_uring backend is enabled
4290 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 4526 ev_kqueue.c only when the kqueue backend is enabled
4291 ev_port.c only when the solaris port backend is enabled (disabled by default) 4527 ev_port.c only when the solaris port backend is enabled
4292 4528
4293F<ev.c> includes the backend files directly when enabled, so you only need 4529F<ev.c> includes the backend files directly when enabled, so you only need
4294to compile this single file. 4530to compile this single file.
4295 4531
4296=head3 LIBEVENT COMPATIBILITY API 4532=head3 LIBEVENT COMPATIBILITY API
4415available and will probe for kernel support at runtime. This will improve 4651available and will probe for kernel support at runtime. This will improve
4416C<ev_signal> and C<ev_async> performance and reduce resource consumption. 4652C<ev_signal> and C<ev_async> performance and reduce resource consumption.
4417If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc 4653If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc
44182.7 or newer, otherwise disabled. 46542.7 or newer, otherwise disabled.
4419 4655
4656=item EV_USE_SIGNALFD
4657
4658If defined to be C<1>, then libev will assume that C<signalfd ()> is
4659available and will probe for kernel support at runtime. This enables
4660the use of EVFLAG_SIGNALFD for faster and simpler signal handling. If
4661undefined, it will be enabled if the headers indicate GNU/Linux + Glibc
46622.7 or newer, otherwise disabled.
4663
4664=item EV_USE_TIMERFD
4665
4666If defined to be C<1>, then libev will assume that C<timerfd ()> is
4667available and will probe for kernel support at runtime. This allows
4668libev to detect time jumps accurately. If undefined, it will be enabled
4669if the headers indicate GNU/Linux + Glibc 2.8 or newer and define
4670C<TFD_TIMER_CANCEL_ON_SET>, otherwise disabled.
4671
4672=item EV_USE_EVENTFD
4673
4674If defined to be C<1>, then libev will assume that C<eventfd ()> is
4675available and will probe for kernel support at runtime. This will improve
4676C<ev_signal> and C<ev_async> performance and reduce resource consumption.
4677If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc
46782.7 or newer, otherwise disabled.
4679
4420=item EV_USE_SELECT 4680=item EV_USE_SELECT
4421 4681
4422If undefined or defined to be C<1>, libev will compile in support for the 4682If undefined or defined to be C<1>, libev will compile in support for the
4423C<select>(2) backend. No attempt at auto-detection will be done: if no 4683C<select>(2) backend. No attempt at auto-detection will be done: if no
4424other method takes over, select will be it. Otherwise the select backend 4684other method takes over, select will be it. Otherwise the select backend
4464If programs implement their own fd to handle mapping on win32, then this 4724If programs implement their own fd to handle mapping on win32, then this
4465macro can be used to override the C<close> function, useful to unregister 4725macro can be used to override the C<close> function, useful to unregister
4466file descriptors again. Note that the replacement function has to close 4726file descriptors again. Note that the replacement function has to close
4467the underlying OS handle. 4727the underlying OS handle.
4468 4728
4729=item EV_USE_WSASOCKET
4730
4731If defined to be C<1>, libev will use C<WSASocket> to create its internal
4732communication socket, which works better in some environments. Otherwise,
4733the normal C<socket> function will be used, which works better in other
4734environments.
4735
4469=item EV_USE_POLL 4736=item EV_USE_POLL
4470 4737
4471If defined to be C<1>, libev will compile in support for the C<poll>(2) 4738If defined to be C<1>, libev will compile in support for the C<poll>(2)
4472backend. Otherwise it will be enabled on non-win32 platforms. It 4739backend. Otherwise it will be enabled on non-win32 platforms. It
4473takes precedence over select. 4740takes precedence over select.
4477If defined to be C<1>, libev will compile in support for the Linux 4744If defined to be C<1>, libev will compile in support for the Linux
4478C<epoll>(7) backend. Its availability will be detected at runtime, 4745C<epoll>(7) backend. Its availability will be detected at runtime,
4479otherwise another method will be used as fallback. This is the preferred 4746otherwise another method will be used as fallback. This is the preferred
4480backend for GNU/Linux systems. If undefined, it will be enabled if the 4747backend for GNU/Linux systems. If undefined, it will be enabled if the
4481headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. 4748headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
4749
4750=item EV_USE_LINUXAIO
4751
4752If defined to be C<1>, libev will compile in support for the Linux aio
4753backend (C<EV_USE_EPOLL> must also be enabled). If undefined, it will be
4754enabled on linux, otherwise disabled.
4755
4756=item EV_USE_IOURING
4757
4758If defined to be C<1>, libev will compile in support for the Linux
4759io_uring backend (C<EV_USE_EPOLL> must also be enabled). Due to it's
4760current limitations it has to be requested explicitly. If undefined, it
4761will be enabled on linux, otherwise disabled.
4482 4762
4483=item EV_USE_KQUEUE 4763=item EV_USE_KQUEUE
4484 4764
4485If defined to be C<1>, libev will compile in support for the BSD style 4765If defined to be C<1>, libev will compile in support for the BSD style
4486C<kqueue>(2) backend. Its actual availability will be detected at runtime, 4766C<kqueue>(2) backend. Its actual availability will be detected at runtime,
4517different cpus (or different cpu cores). This reduces dependencies 4797different cpus (or different cpu cores). This reduces dependencies
4518and makes libev faster. 4798and makes libev faster.
4519 4799
4520=item EV_NO_THREADS 4800=item EV_NO_THREADS
4521 4801
4522If defined to be C<1>, libev will assume that it will never be called 4802If defined to be C<1>, libev will assume that it will never be called from
4523from different threads, which is a stronger assumption than C<EV_NO_SMP>, 4803different threads (that includes signal handlers), which is a stronger
4524above. This reduces dependencies and makes libev faster. 4804assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4805libev faster.
4525 4806
4526=item EV_ATOMIC_T 4807=item EV_ATOMIC_T
4527 4808
4528Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4809Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4529access is atomic and serialised with respect to other threads or signal 4810access is atomic with respect to other threads or signal contexts. No
4530contexts. No such type is easily found in the C language, so you can 4811such type is easily found in the C language, so you can provide your own
4531provide your own type that you know is safe for your purposes. It is used 4812type that you know is safe for your purposes. It is used both for signal
4532both for signal handler "locking" as well as for signal and thread safety 4813handler "locking" as well as for signal and thread safety in C<ev_async>
4533in C<ev_async> watchers. 4814watchers.
4534 4815
4535In the absence of this define, libev will use C<sig_atomic_t volatile> 4816In the absence of this define, libev will use C<sig_atomic_t volatile>
4536(from F<signal.h>), which is usually good enough on most platforms, 4817(from F<signal.h>), which is usually good enough on most platforms.
4537although strictly speaking using a type that also implies a memory fence
4538is required.
4539 4818
4540=item EV_H (h) 4819=item EV_H (h)
4541 4820
4542The name of the F<ev.h> header file used to include it. The default if 4821The name of the F<ev.h> header file used to include it. The default if
4543undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4822undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
4616 #define EV_USE_POLL 1 4895 #define EV_USE_POLL 1
4617 #define EV_CHILD_ENABLE 1 4896 #define EV_CHILD_ENABLE 1
4618 #define EV_ASYNC_ENABLE 1 4897 #define EV_ASYNC_ENABLE 1
4619 4898
4620The actual value is a bitset, it can be a combination of the following 4899The actual value is a bitset, it can be a combination of the following
4621values: 4900values (by default, all of these are enabled):
4622 4901
4623=over 4 4902=over 4
4624 4903
4625=item C<1> - faster/larger code 4904=item C<1> - faster/larger code
4626 4905
4630code size by roughly 30% on amd64). 4909code size by roughly 30% on amd64).
4631 4910
4632When optimising for size, use of compiler flags such as C<-Os> with 4911When optimising for size, use of compiler flags such as C<-Os> with
4633gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of 4912gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4634assertions. 4913assertions.
4914
4915The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4916(e.g. gcc with C<-Os>).
4635 4917
4636=item C<2> - faster/larger data structures 4918=item C<2> - faster/larger data structures
4637 4919
4638Replaces the small 2-heap for timer management by a faster 4-heap, larger 4920Replaces the small 2-heap for timer management by a faster 4-heap, larger
4639hash table sizes and so on. This will usually further increase code size 4921hash table sizes and so on. This will usually further increase code size
4640and can additionally have an effect on the size of data structures at 4922and can additionally have an effect on the size of data structures at
4641runtime. 4923runtime.
4924
4925The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4926(e.g. gcc with C<-Os>).
4642 4927
4643=item C<4> - full API configuration 4928=item C<4> - full API configuration
4644 4929
4645This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and 4930This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4646enables multiplicity (C<EV_MULTIPLICITY>=1). 4931enables multiplicity (C<EV_MULTIPLICITY>=1).
4758in. If set to C<1>, then verification code will be compiled in, but not 5043in. If set to C<1>, then verification code will be compiled in, but not
4759called. If set to C<2>, then the internal verification code will be 5044called. If set to C<2>, then the internal verification code will be
4760called once per loop, which can slow down libev. If set to C<3>, then the 5045called once per loop, which can slow down libev. If set to C<3>, then the
4761verification code will be called very frequently, which will slow down 5046verification code will be called very frequently, which will slow down
4762libev considerably. 5047libev considerably.
5048
5049Verification errors are reported via C's C<assert> mechanism, so if you
5050disable that (e.g. by defining C<NDEBUG>) then no errors will be reported.
4763 5051
4764The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it 5052The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
4765will be C<0>. 5053will be C<0>.
4766 5054
4767=item EV_COMMON 5055=item EV_COMMON
4905default loop and triggering an C<ev_async> watcher from the default loop 5193default loop and triggering an C<ev_async> watcher from the default loop
4906watcher callback into the event loop interested in the signal. 5194watcher callback into the event loop interested in the signal.
4907 5195
4908=back 5196=back
4909 5197
4910See also L<THREAD LOCKING EXAMPLE>. 5198See also L</THREAD LOCKING EXAMPLE>.
4911 5199
4912=head3 COROUTINES 5200=head3 COROUTINES
4913 5201
4914Libev is very accommodating to coroutines ("cooperative threads"): 5202Libev is very accommodating to coroutines ("cooperative threads"):
4915libev fully supports nesting calls to its functions from different 5203libev fully supports nesting calls to its functions from different
5184structure (guaranteed by POSIX but not by ISO C for example), but it also 5472structure (guaranteed by POSIX but not by ISO C for example), but it also
5185assumes that the same (machine) code can be used to call any watcher 5473assumes that the same (machine) code can be used to call any watcher
5186callback: The watcher callbacks have different type signatures, but libev 5474callback: The watcher callbacks have different type signatures, but libev
5187calls them using an C<ev_watcher *> internally. 5475calls them using an C<ev_watcher *> internally.
5188 5476
5477=item null pointers and integer zero are represented by 0 bytes
5478
5479Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and
5480relies on this setting pointers and integers to null.
5481
5189=item pointer accesses must be thread-atomic 5482=item pointer accesses must be thread-atomic
5190 5483
5191Accessing a pointer value must be atomic, it must both be readable and 5484Accessing a pointer value must be atomic, it must both be readable and
5192writable in one piece - this is the case on all current architectures. 5485writable in one piece - this is the case on all current architectures.
5193 5486
5206thread" or will block signals process-wide, both behaviours would 5499thread" or will block signals process-wide, both behaviours would
5207be compatible with libev. Interaction between C<sigprocmask> and 5500be compatible with libev. Interaction between C<sigprocmask> and
5208C<pthread_sigmask> could complicate things, however. 5501C<pthread_sigmask> could complicate things, however.
5209 5502
5210The most portable way to handle signals is to block signals in all threads 5503The most portable way to handle signals is to block signals in all threads
5211except the initial one, and run the default loop in the initial thread as 5504except the initial one, and run the signal handling loop in the initial
5212well. 5505thread as well.
5213 5506
5214=item C<long> must be large enough for common memory allocation sizes 5507=item C<long> must be large enough for common memory allocation sizes
5215 5508
5216To improve portability and simplify its API, libev uses C<long> internally 5509To improve portability and simplify its API, libev uses C<long> internally
5217instead of C<size_t> when allocating its data structures. On non-POSIX 5510instead of C<size_t> when allocating its data structures. On non-POSIX
5321=over 4 5614=over 4
5322 5615
5323=item C<EV_COMPAT3> backwards compatibility mechanism 5616=item C<EV_COMPAT3> backwards compatibility mechanism
5324 5617
5325The backward compatibility mechanism can be controlled by 5618The backward compatibility mechanism can be controlled by
5326C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> 5619C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5327section. 5620section.
5328 5621
5329=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5622=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5330 5623
5331These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5624These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5374=over 4 5667=over 4
5375 5668
5376=item active 5669=item active
5377 5670
5378A watcher is active as long as it has been started and not yet stopped. 5671A watcher is active as long as it has been started and not yet stopped.
5379See L<WATCHER STATES> for details. 5672See L</WATCHER STATES> for details.
5380 5673
5381=item application 5674=item application
5382 5675
5383In this document, an application is whatever is using libev. 5676In this document, an application is whatever is using libev.
5384 5677
5420watchers and events. 5713watchers and events.
5421 5714
5422=item pending 5715=item pending
5423 5716
5424A watcher is pending as soon as the corresponding event has been 5717A watcher is pending as soon as the corresponding event has been
5425detected. See L<WATCHER STATES> for details. 5718detected. See L</WATCHER STATES> for details.
5426 5719
5427=item real time 5720=item real time
5428 5721
5429The physical time that is observed. It is apparently strictly monotonic :) 5722The physical time that is observed. It is apparently strictly monotonic :)
5430 5723

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines