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 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 Usually, it's a good idea to terminate if the major versions mismatch,
129 as this indicates an incompatible change. Minor versions are usually
130 compatible to older versions, so a larger minor version alone is usually
133 Example: Make sure we haven't accidentally been linked against the wrong
136 assert (("libev version mismatch",
137 ev_version_major () == EV_VERSION_MAJOR
138 && ev_version_minor () >= EV_VERSION_MINOR));
140 =item unsigned int ev_supported_backends ()
142 Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
143 value) compiled into this binary of libev (independent of their
144 availability on the system you are running on). See C<ev_default_loop> for
145 a description of the set values.
147 Example: make sure we have the epoll method, because yeah this is cool and
148 a must have and can we have a torrent of it please!!!11
150 assert (("sorry, no epoll, no sex",
151 ev_supported_backends () & EVBACKEND_EPOLL));
153 =item unsigned int ev_recommended_backends ()
155 Return the set of all backends compiled into this binary of libev and also
156 recommended for this platform. This set is often smaller than the one
157 returned by C<ev_supported_backends>, as for example kqueue is broken on
158 most BSDs and will not be autodetected unless you explicitly request it
159 (assuming you know what you are doing). This is the set of backends that
160 libev will probe for if you specify no backends explicitly.
162 =item unsigned int ev_embeddable_backends ()
164 Returns the set of backends that are embeddable in other event loops. This
165 is the theoretical, all-platform, value. To find which backends
166 might be supported on the current system, you would need to look at
167 C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
170 See the description of C<ev_embed> watchers for more info.
172 =item ev_set_allocator (void *(*cb)(void *ptr, long size))
174 Sets the allocation function to use (the prototype is similar - the
175 semantics is identical - to the realloc C function). It is used to
176 allocate and free memory (no surprises here). If it returns zero when
177 memory needs to be allocated, the library might abort or take some
178 potentially destructive action. The default is your system realloc
181 You could override this function in high-availability programs to, say,
182 free some memory if it cannot allocate memory, to use a special allocator,
183 or even to sleep a while and retry until some memory is available.
185 Example: Replace the libev allocator with one that waits a bit and then
189 persistent_realloc (void *ptr, size_t size)
193 void *newptr = realloc (ptr, size);
203 ev_set_allocator (persistent_realloc);
205 =item ev_set_syserr_cb (void (*cb)(const char *msg));
207 Set the callback function to call on a retryable syscall error (such
208 as failed select, poll, epoll_wait). The message is a printable string
209 indicating the system call or subsystem causing the problem. If this
210 callback is set, then libev will expect it to remedy the sitution, no
211 matter what, when it returns. That is, libev will generally retry the
212 requested operation, or, if the condition doesn't go away, do bad stuff
215 Example: This is basically the same thing that libev does internally, too.
218 fatal_error (const char *msg)
225 ev_set_syserr_cb (fatal_error);
229 =head1 FUNCTIONS CONTROLLING THE EVENT LOOP
231 An event loop is described by a C<struct ev_loop *>. The library knows two
232 types of such loops, the I<default> loop, which supports signals and child
233 events, and dynamically created loops which do not.
235 If you use threads, a common model is to run the default event loop
236 in your main thread (or in a separate thread) and for each thread you
237 create, you also create another event loop. Libev itself does no locking
238 whatsoever, so if you mix calls to the same event loop in different
239 threads, make sure you lock (this is usually a bad idea, though, even if
240 done correctly, because it's hideous and inefficient).
244 =item struct ev_loop *ev_default_loop (unsigned int flags)
246 This will initialise the default event loop if it hasn't been initialised
247 yet and return it. If the default loop could not be initialised, returns
248 false. If it already was initialised it simply returns it (and ignores the
249 flags. If that is troubling you, check C<ev_backend ()> afterwards).
251 If you don't know what event loop to use, use the one returned from this
254 The flags argument can be used to specify special behaviour or specific
255 backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
257 The following flags are supported:
263 The default flags value. Use this if you have no clue (it's the right
266 =item C<EVFLAG_NOENV>
268 If this flag bit is ored into the flag value (or the program runs setuid
269 or setgid) then libev will I<not> look at the environment variable
270 C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
271 override the flags completely if it is found in the environment. This is
272 useful to try out specific backends to test their performance, or to work
275 =item C<EVFLAG_FORKCHECK>
277 Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
278 a fork, you can also make libev check for a fork in each iteration by
281 This works by calling C<getpid ()> on every iteration of the loop,
282 and thus this might slow down your event loop if you do a lot of loop
283 iterations and little real work, but is usually not noticeable (on my
284 Linux system for example, C<getpid> is actually a simple 5-insn sequence
285 without a syscall and thus I<very> fast, but my Linux system also has
286 C<pthread_atfork> which is even faster).
288 The big advantage of this flag is that you can forget about fork (and
289 forget about forgetting to tell libev about forking) when you use this
292 This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
293 environment variable.
295 =item C<EVBACKEND_SELECT> (value 1, portable select backend)
297 This is your standard select(2) backend. Not I<completely> standard, as
298 libev tries to roll its own fd_set with no limits on the number of fds,
299 but if that fails, expect a fairly low limit on the number of fds when
300 using this backend. It doesn't scale too well (O(highest_fd)), but its usually
301 the fastest backend for a low number of fds.
303 =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
305 And this is your standard poll(2) backend. It's more complicated than
306 select, but handles sparse fds better and has no artificial limit on the
307 number of fds you can use (except it will slow down considerably with a
308 lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
310 =item C<EVBACKEND_EPOLL> (value 4, Linux)
312 For few fds, this backend is a bit little slower than poll and select,
313 but it scales phenomenally better. While poll and select usually scale like
314 O(total_fds) where n is the total number of fds (or the highest fd), epoll scales
315 either O(1) or O(active_fds).
317 While stopping and starting an I/O watcher in the same iteration will
318 result in some caching, there is still a syscall per such incident
319 (because the fd could point to a different file description now), so its
320 best to avoid that. Also, dup()ed file descriptors might not work very
321 well if you register events for both fds.
323 Please note that epoll sometimes generates spurious notifications, so you
324 need to use non-blocking I/O or other means to avoid blocking when no data
325 (or space) is available.
327 =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
329 Kqueue deserves special mention, as at the time of this writing, it
330 was broken on all BSDs except NetBSD (usually it doesn't work with
331 anything but sockets and pipes, except on Darwin, where of course its
332 completely useless). For this reason its not being "autodetected"
333 unless you explicitly specify it explicitly in the flags (i.e. using
334 C<EVBACKEND_KQUEUE>).
336 It scales in the same way as the epoll backend, but the interface to the
337 kernel is more efficient (which says nothing about its actual speed, of
338 course). While starting and stopping an I/O watcher does not cause an
339 extra syscall as with epoll, it still adds up to four event changes per
340 incident, so its best to avoid that.
342 =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
344 This is not implemented yet (and might never be).
346 =item C<EVBACKEND_PORT> (value 32, Solaris 10)
348 This uses the Solaris 10 port mechanism. As with everything on Solaris,
349 it's really slow, but it still scales very well (O(active_fds)).
351 Please note that solaris ports can result in a lot of spurious
352 notifications, so you need to use non-blocking I/O or other means to avoid
353 blocking when no data (or space) is available.
355 =item C<EVBACKEND_ALL>
357 Try all backends (even potentially broken ones that wouldn't be tried
358 with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
359 C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
363 If one or more of these are ored into the flags value, then only these
364 backends will be tried (in the reverse order as given here). If none are
365 specified, most compiled-in backend will be tried, usually in reverse
366 order of their flag values :)
368 The most typical usage is like this:
370 if (!ev_default_loop (0))
371 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
373 Restrict libev to the select and poll backends, and do not allow
374 environment settings to be taken into account:
376 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
378 Use whatever libev has to offer, but make sure that kqueue is used if
379 available (warning, breaks stuff, best use only with your own private
380 event loop and only if you know the OS supports your types of fds):
382 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
384 =item struct ev_loop *ev_loop_new (unsigned int flags)
386 Similar to C<ev_default_loop>, but always creates a new event loop that is
387 always distinct from the default loop. Unlike the default loop, it cannot
388 handle signal and child watchers, and attempts to do so will be greeted by
389 undefined behaviour (or a failed assertion if assertions are enabled).
391 Example: Try to create a event loop that uses epoll and nothing else.
393 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
395 fatal ("no epoll found here, maybe it hides under your chair");
397 =item ev_default_destroy ()
399 Destroys the default loop again (frees all memory and kernel state
400 etc.). None of the active event watchers will be stopped in the normal
401 sense, so e.g. C<ev_is_active> might still return true. It is your
402 responsibility to either stop all watchers cleanly yoursef I<before>
403 calling this function, or cope with the fact afterwards (which is usually
404 the easiest thing, youc na just ignore the watchers and/or C<free ()> them
407 =item ev_loop_destroy (loop)
409 Like C<ev_default_destroy>, but destroys an event loop created by an
410 earlier call to C<ev_loop_new>.
412 =item ev_default_fork ()
414 This function reinitialises the kernel state for backends that have
415 one. Despite the name, you can call it anytime, but it makes most sense
416 after forking, in either the parent or child process (or both, but that
417 again makes little sense).
419 You I<must> call this function in the child process after forking if and
420 only if you want to use the event library in both processes. If you just
421 fork+exec, you don't have to call it.
423 The function itself is quite fast and it's usually not a problem to call
424 it just in case after a fork. To make this easy, the function will fit in
425 quite nicely into a call to C<pthread_atfork>:
427 pthread_atfork (0, 0, ev_default_fork);
429 At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
430 without calling this function, so if you force one of those backends you
433 =item ev_loop_fork (loop)
435 Like C<ev_default_fork>, but acts on an event loop created by
436 C<ev_loop_new>. Yes, you have to call this on every allocated event loop
437 after fork, and how you do this is entirely your own problem.
439 =item unsigned int ev_loop_count (loop)
441 Returns the count of loop iterations for the loop, which is identical to
442 the number of times libev did poll for new events. It starts at C<0> and
443 happily wraps around with enough iterations.
445 This value can sometimes be useful as a generation counter of sorts (it
446 "ticks" the number of loop iterations), as it roughly corresponds with
447 C<ev_prepare> and C<ev_check> calls.
449 =item unsigned int ev_backend (loop)
451 Returns one of the C<EVBACKEND_*> flags indicating the event backend in
454 =item ev_tstamp ev_now (loop)
456 Returns the current "event loop time", which is the time the event loop
457 received events and started processing them. This timestamp does not
458 change as long as callbacks are being processed, and this is also the base
459 time used for relative timers. You can treat it as the timestamp of the
460 event occuring (or more correctly, libev finding out about it).
462 =item ev_loop (loop, int flags)
464 Finally, this is it, the event handler. This function usually is called
465 after you initialised all your watchers and you want to start handling
468 If the flags argument is specified as C<0>, it will not return until
469 either no event watchers are active anymore or C<ev_unloop> was called.
471 Please note that an explicit C<ev_unloop> is usually better than
472 relying on all watchers to be stopped when deciding when a program has
473 finished (especially in interactive programs), but having a program that
474 automatically loops as long as it has to and no longer by virtue of
475 relying on its watchers stopping correctly is a thing of beauty.
477 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
478 those events and any outstanding ones, but will not block your process in
479 case there are no events and will return after one iteration of the loop.
481 A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
482 neccessary) and will handle those and any outstanding ones. It will block
483 your process until at least one new event arrives, and will return after
484 one iteration of the loop. This is useful if you are waiting for some
485 external event in conjunction with something not expressible using other
486 libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
487 usually a better approach for this kind of thing.
489 Here are the gory details of what C<ev_loop> does:
491 * If there are no active watchers (reference count is zero), return.
492 - Queue prepare watchers and then call all outstanding watchers.
493 - If we have been forked, recreate the kernel state.
494 - Update the kernel state with all outstanding changes.
495 - Update the "event loop time".
496 - Calculate for how long to block.
497 - Block the process, waiting for any events.
498 - Queue all outstanding I/O (fd) events.
499 - Update the "event loop time" and do time jump handling.
500 - Queue all outstanding timers.
501 - Queue all outstanding periodics.
502 - If no events are pending now, queue all idle watchers.
503 - Queue all check watchers.
504 - Call all queued watchers in reverse order (i.e. check watchers first).
505 Signals and child watchers are implemented as I/O watchers, and will
506 be handled here by queueing them when their watcher gets executed.
507 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
508 were used, return, otherwise continue with step *.
510 Example: Queue some jobs and then loop until no events are outsanding
513 ... queue jobs here, make sure they register event watchers as long
514 ... as they still have work to do (even an idle watcher will do..)
515 ev_loop (my_loop, 0);
518 =item ev_unloop (loop, how)
520 Can be used to make a call to C<ev_loop> return early (but only after it
521 has processed all outstanding events). The C<how> argument must be either
522 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
523 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
527 =item ev_unref (loop)
529 Ref/unref can be used to add or remove a reference count on the event
530 loop: Every watcher keeps one reference, and as long as the reference
531 count is nonzero, C<ev_loop> will not return on its own. If you have
532 a watcher you never unregister that should not keep C<ev_loop> from
533 returning, ev_unref() after starting, and ev_ref() before stopping it. For
534 example, libev itself uses this for its internal signal pipe: It is not
535 visible to the libev user and should not keep C<ev_loop> from exiting if
536 no event watchers registered by it are active. It is also an excellent
537 way to do this for generic recurring timers or from within third-party
538 libraries. Just remember to I<unref after start> and I<ref before stop>.
540 Example: Create a signal watcher, but keep it from keeping C<ev_loop>
541 running when nothing else is active.
543 struct ev_signal exitsig;
544 ev_signal_init (&exitsig, sig_cb, SIGINT);
545 ev_signal_start (loop, &exitsig);
548 Example: For some weird reason, unregister the above signal handler again.
551 ev_signal_stop (loop, &exitsig);
556 =head1 ANATOMY OF A WATCHER
558 A watcher is a structure that you create and register to record your
559 interest in some event. For instance, if you want to wait for STDIN to
560 become readable, you would create an C<ev_io> watcher for that:
562 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
565 ev_unloop (loop, EVUNLOOP_ALL);
568 struct ev_loop *loop = ev_default_loop (0);
569 struct ev_io stdin_watcher;
570 ev_init (&stdin_watcher, my_cb);
571 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
572 ev_io_start (loop, &stdin_watcher);
575 As you can see, you are responsible for allocating the memory for your
576 watcher structures (and it is usually a bad idea to do this on the stack,
577 although this can sometimes be quite valid).
579 Each watcher structure must be initialised by a call to C<ev_init
580 (watcher *, callback)>, which expects a callback to be provided. This
581 callback gets invoked each time the event occurs (or, in the case of io
582 watchers, each time the event loop detects that the file descriptor given
583 is readable and/or writable).
585 Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
586 with arguments specific to this watcher type. There is also a macro
587 to combine initialisation and setting in one call: C<< ev_<type>_init
588 (watcher *, callback, ...) >>.
590 To make the watcher actually watch out for events, you have to start it
591 with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
592 *) >>), and you can stop watching for events at any time by calling the
593 corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
595 As long as your watcher is active (has been started but not stopped) you
596 must not touch the values stored in it. Most specifically you must never
597 reinitialise it or call its C<set> macro.
599 Each and every callback receives the event loop pointer as first, the
600 registered watcher structure as second, and a bitset of received events as
603 The received events usually include a single bit per event type received
604 (you can receive multiple events at the same time). The possible bit masks
613 The file descriptor in the C<ev_io> watcher has become readable and/or
618 The C<ev_timer> watcher has timed out.
622 The C<ev_periodic> watcher has timed out.
626 The signal specified in the C<ev_signal> watcher has been received by a thread.
630 The pid specified in the C<ev_child> watcher has received a status change.
634 The path specified in the C<ev_stat> watcher changed its attributes somehow.
638 The C<ev_idle> watcher has determined that you have nothing better to do.
644 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
645 to gather new events, and all C<ev_check> watchers are invoked just after
646 C<ev_loop> has gathered them, but before it invokes any callbacks for any
647 received events. Callbacks of both watcher types can start and stop as
648 many watchers as they want, and all of them will be taken into account
649 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
650 C<ev_loop> from blocking).
654 The embedded event loop specified in the C<ev_embed> watcher needs attention.
658 The event loop has been resumed in the child process after fork (see
663 An unspecified error has occured, the watcher has been stopped. This might
664 happen because the watcher could not be properly started because libev
665 ran out of memory, a file descriptor was found to be closed or any other
666 problem. You best act on it by reporting the problem and somehow coping
667 with the watcher being stopped.
669 Libev will usually signal a few "dummy" events together with an error,
670 for example it might indicate that a fd is readable or writable, and if
671 your callbacks is well-written it can just attempt the operation and cope
672 with the error from read() or write(). This will not work in multithreaded
673 programs, though, so beware.
677 =head2 GENERIC WATCHER FUNCTIONS
679 In the following description, C<TYPE> stands for the watcher type,
680 e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
684 =item C<ev_init> (ev_TYPE *watcher, callback)
686 This macro initialises the generic portion of a watcher. The contents
687 of the watcher object can be arbitrary (so C<malloc> will do). Only
688 the generic parts of the watcher are initialised, you I<need> to call
689 the type-specific C<ev_TYPE_set> macro afterwards to initialise the
690 type-specific parts. For each type there is also a C<ev_TYPE_init> macro
691 which rolls both calls into one.
693 You can reinitialise a watcher at any time as long as it has been stopped
694 (or never started) and there are no pending events outstanding.
696 The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,
699 =item C<ev_TYPE_set> (ev_TYPE *, [args])
701 This macro initialises the type-specific parts of a watcher. You need to
702 call C<ev_init> at least once before you call this macro, but you can
703 call C<ev_TYPE_set> any number of times. You must not, however, call this
704 macro on a watcher that is active (it can be pending, however, which is a
705 difference to the C<ev_init> macro).
707 Although some watcher types do not have type-specific arguments
708 (e.g. C<ev_prepare>) you still need to call its C<set> macro.
710 =item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
712 This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
713 calls into a single call. This is the most convinient method to initialise
714 a watcher. The same limitations apply, of course.
716 =item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
718 Starts (activates) the given watcher. Only active watchers will receive
719 events. If the watcher is already active nothing will happen.
721 =item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
723 Stops the given watcher again (if active) and clears the pending
724 status. It is possible that stopped watchers are pending (for example,
725 non-repeating timers are being stopped when they become pending), but
726 C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If
727 you want to free or reuse the memory used by the watcher it is therefore a
728 good idea to always call its C<ev_TYPE_stop> function.
730 =item bool ev_is_active (ev_TYPE *watcher)
732 Returns a true value iff the watcher is active (i.e. it has been started
733 and not yet been stopped). As long as a watcher is active you must not modify
736 =item bool ev_is_pending (ev_TYPE *watcher)
738 Returns a true value iff the watcher is pending, (i.e. it has outstanding
739 events but its callback has not yet been invoked). As long as a watcher
740 is pending (but not active) you must not call an init function on it (but
741 C<ev_TYPE_set> is safe) and you must make sure the watcher is available to
742 libev (e.g. you cnanot C<free ()> it).
744 =item callback ev_cb (ev_TYPE *watcher)
746 Returns the callback currently set on the watcher.
748 =item ev_cb_set (ev_TYPE *watcher, callback)
750 Change the callback. You can change the callback at virtually any time
753 =item ev_set_priority (ev_TYPE *watcher, priority)
755 =item int ev_priority (ev_TYPE *watcher)
757 Set and query the priority of the watcher. The priority is a small
758 integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
759 (default: C<-2>). Pending watchers with higher priority will be invoked
760 before watchers with lower priority, but priority will not keep watchers
761 from being executed (except for C<ev_idle> watchers).
763 This means that priorities are I<only> used for ordering callback
764 invocation after new events have been received. This is useful, for
765 example, to reduce latency after idling, or more often, to bind two
766 watchers on the same event and make sure one is called first.
768 If you need to suppress invocation when higher priority events are pending
769 you need to look at C<ev_idle> watchers, which provide this functionality.
771 The default priority used by watchers when no priority has been set is
772 always C<0>, which is supposed to not be too high and not be too low :).
774 Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
775 fine, as long as you do not mind that the priority value you query might
776 or might not have been adjusted to be within valid range.
781 =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
783 Each watcher has, by default, a member C<void *data> that you can change
784 and read at any time, libev will completely ignore it. This can be used
785 to associate arbitrary data with your watcher. If you need more data and
786 don't want to allocate memory and store a pointer to it in that data
787 member, you can also "subclass" the watcher type and provide your own
795 struct whatever *mostinteresting;
798 And since your callback will be called with a pointer to the watcher, you
799 can cast it back to your own type:
801 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
803 struct my_io *w = (struct my_io *)w_;
807 More interesting and less C-conformant ways of casting your callback type
808 instead have been omitted.
810 Another common scenario is having some data structure with multiple
820 In this case getting the pointer to C<my_biggy> is a bit more complicated,
821 you need to use C<offsetof>:
826 t1_cb (EV_P_ struct ev_timer *w, int revents)
828 struct my_biggy big = (struct my_biggy *
829 (((char *)w) - offsetof (struct my_biggy, t1));
833 t2_cb (EV_P_ struct ev_timer *w, int revents)
835 struct my_biggy big = (struct my_biggy *
836 (((char *)w) - offsetof (struct my_biggy, t2));
842 This section describes each watcher in detail, but will not repeat
843 information given in the last section. Any initialisation/set macros,
844 functions and members specific to the watcher type are explained.
846 Members are additionally marked with either I<[read-only]>, meaning that,
847 while the watcher is active, you can look at the member and expect some
848 sensible content, but you must not modify it (you can modify it while the
849 watcher is stopped to your hearts content), or I<[read-write]>, which
850 means you can expect it to have some sensible content while the watcher
851 is active, but you can also modify it. Modifying it may not do something
852 sensible or take immediate effect (or do anything at all), but libev will
853 not crash or malfunction in any way.
856 =head2 C<ev_io> - is this file descriptor readable or writable?
858 I/O watchers check whether a file descriptor is readable or writable
859 in each iteration of the event loop, or, more precisely, when reading
860 would not block the process and writing would at least be able to write
861 some data. This behaviour is called level-triggering because you keep
862 receiving events as long as the condition persists. Remember you can stop
863 the watcher if you don't want to act on the event and neither want to
864 receive future events.
866 In general you can register as many read and/or write event watchers per
867 fd as you want (as long as you don't confuse yourself). Setting all file
868 descriptors to non-blocking mode is also usually a good idea (but not
869 required if you know what you are doing).
871 You have to be careful with dup'ed file descriptors, though. Some backends
872 (the linux epoll backend is a notable example) cannot handle dup'ed file
873 descriptors correctly if you register interest in two or more fds pointing
874 to the same underlying file/socket/etc. description (that is, they share
875 the same underlying "file open").
877 If you must do this, then force the use of a known-to-be-good backend
878 (at the time of this writing, this includes only C<EVBACKEND_SELECT> and
881 Another thing you have to watch out for is that it is quite easy to
882 receive "spurious" readyness notifications, that is your callback might
883 be called with C<EV_READ> but a subsequent C<read>(2) will actually block
884 because there is no data. Not only are some backends known to create a
885 lot of those (for example solaris ports), it is very easy to get into
886 this situation even with a relatively standard program structure. Thus
887 it is best to always use non-blocking I/O: An extra C<read>(2) returning
888 C<EAGAIN> is far preferable to a program hanging until some data arrives.
890 If you cannot run the fd in non-blocking mode (for example you should not
891 play around with an Xlib connection), then you have to seperately re-test
892 whether a file descriptor is really ready with a known-to-be good interface
893 such as poll (fortunately in our Xlib example, Xlib already does this on
894 its own, so its quite safe to use).
898 =item ev_io_init (ev_io *, callback, int fd, int events)
900 =item ev_io_set (ev_io *, int fd, int events)
902 Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
903 rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or
904 C<EV_READ | EV_WRITE> to receive the given events.
906 =item int fd [read-only]
908 The file descriptor being watched.
910 =item int events [read-only]
912 The events being watched.
916 Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
917 readable, but only once. Since it is likely line-buffered, you could
918 attempt to read a whole line in the callback.
921 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
923 ev_io_stop (loop, w);
924 .. read from stdin here (or from w->fd) and haqndle any I/O errors
928 struct ev_loop *loop = ev_default_init (0);
929 struct ev_io stdin_readable;
930 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
931 ev_io_start (loop, &stdin_readable);
935 =head2 C<ev_timer> - relative and optionally repeating timeouts
937 Timer watchers are simple relative timers that generate an event after a
938 given time, and optionally repeating in regular intervals after that.
940 The timers are based on real time, that is, if you register an event that
941 times out after an hour and you reset your system clock to last years
942 time, it will still time out after (roughly) and hour. "Roughly" because
943 detecting time jumps is hard, and some inaccuracies are unavoidable (the
944 monotonic clock option helps a lot here).
946 The relative timeouts are calculated relative to the C<ev_now ()>
947 time. This is usually the right thing as this timestamp refers to the time
948 of the event triggering whatever timeout you are modifying/starting. If
949 you suspect event processing to be delayed and you I<need> to base the timeout
950 on the current time, use something like this to adjust for this:
952 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
954 The callback is guarenteed to be invoked only when its timeout has passed,
955 but if multiple timers become ready during the same loop iteration then
956 order of execution is undefined.
960 =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
962 =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
964 Configure the timer to trigger after C<after> seconds. If C<repeat> is
965 C<0.>, then it will automatically be stopped. If it is positive, then the
966 timer will automatically be configured to trigger again C<repeat> seconds
967 later, again, and again, until stopped manually.
969 The timer itself will do a best-effort at avoiding drift, that is, if you
970 configure a timer to trigger every 10 seconds, then it will trigger at
971 exactly 10 second intervals. If, however, your program cannot keep up with
972 the timer (because it takes longer than those 10 seconds to do stuff) the
973 timer will not fire more than once per event loop iteration.
975 =item ev_timer_again (loop)
977 This will act as if the timer timed out and restart it again if it is
978 repeating. The exact semantics are:
980 If the timer is pending, its pending status is cleared.
982 If the timer is started but nonrepeating, stop it (as if it timed out).
984 If the timer is repeating, either start it if necessary (with the
985 C<repeat> value), or reset the running timer to the C<repeat> value.
987 This sounds a bit complicated, but here is a useful and typical
988 example: Imagine you have a tcp connection and you want a so-called idle
989 timeout, that is, you want to be called when there have been, say, 60
990 seconds of inactivity on the socket. The easiest way to do this is to
991 configure an C<ev_timer> with a C<repeat> value of C<60> and then call
992 C<ev_timer_again> each time you successfully read or write some data. If
993 you go into an idle state where you do not expect data to travel on the
994 socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
995 automatically restart it if need be.
997 That means you can ignore the C<after> value and C<ev_timer_start>
998 altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1000 ev_timer_init (timer, callback, 0., 5.);
1001 ev_timer_again (loop, timer);
1004 ev_timer_again (loop, timer);
1007 ev_timer_again (loop, timer);
1009 This is more slightly efficient then stopping/starting the timer each time
1010 you want to modify its timeout value.
1012 =item ev_tstamp repeat [read-write]
1014 The current C<repeat> value. Will be used each time the watcher times out
1015 or C<ev_timer_again> is called and determines the next timeout (if any),
1016 which is also when any modifications are taken into account.
1020 Example: Create a timer that fires after 60 seconds.
1023 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1025 .. one minute over, w is actually stopped right here
1028 struct ev_timer mytimer;
1029 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1030 ev_timer_start (loop, &mytimer);
1032 Example: Create a timeout timer that times out after 10 seconds of
1036 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1038 .. ten seconds without any activity
1041 struct ev_timer mytimer;
1042 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1043 ev_timer_again (&mytimer); /* start timer */
1046 // and in some piece of code that gets executed on any "activity":
1047 // reset the timeout to start ticking again at 10 seconds
1048 ev_timer_again (&mytimer);
1051 =head2 C<ev_periodic> - to cron or not to cron?
1053 Periodic watchers are also timers of a kind, but they are very versatile
1054 (and unfortunately a bit complex).
1056 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1057 but on wallclock time (absolute time). You can tell a periodic watcher
1058 to trigger "at" some specific point in time. For example, if you tell a
1059 periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
1060 + 10.>) and then reset your system clock to the last year, then it will
1061 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1062 roughly 10 seconds later and of course not if you reset your system time
1065 They can also be used to implement vastly more complex timers, such as
1066 triggering an event on eahc midnight, local time.
1068 As with timers, the callback is guarenteed to be invoked only when the
1069 time (C<at>) has been passed, but if multiple periodic timers become ready
1070 during the same loop iteration then order of execution is undefined.
1074 =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1076 =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1078 Lots of arguments, lets sort it out... There are basically three modes of
1079 operation, and we will explain them from simplest to complex:
1083 =item * absolute timer (interval = reschedule_cb = 0)
1085 In this configuration the watcher triggers an event at the wallclock time
1086 C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1087 that is, if it is to be run at January 1st 2011 then it will run when the
1088 system time reaches or surpasses this time.
1090 =item * non-repeating interval timer (interval > 0, reschedule_cb = 0)
1092 In this mode the watcher will always be scheduled to time out at the next
1093 C<at + N * interval> time (for some integer N) and then repeat, regardless
1096 This can be used to create timers that do not drift with respect to system
1099 ev_periodic_set (&periodic, 0., 3600., 0);
1101 This doesn't mean there will always be 3600 seconds in between triggers,
1102 but only that the the callback will be called when the system time shows a
1103 full hour (UTC), or more correctly, when the system time is evenly divisible
1106 Another way to think about it (for the mathematically inclined) is that
1107 C<ev_periodic> will try to run the callback in this mode at the next possible
1108 time where C<time = at (mod interval)>, regardless of any time jumps.
1110 =item * manual reschedule mode (reschedule_cb = callback)
1112 In this mode the values for C<interval> and C<at> are both being
1113 ignored. Instead, each time the periodic watcher gets scheduled, the
1114 reschedule callback will be called with the watcher as first, and the
1115 current time as second argument.
1117 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1118 ever, or make any event loop modifications>. If you need to stop it,
1119 return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1120 starting a prepare watcher).
1122 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1123 ev_tstamp now)>, e.g.:
1125 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1130 It must return the next time to trigger, based on the passed time value
1131 (that is, the lowest time value larger than to the second argument). It
1132 will usually be called just before the callback will be triggered, but
1133 might be called at other times, too.
1135 NOTE: I<< This callback must always return a time that is later than the
1136 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
1138 This can be used to create very complex timers, such as a timer that
1139 triggers on each midnight, local time. To do this, you would calculate the
1140 next midnight after C<now> and return the timestamp value for this. How
1141 you do this is, again, up to you (but it is not trivial, which is the main
1142 reason I omitted it as an example).
1146 =item ev_periodic_again (loop, ev_periodic *)
1148 Simply stops and restarts the periodic watcher again. This is only useful
1149 when you changed some parameters or the reschedule callback would return
1150 a different time than the last time it was called (e.g. in a crond like
1151 program when the crontabs have changed).
1153 =item ev_tstamp interval [read-write]
1155 The current interval value. Can be modified any time, but changes only
1156 take effect when the periodic timer fires or C<ev_periodic_again> is being
1159 =item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]
1161 The current reschedule callback, or C<0>, if this functionality is
1162 switched off. Can be changed any time, but changes only take effect when
1163 the periodic timer fires or C<ev_periodic_again> is being called.
1167 Example: Call a callback every hour, or, more precisely, whenever the
1168 system clock is divisible by 3600. The callback invocation times have
1169 potentially a lot of jittering, but good long-term stability.
1172 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1174 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1177 struct ev_periodic hourly_tick;
1178 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1179 ev_periodic_start (loop, &hourly_tick);
1181 Example: The same as above, but use a reschedule callback to do it:
1186 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1188 return fmod (now, 3600.) + 3600.;
1191 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1193 Example: Call a callback every hour, starting now:
1195 struct ev_periodic hourly_tick;
1196 ev_periodic_init (&hourly_tick, clock_cb,
1197 fmod (ev_now (loop), 3600.), 3600., 0);
1198 ev_periodic_start (loop, &hourly_tick);
1201 =head2 C<ev_signal> - signal me when a signal gets signalled!
1203 Signal watchers will trigger an event when the process receives a specific
1204 signal one or more times. Even though signals are very asynchronous, libev
1205 will try it's best to deliver signals synchronously, i.e. as part of the
1206 normal event processing, like any other event.
1208 You can configure as many watchers as you like per signal. Only when the
1209 first watcher gets started will libev actually register a signal watcher
1210 with the kernel (thus it coexists with your own signal handlers as long
1211 as you don't register any with libev). Similarly, when the last signal
1212 watcher for a signal is stopped libev will reset the signal handler to
1213 SIG_DFL (regardless of what it was set to before).
1217 =item ev_signal_init (ev_signal *, callback, int signum)
1219 =item ev_signal_set (ev_signal *, int signum)
1221 Configures the watcher to trigger on the given signal number (usually one
1222 of the C<SIGxxx> constants).
1224 =item int signum [read-only]
1226 The signal the watcher watches out for.
1231 =head2 C<ev_child> - watch out for process status changes
1233 Child watchers trigger when your process receives a SIGCHLD in response to
1234 some child status changes (most typically when a child of yours dies).
1238 =item ev_child_init (ev_child *, callback, int pid)
1240 =item ev_child_set (ev_child *, int pid)
1242 Configures the watcher to wait for status changes of process C<pid> (or
1243 I<any> process if C<pid> is specified as C<0>). The callback can look
1244 at the C<rstatus> member of the C<ev_child> watcher structure to see
1245 the status word (use the macros from C<sys/wait.h> and see your systems
1246 C<waitpid> documentation). The C<rpid> member contains the pid of the
1247 process causing the status change.
1249 =item int pid [read-only]
1251 The process id this watcher watches out for, or C<0>, meaning any process id.
1253 =item int rpid [read-write]
1255 The process id that detected a status change.
1257 =item int rstatus [read-write]
1259 The process exit/trace status caused by C<rpid> (see your systems
1260 C<waitpid> and C<sys/wait.h> documentation for details).
1264 Example: Try to exit cleanly on SIGINT and SIGTERM.
1267 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1269 ev_unloop (loop, EVUNLOOP_ALL);
1272 struct ev_signal signal_watcher;
1273 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1274 ev_signal_start (loop, &sigint_cb);
1277 =head2 C<ev_stat> - did the file attributes just change?
1279 This watches a filesystem path for attribute changes. That is, it calls
1280 C<stat> regularly (or when the OS says it changed) and sees if it changed
1281 compared to the last time, invoking the callback if it did.
1283 The path does not need to exist: changing from "path exists" to "path does
1284 not exist" is a status change like any other. The condition "path does
1285 not exist" is signified by the C<st_nlink> field being zero (which is
1286 otherwise always forced to be at least one) and all the other fields of
1287 the stat buffer having unspecified contents.
1289 The path I<should> be absolute and I<must not> end in a slash. If it is
1290 relative and your working directory changes, the behaviour is undefined.
1292 Since there is no standard to do this, the portable implementation simply
1293 calls C<stat (2)> regularly on the path to see if it changed somehow. You
1294 can specify a recommended polling interval for this case. If you specify
1295 a polling interval of C<0> (highly recommended!) then a I<suitable,
1296 unspecified default> value will be used (which you can expect to be around
1297 five seconds, although this might change dynamically). Libev will also
1298 impose a minimum interval which is currently around C<0.1>, but thats
1301 This watcher type is not meant for massive numbers of stat watchers,
1302 as even with OS-supported change notifications, this can be
1305 At the time of this writing, only the Linux inotify interface is
1306 implemented (implementing kqueue support is left as an exercise for the
1307 reader). Inotify will be used to give hints only and should not change the
1308 semantics of C<ev_stat> watchers, which means that libev sometimes needs
1309 to fall back to regular polling again even with inotify, but changes are
1310 usually detected immediately, and if the file exists there will be no
1315 =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1317 =item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
1319 Configures the watcher to wait for status changes of the given
1320 C<path>. The C<interval> is a hint on how quickly a change is expected to
1321 be detected and should normally be specified as C<0> to let libev choose
1322 a suitable value. The memory pointed to by C<path> must point to the same
1323 path for as long as the watcher is active.
1325 The callback will be receive C<EV_STAT> when a change was detected,
1326 relative to the attributes at the time the watcher was started (or the
1327 last change was detected).
1329 =item ev_stat_stat (ev_stat *)
1331 Updates the stat buffer immediately with new values. If you change the
1332 watched path in your callback, you could call this fucntion to avoid
1333 detecting this change (while introducing a race condition). Can also be
1334 useful simply to find out the new values.
1336 =item ev_statdata attr [read-only]
1338 The most-recently detected attributes of the file. Although the type is of
1339 C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1340 suitable for your system. If the C<st_nlink> member is C<0>, then there
1341 was some error while C<stat>ing the file.
1343 =item ev_statdata prev [read-only]
1345 The previous attributes of the file. The callback gets invoked whenever
1348 =item ev_tstamp interval [read-only]
1350 The specified interval.
1352 =item const char *path [read-only]
1354 The filesystem path that is being watched.
1358 Example: Watch C</etc/passwd> for attribute changes.
1361 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1363 /* /etc/passwd changed in some way */
1364 if (w->attr.st_nlink)
1366 printf ("passwd current size %ld\n", (long)w->attr.st_size);
1367 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1368 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1371 /* you shalt not abuse printf for puts */
1372 puts ("wow, /etc/passwd is not there, expect problems. "
1373 "if this is windows, they already arrived\n");
1379 ev_stat_init (&passwd, passwd_cb, "/etc/passwd");
1380 ev_stat_start (loop, &passwd);
1383 =head2 C<ev_idle> - when you've got nothing better to do...
1385 Idle watchers trigger events when no other events of the same or higher
1386 priority are pending (prepare, check and other idle watchers do not
1389 That is, as long as your process is busy handling sockets or timeouts
1390 (or even signals, imagine) of the same or higher priority it will not be
1391 triggered. But when your process is idle (or only lower-priority watchers
1392 are pending), the idle watchers are being called once per event loop
1393 iteration - until stopped, that is, or your process receives more events
1394 and becomes busy again with higher priority stuff.
1396 The most noteworthy effect is that as long as any idle watchers are
1397 active, the process will not block when waiting for new events.
1399 Apart from keeping your process non-blocking (which is a useful
1400 effect on its own sometimes), idle watchers are a good place to do
1401 "pseudo-background processing", or delay processing stuff to after the
1402 event loop has handled all outstanding events.
1406 =item ev_idle_init (ev_signal *, callback)
1408 Initialises and configures the idle watcher - it has no parameters of any
1409 kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1414 Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1415 callback, free it. Also, use no error checking, as usual.
1418 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1421 // now do something you wanted to do when the program has
1422 // no longer asnything immediate to do.
1425 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1426 ev_idle_init (idle_watcher, idle_cb);
1427 ev_idle_start (loop, idle_cb);
1430 =head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1432 Prepare and check watchers are usually (but not always) used in tandem:
1433 prepare watchers get invoked before the process blocks and check watchers
1436 You I<must not> call C<ev_loop> or similar functions that enter
1437 the current event loop from either C<ev_prepare> or C<ev_check>
1438 watchers. Other loops than the current one are fine, however. The
1439 rationale behind this is that you do not need to check for recursion in
1440 those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1441 C<ev_check> so if you have one watcher of each kind they will always be
1442 called in pairs bracketing the blocking call.
1444 Their main purpose is to integrate other event mechanisms into libev and
1445 their use is somewhat advanced. This could be used, for example, to track
1446 variable changes, implement your own watchers, integrate net-snmp or a
1447 coroutine library and lots more. They are also occasionally useful if
1448 you cache some data and want to flush it before blocking (for example,
1449 in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1452 This is done by examining in each prepare call which file descriptors need
1453 to be watched by the other library, registering C<ev_io> watchers for
1454 them and starting an C<ev_timer> watcher for any timeouts (many libraries
1455 provide just this functionality). Then, in the check watcher you check for
1456 any events that occured (by checking the pending status of all watchers
1457 and stopping them) and call back into the library. The I/O and timer
1458 callbacks will never actually be called (but must be valid nevertheless,
1459 because you never know, you know?).
1461 As another example, the Perl Coro module uses these hooks to integrate
1462 coroutines into libev programs, by yielding to other active coroutines
1463 during each prepare and only letting the process block if no coroutines
1464 are ready to run (it's actually more complicated: it only runs coroutines
1465 with priority higher than or equal to the event loop and one coroutine
1466 of lower priority, but only once, using idle watchers to keep the event
1467 loop from blocking if lower-priority coroutines are active, thus mapping
1468 low-priority coroutines to idle/background tasks).
1472 =item ev_prepare_init (ev_prepare *, callback)
1474 =item ev_check_init (ev_check *, callback)
1476 Initialises and configures the prepare or check watcher - they have no
1477 parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1478 macros, but using them is utterly, utterly and completely pointless.
1482 Example: To include a library such as adns, you would add IO watchers
1483 and a timeout watcher in a prepare handler, as required by libadns, and
1484 in a check watcher, destroy them and call into libadns. What follows is
1485 pseudo-code only of course:
1487 static ev_io iow [nfd];
1491 io_cb (ev_loop *loop, ev_io *w, int revents)
1493 // set the relevant poll flags
1494 // could also call adns_processreadable etc. here
1495 struct pollfd *fd = (struct pollfd *)w->data;
1496 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1497 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1500 // create io watchers for each fd and a timer before blocking
1502 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1504 int timeout = 3600000;
1505 struct pollfd fds [nfd];
1506 // actual code will need to loop here and realloc etc.
1507 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1509 /* the callback is illegal, but won't be called as we stop during check */
1510 ev_timer_init (&tw, 0, timeout * 1e-3);
1511 ev_timer_start (loop, &tw);
1513 // create on ev_io per pollfd
1514 for (int i = 0; i < nfd; ++i)
1516 ev_io_init (iow + i, io_cb, fds [i].fd,
1517 ((fds [i].events & POLLIN ? EV_READ : 0)
1518 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1520 fds [i].revents = 0;
1521 iow [i].data = fds + i;
1522 ev_io_start (loop, iow + i);
1526 // stop all watchers after blocking
1528 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1530 ev_timer_stop (loop, &tw);
1532 for (int i = 0; i < nfd; ++i)
1533 ev_io_stop (loop, iow + i);
1535 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1539 =head2 C<ev_embed> - when one backend isn't enough...
1541 This is a rather advanced watcher type that lets you embed one event loop
1542 into another (currently only C<ev_io> events are supported in the embedded
1543 loop, other types of watchers might be handled in a delayed or incorrect
1544 fashion and must not be used).
1546 There are primarily two reasons you would want that: work around bugs and
1549 As an example for a bug workaround, the kqueue backend might only support
1550 sockets on some platform, so it is unusable as generic backend, but you
1551 still want to make use of it because you have many sockets and it scales
1552 so nicely. In this case, you would create a kqueue-based loop and embed it
1553 into your default loop (which might use e.g. poll). Overall operation will
1554 be a bit slower because first libev has to poll and then call kevent, but
1555 at least you can use both at what they are best.
1557 As for prioritising I/O: rarely you have the case where some fds have
1558 to be watched and handled very quickly (with low latency), and even
1559 priorities and idle watchers might have too much overhead. In this case
1560 you would put all the high priority stuff in one loop and all the rest in
1561 a second one, and embed the second one in the first.
1563 As long as the watcher is active, the callback will be invoked every time
1564 there might be events pending in the embedded loop. The callback must then
1565 call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke
1566 their callbacks (you could also start an idle watcher to give the embedded
1567 loop strictly lower priority for example). You can also set the callback
1568 to C<0>, in which case the embed watcher will automatically execute the
1569 embedded loop sweep.
1571 As long as the watcher is started it will automatically handle events. The
1572 callback will be invoked whenever some events have been handled. You can
1573 set the callback to C<0> to avoid having to specify one if you are not
1576 Also, there have not currently been made special provisions for forking:
1577 when you fork, you not only have to call C<ev_loop_fork> on both loops,
1578 but you will also have to stop and restart any C<ev_embed> watchers
1581 Unfortunately, not all backends are embeddable, only the ones returned by
1582 C<ev_embeddable_backends> are, which, unfortunately, does not include any
1585 So when you want to use this feature you will always have to be prepared
1586 that you cannot get an embeddable loop. The recommended way to get around
1587 this is to have a separate variables for your embeddable loop, try to
1588 create it, and if that fails, use the normal loop for everything:
1590 struct ev_loop *loop_hi = ev_default_init (0);
1591 struct ev_loop *loop_lo = 0;
1592 struct ev_embed embed;
1594 // see if there is a chance of getting one that works
1595 // (remember that a flags value of 0 means autodetection)
1596 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1597 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1600 // if we got one, then embed it, otherwise default to loop_hi
1603 ev_embed_init (&embed, 0, loop_lo);
1604 ev_embed_start (loop_hi, &embed);
1611 =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1613 =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1615 Configures the watcher to embed the given loop, which must be
1616 embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1617 invoked automatically, otherwise it is the responsibility of the callback
1618 to invoke it (it will continue to be called until the sweep has been done,
1619 if you do not want thta, you need to temporarily stop the embed watcher).
1621 =item ev_embed_sweep (loop, ev_embed *)
1623 Make a single, non-blocking sweep over the embedded loop. This works
1624 similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1625 apropriate way for embedded loops.
1627 =item struct ev_loop *loop [read-only]
1629 The embedded event loop.
1634 =head2 C<ev_fork> - the audacity to resume the event loop after a fork
1636 Fork watchers are called when a C<fork ()> was detected (usually because
1637 whoever is a good citizen cared to tell libev about it by calling
1638 C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the
1639 event loop blocks next and before C<ev_check> watchers are being called,
1640 and only in the child after the fork. If whoever good citizen calling
1641 C<ev_default_fork> cheats and calls it in the wrong process, the fork
1642 handlers will be invoked, too, of course.
1646 =item ev_fork_init (ev_signal *, callback)
1648 Initialises and configures the fork watcher - it has no parameters of any
1649 kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
1655 =head1 OTHER FUNCTIONS
1657 There are some other functions of possible interest. Described. Here. Now.
1661 =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
1663 This function combines a simple timer and an I/O watcher, calls your
1664 callback on whichever event happens first and automatically stop both
1665 watchers. This is useful if you want to wait for a single event on an fd
1666 or timeout without having to allocate/configure/start/stop/free one or
1667 more watchers yourself.
1669 If C<fd> is less than 0, then no I/O watcher will be started and events
1670 is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
1671 C<events> set will be craeted and started.
1673 If C<timeout> is less than 0, then no timeout watcher will be
1674 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
1675 repeat = 0) will be started. While C<0> is a valid timeout, it is of
1678 The callback has the type C<void (*cb)(int revents, void *arg)> and gets
1679 passed an C<revents> set like normal event callbacks (a combination of
1680 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
1681 value passed to C<ev_once>:
1683 static void stdin_ready (int revents, void *arg)
1685 if (revents & EV_TIMEOUT)
1686 /* doh, nothing entered */;
1687 else if (revents & EV_READ)
1688 /* stdin might have data for us, joy! */;
1691 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
1693 =item ev_feed_event (ev_loop *, watcher *, int revents)
1695 Feeds the given event set into the event loop, as if the specified event
1696 had happened for the specified watcher (which must be a pointer to an
1697 initialised but not necessarily started event watcher).
1699 =item ev_feed_fd_event (ev_loop *, int fd, int revents)
1701 Feed an event on the given fd, as if a file descriptor backend detected
1702 the given events it.
1704 =item ev_feed_signal_event (ev_loop *loop, int signum)
1706 Feed an event as if the given signal occured (C<loop> must be the default
1712 =head1 LIBEVENT EMULATION
1714 Libev offers a compatibility emulation layer for libevent. It cannot
1715 emulate the internals of libevent, so here are some usage hints:
1719 =item * Use it by including <event.h>, as usual.
1721 =item * The following members are fully supported: ev_base, ev_callback,
1722 ev_arg, ev_fd, ev_res, ev_events.
1724 =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
1725 maintained by libev, it does not work exactly the same way as in libevent (consider
1728 =item * Priorities are not currently supported. Initialising priorities
1729 will fail and all watchers will have the same priority, even though there
1732 =item * Other members are not supported.
1734 =item * The libev emulation is I<not> ABI compatible to libevent, you need
1735 to use the libev header file and library.
1741 Libev comes with some simplistic wrapper classes for C++ that mainly allow
1742 you to use some convinience methods to start/stop watchers and also change
1743 the callback model to a model using method callbacks on objects.
1749 (it is not installed by default). This automatically includes F<ev.h>
1750 and puts all of its definitions (many of them macros) into the global
1751 namespace. All C++ specific things are put into the C<ev> namespace.
1753 It should support all the same embedding options as F<ev.h>, most notably
1756 Here is a list of things available in the C<ev> namespace:
1760 =item C<ev::READ>, C<ev::WRITE> etc.
1762 These are just enum values with the same values as the C<EV_READ> etc.
1763 macros from F<ev.h>.
1765 =item C<ev::tstamp>, C<ev::now>
1767 Aliases to the same types/functions as with the C<ev_> prefix.
1769 =item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
1771 For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
1772 the same name in the C<ev> namespace, with the exception of C<ev_signal>
1773 which is called C<ev::sig> to avoid clashes with the C<signal> macro
1774 defines by many implementations.
1776 All of those classes have these methods:
1780 =item ev::TYPE::TYPE (object *, object::method *)
1782 =item ev::TYPE::TYPE (object *, object::method *, struct ev_loop *)
1784 =item ev::TYPE::~TYPE
1786 The constructor takes a pointer to an object and a method pointer to
1787 the event handler callback to call in this class. The constructor calls
1788 C<ev_init> for you, which means you have to call the C<set> method
1789 before starting it. If you do not specify a loop then the constructor
1790 automatically associates the default loop with this watcher.
1792 The destructor automatically stops the watcher if it is active.
1794 =item w->set (struct ev_loop *)
1796 Associates a different C<struct ev_loop> with this watcher. You can only
1797 do this when the watcher is inactive (and not pending either).
1799 =item w->set ([args])
1801 Basically the same as C<ev_TYPE_set>, with the same args. Must be
1802 called at least once. Unlike the C counterpart, an active watcher gets
1803 automatically stopped and restarted.
1807 Starts the watcher. Note that there is no C<loop> argument as the
1808 constructor already takes the loop.
1812 Stops the watcher if it is active. Again, no C<loop> argument.
1814 =item w->again () C<ev::timer>, C<ev::periodic> only
1816 For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1817 C<ev_TYPE_again> function.
1819 =item w->sweep () C<ev::embed> only
1821 Invokes C<ev_embed_sweep>.
1823 =item w->update () C<ev::stat> only
1825 Invokes C<ev_stat_stat>.
1831 Example: Define a class with an IO and idle watcher, start one of them in
1836 ev_io io; void io_cb (ev::io &w, int revents);
1837 ev_idle idle void idle_cb (ev::idle &w, int revents);
1842 myclass::myclass (int fd)
1843 : io (this, &myclass::io_cb),
1844 idle (this, &myclass::idle_cb)
1846 io.start (fd, ev::READ);
1852 Libev can be compiled with a variety of options, the most fundemantal is
1853 C<EV_MULTIPLICITY>. This option determines whether (most) functions and
1854 callbacks have an initial C<struct ev_loop *> argument.
1856 To make it easier to write programs that cope with either variant, the
1857 following macros are defined:
1861 =item C<EV_A>, C<EV_A_>
1863 This provides the loop I<argument> for functions, if one is required ("ev
1864 loop argument"). The C<EV_A> form is used when this is the sole argument,
1865 C<EV_A_> is used when other arguments are following. Example:
1868 ev_timer_add (EV_A_ watcher);
1871 It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
1872 which is often provided by the following macro.
1874 =item C<EV_P>, C<EV_P_>
1876 This provides the loop I<parameter> for functions, if one is required ("ev
1877 loop parameter"). The C<EV_P> form is used when this is the sole parameter,
1878 C<EV_P_> is used when other parameters are following. Example:
1880 // this is how ev_unref is being declared
1881 static void ev_unref (EV_P);
1883 // this is how you can declare your typical callback
1884 static void cb (EV_P_ ev_timer *w, int revents)
1886 It declares a parameter C<loop> of type C<struct ev_loop *>, quite
1887 suitable for use with C<EV_A>.
1889 =item C<EV_DEFAULT>, C<EV_DEFAULT_>
1891 Similar to the other two macros, this gives you the value of the default
1892 loop, if multiple loops are supported ("ev loop default").
1896 Example: Declare and initialise a check watcher, utilising the above
1897 macros so it will work regardless of whether multiple loops are supported
1901 check_cb (EV_P_ ev_timer *w, int revents)
1903 ev_check_stop (EV_A_ w);
1907 ev_check_init (&check, check_cb);
1908 ev_check_start (EV_DEFAULT_ &check);
1909 ev_loop (EV_DEFAULT_ 0);
1913 Libev can (and often is) directly embedded into host
1914 applications. Examples of applications that embed it include the Deliantra
1915 Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
1918 The goal is to enable you to just copy the neecssary files into your
1919 source directory without having to change even a single line in them, so
1920 you can easily upgrade by simply copying (or having a checked-out copy of
1921 libev somewhere in your source tree).
1925 Depending on what features you need you need to include one or more sets of files
1928 =head3 CORE EVENT LOOP
1930 To include only the libev core (all the C<ev_*> functions), with manual
1931 configuration (no autoconf):
1933 #define EV_STANDALONE 1
1936 This will automatically include F<ev.h>, too, and should be done in a
1937 single C source file only to provide the function implementations. To use
1938 it, do the same for F<ev.h> in all files wishing to use this API (best
1939 done by writing a wrapper around F<ev.h> that you can include instead and
1940 where you can put other configuration options):
1942 #define EV_STANDALONE 1
1945 Both header files and implementation files can be compiled with a C++
1946 compiler (at least, thats a stated goal, and breakage will be treated
1949 You need the following files in your source tree, or in a directory
1950 in your include path (e.g. in libev/ when using -Ilibev):
1957 ev_win32.c required on win32 platforms only
1959 ev_select.c only when select backend is enabled (which is enabled by default)
1960 ev_poll.c only when poll backend is enabled (disabled by default)
1961 ev_epoll.c only when the epoll backend is enabled (disabled by default)
1962 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
1963 ev_port.c only when the solaris port backend is enabled (disabled by default)
1965 F<ev.c> includes the backend files directly when enabled, so you only need
1966 to compile this single file.
1968 =head3 LIBEVENT COMPATIBILITY API
1970 To include the libevent compatibility API, also include:
1974 in the file including F<ev.c>, and:
1978 in the files that want to use the libevent API. This also includes F<ev.h>.
1980 You need the following additional files for this:
1985 =head3 AUTOCONF SUPPORT
1987 Instead of using C<EV_STANDALONE=1> and providing your config in
1988 whatever way you want, you can also C<m4_include([libev.m4])> in your
1989 F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
1990 include F<config.h> and configure itself accordingly.
1992 For this of course you need the m4 file:
1996 =head2 PREPROCESSOR SYMBOLS/MACROS
1998 Libev can be configured via a variety of preprocessor symbols you have to define
1999 before including any of its files. The default is not to build for multiplicity
2000 and only include the select backend.
2006 Must always be C<1> if you do not use autoconf configuration, which
2007 keeps libev from including F<config.h>, and it also defines dummy
2008 implementations for some libevent functions (such as logging, which is not
2009 supported). It will also not define any of the structs usually found in
2010 F<event.h> that are not directly supported by the libev core alone.
2012 =item EV_USE_MONOTONIC
2014 If defined to be C<1>, libev will try to detect the availability of the
2015 monotonic clock option at both compiletime and runtime. Otherwise no use
2016 of the monotonic clock option will be attempted. If you enable this, you
2017 usually have to link against librt or something similar. Enabling it when
2018 the functionality isn't available is safe, though, althoguh you have
2019 to make sure you link against any libraries where the C<clock_gettime>
2020 function is hiding in (often F<-lrt>).
2022 =item EV_USE_REALTIME
2024 If defined to be C<1>, libev will try to detect the availability of the
2025 realtime clock option at compiletime (and assume its availability at
2026 runtime if successful). Otherwise no use of the realtime clock option will
2027 be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2028 (CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries
2029 in the description of C<EV_USE_MONOTONIC>, though.
2033 If undefined or defined to be C<1>, libev will compile in support for the
2034 C<select>(2) backend. No attempt at autodetection will be done: if no
2035 other method takes over, select will be it. Otherwise the select backend
2036 will not be compiled in.
2038 =item EV_SELECT_USE_FD_SET
2040 If defined to C<1>, then the select backend will use the system C<fd_set>
2041 structure. This is useful if libev doesn't compile due to a missing
2042 C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on
2043 exotic systems. This usually limits the range of file descriptors to some
2044 low limit such as 1024 or might have other limitations (winsocket only
2045 allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2046 influence the size of the C<fd_set> used.
2048 =item EV_SELECT_IS_WINSOCKET
2050 When defined to C<1>, the select backend will assume that
2051 select/socket/connect etc. don't understand file descriptors but
2052 wants osf handles on win32 (this is the case when the select to
2053 be used is the winsock select). This means that it will call
2054 C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2055 it is assumed that all these functions actually work on fds, even
2056 on win32. Should not be defined on non-win32 platforms.
2060 If defined to be C<1>, libev will compile in support for the C<poll>(2)
2061 backend. Otherwise it will be enabled on non-win32 platforms. It
2062 takes precedence over select.
2066 If defined to be C<1>, libev will compile in support for the Linux
2067 C<epoll>(7) backend. Its availability will be detected at runtime,
2068 otherwise another method will be used as fallback. This is the
2069 preferred backend for GNU/Linux systems.
2073 If defined to be C<1>, libev will compile in support for the BSD style
2074 C<kqueue>(2) backend. Its actual availability will be detected at runtime,
2075 otherwise another method will be used as fallback. This is the preferred
2076 backend for BSD and BSD-like systems, although on most BSDs kqueue only
2077 supports some types of fds correctly (the only platform we found that
2078 supports ptys for example was NetBSD), so kqueue might be compiled in, but
2079 not be used unless explicitly requested. The best way to use it is to find
2080 out whether kqueue supports your type of fd properly and use an embedded
2085 If defined to be C<1>, libev will compile in support for the Solaris
2086 10 port style backend. Its availability will be detected at runtime,
2087 otherwise another method will be used as fallback. This is the preferred
2088 backend for Solaris 10 systems.
2090 =item EV_USE_DEVPOLL
2092 reserved for future expansion, works like the USE symbols above.
2094 =item EV_USE_INOTIFY
2096 If defined to be C<1>, libev will compile in support for the Linux inotify
2097 interface to speed up C<ev_stat> watchers. Its actual availability will
2098 be detected at runtime.
2102 The name of the F<ev.h> header file used to include it. The default if
2103 undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This
2104 can be used to virtually rename the F<ev.h> header file in case of conflicts.
2108 If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2109 F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2114 Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2115 of how the F<event.h> header can be found.
2119 If defined to be C<0>, then F<ev.h> will not define any function
2120 prototypes, but still define all the structs and other symbols. This is
2121 occasionally useful if you want to provide your own wrapper functions
2122 around libev functions.
2124 =item EV_MULTIPLICITY
2126 If undefined or defined to C<1>, then all event-loop-specific functions
2127 will have the C<struct ev_loop *> as first argument, and you can create
2128 additional independent event loops. Otherwise there will be no support
2129 for multiple event loops and there is no first event loop pointer
2130 argument. Instead, all functions act on the single default loop.
2136 The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2137 C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2138 provide for more priorities by overriding those symbols (usually defined
2139 to be C<-2> and C<2>, respectively).
2141 When doing priority-based operations, libev usually has to linearly search
2142 all the priorities, so having many of them (hundreds) uses a lot of space
2143 and time, so using the defaults of five priorities (-2 .. +2) is usually
2146 If your embedding app does not need any priorities, defining these both to
2147 C<0> will save some memory and cpu.
2149 =item EV_PERIODIC_ENABLE
2151 If undefined or defined to be C<1>, then periodic timers are supported. If
2152 defined to be C<0>, then they are not. Disabling them saves a few kB of
2155 =item EV_IDLE_ENABLE
2157 If undefined or defined to be C<1>, then idle watchers are supported. If
2158 defined to be C<0>, then they are not. Disabling them saves a few kB of
2161 =item EV_EMBED_ENABLE
2163 If undefined or defined to be C<1>, then embed watchers are supported. If
2164 defined to be C<0>, then they are not.
2166 =item EV_STAT_ENABLE
2168 If undefined or defined to be C<1>, then stat watchers are supported. If
2169 defined to be C<0>, then they are not.
2171 =item EV_FORK_ENABLE
2173 If undefined or defined to be C<1>, then fork watchers are supported. If
2174 defined to be C<0>, then they are not.
2178 If you need to shave off some kilobytes of code at the expense of some
2179 speed, define this symbol to C<1>. Currently only used for gcc to override
2180 some inlining decisions, saves roughly 30% codesize of amd64.
2182 =item EV_PID_HASHSIZE
2184 C<ev_child> watchers use a small hash table to distribute workload by
2185 pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2186 than enough. If you need to manage thousands of children you might want to
2187 increase this value (I<must> be a power of two).
2189 =item EV_INOTIFY_HASHSIZE
2191 C<ev_staz> watchers use a small hash table to distribute workload by
2192 inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2193 usually more than enough. If you need to manage thousands of C<ev_stat>
2194 watchers you might want to increase this value (I<must> be a power of
2199 By default, all watchers have a C<void *data> member. By redefining
2200 this macro to a something else you can include more and other types of
2201 members. You have to define it each time you include one of the files,
2202 though, and it must be identical each time.
2204 For example, the perl EV module uses something like this:
2207 SV *self; /* contains this struct */ \
2208 SV *cb_sv, *fh /* note no trailing ";" */
2210 =item EV_CB_DECLARE (type)
2212 =item EV_CB_INVOKE (watcher, revents)
2214 =item ev_set_cb (ev, cb)
2216 Can be used to change the callback member declaration in each watcher,
2217 and the way callbacks are invoked and set. Must expand to a struct member
2218 definition and a statement, respectively. See the F<ev.v> header file for
2219 their default definitions. One possible use for overriding these is to
2220 avoid the C<struct ev_loop *> as first argument in all cases, or to use
2221 method calls instead of plain function calls in C++.
2225 For a real-world example of a program the includes libev
2226 verbatim, you can have a look at the EV perl module
2227 (L<http://software.schmorp.de/pkg/EV.html>). It has the libev files in
2228 the F<libev/> subdirectory and includes them in the F<EV/EVAPI.h> (public
2229 interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
2230 will be compiled. It is pretty complex because it provides its own header
2233 The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2234 that everybody includes and which overrides some configure choices:
2236 #define EV_MINIMAL 1
2237 #define EV_USE_POLL 0
2238 #define EV_MULTIPLICITY 0
2239 #define EV_PERIODIC_ENABLE 0
2240 #define EV_STAT_ENABLE 0
2241 #define EV_FORK_ENABLE 0
2242 #define EV_CONFIG_H <config.h>
2248 And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2256 In this section the complexities of (many of) the algorithms used inside
2257 libev will be explained. For complexity discussions about backends see the
2258 documentation for C<ev_default_init>.
2260 All of the following are about amortised time: If an array needs to be
2261 extended, libev needs to realloc and move the whole array, but this
2262 happens asymptotically never with higher number of elements, so O(1) might
2263 mean it might do a lengthy realloc operation in rare cases, but on average
2264 it is much faster and asymptotically approaches constant time.
2268 =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2270 This means that, when you have a watcher that triggers in one hour and
2271 there are 100 watchers that would trigger before that then inserting will
2272 have to skip those 100 watchers.
2274 =item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers)
2276 That means that for changing a timer costs less than removing/adding them
2277 as only the relative motion in the event queue has to be paid for.
2279 =item Starting io/check/prepare/idle/signal/child watchers: O(1)
2281 These just add the watcher into an array or at the head of a list.
2282 =item Stopping check/prepare/idle watchers: O(1)
2284 =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2286 These watchers are stored in lists then need to be walked to find the
2287 correct watcher to remove. The lists are usually short (you don't usually
2288 have many watchers waiting for the same fd or signal).
2290 =item Finding the next timer per loop iteration: O(1)
2292 =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2294 A change means an I/O watcher gets started or stopped, which requires
2295 libev to recalculate its status (and possibly tell the kernel).
2297 =item Activating one watcher: O(1)
2299 =item Priority handling: O(number_of_priorities)
2301 Priorities are implemented by allocating some space for each
2302 priority. When doing priority-based operations, libev usually has to
2303 linearly search all the priorities.
2310 Marc Lehmann <libev@schmorp.de>.