ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
Revision: 1.117
Committed: Wed Jan 9 04:15:39 2008 UTC (16 years, 4 months ago) by root
Branch: MAIN
Changes since 1.116: +6 -3 lines
Log Message:
*** empty log message ***

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 root 1.105 =head2 EXAMPLE PROGRAM
10 root 1.54
11     #include <ev.h>
12    
13 root 1.53 ev_io stdin_watcher;
14     ev_timer timeout_watcher;
15    
16     /* called when data readable on stdin */
17     static void
18     stdin_cb (EV_P_ struct ev_io *w, int revents)
19     {
20     /* puts ("stdin ready"); */
21     ev_io_stop (EV_A_ w); /* just a syntax example */
22     ev_unloop (EV_A_ EVUNLOOP_ALL); /* leave all loop calls */
23     }
24    
25     static void
26     timeout_cb (EV_P_ struct ev_timer *w, int revents)
27     {
28     /* puts ("timeout"); */
29     ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */
30     }
31    
32     int
33     main (void)
34     {
35     struct ev_loop *loop = ev_default_loop (0);
36    
37     /* initialise an io watcher, then start it */
38     ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
39     ev_io_start (loop, &stdin_watcher);
40    
41     /* simple non-repeating 5.5 second timeout */
42     ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
43     ev_timer_start (loop, &timeout_watcher);
44    
45     /* loop till timeout or data ready */
46     ev_loop (loop, 0);
47    
48     return 0;
49     }
50    
51 root 1.1 =head1 DESCRIPTION
52    
53 root 1.69 The newest version of this document is also available as a html-formatted
54     web page you might find easier to navigate when reading it for the first
55     time: L<http://cvs.schmorp.de/libev/ev.html>.
56    
57 root 1.1 Libev is an event loop: you register interest in certain events (such as a
58 root 1.92 file descriptor being readable or a timeout occurring), and it will manage
59 root 1.4 these event sources and provide your program with events.
60 root 1.1
61     To do this, it must take more or less complete control over your process
62     (or thread) by executing the I<event loop> handler, and will then
63     communicate events via a callback mechanism.
64    
65     You register interest in certain events by registering so-called I<event
66     watchers>, which are relatively small C structures you initialise with the
67     details of the event, and then hand it over to libev by I<starting> the
68     watcher.
69    
70 root 1.105 =head2 FEATURES
71 root 1.1
72 root 1.58 Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
73     BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
74     for file descriptor events (C<ev_io>), the Linux C<inotify> interface
75     (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
76     with customised rescheduling (C<ev_periodic>), synchronous signals
77     (C<ev_signal>), process status change events (C<ev_child>), and event
78     watchers dealing with the event loop mechanism itself (C<ev_idle>,
79 root 1.54 C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as
80     file watchers (C<ev_stat>) and even limited support for fork events
81     (C<ev_fork>).
82    
83     It also is quite fast (see this
84     L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
85     for example).
86 root 1.1
87 root 1.105 =head2 CONVENTIONS
88 root 1.1
89 root 1.54 Libev is very configurable. In this manual the default configuration will
90     be described, which supports multiple event loops. For more info about
91     various configuration options please have a look at B<EMBED> section in
92     this manual. If libev was configured without support for multiple event
93     loops, then all functions taking an initial argument of name C<loop>
94     (which is always of type C<struct ev_loop *>) will not have this argument.
95 root 1.1
96 root 1.105 =head2 TIME REPRESENTATION
97 root 1.1
98 root 1.2 Libev represents time as a single floating point number, representing the
99     (fractional) number of seconds since the (POSIX) epoch (somewhere near
100     the beginning of 1970, details are complicated, don't ask). This type is
101 root 1.1 called C<ev_tstamp>, which is what you should use too. It usually aliases
102 root 1.34 to the C<double> type in C, and when you need to do any calculations on
103 root 1.86 it, you should treat it as some floatingpoint value. Unlike the name
104     component C<stamp> might indicate, it is also used for time differences
105     throughout libev.
106 root 1.34
107 root 1.17 =head1 GLOBAL FUNCTIONS
108    
109 root 1.18 These functions can be called anytime, even before initialising the
110     library in any way.
111    
112 root 1.1 =over 4
113    
114     =item ev_tstamp ev_time ()
115    
116 root 1.26 Returns the current time as libev would use it. Please note that the
117     C<ev_now> function is usually faster and also often returns the timestamp
118     you actually want to know.
119 root 1.1
120 root 1.97 =item ev_sleep (ev_tstamp interval)
121    
122     Sleep for the given interval: The current thread will be blocked until
123     either it is interrupted or the given time interval has passed. Basically
124     this is a subsecond-resolution C<sleep ()>.
125    
126 root 1.1 =item int ev_version_major ()
127    
128     =item int ev_version_minor ()
129    
130 root 1.80 You can find out the major and minor ABI version numbers of the library
131 root 1.1 you linked against by calling the functions C<ev_version_major> and
132     C<ev_version_minor>. If you want, you can compare against the global
133     symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
134     version of the library your program was compiled against.
135    
136 root 1.80 These version numbers refer to the ABI version of the library, not the
137     release version.
138 root 1.79
139 root 1.9 Usually, it's a good idea to terminate if the major versions mismatch,
140 root 1.79 as this indicates an incompatible change. Minor versions are usually
141 root 1.1 compatible to older versions, so a larger minor version alone is usually
142     not a problem.
143    
144 root 1.54 Example: Make sure we haven't accidentally been linked against the wrong
145     version.
146 root 1.34
147     assert (("libev version mismatch",
148     ev_version_major () == EV_VERSION_MAJOR
149     && ev_version_minor () >= EV_VERSION_MINOR));
150    
151 root 1.31 =item unsigned int ev_supported_backends ()
152    
153     Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
154     value) compiled into this binary of libev (independent of their
155     availability on the system you are running on). See C<ev_default_loop> for
156     a description of the set values.
157    
158 root 1.34 Example: make sure we have the epoll method, because yeah this is cool and
159     a must have and can we have a torrent of it please!!!11
160    
161     assert (("sorry, no epoll, no sex",
162     ev_supported_backends () & EVBACKEND_EPOLL));
163    
164 root 1.31 =item unsigned int ev_recommended_backends ()
165    
166     Return the set of all backends compiled into this binary of libev and also
167     recommended for this platform. This set is often smaller than the one
168     returned by C<ev_supported_backends>, as for example kqueue is broken on
169     most BSDs and will not be autodetected unless you explicitly request it
170     (assuming you know what you are doing). This is the set of backends that
171 root 1.33 libev will probe for if you specify no backends explicitly.
172 root 1.31
173 root 1.35 =item unsigned int ev_embeddable_backends ()
174    
175     Returns the set of backends that are embeddable in other event loops. This
176     is the theoretical, all-platform, value. To find which backends
177     might be supported on the current system, you would need to look at
178     C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
179     recommended ones.
180    
181     See the description of C<ev_embed> watchers for more info.
182    
183 root 1.59 =item ev_set_allocator (void *(*cb)(void *ptr, long size))
184 root 1.1
185 root 1.59 Sets the allocation function to use (the prototype is similar - the
186     semantics is identical - to the realloc C function). It is used to
187     allocate and free memory (no surprises here). If it returns zero when
188     memory needs to be allocated, the library might abort or take some
189     potentially destructive action. The default is your system realloc
190     function.
191 root 1.1
192     You could override this function in high-availability programs to, say,
193     free some memory if it cannot allocate memory, to use a special allocator,
194     or even to sleep a while and retry until some memory is available.
195    
196 root 1.54 Example: Replace the libev allocator with one that waits a bit and then
197     retries).
198 root 1.34
199     static void *
200 root 1.52 persistent_realloc (void *ptr, size_t size)
201 root 1.34 {
202     for (;;)
203     {
204     void *newptr = realloc (ptr, size);
205    
206     if (newptr)
207     return newptr;
208    
209     sleep (60);
210     }
211     }
212    
213     ...
214     ev_set_allocator (persistent_realloc);
215    
216 root 1.1 =item ev_set_syserr_cb (void (*cb)(const char *msg));
217    
218     Set the callback function to call on a retryable syscall error (such
219     as failed select, poll, epoll_wait). The message is a printable string
220     indicating the system call or subsystem causing the problem. If this
221     callback is set, then libev will expect it to remedy the sitution, no
222 root 1.7 matter what, when it returns. That is, libev will generally retry the
223 root 1.1 requested operation, or, if the condition doesn't go away, do bad stuff
224     (such as abort).
225    
226 root 1.54 Example: This is basically the same thing that libev does internally, too.
227 root 1.34
228     static void
229     fatal_error (const char *msg)
230     {
231     perror (msg);
232     abort ();
233     }
234    
235     ...
236     ev_set_syserr_cb (fatal_error);
237    
238 root 1.1 =back
239    
240     =head1 FUNCTIONS CONTROLLING THE EVENT LOOP
241    
242     An event loop is described by a C<struct ev_loop *>. The library knows two
243     types of such loops, the I<default> loop, which supports signals and child
244     events, and dynamically created loops which do not.
245    
246     If you use threads, a common model is to run the default event loop
247 root 1.17 in your main thread (or in a separate thread) and for each thread you
248 root 1.7 create, you also create another event loop. Libev itself does no locking
249     whatsoever, so if you mix calls to the same event loop in different
250     threads, make sure you lock (this is usually a bad idea, though, even if
251 root 1.9 done correctly, because it's hideous and inefficient).
252 root 1.1
253     =over 4
254    
255     =item struct ev_loop *ev_default_loop (unsigned int flags)
256    
257     This will initialise the default event loop if it hasn't been initialised
258     yet and return it. If the default loop could not be initialised, returns
259     false. If it already was initialised it simply returns it (and ignores the
260 root 1.31 flags. If that is troubling you, check C<ev_backend ()> afterwards).
261 root 1.1
262     If you don't know what event loop to use, use the one returned from this
263     function.
264    
265     The flags argument can be used to specify special behaviour or specific
266 root 1.33 backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
267 root 1.1
268 root 1.33 The following flags are supported:
269 root 1.1
270     =over 4
271    
272 root 1.10 =item C<EVFLAG_AUTO>
273 root 1.1
274 root 1.9 The default flags value. Use this if you have no clue (it's the right
275 root 1.1 thing, believe me).
276    
277 root 1.10 =item C<EVFLAG_NOENV>
278 root 1.1
279 root 1.8 If this flag bit is ored into the flag value (or the program runs setuid
280     or setgid) then libev will I<not> look at the environment variable
281     C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
282     override the flags completely if it is found in the environment. This is
283     useful to try out specific backends to test their performance, or to work
284     around bugs.
285 root 1.1
286 root 1.62 =item C<EVFLAG_FORKCHECK>
287    
288     Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after
289     a fork, you can also make libev check for a fork in each iteration by
290     enabling this flag.
291    
292     This works by calling C<getpid ()> on every iteration of the loop,
293     and thus this might slow down your event loop if you do a lot of loop
294 ayin 1.65 iterations and little real work, but is usually not noticeable (on my
295 root 1.62 Linux system for example, C<getpid> is actually a simple 5-insn sequence
296     without a syscall and thus I<very> fast, but my Linux system also has
297     C<pthread_atfork> which is even faster).
298    
299     The big advantage of this flag is that you can forget about fork (and
300     forget about forgetting to tell libev about forking) when you use this
301     flag.
302    
303     This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS>
304     environment variable.
305    
306 root 1.31 =item C<EVBACKEND_SELECT> (value 1, portable select backend)
307 root 1.1
308 root 1.29 This is your standard select(2) backend. Not I<completely> standard, as
309     libev tries to roll its own fd_set with no limits on the number of fds,
310     but if that fails, expect a fairly low limit on the number of fds when
311 root 1.102 using this backend. It doesn't scale too well (O(highest_fd)), but its
312     usually the fastest backend for a low number of (low-numbered :) fds.
313    
314     To get good performance out of this backend you need a high amount of
315     parallelity (most of the file descriptors should be busy). If you are
316     writing a server, you should C<accept ()> in a loop to accept as many
317     connections as possible during one iteration. You might also want to have
318     a look at C<ev_set_io_collect_interval ()> to increase the amount of
319     readyness notifications you get per iteration.
320 root 1.1
321 root 1.31 =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
322 root 1.1
323 root 1.102 And this is your standard poll(2) backend. It's more complicated
324     than select, but handles sparse fds better and has no artificial
325     limit on the number of fds you can use (except it will slow down
326     considerably with a lot of inactive fds). It scales similarly to select,
327     i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
328     performance tips.
329 root 1.1
330 root 1.31 =item C<EVBACKEND_EPOLL> (value 4, Linux)
331 root 1.1
332 root 1.29 For few fds, this backend is a bit little slower than poll and select,
333 root 1.94 but it scales phenomenally better. While poll and select usually scale
334     like O(total_fds) where n is the total number of fds (or the highest fd),
335     epoll scales either O(1) or O(active_fds). The epoll design has a number
336     of shortcomings, such as silently dropping events in some hard-to-detect
337 ayin 1.96 cases and rewiring a syscall per fd change, no fork support and bad
338 root 1.102 support for dup.
339 root 1.1
340 root 1.94 While stopping, setting and starting an I/O watcher in the same iteration
341     will result in some caching, there is still a syscall per such incident
342 root 1.29 (because the fd could point to a different file description now), so its
343 root 1.94 best to avoid that. Also, C<dup ()>'ed file descriptors might not work
344     very well if you register events for both fds.
345 root 1.29
346 root 1.32 Please note that epoll sometimes generates spurious notifications, so you
347     need to use non-blocking I/O or other means to avoid blocking when no data
348     (or space) is available.
349    
350 root 1.102 Best performance from this backend is achieved by not unregistering all
351     watchers for a file descriptor until it has been closed, if possible, i.e.
352     keep at least one watcher active per fd at all times.
353    
354     While nominally embeddeble in other event loops, this feature is broken in
355     all kernel versions tested so far.
356    
357 root 1.31 =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
358 root 1.29
359     Kqueue deserves special mention, as at the time of this writing, it
360 root 1.100 was broken on all BSDs except NetBSD (usually it doesn't work reliably
361     with anything but sockets and pipes, except on Darwin, where of course
362     it's completely useless). For this reason it's not being "autodetected"
363 root 1.33 unless you explicitly specify it explicitly in the flags (i.e. using
364 root 1.94 C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
365     system like NetBSD.
366 root 1.29
367 root 1.100 You still can embed kqueue into a normal poll or select backend and use it
368     only for sockets (after having made sure that sockets work with kqueue on
369     the target platform). See C<ev_embed> watchers for more info.
370    
371 root 1.29 It scales in the same way as the epoll backend, but the interface to the
372 root 1.100 kernel is more efficient (which says nothing about its actual speed, of
373     course). While stopping, setting and starting an I/O watcher does never
374     cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
375     two event changes per incident, support for C<fork ()> is very bad and it
376     drops fds silently in similarly hard-to-detect cases.
377 root 1.29
378 root 1.102 This backend usually performs well under most conditions.
379    
380     While nominally embeddable in other event loops, this doesn't work
381     everywhere, so you might need to test for this. And since it is broken
382     almost everywhere, you should only use it when you have a lot of sockets
383     (for which it usually works), by embedding it into another event loop
384     (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
385     sockets.
386    
387 root 1.31 =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
388 root 1.29
389 root 1.102 This is not implemented yet (and might never be, unless you send me an
390     implementation). According to reports, C</dev/poll> only supports sockets
391     and is not embeddable, which would limit the usefulness of this backend
392     immensely.
393 root 1.29
394 root 1.31 =item C<EVBACKEND_PORT> (value 32, Solaris 10)
395 root 1.29
396 root 1.94 This uses the Solaris 10 event port mechanism. As with everything on Solaris,
397 root 1.29 it's really slow, but it still scales very well (O(active_fds)).
398    
399 root 1.94 Please note that solaris event ports can deliver a lot of spurious
400 root 1.32 notifications, so you need to use non-blocking I/O or other means to avoid
401     blocking when no data (or space) is available.
402    
403 root 1.102 While this backend scales well, it requires one system call per active
404     file descriptor per loop iteration. For small and medium numbers of file
405     descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
406     might perform better.
407    
408 root 1.117 On the positive side, ignoring the spurious readyness notifications, this
409     backend actually performed to specification in all tests and is fully
410     embeddable, which is a rare feat among the OS-specific backends.
411    
412 root 1.31 =item C<EVBACKEND_ALL>
413 root 1.29
414     Try all backends (even potentially broken ones that wouldn't be tried
415     with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
416 root 1.31 C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
417 root 1.1
418 root 1.102 It is definitely not recommended to use this flag.
419    
420 root 1.1 =back
421    
422 root 1.29 If one or more of these are ored into the flags value, then only these
423 root 1.117 backends will be tried (in the reverse order as listed here). If none are
424     specified, all backends in C<ev_recommended_backends ()> will be tried.
425 root 1.29
426 root 1.33 The most typical usage is like this:
427    
428     if (!ev_default_loop (0))
429     fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
430    
431     Restrict libev to the select and poll backends, and do not allow
432     environment settings to be taken into account:
433    
434     ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
435    
436     Use whatever libev has to offer, but make sure that kqueue is used if
437     available (warning, breaks stuff, best use only with your own private
438     event loop and only if you know the OS supports your types of fds):
439    
440     ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
441    
442 root 1.1 =item struct ev_loop *ev_loop_new (unsigned int flags)
443    
444     Similar to C<ev_default_loop>, but always creates a new event loop that is
445     always distinct from the default loop. Unlike the default loop, it cannot
446     handle signal and child watchers, and attempts to do so will be greeted by
447     undefined behaviour (or a failed assertion if assertions are enabled).
448    
449 root 1.54 Example: Try to create a event loop that uses epoll and nothing else.
450 root 1.34
451     struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
452     if (!epoller)
453     fatal ("no epoll found here, maybe it hides under your chair");
454    
455 root 1.1 =item ev_default_destroy ()
456    
457     Destroys the default loop again (frees all memory and kernel state
458 root 1.37 etc.). None of the active event watchers will be stopped in the normal
459     sense, so e.g. C<ev_is_active> might still return true. It is your
460     responsibility to either stop all watchers cleanly yoursef I<before>
461     calling this function, or cope with the fact afterwards (which is usually
462 root 1.87 the easiest thing, you can just ignore the watchers and/or C<free ()> them
463 root 1.37 for example).
464 root 1.1
465 ayin 1.88 Note that certain global state, such as signal state, will not be freed by
466 root 1.87 this function, and related watchers (such as signal and child watchers)
467     would need to be stopped manually.
468    
469     In general it is not advisable to call this function except in the
470     rare occasion where you really need to free e.g. the signal handling
471     pipe fds. If you need dynamically allocated loops it is better to use
472     C<ev_loop_new> and C<ev_loop_destroy>).
473    
474 root 1.1 =item ev_loop_destroy (loop)
475    
476     Like C<ev_default_destroy>, but destroys an event loop created by an
477     earlier call to C<ev_loop_new>.
478    
479     =item ev_default_fork ()
480    
481     This function reinitialises the kernel state for backends that have
482     one. Despite the name, you can call it anytime, but it makes most sense
483     after forking, in either the parent or child process (or both, but that
484     again makes little sense).
485    
486 root 1.30 You I<must> call this function in the child process after forking if and
487     only if you want to use the event library in both processes. If you just
488     fork+exec, you don't have to call it.
489 root 1.1
490 root 1.9 The function itself is quite fast and it's usually not a problem to call
491 root 1.1 it just in case after a fork. To make this easy, the function will fit in
492     quite nicely into a call to C<pthread_atfork>:
493    
494     pthread_atfork (0, 0, ev_default_fork);
495    
496 root 1.31 At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
497     without calling this function, so if you force one of those backends you
498     do not need to care.
499    
500 root 1.1 =item ev_loop_fork (loop)
501    
502     Like C<ev_default_fork>, but acts on an event loop created by
503     C<ev_loop_new>. Yes, you have to call this on every allocated event loop
504     after fork, and how you do this is entirely your own problem.
505    
506 root 1.66 =item unsigned int ev_loop_count (loop)
507    
508     Returns the count of loop iterations for the loop, which is identical to
509     the number of times libev did poll for new events. It starts at C<0> and
510     happily wraps around with enough iterations.
511    
512     This value can sometimes be useful as a generation counter of sorts (it
513     "ticks" the number of loop iterations), as it roughly corresponds with
514     C<ev_prepare> and C<ev_check> calls.
515    
516 root 1.31 =item unsigned int ev_backend (loop)
517 root 1.1
518 root 1.31 Returns one of the C<EVBACKEND_*> flags indicating the event backend in
519 root 1.1 use.
520    
521 root 1.9 =item ev_tstamp ev_now (loop)
522 root 1.1
523     Returns the current "event loop time", which is the time the event loop
524 root 1.34 received events and started processing them. This timestamp does not
525     change as long as callbacks are being processed, and this is also the base
526     time used for relative timers. You can treat it as the timestamp of the
527 root 1.92 event occurring (or more correctly, libev finding out about it).
528 root 1.1
529     =item ev_loop (loop, int flags)
530    
531     Finally, this is it, the event handler. This function usually is called
532     after you initialised all your watchers and you want to start handling
533     events.
534    
535 root 1.33 If the flags argument is specified as C<0>, it will not return until
536     either no event watchers are active anymore or C<ev_unloop> was called.
537 root 1.1
538 root 1.34 Please note that an explicit C<ev_unloop> is usually better than
539     relying on all watchers to be stopped when deciding when a program has
540     finished (especially in interactive programs), but having a program that
541     automatically loops as long as it has to and no longer by virtue of
542     relying on its watchers stopping correctly is a thing of beauty.
543    
544 root 1.1 A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
545     those events and any outstanding ones, but will not block your process in
546 root 1.9 case there are no events and will return after one iteration of the loop.
547 root 1.1
548     A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
549     neccessary) and will handle those and any outstanding ones. It will block
550 root 1.9 your process until at least one new event arrives, and will return after
551 root 1.33 one iteration of the loop. This is useful if you are waiting for some
552     external event in conjunction with something not expressible using other
553     libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
554     usually a better approach for this kind of thing.
555    
556     Here are the gory details of what C<ev_loop> does:
557    
558 root 1.77 - Before the first iteration, call any pending watchers.
559 root 1.113 * If EVFLAG_FORKCHECK was used, check for a fork.
560     - If a fork was detected, queue and call all fork watchers.
561     - Queue and call all prepare watchers.
562 root 1.33 - If we have been forked, recreate the kernel state.
563     - Update the kernel state with all outstanding changes.
564     - Update the "event loop time".
565 root 1.113 - Calculate for how long to sleep or block, if at all
566     (active idle watchers, EVLOOP_NONBLOCK or not having
567     any active watchers at all will result in not sleeping).
568     - Sleep if the I/O and timer collect interval say so.
569 root 1.33 - Block the process, waiting for any events.
570     - Queue all outstanding I/O (fd) events.
571     - Update the "event loop time" and do time jump handling.
572     - Queue all outstanding timers.
573     - Queue all outstanding periodics.
574     - If no events are pending now, queue all idle watchers.
575     - Queue all check watchers.
576     - Call all queued watchers in reverse order (i.e. check watchers first).
577     Signals and child watchers are implemented as I/O watchers, and will
578     be handled here by queueing them when their watcher gets executed.
579 root 1.113 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
580     were used, or there are no active watchers, return, otherwise
581     continue with step *.
582 root 1.27
583 root 1.114 Example: Queue some jobs and then loop until no events are outstanding
584 root 1.34 anymore.
585    
586     ... queue jobs here, make sure they register event watchers as long
587     ... as they still have work to do (even an idle watcher will do..)
588     ev_loop (my_loop, 0);
589     ... jobs done. yeah!
590    
591 root 1.1 =item ev_unloop (loop, how)
592    
593 root 1.9 Can be used to make a call to C<ev_loop> return early (but only after it
594     has processed all outstanding events). The C<how> argument must be either
595 root 1.25 C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
596 root 1.9 C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
597 root 1.1
598 root 1.115 This "unloop state" will be cleared when entering C<ev_loop> again.
599    
600 root 1.1 =item ev_ref (loop)
601    
602     =item ev_unref (loop)
603    
604 root 1.9 Ref/unref can be used to add or remove a reference count on the event
605     loop: Every watcher keeps one reference, and as long as the reference
606     count is nonzero, C<ev_loop> will not return on its own. If you have
607     a watcher you never unregister that should not keep C<ev_loop> from
608     returning, ev_unref() after starting, and ev_ref() before stopping it. For
609     example, libev itself uses this for its internal signal pipe: It is not
610     visible to the libev user and should not keep C<ev_loop> from exiting if
611     no event watchers registered by it are active. It is also an excellent
612     way to do this for generic recurring timers or from within third-party
613 root 1.116 libraries. Just remember to I<unref after start> and I<ref before stop>
614     (but only if the watcher wasn't active before, or was active before,
615     respectively).
616 root 1.1
617 root 1.54 Example: Create a signal watcher, but keep it from keeping C<ev_loop>
618 root 1.34 running when nothing else is active.
619    
620 root 1.54 struct ev_signal exitsig;
621 root 1.34 ev_signal_init (&exitsig, sig_cb, SIGINT);
622 root 1.54 ev_signal_start (loop, &exitsig);
623     evf_unref (loop);
624 root 1.34
625 root 1.54 Example: For some weird reason, unregister the above signal handler again.
626 root 1.34
627 root 1.54 ev_ref (loop);
628     ev_signal_stop (loop, &exitsig);
629 root 1.34
630 root 1.97 =item ev_set_io_collect_interval (loop, ev_tstamp interval)
631    
632     =item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
633    
634     These advanced functions influence the time that libev will spend waiting
635     for events. Both are by default C<0>, meaning that libev will try to
636     invoke timer/periodic callbacks and I/O callbacks with minimum latency.
637    
638     Setting these to a higher value (the C<interval> I<must> be >= C<0>)
639     allows libev to delay invocation of I/O and timer/periodic callbacks to
640     increase efficiency of loop iterations.
641    
642     The background is that sometimes your program runs just fast enough to
643     handle one (or very few) event(s) per loop iteration. While this makes
644     the program responsive, it also wastes a lot of CPU time to poll for new
645     events, especially with backends like C<select ()> which have a high
646     overhead for the actual polling but can deliver many events at once.
647    
648     By setting a higher I<io collect interval> you allow libev to spend more
649     time collecting I/O events, so you can handle more events per iteration,
650     at the cost of increasing latency. Timeouts (both C<ev_periodic> and
651 ayin 1.101 C<ev_timer>) will be not affected. Setting this to a non-null value will
652 root 1.99 introduce an additional C<ev_sleep ()> call into most loop iterations.
653 root 1.97
654     Likewise, by setting a higher I<timeout collect interval> you allow libev
655     to spend more time collecting timeouts, at the expense of increased
656     latency (the watcher callback will be called later). C<ev_io> watchers
657 root 1.99 will not be affected. Setting this to a non-null value will not introduce
658     any overhead in libev.
659 root 1.97
660 root 1.98 Many (busy) programs can usually benefit by setting the io collect
661     interval to a value near C<0.1> or so, which is often enough for
662     interactive servers (of course not for games), likewise for timeouts. It
663     usually doesn't make much sense to set it to a lower value than C<0.01>,
664     as this approsaches the timing granularity of most systems.
665 root 1.97
666 root 1.1 =back
667    
668 root 1.42
669 root 1.1 =head1 ANATOMY OF A WATCHER
670    
671     A watcher is a structure that you create and register to record your
672     interest in some event. For instance, if you want to wait for STDIN to
673 root 1.10 become readable, you would create an C<ev_io> watcher for that:
674 root 1.1
675     static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
676     {
677     ev_io_stop (w);
678     ev_unloop (loop, EVUNLOOP_ALL);
679     }
680    
681     struct ev_loop *loop = ev_default_loop (0);
682     struct ev_io stdin_watcher;
683     ev_init (&stdin_watcher, my_cb);
684     ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
685     ev_io_start (loop, &stdin_watcher);
686     ev_loop (loop, 0);
687    
688     As you can see, you are responsible for allocating the memory for your
689     watcher structures (and it is usually a bad idea to do this on the stack,
690     although this can sometimes be quite valid).
691    
692     Each watcher structure must be initialised by a call to C<ev_init
693     (watcher *, callback)>, which expects a callback to be provided. This
694     callback gets invoked each time the event occurs (or, in the case of io
695     watchers, each time the event loop detects that the file descriptor given
696     is readable and/or writable).
697    
698     Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
699     with arguments specific to this watcher type. There is also a macro
700     to combine initialisation and setting in one call: C<< ev_<type>_init
701     (watcher *, callback, ...) >>.
702    
703     To make the watcher actually watch out for events, you have to start it
704     with a watcher-specific start function (C<< ev_<type>_start (loop, watcher
705     *) >>), and you can stop watching for events at any time by calling the
706     corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>.
707    
708     As long as your watcher is active (has been started but not stopped) you
709     must not touch the values stored in it. Most specifically you must never
710 root 1.36 reinitialise it or call its C<set> macro.
711 root 1.1
712     Each and every callback receives the event loop pointer as first, the
713     registered watcher structure as second, and a bitset of received events as
714     third argument.
715    
716 root 1.14 The received events usually include a single bit per event type received
717 root 1.1 (you can receive multiple events at the same time). The possible bit masks
718     are:
719    
720     =over 4
721    
722 root 1.10 =item C<EV_READ>
723 root 1.1
724 root 1.10 =item C<EV_WRITE>
725 root 1.1
726 root 1.10 The file descriptor in the C<ev_io> watcher has become readable and/or
727 root 1.1 writable.
728    
729 root 1.10 =item C<EV_TIMEOUT>
730 root 1.1
731 root 1.10 The C<ev_timer> watcher has timed out.
732 root 1.1
733 root 1.10 =item C<EV_PERIODIC>
734 root 1.1
735 root 1.10 The C<ev_periodic> watcher has timed out.
736 root 1.1
737 root 1.10 =item C<EV_SIGNAL>
738 root 1.1
739 root 1.10 The signal specified in the C<ev_signal> watcher has been received by a thread.
740 root 1.1
741 root 1.10 =item C<EV_CHILD>
742 root 1.1
743 root 1.10 The pid specified in the C<ev_child> watcher has received a status change.
744 root 1.1
745 root 1.48 =item C<EV_STAT>
746    
747     The path specified in the C<ev_stat> watcher changed its attributes somehow.
748    
749 root 1.10 =item C<EV_IDLE>
750 root 1.1
751 root 1.10 The C<ev_idle> watcher has determined that you have nothing better to do.
752 root 1.1
753 root 1.10 =item C<EV_PREPARE>
754 root 1.1
755 root 1.10 =item C<EV_CHECK>
756 root 1.1
757 root 1.10 All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts
758     to gather new events, and all C<ev_check> watchers are invoked just after
759 root 1.1 C<ev_loop> has gathered them, but before it invokes any callbacks for any
760     received events. Callbacks of both watcher types can start and stop as
761     many watchers as they want, and all of them will be taken into account
762 root 1.10 (for example, a C<ev_prepare> watcher might start an idle watcher to keep
763 root 1.1 C<ev_loop> from blocking).
764    
765 root 1.50 =item C<EV_EMBED>
766    
767     The embedded event loop specified in the C<ev_embed> watcher needs attention.
768    
769     =item C<EV_FORK>
770    
771     The event loop has been resumed in the child process after fork (see
772     C<ev_fork>).
773    
774 root 1.10 =item C<EV_ERROR>
775 root 1.1
776     An unspecified error has occured, the watcher has been stopped. This might
777     happen because the watcher could not be properly started because libev
778     ran out of memory, a file descriptor was found to be closed or any other
779     problem. You best act on it by reporting the problem and somehow coping
780     with the watcher being stopped.
781    
782     Libev will usually signal a few "dummy" events together with an error,
783     for example it might indicate that a fd is readable or writable, and if
784     your callbacks is well-written it can just attempt the operation and cope
785     with the error from read() or write(). This will not work in multithreaded
786     programs, though, so beware.
787    
788     =back
789    
790 root 1.42 =head2 GENERIC WATCHER FUNCTIONS
791 root 1.36
792     In the following description, C<TYPE> stands for the watcher type,
793     e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
794    
795     =over 4
796    
797     =item C<ev_init> (ev_TYPE *watcher, callback)
798    
799     This macro initialises the generic portion of a watcher. The contents
800     of the watcher object can be arbitrary (so C<malloc> will do). Only
801     the generic parts of the watcher are initialised, you I<need> to call
802     the type-specific C<ev_TYPE_set> macro afterwards to initialise the
803     type-specific parts. For each type there is also a C<ev_TYPE_init> macro
804     which rolls both calls into one.
805    
806     You can reinitialise a watcher at any time as long as it has been stopped
807     (or never started) and there are no pending events outstanding.
808    
809 root 1.42 The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,
810 root 1.36 int revents)>.
811    
812     =item C<ev_TYPE_set> (ev_TYPE *, [args])
813    
814     This macro initialises the type-specific parts of a watcher. You need to
815     call C<ev_init> at least once before you call this macro, but you can
816     call C<ev_TYPE_set> any number of times. You must not, however, call this
817     macro on a watcher that is active (it can be pending, however, which is a
818     difference to the C<ev_init> macro).
819    
820     Although some watcher types do not have type-specific arguments
821     (e.g. C<ev_prepare>) you still need to call its C<set> macro.
822    
823     =item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
824    
825     This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
826     calls into a single call. This is the most convinient method to initialise
827     a watcher. The same limitations apply, of course.
828    
829     =item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
830    
831     Starts (activates) the given watcher. Only active watchers will receive
832     events. If the watcher is already active nothing will happen.
833    
834     =item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
835    
836     Stops the given watcher again (if active) and clears the pending
837     status. It is possible that stopped watchers are pending (for example,
838     non-repeating timers are being stopped when they become pending), but
839     C<ev_TYPE_stop> ensures that the watcher is neither active nor pending. If
840     you want to free or reuse the memory used by the watcher it is therefore a
841     good idea to always call its C<ev_TYPE_stop> function.
842    
843     =item bool ev_is_active (ev_TYPE *watcher)
844    
845     Returns a true value iff the watcher is active (i.e. it has been started
846     and not yet been stopped). As long as a watcher is active you must not modify
847     it.
848    
849     =item bool ev_is_pending (ev_TYPE *watcher)
850    
851     Returns a true value iff the watcher is pending, (i.e. it has outstanding
852     events but its callback has not yet been invoked). As long as a watcher
853     is pending (but not active) you must not call an init function on it (but
854 root 1.73 C<ev_TYPE_set> is safe), you must not change its priority, and you must
855     make sure the watcher is available to libev (e.g. you cannot C<free ()>
856     it).
857 root 1.36
858 root 1.55 =item callback ev_cb (ev_TYPE *watcher)
859 root 1.36
860     Returns the callback currently set on the watcher.
861    
862     =item ev_cb_set (ev_TYPE *watcher, callback)
863    
864     Change the callback. You can change the callback at virtually any time
865     (modulo threads).
866    
867 root 1.67 =item ev_set_priority (ev_TYPE *watcher, priority)
868    
869     =item int ev_priority (ev_TYPE *watcher)
870    
871     Set and query the priority of the watcher. The priority is a small
872     integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
873     (default: C<-2>). Pending watchers with higher priority will be invoked
874     before watchers with lower priority, but priority will not keep watchers
875     from being executed (except for C<ev_idle> watchers).
876    
877     This means that priorities are I<only> used for ordering callback
878     invocation after new events have been received. This is useful, for
879     example, to reduce latency after idling, or more often, to bind two
880     watchers on the same event and make sure one is called first.
881    
882     If you need to suppress invocation when higher priority events are pending
883     you need to look at C<ev_idle> watchers, which provide this functionality.
884    
885 root 1.73 You I<must not> change the priority of a watcher as long as it is active or
886     pending.
887    
888 root 1.67 The default priority used by watchers when no priority has been set is
889     always C<0>, which is supposed to not be too high and not be too low :).
890    
891     Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
892     fine, as long as you do not mind that the priority value you query might
893     or might not have been adjusted to be within valid range.
894    
895 root 1.74 =item ev_invoke (loop, ev_TYPE *watcher, int revents)
896    
897     Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
898     C<loop> nor C<revents> need to be valid as long as the watcher callback
899     can deal with that fact.
900    
901     =item int ev_clear_pending (loop, ev_TYPE *watcher)
902    
903     If the watcher is pending, this function returns clears its pending status
904     and returns its C<revents> bitset (as if its callback was invoked). If the
905     watcher isn't pending it does nothing and returns C<0>.
906    
907 root 1.36 =back
908    
909    
910 root 1.1 =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
911    
912     Each watcher has, by default, a member C<void *data> that you can change
913 root 1.14 and read at any time, libev will completely ignore it. This can be used
914 root 1.1 to associate arbitrary data with your watcher. If you need more data and
915     don't want to allocate memory and store a pointer to it in that data
916     member, you can also "subclass" the watcher type and provide your own
917     data:
918    
919     struct my_io
920     {
921     struct ev_io io;
922     int otherfd;
923     void *somedata;
924     struct whatever *mostinteresting;
925     }
926    
927     And since your callback will be called with a pointer to the watcher, you
928     can cast it back to your own type:
929    
930     static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
931     {
932     struct my_io *w = (struct my_io *)w_;
933     ...
934     }
935    
936 root 1.55 More interesting and less C-conformant ways of casting your callback type
937     instead have been omitted.
938    
939     Another common scenario is having some data structure with multiple
940     watchers:
941    
942     struct my_biggy
943     {
944     int some_data;
945     ev_timer t1;
946     ev_timer t2;
947     }
948    
949     In this case getting the pointer to C<my_biggy> is a bit more complicated,
950     you need to use C<offsetof>:
951    
952     #include <stddef.h>
953    
954     static void
955     t1_cb (EV_P_ struct ev_timer *w, int revents)
956     {
957     struct my_biggy big = (struct my_biggy *
958     (((char *)w) - offsetof (struct my_biggy, t1));
959     }
960    
961     static void
962     t2_cb (EV_P_ struct ev_timer *w, int revents)
963     {
964     struct my_biggy big = (struct my_biggy *
965     (((char *)w) - offsetof (struct my_biggy, t2));
966     }
967 root 1.1
968    
969     =head1 WATCHER TYPES
970    
971     This section describes each watcher in detail, but will not repeat
972 root 1.48 information given in the last section. Any initialisation/set macros,
973     functions and members specific to the watcher type are explained.
974    
975     Members are additionally marked with either I<[read-only]>, meaning that,
976     while the watcher is active, you can look at the member and expect some
977     sensible content, but you must not modify it (you can modify it while the
978     watcher is stopped to your hearts content), or I<[read-write]>, which
979     means you can expect it to have some sensible content while the watcher
980     is active, but you can also modify it. Modifying it may not do something
981     sensible or take immediate effect (or do anything at all), but libev will
982     not crash or malfunction in any way.
983 root 1.1
984 root 1.34
985 root 1.42 =head2 C<ev_io> - is this file descriptor readable or writable?
986 root 1.1
987 root 1.4 I/O watchers check whether a file descriptor is readable or writable
988 root 1.42 in each iteration of the event loop, or, more precisely, when reading
989     would not block the process and writing would at least be able to write
990     some data. This behaviour is called level-triggering because you keep
991     receiving events as long as the condition persists. Remember you can stop
992     the watcher if you don't want to act on the event and neither want to
993     receive future events.
994 root 1.1
995 root 1.23 In general you can register as many read and/or write event watchers per
996 root 1.8 fd as you want (as long as you don't confuse yourself). Setting all file
997     descriptors to non-blocking mode is also usually a good idea (but not
998     required if you know what you are doing).
999    
1000     If you must do this, then force the use of a known-to-be-good backend
1001 root 1.31 (at the time of this writing, this includes only C<EVBACKEND_SELECT> and
1002     C<EVBACKEND_POLL>).
1003 root 1.8
1004 root 1.42 Another thing you have to watch out for is that it is quite easy to
1005     receive "spurious" readyness notifications, that is your callback might
1006     be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1007     because there is no data. Not only are some backends known to create a
1008     lot of those (for example solaris ports), it is very easy to get into
1009     this situation even with a relatively standard program structure. Thus
1010     it is best to always use non-blocking I/O: An extra C<read>(2) returning
1011     C<EAGAIN> is far preferable to a program hanging until some data arrives.
1012    
1013     If you cannot run the fd in non-blocking mode (for example you should not
1014     play around with an Xlib connection), then you have to seperately re-test
1015 root 1.68 whether a file descriptor is really ready with a known-to-be good interface
1016 root 1.42 such as poll (fortunately in our Xlib example, Xlib already does this on
1017     its own, so its quite safe to use).
1018    
1019 root 1.81 =head3 The special problem of disappearing file descriptors
1020    
1021 root 1.94 Some backends (e.g. kqueue, epoll) need to be told about closing a file
1022 root 1.81 descriptor (either by calling C<close> explicitly or by any other means,
1023     such as C<dup>). The reason is that you register interest in some file
1024     descriptor, but when it goes away, the operating system will silently drop
1025     this interest. If another file descriptor with the same number then is
1026     registered with libev, there is no efficient way to see that this is, in
1027     fact, a different file descriptor.
1028    
1029     To avoid having to explicitly tell libev about such cases, libev follows
1030     the following policy: Each time C<ev_io_set> is being called, libev
1031     will assume that this is potentially a new file descriptor, otherwise
1032     it is assumed that the file descriptor stays the same. That means that
1033     you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
1034     descriptor even if the file descriptor number itself did not change.
1035    
1036     This is how one would do it normally anyway, the important point is that
1037     the libev application should not optimise around libev but should leave
1038     optimisations to libev.
1039    
1040 root 1.95 =head3 The special problem of dup'ed file descriptors
1041 root 1.94
1042     Some backends (e.g. epoll), cannot register events for file descriptors,
1043 root 1.103 but only events for the underlying file descriptions. That means when you
1044 root 1.109 have C<dup ()>'ed file descriptors or weirder constellations, and register
1045     events for them, only one file descriptor might actually receive events.
1046 root 1.94
1047 root 1.103 There is no workaround possible except not registering events
1048     for potentially C<dup ()>'ed file descriptors, or to resort to
1049 root 1.94 C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1050    
1051     =head3 The special problem of fork
1052    
1053     Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1054     useless behaviour. Libev fully supports fork, but needs to be told about
1055     it in the child.
1056    
1057     To support fork in your programs, you either have to call
1058     C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1059     enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1060     C<EVBACKEND_POLL>.
1061    
1062 root 1.81
1063 root 1.82 =head3 Watcher-Specific Functions
1064    
1065 root 1.1 =over 4
1066    
1067     =item ev_io_init (ev_io *, callback, int fd, int events)
1068    
1069     =item ev_io_set (ev_io *, int fd, int events)
1070    
1071 root 1.42 Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1072     rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or
1073     C<EV_READ | EV_WRITE> to receive the given events.
1074 root 1.32
1075 root 1.48 =item int fd [read-only]
1076    
1077     The file descriptor being watched.
1078    
1079     =item int events [read-only]
1080    
1081     The events being watched.
1082    
1083 root 1.1 =back
1084    
1085 root 1.111 =head3 Examples
1086    
1087 root 1.54 Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1088 root 1.34 readable, but only once. Since it is likely line-buffered, you could
1089 root 1.54 attempt to read a whole line in the callback.
1090 root 1.34
1091     static void
1092     stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1093     {
1094     ev_io_stop (loop, w);
1095     .. read from stdin here (or from w->fd) and haqndle any I/O errors
1096     }
1097    
1098     ...
1099     struct ev_loop *loop = ev_default_init (0);
1100     struct ev_io stdin_readable;
1101     ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1102     ev_io_start (loop, &stdin_readable);
1103     ev_loop (loop, 0);
1104    
1105    
1106 root 1.42 =head2 C<ev_timer> - relative and optionally repeating timeouts
1107 root 1.1
1108     Timer watchers are simple relative timers that generate an event after a
1109     given time, and optionally repeating in regular intervals after that.
1110    
1111     The timers are based on real time, that is, if you register an event that
1112 root 1.22 times out after an hour and you reset your system clock to last years
1113 root 1.1 time, it will still time out after (roughly) and hour. "Roughly" because
1114 root 1.28 detecting time jumps is hard, and some inaccuracies are unavoidable (the
1115 root 1.1 monotonic clock option helps a lot here).
1116    
1117 root 1.9 The relative timeouts are calculated relative to the C<ev_now ()>
1118     time. This is usually the right thing as this timestamp refers to the time
1119 root 1.28 of the event triggering whatever timeout you are modifying/starting. If
1120     you suspect event processing to be delayed and you I<need> to base the timeout
1121 root 1.22 on the current time, use something like this to adjust for this:
1122 root 1.9
1123     ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1124    
1125 root 1.28 The callback is guarenteed to be invoked only when its timeout has passed,
1126     but if multiple timers become ready during the same loop iteration then
1127     order of execution is undefined.
1128    
1129 root 1.82 =head3 Watcher-Specific Functions and Data Members
1130    
1131 root 1.1 =over 4
1132    
1133     =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1134    
1135     =item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
1136    
1137     Configure the timer to trigger after C<after> seconds. If C<repeat> is
1138     C<0.>, then it will automatically be stopped. If it is positive, then the
1139     timer will automatically be configured to trigger again C<repeat> seconds
1140     later, again, and again, until stopped manually.
1141    
1142     The timer itself will do a best-effort at avoiding drift, that is, if you
1143     configure a timer to trigger every 10 seconds, then it will trigger at
1144     exactly 10 second intervals. If, however, your program cannot keep up with
1145 root 1.22 the timer (because it takes longer than those 10 seconds to do stuff) the
1146 root 1.1 timer will not fire more than once per event loop iteration.
1147    
1148     =item ev_timer_again (loop)
1149    
1150     This will act as if the timer timed out and restart it again if it is
1151     repeating. The exact semantics are:
1152    
1153 root 1.61 If the timer is pending, its pending status is cleared.
1154 root 1.1
1155 root 1.61 If the timer is started but nonrepeating, stop it (as if it timed out).
1156    
1157     If the timer is repeating, either start it if necessary (with the
1158     C<repeat> value), or reset the running timer to the C<repeat> value.
1159 root 1.1
1160     This sounds a bit complicated, but here is a useful and typical
1161 root 1.61 example: Imagine you have a tcp connection and you want a so-called idle
1162     timeout, that is, you want to be called when there have been, say, 60
1163     seconds of inactivity on the socket. The easiest way to do this is to
1164     configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1165 root 1.48 C<ev_timer_again> each time you successfully read or write some data. If
1166     you go into an idle state where you do not expect data to travel on the
1167 root 1.61 socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
1168     automatically restart it if need be.
1169 root 1.48
1170 root 1.61 That means you can ignore the C<after> value and C<ev_timer_start>
1171     altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1172 root 1.48
1173     ev_timer_init (timer, callback, 0., 5.);
1174     ev_timer_again (loop, timer);
1175     ...
1176     timer->again = 17.;
1177     ev_timer_again (loop, timer);
1178     ...
1179     timer->again = 10.;
1180     ev_timer_again (loop, timer);
1181    
1182 root 1.61 This is more slightly efficient then stopping/starting the timer each time
1183     you want to modify its timeout value.
1184 root 1.48
1185     =item ev_tstamp repeat [read-write]
1186    
1187     The current C<repeat> value. Will be used each time the watcher times out
1188     or C<ev_timer_again> is called and determines the next timeout (if any),
1189     which is also when any modifications are taken into account.
1190 root 1.1
1191     =back
1192    
1193 root 1.111 =head3 Examples
1194    
1195 root 1.54 Example: Create a timer that fires after 60 seconds.
1196 root 1.34
1197     static void
1198     one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1199     {
1200     .. one minute over, w is actually stopped right here
1201     }
1202    
1203     struct ev_timer mytimer;
1204     ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1205     ev_timer_start (loop, &mytimer);
1206    
1207 root 1.54 Example: Create a timeout timer that times out after 10 seconds of
1208 root 1.34 inactivity.
1209    
1210     static void
1211     timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1212     {
1213     .. ten seconds without any activity
1214     }
1215    
1216     struct ev_timer mytimer;
1217     ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1218     ev_timer_again (&mytimer); /* start timer */
1219     ev_loop (loop, 0);
1220    
1221     // and in some piece of code that gets executed on any "activity":
1222     // reset the timeout to start ticking again at 10 seconds
1223     ev_timer_again (&mytimer);
1224    
1225    
1226 root 1.42 =head2 C<ev_periodic> - to cron or not to cron?
1227 root 1.1
1228     Periodic watchers are also timers of a kind, but they are very versatile
1229     (and unfortunately a bit complex).
1230    
1231 root 1.10 Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1232 root 1.1 but on wallclock time (absolute time). You can tell a periodic watcher
1233     to trigger "at" some specific point in time. For example, if you tell a
1234 root 1.38 periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
1235 root 1.1 + 10.>) and then reset your system clock to the last year, then it will
1236 root 1.10 take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1237 root 1.78 roughly 10 seconds later).
1238 root 1.1
1239     They can also be used to implement vastly more complex timers, such as
1240 root 1.78 triggering an event on each midnight, local time or other, complicated,
1241     rules.
1242 root 1.1
1243 root 1.28 As with timers, the callback is guarenteed to be invoked only when the
1244     time (C<at>) has been passed, but if multiple periodic timers become ready
1245     during the same loop iteration then order of execution is undefined.
1246    
1247 root 1.82 =head3 Watcher-Specific Functions and Data Members
1248    
1249 root 1.1 =over 4
1250    
1251     =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1252    
1253     =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1254    
1255     Lots of arguments, lets sort it out... There are basically three modes of
1256     operation, and we will explain them from simplest to complex:
1257    
1258     =over 4
1259    
1260 root 1.78 =item * absolute timer (at = time, interval = reschedule_cb = 0)
1261 root 1.1
1262     In this configuration the watcher triggers an event at the wallclock time
1263     C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1264     that is, if it is to be run at January 1st 2011 then it will run when the
1265     system time reaches or surpasses this time.
1266    
1267 root 1.78 =item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1268 root 1.1
1269     In this mode the watcher will always be scheduled to time out at the next
1270 root 1.78 C<at + N * interval> time (for some integer N, which can also be negative)
1271     and then repeat, regardless of any time jumps.
1272 root 1.1
1273     This can be used to create timers that do not drift with respect to system
1274     time:
1275    
1276     ev_periodic_set (&periodic, 0., 3600., 0);
1277    
1278     This doesn't mean there will always be 3600 seconds in between triggers,
1279     but only that the the callback will be called when the system time shows a
1280 root 1.12 full hour (UTC), or more correctly, when the system time is evenly divisible
1281 root 1.1 by 3600.
1282    
1283     Another way to think about it (for the mathematically inclined) is that
1284 root 1.10 C<ev_periodic> will try to run the callback in this mode at the next possible
1285 root 1.1 time where C<time = at (mod interval)>, regardless of any time jumps.
1286    
1287 root 1.78 For numerical stability it is preferable that the C<at> value is near
1288     C<ev_now ()> (the current time), but there is no range requirement for
1289     this value.
1290    
1291     =item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1292 root 1.1
1293     In this mode the values for C<interval> and C<at> are both being
1294     ignored. Instead, each time the periodic watcher gets scheduled, the
1295     reschedule callback will be called with the watcher as first, and the
1296     current time as second argument.
1297    
1298 root 1.18 NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1299     ever, or make any event loop modifications>. If you need to stop it,
1300     return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1301 root 1.78 starting an C<ev_prepare> watcher, which is legal).
1302 root 1.1
1303 root 1.13 Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1304 root 1.1 ev_tstamp now)>, e.g.:
1305    
1306     static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1307     {
1308     return now + 60.;
1309     }
1310    
1311     It must return the next time to trigger, based on the passed time value
1312     (that is, the lowest time value larger than to the second argument). It
1313     will usually be called just before the callback will be triggered, but
1314     might be called at other times, too.
1315    
1316 root 1.18 NOTE: I<< This callback must always return a time that is later than the
1317 root 1.19 passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger.
1318 root 1.18
1319 root 1.1 This can be used to create very complex timers, such as a timer that
1320     triggers on each midnight, local time. To do this, you would calculate the
1321 root 1.19 next midnight after C<now> and return the timestamp value for this. How
1322     you do this is, again, up to you (but it is not trivial, which is the main
1323     reason I omitted it as an example).
1324 root 1.1
1325     =back
1326    
1327     =item ev_periodic_again (loop, ev_periodic *)
1328    
1329     Simply stops and restarts the periodic watcher again. This is only useful
1330     when you changed some parameters or the reschedule callback would return
1331     a different time than the last time it was called (e.g. in a crond like
1332     program when the crontabs have changed).
1333    
1334 root 1.78 =item ev_tstamp offset [read-write]
1335    
1336     When repeating, this contains the offset value, otherwise this is the
1337     absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1338    
1339     Can be modified any time, but changes only take effect when the periodic
1340     timer fires or C<ev_periodic_again> is being called.
1341    
1342 root 1.48 =item ev_tstamp interval [read-write]
1343    
1344     The current interval value. Can be modified any time, but changes only
1345     take effect when the periodic timer fires or C<ev_periodic_again> is being
1346     called.
1347    
1348     =item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write]
1349    
1350     The current reschedule callback, or C<0>, if this functionality is
1351     switched off. Can be changed any time, but changes only take effect when
1352     the periodic timer fires or C<ev_periodic_again> is being called.
1353    
1354 root 1.85 =item ev_tstamp at [read-only]
1355    
1356     When active, contains the absolute time that the watcher is supposed to
1357     trigger next.
1358    
1359 root 1.1 =back
1360    
1361 root 1.111 =head3 Examples
1362    
1363 root 1.54 Example: Call a callback every hour, or, more precisely, whenever the
1364 root 1.34 system clock is divisible by 3600. The callback invocation times have
1365     potentially a lot of jittering, but good long-term stability.
1366    
1367     static void
1368     clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1369     {
1370     ... its now a full hour (UTC, or TAI or whatever your clock follows)
1371     }
1372    
1373     struct ev_periodic hourly_tick;
1374     ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1375     ev_periodic_start (loop, &hourly_tick);
1376    
1377 root 1.54 Example: The same as above, but use a reschedule callback to do it:
1378 root 1.34
1379     #include <math.h>
1380    
1381     static ev_tstamp
1382     my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1383     {
1384     return fmod (now, 3600.) + 3600.;
1385     }
1386    
1387     ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1388    
1389 root 1.54 Example: Call a callback every hour, starting now:
1390 root 1.34
1391     struct ev_periodic hourly_tick;
1392     ev_periodic_init (&hourly_tick, clock_cb,
1393     fmod (ev_now (loop), 3600.), 3600., 0);
1394     ev_periodic_start (loop, &hourly_tick);
1395    
1396    
1397 root 1.42 =head2 C<ev_signal> - signal me when a signal gets signalled!
1398 root 1.1
1399     Signal watchers will trigger an event when the process receives a specific
1400     signal one or more times. Even though signals are very asynchronous, libev
1401 root 1.9 will try it's best to deliver signals synchronously, i.e. as part of the
1402 root 1.1 normal event processing, like any other event.
1403    
1404 root 1.14 You can configure as many watchers as you like per signal. Only when the
1405 root 1.1 first watcher gets started will libev actually register a signal watcher
1406     with the kernel (thus it coexists with your own signal handlers as long
1407     as you don't register any with libev). Similarly, when the last signal
1408     watcher for a signal is stopped libev will reset the signal handler to
1409     SIG_DFL (regardless of what it was set to before).
1410    
1411 root 1.82 =head3 Watcher-Specific Functions and Data Members
1412    
1413 root 1.1 =over 4
1414    
1415     =item ev_signal_init (ev_signal *, callback, int signum)
1416    
1417     =item ev_signal_set (ev_signal *, int signum)
1418    
1419     Configures the watcher to trigger on the given signal number (usually one
1420     of the C<SIGxxx> constants).
1421    
1422 root 1.48 =item int signum [read-only]
1423    
1424     The signal the watcher watches out for.
1425    
1426 root 1.1 =back
1427    
1428 root 1.35
1429 root 1.42 =head2 C<ev_child> - watch out for process status changes
1430 root 1.1
1431     Child watchers trigger when your process receives a SIGCHLD in response to
1432     some child status changes (most typically when a child of yours dies).
1433    
1434 root 1.82 =head3 Watcher-Specific Functions and Data Members
1435    
1436 root 1.1 =over 4
1437    
1438     =item ev_child_init (ev_child *, callback, int pid)
1439    
1440     =item ev_child_set (ev_child *, int pid)
1441    
1442     Configures the watcher to wait for status changes of process C<pid> (or
1443     I<any> process if C<pid> is specified as C<0>). The callback can look
1444     at the C<rstatus> member of the C<ev_child> watcher structure to see
1445 root 1.14 the status word (use the macros from C<sys/wait.h> and see your systems
1446     C<waitpid> documentation). The C<rpid> member contains the pid of the
1447     process causing the status change.
1448 root 1.1
1449 root 1.48 =item int pid [read-only]
1450    
1451     The process id this watcher watches out for, or C<0>, meaning any process id.
1452    
1453     =item int rpid [read-write]
1454    
1455     The process id that detected a status change.
1456    
1457     =item int rstatus [read-write]
1458    
1459     The process exit/trace status caused by C<rpid> (see your systems
1460     C<waitpid> and C<sys/wait.h> documentation for details).
1461    
1462 root 1.1 =back
1463    
1464 root 1.111 =head3 Examples
1465    
1466 root 1.54 Example: Try to exit cleanly on SIGINT and SIGTERM.
1467 root 1.34
1468     static void
1469     sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1470     {
1471     ev_unloop (loop, EVUNLOOP_ALL);
1472     }
1473    
1474     struct ev_signal signal_watcher;
1475     ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1476     ev_signal_start (loop, &sigint_cb);
1477    
1478    
1479 root 1.48 =head2 C<ev_stat> - did the file attributes just change?
1480    
1481     This watches a filesystem path for attribute changes. That is, it calls
1482     C<stat> regularly (or when the OS says it changed) and sees if it changed
1483     compared to the last time, invoking the callback if it did.
1484    
1485     The path does not need to exist: changing from "path exists" to "path does
1486     not exist" is a status change like any other. The condition "path does
1487     not exist" is signified by the C<st_nlink> field being zero (which is
1488     otherwise always forced to be at least one) and all the other fields of
1489     the stat buffer having unspecified contents.
1490    
1491 root 1.60 The path I<should> be absolute and I<must not> end in a slash. If it is
1492     relative and your working directory changes, the behaviour is undefined.
1493    
1494 root 1.48 Since there is no standard to do this, the portable implementation simply
1495 root 1.57 calls C<stat (2)> regularly on the path to see if it changed somehow. You
1496 root 1.48 can specify a recommended polling interval for this case. If you specify
1497     a polling interval of C<0> (highly recommended!) then a I<suitable,
1498     unspecified default> value will be used (which you can expect to be around
1499     five seconds, although this might change dynamically). Libev will also
1500     impose a minimum interval which is currently around C<0.1>, but thats
1501     usually overkill.
1502    
1503     This watcher type is not meant for massive numbers of stat watchers,
1504     as even with OS-supported change notifications, this can be
1505     resource-intensive.
1506    
1507 root 1.57 At the time of this writing, only the Linux inotify interface is
1508     implemented (implementing kqueue support is left as an exercise for the
1509     reader). Inotify will be used to give hints only and should not change the
1510     semantics of C<ev_stat> watchers, which means that libev sometimes needs
1511     to fall back to regular polling again even with inotify, but changes are
1512     usually detected immediately, and if the file exists there will be no
1513     polling.
1514 root 1.48
1515 root 1.108 =head3 Inotify
1516    
1517     When C<inotify (7)> support has been compiled into libev (generally only
1518     available on Linux) and present at runtime, it will be used to speed up
1519     change detection where possible. The inotify descriptor will be created lazily
1520     when the first C<ev_stat> watcher is being started.
1521    
1522     Inotify presense does not change the semantics of C<ev_stat> watchers
1523     except that changes might be detected earlier, and in some cases, to avoid
1524     making regular C<stat> calls. Even in the presense of inotify support
1525     there are many cases where libev has to resort to regular C<stat> polling.
1526    
1527     (There is no support for kqueue, as apparently it cannot be used to
1528     implement this functionality, due to the requirement of having a file
1529     descriptor open on the object at all times).
1530    
1531 root 1.107 =head3 The special problem of stat time resolution
1532    
1533     The C<stat ()> syscall only supports full-second resolution portably, and
1534     even on systems where the resolution is higher, many filesystems still
1535     only support whole seconds.
1536    
1537     That means that, if the time is the only thing that changes, you might
1538     miss updates: on the first update, C<ev_stat> detects a change and calls
1539     your callback, which does something. When there is another update within
1540     the same second, C<ev_stat> will be unable to detect it.
1541    
1542     The solution to this is to delay acting on a change for a second (or till
1543     the next second boundary), using a roughly one-second delay C<ev_timer>
1544     (C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>
1545     is added to work around small timing inconsistencies of some operating
1546     systems.
1547    
1548 root 1.82 =head3 Watcher-Specific Functions and Data Members
1549    
1550 root 1.48 =over 4
1551    
1552     =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1553    
1554     =item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
1555    
1556     Configures the watcher to wait for status changes of the given
1557     C<path>. The C<interval> is a hint on how quickly a change is expected to
1558     be detected and should normally be specified as C<0> to let libev choose
1559     a suitable value. The memory pointed to by C<path> must point to the same
1560     path for as long as the watcher is active.
1561    
1562     The callback will be receive C<EV_STAT> when a change was detected,
1563     relative to the attributes at the time the watcher was started (or the
1564     last change was detected).
1565    
1566     =item ev_stat_stat (ev_stat *)
1567    
1568     Updates the stat buffer immediately with new values. If you change the
1569     watched path in your callback, you could call this fucntion to avoid
1570     detecting this change (while introducing a race condition). Can also be
1571     useful simply to find out the new values.
1572    
1573     =item ev_statdata attr [read-only]
1574    
1575     The most-recently detected attributes of the file. Although the type is of
1576     C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1577     suitable for your system. If the C<st_nlink> member is C<0>, then there
1578     was some error while C<stat>ing the file.
1579    
1580     =item ev_statdata prev [read-only]
1581    
1582     The previous attributes of the file. The callback gets invoked whenever
1583     C<prev> != C<attr>.
1584    
1585     =item ev_tstamp interval [read-only]
1586    
1587     The specified interval.
1588    
1589     =item const char *path [read-only]
1590    
1591     The filesystem path that is being watched.
1592    
1593     =back
1594    
1595 root 1.108 =head3 Examples
1596    
1597 root 1.48 Example: Watch C</etc/passwd> for attribute changes.
1598    
1599     static void
1600     passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1601     {
1602     /* /etc/passwd changed in some way */
1603     if (w->attr.st_nlink)
1604     {
1605     printf ("passwd current size %ld\n", (long)w->attr.st_size);
1606     printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1607     printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1608     }
1609     else
1610     /* you shalt not abuse printf for puts */
1611     puts ("wow, /etc/passwd is not there, expect problems. "
1612     "if this is windows, they already arrived\n");
1613     }
1614    
1615     ...
1616     ev_stat passwd;
1617    
1618 root 1.107 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1619     ev_stat_start (loop, &passwd);
1620    
1621     Example: Like above, but additionally use a one-second delay so we do not
1622     miss updates (however, frequent updates will delay processing, too, so
1623     one might do the work both on C<ev_stat> callback invocation I<and> on
1624     C<ev_timer> callback invocation).
1625    
1626     static ev_stat passwd;
1627     static ev_timer timer;
1628    
1629     static void
1630     timer_cb (EV_P_ ev_timer *w, int revents)
1631     {
1632     ev_timer_stop (EV_A_ w);
1633    
1634     /* now it's one second after the most recent passwd change */
1635     }
1636    
1637     static void
1638     stat_cb (EV_P_ ev_stat *w, int revents)
1639     {
1640     /* reset the one-second timer */
1641     ev_timer_again (EV_A_ &timer);
1642     }
1643    
1644     ...
1645     ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1646 root 1.48 ev_stat_start (loop, &passwd);
1647 root 1.107 ev_timer_init (&timer, timer_cb, 0., 1.01);
1648 root 1.48
1649    
1650 root 1.42 =head2 C<ev_idle> - when you've got nothing better to do...
1651 root 1.1
1652 root 1.67 Idle watchers trigger events when no other events of the same or higher
1653     priority are pending (prepare, check and other idle watchers do not
1654     count).
1655    
1656     That is, as long as your process is busy handling sockets or timeouts
1657     (or even signals, imagine) of the same or higher priority it will not be
1658     triggered. But when your process is idle (or only lower-priority watchers
1659     are pending), the idle watchers are being called once per event loop
1660     iteration - until stopped, that is, or your process receives more events
1661     and becomes busy again with higher priority stuff.
1662 root 1.1
1663     The most noteworthy effect is that as long as any idle watchers are
1664     active, the process will not block when waiting for new events.
1665    
1666     Apart from keeping your process non-blocking (which is a useful
1667     effect on its own sometimes), idle watchers are a good place to do
1668     "pseudo-background processing", or delay processing stuff to after the
1669     event loop has handled all outstanding events.
1670    
1671 root 1.82 =head3 Watcher-Specific Functions and Data Members
1672    
1673 root 1.1 =over 4
1674    
1675     =item ev_idle_init (ev_signal *, callback)
1676    
1677     Initialises and configures the idle watcher - it has no parameters of any
1678     kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1679     believe me.
1680    
1681     =back
1682    
1683 root 1.111 =head3 Examples
1684    
1685 root 1.54 Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1686     callback, free it. Also, use no error checking, as usual.
1687 root 1.34
1688     static void
1689     idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1690     {
1691     free (w);
1692     // now do something you wanted to do when the program has
1693     // no longer asnything immediate to do.
1694     }
1695    
1696     struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1697     ev_idle_init (idle_watcher, idle_cb);
1698     ev_idle_start (loop, idle_cb);
1699    
1700    
1701 root 1.42 =head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1702 root 1.1
1703 root 1.14 Prepare and check watchers are usually (but not always) used in tandem:
1704 root 1.20 prepare watchers get invoked before the process blocks and check watchers
1705 root 1.14 afterwards.
1706 root 1.1
1707 root 1.45 You I<must not> call C<ev_loop> or similar functions that enter
1708     the current event loop from either C<ev_prepare> or C<ev_check>
1709     watchers. Other loops than the current one are fine, however. The
1710     rationale behind this is that you do not need to check for recursion in
1711     those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1712     C<ev_check> so if you have one watcher of each kind they will always be
1713     called in pairs bracketing the blocking call.
1714    
1715 root 1.35 Their main purpose is to integrate other event mechanisms into libev and
1716     their use is somewhat advanced. This could be used, for example, to track
1717     variable changes, implement your own watchers, integrate net-snmp or a
1718 root 1.45 coroutine library and lots more. They are also occasionally useful if
1719     you cache some data and want to flush it before blocking (for example,
1720     in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1721     watcher).
1722 root 1.1
1723     This is done by examining in each prepare call which file descriptors need
1724 root 1.14 to be watched by the other library, registering C<ev_io> watchers for
1725     them and starting an C<ev_timer> watcher for any timeouts (many libraries
1726     provide just this functionality). Then, in the check watcher you check for
1727     any events that occured (by checking the pending status of all watchers
1728     and stopping them) and call back into the library. The I/O and timer
1729 root 1.20 callbacks will never actually be called (but must be valid nevertheless,
1730 root 1.14 because you never know, you know?).
1731 root 1.1
1732 root 1.14 As another example, the Perl Coro module uses these hooks to integrate
1733 root 1.1 coroutines into libev programs, by yielding to other active coroutines
1734     during each prepare and only letting the process block if no coroutines
1735 root 1.20 are ready to run (it's actually more complicated: it only runs coroutines
1736     with priority higher than or equal to the event loop and one coroutine
1737     of lower priority, but only once, using idle watchers to keep the event
1738     loop from blocking if lower-priority coroutines are active, thus mapping
1739     low-priority coroutines to idle/background tasks).
1740 root 1.1
1741 root 1.77 It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1742     priority, to ensure that they are being run before any other watchers
1743     after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1744     too) should not activate ("feed") events into libev. While libev fully
1745 root 1.100 supports this, they will be called before other C<ev_check> watchers
1746     did their job. As C<ev_check> watchers are often used to embed other
1747     (non-libev) event loops those other event loops might be in an unusable
1748     state until their C<ev_check> watcher ran (always remind yourself to
1749     coexist peacefully with others).
1750 root 1.77
1751 root 1.82 =head3 Watcher-Specific Functions and Data Members
1752    
1753 root 1.1 =over 4
1754    
1755     =item ev_prepare_init (ev_prepare *, callback)
1756    
1757     =item ev_check_init (ev_check *, callback)
1758    
1759     Initialises and configures the prepare or check watcher - they have no
1760     parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1761 root 1.14 macros, but using them is utterly, utterly and completely pointless.
1762 root 1.1
1763     =back
1764    
1765 root 1.111 =head3 Examples
1766    
1767 root 1.76 There are a number of principal ways to embed other event loops or modules
1768     into libev. Here are some ideas on how to include libadns into libev
1769     (there is a Perl module named C<EV::ADNS> that does this, which you could
1770     use for an actually working example. Another Perl module named C<EV::Glib>
1771     embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV
1772     into the Glib event loop).
1773    
1774     Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1775     and in a check watcher, destroy them and call into libadns. What follows
1776     is pseudo-code only of course. This requires you to either use a low
1777     priority for the check watcher or use C<ev_clear_pending> explicitly, as
1778     the callbacks for the IO/timeout watchers might not have been called yet.
1779 root 1.45
1780     static ev_io iow [nfd];
1781     static ev_timer tw;
1782    
1783     static void
1784     io_cb (ev_loop *loop, ev_io *w, int revents)
1785     {
1786     }
1787    
1788     // create io watchers for each fd and a timer before blocking
1789     static void
1790     adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1791     {
1792 root 1.64 int timeout = 3600000;
1793     struct pollfd fds [nfd];
1794 root 1.45 // actual code will need to loop here and realloc etc.
1795     adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1796    
1797     /* the callback is illegal, but won't be called as we stop during check */
1798     ev_timer_init (&tw, 0, timeout * 1e-3);
1799     ev_timer_start (loop, &tw);
1800    
1801 root 1.76 // create one ev_io per pollfd
1802 root 1.45 for (int i = 0; i < nfd; ++i)
1803     {
1804     ev_io_init (iow + i, io_cb, fds [i].fd,
1805     ((fds [i].events & POLLIN ? EV_READ : 0)
1806     | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1807    
1808     fds [i].revents = 0;
1809     ev_io_start (loop, iow + i);
1810     }
1811     }
1812    
1813     // stop all watchers after blocking
1814     static void
1815     adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1816     {
1817     ev_timer_stop (loop, &tw);
1818    
1819     for (int i = 0; i < nfd; ++i)
1820 root 1.76 {
1821     // set the relevant poll flags
1822     // could also call adns_processreadable etc. here
1823     struct pollfd *fd = fds + i;
1824     int revents = ev_clear_pending (iow + i);
1825     if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1826     if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1827    
1828     // now stop the watcher
1829     ev_io_stop (loop, iow + i);
1830     }
1831 root 1.45
1832     adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1833     }
1834 root 1.34
1835 root 1.76 Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1836     in the prepare watcher and would dispose of the check watcher.
1837    
1838     Method 3: If the module to be embedded supports explicit event
1839     notification (adns does), you can also make use of the actual watcher
1840     callbacks, and only destroy/create the watchers in the prepare watcher.
1841    
1842     static void
1843     timer_cb (EV_P_ ev_timer *w, int revents)
1844     {
1845     adns_state ads = (adns_state)w->data;
1846     update_now (EV_A);
1847    
1848     adns_processtimeouts (ads, &tv_now);
1849     }
1850    
1851     static void
1852     io_cb (EV_P_ ev_io *w, int revents)
1853     {
1854     adns_state ads = (adns_state)w->data;
1855     update_now (EV_A);
1856    
1857     if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1858     if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1859     }
1860    
1861     // do not ever call adns_afterpoll
1862    
1863     Method 4: Do not use a prepare or check watcher because the module you
1864     want to embed is too inflexible to support it. Instead, youc na override
1865     their poll function. The drawback with this solution is that the main
1866     loop is now no longer controllable by EV. The C<Glib::EV> module does
1867     this.
1868    
1869     static gint
1870     event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1871     {
1872     int got_events = 0;
1873    
1874     for (n = 0; n < nfds; ++n)
1875     // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1876    
1877     if (timeout >= 0)
1878     // create/start timer
1879    
1880     // poll
1881     ev_loop (EV_A_ 0);
1882    
1883     // stop timer again
1884     if (timeout >= 0)
1885     ev_timer_stop (EV_A_ &to);
1886    
1887     // stop io watchers again - their callbacks should have set
1888     for (n = 0; n < nfds; ++n)
1889     ev_io_stop (EV_A_ iow [n]);
1890    
1891     return got_events;
1892     }
1893    
1894 root 1.34
1895 root 1.42 =head2 C<ev_embed> - when one backend isn't enough...
1896 root 1.35
1897     This is a rather advanced watcher type that lets you embed one event loop
1898 root 1.36 into another (currently only C<ev_io> events are supported in the embedded
1899     loop, other types of watchers might be handled in a delayed or incorrect
1900 root 1.100 fashion and must not be used).
1901 root 1.35
1902     There are primarily two reasons you would want that: work around bugs and
1903     prioritise I/O.
1904    
1905     As an example for a bug workaround, the kqueue backend might only support
1906     sockets on some platform, so it is unusable as generic backend, but you
1907     still want to make use of it because you have many sockets and it scales
1908     so nicely. In this case, you would create a kqueue-based loop and embed it
1909     into your default loop (which might use e.g. poll). Overall operation will
1910     be a bit slower because first libev has to poll and then call kevent, but
1911     at least you can use both at what they are best.
1912    
1913     As for prioritising I/O: rarely you have the case where some fds have
1914     to be watched and handled very quickly (with low latency), and even
1915     priorities and idle watchers might have too much overhead. In this case
1916     you would put all the high priority stuff in one loop and all the rest in
1917     a second one, and embed the second one in the first.
1918    
1919 root 1.36 As long as the watcher is active, the callback will be invoked every time
1920     there might be events pending in the embedded loop. The callback must then
1921     call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke
1922     their callbacks (you could also start an idle watcher to give the embedded
1923     loop strictly lower priority for example). You can also set the callback
1924     to C<0>, in which case the embed watcher will automatically execute the
1925     embedded loop sweep.
1926    
1927 root 1.35 As long as the watcher is started it will automatically handle events. The
1928     callback will be invoked whenever some events have been handled. You can
1929     set the callback to C<0> to avoid having to specify one if you are not
1930     interested in that.
1931    
1932     Also, there have not currently been made special provisions for forking:
1933     when you fork, you not only have to call C<ev_loop_fork> on both loops,
1934     but you will also have to stop and restart any C<ev_embed> watchers
1935     yourself.
1936    
1937     Unfortunately, not all backends are embeddable, only the ones returned by
1938     C<ev_embeddable_backends> are, which, unfortunately, does not include any
1939     portable one.
1940    
1941     So when you want to use this feature you will always have to be prepared
1942     that you cannot get an embeddable loop. The recommended way to get around
1943     this is to have a separate variables for your embeddable loop, try to
1944 root 1.111 create it, and if that fails, use the normal loop for everything.
1945 root 1.35
1946 root 1.82 =head3 Watcher-Specific Functions and Data Members
1947    
1948 root 1.35 =over 4
1949    
1950 root 1.36 =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1951    
1952     =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1953    
1954     Configures the watcher to embed the given loop, which must be
1955     embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1956     invoked automatically, otherwise it is the responsibility of the callback
1957     to invoke it (it will continue to be called until the sweep has been done,
1958     if you do not want thta, you need to temporarily stop the embed watcher).
1959 root 1.35
1960 root 1.36 =item ev_embed_sweep (loop, ev_embed *)
1961 root 1.35
1962 root 1.36 Make a single, non-blocking sweep over the embedded loop. This works
1963     similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1964     apropriate way for embedded loops.
1965 root 1.35
1966 root 1.91 =item struct ev_loop *other [read-only]
1967 root 1.48
1968     The embedded event loop.
1969    
1970 root 1.35 =back
1971    
1972 root 1.111 =head3 Examples
1973    
1974     Example: Try to get an embeddable event loop and embed it into the default
1975     event loop. If that is not possible, use the default loop. The default
1976     loop is stored in C<loop_hi>, while the mebeddable loop is stored in
1977     C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be
1978     used).
1979    
1980     struct ev_loop *loop_hi = ev_default_init (0);
1981     struct ev_loop *loop_lo = 0;
1982     struct ev_embed embed;
1983    
1984     // see if there is a chance of getting one that works
1985     // (remember that a flags value of 0 means autodetection)
1986     loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1987     ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1988     : 0;
1989    
1990     // if we got one, then embed it, otherwise default to loop_hi
1991     if (loop_lo)
1992     {
1993     ev_embed_init (&embed, 0, loop_lo);
1994     ev_embed_start (loop_hi, &embed);
1995     }
1996     else
1997     loop_lo = loop_hi;
1998    
1999     Example: Check if kqueue is available but not recommended and create
2000     a kqueue backend for use with sockets (which usually work with any
2001     kqueue implementation). Store the kqueue/socket-only event loop in
2002     C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2003    
2004     struct ev_loop *loop = ev_default_init (0);
2005     struct ev_loop *loop_socket = 0;
2006     struct ev_embed embed;
2007    
2008     if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2009     if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2010     {
2011     ev_embed_init (&embed, 0, loop_socket);
2012     ev_embed_start (loop, &embed);
2013     }
2014    
2015     if (!loop_socket)
2016     loop_socket = loop;
2017    
2018     // now use loop_socket for all sockets, and loop for everything else
2019    
2020 root 1.35
2021 root 1.50 =head2 C<ev_fork> - the audacity to resume the event loop after a fork
2022    
2023     Fork watchers are called when a C<fork ()> was detected (usually because
2024     whoever is a good citizen cared to tell libev about it by calling
2025     C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the
2026     event loop blocks next and before C<ev_check> watchers are being called,
2027     and only in the child after the fork. If whoever good citizen calling
2028     C<ev_default_fork> cheats and calls it in the wrong process, the fork
2029     handlers will be invoked, too, of course.
2030    
2031 root 1.83 =head3 Watcher-Specific Functions and Data Members
2032    
2033 root 1.50 =over 4
2034    
2035     =item ev_fork_init (ev_signal *, callback)
2036    
2037     Initialises and configures the fork watcher - it has no parameters of any
2038     kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
2039     believe me.
2040    
2041     =back
2042    
2043    
2044 root 1.1 =head1 OTHER FUNCTIONS
2045    
2046 root 1.14 There are some other functions of possible interest. Described. Here. Now.
2047 root 1.1
2048     =over 4
2049    
2050     =item ev_once (loop, int fd, int events, ev_tstamp timeout, callback)
2051    
2052     This function combines a simple timer and an I/O watcher, calls your
2053     callback on whichever event happens first and automatically stop both
2054     watchers. This is useful if you want to wait for a single event on an fd
2055 root 1.22 or timeout without having to allocate/configure/start/stop/free one or
2056 root 1.1 more watchers yourself.
2057    
2058 root 1.14 If C<fd> is less than 0, then no I/O watcher will be started and events
2059     is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
2060     C<events> set will be craeted and started.
2061 root 1.1
2062     If C<timeout> is less than 0, then no timeout watcher will be
2063 root 1.14 started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2064     repeat = 0) will be started. While C<0> is a valid timeout, it is of
2065     dubious value.
2066    
2067     The callback has the type C<void (*cb)(int revents, void *arg)> and gets
2068 root 1.21 passed an C<revents> set like normal event callbacks (a combination of
2069 root 1.14 C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
2070     value passed to C<ev_once>:
2071 root 1.1
2072     static void stdin_ready (int revents, void *arg)
2073     {
2074     if (revents & EV_TIMEOUT)
2075 root 1.14 /* doh, nothing entered */;
2076 root 1.1 else if (revents & EV_READ)
2077 root 1.14 /* stdin might have data for us, joy! */;
2078 root 1.1 }
2079    
2080 root 1.14 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2081 root 1.1
2082 root 1.36 =item ev_feed_event (ev_loop *, watcher *, int revents)
2083 root 1.1
2084     Feeds the given event set into the event loop, as if the specified event
2085 root 1.14 had happened for the specified watcher (which must be a pointer to an
2086     initialised but not necessarily started event watcher).
2087 root 1.1
2088 root 1.36 =item ev_feed_fd_event (ev_loop *, int fd, int revents)
2089 root 1.1
2090 root 1.14 Feed an event on the given fd, as if a file descriptor backend detected
2091     the given events it.
2092 root 1.1
2093 root 1.36 =item ev_feed_signal_event (ev_loop *loop, int signum)
2094 root 1.1
2095 root 1.36 Feed an event as if the given signal occured (C<loop> must be the default
2096     loop!).
2097 root 1.1
2098     =back
2099    
2100 root 1.34
2101 root 1.20 =head1 LIBEVENT EMULATION
2102    
2103 root 1.24 Libev offers a compatibility emulation layer for libevent. It cannot
2104     emulate the internals of libevent, so here are some usage hints:
2105    
2106     =over 4
2107    
2108     =item * Use it by including <event.h>, as usual.
2109    
2110     =item * The following members are fully supported: ev_base, ev_callback,
2111     ev_arg, ev_fd, ev_res, ev_events.
2112    
2113     =item * Avoid using ev_flags and the EVLIST_*-macros, while it is
2114     maintained by libev, it does not work exactly the same way as in libevent (consider
2115     it a private API).
2116    
2117     =item * Priorities are not currently supported. Initialising priorities
2118     will fail and all watchers will have the same priority, even though there
2119     is an ev_pri field.
2120    
2121     =item * Other members are not supported.
2122    
2123     =item * The libev emulation is I<not> ABI compatible to libevent, you need
2124     to use the libev header file and library.
2125    
2126     =back
2127 root 1.20
2128     =head1 C++ SUPPORT
2129    
2130 root 1.38 Libev comes with some simplistic wrapper classes for C++ that mainly allow
2131     you to use some convinience methods to start/stop watchers and also change
2132     the callback model to a model using method callbacks on objects.
2133    
2134     To use it,
2135    
2136     #include <ev++.h>
2137    
2138 root 1.71 This automatically includes F<ev.h> and puts all of its definitions (many
2139     of them macros) into the global namespace. All C++ specific things are
2140     put into the C<ev> namespace. It should support all the same embedding
2141     options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
2142    
2143 root 1.72 Care has been taken to keep the overhead low. The only data member the C++
2144     classes add (compared to plain C-style watchers) is the event loop pointer
2145     that the watcher is associated with (or no additional members at all if
2146     you disable C<EV_MULTIPLICITY> when embedding libev).
2147 root 1.71
2148 root 1.72 Currently, functions, and static and non-static member functions can be
2149 root 1.71 used as callbacks. Other types should be easy to add as long as they only
2150     need one additional pointer for context. If you need support for other
2151     types of functors please contact the author (preferably after implementing
2152     it).
2153 root 1.38
2154     Here is a list of things available in the C<ev> namespace:
2155    
2156     =over 4
2157    
2158     =item C<ev::READ>, C<ev::WRITE> etc.
2159    
2160     These are just enum values with the same values as the C<EV_READ> etc.
2161     macros from F<ev.h>.
2162    
2163     =item C<ev::tstamp>, C<ev::now>
2164    
2165     Aliases to the same types/functions as with the C<ev_> prefix.
2166    
2167     =item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
2168    
2169     For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
2170     the same name in the C<ev> namespace, with the exception of C<ev_signal>
2171     which is called C<ev::sig> to avoid clashes with the C<signal> macro
2172     defines by many implementations.
2173    
2174     All of those classes have these methods:
2175    
2176     =over 4
2177    
2178 root 1.71 =item ev::TYPE::TYPE ()
2179 root 1.38
2180 root 1.71 =item ev::TYPE::TYPE (struct ev_loop *)
2181 root 1.38
2182     =item ev::TYPE::~TYPE
2183    
2184 root 1.71 The constructor (optionally) takes an event loop to associate the watcher
2185     with. If it is omitted, it will use C<EV_DEFAULT>.
2186    
2187     The constructor calls C<ev_init> for you, which means you have to call the
2188     C<set> method before starting it.
2189    
2190     It will not set a callback, however: You have to call the templated C<set>
2191     method to set a callback before you can start the watcher.
2192    
2193     (The reason why you have to use a method is a limitation in C++ which does
2194     not allow explicit template arguments for constructors).
2195 root 1.38
2196     The destructor automatically stops the watcher if it is active.
2197    
2198 root 1.71 =item w->set<class, &class::method> (object *)
2199    
2200     This method sets the callback method to call. The method has to have a
2201     signature of C<void (*)(ev_TYPE &, int)>, it receives the watcher as
2202     first argument and the C<revents> as second. The object must be given as
2203     parameter and is stored in the C<data> member of the watcher.
2204    
2205     This method synthesizes efficient thunking code to call your method from
2206     the C callback that libev requires. If your compiler can inline your
2207     callback (i.e. it is visible to it at the place of the C<set> call and
2208     your compiler is good :), then the method will be fully inlined into the
2209     thunking function, making it as fast as a direct C callback.
2210    
2211     Example: simple class declaration and watcher initialisation
2212    
2213     struct myclass
2214     {
2215     void io_cb (ev::io &w, int revents) { }
2216     }
2217    
2218     myclass obj;
2219     ev::io iow;
2220     iow.set <myclass, &myclass::io_cb> (&obj);
2221    
2222 root 1.75 =item w->set<function> (void *data = 0)
2223 root 1.71
2224     Also sets a callback, but uses a static method or plain function as
2225     callback. The optional C<data> argument will be stored in the watcher's
2226     C<data> member and is free for you to use.
2227    
2228 root 1.75 The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2229    
2230 root 1.71 See the method-C<set> above for more details.
2231    
2232 root 1.75 Example:
2233    
2234     static void io_cb (ev::io &w, int revents) { }
2235     iow.set <io_cb> ();
2236    
2237 root 1.38 =item w->set (struct ev_loop *)
2238    
2239     Associates a different C<struct ev_loop> with this watcher. You can only
2240     do this when the watcher is inactive (and not pending either).
2241    
2242     =item w->set ([args])
2243    
2244     Basically the same as C<ev_TYPE_set>, with the same args. Must be
2245 root 1.71 called at least once. Unlike the C counterpart, an active watcher gets
2246     automatically stopped and restarted when reconfiguring it with this
2247     method.
2248 root 1.38
2249     =item w->start ()
2250    
2251 root 1.71 Starts the watcher. Note that there is no C<loop> argument, as the
2252     constructor already stores the event loop.
2253 root 1.38
2254     =item w->stop ()
2255    
2256     Stops the watcher if it is active. Again, no C<loop> argument.
2257    
2258 root 1.84 =item w->again () (C<ev::timer>, C<ev::periodic> only)
2259 root 1.38
2260     For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
2261     C<ev_TYPE_again> function.
2262    
2263 root 1.84 =item w->sweep () (C<ev::embed> only)
2264 root 1.38
2265     Invokes C<ev_embed_sweep>.
2266    
2267 root 1.84 =item w->update () (C<ev::stat> only)
2268 root 1.49
2269     Invokes C<ev_stat_stat>.
2270    
2271 root 1.38 =back
2272    
2273     =back
2274    
2275     Example: Define a class with an IO and idle watcher, start one of them in
2276     the constructor.
2277    
2278     class myclass
2279     {
2280     ev_io io; void io_cb (ev::io &w, int revents);
2281     ev_idle idle void idle_cb (ev::idle &w, int revents);
2282    
2283     myclass ();
2284     }
2285    
2286     myclass::myclass (int fd)
2287     {
2288 root 1.71 io .set <myclass, &myclass::io_cb > (this);
2289     idle.set <myclass, &myclass::idle_cb> (this);
2290    
2291 root 1.38 io.start (fd, ev::READ);
2292     }
2293 root 1.20
2294 root 1.50
2295     =head1 MACRO MAGIC
2296    
2297 root 1.84 Libev can be compiled with a variety of options, the most fundamantal
2298     of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2299     functions and callbacks have an initial C<struct ev_loop *> argument.
2300 root 1.50
2301     To make it easier to write programs that cope with either variant, the
2302     following macros are defined:
2303    
2304     =over 4
2305    
2306     =item C<EV_A>, C<EV_A_>
2307    
2308     This provides the loop I<argument> for functions, if one is required ("ev
2309     loop argument"). The C<EV_A> form is used when this is the sole argument,
2310     C<EV_A_> is used when other arguments are following. Example:
2311    
2312     ev_unref (EV_A);
2313     ev_timer_add (EV_A_ watcher);
2314     ev_loop (EV_A_ 0);
2315    
2316     It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2317     which is often provided by the following macro.
2318    
2319     =item C<EV_P>, C<EV_P_>
2320    
2321     This provides the loop I<parameter> for functions, if one is required ("ev
2322     loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2323     C<EV_P_> is used when other parameters are following. Example:
2324    
2325     // this is how ev_unref is being declared
2326     static void ev_unref (EV_P);
2327    
2328     // this is how you can declare your typical callback
2329     static void cb (EV_P_ ev_timer *w, int revents)
2330    
2331     It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2332     suitable for use with C<EV_A>.
2333    
2334     =item C<EV_DEFAULT>, C<EV_DEFAULT_>
2335    
2336     Similar to the other two macros, this gives you the value of the default
2337     loop, if multiple loops are supported ("ev loop default").
2338    
2339     =back
2340    
2341 root 1.63 Example: Declare and initialise a check watcher, utilising the above
2342 root 1.68 macros so it will work regardless of whether multiple loops are supported
2343 root 1.63 or not.
2344 root 1.50
2345     static void
2346     check_cb (EV_P_ ev_timer *w, int revents)
2347     {
2348     ev_check_stop (EV_A_ w);
2349     }
2350    
2351     ev_check check;
2352     ev_check_init (&check, check_cb);
2353     ev_check_start (EV_DEFAULT_ &check);
2354     ev_loop (EV_DEFAULT_ 0);
2355    
2356 root 1.39 =head1 EMBEDDING
2357    
2358     Libev can (and often is) directly embedded into host
2359     applications. Examples of applications that embed it include the Deliantra
2360     Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2361     and rxvt-unicode.
2362    
2363 root 1.91 The goal is to enable you to just copy the necessary files into your
2364 root 1.39 source directory without having to change even a single line in them, so
2365     you can easily upgrade by simply copying (or having a checked-out copy of
2366     libev somewhere in your source tree).
2367    
2368     =head2 FILESETS
2369    
2370     Depending on what features you need you need to include one or more sets of files
2371     in your app.
2372    
2373     =head3 CORE EVENT LOOP
2374    
2375     To include only the libev core (all the C<ev_*> functions), with manual
2376     configuration (no autoconf):
2377    
2378     #define EV_STANDALONE 1
2379     #include "ev.c"
2380    
2381     This will automatically include F<ev.h>, too, and should be done in a
2382     single C source file only to provide the function implementations. To use
2383     it, do the same for F<ev.h> in all files wishing to use this API (best
2384     done by writing a wrapper around F<ev.h> that you can include instead and
2385     where you can put other configuration options):
2386    
2387     #define EV_STANDALONE 1
2388     #include "ev.h"
2389    
2390     Both header files and implementation files can be compiled with a C++
2391     compiler (at least, thats a stated goal, and breakage will be treated
2392     as a bug).
2393    
2394     You need the following files in your source tree, or in a directory
2395     in your include path (e.g. in libev/ when using -Ilibev):
2396    
2397     ev.h
2398     ev.c
2399     ev_vars.h
2400     ev_wrap.h
2401    
2402     ev_win32.c required on win32 platforms only
2403    
2404 root 1.63 ev_select.c only when select backend is enabled (which is enabled by default)
2405 root 1.39 ev_poll.c only when poll backend is enabled (disabled by default)
2406     ev_epoll.c only when the epoll backend is enabled (disabled by default)
2407     ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2408     ev_port.c only when the solaris port backend is enabled (disabled by default)
2409    
2410     F<ev.c> includes the backend files directly when enabled, so you only need
2411 root 1.43 to compile this single file.
2412 root 1.39
2413     =head3 LIBEVENT COMPATIBILITY API
2414    
2415     To include the libevent compatibility API, also include:
2416    
2417     #include "event.c"
2418    
2419     in the file including F<ev.c>, and:
2420    
2421     #include "event.h"
2422    
2423     in the files that want to use the libevent API. This also includes F<ev.h>.
2424    
2425     You need the following additional files for this:
2426    
2427     event.h
2428     event.c
2429    
2430     =head3 AUTOCONF SUPPORT
2431    
2432     Instead of using C<EV_STANDALONE=1> and providing your config in
2433     whatever way you want, you can also C<m4_include([libev.m4])> in your
2434 root 1.43 F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2435     include F<config.h> and configure itself accordingly.
2436 root 1.39
2437     For this of course you need the m4 file:
2438    
2439     libev.m4
2440    
2441     =head2 PREPROCESSOR SYMBOLS/MACROS
2442    
2443     Libev can be configured via a variety of preprocessor symbols you have to define
2444     before including any of its files. The default is not to build for multiplicity
2445     and only include the select backend.
2446    
2447     =over 4
2448    
2449     =item EV_STANDALONE
2450    
2451     Must always be C<1> if you do not use autoconf configuration, which
2452     keeps libev from including F<config.h>, and it also defines dummy
2453     implementations for some libevent functions (such as logging, which is not
2454     supported). It will also not define any of the structs usually found in
2455     F<event.h> that are not directly supported by the libev core alone.
2456    
2457     =item EV_USE_MONOTONIC
2458    
2459     If defined to be C<1>, libev will try to detect the availability of the
2460     monotonic clock option at both compiletime and runtime. Otherwise no use
2461     of the monotonic clock option will be attempted. If you enable this, you
2462     usually have to link against librt or something similar. Enabling it when
2463 root 1.92 the functionality isn't available is safe, though, although you have
2464 root 1.39 to make sure you link against any libraries where the C<clock_gettime>
2465     function is hiding in (often F<-lrt>).
2466    
2467     =item EV_USE_REALTIME
2468    
2469     If defined to be C<1>, libev will try to detect the availability of the
2470     realtime clock option at compiletime (and assume its availability at
2471     runtime if successful). Otherwise no use of the realtime clock option will
2472     be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2473 root 1.90 (CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2474     note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2475 root 1.39
2476 root 1.97 =item EV_USE_NANOSLEEP
2477    
2478     If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2479     and will use it for delays. Otherwise it will use C<select ()>.
2480    
2481 root 1.39 =item EV_USE_SELECT
2482    
2483     If undefined or defined to be C<1>, libev will compile in support for the
2484     C<select>(2) backend. No attempt at autodetection will be done: if no
2485     other method takes over, select will be it. Otherwise the select backend
2486     will not be compiled in.
2487    
2488     =item EV_SELECT_USE_FD_SET
2489    
2490     If defined to C<1>, then the select backend will use the system C<fd_set>
2491     structure. This is useful if libev doesn't compile due to a missing
2492     C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on
2493     exotic systems. This usually limits the range of file descriptors to some
2494     low limit such as 1024 or might have other limitations (winsocket only
2495     allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2496     influence the size of the C<fd_set> used.
2497    
2498     =item EV_SELECT_IS_WINSOCKET
2499    
2500     When defined to C<1>, the select backend will assume that
2501     select/socket/connect etc. don't understand file descriptors but
2502     wants osf handles on win32 (this is the case when the select to
2503     be used is the winsock select). This means that it will call
2504     C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2505     it is assumed that all these functions actually work on fds, even
2506     on win32. Should not be defined on non-win32 platforms.
2507    
2508 root 1.112 =item EV_FD_TO_WIN32_HANDLE
2509    
2510     If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
2511     file descriptors to socket handles. When not defining this symbol (the
2512     default), then libev will call C<_get_osfhandle>, which is usually
2513     correct. In some cases, programs use their own file descriptor management,
2514     in which case they can provide this function to map fds to socket handles.
2515    
2516 root 1.39 =item EV_USE_POLL
2517    
2518     If defined to be C<1>, libev will compile in support for the C<poll>(2)
2519     backend. Otherwise it will be enabled on non-win32 platforms. It
2520     takes precedence over select.
2521    
2522     =item EV_USE_EPOLL
2523    
2524     If defined to be C<1>, libev will compile in support for the Linux
2525     C<epoll>(7) backend. Its availability will be detected at runtime,
2526     otherwise another method will be used as fallback. This is the
2527     preferred backend for GNU/Linux systems.
2528    
2529     =item EV_USE_KQUEUE
2530    
2531     If defined to be C<1>, libev will compile in support for the BSD style
2532     C<kqueue>(2) backend. Its actual availability will be detected at runtime,
2533     otherwise another method will be used as fallback. This is the preferred
2534     backend for BSD and BSD-like systems, although on most BSDs kqueue only
2535     supports some types of fds correctly (the only platform we found that
2536     supports ptys for example was NetBSD), so kqueue might be compiled in, but
2537     not be used unless explicitly requested. The best way to use it is to find
2538 root 1.41 out whether kqueue supports your type of fd properly and use an embedded
2539 root 1.39 kqueue loop.
2540    
2541     =item EV_USE_PORT
2542    
2543     If defined to be C<1>, libev will compile in support for the Solaris
2544     10 port style backend. Its availability will be detected at runtime,
2545     otherwise another method will be used as fallback. This is the preferred
2546     backend for Solaris 10 systems.
2547    
2548     =item EV_USE_DEVPOLL
2549    
2550     reserved for future expansion, works like the USE symbols above.
2551    
2552 root 1.56 =item EV_USE_INOTIFY
2553    
2554     If defined to be C<1>, libev will compile in support for the Linux inotify
2555     interface to speed up C<ev_stat> watchers. Its actual availability will
2556     be detected at runtime.
2557    
2558 root 1.39 =item EV_H
2559    
2560     The name of the F<ev.h> header file used to include it. The default if
2561 root 1.110 undefined is C<"ev.h"> in F<event.h> and F<ev.c>. This can be used to
2562     virtually rename the F<ev.h> header file in case of conflicts.
2563 root 1.39
2564     =item EV_CONFIG_H
2565    
2566     If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2567     F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2568     C<EV_H>, above.
2569    
2570     =item EV_EVENT_H
2571    
2572     Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2573 root 1.110 of how the F<event.h> header can be found, the dfeault is C<"event.h">.
2574 root 1.39
2575     =item EV_PROTOTYPES
2576    
2577     If defined to be C<0>, then F<ev.h> will not define any function
2578     prototypes, but still define all the structs and other symbols. This is
2579     occasionally useful if you want to provide your own wrapper functions
2580     around libev functions.
2581    
2582     =item EV_MULTIPLICITY
2583    
2584     If undefined or defined to C<1>, then all event-loop-specific functions
2585     will have the C<struct ev_loop *> as first argument, and you can create
2586     additional independent event loops. Otherwise there will be no support
2587     for multiple event loops and there is no first event loop pointer
2588     argument. Instead, all functions act on the single default loop.
2589    
2590 root 1.69 =item EV_MINPRI
2591    
2592     =item EV_MAXPRI
2593    
2594     The range of allowed priorities. C<EV_MINPRI> must be smaller or equal to
2595     C<EV_MAXPRI>, but otherwise there are no non-obvious limitations. You can
2596     provide for more priorities by overriding those symbols (usually defined
2597     to be C<-2> and C<2>, respectively).
2598    
2599     When doing priority-based operations, libev usually has to linearly search
2600     all the priorities, so having many of them (hundreds) uses a lot of space
2601     and time, so using the defaults of five priorities (-2 .. +2) is usually
2602     fine.
2603    
2604     If your embedding app does not need any priorities, defining these both to
2605     C<0> will save some memory and cpu.
2606    
2607 root 1.47 =item EV_PERIODIC_ENABLE
2608 root 1.39
2609 root 1.47 If undefined or defined to be C<1>, then periodic timers are supported. If
2610     defined to be C<0>, then they are not. Disabling them saves a few kB of
2611     code.
2612    
2613 root 1.67 =item EV_IDLE_ENABLE
2614    
2615     If undefined or defined to be C<1>, then idle watchers are supported. If
2616     defined to be C<0>, then they are not. Disabling them saves a few kB of
2617     code.
2618    
2619 root 1.47 =item EV_EMBED_ENABLE
2620    
2621     If undefined or defined to be C<1>, then embed watchers are supported. If
2622     defined to be C<0>, then they are not.
2623    
2624     =item EV_STAT_ENABLE
2625    
2626     If undefined or defined to be C<1>, then stat watchers are supported. If
2627     defined to be C<0>, then they are not.
2628    
2629 root 1.50 =item EV_FORK_ENABLE
2630    
2631     If undefined or defined to be C<1>, then fork watchers are supported. If
2632     defined to be C<0>, then they are not.
2633    
2634 root 1.47 =item EV_MINIMAL
2635    
2636     If you need to shave off some kilobytes of code at the expense of some
2637     speed, define this symbol to C<1>. Currently only used for gcc to override
2638     some inlining decisions, saves roughly 30% codesize of amd64.
2639 root 1.39
2640 root 1.51 =item EV_PID_HASHSIZE
2641    
2642     C<ev_child> watchers use a small hash table to distribute workload by
2643     pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2644     than enough. If you need to manage thousands of children you might want to
2645 root 1.56 increase this value (I<must> be a power of two).
2646    
2647     =item EV_INOTIFY_HASHSIZE
2648    
2649 root 1.104 C<ev_stat> watchers use a small hash table to distribute workload by
2650 root 1.56 inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2651     usually more than enough. If you need to manage thousands of C<ev_stat>
2652     watchers you might want to increase this value (I<must> be a power of
2653     two).
2654 root 1.51
2655 root 1.39 =item EV_COMMON
2656    
2657     By default, all watchers have a C<void *data> member. By redefining
2658     this macro to a something else you can include more and other types of
2659     members. You have to define it each time you include one of the files,
2660     though, and it must be identical each time.
2661    
2662     For example, the perl EV module uses something like this:
2663    
2664     #define EV_COMMON \
2665     SV *self; /* contains this struct */ \
2666     SV *cb_sv, *fh /* note no trailing ";" */
2667    
2668 root 1.44 =item EV_CB_DECLARE (type)
2669 root 1.39
2670 root 1.44 =item EV_CB_INVOKE (watcher, revents)
2671 root 1.39
2672 root 1.44 =item ev_set_cb (ev, cb)
2673 root 1.39
2674     Can be used to change the callback member declaration in each watcher,
2675     and the way callbacks are invoked and set. Must expand to a struct member
2676 root 1.93 definition and a statement, respectively. See the F<ev.h> header file for
2677 root 1.39 their default definitions. One possible use for overriding these is to
2678 root 1.44 avoid the C<struct ev_loop *> as first argument in all cases, or to use
2679     method calls instead of plain function calls in C++.
2680 root 1.39
2681 root 1.89 =head2 EXPORTED API SYMBOLS
2682    
2683     If you need to re-export the API (e.g. via a dll) and you need a list of
2684     exported symbols, you can use the provided F<Symbol.*> files which list
2685     all public symbols, one per line:
2686    
2687     Symbols.ev for libev proper
2688     Symbols.event for the libevent emulation
2689    
2690     This can also be used to rename all public symbols to avoid clashes with
2691     multiple versions of libev linked together (which is obviously bad in
2692     itself, but sometimes it is inconvinient to avoid this).
2693    
2694 root 1.92 A sed command like this will create wrapper C<#define>'s that you need to
2695 root 1.89 include before including F<ev.h>:
2696    
2697     <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2698    
2699     This would create a file F<wrap.h> which essentially looks like this:
2700    
2701     #define ev_backend myprefix_ev_backend
2702     #define ev_check_start myprefix_ev_check_start
2703     #define ev_check_stop myprefix_ev_check_stop
2704     ...
2705    
2706 root 1.39 =head2 EXAMPLES
2707    
2708     For a real-world example of a program the includes libev
2709     verbatim, you can have a look at the EV perl module
2710     (L<http://software.schmorp.de/pkg/EV.html>). It has the libev files in
2711     the F<libev/> subdirectory and includes them in the F<EV/EVAPI.h> (public
2712     interface) and F<EV.xs> (implementation) files. Only the F<EV.xs> file
2713     will be compiled. It is pretty complex because it provides its own header
2714     file.
2715    
2716     The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2717 root 1.63 that everybody includes and which overrides some configure choices:
2718 root 1.39
2719 root 1.63 #define EV_MINIMAL 1
2720 root 1.40 #define EV_USE_POLL 0
2721     #define EV_MULTIPLICITY 0
2722 root 1.63 #define EV_PERIODIC_ENABLE 0
2723     #define EV_STAT_ENABLE 0
2724     #define EV_FORK_ENABLE 0
2725 root 1.40 #define EV_CONFIG_H <config.h>
2726 root 1.63 #define EV_MINPRI 0
2727     #define EV_MAXPRI 0
2728 root 1.39
2729 root 1.40 #include "ev++.h"
2730 root 1.39
2731     And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2732    
2733 root 1.40 #include "ev_cpp.h"
2734     #include "ev.c"
2735 root 1.39
2736 root 1.46
2737     =head1 COMPLEXITIES
2738    
2739     In this section the complexities of (many of) the algorithms used inside
2740     libev will be explained. For complexity discussions about backends see the
2741     documentation for C<ev_default_init>.
2742    
2743 root 1.70 All of the following are about amortised time: If an array needs to be
2744     extended, libev needs to realloc and move the whole array, but this
2745     happens asymptotically never with higher number of elements, so O(1) might
2746     mean it might do a lengthy realloc operation in rare cases, but on average
2747     it is much faster and asymptotically approaches constant time.
2748    
2749 root 1.46 =over 4
2750    
2751     =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2752    
2753 root 1.69 This means that, when you have a watcher that triggers in one hour and
2754     there are 100 watchers that would trigger before that then inserting will
2755 root 1.106 have to skip roughly seven (C<ld 100>) of these watchers.
2756 root 1.69
2757 root 1.106 =item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2758 root 1.46
2759 root 1.106 That means that changing a timer costs less than removing/adding them
2760 root 1.69 as only the relative motion in the event queue has to be paid for.
2761    
2762 root 1.46 =item Starting io/check/prepare/idle/signal/child watchers: O(1)
2763    
2764 root 1.70 These just add the watcher into an array or at the head of a list.
2765 root 1.106
2766 root 1.46 =item Stopping check/prepare/idle watchers: O(1)
2767    
2768 root 1.56 =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2769 root 1.46
2770 root 1.69 These watchers are stored in lists then need to be walked to find the
2771     correct watcher to remove. The lists are usually short (you don't usually
2772     have many watchers waiting for the same fd or signal).
2773    
2774 root 1.106 =item Finding the next timer in each loop iteration: O(1)
2775    
2776     By virtue of using a binary heap, the next timer is always found at the
2777     beginning of the storage array.
2778 root 1.46
2779     =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2780    
2781 root 1.69 A change means an I/O watcher gets started or stopped, which requires
2782 root 1.106 libev to recalculate its status (and possibly tell the kernel, depending
2783     on backend and wether C<ev_io_set> was used).
2784 root 1.69
2785 root 1.106 =item Activating one watcher (putting it into the pending state): O(1)
2786 root 1.46
2787 root 1.69 =item Priority handling: O(number_of_priorities)
2788    
2789     Priorities are implemented by allocating some space for each
2790     priority. When doing priority-based operations, libev usually has to
2791 root 1.106 linearly search all the priorities, but starting/stopping and activating
2792     watchers becomes O(1) w.r.t. prioritiy handling.
2793 root 1.69
2794 root 1.46 =back
2795    
2796    
2797 root 1.112 =head1 Win32 platform limitations and workarounds
2798    
2799     Win32 doesn't support any of the standards (e.g. POSIX) that libev
2800     requires, and its I/O model is fundamentally incompatible with the POSIX
2801     model. Libev still offers limited functionality on this platform in
2802     the form of the C<EVBACKEND_SELECT> backend, and only supports socket
2803     descriptors. This only applies when using Win32 natively, not when using
2804     e.g. cygwin.
2805    
2806     There is no supported compilation method available on windows except
2807     embedding it into other applications.
2808    
2809     Due to the many, low, and arbitrary limits on the win32 platform and the
2810     abysmal performance of winsockets, using a large number of sockets is not
2811     recommended (and not reasonable). If your program needs to use more than
2812     a hundred or so sockets, then likely it needs to use a totally different
2813     implementation for windows, as libev offers the POSIX model, which cannot
2814     be implemented efficiently on windows (microsoft monopoly games).
2815    
2816     =over 4
2817    
2818     =item The winsocket select function
2819    
2820     The winsocket C<select> function doesn't follow POSIX in that it requires
2821     socket I<handles> and not socket I<file descriptors>. This makes select
2822     very inefficient, and also requires a mapping from file descriptors
2823     to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>,
2824     C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor
2825     symbols for more info.
2826    
2827     The configuration for a "naked" win32 using the microsoft runtime
2828     libraries and raw winsocket select is:
2829    
2830     #define EV_USE_SELECT 1
2831     #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
2832    
2833     Note that winsockets handling of fd sets is O(n), so you can easily get a
2834     complexity in the O(n²) range when using win32.
2835    
2836     =item Limited number of file descriptors
2837    
2838     Windows has numerous arbitrary (and low) limits on things. Early versions
2839     of winsocket's select only supported waiting for a max. of C<64> handles
2840     (probably owning to the fact that all windows kernels can only wait for
2841     C<64> things at the same time internally; microsoft recommends spawning a
2842     chain of threads and wait for 63 handles and the previous thread in each).
2843    
2844     Newer versions support more handles, but you need to define C<FD_SETSIZE>
2845     to some high number (e.g. C<2048>) before compiling the winsocket select
2846     call (which might be in libev or elsewhere, for example, perl does its own
2847     select emulation on windows).
2848    
2849     Another limit is the number of file descriptors in the microsoft runtime
2850     libraries, which by default is C<64> (there must be a hidden I<64> fetish
2851     or something like this inside microsoft). You can increase this by calling
2852     C<_setmaxstdio>, which can increase this limit to C<2048> (another
2853     arbitrary limit), but is broken in many versions of the microsoft runtime
2854     libraries.
2855    
2856     This might get you to about C<512> or C<2048> sockets (depending on
2857     windows version and/or the phase of the moon). To get more, you need to
2858     wrap all I/O functions and provide your own fd management, but the cost of
2859     calling select (O(n²)) will likely make this unworkable.
2860    
2861     =back
2862    
2863    
2864 root 1.1 =head1 AUTHOR
2865    
2866     Marc Lehmann <libev@schmorp.de>.
2867