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

Comparing libev/ev.pod (file contents):
Revision 1.235 by root, Thu Apr 16 07:50:39 2009 UTC vs.
Revision 1.327 by root, Sun Oct 24 20:05:43 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 {
47 // use the default event loop unless you have special needs 47 // use the default event loop unless you have special needs
48 struct ev_loop *loop = ev_default_loop (0); 48 struct ev_loop *loop = EV_DEFAULT;
49 49
50 // initialise an io watcher, then start it 50 // initialise an io watcher, then start it
51 // this one will watch for stdin to become readable 51 // this one will watch for stdin to become readable
52 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); 52 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
53 ev_io_start (loop, &stdin_watcher); 53 ev_io_start (loop, &stdin_watcher);
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
67=head1 DESCRIPTION 67=head1 ABOUT THIS DOCUMENT
68
69This document documents the libev software package.
68 70
69The newest version of this document is also available as an html-formatted 71The newest version of this document is also available as an html-formatted
70web page you might find easier to navigate when reading it for the first 72web page you might find easier to navigate when reading it for the first
71time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>. 73time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
74
75While this document tries to be as complete as possible in documenting
76libev, its usage and the rationale behind its design, it is not a tutorial
77on event-based programming, nor will it introduce event-based programming
78with libev.
79
80Familiarity with event based programming techniques in general is assumed
81throughout this document.
82
83=head1 ABOUT LIBEV
72 84
73Libev is an event loop: you register interest in certain events (such as a 85Libev is an event loop: you register interest in certain events (such as a
74file descriptor being readable or a timeout occurring), and it will manage 86file descriptor being readable or a timeout occurring), and it will manage
75these event sources and provide your program with events. 87these event sources and provide your program with events.
76 88
86=head2 FEATURES 98=head2 FEATURES
87 99
88Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
89BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
90for file descriptor events (C<ev_io>), the Linux C<inotify> interface 102for file descriptor events (C<ev_io>), the Linux C<inotify> interface
91(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 103(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
92with customised rescheduling (C<ev_periodic>), synchronous signals 104inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
93(C<ev_signal>), process status change events (C<ev_child>), and event 105timers (C<ev_timer>), absolute timers with customised rescheduling
94watchers dealing with the event loop mechanism itself (C<ev_idle>, 106(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
95C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as 107change events (C<ev_child>), and event watchers dealing with the event
96file watchers (C<ev_stat>) and even limited support for fork events 108loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
97(C<ev_fork>). 109C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
110limited support for fork events (C<ev_fork>).
98 111
99It also is quite fast (see this 112It also is quite fast (see this
100L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 113L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
101for example). 114for example).
102 115
105Libev is very configurable. In this manual the default (and most common) 118Libev is very configurable. In this manual the default (and most common)
106configuration will be described, which supports multiple event loops. For 119configuration will be described, which supports multiple event loops. For
107more info about various configuration options please have a look at 120more info about various configuration options please have a look at
108B<EMBED> section in this manual. If libev was configured without support 121B<EMBED> section in this manual. If libev was configured without support
109for multiple event loops, then all functions taking an initial argument of 122for multiple event loops, then all functions taking an initial argument of
110name C<loop> (which is always of type C<ev_loop *>) will not have 123name C<loop> (which is always of type C<struct ev_loop *>) will not have
111this argument. 124this argument.
112 125
113=head2 TIME REPRESENTATION 126=head2 TIME REPRESENTATION
114 127
115Libev represents time as a single floating point number, representing the 128Libev represents time as a single floating point number, representing
116(fractional) number of seconds since the (POSIX) epoch (somewhere near 129the (fractional) number of seconds since the (POSIX) epoch (in practice
117the beginning of 1970, details are complicated, don't ask). This type is 130somewhere near the beginning of 1970, details are complicated, don't
118called C<ev_tstamp>, which is what you should use too. It usually aliases 131ask). This type is called C<ev_tstamp>, which is what you should use
119to the C<double> type in C, and when you need to do any calculations on 132too. It usually aliases to the C<double> type in C. When you need to do
120it, you should treat it as some floating point value. Unlike the name 133any calculations on it, you should treat it as some floating point value.
134
121component C<stamp> might indicate, it is also used for time differences 135Unlike the name component C<stamp> might indicate, it is also used for
122throughout libev. 136time differences (e.g. delays) throughout libev.
123 137
124=head1 ERROR HANDLING 138=head1 ERROR HANDLING
125 139
126Libev knows three classes of errors: operating system errors, usage errors 140Libev knows three classes of errors: operating system errors, usage errors
127and internal errors (bugs). 141and internal errors (bugs).
151 165
152=item ev_tstamp ev_time () 166=item ev_tstamp ev_time ()
153 167
154Returns 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
155C<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
156you actually want to know. 170you actually want to know. Also interesting is the combination of
171C<ev_update_now> and C<ev_now>.
157 172
158=item ev_sleep (ev_tstamp interval) 173=item ev_sleep (ev_tstamp interval)
159 174
160Sleep for the given interval: The current thread will be blocked until 175Sleep for the given interval: The current thread will be blocked until
161either it is interrupted or the given time interval has passed. Basically 176either it is interrupted or the given time interval has passed. Basically
178as this indicates an incompatible change. Minor versions are usually 193as this indicates an incompatible change. Minor versions are usually
179compatible to older versions, so a larger minor version alone is usually 194compatible to older versions, so a larger minor version alone is usually
180not a problem. 195not a problem.
181 196
182Example: Make sure we haven't accidentally been linked against the wrong 197Example: Make sure we haven't accidentally been linked against the wrong
183version. 198version (note, however, that this will not detect other ABI mismatches,
199such as LFS or reentrancy).
184 200
185 assert (("libev version mismatch", 201 assert (("libev version mismatch",
186 ev_version_major () == EV_VERSION_MAJOR 202 ev_version_major () == EV_VERSION_MAJOR
187 && ev_version_minor () >= EV_VERSION_MINOR)); 203 && ev_version_minor () >= EV_VERSION_MINOR));
188 204
199 assert (("sorry, no epoll, no sex", 215 assert (("sorry, no epoll, no sex",
200 ev_supported_backends () & EVBACKEND_EPOLL)); 216 ev_supported_backends () & EVBACKEND_EPOLL));
201 217
202=item unsigned int ev_recommended_backends () 218=item unsigned int ev_recommended_backends ()
203 219
204Return the set of all backends compiled into this binary of libev and also 220Return the set of all backends compiled into this binary of libev and
205recommended for this platform. This set is often smaller than the one 221also recommended for this platform, meaning it will work for most file
222descriptor types. This set is often smaller than the one returned by
206returned by C<ev_supported_backends>, as for example kqueue is broken on 223C<ev_supported_backends>, as for example kqueue is broken on most BSDs
207most BSDs and will not be auto-detected unless you explicitly request it 224and will not be auto-detected unless you explicitly request it (assuming
208(assuming you know what you are doing). This is the set of backends that 225you know what you are doing). This is the set of backends that libev will
209libev will probe for if you specify no backends explicitly. 226probe for if you specify no backends explicitly.
210 227
211=item unsigned int ev_embeddable_backends () 228=item unsigned int ev_embeddable_backends ()
212 229
213Returns the set of backends that are embeddable in other event loops. This 230Returns the set of backends that are embeddable in other event loops. This
214is the theoretical, all-platform, value. To find which backends 231value is platform-specific but can include backends not available on the
215might be supported on the current system, you would need to look at 232current system. To find which embeddable backends might be supported on
216C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for 233the current system, you would need to look at C<ev_embeddable_backends ()
217recommended ones. 234& ev_supported_backends ()>, likewise for recommended ones.
218 235
219See the description of C<ev_embed> watchers for more info. 236See the description of C<ev_embed> watchers for more info.
220 237
221=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT] 238=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]
222 239
276 ... 293 ...
277 ev_set_syserr_cb (fatal_error); 294 ev_set_syserr_cb (fatal_error);
278 295
279=back 296=back
280 297
281=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 298=head1 FUNCTIONS CONTROLLING EVENT LOOPS
282 299
283An event loop is described by a C<struct ev_loop *> (the C<struct> 300An event loop is described by a C<struct ev_loop *> (the C<struct> is
284is I<not> optional in this case, as there is also an C<ev_loop> 301I<not> optional in this case unless libev 3 compatibility is disabled, as
285I<function>). 302libev 3 had an C<ev_loop> function colliding with the struct name).
286 303
287The library knows two types of such loops, the I<default> loop, which 304The library knows two types of such loops, the I<default> loop, which
288supports signals and child events, and dynamically created loops which do 305supports signals and child events, and dynamically created event loops
289not. 306which do not.
290 307
291=over 4 308=over 4
292 309
293=item struct ev_loop *ev_default_loop (unsigned int flags) 310=item struct ev_loop *ev_default_loop (unsigned int flags)
294 311
295This will initialise the default event loop if it hasn't been initialised 312This returns the "default" event loop object, which is what you should
296yet and return it. If the default loop could not be initialised, returns 313normally use when you just need "the event loop". Event loop objects and
297false. If it already was initialised it simply returns it (and ignores the 314the C<flags> parameter are described in more detail in the entry for
298flags. If that is troubling you, check C<ev_backend ()> afterwards). 315C<ev_loop_new>.
316
317If the default loop is already initialised then this function simply
318returns it (and ignores the flags. If that is troubling you, check
319C<ev_backend ()> afterwards). Otherwise it will create it with the given
320flags, which should almost always be C<0>, unless the caller is also the
321one calling C<ev_run> or otherwise qualifies as "the main program".
299 322
300If you don't know what event loop to use, use the one returned from this 323If you don't know what event loop to use, use the one returned from this
301function. 324function (or via the C<EV_DEFAULT> macro).
302 325
303Note that this function is I<not> thread-safe, so if you want to use it 326Note that this function is I<not> thread-safe, so if you want to use it
304from multiple threads, you have to lock (note also that this is unlikely, 327from multiple threads, you have to employ some kind of mutex (note also
305as loops cannot be shared easily between threads anyway). 328that this case is unlikely, as loops cannot be shared easily between
329threads anyway).
306 330
307The default loop is the only loop that can handle C<ev_signal> and 331The default loop is the only loop that can handle C<ev_child> watchers,
308C<ev_child> watchers, and to do this, it always registers a handler 332and to do this, it always registers a handler for C<SIGCHLD>. If this is
309for C<SIGCHLD>. If this is a problem for your application you can either 333a problem for your application you can either create a dynamic loop with
310create a dynamic loop with C<ev_loop_new> that doesn't do that, or you 334C<ev_loop_new> which doesn't do that, or you can simply overwrite the
311can simply overwrite the C<SIGCHLD> signal handler I<after> calling 335C<SIGCHLD> signal handler I<after> calling C<ev_default_init>.
312C<ev_default_init>. 336
337Example: This is the most typical usage.
338
339 if (!ev_default_loop (0))
340 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
341
342Example: Restrict libev to the select and poll backends, and do not allow
343environment settings to be taken into account:
344
345 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
346
347=item struct ev_loop *ev_loop_new (unsigned int flags)
348
349This will create and initialise a new event loop object. If the loop
350could not be initialised, returns false.
351
352Note that this function I<is> thread-safe, and one common way to use
353libev with threads is indeed to create one loop per thread, and using the
354default loop in the "main" or "initial" thread.
313 355
314The flags argument can be used to specify special behaviour or specific 356The flags argument can be used to specify special behaviour or specific
315backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). 357backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
316 358
317The following flags are supported: 359The following flags are supported:
332useful to try out specific backends to test their performance, or to work 374useful to try out specific backends to test their performance, or to work
333around bugs. 375around bugs.
334 376
335=item C<EVFLAG_FORKCHECK> 377=item C<EVFLAG_FORKCHECK>
336 378
337Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after 379Instead of calling C<ev_loop_fork> manually after a fork, you can also
338a fork, you can also make libev check for a fork in each iteration by 380make libev check for a fork in each iteration by enabling this flag.
339enabling this flag.
340 381
341This works by calling C<getpid ()> on every iteration of the loop, 382This works by calling C<getpid ()> on every iteration of the loop,
342and thus this might slow down your event loop if you do a lot of loop 383and thus this might slow down your event loop if you do a lot of loop
343iterations and little real work, but is usually not noticeable (on my 384iterations and little real work, but is usually not noticeable (on my
344GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 385GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
350flag. 391flag.
351 392
352This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 393This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
353environment variable. 394environment variable.
354 395
396=item C<EVFLAG_NOINOTIFY>
397
398When this flag is specified, then libev will not attempt to use the
399I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
400testing, this flag can be useful to conserve inotify file descriptors, as
401otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
402
403=item C<EVFLAG_SIGNALFD>
404
405When this flag is specified, then libev will attempt to use the
406I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API
407delivers signals synchronously, which makes it both faster and might make
408it possible to get the queued signal data. It can also simplify signal
409handling with threads, as long as you properly block signals in your
410threads that are not interested in handling them.
411
412Signalfd will not be used by default as this changes your signal mask, and
413there are a lot of shoddy libraries and programs (glib's threadpool for
414example) that can't properly initialise their signal masks.
415
355=item C<EVBACKEND_SELECT> (value 1, portable select backend) 416=item C<EVBACKEND_SELECT> (value 1, portable select backend)
356 417
357This is your standard select(2) backend. Not I<completely> standard, as 418This is your standard select(2) backend. Not I<completely> standard, as
358libev tries to roll its own fd_set with no limits on the number of fds, 419libev tries to roll its own fd_set with no limits on the number of fds,
359but if that fails, expect a fairly low limit on the number of fds when 420but if that fails, expect a fairly low limit on the number of fds when
382 443
383This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 444This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
384C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 445C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
385 446
386=item C<EVBACKEND_EPOLL> (value 4, Linux) 447=item C<EVBACKEND_EPOLL> (value 4, Linux)
448
449Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
450kernels).
387 451
388For few fds, this backend is a bit little slower than poll and select, 452For few fds, this backend is a bit little slower than poll and select,
389but it scales phenomenally better. While poll and select usually scale 453but it scales phenomenally better. While poll and select usually scale
390like O(total_fds) where n is the total number of fds (or the highest fd), 454like O(total_fds) where n is the total number of fds (or the highest fd),
391epoll scales either O(1) or O(active_fds). 455epoll scales either O(1) or O(active_fds).
403of course I<doesn't>, and epoll just loves to report events for totally 467of course I<doesn't>, and epoll just loves to report events for totally
404I<different> file descriptors (even already closed ones, so one cannot 468I<different> file descriptors (even already closed ones, so one cannot
405even remove them from the set) than registered in the set (especially 469even remove them from the set) than registered in the set (especially
406on SMP systems). Libev tries to counter these spurious notifications by 470on SMP systems). Libev tries to counter these spurious notifications by
407employing an additional generation counter and comparing that against the 471employing an additional generation counter and comparing that against the
408events to filter out spurious ones, recreating the set when required. 472events to filter out spurious ones, recreating the set when required. Last
473not least, it also refuses to work with some file descriptors which work
474perfectly fine with C<select> (files, many character devices...).
409 475
410While stopping, setting and starting an I/O watcher in the same iteration 476While stopping, setting and starting an I/O watcher in the same iteration
411will result in some caching, there is still a system call per such 477will result in some caching, there is still a system call per such
412incident (because the same I<file descriptor> could point to a different 478incident (because the same I<file descriptor> could point to a different
413I<file description> now), so its best to avoid that. Also, C<dup ()>'ed 479I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
506 572
507It is definitely not recommended to use this flag. 573It is definitely not recommended to use this flag.
508 574
509=back 575=back
510 576
511If one or more of these are or'ed into the flags value, then only these 577If one or more of the backend flags are or'ed into the flags value,
512backends will be tried (in the reverse order as listed here). If none are 578then only these backends will be tried (in the reverse order as listed
513specified, all backends in C<ev_recommended_backends ()> will be tried. 579here). If none are specified, all backends in C<ev_recommended_backends
514 580()> will be tried.
515Example: This is the most typical usage.
516
517 if (!ev_default_loop (0))
518 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
519
520Example: Restrict libev to the select and poll backends, and do not allow
521environment settings to be taken into account:
522
523 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
524
525Example: Use whatever libev has to offer, but make sure that kqueue is
526used if available (warning, breaks stuff, best use only with your own
527private event loop and only if you know the OS supports your types of
528fds):
529
530 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
531
532=item struct ev_loop *ev_loop_new (unsigned int flags)
533
534Similar to C<ev_default_loop>, but always creates a new event loop that is
535always distinct from the default loop. Unlike the default loop, it cannot
536handle signal and child watchers, and attempts to do so will be greeted by
537undefined behaviour (or a failed assertion if assertions are enabled).
538
539Note that this function I<is> thread-safe, and the recommended way to use
540libev with threads is indeed to create one loop per thread, and using the
541default loop in the "main" or "initial" thread.
542 581
543Example: 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.
544 583
545 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 584 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
546 if (!epoller) 585 if (!epoller)
547 fatal ("no epoll found here, maybe it hides under your chair"); 586 fatal ("no epoll found here, maybe it hides under your chair");
548 587
588Example: Use whatever libev has to offer, but make sure that kqueue is
589used if available.
590
591 struct ev_loop *loop = ev_loop_new (ev_recommended_backends () | EVBACKEND_KQUEUE);
592
549=item ev_default_destroy () 593=item ev_loop_destroy (loop)
550 594
551Destroys the default loop again (frees all memory and kernel state 595Destroys an event loop object (frees all memory and kernel state
552etc.). None of the active event watchers will be stopped in the normal 596etc.). None of the active event watchers will be stopped in the normal
553sense, so e.g. C<ev_is_active> might still return true. It is your 597sense, so e.g. C<ev_is_active> might still return true. It is your
554responsibility to either stop all watchers cleanly yourself I<before> 598responsibility to either stop all watchers cleanly yourself I<before>
555calling this function, or cope with the fact afterwards (which is usually 599calling this function, or cope with the fact afterwards (which is usually
556the easiest thing, you can just ignore the watchers and/or C<free ()> them 600the easiest thing, you can just ignore the watchers and/or C<free ()> them
558 602
559Note that certain global state, such as signal state (and installed signal 603Note that certain global state, such as signal state (and installed signal
560handlers), will not be freed by this function, and related watchers (such 604handlers), will not be freed by this function, and related watchers (such
561as signal and child watchers) would need to be stopped manually. 605as signal and child watchers) would need to be stopped manually.
562 606
563In general it is not advisable to call this function except in the 607This function is normally used on loop objects allocated by
564rare occasion where you really need to free e.g. the signal handling 608C<ev_loop_new>, but it can also be used on the default loop returned by
609C<ev_default_loop>, in which case it is not thread-safe.
610
611Note that it is not advisable to call this function on the default loop
612except in the rare occasion where you really need to free it's resources.
565pipe fds. If you need dynamically allocated loops it is better to use 613If you need dynamically allocated loops it is better to use C<ev_loop_new>
566C<ev_loop_new> and C<ev_loop_destroy>). 614and C<ev_loop_destroy>.
567 615
568=item ev_loop_destroy (loop) 616=item ev_loop_fork (loop)
569 617
570Like C<ev_default_destroy>, but destroys an event loop created by an
571earlier call to C<ev_loop_new>.
572
573=item ev_default_fork ()
574
575This function sets a flag that causes subsequent C<ev_loop> iterations 618This function sets a flag that causes subsequent C<ev_run> iterations to
576to reinitialise the kernel state for backends that have one. Despite the 619reinitialise the kernel state for backends that have one. Despite the
577name, you can call it anytime, but it makes most sense after forking, in 620name, you can call it anytime, but it makes most sense after forking, in
578the child process (or both child and parent, but that again makes little 621the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
579sense). You I<must> call it in the child before using any of the libev 622child before resuming or calling C<ev_run>.
580functions, and it will only take effect at the next C<ev_loop> iteration. 623
624Again, you I<have> to call it on I<any> loop that you want to re-use after
625a fork, I<even if you do not plan to use the loop in the parent>. This is
626because some kernel interfaces *cough* I<kqueue> *cough* do funny things
627during fork.
581 628
582On the other hand, you only need to call this function in the child 629On the other hand, you only need to call this function in the child
583process if and only if you want to use the event library in the child. If 630process if and only if you want to use the event loop in the child. If
584you just fork+exec, you don't have to call it at all. 631you just fork+exec or create a new loop in the child, you don't have to
632call it at all (in fact, C<epoll> is so badly broken that it makes a
633difference, but libev will usually detect this case on its own and do a
634costly reset of the backend).
585 635
586The function itself is quite fast and it's usually not a problem to call 636The function itself is quite fast and it's usually not a problem to call
587it just in case after a fork. To make this easy, the function will fit in 637it just in case after a fork.
588quite nicely into a call to C<pthread_atfork>:
589 638
639Example: Automate calling C<ev_loop_fork> on the default loop when
640using pthreads.
641
642 static void
643 post_fork_child (void)
644 {
645 ev_loop_fork (EV_DEFAULT);
646 }
647
648 ...
590 pthread_atfork (0, 0, ev_default_fork); 649 pthread_atfork (0, 0, post_fork_child);
591
592=item ev_loop_fork (loop)
593
594Like C<ev_default_fork>, but acts on an event loop created by
595C<ev_loop_new>. Yes, you have to call this on every allocated event loop
596after fork that you want to re-use in the child, and how you do this is
597entirely your own problem.
598 650
599=item int ev_is_default_loop (loop) 651=item int ev_is_default_loop (loop)
600 652
601Returns true when the given loop is, in fact, the default loop, and false 653Returns true when the given loop is, in fact, the default loop, and false
602otherwise. 654otherwise.
603 655
604=item unsigned int ev_loop_count (loop) 656=item unsigned int ev_iteration (loop)
605 657
606Returns the count of loop iterations for the loop, which is identical to 658Returns the current iteration count for the event loop, which is identical
607the number of times libev did poll for new events. It starts at C<0> and 659to the number of times libev did poll for new events. It starts at C<0>
608happily wraps around with enough iterations. 660and happily wraps around with enough iterations.
609 661
610This value can sometimes be useful as a generation counter of sorts (it 662This value can sometimes be useful as a generation counter of sorts (it
611"ticks" the number of loop iterations), as it roughly corresponds with 663"ticks" the number of loop iterations), as it roughly corresponds with
612C<ev_prepare> and C<ev_check> calls. 664C<ev_prepare> and C<ev_check> calls - and is incremented between the
665prepare and check phases.
666
667=item unsigned int ev_depth (loop)
668
669Returns the number of times C<ev_run> was entered minus the number of
670times C<ev_run> was exited, in other words, the recursion depth.
671
672Outside C<ev_run>, this number is zero. In a callback, this number is
673C<1>, unless C<ev_run> was invoked recursively (or from another thread),
674in which case it is higher.
675
676Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread
677etc.), doesn't count as "exit" - consider this as a hint to avoid such
678ungentleman-like behaviour unless it's really convenient.
613 679
614=item unsigned int ev_backend (loop) 680=item unsigned int ev_backend (loop)
615 681
616Returns one of the C<EVBACKEND_*> flags indicating the event backend in 682Returns one of the C<EVBACKEND_*> flags indicating the event backend in
617use. 683use.
626 692
627=item ev_now_update (loop) 693=item ev_now_update (loop)
628 694
629Establishes the current time by querying the kernel, updating the time 695Establishes the current time by querying the kernel, updating the time
630returned by C<ev_now ()> in the progress. This is a costly operation and 696returned by C<ev_now ()> in the progress. This is a costly operation and
631is usually done automatically within C<ev_loop ()>. 697is usually done automatically within C<ev_run ()>.
632 698
633This function is rarely useful, but when some event callback runs for a 699This function is rarely useful, but when some event callback runs for a
634very long time without entering the event loop, updating libev's idea of 700very long time without entering the event loop, updating libev's idea of
635the current time is a good idea. 701the current time is a good idea.
636 702
637See also "The special problem of time updates" in the C<ev_timer> section. 703See also L<The special problem of time updates> in the C<ev_timer> section.
638 704
639=item ev_suspend (loop) 705=item ev_suspend (loop)
640 706
641=item ev_resume (loop) 707=item ev_resume (loop)
642 708
643These two functions suspend and resume a loop, for use when the loop is 709These two functions suspend and resume an event loop, for use when the
644not used for a while and timeouts should not be processed. 710loop is not used for a while and timeouts should not be processed.
645 711
646A typical use case would be an interactive program such as a game: When 712A typical use case would be an interactive program such as a game: When
647the user presses C<^Z> to suspend the game and resumes it an hour later it 713the user presses C<^Z> to suspend the game and resumes it an hour later it
648would be best to handle timeouts as if no time had actually passed while 714would be best to handle timeouts as if no time had actually passed while
649the program was suspended. This can be achieved by calling C<ev_suspend> 715the program was suspended. This can be achieved by calling C<ev_suspend>
651C<ev_resume> directly afterwards to resume timer processing. 717C<ev_resume> directly afterwards to resume timer processing.
652 718
653Effectively, all C<ev_timer> watchers will be delayed by the time spend 719Effectively, all C<ev_timer> watchers will be delayed by the time spend
654between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers 720between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers
655will be rescheduled (that is, they will lose any events that would have 721will be rescheduled (that is, they will lose any events that would have
656occured while suspended). 722occurred while suspended).
657 723
658After calling C<ev_suspend> you B<must not> call I<any> function on the 724After calling C<ev_suspend> you B<must not> call I<any> function on the
659given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> 725given loop other than C<ev_resume>, and you B<must not> call C<ev_resume>
660without a previous call to C<ev_suspend>. 726without a previous call to C<ev_suspend>.
661 727
662Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 728Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
663event loop time (see C<ev_now_update>). 729event loop time (see C<ev_now_update>).
664 730
665=item ev_loop (loop, int flags) 731=item ev_run (loop, int flags)
666 732
667Finally, this is it, the event handler. This function usually is called 733Finally, this is it, the event handler. This function usually is called
668after you initialised all your watchers and you want to start handling 734after you have initialised all your watchers and you want to start
669events. 735handling events. It will ask the operating system for any new events, call
736the watcher callbacks, an then repeat the whole process indefinitely: This
737is why event loops are called I<loops>.
670 738
671If the flags argument is specified as C<0>, it will not return until 739If the flags argument is specified as C<0>, it will keep handling events
672either no event watchers are active anymore or C<ev_unloop> was called. 740until either no event watchers are active anymore or C<ev_break> was
741called.
673 742
674Please note that an explicit C<ev_unloop> is usually better than 743Please note that an explicit C<ev_break> is usually better than
675relying on all watchers to be stopped when deciding when a program has 744relying on all watchers to be stopped when deciding when a program has
676finished (especially in interactive programs), but having a program 745finished (especially in interactive programs), but having a program
677that automatically loops as long as it has to and no longer by virtue 746that automatically loops as long as it has to and no longer by virtue
678of relying on its watchers stopping correctly, that is truly a thing of 747of relying on its watchers stopping correctly, that is truly a thing of
679beauty. 748beauty.
680 749
681A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 750A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
682those events and any already outstanding ones, but will not block your 751those events and any already outstanding ones, but will not wait and
683process in case there are no events and will return after one iteration of 752block your process in case there are no events and will return after one
684the loop. 753iteration of the loop. This is sometimes useful to poll and handle new
754events while doing lengthy calculations, to keep the program responsive.
685 755
686A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 756A flags value of C<EVRUN_ONCE> will look for new events (waiting if
687necessary) and will handle those and any already outstanding ones. It 757necessary) and will handle those and any already outstanding ones. It
688will block your process until at least one new event arrives (which could 758will block your process until at least one new event arrives (which could
689be an event internal to libev itself, so there is no guarantee that a 759be an event internal to libev itself, so there is no guarantee that a
690user-registered callback will be called), and will return after one 760user-registered callback will be called), and will return after one
691iteration of the loop. 761iteration of the loop.
692 762
693This is useful if you are waiting for some external event in conjunction 763This is useful if you are waiting for some external event in conjunction
694with something not expressible using other libev watchers (i.e. "roll your 764with something not expressible using other libev watchers (i.e. "roll your
695own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is 765own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
696usually a better approach for this kind of thing. 766usually a better approach for this kind of thing.
697 767
698Here are the gory details of what C<ev_loop> does: 768Here are the gory details of what C<ev_run> does:
699 769
770 - Increment loop depth.
771 - Reset the ev_break status.
700 - Before the first iteration, call any pending watchers. 772 - Before the first iteration, call any pending watchers.
773 LOOP:
701 * If EVFLAG_FORKCHECK was used, check for a fork. 774 - If EVFLAG_FORKCHECK was used, check for a fork.
702 - If a fork was detected (by any means), queue and call all fork watchers. 775 - If a fork was detected (by any means), queue and call all fork watchers.
703 - Queue and call all prepare watchers. 776 - Queue and call all prepare watchers.
777 - If ev_break was called, goto FINISH.
704 - If we have been forked, detach and recreate the kernel state 778 - If we have been forked, detach and recreate the kernel state
705 as to not disturb the other process. 779 as to not disturb the other process.
706 - Update the kernel state with all outstanding changes. 780 - Update the kernel state with all outstanding changes.
707 - Update the "event loop time" (ev_now ()). 781 - Update the "event loop time" (ev_now ()).
708 - Calculate for how long to sleep or block, if at all 782 - Calculate for how long to sleep or block, if at all
709 (active idle watchers, EVLOOP_NONBLOCK or not having 783 (active idle watchers, EVRUN_NOWAIT or not having
710 any active watchers at all will result in not sleeping). 784 any active watchers at all will result in not sleeping).
711 - Sleep if the I/O and timer collect interval say so. 785 - Sleep if the I/O and timer collect interval say so.
786 - Increment loop iteration counter.
712 - Block the process, waiting for any events. 787 - Block the process, waiting for any events.
713 - Queue all outstanding I/O (fd) events. 788 - Queue all outstanding I/O (fd) events.
714 - Update the "event loop time" (ev_now ()), and do time jump adjustments. 789 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
715 - Queue all expired timers. 790 - Queue all expired timers.
716 - Queue all expired periodics. 791 - Queue all expired periodics.
717 - Unless any events are pending now, queue all idle watchers. 792 - Queue all idle watchers with priority higher than that of pending events.
718 - Queue all check watchers. 793 - Queue all check watchers.
719 - Call all queued watchers in reverse order (i.e. check watchers first). 794 - Call all queued watchers in reverse order (i.e. check watchers first).
720 Signals and child watchers are implemented as I/O watchers, and will 795 Signals and child watchers are implemented as I/O watchers, and will
721 be handled here by queueing them when their watcher gets executed. 796 be handled here by queueing them when their watcher gets executed.
722 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 797 - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT
723 were used, or there are no active watchers, return, otherwise 798 were used, or there are no active watchers, goto FINISH, otherwise
724 continue with step *. 799 continue with step LOOP.
800 FINISH:
801 - Reset the ev_break status iff it was EVBREAK_ONE.
802 - Decrement the loop depth.
803 - Return.
725 804
726Example: Queue some jobs and then loop until no events are outstanding 805Example: Queue some jobs and then loop until no events are outstanding
727anymore. 806anymore.
728 807
729 ... queue jobs here, make sure they register event watchers as long 808 ... queue jobs here, make sure they register event watchers as long
730 ... as they still have work to do (even an idle watcher will do..) 809 ... as they still have work to do (even an idle watcher will do..)
731 ev_loop (my_loop, 0); 810 ev_run (my_loop, 0);
732 ... jobs done or somebody called unloop. yeah! 811 ... jobs done or somebody called unloop. yeah!
733 812
734=item ev_unloop (loop, how) 813=item ev_break (loop, how)
735 814
736Can be used to make a call to C<ev_loop> return early (but only after it 815Can be used to make a call to C<ev_run> return early (but only after it
737has processed all outstanding events). The C<how> argument must be either 816has processed all outstanding events). The C<how> argument must be either
738C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 817C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or
739C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 818C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return.
740 819
741This "unloop state" will be cleared when entering C<ev_loop> again. 820This "unloop state" will be cleared when entering C<ev_run> again.
742 821
743It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. 822It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO##
744 823
745=item ev_ref (loop) 824=item ev_ref (loop)
746 825
747=item ev_unref (loop) 826=item ev_unref (loop)
748 827
749Ref/unref can be used to add or remove a reference count on the event 828Ref/unref can be used to add or remove a reference count on the event
750loop: Every watcher keeps one reference, and as long as the reference 829loop: Every watcher keeps one reference, and as long as the reference
751count is nonzero, C<ev_loop> will not return on its own. 830count is nonzero, C<ev_run> will not return on its own.
752 831
753If you have a watcher you never unregister that should not keep C<ev_loop> 832This is useful when you have a watcher that you never intend to
754from returning, call ev_unref() after starting, and ev_ref() before 833unregister, but that nevertheless should not keep C<ev_run> from
834returning. In such a case, call C<ev_unref> after starting, and C<ev_ref>
755stopping it. 835before stopping it.
756 836
757As an example, libev itself uses this for its internal signal pipe: It 837As an example, libev itself uses this for its internal signal pipe: It
758is not visible to the libev user and should not keep C<ev_loop> from 838is not visible to the libev user and should not keep C<ev_run> from
759exiting if no event watchers registered by it are active. It is also an 839exiting if no event watchers registered by it are active. It is also an
760excellent way to do this for generic recurring timers or from within 840excellent way to do this for generic recurring timers or from within
761third-party libraries. Just remember to I<unref after start> and I<ref 841third-party libraries. Just remember to I<unref after start> and I<ref
762before stop> (but only if the watcher wasn't active before, or was active 842before stop> (but only if the watcher wasn't active before, or was active
763before, respectively. Note also that libev might stop watchers itself 843before, respectively. Note also that libev might stop watchers itself
764(e.g. non-repeating timers) in which case you have to C<ev_ref> 844(e.g. non-repeating timers) in which case you have to C<ev_ref>
765in the callback). 845in the callback).
766 846
767Example: Create a signal watcher, but keep it from keeping C<ev_loop> 847Example: Create a signal watcher, but keep it from keeping C<ev_run>
768running when nothing else is active. 848running when nothing else is active.
769 849
770 ev_signal exitsig; 850 ev_signal exitsig;
771 ev_signal_init (&exitsig, sig_cb, SIGINT); 851 ev_signal_init (&exitsig, sig_cb, SIGINT);
772 ev_signal_start (loop, &exitsig); 852 ev_signal_start (loop, &exitsig);
799 879
800By setting a higher I<io collect interval> you allow libev to spend more 880By setting a higher I<io collect interval> you allow libev to spend more
801time collecting I/O events, so you can handle more events per iteration, 881time collecting I/O events, so you can handle more events per iteration,
802at the cost of increasing latency. Timeouts (both C<ev_periodic> and 882at the cost of increasing latency. Timeouts (both C<ev_periodic> and
803C<ev_timer>) will be not affected. Setting this to a non-null value will 883C<ev_timer>) will be not affected. Setting this to a non-null value will
804introduce an additional C<ev_sleep ()> call into most loop iterations. 884introduce an additional C<ev_sleep ()> call into most loop iterations. The
885sleep time ensures that libev will not poll for I/O events more often then
886once per this interval, on average.
805 887
806Likewise, by setting a higher I<timeout collect interval> you allow libev 888Likewise, by setting a higher I<timeout collect interval> you allow libev
807to spend more time collecting timeouts, at the expense of increased 889to spend more time collecting timeouts, at the expense of increased
808latency/jitter/inexactness (the watcher callback will be called 890latency/jitter/inexactness (the watcher callback will be called
809later). C<ev_io> watchers will not be affected. Setting this to a non-null 891later). C<ev_io> watchers will not be affected. Setting this to a non-null
811 893
812Many (busy) programs can usually benefit by setting the I/O collect 894Many (busy) programs can usually benefit by setting the I/O collect
813interval to a value near C<0.1> or so, which is often enough for 895interval to a value near C<0.1> or so, which is often enough for
814interactive servers (of course not for games), likewise for timeouts. It 896interactive servers (of course not for games), likewise for timeouts. It
815usually doesn't make much sense to set it to a lower value than C<0.01>, 897usually doesn't make much sense to set it to a lower value than C<0.01>,
816as this approaches the timing granularity of most systems. 898as this approaches the timing granularity of most systems. Note that if
899you do transactions with the outside world and you can't increase the
900parallelity, then this setting will limit your transaction rate (if you
901need to poll once per transaction and the I/O collect interval is 0.01,
902then you can't do more than 100 transactions per second).
817 903
818Setting the I<timeout collect interval> can improve the opportunity for 904Setting the I<timeout collect interval> can improve the opportunity for
819saving power, as the program will "bundle" timer callback invocations that 905saving power, as the program will "bundle" timer callback invocations that
820are "near" in time together, by delaying some, thus reducing the number of 906are "near" in time together, by delaying some, thus reducing the number of
821times the process sleeps and wakes up again. Another useful technique to 907times the process sleeps and wakes up again. Another useful technique to
822reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure 908reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
823they fire on, say, one-second boundaries only. 909they fire on, say, one-second boundaries only.
824 910
911Example: we only need 0.1s timeout granularity, and we wish not to poll
912more often than 100 times per second:
913
914 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
915 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
916
917=item ev_invoke_pending (loop)
918
919This call will simply invoke all pending watchers while resetting their
920pending state. Normally, C<ev_run> does this automatically when required,
921but when overriding the invoke callback this call comes handy. This
922function can be invoked from a watcher - this can be useful for example
923when you want to do some lengthy calculation and want to pass further
924event handling to another thread (you still have to make sure only one
925thread executes within C<ev_invoke_pending> or C<ev_run> of course).
926
927=item int ev_pending_count (loop)
928
929Returns the number of pending watchers - zero indicates that no watchers
930are pending.
931
932=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
933
934This overrides the invoke pending functionality of the loop: Instead of
935invoking all pending watchers when there are any, C<ev_run> will call
936this callback instead. This is useful, for example, when you want to
937invoke the actual watchers inside another context (another thread etc.).
938
939If you want to reset the callback, use C<ev_invoke_pending> as new
940callback.
941
942=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
943
944Sometimes you want to share the same loop between multiple threads. This
945can be done relatively simply by putting mutex_lock/unlock calls around
946each call to a libev function.
947
948However, C<ev_run> can run an indefinite time, so it is not feasible
949to wait for it to return. One way around this is to wake up the event
950loop via C<ev_break> and C<av_async_send>, another way is to set these
951I<release> and I<acquire> callbacks on the loop.
952
953When set, then C<release> will be called just before the thread is
954suspended waiting for new events, and C<acquire> is called just
955afterwards.
956
957Ideally, C<release> will just call your mutex_unlock function, and
958C<acquire> will just call the mutex_lock function again.
959
960While event loop modifications are allowed between invocations of
961C<release> and C<acquire> (that's their only purpose after all), no
962modifications done will affect the event loop, i.e. adding watchers will
963have no effect on the set of file descriptors being watched, or the time
964waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it
965to take note of any changes you made.
966
967In theory, threads executing C<ev_run> will be async-cancel safe between
968invocations of C<release> and C<acquire>.
969
970See also the locking example in the C<THREADS> section later in this
971document.
972
973=item ev_set_userdata (loop, void *data)
974
975=item ev_userdata (loop)
976
977Set and retrieve a single C<void *> associated with a loop. When
978C<ev_set_userdata> has never been called, then C<ev_userdata> returns
979C<0.>
980
981These two functions can be used to associate arbitrary data with a loop,
982and are intended solely for the C<invoke_pending_cb>, C<release> and
983C<acquire> callbacks described above, but of course can be (ab-)used for
984any other purpose as well.
985
825=item ev_loop_verify (loop) 986=item ev_verify (loop)
826 987
827This function only does something when C<EV_VERIFY> support has been 988This function only does something when C<EV_VERIFY> support has been
828compiled in, which is the default for non-minimal builds. It tries to go 989compiled in, which is the default for non-minimal builds. It tries to go
829through all internal structures and checks them for validity. If anything 990through all internal structures and checks them for validity. If anything
830is found to be inconsistent, it will print an error message to standard 991is found to be inconsistent, it will print an error message to standard
841 1002
842In the following description, uppercase C<TYPE> in names stands for the 1003In the following description, uppercase C<TYPE> in names stands for the
843watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer 1004watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
844watchers and C<ev_io_start> for I/O watchers. 1005watchers and C<ev_io_start> for I/O watchers.
845 1006
846A watcher is a structure that you create and register to record your 1007A watcher is an opaque structure that you allocate and register to record
847interest in some event. For instance, if you want to wait for STDIN to 1008your interest in some event. To make a concrete example, imagine you want
848become readable, you would create an C<ev_io> watcher for that: 1009to wait for STDIN to become readable, you would create an C<ev_io> watcher
1010for that:
849 1011
850 static void my_cb (struct ev_loop *loop, ev_io *w, int revents) 1012 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
851 { 1013 {
852 ev_io_stop (w); 1014 ev_io_stop (w);
853 ev_unloop (loop, EVUNLOOP_ALL); 1015 ev_break (loop, EVBREAK_ALL);
854 } 1016 }
855 1017
856 struct ev_loop *loop = ev_default_loop (0); 1018 struct ev_loop *loop = ev_default_loop (0);
857 1019
858 ev_io stdin_watcher; 1020 ev_io stdin_watcher;
859 1021
860 ev_init (&stdin_watcher, my_cb); 1022 ev_init (&stdin_watcher, my_cb);
861 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 1023 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
862 ev_io_start (loop, &stdin_watcher); 1024 ev_io_start (loop, &stdin_watcher);
863 1025
864 ev_loop (loop, 0); 1026 ev_run (loop, 0);
865 1027
866As you can see, you are responsible for allocating the memory for your 1028As you can see, you are responsible for allocating the memory for your
867watcher structures (and it is I<usually> a bad idea to do this on the 1029watcher structures (and it is I<usually> a bad idea to do this on the
868stack). 1030stack).
869 1031
870Each watcher has an associated watcher structure (called C<struct ev_TYPE> 1032Each watcher has an associated watcher structure (called C<struct ev_TYPE>
871or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). 1033or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
872 1034
873Each watcher structure must be initialised by a call to C<ev_init 1035Each watcher structure must be initialised by a call to C<ev_init (watcher
874(watcher *, callback)>, which expects a callback to be provided. This 1036*, callback)>, which expects a callback to be provided. This callback is
875callback gets invoked each time the event occurs (or, in the case of I/O 1037invoked each time the event occurs (or, in the case of I/O watchers, each
876watchers, each time the event loop detects that the file descriptor given 1038time the event loop detects that the file descriptor given is readable
877is readable and/or writable). 1039and/or writable).
878 1040
879Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> 1041Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
880macro to configure it, with arguments specific to the watcher type. There 1042macro to configure it, with arguments specific to the watcher type. There
881is also a macro to combine initialisation and setting in one call: C<< 1043is also a macro to combine initialisation and setting in one call: C<<
882ev_TYPE_init (watcher *, callback, ...) >>. 1044ev_TYPE_init (watcher *, callback, ...) >>.
905=item C<EV_WRITE> 1067=item C<EV_WRITE>
906 1068
907The file descriptor in the C<ev_io> watcher has become readable and/or 1069The file descriptor in the C<ev_io> watcher has become readable and/or
908writable. 1070writable.
909 1071
910=item C<EV_TIMEOUT> 1072=item C<EV_TIMER>
911 1073
912The C<ev_timer> watcher has timed out. 1074The C<ev_timer> watcher has timed out.
913 1075
914=item C<EV_PERIODIC> 1076=item C<EV_PERIODIC>
915 1077
933 1095
934=item C<EV_PREPARE> 1096=item C<EV_PREPARE>
935 1097
936=item C<EV_CHECK> 1098=item C<EV_CHECK>
937 1099
938All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts 1100All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts
939to gather new events, and all C<ev_check> watchers are invoked just after 1101to gather new events, and all C<ev_check> watchers are invoked just after
940C<ev_loop> has gathered them, but before it invokes any callbacks for any 1102C<ev_run> has gathered them, but before it invokes any callbacks for any
941received events. Callbacks of both watcher types can start and stop as 1103received events. Callbacks of both watcher types can start and stop as
942many watchers as they want, and all of them will be taken into account 1104many watchers as they want, and all of them will be taken into account
943(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1105(for example, a C<ev_prepare> watcher might start an idle watcher to keep
944C<ev_loop> from blocking). 1106C<ev_run> from blocking).
945 1107
946=item C<EV_EMBED> 1108=item C<EV_EMBED>
947 1109
948The embedded event loop specified in the C<ev_embed> watcher needs attention. 1110The embedded event loop specified in the C<ev_embed> watcher needs attention.
949 1111
950=item C<EV_FORK> 1112=item C<EV_FORK>
951 1113
952The event loop has been resumed in the child process after fork (see 1114The event loop has been resumed in the child process after fork (see
953C<ev_fork>). 1115C<ev_fork>).
1116
1117=item C<EV_CLEANUP>
1118
1119The event loop is abotu to be destroyed (see C<ev_cleanup>).
954 1120
955=item C<EV_ASYNC> 1121=item C<EV_ASYNC>
956 1122
957The given async watcher has been asynchronously notified (see C<ev_async>). 1123The given async watcher has been asynchronously notified (see C<ev_async>).
958 1124
980programs, though, as the fd could already be closed and reused for another 1146programs, though, as the fd could already be closed and reused for another
981thing, so beware. 1147thing, so beware.
982 1148
983=back 1149=back
984 1150
1151=head2 WATCHER STATES
1152
1153There are various watcher states mentioned throughout this manual -
1154active, pending and so on. In this section these states and the rules to
1155transition between them will be described in more detail - and while these
1156rules might look complicated, they usually do "the right thing".
1157
1158=over 4
1159
1160=item initialiased
1161
1162Before a watcher can be registered with the event looop it has to be
1163initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1164C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1165
1166In this state it is simply some block of memory that is suitable for use
1167in an event loop. It can be moved around, freed, reused etc. at will.
1168
1169=item started/running/active
1170
1171Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1172property of the event loop, and is actively waiting for events. While in
1173this state it cannot be accessed (except in a few documented ways), moved,
1174freed or anything else - the only legal thing is to keep a pointer to it,
1175and call libev functions on it that are documented to work on active watchers.
1176
1177=item pending
1178
1179If a watcher is active and libev determines that an event it is interested
1180in has occurred (such as a timer expiring), it will become pending. It will
1181stay in this pending state until either it is stopped or its callback is
1182about to be invoked, so it is not normally pending inside the watcher
1183callback.
1184
1185The watcher might or might not be active while it is pending (for example,
1186an expired non-repeating timer can be pending but no longer active). If it
1187is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1188but it is still property of the event loop at this time, so cannot be
1189moved, freed or reused. And if it is active the rules described in the
1190previous item still apply.
1191
1192It is also possible to feed an event on a watcher that is not active (e.g.
1193via C<ev_feed_event>), in which case it becomes pending without being
1194active.
1195
1196=item stopped
1197
1198A watcher can be stopped implicitly by libev (in which case it might still
1199be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1200latter will clear any pending state the watcher might be in, regardless
1201of whether it was active or not, so stopping a watcher explicitly before
1202freeing it is often a good idea.
1203
1204While stopped (and not pending) the watcher is essentially in the
1205initialised state, that is it can be reused, moved, modified in any way
1206you wish.
1207
1208=back
1209
985=head2 GENERIC WATCHER FUNCTIONS 1210=head2 GENERIC WATCHER FUNCTIONS
986 1211
987=over 4 1212=over 4
988 1213
989=item C<ev_init> (ev_TYPE *watcher, callback) 1214=item C<ev_init> (ev_TYPE *watcher, callback)
1005 1230
1006 ev_io w; 1231 ev_io w;
1007 ev_init (&w, my_cb); 1232 ev_init (&w, my_cb);
1008 ev_io_set (&w, STDIN_FILENO, EV_READ); 1233 ev_io_set (&w, STDIN_FILENO, EV_READ);
1009 1234
1010=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1235=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1011 1236
1012This macro initialises the type-specific parts of a watcher. You need to 1237This macro initialises the type-specific parts of a watcher. You need to
1013call C<ev_init> at least once before you call this macro, but you can 1238call C<ev_init> at least once before you call this macro, but you can
1014call C<ev_TYPE_set> any number of times. You must not, however, call this 1239call C<ev_TYPE_set> any number of times. You must not, however, call this
1015macro on a watcher that is active (it can be pending, however, which is a 1240macro on a watcher that is active (it can be pending, however, which is a
1028 1253
1029Example: Initialise and set an C<ev_io> watcher in one step. 1254Example: Initialise and set an C<ev_io> watcher in one step.
1030 1255
1031 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1256 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1032 1257
1033=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1258=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1034 1259
1035Starts (activates) the given watcher. Only active watchers will receive 1260Starts (activates) the given watcher. Only active watchers will receive
1036events. If the watcher is already active nothing will happen. 1261events. If the watcher is already active nothing will happen.
1037 1262
1038Example: Start the C<ev_io> watcher that is being abused as example in this 1263Example: Start the C<ev_io> watcher that is being abused as example in this
1039whole section. 1264whole section.
1040 1265
1041 ev_io_start (EV_DEFAULT_UC, &w); 1266 ev_io_start (EV_DEFAULT_UC, &w);
1042 1267
1043=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1268=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1044 1269
1045Stops the given watcher if active, and clears the pending status (whether 1270Stops the given watcher if active, and clears the pending status (whether
1046the watcher was active or not). 1271the watcher was active or not).
1047 1272
1048It is possible that stopped watchers are pending - for example, 1273It is possible that stopped watchers are pending - for example,
1073=item ev_cb_set (ev_TYPE *watcher, callback) 1298=item ev_cb_set (ev_TYPE *watcher, callback)
1074 1299
1075Change the callback. You can change the callback at virtually any time 1300Change the callback. You can change the callback at virtually any time
1076(modulo threads). 1301(modulo threads).
1077 1302
1078=item ev_set_priority (ev_TYPE *watcher, priority) 1303=item ev_set_priority (ev_TYPE *watcher, int priority)
1079 1304
1080=item int ev_priority (ev_TYPE *watcher) 1305=item int ev_priority (ev_TYPE *watcher)
1081 1306
1082Set and query the priority of the watcher. The priority is a small 1307Set and query the priority of the watcher. The priority is a small
1083integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1308integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1114returns its C<revents> bitset (as if its callback was invoked). If the 1339returns its C<revents> bitset (as if its callback was invoked). If the
1115watcher isn't pending it does nothing and returns C<0>. 1340watcher isn't pending it does nothing and returns C<0>.
1116 1341
1117Sometimes it can be useful to "poll" a watcher instead of waiting for its 1342Sometimes it can be useful to "poll" a watcher instead of waiting for its
1118callback to be invoked, which can be accomplished with this function. 1343callback to be invoked, which can be accomplished with this function.
1344
1345=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1346
1347Feeds the given event set into the event loop, as if the specified event
1348had happened for the specified watcher (which must be a pointer to an
1349initialised but not necessarily started event watcher). Obviously you must
1350not free the watcher as long as it has pending events.
1351
1352Stopping the watcher, letting libev invoke it, or calling
1353C<ev_clear_pending> will clear the pending event, even if the watcher was
1354not started in the first place.
1355
1356See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1357functions that do not need a watcher.
1119 1358
1120=back 1359=back
1121 1360
1122 1361
1123=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1362=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1172 #include <stddef.h> 1411 #include <stddef.h>
1173 1412
1174 static void 1413 static void
1175 t1_cb (EV_P_ ev_timer *w, int revents) 1414 t1_cb (EV_P_ ev_timer *w, int revents)
1176 { 1415 {
1177 struct my_biggy big = (struct my_biggy * 1416 struct my_biggy big = (struct my_biggy *)
1178 (((char *)w) - offsetof (struct my_biggy, t1)); 1417 (((char *)w) - offsetof (struct my_biggy, t1));
1179 } 1418 }
1180 1419
1181 static void 1420 static void
1182 t2_cb (EV_P_ ev_timer *w, int revents) 1421 t2_cb (EV_P_ ev_timer *w, int revents)
1183 { 1422 {
1184 struct my_biggy big = (struct my_biggy * 1423 struct my_biggy big = (struct my_biggy *)
1185 (((char *)w) - offsetof (struct my_biggy, t2)); 1424 (((char *)w) - offsetof (struct my_biggy, t2));
1186 } 1425 }
1187 1426
1188=head2 WATCHER PRIORITY MODELS 1427=head2 WATCHER PRIORITY MODELS
1189 1428
1234 1473
1235For example, to emulate how many other event libraries handle priorities, 1474For example, to emulate how many other event libraries handle priorities,
1236you can associate an C<ev_idle> watcher to each such watcher, and in 1475you can associate an C<ev_idle> watcher to each such watcher, and in
1237the normal watcher callback, you just start the idle watcher. The real 1476the normal watcher callback, you just start the idle watcher. The real
1238processing is done in the idle watcher callback. This causes libev to 1477processing is done in the idle watcher callback. This causes libev to
1239continously poll and process kernel event data for the watcher, but when 1478continuously poll and process kernel event data for the watcher, but when
1240the lock-out case is known to be rare (which in turn is rare :), this is 1479the lock-out case is known to be rare (which in turn is rare :), this is
1241workable. 1480workable.
1242 1481
1243Usually, however, the lock-out model implemented that way will perform 1482Usually, however, the lock-out model implemented that way will perform
1244miserably under the type of load it was designed to handle. In that case, 1483miserably under the type of load it was designed to handle. In that case,
1258 { 1497 {
1259 // stop the I/O watcher, we received the event, but 1498 // stop the I/O watcher, we received the event, but
1260 // are not yet ready to handle it. 1499 // are not yet ready to handle it.
1261 ev_io_stop (EV_A_ w); 1500 ev_io_stop (EV_A_ w);
1262 1501
1263 // start the idle watcher to ahndle the actual event. 1502 // start the idle watcher to handle the actual event.
1264 // it will not be executed as long as other watchers 1503 // it will not be executed as long as other watchers
1265 // with the default priority are receiving events. 1504 // with the default priority are receiving events.
1266 ev_idle_start (EV_A_ &idle); 1505 ev_idle_start (EV_A_ &idle);
1267 } 1506 }
1268 1507
1269 static void 1508 static void
1270 idle-cb (EV_P_ ev_idle *w, int revents) 1509 idle_cb (EV_P_ ev_idle *w, int revents)
1271 { 1510 {
1272 // actual processing 1511 // actual processing
1273 read (STDIN_FILENO, ...); 1512 read (STDIN_FILENO, ...);
1274 1513
1275 // have to start the I/O watcher again, as 1514 // have to start the I/O watcher again, as
1320descriptors to non-blocking mode is also usually a good idea (but not 1559descriptors to non-blocking mode is also usually a good idea (but not
1321required if you know what you are doing). 1560required if you know what you are doing).
1322 1561
1323If you cannot use non-blocking mode, then force the use of a 1562If you cannot use non-blocking mode, then force the use of a
1324known-to-be-good backend (at the time of this writing, this includes only 1563known-to-be-good backend (at the time of this writing, this includes only
1325C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1564C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1565descriptors for which non-blocking operation makes no sense (such as
1566files) - libev doesn't guarantee any specific behaviour in that case.
1326 1567
1327Another thing you have to watch out for is that it is quite easy to 1568Another thing you have to watch out for is that it is quite easy to
1328receive "spurious" readiness notifications, that is your callback might 1569receive "spurious" readiness notifications, that is your callback might
1329be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1570be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1330because there is no data. Not only are some backends known to create a 1571because there is no data. Not only are some backends known to create a
1395 1636
1396So when you encounter spurious, unexplained daemon exits, make sure you 1637So when you encounter spurious, unexplained daemon exits, make sure you
1397ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1638ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1398somewhere, as that would have given you a big clue). 1639somewhere, as that would have given you a big clue).
1399 1640
1641=head3 The special problem of accept()ing when you can't
1642
1643Many implementations of the POSIX C<accept> function (for example,
1644found in post-2004 Linux) have the peculiar behaviour of not removing a
1645connection from the pending queue in all error cases.
1646
1647For example, larger servers often run out of file descriptors (because
1648of resource limits), causing C<accept> to fail with C<ENFILE> but not
1649rejecting the connection, leading to libev signalling readiness on
1650the next iteration again (the connection still exists after all), and
1651typically causing the program to loop at 100% CPU usage.
1652
1653Unfortunately, the set of errors that cause this issue differs between
1654operating systems, there is usually little the app can do to remedy the
1655situation, and no known thread-safe method of removing the connection to
1656cope with overload is known (to me).
1657
1658One of the easiest ways to handle this situation is to just ignore it
1659- when the program encounters an overload, it will just loop until the
1660situation is over. While this is a form of busy waiting, no OS offers an
1661event-based way to handle this situation, so it's the best one can do.
1662
1663A better way to handle the situation is to log any errors other than
1664C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1665messages, and continue as usual, which at least gives the user an idea of
1666what could be wrong ("raise the ulimit!"). For extra points one could stop
1667the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1668usage.
1669
1670If your program is single-threaded, then you could also keep a dummy file
1671descriptor for overload situations (e.g. by opening F</dev/null>), and
1672when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1673close that fd, and create a new dummy fd. This will gracefully refuse
1674clients under typical overload conditions.
1675
1676The last way to handle it is to simply log the error and C<exit>, as
1677is often done with C<malloc> failures, but this results in an easy
1678opportunity for a DoS attack.
1400 1679
1401=head3 Watcher-Specific Functions 1680=head3 Watcher-Specific Functions
1402 1681
1403=over 4 1682=over 4
1404 1683
1436 ... 1715 ...
1437 struct ev_loop *loop = ev_default_init (0); 1716 struct ev_loop *loop = ev_default_init (0);
1438 ev_io stdin_readable; 1717 ev_io stdin_readable;
1439 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1718 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1440 ev_io_start (loop, &stdin_readable); 1719 ev_io_start (loop, &stdin_readable);
1441 ev_loop (loop, 0); 1720 ev_run (loop, 0);
1442 1721
1443 1722
1444=head2 C<ev_timer> - relative and optionally repeating timeouts 1723=head2 C<ev_timer> - relative and optionally repeating timeouts
1445 1724
1446Timer watchers are simple relative timers that generate an event after a 1725Timer watchers are simple relative timers that generate an event after a
1451year, it will still time out after (roughly) one hour. "Roughly" because 1730year, it will still time out after (roughly) one hour. "Roughly" because
1452detecting time jumps is hard, and some inaccuracies are unavoidable (the 1731detecting time jumps is hard, and some inaccuracies are unavoidable (the
1453monotonic clock option helps a lot here). 1732monotonic clock option helps a lot here).
1454 1733
1455The callback is guaranteed to be invoked only I<after> its timeout has 1734The callback is guaranteed to be invoked only I<after> its timeout has
1456passed. If multiple timers become ready during the same loop iteration 1735passed (not I<at>, so on systems with very low-resolution clocks this
1457then the ones with earlier time-out values are invoked before ones with 1736might introduce a small delay). If multiple timers become ready during the
1458later time-out values (but this is no longer true when a callback calls 1737same loop iteration then the ones with earlier time-out values are invoked
1459C<ev_loop> recursively). 1738before ones of the same priority with later time-out values (but this is
1739no longer true when a callback calls C<ev_run> recursively).
1460 1740
1461=head3 Be smart about timeouts 1741=head3 Be smart about timeouts
1462 1742
1463Many real-world problems involve some kind of timeout, usually for error 1743Many real-world problems involve some kind of timeout, usually for error
1464recovery. A typical example is an HTTP request - if the other side hangs, 1744recovery. A typical example is an HTTP request - if the other side hangs,
1508C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> 1788C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1509member and C<ev_timer_again>. 1789member and C<ev_timer_again>.
1510 1790
1511At start: 1791At start:
1512 1792
1513 ev_timer_init (timer, callback); 1793 ev_init (timer, callback);
1514 timer->repeat = 60.; 1794 timer->repeat = 60.;
1515 ev_timer_again (loop, timer); 1795 ev_timer_again (loop, timer);
1516 1796
1517Each time there is some activity: 1797Each time there is some activity:
1518 1798
1550 ev_tstamp timeout = last_activity + 60.; 1830 ev_tstamp timeout = last_activity + 60.;
1551 1831
1552 // if last_activity + 60. is older than now, we did time out 1832 // if last_activity + 60. is older than now, we did time out
1553 if (timeout < now) 1833 if (timeout < now)
1554 { 1834 {
1555 // timeout occured, take action 1835 // timeout occurred, take action
1556 } 1836 }
1557 else 1837 else
1558 { 1838 {
1559 // callback was invoked, but there was some activity, re-arm 1839 // callback was invoked, but there was some activity, re-arm
1560 // the watcher to fire in last_activity + 60, which is 1840 // the watcher to fire in last_activity + 60, which is
1580 1860
1581To start the timer, simply initialise the watcher and set C<last_activity> 1861To start the timer, simply initialise the watcher and set C<last_activity>
1582to the current time (meaning we just have some activity :), then call the 1862to the current time (meaning we just have some activity :), then call the
1583callback, which will "do the right thing" and start the timer: 1863callback, which will "do the right thing" and start the timer:
1584 1864
1585 ev_timer_init (timer, callback); 1865 ev_init (timer, callback);
1586 last_activity = ev_now (loop); 1866 last_activity = ev_now (loop);
1587 callback (loop, timer, EV_TIMEOUT); 1867 callback (loop, timer, EV_TIMER);
1588 1868
1589And when there is some activity, simply store the current time in 1869And when there is some activity, simply store the current time in
1590C<last_activity>, no libev calls at all: 1870C<last_activity>, no libev calls at all:
1591 1871
1592 last_actiivty = ev_now (loop); 1872 last_activity = ev_now (loop);
1593 1873
1594This technique is slightly more complex, but in most cases where the 1874This technique is slightly more complex, but in most cases where the
1595time-out is unlikely to be triggered, much more efficient. 1875time-out is unlikely to be triggered, much more efficient.
1596 1876
1597Changing the timeout is trivial as well (if it isn't hard-coded in the 1877Changing the timeout is trivial as well (if it isn't hard-coded in the
1635 1915
1636=head3 The special problem of time updates 1916=head3 The special problem of time updates
1637 1917
1638Establishing the current time is a costly operation (it usually takes at 1918Establishing the current time is a costly operation (it usually takes at
1639least two system calls): EV therefore updates its idea of the current 1919least two system calls): EV therefore updates its idea of the current
1640time only before and after C<ev_loop> collects new events, which causes a 1920time only before and after C<ev_run> collects new events, which causes a
1641growing difference between C<ev_now ()> and C<ev_time ()> when handling 1921growing difference between C<ev_now ()> and C<ev_time ()> when handling
1642lots of events in one iteration. 1922lots of events in one iteration.
1643 1923
1644The relative timeouts are calculated relative to the C<ev_now ()> 1924The relative timeouts are calculated relative to the C<ev_now ()>
1645time. This is usually the right thing as this timestamp refers to the time 1925time. This is usually the right thing as this timestamp refers to the time
1651 1931
1652If the event loop is suspended for a long time, you can also force an 1932If the event loop is suspended for a long time, you can also force an
1653update of the time returned by C<ev_now ()> by calling C<ev_now_update 1933update of the time returned by C<ev_now ()> by calling C<ev_now_update
1654()>. 1934()>.
1655 1935
1936=head3 The special problems of suspended animation
1937
1938When you leave the server world it is quite customary to hit machines that
1939can suspend/hibernate - what happens to the clocks during such a suspend?
1940
1941Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1942all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1943to run until the system is suspended, but they will not advance while the
1944system is suspended. That means, on resume, it will be as if the program
1945was frozen for a few seconds, but the suspend time will not be counted
1946towards C<ev_timer> when a monotonic clock source is used. The real time
1947clock advanced as expected, but if it is used as sole clocksource, then a
1948long suspend would be detected as a time jump by libev, and timers would
1949be adjusted accordingly.
1950
1951I would not be surprised to see different behaviour in different between
1952operating systems, OS versions or even different hardware.
1953
1954The other form of suspend (job control, or sending a SIGSTOP) will see a
1955time jump in the monotonic clocks and the realtime clock. If the program
1956is suspended for a very long time, and monotonic clock sources are in use,
1957then you can expect C<ev_timer>s to expire as the full suspension time
1958will be counted towards the timers. When no monotonic clock source is in
1959use, then libev will again assume a timejump and adjust accordingly.
1960
1961It might be beneficial for this latter case to call C<ev_suspend>
1962and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1963deterministic behaviour in this case (you can do nothing against
1964C<SIGSTOP>).
1965
1656=head3 Watcher-Specific Functions and Data Members 1966=head3 Watcher-Specific Functions and Data Members
1657 1967
1658=over 4 1968=over 4
1659 1969
1660=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1970=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1686C<repeat> value), or reset the running timer to the C<repeat> value. 1996C<repeat> value), or reset the running timer to the C<repeat> value.
1687 1997
1688This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 1998This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1689usage example. 1999usage example.
1690 2000
2001=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2002
2003Returns the remaining time until a timer fires. If the timer is active,
2004then this time is relative to the current event loop time, otherwise it's
2005the timeout value currently configured.
2006
2007That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
2008C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
2009will return C<4>. When the timer expires and is restarted, it will return
2010roughly C<7> (likely slightly less as callback invocation takes some time,
2011too), and so on.
2012
1691=item ev_tstamp repeat [read-write] 2013=item ev_tstamp repeat [read-write]
1692 2014
1693The current C<repeat> value. Will be used each time the watcher times out 2015The current C<repeat> value. Will be used each time the watcher times out
1694or C<ev_timer_again> is called, and determines the next timeout (if any), 2016or C<ev_timer_again> is called, and determines the next timeout (if any),
1695which is also when any modifications are taken into account. 2017which is also when any modifications are taken into account.
1720 } 2042 }
1721 2043
1722 ev_timer mytimer; 2044 ev_timer mytimer;
1723 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2045 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1724 ev_timer_again (&mytimer); /* start timer */ 2046 ev_timer_again (&mytimer); /* start timer */
1725 ev_loop (loop, 0); 2047 ev_run (loop, 0);
1726 2048
1727 // and in some piece of code that gets executed on any "activity": 2049 // and in some piece of code that gets executed on any "activity":
1728 // reset the timeout to start ticking again at 10 seconds 2050 // reset the timeout to start ticking again at 10 seconds
1729 ev_timer_again (&mytimer); 2051 ev_timer_again (&mytimer);
1730 2052
1756 2078
1757As with timers, the callback is guaranteed to be invoked only when the 2079As with timers, the callback is guaranteed to be invoked only when the
1758point in time where it is supposed to trigger has passed. If multiple 2080point in time where it is supposed to trigger has passed. If multiple
1759timers become ready during the same loop iteration then the ones with 2081timers become ready during the same loop iteration then the ones with
1760earlier time-out values are invoked before ones with later time-out values 2082earlier time-out values are invoked before ones with later time-out values
1761(but this is no longer true when a callback calls C<ev_loop> recursively). 2083(but this is no longer true when a callback calls C<ev_run> recursively).
1762 2084
1763=head3 Watcher-Specific Functions and Data Members 2085=head3 Watcher-Specific Functions and Data Members
1764 2086
1765=over 4 2087=over 4
1766 2088
1894Example: Call a callback every hour, or, more precisely, whenever the 2216Example: Call a callback every hour, or, more precisely, whenever the
1895system time is divisible by 3600. The callback invocation times have 2217system time is divisible by 3600. The callback invocation times have
1896potentially a lot of jitter, but good long-term stability. 2218potentially a lot of jitter, but good long-term stability.
1897 2219
1898 static void 2220 static void
1899 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2221 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1900 { 2222 {
1901 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2223 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1902 } 2224 }
1903 2225
1904 ev_periodic hourly_tick; 2226 ev_periodic hourly_tick;
1930Signal watchers will trigger an event when the process receives a specific 2252Signal watchers will trigger an event when the process receives a specific
1931signal one or more times. Even though signals are very asynchronous, libev 2253signal one or more times. Even though signals are very asynchronous, libev
1932will try it's best to deliver signals synchronously, i.e. as part of the 2254will try it's best to deliver signals synchronously, i.e. as part of the
1933normal event processing, like any other event. 2255normal event processing, like any other event.
1934 2256
1935If you want signals asynchronously, just use C<sigaction> as you would 2257If you want signals to be delivered truly asynchronously, just use
1936do without libev and forget about sharing the signal. You can even use 2258C<sigaction> as you would do without libev and forget about sharing
1937C<ev_async> from a signal handler to synchronously wake up an event loop. 2259the signal. You can even use C<ev_async> from a signal handler to
2260synchronously wake up an event loop.
1938 2261
1939You can configure as many watchers as you like per signal. Only when the 2262You can configure as many watchers as you like for the same signal, but
2263only within the same loop, i.e. you can watch for C<SIGINT> in your
2264default loop and for C<SIGIO> in another loop, but you cannot watch for
2265C<SIGINT> in both the default loop and another loop at the same time. At
2266the moment, C<SIGCHLD> is permanently tied to the default loop.
2267
1940first watcher gets started will libev actually register a signal handler 2268When the first watcher gets started will libev actually register something
1941with the kernel (thus it coexists with your own signal handlers as long as 2269with the kernel (thus it coexists with your own signal handlers as long as
1942you don't register any with libev for the same signal). Similarly, when 2270you don't register any with libev for the same signal).
1943the last signal watcher for a signal is stopped, libev will reset the
1944signal handler to SIG_DFL (regardless of what it was set to before).
1945 2271
1946If possible and supported, libev will install its handlers with 2272If possible and supported, libev will install its handlers with
1947C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2273C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1948interrupted. If you have a problem with system calls getting interrupted by 2274not be unduly interrupted. If you have a problem with system calls getting
1949signals you can block all signals in an C<ev_check> watcher and unblock 2275interrupted by signals you can block all signals in an C<ev_check> watcher
1950them in an C<ev_prepare> watcher. 2276and unblock them in an C<ev_prepare> watcher.
2277
2278=head3 The special problem of inheritance over fork/execve/pthread_create
2279
2280Both the signal mask (C<sigprocmask>) and the signal disposition
2281(C<sigaction>) are unspecified after starting a signal watcher (and after
2282stopping it again), that is, libev might or might not block the signal,
2283and might or might not set or restore the installed signal handler.
2284
2285While this does not matter for the signal disposition (libev never
2286sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2287C<execve>), this matters for the signal mask: many programs do not expect
2288certain signals to be blocked.
2289
2290This means that before calling C<exec> (from the child) you should reset
2291the signal mask to whatever "default" you expect (all clear is a good
2292choice usually).
2293
2294The simplest way to ensure that the signal mask is reset in the child is
2295to install a fork handler with C<pthread_atfork> that resets it. That will
2296catch fork calls done by libraries (such as the libc) as well.
2297
2298In current versions of libev, the signal will not be blocked indefinitely
2299unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2300the window of opportunity for problems, it will not go away, as libev
2301I<has> to modify the signal mask, at least temporarily.
2302
2303So I can't stress this enough: I<If you do not reset your signal mask when
2304you expect it to be empty, you have a race condition in your code>. This
2305is not a libev-specific thing, this is true for most event libraries.
1951 2306
1952=head3 Watcher-Specific Functions and Data Members 2307=head3 Watcher-Specific Functions and Data Members
1953 2308
1954=over 4 2309=over 4
1955 2310
1971Example: Try to exit cleanly on SIGINT. 2326Example: Try to exit cleanly on SIGINT.
1972 2327
1973 static void 2328 static void
1974 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2329 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
1975 { 2330 {
1976 ev_unloop (loop, EVUNLOOP_ALL); 2331 ev_break (loop, EVBREAK_ALL);
1977 } 2332 }
1978 2333
1979 ev_signal signal_watcher; 2334 ev_signal signal_watcher;
1980 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2335 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1981 ev_signal_start (loop, &signal_watcher); 2336 ev_signal_start (loop, &signal_watcher);
1987some child status changes (most typically when a child of yours dies or 2342some child status changes (most typically when a child of yours dies or
1988exits). It is permissible to install a child watcher I<after> the child 2343exits). It is permissible to install a child watcher I<after> the child
1989has been forked (which implies it might have already exited), as long 2344has been forked (which implies it might have already exited), as long
1990as the event loop isn't entered (or is continued from a watcher), i.e., 2345as the event loop isn't entered (or is continued from a watcher), i.e.,
1991forking and then immediately registering a watcher for the child is fine, 2346forking and then immediately registering a watcher for the child is fine,
1992but forking and registering a watcher a few event loop iterations later is 2347but forking and registering a watcher a few event loop iterations later or
1993not. 2348in the next callback invocation is not.
1994 2349
1995Only the default event loop is capable of handling signals, and therefore 2350Only the default event loop is capable of handling signals, and therefore
1996you can only register child watchers in the default event loop. 2351you can only register child watchers in the default event loop.
1997 2352
2353Due to some design glitches inside libev, child watchers will always be
2354handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2355libev)
2356
1998=head3 Process Interaction 2357=head3 Process Interaction
1999 2358
2000Libev grabs C<SIGCHLD> as soon as the default event loop is 2359Libev grabs C<SIGCHLD> as soon as the default event loop is
2001initialised. This is necessary to guarantee proper behaviour even if 2360initialised. This is necessary to guarantee proper behaviour even if the
2002the first child watcher is started after the child exits. The occurrence 2361first child watcher is started after the child exits. The occurrence
2003of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2362of C<SIGCHLD> is recorded asynchronously, but child reaping is done
2004synchronously as part of the event loop processing. Libev always reaps all 2363synchronously as part of the event loop processing. Libev always reaps all
2005children, even ones not watched. 2364children, even ones not watched.
2006 2365
2007=head3 Overriding the Built-In Processing 2366=head3 Overriding the Built-In Processing
2017=head3 Stopping the Child Watcher 2376=head3 Stopping the Child Watcher
2018 2377
2019Currently, the child watcher never gets stopped, even when the 2378Currently, the child watcher never gets stopped, even when the
2020child terminates, so normally one needs to stop the watcher in the 2379child terminates, so normally one needs to stop the watcher in the
2021callback. Future versions of libev might stop the watcher automatically 2380callback. Future versions of libev might stop the watcher automatically
2022when a child exit is detected. 2381when a child exit is detected (calling C<ev_child_stop> twice is not a
2382problem).
2023 2383
2024=head3 Watcher-Specific Functions and Data Members 2384=head3 Watcher-Specific Functions and Data Members
2025 2385
2026=over 4 2386=over 4
2027 2387
2353 // no longer anything immediate to do. 2713 // no longer anything immediate to do.
2354 } 2714 }
2355 2715
2356 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2716 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2357 ev_idle_init (idle_watcher, idle_cb); 2717 ev_idle_init (idle_watcher, idle_cb);
2358 ev_idle_start (loop, idle_cb); 2718 ev_idle_start (loop, idle_watcher);
2359 2719
2360 2720
2361=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2721=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2362 2722
2363Prepare and check watchers are usually (but not always) used in pairs: 2723Prepare and check watchers are usually (but not always) used in pairs:
2364prepare watchers get invoked before the process blocks and check watchers 2724prepare watchers get invoked before the process blocks and check watchers
2365afterwards. 2725afterwards.
2366 2726
2367You I<must not> call C<ev_loop> or similar functions that enter 2727You I<must not> call C<ev_run> or similar functions that enter
2368the current event loop from either C<ev_prepare> or C<ev_check> 2728the current event loop from either C<ev_prepare> or C<ev_check>
2369watchers. Other loops than the current one are fine, however. The 2729watchers. Other loops than the current one are fine, however. The
2370rationale behind this is that you do not need to check for recursion in 2730rationale behind this is that you do not need to check for recursion in
2371those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2731those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2372C<ev_check> so if you have one watcher of each kind they will always be 2732C<ev_check> so if you have one watcher of each kind they will always be
2456 struct pollfd fds [nfd]; 2816 struct pollfd fds [nfd];
2457 // actual code will need to loop here and realloc etc. 2817 // actual code will need to loop here and realloc etc.
2458 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2818 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2459 2819
2460 /* the callback is illegal, but won't be called as we stop during check */ 2820 /* the callback is illegal, but won't be called as we stop during check */
2461 ev_timer_init (&tw, 0, timeout * 1e-3); 2821 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2462 ev_timer_start (loop, &tw); 2822 ev_timer_start (loop, &tw);
2463 2823
2464 // create one ev_io per pollfd 2824 // create one ev_io per pollfd
2465 for (int i = 0; i < nfd; ++i) 2825 for (int i = 0; i < nfd; ++i)
2466 { 2826 {
2540 2900
2541 if (timeout >= 0) 2901 if (timeout >= 0)
2542 // create/start timer 2902 // create/start timer
2543 2903
2544 // poll 2904 // poll
2545 ev_loop (EV_A_ 0); 2905 ev_run (EV_A_ 0);
2546 2906
2547 // stop timer again 2907 // stop timer again
2548 if (timeout >= 0) 2908 if (timeout >= 0)
2549 ev_timer_stop (EV_A_ &to); 2909 ev_timer_stop (EV_A_ &to);
2550 2910
2628if you do not want that, you need to temporarily stop the embed watcher). 2988if you do not want that, you need to temporarily stop the embed watcher).
2629 2989
2630=item ev_embed_sweep (loop, ev_embed *) 2990=item ev_embed_sweep (loop, ev_embed *)
2631 2991
2632Make a single, non-blocking sweep over the embedded loop. This works 2992Make a single, non-blocking sweep over the embedded loop. This works
2633similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2993similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2634appropriate way for embedded loops. 2994appropriate way for embedded loops.
2635 2995
2636=item struct ev_loop *other [read-only] 2996=item struct ev_loop *other [read-only]
2637 2997
2638The embedded event loop. 2998The embedded event loop.
2696event loop blocks next and before C<ev_check> watchers are being called, 3056event loop blocks next and before C<ev_check> watchers are being called,
2697and only in the child after the fork. If whoever good citizen calling 3057and only in the child after the fork. If whoever good citizen calling
2698C<ev_default_fork> cheats and calls it in the wrong process, the fork 3058C<ev_default_fork> cheats and calls it in the wrong process, the fork
2699handlers will be invoked, too, of course. 3059handlers will be invoked, too, of course.
2700 3060
3061=head3 The special problem of life after fork - how is it possible?
3062
3063Most uses of C<fork()> consist of forking, then some simple calls to set
3064up/change the process environment, followed by a call to C<exec()>. This
3065sequence should be handled by libev without any problems.
3066
3067This changes when the application actually wants to do event handling
3068in the child, or both parent in child, in effect "continuing" after the
3069fork.
3070
3071The default mode of operation (for libev, with application help to detect
3072forks) is to duplicate all the state in the child, as would be expected
3073when I<either> the parent I<or> the child process continues.
3074
3075When both processes want to continue using libev, then this is usually the
3076wrong result. In that case, usually one process (typically the parent) is
3077supposed to continue with all watchers in place as before, while the other
3078process typically wants to start fresh, i.e. without any active watchers.
3079
3080The cleanest and most efficient way to achieve that with libev is to
3081simply create a new event loop, which of course will be "empty", and
3082use that for new watchers. This has the advantage of not touching more
3083memory than necessary, and thus avoiding the copy-on-write, and the
3084disadvantage of having to use multiple event loops (which do not support
3085signal watchers).
3086
3087When this is not possible, or you want to use the default loop for
3088other reasons, then in the process that wants to start "fresh", call
3089C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
3090Destroying the default loop will "orphan" (not stop) all registered
3091watchers, so you have to be careful not to execute code that modifies
3092those watchers. Note also that in that case, you have to re-register any
3093signal watchers.
3094
2701=head3 Watcher-Specific Functions and Data Members 3095=head3 Watcher-Specific Functions and Data Members
2702 3096
2703=over 4 3097=over 4
2704 3098
2705=item ev_fork_init (ev_signal *, callback) 3099=item ev_fork_init (ev_fork *, callback)
2706 3100
2707Initialises and configures the fork watcher - it has no parameters of any 3101Initialises and configures the fork watcher - it has no parameters of any
2708kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 3102kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
2709believe me. 3103believe me.
2710 3104
2711=back 3105=back
2712 3106
2713 3107
3108=head2 C<ev_cleanup> - even the best things end
3109
3110Cleanup watchers are called just before the event loop they are registered
3111with is being destroyed.
3112
3113While there is no guarantee that the event loop gets destroyed, cleanup
3114watchers provide a convenient method to install cleanup hooks for your
3115program, worker threads and so on - you just to make sure to destroy the
3116loop when you want them to be invoked.
3117
3118Cleanup watchers are invoked in the same way as any other watcher. Unlike
3119all other watchers, they do not keep a reference to the event loop (which
3120makes a lot of sense if you think about it). Like all other watchers, you
3121can call libev functions in the callback, except C<ev_cleanup_start>.
3122
3123=head3 Watcher-Specific Functions and Data Members
3124
3125=over 4
3126
3127=item ev_cleanup_init (ev_cleanup *, callback)
3128
3129Initialises and configures the cleanup watcher - it has no parameters of
3130any kind. There is a C<ev_cleanup_set> macro, but using it is utterly
3131pointless, believe me.
3132
3133=back
3134
3135Example: Register an atexit handler to destroy the default loop, so any
3136cleanup functions are called.
3137
3138 static void
3139 program_exits (void)
3140 {
3141 ev_loop_destroy (EV_DEFAULT_UC);
3142 }
3143
3144 ...
3145 atexit (program_exits);
3146
3147
2714=head2 C<ev_async> - how to wake up another event loop 3148=head2 C<ev_async> - how to wake up an event loop
2715 3149
2716In general, you cannot use an C<ev_loop> from multiple threads or other 3150In general, you cannot use an C<ev_run> from multiple threads or other
2717asynchronous sources such as signal handlers (as opposed to multiple event 3151asynchronous sources such as signal handlers (as opposed to multiple event
2718loops - those are of course safe to use in different threads). 3152loops - those are of course safe to use in different threads).
2719 3153
2720Sometimes, however, you need to wake up another event loop you do not 3154Sometimes, however, you need to wake up an event loop you do not control,
2721control, for example because it belongs to another thread. This is what 3155for example because it belongs to another thread. This is what C<ev_async>
2722C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3156watchers do: as long as the C<ev_async> watcher is active, you can signal
2723can signal it by calling C<ev_async_send>, which is thread- and signal 3157it by calling C<ev_async_send>, which is thread- and signal safe.
2724safe.
2725 3158
2726This functionality is very similar to C<ev_signal> watchers, as signals, 3159This functionality is very similar to C<ev_signal> watchers, as signals,
2727too, are asynchronous in nature, and signals, too, will be compressed 3160too, are asynchronous in nature, and signals, too, will be compressed
2728(i.e. the number of callback invocations may be less than the number of 3161(i.e. the number of callback invocations may be less than the number of
2729C<ev_async_sent> calls). 3162C<ev_async_sent> calls).
2734=head3 Queueing 3167=head3 Queueing
2735 3168
2736C<ev_async> does not support queueing of data in any way. The reason 3169C<ev_async> does not support queueing of data in any way. The reason
2737is that the author does not know of a simple (or any) algorithm for a 3170is that the author does not know of a simple (or any) algorithm for a
2738multiple-writer-single-reader queue that works in all cases and doesn't 3171multiple-writer-single-reader queue that works in all cases and doesn't
2739need elaborate support such as pthreads. 3172need elaborate support such as pthreads or unportable memory access
3173semantics.
2740 3174
2741That means that if you want to queue data, you have to provide your own 3175That means that if you want to queue data, you have to provide your own
2742queue. But at least I can tell you how to implement locking around your 3176queue. But at least I can tell you how to implement locking around your
2743queue: 3177queue:
2744 3178
2883 3317
2884If C<timeout> is less than 0, then no timeout watcher will be 3318If C<timeout> is less than 0, then no timeout watcher will be
2885started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3319started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2886repeat = 0) will be started. C<0> is a valid timeout. 3320repeat = 0) will be started. C<0> is a valid timeout.
2887 3321
2888The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3322The callback has the type C<void (*cb)(int revents, void *arg)> and is
2889passed an C<revents> set like normal event callbacks (a combination of 3323passed an C<revents> set like normal event callbacks (a combination of
2890C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3324C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2891value passed to C<ev_once>. Note that it is possible to receive I<both> 3325value passed to C<ev_once>. Note that it is possible to receive I<both>
2892a timeout and an io event at the same time - you probably should give io 3326a timeout and an io event at the same time - you probably should give io
2893events precedence. 3327events precedence.
2894 3328
2895Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3329Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2896 3330
2897 static void stdin_ready (int revents, void *arg) 3331 static void stdin_ready (int revents, void *arg)
2898 { 3332 {
2899 if (revents & EV_READ) 3333 if (revents & EV_READ)
2900 /* stdin might have data for us, joy! */; 3334 /* stdin might have data for us, joy! */;
2901 else if (revents & EV_TIMEOUT) 3335 else if (revents & EV_TIMER)
2902 /* doh, nothing entered */; 3336 /* doh, nothing entered */;
2903 } 3337 }
2904 3338
2905 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3339 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2906 3340
2907=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2908
2909Feeds the given event set into the event loop, as if the specified event
2910had happened for the specified watcher (which must be a pointer to an
2911initialised but not necessarily started event watcher).
2912
2913=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3341=item ev_feed_fd_event (loop, int fd, int revents)
2914 3342
2915Feed an event on the given fd, as if a file descriptor backend detected 3343Feed an event on the given fd, as if a file descriptor backend detected
2916the given events it. 3344the given events it.
2917 3345
2918=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3346=item ev_feed_signal_event (loop, int signum)
2919 3347
2920Feed an event as if the given signal occurred (C<loop> must be the default 3348Feed an event as if the given signal occurred (C<loop> must be the default
2921loop!). 3349loop!).
2922 3350
2923=back 3351=back
3003 3431
3004=over 4 3432=over 4
3005 3433
3006=item ev::TYPE::TYPE () 3434=item ev::TYPE::TYPE ()
3007 3435
3008=item ev::TYPE::TYPE (struct ev_loop *) 3436=item ev::TYPE::TYPE (loop)
3009 3437
3010=item ev::TYPE::~TYPE 3438=item ev::TYPE::~TYPE
3011 3439
3012The constructor (optionally) takes an event loop to associate the watcher 3440The constructor (optionally) takes an event loop to associate the watcher
3013with. If it is omitted, it will use C<EV_DEFAULT>. 3441with. If it is omitted, it will use C<EV_DEFAULT>.
3046 myclass obj; 3474 myclass obj;
3047 ev::io iow; 3475 ev::io iow;
3048 iow.set <myclass, &myclass::io_cb> (&obj); 3476 iow.set <myclass, &myclass::io_cb> (&obj);
3049 3477
3050=item w->set (object *) 3478=item w->set (object *)
3051
3052This is an B<experimental> feature that might go away in a future version.
3053 3479
3054This is a variation of a method callback - leaving out the method to call 3480This is a variation of a method callback - leaving out the method to call
3055will default the method to C<operator ()>, which makes it possible to use 3481will default the method to C<operator ()>, which makes it possible to use
3056functor objects without having to manually specify the C<operator ()> all 3482functor objects without having to manually specify the C<operator ()> all
3057the time. Incidentally, you can then also leave out the template argument 3483the time. Incidentally, you can then also leave out the template argument
3090Example: Use a plain function as callback. 3516Example: Use a plain function as callback.
3091 3517
3092 static void io_cb (ev::io &w, int revents) { } 3518 static void io_cb (ev::io &w, int revents) { }
3093 iow.set <io_cb> (); 3519 iow.set <io_cb> ();
3094 3520
3095=item w->set (struct ev_loop *) 3521=item w->set (loop)
3096 3522
3097Associates a different C<struct ev_loop> with this watcher. You can only 3523Associates a different C<struct ev_loop> with this watcher. You can only
3098do this when the watcher is inactive (and not pending either). 3524do this when the watcher is inactive (and not pending either).
3099 3525
3100=item w->set ([arguments]) 3526=item w->set ([arguments])
3101 3527
3102Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3528Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3103called at least once. Unlike the C counterpart, an active watcher gets 3529method or a suitable start method must be called at least once. Unlike the
3104automatically stopped and restarted when reconfiguring it with this 3530C counterpart, an active watcher gets automatically stopped and restarted
3105method. 3531when reconfiguring it with this method.
3106 3532
3107=item w->start () 3533=item w->start ()
3108 3534
3109Starts the watcher. Note that there is no C<loop> argument, as the 3535Starts the watcher. Note that there is no C<loop> argument, as the
3110constructor already stores the event loop. 3536constructor already stores the event loop.
3111 3537
3538=item w->start ([arguments])
3539
3540Instead of calling C<set> and C<start> methods separately, it is often
3541convenient to wrap them in one call. Uses the same type of arguments as
3542the configure C<set> method of the watcher.
3543
3112=item w->stop () 3544=item w->stop ()
3113 3545
3114Stops the watcher if it is active. Again, no C<loop> argument. 3546Stops the watcher if it is active. Again, no C<loop> argument.
3115 3547
3116=item w->again () (C<ev::timer>, C<ev::periodic> only) 3548=item w->again () (C<ev::timer>, C<ev::periodic> only)
3128 3560
3129=back 3561=back
3130 3562
3131=back 3563=back
3132 3564
3133Example: Define a class with an IO and idle watcher, start one of them in 3565Example: Define a class with two I/O and idle watchers, start the I/O
3134the constructor. 3566watchers in the constructor.
3135 3567
3136 class myclass 3568 class myclass
3137 { 3569 {
3138 ev::io io ; void io_cb (ev::io &w, int revents); 3570 ev::io io ; void io_cb (ev::io &w, int revents);
3571 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3139 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3572 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3140 3573
3141 myclass (int fd) 3574 myclass (int fd)
3142 { 3575 {
3143 io .set <myclass, &myclass::io_cb > (this); 3576 io .set <myclass, &myclass::io_cb > (this);
3577 io2 .set <myclass, &myclass::io2_cb > (this);
3144 idle.set <myclass, &myclass::idle_cb> (this); 3578 idle.set <myclass, &myclass::idle_cb> (this);
3145 3579
3146 io.start (fd, ev::READ); 3580 io.set (fd, ev::WRITE); // configure the watcher
3581 io.start (); // start it whenever convenient
3582
3583 io2.start (fd, ev::READ); // set + start in one call
3147 } 3584 }
3148 }; 3585 };
3149 3586
3150 3587
3151=head1 OTHER LANGUAGE BINDINGS 3588=head1 OTHER LANGUAGE BINDINGS
3197=item Ocaml 3634=item Ocaml
3198 3635
3199Erkki Seppala has written Ocaml bindings for libev, to be found at 3636Erkki Seppala has written Ocaml bindings for libev, to be found at
3200L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3637L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3201 3638
3639=item Lua
3640
3641Brian Maher has written a partial interface to libev for lua (at the
3642time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3643L<http://github.com/brimworks/lua-ev>.
3644
3202=back 3645=back
3203 3646
3204 3647
3205=head1 MACRO MAGIC 3648=head1 MACRO MAGIC
3206 3649
3219loop argument"). The C<EV_A> form is used when this is the sole argument, 3662loop argument"). The C<EV_A> form is used when this is the sole argument,
3220C<EV_A_> is used when other arguments are following. Example: 3663C<EV_A_> is used when other arguments are following. Example:
3221 3664
3222 ev_unref (EV_A); 3665 ev_unref (EV_A);
3223 ev_timer_add (EV_A_ watcher); 3666 ev_timer_add (EV_A_ watcher);
3224 ev_loop (EV_A_ 0); 3667 ev_run (EV_A_ 0);
3225 3668
3226It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3669It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3227which is often provided by the following macro. 3670which is often provided by the following macro.
3228 3671
3229=item C<EV_P>, C<EV_P_> 3672=item C<EV_P>, C<EV_P_>
3269 } 3712 }
3270 3713
3271 ev_check check; 3714 ev_check check;
3272 ev_check_init (&check, check_cb); 3715 ev_check_init (&check, check_cb);
3273 ev_check_start (EV_DEFAULT_ &check); 3716 ev_check_start (EV_DEFAULT_ &check);
3274 ev_loop (EV_DEFAULT_ 0); 3717 ev_run (EV_DEFAULT_ 0);
3275 3718
3276=head1 EMBEDDING 3719=head1 EMBEDDING
3277 3720
3278Libev can (and often is) directly embedded into host 3721Libev can (and often is) directly embedded into host
3279applications. Examples of applications that embed it include the Deliantra 3722applications. Examples of applications that embed it include the Deliantra
3359 libev.m4 3802 libev.m4
3360 3803
3361=head2 PREPROCESSOR SYMBOLS/MACROS 3804=head2 PREPROCESSOR SYMBOLS/MACROS
3362 3805
3363Libev can be configured via a variety of preprocessor symbols you have to 3806Libev can be configured via a variety of preprocessor symbols you have to
3364define before including any of its files. The default in the absence of 3807define before including (or compiling) any of its files. The default in
3365autoconf is documented for every option. 3808the absence of autoconf is documented for every option.
3809
3810Symbols marked with "(h)" do not change the ABI, and can have different
3811values when compiling libev vs. including F<ev.h>, so it is permissible
3812to redefine them before including F<ev.h> without breaking compatibility
3813to a compiled library. All other symbols change the ABI, which means all
3814users of libev and the libev code itself must be compiled with compatible
3815settings.
3366 3816
3367=over 4 3817=over 4
3368 3818
3819=item EV_COMPAT3 (h)
3820
3821Backwards compatibility is a major concern for libev. This is why this
3822release of libev comes with wrappers for the functions and symbols that
3823have been renamed between libev version 3 and 4.
3824
3825You can disable these wrappers (to test compatibility with future
3826versions) by defining C<EV_COMPAT3> to C<0> when compiling your
3827sources. This has the additional advantage that you can drop the C<struct>
3828from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
3829typedef in that case.
3830
3831In some future version, the default for C<EV_COMPAT3> will become C<0>,
3832and in some even more future version the compatibility code will be
3833removed completely.
3834
3369=item EV_STANDALONE 3835=item EV_STANDALONE (h)
3370 3836
3371Must always be C<1> if you do not use autoconf configuration, which 3837Must always be C<1> if you do not use autoconf configuration, which
3372keeps libev from including F<config.h>, and it also defines dummy 3838keeps libev from including F<config.h>, and it also defines dummy
3373implementations for some libevent functions (such as logging, which is not 3839implementations for some libevent functions (such as logging, which is not
3374supported). It will also not define any of the structs usually found in 3840supported). It will also not define any of the structs usually found in
3375F<event.h> that are not directly supported by the libev core alone. 3841F<event.h> that are not directly supported by the libev core alone.
3376 3842
3377In stanbdalone mode, libev will still try to automatically deduce the 3843In standalone mode, libev will still try to automatically deduce the
3378configuration, but has to be more conservative. 3844configuration, but has to be more conservative.
3379 3845
3380=item EV_USE_MONOTONIC 3846=item EV_USE_MONOTONIC
3381 3847
3382If defined to be C<1>, libev will try to detect the availability of the 3848If defined to be C<1>, libev will try to detect the availability of the
3447be used is the winsock select). This means that it will call 3913be used is the winsock select). This means that it will call
3448C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3914C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3449it is assumed that all these functions actually work on fds, even 3915it is assumed that all these functions actually work on fds, even
3450on win32. Should not be defined on non-win32 platforms. 3916on win32. Should not be defined on non-win32 platforms.
3451 3917
3452=item EV_FD_TO_WIN32_HANDLE 3918=item EV_FD_TO_WIN32_HANDLE(fd)
3453 3919
3454If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3920If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3455file descriptors to socket handles. When not defining this symbol (the 3921file descriptors to socket handles. When not defining this symbol (the
3456default), then libev will call C<_get_osfhandle>, which is usually 3922default), then libev will call C<_get_osfhandle>, which is usually
3457correct. In some cases, programs use their own file descriptor management, 3923correct. In some cases, programs use their own file descriptor management,
3458in which case they can provide this function to map fds to socket handles. 3924in which case they can provide this function to map fds to socket handles.
3925
3926=item EV_WIN32_HANDLE_TO_FD(handle)
3927
3928If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3929using the standard C<_open_osfhandle> function. For programs implementing
3930their own fd to handle mapping, overwriting this function makes it easier
3931to do so. This can be done by defining this macro to an appropriate value.
3932
3933=item EV_WIN32_CLOSE_FD(fd)
3934
3935If programs implement their own fd to handle mapping on win32, then this
3936macro can be used to override the C<close> function, useful to unregister
3937file descriptors again. Note that the replacement function has to close
3938the underlying OS handle.
3459 3939
3460=item EV_USE_POLL 3940=item EV_USE_POLL
3461 3941
3462If defined to be C<1>, libev will compile in support for the C<poll>(2) 3942If defined to be C<1>, libev will compile in support for the C<poll>(2)
3463backend. Otherwise it will be enabled on non-win32 platforms. It 3943backend. Otherwise it will be enabled on non-win32 platforms. It
3510as well as for signal and thread safety in C<ev_async> watchers. 3990as well as for signal and thread safety in C<ev_async> watchers.
3511 3991
3512In the absence of this define, libev will use C<sig_atomic_t volatile> 3992In the absence of this define, libev will use C<sig_atomic_t volatile>
3513(from F<signal.h>), which is usually good enough on most platforms. 3993(from F<signal.h>), which is usually good enough on most platforms.
3514 3994
3515=item EV_H 3995=item EV_H (h)
3516 3996
3517The name of the F<ev.h> header file used to include it. The default if 3997The name of the F<ev.h> header file used to include it. The default if
3518undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3998undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3519used to virtually rename the F<ev.h> header file in case of conflicts. 3999used to virtually rename the F<ev.h> header file in case of conflicts.
3520 4000
3521=item EV_CONFIG_H 4001=item EV_CONFIG_H (h)
3522 4002
3523If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 4003If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3524F<ev.c>'s idea of where to find the F<config.h> file, similarly to 4004F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3525C<EV_H>, above. 4005C<EV_H>, above.
3526 4006
3527=item EV_EVENT_H 4007=item EV_EVENT_H (h)
3528 4008
3529Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 4009Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3530of how the F<event.h> header can be found, the default is C<"event.h">. 4010of how the F<event.h> header can be found, the default is C<"event.h">.
3531 4011
3532=item EV_PROTOTYPES 4012=item EV_PROTOTYPES (h)
3533 4013
3534If defined to be C<0>, then F<ev.h> will not define any function 4014If defined to be C<0>, then F<ev.h> will not define any function
3535prototypes, but still define all the structs and other symbols. This is 4015prototypes, but still define all the structs and other symbols. This is
3536occasionally useful if you want to provide your own wrapper functions 4016occasionally useful if you want to provide your own wrapper functions
3537around libev functions. 4017around libev functions.
3559fine. 4039fine.
3560 4040
3561If your embedding application does not need any priorities, defining these 4041If your embedding application does not need any priorities, defining these
3562both to C<0> will save some memory and CPU. 4042both to C<0> will save some memory and CPU.
3563 4043
3564=item EV_PERIODIC_ENABLE 4044=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
4045EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
4046EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3565 4047
3566If undefined or defined to be C<1>, then periodic timers are supported. If 4048If undefined or defined to be C<1> (and the platform supports it), then
3567defined to be C<0>, then they are not. Disabling them saves a few kB of 4049the respective watcher type is supported. If defined to be C<0>, then it
3568code. 4050is not. Disabling watcher types mainly saves code size.
3569 4051
3570=item EV_IDLE_ENABLE 4052=item EV_FEATURES
3571
3572If undefined or defined to be C<1>, then idle watchers are supported. If
3573defined to be C<0>, then they are not. Disabling them saves a few kB of
3574code.
3575
3576=item EV_EMBED_ENABLE
3577
3578If undefined or defined to be C<1>, then embed watchers are supported. If
3579defined to be C<0>, then they are not. Embed watchers rely on most other
3580watcher types, which therefore must not be disabled.
3581
3582=item EV_STAT_ENABLE
3583
3584If undefined or defined to be C<1>, then stat watchers are supported. If
3585defined to be C<0>, then they are not.
3586
3587=item EV_FORK_ENABLE
3588
3589If undefined or defined to be C<1>, then fork watchers are supported. If
3590defined to be C<0>, then they are not.
3591
3592=item EV_ASYNC_ENABLE
3593
3594If undefined or defined to be C<1>, then async watchers are supported. If
3595defined to be C<0>, then they are not.
3596
3597=item EV_MINIMAL
3598 4053
3599If you need to shave off some kilobytes of code at the expense of some 4054If you need to shave off some kilobytes of code at the expense of some
3600speed, define this symbol to C<1>. Currently this is used to override some 4055speed (but with the full API), you can define this symbol to request
3601inlining decisions, saves roughly 30% code size on amd64. It also selects a 4056certain subsets of functionality. The default is to enable all features
3602much smaller 2-heap for timer management over the default 4-heap. 4057that can be enabled on the platform.
4058
4059A typical way to use this symbol is to define it to C<0> (or to a bitset
4060with some broad features you want) and then selectively re-enable
4061additional parts you want, for example if you want everything minimal,
4062but multiple event loop support, async and child watchers and the poll
4063backend, use this:
4064
4065 #define EV_FEATURES 0
4066 #define EV_MULTIPLICITY 1
4067 #define EV_USE_POLL 1
4068 #define EV_CHILD_ENABLE 1
4069 #define EV_ASYNC_ENABLE 1
4070
4071The actual value is a bitset, it can be a combination of the following
4072values:
4073
4074=over 4
4075
4076=item C<1> - faster/larger code
4077
4078Use larger code to speed up some operations.
4079
4080Currently this is used to override some inlining decisions (enlarging the
4081code size by roughly 30% on amd64).
4082
4083When optimising for size, use of compiler flags such as C<-Os> with
4084gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4085assertions.
4086
4087=item C<2> - faster/larger data structures
4088
4089Replaces the small 2-heap for timer management by a faster 4-heap, larger
4090hash table sizes and so on. This will usually further increase code size
4091and can additionally have an effect on the size of data structures at
4092runtime.
4093
4094=item C<4> - full API configuration
4095
4096This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4097enables multiplicity (C<EV_MULTIPLICITY>=1).
4098
4099=item C<8> - full API
4100
4101This enables a lot of the "lesser used" API functions. See C<ev.h> for
4102details on which parts of the API are still available without this
4103feature, and do not complain if this subset changes over time.
4104
4105=item C<16> - enable all optional watcher types
4106
4107Enables all optional watcher types. If you want to selectively enable
4108only some watcher types other than I/O and timers (e.g. prepare,
4109embed, async, child...) you can enable them manually by defining
4110C<EV_watchertype_ENABLE> to C<1> instead.
4111
4112=item C<32> - enable all backends
4113
4114This enables all backends - without this feature, you need to enable at
4115least one backend manually (C<EV_USE_SELECT> is a good choice).
4116
4117=item C<64> - enable OS-specific "helper" APIs
4118
4119Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
4120default.
4121
4122=back
4123
4124Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
4125reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
4126code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
4127watchers, timers and monotonic clock support.
4128
4129With an intelligent-enough linker (gcc+binutils are intelligent enough
4130when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4131your program might be left out as well - a binary starting a timer and an
4132I/O watcher then might come out at only 5Kb.
4133
4134=item EV_AVOID_STDIO
4135
4136If this is set to C<1> at compiletime, then libev will avoid using stdio
4137functions (printf, scanf, perror etc.). This will increase the code size
4138somewhat, but if your program doesn't otherwise depend on stdio and your
4139libc allows it, this avoids linking in the stdio library which is quite
4140big.
4141
4142Note that error messages might become less precise when this option is
4143enabled.
4144
4145=item EV_NSIG
4146
4147The highest supported signal number, +1 (or, the number of
4148signals): Normally, libev tries to deduce the maximum number of signals
4149automatically, but sometimes this fails, in which case it can be
4150specified. Also, using a lower number than detected (C<32> should be
4151good for about any system in existence) can save some memory, as libev
4152statically allocates some 12-24 bytes per signal number.
3603 4153
3604=item EV_PID_HASHSIZE 4154=item EV_PID_HASHSIZE
3605 4155
3606C<ev_child> watchers use a small hash table to distribute workload by 4156C<ev_child> watchers use a small hash table to distribute workload by
3607pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 4157pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3608than enough. If you need to manage thousands of children you might want to 4158usually more than enough. If you need to manage thousands of children you
3609increase this value (I<must> be a power of two). 4159might want to increase this value (I<must> be a power of two).
3610 4160
3611=item EV_INOTIFY_HASHSIZE 4161=item EV_INOTIFY_HASHSIZE
3612 4162
3613C<ev_stat> watchers use a small hash table to distribute workload by 4163C<ev_stat> watchers use a small hash table to distribute workload by
3614inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4164inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3615usually more than enough. If you need to manage thousands of C<ev_stat> 4165disabled), usually more than enough. If you need to manage thousands of
3616watchers you might want to increase this value (I<must> be a power of 4166C<ev_stat> watchers you might want to increase this value (I<must> be a
3617two). 4167power of two).
3618 4168
3619=item EV_USE_4HEAP 4169=item EV_USE_4HEAP
3620 4170
3621Heaps are not very cache-efficient. To improve the cache-efficiency of the 4171Heaps are not very cache-efficient. To improve the cache-efficiency of the
3622timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4172timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3623to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4173to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3624faster performance with many (thousands) of watchers. 4174faster performance with many (thousands) of watchers.
3625 4175
3626The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4176The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3627(disabled). 4177will be C<0>.
3628 4178
3629=item EV_HEAP_CACHE_AT 4179=item EV_HEAP_CACHE_AT
3630 4180
3631Heaps are not very cache-efficient. To improve the cache-efficiency of the 4181Heaps are not very cache-efficient. To improve the cache-efficiency of the
3632timer and periodics heaps, libev can cache the timestamp (I<at>) within 4182timer and periodics heaps, libev can cache the timestamp (I<at>) within
3633the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4183the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3634which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4184which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3635but avoids random read accesses on heap changes. This improves performance 4185but avoids random read accesses on heap changes. This improves performance
3636noticeably with many (hundreds) of watchers. 4186noticeably with many (hundreds) of watchers.
3637 4187
3638The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4188The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3639(disabled). 4189will be C<0>.
3640 4190
3641=item EV_VERIFY 4191=item EV_VERIFY
3642 4192
3643Controls how much internal verification (see C<ev_loop_verify ()>) will 4193Controls how much internal verification (see C<ev_verify ()>) will
3644be done: If set to C<0>, no internal verification code will be compiled 4194be done: If set to C<0>, no internal verification code will be compiled
3645in. If set to C<1>, then verification code will be compiled in, but not 4195in. If set to C<1>, then verification code will be compiled in, but not
3646called. If set to C<2>, then the internal verification code will be 4196called. If set to C<2>, then the internal verification code will be
3647called once per loop, which can slow down libev. If set to C<3>, then the 4197called once per loop, which can slow down libev. If set to C<3>, then the
3648verification code will be called very frequently, which will slow down 4198verification code will be called very frequently, which will slow down
3649libev considerably. 4199libev considerably.
3650 4200
3651The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4201The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3652C<0>. 4202will be C<0>.
3653 4203
3654=item EV_COMMON 4204=item EV_COMMON
3655 4205
3656By default, all watchers have a C<void *data> member. By redefining 4206By default, all watchers have a C<void *data> member. By redefining
3657this macro to a something else you can include more and other types of 4207this macro to something else you can include more and other types of
3658members. You have to define it each time you include one of the files, 4208members. You have to define it each time you include one of the files,
3659though, and it must be identical each time. 4209though, and it must be identical each time.
3660 4210
3661For example, the perl EV module uses something like this: 4211For example, the perl EV module uses something like this:
3662 4212
3715file. 4265file.
3716 4266
3717The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4267The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3718that everybody includes and which overrides some configure choices: 4268that everybody includes and which overrides some configure choices:
3719 4269
3720 #define EV_MINIMAL 1 4270 #define EV_FEATURES 8
3721 #define EV_USE_POLL 0 4271 #define EV_USE_SELECT 1
3722 #define EV_MULTIPLICITY 0
3723 #define EV_PERIODIC_ENABLE 0 4272 #define EV_PREPARE_ENABLE 1
4273 #define EV_IDLE_ENABLE 1
3724 #define EV_STAT_ENABLE 0 4274 #define EV_SIGNAL_ENABLE 1
3725 #define EV_FORK_ENABLE 0 4275 #define EV_CHILD_ENABLE 1
4276 #define EV_USE_STDEXCEPT 0
3726 #define EV_CONFIG_H <config.h> 4277 #define EV_CONFIG_H <config.h>
3727 #define EV_MINPRI 0
3728 #define EV_MAXPRI 0
3729 4278
3730 #include "ev++.h" 4279 #include "ev++.h"
3731 4280
3732And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4281And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3733 4282
3793default loop and triggering an C<ev_async> watcher from the default loop 4342default loop and triggering an C<ev_async> watcher from the default loop
3794watcher callback into the event loop interested in the signal. 4343watcher callback into the event loop interested in the signal.
3795 4344
3796=back 4345=back
3797 4346
4347=head4 THREAD LOCKING EXAMPLE
4348
4349Here is a fictitious example of how to run an event loop in a different
4350thread than where callbacks are being invoked and watchers are
4351created/added/removed.
4352
4353For a real-world example, see the C<EV::Loop::Async> perl module,
4354which uses exactly this technique (which is suited for many high-level
4355languages).
4356
4357The example uses a pthread mutex to protect the loop data, a condition
4358variable to wait for callback invocations, an async watcher to notify the
4359event loop thread and an unspecified mechanism to wake up the main thread.
4360
4361First, you need to associate some data with the event loop:
4362
4363 typedef struct {
4364 mutex_t lock; /* global loop lock */
4365 ev_async async_w;
4366 thread_t tid;
4367 cond_t invoke_cv;
4368 } userdata;
4369
4370 void prepare_loop (EV_P)
4371 {
4372 // for simplicity, we use a static userdata struct.
4373 static userdata u;
4374
4375 ev_async_init (&u->async_w, async_cb);
4376 ev_async_start (EV_A_ &u->async_w);
4377
4378 pthread_mutex_init (&u->lock, 0);
4379 pthread_cond_init (&u->invoke_cv, 0);
4380
4381 // now associate this with the loop
4382 ev_set_userdata (EV_A_ u);
4383 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4384 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4385
4386 // then create the thread running ev_loop
4387 pthread_create (&u->tid, 0, l_run, EV_A);
4388 }
4389
4390The callback for the C<ev_async> watcher does nothing: the watcher is used
4391solely to wake up the event loop so it takes notice of any new watchers
4392that might have been added:
4393
4394 static void
4395 async_cb (EV_P_ ev_async *w, int revents)
4396 {
4397 // just used for the side effects
4398 }
4399
4400The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4401protecting the loop data, respectively.
4402
4403 static void
4404 l_release (EV_P)
4405 {
4406 userdata *u = ev_userdata (EV_A);
4407 pthread_mutex_unlock (&u->lock);
4408 }
4409
4410 static void
4411 l_acquire (EV_P)
4412 {
4413 userdata *u = ev_userdata (EV_A);
4414 pthread_mutex_lock (&u->lock);
4415 }
4416
4417The event loop thread first acquires the mutex, and then jumps straight
4418into C<ev_run>:
4419
4420 void *
4421 l_run (void *thr_arg)
4422 {
4423 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4424
4425 l_acquire (EV_A);
4426 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4427 ev_run (EV_A_ 0);
4428 l_release (EV_A);
4429
4430 return 0;
4431 }
4432
4433Instead of invoking all pending watchers, the C<l_invoke> callback will
4434signal the main thread via some unspecified mechanism (signals? pipe
4435writes? C<Async::Interrupt>?) and then waits until all pending watchers
4436have been called (in a while loop because a) spurious wakeups are possible
4437and b) skipping inter-thread-communication when there are no pending
4438watchers is very beneficial):
4439
4440 static void
4441 l_invoke (EV_P)
4442 {
4443 userdata *u = ev_userdata (EV_A);
4444
4445 while (ev_pending_count (EV_A))
4446 {
4447 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4448 pthread_cond_wait (&u->invoke_cv, &u->lock);
4449 }
4450 }
4451
4452Now, whenever the main thread gets told to invoke pending watchers, it
4453will grab the lock, call C<ev_invoke_pending> and then signal the loop
4454thread to continue:
4455
4456 static void
4457 real_invoke_pending (EV_P)
4458 {
4459 userdata *u = ev_userdata (EV_A);
4460
4461 pthread_mutex_lock (&u->lock);
4462 ev_invoke_pending (EV_A);
4463 pthread_cond_signal (&u->invoke_cv);
4464 pthread_mutex_unlock (&u->lock);
4465 }
4466
4467Whenever you want to start/stop a watcher or do other modifications to an
4468event loop, you will now have to lock:
4469
4470 ev_timer timeout_watcher;
4471 userdata *u = ev_userdata (EV_A);
4472
4473 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4474
4475 pthread_mutex_lock (&u->lock);
4476 ev_timer_start (EV_A_ &timeout_watcher);
4477 ev_async_send (EV_A_ &u->async_w);
4478 pthread_mutex_unlock (&u->lock);
4479
4480Note that sending the C<ev_async> watcher is required because otherwise
4481an event loop currently blocking in the kernel will have no knowledge
4482about the newly added timer. By waking up the loop it will pick up any new
4483watchers in the next event loop iteration.
4484
3798=head3 COROUTINES 4485=head3 COROUTINES
3799 4486
3800Libev is very accommodating to coroutines ("cooperative threads"): 4487Libev is very accommodating to coroutines ("cooperative threads"):
3801libev fully supports nesting calls to its functions from different 4488libev fully supports nesting calls to its functions from different
3802coroutines (e.g. you can call C<ev_loop> on the same loop from two 4489coroutines (e.g. you can call C<ev_run> on the same loop from two
3803different coroutines, and switch freely between both coroutines running the 4490different coroutines, and switch freely between both coroutines running
3804loop, as long as you don't confuse yourself). The only exception is that 4491the loop, as long as you don't confuse yourself). The only exception is
3805you must not do this from C<ev_periodic> reschedule callbacks. 4492that you must not do this from C<ev_periodic> reschedule callbacks.
3806 4493
3807Care has been taken to ensure that libev does not keep local state inside 4494Care has been taken to ensure that libev does not keep local state inside
3808C<ev_loop>, and other calls do not usually allow for coroutine switches as 4495C<ev_run>, and other calls do not usually allow for coroutine switches as
3809they do not call any callbacks. 4496they do not call any callbacks.
3810 4497
3811=head2 COMPILER WARNINGS 4498=head2 COMPILER WARNINGS
3812 4499
3813Depending on your compiler and compiler settings, you might get no or a 4500Depending on your compiler and compiler settings, you might get no or a
3824maintainable. 4511maintainable.
3825 4512
3826And of course, some compiler warnings are just plain stupid, or simply 4513And of course, some compiler warnings are just plain stupid, or simply
3827wrong (because they don't actually warn about the condition their message 4514wrong (because they don't actually warn about the condition their message
3828seems to warn about). For example, certain older gcc versions had some 4515seems to warn about). For example, certain older gcc versions had some
3829warnings that resulted an extreme number of false positives. These have 4516warnings that resulted in an extreme number of false positives. These have
3830been fixed, but some people still insist on making code warn-free with 4517been fixed, but some people still insist on making code warn-free with
3831such buggy versions. 4518such buggy versions.
3832 4519
3833While libev is written to generate as few warnings as possible, 4520While libev is written to generate as few warnings as possible,
3834"warn-free" code is not a goal, and it is recommended not to build libev 4521"warn-free" code is not a goal, and it is recommended not to build libev
3870I suggest using suppression lists. 4557I suggest using suppression lists.
3871 4558
3872 4559
3873=head1 PORTABILITY NOTES 4560=head1 PORTABILITY NOTES
3874 4561
4562=head2 GNU/LINUX 32 BIT LIMITATIONS
4563
4564GNU/Linux is the only common platform that supports 64 bit file/large file
4565interfaces but I<disables> them by default.
4566
4567That means that libev compiled in the default environment doesn't support
4568files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4569
4570Unfortunately, many programs try to work around this GNU/Linux issue
4571by enabling the large file API, which makes them incompatible with the
4572standard libev compiled for their system.
4573
4574Likewise, libev cannot enable the large file API itself as this would
4575suddenly make it incompatible to the default compile time environment,
4576i.e. all programs not using special compile switches.
4577
4578=head2 OS/X AND DARWIN BUGS
4579
4580The whole thing is a bug if you ask me - basically any system interface
4581you touch is broken, whether it is locales, poll, kqueue or even the
4582OpenGL drivers.
4583
4584=head3 C<kqueue> is buggy
4585
4586The kqueue syscall is broken in all known versions - most versions support
4587only sockets, many support pipes.
4588
4589Libev tries to work around this by not using C<kqueue> by default on this
4590rotten platform, but of course you can still ask for it when creating a
4591loop - embedding a socket-only kqueue loop into a select-based one is
4592probably going to work well.
4593
4594=head3 C<poll> is buggy
4595
4596Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4597implementation by something calling C<kqueue> internally around the 10.5.6
4598release, so now C<kqueue> I<and> C<poll> are broken.
4599
4600Libev tries to work around this by not using C<poll> by default on
4601this rotten platform, but of course you can still ask for it when creating
4602a loop.
4603
4604=head3 C<select> is buggy
4605
4606All that's left is C<select>, and of course Apple found a way to fuck this
4607one up as well: On OS/X, C<select> actively limits the number of file
4608descriptors you can pass in to 1024 - your program suddenly crashes when
4609you use more.
4610
4611There is an undocumented "workaround" for this - defining
4612C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4613work on OS/X.
4614
4615=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4616
4617=head3 C<errno> reentrancy
4618
4619The default compile environment on Solaris is unfortunately so
4620thread-unsafe that you can't even use components/libraries compiled
4621without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4622defined by default. A valid, if stupid, implementation choice.
4623
4624If you want to use libev in threaded environments you have to make sure
4625it's compiled with C<_REENTRANT> defined.
4626
4627=head3 Event port backend
4628
4629The scalable event interface for Solaris is called "event
4630ports". Unfortunately, this mechanism is very buggy in all major
4631releases. If you run into high CPU usage, your program freezes or you get
4632a large number of spurious wakeups, make sure you have all the relevant
4633and latest kernel patches applied. No, I don't know which ones, but there
4634are multiple ones to apply, and afterwards, event ports actually work
4635great.
4636
4637If you can't get it to work, you can try running the program by setting
4638the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4639C<select> backends.
4640
4641=head2 AIX POLL BUG
4642
4643AIX unfortunately has a broken C<poll.h> header. Libev works around
4644this by trying to avoid the poll backend altogether (i.e. it's not even
4645compiled in), which normally isn't a big problem as C<select> works fine
4646with large bitsets on AIX, and AIX is dead anyway.
4647
3875=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4648=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4649
4650=head3 General issues
3876 4651
3877Win32 doesn't support any of the standards (e.g. POSIX) that libev 4652Win32 doesn't support any of the standards (e.g. POSIX) that libev
3878requires, and its I/O model is fundamentally incompatible with the POSIX 4653requires, and its I/O model is fundamentally incompatible with the POSIX
3879model. Libev still offers limited functionality on this platform in 4654model. Libev still offers limited functionality on this platform in
3880the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4655the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3881descriptors. This only applies when using Win32 natively, not when using 4656descriptors. This only applies when using Win32 natively, not when using
3882e.g. cygwin. 4657e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4658as every compielr comes with a slightly differently broken/incompatible
4659environment.
3883 4660
3884Lifting these limitations would basically require the full 4661Lifting these limitations would basically require the full
3885re-implementation of the I/O system. If you are into these kinds of 4662re-implementation of the I/O system. If you are into this kind of thing,
3886things, then note that glib does exactly that for you in a very portable 4663then note that glib does exactly that for you in a very portable way (note
3887way (note also that glib is the slowest event library known to man). 4664also that glib is the slowest event library known to man).
3888 4665
3889There is no supported compilation method available on windows except 4666There is no supported compilation method available on windows except
3890embedding it into other applications. 4667embedding it into other applications.
4668
4669Sensible signal handling is officially unsupported by Microsoft - libev
4670tries its best, but under most conditions, signals will simply not work.
3891 4671
3892Not a libev limitation but worth mentioning: windows apparently doesn't 4672Not a libev limitation but worth mentioning: windows apparently doesn't
3893accept large writes: instead of resulting in a partial write, windows will 4673accept large writes: instead of resulting in a partial write, windows will
3894either accept everything or return C<ENOBUFS> if the buffer is too large, 4674either accept everything or return C<ENOBUFS> if the buffer is too large,
3895so make sure you only write small amounts into your sockets (less than a 4675so make sure you only write small amounts into your sockets (less than a
3900the abysmal performance of winsockets, using a large number of sockets 4680the abysmal performance of winsockets, using a large number of sockets
3901is not recommended (and not reasonable). If your program needs to use 4681is not recommended (and not reasonable). If your program needs to use
3902more than a hundred or so sockets, then likely it needs to use a totally 4682more than a hundred or so sockets, then likely it needs to use a totally
3903different implementation for windows, as libev offers the POSIX readiness 4683different implementation for windows, as libev offers the POSIX readiness
3904notification model, which cannot be implemented efficiently on windows 4684notification model, which cannot be implemented efficiently on windows
3905(Microsoft monopoly games). 4685(due to Microsoft monopoly games).
3906 4686
3907A typical way to use libev under windows is to embed it (see the embedding 4687A typical way to use libev under windows is to embed it (see the embedding
3908section for details) and use the following F<evwrap.h> header file instead 4688section for details) and use the following F<evwrap.h> header file instead
3909of F<ev.h>: 4689of F<ev.h>:
3910 4690
3917you do I<not> compile the F<ev.c> or any other embedded source files!): 4697you do I<not> compile the F<ev.c> or any other embedded source files!):
3918 4698
3919 #include "evwrap.h" 4699 #include "evwrap.h"
3920 #include "ev.c" 4700 #include "ev.c"
3921 4701
3922=over 4
3923
3924=item The winsocket select function 4702=head3 The winsocket C<select> function
3925 4703
3926The winsocket C<select> function doesn't follow POSIX in that it 4704The winsocket C<select> function doesn't follow POSIX in that it
3927requires socket I<handles> and not socket I<file descriptors> (it is 4705requires socket I<handles> and not socket I<file descriptors> (it is
3928also extremely buggy). This makes select very inefficient, and also 4706also extremely buggy). This makes select very inefficient, and also
3929requires a mapping from file descriptors to socket handles (the Microsoft 4707requires a mapping from file descriptors to socket handles (the Microsoft
3938 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4716 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3939 4717
3940Note that winsockets handling of fd sets is O(n), so you can easily get a 4718Note that winsockets handling of fd sets is O(n), so you can easily get a
3941complexity in the O(n²) range when using win32. 4719complexity in the O(n²) range when using win32.
3942 4720
3943=item Limited number of file descriptors 4721=head3 Limited number of file descriptors
3944 4722
3945Windows has numerous arbitrary (and low) limits on things. 4723Windows has numerous arbitrary (and low) limits on things.
3946 4724
3947Early versions of winsocket's select only supported waiting for a maximum 4725Early versions of winsocket's select only supported waiting for a maximum
3948of C<64> handles (probably owning to the fact that all windows kernels 4726of C<64> handles (probably owning to the fact that all windows kernels
3949can only wait for C<64> things at the same time internally; Microsoft 4727can only wait for C<64> things at the same time internally; Microsoft
3950recommends spawning a chain of threads and wait for 63 handles and the 4728recommends spawning a chain of threads and wait for 63 handles and the
3951previous thread in each. Great). 4729previous thread in each. Sounds great!).
3952 4730
3953Newer versions support more handles, but you need to define C<FD_SETSIZE> 4731Newer versions support more handles, but you need to define C<FD_SETSIZE>
3954to some high number (e.g. C<2048>) before compiling the winsocket select 4732to some high number (e.g. C<2048>) before compiling the winsocket select
3955call (which might be in libev or elsewhere, for example, perl does its own 4733call (which might be in libev or elsewhere, for example, perl and many
3956select emulation on windows). 4734other interpreters do their own select emulation on windows).
3957 4735
3958Another limit is the number of file descriptors in the Microsoft runtime 4736Another limit is the number of file descriptors in the Microsoft runtime
3959libraries, which by default is C<64> (there must be a hidden I<64> fetish 4737libraries, which by default is C<64> (there must be a hidden I<64>
3960or something like this inside Microsoft). You can increase this by calling 4738fetish or something like this inside Microsoft). You can increase this
3961C<_setmaxstdio>, which can increase this limit to C<2048> (another 4739by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3962arbitrary limit), but is broken in many versions of the Microsoft runtime 4740(another arbitrary limit), but is broken in many versions of the Microsoft
3963libraries.
3964
3965This might get you to about C<512> or C<2048> sockets (depending on 4741runtime libraries. This might get you to about C<512> or C<2048> sockets
3966windows version and/or the phase of the moon). To get more, you need to 4742(depending on windows version and/or the phase of the moon). To get more,
3967wrap all I/O functions and provide your own fd management, but the cost of 4743you need to wrap all I/O functions and provide your own fd management, but
3968calling select (O(n²)) will likely make this unworkable. 4744the cost of calling select (O(n²)) will likely make this unworkable.
3969
3970=back
3971 4745
3972=head2 PORTABILITY REQUIREMENTS 4746=head2 PORTABILITY REQUIREMENTS
3973 4747
3974In addition to a working ISO-C implementation and of course the 4748In addition to a working ISO-C implementation and of course the
3975backend-specific APIs, libev relies on a few additional extensions: 4749backend-specific APIs, libev relies on a few additional extensions:
4014watchers. 4788watchers.
4015 4789
4016=item C<double> must hold a time value in seconds with enough accuracy 4790=item C<double> must hold a time value in seconds with enough accuracy
4017 4791
4018The type C<double> is used to represent timestamps. It is required to 4792The type C<double> is used to represent timestamps. It is required to
4019have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4793have at least 51 bits of mantissa (and 9 bits of exponent), which is
4020enough for at least into the year 4000. This requirement is fulfilled by 4794good enough for at least into the year 4000 with millisecond accuracy
4795(the design goal for libev). This requirement is overfulfilled by
4021implementations implementing IEEE 754 (basically all existing ones). 4796implementations using IEEE 754, which is basically all existing ones. With
4797IEEE 754 doubles, you get microsecond accuracy until at least 2200.
4022 4798
4023=back 4799=back
4024 4800
4025If you know of other additional requirements drop me a note. 4801If you know of other additional requirements drop me a note.
4026 4802
4094involves iterating over all running async watchers or all signal numbers. 4870involves iterating over all running async watchers or all signal numbers.
4095 4871
4096=back 4872=back
4097 4873
4098 4874
4875=head1 PORTING FROM LIBEV 3.X TO 4.X
4876
4877The major version 4 introduced some minor incompatible changes to the API.
4878
4879At the moment, the C<ev.h> header file tries to implement superficial
4880compatibility, so most programs should still compile. Those might be
4881removed in later versions of libev, so better update early than late.
4882
4883=over 4
4884
4885=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4886
4887These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4888
4889 ev_loop_destroy (EV_DEFAULT_UC);
4890 ev_loop_fork (EV_DEFAULT);
4891
4892=item function/symbol renames
4893
4894A number of functions and symbols have been renamed:
4895
4896 ev_loop => ev_run
4897 EVLOOP_NONBLOCK => EVRUN_NOWAIT
4898 EVLOOP_ONESHOT => EVRUN_ONCE
4899
4900 ev_unloop => ev_break
4901 EVUNLOOP_CANCEL => EVBREAK_CANCEL
4902 EVUNLOOP_ONE => EVBREAK_ONE
4903 EVUNLOOP_ALL => EVBREAK_ALL
4904
4905 EV_TIMEOUT => EV_TIMER
4906
4907 ev_loop_count => ev_iteration
4908 ev_loop_depth => ev_depth
4909 ev_loop_verify => ev_verify
4910
4911Most functions working on C<struct ev_loop> objects don't have an
4912C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
4913associated constants have been renamed to not collide with the C<struct
4914ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4915as all other watcher types. Note that C<ev_loop_fork> is still called
4916C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4917typedef.
4918
4919=item C<EV_COMPAT3> backwards compatibility mechanism
4920
4921The backward compatibility mechanism can be controlled by
4922C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4923section.
4924
4925=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4926
4927The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4928mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4929and work, but the library code will of course be larger.
4930
4931=back
4932
4933
4099=head1 GLOSSARY 4934=head1 GLOSSARY
4100 4935
4101=over 4 4936=over 4
4102 4937
4103=item active 4938=item active
4104 4939
4105A watcher is active as long as it has been started (has been attached to 4940A watcher is active as long as it has been started and not yet stopped.
4106an event loop) but not yet stopped (disassociated from the event loop). 4941See L<WATCHER STATES> for details.
4107 4942
4108=item application 4943=item application
4109 4944
4110In this document, an application is whatever is using libev. 4945In this document, an application is whatever is using libev.
4946
4947=item backend
4948
4949The part of the code dealing with the operating system interfaces.
4111 4950
4112=item callback 4951=item callback
4113 4952
4114The address of a function that is called when some event has been 4953The address of a function that is called when some event has been
4115detected. Callbacks are being passed the event loop, the watcher that 4954detected. Callbacks are being passed the event loop, the watcher that
4116received the event, and the actual event bitset. 4955received the event, and the actual event bitset.
4117 4956
4118=item callback invocation 4957=item callback/watcher invocation
4119 4958
4120The act of calling the callback associated with a watcher. 4959The act of calling the callback associated with a watcher.
4121 4960
4122=item event 4961=item event
4123 4962
4124A change of state of some external event, such as data now being available 4963A change of state of some external event, such as data now being available
4125for reading on a file descriptor, time having passed or simply not having 4964for reading on a file descriptor, time having passed or simply not having
4126any other events happening anymore. 4965any other events happening anymore.
4127 4966
4128In libev, events are represented as single bits (such as C<EV_READ> or 4967In libev, events are represented as single bits (such as C<EV_READ> or
4129C<EV_TIMEOUT>). 4968C<EV_TIMER>).
4130 4969
4131=item event library 4970=item event library
4132 4971
4133A software package implementing an event model and loop. 4972A software package implementing an event model and loop.
4134 4973
4142The model used to describe how an event loop handles and processes 4981The model used to describe how an event loop handles and processes
4143watchers and events. 4982watchers and events.
4144 4983
4145=item pending 4984=item pending
4146 4985
4147A watcher is pending as soon as the corresponding event has been detected, 4986A watcher is pending as soon as the corresponding event has been
4148and stops being pending as soon as the watcher will be invoked or its 4987detected. See L<WATCHER STATES> for details.
4149pending status is explicitly cleared by the application.
4150
4151A watcher can be pending, but not active. Stopping a watcher also clears
4152its pending status.
4153 4988
4154=item real time 4989=item real time
4155 4990
4156The physical time that is observed. It is apparently strictly monotonic :) 4991The physical time that is observed. It is apparently strictly monotonic :)
4157 4992
4164=item watcher 4999=item watcher
4165 5000
4166A data structure that describes interest in certain events. Watchers need 5001A data structure that describes interest in certain events. Watchers need
4167to be started (attached to an event loop) before they can receive events. 5002to be started (attached to an event loop) before they can receive events.
4168 5003
4169=item watcher invocation
4170
4171The act of calling the callback associated with a watcher.
4172
4173=back 5004=back
4174 5005
4175=head1 AUTHOR 5006=head1 AUTHOR
4176 5007
4177Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 5008Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines