3 libev - a high performance full-featured event loop written in C
14 ev_timer timeout_watcher;
16 /* called when data readable on stdin */
18 stdin_cb (EV_P_ struct ev_io *w, int revents)
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 */
26 timeout_cb (EV_P_ struct ev_timer *w, int revents)
28 /* puts ("timeout"); */
29 ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */
35 struct ev_loop *loop = ev_default_loop (0);
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);
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);
45 /* loop till timeout or data ready */
53 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>.
57 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 these event sources and provide your program with events.
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.
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
72 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 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
83 It also is quite fast (see this
84 L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
89 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.
96 =head1 TIME REPRESENTATION
98 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 called C<ev_tstamp>, which is what you should use too. It usually aliases
102 to the C<double> type in C, and when you need to do any calculations on
103 it, you should treat it as such.
105 =head1 GLOBAL FUNCTIONS
107 These functions can be called anytime, even before initialising the
112 =item ev_tstamp ev_time ()
114 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.
118 =item int ev_version_major ()
120 =item int ev_version_minor ()
122 You can find out the major and minor ABI 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.
128 These version numbers refer to the ABI version of the library, not the
131 Usually, it's a good idea to terminate if the major versions mismatch,
132 as this indicates an incompatible change. Minor versions are usually
133 compatible to older versions, so a larger minor version alone is usually
136 Example: Make sure we haven't accidentally been linked against the wrong
139 assert (("libev version mismatch",
140 ev_version_major () == EV_VERSION_MAJOR
141 && ev_version_minor () >= EV_VERSION_MINOR));
143 =item unsigned int ev_supported_backends ()
145 Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
146 value) compiled into this binary of libev (independent of their
147 availability on the system you are running on). See C<ev_default_loop> for
148 a description of the set values.
150 Example: make sure we have the epoll method, because yeah this is cool and
151 a must have and can we have a torrent of it please!!!11
153 assert (("sorry, no epoll, no sex",
154 ev_supported_backends () & EVBACKEND_EPOLL));
156 =item unsigned int ev_recommended_backends ()
158 Return the set of all backends compiled into this binary of libev and also
159 recommended for this platform. This set is often smaller than the one
160 returned by C<ev_supported_backends>, as for example kqueue is broken on
161 most BSDs and will not be autodetected unless you explicitly request it
162 (assuming you know what you are doing). This is the set of backends that
163 libev will probe for if you specify no backends explicitly.
165 =item unsigned int ev_embeddable_backends ()
167 Returns the set of backends that are embeddable in other event loops. This
168 is the theoretical, all-platform, value. To find which backends
169 might be supported on the current system, you would need to look at
170 C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
173 See the description of C<ev_embed> watchers for more info.
175 =item ev_set_allocator (void *(*cb)(void *ptr, long size))
177 Sets the allocation function to use (the prototype is similar - the
178 semantics is identical - to the realloc C function). It is used to
179 allocate and free memory (no surprises here). If it returns zero when
180 memory needs to be allocated, the library might abort or take some
181 potentially destructive action. The default is your system realloc
184 You could override this function in high-availability programs to, say,
185 free some memory if it cannot allocate memory, to use a special allocator,
186 or even to sleep a while and retry until some memory is available.
188 Example: Replace the libev allocator with one that waits a bit and then
192 persistent_realloc (void *ptr, size_t size)
196 void *newptr = realloc (ptr, size);
206 ev_set_allocator (persistent_realloc);
208 =item ev_set_syserr_cb (void (*cb)(const char *msg));
210 Set the callback function to call on a retryable syscall error (such
211 as failed select, poll, epoll_wait). The message is a printable string
212 indicating the system call or subsystem causing the problem. If this
213 callback is set, then libev will expect it to remedy the sitution, no
214 matter what, when it returns. That is, libev will generally retry the
215 requested operation, or, if the condition doesn't go away, do bad stuff
218 Example: This is basically the same thing that libev does internally, too.
221 fatal_error (const char *msg)
228 ev_set_syserr_cb (fatal_error);
232 =head1 FUNCTIONS CONTROLLING THE EVENT LOOP
234 An event loop is described by a C<struct ev_loop *>. The library knows two
235 types of such loops, the I<default> loop, which supports signals and child
236 events, and dynamically created loops which do not.
238 If you use threads, a common model is to run the default event loop
239 in your main thread (or in a separate thread) and for each thread you
240 create, you also create another event loop. Libev itself does no locking
241 whatsoever, so if you mix calls to the same event loop in different
242 threads, make sure you lock (this is usually a bad idea, though, even if
243 done correctly, because it's hideous and inefficient).
247 =item struct ev_loop *ev_default_loop (unsigned int flags)
249 This will initialise the default event loop if it hasn't been initialised
250 yet and return it. If the default loop could not be initialised, returns
251 false. If it already was initialised it simply returns it (and ignores the
252 flags. If that is troubling you, check C<ev_backend ()> afterwards).
254 If you don't know what event loop to use, use the one returned from this
257 The flags argument can be used to specify special behaviour or specific
258 backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
260 The following flags are supported:
266 The default flags value. Use this if you have no clue (it's the right
269 =item C<EVFLAG_NOENV>
271 If this flag bit is ored into the flag value (or the program runs setuid
272 or setgid) then libev will I<not> look at the environment variable
273 C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
274 override the flags completely if it is found in the environment. This is
275 useful to try out specific backends to test their performance, or to work
278 =item C<EVFLAG_FORKCHECK>
280 Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
281 a fork, you can also make libev check for a fork in each iteration by
284 This works by calling C<getpid ()> on every iteration of the loop,
285 and thus this might slow down your event loop if you do a lot of loop
286 iterations and little real work, but is usually not noticeable (on my
287 Linux system for example, C<getpid> is actually a simple 5-insn sequence
288 without a syscall and thus I<very> fast, but my Linux system also has
289 C<pthread_atfork> which is even faster).
291 The big advantage of this flag is that you can forget about fork (and
292 forget about forgetting to tell libev about forking) when you use this
295 This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
296 environment variable.
298 =item C<EVBACKEND_SELECT> (value 1, portable select backend)
300 This is your standard select(2) backend. Not I<completely> standard, as
301 libev tries to roll its own fd_set with no limits on the number of fds,
302 but if that fails, expect a fairly low limit on the number of fds when
303 using this backend. It doesn't scale too well (O(highest_fd)), but its usually
304 the fastest backend for a low number of fds.
306 =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
308 And this is your standard poll(2) backend. It's more complicated than
309 select, but handles sparse fds better and has no artificial limit on the
310 number of fds you can use (except it will slow down considerably with a
311 lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
313 =item C<EVBACKEND_EPOLL> (value 4, Linux)
315 For few fds, this backend is a bit little slower than poll and select,
316 but it scales phenomenally better. While poll and select usually scale like
317 O(total_fds) where n is the total number of fds (or the highest fd), epoll scales
318 either O(1) or O(active_fds).
320 While stopping and starting an I/O watcher in the same iteration will
321 result in some caching, there is still a syscall per such incident
322 (because the fd could point to a different file description now), so its
323 best to avoid that. Also, dup()ed file descriptors might not work very
324 well if you register events for both fds.
326 Please note that epoll sometimes generates spurious notifications, so you
327 need to use non-blocking I/O or other means to avoid blocking when no data
328 (or space) is available.
330 =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
332 Kqueue deserves special mention, as at the time of this writing, it
333 was broken on all BSDs except NetBSD (usually it doesn't work with
334 anything but sockets and pipes, except on Darwin, where of course its
335 completely useless). For this reason its not being "autodetected"
336 unless you explicitly specify it explicitly in the flags (i.e. using
337 C<EVBACKEND_KQUEUE>).
339 It scales in the same way as the epoll backend, but the interface to the
340 kernel is more efficient (which says nothing about its actual speed, of
341 course). While starting and stopping an I/O watcher does not cause an
342 extra syscall as with epoll, it still adds up to four event changes per
343 incident, so its best to avoid that.
345 =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
347 This is not implemented yet (and might never be).
349 =item C<EVBACKEND_PORT> (value 32, Solaris 10)
351 This uses the Solaris 10 port mechanism. As with everything on Solaris,
352 it's really slow, but it still scales very well (O(active_fds)).
354 Please note that solaris ports can result in a lot of spurious
355 notifications, so you need to use non-blocking I/O or other means to avoid
356 blocking when no data (or space) is available.
358 =item C<EVBACKEND_ALL>
360 Try all backends (even potentially broken ones that wouldn't be tried
361 with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
362 C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
366 If one or more of these are ored into the flags value, then only these
367 backends will be tried (in the reverse order as given here). If none are
368 specified, most compiled-in backend will be tried, usually in reverse
369 order of their flag values :)
371 The most typical usage is like this:
373 if (!ev_default_loop (0))
374 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
376 Restrict libev to the select and poll backends, and do not allow
377 environment settings to be taken into account:
379 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
381 Use whatever libev has to offer, but make sure that kqueue is used if
382 available (warning, breaks stuff, best use only with your own private
383 event loop and only if you know the OS supports your types of fds):
385 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
387 =item struct ev_loop *ev_loop_new (unsigned int flags)
389 Similar to C<ev_default_loop>, but always creates a new event loop that is
390 always distinct from the default loop. Unlike the default loop, it cannot
391 handle signal and child watchers, and attempts to do so will be greeted by
392 undefined behaviour (or a failed assertion if assertions are enabled).
394 Example: Try to create a event loop that uses epoll and nothing else.
396 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
398 fatal ("no epoll found here, maybe it hides under your chair");
400 =item ev_default_destroy ()
402 Destroys the default loop again (frees all memory and kernel state
403 etc.). None of the active event watchers will be stopped in the normal
404 sense, so e.g. C<ev_is_active> might still return true. It is your
405 responsibility to either stop all watchers cleanly yoursef I<before>
406 calling this function, or cope with the fact afterwards (which is usually
407 the easiest thing, youc na just ignore the watchers and/or C<free ()> them
410 =item ev_loop_destroy (loop)
412 Like C<ev_default_destroy>, but destroys an event loop created by an
413 earlier call to C<ev_loop_new>.
415 =item ev_default_fork ()
417 This function reinitialises the kernel state for backends that have
418 one. Despite the name, you can call it anytime, but it makes most sense
419 after forking, in either the parent or child process (or both, but that
420 again makes little sense).
422 You I<must> call this function in the child process after forking if and
423 only if you want to use the event library in both processes. If you just
424 fork+exec, you don't have to call it.
426 The function itself is quite fast and it's usually not a problem to call
427 it just in case after a fork. To make this easy, the function will fit in
428 quite nicely into a call to C<pthread_atfork>:
430 pthread_atfork (0, 0, ev_default_fork);
432 At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
433 without calling this function, so if you force one of those backends you
436 =item ev_loop_fork (loop)
438 Like C<ev_default_fork>, but acts on an event loop created by
439 C<ev_loop_new>. Yes, you have to call this on every allocated event loop
440 after fork, and how you do this is entirely your own problem.
442 =item unsigned int ev_loop_count (loop)
444 Returns the count of loop iterations for the loop, which is identical to
445 the number of times libev did poll for new events. It starts at C<0> and
446 happily wraps around with enough iterations.
448 This value can sometimes be useful as a generation counter of sorts (it
449 "ticks" the number of loop iterations), as it roughly corresponds with
450 C<ev_prepare> and C<ev_check> calls.
452 =item unsigned int ev_backend (loop)
454 Returns one of the C<EVBACKEND_*> flags indicating the event backend in
457 =item ev_tstamp ev_now (loop)
459 Returns the current "event loop time", which is the time the event loop
460 received events and started processing them. This timestamp does not
461 change as long as callbacks are being processed, and this is also the base
462 time used for relative timers. You can treat it as the timestamp of the
463 event occuring (or more correctly, libev finding out about it).
465 =item ev_loop (loop, int flags)
467 Finally, this is it, the event handler. This function usually is called
468 after you initialised all your watchers and you want to start handling
471 If the flags argument is specified as C<0>, it will not return until
472 either no event watchers are active anymore or C<ev_unloop> was called.
474 Please note that an explicit C<ev_unloop> is usually better than
475 relying on all watchers to be stopped when deciding when a program has
476 finished (especially in interactive programs), but having a program that
477 automatically loops as long as it has to and no longer by virtue of
478 relying on its watchers stopping correctly is a thing of beauty.
480 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
481 those events and any outstanding ones, but will not block your process in
482 case there are no events and will return after one iteration of the loop.
484 A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
485 neccessary) and will handle those and any outstanding ones. It will block
486 your process until at least one new event arrives, and will return after
487 one iteration of the loop. This is useful if you are waiting for some
488 external event in conjunction with something not expressible using other
489 libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
490 usually a better approach for this kind of thing.
492 Here are the gory details of what C<ev_loop> does:
494 - Before the first iteration, call any pending watchers.
495 * If there are no active watchers (reference count is zero), return.
496 - Queue all prepare watchers and then call all outstanding watchers.
497 - If we have been forked, recreate the kernel state.
498 - Update the kernel state with all outstanding changes.
499 - Update the "event loop time".
500 - Calculate for how long to block.
501 - Block the process, waiting for any events.
502 - Queue all outstanding I/O (fd) events.
503 - Update the "event loop time" and do time jump handling.
504 - Queue all outstanding timers.
505 - Queue all outstanding periodics.
506 - If no events are pending now, queue all idle watchers.
507 - Queue all check watchers.
508 - Call all queued watchers in reverse order (i.e. check watchers first).
509 Signals and child watchers are implemented as I/O watchers, and will
510 be handled here by queueing them when their watcher gets executed.
511 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
512 were used, return, otherwise continue with step *.
514 Example: Queue some jobs and then loop until no events are outsanding
517 ... queue jobs here, make sure they register event watchers as long
518 ... as they still have work to do (even an idle watcher will do..)
519 ev_loop (my_loop, 0);
522 =item ev_unloop (loop, how)
524 Can be used to make a call to C<ev_loop> return early (but only after it
525 has processed all outstanding events). The C<how> argument must be either
526 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
527 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
531 =item ev_unref (loop)
533 Ref/unref can be used to add or remove a reference count on the event
534 loop: Every watcher keeps one reference, and as long as the reference
535 count is nonzero, C<ev_loop> will not return on its own. If you have
536 a watcher you never unregister that should not keep C<ev_loop> from
537 returning, ev_unref() after starting, and ev_ref() before stopping it. For
538 example, libev itself uses this for its internal signal pipe: It is not
539 visible to the libev user and should not keep C<ev_loop> from exiting if
540 no event watchers registered by it are active. It is also an excellent
541 way to do this for generic recurring timers or from within third-party
542 libraries. Just remember to I<unref after start> and I<ref before stop>.
544 Example: Create a signal watcher, but keep it from keeping C<ev_loop>
545 running when nothing else is active.
547 struct ev_signal exitsig;
548 ev_signal_init (&exitsig, sig_cb, SIGINT);
549 ev_signal_start (loop, &exitsig);
552 Example: For some weird reason, unregister the above signal handler again.
555 ev_signal_stop (loop, &exitsig);
560 =head1 ANATOMY OF A WATCHER
562 A watcher is a structure that you create and register to record your
563 interest in some event. For instance, if you want to wait for STDIN to
564 become readable, you would create an C<ev_io> watcher for that:
566 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
569 ev_unloop (loop, EVUNLOOP_ALL);
572 struct ev_loop *loop = ev_default_loop (0);
573 struct ev_io stdin_watcher;
574 ev_init (&stdin_watcher, my_cb);
575 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
576 ev_io_start (loop, &stdin_watcher);
579 As you can see, you are responsible for allocating the memory for your
580 watcher structures (and it is usually a bad idea to do this on the stack,
581 although this can sometimes be quite valid).
583 Each watcher structure must be initialised by a call to C<ev_init
584 (watcher *, callback)>, which expects a callback to be provided. This
585 callback gets invoked each time the event occurs (or, in the case of io
586 watchers, each time the event loop detects that the file descriptor given
587 is readable and/or writable).
589 Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
590 with arguments specific to this watcher type. There is also a macro
591 to combine initialisation and setting in one call: C<< ev_<type>_init
592 (watcher *, callback, ...) >>.
594 To make the watcher actually watch out for events, you have to start it
595 with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
596 *) >>), and you can stop watching for events at any time by calling the
597 corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
599 As long as your watcher is active (has been started but not stopped) you
600 must not touch the values stored in it. Most specifically you must never
601 reinitialise it or call its C<set> macro.
603 Each and every callback receives the event loop pointer as first, the
604 registered watcher structure as second, and a bitset of received events as
607 The received events usually include a single bit per event type received
608 (you can receive multiple events at the same time). The possible bit masks
617 The file descriptor in the C<ev_io> watcher has become readable and/or
622 The C<ev_timer> watcher has timed out.
626 The C<ev_periodic> watcher has timed out.
630 The signal specified in the C<ev_signal> watcher has been received by a thread.
634 The pid specified in the C<ev_child> watcher has received a status change.
638 The path specified in the C<ev_stat> watcher changed its attributes somehow.
642 The C<ev_idle> watcher has determined that you have nothing better to do.
648 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
649 to gather new events, and all C<ev_check> watchers are invoked just after
650 C<ev_loop> has gathered them, but before it invokes any callbacks for any
651 received events. Callbacks of both watcher types can start and stop as
652 many watchers as they want, and all of them will be taken into account
653 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
654 C<ev_loop> from blocking).
658 The embedded event loop specified in the C<ev_embed> watcher needs attention.
662 The event loop has been resumed in the child process after fork (see
667 An unspecified error has occured, the watcher has been stopped. This might
668 happen because the watcher could not be properly started because libev
669 ran out of memory, a file descriptor was found to be closed or any other
670 problem. You best act on it by reporting the problem and somehow coping
671 with the watcher being stopped.
673 Libev will usually signal a few "dummy" events together with an error,
674 for example it might indicate that a fd is readable or writable, and if
675 your callbacks is well-written it can just attempt the operation and cope
676 with the error from read() or write(). This will not work in multithreaded
677 programs, though, so beware.
681 =head2 GENERIC WATCHER FUNCTIONS
683 In the following description, C<TYPE> stands for the watcher type,
684 e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
688 =item C<ev_init> (ev_TYPE *watcher, callback)
690 This macro initialises the generic portion of a watcher. The contents
691 of the watcher object can be arbitrary (so C<malloc> will do). Only
692 the generic parts of the watcher are initialised, you I<need> to call
693 the type-specific C<ev_TYPE_set> macro afterwards to initialise the
694 type-specific parts. For each type there is also a C<ev_TYPE_init> macro
695 which rolls both calls into one.
697 You can reinitialise a watcher at any time as long as it has been stopped
698 (or never started) and there are no pending events outstanding.
700 The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,
703 =item C<ev_TYPE_set> (ev_TYPE *, [args])
705 This macro initialises the type-specific parts of a watcher. You need to
706 call C<ev_init> at least once before you call this macro, but you can
707 call C<ev_TYPE_set> any number of times. You must not, however, call this
708 macro on a watcher that is active (it can be pending, however, which is a
709 difference to the C<ev_init> macro).
711 Although some watcher types do not have type-specific arguments
712 (e.g. C<ev_prepare>) you still need to call its C<set> macro.
714 =item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
716 This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
717 calls into a single call. This is the most convinient method to initialise
718 a watcher. The same limitations apply, of course.
720 =item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
722 Starts (activates) the given watcher. Only active watchers will receive
723 events. If the watcher is already active nothing will happen.
725 =item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
727 Stops the given watcher again (if active) and clears the pending
728 status. It is possible that stopped watchers are pending (for example,
729 non-repeating timers are being stopped when they become pending), but
730 C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If
731 you want to free or reuse the memory used by the watcher it is therefore a
732 good idea to always call its C<ev_TYPE_stop> function.
734 =item bool ev_is_active (ev_TYPE *watcher)
736 Returns a true value iff the watcher is active (i.e. it has been started
737 and not yet been stopped). As long as a watcher is active you must not modify
740 =item bool ev_is_pending (ev_TYPE *watcher)
742 Returns a true value iff the watcher is pending, (i.e. it has outstanding
743 events but its callback has not yet been invoked). As long as a watcher
744 is pending (but not active) you must not call an init function on it (but
745 C<ev_TYPE_set> is safe), you must not change its priority, and you must
746 make sure the watcher is available to libev (e.g. you cannot C<free ()>
749 =item callback ev_cb (ev_TYPE *watcher)
751 Returns the callback currently set on the watcher.
753 =item ev_cb_set (ev_TYPE *watcher, callback)
755 Change the callback. You can change the callback at virtually any time
758 =item ev_set_priority (ev_TYPE *watcher, priority)
760 =item int ev_priority (ev_TYPE *watcher)
762 Set and query the priority of the watcher. The priority is a small
763 integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
764 (default: C<-2>). Pending watchers with higher priority will be invoked
765 before watchers with lower priority, but priority will not keep watchers
766 from being executed (except for C<ev_idle> watchers).
768 This means that priorities are I<only> used for ordering callback
769 invocation after new events have been received. This is useful, for
770 example, to reduce latency after idling, or more often, to bind two
771 watchers on the same event and make sure one is called first.
773 If you need to suppress invocation when higher priority events are pending
774 you need to look at C<ev_idle> watchers, which provide this functionality.
776 You I<must not> change the priority of a watcher as long as it is active or
779 The default priority used by watchers when no priority has been set is
780 always C<0>, which is supposed to not be too high and not be too low :).
782 Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
783 fine, as long as you do not mind that the priority value you query might
784 or might not have been adjusted to be within valid range.
786 =item ev_invoke (loop, ev_TYPE *watcher, int revents)
788 Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
789 C<loop> nor C<revents> need to be valid as long as the watcher callback
790 can deal with that fact.
792 =item int ev_clear_pending (loop, ev_TYPE *watcher)
794 If the watcher is pending, this function returns clears its pending status
795 and returns its C<revents> bitset (as if its callback was invoked). If the
796 watcher isn't pending it does nothing and returns C<0>.
801 =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
803 Each watcher has, by default, a member C<void *data> that you can change
804 and read at any time, libev will completely ignore it. This can be used
805 to associate arbitrary data with your watcher. If you need more data and
806 don't want to allocate memory and store a pointer to it in that data
807 member, you can also "subclass" the watcher type and provide your own
815 struct whatever *mostinteresting;
818 And since your callback will be called with a pointer to the watcher, you
819 can cast it back to your own type:
821 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
823 struct my_io *w = (struct my_io *)w_;
827 More interesting and less C-conformant ways of casting your callback type
828 instead have been omitted.
830 Another common scenario is having some data structure with multiple
840 In this case getting the pointer to C<my_biggy> is a bit more complicated,
841 you need to use C<offsetof>:
846 t1_cb (EV_P_ struct ev_timer *w, int revents)
848 struct my_biggy big = (struct my_biggy *
849 (((char *)w) - offsetof (struct my_biggy, t1));
853 t2_cb (EV_P_ struct ev_timer *w, int revents)
855 struct my_biggy big = (struct my_biggy *
856 (((char *)w) - offsetof (struct my_biggy, t2));
862 This section describes each watcher in detail, but will not repeat
863 information given in the last section. Any initialisation/set macros,
864 functions and members specific to the watcher type are explained.
866 Members are additionally marked with either I<[read-only]>, meaning that,
867 while the watcher is active, you can look at the member and expect some
868 sensible content, but you must not modify it (you can modify it while the
869 watcher is stopped to your hearts content), or I<[read-write]>, which
870 means you can expect it to have some sensible content while the watcher
871 is active, but you can also modify it. Modifying it may not do something
872 sensible or take immediate effect (or do anything at all), but libev will
873 not crash or malfunction in any way.
876 =head2 C<ev_io> - is this file descriptor readable or writable?
878 I/O watchers check whether a file descriptor is readable or writable
879 in each iteration of the event loop, or, more precisely, when reading
880 would not block the process and writing would at least be able to write
881 some data. This behaviour is called level-triggering because you keep
882 receiving events as long as the condition persists. Remember you can stop
883 the watcher if you don't want to act on the event and neither want to
884 receive future events.
886 In general you can register as many read and/or write event watchers per
887 fd as you want (as long as you don't confuse yourself). Setting all file
888 descriptors to non-blocking mode is also usually a good idea (but not
889 required if you know what you are doing).
891 You have to be careful with dup'ed file descriptors, though. Some backends
892 (the linux epoll backend is a notable example) cannot handle dup'ed file
893 descriptors correctly if you register interest in two or more fds pointing
894 to the same underlying file/socket/etc. description (that is, they share
895 the same underlying "file open").
897 If you must do this, then force the use of a known-to-be-good backend
898 (at the time of this writing, this includes only C<EVBACKEND_SELECT> and
901 Another thing you have to watch out for is that it is quite easy to
902 receive "spurious" readyness notifications, that is your callback might
903 be called with C<EV_READ> but a subsequent C<read>(2) will actually block
904 because there is no data. Not only are some backends known to create a
905 lot of those (for example solaris ports), it is very easy to get into
906 this situation even with a relatively standard program structure. Thus
907 it is best to always use non-blocking I/O: An extra C<read>(2) returning
908 C<EAGAIN> is far preferable to a program hanging until some data arrives.
910 If you cannot run the fd in non-blocking mode (for example you should not
911 play around with an Xlib connection), then you have to seperately re-test
912 whether a file descriptor is really ready with a known-to-be good interface
913 such as poll (fortunately in our Xlib example, Xlib already does this on
914 its own, so its quite safe to use).
918 =item ev_io_init (ev_io *, callback, int fd, int events)
920 =item ev_io_set (ev_io *, int fd, int events)
922 Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
923 rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or
924 C<EV_READ | EV_WRITE> to receive the given events.
926 =item int fd [read-only]
928 The file descriptor being watched.
930 =item int events [read-only]
932 The events being watched.
936 Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
937 readable, but only once. Since it is likely line-buffered, you could
938 attempt to read a whole line in the callback.
941 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
943 ev_io_stop (loop, w);
944 .. read from stdin here (or from w->fd) and haqndle any I/O errors
948 struct ev_loop *loop = ev_default_init (0);
949 struct ev_io stdin_readable;
950 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
951 ev_io_start (loop, &stdin_readable);
955 =head2 C<ev_timer> - relative and optionally repeating timeouts
957 Timer watchers are simple relative timers that generate an event after a
958 given time, and optionally repeating in regular intervals after that.
960 The timers are based on real time, that is, if you register an event that
961 times out after an hour and you reset your system clock to last years
962 time, it will still time out after (roughly) and hour. "Roughly" because
963 detecting time jumps is hard, and some inaccuracies are unavoidable (the
964 monotonic clock option helps a lot here).
966 The relative timeouts are calculated relative to the C<ev_now ()>
967 time. This is usually the right thing as this timestamp refers to the time
968 of the event triggering whatever timeout you are modifying/starting. If
969 you suspect event processing to be delayed and you I<need> to base the timeout
970 on the current time, use something like this to adjust for this:
972 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
974 The callback is guarenteed to be invoked only when its timeout has passed,
975 but if multiple timers become ready during the same loop iteration then
976 order of execution is undefined.
980 =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
982 =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
984 Configure the timer to trigger after C<after> seconds. If C<repeat> is
985 C<0.>, then it will automatically be stopped. If it is positive, then the
986 timer will automatically be configured to trigger again C<repeat> seconds
987 later, again, and again, until stopped manually.
989 The timer itself will do a best-effort at avoiding drift, that is, if you
990 configure a timer to trigger every 10 seconds, then it will trigger at
991 exactly 10 second intervals. If, however, your program cannot keep up with
992 the timer (because it takes longer than those 10 seconds to do stuff) the
993 timer will not fire more than once per event loop iteration.
995 =item ev_timer_again (loop)
997 This will act as if the timer timed out and restart it again if it is
998 repeating. The exact semantics are:
1000 If the timer is pending, its pending status is cleared.
1002 If the timer is started but nonrepeating, stop it (as if it timed out).
1004 If the timer is repeating, either start it if necessary (with the
1005 C<repeat> value), or reset the running timer to the C<repeat> value.
1007 This sounds a bit complicated, but here is a useful and typical
1008 example: Imagine you have a tcp connection and you want a so-called idle
1009 timeout, that is, you want to be called when there have been, say, 60
1010 seconds of inactivity on the socket. The easiest way to do this is to
1011 configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1012 C<ev_timer_again> each time you successfully read or write some data. If
1013 you go into an idle state where you do not expect data to travel on the
1014 socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
1015 automatically restart it if need be.
1017 That means you can ignore the C<after> value and C<ev_timer_start>
1018 altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1020 ev_timer_init (timer, callback, 0., 5.);
1021 ev_timer_again (loop, timer);
1024 ev_timer_again (loop, timer);
1027 ev_timer_again (loop, timer);
1029 This is more slightly efficient then stopping/starting the timer each time
1030 you want to modify its timeout value.
1032 =item ev_tstamp repeat [read-write]
1034 The current C<repeat> value. Will be used each time the watcher times out
1035 or C<ev_timer_again> is called and determines the next timeout (if any),
1036 which is also when any modifications are taken into account.
1040 Example: Create a timer that fires after 60 seconds.
1043 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1045 .. one minute over, w is actually stopped right here
1048 struct ev_timer mytimer;
1049 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1050 ev_timer_start (loop, &mytimer);
1052 Example: Create a timeout timer that times out after 10 seconds of
1056 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1058 .. ten seconds without any activity
1061 struct ev_timer mytimer;
1062 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1063 ev_timer_again (&mytimer); /* start timer */
1066 // and in some piece of code that gets executed on any "activity":
1067 // reset the timeout to start ticking again at 10 seconds
1068 ev_timer_again (&mytimer);
1071 =head2 C<ev_periodic> - to cron or not to cron?
1073 Periodic watchers are also timers of a kind, but they are very versatile
1074 (and unfortunately a bit complex).
1076 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1077 but on wallclock time (absolute time). You can tell a periodic watcher
1078 to trigger "at" some specific point in time. For example, if you tell a
1079 periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
1080 + 10.>) and then reset your system clock to the last year, then it will
1081 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1082 roughly 10 seconds later).
1084 They can also be used to implement vastly more complex timers, such as
1085 triggering an event on each midnight, local time or other, complicated,
1088 As with timers, the callback is guarenteed to be invoked only when the
1089 time (C<at>) has been passed, but if multiple periodic timers become ready
1090 during the same loop iteration then order of execution is undefined.
1094 =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1096 =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1098 Lots of arguments, lets sort it out... There are basically three modes of
1099 operation, and we will explain them from simplest to complex:
1103 =item * absolute timer (at = time, interval = reschedule_cb = 0)
1105 In this configuration the watcher triggers an event at the wallclock time
1106 C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1107 that is, if it is to be run at January 1st 2011 then it will run when the
1108 system time reaches or surpasses this time.
1110 =item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1112 In this mode the watcher will always be scheduled to time out at the next
1113 C<at + N * interval> time (for some integer N, which can also be negative)
1114 and then repeat, regardless of any time jumps.
1116 This can be used to create timers that do not drift with respect to system
1119 ev_periodic_set (&periodic, 0., 3600., 0);
1121 This doesn't mean there will always be 3600 seconds in between triggers,
1122 but only that the the callback will be called when the system time shows a
1123 full hour (UTC), or more correctly, when the system time is evenly divisible
1126 Another way to think about it (for the mathematically inclined) is that
1127 C<ev_periodic> will try to run the callback in this mode at the next possible
1128 time where C<time = at (mod interval)>, regardless of any time jumps.
1130 For numerical stability it is preferable that the C<at> value is near
1131 C<ev_now ()> (the current time), but there is no range requirement for
1134 =item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1136 In this mode the values for C<interval> and C<at> are both being
1137 ignored. Instead, each time the periodic watcher gets scheduled, the
1138 reschedule callback will be called with the watcher as first, and the
1139 current time as second argument.
1141 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1142 ever, or make any event loop modifications>. If you need to stop it,
1143 return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1144 starting an C<ev_prepare> watcher, which is legal).
1146 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1147 ev_tstamp now)>, e.g.:
1149 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1154 It must return the next time to trigger, based on the passed time value
1155 (that is, the lowest time value larger than to the second argument). It
1156 will usually be called just before the callback will be triggered, but
1157 might be called at other times, too.
1159 NOTE: I<< This callback must always return a time that is later than the
1160 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
1162 This can be used to create very complex timers, such as a timer that
1163 triggers on each midnight, local time. To do this, you would calculate the
1164 next midnight after C<now> and return the timestamp value for this. How
1165 you do this is, again, up to you (but it is not trivial, which is the main
1166 reason I omitted it as an example).
1170 =item ev_periodic_again (loop, ev_periodic *)
1172 Simply stops and restarts the periodic watcher again. This is only useful
1173 when you changed some parameters or the reschedule callback would return
1174 a different time than the last time it was called (e.g. in a crond like
1175 program when the crontabs have changed).
1177 =item ev_tstamp offset [read-write]
1179 When repeating, this contains the offset value, otherwise this is the
1180 absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1182 Can be modified any time, but changes only take effect when the periodic
1183 timer fires or C<ev_periodic_again> is being called.
1185 =item ev_tstamp interval [read-write]
1187 The current interval value. Can be modified any time, but changes only
1188 take effect when the periodic timer fires or C<ev_periodic_again> is being
1191 =item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]
1193 The current reschedule callback, or C<0>, if this functionality is
1194 switched off. Can be changed any time, but changes only take effect when
1195 the periodic timer fires or C<ev_periodic_again> is being called.
1199 Example: Call a callback every hour, or, more precisely, whenever the
1200 system clock is divisible by 3600. The callback invocation times have
1201 potentially a lot of jittering, but good long-term stability.
1204 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1206 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1209 struct ev_periodic hourly_tick;
1210 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1211 ev_periodic_start (loop, &hourly_tick);
1213 Example: The same as above, but use a reschedule callback to do it:
1218 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1220 return fmod (now, 3600.) + 3600.;
1223 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1225 Example: Call a callback every hour, starting now:
1227 struct ev_periodic hourly_tick;
1228 ev_periodic_init (&hourly_tick, clock_cb,
1229 fmod (ev_now (loop), 3600.), 3600., 0);
1230 ev_periodic_start (loop, &hourly_tick);
1233 =head2 C<ev_signal> - signal me when a signal gets signalled!
1235 Signal watchers will trigger an event when the process receives a specific
1236 signal one or more times. Even though signals are very asynchronous, libev
1237 will try it's best to deliver signals synchronously, i.e. as part of the
1238 normal event processing, like any other event.
1240 You can configure as many watchers as you like per signal. Only when the
1241 first watcher gets started will libev actually register a signal watcher
1242 with the kernel (thus it coexists with your own signal handlers as long
1243 as you don't register any with libev). Similarly, when the last signal
1244 watcher for a signal is stopped libev will reset the signal handler to
1245 SIG_DFL (regardless of what it was set to before).
1249 =item ev_signal_init (ev_signal *, callback, int signum)
1251 =item ev_signal_set (ev_signal *, int signum)
1253 Configures the watcher to trigger on the given signal number (usually one
1254 of the C<SIGxxx> constants).
1256 =item int signum [read-only]
1258 The signal the watcher watches out for.
1263 =head2 C<ev_child> - watch out for process status changes
1265 Child watchers trigger when your process receives a SIGCHLD in response to
1266 some child status changes (most typically when a child of yours dies).
1270 =item ev_child_init (ev_child *, callback, int pid)
1272 =item ev_child_set (ev_child *, int pid)
1274 Configures the watcher to wait for status changes of process C<pid> (or
1275 I<any> process if C<pid> is specified as C<0>). The callback can look
1276 at the C<rstatus> member of the C<ev_child> watcher structure to see
1277 the status word (use the macros from C<sys/wait.h> and see your systems
1278 C<waitpid> documentation). The C<rpid> member contains the pid of the
1279 process causing the status change.
1281 =item int pid [read-only]
1283 The process id this watcher watches out for, or C<0>, meaning any process id.
1285 =item int rpid [read-write]
1287 The process id that detected a status change.
1289 =item int rstatus [read-write]
1291 The process exit/trace status caused by C<rpid> (see your systems
1292 C<waitpid> and C<sys/wait.h> documentation for details).
1296 Example: Try to exit cleanly on SIGINT and SIGTERM.
1299 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1301 ev_unloop (loop, EVUNLOOP_ALL);
1304 struct ev_signal signal_watcher;
1305 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1306 ev_signal_start (loop, &sigint_cb);
1309 =head2 C<ev_stat> - did the file attributes just change?
1311 This watches a filesystem path for attribute changes. That is, it calls
1312 C<stat> regularly (or when the OS says it changed) and sees if it changed
1313 compared to the last time, invoking the callback if it did.
1315 The path does not need to exist: changing from "path exists" to "path does
1316 not exist" is a status change like any other. The condition "path does
1317 not exist" is signified by the C<st_nlink> field being zero (which is
1318 otherwise always forced to be at least one) and all the other fields of
1319 the stat buffer having unspecified contents.
1321 The path I<should> be absolute and I<must not> end in a slash. If it is
1322 relative and your working directory changes, the behaviour is undefined.
1324 Since there is no standard to do this, the portable implementation simply
1325 calls C<stat (2)> regularly on the path to see if it changed somehow. You
1326 can specify a recommended polling interval for this case. If you specify
1327 a polling interval of C<0> (highly recommended!) then a I<suitable,
1328 unspecified default> value will be used (which you can expect to be around
1329 five seconds, although this might change dynamically). Libev will also
1330 impose a minimum interval which is currently around C<0.1>, but thats
1333 This watcher type is not meant for massive numbers of stat watchers,
1334 as even with OS-supported change notifications, this can be
1337 At the time of this writing, only the Linux inotify interface is
1338 implemented (implementing kqueue support is left as an exercise for the
1339 reader). Inotify will be used to give hints only and should not change the
1340 semantics of C<ev_stat> watchers, which means that libev sometimes needs
1341 to fall back to regular polling again even with inotify, but changes are
1342 usually detected immediately, and if the file exists there will be no
1347 =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1349 =item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
1351 Configures the watcher to wait for status changes of the given
1352 C<path>. The C<interval> is a hint on how quickly a change is expected to
1353 be detected and should normally be specified as C<0> to let libev choose
1354 a suitable value. The memory pointed to by C<path> must point to the same
1355 path for as long as the watcher is active.
1357 The callback will be receive C<EV_STAT> when a change was detected,
1358 relative to the attributes at the time the watcher was started (or the
1359 last change was detected).
1361 =item ev_stat_stat (ev_stat *)
1363 Updates the stat buffer immediately with new values. If you change the
1364 watched path in your callback, you could call this fucntion to avoid
1365 detecting this change (while introducing a race condition). Can also be
1366 useful simply to find out the new values.
1368 =item ev_statdata attr [read-only]
1370 The most-recently detected attributes of the file. Although the type is of
1371 C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1372 suitable for your system. If the C<st_nlink> member is C<0>, then there
1373 was some error while C<stat>ing the file.
1375 =item ev_statdata prev [read-only]
1377 The previous attributes of the file. The callback gets invoked whenever
1380 =item ev_tstamp interval [read-only]
1382 The specified interval.
1384 =item const char *path [read-only]
1386 The filesystem path that is being watched.
1390 Example: Watch C</etc/passwd> for attribute changes.
1393 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1395 /* /etc/passwd changed in some way */
1396 if (w->attr.st_nlink)
1398 printf ("passwd current size %ld\n", (long)w->attr.st_size);
1399 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1400 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1403 /* you shalt not abuse printf for puts */
1404 puts ("wow, /etc/passwd is not there, expect problems. "
1405 "if this is windows, they already arrived\n");
1411 ev_stat_init (&passwd, passwd_cb, "/etc/passwd");
1412 ev_stat_start (loop, &passwd);
1415 =head2 C<ev_idle> - when you've got nothing better to do...
1417 Idle watchers trigger events when no other events of the same or higher
1418 priority are pending (prepare, check and other idle watchers do not
1421 That is, as long as your process is busy handling sockets or timeouts
1422 (or even signals, imagine) of the same or higher priority it will not be
1423 triggered. But when your process is idle (or only lower-priority watchers
1424 are pending), the idle watchers are being called once per event loop
1425 iteration - until stopped, that is, or your process receives more events
1426 and becomes busy again with higher priority stuff.
1428 The most noteworthy effect is that as long as any idle watchers are
1429 active, the process will not block when waiting for new events.
1431 Apart from keeping your process non-blocking (which is a useful
1432 effect on its own sometimes), idle watchers are a good place to do
1433 "pseudo-background processing", or delay processing stuff to after the
1434 event loop has handled all outstanding events.
1438 =item ev_idle_init (ev_signal *, callback)
1440 Initialises and configures the idle watcher - it has no parameters of any
1441 kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1446 Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1447 callback, free it. Also, use no error checking, as usual.
1450 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1453 // now do something you wanted to do when the program has
1454 // no longer asnything immediate to do.
1457 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1458 ev_idle_init (idle_watcher, idle_cb);
1459 ev_idle_start (loop, idle_cb);
1462 =head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1464 Prepare and check watchers are usually (but not always) used in tandem:
1465 prepare watchers get invoked before the process blocks and check watchers
1468 You I<must not> call C<ev_loop> or similar functions that enter
1469 the current event loop from either C<ev_prepare> or C<ev_check>
1470 watchers. Other loops than the current one are fine, however. The
1471 rationale behind this is that you do not need to check for recursion in
1472 those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1473 C<ev_check> so if you have one watcher of each kind they will always be
1474 called in pairs bracketing the blocking call.
1476 Their main purpose is to integrate other event mechanisms into libev and
1477 their use is somewhat advanced. This could be used, for example, to track
1478 variable changes, implement your own watchers, integrate net-snmp or a
1479 coroutine library and lots more. They are also occasionally useful if
1480 you cache some data and want to flush it before blocking (for example,
1481 in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1484 This is done by examining in each prepare call which file descriptors need
1485 to be watched by the other library, registering C<ev_io> watchers for
1486 them and starting an C<ev_timer> watcher for any timeouts (many libraries
1487 provide just this functionality). Then, in the check watcher you check for
1488 any events that occured (by checking the pending status of all watchers
1489 and stopping them) and call back into the library. The I/O and timer
1490 callbacks will never actually be called (but must be valid nevertheless,
1491 because you never know, you know?).
1493 As another example, the Perl Coro module uses these hooks to integrate
1494 coroutines into libev programs, by yielding to other active coroutines
1495 during each prepare and only letting the process block if no coroutines
1496 are ready to run (it's actually more complicated: it only runs coroutines
1497 with priority higher than or equal to the event loop and one coroutine
1498 of lower priority, but only once, using idle watchers to keep the event
1499 loop from blocking if lower-priority coroutines are active, thus mapping
1500 low-priority coroutines to idle/background tasks).
1502 It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1503 priority, to ensure that they are being run before any other watchers
1504 after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1505 too) should not activate ("feed") events into libev. While libev fully
1506 supports this, they will be called before other C<ev_check> watchers did
1507 their job. As C<ev_check> watchers are often used to embed other event
1508 loops those other event loops might be in an unusable state until their
1509 C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1514 =item ev_prepare_init (ev_prepare *, callback)
1516 =item ev_check_init (ev_check *, callback)
1518 Initialises and configures the prepare or check watcher - they have no
1519 parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1520 macros, but using them is utterly, utterly and completely pointless.
1524 There are a number of principal ways to embed other event loops or modules
1525 into libev. Here are some ideas on how to include libadns into libev
1526 (there is a Perl module named C<EV::ADNS> that does this, which you could
1527 use for an actually working example. Another Perl module named C<EV::Glib>
1528 embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
1529 into the Glib event loop).
1531 Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1532 and in a check watcher, destroy them and call into libadns. What follows
1533 is pseudo-code only of course. This requires you to either use a low
1534 priority for the check watcher or use C<ev_clear_pending> explicitly, as
1535 the callbacks for the IO/timeout watchers might not have been called yet.
1537 static ev_io iow [nfd];
1541 io_cb (ev_loop *loop, ev_io *w, int revents)
1545 // create io watchers for each fd and a timer before blocking
1547 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1549 int timeout = 3600000;
1550 struct pollfd fds [nfd];
1551 // actual code will need to loop here and realloc etc.
1552 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1554 /* the callback is illegal, but won't be called as we stop during check */
1555 ev_timer_init (&tw, 0, timeout * 1e-3);
1556 ev_timer_start (loop, &tw);
1558 // create one ev_io per pollfd
1559 for (int i = 0; i < nfd; ++i)
1561 ev_io_init (iow + i, io_cb, fds [i].fd,
1562 ((fds [i].events & POLLIN ? EV_READ : 0)
1563 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1565 fds [i].revents = 0;
1566 ev_io_start (loop, iow + i);
1570 // stop all watchers after blocking
1572 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1574 ev_timer_stop (loop, &tw);
1576 for (int i = 0; i < nfd; ++i)
1578 // set the relevant poll flags
1579 // could also call adns_processreadable etc. here
1580 struct pollfd *fd = fds + i;
1581 int revents = ev_clear_pending (iow + i);
1582 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1583 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1585 // now stop the watcher
1586 ev_io_stop (loop, iow + i);
1589 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1592 Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1593 in the prepare watcher and would dispose of the check watcher.
1595 Method 3: If the module to be embedded supports explicit event
1596 notification (adns does), you can also make use of the actual watcher
1597 callbacks, and only destroy/create the watchers in the prepare watcher.
1600 timer_cb (EV_P_ ev_timer *w, int revents)
1602 adns_state ads = (adns_state)w->data;
1605 adns_processtimeouts (ads, &tv_now);
1609 io_cb (EV_P_ ev_io *w, int revents)
1611 adns_state ads = (adns_state)w->data;
1614 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1615 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1618 // do not ever call adns_afterpoll
1620 Method 4: Do not use a prepare or check watcher because the module you
1621 want to embed is too inflexible to support it. Instead, youc na override
1622 their poll function. The drawback with this solution is that the main
1623 loop is now no longer controllable by EV. The C<Glib::EV> module does
1627 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1631 for (n = 0; n < nfds; ++n)
1632 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1635 // create/start timer
1642 ev_timer_stop (EV_A_ &to);
1644 // stop io watchers again - their callbacks should have set
1645 for (n = 0; n < nfds; ++n)
1646 ev_io_stop (EV_A_ iow [n]);
1652 =head2 C<ev_embed> - when one backend isn't enough...
1654 This is a rather advanced watcher type that lets you embed one event loop
1655 into another (currently only C<ev_io> events are supported in the embedded
1656 loop, other types of watchers might be handled in a delayed or incorrect
1657 fashion and must not be used).
1659 There are primarily two reasons you would want that: work around bugs and
1662 As an example for a bug workaround, the kqueue backend might only support
1663 sockets on some platform, so it is unusable as generic backend, but you
1664 still want to make use of it because you have many sockets and it scales
1665 so nicely. In this case, you would create a kqueue-based loop and embed it
1666 into your default loop (which might use e.g. poll). Overall operation will
1667 be a bit slower because first libev has to poll and then call kevent, but
1668 at least you can use both at what they are best.
1670 As for prioritising I/O: rarely you have the case where some fds have
1671 to be watched and handled very quickly (with low latency), and even
1672 priorities and idle watchers might have too much overhead. In this case
1673 you would put all the high priority stuff in one loop and all the rest in
1674 a second one, and embed the second one in the first.
1676 As long as the watcher is active, the callback will be invoked every time
1677 there might be events pending in the embedded loop. The callback must then
1678 call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke
1679 their callbacks (you could also start an idle watcher to give the embedded
1680 loop strictly lower priority for example). You can also set the callback
1681 to C<0>, in which case the embed watcher will automatically execute the
1682 embedded loop sweep.
1684 As long as the watcher is started it will automatically handle events. The
1685 callback will be invoked whenever some events have been handled. You can
1686 set the callback to C<0> to avoid having to specify one if you are not
1689 Also, there have not currently been made special provisions for forking:
1690 when you fork, you not only have to call C<ev_loop_fork> on both loops,
1691 but you will also have to stop and restart any C<ev_embed> watchers
1694 Unfortunately, not all backends are embeddable, only the ones returned by
1695 C<ev_embeddable_backends> are, which, unfortunately, does not include any
1698 So when you want to use this feature you will always have to be prepared
1699 that you cannot get an embeddable loop. The recommended way to get around
1700 this is to have a separate variables for your embeddable loop, try to
1701 create it, and if that fails, use the normal loop for everything:
1703 struct ev_loop *loop_hi = ev_default_init (0);
1704 struct ev_loop *loop_lo = 0;
1705 struct ev_embed embed;
1707 // see if there is a chance of getting one that works
1708 // (remember that a flags value of 0 means autodetection)
1709 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1710 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1713 // if we got one, then embed it, otherwise default to loop_hi
1716 ev_embed_init (&embed, 0, loop_lo);
1717 ev_embed_start (loop_hi, &embed);
1724 =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1726 =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1728 Configures the watcher to embed the given loop, which must be
1729 embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1730 invoked automatically, otherwise it is the responsibility of the callback
1731 to invoke it (it will continue to be called until the sweep has been done,
1732 if you do not want thta, you need to temporarily stop the embed watcher).
1734 =item ev_embed_sweep (loop, ev_embed *)
1736 Make a single, non-blocking sweep over the embedded loop. This works
1737 similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1738 apropriate way for embedded loops.
1740 =item struct ev_loop *loop [read-only]
1742 The embedded event loop.
1747 =head2 C<ev_fork> - the audacity to resume the event loop after a fork
1749 Fork watchers are called when a C<fork ()> was detected (usually because
1750 whoever is a good citizen cared to tell libev about it by calling
1751 C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the
1752 event loop blocks next and before C<ev_check> watchers are being called,
1753 and only in the child after the fork. If whoever good citizen calling
1754 C<ev_default_fork> cheats and calls it in the wrong process, the fork
1755 handlers will be invoked, too, of course.
1759 =item ev_fork_init (ev_signal *, callback)
1761 Initialises and configures the fork watcher - it has no parameters of any
1762 kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
1768 =head1 OTHER FUNCTIONS
1770 There are some other functions of possible interest. Described. Here. Now.
1774 =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
1776 This function combines a simple timer and an I/O watcher, calls your
1777 callback on whichever event happens first and automatically stop both
1778 watchers. This is useful if you want to wait for a single event on an fd
1779 or timeout without having to allocate/configure/start/stop/free one or
1780 more watchers yourself.
1782 If C<fd> is less than 0, then no I/O watcher will be started and events
1783 is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
1784 C<events> set will be craeted and started.
1786 If C<timeout> is less than 0, then no timeout watcher will be
1787 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
1788 repeat = 0) will be started. While C<0> is a valid timeout, it is of
1791 The callback has the type C<void (*cb)(int revents, void *arg)> and gets
1792 passed an C<revents> set like normal event callbacks (a combination of
1793 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
1794 value passed to C<ev_once>:
1796 static void stdin_ready (int revents, void *arg)
1798 if (revents & EV_TIMEOUT)
1799 /* doh, nothing entered */;
1800 else if (revents & EV_READ)
1801 /* stdin might have data for us, joy! */;
1804 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
1806 =item ev_feed_event (ev_loop *, watcher *, int revents)
1808 Feeds the given event set into the event loop, as if the specified event
1809 had happened for the specified watcher (which must be a pointer to an
1810 initialised but not necessarily started event watcher).
1812 =item ev_feed_fd_event (ev_loop *, int fd, int revents)
1814 Feed an event on the given fd, as if a file descriptor backend detected
1815 the given events it.
1817 =item ev_feed_signal_event (ev_loop *loop, int signum)
1819 Feed an event as if the given signal occured (C<loop> must be the default
1825 =head1 LIBEVENT EMULATION
1827 Libev offers a compatibility emulation layer for libevent. It cannot
1828 emulate the internals of libevent, so here are some usage hints:
1832 =item * Use it by including <event.h>, as usual.
1834 =item * The following members are fully supported: ev_base, ev_callback,
1835 ev_arg, ev_fd, ev_res, ev_events.
1837 =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
1838 maintained by libev, it does not work exactly the same way as in libevent (consider
1841 =item * Priorities are not currently supported. Initialising priorities
1842 will fail and all watchers will have the same priority, even though there
1845 =item * Other members are not supported.
1847 =item * The libev emulation is I<not> ABI compatible to libevent, you need
1848 to use the libev header file and library.
1854 Libev comes with some simplistic wrapper classes for C++ that mainly allow
1855 you to use some convinience methods to start/stop watchers and also change
1856 the callback model to a model using method callbacks on objects.
1862 This automatically includes F<ev.h> and puts all of its definitions (many
1863 of them macros) into the global namespace. All C++ specific things are
1864 put into the C<ev> namespace. It should support all the same embedding
1865 options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
1867 Care has been taken to keep the overhead low. The only data member the C++
1868 classes add (compared to plain C-style watchers) is the event loop pointer
1869 that the watcher is associated with (or no additional members at all if
1870 you disable C<EV_MULTIPLICITY> when embedding libev).
1872 Currently, functions, and static and non-static member functions can be
1873 used as callbacks. Other types should be easy to add as long as they only
1874 need one additional pointer for context. If you need support for other
1875 types of functors please contact the author (preferably after implementing
1878 Here is a list of things available in the C<ev> namespace:
1882 =item C<ev::READ>, C<ev::WRITE> etc.
1884 These are just enum values with the same values as the C<EV_READ> etc.
1885 macros from F<ev.h>.
1887 =item C<ev::tstamp>, C<ev::now>
1889 Aliases to the same types/functions as with the C<ev_> prefix.
1891 =item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
1893 For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
1894 the same name in the C<ev> namespace, with the exception of C<ev_signal>
1895 which is called C<ev::sig> to avoid clashes with the C<signal> macro
1896 defines by many implementations.
1898 All of those classes have these methods:
1902 =item ev::TYPE::TYPE ()
1904 =item ev::TYPE::TYPE (struct ev_loop *)
1906 =item ev::TYPE::~TYPE
1908 The constructor (optionally) takes an event loop to associate the watcher
1909 with. If it is omitted, it will use C<EV_DEFAULT>.
1911 The constructor calls C<ev_init> for you, which means you have to call the
1912 C<set> method before starting it.
1914 It will not set a callback, however: You have to call the templated C<set>
1915 method to set a callback before you can start the watcher.
1917 (The reason why you have to use a method is a limitation in C++ which does
1918 not allow explicit template arguments for constructors).
1920 The destructor automatically stops the watcher if it is active.
1922 =item w->set<class, &class::method> (object *)
1924 This method sets the callback method to call. The method has to have a
1925 signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
1926 first argument and the C<revents> as second. The object must be given as
1927 parameter and is stored in the C<data> member of the watcher.
1929 This method synthesizes efficient thunking code to call your method from
1930 the C callback that libev requires. If your compiler can inline your
1931 callback (i.e. it is visible to it at the place of the C<set> call and
1932 your compiler is good :), then the method will be fully inlined into the
1933 thunking function, making it as fast as a direct C callback.
1935 Example: simple class declaration and watcher initialisation
1939 void io_cb (ev::io &w, int revents) { }
1944 iow.set <myclass, &myclass::io_cb> (&obj);
1946 =item w->set<function> (void *data = 0)
1948 Also sets a callback, but uses a static method or plain function as
1949 callback. The optional C<data> argument will be stored in the watcher's
1950 C<data> member and is free for you to use.
1952 The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
1954 See the method-C<set> above for more details.
1958 static void io_cb (ev::io &w, int revents) { }
1961 =item w->set (struct ev_loop *)
1963 Associates a different C<struct ev_loop> with this watcher. You can only
1964 do this when the watcher is inactive (and not pending either).
1966 =item w->set ([args])
1968 Basically the same as C<ev_TYPE_set>, with the same args. Must be
1969 called at least once. Unlike the C counterpart, an active watcher gets
1970 automatically stopped and restarted when reconfiguring it with this
1975 Starts the watcher. Note that there is no C<loop> argument, as the
1976 constructor already stores the event loop.
1980 Stops the watcher if it is active. Again, no C<loop> argument.
1982 =item w->again () C<ev::timer>, C<ev::periodic> only
1984 For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1985 C<ev_TYPE_again> function.
1987 =item w->sweep () C<ev::embed> only
1989 Invokes C<ev_embed_sweep>.
1991 =item w->update () C<ev::stat> only
1993 Invokes C<ev_stat_stat>.
1999 Example: Define a class with an IO and idle watcher, start one of them in
2004 ev_io io; void io_cb (ev::io &w, int revents);
2005 ev_idle idle void idle_cb (ev::idle &w, int revents);
2010 myclass::myclass (int fd)
2012 io .set <myclass, &myclass::io_cb > (this);
2013 idle.set <myclass, &myclass::idle_cb> (this);
2015 io.start (fd, ev::READ);
2021 Libev can be compiled with a variety of options, the most fundemantal is
2022 C<EV_MULTIPLICITY>. This option determines whether (most) functions and
2023 callbacks have an initial C<struct ev_loop *> argument.
2025 To make it easier to write programs that cope with either variant, the
2026 following macros are defined:
2030 =item C<EV_A>, C<EV_A_>
2032 This provides the loop I<argument> for functions, if one is required ("ev
2033 loop argument"). The C<EV_A> form is used when this is the sole argument,
2034 C<EV_A_> is used when other arguments are following. Example:
2037 ev_timer_add (EV_A_ watcher);
2040 It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2041 which is often provided by the following macro.
2043 =item C<EV_P>, C<EV_P_>
2045 This provides the loop I<parameter> for functions, if one is required ("ev
2046 loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2047 C<EV_P_> is used when other parameters are following. Example:
2049 // this is how ev_unref is being declared
2050 static void ev_unref (EV_P);
2052 // this is how you can declare your typical callback
2053 static void cb (EV_P_ ev_timer *w, int revents)
2055 It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2056 suitable for use with C<EV_A>.
2058 =item C<EV_DEFAULT>, C<EV_DEFAULT_>
2060 Similar to the other two macros, this gives you the value of the default
2061 loop, if multiple loops are supported ("ev loop default").
2065 Example: Declare and initialise a check watcher, utilising the above
2066 macros so it will work regardless of whether multiple loops are supported
2070 check_cb (EV_P_ ev_timer *w, int revents)
2072 ev_check_stop (EV_A_ w);
2076 ev_check_init (&check, check_cb);
2077 ev_check_start (EV_DEFAULT_ &check);
2078 ev_loop (EV_DEFAULT_ 0);
2082 Libev can (and often is) directly embedded into host
2083 applications. Examples of applications that embed it include the Deliantra
2084 Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2087 The goal is to enable you to just copy the neecssary files into your
2088 source directory without having to change even a single line in them, so
2089 you can easily upgrade by simply copying (or having a checked-out copy of
2090 libev somewhere in your source tree).
2094 Depending on what features you need you need to include one or more sets of files
2097 =head3 CORE EVENT LOOP
2099 To include only the libev core (all the C<ev_*> functions), with manual
2100 configuration (no autoconf):
2102 #define EV_STANDALONE 1
2105 This will automatically include F<ev.h>, too, and should be done in a
2106 single C source file only to provide the function implementations. To use
2107 it, do the same for F<ev.h> in all files wishing to use this API (best
2108 done by writing a wrapper around F<ev.h> that you can include instead and
2109 where you can put other configuration options):
2111 #define EV_STANDALONE 1
2114 Both header files and implementation files can be compiled with a C++
2115 compiler (at least, thats a stated goal, and breakage will be treated
2118 You need the following files in your source tree, or in a directory
2119 in your include path (e.g. in libev/ when using -Ilibev):
2126 ev_win32.c required on win32 platforms only
2128 ev_select.c only when select backend is enabled (which is enabled by default)
2129 ev_poll.c only when poll backend is enabled (disabled by default)
2130 ev_epoll.c only when the epoll backend is enabled (disabled by default)
2131 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2132 ev_port.c only when the solaris port backend is enabled (disabled by default)
2134 F<ev.c> includes the backend files directly when enabled, so you only need
2135 to compile this single file.
2137 =head3 LIBEVENT COMPATIBILITY API
2139 To include the libevent compatibility API, also include:
2143 in the file including F<ev.c>, and:
2147 in the files that want to use the libevent API. This also includes F<ev.h>.
2149 You need the following additional files for this:
2154 =head3 AUTOCONF SUPPORT
2156 Instead of using C<EV_STANDALONE=1> and providing your config in
2157 whatever way you want, you can also C<m4_include([libev.m4])> in your
2158 F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2159 include F<config.h> and configure itself accordingly.
2161 For this of course you need the m4 file:
2165 =head2 PREPROCESSOR SYMBOLS/MACROS
2167 Libev can be configured via a variety of preprocessor symbols you have to define
2168 before including any of its files. The default is not to build for multiplicity
2169 and only include the select backend.
2175 Must always be C<1> if you do not use autoconf configuration, which
2176 keeps libev from including F<config.h>, and it also defines dummy
2177 implementations for some libevent functions (such as logging, which is not
2178 supported). It will also not define any of the structs usually found in
2179 F<event.h> that are not directly supported by the libev core alone.
2181 =item EV_USE_MONOTONIC
2183 If defined to be C<1>, libev will try to detect the availability of the
2184 monotonic clock option at both compiletime and runtime. Otherwise no use
2185 of the monotonic clock option will be attempted. If you enable this, you
2186 usually have to link against librt or something similar. Enabling it when
2187 the functionality isn't available is safe, though, althoguh you have
2188 to make sure you link against any libraries where the C<clock_gettime>
2189 function is hiding in (often F<-lrt>).
2191 =item EV_USE_REALTIME
2193 If defined to be C<1>, libev will try to detect the availability of the
2194 realtime clock option at compiletime (and assume its availability at
2195 runtime if successful). Otherwise no use of the realtime clock option will
2196 be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2197 (CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries
2198 in the description of C<EV_USE_MONOTONIC>, though.
2202 If undefined or defined to be C<1>, libev will compile in support for the
2203 C<select>(2) backend. No attempt at autodetection will be done: if no
2204 other method takes over, select will be it. Otherwise the select backend
2205 will not be compiled in.
2207 =item EV_SELECT_USE_FD_SET
2209 If defined to C<1>, then the select backend will use the system C<fd_set>
2210 structure. This is useful if libev doesn't compile due to a missing
2211 C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on
2212 exotic systems. This usually limits the range of file descriptors to some
2213 low limit such as 1024 or might have other limitations (winsocket only
2214 allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2215 influence the size of the C<fd_set> used.
2217 =item EV_SELECT_IS_WINSOCKET
2219 When defined to C<1>, the select backend will assume that
2220 select/socket/connect etc. don't understand file descriptors but
2221 wants osf handles on win32 (this is the case when the select to
2222 be used is the winsock select). This means that it will call
2223 C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2224 it is assumed that all these functions actually work on fds, even
2225 on win32. Should not be defined on non-win32 platforms.
2229 If defined to be C<1>, libev will compile in support for the C<poll>(2)
2230 backend. Otherwise it will be enabled on non-win32 platforms. It
2231 takes precedence over select.
2235 If defined to be C<1>, libev will compile in support for the Linux
2236 C<epoll>(7) backend. Its availability will be detected at runtime,
2237 otherwise another method will be used as fallback. This is the
2238 preferred backend for GNU/Linux systems.
2242 If defined to be C<1>, libev will compile in support for the BSD style
2243 C<kqueue>(2) backend. Its actual availability will be detected at runtime,
2244 otherwise another method will be used as fallback. This is the preferred
2245 backend for BSD and BSD-like systems, although on most BSDs kqueue only
2246 supports some types of fds correctly (the only platform we found that
2247 supports ptys for example was NetBSD), so kqueue might be compiled in, but
2248 not be used unless explicitly requested. The best way to use it is to find
2249 out whether kqueue supports your type of fd properly and use an embedded
2254 If defined to be C<1>, libev will compile in support for the Solaris
2255 10 port style backend. Its availability will be detected at runtime,
2256 otherwise another method will be used as fallback. This is the preferred
2257 backend for Solaris 10 systems.
2259 =item EV_USE_DEVPOLL
2261 reserved for future expansion, works like the USE symbols above.
2263 =item EV_USE_INOTIFY
2265 If defined to be C<1>, libev will compile in support for the Linux inotify
2266 interface to speed up C<ev_stat> watchers. Its actual availability will
2267 be detected at runtime.
2271 The name of the F<ev.h> header file used to include it. The default if
2272 undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This
2273 can be used to virtually rename the F<ev.h> header file in case of conflicts.
2277 If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2278 F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2283 Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2284 of how the F<event.h> header can be found.
2288 If defined to be C<0>, then F<ev.h> will not define any function
2289 prototypes, but still define all the structs and other symbols. This is
2290 occasionally useful if you want to provide your own wrapper functions
2291 around libev functions.
2293 =item EV_MULTIPLICITY
2295 If undefined or defined to C<1>, then all event-loop-specific functions
2296 will have the C<struct ev_loop *> as first argument, and you can create
2297 additional independent event loops. Otherwise there will be no support
2298 for multiple event loops and there is no first event loop pointer
2299 argument. Instead, all functions act on the single default loop.
2305 The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2306 C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2307 provide for more priorities by overriding those symbols (usually defined
2308 to be C<-2> and C<2>, respectively).
2310 When doing priority-based operations, libev usually has to linearly search
2311 all the priorities, so having many of them (hundreds) uses a lot of space
2312 and time, so using the defaults of five priorities (-2 .. +2) is usually
2315 If your embedding app does not need any priorities, defining these both to
2316 C<0> will save some memory and cpu.
2318 =item EV_PERIODIC_ENABLE
2320 If undefined or defined to be C<1>, then periodic timers are supported. If
2321 defined to be C<0>, then they are not. Disabling them saves a few kB of
2324 =item EV_IDLE_ENABLE
2326 If undefined or defined to be C<1>, then idle watchers are supported. If
2327 defined to be C<0>, then they are not. Disabling them saves a few kB of
2330 =item EV_EMBED_ENABLE
2332 If undefined or defined to be C<1>, then embed watchers are supported. If
2333 defined to be C<0>, then they are not.
2335 =item EV_STAT_ENABLE
2337 If undefined or defined to be C<1>, then stat watchers are supported. If
2338 defined to be C<0>, then they are not.
2340 =item EV_FORK_ENABLE
2342 If undefined or defined to be C<1>, then fork watchers are supported. If
2343 defined to be C<0>, then they are not.
2347 If you need to shave off some kilobytes of code at the expense of some
2348 speed, define this symbol to C<1>. Currently only used for gcc to override
2349 some inlining decisions, saves roughly 30% codesize of amd64.
2351 =item EV_PID_HASHSIZE
2353 C<ev_child> watchers use a small hash table to distribute workload by
2354 pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2355 than enough. If you need to manage thousands of children you might want to
2356 increase this value (I<must> be a power of two).
2358 =item EV_INOTIFY_HASHSIZE
2360 C<ev_staz> watchers use a small hash table to distribute workload by
2361 inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2362 usually more than enough. If you need to manage thousands of C<ev_stat>
2363 watchers you might want to increase this value (I<must> be a power of
2368 By default, all watchers have a C<void *data> member. By redefining
2369 this macro to a something else you can include more and other types of
2370 members. You have to define it each time you include one of the files,
2371 though, and it must be identical each time.
2373 For example, the perl EV module uses something like this:
2376 SV *self; /* contains this struct */ \
2377 SV *cb_sv, *fh /* note no trailing ";" */
2379 =item EV_CB_DECLARE (type)
2381 =item EV_CB_INVOKE (watcher, revents)
2383 =item ev_set_cb (ev, cb)
2385 Can be used to change the callback member declaration in each watcher,
2386 and the way callbacks are invoked and set. Must expand to a struct member
2387 definition and a statement, respectively. See the F<ev.v> header file for
2388 their default definitions. One possible use for overriding these is to
2389 avoid the C<struct ev_loop *> as first argument in all cases, or to use
2390 method calls instead of plain function calls in C++.
2394 For a real-world example of a program the includes libev
2395 verbatim, you can have a look at the EV perl module
2396 (L<http://software.schmorp.de/pkg/EV.html>). It has the libev files in
2397 the F<libev/> subdirectory and includes them in the F<EV/EVAPI.h> (public
2398 interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
2399 will be compiled. It is pretty complex because it provides its own header
2402 The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2403 that everybody includes and which overrides some configure choices:
2405 #define EV_MINIMAL 1
2406 #define EV_USE_POLL 0
2407 #define EV_MULTIPLICITY 0
2408 #define EV_PERIODIC_ENABLE 0
2409 #define EV_STAT_ENABLE 0
2410 #define EV_FORK_ENABLE 0
2411 #define EV_CONFIG_H <config.h>
2417 And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2425 In this section the complexities of (many of) the algorithms used inside
2426 libev will be explained. For complexity discussions about backends see the
2427 documentation for C<ev_default_init>.
2429 All of the following are about amortised time: If an array needs to be
2430 extended, libev needs to realloc and move the whole array, but this
2431 happens asymptotically never with higher number of elements, so O(1) might
2432 mean it might do a lengthy realloc operation in rare cases, but on average
2433 it is much faster and asymptotically approaches constant time.
2437 =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2439 This means that, when you have a watcher that triggers in one hour and
2440 there are 100 watchers that would trigger before that then inserting will
2441 have to skip those 100 watchers.
2443 =item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
2445 That means that for changing a timer costs less than removing/adding them
2446 as only the relative motion in the event queue has to be paid for.
2448 =item Starting io/check/prepare/idle/signal/child watchers: O(1)
2450 These just add the watcher into an array or at the head of a list.
2451 =item Stopping check/prepare/idle watchers: O(1)
2453 =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2455 These watchers are stored in lists then need to be walked to find the
2456 correct watcher to remove. The lists are usually short (you don't usually
2457 have many watchers waiting for the same fd or signal).
2459 =item Finding the next timer per loop iteration: O(1)
2461 =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2463 A change means an I/O watcher gets started or stopped, which requires
2464 libev to recalculate its status (and possibly tell the kernel).
2466 =item Activating one watcher: O(1)
2468 =item Priority handling: O(number_of_priorities)
2470 Priorities are implemented by allocating some space for each
2471 priority. When doing priority-based operations, libev usually has to
2472 linearly search all the priorities.
2479 Marc Lehmann <libev@schmorp.de>.