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

Comparing libev/ev.pod (file contents):
Revision 1.247 by root, Wed Jul 8 02:46:05 2009 UTC vs.
Revision 1.319 by root, Fri Oct 22 10:09:12 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 interetsing 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 ABI mismatches :).
196 199
197 assert (("libev version mismatch", 200 assert (("libev version mismatch",
198 ev_version_major () == EV_VERSION_MAJOR 201 ev_version_major () == EV_VERSION_MAJOR
199 && ev_version_minor () >= EV_VERSION_MINOR)); 202 && ev_version_minor () >= EV_VERSION_MINOR));
200 203
211 assert (("sorry, no epoll, no sex", 214 assert (("sorry, no epoll, no sex",
212 ev_supported_backends () & EVBACKEND_EPOLL)); 215 ev_supported_backends () & EVBACKEND_EPOLL));
213 216
214=item unsigned int ev_recommended_backends () 217=item unsigned int ev_recommended_backends ()
215 218
216Return the set of all backends compiled into this binary of libev and also 219Return the set of all backends compiled into this binary of libev and
217recommended for this platform. This set is often smaller than the one 220also recommended for this platform, meaning it will work for most file
221descriptor types. This set is often smaller than the one returned by
218returned by C<ev_supported_backends>, as for example kqueue is broken on 222C<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 223and 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 224you know what you are doing). This is the set of backends that libev will
221libev will probe for if you specify no backends explicitly. 225probe for if you specify no backends explicitly.
222 226
223=item unsigned int ev_embeddable_backends () 227=item unsigned int ev_embeddable_backends ()
224 228
225Returns the set of backends that are embeddable in other event loops. This 229Returns the set of backends that are embeddable in other event loops. This
226is the theoretical, all-platform, value. To find which backends 230value is platform-specific but can include backends not available on the
227might be supported on the current system, you would need to look at 231current system. To find which embeddable backends might be supported on
228C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for 232the current system, you would need to look at C<ev_embeddable_backends ()
229recommended ones. 233& ev_supported_backends ()>, likewise for recommended ones.
230 234
231See the description of C<ev_embed> watchers for more info. 235See the description of C<ev_embed> watchers for more info.
232 236
233=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] 237=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]
234 238
290 294
291=back 295=back
292 296
293=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 297=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
294 298
295An event loop is described by a C<struct ev_loop *> (the C<struct> 299An 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> 300I<not> optional in this case unless libev 3 compatibility is disabled, as
297I<function>). 301libev 3 had an C<ev_loop> function colliding with the struct name).
298 302
299The library knows two types of such loops, the I<default> loop, which 303The library knows two types of such loops, the I<default> loop, which
300supports signals and child events, and dynamically created loops which do 304supports signals and child events, and dynamically created event loops
301not. 305which do not.
302 306
303=over 4 307=over 4
304 308
305=item struct ev_loop *ev_default_loop (unsigned int flags) 309=item struct ev_loop *ev_default_loop (unsigned int flags)
306 310
344useful to try out specific backends to test their performance, or to work 348useful to try out specific backends to test their performance, or to work
345around bugs. 349around bugs.
346 350
347=item C<EVFLAG_FORKCHECK> 351=item C<EVFLAG_FORKCHECK>
348 352
349Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after 353Instead 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 354make libev check for a fork in each iteration by enabling this flag.
351enabling this flag.
352 355
353This works by calling C<getpid ()> on every iteration of the loop, 356This 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 357and 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 358iterations 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 359GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
362flag. 365flag.
363 366
364This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 367This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
365environment variable. 368environment variable.
366 369
370=item C<EVFLAG_NOINOTIFY>
371
372When this flag is specified, then libev will not attempt to use the
373I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
374testing, this flag can be useful to conserve inotify file descriptors, as
375otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
376
377=item C<EVFLAG_SIGNALFD>
378
379When this flag is specified, then libev will attempt to use the
380I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
381delivers signals synchronously, which makes it both faster and might make
382it possible to get the queued signal data. It can also simplify signal
383handling with threads, as long as you properly block signals in your
384threads that are not interested in handling them.
385
386Signalfd will not be used by default as this changes your signal mask, and
387there are a lot of shoddy libraries and programs (glib's threadpool for
388example) that can't properly initialise their signal masks.
389
367=item C<EVBACKEND_SELECT> (value 1, portable select backend) 390=item C<EVBACKEND_SELECT> (value 1, portable select backend)
368 391
369This is your standard select(2) backend. Not I<completely> standard, as 392This 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, 393libev 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 394but if that fails, expect a fairly low limit on the number of fds when
394 417
395This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 418This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
396C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 419C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
397 420
398=item C<EVBACKEND_EPOLL> (value 4, Linux) 421=item C<EVBACKEND_EPOLL> (value 4, Linux)
422
423Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
424kernels).
399 425
400For few fds, this backend is a bit little slower than poll and select, 426For few fds, this backend is a bit little slower than poll and select,
401but it scales phenomenally better. While poll and select usually scale 427but 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), 428like O(total_fds) where n is the total number of fds (or the highest fd),
403epoll scales either O(1) or O(active_fds). 429epoll scales either O(1) or O(active_fds).
415of course I<doesn't>, and epoll just loves to report events for totally 441of course I<doesn't>, and epoll just loves to report events for totally
416I<different> file descriptors (even already closed ones, so one cannot 442I<different> file descriptors (even already closed ones, so one cannot
417even remove them from the set) than registered in the set (especially 443even remove them from the set) than registered in the set (especially
418on SMP systems). Libev tries to counter these spurious notifications by 444on SMP systems). Libev tries to counter these spurious notifications by
419employing an additional generation counter and comparing that against the 445employing an additional generation counter and comparing that against the
420events to filter out spurious ones, recreating the set when required. 446events to filter out spurious ones, recreating the set when required. Last
447not least, it also refuses to work with some file descriptors which work
448perfectly fine with C<select> (files, many character devices...).
421 449
422While stopping, setting and starting an I/O watcher in the same iteration 450While 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 451will result in some caching, there is still a system call per such
424incident (because the same I<file descriptor> could point to a different 452incident (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 453I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
518 546
519It is definitely not recommended to use this flag. 547It is definitely not recommended to use this flag.
520 548
521=back 549=back
522 550
523If one or more of these are or'ed into the flags value, then only these 551If 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 552then only these backends will be tried (in the reverse order as listed
525specified, all backends in C<ev_recommended_backends ()> will be tried. 553here). If none are specified, all backends in C<ev_recommended_backends
554()> will be tried.
526 555
527Example: This is the most typical usage. 556Example: This is the most typical usage.
528 557
529 if (!ev_default_loop (0)) 558 if (!ev_default_loop (0))
530 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 559 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
542 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 571 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
543 572
544=item struct ev_loop *ev_loop_new (unsigned int flags) 573=item struct ev_loop *ev_loop_new (unsigned int flags)
545 574
546Similar to C<ev_default_loop>, but always creates a new event loop that is 575Similar 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 576always 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 577
551Note that this function I<is> thread-safe, and the recommended way to use 578Note 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 579libev with threads is indeed to create one loop per thread, and using the
553default loop in the "main" or "initial" thread. 580default loop in the "main" or "initial" thread.
554 581
555Example: Try to create a event loop that uses epoll and nothing else. 582Example: Try to create a event loop that uses epoll and nothing else.
556 583
558 if (!epoller) 585 if (!epoller)
559 fatal ("no epoll found here, maybe it hides under your chair"); 586 fatal ("no epoll found here, maybe it hides under your chair");
560 587
561=item ev_default_destroy () 588=item ev_default_destroy ()
562 589
563Destroys the default loop again (frees all memory and kernel state 590Destroys the default loop (frees all memory and kernel state etc.). None
564etc.). None of the active event watchers will be stopped in the normal 591of 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 592e.g. C<ev_is_active> might still return true. It is your responsibility to
566responsibility to either stop all watchers cleanly yourself I<before> 593either stop all watchers cleanly yourself I<before> calling this function,
567calling this function, or cope with the fact afterwards (which is usually 594or 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 595can just ignore the watchers and/or C<free ()> them for example).
569for example).
570 596
571Note that certain global state, such as signal state (and installed signal 597Note that certain global state, such as signal state (and installed signal
572handlers), will not be freed by this function, and related watchers (such 598handlers), will not be freed by this function, and related watchers (such
573as signal and child watchers) would need to be stopped manually. 599as signal and child watchers) would need to be stopped manually.
574 600
575In general it is not advisable to call this function except in the 601In 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 602rare 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 603pipe fds. If you need dynamically allocated loops it is better to use
578C<ev_loop_new> and C<ev_loop_destroy>). 604C<ev_loop_new> and C<ev_loop_destroy>.
579 605
580=item ev_loop_destroy (loop) 606=item ev_loop_destroy (loop)
581 607
582Like C<ev_default_destroy>, but destroys an event loop created by an 608Like C<ev_default_destroy>, but destroys an event loop created by an
583earlier call to C<ev_loop_new>. 609earlier call to C<ev_loop_new>.
584 610
585=item ev_default_fork () 611=item ev_default_fork ()
586 612
587This function sets a flag that causes subsequent C<ev_loop> iterations 613This function sets a flag that causes subsequent C<ev_run> iterations
588to reinitialise the kernel state for backends that have one. Despite the 614to 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 615name, 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 616the 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 617sense). 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. 618functions, and it will only take effect at the next C<ev_run> iteration.
619
620Again, you I<have> to call it on I<any> loop that you want to re-use after
621a fork, I<even if you do not plan to use the loop in the parent>. This is
622because some kernel interfaces *cough* I<kqueue> *cough* do funny things
623during fork.
593 624
594On the other hand, you only need to call this function in the child 625On 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 626process 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. 627you just fork+exec or create a new loop in the child, you don't have to
628call it at all (in fact, C<epoll> is so badly broken that it makes a
629difference, but libev will usually detect this case on its own and do a
630costly reset of the backend).
597 631
598The function itself is quite fast and it's usually not a problem to call 632The 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 633it just in case after a fork. To make this easy, the function will fit in
600quite nicely into a call to C<pthread_atfork>: 634quite nicely into a call to C<pthread_atfork>:
601 635
603 637
604=item ev_loop_fork (loop) 638=item ev_loop_fork (loop)
605 639
606Like C<ev_default_fork>, but acts on an event loop created by 640Like 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 641C<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 642after fork that you want to re-use in the child, and how you keep track of
609entirely your own problem. 643them is entirely your own problem.
610 644
611=item int ev_is_default_loop (loop) 645=item int ev_is_default_loop (loop)
612 646
613Returns true when the given loop is, in fact, the default loop, and false 647Returns true when the given loop is, in fact, the default loop, and false
614otherwise. 648otherwise.
615 649
616=item unsigned int ev_loop_count (loop) 650=item unsigned int ev_iteration (loop)
617 651
618Returns the count of loop iterations for the loop, which is identical to 652Returns 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 653to the number of times libev did poll for new events. It starts at C<0>
620happily wraps around with enough iterations. 654and happily wraps around with enough iterations.
621 655
622This value can sometimes be useful as a generation counter of sorts (it 656This value can sometimes be useful as a generation counter of sorts (it
623"ticks" the number of loop iterations), as it roughly corresponds with 657"ticks" the number of loop iterations), as it roughly corresponds with
624C<ev_prepare> and C<ev_check> calls. 658C<ev_prepare> and C<ev_check> calls - and is incremented between the
659prepare and check phases.
625 660
626=item unsigned int ev_loop_depth (loop) 661=item unsigned int ev_depth (loop)
627 662
628Returns the number of times C<ev_loop> was entered minus the number of 663Returns the number of times C<ev_run> was entered minus the number of
629times C<ev_loop> was exited, in other words, the recursion depth. 664times C<ev_run> was exited, in other words, the recursion depth.
630 665
631Outside C<ev_loop>, this number is zero. In a callback, this number is 666Outside C<ev_run>, this number is zero. In a callback, this number is
632C<1>, unless C<ev_loop> was invoked recursively (or from another thread), 667C<1>, unless C<ev_run> was invoked recursively (or from another thread),
633in which case it is higher. 668in which case it is higher.
634 669
635Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread 670Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread
636etc.), doesn't count as exit. 671etc.), doesn't count as "exit" - consider this as a hint to avoid such
672ungentleman-like behaviour unless it's really convenient.
637 673
638=item unsigned int ev_backend (loop) 674=item unsigned int ev_backend (loop)
639 675
640Returns one of the C<EVBACKEND_*> flags indicating the event backend in 676Returns one of the C<EVBACKEND_*> flags indicating the event backend in
641use. 677use.
650 686
651=item ev_now_update (loop) 687=item ev_now_update (loop)
652 688
653Establishes the current time by querying the kernel, updating the time 689Establishes the current time by querying the kernel, updating the time
654returned by C<ev_now ()> in the progress. This is a costly operation and 690returned by C<ev_now ()> in the progress. This is a costly operation and
655is usually done automatically within C<ev_loop ()>. 691is usually done automatically within C<ev_run ()>.
656 692
657This function is rarely useful, but when some event callback runs for a 693This function is rarely useful, but when some event callback runs for a
658very long time without entering the event loop, updating libev's idea of 694very long time without entering the event loop, updating libev's idea of
659the current time is a good idea. 695the current time is a good idea.
660 696
662 698
663=item ev_suspend (loop) 699=item ev_suspend (loop)
664 700
665=item ev_resume (loop) 701=item ev_resume (loop)
666 702
667These two functions suspend and resume a loop, for use when the loop is 703These two functions suspend and resume an event loop, for use when the
668not used for a while and timeouts should not be processed. 704loop is not used for a while and timeouts should not be processed.
669 705
670A typical use case would be an interactive program such as a game: When 706A typical use case would be an interactive program such as a game: When
671the user presses C<^Z> to suspend the game and resumes it an hour later it 707the user presses C<^Z> to suspend the game and resumes it an hour later it
672would be best to handle timeouts as if no time had actually passed while 708would be best to handle timeouts as if no time had actually passed while
673the program was suspended. This can be achieved by calling C<ev_suspend> 709the program was suspended. This can be achieved by calling C<ev_suspend>
675C<ev_resume> directly afterwards to resume timer processing. 711C<ev_resume> directly afterwards to resume timer processing.
676 712
677Effectively, all C<ev_timer> watchers will be delayed by the time spend 713Effectively, all C<ev_timer> watchers will be delayed by the time spend
678between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers 714between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
679will be rescheduled (that is, they will lose any events that would have 715will be rescheduled (that is, they will lose any events that would have
680occured while suspended). 716occurred while suspended).
681 717
682After calling C<ev_suspend> you B<must not> call I<any> function on the 718After calling C<ev_suspend> you B<must not> call I<any> function on the
683given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> 719given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
684without a previous call to C<ev_suspend>. 720without a previous call to C<ev_suspend>.
685 721
686Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 722Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
687event loop time (see C<ev_now_update>). 723event loop time (see C<ev_now_update>).
688 724
689=item ev_loop (loop, int flags) 725=item ev_run (loop, int flags)
690 726
691Finally, this is it, the event handler. This function usually is called 727Finally, this is it, the event handler. This function usually is called
692after you initialised all your watchers and you want to start handling 728after you have initialised all your watchers and you want to start
693events. 729handling events. It will ask the operating system for any new events, call
730the watcher callbacks, an then repeat the whole process indefinitely: This
731is why event loops are called I<loops>.
694 732
695If the flags argument is specified as C<0>, it will not return until 733If the flags argument is specified as C<0>, it will keep handling events
696either no event watchers are active anymore or C<ev_unloop> was called. 734until either no event watchers are active anymore or C<ev_break> was
735called.
697 736
698Please note that an explicit C<ev_unloop> is usually better than 737Please note that an explicit C<ev_break> is usually better than
699relying on all watchers to be stopped when deciding when a program has 738relying on all watchers to be stopped when deciding when a program has
700finished (especially in interactive programs), but having a program 739finished (especially in interactive programs), but having a program
701that automatically loops as long as it has to and no longer by virtue 740that automatically loops as long as it has to and no longer by virtue
702of relying on its watchers stopping correctly, that is truly a thing of 741of relying on its watchers stopping correctly, that is truly a thing of
703beauty. 742beauty.
704 743
705A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 744A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
706those events and any already outstanding ones, but will not block your 745those events and any already outstanding ones, but will not wait and
707process in case there are no events and will return after one iteration of 746block your process in case there are no events and will return after one
708the loop. 747iteration of the loop. This is sometimes useful to poll and handle new
748events while doing lengthy calculations, to keep the program responsive.
709 749
710A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 750A flags value of C<EVRUN_ONCE> will look for new events (waiting if
711necessary) and will handle those and any already outstanding ones. It 751necessary) and will handle those and any already outstanding ones. It
712will block your process until at least one new event arrives (which could 752will block your process until at least one new event arrives (which could
713be an event internal to libev itself, so there is no guarantee that a 753be an event internal to libev itself, so there is no guarantee that a
714user-registered callback will be called), and will return after one 754user-registered callback will be called), and will return after one
715iteration of the loop. 755iteration of the loop.
716 756
717This is useful if you are waiting for some external event in conjunction 757This is useful if you are waiting for some external event in conjunction
718with something not expressible using other libev watchers (i.e. "roll your 758with something not expressible using other libev watchers (i.e. "roll your
719own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 759own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
720usually a better approach for this kind of thing. 760usually a better approach for this kind of thing.
721 761
722Here are the gory details of what C<ev_loop> does: 762Here are the gory details of what C<ev_run> does:
723 763
764 - Increment loop depth.
765 - Reset the ev_break status.
724 - Before the first iteration, call any pending watchers. 766 - Before the first iteration, call any pending watchers.
767 LOOP:
725 * If EVFLAG_FORKCHECK was used, check for a fork. 768 - If EVFLAG_FORKCHECK was used, check for a fork.
726 - If a fork was detected (by any means), queue and call all fork watchers. 769 - If a fork was detected (by any means), queue and call all fork watchers.
727 - Queue and call all prepare watchers. 770 - Queue and call all prepare watchers.
771 - If ev_break was called, goto FINISH.
728 - If we have been forked, detach and recreate the kernel state 772 - If we have been forked, detach and recreate the kernel state
729 as to not disturb the other process. 773 as to not disturb the other process.
730 - Update the kernel state with all outstanding changes. 774 - Update the kernel state with all outstanding changes.
731 - Update the "event loop time" (ev_now ()). 775 - Update the "event loop time" (ev_now ()).
732 - Calculate for how long to sleep or block, if at all 776 - Calculate for how long to sleep or block, if at all
733 (active idle watchers, EVLOOP_NONBLOCK or not having 777 (active idle watchers, EVRUN_NOWAIT or not having
734 any active watchers at all will result in not sleeping). 778 any active watchers at all will result in not sleeping).
735 - Sleep if the I/O and timer collect interval say so. 779 - Sleep if the I/O and timer collect interval say so.
780 - Increment loop iteration counter.
736 - Block the process, waiting for any events. 781 - Block the process, waiting for any events.
737 - Queue all outstanding I/O (fd) events. 782 - Queue all outstanding I/O (fd) events.
738 - Update the "event loop time" (ev_now ()), and do time jump adjustments. 783 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
739 - Queue all expired timers. 784 - Queue all expired timers.
740 - Queue all expired periodics. 785 - Queue all expired periodics.
741 - Unless any events are pending now, queue all idle watchers. 786 - Queue all idle watchers with priority higher than that of pending events.
742 - Queue all check watchers. 787 - Queue all check watchers.
743 - Call all queued watchers in reverse order (i.e. check watchers first). 788 - Call all queued watchers in reverse order (i.e. check watchers first).
744 Signals and child watchers are implemented as I/O watchers, and will 789 Signals and child watchers are implemented as I/O watchers, and will
745 be handled here by queueing them when their watcher gets executed. 790 be handled here by queueing them when their watcher gets executed.
746 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 791 - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
747 were used, or there are no active watchers, return, otherwise 792 were used, or there are no active watchers, goto FINISH, otherwise
748 continue with step *. 793 continue with step LOOP.
794 FINISH:
795 - Reset the ev_break status iff it was EVBREAK_ONE.
796 - Decrement the loop depth.
797 - Return.
749 798
750Example: Queue some jobs and then loop until no events are outstanding 799Example: Queue some jobs and then loop until no events are outstanding
751anymore. 800anymore.
752 801
753 ... queue jobs here, make sure they register event watchers as long 802 ... queue jobs here, make sure they register event watchers as long
754 ... as they still have work to do (even an idle watcher will do..) 803 ... as they still have work to do (even an idle watcher will do..)
755 ev_loop (my_loop, 0); 804 ev_run (my_loop, 0);
756 ... jobs done or somebody called unloop. yeah! 805 ... jobs done or somebody called unloop. yeah!
757 806
758=item ev_unloop (loop, how) 807=item ev_break (loop, how)
759 808
760Can be used to make a call to C<ev_loop> return early (but only after it 809Can be used to make a call to C<ev_run> return early (but only after it
761has processed all outstanding events). The C<how> argument must be either 810has processed all outstanding events). The C<how> argument must be either
762C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 811C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
763C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 812C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
764 813
765This "unloop state" will be cleared when entering C<ev_loop> again. 814This "unloop state" will be cleared when entering C<ev_run> again.
766 815
767It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 816It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO##
768 817
769=item ev_ref (loop) 818=item ev_ref (loop)
770 819
771=item ev_unref (loop) 820=item ev_unref (loop)
772 821
773Ref/unref can be used to add or remove a reference count on the event 822Ref/unref can be used to add or remove a reference count on the event
774loop: Every watcher keeps one reference, and as long as the reference 823loop: Every watcher keeps one reference, and as long as the reference
775count is nonzero, C<ev_loop> will not return on its own. 824count is nonzero, C<ev_run> will not return on its own.
776 825
777If you have a watcher you never unregister that should not keep C<ev_loop> 826This is useful when you have a watcher that you never intend to
778from returning, call ev_unref() after starting, and ev_ref() before 827unregister, but that nevertheless should not keep C<ev_run> from
828returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
779stopping it. 829before stopping it.
780 830
781As an example, libev itself uses this for its internal signal pipe: It 831As an example, libev itself uses this for its internal signal pipe: It
782is not visible to the libev user and should not keep C<ev_loop> from 832is not visible to the libev user and should not keep C<ev_run> from
783exiting if no event watchers registered by it are active. It is also an 833exiting if no event watchers registered by it are active. It is also an
784excellent way to do this for generic recurring timers or from within 834excellent way to do this for generic recurring timers or from within
785third-party libraries. Just remember to I<unref after start> and I<ref 835third-party libraries. Just remember to I<unref after start> and I<ref
786before stop> (but only if the watcher wasn't active before, or was active 836before stop> (but only if the watcher wasn't active before, or was active
787before, respectively. Note also that libev might stop watchers itself 837before, respectively. Note also that libev might stop watchers itself
788(e.g. non-repeating timers) in which case you have to C<ev_ref> 838(e.g. non-repeating timers) in which case you have to C<ev_ref>
789in the callback). 839in the callback).
790 840
791Example: Create a signal watcher, but keep it from keeping C<ev_loop> 841Example: Create a signal watcher, but keep it from keeping C<ev_run>
792running when nothing else is active. 842running when nothing else is active.
793 843
794 ev_signal exitsig; 844 ev_signal exitsig;
795 ev_signal_init (&exitsig, sig_cb, SIGINT); 845 ev_signal_init (&exitsig, sig_cb, SIGINT);
796 ev_signal_start (loop, &exitsig); 846 ev_signal_start (loop, &exitsig);
841usually doesn't make much sense to set it to a lower value than C<0.01>, 891usually doesn't make much sense to set it to a lower value than C<0.01>,
842as this approaches the timing granularity of most systems. Note that if 892as this approaches the timing granularity of most systems. Note that if
843you do transactions with the outside world and you can't increase the 893you do transactions with the outside world and you can't increase the
844parallelity, then this setting will limit your transaction rate (if you 894parallelity, then this setting will limit your transaction rate (if you
845need to poll once per transaction and the I/O collect interval is 0.01, 895need to poll once per transaction and the I/O collect interval is 0.01,
846then you can't do more than 100 transations per second). 896then you can't do more than 100 transactions per second).
847 897
848Setting the I<timeout collect interval> can improve the opportunity for 898Setting the I<timeout collect interval> can improve the opportunity for
849saving power, as the program will "bundle" timer callback invocations that 899saving power, as the program will "bundle" timer callback invocations that
850are "near" in time together, by delaying some, thus reducing the number of 900are "near" in time together, by delaying some, thus reducing the number of
851times the process sleeps and wakes up again. Another useful technique to 901times the process sleeps and wakes up again. Another useful technique to
856more often than 100 times per second: 906more often than 100 times per second:
857 907
858 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1); 908 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
859 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); 909 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
860 910
911=item ev_invoke_pending (loop)
912
913This call will simply invoke all pending watchers while resetting their
914pending state. Normally, C<ev_run> does this automatically when required,
915but when overriding the invoke callback this call comes handy. This
916function can be invoked from a watcher - this can be useful for example
917when you want to do some lengthy calculation and want to pass further
918event handling to another thread (you still have to make sure only one
919thread executes within C<ev_invoke_pending> or C<ev_run> of course).
920
921=item int ev_pending_count (loop)
922
923Returns the number of pending watchers - zero indicates that no watchers
924are pending.
925
926=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
927
928This overrides the invoke pending functionality of the loop: Instead of
929invoking all pending watchers when there are any, C<ev_run> will call
930this callback instead. This is useful, for example, when you want to
931invoke the actual watchers inside another context (another thread etc.).
932
933If you want to reset the callback, use C<ev_invoke_pending> as new
934callback.
935
936=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
937
938Sometimes you want to share the same loop between multiple threads. This
939can be done relatively simply by putting mutex_lock/unlock calls around
940each call to a libev function.
941
942However, C<ev_run> can run an indefinite time, so it is not feasible
943to wait for it to return. One way around this is to wake up the event
944loop via C<ev_break> and C<av_async_send>, another way is to set these
945I<release> and I<acquire> callbacks on the loop.
946
947When set, then C<release> will be called just before the thread is
948suspended waiting for new events, and C<acquire> is called just
949afterwards.
950
951Ideally, C<release> will just call your mutex_unlock function, and
952C<acquire> will just call the mutex_lock function again.
953
954While event loop modifications are allowed between invocations of
955C<release> and C<acquire> (that's their only purpose after all), no
956modifications done will affect the event loop, i.e. adding watchers will
957have no effect on the set of file descriptors being watched, or the time
958waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
959to take note of any changes you made.
960
961In theory, threads executing C<ev_run> will be async-cancel safe between
962invocations of C<release> and C<acquire>.
963
964See also the locking example in the C<THREADS> section later in this
965document.
966
967=item ev_set_userdata (loop, void *data)
968
969=item ev_userdata (loop)
970
971Set and retrieve a single C<void *> associated with a loop. When
972C<ev_set_userdata> has never been called, then C<ev_userdata> returns
973C<0.>
974
975These two functions can be used to associate arbitrary data with a loop,
976and are intended solely for the C<invoke_pending_cb>, C<release> and
977C<acquire> callbacks described above, but of course can be (ab-)used for
978any other purpose as well.
979
861=item ev_loop_verify (loop) 980=item ev_verify (loop)
862 981
863This function only does something when C<EV_VERIFY> support has been 982This function only does something when C<EV_VERIFY> support has been
864compiled in, which is the default for non-minimal builds. It tries to go 983compiled in, which is the default for non-minimal builds. It tries to go
865through all internal structures and checks them for validity. If anything 984through all internal structures and checks them for validity. If anything
866is found to be inconsistent, it will print an error message to standard 985is found to be inconsistent, it will print an error message to standard
877 996
878In the following description, uppercase C<TYPE> in names stands for the 997In the following description, uppercase C<TYPE> in names stands for the
879watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 998watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
880watchers and C<ev_io_start> for I/O watchers. 999watchers and C<ev_io_start> for I/O watchers.
881 1000
882A watcher is a structure that you create and register to record your 1001A watcher is an opaque structure that you allocate and register to record
883interest in some event. For instance, if you want to wait for STDIN to 1002your interest in some event. To make a concrete example, imagine you want
884become readable, you would create an C<ev_io> watcher for that: 1003to wait for STDIN to become readable, you would create an C<ev_io> watcher
1004for that:
885 1005
886 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1006 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
887 { 1007 {
888 ev_io_stop (w); 1008 ev_io_stop (w);
889 ev_unloop (loop, EVUNLOOP_ALL); 1009 ev_break (loop, EVBREAK_ALL);
890 } 1010 }
891 1011
892 struct ev_loop *loop = ev_default_loop (0); 1012 struct ev_loop *loop = ev_default_loop (0);
893 1013
894 ev_io stdin_watcher; 1014 ev_io stdin_watcher;
895 1015
896 ev_init (&stdin_watcher, my_cb); 1016 ev_init (&stdin_watcher, my_cb);
897 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1017 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
898 ev_io_start (loop, &stdin_watcher); 1018 ev_io_start (loop, &stdin_watcher);
899 1019
900 ev_loop (loop, 0); 1020 ev_run (loop, 0);
901 1021
902As you can see, you are responsible for allocating the memory for your 1022As you can see, you are responsible for allocating the memory for your
903watcher structures (and it is I<usually> a bad idea to do this on the 1023watcher structures (and it is I<usually> a bad idea to do this on the
904stack). 1024stack).
905 1025
906Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1026Each watcher has an associated watcher structure (called C<struct ev_TYPE>
907or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1027or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
908 1028
909Each watcher structure must be initialised by a call to C<ev_init 1029Each watcher structure must be initialised by a call to C<ev_init (watcher
910(watcher *, callback)>, which expects a callback to be provided. This 1030*, callback)>, which expects a callback to be provided. This callback is
911callback gets invoked each time the event occurs (or, in the case of I/O 1031invoked each time the event occurs (or, in the case of I/O watchers, each
912watchers, each time the event loop detects that the file descriptor given 1032time the event loop detects that the file descriptor given is readable
913is readable and/or writable). 1033and/or writable).
914 1034
915Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1035Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
916macro to configure it, with arguments specific to the watcher type. There 1036macro to configure it, with arguments specific to the watcher type. There
917is also a macro to combine initialisation and setting in one call: C<< 1037is also a macro to combine initialisation and setting in one call: C<<
918ev_TYPE_init (watcher *, callback, ...) >>. 1038ev_TYPE_init (watcher *, callback, ...) >>.
941=item C<EV_WRITE> 1061=item C<EV_WRITE>
942 1062
943The file descriptor in the C<ev_io> watcher has become readable and/or 1063The file descriptor in the C<ev_io> watcher has become readable and/or
944writable. 1064writable.
945 1065
946=item C<EV_TIMEOUT> 1066=item C<EV_TIMER>
947 1067
948The C<ev_timer> watcher has timed out. 1068The C<ev_timer> watcher has timed out.
949 1069
950=item C<EV_PERIODIC> 1070=item C<EV_PERIODIC>
951 1071
969 1089
970=item C<EV_PREPARE> 1090=item C<EV_PREPARE>
971 1091
972=item C<EV_CHECK> 1092=item C<EV_CHECK>
973 1093
974All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1094All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
975to gather new events, and all C<ev_check> watchers are invoked just after 1095to gather new events, and all C<ev_check> watchers are invoked just after
976C<ev_loop> has gathered them, but before it invokes any callbacks for any 1096C<ev_run> has gathered them, but before it invokes any callbacks for any
977received events. Callbacks of both watcher types can start and stop as 1097received events. Callbacks of both watcher types can start and stop as
978many watchers as they want, and all of them will be taken into account 1098many watchers as they want, and all of them will be taken into account
979(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1099(for example, a C<ev_prepare> watcher might start an idle watcher to keep
980C<ev_loop> from blocking). 1100C<ev_run> from blocking).
981 1101
982=item C<EV_EMBED> 1102=item C<EV_EMBED>
983 1103
984The embedded event loop specified in the C<ev_embed> watcher needs attention. 1104The embedded event loop specified in the C<ev_embed> watcher needs attention.
985 1105
1016programs, though, as the fd could already be closed and reused for another 1136programs, though, as the fd could already be closed and reused for another
1017thing, so beware. 1137thing, so beware.
1018 1138
1019=back 1139=back
1020 1140
1141=head2 WATCHER STATES
1142
1143There are various watcher states mentioned throughout this manual -
1144active, pending and so on. In this section these states and the rules to
1145transition between them will be described in more detail - and while these
1146rules might look complicated, they usually do "the right thing".
1147
1148=over 4
1149
1150=item initialiased
1151
1152Before a watcher can be registered with the event looop it has to be
1153initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1154C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1155
1156In this state it is simply some block of memory that is suitable for use
1157in an event loop. It can be moved around, freed, reused etc. at will.
1158
1159=item started/running/active
1160
1161Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1162property of the event loop, and is actively waiting for events. While in
1163this state it cannot be accessed (except in a few documented ways), moved,
1164freed or anything else - the only legal thing is to keep a pointer to it,
1165and call libev functions on it that are documented to work on active watchers.
1166
1167=item pending
1168
1169If a watcher is active and libev determines that an event it is interested
1170in has occurred (such as a timer expiring), it will become pending. It will
1171stay in this pending state until either it is stopped or its callback is
1172about to be invoked, so it is not normally pending inside the watcher
1173callback.
1174
1175The watcher might or might not be active while it is pending (for example,
1176an expired non-repeating timer can be pending but no longer active). If it
1177is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1178but it is still property of the event loop at this time, so cannot be
1179moved, freed or reused. And if it is active the rules described in the
1180previous item still apply.
1181
1182It is also possible to feed an event on a watcher that is not active (e.g.
1183via C<ev_feed_event>), in which case it becomes pending without being
1184active.
1185
1186=item stopped
1187
1188A watcher can be stopped implicitly by libev (in which case it might still
1189be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1190latter will clear any pending state the watcher might be in, regardless
1191of whether it was active or not, so stopping a watcher explicitly before
1192freeing it is often a good idea.
1193
1194While stopped (and not pending) the watcher is essentially in the
1195initialised state, that is it can be reused, moved, modified in any way
1196you wish.
1197
1198=back
1199
1021=head2 GENERIC WATCHER FUNCTIONS 1200=head2 GENERIC WATCHER FUNCTIONS
1022 1201
1023=over 4 1202=over 4
1024 1203
1025=item C<ev_init> (ev_TYPE *watcher, callback) 1204=item C<ev_init> (ev_TYPE *watcher, callback)
1041 1220
1042 ev_io w; 1221 ev_io w;
1043 ev_init (&w, my_cb); 1222 ev_init (&w, my_cb);
1044 ev_io_set (&w, STDIN_FILENO, EV_READ); 1223 ev_io_set (&w, STDIN_FILENO, EV_READ);
1045 1224
1046=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1225=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1047 1226
1048This macro initialises the type-specific parts of a watcher. You need to 1227This macro initialises the type-specific parts of a watcher. You need to
1049call C<ev_init> at least once before you call this macro, but you can 1228call C<ev_init> at least once before you call this macro, but you can
1050call C<ev_TYPE_set> any number of times. You must not, however, call this 1229call C<ev_TYPE_set> any number of times. You must not, however, call this
1051macro on a watcher that is active (it can be pending, however, which is a 1230macro on a watcher that is active (it can be pending, however, which is a
1064 1243
1065Example: Initialise and set an C<ev_io> watcher in one step. 1244Example: Initialise and set an C<ev_io> watcher in one step.
1066 1245
1067 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1246 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1068 1247
1069=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1248=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1070 1249
1071Starts (activates) the given watcher. Only active watchers will receive 1250Starts (activates) the given watcher. Only active watchers will receive
1072events. If the watcher is already active nothing will happen. 1251events. If the watcher is already active nothing will happen.
1073 1252
1074Example: Start the C<ev_io> watcher that is being abused as example in this 1253Example: Start the C<ev_io> watcher that is being abused as example in this
1075whole section. 1254whole section.
1076 1255
1077 ev_io_start (EV_DEFAULT_UC, &w); 1256 ev_io_start (EV_DEFAULT_UC, &w);
1078 1257
1079=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1258=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1080 1259
1081Stops the given watcher if active, and clears the pending status (whether 1260Stops the given watcher if active, and clears the pending status (whether
1082the watcher was active or not). 1261the watcher was active or not).
1083 1262
1084It is possible that stopped watchers are pending - for example, 1263It is possible that stopped watchers are pending - for example,
1109=item ev_cb_set (ev_TYPE *watcher, callback) 1288=item ev_cb_set (ev_TYPE *watcher, callback)
1110 1289
1111Change the callback. You can change the callback at virtually any time 1290Change the callback. You can change the callback at virtually any time
1112(modulo threads). 1291(modulo threads).
1113 1292
1114=item ev_set_priority (ev_TYPE *watcher, priority) 1293=item ev_set_priority (ev_TYPE *watcher, int priority)
1115 1294
1116=item int ev_priority (ev_TYPE *watcher) 1295=item int ev_priority (ev_TYPE *watcher)
1117 1296
1118Set and query the priority of the watcher. The priority is a small 1297Set and query the priority of the watcher. The priority is a small
1119integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1298integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1150returns its C<revents> bitset (as if its callback was invoked). If the 1329returns its C<revents> bitset (as if its callback was invoked). If the
1151watcher isn't pending it does nothing and returns C<0>. 1330watcher isn't pending it does nothing and returns C<0>.
1152 1331
1153Sometimes it can be useful to "poll" a watcher instead of waiting for its 1332Sometimes it can be useful to "poll" a watcher instead of waiting for its
1154callback to be invoked, which can be accomplished with this function. 1333callback to be invoked, which can be accomplished with this function.
1334
1335=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1336
1337Feeds the given event set into the event loop, as if the specified event
1338had happened for the specified watcher (which must be a pointer to an
1339initialised but not necessarily started event watcher). Obviously you must
1340not free the watcher as long as it has pending events.
1341
1342Stopping the watcher, letting libev invoke it, or calling
1343C<ev_clear_pending> will clear the pending event, even if the watcher was
1344not started in the first place.
1345
1346See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1347functions that do not need a watcher.
1155 1348
1156=back 1349=back
1157 1350
1158 1351
1159=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1352=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1270 1463
1271For example, to emulate how many other event libraries handle priorities, 1464For example, to emulate how many other event libraries handle priorities,
1272you can associate an C<ev_idle> watcher to each such watcher, and in 1465you can associate an C<ev_idle> watcher to each such watcher, and in
1273the normal watcher callback, you just start the idle watcher. The real 1466the normal watcher callback, you just start the idle watcher. The real
1274processing is done in the idle watcher callback. This causes libev to 1467processing is done in the idle watcher callback. This causes libev to
1275continously poll and process kernel event data for the watcher, but when 1468continuously poll and process kernel event data for the watcher, but when
1276the lock-out case is known to be rare (which in turn is rare :), this is 1469the lock-out case is known to be rare (which in turn is rare :), this is
1277workable. 1470workable.
1278 1471
1279Usually, however, the lock-out model implemented that way will perform 1472Usually, however, the lock-out model implemented that way will perform
1280miserably under the type of load it was designed to handle. In that case, 1473miserably under the type of load it was designed to handle. In that case,
1294 { 1487 {
1295 // stop the I/O watcher, we received the event, but 1488 // stop the I/O watcher, we received the event, but
1296 // are not yet ready to handle it. 1489 // are not yet ready to handle it.
1297 ev_io_stop (EV_A_ w); 1490 ev_io_stop (EV_A_ w);
1298 1491
1299 // start the idle watcher to ahndle the actual event. 1492 // start the idle watcher to handle the actual event.
1300 // it will not be executed as long as other watchers 1493 // it will not be executed as long as other watchers
1301 // with the default priority are receiving events. 1494 // with the default priority are receiving events.
1302 ev_idle_start (EV_A_ &idle); 1495 ev_idle_start (EV_A_ &idle);
1303 } 1496 }
1304 1497
1358 1551
1359If you cannot use non-blocking mode, then force the use of a 1552If you cannot use non-blocking mode, then force the use of a
1360known-to-be-good backend (at the time of this writing, this includes only 1553known-to-be-good backend (at the time of this writing, this includes only
1361C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file 1554C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1362descriptors for which non-blocking operation makes no sense (such as 1555descriptors for which non-blocking operation makes no sense (such as
1363files) - libev doesn't guarentee any specific behaviour in that case. 1556files) - libev doesn't guarantee any specific behaviour in that case.
1364 1557
1365Another thing you have to watch out for is that it is quite easy to 1558Another thing you have to watch out for is that it is quite easy to
1366receive "spurious" readiness notifications, that is your callback might 1559receive "spurious" readiness notifications, that is your callback might
1367be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1560be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1368because there is no data. Not only are some backends known to create a 1561because there is no data. Not only are some backends known to create a
1433 1626
1434So when you encounter spurious, unexplained daemon exits, make sure you 1627So when you encounter spurious, unexplained daemon exits, make sure you
1435ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1628ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1436somewhere, as that would have given you a big clue). 1629somewhere, as that would have given you a big clue).
1437 1630
1631=head3 The special problem of accept()ing when you can't
1632
1633Many implementations of the POSIX C<accept> function (for example,
1634found in post-2004 Linux) have the peculiar behaviour of not removing a
1635connection from the pending queue in all error cases.
1636
1637For example, larger servers often run out of file descriptors (because
1638of resource limits), causing C<accept> to fail with C<ENFILE> but not
1639rejecting the connection, leading to libev signalling readiness on
1640the next iteration again (the connection still exists after all), and
1641typically causing the program to loop at 100% CPU usage.
1642
1643Unfortunately, the set of errors that cause this issue differs between
1644operating systems, there is usually little the app can do to remedy the
1645situation, and no known thread-safe method of removing the connection to
1646cope with overload is known (to me).
1647
1648One of the easiest ways to handle this situation is to just ignore it
1649- when the program encounters an overload, it will just loop until the
1650situation is over. While this is a form of busy waiting, no OS offers an
1651event-based way to handle this situation, so it's the best one can do.
1652
1653A better way to handle the situation is to log any errors other than
1654C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1655messages, and continue as usual, which at least gives the user an idea of
1656what could be wrong ("raise the ulimit!"). For extra points one could stop
1657the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1658usage.
1659
1660If your program is single-threaded, then you could also keep a dummy file
1661descriptor for overload situations (e.g. by opening F</dev/null>), and
1662when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1663close that fd, and create a new dummy fd. This will gracefully refuse
1664clients under typical overload conditions.
1665
1666The last way to handle it is to simply log the error and C<exit>, as
1667is often done with C<malloc> failures, but this results in an easy
1668opportunity for a DoS attack.
1438 1669
1439=head3 Watcher-Specific Functions 1670=head3 Watcher-Specific Functions
1440 1671
1441=over 4 1672=over 4
1442 1673
1474 ... 1705 ...
1475 struct ev_loop *loop = ev_default_init (0); 1706 struct ev_loop *loop = ev_default_init (0);
1476 ev_io stdin_readable; 1707 ev_io stdin_readable;
1477 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1708 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1478 ev_io_start (loop, &stdin_readable); 1709 ev_io_start (loop, &stdin_readable);
1479 ev_loop (loop, 0); 1710 ev_run (loop, 0);
1480 1711
1481 1712
1482=head2 C<ev_timer> - relative and optionally repeating timeouts 1713=head2 C<ev_timer> - relative and optionally repeating timeouts
1483 1714
1484Timer watchers are simple relative timers that generate an event after a 1715Timer watchers are simple relative timers that generate an event after a
1492 1723
1493The callback is guaranteed to be invoked only I<after> its timeout has 1724The callback is guaranteed to be invoked only I<after> its timeout has
1494passed (not I<at>, so on systems with very low-resolution clocks this 1725passed (not I<at>, so on systems with very low-resolution clocks this
1495might introduce a small delay). If multiple timers become ready during the 1726might introduce a small delay). If multiple timers become ready during the
1496same loop iteration then the ones with earlier time-out values are invoked 1727same loop iteration then the ones with earlier time-out values are invoked
1497before ones with later time-out values (but this is no longer true when a 1728before ones of the same priority with later time-out values (but this is
1498callback calls C<ev_loop> recursively). 1729no longer true when a callback calls C<ev_run> recursively).
1499 1730
1500=head3 Be smart about timeouts 1731=head3 Be smart about timeouts
1501 1732
1502Many real-world problems involve some kind of timeout, usually for error 1733Many real-world problems involve some kind of timeout, usually for error
1503recovery. A typical example is an HTTP request - if the other side hangs, 1734recovery. A typical example is an HTTP request - if the other side hangs,
1589 ev_tstamp timeout = last_activity + 60.; 1820 ev_tstamp timeout = last_activity + 60.;
1590 1821
1591 // if last_activity + 60. is older than now, we did time out 1822 // if last_activity + 60. is older than now, we did time out
1592 if (timeout < now) 1823 if (timeout < now)
1593 { 1824 {
1594 // timeout occured, take action 1825 // timeout occurred, take action
1595 } 1826 }
1596 else 1827 else
1597 { 1828 {
1598 // callback was invoked, but there was some activity, re-arm 1829 // callback was invoked, but there was some activity, re-arm
1599 // the watcher to fire in last_activity + 60, which is 1830 // the watcher to fire in last_activity + 60, which is
1621to the current time (meaning we just have some activity :), then call the 1852to the current time (meaning we just have some activity :), then call the
1622callback, which will "do the right thing" and start the timer: 1853callback, which will "do the right thing" and start the timer:
1623 1854
1624 ev_init (timer, callback); 1855 ev_init (timer, callback);
1625 last_activity = ev_now (loop); 1856 last_activity = ev_now (loop);
1626 callback (loop, timer, EV_TIMEOUT); 1857 callback (loop, timer, EV_TIMER);
1627 1858
1628And when there is some activity, simply store the current time in 1859And when there is some activity, simply store the current time in
1629C<last_activity>, no libev calls at all: 1860C<last_activity>, no libev calls at all:
1630 1861
1631 last_actiivty = ev_now (loop); 1862 last_activity = ev_now (loop);
1632 1863
1633This technique is slightly more complex, but in most cases where the 1864This technique is slightly more complex, but in most cases where the
1634time-out is unlikely to be triggered, much more efficient. 1865time-out is unlikely to be triggered, much more efficient.
1635 1866
1636Changing the timeout is trivial as well (if it isn't hard-coded in the 1867Changing the timeout is trivial as well (if it isn't hard-coded in the
1674 1905
1675=head3 The special problem of time updates 1906=head3 The special problem of time updates
1676 1907
1677Establishing the current time is a costly operation (it usually takes at 1908Establishing the current time is a costly operation (it usually takes at
1678least two system calls): EV therefore updates its idea of the current 1909least two system calls): EV therefore updates its idea of the current
1679time only before and after C<ev_loop> collects new events, which causes a 1910time only before and after C<ev_run> collects new events, which causes a
1680growing difference between C<ev_now ()> and C<ev_time ()> when handling 1911growing difference between C<ev_now ()> and C<ev_time ()> when handling
1681lots of events in one iteration. 1912lots of events in one iteration.
1682 1913
1683The relative timeouts are calculated relative to the C<ev_now ()> 1914The relative timeouts are calculated relative to the C<ev_now ()>
1684time. This is usually the right thing as this timestamp refers to the time 1915time. This is usually the right thing as this timestamp refers to the time
1690 1921
1691If the event loop is suspended for a long time, you can also force an 1922If the event loop is suspended for a long time, you can also force an
1692update of the time returned by C<ev_now ()> by calling C<ev_now_update 1923update of the time returned by C<ev_now ()> by calling C<ev_now_update
1693()>. 1924()>.
1694 1925
1926=head3 The special problems of suspended animation
1927
1928When you leave the server world it is quite customary to hit machines that
1929can suspend/hibernate - what happens to the clocks during such a suspend?
1930
1931Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1932all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1933to run until the system is suspended, but they will not advance while the
1934system is suspended. That means, on resume, it will be as if the program
1935was frozen for a few seconds, but the suspend time will not be counted
1936towards C<ev_timer> when a monotonic clock source is used. The real time
1937clock advanced as expected, but if it is used as sole clocksource, then a
1938long suspend would be detected as a time jump by libev, and timers would
1939be adjusted accordingly.
1940
1941I would not be surprised to see different behaviour in different between
1942operating systems, OS versions or even different hardware.
1943
1944The other form of suspend (job control, or sending a SIGSTOP) will see a
1945time jump in the monotonic clocks and the realtime clock. If the program
1946is suspended for a very long time, and monotonic clock sources are in use,
1947then you can expect C<ev_timer>s to expire as the full suspension time
1948will be counted towards the timers. When no monotonic clock source is in
1949use, then libev will again assume a timejump and adjust accordingly.
1950
1951It might be beneficial for this latter case to call C<ev_suspend>
1952and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1953deterministic behaviour in this case (you can do nothing against
1954C<SIGSTOP>).
1955
1695=head3 Watcher-Specific Functions and Data Members 1956=head3 Watcher-Specific Functions and Data Members
1696 1957
1697=over 4 1958=over 4
1698 1959
1699=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1960=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1725C<repeat> value), or reset the running timer to the C<repeat> value. 1986C<repeat> value), or reset the running timer to the C<repeat> value.
1726 1987
1727This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 1988This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1728usage example. 1989usage example.
1729 1990
1991=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1992
1993Returns the remaining time until a timer fires. If the timer is active,
1994then this time is relative to the current event loop time, otherwise it's
1995the timeout value currently configured.
1996
1997That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1998C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
1999will return C<4>. When the timer expires and is restarted, it will return
2000roughly C<7> (likely slightly less as callback invocation takes some time,
2001too), and so on.
2002
1730=item ev_tstamp repeat [read-write] 2003=item ev_tstamp repeat [read-write]
1731 2004
1732The current C<repeat> value. Will be used each time the watcher times out 2005The current C<repeat> value. Will be used each time the watcher times out
1733or C<ev_timer_again> is called, and determines the next timeout (if any), 2006or C<ev_timer_again> is called, and determines the next timeout (if any),
1734which is also when any modifications are taken into account. 2007which is also when any modifications are taken into account.
1759 } 2032 }
1760 2033
1761 ev_timer mytimer; 2034 ev_timer mytimer;
1762 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2035 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1763 ev_timer_again (&mytimer); /* start timer */ 2036 ev_timer_again (&mytimer); /* start timer */
1764 ev_loop (loop, 0); 2037 ev_run (loop, 0);
1765 2038
1766 // and in some piece of code that gets executed on any "activity": 2039 // and in some piece of code that gets executed on any "activity":
1767 // reset the timeout to start ticking again at 10 seconds 2040 // reset the timeout to start ticking again at 10 seconds
1768 ev_timer_again (&mytimer); 2041 ev_timer_again (&mytimer);
1769 2042
1795 2068
1796As with timers, the callback is guaranteed to be invoked only when the 2069As with timers, the callback is guaranteed to be invoked only when the
1797point in time where it is supposed to trigger has passed. If multiple 2070point in time where it is supposed to trigger has passed. If multiple
1798timers become ready during the same loop iteration then the ones with 2071timers become ready during the same loop iteration then the ones with
1799earlier time-out values are invoked before ones with later time-out values 2072earlier time-out values are invoked before ones with later time-out values
1800(but this is no longer true when a callback calls C<ev_loop> recursively). 2073(but this is no longer true when a callback calls C<ev_run> recursively).
1801 2074
1802=head3 Watcher-Specific Functions and Data Members 2075=head3 Watcher-Specific Functions and Data Members
1803 2076
1804=over 4 2077=over 4
1805 2078
1933Example: Call a callback every hour, or, more precisely, whenever the 2206Example: Call a callback every hour, or, more precisely, whenever the
1934system time is divisible by 3600. The callback invocation times have 2207system time is divisible by 3600. The callback invocation times have
1935potentially a lot of jitter, but good long-term stability. 2208potentially a lot of jitter, but good long-term stability.
1936 2209
1937 static void 2210 static void
1938 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2211 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1939 { 2212 {
1940 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2213 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1941 } 2214 }
1942 2215
1943 ev_periodic hourly_tick; 2216 ev_periodic hourly_tick;
1969Signal watchers will trigger an event when the process receives a specific 2242Signal watchers will trigger an event when the process receives a specific
1970signal one or more times. Even though signals are very asynchronous, libev 2243signal one or more times. Even though signals are very asynchronous, libev
1971will try it's best to deliver signals synchronously, i.e. as part of the 2244will try it's best to deliver signals synchronously, i.e. as part of the
1972normal event processing, like any other event. 2245normal event processing, like any other event.
1973 2246
1974If you want signals asynchronously, just use C<sigaction> as you would 2247If you want signals to be delivered truly asynchronously, just use
1975do without libev and forget about sharing the signal. You can even use 2248C<sigaction> as you would do without libev and forget about sharing
1976C<ev_async> from a signal handler to synchronously wake up an event loop. 2249the signal. You can even use C<ev_async> from a signal handler to
2250synchronously wake up an event loop.
1977 2251
1978You can configure as many watchers as you like per signal. Only when the 2252You can configure as many watchers as you like for the same signal, but
2253only within the same loop, i.e. you can watch for C<SIGINT> in your
2254default loop and for C<SIGIO> in another loop, but you cannot watch for
2255C<SIGINT> in both the default loop and another loop at the same time. At
2256the moment, C<SIGCHLD> is permanently tied to the default loop.
2257
1979first watcher gets started will libev actually register a signal handler 2258When the first watcher gets started will libev actually register something
1980with the kernel (thus it coexists with your own signal handlers as long as 2259with the kernel (thus it coexists with your own signal handlers as long as
1981you don't register any with libev for the same signal). Similarly, when 2260you don't register any with libev for the same signal).
1982the last signal watcher for a signal is stopped, libev will reset the
1983signal handler to SIG_DFL (regardless of what it was set to before).
1984 2261
1985If possible and supported, libev will install its handlers with 2262If possible and supported, libev will install its handlers with
1986C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2263C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1987interrupted. If you have a problem with system calls getting interrupted by 2264not be unduly interrupted. If you have a problem with system calls getting
1988signals you can block all signals in an C<ev_check> watcher and unblock 2265interrupted by signals you can block all signals in an C<ev_check> watcher
1989them in an C<ev_prepare> watcher. 2266and unblock them in an C<ev_prepare> watcher.
2267
2268=head3 The special problem of inheritance over fork/execve/pthread_create
2269
2270Both the signal mask (C<sigprocmask>) and the signal disposition
2271(C<sigaction>) are unspecified after starting a signal watcher (and after
2272stopping it again), that is, libev might or might not block the signal,
2273and might or might not set or restore the installed signal handler.
2274
2275While this does not matter for the signal disposition (libev never
2276sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2277C<execve>), this matters for the signal mask: many programs do not expect
2278certain signals to be blocked.
2279
2280This means that before calling C<exec> (from the child) you should reset
2281the signal mask to whatever "default" you expect (all clear is a good
2282choice usually).
2283
2284The simplest way to ensure that the signal mask is reset in the child is
2285to install a fork handler with C<pthread_atfork> that resets it. That will
2286catch fork calls done by libraries (such as the libc) as well.
2287
2288In current versions of libev, the signal will not be blocked indefinitely
2289unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2290the window of opportunity for problems, it will not go away, as libev
2291I<has> to modify the signal mask, at least temporarily.
2292
2293So I can't stress this enough: I<If you do not reset your signal mask when
2294you expect it to be empty, you have a race condition in your code>. This
2295is not a libev-specific thing, this is true for most event libraries.
1990 2296
1991=head3 Watcher-Specific Functions and Data Members 2297=head3 Watcher-Specific Functions and Data Members
1992 2298
1993=over 4 2299=over 4
1994 2300
2010Example: Try to exit cleanly on SIGINT. 2316Example: Try to exit cleanly on SIGINT.
2011 2317
2012 static void 2318 static void
2013 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2319 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
2014 { 2320 {
2015 ev_unloop (loop, EVUNLOOP_ALL); 2321 ev_break (loop, EVBREAK_ALL);
2016 } 2322 }
2017 2323
2018 ev_signal signal_watcher; 2324 ev_signal signal_watcher;
2019 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2325 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
2020 ev_signal_start (loop, &signal_watcher); 2326 ev_signal_start (loop, &signal_watcher);
2032in the next callback invocation is not. 2338in the next callback invocation is not.
2033 2339
2034Only the default event loop is capable of handling signals, and therefore 2340Only the default event loop is capable of handling signals, and therefore
2035you can only register child watchers in the default event loop. 2341you can only register child watchers in the default event loop.
2036 2342
2343Due to some design glitches inside libev, child watchers will always be
2344handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2345libev)
2346
2037=head3 Process Interaction 2347=head3 Process Interaction
2038 2348
2039Libev grabs C<SIGCHLD> as soon as the default event loop is 2349Libev grabs C<SIGCHLD> as soon as the default event loop is
2040initialised. This is necessary to guarantee proper behaviour even if 2350initialised. This is necessary to guarantee proper behaviour even if the
2041the first child watcher is started after the child exits. The occurrence 2351first child watcher is started after the child exits. The occurrence
2042of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2352of C<SIGCHLD> is recorded asynchronously, but child reaping is done
2043synchronously as part of the event loop processing. Libev always reaps all 2353synchronously as part of the event loop processing. Libev always reaps all
2044children, even ones not watched. 2354children, even ones not watched.
2045 2355
2046=head3 Overriding the Built-In Processing 2356=head3 Overriding the Built-In Processing
2056=head3 Stopping the Child Watcher 2366=head3 Stopping the Child Watcher
2057 2367
2058Currently, the child watcher never gets stopped, even when the 2368Currently, the child watcher never gets stopped, even when the
2059child terminates, so normally one needs to stop the watcher in the 2369child terminates, so normally one needs to stop the watcher in the
2060callback. Future versions of libev might stop the watcher automatically 2370callback. Future versions of libev might stop the watcher automatically
2061when a child exit is detected. 2371when a child exit is detected (calling C<ev_child_stop> twice is not a
2372problem).
2062 2373
2063=head3 Watcher-Specific Functions and Data Members 2374=head3 Watcher-Specific Functions and Data Members
2064 2375
2065=over 4 2376=over 4
2066 2377
2401 2712
2402Prepare and check watchers are usually (but not always) used in pairs: 2713Prepare and check watchers are usually (but not always) used in pairs:
2403prepare watchers get invoked before the process blocks and check watchers 2714prepare watchers get invoked before the process blocks and check watchers
2404afterwards. 2715afterwards.
2405 2716
2406You I<must not> call C<ev_loop> or similar functions that enter 2717You I<must not> call C<ev_run> or similar functions that enter
2407the current event loop from either C<ev_prepare> or C<ev_check> 2718the current event loop from either C<ev_prepare> or C<ev_check>
2408watchers. Other loops than the current one are fine, however. The 2719watchers. Other loops than the current one are fine, however. The
2409rationale behind this is that you do not need to check for recursion in 2720rationale behind this is that you do not need to check for recursion in
2410those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2721those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2411C<ev_check> so if you have one watcher of each kind they will always be 2722C<ev_check> so if you have one watcher of each kind they will always be
2579 2890
2580 if (timeout >= 0) 2891 if (timeout >= 0)
2581 // create/start timer 2892 // create/start timer
2582 2893
2583 // poll 2894 // poll
2584 ev_loop (EV_A_ 0); 2895 ev_run (EV_A_ 0);
2585 2896
2586 // stop timer again 2897 // stop timer again
2587 if (timeout >= 0) 2898 if (timeout >= 0)
2588 ev_timer_stop (EV_A_ &to); 2899 ev_timer_stop (EV_A_ &to);
2589 2900
2667if you do not want that, you need to temporarily stop the embed watcher). 2978if you do not want that, you need to temporarily stop the embed watcher).
2668 2979
2669=item ev_embed_sweep (loop, ev_embed *) 2980=item ev_embed_sweep (loop, ev_embed *)
2670 2981
2671Make a single, non-blocking sweep over the embedded loop. This works 2982Make a single, non-blocking sweep over the embedded loop. This works
2672similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2983similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2673appropriate way for embedded loops. 2984appropriate way for embedded loops.
2674 2985
2675=item struct ev_loop *other [read-only] 2986=item struct ev_loop *other [read-only]
2676 2987
2677The embedded event loop. 2988The embedded event loop.
2737C<ev_default_fork> cheats and calls it in the wrong process, the fork 3048C<ev_default_fork> cheats and calls it in the wrong process, the fork
2738handlers will be invoked, too, of course. 3049handlers will be invoked, too, of course.
2739 3050
2740=head3 The special problem of life after fork - how is it possible? 3051=head3 The special problem of life after fork - how is it possible?
2741 3052
2742Most uses of C<fork()> consist of forking, then some simple calls to ste 3053Most uses of C<fork()> consist of forking, then some simple calls to set
2743up/change the process environment, followed by a call to C<exec()>. This 3054up/change the process environment, followed by a call to C<exec()>. This
2744sequence should be handled by libev without any problems. 3055sequence should be handled by libev without any problems.
2745 3056
2746This changes when the application actually wants to do event handling 3057This changes when the application actually wants to do event handling
2747in the child, or both parent in child, in effect "continuing" after the 3058in the child, or both parent in child, in effect "continuing" after the
2781believe me. 3092believe me.
2782 3093
2783=back 3094=back
2784 3095
2785 3096
2786=head2 C<ev_async> - how to wake up another event loop 3097=head2 C<ev_async> - how to wake up an event loop
2787 3098
2788In general, you cannot use an C<ev_loop> from multiple threads or other 3099In general, you cannot use an C<ev_run> from multiple threads or other
2789asynchronous sources such as signal handlers (as opposed to multiple event 3100asynchronous sources such as signal handlers (as opposed to multiple event
2790loops - those are of course safe to use in different threads). 3101loops - those are of course safe to use in different threads).
2791 3102
2792Sometimes, however, you need to wake up another event loop you do not 3103Sometimes, however, you need to wake up an event loop you do not control,
2793control, for example because it belongs to another thread. This is what 3104for example because it belongs to another thread. This is what C<ev_async>
2794C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3105watchers do: as long as the C<ev_async> watcher is active, you can signal
2795can signal it by calling C<ev_async_send>, which is thread- and signal 3106it by calling C<ev_async_send>, which is thread- and signal safe.
2796safe.
2797 3107
2798This functionality is very similar to C<ev_signal> watchers, as signals, 3108This functionality is very similar to C<ev_signal> watchers, as signals,
2799too, are asynchronous in nature, and signals, too, will be compressed 3109too, are asynchronous in nature, and signals, too, will be compressed
2800(i.e. the number of callback invocations may be less than the number of 3110(i.e. the number of callback invocations may be less than the number of
2801C<ev_async_sent> calls). 3111C<ev_async_sent> calls).
2806=head3 Queueing 3116=head3 Queueing
2807 3117
2808C<ev_async> does not support queueing of data in any way. The reason 3118C<ev_async> does not support queueing of data in any way. The reason
2809is that the author does not know of a simple (or any) algorithm for a 3119is that the author does not know of a simple (or any) algorithm for a
2810multiple-writer-single-reader queue that works in all cases and doesn't 3120multiple-writer-single-reader queue that works in all cases and doesn't
2811need elaborate support such as pthreads. 3121need elaborate support such as pthreads or unportable memory access
3122semantics.
2812 3123
2813That means that if you want to queue data, you have to provide your own 3124That means that if you want to queue data, you have to provide your own
2814queue. But at least I can tell you how to implement locking around your 3125queue. But at least I can tell you how to implement locking around your
2815queue: 3126queue:
2816 3127
2955 3266
2956If C<timeout> is less than 0, then no timeout watcher will be 3267If C<timeout> is less than 0, then no timeout watcher will be
2957started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3268started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2958repeat = 0) will be started. C<0> is a valid timeout. 3269repeat = 0) will be started. C<0> is a valid timeout.
2959 3270
2960The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3271The callback has the type C<void (*cb)(int revents, void *arg)> and is
2961passed an C<revents> set like normal event callbacks (a combination of 3272passed an C<revents> set like normal event callbacks (a combination of
2962C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3273C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2963value passed to C<ev_once>. Note that it is possible to receive I<both> 3274value passed to C<ev_once>. Note that it is possible to receive I<both>
2964a timeout and an io event at the same time - you probably should give io 3275a timeout and an io event at the same time - you probably should give io
2965events precedence. 3276events precedence.
2966 3277
2967Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3278Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2968 3279
2969 static void stdin_ready (int revents, void *arg) 3280 static void stdin_ready (int revents, void *arg)
2970 { 3281 {
2971 if (revents & EV_READ) 3282 if (revents & EV_READ)
2972 /* stdin might have data for us, joy! */; 3283 /* stdin might have data for us, joy! */;
2973 else if (revents & EV_TIMEOUT) 3284 else if (revents & EV_TIMER)
2974 /* doh, nothing entered */; 3285 /* doh, nothing entered */;
2975 } 3286 }
2976 3287
2977 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3288 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2978 3289
2979=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2980
2981Feeds the given event set into the event loop, as if the specified event
2982had happened for the specified watcher (which must be a pointer to an
2983initialised but not necessarily started event watcher).
2984
2985=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3290=item ev_feed_fd_event (loop, int fd, int revents)
2986 3291
2987Feed an event on the given fd, as if a file descriptor backend detected 3292Feed an event on the given fd, as if a file descriptor backend detected
2988the given events it. 3293the given events it.
2989 3294
2990=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3295=item ev_feed_signal_event (loop, int signum)
2991 3296
2992Feed an event as if the given signal occurred (C<loop> must be the default 3297Feed an event as if the given signal occurred (C<loop> must be the default
2993loop!). 3298loop!).
2994 3299
2995=back 3300=back
3075 3380
3076=over 4 3381=over 4
3077 3382
3078=item ev::TYPE::TYPE () 3383=item ev::TYPE::TYPE ()
3079 3384
3080=item ev::TYPE::TYPE (struct ev_loop *) 3385=item ev::TYPE::TYPE (loop)
3081 3386
3082=item ev::TYPE::~TYPE 3387=item ev::TYPE::~TYPE
3083 3388
3084The constructor (optionally) takes an event loop to associate the watcher 3389The constructor (optionally) takes an event loop to associate the watcher
3085with. If it is omitted, it will use C<EV_DEFAULT>. 3390with. If it is omitted, it will use C<EV_DEFAULT>.
3118 myclass obj; 3423 myclass obj;
3119 ev::io iow; 3424 ev::io iow;
3120 iow.set <myclass, &myclass::io_cb> (&obj); 3425 iow.set <myclass, &myclass::io_cb> (&obj);
3121 3426
3122=item w->set (object *) 3427=item w->set (object *)
3123
3124This is an B<experimental> feature that might go away in a future version.
3125 3428
3126This is a variation of a method callback - leaving out the method to call 3429This is a variation of a method callback - leaving out the method to call
3127will default the method to C<operator ()>, which makes it possible to use 3430will default the method to C<operator ()>, which makes it possible to use
3128functor objects without having to manually specify the C<operator ()> all 3431functor objects without having to manually specify the C<operator ()> all
3129the time. Incidentally, you can then also leave out the template argument 3432the time. Incidentally, you can then also leave out the template argument
3162Example: Use a plain function as callback. 3465Example: Use a plain function as callback.
3163 3466
3164 static void io_cb (ev::io &w, int revents) { } 3467 static void io_cb (ev::io &w, int revents) { }
3165 iow.set <io_cb> (); 3468 iow.set <io_cb> ();
3166 3469
3167=item w->set (struct ev_loop *) 3470=item w->set (loop)
3168 3471
3169Associates a different C<struct ev_loop> with this watcher. You can only 3472Associates a different C<struct ev_loop> with this watcher. You can only
3170do this when the watcher is inactive (and not pending either). 3473do this when the watcher is inactive (and not pending either).
3171 3474
3172=item w->set ([arguments]) 3475=item w->set ([arguments])
3173 3476
3174Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3477Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3175called at least once. Unlike the C counterpart, an active watcher gets 3478method or a suitable start method must be called at least once. Unlike the
3176automatically stopped and restarted when reconfiguring it with this 3479C counterpart, an active watcher gets automatically stopped and restarted
3177method. 3480when reconfiguring it with this method.
3178 3481
3179=item w->start () 3482=item w->start ()
3180 3483
3181Starts the watcher. Note that there is no C<loop> argument, as the 3484Starts the watcher. Note that there is no C<loop> argument, as the
3182constructor already stores the event loop. 3485constructor already stores the event loop.
3183 3486
3487=item w->start ([arguments])
3488
3489Instead of calling C<set> and C<start> methods separately, it is often
3490convenient to wrap them in one call. Uses the same type of arguments as
3491the configure C<set> method of the watcher.
3492
3184=item w->stop () 3493=item w->stop ()
3185 3494
3186Stops the watcher if it is active. Again, no C<loop> argument. 3495Stops the watcher if it is active. Again, no C<loop> argument.
3187 3496
3188=item w->again () (C<ev::timer>, C<ev::periodic> only) 3497=item w->again () (C<ev::timer>, C<ev::periodic> only)
3200 3509
3201=back 3510=back
3202 3511
3203=back 3512=back
3204 3513
3205Example: Define a class with an IO and idle watcher, start one of them in 3514Example: Define a class with two I/O and idle watchers, start the I/O
3206the constructor. 3515watchers in the constructor.
3207 3516
3208 class myclass 3517 class myclass
3209 { 3518 {
3210 ev::io io ; void io_cb (ev::io &w, int revents); 3519 ev::io io ; void io_cb (ev::io &w, int revents);
3520 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3211 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3521 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3212 3522
3213 myclass (int fd) 3523 myclass (int fd)
3214 { 3524 {
3215 io .set <myclass, &myclass::io_cb > (this); 3525 io .set <myclass, &myclass::io_cb > (this);
3526 io2 .set <myclass, &myclass::io2_cb > (this);
3216 idle.set <myclass, &myclass::idle_cb> (this); 3527 idle.set <myclass, &myclass::idle_cb> (this);
3217 3528
3218 io.start (fd, ev::READ); 3529 io.set (fd, ev::WRITE); // configure the watcher
3530 io.start (); // start it whenever convenient
3531
3532 io2.start (fd, ev::READ); // set + start in one call
3219 } 3533 }
3220 }; 3534 };
3221 3535
3222 3536
3223=head1 OTHER LANGUAGE BINDINGS 3537=head1 OTHER LANGUAGE BINDINGS
3269=item Ocaml 3583=item Ocaml
3270 3584
3271Erkki Seppala has written Ocaml bindings for libev, to be found at 3585Erkki Seppala has written Ocaml bindings for libev, to be found at
3272L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3586L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3273 3587
3588=item Lua
3589
3590Brian Maher has written a partial interface to libev for lua (at the
3591time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3592L<http://github.com/brimworks/lua-ev>.
3593
3274=back 3594=back
3275 3595
3276 3596
3277=head1 MACRO MAGIC 3597=head1 MACRO MAGIC
3278 3598
3291loop argument"). The C<EV_A> form is used when this is the sole argument, 3611loop argument"). The C<EV_A> form is used when this is the sole argument,
3292C<EV_A_> is used when other arguments are following. Example: 3612C<EV_A_> is used when other arguments are following. Example:
3293 3613
3294 ev_unref (EV_A); 3614 ev_unref (EV_A);
3295 ev_timer_add (EV_A_ watcher); 3615 ev_timer_add (EV_A_ watcher);
3296 ev_loop (EV_A_ 0); 3616 ev_run (EV_A_ 0);
3297 3617
3298It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3618It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3299which is often provided by the following macro. 3619which is often provided by the following macro.
3300 3620
3301=item C<EV_P>, C<EV_P_> 3621=item C<EV_P>, C<EV_P_>
3341 } 3661 }
3342 3662
3343 ev_check check; 3663 ev_check check;
3344 ev_check_init (&check, check_cb); 3664 ev_check_init (&check, check_cb);
3345 ev_check_start (EV_DEFAULT_ &check); 3665 ev_check_start (EV_DEFAULT_ &check);
3346 ev_loop (EV_DEFAULT_ 0); 3666 ev_run (EV_DEFAULT_ 0);
3347 3667
3348=head1 EMBEDDING 3668=head1 EMBEDDING
3349 3669
3350Libev can (and often is) directly embedded into host 3670Libev can (and often is) directly embedded into host
3351applications. Examples of applications that embed it include the Deliantra 3671applications. Examples of applications that embed it include the Deliantra
3431 libev.m4 3751 libev.m4
3432 3752
3433=head2 PREPROCESSOR SYMBOLS/MACROS 3753=head2 PREPROCESSOR SYMBOLS/MACROS
3434 3754
3435Libev can be configured via a variety of preprocessor symbols you have to 3755Libev can be configured via a variety of preprocessor symbols you have to
3436define before including any of its files. The default in the absence of 3756define before including (or compiling) any of its files. The default in
3437autoconf is documented for every option. 3757the absence of autoconf is documented for every option.
3758
3759Symbols marked with "(h)" do not change the ABI, and can have different
3760values when compiling libev vs. including F<ev.h>, so it is permissible
3761to redefine them before including F<ev.h> without breaking compatibility
3762to a compiled library. All other symbols change the ABI, which means all
3763users of libev and the libev code itself must be compiled with compatible
3764settings.
3438 3765
3439=over 4 3766=over 4
3440 3767
3768=item EV_COMPAT3 (h)
3769
3770Backwards compatibility is a major concern for libev. This is why this
3771release of libev comes with wrappers for the functions and symbols that
3772have been renamed between libev version 3 and 4.
3773
3774You can disable these wrappers (to test compatibility with future
3775versions) by defining C<EV_COMPAT3> to C<0> when compiling your
3776sources. This has the additional advantage that you can drop the C<struct>
3777from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
3778typedef in that case.
3779
3780In some future version, the default for C<EV_COMPAT3> will become C<0>,
3781and in some even more future version the compatibility code will be
3782removed completely.
3783
3441=item EV_STANDALONE 3784=item EV_STANDALONE (h)
3442 3785
3443Must always be C<1> if you do not use autoconf configuration, which 3786Must always be C<1> if you do not use autoconf configuration, which
3444keeps libev from including F<config.h>, and it also defines dummy 3787keeps libev from including F<config.h>, and it also defines dummy
3445implementations for some libevent functions (such as logging, which is not 3788implementations for some libevent functions (such as logging, which is not
3446supported). It will also not define any of the structs usually found in 3789supported). It will also not define any of the structs usually found in
3447F<event.h> that are not directly supported by the libev core alone. 3790F<event.h> that are not directly supported by the libev core alone.
3448 3791
3449In stanbdalone mode, libev will still try to automatically deduce the 3792In standalone mode, libev will still try to automatically deduce the
3450configuration, but has to be more conservative. 3793configuration, but has to be more conservative.
3451 3794
3452=item EV_USE_MONOTONIC 3795=item EV_USE_MONOTONIC
3453 3796
3454If defined to be C<1>, libev will try to detect the availability of the 3797If defined to be C<1>, libev will try to detect the availability of the
3519be used is the winsock select). This means that it will call 3862be used is the winsock select). This means that it will call
3520C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3863C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3521it is assumed that all these functions actually work on fds, even 3864it is assumed that all these functions actually work on fds, even
3522on win32. Should not be defined on non-win32 platforms. 3865on win32. Should not be defined on non-win32 platforms.
3523 3866
3524=item EV_FD_TO_WIN32_HANDLE 3867=item EV_FD_TO_WIN32_HANDLE(fd)
3525 3868
3526If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3869If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3527file descriptors to socket handles. When not defining this symbol (the 3870file descriptors to socket handles. When not defining this symbol (the
3528default), then libev will call C<_get_osfhandle>, which is usually 3871default), then libev will call C<_get_osfhandle>, which is usually
3529correct. In some cases, programs use their own file descriptor management, 3872correct. In some cases, programs use their own file descriptor management,
3530in which case they can provide this function to map fds to socket handles. 3873in which case they can provide this function to map fds to socket handles.
3874
3875=item EV_WIN32_HANDLE_TO_FD(handle)
3876
3877If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3878using the standard C<_open_osfhandle> function. For programs implementing
3879their own fd to handle mapping, overwriting this function makes it easier
3880to do so. This can be done by defining this macro to an appropriate value.
3881
3882=item EV_WIN32_CLOSE_FD(fd)
3883
3884If programs implement their own fd to handle mapping on win32, then this
3885macro can be used to override the C<close> function, useful to unregister
3886file descriptors again. Note that the replacement function has to close
3887the underlying OS handle.
3531 3888
3532=item EV_USE_POLL 3889=item EV_USE_POLL
3533 3890
3534If defined to be C<1>, libev will compile in support for the C<poll>(2) 3891If defined to be C<1>, libev will compile in support for the C<poll>(2)
3535backend. Otherwise it will be enabled on non-win32 platforms. It 3892backend. Otherwise it will be enabled on non-win32 platforms. It
3582as well as for signal and thread safety in C<ev_async> watchers. 3939as well as for signal and thread safety in C<ev_async> watchers.
3583 3940
3584In the absence of this define, libev will use C<sig_atomic_t volatile> 3941In the absence of this define, libev will use C<sig_atomic_t volatile>
3585(from F<signal.h>), which is usually good enough on most platforms. 3942(from F<signal.h>), which is usually good enough on most platforms.
3586 3943
3587=item EV_H 3944=item EV_H (h)
3588 3945
3589The name of the F<ev.h> header file used to include it. The default if 3946The name of the F<ev.h> header file used to include it. The default if
3590undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3947undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3591used to virtually rename the F<ev.h> header file in case of conflicts. 3948used to virtually rename the F<ev.h> header file in case of conflicts.
3592 3949
3593=item EV_CONFIG_H 3950=item EV_CONFIG_H (h)
3594 3951
3595If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3952If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3596F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3953F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3597C<EV_H>, above. 3954C<EV_H>, above.
3598 3955
3599=item EV_EVENT_H 3956=item EV_EVENT_H (h)
3600 3957
3601Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3958Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3602of how the F<event.h> header can be found, the default is C<"event.h">. 3959of how the F<event.h> header can be found, the default is C<"event.h">.
3603 3960
3604=item EV_PROTOTYPES 3961=item EV_PROTOTYPES (h)
3605 3962
3606If defined to be C<0>, then F<ev.h> will not define any function 3963If defined to be C<0>, then F<ev.h> will not define any function
3607prototypes, but still define all the structs and other symbols. This is 3964prototypes, but still define all the structs and other symbols. This is
3608occasionally useful if you want to provide your own wrapper functions 3965occasionally useful if you want to provide your own wrapper functions
3609around libev functions. 3966around libev functions.
3631fine. 3988fine.
3632 3989
3633If your embedding application does not need any priorities, defining these 3990If your embedding application does not need any priorities, defining these
3634both to C<0> will save some memory and CPU. 3991both to C<0> will save some memory and CPU.
3635 3992
3636=item EV_PERIODIC_ENABLE 3993=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
3994EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
3995EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3637 3996
3638If undefined or defined to be C<1>, then periodic timers are supported. If 3997If undefined or defined to be C<1> (and the platform supports it), then
3639defined to be C<0>, then they are not. Disabling them saves a few kB of 3998the respective watcher type is supported. If defined to be C<0>, then it
3640code. 3999is not. Disabling watcher types mainly saves code size.
3641 4000
3642=item EV_IDLE_ENABLE 4001=item EV_FEATURES
3643
3644If undefined or defined to be C<1>, then idle watchers are supported. If
3645defined to be C<0>, then they are not. Disabling them saves a few kB of
3646code.
3647
3648=item EV_EMBED_ENABLE
3649
3650If undefined or defined to be C<1>, then embed watchers are supported. If
3651defined to be C<0>, then they are not. Embed watchers rely on most other
3652watcher types, which therefore must not be disabled.
3653
3654=item EV_STAT_ENABLE
3655
3656If undefined or defined to be C<1>, then stat watchers are supported. If
3657defined to be C<0>, then they are not.
3658
3659=item EV_FORK_ENABLE
3660
3661If undefined or defined to be C<1>, then fork watchers are supported. If
3662defined to be C<0>, then they are not.
3663
3664=item EV_ASYNC_ENABLE
3665
3666If undefined or defined to be C<1>, then async watchers are supported. If
3667defined to be C<0>, then they are not.
3668
3669=item EV_MINIMAL
3670 4002
3671If you need to shave off some kilobytes of code at the expense of some 4003If you need to shave off some kilobytes of code at the expense of some
3672speed, define this symbol to C<1>. Currently this is used to override some 4004speed (but with the full API), you can define this symbol to request
3673inlining decisions, saves roughly 30% code size on amd64. It also selects a 4005certain subsets of functionality. The default is to enable all features
3674much smaller 2-heap for timer management over the default 4-heap. 4006that can be enabled on the platform.
4007
4008A typical way to use this symbol is to define it to C<0> (or to a bitset
4009with some broad features you want) and then selectively re-enable
4010additional parts you want, for example if you want everything minimal,
4011but multiple event loop support, async and child watchers and the poll
4012backend, use this:
4013
4014 #define EV_FEATURES 0
4015 #define EV_MULTIPLICITY 1
4016 #define EV_USE_POLL 1
4017 #define EV_CHILD_ENABLE 1
4018 #define EV_ASYNC_ENABLE 1
4019
4020The actual value is a bitset, it can be a combination of the following
4021values:
4022
4023=over 4
4024
4025=item C<1> - faster/larger code
4026
4027Use larger code to speed up some operations.
4028
4029Currently this is used to override some inlining decisions (enlarging the
4030code size by roughly 30% on amd64).
4031
4032When optimising for size, use of compiler flags such as C<-Os> with
4033gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4034assertions.
4035
4036=item C<2> - faster/larger data structures
4037
4038Replaces the small 2-heap for timer management by a faster 4-heap, larger
4039hash table sizes and so on. This will usually further increase code size
4040and can additionally have an effect on the size of data structures at
4041runtime.
4042
4043=item C<4> - full API configuration
4044
4045This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4046enables multiplicity (C<EV_MULTIPLICITY>=1).
4047
4048=item C<8> - full API
4049
4050This enables a lot of the "lesser used" API functions. See C<ev.h> for
4051details on which parts of the API are still available without this
4052feature, and do not complain if this subset changes over time.
4053
4054=item C<16> - enable all optional watcher types
4055
4056Enables all optional watcher types. If you want to selectively enable
4057only some watcher types other than I/O and timers (e.g. prepare,
4058embed, async, child...) you can enable them manually by defining
4059C<EV_watchertype_ENABLE> to C<1> instead.
4060
4061=item C<32> - enable all backends
4062
4063This enables all backends - without this feature, you need to enable at
4064least one backend manually (C<EV_USE_SELECT> is a good choice).
4065
4066=item C<64> - enable OS-specific "helper" APIs
4067
4068Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
4069default.
4070
4071=back
4072
4073Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
4074reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
4075code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
4076watchers, timers and monotonic clock support.
4077
4078With an intelligent-enough linker (gcc+binutils are intelligent enough
4079when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4080your program might be left out as well - a binary starting a timer and an
4081I/O watcher then might come out at only 5Kb.
4082
4083=item EV_AVOID_STDIO
4084
4085If this is set to C<1> at compiletime, then libev will avoid using stdio
4086functions (printf, scanf, perror etc.). This will increase the code size
4087somewhat, but if your program doesn't otherwise depend on stdio and your
4088libc allows it, this avoids linking in the stdio library which is quite
4089big.
4090
4091Note that error messages might become less precise when this option is
4092enabled.
4093
4094=item EV_NSIG
4095
4096The highest supported signal number, +1 (or, the number of
4097signals): Normally, libev tries to deduce the maximum number of signals
4098automatically, but sometimes this fails, in which case it can be
4099specified. Also, using a lower number than detected (C<32> should be
4100good for about any system in existence) can save some memory, as libev
4101statically allocates some 12-24 bytes per signal number.
3675 4102
3676=item EV_PID_HASHSIZE 4103=item EV_PID_HASHSIZE
3677 4104
3678C<ev_child> watchers use a small hash table to distribute workload by 4105C<ev_child> watchers use a small hash table to distribute workload by
3679pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 4106pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3680than enough. If you need to manage thousands of children you might want to 4107usually more than enough. If you need to manage thousands of children you
3681increase this value (I<must> be a power of two). 4108might want to increase this value (I<must> be a power of two).
3682 4109
3683=item EV_INOTIFY_HASHSIZE 4110=item EV_INOTIFY_HASHSIZE
3684 4111
3685C<ev_stat> watchers use a small hash table to distribute workload by 4112C<ev_stat> watchers use a small hash table to distribute workload by
3686inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4113inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3687usually more than enough. If you need to manage thousands of C<ev_stat> 4114disabled), usually more than enough. If you need to manage thousands of
3688watchers you might want to increase this value (I<must> be a power of 4115C<ev_stat> watchers you might want to increase this value (I<must> be a
3689two). 4116power of two).
3690 4117
3691=item EV_USE_4HEAP 4118=item EV_USE_4HEAP
3692 4119
3693Heaps are not very cache-efficient. To improve the cache-efficiency of the 4120Heaps are not very cache-efficient. To improve the cache-efficiency of the
3694timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4121timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3695to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4122to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3696faster performance with many (thousands) of watchers. 4123faster performance with many (thousands) of watchers.
3697 4124
3698The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4125The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3699(disabled). 4126will be C<0>.
3700 4127
3701=item EV_HEAP_CACHE_AT 4128=item EV_HEAP_CACHE_AT
3702 4129
3703Heaps are not very cache-efficient. To improve the cache-efficiency of the 4130Heaps are not very cache-efficient. To improve the cache-efficiency of the
3704timer and periodics heaps, libev can cache the timestamp (I<at>) within 4131timer and periodics heaps, libev can cache the timestamp (I<at>) within
3705the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4132the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3706which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4133which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3707but avoids random read accesses on heap changes. This improves performance 4134but avoids random read accesses on heap changes. This improves performance
3708noticeably with many (hundreds) of watchers. 4135noticeably with many (hundreds) of watchers.
3709 4136
3710The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4137The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3711(disabled). 4138will be C<0>.
3712 4139
3713=item EV_VERIFY 4140=item EV_VERIFY
3714 4141
3715Controls how much internal verification (see C<ev_loop_verify ()>) will 4142Controls how much internal verification (see C<ev_verify ()>) will
3716be done: If set to C<0>, no internal verification code will be compiled 4143be done: If set to C<0>, no internal verification code will be compiled
3717in. If set to C<1>, then verification code will be compiled in, but not 4144in. If set to C<1>, then verification code will be compiled in, but not
3718called. If set to C<2>, then the internal verification code will be 4145called. If set to C<2>, then the internal verification code will be
3719called once per loop, which can slow down libev. If set to C<3>, then the 4146called once per loop, which can slow down libev. If set to C<3>, then the
3720verification code will be called very frequently, which will slow down 4147verification code will be called very frequently, which will slow down
3721libev considerably. 4148libev considerably.
3722 4149
3723The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4150The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3724C<0>. 4151will be C<0>.
3725 4152
3726=item EV_COMMON 4153=item EV_COMMON
3727 4154
3728By default, all watchers have a C<void *data> member. By redefining 4155By default, all watchers have a C<void *data> member. By redefining
3729this macro to a something else you can include more and other types of 4156this macro to something else you can include more and other types of
3730members. You have to define it each time you include one of the files, 4157members. You have to define it each time you include one of the files,
3731though, and it must be identical each time. 4158though, and it must be identical each time.
3732 4159
3733For example, the perl EV module uses something like this: 4160For example, the perl EV module uses something like this:
3734 4161
3787file. 4214file.
3788 4215
3789The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4216The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3790that everybody includes and which overrides some configure choices: 4217that everybody includes and which overrides some configure choices:
3791 4218
3792 #define EV_MINIMAL 1 4219 #define EV_FEATURES 8
3793 #define EV_USE_POLL 0 4220 #define EV_USE_SELECT 1
3794 #define EV_MULTIPLICITY 0
3795 #define EV_PERIODIC_ENABLE 0 4221 #define EV_PREPARE_ENABLE 1
4222 #define EV_IDLE_ENABLE 1
3796 #define EV_STAT_ENABLE 0 4223 #define EV_SIGNAL_ENABLE 1
3797 #define EV_FORK_ENABLE 0 4224 #define EV_CHILD_ENABLE 1
4225 #define EV_USE_STDEXCEPT 0
3798 #define EV_CONFIG_H <config.h> 4226 #define EV_CONFIG_H <config.h>
3799 #define EV_MINPRI 0
3800 #define EV_MAXPRI 0
3801 4227
3802 #include "ev++.h" 4228 #include "ev++.h"
3803 4229
3804And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4230And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3805 4231
3865default loop and triggering an C<ev_async> watcher from the default loop 4291default loop and triggering an C<ev_async> watcher from the default loop
3866watcher callback into the event loop interested in the signal. 4292watcher callback into the event loop interested in the signal.
3867 4293
3868=back 4294=back
3869 4295
4296=head4 THREAD LOCKING EXAMPLE
4297
4298Here is a fictitious example of how to run an event loop in a different
4299thread than where callbacks are being invoked and watchers are
4300created/added/removed.
4301
4302For a real-world example, see the C<EV::Loop::Async> perl module,
4303which uses exactly this technique (which is suited for many high-level
4304languages).
4305
4306The example uses a pthread mutex to protect the loop data, a condition
4307variable to wait for callback invocations, an async watcher to notify the
4308event loop thread and an unspecified mechanism to wake up the main thread.
4309
4310First, you need to associate some data with the event loop:
4311
4312 typedef struct {
4313 mutex_t lock; /* global loop lock */
4314 ev_async async_w;
4315 thread_t tid;
4316 cond_t invoke_cv;
4317 } userdata;
4318
4319 void prepare_loop (EV_P)
4320 {
4321 // for simplicity, we use a static userdata struct.
4322 static userdata u;
4323
4324 ev_async_init (&u->async_w, async_cb);
4325 ev_async_start (EV_A_ &u->async_w);
4326
4327 pthread_mutex_init (&u->lock, 0);
4328 pthread_cond_init (&u->invoke_cv, 0);
4329
4330 // now associate this with the loop
4331 ev_set_userdata (EV_A_ u);
4332 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4333 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4334
4335 // then create the thread running ev_loop
4336 pthread_create (&u->tid, 0, l_run, EV_A);
4337 }
4338
4339The callback for the C<ev_async> watcher does nothing: the watcher is used
4340solely to wake up the event loop so it takes notice of any new watchers
4341that might have been added:
4342
4343 static void
4344 async_cb (EV_P_ ev_async *w, int revents)
4345 {
4346 // just used for the side effects
4347 }
4348
4349The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4350protecting the loop data, respectively.
4351
4352 static void
4353 l_release (EV_P)
4354 {
4355 userdata *u = ev_userdata (EV_A);
4356 pthread_mutex_unlock (&u->lock);
4357 }
4358
4359 static void
4360 l_acquire (EV_P)
4361 {
4362 userdata *u = ev_userdata (EV_A);
4363 pthread_mutex_lock (&u->lock);
4364 }
4365
4366The event loop thread first acquires the mutex, and then jumps straight
4367into C<ev_run>:
4368
4369 void *
4370 l_run (void *thr_arg)
4371 {
4372 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4373
4374 l_acquire (EV_A);
4375 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4376 ev_run (EV_A_ 0);
4377 l_release (EV_A);
4378
4379 return 0;
4380 }
4381
4382Instead of invoking all pending watchers, the C<l_invoke> callback will
4383signal the main thread via some unspecified mechanism (signals? pipe
4384writes? C<Async::Interrupt>?) and then waits until all pending watchers
4385have been called (in a while loop because a) spurious wakeups are possible
4386and b) skipping inter-thread-communication when there are no pending
4387watchers is very beneficial):
4388
4389 static void
4390 l_invoke (EV_P)
4391 {
4392 userdata *u = ev_userdata (EV_A);
4393
4394 while (ev_pending_count (EV_A))
4395 {
4396 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4397 pthread_cond_wait (&u->invoke_cv, &u->lock);
4398 }
4399 }
4400
4401Now, whenever the main thread gets told to invoke pending watchers, it
4402will grab the lock, call C<ev_invoke_pending> and then signal the loop
4403thread to continue:
4404
4405 static void
4406 real_invoke_pending (EV_P)
4407 {
4408 userdata *u = ev_userdata (EV_A);
4409
4410 pthread_mutex_lock (&u->lock);
4411 ev_invoke_pending (EV_A);
4412 pthread_cond_signal (&u->invoke_cv);
4413 pthread_mutex_unlock (&u->lock);
4414 }
4415
4416Whenever you want to start/stop a watcher or do other modifications to an
4417event loop, you will now have to lock:
4418
4419 ev_timer timeout_watcher;
4420 userdata *u = ev_userdata (EV_A);
4421
4422 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4423
4424 pthread_mutex_lock (&u->lock);
4425 ev_timer_start (EV_A_ &timeout_watcher);
4426 ev_async_send (EV_A_ &u->async_w);
4427 pthread_mutex_unlock (&u->lock);
4428
4429Note that sending the C<ev_async> watcher is required because otherwise
4430an event loop currently blocking in the kernel will have no knowledge
4431about the newly added timer. By waking up the loop it will pick up any new
4432watchers in the next event loop iteration.
4433
3870=head3 COROUTINES 4434=head3 COROUTINES
3871 4435
3872Libev is very accommodating to coroutines ("cooperative threads"): 4436Libev is very accommodating to coroutines ("cooperative threads"):
3873libev fully supports nesting calls to its functions from different 4437libev fully supports nesting calls to its functions from different
3874coroutines (e.g. you can call C<ev_loop> on the same loop from two 4438coroutines (e.g. you can call C<ev_run> on the same loop from two
3875different coroutines, and switch freely between both coroutines running the 4439different coroutines, and switch freely between both coroutines running
3876loop, as long as you don't confuse yourself). The only exception is that 4440the loop, as long as you don't confuse yourself). The only exception is
3877you must not do this from C<ev_periodic> reschedule callbacks. 4441that you must not do this from C<ev_periodic> reschedule callbacks.
3878 4442
3879Care has been taken to ensure that libev does not keep local state inside 4443Care has been taken to ensure that libev does not keep local state inside
3880C<ev_loop>, and other calls do not usually allow for coroutine switches as 4444C<ev_run>, and other calls do not usually allow for coroutine switches as
3881they do not call any callbacks. 4445they do not call any callbacks.
3882 4446
3883=head2 COMPILER WARNINGS 4447=head2 COMPILER WARNINGS
3884 4448
3885Depending on your compiler and compiler settings, you might get no or a 4449Depending on your compiler and compiler settings, you might get no or a
3896maintainable. 4460maintainable.
3897 4461
3898And of course, some compiler warnings are just plain stupid, or simply 4462And of course, some compiler warnings are just plain stupid, or simply
3899wrong (because they don't actually warn about the condition their message 4463wrong (because they don't actually warn about the condition their message
3900seems to warn about). For example, certain older gcc versions had some 4464seems to warn about). For example, certain older gcc versions had some
3901warnings that resulted an extreme number of false positives. These have 4465warnings that resulted in an extreme number of false positives. These have
3902been fixed, but some people still insist on making code warn-free with 4466been fixed, but some people still insist on making code warn-free with
3903such buggy versions. 4467such buggy versions.
3904 4468
3905While libev is written to generate as few warnings as possible, 4469While libev is written to generate as few warnings as possible,
3906"warn-free" code is not a goal, and it is recommended not to build libev 4470"warn-free" code is not a goal, and it is recommended not to build libev
3942I suggest using suppression lists. 4506I suggest using suppression lists.
3943 4507
3944 4508
3945=head1 PORTABILITY NOTES 4509=head1 PORTABILITY NOTES
3946 4510
4511=head2 GNU/LINUX 32 BIT LIMITATIONS
4512
4513GNU/Linux is the only common platform that supports 64 bit file/large file
4514interfaces but I<disables> them by default.
4515
4516That means that libev compiled in the default environment doesn't support
4517files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4518
4519Unfortunately, many programs try to work around this GNU/Linux issue
4520by enabling the large file API, which makes them incompatible with the
4521standard libev compiled for their system.
4522
4523Likewise, libev cannot enable the large file API itself as this would
4524suddenly make it incompatible to the default compile time environment,
4525i.e. all programs not using special compile switches.
4526
4527=head2 OS/X AND DARWIN BUGS
4528
4529The whole thing is a bug if you ask me - basically any system interface
4530you touch is broken, whether it is locales, poll, kqueue or even the
4531OpenGL drivers.
4532
4533=head3 C<kqueue> is buggy
4534
4535The kqueue syscall is broken in all known versions - most versions support
4536only sockets, many support pipes.
4537
4538Libev tries to work around this by not using C<kqueue> by default on this
4539rotten platform, but of course you can still ask for it when creating a
4540loop - embedding a socket-only kqueue loop into a select-based one is
4541probably going to work well.
4542
4543=head3 C<poll> is buggy
4544
4545Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4546implementation by something calling C<kqueue> internally around the 10.5.6
4547release, so now C<kqueue> I<and> C<poll> are broken.
4548
4549Libev tries to work around this by not using C<poll> by default on
4550this rotten platform, but of course you can still ask for it when creating
4551a loop.
4552
4553=head3 C<select> is buggy
4554
4555All that's left is C<select>, and of course Apple found a way to fuck this
4556one up as well: On OS/X, C<select> actively limits the number of file
4557descriptors you can pass in to 1024 - your program suddenly crashes when
4558you use more.
4559
4560There is an undocumented "workaround" for this - defining
4561C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4562work on OS/X.
4563
4564=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4565
4566=head3 C<errno> reentrancy
4567
4568The default compile environment on Solaris is unfortunately so
4569thread-unsafe that you can't even use components/libraries compiled
4570without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4571defined by default. A valid, if stupid, implementation choice.
4572
4573If you want to use libev in threaded environments you have to make sure
4574it's compiled with C<_REENTRANT> defined.
4575
4576=head3 Event port backend
4577
4578The scalable event interface for Solaris is called "event
4579ports". Unfortunately, this mechanism is very buggy in all major
4580releases. If you run into high CPU usage, your program freezes or you get
4581a large number of spurious wakeups, make sure you have all the relevant
4582and latest kernel patches applied. No, I don't know which ones, but there
4583are multiple ones to apply, and afterwards, event ports actually work
4584great.
4585
4586If you can't get it to work, you can try running the program by setting
4587the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4588C<select> backends.
4589
4590=head2 AIX POLL BUG
4591
4592AIX unfortunately has a broken C<poll.h> header. Libev works around
4593this by trying to avoid the poll backend altogether (i.e. it's not even
4594compiled in), which normally isn't a big problem as C<select> works fine
4595with large bitsets on AIX, and AIX is dead anyway.
4596
3947=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4597=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4598
4599=head3 General issues
3948 4600
3949Win32 doesn't support any of the standards (e.g. POSIX) that libev 4601Win32 doesn't support any of the standards (e.g. POSIX) that libev
3950requires, and its I/O model is fundamentally incompatible with the POSIX 4602requires, and its I/O model is fundamentally incompatible with the POSIX
3951model. Libev still offers limited functionality on this platform in 4603model. Libev still offers limited functionality on this platform in
3952the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4604the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3953descriptors. This only applies when using Win32 natively, not when using 4605descriptors. This only applies when using Win32 natively, not when using
3954e.g. cygwin. 4606e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4607as every compielr comes with a slightly differently broken/incompatible
4608environment.
3955 4609
3956Lifting these limitations would basically require the full 4610Lifting these limitations would basically require the full
3957re-implementation of the I/O system. If you are into these kinds of 4611re-implementation of the I/O system. If you are into this kind of thing,
3958things, then note that glib does exactly that for you in a very portable 4612then note that glib does exactly that for you in a very portable way (note
3959way (note also that glib is the slowest event library known to man). 4613also that glib is the slowest event library known to man).
3960 4614
3961There is no supported compilation method available on windows except 4615There is no supported compilation method available on windows except
3962embedding it into other applications. 4616embedding it into other applications.
3963 4617
3964Sensible signal handling is officially unsupported by Microsoft - libev 4618Sensible signal handling is officially unsupported by Microsoft - libev
3992you do I<not> compile the F<ev.c> or any other embedded source files!): 4646you do I<not> compile the F<ev.c> or any other embedded source files!):
3993 4647
3994 #include "evwrap.h" 4648 #include "evwrap.h"
3995 #include "ev.c" 4649 #include "ev.c"
3996 4650
3997=over 4
3998
3999=item The winsocket select function 4651=head3 The winsocket C<select> function
4000 4652
4001The winsocket C<select> function doesn't follow POSIX in that it 4653The winsocket C<select> function doesn't follow POSIX in that it
4002requires socket I<handles> and not socket I<file descriptors> (it is 4654requires socket I<handles> and not socket I<file descriptors> (it is
4003also extremely buggy). This makes select very inefficient, and also 4655also extremely buggy). This makes select very inefficient, and also
4004requires a mapping from file descriptors to socket handles (the Microsoft 4656requires a mapping from file descriptors to socket handles (the Microsoft
4013 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4665 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
4014 4666
4015Note that winsockets handling of fd sets is O(n), so you can easily get a 4667Note that winsockets handling of fd sets is O(n), so you can easily get a
4016complexity in the O(n²) range when using win32. 4668complexity in the O(n²) range when using win32.
4017 4669
4018=item Limited number of file descriptors 4670=head3 Limited number of file descriptors
4019 4671
4020Windows has numerous arbitrary (and low) limits on things. 4672Windows has numerous arbitrary (and low) limits on things.
4021 4673
4022Early versions of winsocket's select only supported waiting for a maximum 4674Early versions of winsocket's select only supported waiting for a maximum
4023of C<64> handles (probably owning to the fact that all windows kernels 4675of C<64> handles (probably owning to the fact that all windows kernels
4038runtime libraries. This might get you to about C<512> or C<2048> sockets 4690runtime libraries. This might get you to about C<512> or C<2048> sockets
4039(depending on windows version and/or the phase of the moon). To get more, 4691(depending on windows version and/or the phase of the moon). To get more,
4040you need to wrap all I/O functions and provide your own fd management, but 4692you need to wrap all I/O functions and provide your own fd management, but
4041the cost of calling select (O(n²)) will likely make this unworkable. 4693the cost of calling select (O(n²)) will likely make this unworkable.
4042 4694
4043=back
4044
4045=head2 PORTABILITY REQUIREMENTS 4695=head2 PORTABILITY REQUIREMENTS
4046 4696
4047In addition to a working ISO-C implementation and of course the 4697In addition to a working ISO-C implementation and of course the
4048backend-specific APIs, libev relies on a few additional extensions: 4698backend-specific APIs, libev relies on a few additional extensions:
4049 4699
4087watchers. 4737watchers.
4088 4738
4089=item C<double> must hold a time value in seconds with enough accuracy 4739=item C<double> must hold a time value in seconds with enough accuracy
4090 4740
4091The type C<double> is used to represent timestamps. It is required to 4741The type C<double> is used to represent timestamps. It is required to
4092have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4742have at least 51 bits of mantissa (and 9 bits of exponent), which is
4093enough for at least into the year 4000. This requirement is fulfilled by 4743good enough for at least into the year 4000 with millisecond accuracy
4744(the design goal for libev). This requirement is overfulfilled by
4094implementations implementing IEEE 754, which is basically all existing 4745implementations using IEEE 754, which is basically all existing ones. With
4095ones. With IEEE 754 doubles, you get microsecond accuracy until at least 4746IEEE 754 doubles, you get microsecond accuracy until at least 2200.
40962200.
4097 4747
4098=back 4748=back
4099 4749
4100If you know of other additional requirements drop me a note. 4750If you know of other additional requirements drop me a note.
4101 4751
4169involves iterating over all running async watchers or all signal numbers. 4819involves iterating over all running async watchers or all signal numbers.
4170 4820
4171=back 4821=back
4172 4822
4173 4823
4824=head1 PORTING FROM LIBEV 3.X TO 4.X
4825
4826The major version 4 introduced some minor incompatible changes to the API.
4827
4828At the moment, the C<ev.h> header file tries to implement superficial
4829compatibility, so most programs should still compile. Those might be
4830removed in later versions of libev, so better update early than late.
4831
4832=over 4
4833
4834=item function/symbol renames
4835
4836A number of functions and symbols have been renamed:
4837
4838 ev_loop => ev_run
4839 EVLOOP_NONBLOCK => EVRUN_NOWAIT
4840 EVLOOP_ONESHOT => EVRUN_ONCE
4841
4842 ev_unloop => ev_break
4843 EVUNLOOP_CANCEL => EVBREAK_CANCEL
4844 EVUNLOOP_ONE => EVBREAK_ONE
4845 EVUNLOOP_ALL => EVBREAK_ALL
4846
4847 EV_TIMEOUT => EV_TIMER
4848
4849 ev_loop_count => ev_iteration
4850 ev_loop_depth => ev_depth
4851 ev_loop_verify => ev_verify
4852
4853Most functions working on C<struct ev_loop> objects don't have an
4854C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
4855associated constants have been renamed to not collide with the C<struct
4856ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4857as all other watcher types. Note that C<ev_loop_fork> is still called
4858C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4859typedef.
4860
4861=item C<EV_COMPAT3> backwards compatibility mechanism
4862
4863The backward compatibility mechanism can be controlled by
4864C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4865section.
4866
4867=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4868
4869The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4870mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4871and work, but the library code will of course be larger.
4872
4873=back
4874
4875
4174=head1 GLOSSARY 4876=head1 GLOSSARY
4175 4877
4176=over 4 4878=over 4
4177 4879
4178=item active 4880=item active
4179 4881
4180A watcher is active as long as it has been started (has been attached to 4882A watcher is active as long as it has been started and not yet stopped.
4181an event loop) but not yet stopped (disassociated from the event loop). 4883See L<WATCHER STATES> for details.
4182 4884
4183=item application 4885=item application
4184 4886
4185In this document, an application is whatever is using libev. 4887In this document, an application is whatever is using libev.
4888
4889=item backend
4890
4891The part of the code dealing with the operating system interfaces.
4186 4892
4187=item callback 4893=item callback
4188 4894
4189The address of a function that is called when some event has been 4895The address of a function that is called when some event has been
4190detected. Callbacks are being passed the event loop, the watcher that 4896detected. Callbacks are being passed the event loop, the watcher that
4191received the event, and the actual event bitset. 4897received the event, and the actual event bitset.
4192 4898
4193=item callback invocation 4899=item callback/watcher invocation
4194 4900
4195The act of calling the callback associated with a watcher. 4901The act of calling the callback associated with a watcher.
4196 4902
4197=item event 4903=item event
4198 4904
4199A change of state of some external event, such as data now being available 4905A change of state of some external event, such as data now being available
4200for reading on a file descriptor, time having passed or simply not having 4906for reading on a file descriptor, time having passed or simply not having
4201any other events happening anymore. 4907any other events happening anymore.
4202 4908
4203In libev, events are represented as single bits (such as C<EV_READ> or 4909In libev, events are represented as single bits (such as C<EV_READ> or
4204C<EV_TIMEOUT>). 4910C<EV_TIMER>).
4205 4911
4206=item event library 4912=item event library
4207 4913
4208A software package implementing an event model and loop. 4914A software package implementing an event model and loop.
4209 4915
4217The model used to describe how an event loop handles and processes 4923The model used to describe how an event loop handles and processes
4218watchers and events. 4924watchers and events.
4219 4925
4220=item pending 4926=item pending
4221 4927
4222A watcher is pending as soon as the corresponding event has been detected, 4928A watcher is pending as soon as the corresponding event has been
4223and stops being pending as soon as the watcher will be invoked or its 4929detected. See L<WATCHER STATES> for details.
4224pending status is explicitly cleared by the application.
4225
4226A watcher can be pending, but not active. Stopping a watcher also clears
4227its pending status.
4228 4930
4229=item real time 4931=item real time
4230 4932
4231The physical time that is observed. It is apparently strictly monotonic :) 4933The physical time that is observed. It is apparently strictly monotonic :)
4232 4934
4239=item watcher 4941=item watcher
4240 4942
4241A data structure that describes interest in certain events. Watchers need 4943A data structure that describes interest in certain events. Watchers need
4242to be started (attached to an event loop) before they can receive events. 4944to be started (attached to an event loop) before they can receive events.
4243 4945
4244=item watcher invocation
4245
4246The act of calling the callback associated with a watcher.
4247
4248=back 4946=back
4249 4947
4250=head1 AUTHOR 4948=head1 AUTHOR
4251 4949
4252Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 4950Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines