ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
Revision: 1.35
Committed: Fri Nov 23 19:35:09 2007 UTC (16 years, 5 months ago) by root
Branch: MAIN
Changes since 1.34: +86 -3 lines
Log Message:
document the embed watchers

File Contents

# User Rev Content
1 root 1.1 =head1 NAME
2    
3     libev - a high performance full-featured event loop written in C
4    
5     =head1 SYNOPSIS
6    
7     #include <ev.h>
8    
9     =head1 DESCRIPTION
10    
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 root 1.4 these event sources and provide your program with events.
14 root 1.1
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.
18    
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
22     watcher.
23    
24     =head1 FEATURES
25    
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 root 1.5 loop mechanism itself (idle, prepare and check watchers). It also is quite
31 root 1.7 fast (see this L<benchmark|http://libev.schmorp.de/bench.html> comparing
32     it to libevent for example).
33 root 1.1
34     =head1 CONVENTIONS
35    
36     Libev is very configurable. In this manual the default configuration
37     will be described, which supports multiple event loops. For more info
38 root 1.7 about various configuration options please have a look at the file
39 root 1.1 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.
43    
44 root 1.17 =head1 TIME REPRESENTATION
45 root 1.1
46 root 1.2 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 root 1.1 called C<ev_tstamp>, which is what you should use too. It usually aliases
50 root 1.34 to the C<double> type in C, and when you need to do any calculations on
51     it, you should treat it as such.
52    
53 root 1.1
54 root 1.17 =head1 GLOBAL FUNCTIONS
55    
56 root 1.18 These functions can be called anytime, even before initialising the
57     library in any way.
58    
59 root 1.1 =over 4
60    
61     =item ev_tstamp ev_time ()
62    
63 root 1.26 Returns the current time as libev would use it. Please note that the
64     C<ev_now> function is usually faster and also often returns the timestamp
65     you actually want to know.
66 root 1.1
67     =item int ev_version_major ()
68    
69     =item int ev_version_minor ()
70    
71     You can find out the major and minor version numbers of the library
72     you linked against by calling the functions C<ev_version_major> and
73     C<ev_version_minor>. If you want, you can compare against the global
74     symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
75     version of the library your program was compiled against.
76    
77 root 1.9 Usually, it's a good idea to terminate if the major versions mismatch,
78 root 1.1 as this indicates an incompatible change. Minor versions are usually
79     compatible to older versions, so a larger minor version alone is usually
80     not a problem.
81    
82 root 1.34 Example: make sure we haven't accidentally been linked against the wrong
83     version:
84    
85     assert (("libev version mismatch",
86     ev_version_major () == EV_VERSION_MAJOR
87     && ev_version_minor () >= EV_VERSION_MINOR));
88    
89 root 1.31 =item unsigned int ev_supported_backends ()
90    
91     Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
92     value) compiled into this binary of libev (independent of their
93     availability on the system you are running on). See C<ev_default_loop> for
94     a description of the set values.
95    
96 root 1.34 Example: make sure we have the epoll method, because yeah this is cool and
97     a must have and can we have a torrent of it please!!!11
98    
99     assert (("sorry, no epoll, no sex",
100     ev_supported_backends () & EVBACKEND_EPOLL));
101    
102 root 1.31 =item unsigned int ev_recommended_backends ()
103    
104     Return the set of all backends compiled into this binary of libev and also
105     recommended for this platform. This set is often smaller than the one
106     returned by C<ev_supported_backends>, as for example kqueue is broken on
107     most BSDs and will not be autodetected unless you explicitly request it
108     (assuming you know what you are doing). This is the set of backends that
109 root 1.33 libev will probe for if you specify no backends explicitly.
110 root 1.31
111 root 1.35 =item unsigned int ev_embeddable_backends ()
112    
113     Returns the set of backends that are embeddable in other event loops. This
114     is the theoretical, all-platform, value. To find which backends
115     might be supported on the current system, you would need to look at
116     C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
117     recommended ones.
118    
119     See the description of C<ev_embed> watchers for more info.
120    
121 root 1.1 =item ev_set_allocator (void *(*cb)(void *ptr, long size))
122    
123     Sets the allocation function to use (the prototype is similar to the
124 root 1.7 realloc C function, the semantics are identical). It is used to allocate
125     and free memory (no surprises here). If it returns zero when memory
126     needs to be allocated, the library might abort or take some potentially
127     destructive action. The default is your system realloc function.
128 root 1.1
129     You could override this function in high-availability programs to, say,
130     free some memory if it cannot allocate memory, to use a special allocator,
131     or even to sleep a while and retry until some memory is available.
132    
133 root 1.34 Example: replace the libev allocator with one that waits a bit and then
134     retries: better than mine).
135    
136     static void *
137     persistent_realloc (void *ptr, long size)
138     {
139     for (;;)
140     {
141     void *newptr = realloc (ptr, size);
142    
143     if (newptr)
144     return newptr;
145    
146     sleep (60);
147     }
148     }
149    
150     ...
151     ev_set_allocator (persistent_realloc);
152    
153 root 1.1 =item ev_set_syserr_cb (void (*cb)(const char *msg));
154    
155     Set the callback function to call on a retryable syscall error (such
156     as failed select, poll, epoll_wait). The message is a printable string
157     indicating the system call or subsystem causing the problem. If this
158     callback is set, then libev will expect it to remedy the sitution, no
159 root 1.7 matter what, when it returns. That is, libev will generally retry the
160 root 1.1 requested operation, or, if the condition doesn't go away, do bad stuff
161     (such as abort).
162    
163 root 1.34 Example: do the same thing as libev does internally:
164    
165     static void
166     fatal_error (const char *msg)
167     {
168     perror (msg);
169     abort ();
170     }
171    
172     ...
173     ev_set_syserr_cb (fatal_error);
174    
175 root 1.1 =back
176    
177     =head1 FUNCTIONS CONTROLLING THE EVENT LOOP
178    
179     An event loop is described by a C<struct ev_loop *>. The library knows two
180     types of such loops, the I<default> loop, which supports signals and child
181     events, and dynamically created loops which do not.
182    
183     If you use threads, a common model is to run the default event loop
184 root 1.17 in your main thread (or in a separate thread) and for each thread you
185 root 1.7 create, you also create another event loop. Libev itself does no locking
186     whatsoever, so if you mix calls to the same event loop in different
187     threads, make sure you lock (this is usually a bad idea, though, even if
188 root 1.9 done correctly, because it's hideous and inefficient).
189 root 1.1
190     =over 4
191    
192     =item struct ev_loop *ev_default_loop (unsigned int flags)
193    
194     This will initialise the default event loop if it hasn't been initialised
195     yet and return it. If the default loop could not be initialised, returns
196     false. If it already was initialised it simply returns it (and ignores the
197 root 1.31 flags. If that is troubling you, check C<ev_backend ()> afterwards).
198 root 1.1
199     If you don't know what event loop to use, use the one returned from this
200     function.
201    
202     The flags argument can be used to specify special behaviour or specific
203 root 1.33 backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
204 root 1.1
205 root 1.33 The following flags are supported:
206 root 1.1
207     =over 4
208    
209 root 1.10 =item C<EVFLAG_AUTO>
210 root 1.1
211 root 1.9 The default flags value. Use this if you have no clue (it's the right
212 root 1.1 thing, believe me).
213    
214 root 1.10 =item C<EVFLAG_NOENV>
215 root 1.1
216 root 1.8 If this flag bit is ored into the flag value (or the program runs setuid
217     or setgid) then libev will I<not> look at the environment variable
218     C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
219     override the flags completely if it is found in the environment. This is
220     useful to try out specific backends to test their performance, or to work
221     around bugs.
222 root 1.1
223 root 1.31 =item C<EVBACKEND_SELECT> (value 1, portable select backend)
224 root 1.1
225 root 1.29 This is your standard select(2) backend. Not I<completely> standard, as
226     libev tries to roll its own fd_set with no limits on the number of fds,
227     but if that fails, expect a fairly low limit on the number of fds when
228     using this backend. It doesn't scale too well (O(highest_fd)), but its usually
229     the fastest backend for a low number of fds.
230 root 1.1
231 root 1.31 =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
232 root 1.1
233 root 1.29 And this is your standard poll(2) backend. It's more complicated than
234     select, but handles sparse fds better and has no artificial limit on the
235     number of fds you can use (except it will slow down considerably with a
236     lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
237 root 1.1
238 root 1.31 =item C<EVBACKEND_EPOLL> (value 4, Linux)
239 root 1.1
240 root 1.29 For few fds, this backend is a bit little slower than poll and select,
241     but it scales phenomenally better. While poll and select usually scale like
242     O(total_fds) where n is the total number of fds (or the highest fd), epoll scales
243     either O(1) or O(active_fds).
244 root 1.1
245 root 1.29 While stopping and starting an I/O watcher in the same iteration will
246     result in some caching, there is still a syscall per such incident
247     (because the fd could point to a different file description now), so its
248     best to avoid that. Also, dup()ed file descriptors might not work very
249     well if you register events for both fds.
250    
251 root 1.32 Please note that epoll sometimes generates spurious notifications, so you
252     need to use non-blocking I/O or other means to avoid blocking when no data
253     (or space) is available.
254    
255 root 1.31 =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
256 root 1.29
257     Kqueue deserves special mention, as at the time of this writing, it
258     was broken on all BSDs except NetBSD (usually it doesn't work with
259     anything but sockets and pipes, except on Darwin, where of course its
260 root 1.33 completely useless). For this reason its not being "autodetected"
261     unless you explicitly specify it explicitly in the flags (i.e. using
262     C<EVBACKEND_KQUEUE>).
263 root 1.29
264     It scales in the same way as the epoll backend, but the interface to the
265     kernel is more efficient (which says nothing about its actual speed, of
266     course). While starting and stopping an I/O watcher does not cause an
267     extra syscall as with epoll, it still adds up to four event changes per
268     incident, so its best to avoid that.
269    
270 root 1.31 =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
271 root 1.29
272     This is not implemented yet (and might never be).
273    
274 root 1.31 =item C<EVBACKEND_PORT> (value 32, Solaris 10)
275 root 1.29
276     This uses the Solaris 10 port mechanism. As with everything on Solaris,
277     it's really slow, but it still scales very well (O(active_fds)).
278    
279 root 1.32 Please note that solaris ports can result in a lot of spurious
280     notifications, so you need to use non-blocking I/O or other means to avoid
281     blocking when no data (or space) is available.
282    
283 root 1.31 =item C<EVBACKEND_ALL>
284 root 1.29
285     Try all backends (even potentially broken ones that wouldn't be tried
286     with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
287 root 1.31 C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
288 root 1.1
289     =back
290    
291 root 1.29 If one or more of these are ored into the flags value, then only these
292     backends will be tried (in the reverse order as given here). If none are
293     specified, most compiled-in backend will be tried, usually in reverse
294     order of their flag values :)
295    
296 root 1.33 The most typical usage is like this:
297    
298     if (!ev_default_loop (0))
299     fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
300    
301     Restrict libev to the select and poll backends, and do not allow
302     environment settings to be taken into account:
303    
304     ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
305    
306     Use whatever libev has to offer, but make sure that kqueue is used if
307     available (warning, breaks stuff, best use only with your own private
308     event loop and only if you know the OS supports your types of fds):
309    
310     ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
311    
312 root 1.1 =item struct ev_loop *ev_loop_new (unsigned int flags)
313    
314     Similar to C<ev_default_loop>, but always creates a new event loop that is
315     always distinct from the default loop. Unlike the default loop, it cannot
316     handle signal and child watchers, and attempts to do so will be greeted by
317     undefined behaviour (or a failed assertion if assertions are enabled).
318    
319 root 1.34 Example: try to create a event loop that uses epoll and nothing else.
320    
321     struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
322     if (!epoller)
323     fatal ("no epoll found here, maybe it hides under your chair");
324    
325 root 1.1 =item ev_default_destroy ()
326    
327     Destroys the default loop again (frees all memory and kernel state
328     etc.). This stops all registered event watchers (by not touching them in
329 root 1.9 any way whatsoever, although you cannot rely on this :).
330 root 1.1
331     =item ev_loop_destroy (loop)
332    
333     Like C<ev_default_destroy>, but destroys an event loop created by an
334     earlier call to C<ev_loop_new>.
335    
336     =item ev_default_fork ()
337    
338     This function reinitialises the kernel state for backends that have
339     one. Despite the name, you can call it anytime, but it makes most sense
340     after forking, in either the parent or child process (or both, but that
341     again makes little sense).
342    
343 root 1.30 You I<must> call this function in the child process after forking if and
344     only if you want to use the event library in both processes. If you just
345     fork+exec, you don't have to call it.
346 root 1.1
347 root 1.9 The function itself is quite fast and it's usually not a problem to call
348 root 1.1 it just in case after a fork. To make this easy, the function will fit in
349     quite nicely into a call to C<pthread_atfork>:
350    
351     pthread_atfork (0, 0, ev_default_fork);
352    
353 root 1.31 At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
354     without calling this function, so if you force one of those backends you
355     do not need to care.
356    
357 root 1.1 =item ev_loop_fork (loop)
358    
359     Like C<ev_default_fork>, but acts on an event loop created by
360     C<ev_loop_new>. Yes, you have to call this on every allocated event loop
361     after fork, and how you do this is entirely your own problem.
362    
363 root 1.31 =item unsigned int ev_backend (loop)
364 root 1.1
365 root 1.31 Returns one of the C<EVBACKEND_*> flags indicating the event backend in
366 root 1.1 use.
367    
368 root 1.9 =item ev_tstamp ev_now (loop)
369 root 1.1
370     Returns the current "event loop time", which is the time the event loop
371 root 1.34 received events and started processing them. This timestamp does not
372     change as long as callbacks are being processed, and this is also the base
373     time used for relative timers. You can treat it as the timestamp of the
374     event occuring (or more correctly, libev finding out about it).
375 root 1.1
376     =item ev_loop (loop, int flags)
377    
378     Finally, this is it, the event handler. This function usually is called
379     after you initialised all your watchers and you want to start handling
380     events.
381    
382 root 1.33 If the flags argument is specified as C<0>, it will not return until
383     either no event watchers are active anymore or C<ev_unloop> was called.
384 root 1.1
385 root 1.34 Please note that an explicit C<ev_unloop> is usually better than
386     relying on all watchers to be stopped when deciding when a program has
387     finished (especially in interactive programs), but having a program that
388     automatically loops as long as it has to and no longer by virtue of
389     relying on its watchers stopping correctly is a thing of beauty.
390    
391 root 1.1 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
392     those events and any outstanding ones, but will not block your process in
393 root 1.9 case there are no events and will return after one iteration of the loop.
394 root 1.1
395     A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
396     neccessary) and will handle those and any outstanding ones. It will block
397 root 1.9 your process until at least one new event arrives, and will return after
398 root 1.33 one iteration of the loop. This is useful if you are waiting for some
399     external event in conjunction with something not expressible using other
400     libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
401     usually a better approach for this kind of thing.
402    
403     Here are the gory details of what C<ev_loop> does:
404    
405     * If there are no active watchers (reference count is zero), return.
406     - Queue prepare watchers and then call all outstanding watchers.
407     - If we have been forked, recreate the kernel state.
408     - Update the kernel state with all outstanding changes.
409     - Update the "event loop time".
410     - Calculate for how long to block.
411     - Block the process, waiting for any events.
412     - Queue all outstanding I/O (fd) events.
413     - Update the "event loop time" and do time jump handling.
414     - Queue all outstanding timers.
415     - Queue all outstanding periodics.
416     - If no events are pending now, queue all idle watchers.
417     - Queue all check watchers.
418     - Call all queued watchers in reverse order (i.e. check watchers first).
419     Signals and child watchers are implemented as I/O watchers, and will
420     be handled here by queueing them when their watcher gets executed.
421     - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
422     were used, return, otherwise continue with step *.
423 root 1.27
424 root 1.34 Example: queue some jobs and then loop until no events are outsanding
425     anymore.
426    
427     ... queue jobs here, make sure they register event watchers as long
428     ... as they still have work to do (even an idle watcher will do..)
429     ev_loop (my_loop, 0);
430     ... jobs done. yeah!
431    
432 root 1.1 =item ev_unloop (loop, how)
433    
434 root 1.9 Can be used to make a call to C<ev_loop> return early (but only after it
435     has processed all outstanding events). The C<how> argument must be either
436 root 1.25 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
437 root 1.9 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
438 root 1.1
439     =item ev_ref (loop)
440    
441     =item ev_unref (loop)
442    
443 root 1.9 Ref/unref can be used to add or remove a reference count on the event
444     loop: Every watcher keeps one reference, and as long as the reference
445     count is nonzero, C<ev_loop> will not return on its own. If you have
446     a watcher you never unregister that should not keep C<ev_loop> from
447     returning, ev_unref() after starting, and ev_ref() before stopping it. For
448     example, libev itself uses this for its internal signal pipe: It is not
449     visible to the libev user and should not keep C<ev_loop> from exiting if
450     no event watchers registered by it are active. It is also an excellent
451     way to do this for generic recurring timers or from within third-party
452     libraries. Just remember to I<unref after start> and I<ref before stop>.
453 root 1.1
454 root 1.34 Example: create a signal watcher, but keep it from keeping C<ev_loop>
455     running when nothing else is active.
456    
457     struct dv_signal exitsig;
458     ev_signal_init (&exitsig, sig_cb, SIGINT);
459     ev_signal_start (myloop, &exitsig);
460     evf_unref (myloop);
461    
462     Example: for some weird reason, unregister the above signal handler again.
463    
464     ev_ref (myloop);
465     ev_signal_stop (myloop, &exitsig);
466    
467 root 1.1 =back
468    
469     =head1 ANATOMY OF A WATCHER
470    
471     A watcher is a structure that you create and register to record your
472     interest in some event. For instance, if you want to wait for STDIN to
473 root 1.10 become readable, you would create an C<ev_io> watcher for that:
474 root 1.1
475     static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
476     {
477     ev_io_stop (w);
478     ev_unloop (loop, EVUNLOOP_ALL);
479     }
480    
481     struct ev_loop *loop = ev_default_loop (0);
482     struct ev_io stdin_watcher;
483     ev_init (&stdin_watcher, my_cb);
484     ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
485     ev_io_start (loop, &stdin_watcher);
486     ev_loop (loop, 0);
487    
488     As you can see, you are responsible for allocating the memory for your
489     watcher structures (and it is usually a bad idea to do this on the stack,
490     although this can sometimes be quite valid).
491    
492     Each watcher structure must be initialised by a call to C<ev_init
493     (watcher *, callback)>, which expects a callback to be provided. This
494     callback gets invoked each time the event occurs (or, in the case of io
495     watchers, each time the event loop detects that the file descriptor given
496     is readable and/or writable).
497    
498     Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
499     with arguments specific to this watcher type. There is also a macro
500     to combine initialisation and setting in one call: C<< ev_<type>_init
501     (watcher *, callback, ...) >>.
502    
503     To make the watcher actually watch out for events, you have to start it
504     with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
505     *) >>), and you can stop watching for events at any time by calling the
506     corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
507    
508     As long as your watcher is active (has been started but not stopped) you
509     must not touch the values stored in it. Most specifically you must never
510 root 1.31 reinitialise it or call its set macro.
511 root 1.1
512 root 1.14 You can check whether an event is active by calling the C<ev_is_active
513 root 1.4 (watcher *)> macro. To see whether an event is outstanding (but the
514 root 1.14 callback for it has not been called yet) you can use the C<ev_is_pending
515 root 1.1 (watcher *)> macro.
516    
517     Each and every callback receives the event loop pointer as first, the
518     registered watcher structure as second, and a bitset of received events as
519     third argument.
520    
521 root 1.14 The received events usually include a single bit per event type received
522 root 1.1 (you can receive multiple events at the same time). The possible bit masks
523     are:
524    
525     =over 4
526    
527 root 1.10 =item C<EV_READ>
528 root 1.1
529 root 1.10 =item C<EV_WRITE>
530 root 1.1
531 root 1.10 The file descriptor in the C<ev_io> watcher has become readable and/or
532 root 1.1 writable.
533    
534 root 1.10 =item C<EV_TIMEOUT>
535 root 1.1
536 root 1.10 The C<ev_timer> watcher has timed out.
537 root 1.1
538 root 1.10 =item C<EV_PERIODIC>
539 root 1.1
540 root 1.10 The C<ev_periodic> watcher has timed out.
541 root 1.1
542 root 1.10 =item C<EV_SIGNAL>
543 root 1.1
544 root 1.10 The signal specified in the C<ev_signal> watcher has been received by a thread.
545 root 1.1
546 root 1.10 =item C<EV_CHILD>
547 root 1.1
548 root 1.10 The pid specified in the C<ev_child> watcher has received a status change.
549 root 1.1
550 root 1.10 =item C<EV_IDLE>
551 root 1.1
552 root 1.10 The C<ev_idle> watcher has determined that you have nothing better to do.
553 root 1.1
554 root 1.10 =item C<EV_PREPARE>
555 root 1.1
556 root 1.10 =item C<EV_CHECK>
557 root 1.1
558 root 1.10 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
559     to gather new events, and all C<ev_check> watchers are invoked just after
560 root 1.1 C<ev_loop> has gathered them, but before it invokes any callbacks for any
561     received events. Callbacks of both watcher types can start and stop as
562     many watchers as they want, and all of them will be taken into account
563 root 1.10 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
564 root 1.1 C<ev_loop> from blocking).
565    
566 root 1.10 =item C<EV_ERROR>
567 root 1.1
568     An unspecified error has occured, the watcher has been stopped. This might
569     happen because the watcher could not be properly started because libev
570     ran out of memory, a file descriptor was found to be closed or any other
571     problem. You best act on it by reporting the problem and somehow coping
572     with the watcher being stopped.
573    
574     Libev will usually signal a few "dummy" events together with an error,
575     for example it might indicate that a fd is readable or writable, and if
576     your callbacks is well-written it can just attempt the operation and cope
577     with the error from read() or write(). This will not work in multithreaded
578     programs, though, so beware.
579    
580     =back
581    
582     =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
583    
584     Each watcher has, by default, a member C<void *data> that you can change
585 root 1.14 and read at any time, libev will completely ignore it. This can be used
586 root 1.1 to associate arbitrary data with your watcher. If you need more data and
587     don't want to allocate memory and store a pointer to it in that data
588     member, you can also "subclass" the watcher type and provide your own
589     data:
590    
591     struct my_io
592     {
593     struct ev_io io;
594     int otherfd;
595     void *somedata;
596     struct whatever *mostinteresting;
597     }
598    
599     And since your callback will be called with a pointer to the watcher, you
600     can cast it back to your own type:
601    
602     static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
603     {
604     struct my_io *w = (struct my_io *)w_;
605     ...
606     }
607    
608     More interesting and less C-conformant ways of catsing your callback type
609     have been omitted....
610    
611    
612     =head1 WATCHER TYPES
613    
614     This section describes each watcher in detail, but will not repeat
615     information given in the last section.
616    
617 root 1.34
618 root 1.11 =head2 C<ev_io> - is this file descriptor readable or writable
619 root 1.1
620 root 1.4 I/O watchers check whether a file descriptor is readable or writable
621 root 1.1 in each iteration of the event loop (This behaviour is called
622     level-triggering because you keep receiving events as long as the
623 root 1.14 condition persists. Remember you can stop the watcher if you don't want to
624 root 1.1 act on the event and neither want to receive future events).
625    
626 root 1.23 In general you can register as many read and/or write event watchers per
627 root 1.8 fd as you want (as long as you don't confuse yourself). Setting all file
628     descriptors to non-blocking mode is also usually a good idea (but not
629     required if you know what you are doing).
630    
631     You have to be careful with dup'ed file descriptors, though. Some backends
632     (the linux epoll backend is a notable example) cannot handle dup'ed file
633     descriptors correctly if you register interest in two or more fds pointing
634 root 1.24 to the same underlying file/socket etc. description (that is, they share
635     the same underlying "file open").
636 root 1.8
637     If you must do this, then force the use of a known-to-be-good backend
638 root 1.31 (at the time of this writing, this includes only C<EVBACKEND_SELECT> and
639     C<EVBACKEND_POLL>).
640 root 1.8
641 root 1.1 =over 4
642    
643     =item ev_io_init (ev_io *, callback, int fd, int events)
644    
645     =item ev_io_set (ev_io *, int fd, int events)
646    
647 root 1.10 Configures an C<ev_io> watcher. The fd is the file descriptor to rceeive
648 root 1.1 events for and events is either C<EV_READ>, C<EV_WRITE> or C<EV_READ |
649     EV_WRITE> to receive the given events.
650    
651 root 1.32 Please note that most of the more scalable backend mechanisms (for example
652     epoll and solaris ports) can result in spurious readyness notifications
653     for file descriptors, so you practically need to use non-blocking I/O (and
654     treat callback invocation as hint only), or retest separately with a safe
655     interface before doing I/O (XLib can do this), or force the use of either
656     C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>, which don't suffer from this
657     problem. Also note that it is quite easy to have your callback invoked
658     when the readyness condition is no longer valid even when employing
659     typical ways of handling events, so its a good idea to use non-blocking
660     I/O unconditionally.
661    
662 root 1.1 =back
663    
664 root 1.34 Example: call C<stdin_readable_cb> when STDIN_FILENO has become, well
665     readable, but only once. Since it is likely line-buffered, you could
666     attempt to read a whole line in the callback:
667    
668     static void
669     stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
670     {
671     ev_io_stop (loop, w);
672     .. read from stdin here (or from w->fd) and haqndle any I/O errors
673     }
674    
675     ...
676     struct ev_loop *loop = ev_default_init (0);
677     struct ev_io stdin_readable;
678     ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
679     ev_io_start (loop, &stdin_readable);
680     ev_loop (loop, 0);
681    
682    
683 root 1.10 =head2 C<ev_timer> - relative and optionally recurring timeouts
684 root 1.1
685     Timer watchers are simple relative timers that generate an event after a
686     given time, and optionally repeating in regular intervals after that.
687    
688     The timers are based on real time, that is, if you register an event that
689 root 1.22 times out after an hour and you reset your system clock to last years
690 root 1.1 time, it will still time out after (roughly) and hour. "Roughly" because
691 root 1.28 detecting time jumps is hard, and some inaccuracies are unavoidable (the
692 root 1.1 monotonic clock option helps a lot here).
693    
694 root 1.9 The relative timeouts are calculated relative to the C<ev_now ()>
695     time. This is usually the right thing as this timestamp refers to the time
696 root 1.28 of the event triggering whatever timeout you are modifying/starting. If
697     you suspect event processing to be delayed and you I<need> to base the timeout
698 root 1.22 on the current time, use something like this to adjust for this:
699 root 1.9
700     ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
701    
702 root 1.28 The callback is guarenteed to be invoked only when its timeout has passed,
703     but if multiple timers become ready during the same loop iteration then
704     order of execution is undefined.
705    
706 root 1.1 =over 4
707    
708     =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
709    
710     =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
711    
712     Configure the timer to trigger after C<after> seconds. If C<repeat> is
713     C<0.>, then it will automatically be stopped. If it is positive, then the
714     timer will automatically be configured to trigger again C<repeat> seconds
715     later, again, and again, until stopped manually.
716    
717     The timer itself will do a best-effort at avoiding drift, that is, if you
718     configure a timer to trigger every 10 seconds, then it will trigger at
719     exactly 10 second intervals. If, however, your program cannot keep up with
720 root 1.22 the timer (because it takes longer than those 10 seconds to do stuff) the
721 root 1.1 timer will not fire more than once per event loop iteration.
722    
723     =item ev_timer_again (loop)
724    
725     This will act as if the timer timed out and restart it again if it is
726     repeating. The exact semantics are:
727    
728     If the timer is started but nonrepeating, stop it.
729    
730     If the timer is repeating, either start it if necessary (with the repeat
731     value), or reset the running timer to the repeat value.
732    
733     This sounds a bit complicated, but here is a useful and typical
734     example: Imagine you have a tcp connection and you want a so-called idle
735     timeout, that is, you want to be called when there have been, say, 60
736     seconds of inactivity on the socket. The easiest way to do this is to
737 root 1.10 configure an C<ev_timer> with after=repeat=60 and calling ev_timer_again each
738 root 1.1 time you successfully read or write some data. If you go into an idle
739     state where you do not expect data to travel on the socket, you can stop
740     the timer, and again will automatically restart it if need be.
741    
742     =back
743    
744 root 1.34 Example: create a timer that fires after 60 seconds.
745    
746     static void
747     one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
748     {
749     .. one minute over, w is actually stopped right here
750     }
751    
752     struct ev_timer mytimer;
753     ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
754     ev_timer_start (loop, &mytimer);
755    
756     Example: create a timeout timer that times out after 10 seconds of
757     inactivity.
758    
759     static void
760     timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
761     {
762     .. ten seconds without any activity
763     }
764    
765     struct ev_timer mytimer;
766     ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
767     ev_timer_again (&mytimer); /* start timer */
768     ev_loop (loop, 0);
769    
770     // and in some piece of code that gets executed on any "activity":
771     // reset the timeout to start ticking again at 10 seconds
772     ev_timer_again (&mytimer);
773    
774    
775 root 1.14 =head2 C<ev_periodic> - to cron or not to cron
776 root 1.1
777     Periodic watchers are also timers of a kind, but they are very versatile
778     (and unfortunately a bit complex).
779    
780 root 1.10 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
781 root 1.1 but on wallclock time (absolute time). You can tell a periodic watcher
782     to trigger "at" some specific point in time. For example, if you tell a
783     periodic watcher to trigger in 10 seconds (by specifiying e.g. c<ev_now ()
784     + 10.>) and then reset your system clock to the last year, then it will
785 root 1.10 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
786 root 1.1 roughly 10 seconds later and of course not if you reset your system time
787     again).
788    
789     They can also be used to implement vastly more complex timers, such as
790     triggering an event on eahc midnight, local time.
791    
792 root 1.28 As with timers, the callback is guarenteed to be invoked only when the
793     time (C<at>) has been passed, but if multiple periodic timers become ready
794     during the same loop iteration then order of execution is undefined.
795    
796 root 1.1 =over 4
797    
798     =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
799    
800     =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
801    
802     Lots of arguments, lets sort it out... There are basically three modes of
803     operation, and we will explain them from simplest to complex:
804    
805     =over 4
806    
807     =item * absolute timer (interval = reschedule_cb = 0)
808    
809     In this configuration the watcher triggers an event at the wallclock time
810     C<at> and doesn't repeat. It will not adjust when a time jump occurs,
811     that is, if it is to be run at January 1st 2011 then it will run when the
812     system time reaches or surpasses this time.
813    
814     =item * non-repeating interval timer (interval > 0, reschedule_cb = 0)
815    
816     In this mode the watcher will always be scheduled to time out at the next
817     C<at + N * interval> time (for some integer N) and then repeat, regardless
818     of any time jumps.
819    
820     This can be used to create timers that do not drift with respect to system
821     time:
822    
823     ev_periodic_set (&periodic, 0., 3600., 0);
824    
825     This doesn't mean there will always be 3600 seconds in between triggers,
826     but only that the the callback will be called when the system time shows a
827 root 1.12 full hour (UTC), or more correctly, when the system time is evenly divisible
828 root 1.1 by 3600.
829    
830     Another way to think about it (for the mathematically inclined) is that
831 root 1.10 C<ev_periodic> will try to run the callback in this mode at the next possible
832 root 1.1 time where C<time = at (mod interval)>, regardless of any time jumps.
833    
834     =item * manual reschedule mode (reschedule_cb = callback)
835    
836     In this mode the values for C<interval> and C<at> are both being
837     ignored. Instead, each time the periodic watcher gets scheduled, the
838     reschedule callback will be called with the watcher as first, and the
839     current time as second argument.
840    
841 root 1.18 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
842     ever, or make any event loop modifications>. If you need to stop it,
843     return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
844     starting a prepare watcher).
845 root 1.1
846 root 1.13 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
847 root 1.1 ev_tstamp now)>, e.g.:
848    
849     static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
850     {
851     return now + 60.;
852     }
853    
854     It must return the next time to trigger, based on the passed time value
855     (that is, the lowest time value larger than to the second argument). It
856     will usually be called just before the callback will be triggered, but
857     might be called at other times, too.
858    
859 root 1.18 NOTE: I<< This callback must always return a time that is later than the
860 root 1.19 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
861 root 1.18
862 root 1.1 This can be used to create very complex timers, such as a timer that
863     triggers on each midnight, local time. To do this, you would calculate the
864 root 1.19 next midnight after C<now> and return the timestamp value for this. How
865     you do this is, again, up to you (but it is not trivial, which is the main
866     reason I omitted it as an example).
867 root 1.1
868     =back
869    
870     =item ev_periodic_again (loop, ev_periodic *)
871    
872     Simply stops and restarts the periodic watcher again. This is only useful
873     when you changed some parameters or the reschedule callback would return
874     a different time than the last time it was called (e.g. in a crond like
875     program when the crontabs have changed).
876    
877     =back
878    
879 root 1.34 Example: call a callback every hour, or, more precisely, whenever the
880     system clock is divisible by 3600. The callback invocation times have
881     potentially a lot of jittering, but good long-term stability.
882    
883     static void
884     clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
885     {
886     ... its now a full hour (UTC, or TAI or whatever your clock follows)
887     }
888    
889     struct ev_periodic hourly_tick;
890     ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
891     ev_periodic_start (loop, &hourly_tick);
892    
893     Example: the same as above, but use a reschedule callback to do it:
894    
895     #include <math.h>
896    
897     static ev_tstamp
898     my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
899     {
900     return fmod (now, 3600.) + 3600.;
901     }
902    
903     ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
904    
905     Example: call a callback every hour, starting now:
906    
907     struct ev_periodic hourly_tick;
908     ev_periodic_init (&hourly_tick, clock_cb,
909     fmod (ev_now (loop), 3600.), 3600., 0);
910     ev_periodic_start (loop, &hourly_tick);
911    
912    
913 root 1.10 =head2 C<ev_signal> - signal me when a signal gets signalled
914 root 1.1
915     Signal watchers will trigger an event when the process receives a specific
916     signal one or more times. Even though signals are very asynchronous, libev
917 root 1.9 will try it's best to deliver signals synchronously, i.e. as part of the
918 root 1.1 normal event processing, like any other event.
919    
920 root 1.14 You can configure as many watchers as you like per signal. Only when the
921 root 1.1 first watcher gets started will libev actually register a signal watcher
922     with the kernel (thus it coexists with your own signal handlers as long
923     as you don't register any with libev). Similarly, when the last signal
924     watcher for a signal is stopped libev will reset the signal handler to
925     SIG_DFL (regardless of what it was set to before).
926    
927     =over 4
928    
929     =item ev_signal_init (ev_signal *, callback, int signum)
930    
931     =item ev_signal_set (ev_signal *, int signum)
932    
933     Configures the watcher to trigger on the given signal number (usually one
934     of the C<SIGxxx> constants).
935    
936     =back
937    
938 root 1.35
939 root 1.10 =head2 C<ev_child> - wait for pid status changes
940 root 1.1
941     Child watchers trigger when your process receives a SIGCHLD in response to
942     some child status changes (most typically when a child of yours dies).
943    
944     =over 4
945    
946     =item ev_child_init (ev_child *, callback, int pid)
947    
948     =item ev_child_set (ev_child *, int pid)
949    
950     Configures the watcher to wait for status changes of process C<pid> (or
951     I<any> process if C<pid> is specified as C<0>). The callback can look
952     at the C<rstatus> member of the C<ev_child> watcher structure to see
953 root 1.14 the status word (use the macros from C<sys/wait.h> and see your systems
954     C<waitpid> documentation). The C<rpid> member contains the pid of the
955     process causing the status change.
956 root 1.1
957     =back
958    
959 root 1.34 Example: try to exit cleanly on SIGINT and SIGTERM.
960    
961     static void
962     sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
963     {
964     ev_unloop (loop, EVUNLOOP_ALL);
965     }
966    
967     struct ev_signal signal_watcher;
968     ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
969     ev_signal_start (loop, &sigint_cb);
970    
971    
972 root 1.10 =head2 C<ev_idle> - when you've got nothing better to do
973 root 1.1
974 root 1.14 Idle watchers trigger events when there are no other events are pending
975     (prepare, check and other idle watchers do not count). That is, as long
976     as your process is busy handling sockets or timeouts (or even signals,
977     imagine) it will not be triggered. But when your process is idle all idle
978     watchers are being called again and again, once per event loop iteration -
979     until stopped, that is, or your process receives more events and becomes
980     busy.
981 root 1.1
982     The most noteworthy effect is that as long as any idle watchers are
983     active, the process will not block when waiting for new events.
984    
985     Apart from keeping your process non-blocking (which is a useful
986     effect on its own sometimes), idle watchers are a good place to do
987     "pseudo-background processing", or delay processing stuff to after the
988     event loop has handled all outstanding events.
989    
990     =over 4
991    
992     =item ev_idle_init (ev_signal *, callback)
993    
994     Initialises and configures the idle watcher - it has no parameters of any
995     kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
996     believe me.
997    
998     =back
999    
1000 root 1.34 Example: dynamically allocate an C<ev_idle>, start it, and in the
1001     callback, free it. Alos, use no error checking, as usual.
1002    
1003     static void
1004     idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1005     {
1006     free (w);
1007     // now do something you wanted to do when the program has
1008     // no longer asnything immediate to do.
1009     }
1010    
1011     struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1012     ev_idle_init (idle_watcher, idle_cb);
1013     ev_idle_start (loop, idle_cb);
1014    
1015    
1016 root 1.16 =head2 C<ev_prepare> and C<ev_check> - customise your event loop
1017 root 1.1
1018 root 1.14 Prepare and check watchers are usually (but not always) used in tandem:
1019 root 1.20 prepare watchers get invoked before the process blocks and check watchers
1020 root 1.14 afterwards.
1021 root 1.1
1022 root 1.35 Their main purpose is to integrate other event mechanisms into libev and
1023     their use is somewhat advanced. This could be used, for example, to track
1024     variable changes, implement your own watchers, integrate net-snmp or a
1025     coroutine library and lots more.
1026 root 1.1
1027     This is done by examining in each prepare call which file descriptors need
1028 root 1.14 to be watched by the other library, registering C<ev_io> watchers for
1029     them and starting an C<ev_timer> watcher for any timeouts (many libraries
1030     provide just this functionality). Then, in the check watcher you check for
1031     any events that occured (by checking the pending status of all watchers
1032     and stopping them) and call back into the library. The I/O and timer
1033 root 1.20 callbacks will never actually be called (but must be valid nevertheless,
1034 root 1.14 because you never know, you know?).
1035 root 1.1
1036 root 1.14 As another example, the Perl Coro module uses these hooks to integrate
1037 root 1.1 coroutines into libev programs, by yielding to other active coroutines
1038     during each prepare and only letting the process block if no coroutines
1039 root 1.20 are ready to run (it's actually more complicated: it only runs coroutines
1040     with priority higher than or equal to the event loop and one coroutine
1041     of lower priority, but only once, using idle watchers to keep the event
1042     loop from blocking if lower-priority coroutines are active, thus mapping
1043     low-priority coroutines to idle/background tasks).
1044 root 1.1
1045     =over 4
1046    
1047     =item ev_prepare_init (ev_prepare *, callback)
1048    
1049     =item ev_check_init (ev_check *, callback)
1050    
1051     Initialises and configures the prepare or check watcher - they have no
1052     parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1053 root 1.14 macros, but using them is utterly, utterly and completely pointless.
1054 root 1.1
1055     =back
1056    
1057 root 1.34 Example: *TODO*.
1058    
1059    
1060 root 1.35 =head2 C<ev_embed> - when one backend isn't enough
1061    
1062     This is a rather advanced watcher type that lets you embed one event loop
1063     into another.
1064    
1065     There are primarily two reasons you would want that: work around bugs and
1066     prioritise I/O.
1067    
1068     As an example for a bug workaround, the kqueue backend might only support
1069     sockets on some platform, so it is unusable as generic backend, but you
1070     still want to make use of it because you have many sockets and it scales
1071     so nicely. In this case, you would create a kqueue-based loop and embed it
1072     into your default loop (which might use e.g. poll). Overall operation will
1073     be a bit slower because first libev has to poll and then call kevent, but
1074     at least you can use both at what they are best.
1075    
1076     As for prioritising I/O: rarely you have the case where some fds have
1077     to be watched and handled very quickly (with low latency), and even
1078     priorities and idle watchers might have too much overhead. In this case
1079     you would put all the high priority stuff in one loop and all the rest in
1080     a second one, and embed the second one in the first.
1081    
1082     As long as the watcher is started it will automatically handle events. The
1083     callback will be invoked whenever some events have been handled. You can
1084     set the callback to C<0> to avoid having to specify one if you are not
1085     interested in that.
1086    
1087     Also, there have not currently been made special provisions for forking:
1088     when you fork, you not only have to call C<ev_loop_fork> on both loops,
1089     but you will also have to stop and restart any C<ev_embed> watchers
1090     yourself.
1091    
1092     Unfortunately, not all backends are embeddable, only the ones returned by
1093     C<ev_embeddable_backends> are, which, unfortunately, does not include any
1094     portable one.
1095    
1096     So when you want to use this feature you will always have to be prepared
1097     that you cannot get an embeddable loop. The recommended way to get around
1098     this is to have a separate variables for your embeddable loop, try to
1099     create it, and if that fails, use the normal loop for everything:
1100    
1101     struct ev_loop *loop_hi = ev_default_init (0);
1102     struct ev_loop *loop_lo = 0;
1103     struct ev_embed embed;
1104    
1105     // see if there is a chance of getting one that works
1106     // (remember that a flags value of 0 means autodetection)
1107     loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1108     ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1109     : 0;
1110    
1111     // if we got one, then embed it, otherwise default to loop_hi
1112     if (loop_lo)
1113     {
1114     ev_embed_init (&embed, 0, loop_lo);
1115     ev_embed_start (loop_hi, &embed);
1116     }
1117     else
1118     loop_lo = loop_hi;
1119    
1120     =over 4
1121    
1122     =item ev_embed_init (ev_embed *, callback, struct ev_loop *loop)
1123    
1124     =item ev_embed_set (ev_embed *, callback, struct ev_loop *loop)
1125    
1126     Configures the watcher to embed the given loop, which must be embeddable.
1127    
1128     =back
1129    
1130    
1131 root 1.1 =head1 OTHER FUNCTIONS
1132    
1133 root 1.14 There are some other functions of possible interest. Described. Here. Now.
1134 root 1.1
1135     =over 4
1136    
1137     =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
1138    
1139     This function combines a simple timer and an I/O watcher, calls your
1140     callback on whichever event happens first and automatically stop both
1141     watchers. This is useful if you want to wait for a single event on an fd
1142 root 1.22 or timeout without having to allocate/configure/start/stop/free one or
1143 root 1.1 more watchers yourself.
1144    
1145 root 1.14 If C<fd> is less than 0, then no I/O watcher will be started and events
1146     is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
1147     C<events> set will be craeted and started.
1148 root 1.1
1149     If C<timeout> is less than 0, then no timeout watcher will be
1150 root 1.14 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
1151     repeat = 0) will be started. While C<0> is a valid timeout, it is of
1152     dubious value.
1153    
1154     The callback has the type C<void (*cb)(int revents, void *arg)> and gets
1155 root 1.21 passed an C<revents> set like normal event callbacks (a combination of
1156 root 1.14 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
1157     value passed to C<ev_once>:
1158 root 1.1
1159     static void stdin_ready (int revents, void *arg)
1160     {
1161     if (revents & EV_TIMEOUT)
1162 root 1.14 /* doh, nothing entered */;
1163 root 1.1 else if (revents & EV_READ)
1164 root 1.14 /* stdin might have data for us, joy! */;
1165 root 1.1 }
1166    
1167 root 1.14 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
1168 root 1.1
1169     =item ev_feed_event (loop, watcher, int events)
1170    
1171     Feeds the given event set into the event loop, as if the specified event
1172 root 1.14 had happened for the specified watcher (which must be a pointer to an
1173     initialised but not necessarily started event watcher).
1174 root 1.1
1175     =item ev_feed_fd_event (loop, int fd, int revents)
1176    
1177 root 1.14 Feed an event on the given fd, as if a file descriptor backend detected
1178     the given events it.
1179 root 1.1
1180     =item ev_feed_signal_event (loop, int signum)
1181    
1182     Feed an event as if the given signal occured (loop must be the default loop!).
1183    
1184     =back
1185    
1186 root 1.34
1187 root 1.20 =head1 LIBEVENT EMULATION
1188    
1189 root 1.24 Libev offers a compatibility emulation layer for libevent. It cannot
1190     emulate the internals of libevent, so here are some usage hints:
1191    
1192     =over 4
1193    
1194     =item * Use it by including <event.h>, as usual.
1195    
1196     =item * The following members are fully supported: ev_base, ev_callback,
1197     ev_arg, ev_fd, ev_res, ev_events.
1198    
1199     =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
1200     maintained by libev, it does not work exactly the same way as in libevent (consider
1201     it a private API).
1202    
1203     =item * Priorities are not currently supported. Initialising priorities
1204     will fail and all watchers will have the same priority, even though there
1205     is an ev_pri field.
1206    
1207     =item * Other members are not supported.
1208    
1209     =item * The libev emulation is I<not> ABI compatible to libevent, you need
1210     to use the libev header file and library.
1211    
1212     =back
1213 root 1.20
1214     =head1 C++ SUPPORT
1215    
1216     TBD.
1217    
1218 root 1.1 =head1 AUTHOR
1219    
1220     Marc Lehmann <libev@schmorp.de>.
1221