ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
(Generate patch)

Comparing libev/ev.pod (file contents):
Revision 1.30 by root, Fri Nov 23 04:36:03 2007 UTC vs.
Revision 1.118 by root, Thu Jan 10 06:00:55 2008 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines