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

Comparing libev/ev.pod (file contents):
Revision 1.236 by root, Thu Apr 16 07:56:05 2009 UTC vs.
Revision 1.316 by root, Fri Oct 22 09:34:01 2010 UTC

26 puts ("stdin ready"); 26 puts ("stdin ready");
27 // for one-shot events, one must manually stop the watcher 27 // for one-shot events, one must manually stop the watcher
28 // with its corresponding stop function. 28 // with its corresponding stop function.
29 ev_io_stop (EV_A_ w); 29 ev_io_stop (EV_A_ w);
30 30
31 // this causes all nested ev_loop's to stop iterating 31 // this causes all nested ev_run's to stop iterating
32 ev_unloop (EV_A_ EVUNLOOP_ALL); 32 ev_break (EV_A_ EVBREAK_ALL);
33 } 33 }
34 34
35 // another callback, this time for a time-out 35 // another callback, this time for a time-out
36 static void 36 static void
37 timeout_cb (EV_P_ ev_timer *w, int revents) 37 timeout_cb (EV_P_ ev_timer *w, int revents)
38 { 38 {
39 puts ("timeout"); 39 puts ("timeout");
40 // this causes the innermost ev_loop to stop iterating 40 // this causes the innermost ev_run to stop iterating
41 ev_unloop (EV_A_ EVUNLOOP_ONE); 41 ev_break (EV_A_ EVBREAK_ONE);
42 } 42 }
43 43
44 int 44 int
45 main (void) 45 main (void)
46 { 46 {
56 // simple non-repeating 5.5 second timeout 56 // simple non-repeating 5.5 second timeout
57 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); 57 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
58 ev_timer_start (loop, &timeout_watcher); 58 ev_timer_start (loop, &timeout_watcher);
59 59
60 // now wait for events to arrive 60 // now wait for events to arrive
61 ev_loop (loop, 0); 61 ev_run (loop, 0);
62 62
63 // unloop was called, so exit 63 // unloop was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
75While this document tries to be as complete as possible in documenting 75While this document tries to be as complete as possible in documenting
76libev, its usage and the rationale behind its design, it is not a tutorial 76libev, its usage and the rationale behind its design, it is not a tutorial
77on event-based programming, nor will it introduce event-based programming 77on event-based programming, nor will it introduce event-based programming
78with libev. 78with libev.
79 79
80Familarity with event based programming techniques in general is assumed 80Familiarity with event based programming techniques in general is assumed
81throughout this document. 81throughout this document.
82 82
83=head1 ABOUT LIBEV 83=head1 ABOUT LIBEV
84 84
85Libev is an event loop: you register interest in certain events (such as a 85Libev is an event loop: you register interest in certain events (such as a
98=head2 FEATURES 98=head2 FEATURES
99 99
100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
102for file descriptor events (C<ev_io>), the Linux C<inotify> interface 102for file descriptor events (C<ev_io>), the Linux C<inotify> interface
103(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 103(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
104with customised rescheduling (C<ev_periodic>), synchronous signals 104inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
105(C<ev_signal>), process status change events (C<ev_child>), and event 105timers (C<ev_timer>), absolute timers with customised rescheduling
106watchers dealing with the event loop mechanism itself (C<ev_idle>, 106(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
107C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as 107change events (C<ev_child>), and event watchers dealing with the event
108file watchers (C<ev_stat>) and even limited support for fork events 108loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
109(C<ev_fork>). 109C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
110limited support for fork events (C<ev_fork>).
110 111
111It also is quite fast (see this 112It also is quite fast (see this
112L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 113L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
113for example). 114for example).
114 115
117Libev is very configurable. In this manual the default (and most common) 118Libev is very configurable. In this manual the default (and most common)
118configuration will be described, which supports multiple event loops. For 119configuration will be described, which supports multiple event loops. For
119more info about various configuration options please have a look at 120more info about various configuration options please have a look at
120B<EMBED> section in this manual. If libev was configured without support 121B<EMBED> section in this manual. If libev was configured without support
121for multiple event loops, then all functions taking an initial argument of 122for multiple event loops, then all functions taking an initial argument of
122name C<loop> (which is always of type C<ev_loop *>) will not have 123name C<loop> (which is always of type C<struct ev_loop *>) will not have
123this argument. 124this argument.
124 125
125=head2 TIME REPRESENTATION 126=head2 TIME REPRESENTATION
126 127
127Libev represents time as a single floating point number, representing the 128Libev represents time as a single floating point number, representing
128(fractional) number of seconds since the (POSIX) epoch (somewhere near 129the (fractional) number of seconds since the (POSIX) epoch (in practise
129the beginning of 1970, details are complicated, don't ask). This type is 130somewhere near the beginning of 1970, details are complicated, don't
130called C<ev_tstamp>, which is what you should use too. It usually aliases 131ask). This type is called C<ev_tstamp>, which is what you should use
131to the C<double> type in C, and when you need to do any calculations on 132too. It usually aliases to the C<double> type in C. When you need to do
132it, you should treat it as some floating point value. Unlike the name 133any calculations on it, you should treat it as some floating point value.
134
133component C<stamp> might indicate, it is also used for time differences 135Unlike the name component C<stamp> might indicate, it is also used for
134throughout libev. 136time differences (e.g. delays) throughout libev.
135 137
136=head1 ERROR HANDLING 138=head1 ERROR HANDLING
137 139
138Libev knows three classes of errors: operating system errors, usage errors 140Libev knows three classes of errors: operating system errors, usage errors
139and internal errors (bugs). 141and internal errors (bugs).
190as this indicates an incompatible change. Minor versions are usually 192as this indicates an incompatible change. Minor versions are usually
191compatible to older versions, so a larger minor version alone is usually 193compatible to older versions, so a larger minor version alone is usually
192not a problem. 194not a problem.
193 195
194Example: Make sure we haven't accidentally been linked against the wrong 196Example: Make sure we haven't accidentally been linked against the wrong
195version. 197version (note, however, that this will not detect ABI mismatches :).
196 198
197 assert (("libev version mismatch", 199 assert (("libev version mismatch",
198 ev_version_major () == EV_VERSION_MAJOR 200 ev_version_major () == EV_VERSION_MAJOR
199 && ev_version_minor () >= EV_VERSION_MINOR)); 201 && ev_version_minor () >= EV_VERSION_MINOR));
200 202
290 292
291=back 293=back
292 294
293=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 295=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
294 296
295An event loop is described by a C<struct ev_loop *> (the C<struct> 297An event loop is described by a C<struct ev_loop *> (the C<struct> is
296is I<not> optional in this case, as there is also an C<ev_loop> 298I<not> optional in this case unless libev 3 compatibility is disabled, as
297I<function>). 299libev 3 had an C<ev_loop> function colliding with the struct name).
298 300
299The library knows two types of such loops, the I<default> loop, which 301The library knows two types of such loops, the I<default> loop, which
300supports signals and child events, and dynamically created loops which do 302supports signals and child events, and dynamically created event loops
301not. 303which do not.
302 304
303=over 4 305=over 4
304 306
305=item struct ev_loop *ev_default_loop (unsigned int flags) 307=item struct ev_loop *ev_default_loop (unsigned int flags)
306 308
344useful to try out specific backends to test their performance, or to work 346useful to try out specific backends to test their performance, or to work
345around bugs. 347around bugs.
346 348
347=item C<EVFLAG_FORKCHECK> 349=item C<EVFLAG_FORKCHECK>
348 350
349Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after 351Instead of calling C<ev_loop_fork> manually after a fork, you can also
350a fork, you can also make libev check for a fork in each iteration by 352make libev check for a fork in each iteration by enabling this flag.
351enabling this flag.
352 353
353This works by calling C<getpid ()> on every iteration of the loop, 354This works by calling C<getpid ()> on every iteration of the loop,
354and thus this might slow down your event loop if you do a lot of loop 355and thus this might slow down your event loop if you do a lot of loop
355iterations and little real work, but is usually not noticeable (on my 356iterations and little real work, but is usually not noticeable (on my
356GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 357GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
362flag. 363flag.
363 364
364This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 365This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
365environment variable. 366environment variable.
366 367
368=item C<EVFLAG_NOINOTIFY>
369
370When this flag is specified, then libev will not attempt to use the
371I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
372testing, this flag can be useful to conserve inotify file descriptors, as
373otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374
375=item C<EVFLAG_SIGNALFD>
376
377When this flag is specified, then libev will attempt to use the
378I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
379delivers signals synchronously, which makes it both faster and might make
380it possible to get the queued signal data. It can also simplify signal
381handling with threads, as long as you properly block signals in your
382threads that are not interested in handling them.
383
384Signalfd will not be used by default as this changes your signal mask, and
385there are a lot of shoddy libraries and programs (glib's threadpool for
386example) that can't properly initialise their signal masks.
387
367=item C<EVBACKEND_SELECT> (value 1, portable select backend) 388=item C<EVBACKEND_SELECT> (value 1, portable select backend)
368 389
369This is your standard select(2) backend. Not I<completely> standard, as 390This is your standard select(2) backend. Not I<completely> standard, as
370libev tries to roll its own fd_set with no limits on the number of fds, 391libev tries to roll its own fd_set with no limits on the number of fds,
371but if that fails, expect a fairly low limit on the number of fds when 392but if that fails, expect a fairly low limit on the number of fds when
394 415
395This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 416This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
396C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 417C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
397 418
398=item C<EVBACKEND_EPOLL> (value 4, Linux) 419=item C<EVBACKEND_EPOLL> (value 4, Linux)
420
421Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
422kernels).
399 423
400For few fds, this backend is a bit little slower than poll and select, 424For few fds, this backend is a bit little slower than poll and select,
401but it scales phenomenally better. While poll and select usually scale 425but it scales phenomenally better. While poll and select usually scale
402like O(total_fds) where n is the total number of fds (or the highest fd), 426like O(total_fds) where n is the total number of fds (or the highest fd),
403epoll scales either O(1) or O(active_fds). 427epoll scales either O(1) or O(active_fds).
415of course I<doesn't>, and epoll just loves to report events for totally 439of course I<doesn't>, and epoll just loves to report events for totally
416I<different> file descriptors (even already closed ones, so one cannot 440I<different> file descriptors (even already closed ones, so one cannot
417even remove them from the set) than registered in the set (especially 441even remove them from the set) than registered in the set (especially
418on SMP systems). Libev tries to counter these spurious notifications by 442on SMP systems). Libev tries to counter these spurious notifications by
419employing an additional generation counter and comparing that against the 443employing an additional generation counter and comparing that against the
420events to filter out spurious ones, recreating the set when required. 444events to filter out spurious ones, recreating the set when required. Last
445not least, it also refuses to work with some file descriptors which work
446perfectly fine with C<select> (files, many character devices...).
421 447
422While stopping, setting and starting an I/O watcher in the same iteration 448While stopping, setting and starting an I/O watcher in the same iteration
423will result in some caching, there is still a system call per such 449will result in some caching, there is still a system call per such
424incident (because the same I<file descriptor> could point to a different 450incident (because the same I<file descriptor> could point to a different
425I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 451I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
518 544
519It is definitely not recommended to use this flag. 545It is definitely not recommended to use this flag.
520 546
521=back 547=back
522 548
523If one or more of these are or'ed into the flags value, then only these 549If one or more of the backend flags are or'ed into the flags value,
524backends will be tried (in the reverse order as listed here). If none are 550then only these backends will be tried (in the reverse order as listed
525specified, all backends in C<ev_recommended_backends ()> will be tried. 551here). If none are specified, all backends in C<ev_recommended_backends
552()> will be tried.
526 553
527Example: This is the most typical usage. 554Example: This is the most typical usage.
528 555
529 if (!ev_default_loop (0)) 556 if (!ev_default_loop (0))
530 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 557 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
542 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 569 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
543 570
544=item struct ev_loop *ev_loop_new (unsigned int flags) 571=item struct ev_loop *ev_loop_new (unsigned int flags)
545 572
546Similar to C<ev_default_loop>, but always creates a new event loop that is 573Similar to C<ev_default_loop>, but always creates a new event loop that is
547always distinct from the default loop. Unlike the default loop, it cannot 574always distinct from the default loop.
548handle signal and child watchers, and attempts to do so will be greeted by
549undefined behaviour (or a failed assertion if assertions are enabled).
550 575
551Note that this function I<is> thread-safe, and the recommended way to use 576Note that this function I<is> thread-safe, and one common way to use
552libev with threads is indeed to create one loop per thread, and using the 577libev with threads is indeed to create one loop per thread, and using the
553default loop in the "main" or "initial" thread. 578default loop in the "main" or "initial" thread.
554 579
555Example: Try to create a event loop that uses epoll and nothing else. 580Example: Try to create a event loop that uses epoll and nothing else.
556 581
558 if (!epoller) 583 if (!epoller)
559 fatal ("no epoll found here, maybe it hides under your chair"); 584 fatal ("no epoll found here, maybe it hides under your chair");
560 585
561=item ev_default_destroy () 586=item ev_default_destroy ()
562 587
563Destroys the default loop again (frees all memory and kernel state 588Destroys the default loop (frees all memory and kernel state etc.). None
564etc.). None of the active event watchers will be stopped in the normal 589of the active event watchers will be stopped in the normal sense, so
565sense, so e.g. C<ev_is_active> might still return true. It is your 590e.g. C<ev_is_active> might still return true. It is your responsibility to
566responsibility to either stop all watchers cleanly yourself I<before> 591either stop all watchers cleanly yourself I<before> calling this function,
567calling this function, or cope with the fact afterwards (which is usually 592or cope with the fact afterwards (which is usually the easiest thing, you
568the easiest thing, you can just ignore the watchers and/or C<free ()> them 593can just ignore the watchers and/or C<free ()> them for example).
569for example).
570 594
571Note that certain global state, such as signal state (and installed signal 595Note that certain global state, such as signal state (and installed signal
572handlers), will not be freed by this function, and related watchers (such 596handlers), will not be freed by this function, and related watchers (such
573as signal and child watchers) would need to be stopped manually. 597as signal and child watchers) would need to be stopped manually.
574 598
575In general it is not advisable to call this function except in the 599In general it is not advisable to call this function except in the
576rare occasion where you really need to free e.g. the signal handling 600rare occasion where you really need to free e.g. the signal handling
577pipe fds. If you need dynamically allocated loops it is better to use 601pipe fds. If you need dynamically allocated loops it is better to use
578C<ev_loop_new> and C<ev_loop_destroy>). 602C<ev_loop_new> and C<ev_loop_destroy>.
579 603
580=item ev_loop_destroy (loop) 604=item ev_loop_destroy (loop)
581 605
582Like C<ev_default_destroy>, but destroys an event loop created by an 606Like C<ev_default_destroy>, but destroys an event loop created by an
583earlier call to C<ev_loop_new>. 607earlier call to C<ev_loop_new>.
584 608
585=item ev_default_fork () 609=item ev_default_fork ()
586 610
587This function sets a flag that causes subsequent C<ev_loop> iterations 611This function sets a flag that causes subsequent C<ev_run> iterations
588to reinitialise the kernel state for backends that have one. Despite the 612to reinitialise the kernel state for backends that have one. Despite the
589name, you can call it anytime, but it makes most sense after forking, in 613name, you can call it anytime, but it makes most sense after forking, in
590the child process (or both child and parent, but that again makes little 614the child process (or both child and parent, but that again makes little
591sense). You I<must> call it in the child before using any of the libev 615sense). You I<must> call it in the child before using any of the libev
592functions, and it will only take effect at the next C<ev_loop> iteration. 616functions, and it will only take effect at the next C<ev_run> iteration.
617
618Again, you I<have> to call it on I<any> loop that you want to re-use after
619a fork, I<even if you do not plan to use the loop in the parent>. This is
620because some kernel interfaces *cough* I<kqueue> *cough* do funny things
621during fork.
593 622
594On the other hand, you only need to call this function in the child 623On the other hand, you only need to call this function in the child
595process if and only if you want to use the event library in the child. If 624process if and only if you want to use the event loop in the child. If
596you just fork+exec, you don't have to call it at all. 625you just fork+exec or create a new loop in the child, you don't have to
626call it at all (in fact, C<epoll> is so badly broken that it makes a
627difference, but libev will usually detect this case on its own and do a
628costly reset of the backend).
597 629
598The function itself is quite fast and it's usually not a problem to call 630The function itself is quite fast and it's usually not a problem to call
599it just in case after a fork. To make this easy, the function will fit in 631it just in case after a fork. To make this easy, the function will fit in
600quite nicely into a call to C<pthread_atfork>: 632quite nicely into a call to C<pthread_atfork>:
601 633
603 635
604=item ev_loop_fork (loop) 636=item ev_loop_fork (loop)
605 637
606Like C<ev_default_fork>, but acts on an event loop created by 638Like C<ev_default_fork>, but acts on an event loop created by
607C<ev_loop_new>. Yes, you have to call this on every allocated event loop 639C<ev_loop_new>. Yes, you have to call this on every allocated event loop
608after fork that you want to re-use in the child, and how you do this is 640after fork that you want to re-use in the child, and how you keep track of
609entirely your own problem. 641them is entirely your own problem.
610 642
611=item int ev_is_default_loop (loop) 643=item int ev_is_default_loop (loop)
612 644
613Returns true when the given loop is, in fact, the default loop, and false 645Returns true when the given loop is, in fact, the default loop, and false
614otherwise. 646otherwise.
615 647
616=item unsigned int ev_loop_count (loop) 648=item unsigned int ev_iteration (loop)
617 649
618Returns the count of loop iterations for the loop, which is identical to 650Returns the current iteration count for the event loop, which is identical
619the number of times libev did poll for new events. It starts at C<0> and 651to the number of times libev did poll for new events. It starts at C<0>
620happily wraps around with enough iterations. 652and happily wraps around with enough iterations.
621 653
622This value can sometimes be useful as a generation counter of sorts (it 654This value can sometimes be useful as a generation counter of sorts (it
623"ticks" the number of loop iterations), as it roughly corresponds with 655"ticks" the number of loop iterations), as it roughly corresponds with
624C<ev_prepare> and C<ev_check> calls. 656C<ev_prepare> and C<ev_check> calls - and is incremented between the
657prepare and check phases.
658
659=item unsigned int ev_depth (loop)
660
661Returns the number of times C<ev_run> was entered minus the number of
662times C<ev_run> was exited, in other words, the recursion depth.
663
664Outside C<ev_run>, this number is zero. In a callback, this number is
665C<1>, unless C<ev_run> was invoked recursively (or from another thread),
666in which case it is higher.
667
668Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread
669etc.), doesn't count as "exit" - consider this as a hint to avoid such
670ungentleman-like behaviour unless it's really convenient.
625 671
626=item unsigned int ev_backend (loop) 672=item unsigned int ev_backend (loop)
627 673
628Returns one of the C<EVBACKEND_*> flags indicating the event backend in 674Returns one of the C<EVBACKEND_*> flags indicating the event backend in
629use. 675use.
638 684
639=item ev_now_update (loop) 685=item ev_now_update (loop)
640 686
641Establishes the current time by querying the kernel, updating the time 687Establishes the current time by querying the kernel, updating the time
642returned by C<ev_now ()> in the progress. This is a costly operation and 688returned by C<ev_now ()> in the progress. This is a costly operation and
643is usually done automatically within C<ev_loop ()>. 689is usually done automatically within C<ev_run ()>.
644 690
645This function is rarely useful, but when some event callback runs for a 691This function is rarely useful, but when some event callback runs for a
646very long time without entering the event loop, updating libev's idea of 692very long time without entering the event loop, updating libev's idea of
647the current time is a good idea. 693the current time is a good idea.
648 694
649See also "The special problem of time updates" in the C<ev_timer> section. 695See also L<The special problem of time updates> in the C<ev_timer> section.
650 696
651=item ev_suspend (loop) 697=item ev_suspend (loop)
652 698
653=item ev_resume (loop) 699=item ev_resume (loop)
654 700
655These two functions suspend and resume a loop, for use when the loop is 701These two functions suspend and resume an event loop, for use when the
656not used for a while and timeouts should not be processed. 702loop is not used for a while and timeouts should not be processed.
657 703
658A typical use case would be an interactive program such as a game: When 704A typical use case would be an interactive program such as a game: When
659the user presses C<^Z> to suspend the game and resumes it an hour later it 705the user presses C<^Z> to suspend the game and resumes it an hour later it
660would be best to handle timeouts as if no time had actually passed while 706would be best to handle timeouts as if no time had actually passed while
661the program was suspended. This can be achieved by calling C<ev_suspend> 707the program was suspended. This can be achieved by calling C<ev_suspend>
663C<ev_resume> directly afterwards to resume timer processing. 709C<ev_resume> directly afterwards to resume timer processing.
664 710
665Effectively, all C<ev_timer> watchers will be delayed by the time spend 711Effectively, all C<ev_timer> watchers will be delayed by the time spend
666between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers 712between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
667will be rescheduled (that is, they will lose any events that would have 713will be rescheduled (that is, they will lose any events that would have
668occured while suspended). 714occurred while suspended).
669 715
670After calling C<ev_suspend> you B<must not> call I<any> function on the 716After calling C<ev_suspend> you B<must not> call I<any> function on the
671given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> 717given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
672without a previous call to C<ev_suspend>. 718without a previous call to C<ev_suspend>.
673 719
674Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 720Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
675event loop time (see C<ev_now_update>). 721event loop time (see C<ev_now_update>).
676 722
677=item ev_loop (loop, int flags) 723=item ev_run (loop, int flags)
678 724
679Finally, this is it, the event handler. This function usually is called 725Finally, this is it, the event handler. This function usually is called
680after you initialised all your watchers and you want to start handling 726after you have initialised all your watchers and you want to start
681events. 727handling events. It will ask the operating system for any new events, call
728the watcher callbacks, an then repeat the whole process indefinitely: This
729is why event loops are called I<loops>.
682 730
683If the flags argument is specified as C<0>, it will not return until 731If the flags argument is specified as C<0>, it will keep handling events
684either no event watchers are active anymore or C<ev_unloop> was called. 732until either no event watchers are active anymore or C<ev_break> was
733called.
685 734
686Please note that an explicit C<ev_unloop> is usually better than 735Please note that an explicit C<ev_break> is usually better than
687relying on all watchers to be stopped when deciding when a program has 736relying on all watchers to be stopped when deciding when a program has
688finished (especially in interactive programs), but having a program 737finished (especially in interactive programs), but having a program
689that automatically loops as long as it has to and no longer by virtue 738that automatically loops as long as it has to and no longer by virtue
690of relying on its watchers stopping correctly, that is truly a thing of 739of relying on its watchers stopping correctly, that is truly a thing of
691beauty. 740beauty.
692 741
693A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 742A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
694those events and any already outstanding ones, but will not block your 743those events and any already outstanding ones, but will not wait and
695process in case there are no events and will return after one iteration of 744block your process in case there are no events and will return after one
696the loop. 745iteration of the loop. This is sometimes useful to poll and handle new
746events while doing lengthy calculations, to keep the program responsive.
697 747
698A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 748A flags value of C<EVRUN_ONCE> will look for new events (waiting if
699necessary) and will handle those and any already outstanding ones. It 749necessary) and will handle those and any already outstanding ones. It
700will block your process until at least one new event arrives (which could 750will block your process until at least one new event arrives (which could
701be an event internal to libev itself, so there is no guarantee that a 751be an event internal to libev itself, so there is no guarantee that a
702user-registered callback will be called), and will return after one 752user-registered callback will be called), and will return after one
703iteration of the loop. 753iteration of the loop.
704 754
705This is useful if you are waiting for some external event in conjunction 755This is useful if you are waiting for some external event in conjunction
706with something not expressible using other libev watchers (i.e. "roll your 756with something not expressible using other libev watchers (i.e. "roll your
707own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 757own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
708usually a better approach for this kind of thing. 758usually a better approach for this kind of thing.
709 759
710Here are the gory details of what C<ev_loop> does: 760Here are the gory details of what C<ev_run> does:
711 761
762 - Increment loop depth.
763 - Reset the ev_break status.
712 - Before the first iteration, call any pending watchers. 764 - Before the first iteration, call any pending watchers.
765 LOOP:
713 * If EVFLAG_FORKCHECK was used, check for a fork. 766 - If EVFLAG_FORKCHECK was used, check for a fork.
714 - If a fork was detected (by any means), queue and call all fork watchers. 767 - If a fork was detected (by any means), queue and call all fork watchers.
715 - Queue and call all prepare watchers. 768 - Queue and call all prepare watchers.
769 - If ev_break was called, goto FINISH.
716 - If we have been forked, detach and recreate the kernel state 770 - If we have been forked, detach and recreate the kernel state
717 as to not disturb the other process. 771 as to not disturb the other process.
718 - Update the kernel state with all outstanding changes. 772 - Update the kernel state with all outstanding changes.
719 - Update the "event loop time" (ev_now ()). 773 - Update the "event loop time" (ev_now ()).
720 - Calculate for how long to sleep or block, if at all 774 - Calculate for how long to sleep or block, if at all
721 (active idle watchers, EVLOOP_NONBLOCK or not having 775 (active idle watchers, EVRUN_NOWAIT or not having
722 any active watchers at all will result in not sleeping). 776 any active watchers at all will result in not sleeping).
723 - Sleep if the I/O and timer collect interval say so. 777 - Sleep if the I/O and timer collect interval say so.
778 - Increment loop iteration counter.
724 - Block the process, waiting for any events. 779 - Block the process, waiting for any events.
725 - Queue all outstanding I/O (fd) events. 780 - Queue all outstanding I/O (fd) events.
726 - Update the "event loop time" (ev_now ()), and do time jump adjustments. 781 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
727 - Queue all expired timers. 782 - Queue all expired timers.
728 - Queue all expired periodics. 783 - Queue all expired periodics.
729 - Unless any events are pending now, queue all idle watchers. 784 - Queue all idle watchers with priority higher than that of pending events.
730 - Queue all check watchers. 785 - Queue all check watchers.
731 - Call all queued watchers in reverse order (i.e. check watchers first). 786 - Call all queued watchers in reverse order (i.e. check watchers first).
732 Signals and child watchers are implemented as I/O watchers, and will 787 Signals and child watchers are implemented as I/O watchers, and will
733 be handled here by queueing them when their watcher gets executed. 788 be handled here by queueing them when their watcher gets executed.
734 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 789 - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
735 were used, or there are no active watchers, return, otherwise 790 were used, or there are no active watchers, goto FINISH, otherwise
736 continue with step *. 791 continue with step LOOP.
792 FINISH:
793 - Reset the ev_break status iff it was EVBREAK_ONE.
794 - Decrement the loop depth.
795 - Return.
737 796
738Example: Queue some jobs and then loop until no events are outstanding 797Example: Queue some jobs and then loop until no events are outstanding
739anymore. 798anymore.
740 799
741 ... queue jobs here, make sure they register event watchers as long 800 ... queue jobs here, make sure they register event watchers as long
742 ... as they still have work to do (even an idle watcher will do..) 801 ... as they still have work to do (even an idle watcher will do..)
743 ev_loop (my_loop, 0); 802 ev_run (my_loop, 0);
744 ... jobs done or somebody called unloop. yeah! 803 ... jobs done or somebody called unloop. yeah!
745 804
746=item ev_unloop (loop, how) 805=item ev_break (loop, how)
747 806
748Can be used to make a call to C<ev_loop> return early (but only after it 807Can be used to make a call to C<ev_run> return early (but only after it
749has processed all outstanding events). The C<how> argument must be either 808has processed all outstanding events). The C<how> argument must be either
750C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 809C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
751C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 810C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
752 811
753This "unloop state" will be cleared when entering C<ev_loop> again. 812This "unloop state" will be cleared when entering C<ev_run> again.
754 813
755It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 814It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO##
756 815
757=item ev_ref (loop) 816=item ev_ref (loop)
758 817
759=item ev_unref (loop) 818=item ev_unref (loop)
760 819
761Ref/unref can be used to add or remove a reference count on the event 820Ref/unref can be used to add or remove a reference count on the event
762loop: Every watcher keeps one reference, and as long as the reference 821loop: Every watcher keeps one reference, and as long as the reference
763count is nonzero, C<ev_loop> will not return on its own. 822count is nonzero, C<ev_run> will not return on its own.
764 823
765If you have a watcher you never unregister that should not keep C<ev_loop> 824This is useful when you have a watcher that you never intend to
766from returning, call ev_unref() after starting, and ev_ref() before 825unregister, but that nevertheless should not keep C<ev_run> from
826returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
767stopping it. 827before stopping it.
768 828
769As an example, libev itself uses this for its internal signal pipe: It 829As an example, libev itself uses this for its internal signal pipe: It
770is not visible to the libev user and should not keep C<ev_loop> from 830is not visible to the libev user and should not keep C<ev_run> from
771exiting if no event watchers registered by it are active. It is also an 831exiting if no event watchers registered by it are active. It is also an
772excellent way to do this for generic recurring timers or from within 832excellent way to do this for generic recurring timers or from within
773third-party libraries. Just remember to I<unref after start> and I<ref 833third-party libraries. Just remember to I<unref after start> and I<ref
774before stop> (but only if the watcher wasn't active before, or was active 834before stop> (but only if the watcher wasn't active before, or was active
775before, respectively. Note also that libev might stop watchers itself 835before, respectively. Note also that libev might stop watchers itself
776(e.g. non-repeating timers) in which case you have to C<ev_ref> 836(e.g. non-repeating timers) in which case you have to C<ev_ref>
777in the callback). 837in the callback).
778 838
779Example: Create a signal watcher, but keep it from keeping C<ev_loop> 839Example: Create a signal watcher, but keep it from keeping C<ev_run>
780running when nothing else is active. 840running when nothing else is active.
781 841
782 ev_signal exitsig; 842 ev_signal exitsig;
783 ev_signal_init (&exitsig, sig_cb, SIGINT); 843 ev_signal_init (&exitsig, sig_cb, SIGINT);
784 ev_signal_start (loop, &exitsig); 844 ev_signal_start (loop, &exitsig);
811 871
812By setting a higher I<io collect interval> you allow libev to spend more 872By setting a higher I<io collect interval> you allow libev to spend more
813time collecting I/O events, so you can handle more events per iteration, 873time collecting I/O events, so you can handle more events per iteration,
814at the cost of increasing latency. Timeouts (both C<ev_periodic> and 874at the cost of increasing latency. Timeouts (both C<ev_periodic> and
815C<ev_timer>) will be not affected. Setting this to a non-null value will 875C<ev_timer>) will be not affected. Setting this to a non-null value will
816introduce an additional C<ev_sleep ()> call into most loop iterations. 876introduce an additional C<ev_sleep ()> call into most loop iterations. The
877sleep time ensures that libev will not poll for I/O events more often then
878once per this interval, on average.
817 879
818Likewise, by setting a higher I<timeout collect interval> you allow libev 880Likewise, by setting a higher I<timeout collect interval> you allow libev
819to spend more time collecting timeouts, at the expense of increased 881to spend more time collecting timeouts, at the expense of increased
820latency/jitter/inexactness (the watcher callback will be called 882latency/jitter/inexactness (the watcher callback will be called
821later). C<ev_io> watchers will not be affected. Setting this to a non-null 883later). C<ev_io> watchers will not be affected. Setting this to a non-null
823 885
824Many (busy) programs can usually benefit by setting the I/O collect 886Many (busy) programs can usually benefit by setting the I/O collect
825interval to a value near C<0.1> or so, which is often enough for 887interval to a value near C<0.1> or so, which is often enough for
826interactive servers (of course not for games), likewise for timeouts. It 888interactive servers (of course not for games), likewise for timeouts. It
827usually doesn't make much sense to set it to a lower value than C<0.01>, 889usually doesn't make much sense to set it to a lower value than C<0.01>,
828as this approaches the timing granularity of most systems. 890as this approaches the timing granularity of most systems. Note that if
891you do transactions with the outside world and you can't increase the
892parallelity, then this setting will limit your transaction rate (if you
893need to poll once per transaction and the I/O collect interval is 0.01,
894then you can't do more than 100 transactions per second).
829 895
830Setting the I<timeout collect interval> can improve the opportunity for 896Setting the I<timeout collect interval> can improve the opportunity for
831saving power, as the program will "bundle" timer callback invocations that 897saving power, as the program will "bundle" timer callback invocations that
832are "near" in time together, by delaying some, thus reducing the number of 898are "near" in time together, by delaying some, thus reducing the number of
833times the process sleeps and wakes up again. Another useful technique to 899times the process sleeps and wakes up again. Another useful technique to
834reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure 900reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
835they fire on, say, one-second boundaries only. 901they fire on, say, one-second boundaries only.
836 902
903Example: we only need 0.1s timeout granularity, and we wish not to poll
904more often than 100 times per second:
905
906 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
907 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
908
909=item ev_invoke_pending (loop)
910
911This call will simply invoke all pending watchers while resetting their
912pending state. Normally, C<ev_run> does this automatically when required,
913but when overriding the invoke callback this call comes handy. This
914function can be invoked from a watcher - this can be useful for example
915when you want to do some lengthy calculation and want to pass further
916event handling to another thread (you still have to make sure only one
917thread executes within C<ev_invoke_pending> or C<ev_run> of course).
918
919=item int ev_pending_count (loop)
920
921Returns the number of pending watchers - zero indicates that no watchers
922are pending.
923
924=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
925
926This overrides the invoke pending functionality of the loop: Instead of
927invoking all pending watchers when there are any, C<ev_run> will call
928this callback instead. This is useful, for example, when you want to
929invoke the actual watchers inside another context (another thread etc.).
930
931If you want to reset the callback, use C<ev_invoke_pending> as new
932callback.
933
934=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
935
936Sometimes you want to share the same loop between multiple threads. This
937can be done relatively simply by putting mutex_lock/unlock calls around
938each call to a libev function.
939
940However, C<ev_run> can run an indefinite time, so it is not feasible
941to wait for it to return. One way around this is to wake up the event
942loop via C<ev_break> and C<av_async_send>, another way is to set these
943I<release> and I<acquire> callbacks on the loop.
944
945When set, then C<release> will be called just before the thread is
946suspended waiting for new events, and C<acquire> is called just
947afterwards.
948
949Ideally, C<release> will just call your mutex_unlock function, and
950C<acquire> will just call the mutex_lock function again.
951
952While event loop modifications are allowed between invocations of
953C<release> and C<acquire> (that's their only purpose after all), no
954modifications done will affect the event loop, i.e. adding watchers will
955have no effect on the set of file descriptors being watched, or the time
956waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
957to take note of any changes you made.
958
959In theory, threads executing C<ev_run> will be async-cancel safe between
960invocations of C<release> and C<acquire>.
961
962See also the locking example in the C<THREADS> section later in this
963document.
964
965=item ev_set_userdata (loop, void *data)
966
967=item ev_userdata (loop)
968
969Set and retrieve a single C<void *> associated with a loop. When
970C<ev_set_userdata> has never been called, then C<ev_userdata> returns
971C<0.>
972
973These two functions can be used to associate arbitrary data with a loop,
974and are intended solely for the C<invoke_pending_cb>, C<release> and
975C<acquire> callbacks described above, but of course can be (ab-)used for
976any other purpose as well.
977
837=item ev_loop_verify (loop) 978=item ev_verify (loop)
838 979
839This function only does something when C<EV_VERIFY> support has been 980This function only does something when C<EV_VERIFY> support has been
840compiled in, which is the default for non-minimal builds. It tries to go 981compiled in, which is the default for non-minimal builds. It tries to go
841through all internal structures and checks them for validity. If anything 982through all internal structures and checks them for validity. If anything
842is found to be inconsistent, it will print an error message to standard 983is found to be inconsistent, it will print an error message to standard
853 994
854In the following description, uppercase C<TYPE> in names stands for the 995In the following description, uppercase C<TYPE> in names stands for the
855watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 996watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
856watchers and C<ev_io_start> for I/O watchers. 997watchers and C<ev_io_start> for I/O watchers.
857 998
858A watcher is a structure that you create and register to record your 999A watcher is an opaque structure that you allocate and register to record
859interest in some event. For instance, if you want to wait for STDIN to 1000your interest in some event. To make a concrete example, imagine you want
860become readable, you would create an C<ev_io> watcher for that: 1001to wait for STDIN to become readable, you would create an C<ev_io> watcher
1002for that:
861 1003
862 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1004 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
863 { 1005 {
864 ev_io_stop (w); 1006 ev_io_stop (w);
865 ev_unloop (loop, EVUNLOOP_ALL); 1007 ev_break (loop, EVBREAK_ALL);
866 } 1008 }
867 1009
868 struct ev_loop *loop = ev_default_loop (0); 1010 struct ev_loop *loop = ev_default_loop (0);
869 1011
870 ev_io stdin_watcher; 1012 ev_io stdin_watcher;
871 1013
872 ev_init (&stdin_watcher, my_cb); 1014 ev_init (&stdin_watcher, my_cb);
873 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1015 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
874 ev_io_start (loop, &stdin_watcher); 1016 ev_io_start (loop, &stdin_watcher);
875 1017
876 ev_loop (loop, 0); 1018 ev_run (loop, 0);
877 1019
878As you can see, you are responsible for allocating the memory for your 1020As you can see, you are responsible for allocating the memory for your
879watcher structures (and it is I<usually> a bad idea to do this on the 1021watcher structures (and it is I<usually> a bad idea to do this on the
880stack). 1022stack).
881 1023
882Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1024Each watcher has an associated watcher structure (called C<struct ev_TYPE>
883or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1025or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
884 1026
885Each watcher structure must be initialised by a call to C<ev_init 1027Each watcher structure must be initialised by a call to C<ev_init (watcher
886(watcher *, callback)>, which expects a callback to be provided. This 1028*, callback)>, which expects a callback to be provided. This callback is
887callback gets invoked each time the event occurs (or, in the case of I/O 1029invoked each time the event occurs (or, in the case of I/O watchers, each
888watchers, each time the event loop detects that the file descriptor given 1030time the event loop detects that the file descriptor given is readable
889is readable and/or writable). 1031and/or writable).
890 1032
891Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1033Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
892macro to configure it, with arguments specific to the watcher type. There 1034macro to configure it, with arguments specific to the watcher type. There
893is also a macro to combine initialisation and setting in one call: C<< 1035is also a macro to combine initialisation and setting in one call: C<<
894ev_TYPE_init (watcher *, callback, ...) >>. 1036ev_TYPE_init (watcher *, callback, ...) >>.
917=item C<EV_WRITE> 1059=item C<EV_WRITE>
918 1060
919The file descriptor in the C<ev_io> watcher has become readable and/or 1061The file descriptor in the C<ev_io> watcher has become readable and/or
920writable. 1062writable.
921 1063
922=item C<EV_TIMEOUT> 1064=item C<EV_TIMER>
923 1065
924The C<ev_timer> watcher has timed out. 1066The C<ev_timer> watcher has timed out.
925 1067
926=item C<EV_PERIODIC> 1068=item C<EV_PERIODIC>
927 1069
945 1087
946=item C<EV_PREPARE> 1088=item C<EV_PREPARE>
947 1089
948=item C<EV_CHECK> 1090=item C<EV_CHECK>
949 1091
950All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1092All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
951to gather new events, and all C<ev_check> watchers are invoked just after 1093to gather new events, and all C<ev_check> watchers are invoked just after
952C<ev_loop> has gathered them, but before it invokes any callbacks for any 1094C<ev_run> has gathered them, but before it invokes any callbacks for any
953received events. Callbacks of both watcher types can start and stop as 1095received events. Callbacks of both watcher types can start and stop as
954many watchers as they want, and all of them will be taken into account 1096many watchers as they want, and all of them will be taken into account
955(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1097(for example, a C<ev_prepare> watcher might start an idle watcher to keep
956C<ev_loop> from blocking). 1098C<ev_run> from blocking).
957 1099
958=item C<EV_EMBED> 1100=item C<EV_EMBED>
959 1101
960The embedded event loop specified in the C<ev_embed> watcher needs attention. 1102The embedded event loop specified in the C<ev_embed> watcher needs attention.
961 1103
992programs, though, as the fd could already be closed and reused for another 1134programs, though, as the fd could already be closed and reused for another
993thing, so beware. 1135thing, so beware.
994 1136
995=back 1137=back
996 1138
1139=head2 WATCHER STATES
1140
1141There are various watcher states mentioned throughout this manual -
1142active, pending and so on. In this section these states and the rules to
1143transition between them will be described in more detail - and while these
1144rules might look complicated, they usually do "the right thing".
1145
1146=over 4
1147
1148=item initialiased
1149
1150Before a watcher can be registered with the event looop it has to be
1151initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1152C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1153
1154In this state it is simply some block of memory that is suitable for use
1155in an event loop. It can be moved around, freed, reused etc. at will.
1156
1157=item started/running/active
1158
1159Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1160property of the event loop, and is actively waiting for events. While in
1161this state it cannot be accessed (except in a few documented ways), moved,
1162freed or anything else - the only legal thing is to keep a pointer to it,
1163and call libev functions on it that are documented to work on active watchers.
1164
1165=item pending
1166
1167If a watcher is active and libev determines that an event it is interested
1168in has occurred (such as a timer expiring), it will become pending. It will
1169stay in this pending state until either it is stopped or its callback is
1170about to be invoked, so it is not normally pending inside the watcher
1171callback.
1172
1173The watcher might or might not be active while it is pending (for example,
1174an expired non-repeating timer can be pending but no longer active). If it
1175is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1176but it is still property of the event loop at this time, so cannot be
1177moved, freed or reused. And if it is active the rules described in the
1178previous item still apply.
1179
1180It is also possible to feed an event on a watcher that is not active (e.g.
1181via C<ev_feed_event>), in which case it becomes pending without being
1182active.
1183
1184=item stopped
1185
1186A watcher can be stopped implicitly by libev (in which case it might still
1187be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1188latter will clear any pending state the watcher might be in, regardless
1189of whether it was active or not, so stopping a watcher explicitly before
1190freeing it is often a good idea.
1191
1192While stopped (and not pending) the watcher is essentially in the
1193initialised state, that is it can be reused, moved, modified in any way
1194you wish.
1195
1196=back
1197
997=head2 GENERIC WATCHER FUNCTIONS 1198=head2 GENERIC WATCHER FUNCTIONS
998 1199
999=over 4 1200=over 4
1000 1201
1001=item C<ev_init> (ev_TYPE *watcher, callback) 1202=item C<ev_init> (ev_TYPE *watcher, callback)
1017 1218
1018 ev_io w; 1219 ev_io w;
1019 ev_init (&w, my_cb); 1220 ev_init (&w, my_cb);
1020 ev_io_set (&w, STDIN_FILENO, EV_READ); 1221 ev_io_set (&w, STDIN_FILENO, EV_READ);
1021 1222
1022=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1223=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1023 1224
1024This macro initialises the type-specific parts of a watcher. You need to 1225This macro initialises the type-specific parts of a watcher. You need to
1025call C<ev_init> at least once before you call this macro, but you can 1226call C<ev_init> at least once before you call this macro, but you can
1026call C<ev_TYPE_set> any number of times. You must not, however, call this 1227call C<ev_TYPE_set> any number of times. You must not, however, call this
1027macro on a watcher that is active (it can be pending, however, which is a 1228macro on a watcher that is active (it can be pending, however, which is a
1040 1241
1041Example: Initialise and set an C<ev_io> watcher in one step. 1242Example: Initialise and set an C<ev_io> watcher in one step.
1042 1243
1043 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1244 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1044 1245
1045=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1246=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1046 1247
1047Starts (activates) the given watcher. Only active watchers will receive 1248Starts (activates) the given watcher. Only active watchers will receive
1048events. If the watcher is already active nothing will happen. 1249events. If the watcher is already active nothing will happen.
1049 1250
1050Example: Start the C<ev_io> watcher that is being abused as example in this 1251Example: Start the C<ev_io> watcher that is being abused as example in this
1051whole section. 1252whole section.
1052 1253
1053 ev_io_start (EV_DEFAULT_UC, &w); 1254 ev_io_start (EV_DEFAULT_UC, &w);
1054 1255
1055=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1256=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1056 1257
1057Stops the given watcher if active, and clears the pending status (whether 1258Stops the given watcher if active, and clears the pending status (whether
1058the watcher was active or not). 1259the watcher was active or not).
1059 1260
1060It is possible that stopped watchers are pending - for example, 1261It is possible that stopped watchers are pending - for example,
1085=item ev_cb_set (ev_TYPE *watcher, callback) 1286=item ev_cb_set (ev_TYPE *watcher, callback)
1086 1287
1087Change the callback. You can change the callback at virtually any time 1288Change the callback. You can change the callback at virtually any time
1088(modulo threads). 1289(modulo threads).
1089 1290
1090=item ev_set_priority (ev_TYPE *watcher, priority) 1291=item ev_set_priority (ev_TYPE *watcher, int priority)
1091 1292
1092=item int ev_priority (ev_TYPE *watcher) 1293=item int ev_priority (ev_TYPE *watcher)
1093 1294
1094Set and query the priority of the watcher. The priority is a small 1295Set and query the priority of the watcher. The priority is a small
1095integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1296integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1126returns its C<revents> bitset (as if its callback was invoked). If the 1327returns its C<revents> bitset (as if its callback was invoked). If the
1127watcher isn't pending it does nothing and returns C<0>. 1328watcher isn't pending it does nothing and returns C<0>.
1128 1329
1129Sometimes it can be useful to "poll" a watcher instead of waiting for its 1330Sometimes it can be useful to "poll" a watcher instead of waiting for its
1130callback to be invoked, which can be accomplished with this function. 1331callback to be invoked, which can be accomplished with this function.
1332
1333=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1334
1335Feeds the given event set into the event loop, as if the specified event
1336had happened for the specified watcher (which must be a pointer to an
1337initialised but not necessarily started event watcher). Obviously you must
1338not free the watcher as long as it has pending events.
1339
1340Stopping the watcher, letting libev invoke it, or calling
1341C<ev_clear_pending> will clear the pending event, even if the watcher was
1342not started in the first place.
1343
1344See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1345functions that do not need a watcher.
1131 1346
1132=back 1347=back
1133 1348
1134 1349
1135=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1350=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1184 #include <stddef.h> 1399 #include <stddef.h>
1185 1400
1186 static void 1401 static void
1187 t1_cb (EV_P_ ev_timer *w, int revents) 1402 t1_cb (EV_P_ ev_timer *w, int revents)
1188 { 1403 {
1189 struct my_biggy big = (struct my_biggy * 1404 struct my_biggy big = (struct my_biggy *)
1190 (((char *)w) - offsetof (struct my_biggy, t1)); 1405 (((char *)w) - offsetof (struct my_biggy, t1));
1191 } 1406 }
1192 1407
1193 static void 1408 static void
1194 t2_cb (EV_P_ ev_timer *w, int revents) 1409 t2_cb (EV_P_ ev_timer *w, int revents)
1195 { 1410 {
1196 struct my_biggy big = (struct my_biggy * 1411 struct my_biggy big = (struct my_biggy *)
1197 (((char *)w) - offsetof (struct my_biggy, t2)); 1412 (((char *)w) - offsetof (struct my_biggy, t2));
1198 } 1413 }
1199 1414
1200=head2 WATCHER PRIORITY MODELS 1415=head2 WATCHER PRIORITY MODELS
1201 1416
1246 1461
1247For example, to emulate how many other event libraries handle priorities, 1462For example, to emulate how many other event libraries handle priorities,
1248you can associate an C<ev_idle> watcher to each such watcher, and in 1463you can associate an C<ev_idle> watcher to each such watcher, and in
1249the normal watcher callback, you just start the idle watcher. The real 1464the normal watcher callback, you just start the idle watcher. The real
1250processing is done in the idle watcher callback. This causes libev to 1465processing is done in the idle watcher callback. This causes libev to
1251continously poll and process kernel event data for the watcher, but when 1466continuously poll and process kernel event data for the watcher, but when
1252the lock-out case is known to be rare (which in turn is rare :), this is 1467the lock-out case is known to be rare (which in turn is rare :), this is
1253workable. 1468workable.
1254 1469
1255Usually, however, the lock-out model implemented that way will perform 1470Usually, however, the lock-out model implemented that way will perform
1256miserably under the type of load it was designed to handle. In that case, 1471miserably under the type of load it was designed to handle. In that case,
1270 { 1485 {
1271 // stop the I/O watcher, we received the event, but 1486 // stop the I/O watcher, we received the event, but
1272 // are not yet ready to handle it. 1487 // are not yet ready to handle it.
1273 ev_io_stop (EV_A_ w); 1488 ev_io_stop (EV_A_ w);
1274 1489
1275 // start the idle watcher to ahndle the actual event. 1490 // start the idle watcher to handle the actual event.
1276 // it will not be executed as long as other watchers 1491 // it will not be executed as long as other watchers
1277 // with the default priority are receiving events. 1492 // with the default priority are receiving events.
1278 ev_idle_start (EV_A_ &idle); 1493 ev_idle_start (EV_A_ &idle);
1279 } 1494 }
1280 1495
1281 static void 1496 static void
1282 idle-cb (EV_P_ ev_idle *w, int revents) 1497 idle_cb (EV_P_ ev_idle *w, int revents)
1283 { 1498 {
1284 // actual processing 1499 // actual processing
1285 read (STDIN_FILENO, ...); 1500 read (STDIN_FILENO, ...);
1286 1501
1287 // have to start the I/O watcher again, as 1502 // have to start the I/O watcher again, as
1332descriptors to non-blocking mode is also usually a good idea (but not 1547descriptors to non-blocking mode is also usually a good idea (but not
1333required if you know what you are doing). 1548required if you know what you are doing).
1334 1549
1335If you cannot use non-blocking mode, then force the use of a 1550If you cannot use non-blocking mode, then force the use of a
1336known-to-be-good backend (at the time of this writing, this includes only 1551known-to-be-good backend (at the time of this writing, this includes only
1337C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1552C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1553descriptors for which non-blocking operation makes no sense (such as
1554files) - libev doesn't guarantee any specific behaviour in that case.
1338 1555
1339Another thing you have to watch out for is that it is quite easy to 1556Another thing you have to watch out for is that it is quite easy to
1340receive "spurious" readiness notifications, that is your callback might 1557receive "spurious" readiness notifications, that is your callback might
1341be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1558be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1342because there is no data. Not only are some backends known to create a 1559because there is no data. Not only are some backends known to create a
1407 1624
1408So when you encounter spurious, unexplained daemon exits, make sure you 1625So when you encounter spurious, unexplained daemon exits, make sure you
1409ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1626ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1410somewhere, as that would have given you a big clue). 1627somewhere, as that would have given you a big clue).
1411 1628
1629=head3 The special problem of accept()ing when you can't
1630
1631Many implementations of the POSIX C<accept> function (for example,
1632found in post-2004 Linux) have the peculiar behaviour of not removing a
1633connection from the pending queue in all error cases.
1634
1635For example, larger servers often run out of file descriptors (because
1636of resource limits), causing C<accept> to fail with C<ENFILE> but not
1637rejecting the connection, leading to libev signalling readiness on
1638the next iteration again (the connection still exists after all), and
1639typically causing the program to loop at 100% CPU usage.
1640
1641Unfortunately, the set of errors that cause this issue differs between
1642operating systems, there is usually little the app can do to remedy the
1643situation, and no known thread-safe method of removing the connection to
1644cope with overload is known (to me).
1645
1646One of the easiest ways to handle this situation is to just ignore it
1647- when the program encounters an overload, it will just loop until the
1648situation is over. While this is a form of busy waiting, no OS offers an
1649event-based way to handle this situation, so it's the best one can do.
1650
1651A better way to handle the situation is to log any errors other than
1652C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1653messages, and continue as usual, which at least gives the user an idea of
1654what could be wrong ("raise the ulimit!"). For extra points one could stop
1655the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1656usage.
1657
1658If your program is single-threaded, then you could also keep a dummy file
1659descriptor for overload situations (e.g. by opening F</dev/null>), and
1660when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1661close that fd, and create a new dummy fd. This will gracefully refuse
1662clients under typical overload conditions.
1663
1664The last way to handle it is to simply log the error and C<exit>, as
1665is often done with C<malloc> failures, but this results in an easy
1666opportunity for a DoS attack.
1412 1667
1413=head3 Watcher-Specific Functions 1668=head3 Watcher-Specific Functions
1414 1669
1415=over 4 1670=over 4
1416 1671
1448 ... 1703 ...
1449 struct ev_loop *loop = ev_default_init (0); 1704 struct ev_loop *loop = ev_default_init (0);
1450 ev_io stdin_readable; 1705 ev_io stdin_readable;
1451 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1706 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1452 ev_io_start (loop, &stdin_readable); 1707 ev_io_start (loop, &stdin_readable);
1453 ev_loop (loop, 0); 1708 ev_run (loop, 0);
1454 1709
1455 1710
1456=head2 C<ev_timer> - relative and optionally repeating timeouts 1711=head2 C<ev_timer> - relative and optionally repeating timeouts
1457 1712
1458Timer watchers are simple relative timers that generate an event after a 1713Timer watchers are simple relative timers that generate an event after a
1463year, it will still time out after (roughly) one hour. "Roughly" because 1718year, it will still time out after (roughly) one hour. "Roughly" because
1464detecting time jumps is hard, and some inaccuracies are unavoidable (the 1719detecting time jumps is hard, and some inaccuracies are unavoidable (the
1465monotonic clock option helps a lot here). 1720monotonic clock option helps a lot here).
1466 1721
1467The callback is guaranteed to be invoked only I<after> its timeout has 1722The callback is guaranteed to be invoked only I<after> its timeout has
1468passed. If multiple timers become ready during the same loop iteration 1723passed (not I<at>, so on systems with very low-resolution clocks this
1469then the ones with earlier time-out values are invoked before ones with 1724might introduce a small delay). If multiple timers become ready during the
1470later time-out values (but this is no longer true when a callback calls 1725same loop iteration then the ones with earlier time-out values are invoked
1471C<ev_loop> recursively). 1726before ones of the same priority with later time-out values (but this is
1727no longer true when a callback calls C<ev_run> recursively).
1472 1728
1473=head3 Be smart about timeouts 1729=head3 Be smart about timeouts
1474 1730
1475Many real-world problems involve some kind of timeout, usually for error 1731Many real-world problems involve some kind of timeout, usually for error
1476recovery. A typical example is an HTTP request - if the other side hangs, 1732recovery. A typical example is an HTTP request - if the other side hangs,
1520C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> 1776C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1521member and C<ev_timer_again>. 1777member and C<ev_timer_again>.
1522 1778
1523At start: 1779At start:
1524 1780
1525 ev_timer_init (timer, callback); 1781 ev_init (timer, callback);
1526 timer->repeat = 60.; 1782 timer->repeat = 60.;
1527 ev_timer_again (loop, timer); 1783 ev_timer_again (loop, timer);
1528 1784
1529Each time there is some activity: 1785Each time there is some activity:
1530 1786
1562 ev_tstamp timeout = last_activity + 60.; 1818 ev_tstamp timeout = last_activity + 60.;
1563 1819
1564 // if last_activity + 60. is older than now, we did time out 1820 // if last_activity + 60. is older than now, we did time out
1565 if (timeout < now) 1821 if (timeout < now)
1566 { 1822 {
1567 // timeout occured, take action 1823 // timeout occurred, take action
1568 } 1824 }
1569 else 1825 else
1570 { 1826 {
1571 // callback was invoked, but there was some activity, re-arm 1827 // callback was invoked, but there was some activity, re-arm
1572 // the watcher to fire in last_activity + 60, which is 1828 // the watcher to fire in last_activity + 60, which is
1592 1848
1593To start the timer, simply initialise the watcher and set C<last_activity> 1849To start the timer, simply initialise the watcher and set C<last_activity>
1594to the current time (meaning we just have some activity :), then call the 1850to the current time (meaning we just have some activity :), then call the
1595callback, which will "do the right thing" and start the timer: 1851callback, which will "do the right thing" and start the timer:
1596 1852
1597 ev_timer_init (timer, callback); 1853 ev_init (timer, callback);
1598 last_activity = ev_now (loop); 1854 last_activity = ev_now (loop);
1599 callback (loop, timer, EV_TIMEOUT); 1855 callback (loop, timer, EV_TIMER);
1600 1856
1601And when there is some activity, simply store the current time in 1857And when there is some activity, simply store the current time in
1602C<last_activity>, no libev calls at all: 1858C<last_activity>, no libev calls at all:
1603 1859
1604 last_actiivty = ev_now (loop); 1860 last_activity = ev_now (loop);
1605 1861
1606This technique is slightly more complex, but in most cases where the 1862This technique is slightly more complex, but in most cases where the
1607time-out is unlikely to be triggered, much more efficient. 1863time-out is unlikely to be triggered, much more efficient.
1608 1864
1609Changing the timeout is trivial as well (if it isn't hard-coded in the 1865Changing the timeout is trivial as well (if it isn't hard-coded in the
1647 1903
1648=head3 The special problem of time updates 1904=head3 The special problem of time updates
1649 1905
1650Establishing the current time is a costly operation (it usually takes at 1906Establishing the current time is a costly operation (it usually takes at
1651least two system calls): EV therefore updates its idea of the current 1907least two system calls): EV therefore updates its idea of the current
1652time only before and after C<ev_loop> collects new events, which causes a 1908time only before and after C<ev_run> collects new events, which causes a
1653growing difference between C<ev_now ()> and C<ev_time ()> when handling 1909growing difference between C<ev_now ()> and C<ev_time ()> when handling
1654lots of events in one iteration. 1910lots of events in one iteration.
1655 1911
1656The relative timeouts are calculated relative to the C<ev_now ()> 1912The relative timeouts are calculated relative to the C<ev_now ()>
1657time. This is usually the right thing as this timestamp refers to the time 1913time. This is usually the right thing as this timestamp refers to the time
1663 1919
1664If the event loop is suspended for a long time, you can also force an 1920If the event loop is suspended for a long time, you can also force an
1665update of the time returned by C<ev_now ()> by calling C<ev_now_update 1921update of the time returned by C<ev_now ()> by calling C<ev_now_update
1666()>. 1922()>.
1667 1923
1924=head3 The special problems of suspended animation
1925
1926When you leave the server world it is quite customary to hit machines that
1927can suspend/hibernate - what happens to the clocks during such a suspend?
1928
1929Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1930all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1931to run until the system is suspended, but they will not advance while the
1932system is suspended. That means, on resume, it will be as if the program
1933was frozen for a few seconds, but the suspend time will not be counted
1934towards C<ev_timer> when a monotonic clock source is used. The real time
1935clock advanced as expected, but if it is used as sole clocksource, then a
1936long suspend would be detected as a time jump by libev, and timers would
1937be adjusted accordingly.
1938
1939I would not be surprised to see different behaviour in different between
1940operating systems, OS versions or even different hardware.
1941
1942The other form of suspend (job control, or sending a SIGSTOP) will see a
1943time jump in the monotonic clocks and the realtime clock. If the program
1944is suspended for a very long time, and monotonic clock sources are in use,
1945then you can expect C<ev_timer>s to expire as the full suspension time
1946will be counted towards the timers. When no monotonic clock source is in
1947use, then libev will again assume a timejump and adjust accordingly.
1948
1949It might be beneficial for this latter case to call C<ev_suspend>
1950and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1951deterministic behaviour in this case (you can do nothing against
1952C<SIGSTOP>).
1953
1668=head3 Watcher-Specific Functions and Data Members 1954=head3 Watcher-Specific Functions and Data Members
1669 1955
1670=over 4 1956=over 4
1671 1957
1672=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1958=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1698C<repeat> value), or reset the running timer to the C<repeat> value. 1984C<repeat> value), or reset the running timer to the C<repeat> value.
1699 1985
1700This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 1986This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1701usage example. 1987usage example.
1702 1988
1989=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1990
1991Returns the remaining time until a timer fires. If the timer is active,
1992then this time is relative to the current event loop time, otherwise it's
1993the timeout value currently configured.
1994
1995That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1996C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
1997will return C<4>. When the timer expires and is restarted, it will return
1998roughly C<7> (likely slightly less as callback invocation takes some time,
1999too), and so on.
2000
1703=item ev_tstamp repeat [read-write] 2001=item ev_tstamp repeat [read-write]
1704 2002
1705The current C<repeat> value. Will be used each time the watcher times out 2003The current C<repeat> value. Will be used each time the watcher times out
1706or C<ev_timer_again> is called, and determines the next timeout (if any), 2004or C<ev_timer_again> is called, and determines the next timeout (if any),
1707which is also when any modifications are taken into account. 2005which is also when any modifications are taken into account.
1732 } 2030 }
1733 2031
1734 ev_timer mytimer; 2032 ev_timer mytimer;
1735 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2033 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1736 ev_timer_again (&mytimer); /* start timer */ 2034 ev_timer_again (&mytimer); /* start timer */
1737 ev_loop (loop, 0); 2035 ev_run (loop, 0);
1738 2036
1739 // and in some piece of code that gets executed on any "activity": 2037 // and in some piece of code that gets executed on any "activity":
1740 // reset the timeout to start ticking again at 10 seconds 2038 // reset the timeout to start ticking again at 10 seconds
1741 ev_timer_again (&mytimer); 2039 ev_timer_again (&mytimer);
1742 2040
1768 2066
1769As with timers, the callback is guaranteed to be invoked only when the 2067As with timers, the callback is guaranteed to be invoked only when the
1770point in time where it is supposed to trigger has passed. If multiple 2068point in time where it is supposed to trigger has passed. If multiple
1771timers become ready during the same loop iteration then the ones with 2069timers become ready during the same loop iteration then the ones with
1772earlier time-out values are invoked before ones with later time-out values 2070earlier time-out values are invoked before ones with later time-out values
1773(but this is no longer true when a callback calls C<ev_loop> recursively). 2071(but this is no longer true when a callback calls C<ev_run> recursively).
1774 2072
1775=head3 Watcher-Specific Functions and Data Members 2073=head3 Watcher-Specific Functions and Data Members
1776 2074
1777=over 4 2075=over 4
1778 2076
1906Example: Call a callback every hour, or, more precisely, whenever the 2204Example: Call a callback every hour, or, more precisely, whenever the
1907system time is divisible by 3600. The callback invocation times have 2205system time is divisible by 3600. The callback invocation times have
1908potentially a lot of jitter, but good long-term stability. 2206potentially a lot of jitter, but good long-term stability.
1909 2207
1910 static void 2208 static void
1911 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2209 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1912 { 2210 {
1913 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2211 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1914 } 2212 }
1915 2213
1916 ev_periodic hourly_tick; 2214 ev_periodic hourly_tick;
1942Signal watchers will trigger an event when the process receives a specific 2240Signal watchers will trigger an event when the process receives a specific
1943signal one or more times. Even though signals are very asynchronous, libev 2241signal one or more times. Even though signals are very asynchronous, libev
1944will try it's best to deliver signals synchronously, i.e. as part of the 2242will try it's best to deliver signals synchronously, i.e. as part of the
1945normal event processing, like any other event. 2243normal event processing, like any other event.
1946 2244
1947If you want signals asynchronously, just use C<sigaction> as you would 2245If you want signals to be delivered truly asynchronously, just use
1948do without libev and forget about sharing the signal. You can even use 2246C<sigaction> as you would do without libev and forget about sharing
1949C<ev_async> from a signal handler to synchronously wake up an event loop. 2247the signal. You can even use C<ev_async> from a signal handler to
2248synchronously wake up an event loop.
1950 2249
1951You can configure as many watchers as you like per signal. Only when the 2250You can configure as many watchers as you like for the same signal, but
2251only within the same loop, i.e. you can watch for C<SIGINT> in your
2252default loop and for C<SIGIO> in another loop, but you cannot watch for
2253C<SIGINT> in both the default loop and another loop at the same time. At
2254the moment, C<SIGCHLD> is permanently tied to the default loop.
2255
1952first watcher gets started will libev actually register a signal handler 2256When the first watcher gets started will libev actually register something
1953with the kernel (thus it coexists with your own signal handlers as long as 2257with the kernel (thus it coexists with your own signal handlers as long as
1954you don't register any with libev for the same signal). Similarly, when 2258you don't register any with libev for the same signal).
1955the last signal watcher for a signal is stopped, libev will reset the
1956signal handler to SIG_DFL (regardless of what it was set to before).
1957 2259
1958If possible and supported, libev will install its handlers with 2260If possible and supported, libev will install its handlers with
1959C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2261C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1960interrupted. If you have a problem with system calls getting interrupted by 2262not be unduly interrupted. If you have a problem with system calls getting
1961signals you can block all signals in an C<ev_check> watcher and unblock 2263interrupted by signals you can block all signals in an C<ev_check> watcher
1962them in an C<ev_prepare> watcher. 2264and unblock them in an C<ev_prepare> watcher.
2265
2266=head3 The special problem of inheritance over fork/execve/pthread_create
2267
2268Both the signal mask (C<sigprocmask>) and the signal disposition
2269(C<sigaction>) are unspecified after starting a signal watcher (and after
2270stopping it again), that is, libev might or might not block the signal,
2271and might or might not set or restore the installed signal handler.
2272
2273While this does not matter for the signal disposition (libev never
2274sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2275C<execve>), this matters for the signal mask: many programs do not expect
2276certain signals to be blocked.
2277
2278This means that before calling C<exec> (from the child) you should reset
2279the signal mask to whatever "default" you expect (all clear is a good
2280choice usually).
2281
2282The simplest way to ensure that the signal mask is reset in the child is
2283to install a fork handler with C<pthread_atfork> that resets it. That will
2284catch fork calls done by libraries (such as the libc) as well.
2285
2286In current versions of libev, the signal will not be blocked indefinitely
2287unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2288the window of opportunity for problems, it will not go away, as libev
2289I<has> to modify the signal mask, at least temporarily.
2290
2291So I can't stress this enough: I<If you do not reset your signal mask when
2292you expect it to be empty, you have a race condition in your code>. This
2293is not a libev-specific thing, this is true for most event libraries.
1963 2294
1964=head3 Watcher-Specific Functions and Data Members 2295=head3 Watcher-Specific Functions and Data Members
1965 2296
1966=over 4 2297=over 4
1967 2298
1983Example: Try to exit cleanly on SIGINT. 2314Example: Try to exit cleanly on SIGINT.
1984 2315
1985 static void 2316 static void
1986 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2317 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
1987 { 2318 {
1988 ev_unloop (loop, EVUNLOOP_ALL); 2319 ev_break (loop, EVBREAK_ALL);
1989 } 2320 }
1990 2321
1991 ev_signal signal_watcher; 2322 ev_signal signal_watcher;
1992 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2323 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1993 ev_signal_start (loop, &signal_watcher); 2324 ev_signal_start (loop, &signal_watcher);
1999some child status changes (most typically when a child of yours dies or 2330some child status changes (most typically when a child of yours dies or
2000exits). It is permissible to install a child watcher I<after> the child 2331exits). It is permissible to install a child watcher I<after> the child
2001has been forked (which implies it might have already exited), as long 2332has been forked (which implies it might have already exited), as long
2002as the event loop isn't entered (or is continued from a watcher), i.e., 2333as the event loop isn't entered (or is continued from a watcher), i.e.,
2003forking and then immediately registering a watcher for the child is fine, 2334forking and then immediately registering a watcher for the child is fine,
2004but forking and registering a watcher a few event loop iterations later is 2335but forking and registering a watcher a few event loop iterations later or
2005not. 2336in the next callback invocation is not.
2006 2337
2007Only the default event loop is capable of handling signals, and therefore 2338Only the default event loop is capable of handling signals, and therefore
2008you can only register child watchers in the default event loop. 2339you can only register child watchers in the default event loop.
2009 2340
2341Due to some design glitches inside libev, child watchers will always be
2342handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2343libev)
2344
2010=head3 Process Interaction 2345=head3 Process Interaction
2011 2346
2012Libev grabs C<SIGCHLD> as soon as the default event loop is 2347Libev grabs C<SIGCHLD> as soon as the default event loop is
2013initialised. This is necessary to guarantee proper behaviour even if 2348initialised. This is necessary to guarantee proper behaviour even if the
2014the first child watcher is started after the child exits. The occurrence 2349first child watcher is started after the child exits. The occurrence
2015of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2350of C<SIGCHLD> is recorded asynchronously, but child reaping is done
2016synchronously as part of the event loop processing. Libev always reaps all 2351synchronously as part of the event loop processing. Libev always reaps all
2017children, even ones not watched. 2352children, even ones not watched.
2018 2353
2019=head3 Overriding the Built-In Processing 2354=head3 Overriding the Built-In Processing
2029=head3 Stopping the Child Watcher 2364=head3 Stopping the Child Watcher
2030 2365
2031Currently, the child watcher never gets stopped, even when the 2366Currently, the child watcher never gets stopped, even when the
2032child terminates, so normally one needs to stop the watcher in the 2367child terminates, so normally one needs to stop the watcher in the
2033callback. Future versions of libev might stop the watcher automatically 2368callback. Future versions of libev might stop the watcher automatically
2034when a child exit is detected. 2369when a child exit is detected (calling C<ev_child_stop> twice is not a
2370problem).
2035 2371
2036=head3 Watcher-Specific Functions and Data Members 2372=head3 Watcher-Specific Functions and Data Members
2037 2373
2038=over 4 2374=over 4
2039 2375
2365 // no longer anything immediate to do. 2701 // no longer anything immediate to do.
2366 } 2702 }
2367 2703
2368 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2704 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2369 ev_idle_init (idle_watcher, idle_cb); 2705 ev_idle_init (idle_watcher, idle_cb);
2370 ev_idle_start (loop, idle_cb); 2706 ev_idle_start (loop, idle_watcher);
2371 2707
2372 2708
2373=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2709=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2374 2710
2375Prepare and check watchers are usually (but not always) used in pairs: 2711Prepare and check watchers are usually (but not always) used in pairs:
2376prepare watchers get invoked before the process blocks and check watchers 2712prepare watchers get invoked before the process blocks and check watchers
2377afterwards. 2713afterwards.
2378 2714
2379You I<must not> call C<ev_loop> or similar functions that enter 2715You I<must not> call C<ev_run> or similar functions that enter
2380the current event loop from either C<ev_prepare> or C<ev_check> 2716the current event loop from either C<ev_prepare> or C<ev_check>
2381watchers. Other loops than the current one are fine, however. The 2717watchers. Other loops than the current one are fine, however. The
2382rationale behind this is that you do not need to check for recursion in 2718rationale behind this is that you do not need to check for recursion in
2383those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2719those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2384C<ev_check> so if you have one watcher of each kind they will always be 2720C<ev_check> so if you have one watcher of each kind they will always be
2468 struct pollfd fds [nfd]; 2804 struct pollfd fds [nfd];
2469 // actual code will need to loop here and realloc etc. 2805 // actual code will need to loop here and realloc etc.
2470 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2806 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2471 2807
2472 /* the callback is illegal, but won't be called as we stop during check */ 2808 /* the callback is illegal, but won't be called as we stop during check */
2473 ev_timer_init (&tw, 0, timeout * 1e-3); 2809 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2474 ev_timer_start (loop, &tw); 2810 ev_timer_start (loop, &tw);
2475 2811
2476 // create one ev_io per pollfd 2812 // create one ev_io per pollfd
2477 for (int i = 0; i < nfd; ++i) 2813 for (int i = 0; i < nfd; ++i)
2478 { 2814 {
2552 2888
2553 if (timeout >= 0) 2889 if (timeout >= 0)
2554 // create/start timer 2890 // create/start timer
2555 2891
2556 // poll 2892 // poll
2557 ev_loop (EV_A_ 0); 2893 ev_run (EV_A_ 0);
2558 2894
2559 // stop timer again 2895 // stop timer again
2560 if (timeout >= 0) 2896 if (timeout >= 0)
2561 ev_timer_stop (EV_A_ &to); 2897 ev_timer_stop (EV_A_ &to);
2562 2898
2640if you do not want that, you need to temporarily stop the embed watcher). 2976if you do not want that, you need to temporarily stop the embed watcher).
2641 2977
2642=item ev_embed_sweep (loop, ev_embed *) 2978=item ev_embed_sweep (loop, ev_embed *)
2643 2979
2644Make a single, non-blocking sweep over the embedded loop. This works 2980Make a single, non-blocking sweep over the embedded loop. This works
2645similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2981similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2646appropriate way for embedded loops. 2982appropriate way for embedded loops.
2647 2983
2648=item struct ev_loop *other [read-only] 2984=item struct ev_loop *other [read-only]
2649 2985
2650The embedded event loop. 2986The embedded event loop.
2708event loop blocks next and before C<ev_check> watchers are being called, 3044event loop blocks next and before C<ev_check> watchers are being called,
2709and only in the child after the fork. If whoever good citizen calling 3045and only in the child after the fork. If whoever good citizen calling
2710C<ev_default_fork> cheats and calls it in the wrong process, the fork 3046C<ev_default_fork> cheats and calls it in the wrong process, the fork
2711handlers will be invoked, too, of course. 3047handlers will be invoked, too, of course.
2712 3048
3049=head3 The special problem of life after fork - how is it possible?
3050
3051Most uses of C<fork()> consist of forking, then some simple calls to set
3052up/change the process environment, followed by a call to C<exec()>. This
3053sequence should be handled by libev without any problems.
3054
3055This changes when the application actually wants to do event handling
3056in the child, or both parent in child, in effect "continuing" after the
3057fork.
3058
3059The default mode of operation (for libev, with application help to detect
3060forks) is to duplicate all the state in the child, as would be expected
3061when I<either> the parent I<or> the child process continues.
3062
3063When both processes want to continue using libev, then this is usually the
3064wrong result. In that case, usually one process (typically the parent) is
3065supposed to continue with all watchers in place as before, while the other
3066process typically wants to start fresh, i.e. without any active watchers.
3067
3068The cleanest and most efficient way to achieve that with libev is to
3069simply create a new event loop, which of course will be "empty", and
3070use that for new watchers. This has the advantage of not touching more
3071memory than necessary, and thus avoiding the copy-on-write, and the
3072disadvantage of having to use multiple event loops (which do not support
3073signal watchers).
3074
3075When this is not possible, or you want to use the default loop for
3076other reasons, then in the process that wants to start "fresh", call
3077C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying
3078the default loop will "orphan" (not stop) all registered watchers, so you
3079have to be careful not to execute code that modifies those watchers. Note
3080also that in that case, you have to re-register any signal watchers.
3081
2713=head3 Watcher-Specific Functions and Data Members 3082=head3 Watcher-Specific Functions and Data Members
2714 3083
2715=over 4 3084=over 4
2716 3085
2717=item ev_fork_init (ev_signal *, callback) 3086=item ev_fork_init (ev_signal *, callback)
2721believe me. 3090believe me.
2722 3091
2723=back 3092=back
2724 3093
2725 3094
2726=head2 C<ev_async> - how to wake up another event loop 3095=head2 C<ev_async> - how to wake up an event loop
2727 3096
2728In general, you cannot use an C<ev_loop> from multiple threads or other 3097In general, you cannot use an C<ev_run> from multiple threads or other
2729asynchronous sources such as signal handlers (as opposed to multiple event 3098asynchronous sources such as signal handlers (as opposed to multiple event
2730loops - those are of course safe to use in different threads). 3099loops - those are of course safe to use in different threads).
2731 3100
2732Sometimes, however, you need to wake up another event loop you do not 3101Sometimes, however, you need to wake up an event loop you do not control,
2733control, for example because it belongs to another thread. This is what 3102for example because it belongs to another thread. This is what C<ev_async>
2734C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3103watchers do: as long as the C<ev_async> watcher is active, you can signal
2735can signal it by calling C<ev_async_send>, which is thread- and signal 3104it by calling C<ev_async_send>, which is thread- and signal safe.
2736safe.
2737 3105
2738This functionality is very similar to C<ev_signal> watchers, as signals, 3106This functionality is very similar to C<ev_signal> watchers, as signals,
2739too, are asynchronous in nature, and signals, too, will be compressed 3107too, are asynchronous in nature, and signals, too, will be compressed
2740(i.e. the number of callback invocations may be less than the number of 3108(i.e. the number of callback invocations may be less than the number of
2741C<ev_async_sent> calls). 3109C<ev_async_sent> calls).
2746=head3 Queueing 3114=head3 Queueing
2747 3115
2748C<ev_async> does not support queueing of data in any way. The reason 3116C<ev_async> does not support queueing of data in any way. The reason
2749is that the author does not know of a simple (or any) algorithm for a 3117is that the author does not know of a simple (or any) algorithm for a
2750multiple-writer-single-reader queue that works in all cases and doesn't 3118multiple-writer-single-reader queue that works in all cases and doesn't
2751need elaborate support such as pthreads. 3119need elaborate support such as pthreads or unportable memory access
3120semantics.
2752 3121
2753That means that if you want to queue data, you have to provide your own 3122That means that if you want to queue data, you have to provide your own
2754queue. But at least I can tell you how to implement locking around your 3123queue. But at least I can tell you how to implement locking around your
2755queue: 3124queue:
2756 3125
2895 3264
2896If C<timeout> is less than 0, then no timeout watcher will be 3265If C<timeout> is less than 0, then no timeout watcher will be
2897started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3266started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2898repeat = 0) will be started. C<0> is a valid timeout. 3267repeat = 0) will be started. C<0> is a valid timeout.
2899 3268
2900The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3269The callback has the type C<void (*cb)(int revents, void *arg)> and is
2901passed an C<revents> set like normal event callbacks (a combination of 3270passed an C<revents> set like normal event callbacks (a combination of
2902C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3271C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2903value passed to C<ev_once>. Note that it is possible to receive I<both> 3272value passed to C<ev_once>. Note that it is possible to receive I<both>
2904a timeout and an io event at the same time - you probably should give io 3273a timeout and an io event at the same time - you probably should give io
2905events precedence. 3274events precedence.
2906 3275
2907Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3276Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2908 3277
2909 static void stdin_ready (int revents, void *arg) 3278 static void stdin_ready (int revents, void *arg)
2910 { 3279 {
2911 if (revents & EV_READ) 3280 if (revents & EV_READ)
2912 /* stdin might have data for us, joy! */; 3281 /* stdin might have data for us, joy! */;
2913 else if (revents & EV_TIMEOUT) 3282 else if (revents & EV_TIMER)
2914 /* doh, nothing entered */; 3283 /* doh, nothing entered */;
2915 } 3284 }
2916 3285
2917 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3286 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2918 3287
2919=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2920
2921Feeds the given event set into the event loop, as if the specified event
2922had happened for the specified watcher (which must be a pointer to an
2923initialised but not necessarily started event watcher).
2924
2925=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3288=item ev_feed_fd_event (loop, int fd, int revents)
2926 3289
2927Feed an event on the given fd, as if a file descriptor backend detected 3290Feed an event on the given fd, as if a file descriptor backend detected
2928the given events it. 3291the given events it.
2929 3292
2930=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3293=item ev_feed_signal_event (loop, int signum)
2931 3294
2932Feed an event as if the given signal occurred (C<loop> must be the default 3295Feed an event as if the given signal occurred (C<loop> must be the default
2933loop!). 3296loop!).
2934 3297
2935=back 3298=back
3015 3378
3016=over 4 3379=over 4
3017 3380
3018=item ev::TYPE::TYPE () 3381=item ev::TYPE::TYPE ()
3019 3382
3020=item ev::TYPE::TYPE (struct ev_loop *) 3383=item ev::TYPE::TYPE (loop)
3021 3384
3022=item ev::TYPE::~TYPE 3385=item ev::TYPE::~TYPE
3023 3386
3024The constructor (optionally) takes an event loop to associate the watcher 3387The constructor (optionally) takes an event loop to associate the watcher
3025with. If it is omitted, it will use C<EV_DEFAULT>. 3388with. If it is omitted, it will use C<EV_DEFAULT>.
3058 myclass obj; 3421 myclass obj;
3059 ev::io iow; 3422 ev::io iow;
3060 iow.set <myclass, &myclass::io_cb> (&obj); 3423 iow.set <myclass, &myclass::io_cb> (&obj);
3061 3424
3062=item w->set (object *) 3425=item w->set (object *)
3063
3064This is an B<experimental> feature that might go away in a future version.
3065 3426
3066This is a variation of a method callback - leaving out the method to call 3427This is a variation of a method callback - leaving out the method to call
3067will default the method to C<operator ()>, which makes it possible to use 3428will default the method to C<operator ()>, which makes it possible to use
3068functor objects without having to manually specify the C<operator ()> all 3429functor objects without having to manually specify the C<operator ()> all
3069the time. Incidentally, you can then also leave out the template argument 3430the time. Incidentally, you can then also leave out the template argument
3102Example: Use a plain function as callback. 3463Example: Use a plain function as callback.
3103 3464
3104 static void io_cb (ev::io &w, int revents) { } 3465 static void io_cb (ev::io &w, int revents) { }
3105 iow.set <io_cb> (); 3466 iow.set <io_cb> ();
3106 3467
3107=item w->set (struct ev_loop *) 3468=item w->set (loop)
3108 3469
3109Associates a different C<struct ev_loop> with this watcher. You can only 3470Associates a different C<struct ev_loop> with this watcher. You can only
3110do this when the watcher is inactive (and not pending either). 3471do this when the watcher is inactive (and not pending either).
3111 3472
3112=item w->set ([arguments]) 3473=item w->set ([arguments])
3113 3474
3114Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3475Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3115called at least once. Unlike the C counterpart, an active watcher gets 3476method or a suitable start method must be called at least once. Unlike the
3116automatically stopped and restarted when reconfiguring it with this 3477C counterpart, an active watcher gets automatically stopped and restarted
3117method. 3478when reconfiguring it with this method.
3118 3479
3119=item w->start () 3480=item w->start ()
3120 3481
3121Starts the watcher. Note that there is no C<loop> argument, as the 3482Starts the watcher. Note that there is no C<loop> argument, as the
3122constructor already stores the event loop. 3483constructor already stores the event loop.
3123 3484
3485=item w->start ([arguments])
3486
3487Instead of calling C<set> and C<start> methods separately, it is often
3488convenient to wrap them in one call. Uses the same type of arguments as
3489the configure C<set> method of the watcher.
3490
3124=item w->stop () 3491=item w->stop ()
3125 3492
3126Stops the watcher if it is active. Again, no C<loop> argument. 3493Stops the watcher if it is active. Again, no C<loop> argument.
3127 3494
3128=item w->again () (C<ev::timer>, C<ev::periodic> only) 3495=item w->again () (C<ev::timer>, C<ev::periodic> only)
3140 3507
3141=back 3508=back
3142 3509
3143=back 3510=back
3144 3511
3145Example: Define a class with an IO and idle watcher, start one of them in 3512Example: Define a class with two I/O and idle watchers, start the I/O
3146the constructor. 3513watchers in the constructor.
3147 3514
3148 class myclass 3515 class myclass
3149 { 3516 {
3150 ev::io io ; void io_cb (ev::io &w, int revents); 3517 ev::io io ; void io_cb (ev::io &w, int revents);
3518 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3151 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3519 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3152 3520
3153 myclass (int fd) 3521 myclass (int fd)
3154 { 3522 {
3155 io .set <myclass, &myclass::io_cb > (this); 3523 io .set <myclass, &myclass::io_cb > (this);
3524 io2 .set <myclass, &myclass::io2_cb > (this);
3156 idle.set <myclass, &myclass::idle_cb> (this); 3525 idle.set <myclass, &myclass::idle_cb> (this);
3157 3526
3158 io.start (fd, ev::READ); 3527 io.set (fd, ev::WRITE); // configure the watcher
3528 io.start (); // start it whenever convenient
3529
3530 io2.start (fd, ev::READ); // set + start in one call
3159 } 3531 }
3160 }; 3532 };
3161 3533
3162 3534
3163=head1 OTHER LANGUAGE BINDINGS 3535=head1 OTHER LANGUAGE BINDINGS
3209=item Ocaml 3581=item Ocaml
3210 3582
3211Erkki Seppala has written Ocaml bindings for libev, to be found at 3583Erkki Seppala has written Ocaml bindings for libev, to be found at
3212L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3584L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3213 3585
3586=item Lua
3587
3588Brian Maher has written a partial interface to libev for lua (at the
3589time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3590L<http://github.com/brimworks/lua-ev>.
3591
3214=back 3592=back
3215 3593
3216 3594
3217=head1 MACRO MAGIC 3595=head1 MACRO MAGIC
3218 3596
3231loop argument"). The C<EV_A> form is used when this is the sole argument, 3609loop argument"). The C<EV_A> form is used when this is the sole argument,
3232C<EV_A_> is used when other arguments are following. Example: 3610C<EV_A_> is used when other arguments are following. Example:
3233 3611
3234 ev_unref (EV_A); 3612 ev_unref (EV_A);
3235 ev_timer_add (EV_A_ watcher); 3613 ev_timer_add (EV_A_ watcher);
3236 ev_loop (EV_A_ 0); 3614 ev_run (EV_A_ 0);
3237 3615
3238It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3616It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3239which is often provided by the following macro. 3617which is often provided by the following macro.
3240 3618
3241=item C<EV_P>, C<EV_P_> 3619=item C<EV_P>, C<EV_P_>
3281 } 3659 }
3282 3660
3283 ev_check check; 3661 ev_check check;
3284 ev_check_init (&check, check_cb); 3662 ev_check_init (&check, check_cb);
3285 ev_check_start (EV_DEFAULT_ &check); 3663 ev_check_start (EV_DEFAULT_ &check);
3286 ev_loop (EV_DEFAULT_ 0); 3664 ev_run (EV_DEFAULT_ 0);
3287 3665
3288=head1 EMBEDDING 3666=head1 EMBEDDING
3289 3667
3290Libev can (and often is) directly embedded into host 3668Libev can (and often is) directly embedded into host
3291applications. Examples of applications that embed it include the Deliantra 3669applications. Examples of applications that embed it include the Deliantra
3371 libev.m4 3749 libev.m4
3372 3750
3373=head2 PREPROCESSOR SYMBOLS/MACROS 3751=head2 PREPROCESSOR SYMBOLS/MACROS
3374 3752
3375Libev can be configured via a variety of preprocessor symbols you have to 3753Libev can be configured via a variety of preprocessor symbols you have to
3376define before including any of its files. The default in the absence of 3754define before including (or compiling) any of its files. The default in
3377autoconf is documented for every option. 3755the absence of autoconf is documented for every option.
3756
3757Symbols marked with "(h)" do not change the ABI, and can have different
3758values when compiling libev vs. including F<ev.h>, so it is permissible
3759to redefine them before including F<ev.h> without breaking compatibility
3760to a compiled library. All other symbols change the ABI, which means all
3761users of libev and the libev code itself must be compiled with compatible
3762settings.
3378 3763
3379=over 4 3764=over 4
3380 3765
3766=item EV_COMPAT3 (h)
3767
3768Backwards compatibility is a major concern for libev. This is why this
3769release of libev comes with wrappers for the functions and symbols that
3770have been renamed between libev version 3 and 4.
3771
3772You can disable these wrappers (to test compatibility with future
3773versions) by defining C<EV_COMPAT3> to C<0> when compiling your
3774sources. This has the additional advantage that you can drop the C<struct>
3775from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
3776typedef in that case.
3777
3778In some future version, the default for C<EV_COMPAT3> will become C<0>,
3779and in some even more future version the compatibility code will be
3780removed completely.
3781
3381=item EV_STANDALONE 3782=item EV_STANDALONE (h)
3382 3783
3383Must always be C<1> if you do not use autoconf configuration, which 3784Must always be C<1> if you do not use autoconf configuration, which
3384keeps libev from including F<config.h>, and it also defines dummy 3785keeps libev from including F<config.h>, and it also defines dummy
3385implementations for some libevent functions (such as logging, which is not 3786implementations for some libevent functions (such as logging, which is not
3386supported). It will also not define any of the structs usually found in 3787supported). It will also not define any of the structs usually found in
3387F<event.h> that are not directly supported by the libev core alone. 3788F<event.h> that are not directly supported by the libev core alone.
3388 3789
3389In stanbdalone mode, libev will still try to automatically deduce the 3790In standalone mode, libev will still try to automatically deduce the
3390configuration, but has to be more conservative. 3791configuration, but has to be more conservative.
3391 3792
3392=item EV_USE_MONOTONIC 3793=item EV_USE_MONOTONIC
3393 3794
3394If defined to be C<1>, libev will try to detect the availability of the 3795If defined to be C<1>, libev will try to detect the availability of the
3459be used is the winsock select). This means that it will call 3860be used is the winsock select). This means that it will call
3460C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3861C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3461it is assumed that all these functions actually work on fds, even 3862it is assumed that all these functions actually work on fds, even
3462on win32. Should not be defined on non-win32 platforms. 3863on win32. Should not be defined on non-win32 platforms.
3463 3864
3464=item EV_FD_TO_WIN32_HANDLE 3865=item EV_FD_TO_WIN32_HANDLE(fd)
3465 3866
3466If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3867If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3467file descriptors to socket handles. When not defining this symbol (the 3868file descriptors to socket handles. When not defining this symbol (the
3468default), then libev will call C<_get_osfhandle>, which is usually 3869default), then libev will call C<_get_osfhandle>, which is usually
3469correct. In some cases, programs use their own file descriptor management, 3870correct. In some cases, programs use their own file descriptor management,
3470in which case they can provide this function to map fds to socket handles. 3871in which case they can provide this function to map fds to socket handles.
3872
3873=item EV_WIN32_HANDLE_TO_FD(handle)
3874
3875If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3876using the standard C<_open_osfhandle> function. For programs implementing
3877their own fd to handle mapping, overwriting this function makes it easier
3878to do so. This can be done by defining this macro to an appropriate value.
3879
3880=item EV_WIN32_CLOSE_FD(fd)
3881
3882If programs implement their own fd to handle mapping on win32, then this
3883macro can be used to override the C<close> function, useful to unregister
3884file descriptors again. Note that the replacement function has to close
3885the underlying OS handle.
3471 3886
3472=item EV_USE_POLL 3887=item EV_USE_POLL
3473 3888
3474If defined to be C<1>, libev will compile in support for the C<poll>(2) 3889If defined to be C<1>, libev will compile in support for the C<poll>(2)
3475backend. Otherwise it will be enabled on non-win32 platforms. It 3890backend. Otherwise it will be enabled on non-win32 platforms. It
3522as well as for signal and thread safety in C<ev_async> watchers. 3937as well as for signal and thread safety in C<ev_async> watchers.
3523 3938
3524In the absence of this define, libev will use C<sig_atomic_t volatile> 3939In the absence of this define, libev will use C<sig_atomic_t volatile>
3525(from F<signal.h>), which is usually good enough on most platforms. 3940(from F<signal.h>), which is usually good enough on most platforms.
3526 3941
3527=item EV_H 3942=item EV_H (h)
3528 3943
3529The name of the F<ev.h> header file used to include it. The default if 3944The name of the F<ev.h> header file used to include it. The default if
3530undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3945undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3531used to virtually rename the F<ev.h> header file in case of conflicts. 3946used to virtually rename the F<ev.h> header file in case of conflicts.
3532 3947
3533=item EV_CONFIG_H 3948=item EV_CONFIG_H (h)
3534 3949
3535If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3950If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3536F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3951F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3537C<EV_H>, above. 3952C<EV_H>, above.
3538 3953
3539=item EV_EVENT_H 3954=item EV_EVENT_H (h)
3540 3955
3541Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3956Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3542of how the F<event.h> header can be found, the default is C<"event.h">. 3957of how the F<event.h> header can be found, the default is C<"event.h">.
3543 3958
3544=item EV_PROTOTYPES 3959=item EV_PROTOTYPES (h)
3545 3960
3546If defined to be C<0>, then F<ev.h> will not define any function 3961If defined to be C<0>, then F<ev.h> will not define any function
3547prototypes, but still define all the structs and other symbols. This is 3962prototypes, but still define all the structs and other symbols. This is
3548occasionally useful if you want to provide your own wrapper functions 3963occasionally useful if you want to provide your own wrapper functions
3549around libev functions. 3964around libev functions.
3571fine. 3986fine.
3572 3987
3573If your embedding application does not need any priorities, defining these 3988If your embedding application does not need any priorities, defining these
3574both to C<0> will save some memory and CPU. 3989both to C<0> will save some memory and CPU.
3575 3990
3576=item EV_PERIODIC_ENABLE 3991=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
3992EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3993EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3577 3994
3578If undefined or defined to be C<1>, then periodic timers are supported. If 3995If undefined or defined to be C<1> (and the platform supports it), then
3579defined to be C<0>, then they are not. Disabling them saves a few kB of 3996the respective watcher type is supported. If defined to be C<0>, then it
3580code. 3997is not. Disabling watcher types mainly saves code size.
3581 3998
3582=item EV_IDLE_ENABLE 3999=item EV_FEATURES
3583
3584If undefined or defined to be C<1>, then idle watchers are supported. If
3585defined to be C<0>, then they are not. Disabling them saves a few kB of
3586code.
3587
3588=item EV_EMBED_ENABLE
3589
3590If undefined or defined to be C<1>, then embed watchers are supported. If
3591defined to be C<0>, then they are not. Embed watchers rely on most other
3592watcher types, which therefore must not be disabled.
3593
3594=item EV_STAT_ENABLE
3595
3596If undefined or defined to be C<1>, then stat watchers are supported. If
3597defined to be C<0>, then they are not.
3598
3599=item EV_FORK_ENABLE
3600
3601If undefined or defined to be C<1>, then fork watchers are supported. If
3602defined to be C<0>, then they are not.
3603
3604=item EV_ASYNC_ENABLE
3605
3606If undefined or defined to be C<1>, then async watchers are supported. If
3607defined to be C<0>, then they are not.
3608
3609=item EV_MINIMAL
3610 4000
3611If you need to shave off some kilobytes of code at the expense of some 4001If you need to shave off some kilobytes of code at the expense of some
3612speed, define this symbol to C<1>. Currently this is used to override some 4002speed (but with the full API), you can define this symbol to request
3613inlining decisions, saves roughly 30% code size on amd64. It also selects a 4003certain subsets of functionality. The default is to enable all features
3614much smaller 2-heap for timer management over the default 4-heap. 4004that can be enabled on the platform.
4005
4006A typical way to use this symbol is to define it to C<0> (or to a bitset
4007with some broad features you want) and then selectively re-enable
4008additional parts you want, for example if you want everything minimal,
4009but multiple event loop support, async and child watchers and the poll
4010backend, use this:
4011
4012 #define EV_FEATURES 0
4013 #define EV_MULTIPLICITY 1
4014 #define EV_USE_POLL 1
4015 #define EV_CHILD_ENABLE 1
4016 #define EV_ASYNC_ENABLE 1
4017
4018The actual value is a bitset, it can be a combination of the following
4019values:
4020
4021=over 4
4022
4023=item C<1> - faster/larger code
4024
4025Use larger code to speed up some operations.
4026
4027Currently this is used to override some inlining decisions (enlarging the
4028code size by roughly 30% on amd64).
4029
4030When optimising for size, use of compiler flags such as C<-Os> with
4031gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4032assertions.
4033
4034=item C<2> - faster/larger data structures
4035
4036Replaces the small 2-heap for timer management by a faster 4-heap, larger
4037hash table sizes and so on. This will usually further increase code size
4038and can additionally have an effect on the size of data structures at
4039runtime.
4040
4041=item C<4> - full API configuration
4042
4043This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4044enables multiplicity (C<EV_MULTIPLICITY>=1).
4045
4046=item C<8> - full API
4047
4048This enables a lot of the "lesser used" API functions. See C<ev.h> for
4049details on which parts of the API are still available without this
4050feature, and do not complain if this subset changes over time.
4051
4052=item C<16> - enable all optional watcher types
4053
4054Enables all optional watcher types. If you want to selectively enable
4055only some watcher types other than I/O and timers (e.g. prepare,
4056embed, async, child...) you can enable them manually by defining
4057C<EV_watchertype_ENABLE> to C<1> instead.
4058
4059=item C<32> - enable all backends
4060
4061This enables all backends - without this feature, you need to enable at
4062least one backend manually (C<EV_USE_SELECT> is a good choice).
4063
4064=item C<64> - enable OS-specific "helper" APIs
4065
4066Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
4067default.
4068
4069=back
4070
4071Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
4072reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
4073code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
4074watchers, timers and monotonic clock support.
4075
4076With an intelligent-enough linker (gcc+binutils are intelligent enough
4077when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4078your program might be left out as well - a binary starting a timer and an
4079I/O watcher then might come out at only 5Kb.
4080
4081=item EV_AVOID_STDIO
4082
4083If this is set to C<1> at compiletime, then libev will avoid using stdio
4084functions (printf, scanf, perror etc.). This will increase the code size
4085somewhat, but if your program doesn't otherwise depend on stdio and your
4086libc allows it, this avoids linking in the stdio library which is quite
4087big.
4088
4089Note that error messages might become less precise when this option is
4090enabled.
4091
4092=item EV_NSIG
4093
4094The highest supported signal number, +1 (or, the number of
4095signals): Normally, libev tries to deduce the maximum number of signals
4096automatically, but sometimes this fails, in which case it can be
4097specified. Also, using a lower number than detected (C<32> should be
4098good for about any system in existence) can save some memory, as libev
4099statically allocates some 12-24 bytes per signal number.
3615 4100
3616=item EV_PID_HASHSIZE 4101=item EV_PID_HASHSIZE
3617 4102
3618C<ev_child> watchers use a small hash table to distribute workload by 4103C<ev_child> watchers use a small hash table to distribute workload by
3619pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 4104pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3620than enough. If you need to manage thousands of children you might want to 4105usually more than enough. If you need to manage thousands of children you
3621increase this value (I<must> be a power of two). 4106might want to increase this value (I<must> be a power of two).
3622 4107
3623=item EV_INOTIFY_HASHSIZE 4108=item EV_INOTIFY_HASHSIZE
3624 4109
3625C<ev_stat> watchers use a small hash table to distribute workload by 4110C<ev_stat> watchers use a small hash table to distribute workload by
3626inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4111inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3627usually more than enough. If you need to manage thousands of C<ev_stat> 4112disabled), usually more than enough. If you need to manage thousands of
3628watchers you might want to increase this value (I<must> be a power of 4113C<ev_stat> watchers you might want to increase this value (I<must> be a
3629two). 4114power of two).
3630 4115
3631=item EV_USE_4HEAP 4116=item EV_USE_4HEAP
3632 4117
3633Heaps are not very cache-efficient. To improve the cache-efficiency of the 4118Heaps are not very cache-efficient. To improve the cache-efficiency of the
3634timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4119timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3635to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4120to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3636faster performance with many (thousands) of watchers. 4121faster performance with many (thousands) of watchers.
3637 4122
3638The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4123The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3639(disabled). 4124will be C<0>.
3640 4125
3641=item EV_HEAP_CACHE_AT 4126=item EV_HEAP_CACHE_AT
3642 4127
3643Heaps are not very cache-efficient. To improve the cache-efficiency of the 4128Heaps are not very cache-efficient. To improve the cache-efficiency of the
3644timer and periodics heaps, libev can cache the timestamp (I<at>) within 4129timer and periodics heaps, libev can cache the timestamp (I<at>) within
3645the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4130the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3646which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4131which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3647but avoids random read accesses on heap changes. This improves performance 4132but avoids random read accesses on heap changes. This improves performance
3648noticeably with many (hundreds) of watchers. 4133noticeably with many (hundreds) of watchers.
3649 4134
3650The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4135The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3651(disabled). 4136will be C<0>.
3652 4137
3653=item EV_VERIFY 4138=item EV_VERIFY
3654 4139
3655Controls how much internal verification (see C<ev_loop_verify ()>) will 4140Controls how much internal verification (see C<ev_verify ()>) will
3656be done: If set to C<0>, no internal verification code will be compiled 4141be done: If set to C<0>, no internal verification code will be compiled
3657in. If set to C<1>, then verification code will be compiled in, but not 4142in. If set to C<1>, then verification code will be compiled in, but not
3658called. If set to C<2>, then the internal verification code will be 4143called. If set to C<2>, then the internal verification code will be
3659called once per loop, which can slow down libev. If set to C<3>, then the 4144called once per loop, which can slow down libev. If set to C<3>, then the
3660verification code will be called very frequently, which will slow down 4145verification code will be called very frequently, which will slow down
3661libev considerably. 4146libev considerably.
3662 4147
3663The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4148The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3664C<0>. 4149will be C<0>.
3665 4150
3666=item EV_COMMON 4151=item EV_COMMON
3667 4152
3668By default, all watchers have a C<void *data> member. By redefining 4153By default, all watchers have a C<void *data> member. By redefining
3669this macro to a something else you can include more and other types of 4154this macro to something else you can include more and other types of
3670members. You have to define it each time you include one of the files, 4155members. You have to define it each time you include one of the files,
3671though, and it must be identical each time. 4156though, and it must be identical each time.
3672 4157
3673For example, the perl EV module uses something like this: 4158For example, the perl EV module uses something like this:
3674 4159
3727file. 4212file.
3728 4213
3729The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4214The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3730that everybody includes and which overrides some configure choices: 4215that everybody includes and which overrides some configure choices:
3731 4216
3732 #define EV_MINIMAL 1 4217 #define EV_FEATURES 8
3733 #define EV_USE_POLL 0 4218 #define EV_USE_SELECT 1
3734 #define EV_MULTIPLICITY 0
3735 #define EV_PERIODIC_ENABLE 0 4219 #define EV_PREPARE_ENABLE 1
4220 #define EV_IDLE_ENABLE 1
3736 #define EV_STAT_ENABLE 0 4221 #define EV_SIGNAL_ENABLE 1
3737 #define EV_FORK_ENABLE 0 4222 #define EV_CHILD_ENABLE 1
4223 #define EV_USE_STDEXCEPT 0
3738 #define EV_CONFIG_H <config.h> 4224 #define EV_CONFIG_H <config.h>
3739 #define EV_MINPRI 0
3740 #define EV_MAXPRI 0
3741 4225
3742 #include "ev++.h" 4226 #include "ev++.h"
3743 4227
3744And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4228And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3745 4229
3805default loop and triggering an C<ev_async> watcher from the default loop 4289default loop and triggering an C<ev_async> watcher from the default loop
3806watcher callback into the event loop interested in the signal. 4290watcher callback into the event loop interested in the signal.
3807 4291
3808=back 4292=back
3809 4293
4294=head4 THREAD LOCKING EXAMPLE
4295
4296Here is a fictitious example of how to run an event loop in a different
4297thread than where callbacks are being invoked and watchers are
4298created/added/removed.
4299
4300For a real-world example, see the C<EV::Loop::Async> perl module,
4301which uses exactly this technique (which is suited for many high-level
4302languages).
4303
4304The example uses a pthread mutex to protect the loop data, a condition
4305variable to wait for callback invocations, an async watcher to notify the
4306event loop thread and an unspecified mechanism to wake up the main thread.
4307
4308First, you need to associate some data with the event loop:
4309
4310 typedef struct {
4311 mutex_t lock; /* global loop lock */
4312 ev_async async_w;
4313 thread_t tid;
4314 cond_t invoke_cv;
4315 } userdata;
4316
4317 void prepare_loop (EV_P)
4318 {
4319 // for simplicity, we use a static userdata struct.
4320 static userdata u;
4321
4322 ev_async_init (&u->async_w, async_cb);
4323 ev_async_start (EV_A_ &u->async_w);
4324
4325 pthread_mutex_init (&u->lock, 0);
4326 pthread_cond_init (&u->invoke_cv, 0);
4327
4328 // now associate this with the loop
4329 ev_set_userdata (EV_A_ u);
4330 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4331 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4332
4333 // then create the thread running ev_loop
4334 pthread_create (&u->tid, 0, l_run, EV_A);
4335 }
4336
4337The callback for the C<ev_async> watcher does nothing: the watcher is used
4338solely to wake up the event loop so it takes notice of any new watchers
4339that might have been added:
4340
4341 static void
4342 async_cb (EV_P_ ev_async *w, int revents)
4343 {
4344 // just used for the side effects
4345 }
4346
4347The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4348protecting the loop data, respectively.
4349
4350 static void
4351 l_release (EV_P)
4352 {
4353 userdata *u = ev_userdata (EV_A);
4354 pthread_mutex_unlock (&u->lock);
4355 }
4356
4357 static void
4358 l_acquire (EV_P)
4359 {
4360 userdata *u = ev_userdata (EV_A);
4361 pthread_mutex_lock (&u->lock);
4362 }
4363
4364The event loop thread first acquires the mutex, and then jumps straight
4365into C<ev_run>:
4366
4367 void *
4368 l_run (void *thr_arg)
4369 {
4370 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4371
4372 l_acquire (EV_A);
4373 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4374 ev_run (EV_A_ 0);
4375 l_release (EV_A);
4376
4377 return 0;
4378 }
4379
4380Instead of invoking all pending watchers, the C<l_invoke> callback will
4381signal the main thread via some unspecified mechanism (signals? pipe
4382writes? C<Async::Interrupt>?) and then waits until all pending watchers
4383have been called (in a while loop because a) spurious wakeups are possible
4384and b) skipping inter-thread-communication when there are no pending
4385watchers is very beneficial):
4386
4387 static void
4388 l_invoke (EV_P)
4389 {
4390 userdata *u = ev_userdata (EV_A);
4391
4392 while (ev_pending_count (EV_A))
4393 {
4394 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4395 pthread_cond_wait (&u->invoke_cv, &u->lock);
4396 }
4397 }
4398
4399Now, whenever the main thread gets told to invoke pending watchers, it
4400will grab the lock, call C<ev_invoke_pending> and then signal the loop
4401thread to continue:
4402
4403 static void
4404 real_invoke_pending (EV_P)
4405 {
4406 userdata *u = ev_userdata (EV_A);
4407
4408 pthread_mutex_lock (&u->lock);
4409 ev_invoke_pending (EV_A);
4410 pthread_cond_signal (&u->invoke_cv);
4411 pthread_mutex_unlock (&u->lock);
4412 }
4413
4414Whenever you want to start/stop a watcher or do other modifications to an
4415event loop, you will now have to lock:
4416
4417 ev_timer timeout_watcher;
4418 userdata *u = ev_userdata (EV_A);
4419
4420 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4421
4422 pthread_mutex_lock (&u->lock);
4423 ev_timer_start (EV_A_ &timeout_watcher);
4424 ev_async_send (EV_A_ &u->async_w);
4425 pthread_mutex_unlock (&u->lock);
4426
4427Note that sending the C<ev_async> watcher is required because otherwise
4428an event loop currently blocking in the kernel will have no knowledge
4429about the newly added timer. By waking up the loop it will pick up any new
4430watchers in the next event loop iteration.
4431
3810=head3 COROUTINES 4432=head3 COROUTINES
3811 4433
3812Libev is very accommodating to coroutines ("cooperative threads"): 4434Libev is very accommodating to coroutines ("cooperative threads"):
3813libev fully supports nesting calls to its functions from different 4435libev fully supports nesting calls to its functions from different
3814coroutines (e.g. you can call C<ev_loop> on the same loop from two 4436coroutines (e.g. you can call C<ev_run> on the same loop from two
3815different coroutines, and switch freely between both coroutines running the 4437different coroutines, and switch freely between both coroutines running
3816loop, as long as you don't confuse yourself). The only exception is that 4438the loop, as long as you don't confuse yourself). The only exception is
3817you must not do this from C<ev_periodic> reschedule callbacks. 4439that you must not do this from C<ev_periodic> reschedule callbacks.
3818 4440
3819Care has been taken to ensure that libev does not keep local state inside 4441Care has been taken to ensure that libev does not keep local state inside
3820C<ev_loop>, and other calls do not usually allow for coroutine switches as 4442C<ev_run>, and other calls do not usually allow for coroutine switches as
3821they do not call any callbacks. 4443they do not call any callbacks.
3822 4444
3823=head2 COMPILER WARNINGS 4445=head2 COMPILER WARNINGS
3824 4446
3825Depending on your compiler and compiler settings, you might get no or a 4447Depending on your compiler and compiler settings, you might get no or a
3836maintainable. 4458maintainable.
3837 4459
3838And of course, some compiler warnings are just plain stupid, or simply 4460And of course, some compiler warnings are just plain stupid, or simply
3839wrong (because they don't actually warn about the condition their message 4461wrong (because they don't actually warn about the condition their message
3840seems to warn about). For example, certain older gcc versions had some 4462seems to warn about). For example, certain older gcc versions had some
3841warnings that resulted an extreme number of false positives. These have 4463warnings that resulted in an extreme number of false positives. These have
3842been fixed, but some people still insist on making code warn-free with 4464been fixed, but some people still insist on making code warn-free with
3843such buggy versions. 4465such buggy versions.
3844 4466
3845While libev is written to generate as few warnings as possible, 4467While libev is written to generate as few warnings as possible,
3846"warn-free" code is not a goal, and it is recommended not to build libev 4468"warn-free" code is not a goal, and it is recommended not to build libev
3882I suggest using suppression lists. 4504I suggest using suppression lists.
3883 4505
3884 4506
3885=head1 PORTABILITY NOTES 4507=head1 PORTABILITY NOTES
3886 4508
4509=head2 GNU/LINUX 32 BIT LIMITATIONS
4510
4511GNU/Linux is the only common platform that supports 64 bit file/large file
4512interfaces but I<disables> them by default.
4513
4514That means that libev compiled in the default environment doesn't support
4515files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4516
4517Unfortunately, many programs try to work around this GNU/Linux issue
4518by enabling the large file API, which makes them incompatible with the
4519standard libev compiled for their system.
4520
4521Likewise, libev cannot enable the large file API itself as this would
4522suddenly make it incompatible to the default compile time environment,
4523i.e. all programs not using special compile switches.
4524
4525=head2 OS/X AND DARWIN BUGS
4526
4527The whole thing is a bug if you ask me - basically any system interface
4528you touch is broken, whether it is locales, poll, kqueue or even the
4529OpenGL drivers.
4530
4531=head3 C<kqueue> is buggy
4532
4533The kqueue syscall is broken in all known versions - most versions support
4534only sockets, many support pipes.
4535
4536Libev tries to work around this by not using C<kqueue> by default on this
4537rotten platform, but of course you can still ask for it when creating a
4538loop - embedding a socket-only kqueue loop into a select-based one is
4539probably going to work well.
4540
4541=head3 C<poll> is buggy
4542
4543Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4544implementation by something calling C<kqueue> internally around the 10.5.6
4545release, so now C<kqueue> I<and> C<poll> are broken.
4546
4547Libev tries to work around this by not using C<poll> by default on
4548this rotten platform, but of course you can still ask for it when creating
4549a loop.
4550
4551=head3 C<select> is buggy
4552
4553All that's left is C<select>, and of course Apple found a way to fuck this
4554one up as well: On OS/X, C<select> actively limits the number of file
4555descriptors you can pass in to 1024 - your program suddenly crashes when
4556you use more.
4557
4558There is an undocumented "workaround" for this - defining
4559C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4560work on OS/X.
4561
4562=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4563
4564=head3 C<errno> reentrancy
4565
4566The default compile environment on Solaris is unfortunately so
4567thread-unsafe that you can't even use components/libraries compiled
4568without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4569defined by default. A valid, if stupid, implementation choice.
4570
4571If you want to use libev in threaded environments you have to make sure
4572it's compiled with C<_REENTRANT> defined.
4573
4574=head3 Event port backend
4575
4576The scalable event interface for Solaris is called "event
4577ports". Unfortunately, this mechanism is very buggy in all major
4578releases. If you run into high CPU usage, your program freezes or you get
4579a large number of spurious wakeups, make sure you have all the relevant
4580and latest kernel patches applied. No, I don't know which ones, but there
4581are multiple ones to apply, and afterwards, event ports actually work
4582great.
4583
4584If you can't get it to work, you can try running the program by setting
4585the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4586C<select> backends.
4587
4588=head2 AIX POLL BUG
4589
4590AIX unfortunately has a broken C<poll.h> header. Libev works around
4591this by trying to avoid the poll backend altogether (i.e. it's not even
4592compiled in), which normally isn't a big problem as C<select> works fine
4593with large bitsets on AIX, and AIX is dead anyway.
4594
3887=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4595=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4596
4597=head3 General issues
3888 4598
3889Win32 doesn't support any of the standards (e.g. POSIX) that libev 4599Win32 doesn't support any of the standards (e.g. POSIX) that libev
3890requires, and its I/O model is fundamentally incompatible with the POSIX 4600requires, and its I/O model is fundamentally incompatible with the POSIX
3891model. Libev still offers limited functionality on this platform in 4601model. Libev still offers limited functionality on this platform in
3892the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4602the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3893descriptors. This only applies when using Win32 natively, not when using 4603descriptors. This only applies when using Win32 natively, not when using
3894e.g. cygwin. 4604e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4605as every compielr comes with a slightly differently broken/incompatible
4606environment.
3895 4607
3896Lifting these limitations would basically require the full 4608Lifting these limitations would basically require the full
3897re-implementation of the I/O system. If you are into these kinds of 4609re-implementation of the I/O system. If you are into this kind of thing,
3898things, then note that glib does exactly that for you in a very portable 4610then note that glib does exactly that for you in a very portable way (note
3899way (note also that glib is the slowest event library known to man). 4611also that glib is the slowest event library known to man).
3900 4612
3901There is no supported compilation method available on windows except 4613There is no supported compilation method available on windows except
3902embedding it into other applications. 4614embedding it into other applications.
4615
4616Sensible signal handling is officially unsupported by Microsoft - libev
4617tries its best, but under most conditions, signals will simply not work.
3903 4618
3904Not a libev limitation but worth mentioning: windows apparently doesn't 4619Not a libev limitation but worth mentioning: windows apparently doesn't
3905accept large writes: instead of resulting in a partial write, windows will 4620accept large writes: instead of resulting in a partial write, windows will
3906either accept everything or return C<ENOBUFS> if the buffer is too large, 4621either accept everything or return C<ENOBUFS> if the buffer is too large,
3907so make sure you only write small amounts into your sockets (less than a 4622so make sure you only write small amounts into your sockets (less than a
3912the abysmal performance of winsockets, using a large number of sockets 4627the abysmal performance of winsockets, using a large number of sockets
3913is not recommended (and not reasonable). If your program needs to use 4628is not recommended (and not reasonable). If your program needs to use
3914more than a hundred or so sockets, then likely it needs to use a totally 4629more than a hundred or so sockets, then likely it needs to use a totally
3915different implementation for windows, as libev offers the POSIX readiness 4630different implementation for windows, as libev offers the POSIX readiness
3916notification model, which cannot be implemented efficiently on windows 4631notification model, which cannot be implemented efficiently on windows
3917(Microsoft monopoly games). 4632(due to Microsoft monopoly games).
3918 4633
3919A typical way to use libev under windows is to embed it (see the embedding 4634A typical way to use libev under windows is to embed it (see the embedding
3920section for details) and use the following F<evwrap.h> header file instead 4635section for details) and use the following F<evwrap.h> header file instead
3921of F<ev.h>: 4636of F<ev.h>:
3922 4637
3929you do I<not> compile the F<ev.c> or any other embedded source files!): 4644you do I<not> compile the F<ev.c> or any other embedded source files!):
3930 4645
3931 #include "evwrap.h" 4646 #include "evwrap.h"
3932 #include "ev.c" 4647 #include "ev.c"
3933 4648
3934=over 4
3935
3936=item The winsocket select function 4649=head3 The winsocket C<select> function
3937 4650
3938The winsocket C<select> function doesn't follow POSIX in that it 4651The winsocket C<select> function doesn't follow POSIX in that it
3939requires socket I<handles> and not socket I<file descriptors> (it is 4652requires socket I<handles> and not socket I<file descriptors> (it is
3940also extremely buggy). This makes select very inefficient, and also 4653also extremely buggy). This makes select very inefficient, and also
3941requires a mapping from file descriptors to socket handles (the Microsoft 4654requires a mapping from file descriptors to socket handles (the Microsoft
3950 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4663 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3951 4664
3952Note that winsockets handling of fd sets is O(n), so you can easily get a 4665Note that winsockets handling of fd sets is O(n), so you can easily get a
3953complexity in the O(n²) range when using win32. 4666complexity in the O(n²) range when using win32.
3954 4667
3955=item Limited number of file descriptors 4668=head3 Limited number of file descriptors
3956 4669
3957Windows has numerous arbitrary (and low) limits on things. 4670Windows has numerous arbitrary (and low) limits on things.
3958 4671
3959Early versions of winsocket's select only supported waiting for a maximum 4672Early versions of winsocket's select only supported waiting for a maximum
3960of C<64> handles (probably owning to the fact that all windows kernels 4673of C<64> handles (probably owning to the fact that all windows kernels
3961can only wait for C<64> things at the same time internally; Microsoft 4674can only wait for C<64> things at the same time internally; Microsoft
3962recommends spawning a chain of threads and wait for 63 handles and the 4675recommends spawning a chain of threads and wait for 63 handles and the
3963previous thread in each. Great). 4676previous thread in each. Sounds great!).
3964 4677
3965Newer versions support more handles, but you need to define C<FD_SETSIZE> 4678Newer versions support more handles, but you need to define C<FD_SETSIZE>
3966to some high number (e.g. C<2048>) before compiling the winsocket select 4679to some high number (e.g. C<2048>) before compiling the winsocket select
3967call (which might be in libev or elsewhere, for example, perl does its own 4680call (which might be in libev or elsewhere, for example, perl and many
3968select emulation on windows). 4681other interpreters do their own select emulation on windows).
3969 4682
3970Another limit is the number of file descriptors in the Microsoft runtime 4683Another limit is the number of file descriptors in the Microsoft runtime
3971libraries, which by default is C<64> (there must be a hidden I<64> fetish 4684libraries, which by default is C<64> (there must be a hidden I<64>
3972or something like this inside Microsoft). You can increase this by calling 4685fetish or something like this inside Microsoft). You can increase this
3973C<_setmaxstdio>, which can increase this limit to C<2048> (another 4686by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3974arbitrary limit), but is broken in many versions of the Microsoft runtime 4687(another arbitrary limit), but is broken in many versions of the Microsoft
3975libraries.
3976
3977This might get you to about C<512> or C<2048> sockets (depending on 4688runtime libraries. This might get you to about C<512> or C<2048> sockets
3978windows version and/or the phase of the moon). To get more, you need to 4689(depending on windows version and/or the phase of the moon). To get more,
3979wrap all I/O functions and provide your own fd management, but the cost of 4690you need to wrap all I/O functions and provide your own fd management, but
3980calling select (O(n²)) will likely make this unworkable. 4691the cost of calling select (O(n²)) will likely make this unworkable.
3981
3982=back
3983 4692
3984=head2 PORTABILITY REQUIREMENTS 4693=head2 PORTABILITY REQUIREMENTS
3985 4694
3986In addition to a working ISO-C implementation and of course the 4695In addition to a working ISO-C implementation and of course the
3987backend-specific APIs, libev relies on a few additional extensions: 4696backend-specific APIs, libev relies on a few additional extensions:
4026watchers. 4735watchers.
4027 4736
4028=item C<double> must hold a time value in seconds with enough accuracy 4737=item C<double> must hold a time value in seconds with enough accuracy
4029 4738
4030The type C<double> is used to represent timestamps. It is required to 4739The type C<double> is used to represent timestamps. It is required to
4031have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4740have at least 51 bits of mantissa (and 9 bits of exponent), which is
4032enough for at least into the year 4000. This requirement is fulfilled by 4741good enough for at least into the year 4000 with millisecond accuracy
4742(the design goal for libev). This requirement is overfulfilled by
4033implementations implementing IEEE 754 (basically all existing ones). 4743implementations using IEEE 754, which is basically all existing ones. With
4744IEEE 754 doubles, you get microsecond accuracy until at least 2200.
4034 4745
4035=back 4746=back
4036 4747
4037If you know of other additional requirements drop me a note. 4748If you know of other additional requirements drop me a note.
4038 4749
4106involves iterating over all running async watchers or all signal numbers. 4817involves iterating over all running async watchers or all signal numbers.
4107 4818
4108=back 4819=back
4109 4820
4110 4821
4822=head1 PORTING FROM LIBEV 3.X TO 4.X
4823
4824The major version 4 introduced some minor incompatible changes to the API.
4825
4826At the moment, the C<ev.h> header file tries to implement superficial
4827compatibility, so most programs should still compile. Those might be
4828removed in later versions of libev, so better update early than late.
4829
4830=over 4
4831
4832=item function/symbol renames
4833
4834A number of functions and symbols have been renamed:
4835
4836 ev_loop => ev_run
4837 EVLOOP_NONBLOCK => EVRUN_NOWAIT
4838 EVLOOP_ONESHOT => EVRUN_ONCE
4839
4840 ev_unloop => ev_break
4841 EVUNLOOP_CANCEL => EVBREAK_CANCEL
4842 EVUNLOOP_ONE => EVBREAK_ONE
4843 EVUNLOOP_ALL => EVBREAK_ALL
4844
4845 EV_TIMEOUT => EV_TIMER
4846
4847 ev_loop_count => ev_iteration
4848 ev_loop_depth => ev_depth
4849 ev_loop_verify => ev_verify
4850
4851Most functions working on C<struct ev_loop> objects don't have an
4852C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
4853associated constants have been renamed to not collide with the C<struct
4854ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4855as all other watcher types. Note that C<ev_loop_fork> is still called
4856C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4857typedef.
4858
4859=item C<EV_COMPAT3> backwards compatibility mechanism
4860
4861The backward compatibility mechanism can be controlled by
4862C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4863section.
4864
4865=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4866
4867The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4868mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4869and work, but the library code will of course be larger.
4870
4871=back
4872
4873
4111=head1 GLOSSARY 4874=head1 GLOSSARY
4112 4875
4113=over 4 4876=over 4
4114 4877
4115=item active 4878=item active
4116 4879
4117A watcher is active as long as it has been started (has been attached to 4880A watcher is active as long as it has been started and not yet stopped.
4118an event loop) but not yet stopped (disassociated from the event loop). 4881See L<WATCHER STATES> for details.
4119 4882
4120=item application 4883=item application
4121 4884
4122In this document, an application is whatever is using libev. 4885In this document, an application is whatever is using libev.
4886
4887=item backend
4888
4889The part of the code dealing with the operating system interfaces.
4123 4890
4124=item callback 4891=item callback
4125 4892
4126The address of a function that is called when some event has been 4893The address of a function that is called when some event has been
4127detected. Callbacks are being passed the event loop, the watcher that 4894detected. Callbacks are being passed the event loop, the watcher that
4128received the event, and the actual event bitset. 4895received the event, and the actual event bitset.
4129 4896
4130=item callback invocation 4897=item callback/watcher invocation
4131 4898
4132The act of calling the callback associated with a watcher. 4899The act of calling the callback associated with a watcher.
4133 4900
4134=item event 4901=item event
4135 4902
4136A change of state of some external event, such as data now being available 4903A change of state of some external event, such as data now being available
4137for reading on a file descriptor, time having passed or simply not having 4904for reading on a file descriptor, time having passed or simply not having
4138any other events happening anymore. 4905any other events happening anymore.
4139 4906
4140In libev, events are represented as single bits (such as C<EV_READ> or 4907In libev, events are represented as single bits (such as C<EV_READ> or
4141C<EV_TIMEOUT>). 4908C<EV_TIMER>).
4142 4909
4143=item event library 4910=item event library
4144 4911
4145A software package implementing an event model and loop. 4912A software package implementing an event model and loop.
4146 4913
4154The model used to describe how an event loop handles and processes 4921The model used to describe how an event loop handles and processes
4155watchers and events. 4922watchers and events.
4156 4923
4157=item pending 4924=item pending
4158 4925
4159A watcher is pending as soon as the corresponding event has been detected, 4926A watcher is pending as soon as the corresponding event has been
4160and stops being pending as soon as the watcher will be invoked or its 4927detected. See L<WATCHER STATES> for details.
4161pending status is explicitly cleared by the application.
4162
4163A watcher can be pending, but not active. Stopping a watcher also clears
4164its pending status.
4165 4928
4166=item real time 4929=item real time
4167 4930
4168The physical time that is observed. It is apparently strictly monotonic :) 4931The physical time that is observed. It is apparently strictly monotonic :)
4169 4932
4176=item watcher 4939=item watcher
4177 4940
4178A data structure that describes interest in certain events. Watchers need 4941A data structure that describes interest in certain events. Watchers need
4179to be started (attached to an event loop) before they can receive events. 4942to be started (attached to an event loop) before they can receive events.
4180 4943
4181=item watcher invocation
4182
4183The act of calling the callback associated with a watcher.
4184
4185=back 4944=back
4186 4945
4187=head1 AUTHOR 4946=head1 AUTHOR
4188 4947
4189Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 4948Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines