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