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

Comparing libev/ev.pod (file contents):
Revision 1.100 by root, Sat Dec 22 11:49:17 2007 UTC vs.
Revision 1.178 by root, Sat Sep 13 18:25:50 2008 UTC

2 2
3libev - a high performance full-featured event loop written in C 3libev - a high performance full-featured event loop written in C
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 #include <ev.h> 7 #include <ev.h>
8 8
9=head1 EXAMPLE PROGRAM 9=head2 EXAMPLE PROGRAM
10 10
11 // a single header file is required
11 #include <ev.h> 12 #include <ev.h>
12 13
14 // every watcher type has its own typedef'd struct
15 // with the name ev_<type>
13 ev_io stdin_watcher; 16 ev_io stdin_watcher;
14 ev_timer timeout_watcher; 17 ev_timer timeout_watcher;
15 18
16 /* called when data readable on stdin */ 19 // all watcher callbacks have a similar signature
20 // this callback is called when data is readable on stdin
17 static void 21 static void
18 stdin_cb (EV_P_ struct ev_io *w, int revents) 22 stdin_cb (EV_P_ struct ev_io *w, int revents)
19 { 23 {
20 /* puts ("stdin ready"); */ 24 puts ("stdin ready");
21 ev_io_stop (EV_A_ w); /* just a syntax example */ 25 // for one-shot events, one must manually stop the watcher
22 ev_unloop (EV_A_ EVUNLOOP_ALL); /* leave all loop calls */ 26 // with its corresponding stop function.
27 ev_io_stop (EV_A_ w);
28
29 // this causes all nested ev_loop's to stop iterating
30 ev_unloop (EV_A_ EVUNLOOP_ALL);
23 } 31 }
24 32
33 // another callback, this time for a time-out
25 static void 34 static void
26 timeout_cb (EV_P_ struct ev_timer *w, int revents) 35 timeout_cb (EV_P_ struct ev_timer *w, int revents)
27 { 36 {
28 /* puts ("timeout"); */ 37 puts ("timeout");
29 ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */ 38 // this causes the innermost ev_loop to stop iterating
39 ev_unloop (EV_A_ EVUNLOOP_ONE);
30 } 40 }
31 41
32 int 42 int
33 main (void) 43 main (void)
34 { 44 {
45 // use the default event loop unless you have special needs
35 struct ev_loop *loop = ev_default_loop (0); 46 struct ev_loop *loop = ev_default_loop (0);
36 47
37 /* initialise an io watcher, then start it */ 48 // initialise an io watcher, then start it
49 // this one will watch for stdin to become readable
38 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); 50 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
39 ev_io_start (loop, &stdin_watcher); 51 ev_io_start (loop, &stdin_watcher);
40 52
53 // initialise a timer watcher, then start it
41 /* simple non-repeating 5.5 second timeout */ 54 // simple non-repeating 5.5 second timeout
42 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); 55 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
43 ev_timer_start (loop, &timeout_watcher); 56 ev_timer_start (loop, &timeout_watcher);
44 57
45 /* loop till timeout or data ready */ 58 // now wait for events to arrive
46 ev_loop (loop, 0); 59 ev_loop (loop, 0);
47 60
61 // unloop was called, so exit
48 return 0; 62 return 0;
49 } 63 }
50 64
51=head1 DESCRIPTION 65=head1 DESCRIPTION
52 66
53The newest version of this document is also available as a html-formatted 67The newest version of this document is also available as an html-formatted
54web page you might find easier to navigate when reading it for the first 68web page you might find easier to navigate when reading it for the first
55time: L<http://cvs.schmorp.de/libev/ev.html>. 69time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
56 70
57Libev is an event loop: you register interest in certain events (such as a 71Libev is an event loop: you register interest in certain events (such as a
58file descriptor being readable or a timeout occurring), and it will manage 72file descriptor being readable or a timeout occurring), and it will manage
59these event sources and provide your program with events. 73these event sources and provide your program with events.
60 74
65You register interest in certain events by registering so-called I<event 79You register interest in certain events by registering so-called I<event
66watchers>, which are relatively small C structures you initialise with the 80watchers>, which are relatively small C structures you initialise with the
67details of the event, and then hand it over to libev by I<starting> the 81details of the event, and then hand it over to libev by I<starting> the
68watcher. 82watcher.
69 83
70=head1 FEATURES 84=head2 FEATURES
71 85
72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 86Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 87BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
74for file descriptor events (C<ev_io>), the Linux C<inotify> interface 88for file descriptor events (C<ev_io>), the Linux C<inotify> interface
75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 89(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
82 96
83It also is quite fast (see this 97It also is quite fast (see this
84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 98L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
85for example). 99for example).
86 100
87=head1 CONVENTIONS 101=head2 CONVENTIONS
88 102
89Libev is very configurable. In this manual the default configuration will 103Libev is very configurable. In this manual the default (and most common)
90be described, which supports multiple event loops. For more info about 104configuration will be described, which supports multiple event loops. For
91various configuration options please have a look at B<EMBED> section in 105more info about various configuration options please have a look at
92this manual. If libev was configured without support for multiple event 106B<EMBED> section in this manual. If libev was configured without support
93loops, then all functions taking an initial argument of name C<loop> 107for multiple event loops, then all functions taking an initial argument of
94(which is always of type C<struct ev_loop *>) will not have this argument. 108name C<loop> (which is always of type C<struct ev_loop *>) will not have
109this argument.
95 110
96=head1 TIME REPRESENTATION 111=head2 TIME REPRESENTATION
97 112
98Libev represents time as a single floating point number, representing the 113Libev represents time as a single floating point number, representing the
99(fractional) number of seconds since the (POSIX) epoch (somewhere near 114(fractional) number of seconds since the (POSIX) epoch (somewhere near
100the beginning of 1970, details are complicated, don't ask). This type is 115the beginning of 1970, details are complicated, don't ask). This type is
101called C<ev_tstamp>, which is what you should use too. It usually aliases 116called C<ev_tstamp>, which is what you should use too. It usually aliases
102to the C<double> type in C, and when you need to do any calculations on 117to 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 118it, you should treat it as some floating point value. Unlike the name
104component C<stamp> might indicate, it is also used for time differences 119component C<stamp> might indicate, it is also used for time differences
105throughout libev. 120throughout libev.
121
122=head1 ERROR HANDLING
123
124Libev knows three classes of errors: operating system errors, usage errors
125and internal errors (bugs).
126
127When libev catches an operating system error it cannot handle (for example
128a system call indicating a condition libev cannot fix), it calls the callback
129set via C<ev_set_syserr_cb>, which is supposed to fix the problem or
130abort. The default is to print a diagnostic message and to call C<abort
131()>.
132
133When libev detects a usage error such as a negative timer interval, then
134it will print a diagnostic message and abort (via the C<assert> mechanism,
135so C<NDEBUG> will disable this checking): these are programming errors in
136the libev caller and need to be fixed there.
137
138Libev also has a few internal error-checking C<assert>ions, and also has
139extensive consistency checking code. These do not trigger under normal
140circumstances, as they indicate either a bug in libev or worse.
141
106 142
107=head1 GLOBAL FUNCTIONS 143=head1 GLOBAL FUNCTIONS
108 144
109These functions can be called anytime, even before initialising the 145These functions can be called anytime, even before initialising the
110library in any way. 146library in any way.
119 155
120=item ev_sleep (ev_tstamp interval) 156=item ev_sleep (ev_tstamp interval)
121 157
122Sleep for the given interval: The current thread will be blocked until 158Sleep for the given interval: The current thread will be blocked until
123either it is interrupted or the given time interval has passed. Basically 159either it is interrupted or the given time interval has passed. Basically
124this is a subsecond-resolution C<sleep ()>. 160this is a sub-second-resolution C<sleep ()>.
125 161
126=item int ev_version_major () 162=item int ev_version_major ()
127 163
128=item int ev_version_minor () 164=item int ev_version_minor ()
129 165
142not a problem. 178not a problem.
143 179
144Example: Make sure we haven't accidentally been linked against the wrong 180Example: Make sure we haven't accidentally been linked against the wrong
145version. 181version.
146 182
147 assert (("libev version mismatch", 183 assert (("libev version mismatch",
148 ev_version_major () == EV_VERSION_MAJOR 184 ev_version_major () == EV_VERSION_MAJOR
149 && ev_version_minor () >= EV_VERSION_MINOR)); 185 && ev_version_minor () >= EV_VERSION_MINOR));
150 186
151=item unsigned int ev_supported_backends () 187=item unsigned int ev_supported_backends ()
152 188
153Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*> 189Return the set of all backends (i.e. their corresponding C<EV_BACKEND_*>
154value) compiled into this binary of libev (independent of their 190value) compiled into this binary of libev (independent of their
156a description of the set values. 192a description of the set values.
157 193
158Example: make sure we have the epoll method, because yeah this is cool and 194Example: 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 195a must have and can we have a torrent of it please!!!11
160 196
161 assert (("sorry, no epoll, no sex", 197 assert (("sorry, no epoll, no sex",
162 ev_supported_backends () & EVBACKEND_EPOLL)); 198 ev_supported_backends () & EVBACKEND_EPOLL));
163 199
164=item unsigned int ev_recommended_backends () 200=item unsigned int ev_recommended_backends ()
165 201
166Return the set of all backends compiled into this binary of libev and also 202Return 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 203recommended for this platform. This set is often smaller than the one
168returned by C<ev_supported_backends>, as for example kqueue is broken on 204returned by C<ev_supported_backends>, as for example kqueue is broken on
169most BSDs and will not be autodetected unless you explicitly request it 205most BSDs and will not be auto-detected unless you explicitly request it
170(assuming you know what you are doing). This is the set of backends that 206(assuming you know what you are doing). This is the set of backends that
171libev will probe for if you specify no backends explicitly. 207libev will probe for if you specify no backends explicitly.
172 208
173=item unsigned int ev_embeddable_backends () 209=item unsigned int ev_embeddable_backends ()
174 210
181See the description of C<ev_embed> watchers for more info. 217See the description of C<ev_embed> watchers for more info.
182 218
183=item ev_set_allocator (void *(*cb)(void *ptr, long size)) 219=item ev_set_allocator (void *(*cb)(void *ptr, long size))
184 220
185Sets the allocation function to use (the prototype is similar - the 221Sets the allocation function to use (the prototype is similar - the
186semantics is identical - to the realloc C function). It is used to 222semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
187allocate and free memory (no surprises here). If it returns zero when 223used to allocate and free memory (no surprises here). If it returns zero
188memory needs to be allocated, the library might abort or take some 224when memory needs to be allocated (C<size != 0>), the library might abort
189potentially destructive action. The default is your system realloc 225or take some potentially destructive action.
190function. 226
227Since some systems (at least OpenBSD and Darwin) fail to implement
228correct C<realloc> semantics, libev will use a wrapper around the system
229C<realloc> and C<free> functions by default.
191 230
192You could override this function in high-availability programs to, say, 231You could override this function in high-availability programs to, say,
193free some memory if it cannot allocate memory, to use a special allocator, 232free some memory if it cannot allocate memory, to use a special allocator,
194or even to sleep a while and retry until some memory is available. 233or even to sleep a while and retry until some memory is available.
195 234
196Example: Replace the libev allocator with one that waits a bit and then 235Example: Replace the libev allocator with one that waits a bit and then
197retries). 236retries (example requires a standards-compliant C<realloc>).
198 237
199 static void * 238 static void *
200 persistent_realloc (void *ptr, size_t size) 239 persistent_realloc (void *ptr, size_t size)
201 { 240 {
202 for (;;) 241 for (;;)
213 ... 252 ...
214 ev_set_allocator (persistent_realloc); 253 ev_set_allocator (persistent_realloc);
215 254
216=item ev_set_syserr_cb (void (*cb)(const char *msg)); 255=item ev_set_syserr_cb (void (*cb)(const char *msg));
217 256
218Set the callback function to call on a retryable syscall error (such 257Set the callback function to call on a retryable system call error (such
219as failed select, poll, epoll_wait). The message is a printable string 258as failed select, poll, epoll_wait). The message is a printable string
220indicating the system call or subsystem causing the problem. If this 259indicating the system call or subsystem causing the problem. If this
221callback is set, then libev will expect it to remedy the sitution, no 260callback is set, then libev will expect it to remedy the situation, no
222matter what, when it returns. That is, libev will generally retry the 261matter what, when it returns. That is, libev will generally retry the
223requested operation, or, if the condition doesn't go away, do bad stuff 262requested operation, or, if the condition doesn't go away, do bad stuff
224(such as abort). 263(such as abort).
225 264
226Example: This is basically the same thing that libev does internally, too. 265Example: This is basically the same thing that libev does internally, too.
240=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 279=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
241 280
242An event loop is described by a C<struct ev_loop *>. The library knows two 281An event loop is described by a C<struct ev_loop *>. The library knows two
243types of such loops, the I<default> loop, which supports signals and child 282types of such loops, the I<default> loop, which supports signals and child
244events, and dynamically created loops which do not. 283events, and dynamically created loops which do not.
245
246If you use threads, a common model is to run the default event loop
247in your main thread (or in a separate thread) and for each thread you
248create, you also create another event loop. Libev itself does no locking
249whatsoever, so if you mix calls to the same event loop in different
250threads, make sure you lock (this is usually a bad idea, though, even if
251done correctly, because it's hideous and inefficient).
252 284
253=over 4 285=over 4
254 286
255=item struct ev_loop *ev_default_loop (unsigned int flags) 287=item struct ev_loop *ev_default_loop (unsigned int flags)
256 288
260flags. If that is troubling you, check C<ev_backend ()> afterwards). 292flags. If that is troubling you, check C<ev_backend ()> afterwards).
261 293
262If you don't know what event loop to use, use the one returned from this 294If you don't know what event loop to use, use the one returned from this
263function. 295function.
264 296
297Note that this function is I<not> thread-safe, so if you want to use it
298from multiple threads, you have to lock (note also that this is unlikely,
299as loops cannot bes hared easily between threads anyway).
300
301The default loop is the only loop that can handle C<ev_signal> and
302C<ev_child> watchers, and to do this, it always registers a handler
303for C<SIGCHLD>. If this is a problem for your application you can either
304create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
305can simply overwrite the C<SIGCHLD> signal handler I<after> calling
306C<ev_default_init>.
307
265The flags argument can be used to specify special behaviour or specific 308The flags argument can be used to specify special behaviour or specific
266backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). 309backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
267 310
268The following flags are supported: 311The following flags are supported:
269 312
274The default flags value. Use this if you have no clue (it's the right 317The default flags value. Use this if you have no clue (it's the right
275thing, believe me). 318thing, believe me).
276 319
277=item C<EVFLAG_NOENV> 320=item C<EVFLAG_NOENV>
278 321
279If this flag bit is ored into the flag value (or the program runs setuid 322If this flag bit is or'ed into the flag value (or the program runs setuid
280or setgid) then libev will I<not> look at the environment variable 323or setgid) then libev will I<not> look at the environment variable
281C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 324C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
282override the flags completely if it is found in the environment. This is 325override the flags completely if it is found in the environment. This is
283useful to try out specific backends to test their performance, or to work 326useful to try out specific backends to test their performance, or to work
284around bugs. 327around bugs.
290enabling this flag. 333enabling this flag.
291 334
292This works by calling C<getpid ()> on every iteration of the loop, 335This works by calling C<getpid ()> on every iteration of the loop,
293and thus this might slow down your event loop if you do a lot of loop 336and thus this might slow down your event loop if you do a lot of loop
294iterations and little real work, but is usually not noticeable (on my 337iterations and little real work, but is usually not noticeable (on my
295Linux system for example, C<getpid> is actually a simple 5-insn sequence 338GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence
296without a syscall and thus I<very> fast, but my Linux system also has 339without a system call and thus I<very> fast, but my GNU/Linux system also has
297C<pthread_atfork> which is even faster). 340C<pthread_atfork> which is even faster).
298 341
299The big advantage of this flag is that you can forget about fork (and 342The big advantage of this flag is that you can forget about fork (and
300forget about forgetting to tell libev about forking) when you use this 343forget about forgetting to tell libev about forking) when you use this
301flag. 344flag.
302 345
303This flag setting cannot be overriden or specified in the C<LIBEV_FLAGS> 346This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
304environment variable. 347environment variable.
305 348
306=item C<EVBACKEND_SELECT> (value 1, portable select backend) 349=item C<EVBACKEND_SELECT> (value 1, portable select backend)
307 350
308This is your standard select(2) backend. Not I<completely> standard, as 351This is your standard select(2) backend. Not I<completely> standard, as
309libev tries to roll its own fd_set with no limits on the number of fds, 352libev tries to roll its own fd_set with no limits on the number of fds,
310but if that fails, expect a fairly low limit on the number of fds when 353but if that fails, expect a fairly low limit on the number of fds when
311using this backend. It doesn't scale too well (O(highest_fd)), but its usually 354using this backend. It doesn't scale too well (O(highest_fd)), but its
312the fastest backend for a low number of fds. 355usually the fastest backend for a low number of (low-numbered :) fds.
356
357To get good performance out of this backend you need a high amount of
358parallelism (most of the file descriptors should be busy). If you are
359writing a server, you should C<accept ()> in a loop to accept as many
360connections as possible during one iteration. You might also want to have
361a look at C<ev_set_io_collect_interval ()> to increase the amount of
362readiness notifications you get per iteration.
313 363
314=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) 364=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
315 365
316And this is your standard poll(2) backend. It's more complicated than 366And this is your standard poll(2) backend. It's more complicated
317select, but handles sparse fds better and has no artificial limit on the 367than select, but handles sparse fds better and has no artificial
318number of fds you can use (except it will slow down considerably with a 368limit on the number of fds you can use (except it will slow down
319lot of inactive fds). It scales similarly to select, i.e. O(total_fds). 369considerably with a lot of inactive fds). It scales similarly to select,
370i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
371performance tips.
320 372
321=item C<EVBACKEND_EPOLL> (value 4, Linux) 373=item C<EVBACKEND_EPOLL> (value 4, Linux)
322 374
323For few fds, this backend is a bit little slower than poll and select, 375For few fds, this backend is a bit little slower than poll and select,
324but it scales phenomenally better. While poll and select usually scale 376but it scales phenomenally better. While poll and select usually scale
325like O(total_fds) where n is the total number of fds (or the highest fd), 377like O(total_fds) where n is the total number of fds (or the highest fd),
326epoll scales either O(1) or O(active_fds). The epoll design has a number 378epoll scales either O(1) or O(active_fds). The epoll design has a number
327of shortcomings, such as silently dropping events in some hard-to-detect 379of shortcomings, such as silently dropping events in some hard-to-detect
328cases and rewiring a syscall per fd change, no fork support and bad 380cases and requiring a system call per fd change, no fork support and bad
329support for dup: 381support for dup.
330 382
331While stopping, setting and starting an I/O watcher in the same iteration 383While stopping, setting and starting an I/O watcher in the same iteration
332will result in some caching, there is still a syscall per such incident 384will result in some caching, there is still a system call per such incident
333(because the fd could point to a different file description now), so its 385(because the fd could point to a different file description now), so its
334best to avoid that. Also, C<dup ()>'ed file descriptors might not work 386best to avoid that. Also, C<dup ()>'ed file descriptors might not work
335very well if you register events for both fds. 387very well if you register events for both fds.
336 388
337Please note that epoll sometimes generates spurious notifications, so you 389Please note that epoll sometimes generates spurious notifications, so you
338need to use non-blocking I/O or other means to avoid blocking when no data 390need to use non-blocking I/O or other means to avoid blocking when no data
339(or space) is available. 391(or space) is available.
340 392
393Best performance from this backend is achieved by not unregistering all
394watchers for a file descriptor until it has been closed, if possible, i.e.
395keep at least one watcher active per fd at all times.
396
397While nominally embeddable in other event loops, this feature is broken in
398all kernel versions tested so far.
399
341=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 400=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
342 401
343Kqueue deserves special mention, as at the time of this writing, it 402Kqueue deserves special mention, as at the time of this writing, it
344was broken on all BSDs except NetBSD (usually it doesn't work reliably 403was broken on all BSDs except NetBSD (usually it doesn't work reliably
345with anything but sockets and pipes, except on Darwin, where of course 404with anything but sockets and pipes, except on Darwin, where of course
346it's completely useless). For this reason it's not being "autodetected" 405it's completely useless). For this reason it's not being "auto-detected"
347unless you explicitly specify it explicitly in the flags (i.e. using 406unless you explicitly specify it explicitly in the flags (i.e. using
348C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) 407C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
349system like NetBSD. 408system like NetBSD.
350 409
351You still can embed kqueue into a normal poll or select backend and use it 410You still can embed kqueue into a normal poll or select backend and use it
353the target platform). See C<ev_embed> watchers for more info. 412the target platform). See C<ev_embed> watchers for more info.
354 413
355It scales in the same way as the epoll backend, but the interface to the 414It scales in the same way as the epoll backend, but the interface to the
356kernel is more efficient (which says nothing about its actual speed, of 415kernel is more efficient (which says nothing about its actual speed, of
357course). While stopping, setting and starting an I/O watcher does never 416course). While stopping, setting and starting an I/O watcher does never
358cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to 417cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
359two event changes per incident, support for C<fork ()> is very bad and it 418two event changes per incident, support for C<fork ()> is very bad and it
360drops fds silently in similarly hard-to-detect cases. 419drops fds silently in similarly hard-to-detect cases.
361 420
421This backend usually performs well under most conditions.
422
423While nominally embeddable in other event loops, this doesn't work
424everywhere, so you might need to test for this. And since it is broken
425almost everywhere, you should only use it when you have a lot of sockets
426(for which it usually works), by embedding it into another event loop
427(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
428sockets.
429
362=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 430=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
363 431
364This is not implemented yet (and might never be). 432This is not implemented yet (and might never be, unless you send me an
433implementation). According to reports, C</dev/poll> only supports sockets
434and is not embeddable, which would limit the usefulness of this backend
435immensely.
365 436
366=item C<EVBACKEND_PORT> (value 32, Solaris 10) 437=item C<EVBACKEND_PORT> (value 32, Solaris 10)
367 438
368This uses the Solaris 10 event port mechanism. As with everything on Solaris, 439This uses the Solaris 10 event port mechanism. As with everything on Solaris,
369it's really slow, but it still scales very well (O(active_fds)). 440it's really slow, but it still scales very well (O(active_fds)).
370 441
371Please note that solaris event ports can deliver a lot of spurious 442Please note that Solaris event ports can deliver a lot of spurious
372notifications, so you need to use non-blocking I/O or other means to avoid 443notifications, so you need to use non-blocking I/O or other means to avoid
373blocking when no data (or space) is available. 444blocking when no data (or space) is available.
445
446While this backend scales well, it requires one system call per active
447file descriptor per loop iteration. For small and medium numbers of file
448descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
449might perform better.
450
451On the positive side, ignoring the spurious readiness notifications, this
452backend actually performed to specification in all tests and is fully
453embeddable, which is a rare feat among the OS-specific backends.
374 454
375=item C<EVBACKEND_ALL> 455=item C<EVBACKEND_ALL>
376 456
377Try all backends (even potentially broken ones that wouldn't be tried 457Try all backends (even potentially broken ones that wouldn't be tried
378with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 458with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
379C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 459C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
380 460
461It is definitely not recommended to use this flag.
462
381=back 463=back
382 464
383If one or more of these are ored into the flags value, then only these 465If one or more of these are or'ed into the flags value, then only these
384backends will be tried (in the reverse order as given here). If none are 466backends will be tried (in the reverse order as listed here). If none are
385specified, most compiled-in backend will be tried, usually in reverse 467specified, all backends in C<ev_recommended_backends ()> will be tried.
386order of their flag values :)
387 468
388The most typical usage is like this: 469The most typical usage is like this:
389 470
390 if (!ev_default_loop (0)) 471 if (!ev_default_loop (0))
391 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 472 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
392 473
393Restrict libev to the select and poll backends, and do not allow 474Restrict libev to the select and poll backends, and do not allow
394environment settings to be taken into account: 475environment settings to be taken into account:
395 476
396 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV); 477 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
397 478
398Use whatever libev has to offer, but make sure that kqueue is used if 479Use whatever libev has to offer, but make sure that kqueue is used if
399available (warning, breaks stuff, best use only with your own private 480available (warning, breaks stuff, best use only with your own private
400event loop and only if you know the OS supports your types of fds): 481event loop and only if you know the OS supports your types of fds):
401 482
402 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 483 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
403 484
404=item struct ev_loop *ev_loop_new (unsigned int flags) 485=item struct ev_loop *ev_loop_new (unsigned int flags)
405 486
406Similar to C<ev_default_loop>, but always creates a new event loop that is 487Similar to C<ev_default_loop>, but always creates a new event loop that is
407always distinct from the default loop. Unlike the default loop, it cannot 488always distinct from the default loop. Unlike the default loop, it cannot
408handle signal and child watchers, and attempts to do so will be greeted by 489handle signal and child watchers, and attempts to do so will be greeted by
409undefined behaviour (or a failed assertion if assertions are enabled). 490undefined behaviour (or a failed assertion if assertions are enabled).
410 491
492Note that this function I<is> thread-safe, and the recommended way to use
493libev with threads is indeed to create one loop per thread, and using the
494default loop in the "main" or "initial" thread.
495
411Example: Try to create a event loop that uses epoll and nothing else. 496Example: Try to create a event loop that uses epoll and nothing else.
412 497
413 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 498 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
414 if (!epoller) 499 if (!epoller)
415 fatal ("no epoll found here, maybe it hides under your chair"); 500 fatal ("no epoll found here, maybe it hides under your chair");
416 501
417=item ev_default_destroy () 502=item ev_default_destroy ()
418 503
419Destroys the default loop again (frees all memory and kernel state 504Destroys the default loop again (frees all memory and kernel state
420etc.). None of the active event watchers will be stopped in the normal 505etc.). None of the active event watchers will be stopped in the normal
421sense, so e.g. C<ev_is_active> might still return true. It is your 506sense, so e.g. C<ev_is_active> might still return true. It is your
422responsibility to either stop all watchers cleanly yoursef I<before> 507responsibility to either stop all watchers cleanly yourself I<before>
423calling this function, or cope with the fact afterwards (which is usually 508calling this function, or cope with the fact afterwards (which is usually
424the easiest thing, you can just ignore the watchers and/or C<free ()> them 509the easiest thing, you can just ignore the watchers and/or C<free ()> them
425for example). 510for example).
426 511
427Note that certain global state, such as signal state, will not be freed by 512Note that certain global state, such as signal state, will not be freed by
438Like C<ev_default_destroy>, but destroys an event loop created by an 523Like C<ev_default_destroy>, but destroys an event loop created by an
439earlier call to C<ev_loop_new>. 524earlier call to C<ev_loop_new>.
440 525
441=item ev_default_fork () 526=item ev_default_fork ()
442 527
528This function sets a flag that causes subsequent C<ev_loop> iterations
443This function reinitialises the kernel state for backends that have 529to reinitialise the kernel state for backends that have one. Despite the
444one. Despite the name, you can call it anytime, but it makes most sense 530name, you can call it anytime, but it makes most sense after forking, in
445after forking, in either the parent or child process (or both, but that 531the child process (or both child and parent, but that again makes little
446again makes little sense). 532sense). You I<must> call it in the child before using any of the libev
533functions, and it will only take effect at the next C<ev_loop> iteration.
447 534
448You I<must> call this function in the child process after forking if and 535On the other hand, you only need to call this function in the child
449only if you want to use the event library in both processes. If you just 536process if and only if you want to use the event library in the child. If
450fork+exec, you don't have to call it. 537you just fork+exec, you don't have to call it at all.
451 538
452The function itself is quite fast and it's usually not a problem to call 539The function itself is quite fast and it's usually not a problem to call
453it just in case after a fork. To make this easy, the function will fit in 540it just in case after a fork. To make this easy, the function will fit in
454quite nicely into a call to C<pthread_atfork>: 541quite nicely into a call to C<pthread_atfork>:
455 542
456 pthread_atfork (0, 0, ev_default_fork); 543 pthread_atfork (0, 0, ev_default_fork);
457 544
458At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
459without calling this function, so if you force one of those backends you
460do not need to care.
461
462=item ev_loop_fork (loop) 545=item ev_loop_fork (loop)
463 546
464Like C<ev_default_fork>, but acts on an event loop created by 547Like C<ev_default_fork>, but acts on an event loop created by
465C<ev_loop_new>. Yes, you have to call this on every allocated event loop 548C<ev_loop_new>. Yes, you have to call this on every allocated event loop
466after fork, and how you do this is entirely your own problem. 549after fork, and how you do this is entirely your own problem.
550
551=item int ev_is_default_loop (loop)
552
553Returns true when the given loop actually is the default loop, false otherwise.
467 554
468=item unsigned int ev_loop_count (loop) 555=item unsigned int ev_loop_count (loop)
469 556
470Returns the count of loop iterations for the loop, which is identical to 557Returns the count of loop iterations for the loop, which is identical to
471the number of times libev did poll for new events. It starts at C<0> and 558the number of times libev did poll for new events. It starts at C<0> and
486received events and started processing them. This timestamp does not 573received events and started processing them. This timestamp does not
487change as long as callbacks are being processed, and this is also the base 574change as long as callbacks are being processed, and this is also the base
488time used for relative timers. You can treat it as the timestamp of the 575time used for relative timers. You can treat it as the timestamp of the
489event occurring (or more correctly, libev finding out about it). 576event occurring (or more correctly, libev finding out about it).
490 577
578=item ev_now_update (loop)
579
580Establishes the current time by querying the kernel, updating the time
581returned by C<ev_now ()> in the progress. This is a costly operation and
582is usually done automatically within C<ev_loop ()>.
583
584This function is rarely useful, but when some event callback runs for a
585very long time without entering the event loop, updating libev's idea of
586the current time is a good idea.
587
588See also "The special problem of time updates" in the C<ev_timer> section.
589
491=item ev_loop (loop, int flags) 590=item ev_loop (loop, int flags)
492 591
493Finally, this is it, the event handler. This function usually is called 592Finally, this is it, the event handler. This function usually is called
494after you initialised all your watchers and you want to start handling 593after you initialised all your watchers and you want to start handling
495events. 594events.
506A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 605A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
507those events and any outstanding ones, but will not block your process in 606those events and any outstanding ones, but will not block your process in
508case there are no events and will return after one iteration of the loop. 607case there are no events and will return after one iteration of the loop.
509 608
510A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 609A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
511neccessary) and will handle those and any outstanding ones. It will block 610necessary) and will handle those and any outstanding ones. It will block
512your process until at least one new event arrives, and will return after 611your process until at least one new event arrives, and will return after
513one iteration of the loop. This is useful if you are waiting for some 612one iteration of the loop. This is useful if you are waiting for some
514external event in conjunction with something not expressible using other 613external event in conjunction with something not expressible using other
515libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is 614libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
516usually a better approach for this kind of thing. 615usually a better approach for this kind of thing.
517 616
518Here are the gory details of what C<ev_loop> does: 617Here are the gory details of what C<ev_loop> does:
519 618
520 - Before the first iteration, call any pending watchers. 619 - Before the first iteration, call any pending watchers.
521 * If there are no active watchers (reference count is zero), return. 620 * If EVFLAG_FORKCHECK was used, check for a fork.
522 - Queue all prepare watchers and then call all outstanding watchers. 621 - If a fork was detected (by any means), queue and call all fork watchers.
622 - Queue and call all prepare watchers.
523 - If we have been forked, recreate the kernel state. 623 - If we have been forked, detach and recreate the kernel state
624 as to not disturb the other process.
524 - Update the kernel state with all outstanding changes. 625 - Update the kernel state with all outstanding changes.
525 - Update the "event loop time". 626 - Update the "event loop time" (ev_now ()).
526 - Calculate for how long to block. 627 - Calculate for how long to sleep or block, if at all
628 (active idle watchers, EVLOOP_NONBLOCK or not having
629 any active watchers at all will result in not sleeping).
630 - Sleep if the I/O and timer collect interval say so.
527 - Block the process, waiting for any events. 631 - Block the process, waiting for any events.
528 - Queue all outstanding I/O (fd) events. 632 - Queue all outstanding I/O (fd) events.
529 - Update the "event loop time" and do time jump handling. 633 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
530 - Queue all outstanding timers. 634 - Queue all outstanding timers.
531 - Queue all outstanding periodics. 635 - Queue all outstanding periodics.
532 - If no events are pending now, queue all idle watchers. 636 - Unless any events are pending now, queue all idle watchers.
533 - Queue all check watchers. 637 - Queue all check watchers.
534 - Call all queued watchers in reverse order (i.e. check watchers first). 638 - Call all queued watchers in reverse order (i.e. check watchers first).
535 Signals and child watchers are implemented as I/O watchers, and will 639 Signals and child watchers are implemented as I/O watchers, and will
536 be handled here by queueing them when their watcher gets executed. 640 be handled here by queueing them when their watcher gets executed.
537 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 641 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
538 were used, return, otherwise continue with step *. 642 were used, or there are no active watchers, return, otherwise
643 continue with step *.
539 644
540Example: Queue some jobs and then loop until no events are outsanding 645Example: Queue some jobs and then loop until no events are outstanding
541anymore. 646anymore.
542 647
543 ... queue jobs here, make sure they register event watchers as long 648 ... queue jobs here, make sure they register event watchers as long
544 ... as they still have work to do (even an idle watcher will do..) 649 ... as they still have work to do (even an idle watcher will do..)
545 ev_loop (my_loop, 0); 650 ev_loop (my_loop, 0);
546 ... jobs done. yeah! 651 ... jobs done or somebody called unloop. yeah!
547 652
548=item ev_unloop (loop, how) 653=item ev_unloop (loop, how)
549 654
550Can be used to make a call to C<ev_loop> return early (but only after it 655Can be used to make a call to C<ev_loop> return early (but only after it
551has processed all outstanding events). The C<how> argument must be either 656has processed all outstanding events). The C<how> argument must be either
552C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 657C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
553C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 658C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
659
660This "unloop state" will be cleared when entering C<ev_loop> again.
554 661
555=item ev_ref (loop) 662=item ev_ref (loop)
556 663
557=item ev_unref (loop) 664=item ev_unref (loop)
558 665
563returning, ev_unref() after starting, and ev_ref() before stopping it. For 670returning, ev_unref() after starting, and ev_ref() before stopping it. For
564example, libev itself uses this for its internal signal pipe: It is not 671example, libev itself uses this for its internal signal pipe: It is not
565visible to the libev user and should not keep C<ev_loop> from exiting if 672visible to the libev user and should not keep C<ev_loop> from exiting if
566no event watchers registered by it are active. It is also an excellent 673no event watchers registered by it are active. It is also an excellent
567way to do this for generic recurring timers or from within third-party 674way to do this for generic recurring timers or from within third-party
568libraries. Just remember to I<unref after start> and I<ref before stop>. 675libraries. Just remember to I<unref after start> and I<ref before stop>
676(but only if the watcher wasn't active before, or was active before,
677respectively).
569 678
570Example: Create a signal watcher, but keep it from keeping C<ev_loop> 679Example: Create a signal watcher, but keep it from keeping C<ev_loop>
571running when nothing else is active. 680running when nothing else is active.
572 681
573 struct ev_signal exitsig; 682 struct ev_signal exitsig;
574 ev_signal_init (&exitsig, sig_cb, SIGINT); 683 ev_signal_init (&exitsig, sig_cb, SIGINT);
575 ev_signal_start (loop, &exitsig); 684 ev_signal_start (loop, &exitsig);
576 evf_unref (loop); 685 evf_unref (loop);
577 686
578Example: For some weird reason, unregister the above signal handler again. 687Example: For some weird reason, unregister the above signal handler again.
579 688
580 ev_ref (loop); 689 ev_ref (loop);
581 ev_signal_stop (loop, &exitsig); 690 ev_signal_stop (loop, &exitsig);
582 691
583=item ev_set_io_collect_interval (loop, ev_tstamp interval) 692=item ev_set_io_collect_interval (loop, ev_tstamp interval)
584 693
585=item ev_set_timeout_collect_interval (loop, ev_tstamp interval) 694=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
586 695
587These advanced functions influence the time that libev will spend waiting 696These advanced functions influence the time that libev will spend waiting
588for events. Both are by default C<0>, meaning that libev will try to 697for events. Both time intervals are by default C<0>, meaning that libev
589invoke timer/periodic callbacks and I/O callbacks with minimum latency. 698will try to invoke timer/periodic callbacks and I/O callbacks with minimum
699latency.
590 700
591Setting these to a higher value (the C<interval> I<must> be >= C<0>) 701Setting these to a higher value (the C<interval> I<must> be >= C<0>)
592allows libev to delay invocation of I/O and timer/periodic callbacks to 702allows libev to delay invocation of I/O and timer/periodic callbacks
593increase efficiency of loop iterations. 703to increase efficiency of loop iterations (or to increase power-saving
704opportunities).
594 705
595The background is that sometimes your program runs just fast enough to 706The background is that sometimes your program runs just fast enough to
596handle one (or very few) event(s) per loop iteration. While this makes 707handle one (or very few) event(s) per loop iteration. While this makes
597the program responsive, it also wastes a lot of CPU time to poll for new 708the program responsive, it also wastes a lot of CPU time to poll for new
598events, especially with backends like C<select ()> which have a high 709events, especially with backends like C<select ()> which have a high
599overhead for the actual polling but can deliver many events at once. 710overhead for the actual polling but can deliver many events at once.
600 711
601By setting a higher I<io collect interval> you allow libev to spend more 712By setting a higher I<io collect interval> you allow libev to spend more
602time collecting I/O events, so you can handle more events per iteration, 713time collecting I/O events, so you can handle more events per iteration,
603at the cost of increasing latency. Timeouts (both C<ev_periodic> and 714at the cost of increasing latency. Timeouts (both C<ev_periodic> and
604C<ev_timer>) will be not affected. Setting this to a non-null bvalue will 715C<ev_timer>) will be not affected. Setting this to a non-null value will
605introduce an additional C<ev_sleep ()> call into most loop iterations. 716introduce an additional C<ev_sleep ()> call into most loop iterations.
606 717
607Likewise, by setting a higher I<timeout collect interval> you allow libev 718Likewise, by setting a higher I<timeout collect interval> you allow libev
608to spend more time collecting timeouts, at the expense of increased 719to spend more time collecting timeouts, at the expense of increased
609latency (the watcher callback will be called later). C<ev_io> watchers 720latency (the watcher callback will be called later). C<ev_io> watchers
610will not be affected. Setting this to a non-null value will not introduce 721will not be affected. Setting this to a non-null value will not introduce
611any overhead in libev. 722any overhead in libev.
612 723
613Many (busy) programs can usually benefit by setting the io collect 724Many (busy) programs can usually benefit by setting the I/O collect
614interval to a value near C<0.1> or so, which is often enough for 725interval to a value near C<0.1> or so, which is often enough for
615interactive servers (of course not for games), likewise for timeouts. It 726interactive servers (of course not for games), likewise for timeouts. It
616usually doesn't make much sense to set it to a lower value than C<0.01>, 727usually doesn't make much sense to set it to a lower value than C<0.01>,
617as this approsaches the timing granularity of most systems. 728as this approaches the timing granularity of most systems.
729
730Setting the I<timeout collect interval> can improve the opportunity for
731saving power, as the program will "bundle" timer callback invocations that
732are "near" in time together, by delaying some, thus reducing the number of
733times the process sleeps and wakes up again. Another useful technique to
734reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
735they fire on, say, one-second boundaries only.
736
737=item ev_loop_verify (loop)
738
739This function only does something when C<EV_VERIFY> support has been
740compiled in. It tries to go through all internal structures and checks
741them for validity. If anything is found to be inconsistent, it will print
742an error message to standard error and call C<abort ()>.
743
744This can be used to catch bugs inside libev itself: under normal
745circumstances, this function will never abort as of course libev keeps its
746data structures consistent.
618 747
619=back 748=back
620 749
621 750
622=head1 ANATOMY OF A WATCHER 751=head1 ANATOMY OF A WATCHER
623 752
624A watcher is a structure that you create and register to record your 753A watcher is a structure that you create and register to record your
625interest in some event. For instance, if you want to wait for STDIN to 754interest in some event. For instance, if you want to wait for STDIN to
626become readable, you would create an C<ev_io> watcher for that: 755become readable, you would create an C<ev_io> watcher for that:
627 756
628 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents) 757 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
629 { 758 {
630 ev_io_stop (w); 759 ev_io_stop (w);
631 ev_unloop (loop, EVUNLOOP_ALL); 760 ev_unloop (loop, EVUNLOOP_ALL);
632 } 761 }
633 762
634 struct ev_loop *loop = ev_default_loop (0); 763 struct ev_loop *loop = ev_default_loop (0);
635 struct ev_io stdin_watcher; 764 struct ev_io stdin_watcher;
636 ev_init (&stdin_watcher, my_cb); 765 ev_init (&stdin_watcher, my_cb);
637 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 766 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
638 ev_io_start (loop, &stdin_watcher); 767 ev_io_start (loop, &stdin_watcher);
639 ev_loop (loop, 0); 768 ev_loop (loop, 0);
640 769
641As you can see, you are responsible for allocating the memory for your 770As you can see, you are responsible for allocating the memory for your
642watcher structures (and it is usually a bad idea to do this on the stack, 771watcher structures (and it is usually a bad idea to do this on the stack,
643although this can sometimes be quite valid). 772although this can sometimes be quite valid).
644 773
645Each watcher structure must be initialised by a call to C<ev_init 774Each watcher structure must be initialised by a call to C<ev_init
646(watcher *, callback)>, which expects a callback to be provided. This 775(watcher *, callback)>, which expects a callback to be provided. This
647callback gets invoked each time the event occurs (or, in the case of io 776callback gets invoked each time the event occurs (or, in the case of I/O
648watchers, each time the event loop detects that the file descriptor given 777watchers, each time the event loop detects that the file descriptor given
649is readable and/or writable). 778is readable and/or writable).
650 779
651Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro 780Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
652with arguments specific to this watcher type. There is also a macro 781with arguments specific to this watcher type. There is also a macro
722=item C<EV_FORK> 851=item C<EV_FORK>
723 852
724The event loop has been resumed in the child process after fork (see 853The event loop has been resumed in the child process after fork (see
725C<ev_fork>). 854C<ev_fork>).
726 855
856=item C<EV_ASYNC>
857
858The given async watcher has been asynchronously notified (see C<ev_async>).
859
727=item C<EV_ERROR> 860=item C<EV_ERROR>
728 861
729An unspecified error has occured, the watcher has been stopped. This might 862An unspecified error has occurred, the watcher has been stopped. This might
730happen because the watcher could not be properly started because libev 863happen because the watcher could not be properly started because libev
731ran out of memory, a file descriptor was found to be closed or any other 864ran out of memory, a file descriptor was found to be closed or any other
732problem. You best act on it by reporting the problem and somehow coping 865problem. You best act on it by reporting the problem and somehow coping
733with the watcher being stopped. 866with the watcher being stopped.
734 867
735Libev will usually signal a few "dummy" events together with an error, 868Libev will usually signal a few "dummy" events together with an error,
736for example it might indicate that a fd is readable or writable, and if 869for example it might indicate that a fd is readable or writable, and if
737your callbacks is well-written it can just attempt the operation and cope 870your callbacks is well-written it can just attempt the operation and cope
738with the error from read() or write(). This will not work in multithreaded 871with the error from read() or write(). This will not work in multi-threaded
739programs, though, so beware. 872programs, though, so beware.
740 873
741=back 874=back
742 875
743=head2 GENERIC WATCHER FUNCTIONS 876=head2 GENERIC WATCHER FUNCTIONS
773Although some watcher types do not have type-specific arguments 906Although some watcher types do not have type-specific arguments
774(e.g. C<ev_prepare>) you still need to call its C<set> macro. 907(e.g. C<ev_prepare>) you still need to call its C<set> macro.
775 908
776=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args]) 909=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
777 910
778This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro 911This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
779calls into a single call. This is the most convinient method to initialise 912calls into a single call. This is the most convenient method to initialise
780a watcher. The same limitations apply, of course. 913a watcher. The same limitations apply, of course.
781 914
782=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 915=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
783 916
784Starts (activates) the given watcher. Only active watchers will receive 917Starts (activates) the given watcher. Only active watchers will receive
867to associate arbitrary data with your watcher. If you need more data and 1000to associate arbitrary data with your watcher. If you need more data and
868don't want to allocate memory and store a pointer to it in that data 1001don't want to allocate memory and store a pointer to it in that data
869member, you can also "subclass" the watcher type and provide your own 1002member, you can also "subclass" the watcher type and provide your own
870data: 1003data:
871 1004
872 struct my_io 1005 struct my_io
873 { 1006 {
874 struct ev_io io; 1007 struct ev_io io;
875 int otherfd; 1008 int otherfd;
876 void *somedata; 1009 void *somedata;
877 struct whatever *mostinteresting; 1010 struct whatever *mostinteresting;
878 } 1011 };
1012
1013 ...
1014 struct my_io w;
1015 ev_io_init (&w.io, my_cb, fd, EV_READ);
879 1016
880And since your callback will be called with a pointer to the watcher, you 1017And since your callback will be called with a pointer to the watcher, you
881can cast it back to your own type: 1018can cast it back to your own type:
882 1019
883 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents) 1020 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
884 { 1021 {
885 struct my_io *w = (struct my_io *)w_; 1022 struct my_io *w = (struct my_io *)w_;
886 ... 1023 ...
887 } 1024 }
888 1025
889More interesting and less C-conformant ways of casting your callback type 1026More interesting and less C-conformant ways of casting your callback type
890instead have been omitted. 1027instead have been omitted.
891 1028
892Another common scenario is having some data structure with multiple 1029Another common scenario is to use some data structure with multiple
893watchers: 1030embedded watchers:
894 1031
895 struct my_biggy 1032 struct my_biggy
896 { 1033 {
897 int some_data; 1034 int some_data;
898 ev_timer t1; 1035 ev_timer t1;
899 ev_timer t2; 1036 ev_timer t2;
900 } 1037 }
901 1038
902In this case getting the pointer to C<my_biggy> is a bit more complicated, 1039In this case getting the pointer to C<my_biggy> is a bit more
903you need to use C<offsetof>: 1040complicated: Either you store the address of your C<my_biggy> struct
1041in the C<data> member of the watcher, or you need to use some pointer
1042arithmetic using C<offsetof> inside your watchers:
904 1043
905 #include <stddef.h> 1044 #include <stddef.h>
906 1045
907 static void 1046 static void
908 t1_cb (EV_P_ struct ev_timer *w, int revents) 1047 t1_cb (EV_P_ struct ev_timer *w, int revents)
909 { 1048 {
910 struct my_biggy big = (struct my_biggy * 1049 struct my_biggy big = (struct my_biggy *
911 (((char *)w) - offsetof (struct my_biggy, t1)); 1050 (((char *)w) - offsetof (struct my_biggy, t1));
912 } 1051 }
913 1052
914 static void 1053 static void
915 t2_cb (EV_P_ struct ev_timer *w, int revents) 1054 t2_cb (EV_P_ struct ev_timer *w, int revents)
916 { 1055 {
917 struct my_biggy big = (struct my_biggy * 1056 struct my_biggy big = (struct my_biggy *
918 (((char *)w) - offsetof (struct my_biggy, t2)); 1057 (((char *)w) - offsetof (struct my_biggy, t2));
919 } 1058 }
920 1059
921 1060
922=head1 WATCHER TYPES 1061=head1 WATCHER TYPES
923 1062
924This section describes each watcher in detail, but will not repeat 1063This section describes each watcher in detail, but will not repeat
948In general you can register as many read and/or write event watchers per 1087In general you can register as many read and/or write event watchers per
949fd as you want (as long as you don't confuse yourself). Setting all file 1088fd as you want (as long as you don't confuse yourself). Setting all file
950descriptors to non-blocking mode is also usually a good idea (but not 1089descriptors to non-blocking mode is also usually a good idea (but not
951required if you know what you are doing). 1090required if you know what you are doing).
952 1091
953You have to be careful with dup'ed file descriptors, though. Some backends
954(the linux epoll backend is a notable example) cannot handle dup'ed file
955descriptors correctly if you register interest in two or more fds pointing
956to the same underlying file/socket/etc. description (that is, they share
957the same underlying "file open").
958
959If you must do this, then force the use of a known-to-be-good backend 1092If you must do this, then force the use of a known-to-be-good backend
960(at the time of this writing, this includes only C<EVBACKEND_SELECT> and 1093(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
961C<EVBACKEND_POLL>). 1094C<EVBACKEND_POLL>).
962 1095
963Another thing you have to watch out for is that it is quite easy to 1096Another thing you have to watch out for is that it is quite easy to
964receive "spurious" readyness notifications, that is your callback might 1097receive "spurious" readiness notifications, that is your callback might
965be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1098be called with C<EV_READ> but a subsequent C<read>(2) will actually block
966because there is no data. Not only are some backends known to create a 1099because there is no data. Not only are some backends known to create a
967lot of those (for example solaris ports), it is very easy to get into 1100lot of those (for example Solaris ports), it is very easy to get into
968this situation even with a relatively standard program structure. Thus 1101this situation even with a relatively standard program structure. Thus
969it is best to always use non-blocking I/O: An extra C<read>(2) returning 1102it is best to always use non-blocking I/O: An extra C<read>(2) returning
970C<EAGAIN> is far preferable to a program hanging until some data arrives. 1103C<EAGAIN> is far preferable to a program hanging until some data arrives.
971 1104
972If you cannot run the fd in non-blocking mode (for example you should not 1105If you cannot run the fd in non-blocking mode (for example you should not
973play around with an Xlib connection), then you have to seperately re-test 1106play around with an Xlib connection), then you have to separately re-test
974whether a file descriptor is really ready with a known-to-be good interface 1107whether a file descriptor is really ready with a known-to-be good interface
975such as poll (fortunately in our Xlib example, Xlib already does this on 1108such as poll (fortunately in our Xlib example, Xlib already does this on
976its own, so its quite safe to use). 1109its own, so its quite safe to use).
977 1110
978=head3 The special problem of disappearing file descriptors 1111=head3 The special problem of disappearing file descriptors
997optimisations to libev. 1130optimisations to libev.
998 1131
999=head3 The special problem of dup'ed file descriptors 1132=head3 The special problem of dup'ed file descriptors
1000 1133
1001Some backends (e.g. epoll), cannot register events for file descriptors, 1134Some backends (e.g. epoll), cannot register events for file descriptors,
1002but only events for the underlying file descriptions. That menas when you 1135but only events for the underlying file descriptions. That means when you
1003have C<dup ()>'ed file descriptors and register events for them, only one 1136have C<dup ()>'ed file descriptors or weirder constellations, and register
1004file descriptor might actually receive events. 1137events for them, only one file descriptor might actually receive events.
1005 1138
1006There is no workaorund possible except not registering events 1139There is no workaround possible except not registering events
1007for potentially C<dup ()>'ed file descriptors or to resort to 1140for potentially C<dup ()>'ed file descriptors, or to resort to
1008C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. 1141C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1009 1142
1010=head3 The special problem of fork 1143=head3 The special problem of fork
1011 1144
1012Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit 1145Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1016To support fork in your programs, you either have to call 1149To support fork in your programs, you either have to call
1017C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, 1150C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1018enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1151enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1019C<EVBACKEND_POLL>. 1152C<EVBACKEND_POLL>.
1020 1153
1154=head3 The special problem of SIGPIPE
1155
1156While not really specific to libev, it is easy to forget about SIGPIPE:
1157when writing to a pipe whose other end has been closed, your program gets
1158send a SIGPIPE, which, by default, aborts your program. For most programs
1159this is sensible behaviour, for daemons, this is usually undesirable.
1160
1161So when you encounter spurious, unexplained daemon exits, make sure you
1162ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1163somewhere, as that would have given you a big clue).
1164
1021 1165
1022=head3 Watcher-Specific Functions 1166=head3 Watcher-Specific Functions
1023 1167
1024=over 4 1168=over 4
1025 1169
1026=item ev_io_init (ev_io *, callback, int fd, int events) 1170=item ev_io_init (ev_io *, callback, int fd, int events)
1027 1171
1028=item ev_io_set (ev_io *, int fd, int events) 1172=item ev_io_set (ev_io *, int fd, int events)
1029 1173
1030Configures an C<ev_io> watcher. The C<fd> is the file descriptor to 1174Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1031rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or 1175receive events for and events is either C<EV_READ>, C<EV_WRITE> or
1032C<EV_READ | EV_WRITE> to receive the given events. 1176C<EV_READ | EV_WRITE> to receive the given events.
1033 1177
1034=item int fd [read-only] 1178=item int fd [read-only]
1035 1179
1036The file descriptor being watched. 1180The file descriptor being watched.
1038=item int events [read-only] 1182=item int events [read-only]
1039 1183
1040The events being watched. 1184The events being watched.
1041 1185
1042=back 1186=back
1187
1188=head3 Examples
1043 1189
1044Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1190Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1045readable, but only once. Since it is likely line-buffered, you could 1191readable, but only once. Since it is likely line-buffered, you could
1046attempt to read a whole line in the callback. 1192attempt to read a whole line in the callback.
1047 1193
1048 static void 1194 static void
1049 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1195 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1050 { 1196 {
1051 ev_io_stop (loop, w); 1197 ev_io_stop (loop, w);
1052 .. read from stdin here (or from w->fd) and haqndle any I/O errors 1198 .. read from stdin here (or from w->fd) and haqndle any I/O errors
1053 } 1199 }
1054 1200
1055 ... 1201 ...
1056 struct ev_loop *loop = ev_default_init (0); 1202 struct ev_loop *loop = ev_default_init (0);
1057 struct ev_io stdin_readable; 1203 struct ev_io stdin_readable;
1058 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1204 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1059 ev_io_start (loop, &stdin_readable); 1205 ev_io_start (loop, &stdin_readable);
1060 ev_loop (loop, 0); 1206 ev_loop (loop, 0);
1061 1207
1062 1208
1063=head2 C<ev_timer> - relative and optionally repeating timeouts 1209=head2 C<ev_timer> - relative and optionally repeating timeouts
1064 1210
1065Timer watchers are simple relative timers that generate an event after a 1211Timer watchers are simple relative timers that generate an event after a
1066given time, and optionally repeating in regular intervals after that. 1212given time, and optionally repeating in regular intervals after that.
1067 1213
1068The timers are based on real time, that is, if you register an event that 1214The timers are based on real time, that is, if you register an event that
1069times out after an hour and you reset your system clock to last years 1215times out after an hour and you reset your system clock to January last
1070time, it will still time out after (roughly) and hour. "Roughly" because 1216year, it will still time out after (roughly) and hour. "Roughly" because
1071detecting time jumps is hard, and some inaccuracies are unavoidable (the 1217detecting time jumps is hard, and some inaccuracies are unavoidable (the
1072monotonic clock option helps a lot here). 1218monotonic clock option helps a lot here).
1219
1220The callback is guaranteed to be invoked only after its timeout has passed,
1221but if multiple timers become ready during the same loop iteration then
1222order of execution is undefined.
1223
1224=head3 The special problem of time updates
1225
1226Establishing the current time is a costly operation (it usually takes at
1227least two system calls): EV therefore updates its idea of the current
1228time only before and after C<ev_loop> polls for new events, which causes
1229a growing difference between C<ev_now ()> and C<ev_time ()> when handling
1230lots of events.
1073 1231
1074The relative timeouts are calculated relative to the C<ev_now ()> 1232The relative timeouts are calculated relative to the C<ev_now ()>
1075time. This is usually the right thing as this timestamp refers to the time 1233time. This is usually the right thing as this timestamp refers to the time
1076of the event triggering whatever timeout you are modifying/starting. If 1234of the event triggering whatever timeout you are modifying/starting. If
1077you suspect event processing to be delayed and you I<need> to base the timeout 1235you suspect event processing to be delayed and you I<need> to base the
1078on the current time, use something like this to adjust for this: 1236timeout on the current time, use something like this to adjust for this:
1079 1237
1080 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1238 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1081 1239
1082The callback is guarenteed to be invoked only when its timeout has passed, 1240If the event loop is suspended for a long time, you can also force an
1083but if multiple timers become ready during the same loop iteration then 1241update of the time returned by C<ev_now ()> by calling C<ev_now_update
1084order of execution is undefined. 1242()>.
1085 1243
1086=head3 Watcher-Specific Functions and Data Members 1244=head3 Watcher-Specific Functions and Data Members
1087 1245
1088=over 4 1246=over 4
1089 1247
1090=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1248=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1091 1249
1092=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 1250=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
1093 1251
1094Configure the timer to trigger after C<after> seconds. If C<repeat> is 1252Configure the timer to trigger after C<after> seconds. If C<repeat>
1095C<0.>, then it will automatically be stopped. If it is positive, then the 1253is C<0.>, then it will automatically be stopped once the timeout is
1096timer will automatically be configured to trigger again C<repeat> seconds 1254reached. If it is positive, then the timer will automatically be
1097later, again, and again, until stopped manually. 1255configured to trigger again C<repeat> seconds later, again, and again,
1256until stopped manually.
1098 1257
1099The timer itself will do a best-effort at avoiding drift, that is, if you 1258The timer itself will do a best-effort at avoiding drift, that is, if
1100configure a timer to trigger every 10 seconds, then it will trigger at 1259you configure a timer to trigger every 10 seconds, then it will normally
1101exactly 10 second intervals. If, however, your program cannot keep up with 1260trigger at exactly 10 second intervals. If, however, your program cannot
1102the timer (because it takes longer than those 10 seconds to do stuff) the 1261keep up with the timer (because it takes longer than those 10 seconds to
1103timer will not fire more than once per event loop iteration. 1262do stuff) the timer will not fire more than once per event loop iteration.
1104 1263
1105=item ev_timer_again (loop) 1264=item ev_timer_again (loop, ev_timer *)
1106 1265
1107This will act as if the timer timed out and restart it again if it is 1266This will act as if the timer timed out and restart it again if it is
1108repeating. The exact semantics are: 1267repeating. The exact semantics are:
1109 1268
1110If the timer is pending, its pending status is cleared. 1269If the timer is pending, its pending status is cleared.
1111 1270
1112If the timer is started but nonrepeating, stop it (as if it timed out). 1271If the timer is started but non-repeating, stop it (as if it timed out).
1113 1272
1114If the timer is repeating, either start it if necessary (with the 1273If the timer is repeating, either start it if necessary (with the
1115C<repeat> value), or reset the running timer to the C<repeat> value. 1274C<repeat> value), or reset the running timer to the C<repeat> value.
1116 1275
1117This sounds a bit complicated, but here is a useful and typical 1276This sounds a bit complicated, but here is a useful and typical
1118example: Imagine you have a tcp connection and you want a so-called idle 1277example: Imagine you have a TCP connection and you want a so-called idle
1119timeout, that is, you want to be called when there have been, say, 60 1278timeout, that is, you want to be called when there have been, say, 60
1120seconds of inactivity on the socket. The easiest way to do this is to 1279seconds of inactivity on the socket. The easiest way to do this is to
1121configure an C<ev_timer> with a C<repeat> value of C<60> and then call 1280configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1122C<ev_timer_again> each time you successfully read or write some data. If 1281C<ev_timer_again> each time you successfully read or write some data. If
1123you go into an idle state where you do not expect data to travel on the 1282you go into an idle state where you do not expect data to travel on the
1145or C<ev_timer_again> is called and determines the next timeout (if any), 1304or C<ev_timer_again> is called and determines the next timeout (if any),
1146which is also when any modifications are taken into account. 1305which is also when any modifications are taken into account.
1147 1306
1148=back 1307=back
1149 1308
1309=head3 Examples
1310
1150Example: Create a timer that fires after 60 seconds. 1311Example: Create a timer that fires after 60 seconds.
1151 1312
1152 static void 1313 static void
1153 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1314 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1154 { 1315 {
1155 .. one minute over, w is actually stopped right here 1316 .. one minute over, w is actually stopped right here
1156 } 1317 }
1157 1318
1158 struct ev_timer mytimer; 1319 struct ev_timer mytimer;
1159 ev_timer_init (&mytimer, one_minute_cb, 60., 0.); 1320 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1160 ev_timer_start (loop, &mytimer); 1321 ev_timer_start (loop, &mytimer);
1161 1322
1162Example: Create a timeout timer that times out after 10 seconds of 1323Example: Create a timeout timer that times out after 10 seconds of
1163inactivity. 1324inactivity.
1164 1325
1165 static void 1326 static void
1166 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1327 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1167 { 1328 {
1168 .. ten seconds without any activity 1329 .. ten seconds without any activity
1169 } 1330 }
1170 1331
1171 struct ev_timer mytimer; 1332 struct ev_timer mytimer;
1172 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 1333 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1173 ev_timer_again (&mytimer); /* start timer */ 1334 ev_timer_again (&mytimer); /* start timer */
1174 ev_loop (loop, 0); 1335 ev_loop (loop, 0);
1175 1336
1176 // and in some piece of code that gets executed on any "activity": 1337 // and in some piece of code that gets executed on any "activity":
1177 // reset the timeout to start ticking again at 10 seconds 1338 // reset the timeout to start ticking again at 10 seconds
1178 ev_timer_again (&mytimer); 1339 ev_timer_again (&mytimer);
1179 1340
1180 1341
1181=head2 C<ev_periodic> - to cron or not to cron? 1342=head2 C<ev_periodic> - to cron or not to cron?
1182 1343
1183Periodic watchers are also timers of a kind, but they are very versatile 1344Periodic watchers are also timers of a kind, but they are very versatile
1184(and unfortunately a bit complex). 1345(and unfortunately a bit complex).
1185 1346
1186Unlike C<ev_timer>'s, they are not based on real time (or relative time) 1347Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1187but on wallclock time (absolute time). You can tell a periodic watcher 1348but on wall clock time (absolute time). You can tell a periodic watcher
1188to trigger "at" some specific point in time. For example, if you tell a 1349to trigger after some specific point in time. For example, if you tell a
1189periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1350periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now ()
1190+ 10.>) and then reset your system clock to the last year, then it will 1351+ 10.>, that is, an absolute time not a delay) and then reset your system
1352clock to January of the previous year, then it will take more than year
1191take a year to trigger the event (unlike an C<ev_timer>, which would trigger 1353to trigger the event (unlike an C<ev_timer>, which would still trigger
1192roughly 10 seconds later). 1354roughly 10 seconds later as it uses a relative timeout).
1193 1355
1194They can also be used to implement vastly more complex timers, such as 1356C<ev_periodic>s can also be used to implement vastly more complex timers,
1195triggering an event on each midnight, local time or other, complicated, 1357such as triggering an event on each "midnight, local time", or other
1196rules. 1358complicated, rules.
1197 1359
1198As with timers, the callback is guarenteed to be invoked only when the 1360As with timers, the callback is guaranteed to be invoked only when the
1199time (C<at>) has been passed, but if multiple periodic timers become ready 1361time (C<at>) has passed, but if multiple periodic timers become ready
1200during the same loop iteration then order of execution is undefined. 1362during the same loop iteration then order of execution is undefined.
1201 1363
1202=head3 Watcher-Specific Functions and Data Members 1364=head3 Watcher-Specific Functions and Data Members
1203 1365
1204=over 4 1366=over 4
1212 1374
1213=over 4 1375=over 4
1214 1376
1215=item * absolute timer (at = time, interval = reschedule_cb = 0) 1377=item * absolute timer (at = time, interval = reschedule_cb = 0)
1216 1378
1217In this configuration the watcher triggers an event at the wallclock time 1379In this configuration the watcher triggers an event after the wall clock
1218C<at> and doesn't repeat. It will not adjust when a time jump occurs, 1380time C<at> has passed and doesn't repeat. It will not adjust when a time
1219that is, if it is to be run at January 1st 2011 then it will run when the 1381jump occurs, that is, if it is to be run at January 1st 2011 then it will
1220system time reaches or surpasses this time. 1382run when the system time reaches or surpasses this time.
1221 1383
1222=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) 1384=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1223 1385
1224In this mode the watcher will always be scheduled to time out at the next 1386In this mode the watcher will always be scheduled to time out at the next
1225C<at + N * interval> time (for some integer N, which can also be negative) 1387C<at + N * interval> time (for some integer N, which can also be negative)
1226and then repeat, regardless of any time jumps. 1388and then repeat, regardless of any time jumps.
1227 1389
1228This can be used to create timers that do not drift with respect to system 1390This can be used to create timers that do not drift with respect to system
1229time: 1391time, for example, here is a C<ev_periodic> that triggers each hour, on
1392the hour:
1230 1393
1231 ev_periodic_set (&periodic, 0., 3600., 0); 1394 ev_periodic_set (&periodic, 0., 3600., 0);
1232 1395
1233This doesn't mean there will always be 3600 seconds in between triggers, 1396This doesn't mean there will always be 3600 seconds in between triggers,
1234but only that the the callback will be called when the system time shows a 1397but only that the callback will be called when the system time shows a
1235full hour (UTC), or more correctly, when the system time is evenly divisible 1398full hour (UTC), or more correctly, when the system time is evenly divisible
1236by 3600. 1399by 3600.
1237 1400
1238Another way to think about it (for the mathematically inclined) is that 1401Another way to think about it (for the mathematically inclined) is that
1239C<ev_periodic> will try to run the callback in this mode at the next possible 1402C<ev_periodic> will try to run the callback in this mode at the next possible
1240time where C<time = at (mod interval)>, regardless of any time jumps. 1403time where C<time = at (mod interval)>, regardless of any time jumps.
1241 1404
1242For numerical stability it is preferable that the C<at> value is near 1405For numerical stability it is preferable that the C<at> value is near
1243C<ev_now ()> (the current time), but there is no range requirement for 1406C<ev_now ()> (the current time), but there is no range requirement for
1244this value. 1407this value, and in fact is often specified as zero.
1408
1409Note also that there is an upper limit to how often a timer can fire (CPU
1410speed for example), so if C<interval> is very small then timing stability
1411will of course deteriorate. Libev itself tries to be exact to be about one
1412millisecond (if the OS supports it and the machine is fast enough).
1245 1413
1246=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) 1414=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1247 1415
1248In this mode the values for C<interval> and C<at> are both being 1416In this mode the values for C<interval> and C<at> are both being
1249ignored. Instead, each time the periodic watcher gets scheduled, the 1417ignored. Instead, each time the periodic watcher gets scheduled, the
1250reschedule callback will be called with the watcher as first, and the 1418reschedule callback will be called with the watcher as first, and the
1251current time as second argument. 1419current time as second argument.
1252 1420
1253NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1421NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1254ever, or make any event loop modifications>. If you need to stop it, 1422ever, or make ANY event loop modifications whatsoever>.
1255return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1256starting an C<ev_prepare> watcher, which is legal).
1257 1423
1424If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
1425it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
1426only event loop modification you are allowed to do).
1427
1258Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1428The callback prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic
1259ev_tstamp now)>, e.g.: 1429*w, ev_tstamp now)>, e.g.:
1260 1430
1261 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1431 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1262 { 1432 {
1263 return now + 60.; 1433 return now + 60.;
1264 } 1434 }
1266It must return the next time to trigger, based on the passed time value 1436It must return the next time to trigger, based on the passed time value
1267(that is, the lowest time value larger than to the second argument). It 1437(that is, the lowest time value larger than to the second argument). It
1268will usually be called just before the callback will be triggered, but 1438will usually be called just before the callback will be triggered, but
1269might be called at other times, too. 1439might be called at other times, too.
1270 1440
1271NOTE: I<< This callback must always return a time that is later than the 1441NOTE: I<< This callback must always return a time that is higher than or
1272passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger. 1442equal to the passed C<now> value >>.
1273 1443
1274This can be used to create very complex timers, such as a timer that 1444This can be used to create very complex timers, such as a timer that
1275triggers on each midnight, local time. To do this, you would calculate the 1445triggers on "next midnight, local time". To do this, you would calculate the
1276next midnight after C<now> and return the timestamp value for this. How 1446next midnight after C<now> and return the timestamp value for this. How
1277you do this is, again, up to you (but it is not trivial, which is the main 1447you do this is, again, up to you (but it is not trivial, which is the main
1278reason I omitted it as an example). 1448reason I omitted it as an example).
1279 1449
1280=back 1450=back
1284Simply stops and restarts the periodic watcher again. This is only useful 1454Simply stops and restarts the periodic watcher again. This is only useful
1285when you changed some parameters or the reschedule callback would return 1455when you changed some parameters or the reschedule callback would return
1286a different time than the last time it was called (e.g. in a crond like 1456a different time than the last time it was called (e.g. in a crond like
1287program when the crontabs have changed). 1457program when the crontabs have changed).
1288 1458
1459=item ev_tstamp ev_periodic_at (ev_periodic *)
1460
1461When active, returns the absolute time that the watcher is supposed to
1462trigger next.
1463
1289=item ev_tstamp offset [read-write] 1464=item ev_tstamp offset [read-write]
1290 1465
1291When repeating, this contains the offset value, otherwise this is the 1466When repeating, this contains the offset value, otherwise this is the
1292absolute point in time (the C<at> value passed to C<ev_periodic_set>). 1467absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1293 1468
1304 1479
1305The current reschedule callback, or C<0>, if this functionality is 1480The current reschedule callback, or C<0>, if this functionality is
1306switched off. Can be changed any time, but changes only take effect when 1481switched off. Can be changed any time, but changes only take effect when
1307the periodic timer fires or C<ev_periodic_again> is being called. 1482the periodic timer fires or C<ev_periodic_again> is being called.
1308 1483
1309=item ev_tstamp at [read-only]
1310
1311When active, contains the absolute time that the watcher is supposed to
1312trigger next.
1313
1314=back 1484=back
1485
1486=head3 Examples
1315 1487
1316Example: Call a callback every hour, or, more precisely, whenever the 1488Example: Call a callback every hour, or, more precisely, whenever the
1317system clock is divisible by 3600. The callback invocation times have 1489system clock is divisible by 3600. The callback invocation times have
1318potentially a lot of jittering, but good long-term stability. 1490potentially a lot of jitter, but good long-term stability.
1319 1491
1320 static void 1492 static void
1321 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1493 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1322 { 1494 {
1323 ... its now a full hour (UTC, or TAI or whatever your clock follows) 1495 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1324 } 1496 }
1325 1497
1326 struct ev_periodic hourly_tick; 1498 struct ev_periodic hourly_tick;
1327 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0); 1499 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1328 ev_periodic_start (loop, &hourly_tick); 1500 ev_periodic_start (loop, &hourly_tick);
1329 1501
1330Example: The same as above, but use a reschedule callback to do it: 1502Example: The same as above, but use a reschedule callback to do it:
1331 1503
1332 #include <math.h> 1504 #include <math.h>
1333 1505
1334 static ev_tstamp 1506 static ev_tstamp
1335 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now) 1507 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1336 { 1508 {
1337 return fmod (now, 3600.) + 3600.; 1509 return fmod (now, 3600.) + 3600.;
1338 } 1510 }
1339 1511
1340 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb); 1512 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1341 1513
1342Example: Call a callback every hour, starting now: 1514Example: Call a callback every hour, starting now:
1343 1515
1344 struct ev_periodic hourly_tick; 1516 struct ev_periodic hourly_tick;
1345 ev_periodic_init (&hourly_tick, clock_cb, 1517 ev_periodic_init (&hourly_tick, clock_cb,
1346 fmod (ev_now (loop), 3600.), 3600., 0); 1518 fmod (ev_now (loop), 3600.), 3600., 0);
1347 ev_periodic_start (loop, &hourly_tick); 1519 ev_periodic_start (loop, &hourly_tick);
1348 1520
1349 1521
1350=head2 C<ev_signal> - signal me when a signal gets signalled! 1522=head2 C<ev_signal> - signal me when a signal gets signalled!
1351 1523
1352Signal watchers will trigger an event when the process receives a specific 1524Signal watchers will trigger an event when the process receives a specific
1359with the kernel (thus it coexists with your own signal handlers as long 1531with the kernel (thus it coexists with your own signal handlers as long
1360as you don't register any with libev). Similarly, when the last signal 1532as you don't register any with libev). Similarly, when the last signal
1361watcher for a signal is stopped libev will reset the signal handler to 1533watcher for a signal is stopped libev will reset the signal handler to
1362SIG_DFL (regardless of what it was set to before). 1534SIG_DFL (regardless of what it was set to before).
1363 1535
1536If possible and supported, libev will install its handlers with
1537C<SA_RESTART> behaviour enabled, so system calls should not be unduly
1538interrupted. If you have a problem with system calls getting interrupted by
1539signals you can block all signals in an C<ev_check> watcher and unblock
1540them in an C<ev_prepare> watcher.
1541
1364=head3 Watcher-Specific Functions and Data Members 1542=head3 Watcher-Specific Functions and Data Members
1365 1543
1366=over 4 1544=over 4
1367 1545
1368=item ev_signal_init (ev_signal *, callback, int signum) 1546=item ev_signal_init (ev_signal *, callback, int signum)
1376 1554
1377The signal the watcher watches out for. 1555The signal the watcher watches out for.
1378 1556
1379=back 1557=back
1380 1558
1559=head3 Examples
1560
1561Example: Try to exit cleanly on SIGINT and SIGTERM.
1562
1563 static void
1564 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1565 {
1566 ev_unloop (loop, EVUNLOOP_ALL);
1567 }
1568
1569 struct ev_signal signal_watcher;
1570 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1571 ev_signal_start (loop, &sigint_cb);
1572
1381 1573
1382=head2 C<ev_child> - watch out for process status changes 1574=head2 C<ev_child> - watch out for process status changes
1383 1575
1384Child watchers trigger when your process receives a SIGCHLD in response to 1576Child watchers trigger when your process receives a SIGCHLD in response to
1385some child status changes (most typically when a child of yours dies). 1577some child status changes (most typically when a child of yours dies). It
1578is permissible to install a child watcher I<after> the child has been
1579forked (which implies it might have already exited), as long as the event
1580loop isn't entered (or is continued from a watcher).
1581
1582Only the default event loop is capable of handling signals, and therefore
1583you can only register child watchers in the default event loop.
1584
1585=head3 Process Interaction
1586
1587Libev grabs C<SIGCHLD> as soon as the default event loop is
1588initialised. This is necessary to guarantee proper behaviour even if
1589the first child watcher is started after the child exits. The occurrence
1590of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1591synchronously as part of the event loop processing. Libev always reaps all
1592children, even ones not watched.
1593
1594=head3 Overriding the Built-In Processing
1595
1596Libev offers no special support for overriding the built-in child
1597processing, but if your application collides with libev's default child
1598handler, you can override it easily by installing your own handler for
1599C<SIGCHLD> after initialising the default loop, and making sure the
1600default loop never gets destroyed. You are encouraged, however, to use an
1601event-based approach to child reaping and thus use libev's support for
1602that, so other libev users can use C<ev_child> watchers freely.
1603
1604=head3 Stopping the Child Watcher
1605
1606Currently, the child watcher never gets stopped, even when the
1607child terminates, so normally one needs to stop the watcher in the
1608callback. Future versions of libev might stop the watcher automatically
1609when a child exit is detected.
1386 1610
1387=head3 Watcher-Specific Functions and Data Members 1611=head3 Watcher-Specific Functions and Data Members
1388 1612
1389=over 4 1613=over 4
1390 1614
1391=item ev_child_init (ev_child *, callback, int pid) 1615=item ev_child_init (ev_child *, callback, int pid, int trace)
1392 1616
1393=item ev_child_set (ev_child *, int pid) 1617=item ev_child_set (ev_child *, int pid, int trace)
1394 1618
1395Configures the watcher to wait for status changes of process C<pid> (or 1619Configures the watcher to wait for status changes of process C<pid> (or
1396I<any> process if C<pid> is specified as C<0>). The callback can look 1620I<any> process if C<pid> is specified as C<0>). The callback can look
1397at the C<rstatus> member of the C<ev_child> watcher structure to see 1621at the C<rstatus> member of the C<ev_child> watcher structure to see
1398the status word (use the macros from C<sys/wait.h> and see your systems 1622the status word (use the macros from C<sys/wait.h> and see your systems
1399C<waitpid> documentation). The C<rpid> member contains the pid of the 1623C<waitpid> documentation). The C<rpid> member contains the pid of the
1400process causing the status change. 1624process causing the status change. C<trace> must be either C<0> (only
1625activate the watcher when the process terminates) or C<1> (additionally
1626activate the watcher when the process is stopped or continued).
1401 1627
1402=item int pid [read-only] 1628=item int pid [read-only]
1403 1629
1404The process id this watcher watches out for, or C<0>, meaning any process id. 1630The process id this watcher watches out for, or C<0>, meaning any process id.
1405 1631
1412The process exit/trace status caused by C<rpid> (see your systems 1638The process exit/trace status caused by C<rpid> (see your systems
1413C<waitpid> and C<sys/wait.h> documentation for details). 1639C<waitpid> and C<sys/wait.h> documentation for details).
1414 1640
1415=back 1641=back
1416 1642
1417Example: Try to exit cleanly on SIGINT and SIGTERM. 1643=head3 Examples
1418 1644
1645Example: C<fork()> a new process and install a child handler to wait for
1646its completion.
1647
1648 ev_child cw;
1649
1419 static void 1650 static void
1420 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1651 child_cb (EV_P_ struct ev_child *w, int revents)
1421 { 1652 {
1422 ev_unloop (loop, EVUNLOOP_ALL); 1653 ev_child_stop (EV_A_ w);
1654 printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1423 } 1655 }
1424 1656
1425 struct ev_signal signal_watcher; 1657 pid_t pid = fork ();
1426 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 1658
1427 ev_signal_start (loop, &sigint_cb); 1659 if (pid < 0)
1660 // error
1661 else if (pid == 0)
1662 {
1663 // the forked child executes here
1664 exit (1);
1665 }
1666 else
1667 {
1668 ev_child_init (&cw, child_cb, pid, 0);
1669 ev_child_start (EV_DEFAULT_ &cw);
1670 }
1428 1671
1429 1672
1430=head2 C<ev_stat> - did the file attributes just change? 1673=head2 C<ev_stat> - did the file attributes just change?
1431 1674
1432This watches a filesystem path for attribute changes. That is, it calls 1675This watches a file system path for attribute changes. That is, it calls
1433C<stat> regularly (or when the OS says it changed) and sees if it changed 1676C<stat> regularly (or when the OS says it changed) and sees if it changed
1434compared to the last time, invoking the callback if it did. 1677compared to the last time, invoking the callback if it did.
1435 1678
1436The path does not need to exist: changing from "path exists" to "path does 1679The path does not need to exist: changing from "path exists" to "path does
1437not exist" is a status change like any other. The condition "path does 1680not exist" is a status change like any other. The condition "path does
1455as even with OS-supported change notifications, this can be 1698as even with OS-supported change notifications, this can be
1456resource-intensive. 1699resource-intensive.
1457 1700
1458At the time of this writing, only the Linux inotify interface is 1701At the time of this writing, only the Linux inotify interface is
1459implemented (implementing kqueue support is left as an exercise for the 1702implemented (implementing kqueue support is left as an exercise for the
1703reader, note, however, that the author sees no way of implementing ev_stat
1460reader). Inotify will be used to give hints only and should not change the 1704semantics with kqueue). Inotify will be used to give hints only and should
1461semantics of C<ev_stat> watchers, which means that libev sometimes needs 1705not change the semantics of C<ev_stat> watchers, which means that libev
1462to fall back to regular polling again even with inotify, but changes are 1706sometimes needs to fall back to regular polling again even with inotify,
1463usually detected immediately, and if the file exists there will be no 1707but changes are usually detected immediately, and if the file exists there
1464polling. 1708will be no polling.
1709
1710=head3 ABI Issues (Largefile Support)
1711
1712Libev by default (unless the user overrides this) uses the default
1713compilation environment, which means that on systems with large file
1714support disabled by default, you get the 32 bit version of the stat
1715structure. When using the library from programs that change the ABI to
1716use 64 bit file offsets the programs will fail. In that case you have to
1717compile libev with the same flags to get binary compatibility. This is
1718obviously the case with any flags that change the ABI, but the problem is
1719most noticeably disabled with ev_stat and large file support.
1720
1721The solution for this is to lobby your distribution maker to make large
1722file interfaces available by default (as e.g. FreeBSD does) and not
1723optional. Libev cannot simply switch on large file support because it has
1724to exchange stat structures with application programs compiled using the
1725default compilation environment.
1726
1727=head3 Inotify
1728
1729When C<inotify (7)> support has been compiled into libev (generally only
1730available on Linux) and present at runtime, it will be used to speed up
1731change detection where possible. The inotify descriptor will be created lazily
1732when the first C<ev_stat> watcher is being started.
1733
1734Inotify presence does not change the semantics of C<ev_stat> watchers
1735except that changes might be detected earlier, and in some cases, to avoid
1736making regular C<stat> calls. Even in the presence of inotify support
1737there are many cases where libev has to resort to regular C<stat> polling.
1738
1739(There is no support for kqueue, as apparently it cannot be used to
1740implement this functionality, due to the requirement of having a file
1741descriptor open on the object at all times).
1742
1743=head3 The special problem of stat time resolution
1744
1745The C<stat ()> system call only supports full-second resolution portably, and
1746even on systems where the resolution is higher, many file systems still
1747only support whole seconds.
1748
1749That means that, if the time is the only thing that changes, you can
1750easily miss updates: on the first update, C<ev_stat> detects a change and
1751calls your callback, which does something. When there is another update
1752within the same second, C<ev_stat> will be unable to detect it as the stat
1753data does not change.
1754
1755The solution to this is to delay acting on a change for slightly more
1756than a second (or till slightly after the next full second boundary), using
1757a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);
1758ev_timer_again (loop, w)>).
1759
1760The C<.02> offset is added to work around small timing inconsistencies
1761of some operating systems (where the second counter of the current time
1762might be be delayed. One such system is the Linux kernel, where a call to
1763C<gettimeofday> might return a timestamp with a full second later than
1764a subsequent C<time> call - if the equivalent of C<time ()> is used to
1765update file times then there will be a small window where the kernel uses
1766the previous second to update file times but libev might already execute
1767the timer callback).
1465 1768
1466=head3 Watcher-Specific Functions and Data Members 1769=head3 Watcher-Specific Functions and Data Members
1467 1770
1468=over 4 1771=over 4
1469 1772
1475C<path>. The C<interval> is a hint on how quickly a change is expected to 1778C<path>. The C<interval> is a hint on how quickly a change is expected to
1476be detected and should normally be specified as C<0> to let libev choose 1779be detected and should normally be specified as C<0> to let libev choose
1477a suitable value. The memory pointed to by C<path> must point to the same 1780a suitable value. The memory pointed to by C<path> must point to the same
1478path for as long as the watcher is active. 1781path for as long as the watcher is active.
1479 1782
1480The callback will be receive C<EV_STAT> when a change was detected, 1783The callback will receive C<EV_STAT> when a change was detected, relative
1481relative to the attributes at the time the watcher was started (or the 1784to the attributes at the time the watcher was started (or the last change
1482last change was detected). 1785was detected).
1483 1786
1484=item ev_stat_stat (ev_stat *) 1787=item ev_stat_stat (loop, ev_stat *)
1485 1788
1486Updates the stat buffer immediately with new values. If you change the 1789Updates the stat buffer immediately with new values. If you change the
1487watched path in your callback, you could call this fucntion to avoid 1790watched path in your callback, you could call this function to avoid
1488detecting this change (while introducing a race condition). Can also be 1791detecting this change (while introducing a race condition if you are not
1489useful simply to find out the new values. 1792the only one changing the path). Can also be useful simply to find out the
1793new values.
1490 1794
1491=item ev_statdata attr [read-only] 1795=item ev_statdata attr [read-only]
1492 1796
1493The most-recently detected attributes of the file. Although the type is of 1797The most-recently detected attributes of the file. Although the type is
1494C<ev_statdata>, this is usually the (or one of the) C<struct stat> types 1798C<ev_statdata>, this is usually the (or one of the) C<struct stat> types
1495suitable for your system. If the C<st_nlink> member is C<0>, then there 1799suitable for your system, but you can only rely on the POSIX-standardised
1800members to be present. If the C<st_nlink> member is C<0>, then there was
1496was some error while C<stat>ing the file. 1801some error while C<stat>ing the file.
1497 1802
1498=item ev_statdata prev [read-only] 1803=item ev_statdata prev [read-only]
1499 1804
1500The previous attributes of the file. The callback gets invoked whenever 1805The previous attributes of the file. The callback gets invoked whenever
1501C<prev> != C<attr>. 1806C<prev> != C<attr>, or, more precisely, one or more of these members
1807differ: C<st_dev>, C<st_ino>, C<st_mode>, C<st_nlink>, C<st_uid>,
1808C<st_gid>, C<st_rdev>, C<st_size>, C<st_atime>, C<st_mtime>, C<st_ctime>.
1502 1809
1503=item ev_tstamp interval [read-only] 1810=item ev_tstamp interval [read-only]
1504 1811
1505The specified interval. 1812The specified interval.
1506 1813
1507=item const char *path [read-only] 1814=item const char *path [read-only]
1508 1815
1509The filesystem path that is being watched. 1816The file system path that is being watched.
1510 1817
1511=back 1818=back
1512 1819
1820=head3 Examples
1821
1513Example: Watch C</etc/passwd> for attribute changes. 1822Example: Watch C</etc/passwd> for attribute changes.
1514 1823
1515 static void 1824 static void
1516 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1825 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1517 { 1826 {
1518 /* /etc/passwd changed in some way */ 1827 /* /etc/passwd changed in some way */
1519 if (w->attr.st_nlink) 1828 if (w->attr.st_nlink)
1520 { 1829 {
1521 printf ("passwd current size %ld\n", (long)w->attr.st_size); 1830 printf ("passwd current size %ld\n", (long)w->attr.st_size);
1522 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime); 1831 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1523 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime); 1832 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1524 } 1833 }
1525 else 1834 else
1526 /* you shalt not abuse printf for puts */ 1835 /* you shalt not abuse printf for puts */
1527 puts ("wow, /etc/passwd is not there, expect problems. " 1836 puts ("wow, /etc/passwd is not there, expect problems. "
1528 "if this is windows, they already arrived\n"); 1837 "if this is windows, they already arrived\n");
1529 } 1838 }
1530 1839
1531 ... 1840 ...
1532 ev_stat passwd; 1841 ev_stat passwd;
1533 1842
1534 ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); 1843 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1535 ev_stat_start (loop, &passwd); 1844 ev_stat_start (loop, &passwd);
1845
1846Example: Like above, but additionally use a one-second delay so we do not
1847miss updates (however, frequent updates will delay processing, too, so
1848one might do the work both on C<ev_stat> callback invocation I<and> on
1849C<ev_timer> callback invocation).
1850
1851 static ev_stat passwd;
1852 static ev_timer timer;
1853
1854 static void
1855 timer_cb (EV_P_ ev_timer *w, int revents)
1856 {
1857 ev_timer_stop (EV_A_ w);
1858
1859 /* now it's one second after the most recent passwd change */
1860 }
1861
1862 static void
1863 stat_cb (EV_P_ ev_stat *w, int revents)
1864 {
1865 /* reset the one-second timer */
1866 ev_timer_again (EV_A_ &timer);
1867 }
1868
1869 ...
1870 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1871 ev_stat_start (loop, &passwd);
1872 ev_timer_init (&timer, timer_cb, 0., 1.02);
1536 1873
1537 1874
1538=head2 C<ev_idle> - when you've got nothing better to do... 1875=head2 C<ev_idle> - when you've got nothing better to do...
1539 1876
1540Idle watchers trigger events when no other events of the same or higher 1877Idle watchers trigger events when no other events of the same or higher
1566kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 1903kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1567believe me. 1904believe me.
1568 1905
1569=back 1906=back
1570 1907
1908=head3 Examples
1909
1571Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 1910Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1572callback, free it. Also, use no error checking, as usual. 1911callback, free it. Also, use no error checking, as usual.
1573 1912
1574 static void 1913 static void
1575 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 1914 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1576 { 1915 {
1577 free (w); 1916 free (w);
1578 // now do something you wanted to do when the program has 1917 // now do something you wanted to do when the program has
1579 // no longer asnything immediate to do. 1918 // no longer anything immediate to do.
1580 } 1919 }
1581 1920
1582 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); 1921 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1583 ev_idle_init (idle_watcher, idle_cb); 1922 ev_idle_init (idle_watcher, idle_cb);
1584 ev_idle_start (loop, idle_cb); 1923 ev_idle_start (loop, idle_cb);
1585 1924
1586 1925
1587=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 1926=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1588 1927
1589Prepare and check watchers are usually (but not always) used in tandem: 1928Prepare and check watchers are usually (but not always) used in tandem:
1608 1947
1609This is done by examining in each prepare call which file descriptors need 1948This is done by examining in each prepare call which file descriptors need
1610to be watched by the other library, registering C<ev_io> watchers for 1949to be watched by the other library, registering C<ev_io> watchers for
1611them and starting an C<ev_timer> watcher for any timeouts (many libraries 1950them and starting an C<ev_timer> watcher for any timeouts (many libraries
1612provide just this functionality). Then, in the check watcher you check for 1951provide just this functionality). Then, in the check watcher you check for
1613any events that occured (by checking the pending status of all watchers 1952any events that occurred (by checking the pending status of all watchers
1614and stopping them) and call back into the library. The I/O and timer 1953and stopping them) and call back into the library. The I/O and timer
1615callbacks will never actually be called (but must be valid nevertheless, 1954callbacks will never actually be called (but must be valid nevertheless,
1616because you never know, you know?). 1955because you never know, you know?).
1617 1956
1618As another example, the Perl Coro module uses these hooks to integrate 1957As another example, the Perl Coro module uses these hooks to integrate
1626 1965
1627It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 1966It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1628priority, to ensure that they are being run before any other watchers 1967priority, to ensure that they are being run before any other watchers
1629after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, 1968after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1630too) should not activate ("feed") events into libev. While libev fully 1969too) should not activate ("feed") events into libev. While libev fully
1631supports this, they will be called before other C<ev_check> watchers 1970supports this, they might get executed before other C<ev_check> watchers
1632did their job. As C<ev_check> watchers are often used to embed other 1971did their job. As C<ev_check> watchers are often used to embed other
1633(non-libev) event loops those other event loops might be in an unusable 1972(non-libev) event loops those other event loops might be in an unusable
1634state until their C<ev_check> watcher ran (always remind yourself to 1973state until their C<ev_check> watcher ran (always remind yourself to
1635coexist peacefully with others). 1974coexist peacefully with others).
1636 1975
1646parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1985parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1647macros, but using them is utterly, utterly and completely pointless. 1986macros, but using them is utterly, utterly and completely pointless.
1648 1987
1649=back 1988=back
1650 1989
1990=head3 Examples
1991
1651There are a number of principal ways to embed other event loops or modules 1992There are a number of principal ways to embed other event loops or modules
1652into libev. Here are some ideas on how to include libadns into libev 1993into libev. Here are some ideas on how to include libadns into libev
1653(there is a Perl module named C<EV::ADNS> that does this, which you could 1994(there is a Perl module named C<EV::ADNS> that does this, which you could
1654use for an actually working example. Another Perl module named C<EV::Glib> 1995use as a working example. Another Perl module named C<EV::Glib> embeds a
1655embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV 1996Glib main context into libev, and finally, C<Glib::EV> embeds EV into the
1656into the Glib event loop). 1997Glib event loop).
1657 1998
1658Method 1: Add IO watchers and a timeout watcher in a prepare handler, 1999Method 1: Add IO watchers and a timeout watcher in a prepare handler,
1659and in a check watcher, destroy them and call into libadns. What follows 2000and in a check watcher, destroy them and call into libadns. What follows
1660is pseudo-code only of course. This requires you to either use a low 2001is pseudo-code only of course. This requires you to either use a low
1661priority for the check watcher or use C<ev_clear_pending> explicitly, as 2002priority for the check watcher or use C<ev_clear_pending> explicitly, as
1662the callbacks for the IO/timeout watchers might not have been called yet. 2003the callbacks for the IO/timeout watchers might not have been called yet.
1663 2004
1664 static ev_io iow [nfd]; 2005 static ev_io iow [nfd];
1665 static ev_timer tw; 2006 static ev_timer tw;
1666 2007
1667 static void 2008 static void
1668 io_cb (ev_loop *loop, ev_io *w, int revents) 2009 io_cb (ev_loop *loop, ev_io *w, int revents)
1669 { 2010 {
1670 } 2011 }
1671 2012
1672 // create io watchers for each fd and a timer before blocking 2013 // create io watchers for each fd and a timer before blocking
1673 static void 2014 static void
1674 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 2015 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1675 { 2016 {
1676 int timeout = 3600000; 2017 int timeout = 3600000;
1677 struct pollfd fds [nfd]; 2018 struct pollfd fds [nfd];
1678 // actual code will need to loop here and realloc etc. 2019 // actual code will need to loop here and realloc etc.
1679 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2020 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1680 2021
1681 /* the callback is illegal, but won't be called as we stop during check */ 2022 /* the callback is illegal, but won't be called as we stop during check */
1682 ev_timer_init (&tw, 0, timeout * 1e-3); 2023 ev_timer_init (&tw, 0, timeout * 1e-3);
1683 ev_timer_start (loop, &tw); 2024 ev_timer_start (loop, &tw);
1684 2025
1685 // create one ev_io per pollfd 2026 // create one ev_io per pollfd
1686 for (int i = 0; i < nfd; ++i) 2027 for (int i = 0; i < nfd; ++i)
1687 { 2028 {
1688 ev_io_init (iow + i, io_cb, fds [i].fd, 2029 ev_io_init (iow + i, io_cb, fds [i].fd,
1689 ((fds [i].events & POLLIN ? EV_READ : 0) 2030 ((fds [i].events & POLLIN ? EV_READ : 0)
1690 | (fds [i].events & POLLOUT ? EV_WRITE : 0))); 2031 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1691 2032
1692 fds [i].revents = 0; 2033 fds [i].revents = 0;
1693 ev_io_start (loop, iow + i); 2034 ev_io_start (loop, iow + i);
1694 } 2035 }
1695 } 2036 }
1696 2037
1697 // stop all watchers after blocking 2038 // stop all watchers after blocking
1698 static void 2039 static void
1699 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 2040 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1700 { 2041 {
1701 ev_timer_stop (loop, &tw); 2042 ev_timer_stop (loop, &tw);
1702 2043
1703 for (int i = 0; i < nfd; ++i) 2044 for (int i = 0; i < nfd; ++i)
1704 { 2045 {
1705 // set the relevant poll flags 2046 // set the relevant poll flags
1706 // could also call adns_processreadable etc. here 2047 // could also call adns_processreadable etc. here
1707 struct pollfd *fd = fds + i; 2048 struct pollfd *fd = fds + i;
1708 int revents = ev_clear_pending (iow + i); 2049 int revents = ev_clear_pending (iow + i);
1709 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN; 2050 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1710 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT; 2051 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1711 2052
1712 // now stop the watcher 2053 // now stop the watcher
1713 ev_io_stop (loop, iow + i); 2054 ev_io_stop (loop, iow + i);
1714 } 2055 }
1715 2056
1716 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); 2057 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1717 } 2058 }
1718 2059
1719Method 2: This would be just like method 1, but you run C<adns_afterpoll> 2060Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1720in the prepare watcher and would dispose of the check watcher. 2061in the prepare watcher and would dispose of the check watcher.
1721 2062
1722Method 3: If the module to be embedded supports explicit event 2063Method 3: If the module to be embedded supports explicit event
1723notification (adns does), you can also make use of the actual watcher 2064notification (libadns does), you can also make use of the actual watcher
1724callbacks, and only destroy/create the watchers in the prepare watcher. 2065callbacks, and only destroy/create the watchers in the prepare watcher.
1725 2066
1726 static void 2067 static void
1727 timer_cb (EV_P_ ev_timer *w, int revents) 2068 timer_cb (EV_P_ ev_timer *w, int revents)
1728 { 2069 {
1729 adns_state ads = (adns_state)w->data; 2070 adns_state ads = (adns_state)w->data;
1730 update_now (EV_A); 2071 update_now (EV_A);
1731 2072
1732 adns_processtimeouts (ads, &tv_now); 2073 adns_processtimeouts (ads, &tv_now);
1733 } 2074 }
1734 2075
1735 static void 2076 static void
1736 io_cb (EV_P_ ev_io *w, int revents) 2077 io_cb (EV_P_ ev_io *w, int revents)
1737 { 2078 {
1738 adns_state ads = (adns_state)w->data; 2079 adns_state ads = (adns_state)w->data;
1739 update_now (EV_A); 2080 update_now (EV_A);
1740 2081
1741 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now); 2082 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1742 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now); 2083 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1743 } 2084 }
1744 2085
1745 // do not ever call adns_afterpoll 2086 // do not ever call adns_afterpoll
1746 2087
1747Method 4: Do not use a prepare or check watcher because the module you 2088Method 4: Do not use a prepare or check watcher because the module you
1748want to embed is too inflexible to support it. Instead, youc na override 2089want to embed is too inflexible to support it. Instead, you can override
1749their poll function. The drawback with this solution is that the main 2090their poll function. The drawback with this solution is that the main
1750loop is now no longer controllable by EV. The C<Glib::EV> module does 2091loop is now no longer controllable by EV. The C<Glib::EV> module does
1751this. 2092this.
1752 2093
1753 static gint 2094 static gint
1754 event_poll_func (GPollFD *fds, guint nfds, gint timeout) 2095 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
1755 { 2096 {
1756 int got_events = 0; 2097 int got_events = 0;
1757 2098
1758 for (n = 0; n < nfds; ++n) 2099 for (n = 0; n < nfds; ++n)
1759 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events 2100 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
1760 2101
1761 if (timeout >= 0) 2102 if (timeout >= 0)
1762 // create/start timer 2103 // create/start timer
1763 2104
1764 // poll 2105 // poll
1765 ev_loop (EV_A_ 0); 2106 ev_loop (EV_A_ 0);
1766 2107
1767 // stop timer again 2108 // stop timer again
1768 if (timeout >= 0) 2109 if (timeout >= 0)
1769 ev_timer_stop (EV_A_ &to); 2110 ev_timer_stop (EV_A_ &to);
1770 2111
1771 // stop io watchers again - their callbacks should have set 2112 // stop io watchers again - their callbacks should have set
1772 for (n = 0; n < nfds; ++n) 2113 for (n = 0; n < nfds; ++n)
1773 ev_io_stop (EV_A_ iow [n]); 2114 ev_io_stop (EV_A_ iow [n]);
1774 2115
1775 return got_events; 2116 return got_events;
1776 } 2117 }
1777 2118
1778 2119
1779=head2 C<ev_embed> - when one backend isn't enough... 2120=head2 C<ev_embed> - when one backend isn't enough...
1780 2121
1781This is a rather advanced watcher type that lets you embed one event loop 2122This is a rather advanced watcher type that lets you embed one event loop
1823portable one. 2164portable one.
1824 2165
1825So when you want to use this feature you will always have to be prepared 2166So when you want to use this feature you will always have to be prepared
1826that you cannot get an embeddable loop. The recommended way to get around 2167that you cannot get an embeddable loop. The recommended way to get around
1827this is to have a separate variables for your embeddable loop, try to 2168this is to have a separate variables for your embeddable loop, try to
1828create it, and if that fails, use the normal loop for everything: 2169create it, and if that fails, use the normal loop for everything.
1829
1830 struct ev_loop *loop_hi = ev_default_init (0);
1831 struct ev_loop *loop_lo = 0;
1832 struct ev_embed embed;
1833
1834 // see if there is a chance of getting one that works
1835 // (remember that a flags value of 0 means autodetection)
1836 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
1837 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
1838 : 0;
1839
1840 // if we got one, then embed it, otherwise default to loop_hi
1841 if (loop_lo)
1842 {
1843 ev_embed_init (&embed, 0, loop_lo);
1844 ev_embed_start (loop_hi, &embed);
1845 }
1846 else
1847 loop_lo = loop_hi;
1848 2170
1849=head3 Watcher-Specific Functions and Data Members 2171=head3 Watcher-Specific Functions and Data Members
1850 2172
1851=over 4 2173=over 4
1852 2174
1856 2178
1857Configures the watcher to embed the given loop, which must be 2179Configures the watcher to embed the given loop, which must be
1858embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 2180embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1859invoked automatically, otherwise it is the responsibility of the callback 2181invoked automatically, otherwise it is the responsibility of the callback
1860to invoke it (it will continue to be called until the sweep has been done, 2182to invoke it (it will continue to be called until the sweep has been done,
1861if you do not want thta, you need to temporarily stop the embed watcher). 2183if you do not want that, you need to temporarily stop the embed watcher).
1862 2184
1863=item ev_embed_sweep (loop, ev_embed *) 2185=item ev_embed_sweep (loop, ev_embed *)
1864 2186
1865Make a single, non-blocking sweep over the embedded loop. This works 2187Make a single, non-blocking sweep over the embedded loop. This works
1866similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2188similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1867apropriate way for embedded loops. 2189appropriate way for embedded loops.
1868 2190
1869=item struct ev_loop *other [read-only] 2191=item struct ev_loop *other [read-only]
1870 2192
1871The embedded event loop. 2193The embedded event loop.
1872 2194
1873=back 2195=back
2196
2197=head3 Examples
2198
2199Example: Try to get an embeddable event loop and embed it into the default
2200event loop. If that is not possible, use the default loop. The default
2201loop is stored in C<loop_hi>, while the embeddable loop is stored in
2202C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2203used).
2204
2205 struct ev_loop *loop_hi = ev_default_init (0);
2206 struct ev_loop *loop_lo = 0;
2207 struct ev_embed embed;
2208
2209 // see if there is a chance of getting one that works
2210 // (remember that a flags value of 0 means autodetection)
2211 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2212 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2213 : 0;
2214
2215 // if we got one, then embed it, otherwise default to loop_hi
2216 if (loop_lo)
2217 {
2218 ev_embed_init (&embed, 0, loop_lo);
2219 ev_embed_start (loop_hi, &embed);
2220 }
2221 else
2222 loop_lo = loop_hi;
2223
2224Example: Check if kqueue is available but not recommended and create
2225a kqueue backend for use with sockets (which usually work with any
2226kqueue implementation). Store the kqueue/socket-only event loop in
2227C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2228
2229 struct ev_loop *loop = ev_default_init (0);
2230 struct ev_loop *loop_socket = 0;
2231 struct ev_embed embed;
2232
2233 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2234 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2235 {
2236 ev_embed_init (&embed, 0, loop_socket);
2237 ev_embed_start (loop, &embed);
2238 }
2239
2240 if (!loop_socket)
2241 loop_socket = loop;
2242
2243 // now use loop_socket for all sockets, and loop for everything else
1874 2244
1875 2245
1876=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2246=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1877 2247
1878Fork watchers are called when a C<fork ()> was detected (usually because 2248Fork watchers are called when a C<fork ()> was detected (usually because
1894believe me. 2264believe me.
1895 2265
1896=back 2266=back
1897 2267
1898 2268
2269=head2 C<ev_async> - how to wake up another event loop
2270
2271In general, you cannot use an C<ev_loop> from multiple threads or other
2272asynchronous sources such as signal handlers (as opposed to multiple event
2273loops - those are of course safe to use in different threads).
2274
2275Sometimes, however, you need to wake up another event loop you do not
2276control, for example because it belongs to another thread. This is what
2277C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you
2278can signal it by calling C<ev_async_send>, which is thread- and signal
2279safe.
2280
2281This functionality is very similar to C<ev_signal> watchers, as signals,
2282too, are asynchronous in nature, and signals, too, will be compressed
2283(i.e. the number of callback invocations may be less than the number of
2284C<ev_async_sent> calls).
2285
2286Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
2287just the default loop.
2288
2289=head3 Queueing
2290
2291C<ev_async> does not support queueing of data in any way. The reason
2292is that the author does not know of a simple (or any) algorithm for a
2293multiple-writer-single-reader queue that works in all cases and doesn't
2294need elaborate support such as pthreads.
2295
2296That means that if you want to queue data, you have to provide your own
2297queue. But at least I can tell you would implement locking around your
2298queue:
2299
2300=over 4
2301
2302=item queueing from a signal handler context
2303
2304To implement race-free queueing, you simply add to the queue in the signal
2305handler but you block the signal handler in the watcher callback. Here is an example that does that for
2306some fictitious SIGUSR1 handler:
2307
2308 static ev_async mysig;
2309
2310 static void
2311 sigusr1_handler (void)
2312 {
2313 sometype data;
2314
2315 // no locking etc.
2316 queue_put (data);
2317 ev_async_send (EV_DEFAULT_ &mysig);
2318 }
2319
2320 static void
2321 mysig_cb (EV_P_ ev_async *w, int revents)
2322 {
2323 sometype data;
2324 sigset_t block, prev;
2325
2326 sigemptyset (&block);
2327 sigaddset (&block, SIGUSR1);
2328 sigprocmask (SIG_BLOCK, &block, &prev);
2329
2330 while (queue_get (&data))
2331 process (data);
2332
2333 if (sigismember (&prev, SIGUSR1)
2334 sigprocmask (SIG_UNBLOCK, &block, 0);
2335 }
2336
2337(Note: pthreads in theory requires you to use C<pthread_setmask>
2338instead of C<sigprocmask> when you use threads, but libev doesn't do it
2339either...).
2340
2341=item queueing from a thread context
2342
2343The strategy for threads is different, as you cannot (easily) block
2344threads but you can easily preempt them, so to queue safely you need to
2345employ a traditional mutex lock, such as in this pthread example:
2346
2347 static ev_async mysig;
2348 static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER;
2349
2350 static void
2351 otherthread (void)
2352 {
2353 // only need to lock the actual queueing operation
2354 pthread_mutex_lock (&mymutex);
2355 queue_put (data);
2356 pthread_mutex_unlock (&mymutex);
2357
2358 ev_async_send (EV_DEFAULT_ &mysig);
2359 }
2360
2361 static void
2362 mysig_cb (EV_P_ ev_async *w, int revents)
2363 {
2364 pthread_mutex_lock (&mymutex);
2365
2366 while (queue_get (&data))
2367 process (data);
2368
2369 pthread_mutex_unlock (&mymutex);
2370 }
2371
2372=back
2373
2374
2375=head3 Watcher-Specific Functions and Data Members
2376
2377=over 4
2378
2379=item ev_async_init (ev_async *, callback)
2380
2381Initialises and configures the async watcher - it has no parameters of any
2382kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,
2383believe me.
2384
2385=item ev_async_send (loop, ev_async *)
2386
2387Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2388an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2389C<ev_feed_event>, this call is safe to do in other threads, signal or
2390similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2391section below on what exactly this means).
2392
2393This call incurs the overhead of a system call only once per loop iteration,
2394so while the overhead might be noticeable, it doesn't apply to repeated
2395calls to C<ev_async_send>.
2396
2397=item bool = ev_async_pending (ev_async *)
2398
2399Returns a non-zero value when C<ev_async_send> has been called on the
2400watcher but the event has not yet been processed (or even noted) by the
2401event loop.
2402
2403C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2404the loop iterates next and checks for the watcher to have become active,
2405it will reset the flag again. C<ev_async_pending> can be used to very
2406quickly check whether invoking the loop might be a good idea.
2407
2408Not that this does I<not> check whether the watcher itself is pending, only
2409whether it has been requested to make this watcher pending.
2410
2411=back
2412
2413
1899=head1 OTHER FUNCTIONS 2414=head1 OTHER FUNCTIONS
1900 2415
1901There are some other functions of possible interest. Described. Here. Now. 2416There are some other functions of possible interest. Described. Here. Now.
1902 2417
1903=over 4 2418=over 4
1910or timeout without having to allocate/configure/start/stop/free one or 2425or timeout without having to allocate/configure/start/stop/free one or
1911more watchers yourself. 2426more watchers yourself.
1912 2427
1913If C<fd> is less than 0, then no I/O watcher will be started and events 2428If C<fd> is less than 0, then no I/O watcher will be started and events
1914is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and 2429is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
1915C<events> set will be craeted and started. 2430C<events> set will be created and started.
1916 2431
1917If C<timeout> is less than 0, then no timeout watcher will be 2432If C<timeout> is less than 0, then no timeout watcher will be
1918started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 2433started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
1919repeat = 0) will be started. While C<0> is a valid timeout, it is of 2434repeat = 0) will be started. While C<0> is a valid timeout, it is of
1920dubious value. 2435dubious value.
1922The callback has the type C<void (*cb)(int revents, void *arg)> and gets 2437The callback has the type C<void (*cb)(int revents, void *arg)> and gets
1923passed an C<revents> set like normal event callbacks (a combination of 2438passed an C<revents> set like normal event callbacks (a combination of
1924C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 2439C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
1925value passed to C<ev_once>: 2440value passed to C<ev_once>:
1926 2441
1927 static void stdin_ready (int revents, void *arg) 2442 static void stdin_ready (int revents, void *arg)
1928 { 2443 {
1929 if (revents & EV_TIMEOUT) 2444 if (revents & EV_TIMEOUT)
1930 /* doh, nothing entered */; 2445 /* doh, nothing entered */;
1931 else if (revents & EV_READ) 2446 else if (revents & EV_READ)
1932 /* stdin might have data for us, joy! */; 2447 /* stdin might have data for us, joy! */;
1933 } 2448 }
1934 2449
1935 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 2450 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
1936 2451
1937=item ev_feed_event (ev_loop *, watcher *, int revents) 2452=item ev_feed_event (ev_loop *, watcher *, int revents)
1938 2453
1939Feeds the given event set into the event loop, as if the specified event 2454Feeds the given event set into the event loop, as if the specified event
1940had happened for the specified watcher (which must be a pointer to an 2455had happened for the specified watcher (which must be a pointer to an
1945Feed an event on the given fd, as if a file descriptor backend detected 2460Feed an event on the given fd, as if a file descriptor backend detected
1946the given events it. 2461the given events it.
1947 2462
1948=item ev_feed_signal_event (ev_loop *loop, int signum) 2463=item ev_feed_signal_event (ev_loop *loop, int signum)
1949 2464
1950Feed an event as if the given signal occured (C<loop> must be the default 2465Feed an event as if the given signal occurred (C<loop> must be the default
1951loop!). 2466loop!).
1952 2467
1953=back 2468=back
1954 2469
1955 2470
1971 2486
1972=item * Priorities are not currently supported. Initialising priorities 2487=item * Priorities are not currently supported. Initialising priorities
1973will fail and all watchers will have the same priority, even though there 2488will fail and all watchers will have the same priority, even though there
1974is an ev_pri field. 2489is an ev_pri field.
1975 2490
2491=item * In libevent, the last base created gets the signals, in libev, the
2492first base created (== the default loop) gets the signals.
2493
1976=item * Other members are not supported. 2494=item * Other members are not supported.
1977 2495
1978=item * The libev emulation is I<not> ABI compatible to libevent, you need 2496=item * The libev emulation is I<not> ABI compatible to libevent, you need
1979to use the libev header file and library. 2497to use the libev header file and library.
1980 2498
1981=back 2499=back
1982 2500
1983=head1 C++ SUPPORT 2501=head1 C++ SUPPORT
1984 2502
1985Libev comes with some simplistic wrapper classes for C++ that mainly allow 2503Libev comes with some simplistic wrapper classes for C++ that mainly allow
1986you to use some convinience methods to start/stop watchers and also change 2504you to use some convenience methods to start/stop watchers and also change
1987the callback model to a model using method callbacks on objects. 2505the callback model to a model using method callbacks on objects.
1988 2506
1989To use it, 2507To use it,
1990 2508
1991 #include <ev++.h> 2509 #include <ev++.h>
1992 2510
1993This automatically includes F<ev.h> and puts all of its definitions (many 2511This automatically includes F<ev.h> and puts all of its definitions (many
1994of them macros) into the global namespace. All C++ specific things are 2512of them macros) into the global namespace. All C++ specific things are
1995put into the C<ev> namespace. It should support all the same embedding 2513put into the C<ev> namespace. It should support all the same embedding
1996options as F<ev.h>, most notably C<EV_MULTIPLICITY>. 2514options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
2063your compiler is good :), then the method will be fully inlined into the 2581your compiler is good :), then the method will be fully inlined into the
2064thunking function, making it as fast as a direct C callback. 2582thunking function, making it as fast as a direct C callback.
2065 2583
2066Example: simple class declaration and watcher initialisation 2584Example: simple class declaration and watcher initialisation
2067 2585
2068 struct myclass 2586 struct myclass
2069 { 2587 {
2070 void io_cb (ev::io &w, int revents) { } 2588 void io_cb (ev::io &w, int revents) { }
2071 } 2589 }
2072 2590
2073 myclass obj; 2591 myclass obj;
2074 ev::io iow; 2592 ev::io iow;
2075 iow.set <myclass, &myclass::io_cb> (&obj); 2593 iow.set <myclass, &myclass::io_cb> (&obj);
2076 2594
2077=item w->set<function> (void *data = 0) 2595=item w->set<function> (void *data = 0)
2078 2596
2079Also sets a callback, but uses a static method or plain function as 2597Also sets a callback, but uses a static method or plain function as
2080callback. The optional C<data> argument will be stored in the watcher's 2598callback. The optional C<data> argument will be stored in the watcher's
2084 2602
2085See the method-C<set> above for more details. 2603See the method-C<set> above for more details.
2086 2604
2087Example: 2605Example:
2088 2606
2089 static void io_cb (ev::io &w, int revents) { } 2607 static void io_cb (ev::io &w, int revents) { }
2090 iow.set <io_cb> (); 2608 iow.set <io_cb> ();
2091 2609
2092=item w->set (struct ev_loop *) 2610=item w->set (struct ev_loop *)
2093 2611
2094Associates a different C<struct ev_loop> with this watcher. You can only 2612Associates a different C<struct ev_loop> with this watcher. You can only
2095do this when the watcher is inactive (and not pending either). 2613do this when the watcher is inactive (and not pending either).
2096 2614
2097=item w->set ([args]) 2615=item w->set ([arguments])
2098 2616
2099Basically the same as C<ev_TYPE_set>, with the same args. Must be 2617Basically the same as C<ev_TYPE_set>, with the same arguments. Must be
2100called at least once. Unlike the C counterpart, an active watcher gets 2618called at least once. Unlike the C counterpart, an active watcher gets
2101automatically stopped and restarted when reconfiguring it with this 2619automatically stopped and restarted when reconfiguring it with this
2102method. 2620method.
2103 2621
2104=item w->start () 2622=item w->start ()
2128=back 2646=back
2129 2647
2130Example: Define a class with an IO and idle watcher, start one of them in 2648Example: Define a class with an IO and idle watcher, start one of them in
2131the constructor. 2649the constructor.
2132 2650
2133 class myclass 2651 class myclass
2134 { 2652 {
2135 ev_io io; void io_cb (ev::io &w, int revents); 2653 ev::io io; void io_cb (ev::io &w, int revents);
2136 ev_idle idle void idle_cb (ev::idle &w, int revents); 2654 ev:idle idle void idle_cb (ev::idle &w, int revents);
2137 2655
2138 myclass (); 2656 myclass (int fd)
2139 } 2657 {
2140
2141 myclass::myclass (int fd)
2142 {
2143 io .set <myclass, &myclass::io_cb > (this); 2658 io .set <myclass, &myclass::io_cb > (this);
2144 idle.set <myclass, &myclass::idle_cb> (this); 2659 idle.set <myclass, &myclass::idle_cb> (this);
2145 2660
2146 io.start (fd, ev::READ); 2661 io.start (fd, ev::READ);
2662 }
2147 } 2663 };
2664
2665
2666=head1 OTHER LANGUAGE BINDINGS
2667
2668Libev does not offer other language bindings itself, but bindings for a
2669number of languages exist in the form of third-party packages. If you know
2670any interesting language binding in addition to the ones listed here, drop
2671me a note.
2672
2673=over 4
2674
2675=item Perl
2676
2677The EV module implements the full libev API and is actually used to test
2678libev. EV is developed together with libev. Apart from the EV core module,
2679there are additional modules that implement libev-compatible interfaces
2680to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the
2681C<libglib> event core (C<Glib::EV> and C<EV::Glib>).
2682
2683It can be found and installed via CPAN, its homepage is at
2684L<http://software.schmorp.de/pkg/EV>.
2685
2686=item Python
2687
2688Python bindings can be found at L<http://code.google.com/p/pyev/>. It
2689seems to be quite complete and well-documented. Note, however, that the
2690patch they require for libev is outright dangerous as it breaks the ABI
2691for everybody else, and therefore, should never be applied in an installed
2692libev (if python requires an incompatible ABI then it needs to embed
2693libev).
2694
2695=item Ruby
2696
2697Tony Arcieri has written a ruby extension that offers access to a subset
2698of the libev API and adds file handle abstractions, asynchronous DNS and
2699more on top of it. It can be found via gem servers. Its homepage is at
2700L<http://rev.rubyforge.org/>.
2701
2702=item D
2703
2704Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2705be found at L<http://proj.llucax.com.ar/wiki/evd>.
2706
2707=back
2148 2708
2149 2709
2150=head1 MACRO MAGIC 2710=head1 MACRO MAGIC
2151 2711
2152Libev can be compiled with a variety of options, the most fundamantal 2712Libev can be compiled with a variety of options, the most fundamental
2153of which is C<EV_MULTIPLICITY>. This option determines whether (most) 2713of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2154functions and callbacks have an initial C<struct ev_loop *> argument. 2714functions and callbacks have an initial C<struct ev_loop *> argument.
2155 2715
2156To make it easier to write programs that cope with either variant, the 2716To make it easier to write programs that cope with either variant, the
2157following macros are defined: 2717following macros are defined:
2162 2722
2163This provides the loop I<argument> for functions, if one is required ("ev 2723This provides the loop I<argument> for functions, if one is required ("ev
2164loop argument"). The C<EV_A> form is used when this is the sole argument, 2724loop argument"). The C<EV_A> form is used when this is the sole argument,
2165C<EV_A_> is used when other arguments are following. Example: 2725C<EV_A_> is used when other arguments are following. Example:
2166 2726
2167 ev_unref (EV_A); 2727 ev_unref (EV_A);
2168 ev_timer_add (EV_A_ watcher); 2728 ev_timer_add (EV_A_ watcher);
2169 ev_loop (EV_A_ 0); 2729 ev_loop (EV_A_ 0);
2170 2730
2171It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 2731It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2172which is often provided by the following macro. 2732which is often provided by the following macro.
2173 2733
2174=item C<EV_P>, C<EV_P_> 2734=item C<EV_P>, C<EV_P_>
2175 2735
2176This provides the loop I<parameter> for functions, if one is required ("ev 2736This provides the loop I<parameter> for functions, if one is required ("ev
2177loop parameter"). The C<EV_P> form is used when this is the sole parameter, 2737loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2178C<EV_P_> is used when other parameters are following. Example: 2738C<EV_P_> is used when other parameters are following. Example:
2179 2739
2180 // this is how ev_unref is being declared 2740 // this is how ev_unref is being declared
2181 static void ev_unref (EV_P); 2741 static void ev_unref (EV_P);
2182 2742
2183 // this is how you can declare your typical callback 2743 // this is how you can declare your typical callback
2184 static void cb (EV_P_ ev_timer *w, int revents) 2744 static void cb (EV_P_ ev_timer *w, int revents)
2185 2745
2186It declares a parameter C<loop> of type C<struct ev_loop *>, quite 2746It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2187suitable for use with C<EV_A>. 2747suitable for use with C<EV_A>.
2188 2748
2189=item C<EV_DEFAULT>, C<EV_DEFAULT_> 2749=item C<EV_DEFAULT>, C<EV_DEFAULT_>
2190 2750
2191Similar to the other two macros, this gives you the value of the default 2751Similar to the other two macros, this gives you the value of the default
2192loop, if multiple loops are supported ("ev loop default"). 2752loop, if multiple loops are supported ("ev loop default").
2753
2754=item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_>
2755
2756Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the
2757default loop has been initialised (C<UC> == unchecked). Their behaviour
2758is undefined when the default loop has not been initialised by a previous
2759execution of C<EV_DEFAULT>, C<EV_DEFAULT_> or C<ev_default_init (...)>.
2760
2761It is often prudent to use C<EV_DEFAULT> when initialising the first
2762watcher in a function but use C<EV_DEFAULT_UC> afterwards.
2193 2763
2194=back 2764=back
2195 2765
2196Example: Declare and initialise a check watcher, utilising the above 2766Example: Declare and initialise a check watcher, utilising the above
2197macros so it will work regardless of whether multiple loops are supported 2767macros so it will work regardless of whether multiple loops are supported
2198or not. 2768or not.
2199 2769
2200 static void 2770 static void
2201 check_cb (EV_P_ ev_timer *w, int revents) 2771 check_cb (EV_P_ ev_timer *w, int revents)
2202 { 2772 {
2203 ev_check_stop (EV_A_ w); 2773 ev_check_stop (EV_A_ w);
2204 } 2774 }
2205 2775
2206 ev_check check; 2776 ev_check check;
2207 ev_check_init (&check, check_cb); 2777 ev_check_init (&check, check_cb);
2208 ev_check_start (EV_DEFAULT_ &check); 2778 ev_check_start (EV_DEFAULT_ &check);
2209 ev_loop (EV_DEFAULT_ 0); 2779 ev_loop (EV_DEFAULT_ 0);
2210 2780
2211=head1 EMBEDDING 2781=head1 EMBEDDING
2212 2782
2213Libev can (and often is) directly embedded into host 2783Libev can (and often is) directly embedded into host
2214applications. Examples of applications that embed it include the Deliantra 2784applications. Examples of applications that embed it include the Deliantra
2221libev somewhere in your source tree). 2791libev somewhere in your source tree).
2222 2792
2223=head2 FILESETS 2793=head2 FILESETS
2224 2794
2225Depending on what features you need you need to include one or more sets of files 2795Depending on what features you need you need to include one or more sets of files
2226in your app. 2796in your application.
2227 2797
2228=head3 CORE EVENT LOOP 2798=head3 CORE EVENT LOOP
2229 2799
2230To include only the libev core (all the C<ev_*> functions), with manual 2800To include only the libev core (all the C<ev_*> functions), with manual
2231configuration (no autoconf): 2801configuration (no autoconf):
2232 2802
2233 #define EV_STANDALONE 1 2803 #define EV_STANDALONE 1
2234 #include "ev.c" 2804 #include "ev.c"
2235 2805
2236This will automatically include F<ev.h>, too, and should be done in a 2806This will automatically include F<ev.h>, too, and should be done in a
2237single C source file only to provide the function implementations. To use 2807single C source file only to provide the function implementations. To use
2238it, do the same for F<ev.h> in all files wishing to use this API (best 2808it, do the same for F<ev.h> in all files wishing to use this API (best
2239done by writing a wrapper around F<ev.h> that you can include instead and 2809done by writing a wrapper around F<ev.h> that you can include instead and
2240where you can put other configuration options): 2810where you can put other configuration options):
2241 2811
2242 #define EV_STANDALONE 1 2812 #define EV_STANDALONE 1
2243 #include "ev.h" 2813 #include "ev.h"
2244 2814
2245Both header files and implementation files can be compiled with a C++ 2815Both header files and implementation files can be compiled with a C++
2246compiler (at least, thats a stated goal, and breakage will be treated 2816compiler (at least, thats a stated goal, and breakage will be treated
2247as a bug). 2817as a bug).
2248 2818
2249You need the following files in your source tree, or in a directory 2819You need the following files in your source tree, or in a directory
2250in your include path (e.g. in libev/ when using -Ilibev): 2820in your include path (e.g. in libev/ when using -Ilibev):
2251 2821
2252 ev.h 2822 ev.h
2253 ev.c 2823 ev.c
2254 ev_vars.h 2824 ev_vars.h
2255 ev_wrap.h 2825 ev_wrap.h
2256 2826
2257 ev_win32.c required on win32 platforms only 2827 ev_win32.c required on win32 platforms only
2258 2828
2259 ev_select.c only when select backend is enabled (which is enabled by default) 2829 ev_select.c only when select backend is enabled (which is enabled by default)
2260 ev_poll.c only when poll backend is enabled (disabled by default) 2830 ev_poll.c only when poll backend is enabled (disabled by default)
2261 ev_epoll.c only when the epoll backend is enabled (disabled by default) 2831 ev_epoll.c only when the epoll backend is enabled (disabled by default)
2262 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 2832 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2263 ev_port.c only when the solaris port backend is enabled (disabled by default) 2833 ev_port.c only when the solaris port backend is enabled (disabled by default)
2264 2834
2265F<ev.c> includes the backend files directly when enabled, so you only need 2835F<ev.c> includes the backend files directly when enabled, so you only need
2266to compile this single file. 2836to compile this single file.
2267 2837
2268=head3 LIBEVENT COMPATIBILITY API 2838=head3 LIBEVENT COMPATIBILITY API
2269 2839
2270To include the libevent compatibility API, also include: 2840To include the libevent compatibility API, also include:
2271 2841
2272 #include "event.c" 2842 #include "event.c"
2273 2843
2274in the file including F<ev.c>, and: 2844in the file including F<ev.c>, and:
2275 2845
2276 #include "event.h" 2846 #include "event.h"
2277 2847
2278in the files that want to use the libevent API. This also includes F<ev.h>. 2848in the files that want to use the libevent API. This also includes F<ev.h>.
2279 2849
2280You need the following additional files for this: 2850You need the following additional files for this:
2281 2851
2282 event.h 2852 event.h
2283 event.c 2853 event.c
2284 2854
2285=head3 AUTOCONF SUPPORT 2855=head3 AUTOCONF SUPPORT
2286 2856
2287Instead of using C<EV_STANDALONE=1> and providing your config in 2857Instead of using C<EV_STANDALONE=1> and providing your configuration in
2288whatever way you want, you can also C<m4_include([libev.m4])> in your 2858whatever way you want, you can also C<m4_include([libev.m4])> in your
2289F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then 2859F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2290include F<config.h> and configure itself accordingly. 2860include F<config.h> and configure itself accordingly.
2291 2861
2292For this of course you need the m4 file: 2862For this of course you need the m4 file:
2293 2863
2294 libev.m4 2864 libev.m4
2295 2865
2296=head2 PREPROCESSOR SYMBOLS/MACROS 2866=head2 PREPROCESSOR SYMBOLS/MACROS
2297 2867
2298Libev can be configured via a variety of preprocessor symbols you have to define 2868Libev can be configured via a variety of preprocessor symbols you have to
2299before including any of its files. The default is not to build for multiplicity 2869define before including any of its files. The default in the absence of
2300and only include the select backend. 2870autoconf is noted for every option.
2301 2871
2302=over 4 2872=over 4
2303 2873
2304=item EV_STANDALONE 2874=item EV_STANDALONE
2305 2875
2310F<event.h> that are not directly supported by the libev core alone. 2880F<event.h> that are not directly supported by the libev core alone.
2311 2881
2312=item EV_USE_MONOTONIC 2882=item EV_USE_MONOTONIC
2313 2883
2314If defined to be C<1>, libev will try to detect the availability of the 2884If defined to be C<1>, libev will try to detect the availability of the
2315monotonic clock option at both compiletime and runtime. Otherwise no use 2885monotonic clock option at both compile time and runtime. Otherwise no use
2316of the monotonic clock option will be attempted. If you enable this, you 2886of the monotonic clock option will be attempted. If you enable this, you
2317usually have to link against librt or something similar. Enabling it when 2887usually have to link against librt or something similar. Enabling it when
2318the functionality isn't available is safe, though, although you have 2888the functionality isn't available is safe, though, although you have
2319to make sure you link against any libraries where the C<clock_gettime> 2889to make sure you link against any libraries where the C<clock_gettime>
2320function is hiding in (often F<-lrt>). 2890function is hiding in (often F<-lrt>).
2321 2891
2322=item EV_USE_REALTIME 2892=item EV_USE_REALTIME
2323 2893
2324If defined to be C<1>, libev will try to detect the availability of the 2894If defined to be C<1>, libev will try to detect the availability of the
2325realtime clock option at compiletime (and assume its availability at 2895real-time clock option at compile time (and assume its availability at
2326runtime if successful). Otherwise no use of the realtime clock option will 2896runtime if successful). Otherwise no use of the real-time clock option will
2327be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2897be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2328(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the 2898(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2329note about libraries in the description of C<EV_USE_MONOTONIC>, though. 2899note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2330 2900
2331=item EV_USE_NANOSLEEP 2901=item EV_USE_NANOSLEEP
2332 2902
2333If defined to be C<1>, libev will assume that C<nanosleep ()> is available 2903If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2334and will use it for delays. Otherwise it will use C<select ()>. 2904and will use it for delays. Otherwise it will use C<select ()>.
2335 2905
2906=item EV_USE_EVENTFD
2907
2908If defined to be C<1>, then libev will assume that C<eventfd ()> is
2909available and will probe for kernel support at runtime. This will improve
2910C<ev_signal> and C<ev_async> performance and reduce resource consumption.
2911If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc
29122.7 or newer, otherwise disabled.
2913
2336=item EV_USE_SELECT 2914=item EV_USE_SELECT
2337 2915
2338If undefined or defined to be C<1>, libev will compile in support for the 2916If undefined or defined to be C<1>, libev will compile in support for the
2339C<select>(2) backend. No attempt at autodetection will be done: if no 2917C<select>(2) backend. No attempt at auto-detection will be done: if no
2340other method takes over, select will be it. Otherwise the select backend 2918other method takes over, select will be it. Otherwise the select backend
2341will not be compiled in. 2919will not be compiled in.
2342 2920
2343=item EV_SELECT_USE_FD_SET 2921=item EV_SELECT_USE_FD_SET
2344 2922
2345If defined to C<1>, then the select backend will use the system C<fd_set> 2923If defined to C<1>, then the select backend will use the system C<fd_set>
2346structure. This is useful if libev doesn't compile due to a missing 2924structure. This is useful if libev doesn't compile due to a missing
2347C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on 2925C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on
2348exotic systems. This usually limits the range of file descriptors to some 2926exotic systems. This usually limits the range of file descriptors to some
2349low limit such as 1024 or might have other limitations (winsocket only 2927low limit such as 1024 or might have other limitations (winsocket only
2350allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 2928allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2351influence the size of the C<fd_set> used. 2929influence the size of the C<fd_set> used.
2352 2930
2358be used is the winsock select). This means that it will call 2936be used is the winsock select). This means that it will call
2359C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 2937C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2360it is assumed that all these functions actually work on fds, even 2938it is assumed that all these functions actually work on fds, even
2361on win32. Should not be defined on non-win32 platforms. 2939on win32. Should not be defined on non-win32 platforms.
2362 2940
2941=item EV_FD_TO_WIN32_HANDLE
2942
2943If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
2944file descriptors to socket handles. When not defining this symbol (the
2945default), then libev will call C<_get_osfhandle>, which is usually
2946correct. In some cases, programs use their own file descriptor management,
2947in which case they can provide this function to map fds to socket handles.
2948
2363=item EV_USE_POLL 2949=item EV_USE_POLL
2364 2950
2365If defined to be C<1>, libev will compile in support for the C<poll>(2) 2951If defined to be C<1>, libev will compile in support for the C<poll>(2)
2366backend. Otherwise it will be enabled on non-win32 platforms. It 2952backend. Otherwise it will be enabled on non-win32 platforms. It
2367takes precedence over select. 2953takes precedence over select.
2368 2954
2369=item EV_USE_EPOLL 2955=item EV_USE_EPOLL
2370 2956
2371If defined to be C<1>, libev will compile in support for the Linux 2957If defined to be C<1>, libev will compile in support for the Linux
2372C<epoll>(7) backend. Its availability will be detected at runtime, 2958C<epoll>(7) backend. Its availability will be detected at runtime,
2373otherwise another method will be used as fallback. This is the 2959otherwise another method will be used as fallback. This is the preferred
2374preferred backend for GNU/Linux systems. 2960backend for GNU/Linux systems. If undefined, it will be enabled if the
2961headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
2375 2962
2376=item EV_USE_KQUEUE 2963=item EV_USE_KQUEUE
2377 2964
2378If defined to be C<1>, libev will compile in support for the BSD style 2965If defined to be C<1>, libev will compile in support for the BSD style
2379C<kqueue>(2) backend. Its actual availability will be detected at runtime, 2966C<kqueue>(2) backend. Its actual availability will be detected at runtime,
2392otherwise another method will be used as fallback. This is the preferred 2979otherwise another method will be used as fallback. This is the preferred
2393backend for Solaris 10 systems. 2980backend for Solaris 10 systems.
2394 2981
2395=item EV_USE_DEVPOLL 2982=item EV_USE_DEVPOLL
2396 2983
2397reserved for future expansion, works like the USE symbols above. 2984Reserved for future expansion, works like the USE symbols above.
2398 2985
2399=item EV_USE_INOTIFY 2986=item EV_USE_INOTIFY
2400 2987
2401If defined to be C<1>, libev will compile in support for the Linux inotify 2988If defined to be C<1>, libev will compile in support for the Linux inotify
2402interface to speed up C<ev_stat> watchers. Its actual availability will 2989interface to speed up C<ev_stat> watchers. Its actual availability will
2403be detected at runtime. 2990be detected at runtime. If undefined, it will be enabled if the headers
2991indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
2992
2993=item EV_ATOMIC_T
2994
2995Libev requires an integer type (suitable for storing C<0> or C<1>) whose
2996access is atomic with respect to other threads or signal contexts. No such
2997type is easily found in the C language, so you can provide your own type
2998that you know is safe for your purposes. It is used both for signal handler "locking"
2999as well as for signal and thread safety in C<ev_async> watchers.
3000
3001In the absence of this define, libev will use C<sig_atomic_t volatile>
3002(from F<signal.h>), which is usually good enough on most platforms.
2404 3003
2405=item EV_H 3004=item EV_H
2406 3005
2407The name of the F<ev.h> header file used to include it. The default if 3006The name of the F<ev.h> header file used to include it. The default if
2408undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This 3007undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
2409can be used to virtually rename the F<ev.h> header file in case of conflicts. 3008used to virtually rename the F<ev.h> header file in case of conflicts.
2410 3009
2411=item EV_CONFIG_H 3010=item EV_CONFIG_H
2412 3011
2413If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 3012If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2414F<ev.c>'s idea of where to find the F<config.h> file, similarly to 3013F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2415C<EV_H>, above. 3014C<EV_H>, above.
2416 3015
2417=item EV_EVENT_H 3016=item EV_EVENT_H
2418 3017
2419Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 3018Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2420of how the F<event.h> header can be found. 3019of how the F<event.h> header can be found, the default is C<"event.h">.
2421 3020
2422=item EV_PROTOTYPES 3021=item EV_PROTOTYPES
2423 3022
2424If defined to be C<0>, then F<ev.h> will not define any function 3023If defined to be C<0>, then F<ev.h> will not define any function
2425prototypes, but still define all the structs and other symbols. This is 3024prototypes, but still define all the structs and other symbols. This is
2446When doing priority-based operations, libev usually has to linearly search 3045When doing priority-based operations, libev usually has to linearly search
2447all the priorities, so having many of them (hundreds) uses a lot of space 3046all the priorities, so having many of them (hundreds) uses a lot of space
2448and time, so using the defaults of five priorities (-2 .. +2) is usually 3047and time, so using the defaults of five priorities (-2 .. +2) is usually
2449fine. 3048fine.
2450 3049
2451If your embedding app does not need any priorities, defining these both to 3050If your embedding application does not need any priorities, defining these both to
2452C<0> will save some memory and cpu. 3051C<0> will save some memory and CPU.
2453 3052
2454=item EV_PERIODIC_ENABLE 3053=item EV_PERIODIC_ENABLE
2455 3054
2456If undefined or defined to be C<1>, then periodic timers are supported. If 3055If undefined or defined to be C<1>, then periodic timers are supported. If
2457defined to be C<0>, then they are not. Disabling them saves a few kB of 3056defined to be C<0>, then they are not. Disabling them saves a few kB of
2476=item EV_FORK_ENABLE 3075=item EV_FORK_ENABLE
2477 3076
2478If undefined or defined to be C<1>, then fork watchers are supported. If 3077If undefined or defined to be C<1>, then fork watchers are supported. If
2479defined to be C<0>, then they are not. 3078defined to be C<0>, then they are not.
2480 3079
3080=item EV_ASYNC_ENABLE
3081
3082If undefined or defined to be C<1>, then async watchers are supported. If
3083defined to be C<0>, then they are not.
3084
2481=item EV_MINIMAL 3085=item EV_MINIMAL
2482 3086
2483If you need to shave off some kilobytes of code at the expense of some 3087If you need to shave off some kilobytes of code at the expense of some
2484speed, define this symbol to C<1>. Currently only used for gcc to override 3088speed, define this symbol to C<1>. Currently this is used to override some
2485some inlining decisions, saves roughly 30% codesize of amd64. 3089inlining decisions, saves roughly 30% code size on amd64. It also selects a
3090much smaller 2-heap for timer management over the default 4-heap.
2486 3091
2487=item EV_PID_HASHSIZE 3092=item EV_PID_HASHSIZE
2488 3093
2489C<ev_child> watchers use a small hash table to distribute workload by 3094C<ev_child> watchers use a small hash table to distribute workload by
2490pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 3095pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2491than enough. If you need to manage thousands of children you might want to 3096than enough. If you need to manage thousands of children you might want to
2492increase this value (I<must> be a power of two). 3097increase this value (I<must> be a power of two).
2493 3098
2494=item EV_INOTIFY_HASHSIZE 3099=item EV_INOTIFY_HASHSIZE
2495 3100
2496C<ev_staz> watchers use a small hash table to distribute workload by 3101C<ev_stat> watchers use a small hash table to distribute workload by
2497inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 3102inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2498usually more than enough. If you need to manage thousands of C<ev_stat> 3103usually more than enough. If you need to manage thousands of C<ev_stat>
2499watchers you might want to increase this value (I<must> be a power of 3104watchers you might want to increase this value (I<must> be a power of
2500two). 3105two).
2501 3106
3107=item EV_USE_4HEAP
3108
3109Heaps are not very cache-efficient. To improve the cache-efficiency of the
3110timer and periodics heap, libev uses a 4-heap when this symbol is defined
3111to C<1>. The 4-heap uses more complicated (longer) code but has
3112noticeably faster performance with many (thousands) of watchers.
3113
3114The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3115(disabled).
3116
3117=item EV_HEAP_CACHE_AT
3118
3119Heaps are not very cache-efficient. To improve the cache-efficiency of the
3120timer and periodics heap, libev can cache the timestamp (I<at>) within
3121the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3122which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3123but avoids random read accesses on heap changes. This improves performance
3124noticeably with with many (hundreds) of watchers.
3125
3126The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3127(disabled).
3128
3129=item EV_VERIFY
3130
3131Controls how much internal verification (see C<ev_loop_verify ()>) will
3132be done: If set to C<0>, no internal verification code will be compiled
3133in. If set to C<1>, then verification code will be compiled in, but not
3134called. If set to C<2>, then the internal verification code will be
3135called once per loop, which can slow down libev. If set to C<3>, then the
3136verification code will be called very frequently, which will slow down
3137libev considerably.
3138
3139The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be
3140C<0.>
3141
2502=item EV_COMMON 3142=item EV_COMMON
2503 3143
2504By default, all watchers have a C<void *data> member. By redefining 3144By default, all watchers have a C<void *data> member. By redefining
2505this macro to a something else you can include more and other types of 3145this macro to a something else you can include more and other types of
2506members. You have to define it each time you include one of the files, 3146members. You have to define it each time you include one of the files,
2507though, and it must be identical each time. 3147though, and it must be identical each time.
2508 3148
2509For example, the perl EV module uses something like this: 3149For example, the perl EV module uses something like this:
2510 3150
2511 #define EV_COMMON \ 3151 #define EV_COMMON \
2512 SV *self; /* contains this struct */ \ 3152 SV *self; /* contains this struct */ \
2513 SV *cb_sv, *fh /* note no trailing ";" */ 3153 SV *cb_sv, *fh /* note no trailing ";" */
2514 3154
2515=item EV_CB_DECLARE (type) 3155=item EV_CB_DECLARE (type)
2516 3156
2517=item EV_CB_INVOKE (watcher, revents) 3157=item EV_CB_INVOKE (watcher, revents)
2518 3158
2525avoid the C<struct ev_loop *> as first argument in all cases, or to use 3165avoid the C<struct ev_loop *> as first argument in all cases, or to use
2526method calls instead of plain function calls in C++. 3166method calls instead of plain function calls in C++.
2527 3167
2528=head2 EXPORTED API SYMBOLS 3168=head2 EXPORTED API SYMBOLS
2529 3169
2530If you need to re-export the API (e.g. via a dll) and you need a list of 3170If you need to re-export the API (e.g. via a DLL) and you need a list of
2531exported symbols, you can use the provided F<Symbol.*> files which list 3171exported symbols, you can use the provided F<Symbol.*> files which list
2532all public symbols, one per line: 3172all public symbols, one per line:
2533 3173
2534 Symbols.ev for libev proper 3174 Symbols.ev for libev proper
2535 Symbols.event for the libevent emulation 3175 Symbols.event for the libevent emulation
2536 3176
2537This can also be used to rename all public symbols to avoid clashes with 3177This can also be used to rename all public symbols to avoid clashes with
2538multiple versions of libev linked together (which is obviously bad in 3178multiple versions of libev linked together (which is obviously bad in
2539itself, but sometimes it is inconvinient to avoid this). 3179itself, but sometimes it is inconvenient to avoid this).
2540 3180
2541A sed command like this will create wrapper C<#define>'s that you need to 3181A sed command like this will create wrapper C<#define>'s that you need to
2542include before including F<ev.h>: 3182include before including F<ev.h>:
2543 3183
2544 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h 3184 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2561file. 3201file.
2562 3202
2563The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 3203The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
2564that everybody includes and which overrides some configure choices: 3204that everybody includes and which overrides some configure choices:
2565 3205
2566 #define EV_MINIMAL 1 3206 #define EV_MINIMAL 1
2567 #define EV_USE_POLL 0 3207 #define EV_USE_POLL 0
2568 #define EV_MULTIPLICITY 0 3208 #define EV_MULTIPLICITY 0
2569 #define EV_PERIODIC_ENABLE 0 3209 #define EV_PERIODIC_ENABLE 0
2570 #define EV_STAT_ENABLE 0 3210 #define EV_STAT_ENABLE 0
2571 #define EV_FORK_ENABLE 0 3211 #define EV_FORK_ENABLE 0
2572 #define EV_CONFIG_H <config.h> 3212 #define EV_CONFIG_H <config.h>
2573 #define EV_MINPRI 0 3213 #define EV_MINPRI 0
2574 #define EV_MAXPRI 0 3214 #define EV_MAXPRI 0
2575 3215
2576 #include "ev++.h" 3216 #include "ev++.h"
2577 3217
2578And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 3218And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
2579 3219
2580 #include "ev_cpp.h" 3220 #include "ev_cpp.h"
2581 #include "ev.c" 3221 #include "ev.c"
3222
3223
3224=head1 THREADS AND COROUTINES
3225
3226=head2 THREADS
3227
3228Libev itself is completely thread-safe, but it uses no locking. This
3229means that you can use as many loops as you want in parallel, as long as
3230only one thread ever calls into one libev function with the same loop
3231parameter.
3232
3233Or put differently: calls with different loop parameters can be done in
3234parallel from multiple threads, calls with the same loop parameter must be
3235done serially (but can be done from different threads, as long as only one
3236thread ever is inside a call at any point in time, e.g. by using a mutex
3237per loop).
3238
3239If you want to know which design (one loop, locking, or multiple loops
3240without or something else still) is best for your problem, then I cannot
3241help you. I can give some generic advice however:
3242
3243=over 4
3244
3245=item * most applications have a main thread: use the default libev loop
3246in that thread, or create a separate thread running only the default loop.
3247
3248This helps integrating other libraries or software modules that use libev
3249themselves and don't care/know about threading.
3250
3251=item * one loop per thread is usually a good model.
3252
3253Doing this is almost never wrong, sometimes a better-performance model
3254exists, but it is always a good start.
3255
3256=item * other models exist, such as the leader/follower pattern, where one
3257loop is handed through multiple threads in a kind of round-robin fashion.
3258
3259Choosing a model is hard - look around, learn, know that usually you can do
3260better than you currently do :-)
3261
3262=item * often you need to talk to some other thread which blocks in the
3263event loop - C<ev_async> watchers can be used to wake them up from other
3264threads safely (or from signal contexts...).
3265
3266=back
3267
3268=head2 COROUTINES
3269
3270Libev is much more accommodating to coroutines ("cooperative threads"):
3271libev fully supports nesting calls to it's functions from different
3272coroutines (e.g. you can call C<ev_loop> on the same loop from two
3273different coroutines and switch freely between both coroutines running the
3274loop, as long as you don't confuse yourself). The only exception is that
3275you must not do this from C<ev_periodic> reschedule callbacks.
3276
3277Care has been invested into making sure that libev does not keep local
3278state inside C<ev_loop>, and other calls do not usually allow coroutine
3279switches.
2582 3280
2583 3281
2584=head1 COMPLEXITIES 3282=head1 COMPLEXITIES
2585 3283
2586In this section the complexities of (many of) the algorithms used inside 3284In this section the complexities of (many of) the algorithms used inside
2597 3295
2598=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 3296=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2599 3297
2600This means that, when you have a watcher that triggers in one hour and 3298This means that, when you have a watcher that triggers in one hour and
2601there are 100 watchers that would trigger before that then inserting will 3299there are 100 watchers that would trigger before that then inserting will
2602have to skip those 100 watchers. 3300have to skip roughly seven (C<ld 100>) of these watchers.
2603 3301
2604=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 3302=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2605 3303
2606That means that for changing a timer costs less than removing/adding them 3304That means that changing a timer costs less than removing/adding them
2607as only the relative motion in the event queue has to be paid for. 3305as only the relative motion in the event queue has to be paid for.
2608 3306
2609=item Starting io/check/prepare/idle/signal/child watchers: O(1) 3307=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
2610 3308
2611These just add the watcher into an array or at the head of a list. 3309These just add the watcher into an array or at the head of a list.
3310
2612=item Stopping check/prepare/idle watchers: O(1) 3311=item Stopping check/prepare/idle/fork/async watchers: O(1)
2613 3312
2614=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 3313=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2615 3314
2616These watchers are stored in lists then need to be walked to find the 3315These watchers are stored in lists then need to be walked to find the
2617correct watcher to remove. The lists are usually short (you don't usually 3316correct watcher to remove. The lists are usually short (you don't usually
2618have many watchers waiting for the same fd or signal). 3317have many watchers waiting for the same fd or signal).
2619 3318
2620=item Finding the next timer per loop iteration: O(1) 3319=item Finding the next timer in each loop iteration: O(1)
3320
3321By virtue of using a binary or 4-heap, the next timer is always found at a
3322fixed position in the storage array.
2621 3323
2622=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 3324=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2623 3325
2624A change means an I/O watcher gets started or stopped, which requires 3326A change means an I/O watcher gets started or stopped, which requires
2625libev to recalculate its status (and possibly tell the kernel). 3327libev to recalculate its status (and possibly tell the kernel, depending
3328on backend and whether C<ev_io_set> was used).
2626 3329
2627=item Activating one watcher: O(1) 3330=item Activating one watcher (putting it into the pending state): O(1)
2628 3331
2629=item Priority handling: O(number_of_priorities) 3332=item Priority handling: O(number_of_priorities)
2630 3333
2631Priorities are implemented by allocating some space for each 3334Priorities are implemented by allocating some space for each
2632priority. When doing priority-based operations, libev usually has to 3335priority. When doing priority-based operations, libev usually has to
2633linearly search all the priorities. 3336linearly search all the priorities, but starting/stopping and activating
3337watchers becomes O(1) w.r.t. priority handling.
3338
3339=item Sending an ev_async: O(1)
3340
3341=item Processing ev_async_send: O(number_of_async_watchers)
3342
3343=item Processing signals: O(max_signal_number)
3344
3345Sending involves a system call I<iff> there were no other C<ev_async_send>
3346calls in the current loop iteration. Checking for async and signal events
3347involves iterating over all running async watchers or all signal numbers.
2634 3348
2635=back 3349=back
2636 3350
2637 3351
3352=head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
3353
3354Win32 doesn't support any of the standards (e.g. POSIX) that libev
3355requires, and its I/O model is fundamentally incompatible with the POSIX
3356model. Libev still offers limited functionality on this platform in
3357the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3358descriptors. This only applies when using Win32 natively, not when using
3359e.g. cygwin.
3360
3361Lifting these limitations would basically require the full
3362re-implementation of the I/O system. If you are into these kinds of
3363things, then note that glib does exactly that for you in a very portable
3364way (note also that glib is the slowest event library known to man).
3365
3366There is no supported compilation method available on windows except
3367embedding it into other applications.
3368
3369Not a libev limitation but worth mentioning: windows apparently doesn't
3370accept large writes: instead of resulting in a partial write, windows will
3371either accept everything or return C<ENOBUFS> if the buffer is too large,
3372so make sure you only write small amounts into your sockets (less than a
3373megabyte seems safe, but thsi apparently depends on the amount of memory
3374available).
3375
3376Due to the many, low, and arbitrary limits on the win32 platform and
3377the abysmal performance of winsockets, using a large number of sockets
3378is not recommended (and not reasonable). If your program needs to use
3379more than a hundred or so sockets, then likely it needs to use a totally
3380different implementation for windows, as libev offers the POSIX readiness
3381notification model, which cannot be implemented efficiently on windows
3382(Microsoft monopoly games).
3383
3384A typical way to use libev under windows is to embed it (see the embedding
3385section for details) and use the following F<evwrap.h> header file instead
3386of F<ev.h>:
3387
3388 #define EV_STANDALONE /* keeps ev from requiring config.h */
3389 #define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
3390
3391 #include "ev.h"
3392
3393And compile the following F<evwrap.c> file into your project (make sure
3394you do I<not> compile the F<ev.c> or any other embedded soruce files!):
3395
3396 #include "evwrap.h"
3397 #include "ev.c"
3398
3399=over 4
3400
3401=item The winsocket select function
3402
3403The winsocket C<select> function doesn't follow POSIX in that it
3404requires socket I<handles> and not socket I<file descriptors> (it is
3405also extremely buggy). This makes select very inefficient, and also
3406requires a mapping from file descriptors to socket handles (the Microsoft
3407C runtime provides the function C<_open_osfhandle> for this). See the
3408discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
3409C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
3410
3411The configuration for a "naked" win32 using the Microsoft runtime
3412libraries and raw winsocket select is:
3413
3414 #define EV_USE_SELECT 1
3415 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3416
3417Note that winsockets handling of fd sets is O(n), so you can easily get a
3418complexity in the O(n²) range when using win32.
3419
3420=item Limited number of file descriptors
3421
3422Windows has numerous arbitrary (and low) limits on things.
3423
3424Early versions of winsocket's select only supported waiting for a maximum
3425of C<64> handles (probably owning to the fact that all windows kernels
3426can only wait for C<64> things at the same time internally; Microsoft
3427recommends spawning a chain of threads and wait for 63 handles and the
3428previous thread in each. Great).
3429
3430Newer versions support more handles, but you need to define C<FD_SETSIZE>
3431to some high number (e.g. C<2048>) before compiling the winsocket select
3432call (which might be in libev or elsewhere, for example, perl does its own
3433select emulation on windows).
3434
3435Another limit is the number of file descriptors in the Microsoft runtime
3436libraries, which by default is C<64> (there must be a hidden I<64> fetish
3437or something like this inside Microsoft). You can increase this by calling
3438C<_setmaxstdio>, which can increase this limit to C<2048> (another
3439arbitrary limit), but is broken in many versions of the Microsoft runtime
3440libraries.
3441
3442This might get you to about C<512> or C<2048> sockets (depending on
3443windows version and/or the phase of the moon). To get more, you need to
3444wrap all I/O functions and provide your own fd management, but the cost of
3445calling select (O(n²)) will likely make this unworkable.
3446
3447=back
3448
3449
3450=head1 PORTABILITY REQUIREMENTS
3451
3452In addition to a working ISO-C implementation, libev relies on a few
3453additional extensions:
3454
3455=over 4
3456
3457=item C<void (*)(ev_watcher_type *, int revents)> must have compatible
3458calling conventions regardless of C<ev_watcher_type *>.
3459
3460Libev assumes not only that all watcher pointers have the same internal
3461structure (guaranteed by POSIX but not by ISO C for example), but it also
3462assumes that the same (machine) code can be used to call any watcher
3463callback: The watcher callbacks have different type signatures, but libev
3464calls them using an C<ev_watcher *> internally.
3465
3466=item C<sig_atomic_t volatile> must be thread-atomic as well
3467
3468The type C<sig_atomic_t volatile> (or whatever is defined as
3469C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different
3470threads. This is not part of the specification for C<sig_atomic_t>, but is
3471believed to be sufficiently portable.
3472
3473=item C<sigprocmask> must work in a threaded environment
3474
3475Libev uses C<sigprocmask> to temporarily block signals. This is not
3476allowed in a threaded program (C<pthread_sigmask> has to be used). Typical
3477pthread implementations will either allow C<sigprocmask> in the "main
3478thread" or will block signals process-wide, both behaviours would
3479be compatible with libev. Interaction between C<sigprocmask> and
3480C<pthread_sigmask> could complicate things, however.
3481
3482The most portable way to handle signals is to block signals in all threads
3483except the initial one, and run the default loop in the initial thread as
3484well.
3485
3486=item C<long> must be large enough for common memory allocation sizes
3487
3488To improve portability and simplify using libev, libev uses C<long>
3489internally instead of C<size_t> when allocating its data structures. On
3490non-POSIX systems (Microsoft...) this might be unexpectedly low, but
3491is still at least 31 bits everywhere, which is enough for hundreds of
3492millions of watchers.
3493
3494=item C<double> must hold a time value in seconds with enough accuracy
3495
3496The type C<double> is used to represent timestamps. It is required to
3497have at least 51 bits of mantissa (and 9 bits of exponent), which is good
3498enough for at least into the year 4000. This requirement is fulfilled by
3499implementations implementing IEEE 754 (basically all existing ones).
3500
3501=back
3502
3503If you know of other additional requirements drop me a note.
3504
3505
3506=head1 COMPILER WARNINGS
3507
3508Depending on your compiler and compiler settings, you might get no or a
3509lot of warnings when compiling libev code. Some people are apparently
3510scared by this.
3511
3512However, these are unavoidable for many reasons. For one, each compiler
3513has different warnings, and each user has different tastes regarding
3514warning options. "Warn-free" code therefore cannot be a goal except when
3515targeting a specific compiler and compiler-version.
3516
3517Another reason is that some compiler warnings require elaborate
3518workarounds, or other changes to the code that make it less clear and less
3519maintainable.
3520
3521And of course, some compiler warnings are just plain stupid, or simply
3522wrong (because they don't actually warn about the condition their message
3523seems to warn about).
3524
3525While libev is written to generate as few warnings as possible,
3526"warn-free" code is not a goal, and it is recommended not to build libev
3527with any compiler warnings enabled unless you are prepared to cope with
3528them (e.g. by ignoring them). Remember that warnings are just that:
3529warnings, not errors, or proof of bugs.
3530
3531
3532=head1 VALGRIND
3533
3534Valgrind has a special section here because it is a popular tool that is
3535highly useful, but valgrind reports are very hard to interpret.
3536
3537If you think you found a bug (memory leak, uninitialised data access etc.)
3538in libev, then check twice: If valgrind reports something like:
3539
3540 ==2274== definitely lost: 0 bytes in 0 blocks.
3541 ==2274== possibly lost: 0 bytes in 0 blocks.
3542 ==2274== still reachable: 256 bytes in 1 blocks.
3543
3544Then there is no memory leak. Similarly, under some circumstances,
3545valgrind might report kernel bugs as if it were a bug in libev, or it
3546might be confused (it is a very good tool, but only a tool).
3547
3548If you are unsure about something, feel free to contact the mailing list
3549with the full valgrind report and an explanation on why you think this is
3550a bug in libev. However, don't be annoyed when you get a brisk "this is
3551no bug" answer and take the chance of learning how to interpret valgrind
3552properly.
3553
3554If you need, for some reason, empty reports from valgrind for your project
3555I suggest using suppression lists.
3556
3557
2638=head1 AUTHOR 3558=head1 AUTHOR
2639 3559
2640Marc Lehmann <libev@schmorp.de>. 3560Marc Lehmann <libev@schmorp.de>.
2641 3561

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines