ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
Revision: 1.37
Committed: Sat Nov 24 07:20:43 2007 UTC (16 years, 5 months ago) by root
Branch: MAIN
Changes since 1.36: +6 -2 lines
Log Message:
*** empty log message ***

File Contents

# Content
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 these event sources and provide your program with events.
14
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 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).
33
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 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.
43
44 =head1 TIME REPRESENTATION
45
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 C<double> type in C, and when you need to do any calculations on
51 it, you should treat it as such.
52
53
54 =head1 GLOBAL FUNCTIONS
55
56 These functions can be called anytime, even before initialising the
57 library in any way.
58
59 =over 4
60
61 =item ev_tstamp ev_time ()
62
63 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
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 Usually, it's a good idea to terminate if the major versions mismatch,
78 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 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 =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 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 =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 libev will probe for if you specify no backends explicitly.
110
111 =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 =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 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
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 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 =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 matter what, when it returns. That is, libev will generally retry the
160 requested operation, or, if the condition doesn't go away, do bad stuff
161 (such as abort).
162
163 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 =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 in your main thread (or in a separate thread) and for each thread you
185 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 done correctly, because it's hideous and inefficient).
189
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 flags. If that is troubling you, check C<ev_backend ()> afterwards).
198
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 backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
204
205 The following flags are supported:
206
207 =over 4
208
209 =item C<EVFLAG_AUTO>
210
211 The default flags value. Use this if you have no clue (it's the right
212 thing, believe me).
213
214 =item C<EVFLAG_NOENV>
215
216 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
223 =item C<EVBACKEND_SELECT> (value 1, portable select backend)
224
225 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
231 =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
232
233 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
238 =item C<EVBACKEND_EPOLL> (value 4, Linux)
239
240 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
245 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 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 =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
256
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 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
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 =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
271
272 This is not implemented yet (and might never be).
273
274 =item C<EVBACKEND_PORT> (value 32, Solaris 10)
275
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 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 =item C<EVBACKEND_ALL>
284
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 C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
288
289 =back
290
291 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 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 =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 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 =item ev_default_destroy ()
326
327 Destroys the default loop again (frees all memory and kernel state
328 etc.). None of the active event watchers will be stopped in the normal
329 sense, so e.g. C<ev_is_active> might still return true. It is your
330 responsibility to either stop all watchers cleanly yoursef I<before>
331 calling this function, or cope with the fact afterwards (which is usually
332 the easiest thing, youc na just ignore the watchers and/or C<free ()> them
333 for example).
334
335 =item ev_loop_destroy (loop)
336
337 Like C<ev_default_destroy>, but destroys an event loop created by an
338 earlier call to C<ev_loop_new>.
339
340 =item ev_default_fork ()
341
342 This function reinitialises the kernel state for backends that have
343 one. Despite the name, you can call it anytime, but it makes most sense
344 after forking, in either the parent or child process (or both, but that
345 again makes little sense).
346
347 You I<must> call this function in the child process after forking if and
348 only if you want to use the event library in both processes. If you just
349 fork+exec, you don't have to call it.
350
351 The function itself is quite fast and it's usually not a problem to call
352 it just in case after a fork. To make this easy, the function will fit in
353 quite nicely into a call to C<pthread_atfork>:
354
355 pthread_atfork (0, 0, ev_default_fork);
356
357 At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
358 without calling this function, so if you force one of those backends you
359 do not need to care.
360
361 =item ev_loop_fork (loop)
362
363 Like C<ev_default_fork>, but acts on an event loop created by
364 C<ev_loop_new>. Yes, you have to call this on every allocated event loop
365 after fork, and how you do this is entirely your own problem.
366
367 =item unsigned int ev_backend (loop)
368
369 Returns one of the C<EVBACKEND_*> flags indicating the event backend in
370 use.
371
372 =item ev_tstamp ev_now (loop)
373
374 Returns the current "event loop time", which is the time the event loop
375 received events and started processing them. This timestamp does not
376 change as long as callbacks are being processed, and this is also the base
377 time used for relative timers. You can treat it as the timestamp of the
378 event occuring (or more correctly, libev finding out about it).
379
380 =item ev_loop (loop, int flags)
381
382 Finally, this is it, the event handler. This function usually is called
383 after you initialised all your watchers and you want to start handling
384 events.
385
386 If the flags argument is specified as C<0>, it will not return until
387 either no event watchers are active anymore or C<ev_unloop> was called.
388
389 Please note that an explicit C<ev_unloop> is usually better than
390 relying on all watchers to be stopped when deciding when a program has
391 finished (especially in interactive programs), but having a program that
392 automatically loops as long as it has to and no longer by virtue of
393 relying on its watchers stopping correctly is a thing of beauty.
394
395 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
396 those events and any outstanding ones, but will not block your process in
397 case there are no events and will return after one iteration of the loop.
398
399 A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
400 neccessary) and will handle those and any outstanding ones. It will block
401 your process until at least one new event arrives, and will return after
402 one iteration of the loop. This is useful if you are waiting for some
403 external event in conjunction with something not expressible using other
404 libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
405 usually a better approach for this kind of thing.
406
407 Here are the gory details of what C<ev_loop> does:
408
409 * If there are no active watchers (reference count is zero), return.
410 - Queue prepare watchers and then call all outstanding watchers.
411 - If we have been forked, recreate the kernel state.
412 - Update the kernel state with all outstanding changes.
413 - Update the "event loop time".
414 - Calculate for how long to block.
415 - Block the process, waiting for any events.
416 - Queue all outstanding I/O (fd) events.
417 - Update the "event loop time" and do time jump handling.
418 - Queue all outstanding timers.
419 - Queue all outstanding periodics.
420 - If no events are pending now, queue all idle watchers.
421 - Queue all check watchers.
422 - Call all queued watchers in reverse order (i.e. check watchers first).
423 Signals and child watchers are implemented as I/O watchers, and will
424 be handled here by queueing them when their watcher gets executed.
425 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
426 were used, return, otherwise continue with step *.
427
428 Example: queue some jobs and then loop until no events are outsanding
429 anymore.
430
431 ... queue jobs here, make sure they register event watchers as long
432 ... as they still have work to do (even an idle watcher will do..)
433 ev_loop (my_loop, 0);
434 ... jobs done. yeah!
435
436 =item ev_unloop (loop, how)
437
438 Can be used to make a call to C<ev_loop> return early (but only after it
439 has processed all outstanding events). The C<how> argument must be either
440 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
441 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
442
443 =item ev_ref (loop)
444
445 =item ev_unref (loop)
446
447 Ref/unref can be used to add or remove a reference count on the event
448 loop: Every watcher keeps one reference, and as long as the reference
449 count is nonzero, C<ev_loop> will not return on its own. If you have
450 a watcher you never unregister that should not keep C<ev_loop> from
451 returning, ev_unref() after starting, and ev_ref() before stopping it. For
452 example, libev itself uses this for its internal signal pipe: It is not
453 visible to the libev user and should not keep C<ev_loop> from exiting if
454 no event watchers registered by it are active. It is also an excellent
455 way to do this for generic recurring timers or from within third-party
456 libraries. Just remember to I<unref after start> and I<ref before stop>.
457
458 Example: create a signal watcher, but keep it from keeping C<ev_loop>
459 running when nothing else is active.
460
461 struct dv_signal exitsig;
462 ev_signal_init (&exitsig, sig_cb, SIGINT);
463 ev_signal_start (myloop, &exitsig);
464 evf_unref (myloop);
465
466 Example: for some weird reason, unregister the above signal handler again.
467
468 ev_ref (myloop);
469 ev_signal_stop (myloop, &exitsig);
470
471 =back
472
473 =head1 ANATOMY OF A WATCHER
474
475 A watcher is a structure that you create and register to record your
476 interest in some event. For instance, if you want to wait for STDIN to
477 become readable, you would create an C<ev_io> watcher for that:
478
479 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
480 {
481 ev_io_stop (w);
482 ev_unloop (loop, EVUNLOOP_ALL);
483 }
484
485 struct ev_loop *loop = ev_default_loop (0);
486 struct ev_io stdin_watcher;
487 ev_init (&stdin_watcher, my_cb);
488 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
489 ev_io_start (loop, &stdin_watcher);
490 ev_loop (loop, 0);
491
492 As you can see, you are responsible for allocating the memory for your
493 watcher structures (and it is usually a bad idea to do this on the stack,
494 although this can sometimes be quite valid).
495
496 Each watcher structure must be initialised by a call to C<ev_init
497 (watcher *, callback)>, which expects a callback to be provided. This
498 callback gets invoked each time the event occurs (or, in the case of io
499 watchers, each time the event loop detects that the file descriptor given
500 is readable and/or writable).
501
502 Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
503 with arguments specific to this watcher type. There is also a macro
504 to combine initialisation and setting in one call: C<< ev_<type>_init
505 (watcher *, callback, ...) >>.
506
507 To make the watcher actually watch out for events, you have to start it
508 with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
509 *) >>), and you can stop watching for events at any time by calling the
510 corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
511
512 As long as your watcher is active (has been started but not stopped) you
513 must not touch the values stored in it. Most specifically you must never
514 reinitialise it or call its C<set> macro.
515
516 Each and every callback receives the event loop pointer as first, the
517 registered watcher structure as second, and a bitset of received events as
518 third argument.
519
520 The received events usually include a single bit per event type received
521 (you can receive multiple events at the same time). The possible bit masks
522 are:
523
524 =over 4
525
526 =item C<EV_READ>
527
528 =item C<EV_WRITE>
529
530 The file descriptor in the C<ev_io> watcher has become readable and/or
531 writable.
532
533 =item C<EV_TIMEOUT>
534
535 The C<ev_timer> watcher has timed out.
536
537 =item C<EV_PERIODIC>
538
539 The C<ev_periodic> watcher has timed out.
540
541 =item C<EV_SIGNAL>
542
543 The signal specified in the C<ev_signal> watcher has been received by a thread.
544
545 =item C<EV_CHILD>
546
547 The pid specified in the C<ev_child> watcher has received a status change.
548
549 =item C<EV_IDLE>
550
551 The C<ev_idle> watcher has determined that you have nothing better to do.
552
553 =item C<EV_PREPARE>
554
555 =item C<EV_CHECK>
556
557 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
558 to gather new events, and all C<ev_check> watchers are invoked just after
559 C<ev_loop> has gathered them, but before it invokes any callbacks for any
560 received events. Callbacks of both watcher types can start and stop as
561 many watchers as they want, and all of them will be taken into account
562 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
563 C<ev_loop> from blocking).
564
565 =item C<EV_ERROR>
566
567 An unspecified error has occured, the watcher has been stopped. This might
568 happen because the watcher could not be properly started because libev
569 ran out of memory, a file descriptor was found to be closed or any other
570 problem. You best act on it by reporting the problem and somehow coping
571 with the watcher being stopped.
572
573 Libev will usually signal a few "dummy" events together with an error,
574 for example it might indicate that a fd is readable or writable, and if
575 your callbacks is well-written it can just attempt the operation and cope
576 with the error from read() or write(). This will not work in multithreaded
577 programs, though, so beware.
578
579 =back
580
581 =head2 SUMMARY OF GENERIC WATCHER FUNCTIONS
582
583 In the following description, C<TYPE> stands for the watcher type,
584 e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
585
586 =over 4
587
588 =item C<ev_init> (ev_TYPE *watcher, callback)
589
590 This macro initialises the generic portion of a watcher. The contents
591 of the watcher object can be arbitrary (so C<malloc> will do). Only
592 the generic parts of the watcher are initialised, you I<need> to call
593 the type-specific C<ev_TYPE_set> macro afterwards to initialise the
594 type-specific parts. For each type there is also a C<ev_TYPE_init> macro
595 which rolls both calls into one.
596
597 You can reinitialise a watcher at any time as long as it has been stopped
598 (or never started) and there are no pending events outstanding.
599
600 The callbakc is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,
601 int revents)>.
602
603 =item C<ev_TYPE_set> (ev_TYPE *, [args])
604
605 This macro initialises the type-specific parts of a watcher. You need to
606 call C<ev_init> at least once before you call this macro, but you can
607 call C<ev_TYPE_set> any number of times. You must not, however, call this
608 macro on a watcher that is active (it can be pending, however, which is a
609 difference to the C<ev_init> macro).
610
611 Although some watcher types do not have type-specific arguments
612 (e.g. C<ev_prepare>) you still need to call its C<set> macro.
613
614 =item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
615
616 This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
617 calls into a single call. This is the most convinient method to initialise
618 a watcher. The same limitations apply, of course.
619
620 =item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
621
622 Starts (activates) the given watcher. Only active watchers will receive
623 events. If the watcher is already active nothing will happen.
624
625 =item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
626
627 Stops the given watcher again (if active) and clears the pending
628 status. It is possible that stopped watchers are pending (for example,
629 non-repeating timers are being stopped when they become pending), but
630 C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If
631 you want to free or reuse the memory used by the watcher it is therefore a
632 good idea to always call its C<ev_TYPE_stop> function.
633
634 =item bool ev_is_active (ev_TYPE *watcher)
635
636 Returns a true value iff the watcher is active (i.e. it has been started
637 and not yet been stopped). As long as a watcher is active you must not modify
638 it.
639
640 =item bool ev_is_pending (ev_TYPE *watcher)
641
642 Returns a true value iff the watcher is pending, (i.e. it has outstanding
643 events but its callback has not yet been invoked). As long as a watcher
644 is pending (but not active) you must not call an init function on it (but
645 C<ev_TYPE_set> is safe) and you must make sure the watcher is available to
646 libev (e.g. you cnanot C<free ()> it).
647
648 =item callback = ev_cb (ev_TYPE *watcher)
649
650 Returns the callback currently set on the watcher.
651
652 =item ev_cb_set (ev_TYPE *watcher, callback)
653
654 Change the callback. You can change the callback at virtually any time
655 (modulo threads).
656
657 =back
658
659
660 =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
661
662 Each watcher has, by default, a member C<void *data> that you can change
663 and read at any time, libev will completely ignore it. This can be used
664 to associate arbitrary data with your watcher. If you need more data and
665 don't want to allocate memory and store a pointer to it in that data
666 member, you can also "subclass" the watcher type and provide your own
667 data:
668
669 struct my_io
670 {
671 struct ev_io io;
672 int otherfd;
673 void *somedata;
674 struct whatever *mostinteresting;
675 }
676
677 And since your callback will be called with a pointer to the watcher, you
678 can cast it back to your own type:
679
680 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
681 {
682 struct my_io *w = (struct my_io *)w_;
683 ...
684 }
685
686 More interesting and less C-conformant ways of catsing your callback type
687 have been omitted....
688
689
690 =head1 WATCHER TYPES
691
692 This section describes each watcher in detail, but will not repeat
693 information given in the last section.
694
695
696 =head2 C<ev_io> - is this file descriptor readable or writable
697
698 I/O watchers check whether a file descriptor is readable or writable
699 in each iteration of the event loop (This behaviour is called
700 level-triggering because you keep receiving events as long as the
701 condition persists. Remember you can stop the watcher if you don't want to
702 act on the event and neither want to receive future events).
703
704 In general you can register as many read and/or write event watchers per
705 fd as you want (as long as you don't confuse yourself). Setting all file
706 descriptors to non-blocking mode is also usually a good idea (but not
707 required if you know what you are doing).
708
709 You have to be careful with dup'ed file descriptors, though. Some backends
710 (the linux epoll backend is a notable example) cannot handle dup'ed file
711 descriptors correctly if you register interest in two or more fds pointing
712 to the same underlying file/socket etc. description (that is, they share
713 the same underlying "file open").
714
715 If you must do this, then force the use of a known-to-be-good backend
716 (at the time of this writing, this includes only C<EVBACKEND_SELECT> and
717 C<EVBACKEND_POLL>).
718
719 =over 4
720
721 =item ev_io_init (ev_io *, callback, int fd, int events)
722
723 =item ev_io_set (ev_io *, int fd, int events)
724
725 Configures an C<ev_io> watcher. The fd is the file descriptor to rceeive
726 events for and events is either C<EV_READ>, C<EV_WRITE> or C<EV_READ |
727 EV_WRITE> to receive the given events.
728
729 Please note that most of the more scalable backend mechanisms (for example
730 epoll and solaris ports) can result in spurious readyness notifications
731 for file descriptors, so you practically need to use non-blocking I/O (and
732 treat callback invocation as hint only), or retest separately with a safe
733 interface before doing I/O (XLib can do this), or force the use of either
734 C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>, which don't suffer from this
735 problem. Also note that it is quite easy to have your callback invoked
736 when the readyness condition is no longer valid even when employing
737 typical ways of handling events, so its a good idea to use non-blocking
738 I/O unconditionally.
739
740 =back
741
742 Example: call C<stdin_readable_cb> when STDIN_FILENO has become, well
743 readable, but only once. Since it is likely line-buffered, you could
744 attempt to read a whole line in the callback:
745
746 static void
747 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
748 {
749 ev_io_stop (loop, w);
750 .. read from stdin here (or from w->fd) and haqndle any I/O errors
751 }
752
753 ...
754 struct ev_loop *loop = ev_default_init (0);
755 struct ev_io stdin_readable;
756 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
757 ev_io_start (loop, &stdin_readable);
758 ev_loop (loop, 0);
759
760
761 =head2 C<ev_timer> - relative and optionally recurring timeouts
762
763 Timer watchers are simple relative timers that generate an event after a
764 given time, and optionally repeating in regular intervals after that.
765
766 The timers are based on real time, that is, if you register an event that
767 times out after an hour and you reset your system clock to last years
768 time, it will still time out after (roughly) and hour. "Roughly" because
769 detecting time jumps is hard, and some inaccuracies are unavoidable (the
770 monotonic clock option helps a lot here).
771
772 The relative timeouts are calculated relative to the C<ev_now ()>
773 time. This is usually the right thing as this timestamp refers to the time
774 of the event triggering whatever timeout you are modifying/starting. If
775 you suspect event processing to be delayed and you I<need> to base the timeout
776 on the current time, use something like this to adjust for this:
777
778 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
779
780 The callback is guarenteed to be invoked only when its timeout has passed,
781 but if multiple timers become ready during the same loop iteration then
782 order of execution is undefined.
783
784 =over 4
785
786 =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
787
788 =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
789
790 Configure the timer to trigger after C<after> seconds. If C<repeat> is
791 C<0.>, then it will automatically be stopped. If it is positive, then the
792 timer will automatically be configured to trigger again C<repeat> seconds
793 later, again, and again, until stopped manually.
794
795 The timer itself will do a best-effort at avoiding drift, that is, if you
796 configure a timer to trigger every 10 seconds, then it will trigger at
797 exactly 10 second intervals. If, however, your program cannot keep up with
798 the timer (because it takes longer than those 10 seconds to do stuff) the
799 timer will not fire more than once per event loop iteration.
800
801 =item ev_timer_again (loop)
802
803 This will act as if the timer timed out and restart it again if it is
804 repeating. The exact semantics are:
805
806 If the timer is started but nonrepeating, stop it.
807
808 If the timer is repeating, either start it if necessary (with the repeat
809 value), or reset the running timer to the repeat value.
810
811 This sounds a bit complicated, but here is a useful and typical
812 example: Imagine you have a tcp connection and you want a so-called idle
813 timeout, that is, you want to be called when there have been, say, 60
814 seconds of inactivity on the socket. The easiest way to do this is to
815 configure an C<ev_timer> with after=repeat=60 and calling ev_timer_again each
816 time you successfully read or write some data. If you go into an idle
817 state where you do not expect data to travel on the socket, you can stop
818 the timer, and again will automatically restart it if need be.
819
820 =back
821
822 Example: create a timer that fires after 60 seconds.
823
824 static void
825 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
826 {
827 .. one minute over, w is actually stopped right here
828 }
829
830 struct ev_timer mytimer;
831 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
832 ev_timer_start (loop, &mytimer);
833
834 Example: create a timeout timer that times out after 10 seconds of
835 inactivity.
836
837 static void
838 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
839 {
840 .. ten seconds without any activity
841 }
842
843 struct ev_timer mytimer;
844 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
845 ev_timer_again (&mytimer); /* start timer */
846 ev_loop (loop, 0);
847
848 // and in some piece of code that gets executed on any "activity":
849 // reset the timeout to start ticking again at 10 seconds
850 ev_timer_again (&mytimer);
851
852
853 =head2 C<ev_periodic> - to cron or not to cron
854
855 Periodic watchers are also timers of a kind, but they are very versatile
856 (and unfortunately a bit complex).
857
858 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
859 but on wallclock time (absolute time). You can tell a periodic watcher
860 to trigger "at" some specific point in time. For example, if you tell a
861 periodic watcher to trigger in 10 seconds (by specifiying e.g. c<ev_now ()
862 + 10.>) and then reset your system clock to the last year, then it will
863 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
864 roughly 10 seconds later and of course not if you reset your system time
865 again).
866
867 They can also be used to implement vastly more complex timers, such as
868 triggering an event on eahc midnight, local time.
869
870 As with timers, the callback is guarenteed to be invoked only when the
871 time (C<at>) has been passed, but if multiple periodic timers become ready
872 during the same loop iteration then order of execution is undefined.
873
874 =over 4
875
876 =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
877
878 =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
879
880 Lots of arguments, lets sort it out... There are basically three modes of
881 operation, and we will explain them from simplest to complex:
882
883 =over 4
884
885 =item * absolute timer (interval = reschedule_cb = 0)
886
887 In this configuration the watcher triggers an event at the wallclock time
888 C<at> and doesn't repeat. It will not adjust when a time jump occurs,
889 that is, if it is to be run at January 1st 2011 then it will run when the
890 system time reaches or surpasses this time.
891
892 =item * non-repeating interval timer (interval > 0, reschedule_cb = 0)
893
894 In this mode the watcher will always be scheduled to time out at the next
895 C<at + N * interval> time (for some integer N) and then repeat, regardless
896 of any time jumps.
897
898 This can be used to create timers that do not drift with respect to system
899 time:
900
901 ev_periodic_set (&periodic, 0., 3600., 0);
902
903 This doesn't mean there will always be 3600 seconds in between triggers,
904 but only that the the callback will be called when the system time shows a
905 full hour (UTC), or more correctly, when the system time is evenly divisible
906 by 3600.
907
908 Another way to think about it (for the mathematically inclined) is that
909 C<ev_periodic> will try to run the callback in this mode at the next possible
910 time where C<time = at (mod interval)>, regardless of any time jumps.
911
912 =item * manual reschedule mode (reschedule_cb = callback)
913
914 In this mode the values for C<interval> and C<at> are both being
915 ignored. Instead, each time the periodic watcher gets scheduled, the
916 reschedule callback will be called with the watcher as first, and the
917 current time as second argument.
918
919 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
920 ever, or make any event loop modifications>. If you need to stop it,
921 return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
922 starting a prepare watcher).
923
924 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
925 ev_tstamp now)>, e.g.:
926
927 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
928 {
929 return now + 60.;
930 }
931
932 It must return the next time to trigger, based on the passed time value
933 (that is, the lowest time value larger than to the second argument). It
934 will usually be called just before the callback will be triggered, but
935 might be called at other times, too.
936
937 NOTE: I<< This callback must always return a time that is later than the
938 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
939
940 This can be used to create very complex timers, such as a timer that
941 triggers on each midnight, local time. To do this, you would calculate the
942 next midnight after C<now> and return the timestamp value for this. How
943 you do this is, again, up to you (but it is not trivial, which is the main
944 reason I omitted it as an example).
945
946 =back
947
948 =item ev_periodic_again (loop, ev_periodic *)
949
950 Simply stops and restarts the periodic watcher again. This is only useful
951 when you changed some parameters or the reschedule callback would return
952 a different time than the last time it was called (e.g. in a crond like
953 program when the crontabs have changed).
954
955 =back
956
957 Example: call a callback every hour, or, more precisely, whenever the
958 system clock is divisible by 3600. The callback invocation times have
959 potentially a lot of jittering, but good long-term stability.
960
961 static void
962 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
963 {
964 ... its now a full hour (UTC, or TAI or whatever your clock follows)
965 }
966
967 struct ev_periodic hourly_tick;
968 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
969 ev_periodic_start (loop, &hourly_tick);
970
971 Example: the same as above, but use a reschedule callback to do it:
972
973 #include <math.h>
974
975 static ev_tstamp
976 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
977 {
978 return fmod (now, 3600.) + 3600.;
979 }
980
981 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
982
983 Example: call a callback every hour, starting now:
984
985 struct ev_periodic hourly_tick;
986 ev_periodic_init (&hourly_tick, clock_cb,
987 fmod (ev_now (loop), 3600.), 3600., 0);
988 ev_periodic_start (loop, &hourly_tick);
989
990
991 =head2 C<ev_signal> - signal me when a signal gets signalled
992
993 Signal watchers will trigger an event when the process receives a specific
994 signal one or more times. Even though signals are very asynchronous, libev
995 will try it's best to deliver signals synchronously, i.e. as part of the
996 normal event processing, like any other event.
997
998 You can configure as many watchers as you like per signal. Only when the
999 first watcher gets started will libev actually register a signal watcher
1000 with the kernel (thus it coexists with your own signal handlers as long
1001 as you don't register any with libev). Similarly, when the last signal
1002 watcher for a signal is stopped libev will reset the signal handler to
1003 SIG_DFL (regardless of what it was set to before).
1004
1005 =over 4
1006
1007 =item ev_signal_init (ev_signal *, callback, int signum)
1008
1009 =item ev_signal_set (ev_signal *, int signum)
1010
1011 Configures the watcher to trigger on the given signal number (usually one
1012 of the C<SIGxxx> constants).
1013
1014 =back
1015
1016
1017 =head2 C<ev_child> - wait for pid status changes
1018
1019 Child watchers trigger when your process receives a SIGCHLD in response to
1020 some child status changes (most typically when a child of yours dies).
1021
1022 =over 4
1023
1024 =item ev_child_init (ev_child *, callback, int pid)
1025
1026 =item ev_child_set (ev_child *, int pid)
1027
1028 Configures the watcher to wait for status changes of process C<pid> (or
1029 I<any> process if C<pid> is specified as C<0>). The callback can look
1030 at the C<rstatus> member of the C<ev_child> watcher structure to see
1031 the status word (use the macros from C<sys/wait.h> and see your systems
1032 C<waitpid> documentation). The C<rpid> member contains the pid of the
1033 process causing the status change.
1034
1035 =back
1036
1037 Example: try to exit cleanly on SIGINT and SIGTERM.
1038
1039 static void
1040 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1041 {
1042 ev_unloop (loop, EVUNLOOP_ALL);
1043 }
1044
1045 struct ev_signal signal_watcher;
1046 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1047 ev_signal_start (loop, &sigint_cb);
1048
1049
1050 =head2 C<ev_idle> - when you've got nothing better to do
1051
1052 Idle watchers trigger events when there are no other events are pending
1053 (prepare, check and other idle watchers do not count). That is, as long
1054 as your process is busy handling sockets or timeouts (or even signals,
1055 imagine) it will not be triggered. But when your process is idle all idle
1056 watchers are being called again and again, once per event loop iteration -
1057 until stopped, that is, or your process receives more events and becomes
1058 busy.
1059
1060 The most noteworthy effect is that as long as any idle watchers are
1061 active, the process will not block when waiting for new events.
1062
1063 Apart from keeping your process non-blocking (which is a useful
1064 effect on its own sometimes), idle watchers are a good place to do
1065 "pseudo-background processing", or delay processing stuff to after the
1066 event loop has handled all outstanding events.
1067
1068 =over 4
1069
1070 =item ev_idle_init (ev_signal *, callback)
1071
1072 Initialises and configures the idle watcher - it has no parameters of any
1073 kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1074 believe me.
1075
1076 =back
1077
1078 Example: dynamically allocate an C<ev_idle>, start it, and in the
1079 callback, free it. Alos, use no error checking, as usual.
1080
1081 static void
1082 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1083 {
1084 free (w);
1085 // now do something you wanted to do when the program has
1086 // no longer asnything immediate to do.
1087 }
1088
1089 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1090 ev_idle_init (idle_watcher, idle_cb);
1091 ev_idle_start (loop, idle_cb);
1092
1093
1094 =head2 C<ev_prepare> and C<ev_check> - customise your event loop
1095
1096 Prepare and check watchers are usually (but not always) used in tandem:
1097 prepare watchers get invoked before the process blocks and check watchers
1098 afterwards.
1099
1100 Their main purpose is to integrate other event mechanisms into libev and
1101 their use is somewhat advanced. This could be used, for example, to track
1102 variable changes, implement your own watchers, integrate net-snmp or a
1103 coroutine library and lots more.
1104
1105 This is done by examining in each prepare call which file descriptors need
1106 to be watched by the other library, registering C<ev_io> watchers for
1107 them and starting an C<ev_timer> watcher for any timeouts (many libraries
1108 provide just this functionality). Then, in the check watcher you check for
1109 any events that occured (by checking the pending status of all watchers
1110 and stopping them) and call back into the library. The I/O and timer
1111 callbacks will never actually be called (but must be valid nevertheless,
1112 because you never know, you know?).
1113
1114 As another example, the Perl Coro module uses these hooks to integrate
1115 coroutines into libev programs, by yielding to other active coroutines
1116 during each prepare and only letting the process block if no coroutines
1117 are ready to run (it's actually more complicated: it only runs coroutines
1118 with priority higher than or equal to the event loop and one coroutine
1119 of lower priority, but only once, using idle watchers to keep the event
1120 loop from blocking if lower-priority coroutines are active, thus mapping
1121 low-priority coroutines to idle/background tasks).
1122
1123 =over 4
1124
1125 =item ev_prepare_init (ev_prepare *, callback)
1126
1127 =item ev_check_init (ev_check *, callback)
1128
1129 Initialises and configures the prepare or check watcher - they have no
1130 parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1131 macros, but using them is utterly, utterly and completely pointless.
1132
1133 =back
1134
1135 Example: *TODO*.
1136
1137
1138 =head2 C<ev_embed> - when one backend isn't enough
1139
1140 This is a rather advanced watcher type that lets you embed one event loop
1141 into another (currently only C<ev_io> events are supported in the embedded
1142 loop, other types of watchers might be handled in a delayed or incorrect
1143 fashion and must not be used).
1144
1145 There are primarily two reasons you would want that: work around bugs and
1146 prioritise I/O.
1147
1148 As an example for a bug workaround, the kqueue backend might only support
1149 sockets on some platform, so it is unusable as generic backend, but you
1150 still want to make use of it because you have many sockets and it scales
1151 so nicely. In this case, you would create a kqueue-based loop and embed it
1152 into your default loop (which might use e.g. poll). Overall operation will
1153 be a bit slower because first libev has to poll and then call kevent, but
1154 at least you can use both at what they are best.
1155
1156 As for prioritising I/O: rarely you have the case where some fds have
1157 to be watched and handled very quickly (with low latency), and even
1158 priorities and idle watchers might have too much overhead. In this case
1159 you would put all the high priority stuff in one loop and all the rest in
1160 a second one, and embed the second one in the first.
1161
1162 As long as the watcher is active, the callback will be invoked every time
1163 there might be events pending in the embedded loop. The callback must then
1164 call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke
1165 their callbacks (you could also start an idle watcher to give the embedded
1166 loop strictly lower priority for example). You can also set the callback
1167 to C<0>, in which case the embed watcher will automatically execute the
1168 embedded loop sweep.
1169
1170 As long as the watcher is started it will automatically handle events. The
1171 callback will be invoked whenever some events have been handled. You can
1172 set the callback to C<0> to avoid having to specify one if you are not
1173 interested in that.
1174
1175 Also, there have not currently been made special provisions for forking:
1176 when you fork, you not only have to call C<ev_loop_fork> on both loops,
1177 but you will also have to stop and restart any C<ev_embed> watchers
1178 yourself.
1179
1180 Unfortunately, not all backends are embeddable, only the ones returned by
1181 C<ev_embeddable_backends> are, which, unfortunately, does not include any
1182 portable one.
1183
1184 So when you want to use this feature you will always have to be prepared
1185 that you cannot get an embeddable loop. The recommended way to get around
1186 this is to have a separate variables for your embeddable loop, try to
1187 create it, and if that fails, use the normal loop for everything:
1188
1189 struct ev_loop *loop_hi = ev_default_init (0);
1190 struct ev_loop *loop_lo = 0;
1191 struct ev_embed embed;
1192
1193 // see if there is a chance of getting one that works
1194 // (remember that a flags value of 0 means autodetection)
1195 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1196 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1197 : 0;
1198
1199 // if we got one, then embed it, otherwise default to loop_hi
1200 if (loop_lo)
1201 {
1202 ev_embed_init (&embed, 0, loop_lo);
1203 ev_embed_start (loop_hi, &embed);
1204 }
1205 else
1206 loop_lo = loop_hi;
1207
1208 =over 4
1209
1210 =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1211
1212 =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1213
1214 Configures the watcher to embed the given loop, which must be
1215 embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1216 invoked automatically, otherwise it is the responsibility of the callback
1217 to invoke it (it will continue to be called until the sweep has been done,
1218 if you do not want thta, you need to temporarily stop the embed watcher).
1219
1220 =item ev_embed_sweep (loop, ev_embed *)
1221
1222 Make a single, non-blocking sweep over the embedded loop. This works
1223 similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1224 apropriate way for embedded loops.
1225
1226 =back
1227
1228
1229 =head1 OTHER FUNCTIONS
1230
1231 There are some other functions of possible interest. Described. Here. Now.
1232
1233 =over 4
1234
1235 =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
1236
1237 This function combines a simple timer and an I/O watcher, calls your
1238 callback on whichever event happens first and automatically stop both
1239 watchers. This is useful if you want to wait for a single event on an fd
1240 or timeout without having to allocate/configure/start/stop/free one or
1241 more watchers yourself.
1242
1243 If C<fd> is less than 0, then no I/O watcher will be started and events
1244 is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
1245 C<events> set will be craeted and started.
1246
1247 If C<timeout> is less than 0, then no timeout watcher will be
1248 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
1249 repeat = 0) will be started. While C<0> is a valid timeout, it is of
1250 dubious value.
1251
1252 The callback has the type C<void (*cb)(int revents, void *arg)> and gets
1253 passed an C<revents> set like normal event callbacks (a combination of
1254 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
1255 value passed to C<ev_once>:
1256
1257 static void stdin_ready (int revents, void *arg)
1258 {
1259 if (revents & EV_TIMEOUT)
1260 /* doh, nothing entered */;
1261 else if (revents & EV_READ)
1262 /* stdin might have data for us, joy! */;
1263 }
1264
1265 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
1266
1267 =item ev_feed_event (ev_loop *, watcher *, int revents)
1268
1269 Feeds the given event set into the event loop, as if the specified event
1270 had happened for the specified watcher (which must be a pointer to an
1271 initialised but not necessarily started event watcher).
1272
1273 =item ev_feed_fd_event (ev_loop *, int fd, int revents)
1274
1275 Feed an event on the given fd, as if a file descriptor backend detected
1276 the given events it.
1277
1278 =item ev_feed_signal_event (ev_loop *loop, int signum)
1279
1280 Feed an event as if the given signal occured (C<loop> must be the default
1281 loop!).
1282
1283 =back
1284
1285
1286 =head1 LIBEVENT EMULATION
1287
1288 Libev offers a compatibility emulation layer for libevent. It cannot
1289 emulate the internals of libevent, so here are some usage hints:
1290
1291 =over 4
1292
1293 =item * Use it by including <event.h>, as usual.
1294
1295 =item * The following members are fully supported: ev_base, ev_callback,
1296 ev_arg, ev_fd, ev_res, ev_events.
1297
1298 =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
1299 maintained by libev, it does not work exactly the same way as in libevent (consider
1300 it a private API).
1301
1302 =item * Priorities are not currently supported. Initialising priorities
1303 will fail and all watchers will have the same priority, even though there
1304 is an ev_pri field.
1305
1306 =item * Other members are not supported.
1307
1308 =item * The libev emulation is I<not> ABI compatible to libevent, you need
1309 to use the libev header file and library.
1310
1311 =back
1312
1313 =head1 C++ SUPPORT
1314
1315 TBD.
1316
1317 =head1 AUTHOR
1318
1319 Marc Lehmann <libev@schmorp.de>.
1320