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

Comparing libev/ev.pod (file contents):
Revision 1.46 by root, Mon Nov 26 10:20:43 2007 UTC vs.
Revision 1.95 by root, Fri Dec 21 05:10:01 2007 UTC

4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 #include <ev.h> 7 #include <ev.h>
8 8
9=head1 EXAMPLE PROGRAM
10
11 #include <ev.h>
12
13 ev_io stdin_watcher;
14 ev_timer timeout_watcher;
15
16 /* called when data readable on stdin */
17 static void
18 stdin_cb (EV_P_ struct ev_io *w, int revents)
19 {
20 /* puts ("stdin ready"); */
21 ev_io_stop (EV_A_ w); /* just a syntax example */
22 ev_unloop (EV_A_ EVUNLOOP_ALL); /* leave all loop calls */
23 }
24
25 static void
26 timeout_cb (EV_P_ struct ev_timer *w, int revents)
27 {
28 /* puts ("timeout"); */
29 ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */
30 }
31
32 int
33 main (void)
34 {
35 struct ev_loop *loop = ev_default_loop (0);
36
37 /* initialise an io watcher, then start it */
38 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
39 ev_io_start (loop, &stdin_watcher);
40
41 /* simple non-repeating 5.5 second timeout */
42 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
43 ev_timer_start (loop, &timeout_watcher);
44
45 /* loop till timeout or data ready */
46 ev_loop (loop, 0);
47
48 return 0;
49 }
50
9=head1 DESCRIPTION 51=head1 DESCRIPTION
10 52
53The newest version of this document is also available as a html-formatted
54web page you might find easier to navigate when reading it for the first
55time: L<http://cvs.schmorp.de/libev/ev.html>.
56
11Libev is an event loop: you register interest in certain events (such as a 57Libev is an event loop: you register interest in certain events (such as a
12file descriptor being readable or a timeout occuring), and it will manage 58file descriptor being readable or a timeout occurring), and it will manage
13these event sources and provide your program with events. 59these event sources and provide your program with events.
14 60
15To do this, it must take more or less complete control over your process 61To do this, it must take more or less complete control over your process
16(or thread) by executing the I<event loop> handler, and will then 62(or thread) by executing the I<event loop> handler, and will then
17communicate events via a callback mechanism. 63communicate events via a callback mechanism.
21details of the event, and then hand it over to libev by I<starting> the 67details of the event, and then hand it over to libev by I<starting> the
22watcher. 68watcher.
23 69
24=head1 FEATURES 70=head1 FEATURES
25 71
26Libev supports select, poll, the linux-specific epoll and the bsd-specific 72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
27kqueue mechanisms for file descriptor events, relative timers, absolute 73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
28timers with customised rescheduling, signal events, process status change 74for file descriptor events (C<ev_io>), the Linux C<inotify> interface
29events (related to SIGCHLD), and event watchers dealing with the event 75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
30loop mechanism itself (idle, prepare and check watchers). It also is quite 76with customised rescheduling (C<ev_periodic>), synchronous signals
77(C<ev_signal>), process status change events (C<ev_child>), and event
78watchers dealing with the event loop mechanism itself (C<ev_idle>,
79C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as
80file watchers (C<ev_stat>) and even limited support for fork events
81(C<ev_fork>).
82
83It also is quite fast (see this
31fast (see this L<benchmark|http://libev.schmorp.de/bench.html> comparing 84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
32it to libevent for example). 85for example).
33 86
34=head1 CONVENTIONS 87=head1 CONVENTIONS
35 88
36Libev is very configurable. In this manual the default configuration 89Libev is very configurable. In this manual the default configuration will
37will be described, which supports multiple event loops. For more info 90be described, which supports multiple event loops. For more info about
38about various configuration options please have a look at the file 91various configuration options please have a look at B<EMBED> section in
39F<README.embed> in the libev distribution. If libev was configured without 92this manual. If libev was configured without support for multiple event
40support for multiple event loops, then all functions taking an initial 93loops, then all functions taking an initial argument of name C<loop>
41argument of name C<loop> (which is always of type C<struct ev_loop *>) 94(which is always of type C<struct ev_loop *>) will not have this argument.
42will not have this argument.
43 95
44=head1 TIME REPRESENTATION 96=head1 TIME REPRESENTATION
45 97
46Libev represents time as a single floating point number, representing the 98Libev represents time as a single floating point number, representing the
47(fractional) number of seconds since the (POSIX) epoch (somewhere near 99(fractional) number of seconds since the (POSIX) epoch (somewhere near
48the beginning of 1970, details are complicated, don't ask). This type is 100the beginning of 1970, details are complicated, don't ask). This type is
49called C<ev_tstamp>, which is what you should use too. It usually aliases 101called C<ev_tstamp>, which is what you should use too. It usually aliases
50to the C<double> type in C, and when you need to do any calculations on 102to the C<double> type in C, and when you need to do any calculations on
51it, you should treat it as such. 103it, you should treat it as some floatingpoint value. Unlike the name
52 104component C<stamp> might indicate, it is also used for time differences
105throughout libev.
53 106
54=head1 GLOBAL FUNCTIONS 107=head1 GLOBAL FUNCTIONS
55 108
56These functions can be called anytime, even before initialising the 109These functions can be called anytime, even before initialising the
57library in any way. 110library in any way.
66 119
67=item int ev_version_major () 120=item int ev_version_major ()
68 121
69=item int ev_version_minor () 122=item int ev_version_minor ()
70 123
71You can find out the major and minor version numbers of the library 124You can find out the major and minor ABI version numbers of the library
72you linked against by calling the functions C<ev_version_major> and 125you linked against by calling the functions C<ev_version_major> and
73C<ev_version_minor>. If you want, you can compare against the global 126C<ev_version_minor>. If you want, you can compare against the global
74symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the 127symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
75version of the library your program was compiled against. 128version of the library your program was compiled against.
76 129
130These version numbers refer to the ABI version of the library, not the
131release version.
132
77Usually, it's a good idea to terminate if the major versions mismatch, 133Usually, it's a good idea to terminate if the major versions mismatch,
78as this indicates an incompatible change. Minor versions are usually 134as this indicates an incompatible change. Minor versions are usually
79compatible to older versions, so a larger minor version alone is usually 135compatible to older versions, so a larger minor version alone is usually
80not a problem. 136not a problem.
81 137
82Example: make sure we haven't accidentally been linked against the wrong 138Example: Make sure we haven't accidentally been linked against the wrong
83version: 139version.
84 140
85 assert (("libev version mismatch", 141 assert (("libev version mismatch",
86 ev_version_major () == EV_VERSION_MAJOR 142 ev_version_major () == EV_VERSION_MAJOR
87 && ev_version_minor () >= EV_VERSION_MINOR)); 143 && ev_version_minor () >= EV_VERSION_MINOR));
88 144
118 174
119See the description of C<ev_embed> watchers for more info. 175See the description of C<ev_embed> watchers for more info.
120 176
121=item ev_set_allocator (void *(*cb)(void *ptr, long size)) 177=item ev_set_allocator (void *(*cb)(void *ptr, long size))
122 178
123Sets the allocation function to use (the prototype is similar to the 179Sets the allocation function to use (the prototype is similar - the
124realloc C function, the semantics are identical). It is used to allocate 180semantics is identical - to the realloc C function). It is used to
125and free memory (no surprises here). If it returns zero when memory 181allocate and free memory (no surprises here). If it returns zero when
126needs to be allocated, the library might abort or take some potentially 182memory needs to be allocated, the library might abort or take some
127destructive action. The default is your system realloc function. 183potentially destructive action. The default is your system realloc
184function.
128 185
129You could override this function in high-availability programs to, say, 186You could override this function in high-availability programs to, say,
130free some memory if it cannot allocate memory, to use a special allocator, 187free some memory if it cannot allocate memory, to use a special allocator,
131or even to sleep a while and retry until some memory is available. 188or even to sleep a while and retry until some memory is available.
132 189
133Example: replace the libev allocator with one that waits a bit and then 190Example: Replace the libev allocator with one that waits a bit and then
134retries: better than mine). 191retries).
135 192
136 static void * 193 static void *
137 persistent_realloc (void *ptr, long size) 194 persistent_realloc (void *ptr, size_t size)
138 { 195 {
139 for (;;) 196 for (;;)
140 { 197 {
141 void *newptr = realloc (ptr, size); 198 void *newptr = realloc (ptr, size);
142 199
158callback is set, then libev will expect it to remedy the sitution, no 215callback is set, then libev will expect it to remedy the sitution, no
159matter what, when it returns. That is, libev will generally retry the 216matter what, when it returns. That is, libev will generally retry the
160requested operation, or, if the condition doesn't go away, do bad stuff 217requested operation, or, if the condition doesn't go away, do bad stuff
161(such as abort). 218(such as abort).
162 219
163Example: do the same thing as libev does internally: 220Example: This is basically the same thing that libev does internally, too.
164 221
165 static void 222 static void
166 fatal_error (const char *msg) 223 fatal_error (const char *msg)
167 { 224 {
168 perror (msg); 225 perror (msg);
218C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 275C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
219override the flags completely if it is found in the environment. This is 276override the flags completely if it is found in the environment. This is
220useful to try out specific backends to test their performance, or to work 277useful to try out specific backends to test their performance, or to work
221around bugs. 278around bugs.
222 279
280=item C<EVFLAG_FORKCHECK>
281
282Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
283a fork, you can also make libev check for a fork in each iteration by
284enabling this flag.
285
286This works by calling C<getpid ()> on every iteration of the loop,
287and thus this might slow down your event loop if you do a lot of loop
288iterations and little real work, but is usually not noticeable (on my
289Linux system for example, C<getpid> is actually a simple 5-insn sequence
290without a syscall and thus I<very> fast, but my Linux system also has
291C<pthread_atfork> which is even faster).
292
293The big advantage of this flag is that you can forget about fork (and
294forget about forgetting to tell libev about forking) when you use this
295flag.
296
297This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
298environment variable.
299
223=item C<EVBACKEND_SELECT> (value 1, portable select backend) 300=item C<EVBACKEND_SELECT> (value 1, portable select backend)
224 301
225This is your standard select(2) backend. Not I<completely> standard, as 302This is your standard select(2) backend. Not I<completely> standard, as
226libev tries to roll its own fd_set with no limits on the number of fds, 303libev tries to roll its own fd_set with no limits on the number of fds,
227but if that fails, expect a fairly low limit on the number of fds when 304but if that fails, expect a fairly low limit on the number of fds when
236lot of inactive fds). It scales similarly to select, i.e. O(total_fds). 313lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
237 314
238=item C<EVBACKEND_EPOLL> (value 4, Linux) 315=item C<EVBACKEND_EPOLL> (value 4, Linux)
239 316
240For few fds, this backend is a bit little slower than poll and select, 317For few fds, this backend is a bit little slower than poll and select,
241but it scales phenomenally better. While poll and select usually scale like 318but it scales phenomenally better. While poll and select usually scale
242O(total_fds) where n is the total number of fds (or the highest fd), epoll scales 319like O(total_fds) where n is the total number of fds (or the highest fd),
243either O(1) or O(active_fds). 320epoll scales either O(1) or O(active_fds). The epoll design has a number
321of shortcomings, such as silently dropping events in some hard-to-detect
322cases and rewuiring a syscall per fd change, no fork support and bad
323support for dup:
244 324
245While stopping and starting an I/O watcher in the same iteration will 325While stopping, setting and starting an I/O watcher in the same iteration
246result in some caching, there is still a syscall per such incident 326will result in some caching, there is still a syscall per such incident
247(because the fd could point to a different file description now), so its 327(because the fd could point to a different file description now), so its
248best to avoid that. Also, dup()ed file descriptors might not work very 328best to avoid that. Also, C<dup ()>'ed file descriptors might not work
249well if you register events for both fds. 329very well if you register events for both fds.
250 330
251Please note that epoll sometimes generates spurious notifications, so you 331Please note that epoll sometimes generates spurious notifications, so you
252need to use non-blocking I/O or other means to avoid blocking when no data 332need to use non-blocking I/O or other means to avoid blocking when no data
253(or space) is available. 333(or space) is available.
254 334
255=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 335=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
256 336
257Kqueue deserves special mention, as at the time of this writing, it 337Kqueue deserves special mention, as at the time of this writing, it
258was broken on all BSDs except NetBSD (usually it doesn't work with 338was broken on I<all> BSDs (usually it doesn't work with anything but
259anything but sockets and pipes, except on Darwin, where of course its 339sockets and pipes, except on Darwin, where of course it's completely
340useless. On NetBSD, it seems to work for all the FD types I tested, so it
260completely useless). For this reason its not being "autodetected" 341is used by default there). For this reason it's not being "autodetected"
261unless you explicitly specify it explicitly in the flags (i.e. using 342unless you explicitly specify it explicitly in the flags (i.e. using
262C<EVBACKEND_KQUEUE>). 343C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
344system like NetBSD.
263 345
264It scales in the same way as the epoll backend, but the interface to the 346It scales in the same way as the epoll backend, but the interface to the
265kernel is more efficient (which says nothing about its actual speed, of 347kernel is more efficient (which says nothing about its actual speed,
266course). While starting and stopping an I/O watcher does not cause an 348of course). While stopping, setting and starting an I/O watcher does
267extra syscall as with epoll, it still adds up to four event changes per 349never cause an extra syscall as with epoll, it still adds up to two event
268incident, so its best to avoid that. 350changes per incident, support for C<fork ()> is very bad and it drops fds
351silently in similarly hard-to-detetc cases.
269 352
270=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 353=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
271 354
272This is not implemented yet (and might never be). 355This is not implemented yet (and might never be).
273 356
274=item C<EVBACKEND_PORT> (value 32, Solaris 10) 357=item C<EVBACKEND_PORT> (value 32, Solaris 10)
275 358
276This uses the Solaris 10 port mechanism. As with everything on Solaris, 359This uses the Solaris 10 event port mechanism. As with everything on Solaris,
277it's really slow, but it still scales very well (O(active_fds)). 360it's really slow, but it still scales very well (O(active_fds)).
278 361
279Please note that solaris ports can result in a lot of spurious 362Please note that solaris event ports can deliver a lot of spurious
280notifications, so you need to use non-blocking I/O or other means to avoid 363notifications, so you need to use non-blocking I/O or other means to avoid
281blocking when no data (or space) is available. 364blocking when no data (or space) is available.
282 365
283=item C<EVBACKEND_ALL> 366=item C<EVBACKEND_ALL>
284 367
314Similar to C<ev_default_loop>, but always creates a new event loop that is 397Similar to C<ev_default_loop>, but always creates a new event loop that is
315always distinct from the default loop. Unlike the default loop, it cannot 398always distinct from the default loop. Unlike the default loop, it cannot
316handle signal and child watchers, and attempts to do so will be greeted by 399handle signal and child watchers, and attempts to do so will be greeted by
317undefined behaviour (or a failed assertion if assertions are enabled). 400undefined behaviour (or a failed assertion if assertions are enabled).
318 401
319Example: try to create a event loop that uses epoll and nothing else. 402Example: Try to create a event loop that uses epoll and nothing else.
320 403
321 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 404 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
322 if (!epoller) 405 if (!epoller)
323 fatal ("no epoll found here, maybe it hides under your chair"); 406 fatal ("no epoll found here, maybe it hides under your chair");
324 407
327Destroys the default loop again (frees all memory and kernel state 410Destroys the default loop again (frees all memory and kernel state
328etc.). None of the active event watchers will be stopped in the normal 411etc.). None of the active event watchers will be stopped in the normal
329sense, so e.g. C<ev_is_active> might still return true. It is your 412sense, so e.g. C<ev_is_active> might still return true. It is your
330responsibility to either stop all watchers cleanly yoursef I<before> 413responsibility to either stop all watchers cleanly yoursef I<before>
331calling this function, or cope with the fact afterwards (which is usually 414calling this function, or cope with the fact afterwards (which is usually
332the easiest thing, youc na just ignore the watchers and/or C<free ()> them 415the easiest thing, you can just ignore the watchers and/or C<free ()> them
333for example). 416for example).
417
418Note that certain global state, such as signal state, will not be freed by
419this function, and related watchers (such as signal and child watchers)
420would need to be stopped manually.
421
422In general it is not advisable to call this function except in the
423rare occasion where you really need to free e.g. the signal handling
424pipe fds. If you need dynamically allocated loops it is better to use
425C<ev_loop_new> and C<ev_loop_destroy>).
334 426
335=item ev_loop_destroy (loop) 427=item ev_loop_destroy (loop)
336 428
337Like C<ev_default_destroy>, but destroys an event loop created by an 429Like C<ev_default_destroy>, but destroys an event loop created by an
338earlier call to C<ev_loop_new>. 430earlier call to C<ev_loop_new>.
362 454
363Like C<ev_default_fork>, but acts on an event loop created by 455Like C<ev_default_fork>, but acts on an event loop created by
364C<ev_loop_new>. Yes, you have to call this on every allocated event loop 456C<ev_loop_new>. Yes, you have to call this on every allocated event loop
365after fork, and how you do this is entirely your own problem. 457after fork, and how you do this is entirely your own problem.
366 458
459=item unsigned int ev_loop_count (loop)
460
461Returns the count of loop iterations for the loop, which is identical to
462the number of times libev did poll for new events. It starts at C<0> and
463happily wraps around with enough iterations.
464
465This value can sometimes be useful as a generation counter of sorts (it
466"ticks" the number of loop iterations), as it roughly corresponds with
467C<ev_prepare> and C<ev_check> calls.
468
367=item unsigned int ev_backend (loop) 469=item unsigned int ev_backend (loop)
368 470
369Returns one of the C<EVBACKEND_*> flags indicating the event backend in 471Returns one of the C<EVBACKEND_*> flags indicating the event backend in
370use. 472use.
371 473
373 475
374Returns the current "event loop time", which is the time the event loop 476Returns the current "event loop time", which is the time the event loop
375received events and started processing them. This timestamp does not 477received events and started processing them. This timestamp does not
376change as long as callbacks are being processed, and this is also the base 478change as long as callbacks are being processed, and this is also the base
377time used for relative timers. You can treat it as the timestamp of the 479time used for relative timers. You can treat it as the timestamp of the
378event occuring (or more correctly, libev finding out about it). 480event occurring (or more correctly, libev finding out about it).
379 481
380=item ev_loop (loop, int flags) 482=item ev_loop (loop, int flags)
381 483
382Finally, this is it, the event handler. This function usually is called 484Finally, this is it, the event handler. This function usually is called
383after you initialised all your watchers and you want to start handling 485after you initialised all your watchers and you want to start handling
404libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is 506libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
405usually a better approach for this kind of thing. 507usually a better approach for this kind of thing.
406 508
407Here are the gory details of what C<ev_loop> does: 509Here are the gory details of what C<ev_loop> does:
408 510
511 - Before the first iteration, call any pending watchers.
409 * If there are no active watchers (reference count is zero), return. 512 * If there are no active watchers (reference count is zero), return.
410 - Queue prepare watchers and then call all outstanding watchers. 513 - Queue all prepare watchers and then call all outstanding watchers.
411 - If we have been forked, recreate the kernel state. 514 - If we have been forked, recreate the kernel state.
412 - Update the kernel state with all outstanding changes. 515 - Update the kernel state with all outstanding changes.
413 - Update the "event loop time". 516 - Update the "event loop time".
414 - Calculate for how long to block. 517 - Calculate for how long to block.
415 - Block the process, waiting for any events. 518 - Block the process, waiting for any events.
423 Signals and child watchers are implemented as I/O watchers, and will 526 Signals and child watchers are implemented as I/O watchers, and will
424 be handled here by queueing them when their watcher gets executed. 527 be handled here by queueing them when their watcher gets executed.
425 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 528 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
426 were used, return, otherwise continue with step *. 529 were used, return, otherwise continue with step *.
427 530
428Example: queue some jobs and then loop until no events are outsanding 531Example: Queue some jobs and then loop until no events are outsanding
429anymore. 532anymore.
430 533
431 ... queue jobs here, make sure they register event watchers as long 534 ... queue jobs here, make sure they register event watchers as long
432 ... as they still have work to do (even an idle watcher will do..) 535 ... as they still have work to do (even an idle watcher will do..)
433 ev_loop (my_loop, 0); 536 ev_loop (my_loop, 0);
453visible to the libev user and should not keep C<ev_loop> from exiting if 556visible to the libev user and should not keep C<ev_loop> from exiting if
454no event watchers registered by it are active. It is also an excellent 557no event watchers registered by it are active. It is also an excellent
455way to do this for generic recurring timers or from within third-party 558way to do this for generic recurring timers or from within third-party
456libraries. Just remember to I<unref after start> and I<ref before stop>. 559libraries. Just remember to I<unref after start> and I<ref before stop>.
457 560
458Example: create a signal watcher, but keep it from keeping C<ev_loop> 561Example: Create a signal watcher, but keep it from keeping C<ev_loop>
459running when nothing else is active. 562running when nothing else is active.
460 563
461 struct dv_signal exitsig; 564 struct ev_signal exitsig;
462 ev_signal_init (&exitsig, sig_cb, SIGINT); 565 ev_signal_init (&exitsig, sig_cb, SIGINT);
463 ev_signal_start (myloop, &exitsig); 566 ev_signal_start (loop, &exitsig);
464 evf_unref (myloop); 567 evf_unref (loop);
465 568
466Example: for some weird reason, unregister the above signal handler again. 569Example: For some weird reason, unregister the above signal handler again.
467 570
468 ev_ref (myloop); 571 ev_ref (loop);
469 ev_signal_stop (myloop, &exitsig); 572 ev_signal_stop (loop, &exitsig);
470 573
471=back 574=back
472 575
473 576
474=head1 ANATOMY OF A WATCHER 577=head1 ANATOMY OF A WATCHER
544The signal specified in the C<ev_signal> watcher has been received by a thread. 647The signal specified in the C<ev_signal> watcher has been received by a thread.
545 648
546=item C<EV_CHILD> 649=item C<EV_CHILD>
547 650
548The pid specified in the C<ev_child> watcher has received a status change. 651The pid specified in the C<ev_child> watcher has received a status change.
652
653=item C<EV_STAT>
654
655The path specified in the C<ev_stat> watcher changed its attributes somehow.
549 656
550=item C<EV_IDLE> 657=item C<EV_IDLE>
551 658
552The C<ev_idle> watcher has determined that you have nothing better to do. 659The C<ev_idle> watcher has determined that you have nothing better to do.
553 660
561received events. Callbacks of both watcher types can start and stop as 668received events. Callbacks of both watcher types can start and stop as
562many watchers as they want, and all of them will be taken into account 669many watchers as they want, and all of them will be taken into account
563(for example, a C<ev_prepare> watcher might start an idle watcher to keep 670(for example, a C<ev_prepare> watcher might start an idle watcher to keep
564C<ev_loop> from blocking). 671C<ev_loop> from blocking).
565 672
673=item C<EV_EMBED>
674
675The embedded event loop specified in the C<ev_embed> watcher needs attention.
676
677=item C<EV_FORK>
678
679The event loop has been resumed in the child process after fork (see
680C<ev_fork>).
681
566=item C<EV_ERROR> 682=item C<EV_ERROR>
567 683
568An unspecified error has occured, the watcher has been stopped. This might 684An unspecified error has occured, the watcher has been stopped. This might
569happen because the watcher could not be properly started because libev 685happen because the watcher could not be properly started because libev
570ran out of memory, a file descriptor was found to be closed or any other 686ran out of memory, a file descriptor was found to be closed or any other
641=item bool ev_is_pending (ev_TYPE *watcher) 757=item bool ev_is_pending (ev_TYPE *watcher)
642 758
643Returns a true value iff the watcher is pending, (i.e. it has outstanding 759Returns a true value iff the watcher is pending, (i.e. it has outstanding
644events but its callback has not yet been invoked). As long as a watcher 760events but its callback has not yet been invoked). As long as a watcher
645is pending (but not active) you must not call an init function on it (but 761is pending (but not active) you must not call an init function on it (but
646C<ev_TYPE_set> is safe) and you must make sure the watcher is available to 762C<ev_TYPE_set> is safe), you must not change its priority, and you must
647libev (e.g. you cnanot C<free ()> it). 763make sure the watcher is available to libev (e.g. you cannot C<free ()>
764it).
648 765
649=item callback = ev_cb (ev_TYPE *watcher) 766=item callback ev_cb (ev_TYPE *watcher)
650 767
651Returns the callback currently set on the watcher. 768Returns the callback currently set on the watcher.
652 769
653=item ev_cb_set (ev_TYPE *watcher, callback) 770=item ev_cb_set (ev_TYPE *watcher, callback)
654 771
655Change the callback. You can change the callback at virtually any time 772Change the callback. You can change the callback at virtually any time
656(modulo threads). 773(modulo threads).
774
775=item ev_set_priority (ev_TYPE *watcher, priority)
776
777=item int ev_priority (ev_TYPE *watcher)
778
779Set and query the priority of the watcher. The priority is a small
780integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
781(default: C<-2>). Pending watchers with higher priority will be invoked
782before watchers with lower priority, but priority will not keep watchers
783from being executed (except for C<ev_idle> watchers).
784
785This means that priorities are I<only> used for ordering callback
786invocation after new events have been received. This is useful, for
787example, to reduce latency after idling, or more often, to bind two
788watchers on the same event and make sure one is called first.
789
790If you need to suppress invocation when higher priority events are pending
791you need to look at C<ev_idle> watchers, which provide this functionality.
792
793You I<must not> change the priority of a watcher as long as it is active or
794pending.
795
796The default priority used by watchers when no priority has been set is
797always C<0>, which is supposed to not be too high and not be too low :).
798
799Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
800fine, as long as you do not mind that the priority value you query might
801or might not have been adjusted to be within valid range.
802
803=item ev_invoke (loop, ev_TYPE *watcher, int revents)
804
805Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
806C<loop> nor C<revents> need to be valid as long as the watcher callback
807can deal with that fact.
808
809=item int ev_clear_pending (loop, ev_TYPE *watcher)
810
811If the watcher is pending, this function returns clears its pending status
812and returns its C<revents> bitset (as if its callback was invoked). If the
813watcher isn't pending it does nothing and returns C<0>.
657 814
658=back 815=back
659 816
660 817
661=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 818=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
682 { 839 {
683 struct my_io *w = (struct my_io *)w_; 840 struct my_io *w = (struct my_io *)w_;
684 ... 841 ...
685 } 842 }
686 843
687More interesting and less C-conformant ways of catsing your callback type 844More interesting and less C-conformant ways of casting your callback type
688have been omitted.... 845instead have been omitted.
846
847Another common scenario is having some data structure with multiple
848watchers:
849
850 struct my_biggy
851 {
852 int some_data;
853 ev_timer t1;
854 ev_timer t2;
855 }
856
857In this case getting the pointer to C<my_biggy> is a bit more complicated,
858you need to use C<offsetof>:
859
860 #include <stddef.h>
861
862 static void
863 t1_cb (EV_P_ struct ev_timer *w, int revents)
864 {
865 struct my_biggy big = (struct my_biggy *
866 (((char *)w) - offsetof (struct my_biggy, t1));
867 }
868
869 static void
870 t2_cb (EV_P_ struct ev_timer *w, int revents)
871 {
872 struct my_biggy big = (struct my_biggy *
873 (((char *)w) - offsetof (struct my_biggy, t2));
874 }
689 875
690 876
691=head1 WATCHER TYPES 877=head1 WATCHER TYPES
692 878
693This section describes each watcher in detail, but will not repeat 879This section describes each watcher in detail, but will not repeat
694information given in the last section. 880information given in the last section. Any initialisation/set macros,
881functions and members specific to the watcher type are explained.
882
883Members are additionally marked with either I<[read-only]>, meaning that,
884while the watcher is active, you can look at the member and expect some
885sensible content, but you must not modify it (you can modify it while the
886watcher is stopped to your hearts content), or I<[read-write]>, which
887means you can expect it to have some sensible content while the watcher
888is active, but you can also modify it. Modifying it may not do something
889sensible or take immediate effect (or do anything at all), but libev will
890not crash or malfunction in any way.
695 891
696 892
697=head2 C<ev_io> - is this file descriptor readable or writable? 893=head2 C<ev_io> - is this file descriptor readable or writable?
698 894
699I/O watchers check whether a file descriptor is readable or writable 895I/O watchers check whether a file descriptor is readable or writable
728it is best to always use non-blocking I/O: An extra C<read>(2) returning 924it is best to always use non-blocking I/O: An extra C<read>(2) returning
729C<EAGAIN> is far preferable to a program hanging until some data arrives. 925C<EAGAIN> is far preferable to a program hanging until some data arrives.
730 926
731If you cannot run the fd in non-blocking mode (for example you should not 927If you cannot run the fd in non-blocking mode (for example you should not
732play around with an Xlib connection), then you have to seperately re-test 928play around with an Xlib connection), then you have to seperately re-test
733wether a file descriptor is really ready with a known-to-be good interface 929whether a file descriptor is really ready with a known-to-be good interface
734such as poll (fortunately in our Xlib example, Xlib already does this on 930such as poll (fortunately in our Xlib example, Xlib already does this on
735its own, so its quite safe to use). 931its own, so its quite safe to use).
932
933=head3 The special problem of disappearing file descriptors
934
935Some backends (e.g. kqueue, epoll) need to be told about closing a file
936descriptor (either by calling C<close> explicitly or by any other means,
937such as C<dup>). The reason is that you register interest in some file
938descriptor, but when it goes away, the operating system will silently drop
939this interest. If another file descriptor with the same number then is
940registered with libev, there is no efficient way to see that this is, in
941fact, a different file descriptor.
942
943To avoid having to explicitly tell libev about such cases, libev follows
944the following policy: Each time C<ev_io_set> is being called, libev
945will assume that this is potentially a new file descriptor, otherwise
946it is assumed that the file descriptor stays the same. That means that
947you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
948descriptor even if the file descriptor number itself did not change.
949
950This is how one would do it normally anyway, the important point is that
951the libev application should not optimise around libev but should leave
952optimisations to libev.
953
954=head3 The special problem of dup'ed file descriptors
955
956Some backends (e.g. epoll), cannot register events for file descriptors,
957but only events for the underlying file descriptions. That menas when you
958have C<dup ()>'ed file descriptors and register events for them, only one
959file descriptor might actually receive events.
960
961There is no workaorund possible except not registering events
962for potentially C<dup ()>'ed file descriptors or to resort to
963C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
964
965=head3 The special problem of fork
966
967Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
968useless behaviour. Libev fully supports fork, but needs to be told about
969it in the child.
970
971To support fork in your programs, you either have to call
972C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
973enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
974C<EVBACKEND_POLL>.
975
976
977=head3 Watcher-Specific Functions
736 978
737=over 4 979=over 4
738 980
739=item ev_io_init (ev_io *, callback, int fd, int events) 981=item ev_io_init (ev_io *, callback, int fd, int events)
740 982
742 984
743Configures an C<ev_io> watcher. The C<fd> is the file descriptor to 985Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
744rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or 986rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or
745C<EV_READ | EV_WRITE> to receive the given events. 987C<EV_READ | EV_WRITE> to receive the given events.
746 988
989=item int fd [read-only]
990
991The file descriptor being watched.
992
993=item int events [read-only]
994
995The events being watched.
996
747=back 997=back
748 998
749Example: call C<stdin_readable_cb> when STDIN_FILENO has become, well 999Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
750readable, but only once. Since it is likely line-buffered, you could 1000readable, but only once. Since it is likely line-buffered, you could
751attempt to read a whole line in the callback: 1001attempt to read a whole line in the callback.
752 1002
753 static void 1003 static void
754 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1004 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
755 { 1005 {
756 ev_io_stop (loop, w); 1006 ev_io_stop (loop, w);
786 1036
787The callback is guarenteed to be invoked only when its timeout has passed, 1037The callback is guarenteed to be invoked only when its timeout has passed,
788but if multiple timers become ready during the same loop iteration then 1038but if multiple timers become ready during the same loop iteration then
789order of execution is undefined. 1039order of execution is undefined.
790 1040
1041=head3 Watcher-Specific Functions and Data Members
1042
791=over 4 1043=over 4
792 1044
793=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1045=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
794 1046
795=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 1047=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
808=item ev_timer_again (loop) 1060=item ev_timer_again (loop)
809 1061
810This will act as if the timer timed out and restart it again if it is 1062This will act as if the timer timed out and restart it again if it is
811repeating. The exact semantics are: 1063repeating. The exact semantics are:
812 1064
1065If the timer is pending, its pending status is cleared.
1066
813If the timer is started but nonrepeating, stop it. 1067If the timer is started but nonrepeating, stop it (as if it timed out).
814 1068
815If the timer is repeating, either start it if necessary (with the repeat 1069If the timer is repeating, either start it if necessary (with the
816value), or reset the running timer to the repeat value. 1070C<repeat> value), or reset the running timer to the C<repeat> value.
817 1071
818This sounds a bit complicated, but here is a useful and typical 1072This sounds a bit complicated, but here is a useful and typical
819example: Imagine you have a tcp connection and you want a so-called idle 1073example: Imagine you have a tcp connection and you want a so-called idle
820timeout, that is, you want to be called when there have been, say, 60 1074timeout, that is, you want to be called when there have been, say, 60
821seconds of inactivity on the socket. The easiest way to do this is to 1075seconds of inactivity on the socket. The easiest way to do this is to
822configure an C<ev_timer> with after=repeat=60 and calling ev_timer_again each 1076configure an C<ev_timer> with a C<repeat> value of C<60> and then call
823time you successfully read or write some data. If you go into an idle 1077C<ev_timer_again> each time you successfully read or write some data. If
824state where you do not expect data to travel on the socket, you can stop 1078you go into an idle state where you do not expect data to travel on the
825the timer, and again will automatically restart it if need be. 1079socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
1080automatically restart it if need be.
1081
1082That means you can ignore the C<after> value and C<ev_timer_start>
1083altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1084
1085 ev_timer_init (timer, callback, 0., 5.);
1086 ev_timer_again (loop, timer);
1087 ...
1088 timer->again = 17.;
1089 ev_timer_again (loop, timer);
1090 ...
1091 timer->again = 10.;
1092 ev_timer_again (loop, timer);
1093
1094This is more slightly efficient then stopping/starting the timer each time
1095you want to modify its timeout value.
1096
1097=item ev_tstamp repeat [read-write]
1098
1099The current C<repeat> value. Will be used each time the watcher times out
1100or C<ev_timer_again> is called and determines the next timeout (if any),
1101which is also when any modifications are taken into account.
826 1102
827=back 1103=back
828 1104
829Example: create a timer that fires after 60 seconds. 1105Example: Create a timer that fires after 60 seconds.
830 1106
831 static void 1107 static void
832 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1108 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
833 { 1109 {
834 .. one minute over, w is actually stopped right here 1110 .. one minute over, w is actually stopped right here
836 1112
837 struct ev_timer mytimer; 1113 struct ev_timer mytimer;
838 ev_timer_init (&mytimer, one_minute_cb, 60., 0.); 1114 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
839 ev_timer_start (loop, &mytimer); 1115 ev_timer_start (loop, &mytimer);
840 1116
841Example: create a timeout timer that times out after 10 seconds of 1117Example: Create a timeout timer that times out after 10 seconds of
842inactivity. 1118inactivity.
843 1119
844 static void 1120 static void
845 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1121 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
846 { 1122 {
866but on wallclock time (absolute time). You can tell a periodic watcher 1142but on wallclock time (absolute time). You can tell a periodic watcher
867to trigger "at" some specific point in time. For example, if you tell a 1143to trigger "at" some specific point in time. For example, if you tell a
868periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1144periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
869+ 10.>) and then reset your system clock to the last year, then it will 1145+ 10.>) and then reset your system clock to the last year, then it will
870take a year to trigger the event (unlike an C<ev_timer>, which would trigger 1146take a year to trigger the event (unlike an C<ev_timer>, which would trigger
871roughly 10 seconds later and of course not if you reset your system time 1147roughly 10 seconds later).
872again).
873 1148
874They can also be used to implement vastly more complex timers, such as 1149They can also be used to implement vastly more complex timers, such as
875triggering an event on eahc midnight, local time. 1150triggering an event on each midnight, local time or other, complicated,
1151rules.
876 1152
877As with timers, the callback is guarenteed to be invoked only when the 1153As with timers, the callback is guarenteed to be invoked only when the
878time (C<at>) has been passed, but if multiple periodic timers become ready 1154time (C<at>) has been passed, but if multiple periodic timers become ready
879during the same loop iteration then order of execution is undefined. 1155during the same loop iteration then order of execution is undefined.
880 1156
1157=head3 Watcher-Specific Functions and Data Members
1158
881=over 4 1159=over 4
882 1160
883=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 1161=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
884 1162
885=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) 1163=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
887Lots of arguments, lets sort it out... There are basically three modes of 1165Lots of arguments, lets sort it out... There are basically three modes of
888operation, and we will explain them from simplest to complex: 1166operation, and we will explain them from simplest to complex:
889 1167
890=over 4 1168=over 4
891 1169
892=item * absolute timer (interval = reschedule_cb = 0) 1170=item * absolute timer (at = time, interval = reschedule_cb = 0)
893 1171
894In this configuration the watcher triggers an event at the wallclock time 1172In this configuration the watcher triggers an event at the wallclock time
895C<at> and doesn't repeat. It will not adjust when a time jump occurs, 1173C<at> and doesn't repeat. It will not adjust when a time jump occurs,
896that is, if it is to be run at January 1st 2011 then it will run when the 1174that is, if it is to be run at January 1st 2011 then it will run when the
897system time reaches or surpasses this time. 1175system time reaches or surpasses this time.
898 1176
899=item * non-repeating interval timer (interval > 0, reschedule_cb = 0) 1177=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
900 1178
901In this mode the watcher will always be scheduled to time out at the next 1179In this mode the watcher will always be scheduled to time out at the next
902C<at + N * interval> time (for some integer N) and then repeat, regardless 1180C<at + N * interval> time (for some integer N, which can also be negative)
903of any time jumps. 1181and then repeat, regardless of any time jumps.
904 1182
905This can be used to create timers that do not drift with respect to system 1183This can be used to create timers that do not drift with respect to system
906time: 1184time:
907 1185
908 ev_periodic_set (&periodic, 0., 3600., 0); 1186 ev_periodic_set (&periodic, 0., 3600., 0);
914 1192
915Another way to think about it (for the mathematically inclined) is that 1193Another way to think about it (for the mathematically inclined) is that
916C<ev_periodic> will try to run the callback in this mode at the next possible 1194C<ev_periodic> will try to run the callback in this mode at the next possible
917time where C<time = at (mod interval)>, regardless of any time jumps. 1195time where C<time = at (mod interval)>, regardless of any time jumps.
918 1196
1197For numerical stability it is preferable that the C<at> value is near
1198C<ev_now ()> (the current time), but there is no range requirement for
1199this value.
1200
919=item * manual reschedule mode (reschedule_cb = callback) 1201=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
920 1202
921In this mode the values for C<interval> and C<at> are both being 1203In this mode the values for C<interval> and C<at> are both being
922ignored. Instead, each time the periodic watcher gets scheduled, the 1204ignored. Instead, each time the periodic watcher gets scheduled, the
923reschedule callback will be called with the watcher as first, and the 1205reschedule callback will be called with the watcher as first, and the
924current time as second argument. 1206current time as second argument.
925 1207
926NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1208NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
927ever, or make any event loop modifications>. If you need to stop it, 1209ever, or make any event loop modifications>. If you need to stop it,
928return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by 1210return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
929starting a prepare watcher). 1211starting an C<ev_prepare> watcher, which is legal).
930 1212
931Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1213Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
932ev_tstamp now)>, e.g.: 1214ev_tstamp now)>, e.g.:
933 1215
934 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1216 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
957Simply stops and restarts the periodic watcher again. This is only useful 1239Simply stops and restarts the periodic watcher again. This is only useful
958when you changed some parameters or the reschedule callback would return 1240when you changed some parameters or the reschedule callback would return
959a different time than the last time it was called (e.g. in a crond like 1241a different time than the last time it was called (e.g. in a crond like
960program when the crontabs have changed). 1242program when the crontabs have changed).
961 1243
1244=item ev_tstamp offset [read-write]
1245
1246When repeating, this contains the offset value, otherwise this is the
1247absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1248
1249Can be modified any time, but changes only take effect when the periodic
1250timer fires or C<ev_periodic_again> is being called.
1251
1252=item ev_tstamp interval [read-write]
1253
1254The current interval value. Can be modified any time, but changes only
1255take effect when the periodic timer fires or C<ev_periodic_again> is being
1256called.
1257
1258=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]
1259
1260The current reschedule callback, or C<0>, if this functionality is
1261switched off. Can be changed any time, but changes only take effect when
1262the periodic timer fires or C<ev_periodic_again> is being called.
1263
1264=item ev_tstamp at [read-only]
1265
1266When active, contains the absolute time that the watcher is supposed to
1267trigger next.
1268
962=back 1269=back
963 1270
964Example: call a callback every hour, or, more precisely, whenever the 1271Example: Call a callback every hour, or, more precisely, whenever the
965system clock is divisible by 3600. The callback invocation times have 1272system clock is divisible by 3600. The callback invocation times have
966potentially a lot of jittering, but good long-term stability. 1273potentially a lot of jittering, but good long-term stability.
967 1274
968 static void 1275 static void
969 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1276 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
973 1280
974 struct ev_periodic hourly_tick; 1281 struct ev_periodic hourly_tick;
975 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0); 1282 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
976 ev_periodic_start (loop, &hourly_tick); 1283 ev_periodic_start (loop, &hourly_tick);
977 1284
978Example: the same as above, but use a reschedule callback to do it: 1285Example: The same as above, but use a reschedule callback to do it:
979 1286
980 #include <math.h> 1287 #include <math.h>
981 1288
982 static ev_tstamp 1289 static ev_tstamp
983 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now) 1290 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
985 return fmod (now, 3600.) + 3600.; 1292 return fmod (now, 3600.) + 3600.;
986 } 1293 }
987 1294
988 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb); 1295 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
989 1296
990Example: call a callback every hour, starting now: 1297Example: Call a callback every hour, starting now:
991 1298
992 struct ev_periodic hourly_tick; 1299 struct ev_periodic hourly_tick;
993 ev_periodic_init (&hourly_tick, clock_cb, 1300 ev_periodic_init (&hourly_tick, clock_cb,
994 fmod (ev_now (loop), 3600.), 3600., 0); 1301 fmod (ev_now (loop), 3600.), 3600., 0);
995 ev_periodic_start (loop, &hourly_tick); 1302 ev_periodic_start (loop, &hourly_tick);
1007with the kernel (thus it coexists with your own signal handlers as long 1314with the kernel (thus it coexists with your own signal handlers as long
1008as you don't register any with libev). Similarly, when the last signal 1315as you don't register any with libev). Similarly, when the last signal
1009watcher for a signal is stopped libev will reset the signal handler to 1316watcher for a signal is stopped libev will reset the signal handler to
1010SIG_DFL (regardless of what it was set to before). 1317SIG_DFL (regardless of what it was set to before).
1011 1318
1319=head3 Watcher-Specific Functions and Data Members
1320
1012=over 4 1321=over 4
1013 1322
1014=item ev_signal_init (ev_signal *, callback, int signum) 1323=item ev_signal_init (ev_signal *, callback, int signum)
1015 1324
1016=item ev_signal_set (ev_signal *, int signum) 1325=item ev_signal_set (ev_signal *, int signum)
1017 1326
1018Configures the watcher to trigger on the given signal number (usually one 1327Configures the watcher to trigger on the given signal number (usually one
1019of the C<SIGxxx> constants). 1328of the C<SIGxxx> constants).
1020 1329
1330=item int signum [read-only]
1331
1332The signal the watcher watches out for.
1333
1021=back 1334=back
1022 1335
1023 1336
1024=head2 C<ev_child> - watch out for process status changes 1337=head2 C<ev_child> - watch out for process status changes
1025 1338
1026Child watchers trigger when your process receives a SIGCHLD in response to 1339Child watchers trigger when your process receives a SIGCHLD in response to
1027some child status changes (most typically when a child of yours dies). 1340some child status changes (most typically when a child of yours dies).
1341
1342=head3 Watcher-Specific Functions and Data Members
1028 1343
1029=over 4 1344=over 4
1030 1345
1031=item ev_child_init (ev_child *, callback, int pid) 1346=item ev_child_init (ev_child *, callback, int pid)
1032 1347
1037at the C<rstatus> member of the C<ev_child> watcher structure to see 1352at the C<rstatus> member of the C<ev_child> watcher structure to see
1038the status word (use the macros from C<sys/wait.h> and see your systems 1353the status word (use the macros from C<sys/wait.h> and see your systems
1039C<waitpid> documentation). The C<rpid> member contains the pid of the 1354C<waitpid> documentation). The C<rpid> member contains the pid of the
1040process causing the status change. 1355process causing the status change.
1041 1356
1357=item int pid [read-only]
1358
1359The process id this watcher watches out for, or C<0>, meaning any process id.
1360
1361=item int rpid [read-write]
1362
1363The process id that detected a status change.
1364
1365=item int rstatus [read-write]
1366
1367The process exit/trace status caused by C<rpid> (see your systems
1368C<waitpid> and C<sys/wait.h> documentation for details).
1369
1042=back 1370=back
1043 1371
1044Example: try to exit cleanly on SIGINT and SIGTERM. 1372Example: Try to exit cleanly on SIGINT and SIGTERM.
1045 1373
1046 static void 1374 static void
1047 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1375 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1048 { 1376 {
1049 ev_unloop (loop, EVUNLOOP_ALL); 1377 ev_unloop (loop, EVUNLOOP_ALL);
1052 struct ev_signal signal_watcher; 1380 struct ev_signal signal_watcher;
1053 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 1381 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1054 ev_signal_start (loop, &sigint_cb); 1382 ev_signal_start (loop, &sigint_cb);
1055 1383
1056 1384
1385=head2 C<ev_stat> - did the file attributes just change?
1386
1387This watches a filesystem path for attribute changes. That is, it calls
1388C<stat> regularly (or when the OS says it changed) and sees if it changed
1389compared to the last time, invoking the callback if it did.
1390
1391The path does not need to exist: changing from "path exists" to "path does
1392not exist" is a status change like any other. The condition "path does
1393not exist" is signified by the C<st_nlink> field being zero (which is
1394otherwise always forced to be at least one) and all the other fields of
1395the stat buffer having unspecified contents.
1396
1397The path I<should> be absolute and I<must not> end in a slash. If it is
1398relative and your working directory changes, the behaviour is undefined.
1399
1400Since there is no standard to do this, the portable implementation simply
1401calls C<stat (2)> regularly on the path to see if it changed somehow. You
1402can specify a recommended polling interval for this case. If you specify
1403a polling interval of C<0> (highly recommended!) then a I<suitable,
1404unspecified default> value will be used (which you can expect to be around
1405five seconds, although this might change dynamically). Libev will also
1406impose a minimum interval which is currently around C<0.1>, but thats
1407usually overkill.
1408
1409This watcher type is not meant for massive numbers of stat watchers,
1410as even with OS-supported change notifications, this can be
1411resource-intensive.
1412
1413At the time of this writing, only the Linux inotify interface is
1414implemented (implementing kqueue support is left as an exercise for the
1415reader). Inotify will be used to give hints only and should not change the
1416semantics of C<ev_stat> watchers, which means that libev sometimes needs
1417to fall back to regular polling again even with inotify, but changes are
1418usually detected immediately, and if the file exists there will be no
1419polling.
1420
1421=head3 Watcher-Specific Functions and Data Members
1422
1423=over 4
1424
1425=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1426
1427=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
1428
1429Configures the watcher to wait for status changes of the given
1430C<path>. The C<interval> is a hint on how quickly a change is expected to
1431be detected and should normally be specified as C<0> to let libev choose
1432a suitable value. The memory pointed to by C<path> must point to the same
1433path for as long as the watcher is active.
1434
1435The callback will be receive C<EV_STAT> when a change was detected,
1436relative to the attributes at the time the watcher was started (or the
1437last change was detected).
1438
1439=item ev_stat_stat (ev_stat *)
1440
1441Updates the stat buffer immediately with new values. If you change the
1442watched path in your callback, you could call this fucntion to avoid
1443detecting this change (while introducing a race condition). Can also be
1444useful simply to find out the new values.
1445
1446=item ev_statdata attr [read-only]
1447
1448The most-recently detected attributes of the file. Although the type is of
1449C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1450suitable for your system. If the C<st_nlink> member is C<0>, then there
1451was some error while C<stat>ing the file.
1452
1453=item ev_statdata prev [read-only]
1454
1455The previous attributes of the file. The callback gets invoked whenever
1456C<prev> != C<attr>.
1457
1458=item ev_tstamp interval [read-only]
1459
1460The specified interval.
1461
1462=item const char *path [read-only]
1463
1464The filesystem path that is being watched.
1465
1466=back
1467
1468Example: Watch C</etc/passwd> for attribute changes.
1469
1470 static void
1471 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1472 {
1473 /* /etc/passwd changed in some way */
1474 if (w->attr.st_nlink)
1475 {
1476 printf ("passwd current size %ld\n", (long)w->attr.st_size);
1477 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1478 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1479 }
1480 else
1481 /* you shalt not abuse printf for puts */
1482 puts ("wow, /etc/passwd is not there, expect problems. "
1483 "if this is windows, they already arrived\n");
1484 }
1485
1486 ...
1487 ev_stat passwd;
1488
1489 ev_stat_init (&passwd, passwd_cb, "/etc/passwd");
1490 ev_stat_start (loop, &passwd);
1491
1492
1057=head2 C<ev_idle> - when you've got nothing better to do... 1493=head2 C<ev_idle> - when you've got nothing better to do...
1058 1494
1059Idle watchers trigger events when there are no other events are pending 1495Idle watchers trigger events when no other events of the same or higher
1060(prepare, check and other idle watchers do not count). That is, as long 1496priority are pending (prepare, check and other idle watchers do not
1061as your process is busy handling sockets or timeouts (or even signals, 1497count).
1062imagine) it will not be triggered. But when your process is idle all idle 1498
1063watchers are being called again and again, once per event loop iteration - 1499That is, as long as your process is busy handling sockets or timeouts
1500(or even signals, imagine) of the same or higher priority it will not be
1501triggered. But when your process is idle (or only lower-priority watchers
1502are pending), the idle watchers are being called once per event loop
1064until stopped, that is, or your process receives more events and becomes 1503iteration - until stopped, that is, or your process receives more events
1065busy. 1504and becomes busy again with higher priority stuff.
1066 1505
1067The most noteworthy effect is that as long as any idle watchers are 1506The most noteworthy effect is that as long as any idle watchers are
1068active, the process will not block when waiting for new events. 1507active, the process will not block when waiting for new events.
1069 1508
1070Apart from keeping your process non-blocking (which is a useful 1509Apart from keeping your process non-blocking (which is a useful
1071effect on its own sometimes), idle watchers are a good place to do 1510effect on its own sometimes), idle watchers are a good place to do
1072"pseudo-background processing", or delay processing stuff to after the 1511"pseudo-background processing", or delay processing stuff to after the
1073event loop has handled all outstanding events. 1512event loop has handled all outstanding events.
1074 1513
1514=head3 Watcher-Specific Functions and Data Members
1515
1075=over 4 1516=over 4
1076 1517
1077=item ev_idle_init (ev_signal *, callback) 1518=item ev_idle_init (ev_signal *, callback)
1078 1519
1079Initialises and configures the idle watcher - it has no parameters of any 1520Initialises and configures the idle watcher - it has no parameters of any
1080kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 1521kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1081believe me. 1522believe me.
1082 1523
1083=back 1524=back
1084 1525
1085Example: dynamically allocate an C<ev_idle>, start it, and in the 1526Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1086callback, free it. Alos, use no error checking, as usual. 1527callback, free it. Also, use no error checking, as usual.
1087 1528
1088 static void 1529 static void
1089 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 1530 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1090 { 1531 {
1091 free (w); 1532 free (w);
1136with priority higher than or equal to the event loop and one coroutine 1577with priority higher than or equal to the event loop and one coroutine
1137of lower priority, but only once, using idle watchers to keep the event 1578of lower priority, but only once, using idle watchers to keep the event
1138loop from blocking if lower-priority coroutines are active, thus mapping 1579loop from blocking if lower-priority coroutines are active, thus mapping
1139low-priority coroutines to idle/background tasks). 1580low-priority coroutines to idle/background tasks).
1140 1581
1582It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1583priority, to ensure that they are being run before any other watchers
1584after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1585too) should not activate ("feed") events into libev. While libev fully
1586supports this, they will be called before other C<ev_check> watchers did
1587their job. As C<ev_check> watchers are often used to embed other event
1588loops those other event loops might be in an unusable state until their
1589C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1590others).
1591
1592=head3 Watcher-Specific Functions and Data Members
1593
1141=over 4 1594=over 4
1142 1595
1143=item ev_prepare_init (ev_prepare *, callback) 1596=item ev_prepare_init (ev_prepare *, callback)
1144 1597
1145=item ev_check_init (ev_check *, callback) 1598=item ev_check_init (ev_check *, callback)
1148parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1601parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1149macros, but using them is utterly, utterly and completely pointless. 1602macros, but using them is utterly, utterly and completely pointless.
1150 1603
1151=back 1604=back
1152 1605
1153Example: To include a library such as adns, you would add IO watchers 1606There are a number of principal ways to embed other event loops or modules
1154and a timeout watcher in a prepare handler, as required by libadns, and 1607into libev. Here are some ideas on how to include libadns into libev
1608(there is a Perl module named C<EV::ADNS> that does this, which you could
1609use for an actually working example. Another Perl module named C<EV::Glib>
1610embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
1611into the Glib event loop).
1612
1613Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1155in a check watcher, destroy them and call into libadns. What follows is 1614and in a check watcher, destroy them and call into libadns. What follows
1156pseudo-code only of course: 1615is pseudo-code only of course. This requires you to either use a low
1616priority for the check watcher or use C<ev_clear_pending> explicitly, as
1617the callbacks for the IO/timeout watchers might not have been called yet.
1157 1618
1158 static ev_io iow [nfd]; 1619 static ev_io iow [nfd];
1159 static ev_timer tw; 1620 static ev_timer tw;
1160 1621
1161 static void 1622 static void
1162 io_cb (ev_loop *loop, ev_io *w, int revents) 1623 io_cb (ev_loop *loop, ev_io *w, int revents)
1163 { 1624 {
1164 // set the relevant poll flags
1165 // could also call adns_processreadable etc. here
1166 struct pollfd *fd = (struct pollfd *)w->data;
1167 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1168 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1169 } 1625 }
1170 1626
1171 // create io watchers for each fd and a timer before blocking 1627 // create io watchers for each fd and a timer before blocking
1172 static void 1628 static void
1173 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 1629 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1174 { 1630 {
1175 int timeout = 3600000;truct pollfd fds [nfd]; 1631 int timeout = 3600000;
1632 struct pollfd fds [nfd];
1176 // actual code will need to loop here and realloc etc. 1633 // actual code will need to loop here and realloc etc.
1177 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 1634 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1178 1635
1179 /* the callback is illegal, but won't be called as we stop during check */ 1636 /* the callback is illegal, but won't be called as we stop during check */
1180 ev_timer_init (&tw, 0, timeout * 1e-3); 1637 ev_timer_init (&tw, 0, timeout * 1e-3);
1181 ev_timer_start (loop, &tw); 1638 ev_timer_start (loop, &tw);
1182 1639
1183 // create on ev_io per pollfd 1640 // create one ev_io per pollfd
1184 for (int i = 0; i < nfd; ++i) 1641 for (int i = 0; i < nfd; ++i)
1185 { 1642 {
1186 ev_io_init (iow + i, io_cb, fds [i].fd, 1643 ev_io_init (iow + i, io_cb, fds [i].fd,
1187 ((fds [i].events & POLLIN ? EV_READ : 0) 1644 ((fds [i].events & POLLIN ? EV_READ : 0)
1188 | (fds [i].events & POLLOUT ? EV_WRITE : 0))); 1645 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1189 1646
1190 fds [i].revents = 0; 1647 fds [i].revents = 0;
1191 iow [i].data = fds + i;
1192 ev_io_start (loop, iow + i); 1648 ev_io_start (loop, iow + i);
1193 } 1649 }
1194 } 1650 }
1195 1651
1196 // stop all watchers after blocking 1652 // stop all watchers after blocking
1198 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 1654 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1199 { 1655 {
1200 ev_timer_stop (loop, &tw); 1656 ev_timer_stop (loop, &tw);
1201 1657
1202 for (int i = 0; i < nfd; ++i) 1658 for (int i = 0; i < nfd; ++i)
1659 {
1660 // set the relevant poll flags
1661 // could also call adns_processreadable etc. here
1662 struct pollfd *fd = fds + i;
1663 int revents = ev_clear_pending (iow + i);
1664 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1665 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1666
1667 // now stop the watcher
1203 ev_io_stop (loop, iow + i); 1668 ev_io_stop (loop, iow + i);
1669 }
1204 1670
1205 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); 1671 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1672 }
1673
1674Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1675in the prepare watcher and would dispose of the check watcher.
1676
1677Method 3: If the module to be embedded supports explicit event
1678notification (adns does), you can also make use of the actual watcher
1679callbacks, and only destroy/create the watchers in the prepare watcher.
1680
1681 static void
1682 timer_cb (EV_P_ ev_timer *w, int revents)
1683 {
1684 adns_state ads = (adns_state)w->data;
1685 update_now (EV_A);
1686
1687 adns_processtimeouts (ads, &tv_now);
1688 }
1689
1690 static void
1691 io_cb (EV_P_ ev_io *w, int revents)
1692 {
1693 adns_state ads = (adns_state)w->data;
1694 update_now (EV_A);
1695
1696 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1697 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1698 }
1699
1700 // do not ever call adns_afterpoll
1701
1702Method 4: Do not use a prepare or check watcher because the module you
1703want to embed is too inflexible to support it. Instead, youc na override
1704their poll function. The drawback with this solution is that the main
1705loop is now no longer controllable by EV. The C<Glib::EV> module does
1706this.
1707
1708 static gint
1709 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1710 {
1711 int got_events = 0;
1712
1713 for (n = 0; n < nfds; ++n)
1714 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1715
1716 if (timeout >= 0)
1717 // create/start timer
1718
1719 // poll
1720 ev_loop (EV_A_ 0);
1721
1722 // stop timer again
1723 if (timeout >= 0)
1724 ev_timer_stop (EV_A_ &to);
1725
1726 // stop io watchers again - their callbacks should have set
1727 for (n = 0; n < nfds; ++n)
1728 ev_io_stop (EV_A_ iow [n]);
1729
1730 return got_events;
1206 } 1731 }
1207 1732
1208 1733
1209=head2 C<ev_embed> - when one backend isn't enough... 1734=head2 C<ev_embed> - when one backend isn't enough...
1210 1735
1211This is a rather advanced watcher type that lets you embed one event loop 1736This is a rather advanced watcher type that lets you embed one event loop
1212into another (currently only C<ev_io> events are supported in the embedded 1737into another (currently only C<ev_io> events are supported in the embedded
1213loop, other types of watchers might be handled in a delayed or incorrect 1738loop, other types of watchers might be handled in a delayed or incorrect
1214fashion and must not be used). 1739fashion and must not be used). (See portability notes, below).
1215 1740
1216There are primarily two reasons you would want that: work around bugs and 1741There are primarily two reasons you would want that: work around bugs and
1217prioritise I/O. 1742prioritise I/O.
1218 1743
1219As an example for a bug workaround, the kqueue backend might only support 1744As an example for a bug workaround, the kqueue backend might only support
1274 ev_embed_start (loop_hi, &embed); 1799 ev_embed_start (loop_hi, &embed);
1275 } 1800 }
1276 else 1801 else
1277 loop_lo = loop_hi; 1802 loop_lo = loop_hi;
1278 1803
1804=head2 Portability notes
1805
1806Kqueue is nominally embeddable, but this is broken on all BSDs that I
1807tried, in various ways. Usually the embedded event loop will simply never
1808receive events, sometimes it will only trigger a few times, sometimes in a
1809loop. Epoll is also nominally embeddable, but many Linux kernel versions
1810will always eport the epoll fd as ready, even when no events are pending.
1811
1812While libev allows embedding these backends (they are contained in
1813C<ev_embeddable_backends ()>), take extreme care that it will actually
1814work.
1815
1816When in doubt, create a dynamic event loop forced to use sockets (this
1817usually works) and possibly another thread and a pipe or so to report to
1818your main event loop.
1819
1820=head3 Watcher-Specific Functions and Data Members
1821
1279=over 4 1822=over 4
1280 1823
1281=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 1824=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1282 1825
1283=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 1826=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1292 1835
1293Make a single, non-blocking sweep over the embedded loop. This works 1836Make a single, non-blocking sweep over the embedded loop. This works
1294similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 1837similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1295apropriate way for embedded loops. 1838apropriate way for embedded loops.
1296 1839
1840=item struct ev_loop *other [read-only]
1841
1842The embedded event loop.
1843
1844=back
1845
1846
1847=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1848
1849Fork watchers are called when a C<fork ()> was detected (usually because
1850whoever is a good citizen cared to tell libev about it by calling
1851C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the
1852event loop blocks next and before C<ev_check> watchers are being called,
1853and only in the child after the fork. If whoever good citizen calling
1854C<ev_default_fork> cheats and calls it in the wrong process, the fork
1855handlers will be invoked, too, of course.
1856
1857=head3 Watcher-Specific Functions and Data Members
1858
1859=over 4
1860
1861=item ev_fork_init (ev_signal *, callback)
1862
1863Initialises and configures the fork watcher - it has no parameters of any
1864kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
1865believe me.
1866
1297=back 1867=back
1298 1868
1299 1869
1300=head1 OTHER FUNCTIONS 1870=head1 OTHER FUNCTIONS
1301 1871
1389 1959
1390To use it, 1960To use it,
1391 1961
1392 #include <ev++.h> 1962 #include <ev++.h>
1393 1963
1394(it is not installed by default). This automatically includes F<ev.h> 1964This automatically includes F<ev.h> and puts all of its definitions (many
1395and puts all of its definitions (many of them macros) into the global 1965of them macros) into the global namespace. All C++ specific things are
1396namespace. All C++ specific things are put into the C<ev> namespace. 1966put into the C<ev> namespace. It should support all the same embedding
1967options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1397 1968
1398It should support all the same embedding options as F<ev.h>, most notably 1969Care has been taken to keep the overhead low. The only data member the C++
1399C<EV_MULTIPLICITY>. 1970classes add (compared to plain C-style watchers) is the event loop pointer
1971that the watcher is associated with (or no additional members at all if
1972you disable C<EV_MULTIPLICITY> when embedding libev).
1973
1974Currently, functions, and static and non-static member functions can be
1975used as callbacks. Other types should be easy to add as long as they only
1976need one additional pointer for context. If you need support for other
1977types of functors please contact the author (preferably after implementing
1978it).
1400 1979
1401Here is a list of things available in the C<ev> namespace: 1980Here is a list of things available in the C<ev> namespace:
1402 1981
1403=over 4 1982=over 4
1404 1983
1420 1999
1421All of those classes have these methods: 2000All of those classes have these methods:
1422 2001
1423=over 4 2002=over 4
1424 2003
1425=item ev::TYPE::TYPE (object *, object::method *) 2004=item ev::TYPE::TYPE ()
1426 2005
1427=item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *) 2006=item ev::TYPE::TYPE (struct ev_loop *)
1428 2007
1429=item ev::TYPE::~TYPE 2008=item ev::TYPE::~TYPE
1430 2009
1431The constructor takes a pointer to an object and a method pointer to 2010The constructor (optionally) takes an event loop to associate the watcher
1432the event handler callback to call in this class. The constructor calls 2011with. If it is omitted, it will use C<EV_DEFAULT>.
1433C<ev_init> for you, which means you have to call the C<set> method 2012
1434before starting it. If you do not specify a loop then the constructor 2013The constructor calls C<ev_init> for you, which means you have to call the
1435automatically associates the default loop with this watcher. 2014C<set> method before starting it.
2015
2016It will not set a callback, however: You have to call the templated C<set>
2017method to set a callback before you can start the watcher.
2018
2019(The reason why you have to use a method is a limitation in C++ which does
2020not allow explicit template arguments for constructors).
1436 2021
1437The destructor automatically stops the watcher if it is active. 2022The destructor automatically stops the watcher if it is active.
2023
2024=item w->set<class, &class::method> (object *)
2025
2026This method sets the callback method to call. The method has to have a
2027signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
2028first argument and the C<revents> as second. The object must be given as
2029parameter and is stored in the C<data> member of the watcher.
2030
2031This method synthesizes efficient thunking code to call your method from
2032the C callback that libev requires. If your compiler can inline your
2033callback (i.e. it is visible to it at the place of the C<set> call and
2034your compiler is good :), then the method will be fully inlined into the
2035thunking function, making it as fast as a direct C callback.
2036
2037Example: simple class declaration and watcher initialisation
2038
2039 struct myclass
2040 {
2041 void io_cb (ev::io &w, int revents) { }
2042 }
2043
2044 myclass obj;
2045 ev::io iow;
2046 iow.set <myclass, &myclass::io_cb> (&obj);
2047
2048=item w->set<function> (void *data = 0)
2049
2050Also sets a callback, but uses a static method or plain function as
2051callback. The optional C<data> argument will be stored in the watcher's
2052C<data> member and is free for you to use.
2053
2054The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2055
2056See the method-C<set> above for more details.
2057
2058Example:
2059
2060 static void io_cb (ev::io &w, int revents) { }
2061 iow.set <io_cb> ();
1438 2062
1439=item w->set (struct ev_loop *) 2063=item w->set (struct ev_loop *)
1440 2064
1441Associates a different C<struct ev_loop> with this watcher. You can only 2065Associates a different C<struct ev_loop> with this watcher. You can only
1442do this when the watcher is inactive (and not pending either). 2066do this when the watcher is inactive (and not pending either).
1443 2067
1444=item w->set ([args]) 2068=item w->set ([args])
1445 2069
1446Basically the same as C<ev_TYPE_set>, with the same args. Must be 2070Basically the same as C<ev_TYPE_set>, with the same args. Must be
1447called at least once. Unlike the C counterpart, an active watcher gets 2071called at least once. Unlike the C counterpart, an active watcher gets
1448automatically stopped and restarted. 2072automatically stopped and restarted when reconfiguring it with this
2073method.
1449 2074
1450=item w->start () 2075=item w->start ()
1451 2076
1452Starts the watcher. Note that there is no C<loop> argument as the 2077Starts the watcher. Note that there is no C<loop> argument, as the
1453constructor already takes the loop. 2078constructor already stores the event loop.
1454 2079
1455=item w->stop () 2080=item w->stop ()
1456 2081
1457Stops the watcher if it is active. Again, no C<loop> argument. 2082Stops the watcher if it is active. Again, no C<loop> argument.
1458 2083
1459=item w->again () C<ev::timer>, C<ev::periodic> only 2084=item w->again () (C<ev::timer>, C<ev::periodic> only)
1460 2085
1461For C<ev::timer> and C<ev::periodic>, this invokes the corresponding 2086For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1462C<ev_TYPE_again> function. 2087C<ev_TYPE_again> function.
1463 2088
1464=item w->sweep () C<ev::embed> only 2089=item w->sweep () (C<ev::embed> only)
1465 2090
1466Invokes C<ev_embed_sweep>. 2091Invokes C<ev_embed_sweep>.
2092
2093=item w->update () (C<ev::stat> only)
2094
2095Invokes C<ev_stat_stat>.
1467 2096
1468=back 2097=back
1469 2098
1470=back 2099=back
1471 2100
1479 2108
1480 myclass (); 2109 myclass ();
1481 } 2110 }
1482 2111
1483 myclass::myclass (int fd) 2112 myclass::myclass (int fd)
1484 : io (this, &myclass::io_cb),
1485 idle (this, &myclass::idle_cb)
1486 { 2113 {
2114 io .set <myclass, &myclass::io_cb > (this);
2115 idle.set <myclass, &myclass::idle_cb> (this);
2116
1487 io.start (fd, ev::READ); 2117 io.start (fd, ev::READ);
1488 } 2118 }
2119
2120
2121=head1 MACRO MAGIC
2122
2123Libev can be compiled with a variety of options, the most fundamantal
2124of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2125functions and callbacks have an initial C<struct ev_loop *> argument.
2126
2127To make it easier to write programs that cope with either variant, the
2128following macros are defined:
2129
2130=over 4
2131
2132=item C<EV_A>, C<EV_A_>
2133
2134This provides the loop I<argument> for functions, if one is required ("ev
2135loop argument"). The C<EV_A> form is used when this is the sole argument,
2136C<EV_A_> is used when other arguments are following. Example:
2137
2138 ev_unref (EV_A);
2139 ev_timer_add (EV_A_ watcher);
2140 ev_loop (EV_A_ 0);
2141
2142It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2143which is often provided by the following macro.
2144
2145=item C<EV_P>, C<EV_P_>
2146
2147This provides the loop I<parameter> for functions, if one is required ("ev
2148loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2149C<EV_P_> is used when other parameters are following. Example:
2150
2151 // this is how ev_unref is being declared
2152 static void ev_unref (EV_P);
2153
2154 // this is how you can declare your typical callback
2155 static void cb (EV_P_ ev_timer *w, int revents)
2156
2157It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2158suitable for use with C<EV_A>.
2159
2160=item C<EV_DEFAULT>, C<EV_DEFAULT_>
2161
2162Similar to the other two macros, this gives you the value of the default
2163loop, if multiple loops are supported ("ev loop default").
2164
2165=back
2166
2167Example: Declare and initialise a check watcher, utilising the above
2168macros so it will work regardless of whether multiple loops are supported
2169or not.
2170
2171 static void
2172 check_cb (EV_P_ ev_timer *w, int revents)
2173 {
2174 ev_check_stop (EV_A_ w);
2175 }
2176
2177 ev_check check;
2178 ev_check_init (&check, check_cb);
2179 ev_check_start (EV_DEFAULT_ &check);
2180 ev_loop (EV_DEFAULT_ 0);
1489 2181
1490=head1 EMBEDDING 2182=head1 EMBEDDING
1491 2183
1492Libev can (and often is) directly embedded into host 2184Libev can (and often is) directly embedded into host
1493applications. Examples of applications that embed it include the Deliantra 2185applications. Examples of applications that embed it include the Deliantra
1494Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2186Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
1495and rxvt-unicode. 2187and rxvt-unicode.
1496 2188
1497The goal is to enable you to just copy the neecssary files into your 2189The goal is to enable you to just copy the necessary files into your
1498source directory without having to change even a single line in them, so 2190source directory without having to change even a single line in them, so
1499you can easily upgrade by simply copying (or having a checked-out copy of 2191you can easily upgrade by simply copying (or having a checked-out copy of
1500libev somewhere in your source tree). 2192libev somewhere in your source tree).
1501 2193
1502=head2 FILESETS 2194=head2 FILESETS
1533 ev_vars.h 2225 ev_vars.h
1534 ev_wrap.h 2226 ev_wrap.h
1535 2227
1536 ev_win32.c required on win32 platforms only 2228 ev_win32.c required on win32 platforms only
1537 2229
1538 ev_select.c only when select backend is enabled (which is by default) 2230 ev_select.c only when select backend is enabled (which is enabled by default)
1539 ev_poll.c only when poll backend is enabled (disabled by default) 2231 ev_poll.c only when poll backend is enabled (disabled by default)
1540 ev_epoll.c only when the epoll backend is enabled (disabled by default) 2232 ev_epoll.c only when the epoll backend is enabled (disabled by default)
1541 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 2233 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
1542 ev_port.c only when the solaris port backend is enabled (disabled by default) 2234 ev_port.c only when the solaris port backend is enabled (disabled by default)
1543 2235
1592 2284
1593If defined to be C<1>, libev will try to detect the availability of the 2285If defined to be C<1>, libev will try to detect the availability of the
1594monotonic clock option at both compiletime and runtime. Otherwise no use 2286monotonic clock option at both compiletime and runtime. Otherwise no use
1595of the monotonic clock option will be attempted. If you enable this, you 2287of the monotonic clock option will be attempted. If you enable this, you
1596usually have to link against librt or something similar. Enabling it when 2288usually have to link against librt or something similar. Enabling it when
1597the functionality isn't available is safe, though, althoguh you have 2289the functionality isn't available is safe, though, although you have
1598to make sure you link against any libraries where the C<clock_gettime> 2290to make sure you link against any libraries where the C<clock_gettime>
1599function is hiding in (often F<-lrt>). 2291function is hiding in (often F<-lrt>).
1600 2292
1601=item EV_USE_REALTIME 2293=item EV_USE_REALTIME
1602 2294
1603If defined to be C<1>, libev will try to detect the availability of the 2295If defined to be C<1>, libev will try to detect the availability of the
1604realtime clock option at compiletime (and assume its availability at 2296realtime clock option at compiletime (and assume its availability at
1605runtime if successful). Otherwise no use of the realtime clock option will 2297runtime if successful). Otherwise no use of the realtime clock option will
1606be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2298be attempted. This effectively replaces C<gettimeofday> by C<clock_get
1607(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2299(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
1608in the description of C<EV_USE_MONOTONIC>, though. 2300note about libraries in the description of C<EV_USE_MONOTONIC>, though.
1609 2301
1610=item EV_USE_SELECT 2302=item EV_USE_SELECT
1611 2303
1612If undefined or defined to be C<1>, libev will compile in support for the 2304If undefined or defined to be C<1>, libev will compile in support for the
1613C<select>(2) backend. No attempt at autodetection will be done: if no 2305C<select>(2) backend. No attempt at autodetection will be done: if no
1668 2360
1669=item EV_USE_DEVPOLL 2361=item EV_USE_DEVPOLL
1670 2362
1671reserved for future expansion, works like the USE symbols above. 2363reserved for future expansion, works like the USE symbols above.
1672 2364
2365=item EV_USE_INOTIFY
2366
2367If defined to be C<1>, libev will compile in support for the Linux inotify
2368interface to speed up C<ev_stat> watchers. Its actual availability will
2369be detected at runtime.
2370
1673=item EV_H 2371=item EV_H
1674 2372
1675The name of the F<ev.h> header file used to include it. The default if 2373The name of the F<ev.h> header file used to include it. The default if
1676undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This 2374undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This
1677can be used to virtually rename the F<ev.h> header file in case of conflicts. 2375can be used to virtually rename the F<ev.h> header file in case of conflicts.
1700will have the C<struct ev_loop *> as first argument, and you can create 2398will have the C<struct ev_loop *> as first argument, and you can create
1701additional independent event loops. Otherwise there will be no support 2399additional independent event loops. Otherwise there will be no support
1702for multiple event loops and there is no first event loop pointer 2400for multiple event loops and there is no first event loop pointer
1703argument. Instead, all functions act on the single default loop. 2401argument. Instead, all functions act on the single default loop.
1704 2402
2403=item EV_MINPRI
2404
2405=item EV_MAXPRI
2406
2407The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2408C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2409provide for more priorities by overriding those symbols (usually defined
2410to be C<-2> and C<2>, respectively).
2411
2412When doing priority-based operations, libev usually has to linearly search
2413all the priorities, so having many of them (hundreds) uses a lot of space
2414and time, so using the defaults of five priorities (-2 .. +2) is usually
2415fine.
2416
2417If your embedding app does not need any priorities, defining these both to
2418C<0> will save some memory and cpu.
2419
1705=item EV_PERIODICS 2420=item EV_PERIODIC_ENABLE
1706 2421
1707If undefined or defined to be C<1>, then periodic timers are supported, 2422If undefined or defined to be C<1>, then periodic timers are supported. If
1708otherwise not. This saves a few kb of code. 2423defined to be C<0>, then they are not. Disabling them saves a few kB of
2424code.
2425
2426=item EV_IDLE_ENABLE
2427
2428If undefined or defined to be C<1>, then idle watchers are supported. If
2429defined to be C<0>, then they are not. Disabling them saves a few kB of
2430code.
2431
2432=item EV_EMBED_ENABLE
2433
2434If undefined or defined to be C<1>, then embed watchers are supported. If
2435defined to be C<0>, then they are not.
2436
2437=item EV_STAT_ENABLE
2438
2439If undefined or defined to be C<1>, then stat watchers are supported. If
2440defined to be C<0>, then they are not.
2441
2442=item EV_FORK_ENABLE
2443
2444If undefined or defined to be C<1>, then fork watchers are supported. If
2445defined to be C<0>, then they are not.
2446
2447=item EV_MINIMAL
2448
2449If you need to shave off some kilobytes of code at the expense of some
2450speed, define this symbol to C<1>. Currently only used for gcc to override
2451some inlining decisions, saves roughly 30% codesize of amd64.
2452
2453=item EV_PID_HASHSIZE
2454
2455C<ev_child> watchers use a small hash table to distribute workload by
2456pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2457than enough. If you need to manage thousands of children you might want to
2458increase this value (I<must> be a power of two).
2459
2460=item EV_INOTIFY_HASHSIZE
2461
2462C<ev_staz> watchers use a small hash table to distribute workload by
2463inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2464usually more than enough. If you need to manage thousands of C<ev_stat>
2465watchers you might want to increase this value (I<must> be a power of
2466two).
1709 2467
1710=item EV_COMMON 2468=item EV_COMMON
1711 2469
1712By default, all watchers have a C<void *data> member. By redefining 2470By default, all watchers have a C<void *data> member. By redefining
1713this macro to a something else you can include more and other types of 2471this macro to a something else you can include more and other types of
1726 2484
1727=item ev_set_cb (ev, cb) 2485=item ev_set_cb (ev, cb)
1728 2486
1729Can be used to change the callback member declaration in each watcher, 2487Can be used to change the callback member declaration in each watcher,
1730and the way callbacks are invoked and set. Must expand to a struct member 2488and the way callbacks are invoked and set. Must expand to a struct member
1731definition and a statement, respectively. See the F<ev.v> header file for 2489definition and a statement, respectively. See the F<ev.h> header file for
1732their default definitions. One possible use for overriding these is to 2490their default definitions. One possible use for overriding these is to
1733avoid the C<struct ev_loop *> as first argument in all cases, or to use 2491avoid the C<struct ev_loop *> as first argument in all cases, or to use
1734method calls instead of plain function calls in C++. 2492method calls instead of plain function calls in C++.
2493
2494=head2 EXPORTED API SYMBOLS
2495
2496If you need to re-export the API (e.g. via a dll) and you need a list of
2497exported symbols, you can use the provided F<Symbol.*> files which list
2498all public symbols, one per line:
2499
2500 Symbols.ev for libev proper
2501 Symbols.event for the libevent emulation
2502
2503This can also be used to rename all public symbols to avoid clashes with
2504multiple versions of libev linked together (which is obviously bad in
2505itself, but sometimes it is inconvinient to avoid this).
2506
2507A sed command like this will create wrapper C<#define>'s that you need to
2508include before including F<ev.h>:
2509
2510 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2511
2512This would create a file F<wrap.h> which essentially looks like this:
2513
2514 #define ev_backend myprefix_ev_backend
2515 #define ev_check_start myprefix_ev_check_start
2516 #define ev_check_stop myprefix_ev_check_stop
2517 ...
1735 2518
1736=head2 EXAMPLES 2519=head2 EXAMPLES
1737 2520
1738For a real-world example of a program the includes libev 2521For a real-world example of a program the includes libev
1739verbatim, you can have a look at the EV perl module 2522verbatim, you can have a look at the EV perl module
1742interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file 2525interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
1743will be compiled. It is pretty complex because it provides its own header 2526will be compiled. It is pretty complex because it provides its own header
1744file. 2527file.
1745 2528
1746The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 2529The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
1747that everybody includes and which overrides some autoconf choices: 2530that everybody includes and which overrides some configure choices:
1748 2531
2532 #define EV_MINIMAL 1
1749 #define EV_USE_POLL 0 2533 #define EV_USE_POLL 0
1750 #define EV_MULTIPLICITY 0 2534 #define EV_MULTIPLICITY 0
1751 #define EV_PERIODICS 0 2535 #define EV_PERIODIC_ENABLE 0
2536 #define EV_STAT_ENABLE 0
2537 #define EV_FORK_ENABLE 0
1752 #define EV_CONFIG_H <config.h> 2538 #define EV_CONFIG_H <config.h>
2539 #define EV_MINPRI 0
2540 #define EV_MAXPRI 0
1753 2541
1754 #include "ev++.h" 2542 #include "ev++.h"
1755 2543
1756And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 2544And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
1757 2545
1763 2551
1764In this section the complexities of (many of) the algorithms used inside 2552In this section the complexities of (many of) the algorithms used inside
1765libev will be explained. For complexity discussions about backends see the 2553libev will be explained. For complexity discussions about backends see the
1766documentation for C<ev_default_init>. 2554documentation for C<ev_default_init>.
1767 2555
2556All of the following are about amortised time: If an array needs to be
2557extended, libev needs to realloc and move the whole array, but this
2558happens asymptotically never with higher number of elements, so O(1) might
2559mean it might do a lengthy realloc operation in rare cases, but on average
2560it is much faster and asymptotically approaches constant time.
2561
1768=over 4 2562=over 4
1769 2563
1770=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2564=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
1771 2565
2566This means that, when you have a watcher that triggers in one hour and
2567there are 100 watchers that would trigger before that then inserting will
2568have to skip those 100 watchers.
2569
1772=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2570=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
1773 2571
2572That means that for changing a timer costs less than removing/adding them
2573as only the relative motion in the event queue has to be paid for.
2574
1774=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2575=item Starting io/check/prepare/idle/signal/child watchers: O(1)
1775 2576
2577These just add the watcher into an array or at the head of a list.
1776=item Stopping check/prepare/idle watchers: O(1) 2578=item Stopping check/prepare/idle watchers: O(1)
1777 2579
1778=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % 16)) 2580=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2581
2582These watchers are stored in lists then need to be walked to find the
2583correct watcher to remove. The lists are usually short (you don't usually
2584have many watchers waiting for the same fd or signal).
1779 2585
1780=item Finding the next timer per loop iteration: O(1) 2586=item Finding the next timer per loop iteration: O(1)
1781 2587
1782=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2588=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
1783 2589
2590A change means an I/O watcher gets started or stopped, which requires
2591libev to recalculate its status (and possibly tell the kernel).
2592
1784=item Activating one watcher: O(1) 2593=item Activating one watcher: O(1)
1785 2594
2595=item Priority handling: O(number_of_priorities)
2596
2597Priorities are implemented by allocating some space for each
2598priority. When doing priority-based operations, libev usually has to
2599linearly search all the priorities.
2600
1786=back 2601=back
1787 2602
1788 2603
1789=head1 AUTHOR 2604=head1 AUTHOR
1790 2605

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines