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

Comparing libev/ev.pod (file contents):
Revision 1.231 by root, Wed Apr 15 19:35:53 2009 UTC vs.
Revision 1.323 by root, Sun Oct 24 18:01:26 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
980programs, though, as the fd could already be closed and reused for another 1142programs, though, as the fd could already be closed and reused for another
981thing, so beware. 1143thing, so beware.
982 1144
983=back 1145=back
984 1146
1147=head2 WATCHER STATES
1148
1149There are various watcher states mentioned throughout this manual -
1150active, pending and so on. In this section these states and the rules to
1151transition between them will be described in more detail - and while these
1152rules might look complicated, they usually do "the right thing".
1153
1154=over 4
1155
1156=item initialiased
1157
1158Before a watcher can be registered with the event looop it has to be
1159initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1160C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1161
1162In this state it is simply some block of memory that is suitable for use
1163in an event loop. It can be moved around, freed, reused etc. at will.
1164
1165=item started/running/active
1166
1167Once a watcher has been started with a call to C<ev_TYPE_start> it becomes
1168property of the event loop, and is actively waiting for events. While in
1169this state it cannot be accessed (except in a few documented ways), moved,
1170freed or anything else - the only legal thing is to keep a pointer to it,
1171and call libev functions on it that are documented to work on active watchers.
1172
1173=item pending
1174
1175If a watcher is active and libev determines that an event it is interested
1176in has occurred (such as a timer expiring), it will become pending. It will
1177stay in this pending state until either it is stopped or its callback is
1178about to be invoked, so it is not normally pending inside the watcher
1179callback.
1180
1181The watcher might or might not be active while it is pending (for example,
1182an expired non-repeating timer can be pending but no longer active). If it
1183is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>),
1184but it is still property of the event loop at this time, so cannot be
1185moved, freed or reused. And if it is active the rules described in the
1186previous item still apply.
1187
1188It is also possible to feed an event on a watcher that is not active (e.g.
1189via C<ev_feed_event>), in which case it becomes pending without being
1190active.
1191
1192=item stopped
1193
1194A watcher can be stopped implicitly by libev (in which case it might still
1195be pending), or explicitly by calling its C<ev_TYPE_stop> function. The
1196latter will clear any pending state the watcher might be in, regardless
1197of whether it was active or not, so stopping a watcher explicitly before
1198freeing it is often a good idea.
1199
1200While stopped (and not pending) the watcher is essentially in the
1201initialised state, that is it can be reused, moved, modified in any way
1202you wish.
1203
1204=back
1205
985=head2 GENERIC WATCHER FUNCTIONS 1206=head2 GENERIC WATCHER FUNCTIONS
986 1207
987=over 4 1208=over 4
988 1209
989=item C<ev_init> (ev_TYPE *watcher, callback) 1210=item C<ev_init> (ev_TYPE *watcher, callback)
1005 1226
1006 ev_io w; 1227 ev_io w;
1007 ev_init (&w, my_cb); 1228 ev_init (&w, my_cb);
1008 ev_io_set (&w, STDIN_FILENO, EV_READ); 1229 ev_io_set (&w, STDIN_FILENO, EV_READ);
1009 1230
1010=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1231=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1011 1232
1012This macro initialises the type-specific parts of a watcher. You need to 1233This 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 1234call 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 1235call 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 1236macro on a watcher that is active (it can be pending, however, which is a
1028 1249
1029Example: Initialise and set an C<ev_io> watcher in one step. 1250Example: Initialise and set an C<ev_io> watcher in one step.
1030 1251
1031 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1252 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1032 1253
1033=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1254=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1034 1255
1035Starts (activates) the given watcher. Only active watchers will receive 1256Starts (activates) the given watcher. Only active watchers will receive
1036events. If the watcher is already active nothing will happen. 1257events. If the watcher is already active nothing will happen.
1037 1258
1038Example: Start the C<ev_io> watcher that is being abused as example in this 1259Example: Start the C<ev_io> watcher that is being abused as example in this
1039whole section. 1260whole section.
1040 1261
1041 ev_io_start (EV_DEFAULT_UC, &w); 1262 ev_io_start (EV_DEFAULT_UC, &w);
1042 1263
1043=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1264=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1044 1265
1045Stops the given watcher if active, and clears the pending status (whether 1266Stops the given watcher if active, and clears the pending status (whether
1046the watcher was active or not). 1267the watcher was active or not).
1047 1268
1048It is possible that stopped watchers are pending - for example, 1269It is possible that stopped watchers are pending - for example,
1073=item ev_cb_set (ev_TYPE *watcher, callback) 1294=item ev_cb_set (ev_TYPE *watcher, callback)
1074 1295
1075Change the callback. You can change the callback at virtually any time 1296Change the callback. You can change the callback at virtually any time
1076(modulo threads). 1297(modulo threads).
1077 1298
1078=item ev_set_priority (ev_TYPE *watcher, priority) 1299=item ev_set_priority (ev_TYPE *watcher, int priority)
1079 1300
1080=item int ev_priority (ev_TYPE *watcher) 1301=item int ev_priority (ev_TYPE *watcher)
1081 1302
1082Set and query the priority of the watcher. The priority is a small 1303Set and query the priority of the watcher. The priority is a small
1083integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1304integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1084(default: C<-2>). Pending watchers with higher priority will be invoked 1305(default: C<-2>). Pending watchers with higher priority will be invoked
1085before watchers with lower priority, but priority will not keep watchers 1306before watchers with lower priority, but priority will not keep watchers
1086from being executed (except for C<ev_idle> watchers). 1307from being executed (except for C<ev_idle> watchers).
1087 1308
1088This means that priorities are I<only> used for ordering callback
1089invocation after new events have been received. This is useful, for
1090example, to reduce latency after idling, or more often, to bind two
1091watchers on the same event and make sure one is called first.
1092
1093If you need to suppress invocation when higher priority events are pending 1309If you need to suppress invocation when higher priority events are pending
1094you need to look at C<ev_idle> watchers, which provide this functionality. 1310you need to look at C<ev_idle> watchers, which provide this functionality.
1095 1311
1096You I<must not> change the priority of a watcher as long as it is active or 1312You I<must not> change the priority of a watcher as long as it is active or
1097pending. 1313pending.
1098
1099The default priority used by watchers when no priority has been set is
1100always C<0>, which is supposed to not be too high and not be too low :).
1101 1314
1102Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is 1315Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1103fine, as long as you do not mind that the priority value you query might 1316fine, as long as you do not mind that the priority value you query might
1104or might not have been clamped to the valid range. 1317or might not have been clamped to the valid range.
1318
1319The default priority used by watchers when no priority has been set is
1320always C<0>, which is supposed to not be too high and not be too low :).
1321
1322See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1323priorities.
1105 1324
1106=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1325=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1107 1326
1108Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1327Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1109C<loop> nor C<revents> need to be valid as long as the watcher callback 1328C<loop> nor C<revents> need to be valid as long as the watcher callback
1116returns its C<revents> bitset (as if its callback was invoked). If the 1335returns its C<revents> bitset (as if its callback was invoked). If the
1117watcher isn't pending it does nothing and returns C<0>. 1336watcher isn't pending it does nothing and returns C<0>.
1118 1337
1119Sometimes it can be useful to "poll" a watcher instead of waiting for its 1338Sometimes it can be useful to "poll" a watcher instead of waiting for its
1120callback to be invoked, which can be accomplished with this function. 1339callback to be invoked, which can be accomplished with this function.
1340
1341=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1342
1343Feeds the given event set into the event loop, as if the specified event
1344had happened for the specified watcher (which must be a pointer to an
1345initialised but not necessarily started event watcher). Obviously you must
1346not free the watcher as long as it has pending events.
1347
1348Stopping the watcher, letting libev invoke it, or calling
1349C<ev_clear_pending> will clear the pending event, even if the watcher was
1350not started in the first place.
1351
1352See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1353functions that do not need a watcher.
1121 1354
1122=back 1355=back
1123 1356
1124 1357
1125=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1358=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1174 #include <stddef.h> 1407 #include <stddef.h>
1175 1408
1176 static void 1409 static void
1177 t1_cb (EV_P_ ev_timer *w, int revents) 1410 t1_cb (EV_P_ ev_timer *w, int revents)
1178 { 1411 {
1179 struct my_biggy big = (struct my_biggy * 1412 struct my_biggy big = (struct my_biggy *)
1180 (((char *)w) - offsetof (struct my_biggy, t1)); 1413 (((char *)w) - offsetof (struct my_biggy, t1));
1181 } 1414 }
1182 1415
1183 static void 1416 static void
1184 t2_cb (EV_P_ ev_timer *w, int revents) 1417 t2_cb (EV_P_ ev_timer *w, int revents)
1185 { 1418 {
1186 struct my_biggy big = (struct my_biggy * 1419 struct my_biggy big = (struct my_biggy *)
1187 (((char *)w) - offsetof (struct my_biggy, t2)); 1420 (((char *)w) - offsetof (struct my_biggy, t2));
1188 } 1421 }
1422
1423=head2 WATCHER PRIORITY MODELS
1424
1425Many event loops support I<watcher priorities>, which are usually small
1426integers that influence the ordering of event callback invocation
1427between watchers in some way, all else being equal.
1428
1429In libev, Watcher priorities can be set using C<ev_set_priority>. See its
1430description for the more technical details such as the actual priority
1431range.
1432
1433There are two common ways how these these priorities are being interpreted
1434by event loops:
1435
1436In the more common lock-out model, higher priorities "lock out" invocation
1437of lower priority watchers, which means as long as higher priority
1438watchers receive events, lower priority watchers are not being invoked.
1439
1440The less common only-for-ordering model uses priorities solely to order
1441callback invocation within a single event loop iteration: Higher priority
1442watchers are invoked before lower priority ones, but they all get invoked
1443before polling for new events.
1444
1445Libev uses the second (only-for-ordering) model for all its watchers
1446except for idle watchers (which use the lock-out model).
1447
1448The rationale behind this is that implementing the lock-out model for
1449watchers is not well supported by most kernel interfaces, and most event
1450libraries will just poll for the same events again and again as long as
1451their callbacks have not been executed, which is very inefficient in the
1452common case of one high-priority watcher locking out a mass of lower
1453priority ones.
1454
1455Static (ordering) priorities are most useful when you have two or more
1456watchers handling the same resource: a typical usage example is having an
1457C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle
1458timeouts. Under load, data might be received while the program handles
1459other jobs, but since timers normally get invoked first, the timeout
1460handler will be executed before checking for data. In that case, giving
1461the timer a lower priority than the I/O watcher ensures that I/O will be
1462handled first even under adverse conditions (which is usually, but not
1463always, what you want).
1464
1465Since idle watchers use the "lock-out" model, meaning that idle watchers
1466will only be executed when no same or higher priority watchers have
1467received events, they can be used to implement the "lock-out" model when
1468required.
1469
1470For example, to emulate how many other event libraries handle priorities,
1471you can associate an C<ev_idle> watcher to each such watcher, and in
1472the normal watcher callback, you just start the idle watcher. The real
1473processing is done in the idle watcher callback. This causes libev to
1474continuously poll and process kernel event data for the watcher, but when
1475the lock-out case is known to be rare (which in turn is rare :), this is
1476workable.
1477
1478Usually, however, the lock-out model implemented that way will perform
1479miserably under the type of load it was designed to handle. In that case,
1480it might be preferable to stop the real watcher before starting the
1481idle watcher, so the kernel will not have to process the event in case
1482the actual processing will be delayed for considerable time.
1483
1484Here is an example of an I/O watcher that should run at a strictly lower
1485priority than the default, and which should only process data when no
1486other events are pending:
1487
1488 ev_idle idle; // actual processing watcher
1489 ev_io io; // actual event watcher
1490
1491 static void
1492 io_cb (EV_P_ ev_io *w, int revents)
1493 {
1494 // stop the I/O watcher, we received the event, but
1495 // are not yet ready to handle it.
1496 ev_io_stop (EV_A_ w);
1497
1498 // start the idle watcher to handle the actual event.
1499 // it will not be executed as long as other watchers
1500 // with the default priority are receiving events.
1501 ev_idle_start (EV_A_ &idle);
1502 }
1503
1504 static void
1505 idle_cb (EV_P_ ev_idle *w, int revents)
1506 {
1507 // actual processing
1508 read (STDIN_FILENO, ...);
1509
1510 // have to start the I/O watcher again, as
1511 // we have handled the event
1512 ev_io_start (EV_P_ &io);
1513 }
1514
1515 // initialisation
1516 ev_idle_init (&idle, idle_cb);
1517 ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ);
1518 ev_io_start (EV_DEFAULT_ &io);
1519
1520In the "real" world, it might also be beneficial to start a timer, so that
1521low-priority connections can not be locked out forever under load. This
1522enables your program to keep a lower latency for important connections
1523during short periods of high load, while not completely locking out less
1524important ones.
1189 1525
1190 1526
1191=head1 WATCHER TYPES 1527=head1 WATCHER TYPES
1192 1528
1193This section describes each watcher in detail, but will not repeat 1529This section describes each watcher in detail, but will not repeat
1219descriptors to non-blocking mode is also usually a good idea (but not 1555descriptors to non-blocking mode is also usually a good idea (but not
1220required if you know what you are doing). 1556required if you know what you are doing).
1221 1557
1222If you cannot use non-blocking mode, then force the use of a 1558If you cannot use non-blocking mode, then force the use of a
1223known-to-be-good backend (at the time of this writing, this includes only 1559known-to-be-good backend (at the time of this writing, this includes only
1224C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1560C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1561descriptors for which non-blocking operation makes no sense (such as
1562files) - libev doesn't guarantee any specific behaviour in that case.
1225 1563
1226Another thing you have to watch out for is that it is quite easy to 1564Another thing you have to watch out for is that it is quite easy to
1227receive "spurious" readiness notifications, that is your callback might 1565receive "spurious" readiness notifications, that is your callback might
1228be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1566be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1229because there is no data. Not only are some backends known to create a 1567because there is no data. Not only are some backends known to create a
1294 1632
1295So when you encounter spurious, unexplained daemon exits, make sure you 1633So when you encounter spurious, unexplained daemon exits, make sure you
1296ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1634ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1297somewhere, as that would have given you a big clue). 1635somewhere, as that would have given you a big clue).
1298 1636
1637=head3 The special problem of accept()ing when you can't
1638
1639Many implementations of the POSIX C<accept> function (for example,
1640found in post-2004 Linux) have the peculiar behaviour of not removing a
1641connection from the pending queue in all error cases.
1642
1643For example, larger servers often run out of file descriptors (because
1644of resource limits), causing C<accept> to fail with C<ENFILE> but not
1645rejecting the connection, leading to libev signalling readiness on
1646the next iteration again (the connection still exists after all), and
1647typically causing the program to loop at 100% CPU usage.
1648
1649Unfortunately, the set of errors that cause this issue differs between
1650operating systems, there is usually little the app can do to remedy the
1651situation, and no known thread-safe method of removing the connection to
1652cope with overload is known (to me).
1653
1654One of the easiest ways to handle this situation is to just ignore it
1655- when the program encounters an overload, it will just loop until the
1656situation is over. While this is a form of busy waiting, no OS offers an
1657event-based way to handle this situation, so it's the best one can do.
1658
1659A better way to handle the situation is to log any errors other than
1660C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such
1661messages, and continue as usual, which at least gives the user an idea of
1662what could be wrong ("raise the ulimit!"). For extra points one could stop
1663the C<ev_io> watcher on the listening fd "for a while", which reduces CPU
1664usage.
1665
1666If your program is single-threaded, then you could also keep a dummy file
1667descriptor for overload situations (e.g. by opening F</dev/null>), and
1668when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>,
1669close that fd, and create a new dummy fd. This will gracefully refuse
1670clients under typical overload conditions.
1671
1672The last way to handle it is to simply log the error and C<exit>, as
1673is often done with C<malloc> failures, but this results in an easy
1674opportunity for a DoS attack.
1299 1675
1300=head3 Watcher-Specific Functions 1676=head3 Watcher-Specific Functions
1301 1677
1302=over 4 1678=over 4
1303 1679
1335 ... 1711 ...
1336 struct ev_loop *loop = ev_default_init (0); 1712 struct ev_loop *loop = ev_default_init (0);
1337 ev_io stdin_readable; 1713 ev_io stdin_readable;
1338 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1714 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1339 ev_io_start (loop, &stdin_readable); 1715 ev_io_start (loop, &stdin_readable);
1340 ev_loop (loop, 0); 1716 ev_run (loop, 0);
1341 1717
1342 1718
1343=head2 C<ev_timer> - relative and optionally repeating timeouts 1719=head2 C<ev_timer> - relative and optionally repeating timeouts
1344 1720
1345Timer watchers are simple relative timers that generate an event after a 1721Timer watchers are simple relative timers that generate an event after a
1350year, it will still time out after (roughly) one hour. "Roughly" because 1726year, it will still time out after (roughly) one hour. "Roughly" because
1351detecting time jumps is hard, and some inaccuracies are unavoidable (the 1727detecting time jumps is hard, and some inaccuracies are unavoidable (the
1352monotonic clock option helps a lot here). 1728monotonic clock option helps a lot here).
1353 1729
1354The callback is guaranteed to be invoked only I<after> its timeout has 1730The callback is guaranteed to be invoked only I<after> its timeout has
1355passed. If multiple timers become ready during the same loop iteration 1731passed (not I<at>, so on systems with very low-resolution clocks this
1356then the ones with earlier time-out values are invoked before ones with 1732might introduce a small delay). If multiple timers become ready during the
1357later time-out values (but this is no longer true when a callback calls 1733same loop iteration then the ones with earlier time-out values are invoked
1358C<ev_loop> recursively). 1734before ones of the same priority with later time-out values (but this is
1735no longer true when a callback calls C<ev_run> recursively).
1359 1736
1360=head3 Be smart about timeouts 1737=head3 Be smart about timeouts
1361 1738
1362Many real-world problems involve some kind of timeout, usually for error 1739Many real-world problems involve some kind of timeout, usually for error
1363recovery. A typical example is an HTTP request - if the other side hangs, 1740recovery. A typical example is an HTTP request - if the other side hangs,
1407C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> 1784C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1408member and C<ev_timer_again>. 1785member and C<ev_timer_again>.
1409 1786
1410At start: 1787At start:
1411 1788
1412 ev_timer_init (timer, callback); 1789 ev_init (timer, callback);
1413 timer->repeat = 60.; 1790 timer->repeat = 60.;
1414 ev_timer_again (loop, timer); 1791 ev_timer_again (loop, timer);
1415 1792
1416Each time there is some activity: 1793Each time there is some activity:
1417 1794
1449 ev_tstamp timeout = last_activity + 60.; 1826 ev_tstamp timeout = last_activity + 60.;
1450 1827
1451 // if last_activity + 60. is older than now, we did time out 1828 // if last_activity + 60. is older than now, we did time out
1452 if (timeout < now) 1829 if (timeout < now)
1453 { 1830 {
1454 // timeout occured, take action 1831 // timeout occurred, take action
1455 } 1832 }
1456 else 1833 else
1457 { 1834 {
1458 // callback was invoked, but there was some activity, re-arm 1835 // callback was invoked, but there was some activity, re-arm
1459 // the watcher to fire in last_activity + 60, which is 1836 // the watcher to fire in last_activity + 60, which is
1479 1856
1480To start the timer, simply initialise the watcher and set C<last_activity> 1857To start the timer, simply initialise the watcher and set C<last_activity>
1481to the current time (meaning we just have some activity :), then call the 1858to the current time (meaning we just have some activity :), then call the
1482callback, which will "do the right thing" and start the timer: 1859callback, which will "do the right thing" and start the timer:
1483 1860
1484 ev_timer_init (timer, callback); 1861 ev_init (timer, callback);
1485 last_activity = ev_now (loop); 1862 last_activity = ev_now (loop);
1486 callback (loop, timer, EV_TIMEOUT); 1863 callback (loop, timer, EV_TIMER);
1487 1864
1488And when there is some activity, simply store the current time in 1865And when there is some activity, simply store the current time in
1489C<last_activity>, no libev calls at all: 1866C<last_activity>, no libev calls at all:
1490 1867
1491 last_actiivty = ev_now (loop); 1868 last_activity = ev_now (loop);
1492 1869
1493This technique is slightly more complex, but in most cases where the 1870This technique is slightly more complex, but in most cases where the
1494time-out is unlikely to be triggered, much more efficient. 1871time-out is unlikely to be triggered, much more efficient.
1495 1872
1496Changing the timeout is trivial as well (if it isn't hard-coded in the 1873Changing the timeout is trivial as well (if it isn't hard-coded in the
1534 1911
1535=head3 The special problem of time updates 1912=head3 The special problem of time updates
1536 1913
1537Establishing the current time is a costly operation (it usually takes at 1914Establishing the current time is a costly operation (it usually takes at
1538least two system calls): EV therefore updates its idea of the current 1915least two system calls): EV therefore updates its idea of the current
1539time only before and after C<ev_loop> collects new events, which causes a 1916time only before and after C<ev_run> collects new events, which causes a
1540growing difference between C<ev_now ()> and C<ev_time ()> when handling 1917growing difference between C<ev_now ()> and C<ev_time ()> when handling
1541lots of events in one iteration. 1918lots of events in one iteration.
1542 1919
1543The relative timeouts are calculated relative to the C<ev_now ()> 1920The relative timeouts are calculated relative to the C<ev_now ()>
1544time. This is usually the right thing as this timestamp refers to the time 1921time. This is usually the right thing as this timestamp refers to the time
1550 1927
1551If the event loop is suspended for a long time, you can also force an 1928If the event loop is suspended for a long time, you can also force an
1552update of the time returned by C<ev_now ()> by calling C<ev_now_update 1929update of the time returned by C<ev_now ()> by calling C<ev_now_update
1553()>. 1930()>.
1554 1931
1932=head3 The special problems of suspended animation
1933
1934When you leave the server world it is quite customary to hit machines that
1935can suspend/hibernate - what happens to the clocks during such a suspend?
1936
1937Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1938all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1939to run until the system is suspended, but they will not advance while the
1940system is suspended. That means, on resume, it will be as if the program
1941was frozen for a few seconds, but the suspend time will not be counted
1942towards C<ev_timer> when a monotonic clock source is used. The real time
1943clock advanced as expected, but if it is used as sole clocksource, then a
1944long suspend would be detected as a time jump by libev, and timers would
1945be adjusted accordingly.
1946
1947I would not be surprised to see different behaviour in different between
1948operating systems, OS versions or even different hardware.
1949
1950The other form of suspend (job control, or sending a SIGSTOP) will see a
1951time jump in the monotonic clocks and the realtime clock. If the program
1952is suspended for a very long time, and monotonic clock sources are in use,
1953then you can expect C<ev_timer>s to expire as the full suspension time
1954will be counted towards the timers. When no monotonic clock source is in
1955use, then libev will again assume a timejump and adjust accordingly.
1956
1957It might be beneficial for this latter case to call C<ev_suspend>
1958and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1959deterministic behaviour in this case (you can do nothing against
1960C<SIGSTOP>).
1961
1555=head3 Watcher-Specific Functions and Data Members 1962=head3 Watcher-Specific Functions and Data Members
1556 1963
1557=over 4 1964=over 4
1558 1965
1559=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1966=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1582If the timer is started but non-repeating, stop it (as if it timed out). 1989If the timer is started but non-repeating, stop it (as if it timed out).
1583 1990
1584If the timer is repeating, either start it if necessary (with the 1991If the timer is repeating, either start it if necessary (with the
1585C<repeat> value), or reset the running timer to the C<repeat> value. 1992C<repeat> value), or reset the running timer to the C<repeat> value.
1586 1993
1587This sounds a bit complicated, see "Be smart about timeouts", above, for a 1994This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1588usage example. 1995usage example.
1996
1997=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1998
1999Returns the remaining time until a timer fires. If the timer is active,
2000then this time is relative to the current event loop time, otherwise it's
2001the timeout value currently configured.
2002
2003That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
2004C<5>. When the timer is started and one second passes, C<ev_timer_remaining>
2005will return C<4>. When the timer expires and is restarted, it will return
2006roughly C<7> (likely slightly less as callback invocation takes some time,
2007too), and so on.
1589 2008
1590=item ev_tstamp repeat [read-write] 2009=item ev_tstamp repeat [read-write]
1591 2010
1592The current C<repeat> value. Will be used each time the watcher times out 2011The current C<repeat> value. Will be used each time the watcher times out
1593or C<ev_timer_again> is called, and determines the next timeout (if any), 2012or C<ev_timer_again> is called, and determines the next timeout (if any),
1619 } 2038 }
1620 2039
1621 ev_timer mytimer; 2040 ev_timer mytimer;
1622 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 2041 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1623 ev_timer_again (&mytimer); /* start timer */ 2042 ev_timer_again (&mytimer); /* start timer */
1624 ev_loop (loop, 0); 2043 ev_run (loop, 0);
1625 2044
1626 // and in some piece of code that gets executed on any "activity": 2045 // and in some piece of code that gets executed on any "activity":
1627 // reset the timeout to start ticking again at 10 seconds 2046 // reset the timeout to start ticking again at 10 seconds
1628 ev_timer_again (&mytimer); 2047 ev_timer_again (&mytimer);
1629 2048
1655 2074
1656As with timers, the callback is guaranteed to be invoked only when the 2075As with timers, the callback is guaranteed to be invoked only when the
1657point in time where it is supposed to trigger has passed. If multiple 2076point in time where it is supposed to trigger has passed. If multiple
1658timers become ready during the same loop iteration then the ones with 2077timers become ready during the same loop iteration then the ones with
1659earlier time-out values are invoked before ones with later time-out values 2078earlier time-out values are invoked before ones with later time-out values
1660(but this is no longer true when a callback calls C<ev_loop> recursively). 2079(but this is no longer true when a callback calls C<ev_run> recursively).
1661 2080
1662=head3 Watcher-Specific Functions and Data Members 2081=head3 Watcher-Specific Functions and Data Members
1663 2082
1664=over 4 2083=over 4
1665 2084
1793Example: Call a callback every hour, or, more precisely, whenever the 2212Example: Call a callback every hour, or, more precisely, whenever the
1794system time is divisible by 3600. The callback invocation times have 2213system time is divisible by 3600. The callback invocation times have
1795potentially a lot of jitter, but good long-term stability. 2214potentially a lot of jitter, but good long-term stability.
1796 2215
1797 static void 2216 static void
1798 clock_cb (struct ev_loop *loop, ev_io *w, int revents) 2217 clock_cb (struct ev_loop *loop, ev_periodic *w, int revents)
1799 { 2218 {
1800 ... its now a full hour (UTC, or TAI or whatever your clock follows) 2219 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1801 } 2220 }
1802 2221
1803 ev_periodic hourly_tick; 2222 ev_periodic hourly_tick;
1829Signal watchers will trigger an event when the process receives a specific 2248Signal watchers will trigger an event when the process receives a specific
1830signal one or more times. Even though signals are very asynchronous, libev 2249signal one or more times. Even though signals are very asynchronous, libev
1831will try it's best to deliver signals synchronously, i.e. as part of the 2250will try it's best to deliver signals synchronously, i.e. as part of the
1832normal event processing, like any other event. 2251normal event processing, like any other event.
1833 2252
1834If you want signals asynchronously, just use C<sigaction> as you would 2253If you want signals to be delivered truly asynchronously, just use
1835do without libev and forget about sharing the signal. You can even use 2254C<sigaction> as you would do without libev and forget about sharing
1836C<ev_async> from a signal handler to synchronously wake up an event loop. 2255the signal. You can even use C<ev_async> from a signal handler to
2256synchronously wake up an event loop.
1837 2257
1838You can configure as many watchers as you like per signal. Only when the 2258You can configure as many watchers as you like for the same signal, but
2259only within the same loop, i.e. you can watch for C<SIGINT> in your
2260default loop and for C<SIGIO> in another loop, but you cannot watch for
2261C<SIGINT> in both the default loop and another loop at the same time. At
2262the moment, C<SIGCHLD> is permanently tied to the default loop.
2263
1839first watcher gets started will libev actually register a signal handler 2264When the first watcher gets started will libev actually register something
1840with the kernel (thus it coexists with your own signal handlers as long as 2265with the kernel (thus it coexists with your own signal handlers as long as
1841you don't register any with libev for the same signal). Similarly, when 2266you don't register any with libev for the same signal).
1842the last signal watcher for a signal is stopped, libev will reset the
1843signal handler to SIG_DFL (regardless of what it was set to before).
1844 2267
1845If possible and supported, libev will install its handlers with 2268If possible and supported, libev will install its handlers with
1846C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2269C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1847interrupted. If you have a problem with system calls getting interrupted by 2270not be unduly interrupted. If you have a problem with system calls getting
1848signals you can block all signals in an C<ev_check> watcher and unblock 2271interrupted by signals you can block all signals in an C<ev_check> watcher
1849them in an C<ev_prepare> watcher. 2272and unblock them in an C<ev_prepare> watcher.
2273
2274=head3 The special problem of inheritance over fork/execve/pthread_create
2275
2276Both the signal mask (C<sigprocmask>) and the signal disposition
2277(C<sigaction>) are unspecified after starting a signal watcher (and after
2278stopping it again), that is, libev might or might not block the signal,
2279and might or might not set or restore the installed signal handler.
2280
2281While this does not matter for the signal disposition (libev never
2282sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2283C<execve>), this matters for the signal mask: many programs do not expect
2284certain signals to be blocked.
2285
2286This means that before calling C<exec> (from the child) you should reset
2287the signal mask to whatever "default" you expect (all clear is a good
2288choice usually).
2289
2290The simplest way to ensure that the signal mask is reset in the child is
2291to install a fork handler with C<pthread_atfork> that resets it. That will
2292catch fork calls done by libraries (such as the libc) as well.
2293
2294In current versions of libev, the signal will not be blocked indefinitely
2295unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces
2296the window of opportunity for problems, it will not go away, as libev
2297I<has> to modify the signal mask, at least temporarily.
2298
2299So I can't stress this enough: I<If you do not reset your signal mask when
2300you expect it to be empty, you have a race condition in your code>. This
2301is not a libev-specific thing, this is true for most event libraries.
1850 2302
1851=head3 Watcher-Specific Functions and Data Members 2303=head3 Watcher-Specific Functions and Data Members
1852 2304
1853=over 4 2305=over 4
1854 2306
1870Example: Try to exit cleanly on SIGINT. 2322Example: Try to exit cleanly on SIGINT.
1871 2323
1872 static void 2324 static void
1873 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) 2325 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
1874 { 2326 {
1875 ev_unloop (loop, EVUNLOOP_ALL); 2327 ev_break (loop, EVBREAK_ALL);
1876 } 2328 }
1877 2329
1878 ev_signal signal_watcher; 2330 ev_signal signal_watcher;
1879 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 2331 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1880 ev_signal_start (loop, &signal_watcher); 2332 ev_signal_start (loop, &signal_watcher);
1886some child status changes (most typically when a child of yours dies or 2338some child status changes (most typically when a child of yours dies or
1887exits). It is permissible to install a child watcher I<after> the child 2339exits). It is permissible to install a child watcher I<after> the child
1888has been forked (which implies it might have already exited), as long 2340has been forked (which implies it might have already exited), as long
1889as the event loop isn't entered (or is continued from a watcher), i.e., 2341as the event loop isn't entered (or is continued from a watcher), i.e.,
1890forking and then immediately registering a watcher for the child is fine, 2342forking and then immediately registering a watcher for the child is fine,
1891but forking and registering a watcher a few event loop iterations later is 2343but forking and registering a watcher a few event loop iterations later or
1892not. 2344in the next callback invocation is not.
1893 2345
1894Only the default event loop is capable of handling signals, and therefore 2346Only the default event loop is capable of handling signals, and therefore
1895you can only register child watchers in the default event loop. 2347you can only register child watchers in the default event loop.
1896 2348
2349Due to some design glitches inside libev, child watchers will always be
2350handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2351libev)
2352
1897=head3 Process Interaction 2353=head3 Process Interaction
1898 2354
1899Libev grabs C<SIGCHLD> as soon as the default event loop is 2355Libev grabs C<SIGCHLD> as soon as the default event loop is
1900initialised. This is necessary to guarantee proper behaviour even if 2356initialised. This is necessary to guarantee proper behaviour even if the
1901the first child watcher is started after the child exits. The occurrence 2357first child watcher is started after the child exits. The occurrence
1902of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2358of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1903synchronously as part of the event loop processing. Libev always reaps all 2359synchronously as part of the event loop processing. Libev always reaps all
1904children, even ones not watched. 2360children, even ones not watched.
1905 2361
1906=head3 Overriding the Built-In Processing 2362=head3 Overriding the Built-In Processing
1916=head3 Stopping the Child Watcher 2372=head3 Stopping the Child Watcher
1917 2373
1918Currently, the child watcher never gets stopped, even when the 2374Currently, the child watcher never gets stopped, even when the
1919child terminates, so normally one needs to stop the watcher in the 2375child terminates, so normally one needs to stop the watcher in the
1920callback. Future versions of libev might stop the watcher automatically 2376callback. Future versions of libev might stop the watcher automatically
1921when a child exit is detected. 2377when a child exit is detected (calling C<ev_child_stop> twice is not a
2378problem).
1922 2379
1923=head3 Watcher-Specific Functions and Data Members 2380=head3 Watcher-Specific Functions and Data Members
1924 2381
1925=over 4 2382=over 4
1926 2383
2252 // no longer anything immediate to do. 2709 // no longer anything immediate to do.
2253 } 2710 }
2254 2711
2255 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2712 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2256 ev_idle_init (idle_watcher, idle_cb); 2713 ev_idle_init (idle_watcher, idle_cb);
2257 ev_idle_start (loop, idle_cb); 2714 ev_idle_start (loop, idle_watcher);
2258 2715
2259 2716
2260=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2717=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2261 2718
2262Prepare and check watchers are usually (but not always) used in pairs: 2719Prepare and check watchers are usually (but not always) used in pairs:
2263prepare watchers get invoked before the process blocks and check watchers 2720prepare watchers get invoked before the process blocks and check watchers
2264afterwards. 2721afterwards.
2265 2722
2266You I<must not> call C<ev_loop> or similar functions that enter 2723You I<must not> call C<ev_run> or similar functions that enter
2267the current event loop from either C<ev_prepare> or C<ev_check> 2724the current event loop from either C<ev_prepare> or C<ev_check>
2268watchers. Other loops than the current one are fine, however. The 2725watchers. Other loops than the current one are fine, however. The
2269rationale behind this is that you do not need to check for recursion in 2726rationale behind this is that you do not need to check for recursion in
2270those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2727those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
2271C<ev_check> so if you have one watcher of each kind they will always be 2728C<ev_check> so if you have one watcher of each kind they will always be
2355 struct pollfd fds [nfd]; 2812 struct pollfd fds [nfd];
2356 // actual code will need to loop here and realloc etc. 2813 // actual code will need to loop here and realloc etc.
2357 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2814 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2358 2815
2359 /* the callback is illegal, but won't be called as we stop during check */ 2816 /* the callback is illegal, but won't be called as we stop during check */
2360 ev_timer_init (&tw, 0, timeout * 1e-3); 2817 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2361 ev_timer_start (loop, &tw); 2818 ev_timer_start (loop, &tw);
2362 2819
2363 // create one ev_io per pollfd 2820 // create one ev_io per pollfd
2364 for (int i = 0; i < nfd; ++i) 2821 for (int i = 0; i < nfd; ++i)
2365 { 2822 {
2439 2896
2440 if (timeout >= 0) 2897 if (timeout >= 0)
2441 // create/start timer 2898 // create/start timer
2442 2899
2443 // poll 2900 // poll
2444 ev_loop (EV_A_ 0); 2901 ev_run (EV_A_ 0);
2445 2902
2446 // stop timer again 2903 // stop timer again
2447 if (timeout >= 0) 2904 if (timeout >= 0)
2448 ev_timer_stop (EV_A_ &to); 2905 ev_timer_stop (EV_A_ &to);
2449 2906
2527if you do not want that, you need to temporarily stop the embed watcher). 2984if you do not want that, you need to temporarily stop the embed watcher).
2528 2985
2529=item ev_embed_sweep (loop, ev_embed *) 2986=item ev_embed_sweep (loop, ev_embed *)
2530 2987
2531Make a single, non-blocking sweep over the embedded loop. This works 2988Make a single, non-blocking sweep over the embedded loop. This works
2532similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2989similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most
2533appropriate way for embedded loops. 2990appropriate way for embedded loops.
2534 2991
2535=item struct ev_loop *other [read-only] 2992=item struct ev_loop *other [read-only]
2536 2993
2537The embedded event loop. 2994The embedded event loop.
2595event loop blocks next and before C<ev_check> watchers are being called, 3052event loop blocks next and before C<ev_check> watchers are being called,
2596and only in the child after the fork. If whoever good citizen calling 3053and only in the child after the fork. If whoever good citizen calling
2597C<ev_default_fork> cheats and calls it in the wrong process, the fork 3054C<ev_default_fork> cheats and calls it in the wrong process, the fork
2598handlers will be invoked, too, of course. 3055handlers will be invoked, too, of course.
2599 3056
3057=head3 The special problem of life after fork - how is it possible?
3058
3059Most uses of C<fork()> consist of forking, then some simple calls to set
3060up/change the process environment, followed by a call to C<exec()>. This
3061sequence should be handled by libev without any problems.
3062
3063This changes when the application actually wants to do event handling
3064in the child, or both parent in child, in effect "continuing" after the
3065fork.
3066
3067The default mode of operation (for libev, with application help to detect
3068forks) is to duplicate all the state in the child, as would be expected
3069when I<either> the parent I<or> the child process continues.
3070
3071When both processes want to continue using libev, then this is usually the
3072wrong result. In that case, usually one process (typically the parent) is
3073supposed to continue with all watchers in place as before, while the other
3074process typically wants to start fresh, i.e. without any active watchers.
3075
3076The cleanest and most efficient way to achieve that with libev is to
3077simply create a new event loop, which of course will be "empty", and
3078use that for new watchers. This has the advantage of not touching more
3079memory than necessary, and thus avoiding the copy-on-write, and the
3080disadvantage of having to use multiple event loops (which do not support
3081signal watchers).
3082
3083When this is not possible, or you want to use the default loop for
3084other reasons, then in the process that wants to start "fresh", call
3085C<ev_loop_destroy (EV_DEFAULT)> followed by C<ev_default_loop (...)>.
3086Destroying the default loop will "orphan" (not stop) all registered
3087watchers, so you have to be careful not to execute code that modifies
3088those watchers. Note also that in that case, you have to re-register any
3089signal watchers.
3090
2600=head3 Watcher-Specific Functions and Data Members 3091=head3 Watcher-Specific Functions and Data Members
2601 3092
2602=over 4 3093=over 4
2603 3094
2604=item ev_fork_init (ev_signal *, callback) 3095=item ev_fork_init (ev_signal *, callback)
2608believe me. 3099believe me.
2609 3100
2610=back 3101=back
2611 3102
2612 3103
2613=head2 C<ev_async> - how to wake up another event loop 3104=head2 C<ev_async> - how to wake up an event loop
2614 3105
2615In general, you cannot use an C<ev_loop> from multiple threads or other 3106In general, you cannot use an C<ev_run> from multiple threads or other
2616asynchronous sources such as signal handlers (as opposed to multiple event 3107asynchronous sources such as signal handlers (as opposed to multiple event
2617loops - those are of course safe to use in different threads). 3108loops - those are of course safe to use in different threads).
2618 3109
2619Sometimes, however, you need to wake up another event loop you do not 3110Sometimes, however, you need to wake up an event loop you do not control,
2620control, for example because it belongs to another thread. This is what 3111for example because it belongs to another thread. This is what C<ev_async>
2621C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you 3112watchers do: as long as the C<ev_async> watcher is active, you can signal
2622can signal it by calling C<ev_async_send>, which is thread- and signal 3113it by calling C<ev_async_send>, which is thread- and signal safe.
2623safe.
2624 3114
2625This functionality is very similar to C<ev_signal> watchers, as signals, 3115This functionality is very similar to C<ev_signal> watchers, as signals,
2626too, are asynchronous in nature, and signals, too, will be compressed 3116too, are asynchronous in nature, and signals, too, will be compressed
2627(i.e. the number of callback invocations may be less than the number of 3117(i.e. the number of callback invocations may be less than the number of
2628C<ev_async_sent> calls). 3118C<ev_async_sent> calls).
2633=head3 Queueing 3123=head3 Queueing
2634 3124
2635C<ev_async> does not support queueing of data in any way. The reason 3125C<ev_async> does not support queueing of data in any way. The reason
2636is that the author does not know of a simple (or any) algorithm for a 3126is that the author does not know of a simple (or any) algorithm for a
2637multiple-writer-single-reader queue that works in all cases and doesn't 3127multiple-writer-single-reader queue that works in all cases and doesn't
2638need elaborate support such as pthreads. 3128need elaborate support such as pthreads or unportable memory access
3129semantics.
2639 3130
2640That means that if you want to queue data, you have to provide your own 3131That means that if you want to queue data, you have to provide your own
2641queue. But at least I can tell you how to implement locking around your 3132queue. But at least I can tell you how to implement locking around your
2642queue: 3133queue:
2643 3134
2782 3273
2783If C<timeout> is less than 0, then no timeout watcher will be 3274If C<timeout> is less than 0, then no timeout watcher will be
2784started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 3275started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2785repeat = 0) will be started. C<0> is a valid timeout. 3276repeat = 0) will be started. C<0> is a valid timeout.
2786 3277
2787The callback has the type C<void (*cb)(int revents, void *arg)> and gets 3278The callback has the type C<void (*cb)(int revents, void *arg)> and is
2788passed an C<revents> set like normal event callbacks (a combination of 3279passed an C<revents> set like normal event callbacks (a combination of
2789C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 3280C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg>
2790value passed to C<ev_once>. Note that it is possible to receive I<both> 3281value passed to C<ev_once>. Note that it is possible to receive I<both>
2791a timeout and an io event at the same time - you probably should give io 3282a timeout and an io event at the same time - you probably should give io
2792events precedence. 3283events precedence.
2793 3284
2794Example: wait up to ten seconds for data to appear on STDIN_FILENO. 3285Example: wait up to ten seconds for data to appear on STDIN_FILENO.
2795 3286
2796 static void stdin_ready (int revents, void *arg) 3287 static void stdin_ready (int revents, void *arg)
2797 { 3288 {
2798 if (revents & EV_READ) 3289 if (revents & EV_READ)
2799 /* stdin might have data for us, joy! */; 3290 /* stdin might have data for us, joy! */;
2800 else if (revents & EV_TIMEOUT) 3291 else if (revents & EV_TIMER)
2801 /* doh, nothing entered */; 3292 /* doh, nothing entered */;
2802 } 3293 }
2803 3294
2804 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3295 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2805 3296
2806=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2807
2808Feeds the given event set into the event loop, as if the specified event
2809had happened for the specified watcher (which must be a pointer to an
2810initialised but not necessarily started event watcher).
2811
2812=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3297=item ev_feed_fd_event (loop, int fd, int revents)
2813 3298
2814Feed an event on the given fd, as if a file descriptor backend detected 3299Feed an event on the given fd, as if a file descriptor backend detected
2815the given events it. 3300the given events it.
2816 3301
2817=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3302=item ev_feed_signal_event (loop, int signum)
2818 3303
2819Feed an event as if the given signal occurred (C<loop> must be the default 3304Feed an event as if the given signal occurred (C<loop> must be the default
2820loop!). 3305loop!).
2821 3306
2822=back 3307=back
2902 3387
2903=over 4 3388=over 4
2904 3389
2905=item ev::TYPE::TYPE () 3390=item ev::TYPE::TYPE ()
2906 3391
2907=item ev::TYPE::TYPE (struct ev_loop *) 3392=item ev::TYPE::TYPE (loop)
2908 3393
2909=item ev::TYPE::~TYPE 3394=item ev::TYPE::~TYPE
2910 3395
2911The constructor (optionally) takes an event loop to associate the watcher 3396The constructor (optionally) takes an event loop to associate the watcher
2912with. If it is omitted, it will use C<EV_DEFAULT>. 3397with. If it is omitted, it will use C<EV_DEFAULT>.
2945 myclass obj; 3430 myclass obj;
2946 ev::io iow; 3431 ev::io iow;
2947 iow.set <myclass, &myclass::io_cb> (&obj); 3432 iow.set <myclass, &myclass::io_cb> (&obj);
2948 3433
2949=item w->set (object *) 3434=item w->set (object *)
2950
2951This is an B<experimental> feature that might go away in a future version.
2952 3435
2953This is a variation of a method callback - leaving out the method to call 3436This is a variation of a method callback - leaving out the method to call
2954will default the method to C<operator ()>, which makes it possible to use 3437will default the method to C<operator ()>, which makes it possible to use
2955functor objects without having to manually specify the C<operator ()> all 3438functor objects without having to manually specify the C<operator ()> all
2956the time. Incidentally, you can then also leave out the template argument 3439the time. Incidentally, you can then also leave out the template argument
2989Example: Use a plain function as callback. 3472Example: Use a plain function as callback.
2990 3473
2991 static void io_cb (ev::io &w, int revents) { } 3474 static void io_cb (ev::io &w, int revents) { }
2992 iow.set <io_cb> (); 3475 iow.set <io_cb> ();
2993 3476
2994=item w->set (struct ev_loop *) 3477=item w->set (loop)
2995 3478
2996Associates a different C<struct ev_loop> with this watcher. You can only 3479Associates a different C<struct ev_loop> with this watcher. You can only
2997do this when the watcher is inactive (and not pending either). 3480do this when the watcher is inactive (and not pending either).
2998 3481
2999=item w->set ([arguments]) 3482=item w->set ([arguments])
3000 3483
3001Basically the same as C<ev_TYPE_set>, with the same arguments. Must be 3484Basically the same as C<ev_TYPE_set>, with the same arguments. Either this
3002called at least once. Unlike the C counterpart, an active watcher gets 3485method or a suitable start method must be called at least once. Unlike the
3003automatically stopped and restarted when reconfiguring it with this 3486C counterpart, an active watcher gets automatically stopped and restarted
3004method. 3487when reconfiguring it with this method.
3005 3488
3006=item w->start () 3489=item w->start ()
3007 3490
3008Starts the watcher. Note that there is no C<loop> argument, as the 3491Starts the watcher. Note that there is no C<loop> argument, as the
3009constructor already stores the event loop. 3492constructor already stores the event loop.
3010 3493
3494=item w->start ([arguments])
3495
3496Instead of calling C<set> and C<start> methods separately, it is often
3497convenient to wrap them in one call. Uses the same type of arguments as
3498the configure C<set> method of the watcher.
3499
3011=item w->stop () 3500=item w->stop ()
3012 3501
3013Stops the watcher if it is active. Again, no C<loop> argument. 3502Stops the watcher if it is active. Again, no C<loop> argument.
3014 3503
3015=item w->again () (C<ev::timer>, C<ev::periodic> only) 3504=item w->again () (C<ev::timer>, C<ev::periodic> only)
3027 3516
3028=back 3517=back
3029 3518
3030=back 3519=back
3031 3520
3032Example: Define a class with an IO and idle watcher, start one of them in 3521Example: Define a class with two I/O and idle watchers, start the I/O
3033the constructor. 3522watchers in the constructor.
3034 3523
3035 class myclass 3524 class myclass
3036 { 3525 {
3037 ev::io io ; void io_cb (ev::io &w, int revents); 3526 ev::io io ; void io_cb (ev::io &w, int revents);
3527 ev::io2 io2 ; void io2_cb (ev::io &w, int revents);
3038 ev::idle idle; void idle_cb (ev::idle &w, int revents); 3528 ev::idle idle; void idle_cb (ev::idle &w, int revents);
3039 3529
3040 myclass (int fd) 3530 myclass (int fd)
3041 { 3531 {
3042 io .set <myclass, &myclass::io_cb > (this); 3532 io .set <myclass, &myclass::io_cb > (this);
3533 io2 .set <myclass, &myclass::io2_cb > (this);
3043 idle.set <myclass, &myclass::idle_cb> (this); 3534 idle.set <myclass, &myclass::idle_cb> (this);
3044 3535
3045 io.start (fd, ev::READ); 3536 io.set (fd, ev::WRITE); // configure the watcher
3537 io.start (); // start it whenever convenient
3538
3539 io2.start (fd, ev::READ); // set + start in one call
3046 } 3540 }
3047 }; 3541 };
3048 3542
3049 3543
3050=head1 OTHER LANGUAGE BINDINGS 3544=head1 OTHER LANGUAGE BINDINGS
3096=item Ocaml 3590=item Ocaml
3097 3591
3098Erkki Seppala has written Ocaml bindings for libev, to be found at 3592Erkki Seppala has written Ocaml bindings for libev, to be found at
3099L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3593L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3100 3594
3595=item Lua
3596
3597Brian Maher has written a partial interface to libev for lua (at the
3598time of this writing, only C<ev_io> and C<ev_timer>), to be found at
3599L<http://github.com/brimworks/lua-ev>.
3600
3101=back 3601=back
3102 3602
3103 3603
3104=head1 MACRO MAGIC 3604=head1 MACRO MAGIC
3105 3605
3118loop argument"). The C<EV_A> form is used when this is the sole argument, 3618loop argument"). The C<EV_A> form is used when this is the sole argument,
3119C<EV_A_> is used when other arguments are following. Example: 3619C<EV_A_> is used when other arguments are following. Example:
3120 3620
3121 ev_unref (EV_A); 3621 ev_unref (EV_A);
3122 ev_timer_add (EV_A_ watcher); 3622 ev_timer_add (EV_A_ watcher);
3123 ev_loop (EV_A_ 0); 3623 ev_run (EV_A_ 0);
3124 3624
3125It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 3625It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
3126which is often provided by the following macro. 3626which is often provided by the following macro.
3127 3627
3128=item C<EV_P>, C<EV_P_> 3628=item C<EV_P>, C<EV_P_>
3168 } 3668 }
3169 3669
3170 ev_check check; 3670 ev_check check;
3171 ev_check_init (&check, check_cb); 3671 ev_check_init (&check, check_cb);
3172 ev_check_start (EV_DEFAULT_ &check); 3672 ev_check_start (EV_DEFAULT_ &check);
3173 ev_loop (EV_DEFAULT_ 0); 3673 ev_run (EV_DEFAULT_ 0);
3174 3674
3175=head1 EMBEDDING 3675=head1 EMBEDDING
3176 3676
3177Libev can (and often is) directly embedded into host 3677Libev can (and often is) directly embedded into host
3178applications. Examples of applications that embed it include the Deliantra 3678applications. Examples of applications that embed it include the Deliantra
3258 libev.m4 3758 libev.m4
3259 3759
3260=head2 PREPROCESSOR SYMBOLS/MACROS 3760=head2 PREPROCESSOR SYMBOLS/MACROS
3261 3761
3262Libev can be configured via a variety of preprocessor symbols you have to 3762Libev can be configured via a variety of preprocessor symbols you have to
3263define before including any of its files. The default in the absence of 3763define before including (or compiling) any of its files. The default in
3264autoconf is documented for every option. 3764the absence of autoconf is documented for every option.
3765
3766Symbols marked with "(h)" do not change the ABI, and can have different
3767values when compiling libev vs. including F<ev.h>, so it is permissible
3768to redefine them before including F<ev.h> without breaking compatibility
3769to a compiled library. All other symbols change the ABI, which means all
3770users of libev and the libev code itself must be compiled with compatible
3771settings.
3265 3772
3266=over 4 3773=over 4
3267 3774
3775=item EV_COMPAT3 (h)
3776
3777Backwards compatibility is a major concern for libev. This is why this
3778release of libev comes with wrappers for the functions and symbols that
3779have been renamed between libev version 3 and 4.
3780
3781You can disable these wrappers (to test compatibility with future
3782versions) by defining C<EV_COMPAT3> to C<0> when compiling your
3783sources. This has the additional advantage that you can drop the C<struct>
3784from C<struct ev_loop> declarations, as libev will provide an C<ev_loop>
3785typedef in that case.
3786
3787In some future version, the default for C<EV_COMPAT3> will become C<0>,
3788and in some even more future version the compatibility code will be
3789removed completely.
3790
3268=item EV_STANDALONE 3791=item EV_STANDALONE (h)
3269 3792
3270Must always be C<1> if you do not use autoconf configuration, which 3793Must always be C<1> if you do not use autoconf configuration, which
3271keeps libev from including F<config.h>, and it also defines dummy 3794keeps libev from including F<config.h>, and it also defines dummy
3272implementations for some libevent functions (such as logging, which is not 3795implementations for some libevent functions (such as logging, which is not
3273supported). It will also not define any of the structs usually found in 3796supported). It will also not define any of the structs usually found in
3274F<event.h> that are not directly supported by the libev core alone. 3797F<event.h> that are not directly supported by the libev core alone.
3275 3798
3276In stanbdalone mode, libev will still try to automatically deduce the 3799In standalone mode, libev will still try to automatically deduce the
3277configuration, but has to be more conservative. 3800configuration, but has to be more conservative.
3278 3801
3279=item EV_USE_MONOTONIC 3802=item EV_USE_MONOTONIC
3280 3803
3281If defined to be C<1>, libev will try to detect the availability of the 3804If defined to be C<1>, libev will try to detect the availability of the
3346be used is the winsock select). This means that it will call 3869be used is the winsock select). This means that it will call
3347C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3870C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3348it is assumed that all these functions actually work on fds, even 3871it is assumed that all these functions actually work on fds, even
3349on win32. Should not be defined on non-win32 platforms. 3872on win32. Should not be defined on non-win32 platforms.
3350 3873
3351=item EV_FD_TO_WIN32_HANDLE 3874=item EV_FD_TO_WIN32_HANDLE(fd)
3352 3875
3353If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3876If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3354file descriptors to socket handles. When not defining this symbol (the 3877file descriptors to socket handles. When not defining this symbol (the
3355default), then libev will call C<_get_osfhandle>, which is usually 3878default), then libev will call C<_get_osfhandle>, which is usually
3356correct. In some cases, programs use their own file descriptor management, 3879correct. In some cases, programs use their own file descriptor management,
3357in which case they can provide this function to map fds to socket handles. 3880in which case they can provide this function to map fds to socket handles.
3881
3882=item EV_WIN32_HANDLE_TO_FD(handle)
3883
3884If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3885using the standard C<_open_osfhandle> function. For programs implementing
3886their own fd to handle mapping, overwriting this function makes it easier
3887to do so. This can be done by defining this macro to an appropriate value.
3888
3889=item EV_WIN32_CLOSE_FD(fd)
3890
3891If programs implement their own fd to handle mapping on win32, then this
3892macro can be used to override the C<close> function, useful to unregister
3893file descriptors again. Note that the replacement function has to close
3894the underlying OS handle.
3358 3895
3359=item EV_USE_POLL 3896=item EV_USE_POLL
3360 3897
3361If defined to be C<1>, libev will compile in support for the C<poll>(2) 3898If defined to be C<1>, libev will compile in support for the C<poll>(2)
3362backend. Otherwise it will be enabled on non-win32 platforms. It 3899backend. Otherwise it will be enabled on non-win32 platforms. It
3409as well as for signal and thread safety in C<ev_async> watchers. 3946as well as for signal and thread safety in C<ev_async> watchers.
3410 3947
3411In the absence of this define, libev will use C<sig_atomic_t volatile> 3948In the absence of this define, libev will use C<sig_atomic_t volatile>
3412(from F<signal.h>), which is usually good enough on most platforms. 3949(from F<signal.h>), which is usually good enough on most platforms.
3413 3950
3414=item EV_H 3951=item EV_H (h)
3415 3952
3416The name of the F<ev.h> header file used to include it. The default if 3953The name of the F<ev.h> header file used to include it. The default if
3417undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 3954undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
3418used to virtually rename the F<ev.h> header file in case of conflicts. 3955used to virtually rename the F<ev.h> header file in case of conflicts.
3419 3956
3420=item EV_CONFIG_H 3957=item EV_CONFIG_H (h)
3421 3958
3422If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3959If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
3423F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3960F<ev.c>'s idea of where to find the F<config.h> file, similarly to
3424C<EV_H>, above. 3961C<EV_H>, above.
3425 3962
3426=item EV_EVENT_H 3963=item EV_EVENT_H (h)
3427 3964
3428Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3965Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
3429of how the F<event.h> header can be found, the default is C<"event.h">. 3966of how the F<event.h> header can be found, the default is C<"event.h">.
3430 3967
3431=item EV_PROTOTYPES 3968=item EV_PROTOTYPES (h)
3432 3969
3433If defined to be C<0>, then F<ev.h> will not define any function 3970If defined to be C<0>, then F<ev.h> will not define any function
3434prototypes, but still define all the structs and other symbols. This is 3971prototypes, but still define all the structs and other symbols. This is
3435occasionally useful if you want to provide your own wrapper functions 3972occasionally useful if you want to provide your own wrapper functions
3436around libev functions. 3973around libev functions.
3458fine. 3995fine.
3459 3996
3460If your embedding application does not need any priorities, defining these 3997If your embedding application does not need any priorities, defining these
3461both to C<0> will save some memory and CPU. 3998both to C<0> will save some memory and CPU.
3462 3999
3463=item EV_PERIODIC_ENABLE 4000=item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE,
4001EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE,
4002EV_ASYNC_ENABLE, EV_CHILD_ENABLE.
3464 4003
3465If undefined or defined to be C<1>, then periodic timers are supported. If 4004If undefined or defined to be C<1> (and the platform supports it), then
3466defined to be C<0>, then they are not. Disabling them saves a few kB of 4005the respective watcher type is supported. If defined to be C<0>, then it
3467code. 4006is not. Disabling watcher types mainly saves code size.
3468 4007
3469=item EV_IDLE_ENABLE 4008=item EV_FEATURES
3470
3471If undefined or defined to be C<1>, then idle watchers are supported. If
3472defined to be C<0>, then they are not. Disabling them saves a few kB of
3473code.
3474
3475=item EV_EMBED_ENABLE
3476
3477If undefined or defined to be C<1>, then embed watchers are supported. If
3478defined to be C<0>, then they are not. Embed watchers rely on most other
3479watcher types, which therefore must not be disabled.
3480
3481=item EV_STAT_ENABLE
3482
3483If undefined or defined to be C<1>, then stat watchers are supported. If
3484defined to be C<0>, then they are not.
3485
3486=item EV_FORK_ENABLE
3487
3488If undefined or defined to be C<1>, then fork watchers are supported. If
3489defined to be C<0>, then they are not.
3490
3491=item EV_ASYNC_ENABLE
3492
3493If undefined or defined to be C<1>, then async watchers are supported. If
3494defined to be C<0>, then they are not.
3495
3496=item EV_MINIMAL
3497 4009
3498If you need to shave off some kilobytes of code at the expense of some 4010If you need to shave off some kilobytes of code at the expense of some
3499speed, define this symbol to C<1>. Currently this is used to override some 4011speed (but with the full API), you can define this symbol to request
3500inlining decisions, saves roughly 30% code size on amd64. It also selects a 4012certain subsets of functionality. The default is to enable all features
3501much smaller 2-heap for timer management over the default 4-heap. 4013that can be enabled on the platform.
4014
4015A typical way to use this symbol is to define it to C<0> (or to a bitset
4016with some broad features you want) and then selectively re-enable
4017additional parts you want, for example if you want everything minimal,
4018but multiple event loop support, async and child watchers and the poll
4019backend, use this:
4020
4021 #define EV_FEATURES 0
4022 #define EV_MULTIPLICITY 1
4023 #define EV_USE_POLL 1
4024 #define EV_CHILD_ENABLE 1
4025 #define EV_ASYNC_ENABLE 1
4026
4027The actual value is a bitset, it can be a combination of the following
4028values:
4029
4030=over 4
4031
4032=item C<1> - faster/larger code
4033
4034Use larger code to speed up some operations.
4035
4036Currently this is used to override some inlining decisions (enlarging the
4037code size by roughly 30% on amd64).
4038
4039When optimising for size, use of compiler flags such as C<-Os> with
4040gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4041assertions.
4042
4043=item C<2> - faster/larger data structures
4044
4045Replaces the small 2-heap for timer management by a faster 4-heap, larger
4046hash table sizes and so on. This will usually further increase code size
4047and can additionally have an effect on the size of data structures at
4048runtime.
4049
4050=item C<4> - full API configuration
4051
4052This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4053enables multiplicity (C<EV_MULTIPLICITY>=1).
4054
4055=item C<8> - full API
4056
4057This enables a lot of the "lesser used" API functions. See C<ev.h> for
4058details on which parts of the API are still available without this
4059feature, and do not complain if this subset changes over time.
4060
4061=item C<16> - enable all optional watcher types
4062
4063Enables all optional watcher types. If you want to selectively enable
4064only some watcher types other than I/O and timers (e.g. prepare,
4065embed, async, child...) you can enable them manually by defining
4066C<EV_watchertype_ENABLE> to C<1> instead.
4067
4068=item C<32> - enable all backends
4069
4070This enables all backends - without this feature, you need to enable at
4071least one backend manually (C<EV_USE_SELECT> is a good choice).
4072
4073=item C<64> - enable OS-specific "helper" APIs
4074
4075Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by
4076default.
4077
4078=back
4079
4080Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0>
4081reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb
4082code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O
4083watchers, timers and monotonic clock support.
4084
4085With an intelligent-enough linker (gcc+binutils are intelligent enough
4086when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by
4087your program might be left out as well - a binary starting a timer and an
4088I/O watcher then might come out at only 5Kb.
4089
4090=item EV_AVOID_STDIO
4091
4092If this is set to C<1> at compiletime, then libev will avoid using stdio
4093functions (printf, scanf, perror etc.). This will increase the code size
4094somewhat, but if your program doesn't otherwise depend on stdio and your
4095libc allows it, this avoids linking in the stdio library which is quite
4096big.
4097
4098Note that error messages might become less precise when this option is
4099enabled.
4100
4101=item EV_NSIG
4102
4103The highest supported signal number, +1 (or, the number of
4104signals): Normally, libev tries to deduce the maximum number of signals
4105automatically, but sometimes this fails, in which case it can be
4106specified. Also, using a lower number than detected (C<32> should be
4107good for about any system in existence) can save some memory, as libev
4108statically allocates some 12-24 bytes per signal number.
3502 4109
3503=item EV_PID_HASHSIZE 4110=item EV_PID_HASHSIZE
3504 4111
3505C<ev_child> watchers use a small hash table to distribute workload by 4112C<ev_child> watchers use a small hash table to distribute workload by
3506pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 4113pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled),
3507than enough. If you need to manage thousands of children you might want to 4114usually more than enough. If you need to manage thousands of children you
3508increase this value (I<must> be a power of two). 4115might want to increase this value (I<must> be a power of two).
3509 4116
3510=item EV_INOTIFY_HASHSIZE 4117=item EV_INOTIFY_HASHSIZE
3511 4118
3512C<ev_stat> watchers use a small hash table to distribute workload by 4119C<ev_stat> watchers use a small hash table to distribute workload by
3513inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 4120inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES>
3514usually more than enough. If you need to manage thousands of C<ev_stat> 4121disabled), usually more than enough. If you need to manage thousands of
3515watchers you might want to increase this value (I<must> be a power of 4122C<ev_stat> watchers you might want to increase this value (I<must> be a
3516two). 4123power of two).
3517 4124
3518=item EV_USE_4HEAP 4125=item EV_USE_4HEAP
3519 4126
3520Heaps are not very cache-efficient. To improve the cache-efficiency of the 4127Heaps are not very cache-efficient. To improve the cache-efficiency of the
3521timer and periodics heaps, libev uses a 4-heap when this symbol is defined 4128timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3522to C<1>. The 4-heap uses more complicated (longer) code but has noticeably 4129to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3523faster performance with many (thousands) of watchers. 4130faster performance with many (thousands) of watchers.
3524 4131
3525The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4132The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3526(disabled). 4133will be C<0>.
3527 4134
3528=item EV_HEAP_CACHE_AT 4135=item EV_HEAP_CACHE_AT
3529 4136
3530Heaps are not very cache-efficient. To improve the cache-efficiency of the 4137Heaps are not very cache-efficient. To improve the cache-efficiency of the
3531timer and periodics heaps, libev can cache the timestamp (I<at>) within 4138timer and periodics heaps, libev can cache the timestamp (I<at>) within
3532the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 4139the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3533which uses 8-12 bytes more per watcher and a few hundred bytes more code, 4140which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3534but avoids random read accesses on heap changes. This improves performance 4141but avoids random read accesses on heap changes. This improves performance
3535noticeably with many (hundreds) of watchers. 4142noticeably with many (hundreds) of watchers.
3536 4143
3537The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 4144The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3538(disabled). 4145will be C<0>.
3539 4146
3540=item EV_VERIFY 4147=item EV_VERIFY
3541 4148
3542Controls how much internal verification (see C<ev_loop_verify ()>) will 4149Controls how much internal verification (see C<ev_verify ()>) will
3543be done: If set to C<0>, no internal verification code will be compiled 4150be done: If set to C<0>, no internal verification code will be compiled
3544in. If set to C<1>, then verification code will be compiled in, but not 4151in. If set to C<1>, then verification code will be compiled in, but not
3545called. If set to C<2>, then the internal verification code will be 4152called. If set to C<2>, then the internal verification code will be
3546called once per loop, which can slow down libev. If set to C<3>, then the 4153called once per loop, which can slow down libev. If set to C<3>, then the
3547verification code will be called very frequently, which will slow down 4154verification code will be called very frequently, which will slow down
3548libev considerably. 4155libev considerably.
3549 4156
3550The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 4157The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it
3551C<0>. 4158will be C<0>.
3552 4159
3553=item EV_COMMON 4160=item EV_COMMON
3554 4161
3555By default, all watchers have a C<void *data> member. By redefining 4162By default, all watchers have a C<void *data> member. By redefining
3556this macro to a something else you can include more and other types of 4163this macro to something else you can include more and other types of
3557members. You have to define it each time you include one of the files, 4164members. You have to define it each time you include one of the files,
3558though, and it must be identical each time. 4165though, and it must be identical each time.
3559 4166
3560For example, the perl EV module uses something like this: 4167For example, the perl EV module uses something like this:
3561 4168
3614file. 4221file.
3615 4222
3616The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 4223The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3617that everybody includes and which overrides some configure choices: 4224that everybody includes and which overrides some configure choices:
3618 4225
3619 #define EV_MINIMAL 1 4226 #define EV_FEATURES 8
3620 #define EV_USE_POLL 0 4227 #define EV_USE_SELECT 1
3621 #define EV_MULTIPLICITY 0
3622 #define EV_PERIODIC_ENABLE 0 4228 #define EV_PREPARE_ENABLE 1
4229 #define EV_IDLE_ENABLE 1
3623 #define EV_STAT_ENABLE 0 4230 #define EV_SIGNAL_ENABLE 1
3624 #define EV_FORK_ENABLE 0 4231 #define EV_CHILD_ENABLE 1
4232 #define EV_USE_STDEXCEPT 0
3625 #define EV_CONFIG_H <config.h> 4233 #define EV_CONFIG_H <config.h>
3626 #define EV_MINPRI 0
3627 #define EV_MAXPRI 0
3628 4234
3629 #include "ev++.h" 4235 #include "ev++.h"
3630 4236
3631And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 4237And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3632 4238
3692default loop and triggering an C<ev_async> watcher from the default loop 4298default loop and triggering an C<ev_async> watcher from the default loop
3693watcher callback into the event loop interested in the signal. 4299watcher callback into the event loop interested in the signal.
3694 4300
3695=back 4301=back
3696 4302
4303=head4 THREAD LOCKING EXAMPLE
4304
4305Here is a fictitious example of how to run an event loop in a different
4306thread than where callbacks are being invoked and watchers are
4307created/added/removed.
4308
4309For a real-world example, see the C<EV::Loop::Async> perl module,
4310which uses exactly this technique (which is suited for many high-level
4311languages).
4312
4313The example uses a pthread mutex to protect the loop data, a condition
4314variable to wait for callback invocations, an async watcher to notify the
4315event loop thread and an unspecified mechanism to wake up the main thread.
4316
4317First, you need to associate some data with the event loop:
4318
4319 typedef struct {
4320 mutex_t lock; /* global loop lock */
4321 ev_async async_w;
4322 thread_t tid;
4323 cond_t invoke_cv;
4324 } userdata;
4325
4326 void prepare_loop (EV_P)
4327 {
4328 // for simplicity, we use a static userdata struct.
4329 static userdata u;
4330
4331 ev_async_init (&u->async_w, async_cb);
4332 ev_async_start (EV_A_ &u->async_w);
4333
4334 pthread_mutex_init (&u->lock, 0);
4335 pthread_cond_init (&u->invoke_cv, 0);
4336
4337 // now associate this with the loop
4338 ev_set_userdata (EV_A_ u);
4339 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4340 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4341
4342 // then create the thread running ev_loop
4343 pthread_create (&u->tid, 0, l_run, EV_A);
4344 }
4345
4346The callback for the C<ev_async> watcher does nothing: the watcher is used
4347solely to wake up the event loop so it takes notice of any new watchers
4348that might have been added:
4349
4350 static void
4351 async_cb (EV_P_ ev_async *w, int revents)
4352 {
4353 // just used for the side effects
4354 }
4355
4356The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4357protecting the loop data, respectively.
4358
4359 static void
4360 l_release (EV_P)
4361 {
4362 userdata *u = ev_userdata (EV_A);
4363 pthread_mutex_unlock (&u->lock);
4364 }
4365
4366 static void
4367 l_acquire (EV_P)
4368 {
4369 userdata *u = ev_userdata (EV_A);
4370 pthread_mutex_lock (&u->lock);
4371 }
4372
4373The event loop thread first acquires the mutex, and then jumps straight
4374into C<ev_run>:
4375
4376 void *
4377 l_run (void *thr_arg)
4378 {
4379 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4380
4381 l_acquire (EV_A);
4382 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4383 ev_run (EV_A_ 0);
4384 l_release (EV_A);
4385
4386 return 0;
4387 }
4388
4389Instead of invoking all pending watchers, the C<l_invoke> callback will
4390signal the main thread via some unspecified mechanism (signals? pipe
4391writes? C<Async::Interrupt>?) and then waits until all pending watchers
4392have been called (in a while loop because a) spurious wakeups are possible
4393and b) skipping inter-thread-communication when there are no pending
4394watchers is very beneficial):
4395
4396 static void
4397 l_invoke (EV_P)
4398 {
4399 userdata *u = ev_userdata (EV_A);
4400
4401 while (ev_pending_count (EV_A))
4402 {
4403 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4404 pthread_cond_wait (&u->invoke_cv, &u->lock);
4405 }
4406 }
4407
4408Now, whenever the main thread gets told to invoke pending watchers, it
4409will grab the lock, call C<ev_invoke_pending> and then signal the loop
4410thread to continue:
4411
4412 static void
4413 real_invoke_pending (EV_P)
4414 {
4415 userdata *u = ev_userdata (EV_A);
4416
4417 pthread_mutex_lock (&u->lock);
4418 ev_invoke_pending (EV_A);
4419 pthread_cond_signal (&u->invoke_cv);
4420 pthread_mutex_unlock (&u->lock);
4421 }
4422
4423Whenever you want to start/stop a watcher or do other modifications to an
4424event loop, you will now have to lock:
4425
4426 ev_timer timeout_watcher;
4427 userdata *u = ev_userdata (EV_A);
4428
4429 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4430
4431 pthread_mutex_lock (&u->lock);
4432 ev_timer_start (EV_A_ &timeout_watcher);
4433 ev_async_send (EV_A_ &u->async_w);
4434 pthread_mutex_unlock (&u->lock);
4435
4436Note that sending the C<ev_async> watcher is required because otherwise
4437an event loop currently blocking in the kernel will have no knowledge
4438about the newly added timer. By waking up the loop it will pick up any new
4439watchers in the next event loop iteration.
4440
3697=head3 COROUTINES 4441=head3 COROUTINES
3698 4442
3699Libev is very accommodating to coroutines ("cooperative threads"): 4443Libev is very accommodating to coroutines ("cooperative threads"):
3700libev fully supports nesting calls to its functions from different 4444libev fully supports nesting calls to its functions from different
3701coroutines (e.g. you can call C<ev_loop> on the same loop from two 4445coroutines (e.g. you can call C<ev_run> on the same loop from two
3702different coroutines, and switch freely between both coroutines running the 4446different coroutines, and switch freely between both coroutines running
3703loop, as long as you don't confuse yourself). The only exception is that 4447the loop, as long as you don't confuse yourself). The only exception is
3704you must not do this from C<ev_periodic> reschedule callbacks. 4448that you must not do this from C<ev_periodic> reschedule callbacks.
3705 4449
3706Care has been taken to ensure that libev does not keep local state inside 4450Care has been taken to ensure that libev does not keep local state inside
3707C<ev_loop>, and other calls do not usually allow for coroutine switches as 4451C<ev_run>, and other calls do not usually allow for coroutine switches as
3708they do not call any callbacks. 4452they do not call any callbacks.
3709 4453
3710=head2 COMPILER WARNINGS 4454=head2 COMPILER WARNINGS
3711 4455
3712Depending on your compiler and compiler settings, you might get no or a 4456Depending on your compiler and compiler settings, you might get no or a
3723maintainable. 4467maintainable.
3724 4468
3725And of course, some compiler warnings are just plain stupid, or simply 4469And of course, some compiler warnings are just plain stupid, or simply
3726wrong (because they don't actually warn about the condition their message 4470wrong (because they don't actually warn about the condition their message
3727seems to warn about). For example, certain older gcc versions had some 4471seems to warn about). For example, certain older gcc versions had some
3728warnings that resulted an extreme number of false positives. These have 4472warnings that resulted in an extreme number of false positives. These have
3729been fixed, but some people still insist on making code warn-free with 4473been fixed, but some people still insist on making code warn-free with
3730such buggy versions. 4474such buggy versions.
3731 4475
3732While libev is written to generate as few warnings as possible, 4476While libev is written to generate as few warnings as possible,
3733"warn-free" code is not a goal, and it is recommended not to build libev 4477"warn-free" code is not a goal, and it is recommended not to build libev
3769I suggest using suppression lists. 4513I suggest using suppression lists.
3770 4514
3771 4515
3772=head1 PORTABILITY NOTES 4516=head1 PORTABILITY NOTES
3773 4517
4518=head2 GNU/LINUX 32 BIT LIMITATIONS
4519
4520GNU/Linux is the only common platform that supports 64 bit file/large file
4521interfaces but I<disables> them by default.
4522
4523That means that libev compiled in the default environment doesn't support
4524files larger than 2GiB or so, which mainly affects C<ev_stat> watchers.
4525
4526Unfortunately, many programs try to work around this GNU/Linux issue
4527by enabling the large file API, which makes them incompatible with the
4528standard libev compiled for their system.
4529
4530Likewise, libev cannot enable the large file API itself as this would
4531suddenly make it incompatible to the default compile time environment,
4532i.e. all programs not using special compile switches.
4533
4534=head2 OS/X AND DARWIN BUGS
4535
4536The whole thing is a bug if you ask me - basically any system interface
4537you touch is broken, whether it is locales, poll, kqueue or even the
4538OpenGL drivers.
4539
4540=head3 C<kqueue> is buggy
4541
4542The kqueue syscall is broken in all known versions - most versions support
4543only sockets, many support pipes.
4544
4545Libev tries to work around this by not using C<kqueue> by default on this
4546rotten platform, but of course you can still ask for it when creating a
4547loop - embedding a socket-only kqueue loop into a select-based one is
4548probably going to work well.
4549
4550=head3 C<poll> is buggy
4551
4552Instead of fixing C<kqueue>, Apple replaced their (working) C<poll>
4553implementation by something calling C<kqueue> internally around the 10.5.6
4554release, so now C<kqueue> I<and> C<poll> are broken.
4555
4556Libev tries to work around this by not using C<poll> by default on
4557this rotten platform, but of course you can still ask for it when creating
4558a loop.
4559
4560=head3 C<select> is buggy
4561
4562All that's left is C<select>, and of course Apple found a way to fuck this
4563one up as well: On OS/X, C<select> actively limits the number of file
4564descriptors you can pass in to 1024 - your program suddenly crashes when
4565you use more.
4566
4567There is an undocumented "workaround" for this - defining
4568C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should>
4569work on OS/X.
4570
4571=head2 SOLARIS PROBLEMS AND WORKAROUNDS
4572
4573=head3 C<errno> reentrancy
4574
4575The default compile environment on Solaris is unfortunately so
4576thread-unsafe that you can't even use components/libraries compiled
4577without C<-D_REENTRANT> in a threaded program, which, of course, isn't
4578defined by default. A valid, if stupid, implementation choice.
4579
4580If you want to use libev in threaded environments you have to make sure
4581it's compiled with C<_REENTRANT> defined.
4582
4583=head3 Event port backend
4584
4585The scalable event interface for Solaris is called "event
4586ports". Unfortunately, this mechanism is very buggy in all major
4587releases. If you run into high CPU usage, your program freezes or you get
4588a large number of spurious wakeups, make sure you have all the relevant
4589and latest kernel patches applied. No, I don't know which ones, but there
4590are multiple ones to apply, and afterwards, event ports actually work
4591great.
4592
4593If you can't get it to work, you can try running the program by setting
4594the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and
4595C<select> backends.
4596
4597=head2 AIX POLL BUG
4598
4599AIX unfortunately has a broken C<poll.h> header. Libev works around
4600this by trying to avoid the poll backend altogether (i.e. it's not even
4601compiled in), which normally isn't a big problem as C<select> works fine
4602with large bitsets on AIX, and AIX is dead anyway.
4603
3774=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS 4604=head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
4605
4606=head3 General issues
3775 4607
3776Win32 doesn't support any of the standards (e.g. POSIX) that libev 4608Win32 doesn't support any of the standards (e.g. POSIX) that libev
3777requires, and its I/O model is fundamentally incompatible with the POSIX 4609requires, and its I/O model is fundamentally incompatible with the POSIX
3778model. Libev still offers limited functionality on this platform in 4610model. Libev still offers limited functionality on this platform in
3779the form of the C<EVBACKEND_SELECT> backend, and only supports socket 4611the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3780descriptors. This only applies when using Win32 natively, not when using 4612descriptors. This only applies when using Win32 natively, not when using
3781e.g. cygwin. 4613e.g. cygwin. Actually, it only applies to the microsofts own compilers,
4614as every compielr comes with a slightly differently broken/incompatible
4615environment.
3782 4616
3783Lifting these limitations would basically require the full 4617Lifting these limitations would basically require the full
3784re-implementation of the I/O system. If you are into these kinds of 4618re-implementation of the I/O system. If you are into this kind of thing,
3785things, then note that glib does exactly that for you in a very portable 4619then note that glib does exactly that for you in a very portable way (note
3786way (note also that glib is the slowest event library known to man). 4620also that glib is the slowest event library known to man).
3787 4621
3788There is no supported compilation method available on windows except 4622There is no supported compilation method available on windows except
3789embedding it into other applications. 4623embedding it into other applications.
4624
4625Sensible signal handling is officially unsupported by Microsoft - libev
4626tries its best, but under most conditions, signals will simply not work.
3790 4627
3791Not a libev limitation but worth mentioning: windows apparently doesn't 4628Not a libev limitation but worth mentioning: windows apparently doesn't
3792accept large writes: instead of resulting in a partial write, windows will 4629accept large writes: instead of resulting in a partial write, windows will
3793either accept everything or return C<ENOBUFS> if the buffer is too large, 4630either accept everything or return C<ENOBUFS> if the buffer is too large,
3794so make sure you only write small amounts into your sockets (less than a 4631so make sure you only write small amounts into your sockets (less than a
3799the abysmal performance of winsockets, using a large number of sockets 4636the abysmal performance of winsockets, using a large number of sockets
3800is not recommended (and not reasonable). If your program needs to use 4637is not recommended (and not reasonable). If your program needs to use
3801more than a hundred or so sockets, then likely it needs to use a totally 4638more than a hundred or so sockets, then likely it needs to use a totally
3802different implementation for windows, as libev offers the POSIX readiness 4639different implementation for windows, as libev offers the POSIX readiness
3803notification model, which cannot be implemented efficiently on windows 4640notification model, which cannot be implemented efficiently on windows
3804(Microsoft monopoly games). 4641(due to Microsoft monopoly games).
3805 4642
3806A typical way to use libev under windows is to embed it (see the embedding 4643A typical way to use libev under windows is to embed it (see the embedding
3807section for details) and use the following F<evwrap.h> header file instead 4644section for details) and use the following F<evwrap.h> header file instead
3808of F<ev.h>: 4645of F<ev.h>:
3809 4646
3816you do I<not> compile the F<ev.c> or any other embedded source files!): 4653you do I<not> compile the F<ev.c> or any other embedded source files!):
3817 4654
3818 #include "evwrap.h" 4655 #include "evwrap.h"
3819 #include "ev.c" 4656 #include "ev.c"
3820 4657
3821=over 4
3822
3823=item The winsocket select function 4658=head3 The winsocket C<select> function
3824 4659
3825The winsocket C<select> function doesn't follow POSIX in that it 4660The winsocket C<select> function doesn't follow POSIX in that it
3826requires socket I<handles> and not socket I<file descriptors> (it is 4661requires socket I<handles> and not socket I<file descriptors> (it is
3827also extremely buggy). This makes select very inefficient, and also 4662also extremely buggy). This makes select very inefficient, and also
3828requires a mapping from file descriptors to socket handles (the Microsoft 4663requires a mapping from file descriptors to socket handles (the Microsoft
3837 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 4672 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3838 4673
3839Note that winsockets handling of fd sets is O(n), so you can easily get a 4674Note that winsockets handling of fd sets is O(n), so you can easily get a
3840complexity in the O(n²) range when using win32. 4675complexity in the O(n²) range when using win32.
3841 4676
3842=item Limited number of file descriptors 4677=head3 Limited number of file descriptors
3843 4678
3844Windows has numerous arbitrary (and low) limits on things. 4679Windows has numerous arbitrary (and low) limits on things.
3845 4680
3846Early versions of winsocket's select only supported waiting for a maximum 4681Early versions of winsocket's select only supported waiting for a maximum
3847of C<64> handles (probably owning to the fact that all windows kernels 4682of C<64> handles (probably owning to the fact that all windows kernels
3848can only wait for C<64> things at the same time internally; Microsoft 4683can only wait for C<64> things at the same time internally; Microsoft
3849recommends spawning a chain of threads and wait for 63 handles and the 4684recommends spawning a chain of threads and wait for 63 handles and the
3850previous thread in each. Great). 4685previous thread in each. Sounds great!).
3851 4686
3852Newer versions support more handles, but you need to define C<FD_SETSIZE> 4687Newer versions support more handles, but you need to define C<FD_SETSIZE>
3853to some high number (e.g. C<2048>) before compiling the winsocket select 4688to some high number (e.g. C<2048>) before compiling the winsocket select
3854call (which might be in libev or elsewhere, for example, perl does its own 4689call (which might be in libev or elsewhere, for example, perl and many
3855select emulation on windows). 4690other interpreters do their own select emulation on windows).
3856 4691
3857Another limit is the number of file descriptors in the Microsoft runtime 4692Another limit is the number of file descriptors in the Microsoft runtime
3858libraries, which by default is C<64> (there must be a hidden I<64> fetish 4693libraries, which by default is C<64> (there must be a hidden I<64>
3859or something like this inside Microsoft). You can increase this by calling 4694fetish or something like this inside Microsoft). You can increase this
3860C<_setmaxstdio>, which can increase this limit to C<2048> (another 4695by calling C<_setmaxstdio>, which can increase this limit to C<2048>
3861arbitrary limit), but is broken in many versions of the Microsoft runtime 4696(another arbitrary limit), but is broken in many versions of the Microsoft
3862libraries.
3863
3864This might get you to about C<512> or C<2048> sockets (depending on 4697runtime libraries. This might get you to about C<512> or C<2048> sockets
3865windows version and/or the phase of the moon). To get more, you need to 4698(depending on windows version and/or the phase of the moon). To get more,
3866wrap all I/O functions and provide your own fd management, but the cost of 4699you need to wrap all I/O functions and provide your own fd management, but
3867calling select (O(n²)) will likely make this unworkable. 4700the cost of calling select (O(n²)) will likely make this unworkable.
3868
3869=back
3870 4701
3871=head2 PORTABILITY REQUIREMENTS 4702=head2 PORTABILITY REQUIREMENTS
3872 4703
3873In addition to a working ISO-C implementation and of course the 4704In addition to a working ISO-C implementation and of course the
3874backend-specific APIs, libev relies on a few additional extensions: 4705backend-specific APIs, libev relies on a few additional extensions:
3913watchers. 4744watchers.
3914 4745
3915=item C<double> must hold a time value in seconds with enough accuracy 4746=item C<double> must hold a time value in seconds with enough accuracy
3916 4747
3917The type C<double> is used to represent timestamps. It is required to 4748The type C<double> is used to represent timestamps. It is required to
3918have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4749have at least 51 bits of mantissa (and 9 bits of exponent), which is
3919enough for at least into the year 4000. This requirement is fulfilled by 4750good enough for at least into the year 4000 with millisecond accuracy
4751(the design goal for libev). This requirement is overfulfilled by
3920implementations implementing IEEE 754 (basically all existing ones). 4752implementations using IEEE 754, which is basically all existing ones. With
4753IEEE 754 doubles, you get microsecond accuracy until at least 2200.
3921 4754
3922=back 4755=back
3923 4756
3924If you know of other additional requirements drop me a note. 4757If you know of other additional requirements drop me a note.
3925 4758
3993involves iterating over all running async watchers or all signal numbers. 4826involves iterating over all running async watchers or all signal numbers.
3994 4827
3995=back 4828=back
3996 4829
3997 4830
4831=head1 PORTING FROM LIBEV 3.X TO 4.X
4832
4833The major version 4 introduced some minor incompatible changes to the API.
4834
4835At the moment, the C<ev.h> header file tries to implement superficial
4836compatibility, so most programs should still compile. Those might be
4837removed in later versions of libev, so better update early than late.
4838
4839=over 4
4840
4841=item C<ev_default_destroy> and C<ev_default_fork> have been removed
4842
4843These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
4844
4845 ev_loop_destroy (EV_DEFAULT);
4846 ev_loop_fork (EV_DEFAULT);
4847
4848=item function/symbol renames
4849
4850A number of functions and symbols have been renamed:
4851
4852 ev_loop => ev_run
4853 EVLOOP_NONBLOCK => EVRUN_NOWAIT
4854 EVLOOP_ONESHOT => EVRUN_ONCE
4855
4856 ev_unloop => ev_break
4857 EVUNLOOP_CANCEL => EVBREAK_CANCEL
4858 EVUNLOOP_ONE => EVBREAK_ONE
4859 EVUNLOOP_ALL => EVBREAK_ALL
4860
4861 EV_TIMEOUT => EV_TIMER
4862
4863 ev_loop_count => ev_iteration
4864 ev_loop_depth => ev_depth
4865 ev_loop_verify => ev_verify
4866
4867Most functions working on C<struct ev_loop> objects don't have an
4868C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and
4869associated constants have been renamed to not collide with the C<struct
4870ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme
4871as all other watcher types. Note that C<ev_loop_fork> is still called
4872C<ev_loop_fork> because it would otherwise clash with the C<ev_fork>
4873typedef.
4874
4875=item C<EV_COMPAT3> backwards compatibility mechanism
4876
4877The backward compatibility mechanism can be controlled by
4878C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING>
4879section.
4880
4881=item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES>
4882
4883The preprocessor symbol C<EV_MINIMAL> has been replaced by a different
4884mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile
4885and work, but the library code will of course be larger.
4886
4887=back
4888
4889
4890=head1 GLOSSARY
4891
4892=over 4
4893
4894=item active
4895
4896A watcher is active as long as it has been started and not yet stopped.
4897See L<WATCHER STATES> for details.
4898
4899=item application
4900
4901In this document, an application is whatever is using libev.
4902
4903=item backend
4904
4905The part of the code dealing with the operating system interfaces.
4906
4907=item callback
4908
4909The address of a function that is called when some event has been
4910detected. Callbacks are being passed the event loop, the watcher that
4911received the event, and the actual event bitset.
4912
4913=item callback/watcher invocation
4914
4915The act of calling the callback associated with a watcher.
4916
4917=item event
4918
4919A change of state of some external event, such as data now being available
4920for reading on a file descriptor, time having passed or simply not having
4921any other events happening anymore.
4922
4923In libev, events are represented as single bits (such as C<EV_READ> or
4924C<EV_TIMER>).
4925
4926=item event library
4927
4928A software package implementing an event model and loop.
4929
4930=item event loop
4931
4932An entity that handles and processes external events and converts them
4933into callback invocations.
4934
4935=item event model
4936
4937The model used to describe how an event loop handles and processes
4938watchers and events.
4939
4940=item pending
4941
4942A watcher is pending as soon as the corresponding event has been
4943detected. See L<WATCHER STATES> for details.
4944
4945=item real time
4946
4947The physical time that is observed. It is apparently strictly monotonic :)
4948
4949=item wall-clock time
4950
4951The time and date as shown on clocks. Unlike real time, it can actually
4952be wrong and jump forwards and backwards, e.g. when the you adjust your
4953clock.
4954
4955=item watcher
4956
4957A data structure that describes interest in certain events. Watchers need
4958to be started (attached to an event loop) before they can receive events.
4959
4960=back
4961
3998=head1 AUTHOR 4962=head1 AUTHOR
3999 4963
4000Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. 4964Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
4001 4965

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines