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

Comparing libev/ev.pod (file contents):
Revision 1.239 by root, Tue Apr 21 14:14:19 2009 UTC vs.
Revision 1.321 by sf-exg, Fri Oct 22 10:50:24 2010 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines