ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
Revision: 1.98
Committed: Sat Dec 22 06:10:25 2007 UTC (16 years, 4 months ago) by root
Branch: MAIN
Changes since 1.97: +5 -5 lines
Log Message:
*** empty log message ***

File Contents

# User Rev Content
1 root 1.1 =head1 NAME
2    
3     libev - a high performance full-featured event loop written in C
4    
5     =head1 SYNOPSIS
6    
7     #include <ev.h>
8    
9 root 1.54 =head1 EXAMPLE PROGRAM
10    
11     #include <ev.h>
12    
13 root 1.53 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    
51 root 1.1 =head1 DESCRIPTION
52    
53 root 1.69 The newest version of this document is also available as a html-formatted
54     web page you might find easier to navigate when reading it for the first
55     time: L<http://cvs.schmorp.de/libev/ev.html>.
56    
57 root 1.1 Libev is an event loop: you register interest in certain events (such as a
58 root 1.92 file descriptor being readable or a timeout occurring), and it will manage
59 root 1.4 these event sources and provide your program with events.
60 root 1.1
61     To do this, it must take more or less complete control over your process
62     (or thread) by executing the I<event loop> handler, and will then
63     communicate events via a callback mechanism.
64    
65     You register interest in certain events by registering so-called I<event
66     watchers>, which are relatively small C structures you initialise with the
67     details of the event, and then hand it over to libev by I<starting> the
68     watcher.
69    
70     =head1 FEATURES
71    
72 root 1.58 Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
73     BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
74     for file descriptor events (C<ev_io>), the Linux C<inotify> interface
75     (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
76     with customised rescheduling (C<ev_periodic>), synchronous signals
77     (C<ev_signal>), process status change events (C<ev_child>), and event
78     watchers dealing with the event loop mechanism itself (C<ev_idle>,
79 root 1.54 C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as
80     file watchers (C<ev_stat>) and even limited support for fork events
81     (C<ev_fork>).
82    
83     It also is quite fast (see this
84     L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
85     for example).
86 root 1.1
87     =head1 CONVENTIONS
88    
89 root 1.54 Libev is very configurable. In this manual the default configuration will
90     be described, which supports multiple event loops. For more info about
91     various configuration options please have a look at B<EMBED> section in
92     this manual. If libev was configured without support for multiple event
93     loops, then all functions taking an initial argument of name C<loop>
94     (which is always of type C<struct ev_loop *>) will not have this argument.
95 root 1.1
96 root 1.17 =head1 TIME REPRESENTATION
97 root 1.1
98 root 1.2 Libev represents time as a single floating point number, representing the
99     (fractional) number of seconds since the (POSIX) epoch (somewhere near
100     the beginning of 1970, details are complicated, don't ask). This type is
101 root 1.1 called C<ev_tstamp>, which is what you should use too. It usually aliases
102 root 1.34 to the C<double> type in C, and when you need to do any calculations on
103 root 1.86 it, you should treat it as some floatingpoint value. Unlike the name
104     component C<stamp> might indicate, it is also used for time differences
105     throughout libev.
106 root 1.34
107 root 1.17 =head1 GLOBAL FUNCTIONS
108    
109 root 1.18 These functions can be called anytime, even before initialising the
110     library in any way.
111    
112 root 1.1 =over 4
113    
114     =item ev_tstamp ev_time ()
115    
116 root 1.26 Returns the current time as libev would use it. Please note that the
117     C<ev_now> function is usually faster and also often returns the timestamp
118     you actually want to know.
119 root 1.1
120 root 1.97 =item ev_sleep (ev_tstamp interval)
121    
122     Sleep for the given interval: The current thread will be blocked until
123     either it is interrupted or the given time interval has passed. Basically
124     this is a subsecond-resolution C<sleep ()>.
125    
126 root 1.1 =item int ev_version_major ()
127    
128     =item int ev_version_minor ()
129    
130 root 1.80 You can find out the major and minor ABI version numbers of the library
131 root 1.1 you linked against by calling the functions C<ev_version_major> and
132     C<ev_version_minor>. If you want, you can compare against the global
133     symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
134     version of the library your program was compiled against.
135    
136 root 1.80 These version numbers refer to the ABI version of the library, not the
137     release version.
138 root 1.79
139 root 1.9 Usually, it's a good idea to terminate if the major versions mismatch,
140 root 1.79 as this indicates an incompatible change. Minor versions are usually
141 root 1.1 compatible to older versions, so a larger minor version alone is usually
142     not a problem.
143    
144 root 1.54 Example: Make sure we haven't accidentally been linked against the wrong
145     version.
146 root 1.34
147     assert (("libev version mismatch",
148     ev_version_major () == EV_VERSION_MAJOR
149     && ev_version_minor () >= EV_VERSION_MINOR));
150    
151 root 1.31 =item unsigned int ev_supported_backends ()
152    
153     Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
154     value) compiled into this binary of libev (independent of their
155     availability on the system you are running on). See C<ev_default_loop> for
156     a description of the set values.
157    
158 root 1.34 Example: make sure we have the epoll method, because yeah this is cool and
159     a must have and can we have a torrent of it please!!!11
160    
161     assert (("sorry, no epoll, no sex",
162     ev_supported_backends () & EVBACKEND_EPOLL));
163    
164 root 1.31 =item unsigned int ev_recommended_backends ()
165    
166     Return the set of all backends compiled into this binary of libev and also
167     recommended for this platform. This set is often smaller than the one
168     returned by C<ev_supported_backends>, as for example kqueue is broken on
169     most BSDs and will not be autodetected unless you explicitly request it
170     (assuming you know what you are doing). This is the set of backends that
171 root 1.33 libev will probe for if you specify no backends explicitly.
172 root 1.31
173 root 1.35 =item unsigned int ev_embeddable_backends ()
174    
175     Returns the set of backends that are embeddable in other event loops. This
176     is the theoretical, all-platform, value. To find which backends
177     might be supported on the current system, you would need to look at
178     C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
179     recommended ones.
180    
181     See the description of C<ev_embed> watchers for more info.
182    
183 root 1.59 =item ev_set_allocator (void *(*cb)(void *ptr, long size))
184 root 1.1
185 root 1.59 Sets the allocation function to use (the prototype is similar - the
186     semantics is identical - to the realloc C function). It is used to
187     allocate and free memory (no surprises here). If it returns zero when
188     memory needs to be allocated, the library might abort or take some
189     potentially destructive action. The default is your system realloc
190     function.
191 root 1.1
192     You could override this function in high-availability programs to, say,
193     free some memory if it cannot allocate memory, to use a special allocator,
194     or even to sleep a while and retry until some memory is available.
195    
196 root 1.54 Example: Replace the libev allocator with one that waits a bit and then
197     retries).
198 root 1.34
199     static void *
200 root 1.52 persistent_realloc (void *ptr, size_t size)
201 root 1.34 {
202     for (;;)
203     {
204     void *newptr = realloc (ptr, size);
205    
206     if (newptr)
207     return newptr;
208    
209     sleep (60);
210     }
211     }
212    
213     ...
214     ev_set_allocator (persistent_realloc);
215    
216 root 1.1 =item ev_set_syserr_cb (void (*cb)(const char *msg));
217    
218     Set the callback function to call on a retryable syscall error (such
219     as failed select, poll, epoll_wait). The message is a printable string
220     indicating the system call or subsystem causing the problem. If this
221     callback is set, then libev will expect it to remedy the sitution, no
222 root 1.7 matter what, when it returns. That is, libev will generally retry the
223 root 1.1 requested operation, or, if the condition doesn't go away, do bad stuff
224     (such as abort).
225    
226 root 1.54 Example: This is basically the same thing that libev does internally, too.
227 root 1.34
228     static void
229     fatal_error (const char *msg)
230     {
231     perror (msg);
232     abort ();
233     }
234    
235     ...
236     ev_set_syserr_cb (fatal_error);
237    
238 root 1.1 =back
239    
240     =head1 FUNCTIONS CONTROLLING THE EVENT LOOP
241    
242     An event loop is described by a C<struct ev_loop *>. The library knows two
243     types of such loops, the I<default> loop, which supports signals and child
244     events, and dynamically created loops which do not.
245    
246     If you use threads, a common model is to run the default event loop
247 root 1.17 in your main thread (or in a separate thread) and for each thread you
248 root 1.7 create, you also create another event loop. Libev itself does no locking
249     whatsoever, so if you mix calls to the same event loop in different
250     threads, make sure you lock (this is usually a bad idea, though, even if
251 root 1.9 done correctly, because it's hideous and inefficient).
252 root 1.1
253     =over 4
254    
255     =item struct ev_loop *ev_default_loop (unsigned int flags)
256    
257     This will initialise the default event loop if it hasn't been initialised
258     yet and return it. If the default loop could not be initialised, returns
259     false. If it already was initialised it simply returns it (and ignores the
260 root 1.31 flags. If that is troubling you, check C<ev_backend ()> afterwards).
261 root 1.1
262     If you don't know what event loop to use, use the one returned from this
263     function.
264    
265     The flags argument can be used to specify special behaviour or specific
266 root 1.33 backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
267 root 1.1
268 root 1.33 The following flags are supported:
269 root 1.1
270     =over 4
271    
272 root 1.10 =item C<EVFLAG_AUTO>
273 root 1.1
274 root 1.9 The default flags value. Use this if you have no clue (it's the right
275 root 1.1 thing, believe me).
276    
277 root 1.10 =item C<EVFLAG_NOENV>
278 root 1.1
279 root 1.8 If this flag bit is ored into the flag value (or the program runs setuid
280     or setgid) then libev will I<not> look at the environment variable
281     C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
282     override the flags completely if it is found in the environment. This is
283     useful to try out specific backends to test their performance, or to work
284     around bugs.
285 root 1.1
286 root 1.62 =item C<EVFLAG_FORKCHECK>
287    
288     Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
289     a fork, you can also make libev check for a fork in each iteration by
290     enabling this flag.
291    
292     This works by calling C<getpid ()> on every iteration of the loop,
293     and thus this might slow down your event loop if you do a lot of loop
294 ayin 1.65 iterations and little real work, but is usually not noticeable (on my
295 root 1.62 Linux system for example, C<getpid> is actually a simple 5-insn sequence
296     without a syscall and thus I<very> fast, but my Linux system also has
297     C<pthread_atfork> which is even faster).
298    
299     The big advantage of this flag is that you can forget about fork (and
300     forget about forgetting to tell libev about forking) when you use this
301     flag.
302    
303     This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
304     environment variable.
305    
306 root 1.31 =item C<EVBACKEND_SELECT> (value 1, portable select backend)
307 root 1.1
308 root 1.29 This is your standard select(2) backend. Not I<completely> standard, as
309     libev tries to roll its own fd_set with no limits on the number of fds,
310     but if that fails, expect a fairly low limit on the number of fds when
311     using this backend. It doesn't scale too well (O(highest_fd)), but its usually
312     the fastest backend for a low number of fds.
313 root 1.1
314 root 1.31 =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
315 root 1.1
316 root 1.29 And this is your standard poll(2) backend. It's more complicated than
317     select, but handles sparse fds better and has no artificial limit on the
318     number of fds you can use (except it will slow down considerably with a
319     lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
320 root 1.1
321 root 1.31 =item C<EVBACKEND_EPOLL> (value 4, Linux)
322 root 1.1
323 root 1.29 For few fds, this backend is a bit little slower than poll and select,
324 root 1.94 but it scales phenomenally better. While poll and select usually scale
325     like O(total_fds) where n is the total number of fds (or the highest fd),
326     epoll scales either O(1) or O(active_fds). The epoll design has a number
327     of shortcomings, such as silently dropping events in some hard-to-detect
328 ayin 1.96 cases and rewiring a syscall per fd change, no fork support and bad
329 root 1.94 support for dup:
330 root 1.1
331 root 1.94 While stopping, setting and starting an I/O watcher in the same iteration
332     will result in some caching, there is still a syscall per such incident
333 root 1.29 (because the fd could point to a different file description now), so its
334 root 1.94 best to avoid that. Also, C<dup ()>'ed file descriptors might not work
335     very well if you register events for both fds.
336 root 1.29
337 root 1.32 Please note that epoll sometimes generates spurious notifications, so you
338     need to use non-blocking I/O or other means to avoid blocking when no data
339     (or space) is available.
340    
341 root 1.31 =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
342 root 1.29
343     Kqueue deserves special mention, as at the time of this writing, it
344 root 1.94 was broken on I<all> BSDs (usually it doesn't work with anything but
345     sockets and pipes, except on Darwin, where of course it's completely
346     useless. On NetBSD, it seems to work for all the FD types I tested, so it
347     is used by default there). For this reason it's not being "autodetected"
348 root 1.33 unless you explicitly specify it explicitly in the flags (i.e. using
349 root 1.94 C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
350     system like NetBSD.
351 root 1.29
352     It scales in the same way as the epoll backend, but the interface to the
353 root 1.94 kernel is more efficient (which says nothing about its actual speed,
354     of course). While stopping, setting and starting an I/O watcher does
355     never cause an extra syscall as with epoll, it still adds up to two event
356     changes per incident, support for C<fork ()> is very bad and it drops fds
357     silently in similarly hard-to-detetc cases.
358 root 1.29
359 root 1.31 =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
360 root 1.29
361     This is not implemented yet (and might never be).
362    
363 root 1.31 =item C<EVBACKEND_PORT> (value 32, Solaris 10)
364 root 1.29
365 root 1.94 This uses the Solaris 10 event port mechanism. As with everything on Solaris,
366 root 1.29 it's really slow, but it still scales very well (O(active_fds)).
367    
368 root 1.94 Please note that solaris event ports can deliver a lot of spurious
369 root 1.32 notifications, so you need to use non-blocking I/O or other means to avoid
370     blocking when no data (or space) is available.
371    
372 root 1.31 =item C<EVBACKEND_ALL>
373 root 1.29
374     Try all backends (even potentially broken ones that wouldn't be tried
375     with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
376 root 1.31 C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
377 root 1.1
378     =back
379    
380 root 1.29 If one or more of these are ored into the flags value, then only these
381     backends will be tried (in the reverse order as given here). If none are
382     specified, most compiled-in backend will be tried, usually in reverse
383     order of their flag values :)
384    
385 root 1.33 The most typical usage is like this:
386    
387     if (!ev_default_loop (0))
388     fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
389    
390     Restrict libev to the select and poll backends, and do not allow
391     environment settings to be taken into account:
392    
393     ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
394    
395     Use whatever libev has to offer, but make sure that kqueue is used if
396     available (warning, breaks stuff, best use only with your own private
397     event loop and only if you know the OS supports your types of fds):
398    
399     ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
400    
401 root 1.1 =item struct ev_loop *ev_loop_new (unsigned int flags)
402    
403     Similar to C<ev_default_loop>, but always creates a new event loop that is
404     always distinct from the default loop. Unlike the default loop, it cannot
405     handle signal and child watchers, and attempts to do so will be greeted by
406     undefined behaviour (or a failed assertion if assertions are enabled).
407    
408 root 1.54 Example: Try to create a event loop that uses epoll and nothing else.
409 root 1.34
410     struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
411     if (!epoller)
412     fatal ("no epoll found here, maybe it hides under your chair");
413    
414 root 1.1 =item ev_default_destroy ()
415    
416     Destroys the default loop again (frees all memory and kernel state
417 root 1.37 etc.). None of the active event watchers will be stopped in the normal
418     sense, so e.g. C<ev_is_active> might still return true. It is your
419     responsibility to either stop all watchers cleanly yoursef I<before>
420     calling this function, or cope with the fact afterwards (which is usually
421 root 1.87 the easiest thing, you can just ignore the watchers and/or C<free ()> them
422 root 1.37 for example).
423 root 1.1
424 ayin 1.88 Note that certain global state, such as signal state, will not be freed by
425 root 1.87 this function, and related watchers (such as signal and child watchers)
426     would need to be stopped manually.
427    
428     In general it is not advisable to call this function except in the
429     rare occasion where you really need to free e.g. the signal handling
430     pipe fds. If you need dynamically allocated loops it is better to use
431     C<ev_loop_new> and C<ev_loop_destroy>).
432    
433 root 1.1 =item ev_loop_destroy (loop)
434    
435     Like C<ev_default_destroy>, but destroys an event loop created by an
436     earlier call to C<ev_loop_new>.
437    
438     =item ev_default_fork ()
439    
440     This function reinitialises the kernel state for backends that have
441     one. Despite the name, you can call it anytime, but it makes most sense
442     after forking, in either the parent or child process (or both, but that
443     again makes little sense).
444    
445 root 1.30 You I<must> call this function in the child process after forking if and
446     only if you want to use the event library in both processes. If you just
447     fork+exec, you don't have to call it.
448 root 1.1
449 root 1.9 The function itself is quite fast and it's usually not a problem to call
450 root 1.1 it just in case after a fork. To make this easy, the function will fit in
451     quite nicely into a call to C<pthread_atfork>:
452    
453     pthread_atfork (0, 0, ev_default_fork);
454    
455 root 1.31 At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
456     without calling this function, so if you force one of those backends you
457     do not need to care.
458    
459 root 1.1 =item ev_loop_fork (loop)
460    
461     Like C<ev_default_fork>, but acts on an event loop created by
462     C<ev_loop_new>. Yes, you have to call this on every allocated event loop
463     after fork, and how you do this is entirely your own problem.
464    
465 root 1.66 =item unsigned int ev_loop_count (loop)
466    
467     Returns the count of loop iterations for the loop, which is identical to
468     the number of times libev did poll for new events. It starts at C<0> and
469     happily wraps around with enough iterations.
470    
471     This value can sometimes be useful as a generation counter of sorts (it
472     "ticks" the number of loop iterations), as it roughly corresponds with
473     C<ev_prepare> and C<ev_check> calls.
474    
475 root 1.31 =item unsigned int ev_backend (loop)
476 root 1.1
477 root 1.31 Returns one of the C<EVBACKEND_*> flags indicating the event backend in
478 root 1.1 use.
479    
480 root 1.9 =item ev_tstamp ev_now (loop)
481 root 1.1
482     Returns the current "event loop time", which is the time the event loop
483 root 1.34 received events and started processing them. This timestamp does not
484     change as long as callbacks are being processed, and this is also the base
485     time used for relative timers. You can treat it as the timestamp of the
486 root 1.92 event occurring (or more correctly, libev finding out about it).
487 root 1.1
488     =item ev_loop (loop, int flags)
489    
490     Finally, this is it, the event handler. This function usually is called
491     after you initialised all your watchers and you want to start handling
492     events.
493    
494 root 1.33 If the flags argument is specified as C<0>, it will not return until
495     either no event watchers are active anymore or C<ev_unloop> was called.
496 root 1.1
497 root 1.34 Please note that an explicit C<ev_unloop> is usually better than
498     relying on all watchers to be stopped when deciding when a program has
499     finished (especially in interactive programs), but having a program that
500     automatically loops as long as it has to and no longer by virtue of
501     relying on its watchers stopping correctly is a thing of beauty.
502    
503 root 1.1 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
504     those events and any outstanding ones, but will not block your process in
505 root 1.9 case there are no events and will return after one iteration of the loop.
506 root 1.1
507     A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
508     neccessary) and will handle those and any outstanding ones. It will block
509 root 1.9 your process until at least one new event arrives, and will return after
510 root 1.33 one iteration of the loop. This is useful if you are waiting for some
511     external event in conjunction with something not expressible using other
512     libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
513     usually a better approach for this kind of thing.
514    
515     Here are the gory details of what C<ev_loop> does:
516    
517 root 1.77 - Before the first iteration, call any pending watchers.
518 root 1.33 * If there are no active watchers (reference count is zero), return.
519 root 1.77 - Queue all prepare watchers and then call all outstanding watchers.
520 root 1.33 - If we have been forked, recreate the kernel state.
521     - Update the kernel state with all outstanding changes.
522     - Update the "event loop time".
523     - Calculate for how long to block.
524     - Block the process, waiting for any events.
525     - Queue all outstanding I/O (fd) events.
526     - Update the "event loop time" and do time jump handling.
527     - Queue all outstanding timers.
528     - Queue all outstanding periodics.
529     - If no events are pending now, queue all idle watchers.
530     - Queue all check watchers.
531     - Call all queued watchers in reverse order (i.e. check watchers first).
532     Signals and child watchers are implemented as I/O watchers, and will
533     be handled here by queueing them when their watcher gets executed.
534     - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
535     were used, return, otherwise continue with step *.
536 root 1.27
537 root 1.54 Example: Queue some jobs and then loop until no events are outsanding
538 root 1.34 anymore.
539    
540     ... queue jobs here, make sure they register event watchers as long
541     ... as they still have work to do (even an idle watcher will do..)
542     ev_loop (my_loop, 0);
543     ... jobs done. yeah!
544    
545 root 1.1 =item ev_unloop (loop, how)
546    
547 root 1.9 Can be used to make a call to C<ev_loop> return early (but only after it
548     has processed all outstanding events). The C<how> argument must be either
549 root 1.25 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
550 root 1.9 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
551 root 1.1
552     =item ev_ref (loop)
553    
554     =item ev_unref (loop)
555    
556 root 1.9 Ref/unref can be used to add or remove a reference count on the event
557     loop: Every watcher keeps one reference, and as long as the reference
558     count is nonzero, C<ev_loop> will not return on its own. If you have
559     a watcher you never unregister that should not keep C<ev_loop> from
560     returning, ev_unref() after starting, and ev_ref() before stopping it. For
561     example, libev itself uses this for its internal signal pipe: It is not
562     visible to the libev user and should not keep C<ev_loop> from exiting if
563     no event watchers registered by it are active. It is also an excellent
564     way to do this for generic recurring timers or from within third-party
565     libraries. Just remember to I<unref after start> and I<ref before stop>.
566 root 1.1
567 root 1.54 Example: Create a signal watcher, but keep it from keeping C<ev_loop>
568 root 1.34 running when nothing else is active.
569    
570 root 1.54 struct ev_signal exitsig;
571 root 1.34 ev_signal_init (&exitsig, sig_cb, SIGINT);
572 root 1.54 ev_signal_start (loop, &exitsig);
573     evf_unref (loop);
574 root 1.34
575 root 1.54 Example: For some weird reason, unregister the above signal handler again.
576 root 1.34
577 root 1.54 ev_ref (loop);
578     ev_signal_stop (loop, &exitsig);
579 root 1.34
580 root 1.97 =item ev_set_io_collect_interval (loop, ev_tstamp interval)
581    
582     =item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
583    
584     These advanced functions influence the time that libev will spend waiting
585     for events. Both are by default C<0>, meaning that libev will try to
586     invoke timer/periodic callbacks and I/O callbacks with minimum latency.
587    
588     Setting these to a higher value (the C<interval> I<must> be >= C<0>)
589     allows libev to delay invocation of I/O and timer/periodic callbacks to
590     increase efficiency of loop iterations.
591    
592     The background is that sometimes your program runs just fast enough to
593     handle one (or very few) event(s) per loop iteration. While this makes
594     the program responsive, it also wastes a lot of CPU time to poll for new
595     events, especially with backends like C<select ()> which have a high
596     overhead for the actual polling but can deliver many events at once.
597    
598     By setting a higher I<io collect interval> you allow libev to spend more
599     time collecting I/O events, so you can handle more events per iteration,
600     at the cost of increasing latency. Timeouts (both C<ev_periodic> and
601     C<ev_timer>) will be not affected.
602    
603     Likewise, by setting a higher I<timeout collect interval> you allow libev
604     to spend more time collecting timeouts, at the expense of increased
605     latency (the watcher callback will be called later). C<ev_io> watchers
606     will not be affected.
607    
608 root 1.98 Many (busy) programs can usually benefit by setting the io collect
609     interval to a value near C<0.1> or so, which is often enough for
610     interactive servers (of course not for games), likewise for timeouts. It
611     usually doesn't make much sense to set it to a lower value than C<0.01>,
612     as this approsaches the timing granularity of most systems.
613 root 1.97
614 root 1.1 =back
615    
616 root 1.42
617 root 1.1 =head1 ANATOMY OF A WATCHER
618    
619     A watcher is a structure that you create and register to record your
620     interest in some event. For instance, if you want to wait for STDIN to
621 root 1.10 become readable, you would create an C<ev_io> watcher for that:
622 root 1.1
623     static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
624     {
625     ev_io_stop (w);
626     ev_unloop (loop, EVUNLOOP_ALL);
627     }
628    
629     struct ev_loop *loop = ev_default_loop (0);
630     struct ev_io stdin_watcher;
631     ev_init (&stdin_watcher, my_cb);
632     ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
633     ev_io_start (loop, &stdin_watcher);
634     ev_loop (loop, 0);
635    
636     As you can see, you are responsible for allocating the memory for your
637     watcher structures (and it is usually a bad idea to do this on the stack,
638     although this can sometimes be quite valid).
639    
640     Each watcher structure must be initialised by a call to C<ev_init
641     (watcher *, callback)>, which expects a callback to be provided. This
642     callback gets invoked each time the event occurs (or, in the case of io
643     watchers, each time the event loop detects that the file descriptor given
644     is readable and/or writable).
645    
646     Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
647     with arguments specific to this watcher type. There is also a macro
648     to combine initialisation and setting in one call: C<< ev_<type>_init
649     (watcher *, callback, ...) >>.
650    
651     To make the watcher actually watch out for events, you have to start it
652     with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
653     *) >>), and you can stop watching for events at any time by calling the
654     corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
655    
656     As long as your watcher is active (has been started but not stopped) you
657     must not touch the values stored in it. Most specifically you must never
658 root 1.36 reinitialise it or call its C<set> macro.
659 root 1.1
660     Each and every callback receives the event loop pointer as first, the
661     registered watcher structure as second, and a bitset of received events as
662     third argument.
663    
664 root 1.14 The received events usually include a single bit per event type received
665 root 1.1 (you can receive multiple events at the same time). The possible bit masks
666     are:
667    
668     =over 4
669    
670 root 1.10 =item C<EV_READ>
671 root 1.1
672 root 1.10 =item C<EV_WRITE>
673 root 1.1
674 root 1.10 The file descriptor in the C<ev_io> watcher has become readable and/or
675 root 1.1 writable.
676    
677 root 1.10 =item C<EV_TIMEOUT>
678 root 1.1
679 root 1.10 The C<ev_timer> watcher has timed out.
680 root 1.1
681 root 1.10 =item C<EV_PERIODIC>
682 root 1.1
683 root 1.10 The C<ev_periodic> watcher has timed out.
684 root 1.1
685 root 1.10 =item C<EV_SIGNAL>
686 root 1.1
687 root 1.10 The signal specified in the C<ev_signal> watcher has been received by a thread.
688 root 1.1
689 root 1.10 =item C<EV_CHILD>
690 root 1.1
691 root 1.10 The pid specified in the C<ev_child> watcher has received a status change.
692 root 1.1
693 root 1.48 =item C<EV_STAT>
694    
695     The path specified in the C<ev_stat> watcher changed its attributes somehow.
696    
697 root 1.10 =item C<EV_IDLE>
698 root 1.1
699 root 1.10 The C<ev_idle> watcher has determined that you have nothing better to do.
700 root 1.1
701 root 1.10 =item C<EV_PREPARE>
702 root 1.1
703 root 1.10 =item C<EV_CHECK>
704 root 1.1
705 root 1.10 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
706     to gather new events, and all C<ev_check> watchers are invoked just after
707 root 1.1 C<ev_loop> has gathered them, but before it invokes any callbacks for any
708     received events. Callbacks of both watcher types can start and stop as
709     many watchers as they want, and all of them will be taken into account
710 root 1.10 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
711 root 1.1 C<ev_loop> from blocking).
712    
713 root 1.50 =item C<EV_EMBED>
714    
715     The embedded event loop specified in the C<ev_embed> watcher needs attention.
716    
717     =item C<EV_FORK>
718    
719     The event loop has been resumed in the child process after fork (see
720     C<ev_fork>).
721    
722 root 1.10 =item C<EV_ERROR>
723 root 1.1
724     An unspecified error has occured, the watcher has been stopped. This might
725     happen because the watcher could not be properly started because libev
726     ran out of memory, a file descriptor was found to be closed or any other
727     problem. You best act on it by reporting the problem and somehow coping
728     with the watcher being stopped.
729    
730     Libev will usually signal a few "dummy" events together with an error,
731     for example it might indicate that a fd is readable or writable, and if
732     your callbacks is well-written it can just attempt the operation and cope
733     with the error from read() or write(). This will not work in multithreaded
734     programs, though, so beware.
735    
736     =back
737    
738 root 1.42 =head2 GENERIC WATCHER FUNCTIONS
739 root 1.36
740     In the following description, C<TYPE> stands for the watcher type,
741     e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
742    
743     =over 4
744    
745     =item C<ev_init> (ev_TYPE *watcher, callback)
746    
747     This macro initialises the generic portion of a watcher. The contents
748     of the watcher object can be arbitrary (so C<malloc> will do). Only
749     the generic parts of the watcher are initialised, you I<need> to call
750     the type-specific C<ev_TYPE_set> macro afterwards to initialise the
751     type-specific parts. For each type there is also a C<ev_TYPE_init> macro
752     which rolls both calls into one.
753    
754     You can reinitialise a watcher at any time as long as it has been stopped
755     (or never started) and there are no pending events outstanding.
756    
757 root 1.42 The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,
758 root 1.36 int revents)>.
759    
760     =item C<ev_TYPE_set> (ev_TYPE *, [args])
761    
762     This macro initialises the type-specific parts of a watcher. You need to
763     call C<ev_init> at least once before you call this macro, but you can
764     call C<ev_TYPE_set> any number of times. You must not, however, call this
765     macro on a watcher that is active (it can be pending, however, which is a
766     difference to the C<ev_init> macro).
767    
768     Although some watcher types do not have type-specific arguments
769     (e.g. C<ev_prepare>) you still need to call its C<set> macro.
770    
771     =item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
772    
773     This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
774     calls into a single call. This is the most convinient method to initialise
775     a watcher. The same limitations apply, of course.
776    
777     =item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
778    
779     Starts (activates) the given watcher. Only active watchers will receive
780     events. If the watcher is already active nothing will happen.
781    
782     =item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
783    
784     Stops the given watcher again (if active) and clears the pending
785     status. It is possible that stopped watchers are pending (for example,
786     non-repeating timers are being stopped when they become pending), but
787     C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If
788     you want to free or reuse the memory used by the watcher it is therefore a
789     good idea to always call its C<ev_TYPE_stop> function.
790    
791     =item bool ev_is_active (ev_TYPE *watcher)
792    
793     Returns a true value iff the watcher is active (i.e. it has been started
794     and not yet been stopped). As long as a watcher is active you must not modify
795     it.
796    
797     =item bool ev_is_pending (ev_TYPE *watcher)
798    
799     Returns a true value iff the watcher is pending, (i.e. it has outstanding
800     events but its callback has not yet been invoked). As long as a watcher
801     is pending (but not active) you must not call an init function on it (but
802 root 1.73 C<ev_TYPE_set> is safe), you must not change its priority, and you must
803     make sure the watcher is available to libev (e.g. you cannot C<free ()>
804     it).
805 root 1.36
806 root 1.55 =item callback ev_cb (ev_TYPE *watcher)
807 root 1.36
808     Returns the callback currently set on the watcher.
809    
810     =item ev_cb_set (ev_TYPE *watcher, callback)
811    
812     Change the callback. You can change the callback at virtually any time
813     (modulo threads).
814    
815 root 1.67 =item ev_set_priority (ev_TYPE *watcher, priority)
816    
817     =item int ev_priority (ev_TYPE *watcher)
818    
819     Set and query the priority of the watcher. The priority is a small
820     integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
821     (default: C<-2>). Pending watchers with higher priority will be invoked
822     before watchers with lower priority, but priority will not keep watchers
823     from being executed (except for C<ev_idle> watchers).
824    
825     This means that priorities are I<only> used for ordering callback
826     invocation after new events have been received. This is useful, for
827     example, to reduce latency after idling, or more often, to bind two
828     watchers on the same event and make sure one is called first.
829    
830     If you need to suppress invocation when higher priority events are pending
831     you need to look at C<ev_idle> watchers, which provide this functionality.
832    
833 root 1.73 You I<must not> change the priority of a watcher as long as it is active or
834     pending.
835    
836 root 1.67 The default priority used by watchers when no priority has been set is
837     always C<0>, which is supposed to not be too high and not be too low :).
838    
839     Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
840     fine, as long as you do not mind that the priority value you query might
841     or might not have been adjusted to be within valid range.
842    
843 root 1.74 =item ev_invoke (loop, ev_TYPE *watcher, int revents)
844    
845     Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
846     C<loop> nor C<revents> need to be valid as long as the watcher callback
847     can deal with that fact.
848    
849     =item int ev_clear_pending (loop, ev_TYPE *watcher)
850    
851     If the watcher is pending, this function returns clears its pending status
852     and returns its C<revents> bitset (as if its callback was invoked). If the
853     watcher isn't pending it does nothing and returns C<0>.
854    
855 root 1.36 =back
856    
857    
858 root 1.1 =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
859    
860     Each watcher has, by default, a member C<void *data> that you can change
861 root 1.14 and read at any time, libev will completely ignore it. This can be used
862 root 1.1 to associate arbitrary data with your watcher. If you need more data and
863     don't want to allocate memory and store a pointer to it in that data
864     member, you can also "subclass" the watcher type and provide your own
865     data:
866    
867     struct my_io
868     {
869     struct ev_io io;
870     int otherfd;
871     void *somedata;
872     struct whatever *mostinteresting;
873     }
874    
875     And since your callback will be called with a pointer to the watcher, you
876     can cast it back to your own type:
877    
878     static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
879     {
880     struct my_io *w = (struct my_io *)w_;
881     ...
882     }
883    
884 root 1.55 More interesting and less C-conformant ways of casting your callback type
885     instead have been omitted.
886    
887     Another common scenario is having some data structure with multiple
888     watchers:
889    
890     struct my_biggy
891     {
892     int some_data;
893     ev_timer t1;
894     ev_timer t2;
895     }
896    
897     In this case getting the pointer to C<my_biggy> is a bit more complicated,
898     you need to use C<offsetof>:
899    
900     #include <stddef.h>
901    
902     static void
903     t1_cb (EV_P_ struct ev_timer *w, int revents)
904     {
905     struct my_biggy big = (struct my_biggy *
906     (((char *)w) - offsetof (struct my_biggy, t1));
907     }
908    
909     static void
910     t2_cb (EV_P_ struct ev_timer *w, int revents)
911     {
912     struct my_biggy big = (struct my_biggy *
913     (((char *)w) - offsetof (struct my_biggy, t2));
914     }
915 root 1.1
916    
917     =head1 WATCHER TYPES
918    
919     This section describes each watcher in detail, but will not repeat
920 root 1.48 information given in the last section. Any initialisation/set macros,
921     functions and members specific to the watcher type are explained.
922    
923     Members are additionally marked with either I<[read-only]>, meaning that,
924     while the watcher is active, you can look at the member and expect some
925     sensible content, but you must not modify it (you can modify it while the
926     watcher is stopped to your hearts content), or I<[read-write]>, which
927     means you can expect it to have some sensible content while the watcher
928     is active, but you can also modify it. Modifying it may not do something
929     sensible or take immediate effect (or do anything at all), but libev will
930     not crash or malfunction in any way.
931 root 1.1
932 root 1.34
933 root 1.42 =head2 C<ev_io> - is this file descriptor readable or writable?
934 root 1.1
935 root 1.4 I/O watchers check whether a file descriptor is readable or writable
936 root 1.42 in each iteration of the event loop, or, more precisely, when reading
937     would not block the process and writing would at least be able to write
938     some data. This behaviour is called level-triggering because you keep
939     receiving events as long as the condition persists. Remember you can stop
940     the watcher if you don't want to act on the event and neither want to
941     receive future events.
942 root 1.1
943 root 1.23 In general you can register as many read and/or write event watchers per
944 root 1.8 fd as you want (as long as you don't confuse yourself). Setting all file
945     descriptors to non-blocking mode is also usually a good idea (but not
946     required if you know what you are doing).
947    
948     You have to be careful with dup'ed file descriptors, though. Some backends
949     (the linux epoll backend is a notable example) cannot handle dup'ed file
950     descriptors correctly if you register interest in two or more fds pointing
951 root 1.42 to the same underlying file/socket/etc. description (that is, they share
952 root 1.24 the same underlying "file open").
953 root 1.8
954     If you must do this, then force the use of a known-to-be-good backend
955 root 1.31 (at the time of this writing, this includes only C<EVBACKEND_SELECT> and
956     C<EVBACKEND_POLL>).
957 root 1.8
958 root 1.42 Another thing you have to watch out for is that it is quite easy to
959     receive "spurious" readyness notifications, that is your callback might
960     be called with C<EV_READ> but a subsequent C<read>(2) will actually block
961     because there is no data. Not only are some backends known to create a
962     lot of those (for example solaris ports), it is very easy to get into
963     this situation even with a relatively standard program structure. Thus
964     it is best to always use non-blocking I/O: An extra C<read>(2) returning
965     C<EAGAIN> is far preferable to a program hanging until some data arrives.
966    
967     If you cannot run the fd in non-blocking mode (for example you should not
968     play around with an Xlib connection), then you have to seperately re-test
969 root 1.68 whether a file descriptor is really ready with a known-to-be good interface
970 root 1.42 such as poll (fortunately in our Xlib example, Xlib already does this on
971     its own, so its quite safe to use).
972    
973 root 1.81 =head3 The special problem of disappearing file descriptors
974    
975 root 1.94 Some backends (e.g. kqueue, epoll) need to be told about closing a file
976 root 1.81 descriptor (either by calling C<close> explicitly or by any other means,
977     such as C<dup>). The reason is that you register interest in some file
978     descriptor, but when it goes away, the operating system will silently drop
979     this interest. If another file descriptor with the same number then is
980     registered with libev, there is no efficient way to see that this is, in
981     fact, a different file descriptor.
982    
983     To avoid having to explicitly tell libev about such cases, libev follows
984     the following policy: Each time C<ev_io_set> is being called, libev
985     will assume that this is potentially a new file descriptor, otherwise
986     it is assumed that the file descriptor stays the same. That means that
987     you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
988     descriptor even if the file descriptor number itself did not change.
989    
990     This is how one would do it normally anyway, the important point is that
991     the libev application should not optimise around libev but should leave
992     optimisations to libev.
993    
994 root 1.95 =head3 The special problem of dup'ed file descriptors
995 root 1.94
996     Some backends (e.g. epoll), cannot register events for file descriptors,
997     but only events for the underlying file descriptions. That menas when you
998     have C<dup ()>'ed file descriptors and register events for them, only one
999     file descriptor might actually receive events.
1000    
1001     There is no workaorund possible except not registering events
1002     for potentially C<dup ()>'ed file descriptors or to resort to
1003     C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1004    
1005     =head3 The special problem of fork
1006    
1007     Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1008     useless behaviour. Libev fully supports fork, but needs to be told about
1009     it in the child.
1010    
1011     To support fork in your programs, you either have to call
1012     C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1013     enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1014     C<EVBACKEND_POLL>.
1015    
1016 root 1.81
1017 root 1.82 =head3 Watcher-Specific Functions
1018    
1019 root 1.1 =over 4
1020    
1021     =item ev_io_init (ev_io *, callback, int fd, int events)
1022    
1023     =item ev_io_set (ev_io *, int fd, int events)
1024    
1025 root 1.42 Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1026     rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or
1027     C<EV_READ | EV_WRITE> to receive the given events.
1028 root 1.32
1029 root 1.48 =item int fd [read-only]
1030    
1031     The file descriptor being watched.
1032    
1033     =item int events [read-only]
1034    
1035     The events being watched.
1036    
1037 root 1.1 =back
1038    
1039 root 1.54 Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1040 root 1.34 readable, but only once. Since it is likely line-buffered, you could
1041 root 1.54 attempt to read a whole line in the callback.
1042 root 1.34
1043     static void
1044     stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1045     {
1046     ev_io_stop (loop, w);
1047     .. read from stdin here (or from w->fd) and haqndle any I/O errors
1048     }
1049    
1050     ...
1051     struct ev_loop *loop = ev_default_init (0);
1052     struct ev_io stdin_readable;
1053     ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1054     ev_io_start (loop, &stdin_readable);
1055     ev_loop (loop, 0);
1056    
1057    
1058 root 1.42 =head2 C<ev_timer> - relative and optionally repeating timeouts
1059 root 1.1
1060     Timer watchers are simple relative timers that generate an event after a
1061     given time, and optionally repeating in regular intervals after that.
1062    
1063     The timers are based on real time, that is, if you register an event that
1064 root 1.22 times out after an hour and you reset your system clock to last years
1065 root 1.1 time, it will still time out after (roughly) and hour. "Roughly" because
1066 root 1.28 detecting time jumps is hard, and some inaccuracies are unavoidable (the
1067 root 1.1 monotonic clock option helps a lot here).
1068    
1069 root 1.9 The relative timeouts are calculated relative to the C<ev_now ()>
1070     time. This is usually the right thing as this timestamp refers to the time
1071 root 1.28 of the event triggering whatever timeout you are modifying/starting. If
1072     you suspect event processing to be delayed and you I<need> to base the timeout
1073 root 1.22 on the current time, use something like this to adjust for this:
1074 root 1.9
1075     ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1076    
1077 root 1.28 The callback is guarenteed to be invoked only when its timeout has passed,
1078     but if multiple timers become ready during the same loop iteration then
1079     order of execution is undefined.
1080    
1081 root 1.82 =head3 Watcher-Specific Functions and Data Members
1082    
1083 root 1.1 =over 4
1084    
1085     =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1086    
1087     =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
1088    
1089     Configure the timer to trigger after C<after> seconds. If C<repeat> is
1090     C<0.>, then it will automatically be stopped. If it is positive, then the
1091     timer will automatically be configured to trigger again C<repeat> seconds
1092     later, again, and again, until stopped manually.
1093    
1094     The timer itself will do a best-effort at avoiding drift, that is, if you
1095     configure a timer to trigger every 10 seconds, then it will trigger at
1096     exactly 10 second intervals. If, however, your program cannot keep up with
1097 root 1.22 the timer (because it takes longer than those 10 seconds to do stuff) the
1098 root 1.1 timer will not fire more than once per event loop iteration.
1099    
1100     =item ev_timer_again (loop)
1101    
1102     This will act as if the timer timed out and restart it again if it is
1103     repeating. The exact semantics are:
1104    
1105 root 1.61 If the timer is pending, its pending status is cleared.
1106 root 1.1
1107 root 1.61 If the timer is started but nonrepeating, stop it (as if it timed out).
1108    
1109     If the timer is repeating, either start it if necessary (with the
1110     C<repeat> value), or reset the running timer to the C<repeat> value.
1111 root 1.1
1112     This sounds a bit complicated, but here is a useful and typical
1113 root 1.61 example: Imagine you have a tcp connection and you want a so-called idle
1114     timeout, that is, you want to be called when there have been, say, 60
1115     seconds of inactivity on the socket. The easiest way to do this is to
1116     configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1117 root 1.48 C<ev_timer_again> each time you successfully read or write some data. If
1118     you go into an idle state where you do not expect data to travel on the
1119 root 1.61 socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
1120     automatically restart it if need be.
1121 root 1.48
1122 root 1.61 That means you can ignore the C<after> value and C<ev_timer_start>
1123     altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1124 root 1.48
1125     ev_timer_init (timer, callback, 0., 5.);
1126     ev_timer_again (loop, timer);
1127     ...
1128     timer->again = 17.;
1129     ev_timer_again (loop, timer);
1130     ...
1131     timer->again = 10.;
1132     ev_timer_again (loop, timer);
1133    
1134 root 1.61 This is more slightly efficient then stopping/starting the timer each time
1135     you want to modify its timeout value.
1136 root 1.48
1137     =item ev_tstamp repeat [read-write]
1138    
1139     The current C<repeat> value. Will be used each time the watcher times out
1140     or C<ev_timer_again> is called and determines the next timeout (if any),
1141     which is also when any modifications are taken into account.
1142 root 1.1
1143     =back
1144    
1145 root 1.54 Example: Create a timer that fires after 60 seconds.
1146 root 1.34
1147     static void
1148     one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1149     {
1150     .. one minute over, w is actually stopped right here
1151     }
1152    
1153     struct ev_timer mytimer;
1154     ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1155     ev_timer_start (loop, &mytimer);
1156    
1157 root 1.54 Example: Create a timeout timer that times out after 10 seconds of
1158 root 1.34 inactivity.
1159    
1160     static void
1161     timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1162     {
1163     .. ten seconds without any activity
1164     }
1165    
1166     struct ev_timer mytimer;
1167     ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1168     ev_timer_again (&mytimer); /* start timer */
1169     ev_loop (loop, 0);
1170    
1171     // and in some piece of code that gets executed on any "activity":
1172     // reset the timeout to start ticking again at 10 seconds
1173     ev_timer_again (&mytimer);
1174    
1175    
1176 root 1.42 =head2 C<ev_periodic> - to cron or not to cron?
1177 root 1.1
1178     Periodic watchers are also timers of a kind, but they are very versatile
1179     (and unfortunately a bit complex).
1180    
1181 root 1.10 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1182 root 1.1 but on wallclock time (absolute time). You can tell a periodic watcher
1183     to trigger "at" some specific point in time. For example, if you tell a
1184 root 1.38 periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
1185 root 1.1 + 10.>) and then reset your system clock to the last year, then it will
1186 root 1.10 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1187 root 1.78 roughly 10 seconds later).
1188 root 1.1
1189     They can also be used to implement vastly more complex timers, such as
1190 root 1.78 triggering an event on each midnight, local time or other, complicated,
1191     rules.
1192 root 1.1
1193 root 1.28 As with timers, the callback is guarenteed to be invoked only when the
1194     time (C<at>) has been passed, but if multiple periodic timers become ready
1195     during the same loop iteration then order of execution is undefined.
1196    
1197 root 1.82 =head3 Watcher-Specific Functions and Data Members
1198    
1199 root 1.1 =over 4
1200    
1201     =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1202    
1203     =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1204    
1205     Lots of arguments, lets sort it out... There are basically three modes of
1206     operation, and we will explain them from simplest to complex:
1207    
1208     =over 4
1209    
1210 root 1.78 =item * absolute timer (at = time, interval = reschedule_cb = 0)
1211 root 1.1
1212     In this configuration the watcher triggers an event at the wallclock time
1213     C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1214     that is, if it is to be run at January 1st 2011 then it will run when the
1215     system time reaches or surpasses this time.
1216    
1217 root 1.78 =item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1218 root 1.1
1219     In this mode the watcher will always be scheduled to time out at the next
1220 root 1.78 C<at + N * interval> time (for some integer N, which can also be negative)
1221     and then repeat, regardless of any time jumps.
1222 root 1.1
1223     This can be used to create timers that do not drift with respect to system
1224     time:
1225    
1226     ev_periodic_set (&periodic, 0., 3600., 0);
1227    
1228     This doesn't mean there will always be 3600 seconds in between triggers,
1229     but only that the the callback will be called when the system time shows a
1230 root 1.12 full hour (UTC), or more correctly, when the system time is evenly divisible
1231 root 1.1 by 3600.
1232    
1233     Another way to think about it (for the mathematically inclined) is that
1234 root 1.10 C<ev_periodic> will try to run the callback in this mode at the next possible
1235 root 1.1 time where C<time = at (mod interval)>, regardless of any time jumps.
1236    
1237 root 1.78 For numerical stability it is preferable that the C<at> value is near
1238     C<ev_now ()> (the current time), but there is no range requirement for
1239     this value.
1240    
1241     =item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1242 root 1.1
1243     In this mode the values for C<interval> and C<at> are both being
1244     ignored. Instead, each time the periodic watcher gets scheduled, the
1245     reschedule callback will be called with the watcher as first, and the
1246     current time as second argument.
1247    
1248 root 1.18 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1249     ever, or make any event loop modifications>. If you need to stop it,
1250     return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1251 root 1.78 starting an C<ev_prepare> watcher, which is legal).
1252 root 1.1
1253 root 1.13 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1254 root 1.1 ev_tstamp now)>, e.g.:
1255    
1256     static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1257     {
1258     return now + 60.;
1259     }
1260    
1261     It must return the next time to trigger, based on the passed time value
1262     (that is, the lowest time value larger than to the second argument). It
1263     will usually be called just before the callback will be triggered, but
1264     might be called at other times, too.
1265    
1266 root 1.18 NOTE: I<< This callback must always return a time that is later than the
1267 root 1.19 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
1268 root 1.18
1269 root 1.1 This can be used to create very complex timers, such as a timer that
1270     triggers on each midnight, local time. To do this, you would calculate the
1271 root 1.19 next midnight after C<now> and return the timestamp value for this. How
1272     you do this is, again, up to you (but it is not trivial, which is the main
1273     reason I omitted it as an example).
1274 root 1.1
1275     =back
1276    
1277     =item ev_periodic_again (loop, ev_periodic *)
1278    
1279     Simply stops and restarts the periodic watcher again. This is only useful
1280     when you changed some parameters or the reschedule callback would return
1281     a different time than the last time it was called (e.g. in a crond like
1282     program when the crontabs have changed).
1283    
1284 root 1.78 =item ev_tstamp offset [read-write]
1285    
1286     When repeating, this contains the offset value, otherwise this is the
1287     absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1288    
1289     Can be modified any time, but changes only take effect when the periodic
1290     timer fires or C<ev_periodic_again> is being called.
1291    
1292 root 1.48 =item ev_tstamp interval [read-write]
1293    
1294     The current interval value. Can be modified any time, but changes only
1295     take effect when the periodic timer fires or C<ev_periodic_again> is being
1296     called.
1297    
1298     =item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]
1299    
1300     The current reschedule callback, or C<0>, if this functionality is
1301     switched off. Can be changed any time, but changes only take effect when
1302     the periodic timer fires or C<ev_periodic_again> is being called.
1303    
1304 root 1.85 =item ev_tstamp at [read-only]
1305    
1306     When active, contains the absolute time that the watcher is supposed to
1307     trigger next.
1308    
1309 root 1.1 =back
1310    
1311 root 1.54 Example: Call a callback every hour, or, more precisely, whenever the
1312 root 1.34 system clock is divisible by 3600. The callback invocation times have
1313     potentially a lot of jittering, but good long-term stability.
1314    
1315     static void
1316     clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1317     {
1318     ... its now a full hour (UTC, or TAI or whatever your clock follows)
1319     }
1320    
1321     struct ev_periodic hourly_tick;
1322     ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1323     ev_periodic_start (loop, &hourly_tick);
1324    
1325 root 1.54 Example: The same as above, but use a reschedule callback to do it:
1326 root 1.34
1327     #include <math.h>
1328    
1329     static ev_tstamp
1330     my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1331     {
1332     return fmod (now, 3600.) + 3600.;
1333     }
1334    
1335     ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1336    
1337 root 1.54 Example: Call a callback every hour, starting now:
1338 root 1.34
1339     struct ev_periodic hourly_tick;
1340     ev_periodic_init (&hourly_tick, clock_cb,
1341     fmod (ev_now (loop), 3600.), 3600., 0);
1342     ev_periodic_start (loop, &hourly_tick);
1343    
1344    
1345 root 1.42 =head2 C<ev_signal> - signal me when a signal gets signalled!
1346 root 1.1
1347     Signal watchers will trigger an event when the process receives a specific
1348     signal one or more times. Even though signals are very asynchronous, libev
1349 root 1.9 will try it's best to deliver signals synchronously, i.e. as part of the
1350 root 1.1 normal event processing, like any other event.
1351    
1352 root 1.14 You can configure as many watchers as you like per signal. Only when the
1353 root 1.1 first watcher gets started will libev actually register a signal watcher
1354     with the kernel (thus it coexists with your own signal handlers as long
1355     as you don't register any with libev). Similarly, when the last signal
1356     watcher for a signal is stopped libev will reset the signal handler to
1357     SIG_DFL (regardless of what it was set to before).
1358    
1359 root 1.82 =head3 Watcher-Specific Functions and Data Members
1360    
1361 root 1.1 =over 4
1362    
1363     =item ev_signal_init (ev_signal *, callback, int signum)
1364    
1365     =item ev_signal_set (ev_signal *, int signum)
1366    
1367     Configures the watcher to trigger on the given signal number (usually one
1368     of the C<SIGxxx> constants).
1369    
1370 root 1.48 =item int signum [read-only]
1371    
1372     The signal the watcher watches out for.
1373    
1374 root 1.1 =back
1375    
1376 root 1.35
1377 root 1.42 =head2 C<ev_child> - watch out for process status changes
1378 root 1.1
1379     Child watchers trigger when your process receives a SIGCHLD in response to
1380     some child status changes (most typically when a child of yours dies).
1381    
1382 root 1.82 =head3 Watcher-Specific Functions and Data Members
1383    
1384 root 1.1 =over 4
1385    
1386     =item ev_child_init (ev_child *, callback, int pid)
1387    
1388     =item ev_child_set (ev_child *, int pid)
1389    
1390     Configures the watcher to wait for status changes of process C<pid> (or
1391     I<any> process if C<pid> is specified as C<0>). The callback can look
1392     at the C<rstatus> member of the C<ev_child> watcher structure to see
1393 root 1.14 the status word (use the macros from C<sys/wait.h> and see your systems
1394     C<waitpid> documentation). The C<rpid> member contains the pid of the
1395     process causing the status change.
1396 root 1.1
1397 root 1.48 =item int pid [read-only]
1398    
1399     The process id this watcher watches out for, or C<0>, meaning any process id.
1400    
1401     =item int rpid [read-write]
1402    
1403     The process id that detected a status change.
1404    
1405     =item int rstatus [read-write]
1406    
1407     The process exit/trace status caused by C<rpid> (see your systems
1408     C<waitpid> and C<sys/wait.h> documentation for details).
1409    
1410 root 1.1 =back
1411    
1412 root 1.54 Example: Try to exit cleanly on SIGINT and SIGTERM.
1413 root 1.34
1414     static void
1415     sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1416     {
1417     ev_unloop (loop, EVUNLOOP_ALL);
1418     }
1419    
1420     struct ev_signal signal_watcher;
1421     ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1422     ev_signal_start (loop, &sigint_cb);
1423    
1424    
1425 root 1.48 =head2 C<ev_stat> - did the file attributes just change?
1426    
1427     This watches a filesystem path for attribute changes. That is, it calls
1428     C<stat> regularly (or when the OS says it changed) and sees if it changed
1429     compared to the last time, invoking the callback if it did.
1430    
1431     The path does not need to exist: changing from "path exists" to "path does
1432     not exist" is a status change like any other. The condition "path does
1433     not exist" is signified by the C<st_nlink> field being zero (which is
1434     otherwise always forced to be at least one) and all the other fields of
1435     the stat buffer having unspecified contents.
1436    
1437 root 1.60 The path I<should> be absolute and I<must not> end in a slash. If it is
1438     relative and your working directory changes, the behaviour is undefined.
1439    
1440 root 1.48 Since there is no standard to do this, the portable implementation simply
1441 root 1.57 calls C<stat (2)> regularly on the path to see if it changed somehow. You
1442 root 1.48 can specify a recommended polling interval for this case. If you specify
1443     a polling interval of C<0> (highly recommended!) then a I<suitable,
1444     unspecified default> value will be used (which you can expect to be around
1445     five seconds, although this might change dynamically). Libev will also
1446     impose a minimum interval which is currently around C<0.1>, but thats
1447     usually overkill.
1448    
1449     This watcher type is not meant for massive numbers of stat watchers,
1450     as even with OS-supported change notifications, this can be
1451     resource-intensive.
1452    
1453 root 1.57 At the time of this writing, only the Linux inotify interface is
1454     implemented (implementing kqueue support is left as an exercise for the
1455     reader). Inotify will be used to give hints only and should not change the
1456     semantics of C<ev_stat> watchers, which means that libev sometimes needs
1457     to fall back to regular polling again even with inotify, but changes are
1458     usually detected immediately, and if the file exists there will be no
1459     polling.
1460 root 1.48
1461 root 1.82 =head3 Watcher-Specific Functions and Data Members
1462    
1463 root 1.48 =over 4
1464    
1465     =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1466    
1467     =item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
1468    
1469     Configures the watcher to wait for status changes of the given
1470     C<path>. The C<interval> is a hint on how quickly a change is expected to
1471     be detected and should normally be specified as C<0> to let libev choose
1472     a suitable value. The memory pointed to by C<path> must point to the same
1473     path for as long as the watcher is active.
1474    
1475     The callback will be receive C<EV_STAT> when a change was detected,
1476     relative to the attributes at the time the watcher was started (or the
1477     last change was detected).
1478    
1479     =item ev_stat_stat (ev_stat *)
1480    
1481     Updates the stat buffer immediately with new values. If you change the
1482     watched path in your callback, you could call this fucntion to avoid
1483     detecting this change (while introducing a race condition). Can also be
1484     useful simply to find out the new values.
1485    
1486     =item ev_statdata attr [read-only]
1487    
1488     The most-recently detected attributes of the file. Although the type is of
1489     C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1490     suitable for your system. If the C<st_nlink> member is C<0>, then there
1491     was some error while C<stat>ing the file.
1492    
1493     =item ev_statdata prev [read-only]
1494    
1495     The previous attributes of the file. The callback gets invoked whenever
1496     C<prev> != C<attr>.
1497    
1498     =item ev_tstamp interval [read-only]
1499    
1500     The specified interval.
1501    
1502     =item const char *path [read-only]
1503    
1504     The filesystem path that is being watched.
1505    
1506     =back
1507    
1508     Example: Watch C</etc/passwd> for attribute changes.
1509    
1510     static void
1511     passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1512     {
1513     /* /etc/passwd changed in some way */
1514     if (w->attr.st_nlink)
1515     {
1516     printf ("passwd current size %ld\n", (long)w->attr.st_size);
1517     printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1518     printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1519     }
1520     else
1521     /* you shalt not abuse printf for puts */
1522     puts ("wow, /etc/passwd is not there, expect problems. "
1523     "if this is windows, they already arrived\n");
1524     }
1525    
1526     ...
1527     ev_stat passwd;
1528    
1529     ev_stat_init (&passwd, passwd_cb, "/etc/passwd");
1530     ev_stat_start (loop, &passwd);
1531    
1532    
1533 root 1.42 =head2 C<ev_idle> - when you've got nothing better to do...
1534 root 1.1
1535 root 1.67 Idle watchers trigger events when no other events of the same or higher
1536     priority are pending (prepare, check and other idle watchers do not
1537     count).
1538    
1539     That is, as long as your process is busy handling sockets or timeouts
1540     (or even signals, imagine) of the same or higher priority it will not be
1541     triggered. But when your process is idle (or only lower-priority watchers
1542     are pending), the idle watchers are being called once per event loop
1543     iteration - until stopped, that is, or your process receives more events
1544     and becomes busy again with higher priority stuff.
1545 root 1.1
1546     The most noteworthy effect is that as long as any idle watchers are
1547     active, the process will not block when waiting for new events.
1548    
1549     Apart from keeping your process non-blocking (which is a useful
1550     effect on its own sometimes), idle watchers are a good place to do
1551     "pseudo-background processing", or delay processing stuff to after the
1552     event loop has handled all outstanding events.
1553    
1554 root 1.82 =head3 Watcher-Specific Functions and Data Members
1555    
1556 root 1.1 =over 4
1557    
1558     =item ev_idle_init (ev_signal *, callback)
1559    
1560     Initialises and configures the idle watcher - it has no parameters of any
1561     kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1562     believe me.
1563    
1564     =back
1565    
1566 root 1.54 Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1567     callback, free it. Also, use no error checking, as usual.
1568 root 1.34
1569     static void
1570     idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1571     {
1572     free (w);
1573     // now do something you wanted to do when the program has
1574     // no longer asnything immediate to do.
1575     }
1576    
1577     struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1578     ev_idle_init (idle_watcher, idle_cb);
1579     ev_idle_start (loop, idle_cb);
1580    
1581    
1582 root 1.42 =head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1583 root 1.1
1584 root 1.14 Prepare and check watchers are usually (but not always) used in tandem:
1585 root 1.20 prepare watchers get invoked before the process blocks and check watchers
1586 root 1.14 afterwards.
1587 root 1.1
1588 root 1.45 You I<must not> call C<ev_loop> or similar functions that enter
1589     the current event loop from either C<ev_prepare> or C<ev_check>
1590     watchers. Other loops than the current one are fine, however. The
1591     rationale behind this is that you do not need to check for recursion in
1592     those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1593     C<ev_check> so if you have one watcher of each kind they will always be
1594     called in pairs bracketing the blocking call.
1595    
1596 root 1.35 Their main purpose is to integrate other event mechanisms into libev and
1597     their use is somewhat advanced. This could be used, for example, to track
1598     variable changes, implement your own watchers, integrate net-snmp or a
1599 root 1.45 coroutine library and lots more. They are also occasionally useful if
1600     you cache some data and want to flush it before blocking (for example,
1601     in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1602     watcher).
1603 root 1.1
1604     This is done by examining in each prepare call which file descriptors need
1605 root 1.14 to be watched by the other library, registering C<ev_io> watchers for
1606     them and starting an C<ev_timer> watcher for any timeouts (many libraries
1607     provide just this functionality). Then, in the check watcher you check for
1608     any events that occured (by checking the pending status of all watchers
1609     and stopping them) and call back into the library. The I/O and timer
1610 root 1.20 callbacks will never actually be called (but must be valid nevertheless,
1611 root 1.14 because you never know, you know?).
1612 root 1.1
1613 root 1.14 As another example, the Perl Coro module uses these hooks to integrate
1614 root 1.1 coroutines into libev programs, by yielding to other active coroutines
1615     during each prepare and only letting the process block if no coroutines
1616 root 1.20 are ready to run (it's actually more complicated: it only runs coroutines
1617     with priority higher than or equal to the event loop and one coroutine
1618     of lower priority, but only once, using idle watchers to keep the event
1619     loop from blocking if lower-priority coroutines are active, thus mapping
1620     low-priority coroutines to idle/background tasks).
1621 root 1.1
1622 root 1.77 It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1623     priority, to ensure that they are being run before any other watchers
1624     after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1625     too) should not activate ("feed") events into libev. While libev fully
1626     supports this, they will be called before other C<ev_check> watchers did
1627     their job. As C<ev_check> watchers are often used to embed other event
1628     loops those other event loops might be in an unusable state until their
1629     C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1630     others).
1631    
1632 root 1.82 =head3 Watcher-Specific Functions and Data Members
1633    
1634 root 1.1 =over 4
1635    
1636     =item ev_prepare_init (ev_prepare *, callback)
1637    
1638     =item ev_check_init (ev_check *, callback)
1639    
1640     Initialises and configures the prepare or check watcher - they have no
1641     parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1642 root 1.14 macros, but using them is utterly, utterly and completely pointless.
1643 root 1.1
1644     =back
1645    
1646 root 1.76 There are a number of principal ways to embed other event loops or modules
1647     into libev. Here are some ideas on how to include libadns into libev
1648     (there is a Perl module named C<EV::ADNS> that does this, which you could
1649     use for an actually working example. Another Perl module named C<EV::Glib>
1650     embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
1651     into the Glib event loop).
1652    
1653     Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1654     and in a check watcher, destroy them and call into libadns. What follows
1655     is pseudo-code only of course. This requires you to either use a low
1656     priority for the check watcher or use C<ev_clear_pending> explicitly, as
1657     the callbacks for the IO/timeout watchers might not have been called yet.
1658 root 1.45
1659     static ev_io iow [nfd];
1660     static ev_timer tw;
1661    
1662     static void
1663     io_cb (ev_loop *loop, ev_io *w, int revents)
1664     {
1665     }
1666    
1667     // create io watchers for each fd and a timer before blocking
1668     static void
1669     adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1670     {
1671 root 1.64 int timeout = 3600000;
1672     struct pollfd fds [nfd];
1673 root 1.45 // actual code will need to loop here and realloc etc.
1674     adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1675    
1676     /* the callback is illegal, but won't be called as we stop during check */
1677     ev_timer_init (&tw, 0, timeout * 1e-3);
1678     ev_timer_start (loop, &tw);
1679    
1680 root 1.76 // create one ev_io per pollfd
1681 root 1.45 for (int i = 0; i < nfd; ++i)
1682     {
1683     ev_io_init (iow + i, io_cb, fds [i].fd,
1684     ((fds [i].events & POLLIN ? EV_READ : 0)
1685     | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1686    
1687     fds [i].revents = 0;
1688     ev_io_start (loop, iow + i);
1689     }
1690     }
1691    
1692     // stop all watchers after blocking
1693     static void
1694     adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1695     {
1696     ev_timer_stop (loop, &tw);
1697    
1698     for (int i = 0; i < nfd; ++i)
1699 root 1.76 {
1700     // set the relevant poll flags
1701     // could also call adns_processreadable etc. here
1702     struct pollfd *fd = fds + i;
1703     int revents = ev_clear_pending (iow + i);
1704     if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1705     if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1706    
1707     // now stop the watcher
1708     ev_io_stop (loop, iow + i);
1709     }
1710 root 1.45
1711     adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1712     }
1713 root 1.34
1714 root 1.76 Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1715     in the prepare watcher and would dispose of the check watcher.
1716    
1717     Method 3: If the module to be embedded supports explicit event
1718     notification (adns does), you can also make use of the actual watcher
1719     callbacks, and only destroy/create the watchers in the prepare watcher.
1720    
1721     static void
1722     timer_cb (EV_P_ ev_timer *w, int revents)
1723     {
1724     adns_state ads = (adns_state)w->data;
1725     update_now (EV_A);
1726    
1727     adns_processtimeouts (ads, &tv_now);
1728     }
1729    
1730     static void
1731     io_cb (EV_P_ ev_io *w, int revents)
1732     {
1733     adns_state ads = (adns_state)w->data;
1734     update_now (EV_A);
1735    
1736     if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1737     if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1738     }
1739    
1740     // do not ever call adns_afterpoll
1741    
1742     Method 4: Do not use a prepare or check watcher because the module you
1743     want to embed is too inflexible to support it. Instead, youc na override
1744     their poll function. The drawback with this solution is that the main
1745     loop is now no longer controllable by EV. The C<Glib::EV> module does
1746     this.
1747    
1748     static gint
1749     event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1750     {
1751     int got_events = 0;
1752    
1753     for (n = 0; n < nfds; ++n)
1754     // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1755    
1756     if (timeout >= 0)
1757     // create/start timer
1758    
1759     // poll
1760     ev_loop (EV_A_ 0);
1761    
1762     // stop timer again
1763     if (timeout >= 0)
1764     ev_timer_stop (EV_A_ &to);
1765    
1766     // stop io watchers again - their callbacks should have set
1767     for (n = 0; n < nfds; ++n)
1768     ev_io_stop (EV_A_ iow [n]);
1769    
1770     return got_events;
1771     }
1772    
1773 root 1.34
1774 root 1.42 =head2 C<ev_embed> - when one backend isn't enough...
1775 root 1.35
1776     This is a rather advanced watcher type that lets you embed one event loop
1777 root 1.36 into another (currently only C<ev_io> events are supported in the embedded
1778     loop, other types of watchers might be handled in a delayed or incorrect
1779 root 1.94 fashion and must not be used). (See portability notes, below).
1780 root 1.35
1781     There are primarily two reasons you would want that: work around bugs and
1782     prioritise I/O.
1783    
1784     As an example for a bug workaround, the kqueue backend might only support
1785     sockets on some platform, so it is unusable as generic backend, but you
1786     still want to make use of it because you have many sockets and it scales
1787     so nicely. In this case, you would create a kqueue-based loop and embed it
1788     into your default loop (which might use e.g. poll). Overall operation will
1789     be a bit slower because first libev has to poll and then call kevent, but
1790     at least you can use both at what they are best.
1791    
1792     As for prioritising I/O: rarely you have the case where some fds have
1793     to be watched and handled very quickly (with low latency), and even
1794     priorities and idle watchers might have too much overhead. In this case
1795     you would put all the high priority stuff in one loop and all the rest in
1796     a second one, and embed the second one in the first.
1797    
1798 root 1.36 As long as the watcher is active, the callback will be invoked every time
1799     there might be events pending in the embedded loop. The callback must then
1800     call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke
1801     their callbacks (you could also start an idle watcher to give the embedded
1802     loop strictly lower priority for example). You can also set the callback
1803     to C<0>, in which case the embed watcher will automatically execute the
1804     embedded loop sweep.
1805    
1806 root 1.35 As long as the watcher is started it will automatically handle events. The
1807     callback will be invoked whenever some events have been handled. You can
1808     set the callback to C<0> to avoid having to specify one if you are not
1809     interested in that.
1810    
1811     Also, there have not currently been made special provisions for forking:
1812     when you fork, you not only have to call C<ev_loop_fork> on both loops,
1813     but you will also have to stop and restart any C<ev_embed> watchers
1814     yourself.
1815    
1816     Unfortunately, not all backends are embeddable, only the ones returned by
1817     C<ev_embeddable_backends> are, which, unfortunately, does not include any
1818     portable one.
1819    
1820     So when you want to use this feature you will always have to be prepared
1821     that you cannot get an embeddable loop. The recommended way to get around
1822     this is to have a separate variables for your embeddable loop, try to
1823     create it, and if that fails, use the normal loop for everything:
1824    
1825     struct ev_loop *loop_hi = ev_default_init (0);
1826     struct ev_loop *loop_lo = 0;
1827     struct ev_embed embed;
1828    
1829     // see if there is a chance of getting one that works
1830     // (remember that a flags value of 0 means autodetection)
1831     loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1832     ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1833     : 0;
1834    
1835     // if we got one, then embed it, otherwise default to loop_hi
1836     if (loop_lo)
1837     {
1838     ev_embed_init (&embed, 0, loop_lo);
1839     ev_embed_start (loop_hi, &embed);
1840     }
1841     else
1842     loop_lo = loop_hi;
1843    
1844 root 1.94 =head2 Portability notes
1845    
1846     Kqueue is nominally embeddable, but this is broken on all BSDs that I
1847     tried, in various ways. Usually the embedded event loop will simply never
1848     receive events, sometimes it will only trigger a few times, sometimes in a
1849     loop. Epoll is also nominally embeddable, but many Linux kernel versions
1850     will always eport the epoll fd as ready, even when no events are pending.
1851    
1852     While libev allows embedding these backends (they are contained in
1853     C<ev_embeddable_backends ()>), take extreme care that it will actually
1854     work.
1855    
1856     When in doubt, create a dynamic event loop forced to use sockets (this
1857     usually works) and possibly another thread and a pipe or so to report to
1858     your main event loop.
1859    
1860 root 1.82 =head3 Watcher-Specific Functions and Data Members
1861    
1862 root 1.35 =over 4
1863    
1864 root 1.36 =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1865    
1866     =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1867    
1868     Configures the watcher to embed the given loop, which must be
1869     embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1870     invoked automatically, otherwise it is the responsibility of the callback
1871     to invoke it (it will continue to be called until the sweep has been done,
1872     if you do not want thta, you need to temporarily stop the embed watcher).
1873 root 1.35
1874 root 1.36 =item ev_embed_sweep (loop, ev_embed *)
1875 root 1.35
1876 root 1.36 Make a single, non-blocking sweep over the embedded loop. This works
1877     similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1878     apropriate way for embedded loops.
1879 root 1.35
1880 root 1.91 =item struct ev_loop *other [read-only]
1881 root 1.48
1882     The embedded event loop.
1883    
1884 root 1.35 =back
1885    
1886    
1887 root 1.50 =head2 C<ev_fork> - the audacity to resume the event loop after a fork
1888    
1889     Fork watchers are called when a C<fork ()> was detected (usually because
1890     whoever is a good citizen cared to tell libev about it by calling
1891     C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the
1892     event loop blocks next and before C<ev_check> watchers are being called,
1893     and only in the child after the fork. If whoever good citizen calling
1894     C<ev_default_fork> cheats and calls it in the wrong process, the fork
1895     handlers will be invoked, too, of course.
1896    
1897 root 1.83 =head3 Watcher-Specific Functions and Data Members
1898    
1899 root 1.50 =over 4
1900    
1901     =item ev_fork_init (ev_signal *, callback)
1902    
1903     Initialises and configures the fork watcher - it has no parameters of any
1904     kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
1905     believe me.
1906    
1907     =back
1908    
1909    
1910 root 1.1 =head1 OTHER FUNCTIONS
1911    
1912 root 1.14 There are some other functions of possible interest. Described. Here. Now.
1913 root 1.1
1914     =over 4
1915    
1916     =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
1917    
1918     This function combines a simple timer and an I/O watcher, calls your
1919     callback on whichever event happens first and automatically stop both
1920     watchers. This is useful if you want to wait for a single event on an fd
1921 root 1.22 or timeout without having to allocate/configure/start/stop/free one or
1922 root 1.1 more watchers yourself.
1923    
1924 root 1.14 If C<fd> is less than 0, then no I/O watcher will be started and events
1925     is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
1926     C<events> set will be craeted and started.
1927 root 1.1
1928     If C<timeout> is less than 0, then no timeout watcher will be
1929 root 1.14 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
1930     repeat = 0) will be started. While C<0> is a valid timeout, it is of
1931     dubious value.
1932    
1933     The callback has the type C<void (*cb)(int revents, void *arg)> and gets
1934 root 1.21 passed an C<revents> set like normal event callbacks (a combination of
1935 root 1.14 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
1936     value passed to C<ev_once>:
1937 root 1.1
1938     static void stdin_ready (int revents, void *arg)
1939     {
1940     if (revents & EV_TIMEOUT)
1941 root 1.14 /* doh, nothing entered */;
1942 root 1.1 else if (revents & EV_READ)
1943 root 1.14 /* stdin might have data for us, joy! */;
1944 root 1.1 }
1945    
1946 root 1.14 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
1947 root 1.1
1948 root 1.36 =item ev_feed_event (ev_loop *, watcher *, int revents)
1949 root 1.1
1950     Feeds the given event set into the event loop, as if the specified event
1951 root 1.14 had happened for the specified watcher (which must be a pointer to an
1952     initialised but not necessarily started event watcher).
1953 root 1.1
1954 root 1.36 =item ev_feed_fd_event (ev_loop *, int fd, int revents)
1955 root 1.1
1956 root 1.14 Feed an event on the given fd, as if a file descriptor backend detected
1957     the given events it.
1958 root 1.1
1959 root 1.36 =item ev_feed_signal_event (ev_loop *loop, int signum)
1960 root 1.1
1961 root 1.36 Feed an event as if the given signal occured (C<loop> must be the default
1962     loop!).
1963 root 1.1
1964     =back
1965    
1966 root 1.34
1967 root 1.20 =head1 LIBEVENT EMULATION
1968    
1969 root 1.24 Libev offers a compatibility emulation layer for libevent. It cannot
1970     emulate the internals of libevent, so here are some usage hints:
1971    
1972     =over 4
1973    
1974     =item * Use it by including <event.h>, as usual.
1975    
1976     =item * The following members are fully supported: ev_base, ev_callback,
1977     ev_arg, ev_fd, ev_res, ev_events.
1978    
1979     =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
1980     maintained by libev, it does not work exactly the same way as in libevent (consider
1981     it a private API).
1982    
1983     =item * Priorities are not currently supported. Initialising priorities
1984     will fail and all watchers will have the same priority, even though there
1985     is an ev_pri field.
1986    
1987     =item * Other members are not supported.
1988    
1989     =item * The libev emulation is I<not> ABI compatible to libevent, you need
1990     to use the libev header file and library.
1991    
1992     =back
1993 root 1.20
1994     =head1 C++ SUPPORT
1995    
1996 root 1.38 Libev comes with some simplistic wrapper classes for C++ that mainly allow
1997     you to use some convinience methods to start/stop watchers and also change
1998     the callback model to a model using method callbacks on objects.
1999    
2000     To use it,
2001    
2002     #include <ev++.h>
2003    
2004 root 1.71 This automatically includes F<ev.h> and puts all of its definitions (many
2005     of them macros) into the global namespace. All C++ specific things are
2006     put into the C<ev> namespace. It should support all the same embedding
2007     options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
2008    
2009 root 1.72 Care has been taken to keep the overhead low. The only data member the C++
2010     classes add (compared to plain C-style watchers) is the event loop pointer
2011     that the watcher is associated with (or no additional members at all if
2012     you disable C<EV_MULTIPLICITY> when embedding libev).
2013 root 1.71
2014 root 1.72 Currently, functions, and static and non-static member functions can be
2015 root 1.71 used as callbacks. Other types should be easy to add as long as they only
2016     need one additional pointer for context. If you need support for other
2017     types of functors please contact the author (preferably after implementing
2018     it).
2019 root 1.38
2020     Here is a list of things available in the C<ev> namespace:
2021    
2022     =over 4
2023    
2024     =item C<ev::READ>, C<ev::WRITE> etc.
2025    
2026     These are just enum values with the same values as the C<EV_READ> etc.
2027     macros from F<ev.h>.
2028    
2029     =item C<ev::tstamp>, C<ev::now>
2030    
2031     Aliases to the same types/functions as with the C<ev_> prefix.
2032    
2033     =item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
2034    
2035     For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
2036     the same name in the C<ev> namespace, with the exception of C<ev_signal>
2037     which is called C<ev::sig> to avoid clashes with the C<signal> macro
2038     defines by many implementations.
2039    
2040     All of those classes have these methods:
2041    
2042     =over 4
2043    
2044 root 1.71 =item ev::TYPE::TYPE ()
2045 root 1.38
2046 root 1.71 =item ev::TYPE::TYPE (struct ev_loop *)
2047 root 1.38
2048     =item ev::TYPE::~TYPE
2049    
2050 root 1.71 The constructor (optionally) takes an event loop to associate the watcher
2051     with. If it is omitted, it will use C<EV_DEFAULT>.
2052    
2053     The constructor calls C<ev_init> for you, which means you have to call the
2054     C<set> method before starting it.
2055    
2056     It will not set a callback, however: You have to call the templated C<set>
2057     method to set a callback before you can start the watcher.
2058    
2059     (The reason why you have to use a method is a limitation in C++ which does
2060     not allow explicit template arguments for constructors).
2061 root 1.38
2062     The destructor automatically stops the watcher if it is active.
2063    
2064 root 1.71 =item w->set<class, &class::method> (object *)
2065    
2066     This method sets the callback method to call. The method has to have a
2067     signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
2068     first argument and the C<revents> as second. The object must be given as
2069     parameter and is stored in the C<data> member of the watcher.
2070    
2071     This method synthesizes efficient thunking code to call your method from
2072     the C callback that libev requires. If your compiler can inline your
2073     callback (i.e. it is visible to it at the place of the C<set> call and
2074     your compiler is good :), then the method will be fully inlined into the
2075     thunking function, making it as fast as a direct C callback.
2076    
2077     Example: simple class declaration and watcher initialisation
2078    
2079     struct myclass
2080     {
2081     void io_cb (ev::io &w, int revents) { }
2082     }
2083    
2084     myclass obj;
2085     ev::io iow;
2086     iow.set <myclass, &myclass::io_cb> (&obj);
2087    
2088 root 1.75 =item w->set<function> (void *data = 0)
2089 root 1.71
2090     Also sets a callback, but uses a static method or plain function as
2091     callback. The optional C<data> argument will be stored in the watcher's
2092     C<data> member and is free for you to use.
2093    
2094 root 1.75 The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2095    
2096 root 1.71 See the method-C<set> above for more details.
2097    
2098 root 1.75 Example:
2099    
2100     static void io_cb (ev::io &w, int revents) { }
2101     iow.set <io_cb> ();
2102    
2103 root 1.38 =item w->set (struct ev_loop *)
2104    
2105     Associates a different C<struct ev_loop> with this watcher. You can only
2106     do this when the watcher is inactive (and not pending either).
2107    
2108     =item w->set ([args])
2109    
2110     Basically the same as C<ev_TYPE_set>, with the same args. Must be
2111 root 1.71 called at least once. Unlike the C counterpart, an active watcher gets
2112     automatically stopped and restarted when reconfiguring it with this
2113     method.
2114 root 1.38
2115     =item w->start ()
2116    
2117 root 1.71 Starts the watcher. Note that there is no C<loop> argument, as the
2118     constructor already stores the event loop.
2119 root 1.38
2120     =item w->stop ()
2121    
2122     Stops the watcher if it is active. Again, no C<loop> argument.
2123    
2124 root 1.84 =item w->again () (C<ev::timer>, C<ev::periodic> only)
2125 root 1.38
2126     For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
2127     C<ev_TYPE_again> function.
2128    
2129 root 1.84 =item w->sweep () (C<ev::embed> only)
2130 root 1.38
2131     Invokes C<ev_embed_sweep>.
2132    
2133 root 1.84 =item w->update () (C<ev::stat> only)
2134 root 1.49
2135     Invokes C<ev_stat_stat>.
2136    
2137 root 1.38 =back
2138    
2139     =back
2140    
2141     Example: Define a class with an IO and idle watcher, start one of them in
2142     the constructor.
2143    
2144     class myclass
2145     {
2146     ev_io io; void io_cb (ev::io &w, int revents);
2147     ev_idle idle void idle_cb (ev::idle &w, int revents);
2148    
2149     myclass ();
2150     }
2151    
2152     myclass::myclass (int fd)
2153     {
2154 root 1.71 io .set <myclass, &myclass::io_cb > (this);
2155     idle.set <myclass, &myclass::idle_cb> (this);
2156    
2157 root 1.38 io.start (fd, ev::READ);
2158     }
2159 root 1.20
2160 root 1.50
2161     =head1 MACRO MAGIC
2162    
2163 root 1.84 Libev can be compiled with a variety of options, the most fundamantal
2164     of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2165     functions and callbacks have an initial C<struct ev_loop *> argument.
2166 root 1.50
2167     To make it easier to write programs that cope with either variant, the
2168     following macros are defined:
2169    
2170     =over 4
2171    
2172     =item C<EV_A>, C<EV_A_>
2173    
2174     This provides the loop I<argument> for functions, if one is required ("ev
2175     loop argument"). The C<EV_A> form is used when this is the sole argument,
2176     C<EV_A_> is used when other arguments are following. Example:
2177    
2178     ev_unref (EV_A);
2179     ev_timer_add (EV_A_ watcher);
2180     ev_loop (EV_A_ 0);
2181    
2182     It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2183     which is often provided by the following macro.
2184    
2185     =item C<EV_P>, C<EV_P_>
2186    
2187     This provides the loop I<parameter> for functions, if one is required ("ev
2188     loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2189     C<EV_P_> is used when other parameters are following. Example:
2190    
2191     // this is how ev_unref is being declared
2192     static void ev_unref (EV_P);
2193    
2194     // this is how you can declare your typical callback
2195     static void cb (EV_P_ ev_timer *w, int revents)
2196    
2197     It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2198     suitable for use with C<EV_A>.
2199    
2200     =item C<EV_DEFAULT>, C<EV_DEFAULT_>
2201    
2202     Similar to the other two macros, this gives you the value of the default
2203     loop, if multiple loops are supported ("ev loop default").
2204    
2205     =back
2206    
2207 root 1.63 Example: Declare and initialise a check watcher, utilising the above
2208 root 1.68 macros so it will work regardless of whether multiple loops are supported
2209 root 1.63 or not.
2210 root 1.50
2211     static void
2212     check_cb (EV_P_ ev_timer *w, int revents)
2213     {
2214     ev_check_stop (EV_A_ w);
2215     }
2216    
2217     ev_check check;
2218     ev_check_init (&check, check_cb);
2219     ev_check_start (EV_DEFAULT_ &check);
2220     ev_loop (EV_DEFAULT_ 0);
2221    
2222 root 1.39 =head1 EMBEDDING
2223    
2224     Libev can (and often is) directly embedded into host
2225     applications. Examples of applications that embed it include the Deliantra
2226     Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2227     and rxvt-unicode.
2228    
2229 root 1.91 The goal is to enable you to just copy the necessary files into your
2230 root 1.39 source directory without having to change even a single line in them, so
2231     you can easily upgrade by simply copying (or having a checked-out copy of
2232     libev somewhere in your source tree).
2233    
2234     =head2 FILESETS
2235    
2236     Depending on what features you need you need to include one or more sets of files
2237     in your app.
2238    
2239     =head3 CORE EVENT LOOP
2240    
2241     To include only the libev core (all the C<ev_*> functions), with manual
2242     configuration (no autoconf):
2243    
2244     #define EV_STANDALONE 1
2245     #include "ev.c"
2246    
2247     This will automatically include F<ev.h>, too, and should be done in a
2248     single C source file only to provide the function implementations. To use
2249     it, do the same for F<ev.h> in all files wishing to use this API (best
2250     done by writing a wrapper around F<ev.h> that you can include instead and
2251     where you can put other configuration options):
2252    
2253     #define EV_STANDALONE 1
2254     #include "ev.h"
2255    
2256     Both header files and implementation files can be compiled with a C++
2257     compiler (at least, thats a stated goal, and breakage will be treated
2258     as a bug).
2259    
2260     You need the following files in your source tree, or in a directory
2261     in your include path (e.g. in libev/ when using -Ilibev):
2262    
2263     ev.h
2264     ev.c
2265     ev_vars.h
2266     ev_wrap.h
2267    
2268     ev_win32.c required on win32 platforms only
2269    
2270 root 1.63 ev_select.c only when select backend is enabled (which is enabled by default)
2271 root 1.39 ev_poll.c only when poll backend is enabled (disabled by default)
2272     ev_epoll.c only when the epoll backend is enabled (disabled by default)
2273     ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2274     ev_port.c only when the solaris port backend is enabled (disabled by default)
2275    
2276     F<ev.c> includes the backend files directly when enabled, so you only need
2277 root 1.43 to compile this single file.
2278 root 1.39
2279     =head3 LIBEVENT COMPATIBILITY API
2280    
2281     To include the libevent compatibility API, also include:
2282    
2283     #include "event.c"
2284    
2285     in the file including F<ev.c>, and:
2286    
2287     #include "event.h"
2288    
2289     in the files that want to use the libevent API. This also includes F<ev.h>.
2290    
2291     You need the following additional files for this:
2292    
2293     event.h
2294     event.c
2295    
2296     =head3 AUTOCONF SUPPORT
2297    
2298     Instead of using C<EV_STANDALONE=1> and providing your config in
2299     whatever way you want, you can also C<m4_include([libev.m4])> in your
2300 root 1.43 F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2301     include F<config.h> and configure itself accordingly.
2302 root 1.39
2303     For this of course you need the m4 file:
2304    
2305     libev.m4
2306    
2307     =head2 PREPROCESSOR SYMBOLS/MACROS
2308    
2309     Libev can be configured via a variety of preprocessor symbols you have to define
2310     before including any of its files. The default is not to build for multiplicity
2311     and only include the select backend.
2312    
2313     =over 4
2314    
2315     =item EV_STANDALONE
2316    
2317     Must always be C<1> if you do not use autoconf configuration, which
2318     keeps libev from including F<config.h>, and it also defines dummy
2319     implementations for some libevent functions (such as logging, which is not
2320     supported). It will also not define any of the structs usually found in
2321     F<event.h> that are not directly supported by the libev core alone.
2322    
2323     =item EV_USE_MONOTONIC
2324    
2325     If defined to be C<1>, libev will try to detect the availability of the
2326     monotonic clock option at both compiletime and runtime. Otherwise no use
2327     of the monotonic clock option will be attempted. If you enable this, you
2328     usually have to link against librt or something similar. Enabling it when
2329 root 1.92 the functionality isn't available is safe, though, although you have
2330 root 1.39 to make sure you link against any libraries where the C<clock_gettime>
2331     function is hiding in (often F<-lrt>).
2332    
2333     =item EV_USE_REALTIME
2334    
2335     If defined to be C<1>, libev will try to detect the availability of the
2336     realtime clock option at compiletime (and assume its availability at
2337     runtime if successful). Otherwise no use of the realtime clock option will
2338     be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2339 root 1.90 (CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2340     note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2341 root 1.39
2342 root 1.97 =item EV_USE_NANOSLEEP
2343    
2344     If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2345     and will use it for delays. Otherwise it will use C<select ()>.
2346    
2347 root 1.39 =item EV_USE_SELECT
2348    
2349     If undefined or defined to be C<1>, libev will compile in support for the
2350     C<select>(2) backend. No attempt at autodetection will be done: if no
2351     other method takes over, select will be it. Otherwise the select backend
2352     will not be compiled in.
2353    
2354     =item EV_SELECT_USE_FD_SET
2355    
2356     If defined to C<1>, then the select backend will use the system C<fd_set>
2357     structure. This is useful if libev doesn't compile due to a missing
2358     C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on
2359     exotic systems. This usually limits the range of file descriptors to some
2360     low limit such as 1024 or might have other limitations (winsocket only
2361     allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2362     influence the size of the C<fd_set> used.
2363    
2364     =item EV_SELECT_IS_WINSOCKET
2365    
2366     When defined to C<1>, the select backend will assume that
2367     select/socket/connect etc. don't understand file descriptors but
2368     wants osf handles on win32 (this is the case when the select to
2369     be used is the winsock select). This means that it will call
2370     C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2371     it is assumed that all these functions actually work on fds, even
2372     on win32. Should not be defined on non-win32 platforms.
2373    
2374     =item EV_USE_POLL
2375    
2376     If defined to be C<1>, libev will compile in support for the C<poll>(2)
2377     backend. Otherwise it will be enabled on non-win32 platforms. It
2378     takes precedence over select.
2379    
2380     =item EV_USE_EPOLL
2381    
2382     If defined to be C<1>, libev will compile in support for the Linux
2383     C<epoll>(7) backend. Its availability will be detected at runtime,
2384     otherwise another method will be used as fallback. This is the
2385     preferred backend for GNU/Linux systems.
2386    
2387     =item EV_USE_KQUEUE
2388    
2389     If defined to be C<1>, libev will compile in support for the BSD style
2390     C<kqueue>(2) backend. Its actual availability will be detected at runtime,
2391     otherwise another method will be used as fallback. This is the preferred
2392     backend for BSD and BSD-like systems, although on most BSDs kqueue only
2393     supports some types of fds correctly (the only platform we found that
2394     supports ptys for example was NetBSD), so kqueue might be compiled in, but
2395     not be used unless explicitly requested. The best way to use it is to find
2396 root 1.41 out whether kqueue supports your type of fd properly and use an embedded
2397 root 1.39 kqueue loop.
2398    
2399     =item EV_USE_PORT
2400    
2401     If defined to be C<1>, libev will compile in support for the Solaris
2402     10 port style backend. Its availability will be detected at runtime,
2403     otherwise another method will be used as fallback. This is the preferred
2404     backend for Solaris 10 systems.
2405    
2406     =item EV_USE_DEVPOLL
2407    
2408     reserved for future expansion, works like the USE symbols above.
2409    
2410 root 1.56 =item EV_USE_INOTIFY
2411    
2412     If defined to be C<1>, libev will compile in support for the Linux inotify
2413     interface to speed up C<ev_stat> watchers. Its actual availability will
2414     be detected at runtime.
2415    
2416 root 1.39 =item EV_H
2417    
2418     The name of the F<ev.h> header file used to include it. The default if
2419     undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This
2420     can be used to virtually rename the F<ev.h> header file in case of conflicts.
2421    
2422     =item EV_CONFIG_H
2423    
2424     If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2425     F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2426     C<EV_H>, above.
2427    
2428     =item EV_EVENT_H
2429    
2430     Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2431     of how the F<event.h> header can be found.
2432    
2433     =item EV_PROTOTYPES
2434    
2435     If defined to be C<0>, then F<ev.h> will not define any function
2436     prototypes, but still define all the structs and other symbols. This is
2437     occasionally useful if you want to provide your own wrapper functions
2438     around libev functions.
2439    
2440     =item EV_MULTIPLICITY
2441    
2442     If undefined or defined to C<1>, then all event-loop-specific functions
2443     will have the C<struct ev_loop *> as first argument, and you can create
2444     additional independent event loops. Otherwise there will be no support
2445     for multiple event loops and there is no first event loop pointer
2446     argument. Instead, all functions act on the single default loop.
2447    
2448 root 1.69 =item EV_MINPRI
2449    
2450     =item EV_MAXPRI
2451    
2452     The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2453     C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2454     provide for more priorities by overriding those symbols (usually defined
2455     to be C<-2> and C<2>, respectively).
2456    
2457     When doing priority-based operations, libev usually has to linearly search
2458     all the priorities, so having many of them (hundreds) uses a lot of space
2459     and time, so using the defaults of five priorities (-2 .. +2) is usually
2460     fine.
2461    
2462     If your embedding app does not need any priorities, defining these both to
2463     C<0> will save some memory and cpu.
2464    
2465 root 1.47 =item EV_PERIODIC_ENABLE
2466 root 1.39
2467 root 1.47 If undefined or defined to be C<1>, then periodic timers are supported. If
2468     defined to be C<0>, then they are not. Disabling them saves a few kB of
2469     code.
2470    
2471 root 1.67 =item EV_IDLE_ENABLE
2472    
2473     If undefined or defined to be C<1>, then idle watchers are supported. If
2474     defined to be C<0>, then they are not. Disabling them saves a few kB of
2475     code.
2476    
2477 root 1.47 =item EV_EMBED_ENABLE
2478    
2479     If undefined or defined to be C<1>, then embed watchers are supported. If
2480     defined to be C<0>, then they are not.
2481    
2482     =item EV_STAT_ENABLE
2483    
2484     If undefined or defined to be C<1>, then stat watchers are supported. If
2485     defined to be C<0>, then they are not.
2486    
2487 root 1.50 =item EV_FORK_ENABLE
2488    
2489     If undefined or defined to be C<1>, then fork watchers are supported. If
2490     defined to be C<0>, then they are not.
2491    
2492 root 1.47 =item EV_MINIMAL
2493    
2494     If you need to shave off some kilobytes of code at the expense of some
2495     speed, define this symbol to C<1>. Currently only used for gcc to override
2496     some inlining decisions, saves roughly 30% codesize of amd64.
2497 root 1.39
2498 root 1.51 =item EV_PID_HASHSIZE
2499    
2500     C<ev_child> watchers use a small hash table to distribute workload by
2501     pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2502     than enough. If you need to manage thousands of children you might want to
2503 root 1.56 increase this value (I<must> be a power of two).
2504    
2505     =item EV_INOTIFY_HASHSIZE
2506    
2507     C<ev_staz> watchers use a small hash table to distribute workload by
2508     inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2509     usually more than enough. If you need to manage thousands of C<ev_stat>
2510     watchers you might want to increase this value (I<must> be a power of
2511     two).
2512 root 1.51
2513 root 1.39 =item EV_COMMON
2514    
2515     By default, all watchers have a C<void *data> member. By redefining
2516     this macro to a something else you can include more and other types of
2517     members. You have to define it each time you include one of the files,
2518     though, and it must be identical each time.
2519    
2520     For example, the perl EV module uses something like this:
2521    
2522     #define EV_COMMON \
2523     SV *self; /* contains this struct */ \
2524     SV *cb_sv, *fh /* note no trailing ";" */
2525    
2526 root 1.44 =item EV_CB_DECLARE (type)
2527 root 1.39
2528 root 1.44 =item EV_CB_INVOKE (watcher, revents)
2529 root 1.39
2530 root 1.44 =item ev_set_cb (ev, cb)
2531 root 1.39
2532     Can be used to change the callback member declaration in each watcher,
2533     and the way callbacks are invoked and set. Must expand to a struct member
2534 root 1.93 definition and a statement, respectively. See the F<ev.h> header file for
2535 root 1.39 their default definitions. One possible use for overriding these is to
2536 root 1.44 avoid the C<struct ev_loop *> as first argument in all cases, or to use
2537     method calls instead of plain function calls in C++.
2538 root 1.39
2539 root 1.89 =head2 EXPORTED API SYMBOLS
2540    
2541     If you need to re-export the API (e.g. via a dll) and you need a list of
2542     exported symbols, you can use the provided F<Symbol.*> files which list
2543     all public symbols, one per line:
2544    
2545     Symbols.ev for libev proper
2546     Symbols.event for the libevent emulation
2547    
2548     This can also be used to rename all public symbols to avoid clashes with
2549     multiple versions of libev linked together (which is obviously bad in
2550     itself, but sometimes it is inconvinient to avoid this).
2551    
2552 root 1.92 A sed command like this will create wrapper C<#define>'s that you need to
2553 root 1.89 include before including F<ev.h>:
2554    
2555     <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2556    
2557     This would create a file F<wrap.h> which essentially looks like this:
2558    
2559     #define ev_backend myprefix_ev_backend
2560     #define ev_check_start myprefix_ev_check_start
2561     #define ev_check_stop myprefix_ev_check_stop
2562     ...
2563    
2564 root 1.39 =head2 EXAMPLES
2565    
2566     For a real-world example of a program the includes libev
2567     verbatim, you can have a look at the EV perl module
2568     (L<http://software.schmorp.de/pkg/EV.html>). It has the libev files in
2569     the F<libev/> subdirectory and includes them in the F<EV/EVAPI.h> (public
2570     interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
2571     will be compiled. It is pretty complex because it provides its own header
2572     file.
2573    
2574     The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2575 root 1.63 that everybody includes and which overrides some configure choices:
2576 root 1.39
2577 root 1.63 #define EV_MINIMAL 1
2578 root 1.40 #define EV_USE_POLL 0
2579     #define EV_MULTIPLICITY 0
2580 root 1.63 #define EV_PERIODIC_ENABLE 0
2581     #define EV_STAT_ENABLE 0
2582     #define EV_FORK_ENABLE 0
2583 root 1.40 #define EV_CONFIG_H <config.h>
2584 root 1.63 #define EV_MINPRI 0
2585     #define EV_MAXPRI 0
2586 root 1.39
2587 root 1.40 #include "ev++.h"
2588 root 1.39
2589     And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2590    
2591 root 1.40 #include "ev_cpp.h"
2592     #include "ev.c"
2593 root 1.39
2594 root 1.46
2595     =head1 COMPLEXITIES
2596    
2597     In this section the complexities of (many of) the algorithms used inside
2598     libev will be explained. For complexity discussions about backends see the
2599     documentation for C<ev_default_init>.
2600    
2601 root 1.70 All of the following are about amortised time: If an array needs to be
2602     extended, libev needs to realloc and move the whole array, but this
2603     happens asymptotically never with higher number of elements, so O(1) might
2604     mean it might do a lengthy realloc operation in rare cases, but on average
2605     it is much faster and asymptotically approaches constant time.
2606    
2607 root 1.46 =over 4
2608    
2609     =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2610    
2611 root 1.69 This means that, when you have a watcher that triggers in one hour and
2612     there are 100 watchers that would trigger before that then inserting will
2613     have to skip those 100 watchers.
2614    
2615 root 1.46 =item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
2616    
2617 root 1.69 That means that for changing a timer costs less than removing/adding them
2618     as only the relative motion in the event queue has to be paid for.
2619    
2620 root 1.46 =item Starting io/check/prepare/idle/signal/child watchers: O(1)
2621    
2622 root 1.70 These just add the watcher into an array or at the head of a list.
2623 root 1.46 =item Stopping check/prepare/idle watchers: O(1)
2624    
2625 root 1.56 =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2626 root 1.46
2627 root 1.69 These watchers are stored in lists then need to be walked to find the
2628     correct watcher to remove. The lists are usually short (you don't usually
2629     have many watchers waiting for the same fd or signal).
2630    
2631 root 1.46 =item Finding the next timer per loop iteration: O(1)
2632    
2633     =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2634    
2635 root 1.69 A change means an I/O watcher gets started or stopped, which requires
2636     libev to recalculate its status (and possibly tell the kernel).
2637    
2638 root 1.46 =item Activating one watcher: O(1)
2639    
2640 root 1.69 =item Priority handling: O(number_of_priorities)
2641    
2642     Priorities are implemented by allocating some space for each
2643     priority. When doing priority-based operations, libev usually has to
2644     linearly search all the priorities.
2645    
2646 root 1.46 =back
2647    
2648    
2649 root 1.1 =head1 AUTHOR
2650    
2651     Marc Lehmann <libev@schmorp.de>.
2652