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

Comparing libev/ev.pod (file contents):
Revision 1.228 by root, Sat Mar 28 08:22:30 2009 UTC vs.
Revision 1.303 by root, Thu Oct 14 04:29:34 2010 UTC

62 62
63 // unloop was called, so exit 63 // unloop was called, so exit
64 return 0; 64 return 0;
65 } 65 }
66 66
67=head1 DESCRIPTION 67=head1 ABOUT THIS DOCUMENT
68
69This document documents the libev software package.
68 70
69The newest version of this document is also available as an html-formatted 71The newest version of this document is also available as an html-formatted
70web page you might find easier to navigate when reading it for the first 72web page you might find easier to navigate when reading it for the first
71time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>. 73time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
74
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
77on event-based programming, nor will it introduce event-based programming
78with libev.
79
80Familiarity with event based programming techniques in general is assumed
81throughout this document.
82
83=head1 ABOUT LIBEV
72 84
73Libev 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
74file descriptor being readable or a timeout occurring), and it will manage 86file descriptor being readable or a timeout occurring), and it will manage
75these event sources and provide your program with events. 87these event sources and provide your program with events.
76 88
86=head2 FEATURES 98=head2 FEATURES
87 99
88Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
89BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
90for file descriptor events (C<ev_io>), the Linux C<inotify> interface 102for file descriptor events (C<ev_io>), the Linux C<inotify> interface
91(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 103(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
92with customised rescheduling (C<ev_periodic>), synchronous signals 104inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
93(C<ev_signal>), process status change events (C<ev_child>), and event 105timers (C<ev_timer>), absolute timers with customised rescheduling
94watchers dealing with the event loop mechanism itself (C<ev_idle>, 106(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
95C<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
96file watchers (C<ev_stat>) and even limited support for fork events 108loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
97(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>).
98 111
99It also is quite fast (see this 112It also is quite fast (see this
100L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 113L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
101for example). 114for example).
102 115
105Libev is very configurable. In this manual the default (and most common) 118Libev is very configurable. In this manual the default (and most common)
106configuration will be described, which supports multiple event loops. For 119configuration will be described, which supports multiple event loops. For
107more info about various configuration options please have a look at 120more info about various configuration options please have a look at
108B<EMBED> section in this manual. If libev was configured without support 121B<EMBED> section in this manual. If libev was configured without support
109for multiple event loops, then all functions taking an initial argument of 122for multiple event loops, then all functions taking an initial argument of
110name 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
111this argument. 124this argument.
112 125
113=head2 TIME REPRESENTATION 126=head2 TIME REPRESENTATION
114 127
115Libev represents time as a single floating point number, representing the 128Libev represents time as a single floating point number, representing
116(fractional) number of seconds since the (POSIX) epoch (somewhere near 129the (fractional) number of seconds since the (POSIX) epoch (in practise
117the beginning of 1970, details are complicated, don't ask). This type is 130somewhere near the beginning of 1970, details are complicated, don't
118called 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
119to 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
120it, 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
121component C<stamp> might indicate, it is also used for time differences 135Unlike the name component C<stamp> might indicate, it is also used for
122throughout libev. 136time differences (e.g. delays) throughout libev.
123 137
124=head1 ERROR HANDLING 138=head1 ERROR HANDLING
125 139
126Libev knows three classes of errors: operating system errors, usage errors 140Libev knows three classes of errors: operating system errors, usage errors
127and internal errors (bugs). 141and internal errors (bugs).
178as this indicates an incompatible change. Minor versions are usually 192as this indicates an incompatible change. Minor versions are usually
179compatible to older versions, so a larger minor version alone is usually 193compatible to older versions, so a larger minor version alone is usually
180not a problem. 194not a problem.
181 195
182Example: Make sure we haven't accidentally been linked against the wrong 196Example: Make sure we haven't accidentally been linked against the wrong
183version. 197version (note, however, that this will not detect ABI mismatches :).
184 198
185 assert (("libev version mismatch", 199 assert (("libev version mismatch",
186 ev_version_major () == EV_VERSION_MAJOR 200 ev_version_major () == EV_VERSION_MAJOR
187 && ev_version_minor () >= EV_VERSION_MINOR)); 201 && ev_version_minor () >= EV_VERSION_MINOR));
188 202
332useful 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
333around bugs. 347around bugs.
334 348
335=item C<EVFLAG_FORKCHECK> 349=item C<EVFLAG_FORKCHECK>
336 350
337Instead 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
338a 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.
339enabling this flag.
340 353
341This works by calling C<getpid ()> on every iteration of the loop, 354This works by calling C<getpid ()> on every iteration of the loop,
342and 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
343iterations and little real work, but is usually not noticeable (on my 356iterations and little real work, but is usually not noticeable (on my
344GNU/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
350flag. 363flag.
351 364
352This 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>
353environment variable. 366environment variable.
354 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
355=item C<EVBACKEND_SELECT> (value 1, portable select backend) 388=item C<EVBACKEND_SELECT> (value 1, portable select backend)
356 389
357This is your standard select(2) backend. Not I<completely> standard, as 390This is your standard select(2) backend. Not I<completely> standard, as
358libev 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,
359but 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
382 415
383This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 416This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
384C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 417C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
385 418
386=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).
387 423
388For 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,
389but it scales phenomenally better. While poll and select usually scale 425but it scales phenomenally better. While poll and select usually scale
390like 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),
391epoll scales either O(1) or O(active_fds). 427epoll scales either O(1) or O(active_fds).
506 542
507It is definitely not recommended to use this flag. 543It is definitely not recommended to use this flag.
508 544
509=back 545=back
510 546
511If one or more of these are or'ed into the flags value, then only these 547If one or more of the backend flags are or'ed into the flags value,
512backends will be tried (in the reverse order as listed here). If none are 548then only these backends will be tried (in the reverse order as listed
513specified, all backends in C<ev_recommended_backends ()> will be tried. 549here). If none are specified, all backends in C<ev_recommended_backends
550()> will be tried.
514 551
515Example: This is the most typical usage. 552Example: This is the most typical usage.
516 553
517 if (!ev_default_loop (0)) 554 if (!ev_default_loop (0))
518 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 555 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
530 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 567 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
531 568
532=item struct ev_loop *ev_loop_new (unsigned int flags) 569=item struct ev_loop *ev_loop_new (unsigned int flags)
533 570
534Similar to C<ev_default_loop>, but always creates a new event loop that is 571Similar to C<ev_default_loop>, but always creates a new event loop that is
535always distinct from the default loop. Unlike the default loop, it cannot 572always distinct from the default loop.
536handle signal and child watchers, and attempts to do so will be greeted by
537undefined behaviour (or a failed assertion if assertions are enabled).
538 573
539Note that this function I<is> thread-safe, and the recommended way to use 574Note that this function I<is> thread-safe, and one common way to use
540libev with threads is indeed to create one loop per thread, and using the 575libev with threads is indeed to create one loop per thread, and using the
541default loop in the "main" or "initial" thread. 576default loop in the "main" or "initial" thread.
542 577
543Example: Try to create a event loop that uses epoll and nothing else. 578Example: Try to create a event loop that uses epoll and nothing else.
544 579
546 if (!epoller) 581 if (!epoller)
547 fatal ("no epoll found here, maybe it hides under your chair"); 582 fatal ("no epoll found here, maybe it hides under your chair");
548 583
549=item ev_default_destroy () 584=item ev_default_destroy ()
550 585
551Destroys the default loop again (frees all memory and kernel state 586Destroys the default loop (frees all memory and kernel state etc.). None
552etc.). None of the active event watchers will be stopped in the normal 587of the active event watchers will be stopped in the normal sense, so
553sense, so e.g. C<ev_is_active> might still return true. It is your 588e.g. C<ev_is_active> might still return true. It is your responsibility to
554responsibility to either stop all watchers cleanly yourself I<before> 589either stop all watchers cleanly yourself I<before> calling this function,
555calling this function, or cope with the fact afterwards (which is usually 590or cope with the fact afterwards (which is usually the easiest thing, you
556the easiest thing, you can just ignore the watchers and/or C<free ()> them 591can just ignore the watchers and/or C<free ()> them for example).
557for example).
558 592
559Note that certain global state, such as signal state (and installed signal 593Note that certain global state, such as signal state (and installed signal
560handlers), will not be freed by this function, and related watchers (such 594handlers), will not be freed by this function, and related watchers (such
561as signal and child watchers) would need to be stopped manually. 595as signal and child watchers) would need to be stopped manually.
562 596
563In general it is not advisable to call this function except in the 597In general it is not advisable to call this function except in the
564rare occasion where you really need to free e.g. the signal handling 598rare occasion where you really need to free e.g. the signal handling
565pipe fds. If you need dynamically allocated loops it is better to use 599pipe fds. If you need dynamically allocated loops it is better to use
566C<ev_loop_new> and C<ev_loop_destroy>). 600C<ev_loop_new> and C<ev_loop_destroy>.
567 601
568=item ev_loop_destroy (loop) 602=item ev_loop_destroy (loop)
569 603
570Like C<ev_default_destroy>, but destroys an event loop created by an 604Like C<ev_default_destroy>, but destroys an event loop created by an
571earlier call to C<ev_loop_new>. 605earlier call to C<ev_loop_new>.
577name, you can call it anytime, but it makes most sense after forking, in 611name, you can call it anytime, but it makes most sense after forking, in
578the child process (or both child and parent, but that again makes little 612the child process (or both child and parent, but that again makes little
579sense). You I<must> call it in the child before using any of the libev 613sense). You I<must> call it in the child before using any of the libev
580functions, and it will only take effect at the next C<ev_loop> iteration. 614functions, and it will only take effect at the next C<ev_loop> iteration.
581 615
616Again, you I<have> to call it on I<any> loop that you want to re-use after
617a fork, I<even if you do not plan to use the loop in the parent>. This is
618because some kernel interfaces *cough* I<kqueue> *cough* do funny things
619during fork.
620
582On the other hand, you only need to call this function in the child 621On the other hand, you only need to call this function in the child
583process if and only if you want to use the event library in the child. If 622process if and only if you want to use the event loop in the child. If you
584you just fork+exec, you don't have to call it at all. 623just fork+exec or create a new loop in the child, you don't have to call
624it at all.
585 625
586The function itself is quite fast and it's usually not a problem to call 626The function itself is quite fast and it's usually not a problem to call
587it just in case after a fork. To make this easy, the function will fit in 627it just in case after a fork. To make this easy, the function will fit in
588quite nicely into a call to C<pthread_atfork>: 628quite nicely into a call to C<pthread_atfork>:
589 629
591 631
592=item ev_loop_fork (loop) 632=item ev_loop_fork (loop)
593 633
594Like C<ev_default_fork>, but acts on an event loop created by 634Like C<ev_default_fork>, but acts on an event loop created by
595C<ev_loop_new>. Yes, you have to call this on every allocated event loop 635C<ev_loop_new>. Yes, you have to call this on every allocated event loop
596after fork that you want to re-use in the child, and how you do this is 636after fork that you want to re-use in the child, and how you keep track of
597entirely your own problem. 637them is entirely your own problem.
598 638
599=item int ev_is_default_loop (loop) 639=item int ev_is_default_loop (loop)
600 640
601Returns true when the given loop is, in fact, the default loop, and false 641Returns true when the given loop is, in fact, the default loop, and false
602otherwise. 642otherwise.
603 643
604=item unsigned int ev_loop_count (loop) 644=item unsigned int ev_iteration (loop)
605 645
606Returns the count of loop iterations for the loop, which is identical to 646Returns the current iteration count for the loop, which is identical to
607the number of times libev did poll for new events. It starts at C<0> and 647the number of times libev did poll for new events. It starts at C<0> and
608happily wraps around with enough iterations. 648happily wraps around with enough iterations.
609 649
610This value can sometimes be useful as a generation counter of sorts (it 650This value can sometimes be useful as a generation counter of sorts (it
611"ticks" the number of loop iterations), as it roughly corresponds with 651"ticks" the number of loop iterations), as it roughly corresponds with
612C<ev_prepare> and C<ev_check> calls. 652C<ev_prepare> and C<ev_check> calls - and is incremented between the
653prepare and check phases.
654
655=item unsigned int ev_depth (loop)
656
657Returns the number of times C<ev_loop> was entered minus the number of
658times C<ev_loop> was exited, in other words, the recursion depth.
659
660Outside C<ev_loop>, this number is zero. In a callback, this number is
661C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
662in which case it is higher.
663
664Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
665etc.), doesn't count as "exit" - consider this as a hint to avoid such
666ungentleman behaviour unless it's really convenient.
613 667
614=item unsigned int ev_backend (loop) 668=item unsigned int ev_backend (loop)
615 669
616Returns one of the C<EVBACKEND_*> flags indicating the event backend in 670Returns one of the C<EVBACKEND_*> flags indicating the event backend in
617use. 671use.
632 686
633This function is rarely useful, but when some event callback runs for a 687This function is rarely useful, but when some event callback runs for a
634very long time without entering the event loop, updating libev's idea of 688very long time without entering the event loop, updating libev's idea of
635the current time is a good idea. 689the current time is a good idea.
636 690
637See also "The special problem of time updates" in the C<ev_timer> section. 691See also L<The special problem of time updates> in the C<ev_timer> section.
692
693=item ev_suspend (loop)
694
695=item ev_resume (loop)
696
697These two functions suspend and resume a loop, for use when the loop is
698not used for a while and timeouts should not be processed.
699
700A typical use case would be an interactive program such as a game: When
701the user presses C<^Z> to suspend the game and resumes it an hour later it
702would be best to handle timeouts as if no time had actually passed while
703the program was suspended. This can be achieved by calling C<ev_suspend>
704in your C<SIGTSTP> handler, sending yourself a C<SIGSTOP> and calling
705C<ev_resume> directly afterwards to resume timer processing.
706
707Effectively, all C<ev_timer> watchers will be delayed by the time spend
708between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
709will be rescheduled (that is, they will lose any events that would have
710occurred while suspended).
711
712After calling C<ev_suspend> you B<must not> call I<any> function on the
713given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
714without a previous call to C<ev_suspend>.
715
716Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
717event loop time (see C<ev_now_update>).
638 718
639=item ev_loop (loop, int flags) 719=item ev_loop (loop, int flags)
640 720
641Finally, this is it, the event handler. This function usually is called 721Finally, this is it, the event handler. This function usually is called
642after you initialised all your watchers and you want to start handling 722after you have initialised all your watchers and you want to start
643events. 723handling events.
644 724
645If the flags argument is specified as C<0>, it will not return until 725If the flags argument is specified as C<0>, it will not return until
646either no event watchers are active anymore or C<ev_unloop> was called. 726either no event watchers are active anymore or C<ev_unloop> was called.
647 727
648Please note that an explicit C<ev_unloop> is usually better than 728Please note that an explicit C<ev_unloop> is usually better than
712C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 792C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
713C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 793C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
714 794
715This "unloop state" will be cleared when entering C<ev_loop> again. 795This "unloop state" will be cleared when entering C<ev_loop> again.
716 796
717It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 797It is safe to call C<ev_unloop> from outside any C<ev_loop> calls.
718 798
719=item ev_ref (loop) 799=item ev_ref (loop)
720 800
721=item ev_unref (loop) 801=item ev_unref (loop)
722 802
723Ref/unref can be used to add or remove a reference count on the event 803Ref/unref can be used to add or remove a reference count on the event
724loop: Every watcher keeps one reference, and as long as the reference 804loop: Every watcher keeps one reference, and as long as the reference
725count is nonzero, C<ev_loop> will not return on its own. 805count is nonzero, C<ev_loop> will not return on its own.
726 806
727If you have a watcher you never unregister that should not keep C<ev_loop> 807This is useful when you have a watcher that you never intend to
728from returning, call ev_unref() after starting, and ev_ref() before 808unregister, but that nevertheless should not keep C<ev_loop> from
809returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
729stopping it. 810before stopping it.
730 811
731As an example, libev itself uses this for its internal signal pipe: It is 812As an example, libev itself uses this for its internal signal pipe: It
732not visible to the libev user and should not keep C<ev_loop> from exiting 813is not visible to the libev user and should not keep C<ev_loop> from
733if no event watchers registered by it are active. It is also an excellent 814exiting if no event watchers registered by it are active. It is also an
734way to do this for generic recurring timers or from within third-party 815excellent way to do this for generic recurring timers or from within
735libraries. Just remember to I<unref after start> and I<ref before stop> 816third-party libraries. Just remember to I<unref after start> and I<ref
736(but only if the watcher wasn't active before, or was active before, 817before stop> (but only if the watcher wasn't active before, or was active
737respectively). 818before, respectively. Note also that libev might stop watchers itself
819(e.g. non-repeating timers) in which case you have to C<ev_ref>
820in the callback).
738 821
739Example: Create a signal watcher, but keep it from keeping C<ev_loop> 822Example: Create a signal watcher, but keep it from keeping C<ev_loop>
740running when nothing else is active. 823running when nothing else is active.
741 824
742 ev_signal exitsig; 825 ev_signal exitsig;
771 854
772By setting a higher I<io collect interval> you allow libev to spend more 855By setting a higher I<io collect interval> you allow libev to spend more
773time collecting I/O events, so you can handle more events per iteration, 856time collecting I/O events, so you can handle more events per iteration,
774at the cost of increasing latency. Timeouts (both C<ev_periodic> and 857at the cost of increasing latency. Timeouts (both C<ev_periodic> and
775C<ev_timer>) will be not affected. Setting this to a non-null value will 858C<ev_timer>) will be not affected. Setting this to a non-null value will
776introduce an additional C<ev_sleep ()> call into most loop iterations. 859introduce an additional C<ev_sleep ()> call into most loop iterations. The
860sleep time ensures that libev will not poll for I/O events more often then
861once per this interval, on average.
777 862
778Likewise, by setting a higher I<timeout collect interval> you allow libev 863Likewise, by setting a higher I<timeout collect interval> you allow libev
779to spend more time collecting timeouts, at the expense of increased 864to spend more time collecting timeouts, at the expense of increased
780latency/jitter/inexactness (the watcher callback will be called 865latency/jitter/inexactness (the watcher callback will be called
781later). C<ev_io> watchers will not be affected. Setting this to a non-null 866later). C<ev_io> watchers will not be affected. Setting this to a non-null
783 868
784Many (busy) programs can usually benefit by setting the I/O collect 869Many (busy) programs can usually benefit by setting the I/O collect
785interval to a value near C<0.1> or so, which is often enough for 870interval to a value near C<0.1> or so, which is often enough for
786interactive servers (of course not for games), likewise for timeouts. It 871interactive servers (of course not for games), likewise for timeouts. It
787usually doesn't make much sense to set it to a lower value than C<0.01>, 872usually doesn't make much sense to set it to a lower value than C<0.01>,
788as this approaches the timing granularity of most systems. 873as this approaches the timing granularity of most systems. Note that if
874you do transactions with the outside world and you can't increase the
875parallelity, then this setting will limit your transaction rate (if you
876need to poll once per transaction and the I/O collect interval is 0.01,
877then you can't do more than 100 transactions per second).
789 878
790Setting the I<timeout collect interval> can improve the opportunity for 879Setting the I<timeout collect interval> can improve the opportunity for
791saving power, as the program will "bundle" timer callback invocations that 880saving power, as the program will "bundle" timer callback invocations that
792are "near" in time together, by delaying some, thus reducing the number of 881are "near" in time together, by delaying some, thus reducing the number of
793times the process sleeps and wakes up again. Another useful technique to 882times the process sleeps and wakes up again. Another useful technique to
794reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure 883reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
795they fire on, say, one-second boundaries only. 884they fire on, say, one-second boundaries only.
796 885
886Example: we only need 0.1s timeout granularity, and we wish not to poll
887more often than 100 times per second:
888
889 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
890 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
891
892=item ev_invoke_pending (loop)
893
894This call will simply invoke all pending watchers while resetting their
895pending state. Normally, C<ev_loop> does this automatically when required,
896but when overriding the invoke callback this call comes handy.
897
898=item int ev_pending_count (loop)
899
900Returns the number of pending watchers - zero indicates that no watchers
901are pending.
902
903=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
904
905This overrides the invoke pending functionality of the loop: Instead of
906invoking all pending watchers when there are any, C<ev_loop> will call
907this callback instead. This is useful, for example, when you want to
908invoke the actual watchers inside another context (another thread etc.).
909
910If you want to reset the callback, use C<ev_invoke_pending> as new
911callback.
912
913=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
914
915Sometimes you want to share the same loop between multiple threads. This
916can be done relatively simply by putting mutex_lock/unlock calls around
917each call to a libev function.
918
919However, C<ev_loop> can run an indefinite time, so it is not feasible to
920wait for it to return. One way around this is to wake up the loop via
921C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
922and I<acquire> callbacks on the loop.
923
924When set, then C<release> will be called just before the thread is
925suspended waiting for new events, and C<acquire> is called just
926afterwards.
927
928Ideally, C<release> will just call your mutex_unlock function, and
929C<acquire> will just call the mutex_lock function again.
930
931While event loop modifications are allowed between invocations of
932C<release> and C<acquire> (that's their only purpose after all), no
933modifications done will affect the event loop, i.e. adding watchers will
934have no effect on the set of file descriptors being watched, or the time
935waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it
936to take note of any changes you made.
937
938In theory, threads executing C<ev_loop> will be async-cancel safe between
939invocations of C<release> and C<acquire>.
940
941See also the locking example in the C<THREADS> section later in this
942document.
943
944=item ev_set_userdata (loop, void *data)
945
946=item ev_userdata (loop)
947
948Set and retrieve a single C<void *> associated with a loop. When
949C<ev_set_userdata> has never been called, then C<ev_userdata> returns
950C<0.>
951
952These two functions can be used to associate arbitrary data with a loop,
953and are intended solely for the C<invoke_pending_cb>, C<release> and
954C<acquire> callbacks described above, but of course can be (ab-)used for
955any other purpose as well.
956
797=item ev_loop_verify (loop) 957=item ev_loop_verify (loop)
798 958
799This function only does something when C<EV_VERIFY> support has been 959This function only does something when C<EV_VERIFY> support has been
800compiled in, which is the default for non-minimal builds. It tries to go 960compiled in, which is the default for non-minimal builds. It tries to go
801through all internal structures and checks them for validity. If anything 961through all internal structures and checks them for validity. If anything
877=item C<EV_WRITE> 1037=item C<EV_WRITE>
878 1038
879The file descriptor in the C<ev_io> watcher has become readable and/or 1039The file descriptor in the C<ev_io> watcher has become readable and/or
880writable. 1040writable.
881 1041
882=item C<EV_TIMEOUT> 1042=item C<EV_TIMER>
883 1043
884The C<ev_timer> watcher has timed out. 1044The C<ev_timer> watcher has timed out.
885 1045
886=item C<EV_PERIODIC> 1046=item C<EV_PERIODIC>
887 1047
926 1086
927=item C<EV_ASYNC> 1087=item C<EV_ASYNC>
928 1088
929The given async watcher has been asynchronously notified (see C<ev_async>). 1089The given async watcher has been asynchronously notified (see C<ev_async>).
930 1090
1091=item C<EV_CUSTOM>
1092
1093Not ever sent (or otherwise used) by libev itself, but can be freely used
1094by libev users to signal watchers (e.g. via C<ev_feed_event>).
1095
931=item C<EV_ERROR> 1096=item C<EV_ERROR>
932 1097
933An unspecified error has occurred, the watcher has been stopped. This might 1098An unspecified error has occurred, the watcher has been stopped. This might
934happen because the watcher could not be properly started because libev 1099happen because the watcher could not be properly started because libev
935ran out of memory, a file descriptor was found to be closed or any other 1100ran out of memory, a file descriptor was found to be closed or any other
972 1137
973 ev_io w; 1138 ev_io w;
974 ev_init (&w, my_cb); 1139 ev_init (&w, my_cb);
975 ev_io_set (&w, STDIN_FILENO, EV_READ); 1140 ev_io_set (&w, STDIN_FILENO, EV_READ);
976 1141
977=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1142=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
978 1143
979This macro initialises the type-specific parts of a watcher. You need to 1144This macro initialises the type-specific parts of a watcher. You need to
980call C<ev_init> at least once before you call this macro, but you can 1145call C<ev_init> at least once before you call this macro, but you can
981call C<ev_TYPE_set> any number of times. You must not, however, call this 1146call C<ev_TYPE_set> any number of times. You must not, however, call this
982macro on a watcher that is active (it can be pending, however, which is a 1147macro on a watcher that is active (it can be pending, however, which is a
995 1160
996Example: Initialise and set an C<ev_io> watcher in one step. 1161Example: Initialise and set an C<ev_io> watcher in one step.
997 1162
998 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1163 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
999 1164
1000=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1165=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1001 1166
1002Starts (activates) the given watcher. Only active watchers will receive 1167Starts (activates) the given watcher. Only active watchers will receive
1003events. If the watcher is already active nothing will happen. 1168events. If the watcher is already active nothing will happen.
1004 1169
1005Example: Start the C<ev_io> watcher that is being abused as example in this 1170Example: Start the C<ev_io> watcher that is being abused as example in this
1006whole section. 1171whole section.
1007 1172
1008 ev_io_start (EV_DEFAULT_UC, &w); 1173 ev_io_start (EV_DEFAULT_UC, &w);
1009 1174
1010=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1175=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1011 1176
1012Stops the given watcher if active, and clears the pending status (whether 1177Stops the given watcher if active, and clears the pending status (whether
1013the watcher was active or not). 1178the watcher was active or not).
1014 1179
1015It is possible that stopped watchers are pending - for example, 1180It is possible that stopped watchers are pending - for example,
1040=item ev_cb_set (ev_TYPE *watcher, callback) 1205=item ev_cb_set (ev_TYPE *watcher, callback)
1041 1206
1042Change the callback. You can change the callback at virtually any time 1207Change the callback. You can change the callback at virtually any time
1043(modulo threads). 1208(modulo threads).
1044 1209
1045=item ev_set_priority (ev_TYPE *watcher, priority) 1210=item ev_set_priority (ev_TYPE *watcher, int priority)
1046 1211
1047=item int ev_priority (ev_TYPE *watcher) 1212=item int ev_priority (ev_TYPE *watcher)
1048 1213
1049Set and query the priority of the watcher. The priority is a small 1214Set and query the priority of the watcher. The priority is a small
1050integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1215integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1051(default: C<-2>). Pending watchers with higher priority will be invoked 1216(default: C<-2>). Pending watchers with higher priority will be invoked
1052before watchers with lower priority, but priority will not keep watchers 1217before watchers with lower priority, but priority will not keep watchers
1053from being executed (except for C<ev_idle> watchers). 1218from being executed (except for C<ev_idle> watchers).
1054 1219
1055This means that priorities are I<only> used for ordering callback
1056invocation after new events have been received. This is useful, for
1057example, to reduce latency after idling, or more often, to bind two
1058watchers on the same event and make sure one is called first.
1059
1060If you need to suppress invocation when higher priority events are pending 1220If you need to suppress invocation when higher priority events are pending
1061you need to look at C<ev_idle> watchers, which provide this functionality. 1221you need to look at C<ev_idle> watchers, which provide this functionality.
1062 1222
1063You I<must not> change the priority of a watcher as long as it is active or 1223You I<must not> change the priority of a watcher as long as it is active or
1064pending. 1224pending.
1065
1066The default priority used by watchers when no priority has been set is
1067always C<0>, which is supposed to not be too high and not be too low :).
1068 1225
1069Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is 1226Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1070fine, as long as you do not mind that the priority value you query might 1227fine, as long as you do not mind that the priority value you query might
1071or might not have been clamped to the valid range. 1228or might not have been clamped to the valid range.
1229
1230The default priority used by watchers when no priority has been set is
1231always C<0>, which is supposed to not be too high and not be too low :).
1232
1233See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1234priorities.
1072 1235
1073=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1236=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1074 1237
1075Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1238Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1076C<loop> nor C<revents> need to be valid as long as the watcher callback 1239C<loop> nor C<revents> need to be valid as long as the watcher callback
1083returns its C<revents> bitset (as if its callback was invoked). If the 1246returns its C<revents> bitset (as if its callback was invoked). If the
1084watcher isn't pending it does nothing and returns C<0>. 1247watcher isn't pending it does nothing and returns C<0>.
1085 1248
1086Sometimes it can be useful to "poll" a watcher instead of waiting for its 1249Sometimes it can be useful to "poll" a watcher instead of waiting for its
1087callback to be invoked, which can be accomplished with this function. 1250callback to be invoked, which can be accomplished with this function.
1251
1252=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1253
1254Feeds the given event set into the event loop, as if the specified event
1255had happened for the specified watcher (which must be a pointer to an
1256initialised but not necessarily started event watcher). Obviously you must
1257not free the watcher as long as it has pending events.
1258
1259Stopping the watcher, letting libev invoke it, or calling
1260C<ev_clear_pending> will clear the pending event, even if the watcher was
1261not started in the first place.
1262
1263See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1264functions that do not need a watcher.
1088 1265
1089=back 1266=back
1090 1267
1091 1268
1092=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1269=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1141 #include <stddef.h> 1318 #include <stddef.h>
1142 1319
1143 static void 1320 static void
1144 t1_cb (EV_P_ ev_timer *w, int revents) 1321 t1_cb (EV_P_ ev_timer *w, int revents)
1145 { 1322 {
1146 struct my_biggy big = (struct my_biggy * 1323 struct my_biggy big = (struct my_biggy *)
1147 (((char *)w) - offsetof (struct my_biggy, t1)); 1324 (((char *)w) - offsetof (struct my_biggy, t1));
1148 } 1325 }
1149 1326
1150 static void 1327 static void
1151 t2_cb (EV_P_ ev_timer *w, int revents) 1328 t2_cb (EV_P_ ev_timer *w, int revents)
1152 { 1329 {
1153 struct my_biggy big = (struct my_biggy * 1330 struct my_biggy big = (struct my_biggy *)
1154 (((char *)w) - offsetof (struct my_biggy, t2)); 1331 (((char *)w) - offsetof (struct my_biggy, t2));
1155 } 1332 }
1333
1334=head2 WATCHER PRIORITY MODELS
1335
1336Many event loops support I<watcher priorities>, which are usually small
1337integers that influence the ordering of event callback invocation
1338between watchers in some way, all else being equal.
1339
1340In libev, Watcher priorities can be set using C<ev_set_priority>. See its
1341description for the more technical details such as the actual priority
1342range.
1343
1344There are two common ways how these these priorities are being interpreted
1345by event loops:
1346
1347In the more common lock-out model, higher priorities "lock out" invocation
1348of lower priority watchers, which means as long as higher priority
1349watchers receive events, lower priority watchers are not being invoked.
1350
1351The less common only-for-ordering model uses priorities solely to order
1352callback invocation within a single event loop iteration: Higher priority
1353watchers are invoked before lower priority ones, but they all get invoked
1354before polling for new events.
1355
1356Libev uses the second (only-for-ordering) model for all its watchers
1357except for idle watchers (which use the lock-out model).
1358
1359The rationale behind this is that implementing the lock-out model for
1360watchers is not well supported by most kernel interfaces, and most event
1361libraries will just poll for the same events again and again as long as
1362their callbacks have not been executed, which is very inefficient in the
1363common case of one high-priority watcher locking out a mass of lower
1364priority ones.
1365
1366Static (ordering) priorities are most useful when you have two or more
1367watchers handling the same resource: a typical usage example is having an
1368C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
1369timeouts. Under load, data might be received while the program handles
1370other jobs, but since timers normally get invoked first, the timeout
1371handler will be executed before checking for data. In that case, giving
1372the timer a lower priority than the I/O watcher ensures that I/O will be
1373handled first even under adverse conditions (which is usually, but not
1374always, what you want).
1375
1376Since idle watchers use the "lock-out" model, meaning that idle watchers
1377will only be executed when no same or higher priority watchers have
1378received events, they can be used to implement the "lock-out" model when
1379required.
1380
1381For example, to emulate how many other event libraries handle priorities,
1382you can associate an C<ev_idle> watcher to each such watcher, and in
1383the normal watcher callback, you just start the idle watcher. The real
1384processing is done in the idle watcher callback. This causes libev to
1385continuously poll and process kernel event data for the watcher, but when
1386the lock-out case is known to be rare (which in turn is rare :), this is
1387workable.
1388
1389Usually, however, the lock-out model implemented that way will perform
1390miserably under the type of load it was designed to handle. In that case,
1391it might be preferable to stop the real watcher before starting the
1392idle watcher, so the kernel will not have to process the event in case
1393the actual processing will be delayed for considerable time.
1394
1395Here is an example of an I/O watcher that should run at a strictly lower
1396priority than the default, and which should only process data when no
1397other events are pending:
1398
1399 ev_idle idle; // actual processing watcher
1400 ev_io io; // actual event watcher
1401
1402 static void
1403 io_cb (EV_P_ ev_io *w, int revents)
1404 {
1405 // stop the I/O watcher, we received the event, but
1406 // are not yet ready to handle it.
1407 ev_io_stop (EV_A_ w);
1408
1409 // start the idle watcher to handle the actual event.
1410 // it will not be executed as long as other watchers
1411 // with the default priority are receiving events.
1412 ev_idle_start (EV_A_ &idle);
1413 }
1414
1415 static void
1416 idle_cb (EV_P_ ev_idle *w, int revents)
1417 {
1418 // actual processing
1419 read (STDIN_FILENO, ...);
1420
1421 // have to start the I/O watcher again, as
1422 // we have handled the event
1423 ev_io_start (EV_P_ &io);
1424 }
1425
1426 // initialisation
1427 ev_idle_init (&idle, idle_cb);
1428 ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ);
1429 ev_io_start (EV_DEFAULT_ &io);
1430
1431In the "real" world, it might also be beneficial to start a timer, so that
1432low-priority connections can not be locked out forever under load. This
1433enables your program to keep a lower latency for important connections
1434during short periods of high load, while not completely locking out less
1435important ones.
1156 1436
1157 1437
1158=head1 WATCHER TYPES 1438=head1 WATCHER TYPES
1159 1439
1160This section describes each watcher in detail, but will not repeat 1440This section describes each watcher in detail, but will not repeat
1186descriptors to non-blocking mode is also usually a good idea (but not 1466descriptors to non-blocking mode is also usually a good idea (but not
1187required if you know what you are doing). 1467required if you know what you are doing).
1188 1468
1189If you cannot use non-blocking mode, then force the use of a 1469If you cannot use non-blocking mode, then force the use of a
1190known-to-be-good backend (at the time of this writing, this includes only 1470known-to-be-good backend (at the time of this writing, this includes only
1191C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1471C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1472descriptors for which non-blocking operation makes no sense (such as
1473files) - libev doesn't guarantee any specific behaviour in that case.
1192 1474
1193Another thing you have to watch out for is that it is quite easy to 1475Another thing you have to watch out for is that it is quite easy to
1194receive "spurious" readiness notifications, that is your callback might 1476receive "spurious" readiness notifications, that is your callback might
1195be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1477be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1196because there is no data. Not only are some backends known to create a 1478because there is no data. Not only are some backends known to create a
1261 1543
1262So when you encounter spurious, unexplained daemon exits, make sure you 1544So when you encounter spurious, unexplained daemon exits, make sure you
1263ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1545ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1264somewhere, as that would have given you a big clue). 1546somewhere, as that would have given you a big clue).
1265 1547
1548=head3 The special problem of accept()ing when you can't
1549
1550Many implementations of the POSIX C<accept> function (for example,
1551found in post-2004 Linux) have the peculiar behaviour of not removing a
1552connection from the pending queue in all error cases.
1553
1554For example, larger servers often run out of file descriptors (because
1555of resource limits), causing C<accept> to fail with C<ENFILE> but not
1556rejecting the connection, leading to libev signalling readiness on
1557the next iteration again (the connection still exists after all), and
1558typically causing the program to loop at 100% CPU usage.
1559
1560Unfortunately, the set of errors that cause this issue differs between
1561operating systems, there is usually little the app can do to remedy the
1562situation, and no known thread-safe method of removing the connection to
1563cope with overload is known (to me).
1564
1565One of the easiest ways to handle this situation is to just ignore it
1566- when the program encounters an overload, it will just loop until the
1567situation is over. While this is a form of busy waiting, no OS offers an
1568event-based way to handle this situation, so it's the best one can do.
1569
1570A better way to handle the situation is to log any errors other than
1571C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1572messages, and continue as usual, which at least gives the user an idea of
1573what could be wrong ("raise the ulimit!"). For extra points one could stop
1574the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1575usage.
1576
1577If your program is single-threaded, then you could also keep a dummy file
1578descriptor for overload situations (e.g. by opening F</dev/null>), and
1579when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1580close that fd, and create a new dummy fd. This will gracefully refuse
1581clients under typical overload conditions.
1582
1583The last way to handle it is to simply log the error and C<exit>, as
1584is often done with C<malloc> failures, but this results in an easy
1585opportunity for a DoS attack.
1266 1586
1267=head3 Watcher-Specific Functions 1587=head3 Watcher-Specific Functions
1268 1588
1269=over 4 1589=over 4
1270 1590
1317year, it will still time out after (roughly) one hour. "Roughly" because 1637year, it will still time out after (roughly) one hour. "Roughly" because
1318detecting time jumps is hard, and some inaccuracies are unavoidable (the 1638detecting time jumps is hard, and some inaccuracies are unavoidable (the
1319monotonic clock option helps a lot here). 1639monotonic clock option helps a lot here).
1320 1640
1321The callback is guaranteed to be invoked only I<after> its timeout has 1641The callback is guaranteed to be invoked only I<after> its timeout has
1322passed, but if multiple timers become ready during the same loop iteration 1642passed (not I<at>, so on systems with very low-resolution clocks this
1323then order of execution is undefined. 1643might introduce a small delay). If multiple timers become ready during the
1644same loop iteration then the ones with earlier time-out values are invoked
1645before ones of the same priority with later time-out values (but this is
1646no longer true when a callback calls C<ev_loop> recursively).
1324 1647
1325=head3 Be smart about timeouts 1648=head3 Be smart about timeouts
1326 1649
1327Many real-world problems involve some kind of timeout, usually for error 1650Many real-world problems involve some kind of timeout, usually for error
1328recovery. A typical example is an HTTP request - if the other side hangs, 1651recovery. A typical example is an HTTP request - if the other side hangs,
1372C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> 1695C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1373member and C<ev_timer_again>. 1696member and C<ev_timer_again>.
1374 1697
1375At start: 1698At start:
1376 1699
1377 ev_timer_init (timer, callback); 1700 ev_init (timer, callback);
1378 timer->repeat = 60.; 1701 timer->repeat = 60.;
1379 ev_timer_again (loop, timer); 1702 ev_timer_again (loop, timer);
1380 1703
1381Each time there is some activity: 1704Each time there is some activity:
1382 1705
1414 ev_tstamp timeout = last_activity + 60.; 1737 ev_tstamp timeout = last_activity + 60.;
1415 1738
1416 // if last_activity + 60. is older than now, we did time out 1739 // if last_activity + 60. is older than now, we did time out
1417 if (timeout < now) 1740 if (timeout < now)
1418 { 1741 {
1419 // timeout occured, take action 1742 // timeout occurred, take action
1420 } 1743 }
1421 else 1744 else
1422 { 1745 {
1423 // callback was invoked, but there was some activity, re-arm 1746 // callback was invoked, but there was some activity, re-arm
1424 // the watcher to fire in last_activity + 60, which is 1747 // the watcher to fire in last_activity + 60, which is
1444 1767
1445To start the timer, simply initialise the watcher and set C<last_activity> 1768To start the timer, simply initialise the watcher and set C<last_activity>
1446to the current time (meaning we just have some activity :), then call the 1769to the current time (meaning we just have some activity :), then call the
1447callback, which will "do the right thing" and start the timer: 1770callback, which will "do the right thing" and start the timer:
1448 1771
1449 ev_timer_init (timer, callback); 1772 ev_init (timer, callback);
1450 last_activity = ev_now (loop); 1773 last_activity = ev_now (loop);
1451 callback (loop, timer, EV_TIMEOUT); 1774 callback (loop, timer, EV_TIMER);
1452 1775
1453And when there is some activity, simply store the current time in 1776And when there is some activity, simply store the current time in
1454C<last_activity>, no libev calls at all: 1777C<last_activity>, no libev calls at all:
1455 1778
1456 last_actiivty = ev_now (loop); 1779 last_activity = ev_now (loop);
1457 1780
1458This technique is slightly more complex, but in most cases where the 1781This technique is slightly more complex, but in most cases where the
1459time-out is unlikely to be triggered, much more efficient. 1782time-out is unlikely to be triggered, much more efficient.
1460 1783
1461Changing the timeout is trivial as well (if it isn't hard-coded in the 1784Changing the timeout is trivial as well (if it isn't hard-coded in the
1515 1838
1516If the event loop is suspended for a long time, you can also force an 1839If the event loop is suspended for a long time, you can also force an
1517update of the time returned by C<ev_now ()> by calling C<ev_now_update 1840update of the time returned by C<ev_now ()> by calling C<ev_now_update
1518()>. 1841()>.
1519 1842
1843=head3 The special problems of suspended animation
1844
1845When you leave the server world it is quite customary to hit machines that
1846can suspend/hibernate - what happens to the clocks during such a suspend?
1847
1848Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1849all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1850to run until the system is suspended, but they will not advance while the
1851system is suspended. That means, on resume, it will be as if the program
1852was frozen for a few seconds, but the suspend time will not be counted
1853towards C<ev_timer> when a monotonic clock source is used. The real time
1854clock advanced as expected, but if it is used as sole clocksource, then a
1855long suspend would be detected as a time jump by libev, and timers would
1856be adjusted accordingly.
1857
1858I would not be surprised to see different behaviour in different between
1859operating systems, OS versions or even different hardware.
1860
1861The other form of suspend (job control, or sending a SIGSTOP) will see a
1862time jump in the monotonic clocks and the realtime clock. If the program
1863is suspended for a very long time, and monotonic clock sources are in use,
1864then you can expect C<ev_timer>s to expire as the full suspension time
1865will be counted towards the timers. When no monotonic clock source is in
1866use, then libev will again assume a timejump and adjust accordingly.
1867
1868It might be beneficial for this latter case to call C<ev_suspend>
1869and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1870deterministic behaviour in this case (you can do nothing against
1871C<SIGSTOP>).
1872
1520=head3 Watcher-Specific Functions and Data Members 1873=head3 Watcher-Specific Functions and Data Members
1521 1874
1522=over 4 1875=over 4
1523 1876
1524=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1877=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1547If the timer is started but non-repeating, stop it (as if it timed out). 1900If the timer is started but non-repeating, stop it (as if it timed out).
1548 1901
1549If the timer is repeating, either start it if necessary (with the 1902If the timer is repeating, either start it if necessary (with the
1550C<repeat> value), or reset the running timer to the C<repeat> value. 1903C<repeat> value), or reset the running timer to the C<repeat> value.
1551 1904
1552This sounds a bit complicated, see "Be smart about timeouts", above, for a 1905This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1553usage example. 1906usage example.
1907
1908=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1909
1910Returns the remaining time until a timer fires. If the timer is active,
1911then this time is relative to the current event loop time, otherwise it's
1912the timeout value currently configured.
1913
1914That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1915C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
1916will return C<4>. When the timer expires and is restarted, it will return
1917roughly C<7> (likely slightly less as callback invocation takes some time,
1918too), and so on.
1554 1919
1555=item ev_tstamp repeat [read-write] 1920=item ev_tstamp repeat [read-write]
1556 1921
1557The current C<repeat> value. Will be used each time the watcher times out 1922The current C<repeat> value. Will be used each time the watcher times out
1558or C<ev_timer_again> is called, and determines the next timeout (if any), 1923or C<ev_timer_again> is called, and determines the next timeout (if any),
1617timers, such as triggering an event on each "midnight, local time", or 1982timers, such as triggering an event on each "midnight, local time", or
1618other complicated rules. This cannot be done with C<ev_timer> watchers, as 1983other complicated rules. This cannot be done with C<ev_timer> watchers, as
1619those cannot react to time jumps. 1984those cannot react to time jumps.
1620 1985
1621As with timers, the callback is guaranteed to be invoked only when the 1986As with timers, the callback is guaranteed to be invoked only when the
1622point in time where it is supposed to trigger has passed, but if multiple 1987point in time where it is supposed to trigger has passed. If multiple
1623periodic timers become ready during the same loop iteration, then order of 1988timers become ready during the same loop iteration then the ones with
1624execution is undefined. 1989earlier time-out values are invoked before ones with later time-out values
1990(but this is no longer true when a callback calls C<ev_loop> recursively).
1625 1991
1626=head3 Watcher-Specific Functions and Data Members 1992=head3 Watcher-Specific Functions and Data Members
1627 1993
1628=over 4 1994=over 4
1629 1995
1757Example: Call a callback every hour, or, more precisely, whenever the 2123Example: Call a callback every hour, or, more precisely, whenever the
1758system time is divisible by 3600. The callback invocation times have 2124system time is divisible by 3600. The callback invocation times have
1759potentially a lot of jitter, but good long-term stability. 2125potentially a lot of jitter, but good long-term stability.
1760 2126
1761 static void 2127 static void
1762 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2128 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1763 { 2129 {
1764 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2130 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1765 } 2131 }
1766 2132
1767 ev_periodic hourly_tick; 2133 ev_periodic hourly_tick;
1793Signal watchers will trigger an event when the process receives a specific 2159Signal watchers will trigger an event when the process receives a specific
1794signal one or more times. Even though signals are very asynchronous, libev 2160signal one or more times. Even though signals are very asynchronous, libev
1795will try it's best to deliver signals synchronously, i.e. as part of the 2161will try it's best to deliver signals synchronously, i.e. as part of the
1796normal event processing, like any other event. 2162normal event processing, like any other event.
1797 2163
1798If you want signals asynchronously, just use C<sigaction> as you would 2164If you want signals to be delivered truly asynchronously, just use
1799do without libev and forget about sharing the signal. You can even use 2165C<sigaction> as you would do without libev and forget about sharing
1800C<ev_async> from a signal handler to synchronously wake up an event loop. 2166the signal. You can even use C<ev_async> from a signal handler to
2167synchronously wake up an event loop.
1801 2168
1802You can configure as many watchers as you like per signal. Only when the 2169You can configure as many watchers as you like for the same signal, but
2170only within the same loop, i.e. you can watch for C<SIGINT> in your
2171default loop and for C<SIGIO> in another loop, but you cannot watch for
2172C<SIGINT> in both the default loop and another loop at the same time. At
2173the moment, C<SIGCHLD> is permanently tied to the default loop.
2174
1803first watcher gets started will libev actually register a signal handler 2175When the first watcher gets started will libev actually register something
1804with the kernel (thus it coexists with your own signal handlers as long as 2176with the kernel (thus it coexists with your own signal handlers as long as
1805you don't register any with libev for the same signal). Similarly, when 2177you don't register any with libev for the same signal).
1806the last signal watcher for a signal is stopped, libev will reset the
1807signal handler to SIG_DFL (regardless of what it was set to before).
1808 2178
1809If possible and supported, libev will install its handlers with 2179If possible and supported, libev will install its handlers with
1810C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2180C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1811interrupted. If you have a problem with system calls getting interrupted by 2181not be unduly interrupted. If you have a problem with system calls getting
1812signals you can block all signals in an C<ev_check> watcher and unblock 2182interrupted by signals you can block all signals in an C<ev_check> watcher
1813them in an C<ev_prepare> watcher. 2183and unblock them in an C<ev_prepare> watcher.
2184
2185=head3 The special problem of inheritance over fork/execve/pthread_create
2186
2187Both the signal mask (C<sigprocmask>) and the signal disposition
2188(C<sigaction>) are unspecified after starting a signal watcher (and after
2189stopping it again), that is, libev might or might not block the signal,
2190and might or might not set or restore the installed signal handler.
2191
2192While this does not matter for the signal disposition (libev never
2193sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2194C<execve>), this matters for the signal mask: many programs do not expect
2195certain signals to be blocked.
2196
2197This means that before calling C<exec> (from the child) you should reset
2198the signal mask to whatever "default" you expect (all clear is a good
2199choice usually).
2200
2201The simplest way to ensure that the signal mask is reset in the child is
2202to install a fork handler with C<pthread_atfork> that resets it. That will
2203catch fork calls done by libraries (such as the libc) as well.
2204
2205In current versions of libev, the signal will not be blocked indefinitely
2206unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2207the window of opportunity for problems, it will not go away, as libev
2208I<has> to modify the signal mask, at least temporarily.
2209
2210So I can't stress this enough: I<If you do not reset your signal mask when
2211you expect it to be empty, you have a race condition in your code>. This
2212is not a libev-specific thing, this is true for most event libraries.
1814 2213
1815=head3 Watcher-Specific Functions and Data Members 2214=head3 Watcher-Specific Functions and Data Members
1816 2215
1817=over 4 2216=over 4
1818 2217
1850some child status changes (most typically when a child of yours dies or 2249some child status changes (most typically when a child of yours dies or
1851exits). It is permissible to install a child watcher I<after> the child 2250exits). It is permissible to install a child watcher I<after> the child
1852has been forked (which implies it might have already exited), as long 2251has been forked (which implies it might have already exited), as long
1853as the event loop isn't entered (or is continued from a watcher), i.e., 2252as the event loop isn't entered (or is continued from a watcher), i.e.,
1854forking and then immediately registering a watcher for the child is fine, 2253forking and then immediately registering a watcher for the child is fine,
1855but forking and registering a watcher a few event loop iterations later is 2254but forking and registering a watcher a few event loop iterations later or
1856not. 2255in the next callback invocation is not.
1857 2256
1858Only the default event loop is capable of handling signals, and therefore 2257Only the default event loop is capable of handling signals, and therefore
1859you can only register child watchers in the default event loop. 2258you can only register child watchers in the default event loop.
1860 2259
2260Due to some design glitches inside libev, child watchers will always be
2261handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2262libev)
2263
1861=head3 Process Interaction 2264=head3 Process Interaction
1862 2265
1863Libev grabs C<SIGCHLD> as soon as the default event loop is 2266Libev grabs C<SIGCHLD> as soon as the default event loop is
1864initialised. This is necessary to guarantee proper behaviour even if 2267initialised. This is necessary to guarantee proper behaviour even if the
1865the first child watcher is started after the child exits. The occurrence 2268first child watcher is started after the child exits. The occurrence
1866of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2269of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1867synchronously as part of the event loop processing. Libev always reaps all 2270synchronously as part of the event loop processing. Libev always reaps all
1868children, even ones not watched. 2271children, even ones not watched.
1869 2272
1870=head3 Overriding the Built-In Processing 2273=head3 Overriding the Built-In Processing
1880=head3 Stopping the Child Watcher 2283=head3 Stopping the Child Watcher
1881 2284
1882Currently, the child watcher never gets stopped, even when the 2285Currently, the child watcher never gets stopped, even when the
1883child terminates, so normally one needs to stop the watcher in the 2286child terminates, so normally one needs to stop the watcher in the
1884callback. Future versions of libev might stop the watcher automatically 2287callback. Future versions of libev might stop the watcher automatically
1885when a child exit is detected. 2288when a child exit is detected (calling C<ev_child_stop> twice is not a
2289problem).
1886 2290
1887=head3 Watcher-Specific Functions and Data Members 2291=head3 Watcher-Specific Functions and Data Members
1888 2292
1889=over 4 2293=over 4
1890 2294
2216 // no longer anything immediate to do. 2620 // no longer anything immediate to do.
2217 } 2621 }
2218 2622
2219 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2623 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2220 ev_idle_init (idle_watcher, idle_cb); 2624 ev_idle_init (idle_watcher, idle_cb);
2221 ev_idle_start (loop, idle_cb); 2625 ev_idle_start (loop, idle_watcher);
2222 2626
2223 2627
2224=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2628=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2225 2629
2226Prepare and check watchers are usually (but not always) used in pairs: 2630Prepare and check watchers are usually (but not always) used in pairs:
2319 struct pollfd fds [nfd]; 2723 struct pollfd fds [nfd];
2320 // actual code will need to loop here and realloc etc. 2724 // actual code will need to loop here and realloc etc.
2321 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2725 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2322 2726
2323 /* the callback is illegal, but won't be called as we stop during check */ 2727 /* the callback is illegal, but won't be called as we stop during check */
2324 ev_timer_init (&tw, 0, timeout * 1e-3); 2728 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2325 ev_timer_start (loop, &tw); 2729 ev_timer_start (loop, &tw);
2326 2730
2327 // create one ev_io per pollfd 2731 // create one ev_io per pollfd
2328 for (int i = 0; i < nfd; ++i) 2732 for (int i = 0; i < nfd; ++i)
2329 { 2733 {
2559event loop blocks next and before C<ev_check> watchers are being called, 2963event loop blocks next and before C<ev_check> watchers are being called,
2560and only in the child after the fork. If whoever good citizen calling 2964and only in the child after the fork. If whoever good citizen calling
2561C<ev_default_fork> cheats and calls it in the wrong process, the fork 2965C<ev_default_fork> cheats and calls it in the wrong process, the fork
2562handlers will be invoked, too, of course. 2966handlers will be invoked, too, of course.
2563 2967
2968=head3 The special problem of life after fork - how is it possible?
2969
2970Most uses of C<fork()> consist of forking, then some simple calls to set
2971up/change the process environment, followed by a call to C<exec()>. This
2972sequence should be handled by libev without any problems.
2973
2974This changes when the application actually wants to do event handling
2975in the child, or both parent in child, in effect "continuing" after the
2976fork.
2977
2978The default mode of operation (for libev, with application help to detect
2979forks) is to duplicate all the state in the child, as would be expected
2980when I<either> the parent I<or> the child process continues.
2981
2982When both processes want to continue using libev, then this is usually the
2983wrong result. In that case, usually one process (typically the parent) is
2984supposed to continue with all watchers in place as before, while the other
2985process typically wants to start fresh, i.e. without any active watchers.
2986
2987The cleanest and most efficient way to achieve that with libev is to
2988simply create a new event loop, which of course will be "empty", and
2989use that for new watchers. This has the advantage of not touching more
2990memory than necessary, and thus avoiding the copy-on-write, and the
2991disadvantage of having to use multiple event loops (which do not support
2992signal watchers).
2993
2994When this is not possible, or you want to use the default loop for
2995other reasons, then in the process that wants to start "fresh", call
2996C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying
2997the default loop will "orphan" (not stop) all registered watchers, so you
2998have to be careful not to execute code that modifies those watchers. Note
2999also that in that case, you have to re-register any signal watchers.
3000
2564=head3 Watcher-Specific Functions and Data Members 3001=head3 Watcher-Specific Functions and Data Members
2565 3002
2566=over 4 3003=over 4
2567 3004
2568=item ev_fork_init (ev_signal *, callback) 3005=item ev_fork_init (ev_signal *, callback)
2572believe me. 3009believe me.
2573 3010
2574=back 3011=back
2575 3012
2576 3013
2577=head2 C<ev_async> - how to wake up another event loop 3014=head2 C<ev_async> - how to wake up an event loop
2578 3015
2579In general, you cannot use an C<ev_loop> from multiple threads or other 3016In general, you cannot use an C<ev_loop> from multiple threads or other
2580asynchronous sources such as signal handlers (as opposed to multiple event 3017asynchronous sources such as signal handlers (as opposed to multiple event
2581loops - those are of course safe to use in different threads). 3018loops - those are of course safe to use in different threads).
2582 3019
2583Sometimes, however, you need to wake up another event loop you do not 3020Sometimes, however, you need to wake up an event loop you do not control,
2584control, for example because it belongs to another thread. This is what 3021for example because it belongs to another thread. This is what C<ev_async>
2585C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3022watchers do: as long as the C<ev_async> watcher is active, you can signal
2586can signal it by calling C<ev_async_send>, which is thread- and signal 3023it by calling C<ev_async_send>, which is thread- and signal safe.
2587safe.
2588 3024
2589This functionality is very similar to C<ev_signal> watchers, as signals, 3025This functionality is very similar to C<ev_signal> watchers, as signals,
2590too, are asynchronous in nature, and signals, too, will be compressed 3026too, are asynchronous in nature, and signals, too, will be compressed
2591(i.e. the number of callback invocations may be less than the number of 3027(i.e. the number of callback invocations may be less than the number of
2592C<ev_async_sent> calls). 3028C<ev_async_sent> calls).
2597=head3 Queueing 3033=head3 Queueing
2598 3034
2599C<ev_async> does not support queueing of data in any way. The reason 3035C<ev_async> does not support queueing of data in any way. The reason
2600is that the author does not know of a simple (or any) algorithm for a 3036is that the author does not know of a simple (or any) algorithm for a
2601multiple-writer-single-reader queue that works in all cases and doesn't 3037multiple-writer-single-reader queue that works in all cases and doesn't
2602need elaborate support such as pthreads. 3038need elaborate support such as pthreads or unportable memory access
3039semantics.
2603 3040
2604That means that if you want to queue data, you have to provide your own 3041That means that if you want to queue data, you have to provide your own
2605queue. But at least I can tell you how to implement locking around your 3042queue. But at least I can tell you how to implement locking around your
2606queue: 3043queue:
2607 3044
2746 3183
2747If C<timeout> is less than 0, then no timeout watcher will be 3184If C<timeout> is less than 0, then no timeout watcher will be
2748started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3185started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2749repeat = 0) will be started. C<0> is a valid timeout. 3186repeat = 0) will be started. C<0> is a valid timeout.
2750 3187
2751The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3188The callback has the type C<void (*cb)(int revents, void *arg)> and is
2752passed an C<revents> set like normal event callbacks (a combination of 3189passed an C<revents> set like normal event callbacks (a combination of
2753C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3190C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2754value passed to C<ev_once>. Note that it is possible to receive I<both> 3191value passed to C<ev_once>. Note that it is possible to receive I<both>
2755a timeout and an io event at the same time - you probably should give io 3192a timeout and an io event at the same time - you probably should give io
2756events precedence. 3193events precedence.
2757 3194
2758Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3195Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2759 3196
2760 static void stdin_ready (int revents, void *arg) 3197 static void stdin_ready (int revents, void *arg)
2761 { 3198 {
2762 if (revents & EV_READ) 3199 if (revents & EV_READ)
2763 /* stdin might have data for us, joy! */; 3200 /* stdin might have data for us, joy! */;
2764 else if (revents & EV_TIMEOUT) 3201 else if (revents & EV_TIMER)
2765 /* doh, nothing entered */; 3202 /* doh, nothing entered */;
2766 } 3203 }
2767 3204
2768 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3205 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2769 3206
2770=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2771
2772Feeds the given event set into the event loop, as if the specified event
2773had happened for the specified watcher (which must be a pointer to an
2774initialised but not necessarily started event watcher).
2775
2776=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3207=item ev_feed_fd_event (loop, int fd, int revents)
2777 3208
2778Feed an event on the given fd, as if a file descriptor backend detected 3209Feed an event on the given fd, as if a file descriptor backend detected
2779the given events it. 3210the given events it.
2780 3211
2781=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3212=item ev_feed_signal_event (loop, int signum)
2782 3213
2783Feed an event as if the given signal occurred (C<loop> must be the default 3214Feed an event as if the given signal occurred (C<loop> must be the default
2784loop!). 3215loop!).
2785 3216
2786=back 3217=back
2866 3297
2867=over 4 3298=over 4
2868 3299
2869=item ev::TYPE::TYPE () 3300=item ev::TYPE::TYPE ()
2870 3301
2871=item ev::TYPE::TYPE (struct ev_loop *) 3302=item ev::TYPE::TYPE (loop)
2872 3303
2873=item ev::TYPE::~TYPE 3304=item ev::TYPE::~TYPE
2874 3305
2875The constructor (optionally) takes an event loop to associate the watcher 3306The constructor (optionally) takes an event loop to associate the watcher
2876with. If it is omitted, it will use C<EV_DEFAULT>. 3307with. If it is omitted, it will use C<EV_DEFAULT>.
2909 myclass obj; 3340 myclass obj;
2910 ev::io iow; 3341 ev::io iow;
2911 iow.set <myclass, &myclass::io_cb> (&obj); 3342 iow.set <myclass, &myclass::io_cb> (&obj);
2912 3343
2913=item w->set (object *) 3344=item w->set (object *)
2914
2915This is an B<experimental> feature that might go away in a future version.
2916 3345
2917This is a variation of a method callback - leaving out the method to call 3346This is a variation of a method callback - leaving out the method to call
2918will default the method to C<operator ()>, which makes it possible to use 3347will default the method to C<operator ()>, which makes it possible to use
2919functor objects without having to manually specify the C<operator ()> all 3348functor objects without having to manually specify the C<operator ()> all
2920the time. Incidentally, you can then also leave out the template argument 3349the time. Incidentally, you can then also leave out the template argument
2953Example: Use a plain function as callback. 3382Example: Use a plain function as callback.
2954 3383
2955 static void io_cb (ev::io &w, int revents) { } 3384 static void io_cb (ev::io &w, int revents) { }
2956 iow.set <io_cb> (); 3385 iow.set <io_cb> ();
2957 3386
2958=item w->set (struct ev_loop *) 3387=item w->set (loop)
2959 3388
2960Associates a different C<struct ev_loop> with this watcher. You can only 3389Associates a different C<struct ev_loop> with this watcher. You can only
2961do this when the watcher is inactive (and not pending either). 3390do this when the watcher is inactive (and not pending either).
2962 3391
2963=item w->set ([arguments]) 3392=item w->set ([arguments])
3060=item Ocaml 3489=item Ocaml
3061 3490
3062Erkki Seppala has written Ocaml bindings for libev, to be found at 3491Erkki Seppala has written Ocaml bindings for libev, to be found at
3063L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3492L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3064 3493
3494=item Lua
3495
3496Brian Maher has written a partial interface to libev for lua (at the
3497time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3498L<http://github.com/brimworks/lua-ev>.
3499
3065=back 3500=back
3066 3501
3067 3502
3068=head1 MACRO MAGIC 3503=head1 MACRO MAGIC
3069 3504
3222 libev.m4 3657 libev.m4
3223 3658
3224=head2 PREPROCESSOR SYMBOLS/MACROS 3659=head2 PREPROCESSOR SYMBOLS/MACROS
3225 3660
3226Libev can be configured via a variety of preprocessor symbols you have to 3661Libev can be configured via a variety of preprocessor symbols you have to
3227define before including any of its files. The default in the absence of 3662define before including (or compiling) any of its files. The default in
3228autoconf is documented for every option. 3663the absence of autoconf is documented for every option.
3664
3665Symbols marked with "(h)" do not change the ABI, and can have different
3666values when compiling libev vs. including F<ev.h>, so it is permissible
3667to redefine them before including F<ev.h> without breaking compatibility
3668to a compiled library. All other symbols change the ABI, which means all
3669users of libev and the libev code itself must be compiled with compatible
3670settings.
3229 3671
3230=over 4 3672=over 4
3231 3673
3232=item EV_STANDALONE 3674=item EV_STANDALONE (h)
3233 3675
3234Must always be C<1> if you do not use autoconf configuration, which 3676Must always be C<1> if you do not use autoconf configuration, which
3235keeps libev from including F<config.h>, and it also defines dummy 3677keeps libev from including F<config.h>, and it also defines dummy
3236implementations for some libevent functions (such as logging, which is not 3678implementations for some libevent functions (such as logging, which is not
3237supported). It will also not define any of the structs usually found in 3679supported). It will also not define any of the structs usually found in
3238F<event.h> that are not directly supported by the libev core alone. 3680F<event.h> that are not directly supported by the libev core alone.
3239 3681
3240In stanbdalone mode, libev will still try to automatically deduce the 3682In standalone mode, libev will still try to automatically deduce the
3241configuration, but has to be more conservative. 3683configuration, but has to be more conservative.
3242 3684
3243=item EV_USE_MONOTONIC 3685=item EV_USE_MONOTONIC
3244 3686
3245If defined to be C<1>, libev will try to detect the availability of the 3687If defined to be C<1>, libev will try to detect the availability of the
3310be used is the winsock select). This means that it will call 3752be used is the winsock select). This means that it will call
3311C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3753C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3312it is assumed that all these functions actually work on fds, even 3754it is assumed that all these functions actually work on fds, even
3313on win32. Should not be defined on non-win32 platforms. 3755on win32. Should not be defined on non-win32 platforms.
3314 3756
3315=item EV_FD_TO_WIN32_HANDLE 3757=item EV_FD_TO_WIN32_HANDLE(fd)
3316 3758
3317If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3759If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3318file descriptors to socket handles. When not defining this symbol (the 3760file descriptors to socket handles. When not defining this symbol (the
3319default), then libev will call C<_get_osfhandle>, which is usually 3761default), then libev will call C<_get_osfhandle>, which is usually
3320correct. In some cases, programs use their own file descriptor management, 3762correct. In some cases, programs use their own file descriptor management,
3321in which case they can provide this function to map fds to socket handles. 3763in which case they can provide this function to map fds to socket handles.
3764
3765=item EV_WIN32_HANDLE_TO_FD(handle)
3766
3767If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3768using the standard C<_open_osfhandle> function. For programs implementing
3769their own fd to handle mapping, overwriting this function makes it easier
3770to do so. This can be done by defining this macro to an appropriate value.
3771
3772=item EV_WIN32_CLOSE_FD(fd)
3773
3774If programs implement their own fd to handle mapping on win32, then this
3775macro can be used to override the C<close> function, useful to unregister
3776file descriptors again. Note that the replacement function has to close
3777the underlying OS handle.
3322 3778
3323=item EV_USE_POLL 3779=item EV_USE_POLL
3324 3780
3325If defined to be C<1>, libev will compile in support for the C<poll>(2) 3781If defined to be C<1>, libev will compile in support for the C<poll>(2)
3326backend. Otherwise it will be enabled on non-win32 platforms. It 3782backend. Otherwise it will be enabled on non-win32 platforms. It
3373as well as for signal and thread safety in C<ev_async> watchers. 3829as well as for signal and thread safety in C<ev_async> watchers.
3374 3830
3375In the absence of this define, libev will use C<sig_atomic_t volatile> 3831In the absence of this define, libev will use C<sig_atomic_t volatile>
3376(from F<signal.h>), which is usually good enough on most platforms. 3832(from F<signal.h>), which is usually good enough on most platforms.
3377 3833
3378=item EV_H 3834=item EV_H (h)
3379 3835
3380The name of the F<ev.h> header file used to include it. The default if 3836The name of the F<ev.h> header file used to include it. The default if
3381undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3837undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3382used to virtually rename the F<ev.h> header file in case of conflicts. 3838used to virtually rename the F<ev.h> header file in case of conflicts.
3383 3839
3384=item EV_CONFIG_H 3840=item EV_CONFIG_H (h)
3385 3841
3386If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3842If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3387F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3843F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3388C<EV_H>, above. 3844C<EV_H>, above.
3389 3845
3390=item EV_EVENT_H 3846=item EV_EVENT_H (h)
3391 3847
3392Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3848Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3393of how the F<event.h> header can be found, the default is C<"event.h">. 3849of how the F<event.h> header can be found, the default is C<"event.h">.
3394 3850
3395=item EV_PROTOTYPES 3851=item EV_PROTOTYPES (h)
3396 3852
3397If defined to be C<0>, then F<ev.h> will not define any function 3853If defined to be C<0>, then F<ev.h> will not define any function
3398prototypes, but still define all the structs and other symbols. This is 3854prototypes, but still define all the structs and other symbols. This is
3399occasionally useful if you want to provide your own wrapper functions 3855occasionally useful if you want to provide your own wrapper functions
3400around libev functions. 3856around libev functions.
3422fine. 3878fine.
3423 3879
3424If your embedding application does not need any priorities, defining these 3880If your embedding application does not need any priorities, defining these
3425both to C<0> will save some memory and CPU. 3881both to C<0> will save some memory and CPU.
3426 3882
3427=item EV_PERIODIC_ENABLE 3883=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
3884EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3885EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3428 3886
3429If undefined or defined to be C<1>, then periodic timers are supported. If 3887If undefined or defined to be C<1> (and the platform supports it), then
3430defined to be C<0>, then they are not. Disabling them saves a few kB of 3888the respective watcher type is supported. If defined to be C<0>, then it
3431code. 3889is not. Disabling watcher types mainly saves code size.
3432 3890
3433=item EV_IDLE_ENABLE 3891=item EV_FEATURES
3434
3435If undefined or defined to be C<1>, then idle watchers are supported. If
3436defined to be C<0>, then they are not. Disabling them saves a few kB of
3437code.
3438
3439=item EV_EMBED_ENABLE
3440
3441If undefined or defined to be C<1>, then embed watchers are supported. If
3442defined to be C<0>, then they are not. Embed watchers rely on most other
3443watcher types, which therefore must not be disabled.
3444
3445=item EV_STAT_ENABLE
3446
3447If undefined or defined to be C<1>, then stat watchers are supported. If
3448defined to be C<0>, then they are not.
3449
3450=item EV_FORK_ENABLE
3451
3452If undefined or defined to be C<1>, then fork watchers are supported. If
3453defined to be C<0>, then they are not.
3454
3455=item EV_ASYNC_ENABLE
3456
3457If undefined or defined to be C<1>, then async watchers are supported. If
3458defined to be C<0>, then they are not.
3459
3460=item EV_MINIMAL
3461 3892
3462If you need to shave off some kilobytes of code at the expense of some 3893If you need to shave off some kilobytes of code at the expense of some
3463speed, define this symbol to C<1>. Currently this is used to override some 3894speed (but with the full API), you can define this symbol to request
3464inlining decisions, saves roughly 30% code size on amd64. It also selects a 3895certain subsets of functionality. The default is to enable all features
3465much smaller 2-heap for timer management over the default 4-heap. 3896that can be enabled on the platform.
3897
3898A typical way to use this symbol is to define it to C<0> (or to a bitset
3899with some broad features you want) and then selectively re-enable
3900additional parts you want, for example if you want everything minimal,
3901but multiple event loop support, async and child watchers and the poll
3902backend, use this:
3903
3904 #define EV_FEATURES 0
3905 #define EV_MULTIPLICITY 1
3906 #define EV_USE_POLL 1
3907 #define EV_CHILD_ENABLE 1
3908 #define EV_ASYNC_ENABLE 1
3909
3910The actual value is a bitset, it can be a combination of the following
3911values:
3912
3913=over 4
3914
3915=item C<1> - faster/larger code
3916
3917Use larger code to speed up some operations.
3918
3919Currently this is used to override some inlining decisions (enlarging the
3920code size by roughly 30% on amd64).
3921
3922When optimising for size, use of compiler flags such as C<-Os> with
3923gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
3924assertions.
3925
3926=item C<2> - faster/larger data structures
3927
3928Replaces the small 2-heap for timer management by a faster 4-heap, larger
3929hash table sizes and so on. This will usually further increase code size
3930and can additionally have an effect on the size of data structures at
3931runtime.
3932
3933=item C<4> - full API configuration
3934
3935This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
3936enables multiplicity (C<EV_MULTIPLICITY>=1).
3937
3938=item C<8> - full API
3939
3940This enables a lot of the "lesser used" API functions. See C<ev.h> for
3941details on which parts of the API are still available without this
3942feature, and do not complain if this subset changes over time.
3943
3944=item C<16> - enable all optional watcher types
3945
3946Enables all optional watcher types. If you want to selectively enable
3947only some watcher types other than I/O and timers (e.g. prepare,
3948embed, async, child...) you can enable them manually by defining
3949C<EV_watchertype_ENABLE> to C<1> instead.
3950
3951=item C<32> - enable all backends
3952
3953This enables all backends - without this feature, you need to enable at
3954least one backend manually (C<EV_USE_SELECT> is a good choice).
3955
3956=item C<64> - enable OS-specific "helper" APIs
3957
3958Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
3959default.
3960
3961=back
3962
3963Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
3964reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
3965code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
3966watchers, timers and monotonic clock support.
3967
3968With an intelligent-enough linker (gcc+binutils are intelligent enough
3969when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
3970your program might be left out as well - a binary starting a timer and an
3971I/O watcher then might come out at only 5Kb.
3972
3973=item EV_AVOID_STDIO
3974
3975If this is set to C<1> at compiletime, then libev will avoid using stdio
3976functions (printf, scanf, perror etc.). This will increase the code size
3977somewhat, but if your program doesn't otherwise depend on stdio and your
3978libc allows it, this avoids linking in the stdio library which is quite
3979big.
3980
3981Note that error messages might become less precise when this option is
3982enabled.
3983
3984=item EV_NSIG
3985
3986The highest supported signal number, +1 (or, the number of
3987signals): Normally, libev tries to deduce the maximum number of signals
3988automatically, but sometimes this fails, in which case it can be
3989specified. Also, using a lower number than detected (C<32> should be
3990good for about any system in existence) can save some memory, as libev
3991statically allocates some 12-24 bytes per signal number.
3466 3992
3467=item EV_PID_HASHSIZE 3993=item EV_PID_HASHSIZE
3468 3994
3469C<ev_child> watchers use a small hash table to distribute workload by 3995C<ev_child> watchers use a small hash table to distribute workload by
3470pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 3996pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3471than enough. If you need to manage thousands of children you might want to 3997usually more than enough. If you need to manage thousands of children you
3472increase this value (I<must> be a power of two). 3998might want to increase this value (I<must> be a power of two).
3473 3999
3474=item EV_INOTIFY_HASHSIZE 4000=item EV_INOTIFY_HASHSIZE
3475 4001
3476C<ev_stat> watchers use a small hash table to distribute workload by 4002C<ev_stat> watchers use a small hash table to distribute workload by
3477inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4003inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3478usually more than enough. If you need to manage thousands of C<ev_stat> 4004disabled), usually more than enough. If you need to manage thousands of
3479watchers you might want to increase this value (I<must> be a power of 4005C<ev_stat> watchers you might want to increase this value (I<must> be a
3480two). 4006power of two).
3481 4007
3482=item EV_USE_4HEAP 4008=item EV_USE_4HEAP
3483 4009
3484Heaps are not very cache-efficient. To improve the cache-efficiency of the 4010Heaps are not very cache-efficient. To improve the cache-efficiency of the
3485timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4011timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3486to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4012to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3487faster performance with many (thousands) of watchers. 4013faster performance with many (thousands) of watchers.
3488 4014
3489The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4015The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3490(disabled). 4016will be C<0>.
3491 4017
3492=item EV_HEAP_CACHE_AT 4018=item EV_HEAP_CACHE_AT
3493 4019
3494Heaps are not very cache-efficient. To improve the cache-efficiency of the 4020Heaps are not very cache-efficient. To improve the cache-efficiency of the
3495timer and periodics heaps, libev can cache the timestamp (I<at>) within 4021timer and periodics heaps, libev can cache the timestamp (I<at>) within
3496the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4022the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3497which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4023which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3498but avoids random read accesses on heap changes. This improves performance 4024but avoids random read accesses on heap changes. This improves performance
3499noticeably with many (hundreds) of watchers. 4025noticeably with many (hundreds) of watchers.
3500 4026
3501The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4027The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3502(disabled). 4028will be C<0>.
3503 4029
3504=item EV_VERIFY 4030=item EV_VERIFY
3505 4031
3506Controls how much internal verification (see C<ev_loop_verify ()>) will 4032Controls how much internal verification (see C<ev_loop_verify ()>) will
3507be done: If set to C<0>, no internal verification code will be compiled 4033be done: If set to C<0>, no internal verification code will be compiled
3509called. If set to C<2>, then the internal verification code will be 4035called. If set to C<2>, then the internal verification code will be
3510called once per loop, which can slow down libev. If set to C<3>, then the 4036called once per loop, which can slow down libev. If set to C<3>, then the
3511verification code will be called very frequently, which will slow down 4037verification code will be called very frequently, which will slow down
3512libev considerably. 4038libev considerably.
3513 4039
3514The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4040The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3515C<0>. 4041will be C<0>.
3516 4042
3517=item EV_COMMON 4043=item EV_COMMON
3518 4044
3519By default, all watchers have a C<void *data> member. By redefining 4045By default, all watchers have a C<void *data> member. By redefining
3520this macro to a something else you can include more and other types of 4046this macro to something else you can include more and other types of
3521members. You have to define it each time you include one of the files, 4047members. You have to define it each time you include one of the files,
3522though, and it must be identical each time. 4048though, and it must be identical each time.
3523 4049
3524For example, the perl EV module uses something like this: 4050For example, the perl EV module uses something like this:
3525 4051
3578file. 4104file.
3579 4105
3580The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4106The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3581that everybody includes and which overrides some configure choices: 4107that everybody includes and which overrides some configure choices:
3582 4108
3583 #define EV_MINIMAL 1 4109 #define EV_FEATURES 8
3584 #define EV_USE_POLL 0 4110 #define EV_USE_SELECT 1
3585 #define EV_MULTIPLICITY 0
3586 #define EV_PERIODIC_ENABLE 0 4111 #define EV_PREPARE_ENABLE 1
4112 #define EV_IDLE_ENABLE 1
3587 #define EV_STAT_ENABLE 0 4113 #define EV_SIGNAL_ENABLE 1
3588 #define EV_FORK_ENABLE 0 4114 #define EV_CHILD_ENABLE 1
4115 #define EV_USE_STDEXCEPT 0
3589 #define EV_CONFIG_H <config.h> 4116 #define EV_CONFIG_H <config.h>
3590 #define EV_MINPRI 0
3591 #define EV_MAXPRI 0
3592 4117
3593 #include "ev++.h" 4118 #include "ev++.h"
3594 4119
3595And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4120And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3596 4121
3656default loop and triggering an C<ev_async> watcher from the default loop 4181default loop and triggering an C<ev_async> watcher from the default loop
3657watcher callback into the event loop interested in the signal. 4182watcher callback into the event loop interested in the signal.
3658 4183
3659=back 4184=back
3660 4185
4186=head4 THREAD LOCKING EXAMPLE
4187
4188Here is a fictitious example of how to run an event loop in a different
4189thread than where callbacks are being invoked and watchers are
4190created/added/removed.
4191
4192For a real-world example, see the C<EV::Loop::Async> perl module,
4193which uses exactly this technique (which is suited for many high-level
4194languages).
4195
4196The example uses a pthread mutex to protect the loop data, a condition
4197variable to wait for callback invocations, an async watcher to notify the
4198event loop thread and an unspecified mechanism to wake up the main thread.
4199
4200First, you need to associate some data with the event loop:
4201
4202 typedef struct {
4203 mutex_t lock; /* global loop lock */
4204 ev_async async_w;
4205 thread_t tid;
4206 cond_t invoke_cv;
4207 } userdata;
4208
4209 void prepare_loop (EV_P)
4210 {
4211 // for simplicity, we use a static userdata struct.
4212 static userdata u;
4213
4214 ev_async_init (&u->async_w, async_cb);
4215 ev_async_start (EV_A_ &u->async_w);
4216
4217 pthread_mutex_init (&u->lock, 0);
4218 pthread_cond_init (&u->invoke_cv, 0);
4219
4220 // now associate this with the loop
4221 ev_set_userdata (EV_A_ u);
4222 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4223 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4224
4225 // then create the thread running ev_loop
4226 pthread_create (&u->tid, 0, l_run, EV_A);
4227 }
4228
4229The callback for the C<ev_async> watcher does nothing: the watcher is used
4230solely to wake up the event loop so it takes notice of any new watchers
4231that might have been added:
4232
4233 static void
4234 async_cb (EV_P_ ev_async *w, int revents)
4235 {
4236 // just used for the side effects
4237 }
4238
4239The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4240protecting the loop data, respectively.
4241
4242 static void
4243 l_release (EV_P)
4244 {
4245 userdata *u = ev_userdata (EV_A);
4246 pthread_mutex_unlock (&u->lock);
4247 }
4248
4249 static void
4250 l_acquire (EV_P)
4251 {
4252 userdata *u = ev_userdata (EV_A);
4253 pthread_mutex_lock (&u->lock);
4254 }
4255
4256The event loop thread first acquires the mutex, and then jumps straight
4257into C<ev_loop>:
4258
4259 void *
4260 l_run (void *thr_arg)
4261 {
4262 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4263
4264 l_acquire (EV_A);
4265 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4266 ev_loop (EV_A_ 0);
4267 l_release (EV_A);
4268
4269 return 0;
4270 }
4271
4272Instead of invoking all pending watchers, the C<l_invoke> callback will
4273signal the main thread via some unspecified mechanism (signals? pipe
4274writes? C<Async::Interrupt>?) and then waits until all pending watchers
4275have been called (in a while loop because a) spurious wakeups are possible
4276and b) skipping inter-thread-communication when there are no pending
4277watchers is very beneficial):
4278
4279 static void
4280 l_invoke (EV_P)
4281 {
4282 userdata *u = ev_userdata (EV_A);
4283
4284 while (ev_pending_count (EV_A))
4285 {
4286 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4287 pthread_cond_wait (&u->invoke_cv, &u->lock);
4288 }
4289 }
4290
4291Now, whenever the main thread gets told to invoke pending watchers, it
4292will grab the lock, call C<ev_invoke_pending> and then signal the loop
4293thread to continue:
4294
4295 static void
4296 real_invoke_pending (EV_P)
4297 {
4298 userdata *u = ev_userdata (EV_A);
4299
4300 pthread_mutex_lock (&u->lock);
4301 ev_invoke_pending (EV_A);
4302 pthread_cond_signal (&u->invoke_cv);
4303 pthread_mutex_unlock (&u->lock);
4304 }
4305
4306Whenever you want to start/stop a watcher or do other modifications to an
4307event loop, you will now have to lock:
4308
4309 ev_timer timeout_watcher;
4310 userdata *u = ev_userdata (EV_A);
4311
4312 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4313
4314 pthread_mutex_lock (&u->lock);
4315 ev_timer_start (EV_A_ &timeout_watcher);
4316 ev_async_send (EV_A_ &u->async_w);
4317 pthread_mutex_unlock (&u->lock);
4318
4319Note that sending the C<ev_async> watcher is required because otherwise
4320an event loop currently blocking in the kernel will have no knowledge
4321about the newly added timer. By waking up the loop it will pick up any new
4322watchers in the next event loop iteration.
4323
3661=head3 COROUTINES 4324=head3 COROUTINES
3662 4325
3663Libev is very accommodating to coroutines ("cooperative threads"): 4326Libev is very accommodating to coroutines ("cooperative threads"):
3664libev fully supports nesting calls to its functions from different 4327libev fully supports nesting calls to its functions from different
3665coroutines (e.g. you can call C<ev_loop> on the same loop from two 4328coroutines (e.g. you can call C<ev_loop> on the same loop from two
3666different coroutines, and switch freely between both coroutines running the 4329different coroutines, and switch freely between both coroutines running
3667loop, as long as you don't confuse yourself). The only exception is that 4330the loop, as long as you don't confuse yourself). The only exception is
3668you must not do this from C<ev_periodic> reschedule callbacks. 4331that you must not do this from C<ev_periodic> reschedule callbacks.
3669 4332
3670Care has been taken to ensure that libev does not keep local state inside 4333Care has been taken to ensure that libev does not keep local state inside
3671C<ev_loop>, and other calls do not usually allow for coroutine switches as 4334C<ev_loop>, and other calls do not usually allow for coroutine switches as
3672they do not call any callbacks. 4335they do not call any callbacks.
3673 4336
3687maintainable. 4350maintainable.
3688 4351
3689And of course, some compiler warnings are just plain stupid, or simply 4352And of course, some compiler warnings are just plain stupid, or simply
3690wrong (because they don't actually warn about the condition their message 4353wrong (because they don't actually warn about the condition their message
3691seems to warn about). For example, certain older gcc versions had some 4354seems to warn about). For example, certain older gcc versions had some
3692warnings that resulted an extreme number of false positives. These have 4355warnings that resulted in an extreme number of false positives. These have
3693been fixed, but some people still insist on making code warn-free with 4356been fixed, but some people still insist on making code warn-free with
3694such buggy versions. 4357such buggy versions.
3695 4358
3696While libev is written to generate as few warnings as possible, 4359While libev is written to generate as few warnings as possible,
3697"warn-free" code is not a goal, and it is recommended not to build libev 4360"warn-free" code is not a goal, and it is recommended not to build libev
3733I suggest using suppression lists. 4396I suggest using suppression lists.
3734 4397
3735 4398
3736=head1 PORTABILITY NOTES 4399=head1 PORTABILITY NOTES
3737 4400
4401=head2 GNU/LINUX 32 BIT LIMITATIONS
4402
4403GNU/Linux is the only common platform that supports 64 bit file/large file
4404interfaces but I<disables> them by default.
4405
4406That means that libev compiled in the default environment doesn't support
4407files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4408
4409Unfortunately, many programs try to work around this GNU/Linux issue
4410by enabling the large file API, which makes them incompatible with the
4411standard libev compiled for their system.
4412
4413Likewise, libev cannot enable the large file API itself as this would
4414suddenly make it incompatible to the default compile time environment,
4415i.e. all programs not using special compile switches.
4416
4417=head2 OS/X AND DARWIN BUGS
4418
4419The whole thing is a bug if you ask me - basically any system interface
4420you touch is broken, whether it is locales, poll, kqueue or even the
4421OpenGL drivers.
4422
4423=head3 C<kqueue> is buggy
4424
4425The kqueue syscall is broken in all known versions - most versions support
4426only sockets, many support pipes.
4427
4428=head3 C<poll> is buggy
4429
4430Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4431implementation by something calling C<kqueue> internally around the 10.5.6
4432release, so now C<kqueue> I<and> C<poll> are broken.
4433
4434Libev tries to work around this by neither using C<kqueue> nor C<poll> by
4435default on this rotten platform, but of course you cna still ask for them
4436when creating a loop.
4437
4438=head3 C<select> is buggy
4439
4440All that's left is C<select>, and of course Apple found a way to fuck this
4441one up as well: On OS/X, C<select> actively limits the number of file
4442descriptors you can pass in to 1024 - your program suddenyl crashes when
4443you use more.
4444
4445There is an undocumented "workaround" for this - defining
4446C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4447work on OS/X.
4448
4449=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4450
4451=head3 C<errno> reentrancy
4452
4453The default compile environment on Solaris is unfortunately so
4454thread-unsafe that you can't even use components/libraries compiled
4455without C<-D_REENTRANT> (as long as they use C<errno>), which, of course,
4456isn't defined by default.
4457
4458If you want to use libev in threaded environments you have to make sure
4459it's compiled with C<_REENTRANT> defined.
4460
4461=head3 Event port backend
4462
4463The scalable event interface for Solaris is called "event ports". Unfortunately,
4464this mechanism is very buggy. If you run into high CPU usage, your program
4465freezes or you get a large number of spurious wakeups, make sure you have
4466all the relevant and latest kernel patches applied. No, I don't know which
4467ones, but there are multiple ones.
4468
4469If you can't get it to work, you can try running the program with
4470C<LIBEV_FLAGS=3> to only allow C<poll> and C<select> backends.
4471
4472=head2 AIX POLL BUG
4473
4474AIX unfortunately has a broken C<poll.h> header. Libev works around
4475this by trying to avoid the poll backend altogether (i.e. it's not even
4476compiled in), which normally isn't a big problem as C<select> works fine
4477with large bitsets, and AIX is dead anyway.
4478
3738=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4479=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4480
4481=head3 General issues
3739 4482
3740Win32 doesn't support any of the standards (e.g. POSIX) that libev 4483Win32 doesn't support any of the standards (e.g. POSIX) that libev
3741requires, and its I/O model is fundamentally incompatible with the POSIX 4484requires, and its I/O model is fundamentally incompatible with the POSIX
3742model. Libev still offers limited functionality on this platform in 4485model. Libev still offers limited functionality on this platform in
3743the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4486the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3744descriptors. This only applies when using Win32 natively, not when using 4487descriptors. This only applies when using Win32 natively, not when using
3745e.g. cygwin. 4488e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4489as every compielr comes with a slightly differently broken/incompatible
4490environment.
3746 4491
3747Lifting these limitations would basically require the full 4492Lifting these limitations would basically require the full
3748re-implementation of the I/O system. If you are into these kinds of 4493re-implementation of the I/O system. If you are into this kind of thing,
3749things, then note that glib does exactly that for you in a very portable 4494then note that glib does exactly that for you in a very portable way (note
3750way (note also that glib is the slowest event library known to man). 4495also that glib is the slowest event library known to man).
3751 4496
3752There is no supported compilation method available on windows except 4497There is no supported compilation method available on windows except
3753embedding it into other applications. 4498embedding it into other applications.
4499
4500Sensible signal handling is officially unsupported by Microsoft - libev
4501tries its best, but under most conditions, signals will simply not work.
3754 4502
3755Not a libev limitation but worth mentioning: windows apparently doesn't 4503Not a libev limitation but worth mentioning: windows apparently doesn't
3756accept large writes: instead of resulting in a partial write, windows will 4504accept large writes: instead of resulting in a partial write, windows will
3757either accept everything or return C<ENOBUFS> if the buffer is too large, 4505either accept everything or return C<ENOBUFS> if the buffer is too large,
3758so make sure you only write small amounts into your sockets (less than a 4506so make sure you only write small amounts into your sockets (less than a
3763the abysmal performance of winsockets, using a large number of sockets 4511the abysmal performance of winsockets, using a large number of sockets
3764is not recommended (and not reasonable). If your program needs to use 4512is not recommended (and not reasonable). If your program needs to use
3765more than a hundred or so sockets, then likely it needs to use a totally 4513more than a hundred or so sockets, then likely it needs to use a totally
3766different implementation for windows, as libev offers the POSIX readiness 4514different implementation for windows, as libev offers the POSIX readiness
3767notification model, which cannot be implemented efficiently on windows 4515notification model, which cannot be implemented efficiently on windows
3768(Microsoft monopoly games). 4516(due to Microsoft monopoly games).
3769 4517
3770A typical way to use libev under windows is to embed it (see the embedding 4518A typical way to use libev under windows is to embed it (see the embedding
3771section for details) and use the following F<evwrap.h> header file instead 4519section for details) and use the following F<evwrap.h> header file instead
3772of F<ev.h>: 4520of F<ev.h>:
3773 4521
3780you do I<not> compile the F<ev.c> or any other embedded source files!): 4528you do I<not> compile the F<ev.c> or any other embedded source files!):
3781 4529
3782 #include "evwrap.h" 4530 #include "evwrap.h"
3783 #include "ev.c" 4531 #include "ev.c"
3784 4532
3785=over 4
3786
3787=item The winsocket select function 4533=head3 The winsocket C<select> function
3788 4534
3789The winsocket C<select> function doesn't follow POSIX in that it 4535The winsocket C<select> function doesn't follow POSIX in that it
3790requires socket I<handles> and not socket I<file descriptors> (it is 4536requires socket I<handles> and not socket I<file descriptors> (it is
3791also extremely buggy). This makes select very inefficient, and also 4537also extremely buggy). This makes select very inefficient, and also
3792requires a mapping from file descriptors to socket handles (the Microsoft 4538requires a mapping from file descriptors to socket handles (the Microsoft
3801 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4547 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3802 4548
3803Note that winsockets handling of fd sets is O(n), so you can easily get a 4549Note that winsockets handling of fd sets is O(n), so you can easily get a
3804complexity in the O(n²) range when using win32. 4550complexity in the O(n²) range when using win32.
3805 4551
3806=item Limited number of file descriptors 4552=head3 Limited number of file descriptors
3807 4553
3808Windows has numerous arbitrary (and low) limits on things. 4554Windows has numerous arbitrary (and low) limits on things.
3809 4555
3810Early versions of winsocket's select only supported waiting for a maximum 4556Early versions of winsocket's select only supported waiting for a maximum
3811of C<64> handles (probably owning to the fact that all windows kernels 4557of C<64> handles (probably owning to the fact that all windows kernels
3812can only wait for C<64> things at the same time internally; Microsoft 4558can only wait for C<64> things at the same time internally; Microsoft
3813recommends spawning a chain of threads and wait for 63 handles and the 4559recommends spawning a chain of threads and wait for 63 handles and the
3814previous thread in each. Great). 4560previous thread in each. Sounds great!).
3815 4561
3816Newer versions support more handles, but you need to define C<FD_SETSIZE> 4562Newer versions support more handles, but you need to define C<FD_SETSIZE>
3817to some high number (e.g. C<2048>) before compiling the winsocket select 4563to some high number (e.g. C<2048>) before compiling the winsocket select
3818call (which might be in libev or elsewhere, for example, perl does its own 4564call (which might be in libev or elsewhere, for example, perl and many
3819select emulation on windows). 4565other interpreters do their own select emulation on windows).
3820 4566
3821Another limit is the number of file descriptors in the Microsoft runtime 4567Another limit is the number of file descriptors in the Microsoft runtime
3822libraries, which by default is C<64> (there must be a hidden I<64> fetish 4568libraries, which by default is C<64> (there must be a hidden I<64>
3823or something like this inside Microsoft). You can increase this by calling 4569fetish or something like this inside Microsoft). You can increase this
3824C<_setmaxstdio>, which can increase this limit to C<2048> (another 4570by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3825arbitrary limit), but is broken in many versions of the Microsoft runtime 4571(another arbitrary limit), but is broken in many versions of the Microsoft
3826libraries.
3827
3828This might get you to about C<512> or C<2048> sockets (depending on 4572runtime libraries. This might get you to about C<512> or C<2048> sockets
3829windows version and/or the phase of the moon). To get more, you need to 4573(depending on windows version and/or the phase of the moon). To get more,
3830wrap all I/O functions and provide your own fd management, but the cost of 4574you need to wrap all I/O functions and provide your own fd management, but
3831calling select (O(n²)) will likely make this unworkable. 4575the cost of calling select (O(n²)) will likely make this unworkable.
3832
3833=back
3834 4576
3835=head2 PORTABILITY REQUIREMENTS 4577=head2 PORTABILITY REQUIREMENTS
3836 4578
3837In addition to a working ISO-C implementation and of course the 4579In addition to a working ISO-C implementation and of course the
3838backend-specific APIs, libev relies on a few additional extensions: 4580backend-specific APIs, libev relies on a few additional extensions:
3879=item C<double> must hold a time value in seconds with enough accuracy 4621=item C<double> must hold a time value in seconds with enough accuracy
3880 4622
3881The type C<double> is used to represent timestamps. It is required to 4623The type C<double> is used to represent timestamps. It is required to
3882have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4624have at least 51 bits of mantissa (and 9 bits of exponent), which is good
3883enough for at least into the year 4000. This requirement is fulfilled by 4625enough for at least into the year 4000. This requirement is fulfilled by
3884implementations implementing IEEE 754 (basically all existing ones). 4626implementations implementing IEEE 754, which is basically all existing
4627ones. With IEEE 754 doubles, you get microsecond accuracy until at least
46282200.
3885 4629
3886=back 4630=back
3887 4631
3888If you know of other additional requirements drop me a note. 4632If you know of other additional requirements drop me a note.
3889 4633
3957involves iterating over all running async watchers or all signal numbers. 4701involves iterating over all running async watchers or all signal numbers.
3958 4702
3959=back 4703=back
3960 4704
3961 4705
4706=head1 PORTING FROM LIBEV 3.X TO 4.X
4707
4708The major version 4 introduced some minor incompatible changes to the API.
4709
4710At the moment, the C<ev.h> header file tries to implement superficial
4711compatibility, so most programs should still compile. Those might be
4712removed in later versions of libev, so better update early than late.
4713
4714=over 4
4715
4716=item C<ev_loop_count> renamed to C<ev_iteration>
4717
4718=item C<ev_loop_depth> renamed to C<ev_depth>
4719
4720=item C<ev_loop_verify> renamed to C<ev_verify>
4721
4722Most functions working on C<struct ev_loop> objects don't have an
4723C<ev_loop_> prefix, so it was removed. Note that C<ev_loop_fork> is
4724still called C<ev_loop_fork> because it would otherwise clash with the
4725C<ev_fork> typedef.
4726
4727=item C<EV_TIMEOUT> renamed to C<EV_TIMER> in C<revents>
4728
4729This is a simple rename - all other watcher types use their name
4730as revents flag, and now C<ev_timer> does, too.
4731
4732Both C<EV_TIMER> and C<EV_TIMEOUT> symbols were present in 3.x versions
4733and continue to be present for the foreseeable future, so this is mostly a
4734documentation change.
4735
4736=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4737
4738The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4739mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4740and work, but the library code will of course be larger.
4741
4742=back
4743
4744
4745=head1 GLOSSARY
4746
4747=over 4
4748
4749=item active
4750
4751A watcher is active as long as it has been started (has been attached to
4752an event loop) but not yet stopped (disassociated from the event loop).
4753
4754=item application
4755
4756In this document, an application is whatever is using libev.
4757
4758=item callback
4759
4760The address of a function that is called when some event has been
4761detected. Callbacks are being passed the event loop, the watcher that
4762received the event, and the actual event bitset.
4763
4764=item callback invocation
4765
4766The act of calling the callback associated with a watcher.
4767
4768=item event
4769
4770A change of state of some external event, such as data now being available
4771for reading on a file descriptor, time having passed or simply not having
4772any other events happening anymore.
4773
4774In libev, events are represented as single bits (such as C<EV_READ> or
4775C<EV_TIMER>).
4776
4777=item event library
4778
4779A software package implementing an event model and loop.
4780
4781=item event loop
4782
4783An entity that handles and processes external events and converts them
4784into callback invocations.
4785
4786=item event model
4787
4788The model used to describe how an event loop handles and processes
4789watchers and events.
4790
4791=item pending
4792
4793A watcher is pending as soon as the corresponding event has been detected,
4794and stops being pending as soon as the watcher will be invoked or its
4795pending status is explicitly cleared by the application.
4796
4797A watcher can be pending, but not active. Stopping a watcher also clears
4798its pending status.
4799
4800=item real time
4801
4802The physical time that is observed. It is apparently strictly monotonic :)
4803
4804=item wall-clock time
4805
4806The time and date as shown on clocks. Unlike real time, it can actually
4807be wrong and jump forwards and backwards, e.g. when the you adjust your
4808clock.
4809
4810=item watcher
4811
4812A data structure that describes interest in certain events. Watchers need
4813to be started (attached to an event loop) before they can receive events.
4814
4815=item watcher invocation
4816
4817The act of calling the callback associated with a watcher.
4818
4819=back
4820
3962=head1 AUTHOR 4821=head1 AUTHOR
3963 4822
3964Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 4823Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3965 4824

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines