3 libev - a high performance full-featured event loop written in C
11 Libev is an event loop: you register interest in certain events (such as a
12 file descriptor being readable or a timeout occuring), and it will manage
13 these event sources and provide your program with events.
15 To do this, it must take more or less complete control over your process
16 (or thread) by executing the I<event loop> handler, and will then
17 communicate events via a callback mechanism.
19 You register interest in certain events by registering so-called I<event
20 watchers>, which are relatively small C structures you initialise with the
21 details of the event, and then hand it over to libev by I<starting> the
26 Libev supports select, poll, the linux-specific epoll and the bsd-specific
27 kqueue mechanisms for file descriptor events, relative timers, absolute
28 timers with customised rescheduling, signal events, process status change
29 events (related to SIGCHLD), and event watchers dealing with the event
30 loop mechanism itself (idle, prepare and check watchers). It also is quite
31 fast (see this L<benchmark|http://libev.schmorp.de/bench.html> comparing
32 it to libevent for example).
36 Libev is very configurable. In this manual the default configuration
37 will be described, which supports multiple event loops. For more info
38 about various configuration options please have a look at the file
39 F<README.embed> in the libev distribution. If libev was configured without
40 support for multiple event loops, then all functions taking an initial
41 argument of name C<loop> (which is always of type C<struct ev_loop *>)
42 will not have this argument.
44 =head1 TIME REPRESENTATION
46 Libev represents time as a single floating point number, representing the
47 (fractional) number of seconds since the (POSIX) epoch (somewhere near
48 the beginning of 1970, details are complicated, don't ask). This type is
49 called C<ev_tstamp>, which is what you should use too. It usually aliases
50 to the double type in C.
52 =head1 GLOBAL FUNCTIONS
54 These functions can be called anytime, even before initialising the
59 =item ev_tstamp ev_time ()
61 Returns the current time as libev would use it. Please note that the
62 C<ev_now> function is usually faster and also often returns the timestamp
63 you actually want to know.
65 =item int ev_version_major ()
67 =item int ev_version_minor ()
69 You can find out the major and minor version numbers of the library
70 you linked against by calling the functions C<ev_version_major> and
71 C<ev_version_minor>. If you want, you can compare against the global
72 symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
73 version of the library your program was compiled against.
75 Usually, it's a good idea to terminate if the major versions mismatch,
76 as this indicates an incompatible change. Minor versions are usually
77 compatible to older versions, so a larger minor version alone is usually
80 =item ev_set_allocator (void *(*cb)(void *ptr, long size))
82 Sets the allocation function to use (the prototype is similar to the
83 realloc C function, the semantics are identical). It is used to allocate
84 and free memory (no surprises here). If it returns zero when memory
85 needs to be allocated, the library might abort or take some potentially
86 destructive action. The default is your system realloc function.
88 You could override this function in high-availability programs to, say,
89 free some memory if it cannot allocate memory, to use a special allocator,
90 or even to sleep a while and retry until some memory is available.
92 =item ev_set_syserr_cb (void (*cb)(const char *msg));
94 Set the callback function to call on a retryable syscall error (such
95 as failed select, poll, epoll_wait). The message is a printable string
96 indicating the system call or subsystem causing the problem. If this
97 callback is set, then libev will expect it to remedy the sitution, no
98 matter what, when it returns. That is, libev will generally retry the
99 requested operation, or, if the condition doesn't go away, do bad stuff
104 =head1 FUNCTIONS CONTROLLING THE EVENT LOOP
106 An event loop is described by a C<struct ev_loop *>. The library knows two
107 types of such loops, the I<default> loop, which supports signals and child
108 events, and dynamically created loops which do not.
110 If you use threads, a common model is to run the default event loop
111 in your main thread (or in a separate thread) and for each thread you
112 create, you also create another event loop. Libev itself does no locking
113 whatsoever, so if you mix calls to the same event loop in different
114 threads, make sure you lock (this is usually a bad idea, though, even if
115 done correctly, because it's hideous and inefficient).
119 =item struct ev_loop *ev_default_loop (unsigned int flags)
121 This will initialise the default event loop if it hasn't been initialised
122 yet and return it. If the default loop could not be initialised, returns
123 false. If it already was initialised it simply returns it (and ignores the
126 If you don't know what event loop to use, use the one returned from this
129 The flags argument can be used to specify special behaviour or specific
130 backends to use, and is usually specified as 0 (or EVFLAG_AUTO).
132 It supports the following flags:
138 The default flags value. Use this if you have no clue (it's the right
141 =item C<EVFLAG_NOENV>
143 If this flag bit is ored into the flag value (or the program runs setuid
144 or setgid) then libev will I<not> look at the environment variable
145 C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
146 override the flags completely if it is found in the environment. This is
147 useful to try out specific backends to test their performance, or to work
150 =item C<EVMETHOD_SELECT> (portable select backend)
152 =item C<EVMETHOD_POLL> (poll backend, available everywhere except on windows)
154 =item C<EVMETHOD_EPOLL> (linux only)
156 =item C<EVMETHOD_KQUEUE> (some bsds only)
158 =item C<EVMETHOD_DEVPOLL> (solaris 8 only)
160 =item C<EVMETHOD_PORT> (solaris 10 only)
162 If one or more of these are ored into the flags value, then only these
163 backends will be tried (in the reverse order as given here). If one are
164 specified, any backend will do.
168 =item struct ev_loop *ev_loop_new (unsigned int flags)
170 Similar to C<ev_default_loop>, but always creates a new event loop that is
171 always distinct from the default loop. Unlike the default loop, it cannot
172 handle signal and child watchers, and attempts to do so will be greeted by
173 undefined behaviour (or a failed assertion if assertions are enabled).
175 =item ev_default_destroy ()
177 Destroys the default loop again (frees all memory and kernel state
178 etc.). This stops all registered event watchers (by not touching them in
179 any way whatsoever, although you cannot rely on this :).
181 =item ev_loop_destroy (loop)
183 Like C<ev_default_destroy>, but destroys an event loop created by an
184 earlier call to C<ev_loop_new>.
186 =item ev_default_fork ()
188 This function reinitialises the kernel state for backends that have
189 one. Despite the name, you can call it anytime, but it makes most sense
190 after forking, in either the parent or child process (or both, but that
191 again makes little sense).
193 You I<must> call this function after forking if and only if you want to
194 use the event library in both processes. If you just fork+exec, you don't
197 The function itself is quite fast and it's usually not a problem to call
198 it just in case after a fork. To make this easy, the function will fit in
199 quite nicely into a call to C<pthread_atfork>:
201 pthread_atfork (0, 0, ev_default_fork);
203 =item ev_loop_fork (loop)
205 Like C<ev_default_fork>, but acts on an event loop created by
206 C<ev_loop_new>. Yes, you have to call this on every allocated event loop
207 after fork, and how you do this is entirely your own problem.
209 =item unsigned int ev_method (loop)
211 Returns one of the C<EVMETHOD_*> flags indicating the event backend in
214 =item ev_tstamp ev_now (loop)
216 Returns the current "event loop time", which is the time the event loop
217 got events and started processing them. This timestamp does not change
218 as long as callbacks are being processed, and this is also the base time
219 used for relative timers. You can treat it as the timestamp of the event
220 occuring (or more correctly, the mainloop finding out about it).
222 =item ev_loop (loop, int flags)
224 Finally, this is it, the event handler. This function usually is called
225 after you initialised all your watchers and you want to start handling
228 If the flags argument is specified as 0, it will not return until either
229 no event watchers are active anymore or C<ev_unloop> was called.
231 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
232 those events and any outstanding ones, but will not block your process in
233 case there are no events and will return after one iteration of the loop.
235 A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
236 neccessary) and will handle those and any outstanding ones. It will block
237 your process until at least one new event arrives, and will return after
238 one iteration of the loop.
240 This flags value could be used to implement alternative looping
241 constructs, but the C<prepare> and C<check> watchers provide a better and
242 more generic mechanism.
244 Here are the gory details of what ev_loop does:
246 1. If there are no active watchers (reference count is zero), return.
247 2. Queue and immediately call all prepare watchers.
248 3. If we have been forked, recreate the kernel state.
249 4. Update the kernel state with all outstanding changes.
250 5. Update the "event loop time".
251 6. Calculate for how long to block.
252 7. Block the process, waiting for events.
253 8. Update the "event loop time" and do time jump handling.
254 9. Queue all outstanding timers.
255 10. Queue all outstanding periodics.
256 11. If no events are pending now, queue all idle watchers.
257 12. Queue all check watchers.
258 13. Call all queued watchers in reverse order (i.e. check watchers first).
259 14. If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
260 was used, return, otherwise continue with step #1.
262 =item ev_unloop (loop, how)
264 Can be used to make a call to C<ev_loop> return early (but only after it
265 has processed all outstanding events). The C<how> argument must be either
266 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
267 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
271 =item ev_unref (loop)
273 Ref/unref can be used to add or remove a reference count on the event
274 loop: Every watcher keeps one reference, and as long as the reference
275 count is nonzero, C<ev_loop> will not return on its own. If you have
276 a watcher you never unregister that should not keep C<ev_loop> from
277 returning, ev_unref() after starting, and ev_ref() before stopping it. For
278 example, libev itself uses this for its internal signal pipe: It is not
279 visible to the libev user and should not keep C<ev_loop> from exiting if
280 no event watchers registered by it are active. It is also an excellent
281 way to do this for generic recurring timers or from within third-party
282 libraries. Just remember to I<unref after start> and I<ref before stop>.
286 =head1 ANATOMY OF A WATCHER
288 A watcher is a structure that you create and register to record your
289 interest in some event. For instance, if you want to wait for STDIN to
290 become readable, you would create an C<ev_io> watcher for that:
292 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
295 ev_unloop (loop, EVUNLOOP_ALL);
298 struct ev_loop *loop = ev_default_loop (0);
299 struct ev_io stdin_watcher;
300 ev_init (&stdin_watcher, my_cb);
301 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
302 ev_io_start (loop, &stdin_watcher);
305 As you can see, you are responsible for allocating the memory for your
306 watcher structures (and it is usually a bad idea to do this on the stack,
307 although this can sometimes be quite valid).
309 Each watcher structure must be initialised by a call to C<ev_init
310 (watcher *, callback)>, which expects a callback to be provided. This
311 callback gets invoked each time the event occurs (or, in the case of io
312 watchers, each time the event loop detects that the file descriptor given
313 is readable and/or writable).
315 Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
316 with arguments specific to this watcher type. There is also a macro
317 to combine initialisation and setting in one call: C<< ev_<type>_init
318 (watcher *, callback, ...) >>.
320 To make the watcher actually watch out for events, you have to start it
321 with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
322 *) >>), and you can stop watching for events at any time by calling the
323 corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
325 As long as your watcher is active (has been started but not stopped) you
326 must not touch the values stored in it. Most specifically you must never
327 reinitialise it or call its set method.
329 You can check whether an event is active by calling the C<ev_is_active
330 (watcher *)> macro. To see whether an event is outstanding (but the
331 callback for it has not been called yet) you can use the C<ev_is_pending
334 Each and every callback receives the event loop pointer as first, the
335 registered watcher structure as second, and a bitset of received events as
338 The received events usually include a single bit per event type received
339 (you can receive multiple events at the same time). The possible bit masks
348 The file descriptor in the C<ev_io> watcher has become readable and/or
353 The C<ev_timer> watcher has timed out.
357 The C<ev_periodic> watcher has timed out.
361 The signal specified in the C<ev_signal> watcher has been received by a thread.
365 The pid specified in the C<ev_child> watcher has received a status change.
369 The C<ev_idle> watcher has determined that you have nothing better to do.
375 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
376 to gather new events, and all C<ev_check> watchers are invoked just after
377 C<ev_loop> has gathered them, but before it invokes any callbacks for any
378 received events. Callbacks of both watcher types can start and stop as
379 many watchers as they want, and all of them will be taken into account
380 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
381 C<ev_loop> from blocking).
385 An unspecified error has occured, the watcher has been stopped. This might
386 happen because the watcher could not be properly started because libev
387 ran out of memory, a file descriptor was found to be closed or any other
388 problem. You best act on it by reporting the problem and somehow coping
389 with the watcher being stopped.
391 Libev will usually signal a few "dummy" events together with an error,
392 for example it might indicate that a fd is readable or writable, and if
393 your callbacks is well-written it can just attempt the operation and cope
394 with the error from read() or write(). This will not work in multithreaded
395 programs, though, so beware.
399 =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
401 Each watcher has, by default, a member C<void *data> that you can change
402 and read at any time, libev will completely ignore it. This can be used
403 to associate arbitrary data with your watcher. If you need more data and
404 don't want to allocate memory and store a pointer to it in that data
405 member, you can also "subclass" the watcher type and provide your own
413 struct whatever *mostinteresting;
416 And since your callback will be called with a pointer to the watcher, you
417 can cast it back to your own type:
419 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
421 struct my_io *w = (struct my_io *)w_;
425 More interesting and less C-conformant ways of catsing your callback type
426 have been omitted....
431 This section describes each watcher in detail, but will not repeat
432 information given in the last section.
434 =head2 C<ev_io> - is this file descriptor readable or writable
436 I/O watchers check whether a file descriptor is readable or writable
437 in each iteration of the event loop (This behaviour is called
438 level-triggering because you keep receiving events as long as the
439 condition persists. Remember you can stop the watcher if you don't want to
440 act on the event and neither want to receive future events).
442 In general you can register as many read and/or write event watchers per
443 fd as you want (as long as you don't confuse yourself). Setting all file
444 descriptors to non-blocking mode is also usually a good idea (but not
445 required if you know what you are doing).
447 You have to be careful with dup'ed file descriptors, though. Some backends
448 (the linux epoll backend is a notable example) cannot handle dup'ed file
449 descriptors correctly if you register interest in two or more fds pointing
450 to the same underlying file/socket etc. description (that is, they share
451 the same underlying "file open").
453 If you must do this, then force the use of a known-to-be-good backend
454 (at the time of this writing, this includes only EVMETHOD_SELECT and
459 =item ev_io_init (ev_io *, callback, int fd, int events)
461 =item ev_io_set (ev_io *, int fd, int events)
463 Configures an C<ev_io> watcher. The fd is the file descriptor to rceeive
464 events for and events is either C<EV_READ>, C<EV_WRITE> or C<EV_READ |
465 EV_WRITE> to receive the given events.
469 =head2 C<ev_timer> - relative and optionally recurring timeouts
471 Timer watchers are simple relative timers that generate an event after a
472 given time, and optionally repeating in regular intervals after that.
474 The timers are based on real time, that is, if you register an event that
475 times out after an hour and you reset your system clock to last years
476 time, it will still time out after (roughly) and hour. "Roughly" because
477 detecting time jumps is hard, and soem inaccuracies are unavoidable (the
478 monotonic clock option helps a lot here).
480 The relative timeouts are calculated relative to the C<ev_now ()>
481 time. This is usually the right thing as this timestamp refers to the time
482 of the event triggering whatever timeout you are modifying/starting. If
483 you suspect event processing to be delayed and you *need* to base the timeout
484 on the current time, use something like this to adjust for this:
486 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
490 =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
492 =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
494 Configure the timer to trigger after C<after> seconds. If C<repeat> is
495 C<0.>, then it will automatically be stopped. If it is positive, then the
496 timer will automatically be configured to trigger again C<repeat> seconds
497 later, again, and again, until stopped manually.
499 The timer itself will do a best-effort at avoiding drift, that is, if you
500 configure a timer to trigger every 10 seconds, then it will trigger at
501 exactly 10 second intervals. If, however, your program cannot keep up with
502 the timer (because it takes longer than those 10 seconds to do stuff) the
503 timer will not fire more than once per event loop iteration.
505 =item ev_timer_again (loop)
507 This will act as if the timer timed out and restart it again if it is
508 repeating. The exact semantics are:
510 If the timer is started but nonrepeating, stop it.
512 If the timer is repeating, either start it if necessary (with the repeat
513 value), or reset the running timer to the repeat value.
515 This sounds a bit complicated, but here is a useful and typical
516 example: Imagine you have a tcp connection and you want a so-called idle
517 timeout, that is, you want to be called when there have been, say, 60
518 seconds of inactivity on the socket. The easiest way to do this is to
519 configure an C<ev_timer> with after=repeat=60 and calling ev_timer_again each
520 time you successfully read or write some data. If you go into an idle
521 state where you do not expect data to travel on the socket, you can stop
522 the timer, and again will automatically restart it if need be.
526 =head2 C<ev_periodic> - to cron or not to cron
528 Periodic watchers are also timers of a kind, but they are very versatile
529 (and unfortunately a bit complex).
531 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
532 but on wallclock time (absolute time). You can tell a periodic watcher
533 to trigger "at" some specific point in time. For example, if you tell a
534 periodic watcher to trigger in 10 seconds (by specifiying e.g. c<ev_now ()
535 + 10.>) and then reset your system clock to the last year, then it will
536 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
537 roughly 10 seconds later and of course not if you reset your system time
540 They can also be used to implement vastly more complex timers, such as
541 triggering an event on eahc midnight, local time.
545 =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
547 =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
549 Lots of arguments, lets sort it out... There are basically three modes of
550 operation, and we will explain them from simplest to complex:
555 =item * absolute timer (interval = reschedule_cb = 0)
557 In this configuration the watcher triggers an event at the wallclock time
558 C<at> and doesn't repeat. It will not adjust when a time jump occurs,
559 that is, if it is to be run at January 1st 2011 then it will run when the
560 system time reaches or surpasses this time.
562 =item * non-repeating interval timer (interval > 0, reschedule_cb = 0)
564 In this mode the watcher will always be scheduled to time out at the next
565 C<at + N * interval> time (for some integer N) and then repeat, regardless
568 This can be used to create timers that do not drift with respect to system
571 ev_periodic_set (&periodic, 0., 3600., 0);
573 This doesn't mean there will always be 3600 seconds in between triggers,
574 but only that the the callback will be called when the system time shows a
575 full hour (UTC), or more correctly, when the system time is evenly divisible
578 Another way to think about it (for the mathematically inclined) is that
579 C<ev_periodic> will try to run the callback in this mode at the next possible
580 time where C<time = at (mod interval)>, regardless of any time jumps.
582 =item * manual reschedule mode (reschedule_cb = callback)
584 In this mode the values for C<interval> and C<at> are both being
585 ignored. Instead, each time the periodic watcher gets scheduled, the
586 reschedule callback will be called with the watcher as first, and the
587 current time as second argument.
589 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
590 ever, or make any event loop modifications>. If you need to stop it,
591 return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
592 starting a prepare watcher).
594 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
595 ev_tstamp now)>, e.g.:
597 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
602 It must return the next time to trigger, based on the passed time value
603 (that is, the lowest time value larger than to the second argument). It
604 will usually be called just before the callback will be triggered, but
605 might be called at other times, too.
607 NOTE: I<< This callback must always return a time that is later than the
608 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
610 This can be used to create very complex timers, such as a timer that
611 triggers on each midnight, local time. To do this, you would calculate the
612 next midnight after C<now> and return the timestamp value for this. How
613 you do this is, again, up to you (but it is not trivial, which is the main
614 reason I omitted it as an example).
618 =item ev_periodic_again (loop, ev_periodic *)
620 Simply stops and restarts the periodic watcher again. This is only useful
621 when you changed some parameters or the reschedule callback would return
622 a different time than the last time it was called (e.g. in a crond like
623 program when the crontabs have changed).
627 =head2 C<ev_signal> - signal me when a signal gets signalled
629 Signal watchers will trigger an event when the process receives a specific
630 signal one or more times. Even though signals are very asynchronous, libev
631 will try it's best to deliver signals synchronously, i.e. as part of the
632 normal event processing, like any other event.
634 You can configure as many watchers as you like per signal. Only when the
635 first watcher gets started will libev actually register a signal watcher
636 with the kernel (thus it coexists with your own signal handlers as long
637 as you don't register any with libev). Similarly, when the last signal
638 watcher for a signal is stopped libev will reset the signal handler to
639 SIG_DFL (regardless of what it was set to before).
643 =item ev_signal_init (ev_signal *, callback, int signum)
645 =item ev_signal_set (ev_signal *, int signum)
647 Configures the watcher to trigger on the given signal number (usually one
648 of the C<SIGxxx> constants).
652 =head2 C<ev_child> - wait for pid status changes
654 Child watchers trigger when your process receives a SIGCHLD in response to
655 some child status changes (most typically when a child of yours dies).
659 =item ev_child_init (ev_child *, callback, int pid)
661 =item ev_child_set (ev_child *, int pid)
663 Configures the watcher to wait for status changes of process C<pid> (or
664 I<any> process if C<pid> is specified as C<0>). The callback can look
665 at the C<rstatus> member of the C<ev_child> watcher structure to see
666 the status word (use the macros from C<sys/wait.h> and see your systems
667 C<waitpid> documentation). The C<rpid> member contains the pid of the
668 process causing the status change.
672 =head2 C<ev_idle> - when you've got nothing better to do
674 Idle watchers trigger events when there are no other events are pending
675 (prepare, check and other idle watchers do not count). That is, as long
676 as your process is busy handling sockets or timeouts (or even signals,
677 imagine) it will not be triggered. But when your process is idle all idle
678 watchers are being called again and again, once per event loop iteration -
679 until stopped, that is, or your process receives more events and becomes
682 The most noteworthy effect is that as long as any idle watchers are
683 active, the process will not block when waiting for new events.
685 Apart from keeping your process non-blocking (which is a useful
686 effect on its own sometimes), idle watchers are a good place to do
687 "pseudo-background processing", or delay processing stuff to after the
688 event loop has handled all outstanding events.
692 =item ev_idle_init (ev_signal *, callback)
694 Initialises and configures the idle watcher - it has no parameters of any
695 kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
700 =head2 C<ev_prepare> and C<ev_check> - customise your event loop
702 Prepare and check watchers are usually (but not always) used in tandem:
703 prepare watchers get invoked before the process blocks and check watchers
706 Their main purpose is to integrate other event mechanisms into libev. This
707 could be used, for example, to track variable changes, implement your own
708 watchers, integrate net-snmp or a coroutine library and lots more.
710 This is done by examining in each prepare call which file descriptors need
711 to be watched by the other library, registering C<ev_io> watchers for
712 them and starting an C<ev_timer> watcher for any timeouts (many libraries
713 provide just this functionality). Then, in the check watcher you check for
714 any events that occured (by checking the pending status of all watchers
715 and stopping them) and call back into the library. The I/O and timer
716 callbacks will never actually be called (but must be valid nevertheless,
717 because you never know, you know?).
719 As another example, the Perl Coro module uses these hooks to integrate
720 coroutines into libev programs, by yielding to other active coroutines
721 during each prepare and only letting the process block if no coroutines
722 are ready to run (it's actually more complicated: it only runs coroutines
723 with priority higher than or equal to the event loop and one coroutine
724 of lower priority, but only once, using idle watchers to keep the event
725 loop from blocking if lower-priority coroutines are active, thus mapping
726 low-priority coroutines to idle/background tasks).
730 =item ev_prepare_init (ev_prepare *, callback)
732 =item ev_check_init (ev_check *, callback)
734 Initialises and configures the prepare or check watcher - they have no
735 parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
736 macros, but using them is utterly, utterly and completely pointless.
740 =head1 OTHER FUNCTIONS
742 There are some other functions of possible interest. Described. Here. Now.
746 =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
748 This function combines a simple timer and an I/O watcher, calls your
749 callback on whichever event happens first and automatically stop both
750 watchers. This is useful if you want to wait for a single event on an fd
751 or timeout without having to allocate/configure/start/stop/free one or
752 more watchers yourself.
754 If C<fd> is less than 0, then no I/O watcher will be started and events
755 is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
756 C<events> set will be craeted and started.
758 If C<timeout> is less than 0, then no timeout watcher will be
759 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
760 repeat = 0) will be started. While C<0> is a valid timeout, it is of
763 The callback has the type C<void (*cb)(int revents, void *arg)> and gets
764 passed an C<revents> set like normal event callbacks (a combination of
765 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
766 value passed to C<ev_once>:
768 static void stdin_ready (int revents, void *arg)
770 if (revents & EV_TIMEOUT)
771 /* doh, nothing entered */;
772 else if (revents & EV_READ)
773 /* stdin might have data for us, joy! */;
776 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
778 =item ev_feed_event (loop, watcher, int events)
780 Feeds the given event set into the event loop, as if the specified event
781 had happened for the specified watcher (which must be a pointer to an
782 initialised but not necessarily started event watcher).
784 =item ev_feed_fd_event (loop, int fd, int revents)
786 Feed an event on the given fd, as if a file descriptor backend detected
789 =item ev_feed_signal_event (loop, int signum)
791 Feed an event as if the given signal occured (loop must be the default loop!).
795 =head1 LIBEVENT EMULATION
797 Libev offers a compatibility emulation layer for libevent. It cannot
798 emulate the internals of libevent, so here are some usage hints:
802 =item * Use it by including <event.h>, as usual.
804 =item * The following members are fully supported: ev_base, ev_callback,
805 ev_arg, ev_fd, ev_res, ev_events.
807 =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
808 maintained by libev, it does not work exactly the same way as in libevent (consider
811 =item * Priorities are not currently supported. Initialising priorities
812 will fail and all watchers will have the same priority, even though there
815 =item * Other members are not supported.
817 =item * The libev emulation is I<not> ABI compatible to libevent, you need
818 to use the libev header file and library.
828 Marc Lehmann <libev@schmorp.de>.