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

Comparing libev/ev.pod (file contents):
Revision 1.159 by root, Thu May 22 02:44:57 2008 UTC vs.
Revision 1.188 by root, Tue Sep 30 18:35:47 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=head2 EXAMPLE PROGRAM 9=head2 EXAMPLE PROGRAM
10 10
11 // a single header file is required 11 // a single header file is required
12 #include <ev.h> 12 #include <ev.h>
13 13
14 // every watcher type has its own typedef'd struct 14 // every watcher type has its own typedef'd struct
15 // with the name ev_<type> 15 // with the name ev_<type>
16 ev_io stdin_watcher; 16 ev_io stdin_watcher;
17 ev_timer timeout_watcher; 17 ev_timer timeout_watcher;
18 18
19 // all watcher callbacks have a similar signature 19 // all watcher callbacks have a similar signature
20 // this callback is called when data is readable on stdin 20 // this callback is called when data is readable on stdin
21 static void 21 static void
22 stdin_cb (EV_P_ struct ev_io *w, int revents) 22 stdin_cb (EV_P_ struct ev_io *w, int revents)
23 { 23 {
24 puts ("stdin ready"); 24 puts ("stdin ready");
25 // for one-shot events, one must manually stop the watcher 25 // for one-shot events, one must manually stop the watcher
26 // with its corresponding stop function. 26 // with its corresponding stop function.
27 ev_io_stop (EV_A_ w); 27 ev_io_stop (EV_A_ w);
28 28
29 // this causes all nested ev_loop's to stop iterating 29 // this causes all nested ev_loop's to stop iterating
30 ev_unloop (EV_A_ EVUNLOOP_ALL); 30 ev_unloop (EV_A_ EVUNLOOP_ALL);
31 } 31 }
32 32
33 // another callback, this time for a time-out 33 // another callback, this time for a time-out
34 static void 34 static void
35 timeout_cb (EV_P_ struct ev_timer *w, int revents) 35 timeout_cb (EV_P_ struct ev_timer *w, int revents)
36 { 36 {
37 puts ("timeout"); 37 puts ("timeout");
38 // this causes the innermost ev_loop to stop iterating 38 // this causes the innermost ev_loop to stop iterating
39 ev_unloop (EV_A_ EVUNLOOP_ONE); 39 ev_unloop (EV_A_ EVUNLOOP_ONE);
40 } 40 }
41 41
42 int 42 int
43 main (void) 43 main (void)
44 { 44 {
45 // use the default event loop unless you have special needs 45 // use the default event loop unless you have special needs
46 struct ev_loop *loop = ev_default_loop (0); 46 struct ev_loop *loop = ev_default_loop (0);
47 47
48 // 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 49 // this one will watch for stdin to become readable
50 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);
51 ev_io_start (loop, &stdin_watcher); 51 ev_io_start (loop, &stdin_watcher);
52 52
53 // initialise a timer watcher, then start it 53 // initialise a timer watcher, then start it
54 // simple non-repeating 5.5 second timeout 54 // simple non-repeating 5.5 second timeout
55 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); 55 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
56 ev_timer_start (loop, &timeout_watcher); 56 ev_timer_start (loop, &timeout_watcher);
57 57
58 // now wait for events to arrive 58 // now wait for events to arrive
59 ev_loop (loop, 0); 59 ev_loop (loop, 0);
60 60
61 // unloop was called, so exit 61 // unloop was called, so exit
62 return 0; 62 return 0;
63 } 63 }
64 64
65=head1 DESCRIPTION 65=head1 DESCRIPTION
66 66
67The newest version of this document is also available as an html-formatted 67The newest version of this document is also available as an html-formatted
68web 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
113Libev represents time as a single floating point number, representing the 113Libev represents time as a single floating point number, representing the
114(fractional) number of seconds since the (POSIX) epoch (somewhere near 114(fractional) number of seconds since the (POSIX) epoch (somewhere near
115the 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
116called 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
117to 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
118it, you should treat it as some floatingpoint value. Unlike the name 118it, you should treat it as some floating point value. Unlike the name
119component C<stamp> might indicate, it is also used for time differences 119component C<stamp> might indicate, it is also used for time differences
120throughout 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
121 142
122=head1 GLOBAL FUNCTIONS 143=head1 GLOBAL FUNCTIONS
123 144
124These functions can be called anytime, even before initialising the 145These functions can be called anytime, even before initialising the
125library in any way. 146library in any way.
134 155
135=item ev_sleep (ev_tstamp interval) 156=item ev_sleep (ev_tstamp interval)
136 157
137Sleep for the given interval: The current thread will be blocked until 158Sleep for the given interval: The current thread will be blocked until
138either it is interrupted or the given time interval has passed. Basically 159either it is interrupted or the given time interval has passed. Basically
139this is a subsecond-resolution C<sleep ()>. 160this is a sub-second-resolution C<sleep ()>.
140 161
141=item int ev_version_major () 162=item int ev_version_major ()
142 163
143=item int ev_version_minor () 164=item int ev_version_minor ()
144 165
157not a problem. 178not a problem.
158 179
159Example: Make sure we haven't accidentally been linked against the wrong 180Example: Make sure we haven't accidentally been linked against the wrong
160version. 181version.
161 182
162 assert (("libev version mismatch", 183 assert (("libev version mismatch",
163 ev_version_major () == EV_VERSION_MAJOR 184 ev_version_major () == EV_VERSION_MAJOR
164 && ev_version_minor () >= EV_VERSION_MINOR)); 185 && ev_version_minor () >= EV_VERSION_MINOR));
165 186
166=item unsigned int ev_supported_backends () 187=item unsigned int ev_supported_backends ()
167 188
168Return 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_*>
169value) compiled into this binary of libev (independent of their 190value) compiled into this binary of libev (independent of their
171a description of the set values. 192a description of the set values.
172 193
173Example: 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
174a 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
175 196
176 assert (("sorry, no epoll, no sex", 197 assert (("sorry, no epoll, no sex",
177 ev_supported_backends () & EVBACKEND_EPOLL)); 198 ev_supported_backends () & EVBACKEND_EPOLL));
178 199
179=item unsigned int ev_recommended_backends () 200=item unsigned int ev_recommended_backends ()
180 201
181Return 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
182recommended for this platform. This set is often smaller than the one 203recommended for this platform. This set is often smaller than the one
183returned 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
184most BSDs and will not be autodetected unless you explicitly request it 205most BSDs and will not be auto-detected unless you explicitly request it
185(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
186libev will probe for if you specify no backends explicitly. 207libev will probe for if you specify no backends explicitly.
187 208
188=item unsigned int ev_embeddable_backends () 209=item unsigned int ev_embeddable_backends ()
189 210
193C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for 214C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for
194recommended ones. 215recommended ones.
195 216
196See the description of C<ev_embed> watchers for more info. 217See the description of C<ev_embed> watchers for more info.
197 218
198=item ev_set_allocator (void *(*cb)(void *ptr, long size)) 219=item ev_set_allocator (void *(*cb)(void *ptr, long size)) [NOT REENTRANT]
199 220
200Sets the allocation function to use (the prototype is similar - the 221Sets the allocation function to use (the prototype is similar - the
201semantics are identical to the C<realloc> C89/SuS/POSIX function). It is 222semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
202used to allocate and free memory (no surprises here). If it returns zero 223used to allocate and free memory (no surprises here). If it returns zero
203when memory needs to be allocated (C<size != 0>), the library might abort 224when memory needs to be allocated (C<size != 0>), the library might abort
229 } 250 }
230 251
231 ... 252 ...
232 ev_set_allocator (persistent_realloc); 253 ev_set_allocator (persistent_realloc);
233 254
234=item ev_set_syserr_cb (void (*cb)(const char *msg)); 255=item ev_set_syserr_cb (void (*cb)(const char *msg)); [NOT REENTRANT]
235 256
236Set the callback function to call on a retryable syscall error (such 257Set the callback function to call on a retryable system call error (such
237as failed select, poll, epoll_wait). The message is a printable string 258as failed select, poll, epoll_wait). The message is a printable string
238indicating the system call or subsystem causing the problem. If this 259indicating the system call or subsystem causing the problem. If this
239callback 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
240matter what, when it returns. That is, libev will generally retry the 261matter what, when it returns. That is, libev will generally retry the
241requested 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
242(such as abort). 263(such as abort).
243 264
244Example: This is basically the same thing that libev does internally, too. 265Example: This is basically the same thing that libev does internally, too.
277from multiple threads, you have to lock (note also that this is unlikely, 298from multiple threads, you have to lock (note also that this is unlikely,
278as loops cannot bes hared easily between threads anyway). 299as loops cannot bes hared easily between threads anyway).
279 300
280The default loop is the only loop that can handle C<ev_signal> and 301The default loop is the only loop that can handle C<ev_signal> and
281C<ev_child> watchers, and to do this, it always registers a handler 302C<ev_child> watchers, and to do this, it always registers a handler
282for C<SIGCHLD>. If this is a problem for your app you can either 303for C<SIGCHLD>. If this is a problem for your application you can either
283create a dynamic loop with C<ev_loop_new> that doesn't do that, or you 304create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
284can simply overwrite the C<SIGCHLD> signal handler I<after> calling 305can simply overwrite the C<SIGCHLD> signal handler I<after> calling
285C<ev_default_init>. 306C<ev_default_init>.
286 307
287The flags argument can be used to specify special behaviour or specific 308The flags argument can be used to specify special behaviour or specific
296The 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
297thing, believe me). 318thing, believe me).
298 319
299=item C<EVFLAG_NOENV> 320=item C<EVFLAG_NOENV>
300 321
301If 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
302or setgid) then libev will I<not> look at the environment variable 323or setgid) then libev will I<not> look at the environment variable
303C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 324C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
304override 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
305useful 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
306around bugs. 327around bugs.
313 334
314This works by calling C<getpid ()> on every iteration of the loop, 335This works by calling C<getpid ()> on every iteration of the loop,
315and 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
316iterations and little real work, but is usually not noticeable (on my 337iterations and little real work, but is usually not noticeable (on my
317GNU/Linux 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
318without a syscall and thus I<very> fast, but my GNU/Linux system also has 339without a system call and thus I<very> fast, but my GNU/Linux system also has
319C<pthread_atfork> which is even faster). 340C<pthread_atfork> which is even faster).
320 341
321The 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
322forget about forgetting to tell libev about forking) when you use this 343forget about forgetting to tell libev about forking) when you use this
323flag. 344flag.
324 345
325This 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>
326environment variable. 347environment variable.
327 348
328=item C<EVBACKEND_SELECT> (value 1, portable select backend) 349=item C<EVBACKEND_SELECT> (value 1, portable select backend)
329 350
330This is your standard select(2) backend. Not I<completely> standard, as 351This is your standard select(2) backend. Not I<completely> standard, as
332but 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
333using this backend. It doesn't scale too well (O(highest_fd)), but its 354using this backend. It doesn't scale too well (O(highest_fd)), but its
334usually the fastest backend for a low number of (low-numbered :) fds. 355usually the fastest backend for a low number of (low-numbered :) fds.
335 356
336To get good performance out of this backend you need a high amount of 357To get good performance out of this backend you need a high amount of
337parallelity (most of the file descriptors should be busy). If you are 358parallelism (most of the file descriptors should be busy). If you are
338writing a server, you should C<accept ()> in a loop to accept as many 359writing a server, you should C<accept ()> in a loop to accept as many
339connections as possible during one iteration. You might also want to have 360connections as possible during one iteration. You might also want to have
340a look at C<ev_set_io_collect_interval ()> to increase the amount of 361a look at C<ev_set_io_collect_interval ()> to increase the amount of
341readiness notifications you get per iteration. 362readiness notifications you get per iteration.
363
364This backend maps C<EV_READ> to the C<readfds> set and C<EV_WRITE> to the
365C<writefds> set (and to work around Microsoft Windows bugs, also onto the
366C<exceptfds> set on that platform).
342 367
343=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) 368=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
344 369
345And this is your standard poll(2) backend. It's more complicated 370And this is your standard poll(2) backend. It's more complicated
346than select, but handles sparse fds better and has no artificial 371than select, but handles sparse fds better and has no artificial
347limit on the number of fds you can use (except it will slow down 372limit on the number of fds you can use (except it will slow down
348considerably with a lot of inactive fds). It scales similarly to select, 373considerably with a lot of inactive fds). It scales similarly to select,
349i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for 374i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
350performance tips. 375performance tips.
351 376
377This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
378C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
379
352=item C<EVBACKEND_EPOLL> (value 4, Linux) 380=item C<EVBACKEND_EPOLL> (value 4, Linux)
353 381
354For few fds, this backend is a bit little slower than poll and select, 382For few fds, this backend is a bit little slower than poll and select,
355but it scales phenomenally better. While poll and select usually scale 383but it scales phenomenally better. While poll and select usually scale
356like O(total_fds) where n is the total number of fds (or the highest fd), 384like O(total_fds) where n is the total number of fds (or the highest fd),
357epoll scales either O(1) or O(active_fds). The epoll design has a number 385epoll scales either O(1) or O(active_fds). The epoll design has a number
358of shortcomings, such as silently dropping events in some hard-to-detect 386of shortcomings, such as silently dropping events in some hard-to-detect
359cases and requiring a syscall per fd change, no fork support and bad 387cases and requiring a system call per fd change, no fork support and bad
360support for dup. 388support for dup.
361 389
362While stopping, setting and starting an I/O watcher in the same iteration 390While stopping, setting and starting an I/O watcher in the same iteration
363will result in some caching, there is still a syscall per such incident 391will result in some caching, there is still a system call per such incident
364(because the fd could point to a different file description now), so its 392(because the fd could point to a different file description now), so its
365best to avoid that. Also, C<dup ()>'ed file descriptors might not work 393best to avoid that. Also, C<dup ()>'ed file descriptors might not work
366very well if you register events for both fds. 394very well if you register events for both fds.
367 395
368Please note that epoll sometimes generates spurious notifications, so you 396Please note that epoll sometimes generates spurious notifications, so you
369need to use non-blocking I/O or other means to avoid blocking when no data 397need to use non-blocking I/O or other means to avoid blocking when no data
370(or space) is available. 398(or space) is available.
371 399
372Best performance from this backend is achieved by not unregistering all 400Best performance from this backend is achieved by not unregistering all
373watchers for a file descriptor until it has been closed, if possible, i.e. 401watchers for a file descriptor until it has been closed, if possible,
374keep at least one watcher active per fd at all times. 402i.e. keep at least one watcher active per fd at all times. Stopping and
403starting a watcher (without re-setting it) also usually doesn't cause
404extra overhead.
375 405
376While nominally embeddeble in other event loops, this feature is broken in 406While nominally embeddable in other event loops, this feature is broken in
377all kernel versions tested so far. 407all kernel versions tested so far.
378 408
409This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
410C<EVBACKEND_POLL>.
411
379=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 412=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
380 413
381Kqueue deserves special mention, as at the time of this writing, it 414Kqueue deserves special mention, as at the time of this writing, it was
382was broken on all BSDs except NetBSD (usually it doesn't work reliably 415broken on all BSDs except NetBSD (usually it doesn't work reliably with
383with anything but sockets and pipes, except on Darwin, where of course 416anything but sockets and pipes, except on Darwin, where of course it's
384it's completely useless). For this reason it's not being "autodetected" 417completely useless). For this reason it's not being "auto-detected" unless
385unless you explicitly specify it explicitly in the flags (i.e. using 418you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or
386C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) 419libev was compiled on a known-to-be-good (-enough) system like NetBSD.
387system like NetBSD.
388 420
389You still can embed kqueue into a normal poll or select backend and use it 421You still can embed kqueue into a normal poll or select backend and use it
390only for sockets (after having made sure that sockets work with kqueue on 422only for sockets (after having made sure that sockets work with kqueue on
391the target platform). See C<ev_embed> watchers for more info. 423the target platform). See C<ev_embed> watchers for more info.
392 424
393It scales in the same way as the epoll backend, but the interface to the 425It scales in the same way as the epoll backend, but the interface to the
394kernel is more efficient (which says nothing about its actual speed, of 426kernel is more efficient (which says nothing about its actual speed, of
395course). While stopping, setting and starting an I/O watcher does never 427course). While stopping, setting and starting an I/O watcher does never
396cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to 428cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
397two event changes per incident, support for C<fork ()> is very bad and it 429two event changes per incident. Support for C<fork ()> is very bad and it
398drops fds silently in similarly hard-to-detect cases. 430drops fds silently in similarly hard-to-detect cases.
399 431
400This backend usually performs well under most conditions. 432This backend usually performs well under most conditions.
401 433
402While nominally embeddable in other event loops, this doesn't work 434While nominally embeddable in other event loops, this doesn't work
403everywhere, so you might need to test for this. And since it is broken 435everywhere, so you might need to test for this. And since it is broken
404almost everywhere, you should only use it when you have a lot of sockets 436almost everywhere, you should only use it when you have a lot of sockets
405(for which it usually works), by embedding it into another event loop 437(for which it usually works), by embedding it into another event loop
406(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for 438(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and, did I mention it,
407sockets. 439using it only for sockets.
440
441This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with
442C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with
443C<NOTE_EOF>.
408 444
409=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 445=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
410 446
411This is not implemented yet (and might never be, unless you send me an 447This is not implemented yet (and might never be, unless you send me an
412implementation). According to reports, C</dev/poll> only supports sockets 448implementation). According to reports, C</dev/poll> only supports sockets
416=item C<EVBACKEND_PORT> (value 32, Solaris 10) 452=item C<EVBACKEND_PORT> (value 32, Solaris 10)
417 453
418This uses the Solaris 10 event port mechanism. As with everything on Solaris, 454This uses the Solaris 10 event port mechanism. As with everything on Solaris,
419it's really slow, but it still scales very well (O(active_fds)). 455it's really slow, but it still scales very well (O(active_fds)).
420 456
421Please note that solaris event ports can deliver a lot of spurious 457Please note that Solaris event ports can deliver a lot of spurious
422notifications, so you need to use non-blocking I/O or other means to avoid 458notifications, so you need to use non-blocking I/O or other means to avoid
423blocking when no data (or space) is available. 459blocking when no data (or space) is available.
424 460
425While this backend scales well, it requires one system call per active 461While this backend scales well, it requires one system call per active
426file descriptor per loop iteration. For small and medium numbers of file 462file descriptor per loop iteration. For small and medium numbers of file
427descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend 463descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
428might perform better. 464might perform better.
429 465
430On the positive side, ignoring the spurious readiness notifications, this 466On the positive side, with the exception of the spurious readiness
431backend actually performed to specification in all tests and is fully 467notifications, this backend actually performed fully to specification
432embeddable, which is a rare feat among the OS-specific backends. 468in all tests and is fully embeddable, which is a rare feat among the
469OS-specific backends.
470
471This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
472C<EVBACKEND_POLL>.
433 473
434=item C<EVBACKEND_ALL> 474=item C<EVBACKEND_ALL>
435 475
436Try all backends (even potentially broken ones that wouldn't be tried 476Try all backends (even potentially broken ones that wouldn't be tried
437with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 477with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
439 479
440It is definitely not recommended to use this flag. 480It is definitely not recommended to use this flag.
441 481
442=back 482=back
443 483
444If one or more of these are ored into the flags value, then only these 484If one or more of these are or'ed into the flags value, then only these
445backends will be tried (in the reverse order as listed here). If none are 485backends will be tried (in the reverse order as listed here). If none are
446specified, all backends in C<ev_recommended_backends ()> will be tried. 486specified, all backends in C<ev_recommended_backends ()> will be tried.
447 487
448The most typical usage is like this: 488Example: This is the most typical usage.
449 489
450 if (!ev_default_loop (0)) 490 if (!ev_default_loop (0))
451 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 491 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
452 492
453Restrict libev to the select and poll backends, and do not allow 493Example: Restrict libev to the select and poll backends, and do not allow
454environment settings to be taken into account: 494environment settings to be taken into account:
455 495
456 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV); 496 ev_default_loop (EVBACKEND_POLL | EVBACKEND_SELECT | EVFLAG_NOENV);
457 497
458Use whatever libev has to offer, but make sure that kqueue is used if 498Example: Use whatever libev has to offer, but make sure that kqueue is
459available (warning, breaks stuff, best use only with your own private 499used if available (warning, breaks stuff, best use only with your own
460event loop and only if you know the OS supports your types of fds): 500private event loop and only if you know the OS supports your types of
501fds):
461 502
462 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); 503 ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE);
463 504
464=item struct ev_loop *ev_loop_new (unsigned int flags) 505=item struct ev_loop *ev_loop_new (unsigned int flags)
465 506
466Similar to C<ev_default_loop>, but always creates a new event loop that is 507Similar to C<ev_default_loop>, but always creates a new event loop that is
467always distinct from the default loop. Unlike the default loop, it cannot 508always distinct from the default loop. Unlike the default loop, it cannot
472libev with threads is indeed to create one loop per thread, and using the 513libev with threads is indeed to create one loop per thread, and using the
473default loop in the "main" or "initial" thread. 514default loop in the "main" or "initial" thread.
474 515
475Example: Try to create a event loop that uses epoll and nothing else. 516Example: Try to create a event loop that uses epoll and nothing else.
476 517
477 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); 518 struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV);
478 if (!epoller) 519 if (!epoller)
479 fatal ("no epoll found here, maybe it hides under your chair"); 520 fatal ("no epoll found here, maybe it hides under your chair");
480 521
481=item ev_default_destroy () 522=item ev_default_destroy ()
482 523
483Destroys the default loop again (frees all memory and kernel state 524Destroys the default loop again (frees all memory and kernel state
484etc.). None of the active event watchers will be stopped in the normal 525etc.). None of the active event watchers will be stopped in the normal
485sense, so e.g. C<ev_is_active> might still return true. It is your 526sense, so e.g. C<ev_is_active> might still return true. It is your
486responsibility to either stop all watchers cleanly yoursef I<before> 527responsibility to either stop all watchers cleanly yourself I<before>
487calling this function, or cope with the fact afterwards (which is usually 528calling this function, or cope with the fact afterwards (which is usually
488the easiest thing, you can just ignore the watchers and/or C<free ()> them 529the easiest thing, you can just ignore the watchers and/or C<free ()> them
489for example). 530for example).
490 531
491Note that certain global state, such as signal state, will not be freed by 532Note that certain global state, such as signal state, will not be freed by
523 564
524=item ev_loop_fork (loop) 565=item ev_loop_fork (loop)
525 566
526Like C<ev_default_fork>, but acts on an event loop created by 567Like C<ev_default_fork>, but acts on an event loop created by
527C<ev_loop_new>. Yes, you have to call this on every allocated event loop 568C<ev_loop_new>. Yes, you have to call this on every allocated event loop
528after fork, and how you do this is entirely your own problem. 569after fork that you want to re-use in the child, and how you do this is
570entirely your own problem.
529 571
530=item int ev_is_default_loop (loop) 572=item int ev_is_default_loop (loop)
531 573
532Returns true when the given loop actually is the default loop, false otherwise. 574Returns true when the given loop is, in fact, the default loop, and false
575otherwise.
533 576
534=item unsigned int ev_loop_count (loop) 577=item unsigned int ev_loop_count (loop)
535 578
536Returns the count of loop iterations for the loop, which is identical to 579Returns the count of loop iterations for the loop, which is identical to
537the number of times libev did poll for new events. It starts at C<0> and 580the number of times libev did poll for new events. It starts at C<0> and
552received events and started processing them. This timestamp does not 595received events and started processing them. This timestamp does not
553change as long as callbacks are being processed, and this is also the base 596change as long as callbacks are being processed, and this is also the base
554time used for relative timers. You can treat it as the timestamp of the 597time used for relative timers. You can treat it as the timestamp of the
555event occurring (or more correctly, libev finding out about it). 598event occurring (or more correctly, libev finding out about it).
556 599
600=item ev_now_update (loop)
601
602Establishes the current time by querying the kernel, updating the time
603returned by C<ev_now ()> in the progress. This is a costly operation and
604is usually done automatically within C<ev_loop ()>.
605
606This function is rarely useful, but when some event callback runs for a
607very long time without entering the event loop, updating libev's idea of
608the current time is a good idea.
609
610See also "The special problem of time updates" in the C<ev_timer> section.
611
557=item ev_loop (loop, int flags) 612=item ev_loop (loop, int flags)
558 613
559Finally, this is it, the event handler. This function usually is called 614Finally, this is it, the event handler. This function usually is called
560after you initialised all your watchers and you want to start handling 615after you initialised all your watchers and you want to start handling
561events. 616events.
563If the flags argument is specified as C<0>, it will not return until 618If the flags argument is specified as C<0>, it will not return until
564either no event watchers are active anymore or C<ev_unloop> was called. 619either no event watchers are active anymore or C<ev_unloop> was called.
565 620
566Please note that an explicit C<ev_unloop> is usually better than 621Please note that an explicit C<ev_unloop> is usually better than
567relying on all watchers to be stopped when deciding when a program has 622relying on all watchers to be stopped when deciding when a program has
568finished (especially in interactive programs), but having a program that 623finished (especially in interactive programs), but having a program
569automatically loops as long as it has to and no longer by virtue of 624that automatically loops as long as it has to and no longer by virtue
570relying on its watchers stopping correctly is a thing of beauty. 625of relying on its watchers stopping correctly, that is truly a thing of
626beauty.
571 627
572A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle 628A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle
573those events and any outstanding ones, but will not block your process in 629those events and any already outstanding ones, but will not block your
574case there are no events and will return after one iteration of the loop. 630process in case there are no events and will return after one iteration of
631the loop.
575 632
576A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 633A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
577neccessary) and will handle those and any outstanding ones. It will block 634necessary) and will handle those and any already outstanding ones. It
578your process until at least one new event arrives, and will return after 635will block your process until at least one new event arrives (which could
579one iteration of the loop. This is useful if you are waiting for some 636be an event internal to libev itself, so there is no guarentee that a
580external event in conjunction with something not expressible using other 637user-registered callback will be called), and will return after one
638iteration of the loop.
639
640This is useful if you are waiting for some external event in conjunction
641with something not expressible using other libev watchers (i.e. "roll your
581libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is 642own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is
582usually a better approach for this kind of thing. 643usually a better approach for this kind of thing.
583 644
584Here are the gory details of what C<ev_loop> does: 645Here are the gory details of what C<ev_loop> does:
585 646
586 - Before the first iteration, call any pending watchers. 647 - Before the first iteration, call any pending watchers.
587 * If EVFLAG_FORKCHECK was used, check for a fork. 648 * If EVFLAG_FORKCHECK was used, check for a fork.
588 - If a fork was detected, queue and call all fork watchers. 649 - If a fork was detected (by any means), queue and call all fork watchers.
589 - Queue and call all prepare watchers. 650 - Queue and call all prepare watchers.
590 - If we have been forked, recreate the kernel state. 651 - If we have been forked, detach and recreate the kernel state
652 as to not disturb the other process.
591 - Update the kernel state with all outstanding changes. 653 - Update the kernel state with all outstanding changes.
592 - Update the "event loop time". 654 - Update the "event loop time" (ev_now ()).
593 - Calculate for how long to sleep or block, if at all 655 - Calculate for how long to sleep or block, if at all
594 (active idle watchers, EVLOOP_NONBLOCK or not having 656 (active idle watchers, EVLOOP_NONBLOCK or not having
595 any active watchers at all will result in not sleeping). 657 any active watchers at all will result in not sleeping).
596 - Sleep if the I/O and timer collect interval say so. 658 - Sleep if the I/O and timer collect interval say so.
597 - Block the process, waiting for any events. 659 - Block the process, waiting for any events.
598 - Queue all outstanding I/O (fd) events. 660 - Queue all outstanding I/O (fd) events.
599 - Update the "event loop time" and do time jump handling. 661 - Update the "event loop time" (ev_now ()), and do time jump adjustments.
600 - Queue all outstanding timers. 662 - Queue all expired timers.
601 - Queue all outstanding periodics. 663 - Queue all expired periodics.
602 - If no events are pending now, queue all idle watchers. 664 - Unless any events are pending now, queue all idle watchers.
603 - Queue all check watchers. 665 - Queue all check watchers.
604 - Call all queued watchers in reverse order (i.e. check watchers first). 666 - Call all queued watchers in reverse order (i.e. check watchers first).
605 Signals and child watchers are implemented as I/O watchers, and will 667 Signals and child watchers are implemented as I/O watchers, and will
606 be handled here by queueing them when their watcher gets executed. 668 be handled here by queueing them when their watcher gets executed.
607 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 669 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
612anymore. 674anymore.
613 675
614 ... queue jobs here, make sure they register event watchers as long 676 ... queue jobs here, make sure they register event watchers as long
615 ... as they still have work to do (even an idle watcher will do..) 677 ... as they still have work to do (even an idle watcher will do..)
616 ev_loop (my_loop, 0); 678 ev_loop (my_loop, 0);
617 ... jobs done. yeah! 679 ... jobs done or somebody called unloop. yeah!
618 680
619=item ev_unloop (loop, how) 681=item ev_unloop (loop, how)
620 682
621Can be used to make a call to C<ev_loop> return early (but only after it 683Can be used to make a call to C<ev_loop> return early (but only after it
622has processed all outstanding events). The C<how> argument must be either 684has processed all outstanding events). The C<how> argument must be either
629 691
630=item ev_unref (loop) 692=item ev_unref (loop)
631 693
632Ref/unref can be used to add or remove a reference count on the event 694Ref/unref can be used to add or remove a reference count on the event
633loop: Every watcher keeps one reference, and as long as the reference 695loop: Every watcher keeps one reference, and as long as the reference
634count is nonzero, C<ev_loop> will not return on its own. If you have 696count is nonzero, C<ev_loop> will not return on its own.
697
635a watcher you never unregister that should not keep C<ev_loop> from 698If you have a watcher you never unregister that should not keep C<ev_loop>
636returning, ev_unref() after starting, and ev_ref() before stopping it. For 699from returning, call ev_unref() after starting, and ev_ref() before
700stopping it.
701
637example, libev itself uses this for its internal signal pipe: It is not 702As an example, libev itself uses this for its internal signal pipe: It is
638visible to the libev user and should not keep C<ev_loop> from exiting if 703not visible to the libev user and should not keep C<ev_loop> from exiting
639no event watchers registered by it are active. It is also an excellent 704if no event watchers registered by it are active. It is also an excellent
640way to do this for generic recurring timers or from within third-party 705way to do this for generic recurring timers or from within third-party
641libraries. Just remember to I<unref after start> and I<ref before stop> 706libraries. Just remember to I<unref after start> and I<ref before stop>
642(but only if the watcher wasn't active before, or was active before, 707(but only if the watcher wasn't active before, or was active before,
643respectively). 708respectively).
644 709
645Example: Create a signal watcher, but keep it from keeping C<ev_loop> 710Example: Create a signal watcher, but keep it from keeping C<ev_loop>
646running when nothing else is active. 711running when nothing else is active.
647 712
648 struct ev_signal exitsig; 713 struct ev_signal exitsig;
649 ev_signal_init (&exitsig, sig_cb, SIGINT); 714 ev_signal_init (&exitsig, sig_cb, SIGINT);
650 ev_signal_start (loop, &exitsig); 715 ev_signal_start (loop, &exitsig);
651 evf_unref (loop); 716 evf_unref (loop);
652 717
653Example: For some weird reason, unregister the above signal handler again. 718Example: For some weird reason, unregister the above signal handler again.
654 719
655 ev_ref (loop); 720 ev_ref (loop);
656 ev_signal_stop (loop, &exitsig); 721 ev_signal_stop (loop, &exitsig);
657 722
658=item ev_set_io_collect_interval (loop, ev_tstamp interval) 723=item ev_set_io_collect_interval (loop, ev_tstamp interval)
659 724
660=item ev_set_timeout_collect_interval (loop, ev_tstamp interval) 725=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
661 726
662These advanced functions influence the time that libev will spend waiting 727These advanced functions influence the time that libev will spend waiting
663for events. Both are by default C<0>, meaning that libev will try to 728for events. Both time intervals are by default C<0>, meaning that libev
664invoke timer/periodic callbacks and I/O callbacks with minimum latency. 729will try to invoke timer/periodic callbacks and I/O callbacks with minimum
730latency.
665 731
666Setting these to a higher value (the C<interval> I<must> be >= C<0>) 732Setting these to a higher value (the C<interval> I<must> be >= C<0>)
667allows libev to delay invocation of I/O and timer/periodic callbacks to 733allows libev to delay invocation of I/O and timer/periodic callbacks
668increase efficiency of loop iterations. 734to increase efficiency of loop iterations (or to increase power-saving
735opportunities).
669 736
670The background is that sometimes your program runs just fast enough to 737The idea is that sometimes your program runs just fast enough to handle
671handle one (or very few) event(s) per loop iteration. While this makes 738one (or very few) event(s) per loop iteration. While this makes the
672the program responsive, it also wastes a lot of CPU time to poll for new 739program responsive, it also wastes a lot of CPU time to poll for new
673events, especially with backends like C<select ()> which have a high 740events, especially with backends like C<select ()> which have a high
674overhead for the actual polling but can deliver many events at once. 741overhead for the actual polling but can deliver many events at once.
675 742
676By setting a higher I<io collect interval> you allow libev to spend more 743By setting a higher I<io collect interval> you allow libev to spend more
677time collecting I/O events, so you can handle more events per iteration, 744time collecting I/O events, so you can handle more events per iteration,
679C<ev_timer>) will be not affected. Setting this to a non-null value will 746C<ev_timer>) will be not affected. Setting this to a non-null value will
680introduce an additional C<ev_sleep ()> call into most loop iterations. 747introduce an additional C<ev_sleep ()> call into most loop iterations.
681 748
682Likewise, by setting a higher I<timeout collect interval> you allow libev 749Likewise, by setting a higher I<timeout collect interval> you allow libev
683to spend more time collecting timeouts, at the expense of increased 750to spend more time collecting timeouts, at the expense of increased
684latency (the watcher callback will be called later). C<ev_io> watchers 751latency/jitter/inexactness (the watcher callback will be called
685will not be affected. Setting this to a non-null value will not introduce 752later). C<ev_io> watchers will not be affected. Setting this to a non-null
686any overhead in libev. 753value will not introduce any overhead in libev.
687 754
688Many (busy) programs can usually benefit by setting the io collect 755Many (busy) programs can usually benefit by setting the I/O collect
689interval to a value near C<0.1> or so, which is often enough for 756interval to a value near C<0.1> or so, which is often enough for
690interactive servers (of course not for games), likewise for timeouts. It 757interactive servers (of course not for games), likewise for timeouts. It
691usually doesn't make much sense to set it to a lower value than C<0.01>, 758usually doesn't make much sense to set it to a lower value than C<0.01>,
692as this approsaches the timing granularity of most systems. 759as this approaches the timing granularity of most systems.
760
761Setting the I<timeout collect interval> can improve the opportunity for
762saving power, as the program will "bundle" timer callback invocations that
763are "near" in time together, by delaying some, thus reducing the number of
764times the process sleeps and wakes up again. Another useful technique to
765reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
766they fire on, say, one-second boundaries only.
693 767
694=item ev_loop_verify (loop) 768=item ev_loop_verify (loop)
695 769
696This function only does something when C<EV_VERIFY> support has been 770This function only does something when C<EV_VERIFY> support has been
697compiled in. It tries to go through all internal structures and checks 771compiled in. which is the default for non-minimal builds. It tries to go
698them for validity. If anything is found to be inconsistent, it will print 772through all internal structures and checks them for validity. If anything
699an error message to standard error and call C<abort ()>. 773is found to be inconsistent, it will print an error message to standard
774error and call C<abort ()>.
700 775
701This can be used to catch bugs inside libev itself: under normal 776This can be used to catch bugs inside libev itself: under normal
702circumstances, this function will never abort as of course libev keeps its 777circumstances, this function will never abort as of course libev keeps its
703data structures consistent. 778data structures consistent.
704 779
709 784
710A watcher is a structure that you create and register to record your 785A watcher is a structure that you create and register to record your
711interest in some event. For instance, if you want to wait for STDIN to 786interest in some event. For instance, if you want to wait for STDIN to
712become readable, you would create an C<ev_io> watcher for that: 787become readable, you would create an C<ev_io> watcher for that:
713 788
714 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents) 789 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents)
715 { 790 {
716 ev_io_stop (w); 791 ev_io_stop (w);
717 ev_unloop (loop, EVUNLOOP_ALL); 792 ev_unloop (loop, EVUNLOOP_ALL);
718 } 793 }
719 794
720 struct ev_loop *loop = ev_default_loop (0); 795 struct ev_loop *loop = ev_default_loop (0);
721 struct ev_io stdin_watcher; 796 struct ev_io stdin_watcher;
722 ev_init (&stdin_watcher, my_cb); 797 ev_init (&stdin_watcher, my_cb);
723 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 798 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
724 ev_io_start (loop, &stdin_watcher); 799 ev_io_start (loop, &stdin_watcher);
725 ev_loop (loop, 0); 800 ev_loop (loop, 0);
726 801
727As you can see, you are responsible for allocating the memory for your 802As you can see, you are responsible for allocating the memory for your
728watcher structures (and it is usually a bad idea to do this on the stack, 803watcher structures (and it is usually a bad idea to do this on the stack,
729although this can sometimes be quite valid). 804although this can sometimes be quite valid).
730 805
731Each watcher structure must be initialised by a call to C<ev_init 806Each watcher structure must be initialised by a call to C<ev_init
732(watcher *, callback)>, which expects a callback to be provided. This 807(watcher *, callback)>, which expects a callback to be provided. This
733callback gets invoked each time the event occurs (or, in the case of io 808callback gets invoked each time the event occurs (or, in the case of I/O
734watchers, each time the event loop detects that the file descriptor given 809watchers, each time the event loop detects that the file descriptor given
735is readable and/or writable). 810is readable and/or writable).
736 811
737Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro 812Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
738with arguments specific to this watcher type. There is also a macro 813with arguments specific to this watcher type. There is also a macro
814 889
815The given async watcher has been asynchronously notified (see C<ev_async>). 890The given async watcher has been asynchronously notified (see C<ev_async>).
816 891
817=item C<EV_ERROR> 892=item C<EV_ERROR>
818 893
819An unspecified error has occured, the watcher has been stopped. This might 894An unspecified error has occurred, the watcher has been stopped. This might
820happen because the watcher could not be properly started because libev 895happen because the watcher could not be properly started because libev
821ran out of memory, a file descriptor was found to be closed or any other 896ran out of memory, a file descriptor was found to be closed or any other
822problem. You best act on it by reporting the problem and somehow coping 897problem. You best act on it by reporting the problem and somehow coping
823with the watcher being stopped. 898with the watcher being stopped.
824 899
825Libev will usually signal a few "dummy" events together with an error, 900Libev will usually signal a few "dummy" events together with an error, for
826for example it might indicate that a fd is readable or writable, and if 901example it might indicate that a fd is readable or writable, and if your
827your callbacks is well-written it can just attempt the operation and cope 902callbacks is well-written it can just attempt the operation and cope with
828with the error from read() or write(). This will not work in multithreaded 903the error from read() or write(). This will not work in multi-threaded
829programs, though, so beware. 904programs, though, as the fd could already be closed and reused for another
905thing, so beware.
830 906
831=back 907=back
832 908
833=head2 GENERIC WATCHER FUNCTIONS 909=head2 GENERIC WATCHER FUNCTIONS
834 910
850(or never started) and there are no pending events outstanding. 926(or never started) and there are no pending events outstanding.
851 927
852The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher, 928The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher,
853int revents)>. 929int revents)>.
854 930
931Example: Initialise an C<ev_io> watcher in two steps.
932
933 ev_io w;
934 ev_init (&w, my_cb);
935 ev_io_set (&w, STDIN_FILENO, EV_READ);
936
855=item C<ev_TYPE_set> (ev_TYPE *, [args]) 937=item C<ev_TYPE_set> (ev_TYPE *, [args])
856 938
857This macro initialises the type-specific parts of a watcher. You need to 939This macro initialises the type-specific parts of a watcher. You need to
858call C<ev_init> at least once before you call this macro, but you can 940call C<ev_init> at least once before you call this macro, but you can
859call C<ev_TYPE_set> any number of times. You must not, however, call this 941call C<ev_TYPE_set> any number of times. You must not, however, call this
861difference to the C<ev_init> macro). 943difference to the C<ev_init> macro).
862 944
863Although some watcher types do not have type-specific arguments 945Although some watcher types do not have type-specific arguments
864(e.g. C<ev_prepare>) you still need to call its C<set> macro. 946(e.g. C<ev_prepare>) you still need to call its C<set> macro.
865 947
948See C<ev_init>, above, for an example.
949
866=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args]) 950=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
867 951
868This convinience macro rolls both C<ev_init> and C<ev_TYPE_set> macro 952This convenience macro rolls both C<ev_init> and C<ev_TYPE_set> macro
869calls into a single call. This is the most convinient method to initialise 953calls into a single call. This is the most convenient method to initialise
870a watcher. The same limitations apply, of course. 954a watcher. The same limitations apply, of course.
955
956Example: Initialise and set an C<ev_io> watcher in one step.
957
958 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
871 959
872=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 960=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
873 961
874Starts (activates) the given watcher. Only active watchers will receive 962Starts (activates) the given watcher. Only active watchers will receive
875events. If the watcher is already active nothing will happen. 963events. If the watcher is already active nothing will happen.
964
965Example: Start the C<ev_io> watcher that is being abused as example in this
966whole section.
967
968 ev_io_start (EV_DEFAULT_UC, &w);
876 969
877=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 970=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
878 971
879Stops the given watcher again (if active) and clears the pending 972Stops the given watcher again (if active) and clears the pending
880status. It is possible that stopped watchers are pending (for example, 973status. It is possible that stopped watchers are pending (for example,
937 1030
938=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1031=item ev_invoke (loop, ev_TYPE *watcher, int revents)
939 1032
940Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1033Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
941C<loop> nor C<revents> need to be valid as long as the watcher callback 1034C<loop> nor C<revents> need to be valid as long as the watcher callback
942can deal with that fact. 1035can deal with that fact, as both are simply passed through to the
1036callback.
943 1037
944=item int ev_clear_pending (loop, ev_TYPE *watcher) 1038=item int ev_clear_pending (loop, ev_TYPE *watcher)
945 1039
946If the watcher is pending, this function returns clears its pending status 1040If the watcher is pending, this function clears its pending status and
947and returns its C<revents> bitset (as if its callback was invoked). If the 1041returns its C<revents> bitset (as if its callback was invoked). If the
948watcher isn't pending it does nothing and returns C<0>. 1042watcher isn't pending it does nothing and returns C<0>.
949 1043
1044Sometimes it can be useful to "poll" a watcher instead of waiting for its
1045callback to be invoked, which can be accomplished with this function.
1046
950=back 1047=back
951 1048
952 1049
953=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1050=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
954 1051
955Each watcher has, by default, a member C<void *data> that you can change 1052Each watcher has, by default, a member C<void *data> that you can change
956and read at any time, libev will completely ignore it. This can be used 1053and read at any time: libev will completely ignore it. This can be used
957to associate arbitrary data with your watcher. If you need more data and 1054to associate arbitrary data with your watcher. If you need more data and
958don't want to allocate memory and store a pointer to it in that data 1055don't want to allocate memory and store a pointer to it in that data
959member, you can also "subclass" the watcher type and provide your own 1056member, you can also "subclass" the watcher type and provide your own
960data: 1057data:
961 1058
962 struct my_io 1059 struct my_io
963 { 1060 {
964 struct ev_io io; 1061 struct ev_io io;
965 int otherfd; 1062 int otherfd;
966 void *somedata; 1063 void *somedata;
967 struct whatever *mostinteresting; 1064 struct whatever *mostinteresting;
968 } 1065 };
1066
1067 ...
1068 struct my_io w;
1069 ev_io_init (&w.io, my_cb, fd, EV_READ);
969 1070
970And since your callback will be called with a pointer to the watcher, you 1071And since your callback will be called with a pointer to the watcher, you
971can cast it back to your own type: 1072can cast it back to your own type:
972 1073
973 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents) 1074 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents)
974 { 1075 {
975 struct my_io *w = (struct my_io *)w_; 1076 struct my_io *w = (struct my_io *)w_;
976 ... 1077 ...
977 } 1078 }
978 1079
979More interesting and less C-conformant ways of casting your callback type 1080More interesting and less C-conformant ways of casting your callback type
980instead have been omitted. 1081instead have been omitted.
981 1082
982Another common scenario is having some data structure with multiple 1083Another common scenario is to use some data structure with multiple
983watchers: 1084embedded watchers:
984 1085
985 struct my_biggy 1086 struct my_biggy
986 { 1087 {
987 int some_data; 1088 int some_data;
988 ev_timer t1; 1089 ev_timer t1;
989 ev_timer t2; 1090 ev_timer t2;
990 } 1091 }
991 1092
992In this case getting the pointer to C<my_biggy> is a bit more complicated, 1093In this case getting the pointer to C<my_biggy> is a bit more
993you need to use C<offsetof>: 1094complicated: Either you store the address of your C<my_biggy> struct
1095in the C<data> member of the watcher (for woozies), or you need to use
1096some pointer arithmetic using C<offsetof> inside your watchers (for real
1097programmers):
994 1098
995 #include <stddef.h> 1099 #include <stddef.h>
996 1100
997 static void 1101 static void
998 t1_cb (EV_P_ struct ev_timer *w, int revents) 1102 t1_cb (EV_P_ struct ev_timer *w, int revents)
999 { 1103 {
1000 struct my_biggy big = (struct my_biggy * 1104 struct my_biggy big = (struct my_biggy *
1001 (((char *)w) - offsetof (struct my_biggy, t1)); 1105 (((char *)w) - offsetof (struct my_biggy, t1));
1002 } 1106 }
1003 1107
1004 static void 1108 static void
1005 t2_cb (EV_P_ struct ev_timer *w, int revents) 1109 t2_cb (EV_P_ struct ev_timer *w, int revents)
1006 { 1110 {
1007 struct my_biggy big = (struct my_biggy * 1111 struct my_biggy big = (struct my_biggy *
1008 (((char *)w) - offsetof (struct my_biggy, t2)); 1112 (((char *)w) - offsetof (struct my_biggy, t2));
1009 } 1113 }
1010 1114
1011 1115
1012=head1 WATCHER TYPES 1116=head1 WATCHER TYPES
1013 1117
1014This section describes each watcher in detail, but will not repeat 1118This section describes each watcher in detail, but will not repeat
1038In general you can register as many read and/or write event watchers per 1142In general you can register as many read and/or write event watchers per
1039fd as you want (as long as you don't confuse yourself). Setting all file 1143fd as you want (as long as you don't confuse yourself). Setting all file
1040descriptors to non-blocking mode is also usually a good idea (but not 1144descriptors to non-blocking mode is also usually a good idea (but not
1041required if you know what you are doing). 1145required if you know what you are doing).
1042 1146
1043If you must do this, then force the use of a known-to-be-good backend 1147If you cannot use non-blocking mode, then force the use of a
1044(at the time of this writing, this includes only C<EVBACKEND_SELECT> and 1148known-to-be-good backend (at the time of this writing, this includes only
1045C<EVBACKEND_POLL>). 1149C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>).
1046 1150
1047Another thing you have to watch out for is that it is quite easy to 1151Another thing you have to watch out for is that it is quite easy to
1048receive "spurious" readiness notifications, that is your callback might 1152receive "spurious" readiness notifications, that is your callback might
1049be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1153be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1050because there is no data. Not only are some backends known to create a 1154because there is no data. Not only are some backends known to create a
1051lot of those (for example solaris ports), it is very easy to get into 1155lot of those (for example Solaris ports), it is very easy to get into
1052this situation even with a relatively standard program structure. Thus 1156this situation even with a relatively standard program structure. Thus
1053it is best to always use non-blocking I/O: An extra C<read>(2) returning 1157it is best to always use non-blocking I/O: An extra C<read>(2) returning
1054C<EAGAIN> is far preferable to a program hanging until some data arrives. 1158C<EAGAIN> is far preferable to a program hanging until some data arrives.
1055 1159
1056If you cannot run the fd in non-blocking mode (for example you should not 1160If you cannot run the fd in non-blocking mode (for example you should
1057play around with an Xlib connection), then you have to seperately re-test 1161not play around with an Xlib connection), then you have to separately
1058whether a file descriptor is really ready with a known-to-be good interface 1162re-test whether a file descriptor is really ready with a known-to-be good
1059such as poll (fortunately in our Xlib example, Xlib already does this on 1163interface such as poll (fortunately in our Xlib example, Xlib already
1060its own, so its quite safe to use). 1164does this on its own, so its quite safe to use). Some people additionally
1165use C<SIGALRM> and an interval timer, just to be sure you won't block
1166indefinitely.
1167
1168But really, best use non-blocking mode.
1061 1169
1062=head3 The special problem of disappearing file descriptors 1170=head3 The special problem of disappearing file descriptors
1063 1171
1064Some backends (e.g. kqueue, epoll) need to be told about closing a file 1172Some backends (e.g. kqueue, epoll) need to be told about closing a file
1065descriptor (either by calling C<close> explicitly or by any other means, 1173descriptor (either due to calling C<close> explicitly or any other means,
1066such as C<dup>). The reason is that you register interest in some file 1174such as C<dup2>). The reason is that you register interest in some file
1067descriptor, but when it goes away, the operating system will silently drop 1175descriptor, but when it goes away, the operating system will silently drop
1068this interest. If another file descriptor with the same number then is 1176this interest. If another file descriptor with the same number then is
1069registered with libev, there is no efficient way to see that this is, in 1177registered with libev, there is no efficient way to see that this is, in
1070fact, a different file descriptor. 1178fact, a different file descriptor.
1071 1179
1102enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1210enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1103C<EVBACKEND_POLL>. 1211C<EVBACKEND_POLL>.
1104 1212
1105=head3 The special problem of SIGPIPE 1213=head3 The special problem of SIGPIPE
1106 1214
1107While not really specific to libev, it is easy to forget about SIGPIPE: 1215While not really specific to libev, it is easy to forget about C<SIGPIPE>:
1108when reading from a pipe whose other end has been closed, your program 1216when writing to a pipe whose other end has been closed, your program gets
1109gets send a SIGPIPE, which, by default, aborts your program. For most 1217sent a SIGPIPE, which, by default, aborts your program. For most programs
1110programs this is sensible behaviour, for daemons, this is usually 1218this is sensible behaviour, for daemons, this is usually undesirable.
1111undesirable.
1112 1219
1113So when you encounter spurious, unexplained daemon exits, make sure you 1220So when you encounter spurious, unexplained daemon exits, make sure you
1114ignore SIGPIPE (and maybe make sure you log the exit status of your daemon 1221ignore SIGPIPE (and maybe make sure you log the exit status of your daemon
1115somewhere, as that would have given you a big clue). 1222somewhere, as that would have given you a big clue).
1116 1223
1122=item ev_io_init (ev_io *, callback, int fd, int events) 1229=item ev_io_init (ev_io *, callback, int fd, int events)
1123 1230
1124=item ev_io_set (ev_io *, int fd, int events) 1231=item ev_io_set (ev_io *, int fd, int events)
1125 1232
1126Configures an C<ev_io> watcher. The C<fd> is the file descriptor to 1233Configures an C<ev_io> watcher. The C<fd> is the file descriptor to
1127rceeive events for and events is either C<EV_READ>, C<EV_WRITE> or 1234receive events for and C<events> is either C<EV_READ>, C<EV_WRITE> or
1128C<EV_READ | EV_WRITE> to receive the given events. 1235C<EV_READ | EV_WRITE>, to express the desire to receive the given events.
1129 1236
1130=item int fd [read-only] 1237=item int fd [read-only]
1131 1238
1132The file descriptor being watched. 1239The file descriptor being watched.
1133 1240
1141 1248
1142Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1249Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1143readable, but only once. Since it is likely line-buffered, you could 1250readable, but only once. Since it is likely line-buffered, you could
1144attempt to read a whole line in the callback. 1251attempt to read a whole line in the callback.
1145 1252
1146 static void 1253 static void
1147 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1254 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1148 { 1255 {
1149 ev_io_stop (loop, w); 1256 ev_io_stop (loop, w);
1150 .. read from stdin here (or from w->fd) and haqndle any I/O errors 1257 .. read from stdin here (or from w->fd) and handle any I/O errors
1151 } 1258 }
1152 1259
1153 ... 1260 ...
1154 struct ev_loop *loop = ev_default_init (0); 1261 struct ev_loop *loop = ev_default_init (0);
1155 struct ev_io stdin_readable; 1262 struct ev_io stdin_readable;
1156 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1263 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1157 ev_io_start (loop, &stdin_readable); 1264 ev_io_start (loop, &stdin_readable);
1158 ev_loop (loop, 0); 1265 ev_loop (loop, 0);
1159 1266
1160 1267
1161=head2 C<ev_timer> - relative and optionally repeating timeouts 1268=head2 C<ev_timer> - relative and optionally repeating timeouts
1162 1269
1163Timer watchers are simple relative timers that generate an event after a 1270Timer watchers are simple relative timers that generate an event after a
1164given time, and optionally repeating in regular intervals after that. 1271given time, and optionally repeating in regular intervals after that.
1165 1272
1166The timers are based on real time, that is, if you register an event that 1273The timers are based on real time, that is, if you register an event that
1167times out after an hour and you reset your system clock to january last 1274times out after an hour and you reset your system clock to January last
1168year, it will still time out after (roughly) and hour. "Roughly" because 1275year, it will still time out after (roughly) one hour. "Roughly" because
1169detecting time jumps is hard, and some inaccuracies are unavoidable (the 1276detecting time jumps is hard, and some inaccuracies are unavoidable (the
1170monotonic clock option helps a lot here). 1277monotonic clock option helps a lot here).
1278
1279The callback is guaranteed to be invoked only I<after> its timeout has
1280passed, but if multiple timers become ready during the same loop iteration
1281then order of execution is undefined.
1282
1283=head3 The special problem of time updates
1284
1285Establishing the current time is a costly operation (it usually takes at
1286least two system calls): EV therefore updates its idea of the current
1287time only before and after C<ev_loop> collects new events, which causes a
1288growing difference between C<ev_now ()> and C<ev_time ()> when handling
1289lots of events in one iteration.
1171 1290
1172The relative timeouts are calculated relative to the C<ev_now ()> 1291The relative timeouts are calculated relative to the C<ev_now ()>
1173time. This is usually the right thing as this timestamp refers to the time 1292time. This is usually the right thing as this timestamp refers to the time
1174of the event triggering whatever timeout you are modifying/starting. If 1293of the event triggering whatever timeout you are modifying/starting. If
1175you suspect event processing to be delayed and you I<need> to base the timeout 1294you suspect event processing to be delayed and you I<need> to base the
1176on the current time, use something like this to adjust for this: 1295timeout on the current time, use something like this to adjust for this:
1177 1296
1178 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1297 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1179 1298
1180The callback is guarenteed to be invoked only after its timeout has passed, 1299If the event loop is suspended for a long time, you can also force an
1181but if multiple timers become ready during the same loop iteration then 1300update of the time returned by C<ev_now ()> by calling C<ev_now_update
1182order of execution is undefined. 1301()>.
1183 1302
1184=head3 Watcher-Specific Functions and Data Members 1303=head3 Watcher-Specific Functions and Data Members
1185 1304
1186=over 4 1305=over 4
1187 1306
1206This will act as if the timer timed out and restart it again if it is 1325This will act as if the timer timed out and restart it again if it is
1207repeating. The exact semantics are: 1326repeating. The exact semantics are:
1208 1327
1209If the timer is pending, its pending status is cleared. 1328If the timer is pending, its pending status is cleared.
1210 1329
1211If the timer is started but nonrepeating, stop it (as if it timed out). 1330If the timer is started but non-repeating, stop it (as if it timed out).
1212 1331
1213If the timer is repeating, either start it if necessary (with the 1332If the timer is repeating, either start it if necessary (with the
1214C<repeat> value), or reset the running timer to the C<repeat> value. 1333C<repeat> value), or reset the running timer to the C<repeat> value.
1215 1334
1216This sounds a bit complicated, but here is a useful and typical 1335This sounds a bit complicated, but here is a useful and typical
1217example: Imagine you have a tcp connection and you want a so-called idle 1336example: Imagine you have a TCP connection and you want a so-called idle
1218timeout, that is, you want to be called when there have been, say, 60 1337timeout, that is, you want to be called when there have been, say, 60
1219seconds of inactivity on the socket. The easiest way to do this is to 1338seconds of inactivity on the socket. The easiest way to do this is to
1220configure an C<ev_timer> with a C<repeat> value of C<60> and then call 1339configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1221C<ev_timer_again> each time you successfully read or write some data. If 1340C<ev_timer_again> each time you successfully read or write some data. If
1222you go into an idle state where you do not expect data to travel on the 1341you go into an idle state where you do not expect data to travel on the
1236 ev_timer_again (loop, timer); 1355 ev_timer_again (loop, timer);
1237 1356
1238This is more slightly efficient then stopping/starting the timer each time 1357This is more slightly efficient then stopping/starting the timer each time
1239you want to modify its timeout value. 1358you want to modify its timeout value.
1240 1359
1360Note, however, that it is often even more efficient to remember the
1361time of the last activity and let the timer time-out naturally. In the
1362callback, you then check whether the time-out is real, or, if there was
1363some activity, you reschedule the watcher to time-out in "last_activity +
1364timeout - ev_now ()" seconds.
1365
1241=item ev_tstamp repeat [read-write] 1366=item ev_tstamp repeat [read-write]
1242 1367
1243The current C<repeat> value. Will be used each time the watcher times out 1368The current C<repeat> value. Will be used each time the watcher times out
1244or C<ev_timer_again> is called and determines the next timeout (if any), 1369or C<ev_timer_again> is called, and determines the next timeout (if any),
1245which is also when any modifications are taken into account. 1370which is also when any modifications are taken into account.
1246 1371
1247=back 1372=back
1248 1373
1249=head3 Examples 1374=head3 Examples
1250 1375
1251Example: Create a timer that fires after 60 seconds. 1376Example: Create a timer that fires after 60 seconds.
1252 1377
1253 static void 1378 static void
1254 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1379 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1255 { 1380 {
1256 .. one minute over, w is actually stopped right here 1381 .. one minute over, w is actually stopped right here
1257 } 1382 }
1258 1383
1259 struct ev_timer mytimer; 1384 struct ev_timer mytimer;
1260 ev_timer_init (&mytimer, one_minute_cb, 60., 0.); 1385 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1261 ev_timer_start (loop, &mytimer); 1386 ev_timer_start (loop, &mytimer);
1262 1387
1263Example: Create a timeout timer that times out after 10 seconds of 1388Example: Create a timeout timer that times out after 10 seconds of
1264inactivity. 1389inactivity.
1265 1390
1266 static void 1391 static void
1267 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1392 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1268 { 1393 {
1269 .. ten seconds without any activity 1394 .. ten seconds without any activity
1270 } 1395 }
1271 1396
1272 struct ev_timer mytimer; 1397 struct ev_timer mytimer;
1273 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 1398 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1274 ev_timer_again (&mytimer); /* start timer */ 1399 ev_timer_again (&mytimer); /* start timer */
1275 ev_loop (loop, 0); 1400 ev_loop (loop, 0);
1276 1401
1277 // and in some piece of code that gets executed on any "activity": 1402 // and in some piece of code that gets executed on any "activity":
1278 // reset the timeout to start ticking again at 10 seconds 1403 // reset the timeout to start ticking again at 10 seconds
1279 ev_timer_again (&mytimer); 1404 ev_timer_again (&mytimer);
1280 1405
1281 1406
1282=head2 C<ev_periodic> - to cron or not to cron? 1407=head2 C<ev_periodic> - to cron or not to cron?
1283 1408
1284Periodic watchers are also timers of a kind, but they are very versatile 1409Periodic watchers are also timers of a kind, but they are very versatile
1285(and unfortunately a bit complex). 1410(and unfortunately a bit complex).
1286 1411
1287Unlike C<ev_timer>'s, they are not based on real time (or relative time) 1412Unlike C<ev_timer>'s, they are not based on real time (or relative time)
1288but on wallclock time (absolute time). You can tell a periodic watcher 1413but on wall clock time (absolute time). You can tell a periodic watcher
1289to trigger after some specific point in time. For example, if you tell a 1414to trigger after some specific point in time. For example, if you tell a
1290periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1415periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now ()
1291+ 10.>, that is, an absolute time not a delay) and then reset your system 1416+ 10.>, that is, an absolute time not a delay) and then reset your system
1292clock to january of the previous year, then it will take more than year 1417clock to January of the previous year, then it will take more than year
1293to trigger the event (unlike an C<ev_timer>, which would still trigger 1418to trigger the event (unlike an C<ev_timer>, which would still trigger
1294roughly 10 seconds later as it uses a relative timeout). 1419roughly 10 seconds later as it uses a relative timeout).
1295 1420
1296C<ev_periodic>s can also be used to implement vastly more complex timers, 1421C<ev_periodic>s can also be used to implement vastly more complex timers,
1297such as triggering an event on each "midnight, local time", or other 1422such as triggering an event on each "midnight, local time", or other
1298complicated, rules. 1423complicated rules.
1299 1424
1300As with timers, the callback is guarenteed to be invoked only when the 1425As with timers, the callback is guaranteed to be invoked only when the
1301time (C<at>) has passed, but if multiple periodic timers become ready 1426time (C<at>) has passed, but if multiple periodic timers become ready
1302during the same loop iteration then order of execution is undefined. 1427during the same loop iteration, then order of execution is undefined.
1303 1428
1304=head3 Watcher-Specific Functions and Data Members 1429=head3 Watcher-Specific Functions and Data Members
1305 1430
1306=over 4 1431=over 4
1307 1432
1308=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 1433=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1309 1434
1310=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) 1435=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1311 1436
1312Lots of arguments, lets sort it out... There are basically three modes of 1437Lots of arguments, lets sort it out... There are basically three modes of
1313operation, and we will explain them from simplest to complex: 1438operation, and we will explain them from simplest to most complex:
1314 1439
1315=over 4 1440=over 4
1316 1441
1317=item * absolute timer (at = time, interval = reschedule_cb = 0) 1442=item * absolute timer (at = time, interval = reschedule_cb = 0)
1318 1443
1319In this configuration the watcher triggers an event after the wallclock 1444In this configuration the watcher triggers an event after the wall clock
1320time C<at> has passed and doesn't repeat. It will not adjust when a time 1445time C<at> has passed. It will not repeat and will not adjust when a time
1321jump occurs, that is, if it is to be run at January 1st 2011 then it will 1446jump occurs, that is, if it is to be run at January 1st 2011 then it will
1322run when the system time reaches or surpasses this time. 1447only run when the system clock reaches or surpasses this time.
1323 1448
1324=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) 1449=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1325 1450
1326In this mode the watcher will always be scheduled to time out at the next 1451In this mode the watcher will always be scheduled to time out at the next
1327C<at + N * interval> time (for some integer N, which can also be negative) 1452C<at + N * interval> time (for some integer N, which can also be negative)
1328and then repeat, regardless of any time jumps. 1453and then repeat, regardless of any time jumps.
1329 1454
1330This can be used to create timers that do not drift with respect to system 1455This can be used to create timers that do not drift with respect to the
1331time, for example, here is a C<ev_periodic> that triggers each hour, on 1456system clock, for example, here is a C<ev_periodic> that triggers each
1332the hour: 1457hour, on the hour:
1333 1458
1334 ev_periodic_set (&periodic, 0., 3600., 0); 1459 ev_periodic_set (&periodic, 0., 3600., 0);
1335 1460
1336This doesn't mean there will always be 3600 seconds in between triggers, 1461This doesn't mean there will always be 3600 seconds in between triggers,
1337but only that the the callback will be called when the system time shows a 1462but only that the callback will be called when the system time shows a
1338full hour (UTC), or more correctly, when the system time is evenly divisible 1463full hour (UTC), or more correctly, when the system time is evenly divisible
1339by 3600. 1464by 3600.
1340 1465
1341Another way to think about it (for the mathematically inclined) is that 1466Another way to think about it (for the mathematically inclined) is that
1342C<ev_periodic> will try to run the callback in this mode at the next possible 1467C<ev_periodic> will try to run the callback in this mode at the next possible
1344 1469
1345For numerical stability it is preferable that the C<at> value is near 1470For numerical stability it is preferable that the C<at> value is near
1346C<ev_now ()> (the current time), but there is no range requirement for 1471C<ev_now ()> (the current time), but there is no range requirement for
1347this value, and in fact is often specified as zero. 1472this value, and in fact is often specified as zero.
1348 1473
1349Note also that there is an upper limit to how often a timer can fire (cpu 1474Note also that there is an upper limit to how often a timer can fire (CPU
1350speed for example), so if C<interval> is very small then timing stability 1475speed for example), so if C<interval> is very small then timing stability
1351will of course detoriate. Libev itself tries to be exact to be about one 1476will of course deteriorate. Libev itself tries to be exact to be about one
1352millisecond (if the OS supports it and the machine is fast enough). 1477millisecond (if the OS supports it and the machine is fast enough).
1353 1478
1354=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) 1479=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1355 1480
1356In this mode the values for C<interval> and C<at> are both being 1481In this mode the values for C<interval> and C<at> are both being
1424=back 1549=back
1425 1550
1426=head3 Examples 1551=head3 Examples
1427 1552
1428Example: Call a callback every hour, or, more precisely, whenever the 1553Example: Call a callback every hour, or, more precisely, whenever the
1429system clock is divisible by 3600. The callback invocation times have 1554system time is divisible by 3600. The callback invocation times have
1430potentially a lot of jittering, but good long-term stability. 1555potentially a lot of jitter, but good long-term stability.
1431 1556
1432 static void 1557 static void
1433 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1558 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents)
1434 { 1559 {
1435 ... its now a full hour (UTC, or TAI or whatever your clock follows) 1560 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1436 } 1561 }
1437 1562
1438 struct ev_periodic hourly_tick; 1563 struct ev_periodic hourly_tick;
1439 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0); 1564 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1440 ev_periodic_start (loop, &hourly_tick); 1565 ev_periodic_start (loop, &hourly_tick);
1441 1566
1442Example: The same as above, but use a reschedule callback to do it: 1567Example: The same as above, but use a reschedule callback to do it:
1443 1568
1444 #include <math.h> 1569 #include <math.h>
1445 1570
1446 static ev_tstamp 1571 static ev_tstamp
1447 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now) 1572 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1448 { 1573 {
1449 return fmod (now, 3600.) + 3600.; 1574 return now + (3600. - fmod (now, 3600.));
1450 } 1575 }
1451 1576
1452 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb); 1577 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1453 1578
1454Example: Call a callback every hour, starting now: 1579Example: Call a callback every hour, starting now:
1455 1580
1456 struct ev_periodic hourly_tick; 1581 struct ev_periodic hourly_tick;
1457 ev_periodic_init (&hourly_tick, clock_cb, 1582 ev_periodic_init (&hourly_tick, clock_cb,
1458 fmod (ev_now (loop), 3600.), 3600., 0); 1583 fmod (ev_now (loop), 3600.), 3600., 0);
1459 ev_periodic_start (loop, &hourly_tick); 1584 ev_periodic_start (loop, &hourly_tick);
1460 1585
1461 1586
1462=head2 C<ev_signal> - signal me when a signal gets signalled! 1587=head2 C<ev_signal> - signal me when a signal gets signalled!
1463 1588
1464Signal watchers will trigger an event when the process receives a specific 1589Signal watchers will trigger an event when the process receives a specific
1465signal one or more times. Even though signals are very asynchronous, libev 1590signal one or more times. Even though signals are very asynchronous, libev
1466will try it's best to deliver signals synchronously, i.e. as part of the 1591will try it's best to deliver signals synchronously, i.e. as part of the
1467normal event processing, like any other event. 1592normal event processing, like any other event.
1468 1593
1594If you want signals asynchronously, just use C<sigaction> as you would
1595do without libev and forget about sharing the signal. You can even use
1596C<ev_async> from a signal handler to synchronously wake up an event loop.
1597
1469You can configure as many watchers as you like per signal. Only when the 1598You can configure as many watchers as you like per signal. Only when the
1470first watcher gets started will libev actually register a signal watcher 1599first watcher gets started will libev actually register a signal handler
1471with the kernel (thus it coexists with your own signal handlers as long 1600with the kernel (thus it coexists with your own signal handlers as long as
1472as you don't register any with libev). Similarly, when the last signal 1601you don't register any with libev for the same signal). Similarly, when
1473watcher for a signal is stopped libev will reset the signal handler to 1602the last signal watcher for a signal is stopped, libev will reset the
1474SIG_DFL (regardless of what it was set to before). 1603signal handler to SIG_DFL (regardless of what it was set to before).
1475 1604
1476If possible and supported, libev will install its handlers with 1605If possible and supported, libev will install its handlers with
1477C<SA_RESTART> behaviour enabled, so syscalls should not be unduly 1606C<SA_RESTART> behaviour enabled, so system calls should not be unduly
1478interrupted. If you have a problem with syscalls getting interrupted by 1607interrupted. If you have a problem with system calls getting interrupted by
1479signals you can block all signals in an C<ev_check> watcher and unblock 1608signals you can block all signals in an C<ev_check> watcher and unblock
1480them in an C<ev_prepare> watcher. 1609them in an C<ev_prepare> watcher.
1481 1610
1482=head3 Watcher-Specific Functions and Data Members 1611=head3 Watcher-Specific Functions and Data Members
1483 1612
1496 1625
1497=back 1626=back
1498 1627
1499=head3 Examples 1628=head3 Examples
1500 1629
1501Example: Try to exit cleanly on SIGINT and SIGTERM. 1630Example: Try to exit cleanly on SIGINT.
1502 1631
1503 static void 1632 static void
1504 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1633 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1505 { 1634 {
1506 ev_unloop (loop, EVUNLOOP_ALL); 1635 ev_unloop (loop, EVUNLOOP_ALL);
1507 } 1636 }
1508 1637
1509 struct ev_signal signal_watcher; 1638 struct ev_signal signal_watcher;
1510 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 1639 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1511 ev_signal_start (loop, &sigint_cb); 1640 ev_signal_start (loop, &signal_watcher);
1512 1641
1513 1642
1514=head2 C<ev_child> - watch out for process status changes 1643=head2 C<ev_child> - watch out for process status changes
1515 1644
1516Child watchers trigger when your process receives a SIGCHLD in response to 1645Child watchers trigger when your process receives a SIGCHLD in response to
1517some child status changes (most typically when a child of yours dies). It 1646some child status changes (most typically when a child of yours dies or
1518is permissible to install a child watcher I<after> the child has been 1647exits). It is permissible to install a child watcher I<after> the child
1519forked (which implies it might have already exited), as long as the event 1648has been forked (which implies it might have already exited), as long
1520loop isn't entered (or is continued from a watcher). 1649as the event loop isn't entered (or is continued from a watcher), i.e.,
1650forking and then immediately registering a watcher for the child is fine,
1651but forking and registering a watcher a few event loop iterations later is
1652not.
1521 1653
1522Only the default event loop is capable of handling signals, and therefore 1654Only the default event loop is capable of handling signals, and therefore
1523you can only rgeister child watchers in the default event loop. 1655you can only register child watchers in the default event loop.
1524 1656
1525=head3 Process Interaction 1657=head3 Process Interaction
1526 1658
1527Libev grabs C<SIGCHLD> as soon as the default event loop is 1659Libev grabs C<SIGCHLD> as soon as the default event loop is
1528initialised. This is necessary to guarantee proper behaviour even if 1660initialised. This is necessary to guarantee proper behaviour even if
1529the first child watcher is started after the child exits. The occurance 1661the first child watcher is started after the child exits. The occurrence
1530of C<SIGCHLD> is recorded asynchronously, but child reaping is done 1662of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1531synchronously as part of the event loop processing. Libev always reaps all 1663synchronously as part of the event loop processing. Libev always reaps all
1532children, even ones not watched. 1664children, even ones not watched.
1533 1665
1534=head3 Overriding the Built-In Processing 1666=head3 Overriding the Built-In Processing
1538handler, you can override it easily by installing your own handler for 1670handler, you can override it easily by installing your own handler for
1539C<SIGCHLD> after initialising the default loop, and making sure the 1671C<SIGCHLD> after initialising the default loop, and making sure the
1540default loop never gets destroyed. You are encouraged, however, to use an 1672default loop never gets destroyed. You are encouraged, however, to use an
1541event-based approach to child reaping and thus use libev's support for 1673event-based approach to child reaping and thus use libev's support for
1542that, so other libev users can use C<ev_child> watchers freely. 1674that, so other libev users can use C<ev_child> watchers freely.
1675
1676=head3 Stopping the Child Watcher
1677
1678Currently, the child watcher never gets stopped, even when the
1679child terminates, so normally one needs to stop the watcher in the
1680callback. Future versions of libev might stop the watcher automatically
1681when a child exit is detected.
1543 1682
1544=head3 Watcher-Specific Functions and Data Members 1683=head3 Watcher-Specific Functions and Data Members
1545 1684
1546=over 4 1685=over 4
1547 1686
1576=head3 Examples 1715=head3 Examples
1577 1716
1578Example: C<fork()> a new process and install a child handler to wait for 1717Example: C<fork()> a new process and install a child handler to wait for
1579its completion. 1718its completion.
1580 1719
1581 ev_child cw; 1720 ev_child cw;
1582 1721
1583 static void 1722 static void
1584 child_cb (EV_P_ struct ev_child *w, int revents) 1723 child_cb (EV_P_ struct ev_child *w, int revents)
1585 { 1724 {
1586 ev_child_stop (EV_A_ w); 1725 ev_child_stop (EV_A_ w);
1587 printf ("process %d exited with status %x\n", w->rpid, w->rstatus); 1726 printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1588 } 1727 }
1589 1728
1590 pid_t pid = fork (); 1729 pid_t pid = fork ();
1591 1730
1592 if (pid < 0) 1731 if (pid < 0)
1593 // error 1732 // error
1594 else if (pid == 0) 1733 else if (pid == 0)
1595 { 1734 {
1596 // the forked child executes here 1735 // the forked child executes here
1597 exit (1); 1736 exit (1);
1598 } 1737 }
1599 else 1738 else
1600 { 1739 {
1601 ev_child_init (&cw, child_cb, pid, 0); 1740 ev_child_init (&cw, child_cb, pid, 0);
1602 ev_child_start (EV_DEFAULT_ &cw); 1741 ev_child_start (EV_DEFAULT_ &cw);
1603 } 1742 }
1604 1743
1605 1744
1606=head2 C<ev_stat> - did the file attributes just change? 1745=head2 C<ev_stat> - did the file attributes just change?
1607 1746
1608This watches a filesystem path for attribute changes. That is, it calls 1747This watches a file system path for attribute changes. That is, it calls
1609C<stat> regularly (or when the OS says it changed) and sees if it changed 1748C<stat> regularly (or when the OS says it changed) and sees if it changed
1610compared to the last time, invoking the callback if it did. 1749compared to the last time, invoking the callback if it did.
1611 1750
1612The path does not need to exist: changing from "path exists" to "path does 1751The path does not need to exist: changing from "path exists" to "path does
1613not exist" is a status change like any other. The condition "path does 1752not exist" is a status change like any other. The condition "path does
1616the stat buffer having unspecified contents. 1755the stat buffer having unspecified contents.
1617 1756
1618The path I<should> be absolute and I<must not> end in a slash. If it is 1757The path I<should> be absolute and I<must not> end in a slash. If it is
1619relative and your working directory changes, the behaviour is undefined. 1758relative and your working directory changes, the behaviour is undefined.
1620 1759
1621Since there is no standard to do this, the portable implementation simply 1760Since there is no standard kernel interface to do this, the portable
1622calls C<stat (2)> regularly on the path to see if it changed somehow. You 1761implementation simply calls C<stat (2)> regularly on the path to see if
1623can specify a recommended polling interval for this case. If you specify 1762it changed somehow. You can specify a recommended polling interval for
1624a polling interval of C<0> (highly recommended!) then a I<suitable, 1763this case. If you specify a polling interval of C<0> (highly recommended!)
1625unspecified default> value will be used (which you can expect to be around 1764then a I<suitable, unspecified default> value will be used (which
1626five seconds, although this might change dynamically). Libev will also 1765you can expect to be around five seconds, although this might change
1627impose a minimum interval which is currently around C<0.1>, but thats 1766dynamically). Libev will also impose a minimum interval which is currently
1628usually overkill. 1767around C<0.1>, but thats usually overkill.
1629 1768
1630This watcher type is not meant for massive numbers of stat watchers, 1769This watcher type is not meant for massive numbers of stat watchers,
1631as even with OS-supported change notifications, this can be 1770as even with OS-supported change notifications, this can be
1632resource-intensive. 1771resource-intensive.
1633 1772
1634At the time of this writing, only the Linux inotify interface is 1773At the time of this writing, the only OS-specific interface implemented
1635implemented (implementing kqueue support is left as an exercise for the 1774is the Linux inotify interface (implementing kqueue support is left as
1636reader, note, however, that the author sees no way of implementing ev_stat 1775an exercise for the reader. Note, however, that the author sees no way
1637semantics with kqueue). Inotify will be used to give hints only and should 1776of implementing C<ev_stat> semantics with kqueue).
1638not change the semantics of C<ev_stat> watchers, which means that libev
1639sometimes needs to fall back to regular polling again even with inotify,
1640but changes are usually detected immediately, and if the file exists there
1641will be no polling.
1642 1777
1643=head3 ABI Issues (Largefile Support) 1778=head3 ABI Issues (Largefile Support)
1644 1779
1645Libev by default (unless the user overrides this) uses the default 1780Libev by default (unless the user overrides this) uses the default
1646compilation environment, which means that on systems with optionally 1781compilation environment, which means that on systems with large file
1647disabled large file support, you get the 32 bit version of the stat 1782support disabled by default, you get the 32 bit version of the stat
1648structure. When using the library from programs that change the ABI to 1783structure. When using the library from programs that change the ABI to
1649use 64 bit file offsets the programs will fail. In that case you have to 1784use 64 bit file offsets the programs will fail. In that case you have to
1650compile libev with the same flags to get binary compatibility. This is 1785compile libev with the same flags to get binary compatibility. This is
1651obviously the case with any flags that change the ABI, but the problem is 1786obviously the case with any flags that change the ABI, but the problem is
1652most noticably with ev_stat and largefile support. 1787most noticeably disabled with ev_stat and large file support.
1653 1788
1654=head3 Inotify 1789The solution for this is to lobby your distribution maker to make large
1790file interfaces available by default (as e.g. FreeBSD does) and not
1791optional. Libev cannot simply switch on large file support because it has
1792to exchange stat structures with application programs compiled using the
1793default compilation environment.
1794
1795=head3 Inotify and Kqueue
1655 1796
1656When C<inotify (7)> support has been compiled into libev (generally only 1797When C<inotify (7)> support has been compiled into libev (generally only
1657available on Linux) and present at runtime, it will be used to speed up 1798available with Linux) and present at runtime, it will be used to speed up
1658change detection where possible. The inotify descriptor will be created lazily 1799change detection where possible. The inotify descriptor will be created lazily
1659when the first C<ev_stat> watcher is being started. 1800when the first C<ev_stat> watcher is being started.
1660 1801
1661Inotify presence does not change the semantics of C<ev_stat> watchers 1802Inotify presence does not change the semantics of C<ev_stat> watchers
1662except that changes might be detected earlier, and in some cases, to avoid 1803except that changes might be detected earlier, and in some cases, to avoid
1663making regular C<stat> calls. Even in the presence of inotify support 1804making regular C<stat> calls. Even in the presence of inotify support
1664there are many cases where libev has to resort to regular C<stat> polling. 1805there are many cases where libev has to resort to regular C<stat> polling,
1806but as long as the path exists, libev usually gets away without polling.
1665 1807
1666(There is no support for kqueue, as apparently it cannot be used to 1808There is no support for kqueue, as apparently it cannot be used to
1667implement this functionality, due to the requirement of having a file 1809implement this functionality, due to the requirement of having a file
1668descriptor open on the object at all times). 1810descriptor open on the object at all times, and detecting renames, unlinks
1811etc. is difficult.
1669 1812
1670=head3 The special problem of stat time resolution 1813=head3 The special problem of stat time resolution
1671 1814
1672The C<stat ()> syscall only supports full-second resolution portably, and 1815The C<stat ()> system call only supports full-second resolution portably, and
1673even on systems where the resolution is higher, many filesystems still 1816even on systems where the resolution is higher, most file systems still
1674only support whole seconds. 1817only support whole seconds.
1675 1818
1676That means that, if the time is the only thing that changes, you can 1819That means that, if the time is the only thing that changes, you can
1677easily miss updates: on the first update, C<ev_stat> detects a change and 1820easily miss updates: on the first update, C<ev_stat> detects a change and
1678calls your callback, which does something. When there is another update 1821calls your callback, which does something. When there is another update
1679within the same second, C<ev_stat> will be unable to detect it as the stat 1822within the same second, C<ev_stat> will be unable to detect unless the
1680data does not change. 1823stat data does change in other ways (e.g. file size).
1681 1824
1682The solution to this is to delay acting on a change for slightly more 1825The solution to this is to delay acting on a change for slightly more
1683than a second (or till slightly after the next full second boundary), using 1826than a second (or till slightly after the next full second boundary), using
1684a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02); 1827a roughly one-second-delay C<ev_timer> (e.g. C<ev_timer_set (w, 0., 1.02);
1685ev_timer_again (loop, w)>). 1828ev_timer_again (loop, w)>).
1705C<path>. The C<interval> is a hint on how quickly a change is expected to 1848C<path>. The C<interval> is a hint on how quickly a change is expected to
1706be detected and should normally be specified as C<0> to let libev choose 1849be detected and should normally be specified as C<0> to let libev choose
1707a suitable value. The memory pointed to by C<path> must point to the same 1850a suitable value. The memory pointed to by C<path> must point to the same
1708path for as long as the watcher is active. 1851path for as long as the watcher is active.
1709 1852
1710The callback will receive C<EV_STAT> when a change was detected, relative 1853The callback will receive an C<EV_STAT> event when a change was detected,
1711to the attributes at the time the watcher was started (or the last change 1854relative to the attributes at the time the watcher was started (or the
1712was detected). 1855last change was detected).
1713 1856
1714=item ev_stat_stat (loop, ev_stat *) 1857=item ev_stat_stat (loop, ev_stat *)
1715 1858
1716Updates the stat buffer immediately with new values. If you change the 1859Updates the stat buffer immediately with new values. If you change the
1717watched path in your callback, you could call this function to avoid 1860watched path in your callback, you could call this function to avoid
1738 1881
1739The specified interval. 1882The specified interval.
1740 1883
1741=item const char *path [read-only] 1884=item const char *path [read-only]
1742 1885
1743The filesystem path that is being watched. 1886The file system path that is being watched.
1744 1887
1745=back 1888=back
1746 1889
1747=head3 Examples 1890=head3 Examples
1748 1891
1749Example: Watch C</etc/passwd> for attribute changes. 1892Example: Watch C</etc/passwd> for attribute changes.
1750 1893
1751 static void 1894 static void
1752 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1895 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1753 { 1896 {
1754 /* /etc/passwd changed in some way */ 1897 /* /etc/passwd changed in some way */
1755 if (w->attr.st_nlink) 1898 if (w->attr.st_nlink)
1756 { 1899 {
1757 printf ("passwd current size %ld\n", (long)w->attr.st_size); 1900 printf ("passwd current size %ld\n", (long)w->attr.st_size);
1758 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime); 1901 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1759 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime); 1902 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1760 } 1903 }
1761 else 1904 else
1762 /* you shalt not abuse printf for puts */ 1905 /* you shalt not abuse printf for puts */
1763 puts ("wow, /etc/passwd is not there, expect problems. " 1906 puts ("wow, /etc/passwd is not there, expect problems. "
1764 "if this is windows, they already arrived\n"); 1907 "if this is windows, they already arrived\n");
1765 } 1908 }
1766 1909
1767 ... 1910 ...
1768 ev_stat passwd; 1911 ev_stat passwd;
1769 1912
1770 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.); 1913 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1771 ev_stat_start (loop, &passwd); 1914 ev_stat_start (loop, &passwd);
1772 1915
1773Example: Like above, but additionally use a one-second delay so we do not 1916Example: Like above, but additionally use a one-second delay so we do not
1774miss updates (however, frequent updates will delay processing, too, so 1917miss updates (however, frequent updates will delay processing, too, so
1775one might do the work both on C<ev_stat> callback invocation I<and> on 1918one might do the work both on C<ev_stat> callback invocation I<and> on
1776C<ev_timer> callback invocation). 1919C<ev_timer> callback invocation).
1777 1920
1778 static ev_stat passwd; 1921 static ev_stat passwd;
1779 static ev_timer timer; 1922 static ev_timer timer;
1780 1923
1781 static void 1924 static void
1782 timer_cb (EV_P_ ev_timer *w, int revents) 1925 timer_cb (EV_P_ ev_timer *w, int revents)
1783 { 1926 {
1784 ev_timer_stop (EV_A_ w); 1927 ev_timer_stop (EV_A_ w);
1785 1928
1786 /* now it's one second after the most recent passwd change */ 1929 /* now it's one second after the most recent passwd change */
1787 } 1930 }
1788 1931
1789 static void 1932 static void
1790 stat_cb (EV_P_ ev_stat *w, int revents) 1933 stat_cb (EV_P_ ev_stat *w, int revents)
1791 { 1934 {
1792 /* reset the one-second timer */ 1935 /* reset the one-second timer */
1793 ev_timer_again (EV_A_ &timer); 1936 ev_timer_again (EV_A_ &timer);
1794 } 1937 }
1795 1938
1796 ... 1939 ...
1797 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.); 1940 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1798 ev_stat_start (loop, &passwd); 1941 ev_stat_start (loop, &passwd);
1799 ev_timer_init (&timer, timer_cb, 0., 1.02); 1942 ev_timer_init (&timer, timer_cb, 0., 1.02);
1800 1943
1801 1944
1802=head2 C<ev_idle> - when you've got nothing better to do... 1945=head2 C<ev_idle> - when you've got nothing better to do...
1803 1946
1804Idle watchers trigger events when no other events of the same or higher 1947Idle watchers trigger events when no other events of the same or higher
1805priority are pending (prepare, check and other idle watchers do not 1948priority are pending (prepare, check and other idle watchers do not count
1806count). 1949as receiving "events").
1807 1950
1808That is, as long as your process is busy handling sockets or timeouts 1951That is, as long as your process is busy handling sockets or timeouts
1809(or even signals, imagine) of the same or higher priority it will not be 1952(or even signals, imagine) of the same or higher priority it will not be
1810triggered. But when your process is idle (or only lower-priority watchers 1953triggered. But when your process is idle (or only lower-priority watchers
1811are pending), the idle watchers are being called once per event loop 1954are pending), the idle watchers are being called once per event loop
1835=head3 Examples 1978=head3 Examples
1836 1979
1837Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 1980Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1838callback, free it. Also, use no error checking, as usual. 1981callback, free it. Also, use no error checking, as usual.
1839 1982
1840 static void 1983 static void
1841 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 1984 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1842 { 1985 {
1843 free (w); 1986 free (w);
1844 // now do something you wanted to do when the program has 1987 // now do something you wanted to do when the program has
1845 // no longer anything immediate to do. 1988 // no longer anything immediate to do.
1846 } 1989 }
1847 1990
1848 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); 1991 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1849 ev_idle_init (idle_watcher, idle_cb); 1992 ev_idle_init (idle_watcher, idle_cb);
1850 ev_idle_start (loop, idle_cb); 1993 ev_idle_start (loop, idle_cb);
1851 1994
1852 1995
1853=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 1996=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
1854 1997
1855Prepare and check watchers are usually (but not always) used in tandem: 1998Prepare and check watchers are usually (but not always) used in pairs:
1856prepare watchers get invoked before the process blocks and check watchers 1999prepare watchers get invoked before the process blocks and check watchers
1857afterwards. 2000afterwards.
1858 2001
1859You I<must not> call C<ev_loop> or similar functions that enter 2002You I<must not> call C<ev_loop> or similar functions that enter
1860the current event loop from either C<ev_prepare> or C<ev_check> 2003the current event loop from either C<ev_prepare> or C<ev_check>
1863those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2006those watchers, i.e. the sequence will always be C<ev_prepare>, blocking,
1864C<ev_check> so if you have one watcher of each kind they will always be 2007C<ev_check> so if you have one watcher of each kind they will always be
1865called in pairs bracketing the blocking call. 2008called in pairs bracketing the blocking call.
1866 2009
1867Their main purpose is to integrate other event mechanisms into libev and 2010Their main purpose is to integrate other event mechanisms into libev and
1868their use is somewhat advanced. This could be used, for example, to track 2011their use is somewhat advanced. They could be used, for example, to track
1869variable changes, implement your own watchers, integrate net-snmp or a 2012variable changes, implement your own watchers, integrate net-snmp or a
1870coroutine library and lots more. They are also occasionally useful if 2013coroutine library and lots more. They are also occasionally useful if
1871you cache some data and want to flush it before blocking (for example, 2014you cache some data and want to flush it before blocking (for example,
1872in X programs you might want to do an C<XFlush ()> in an C<ev_prepare> 2015in X programs you might want to do an C<XFlush ()> in an C<ev_prepare>
1873watcher). 2016watcher).
1874 2017
1875This is done by examining in each prepare call which file descriptors need 2018This is done by examining in each prepare call which file descriptors
1876to be watched by the other library, registering C<ev_io> watchers for 2019need to be watched by the other library, registering C<ev_io> watchers
1877them and starting an C<ev_timer> watcher for any timeouts (many libraries 2020for them and starting an C<ev_timer> watcher for any timeouts (many
1878provide just this functionality). Then, in the check watcher you check for 2021libraries provide exactly this functionality). Then, in the check watcher,
1879any events that occured (by checking the pending status of all watchers 2022you check for any events that occurred (by checking the pending status
1880and stopping them) and call back into the library. The I/O and timer 2023of all watchers and stopping them) and call back into the library. The
1881callbacks will never actually be called (but must be valid nevertheless, 2024I/O and timer callbacks will never actually be called (but must be valid
1882because you never know, you know?). 2025nevertheless, because you never know, you know?).
1883 2026
1884As another example, the Perl Coro module uses these hooks to integrate 2027As another example, the Perl Coro module uses these hooks to integrate
1885coroutines into libev programs, by yielding to other active coroutines 2028coroutines into libev programs, by yielding to other active coroutines
1886during each prepare and only letting the process block if no coroutines 2029during each prepare and only letting the process block if no coroutines
1887are ready to run (it's actually more complicated: it only runs coroutines 2030are ready to run (it's actually more complicated: it only runs coroutines
1890loop from blocking if lower-priority coroutines are active, thus mapping 2033loop from blocking if lower-priority coroutines are active, thus mapping
1891low-priority coroutines to idle/background tasks). 2034low-priority coroutines to idle/background tasks).
1892 2035
1893It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 2036It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1894priority, to ensure that they are being run before any other watchers 2037priority, to ensure that they are being run before any other watchers
2038after the poll (this doesn't matter for C<ev_prepare> watchers).
2039
1895after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, 2040Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
1896too) should not activate ("feed") events into libev. While libev fully 2041activate ("feed") events into libev. While libev fully supports this, they
1897supports this, they might get executed before other C<ev_check> watchers 2042might get executed before other C<ev_check> watchers did their job. As
1898did their job. As C<ev_check> watchers are often used to embed other 2043C<ev_check> watchers are often used to embed other (non-libev) event
1899(non-libev) event loops those other event loops might be in an unusable 2044loops those other event loops might be in an unusable state until their
1900state until their C<ev_check> watcher ran (always remind yourself to 2045C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1901coexist peacefully with others). 2046others).
1902 2047
1903=head3 Watcher-Specific Functions and Data Members 2048=head3 Watcher-Specific Functions and Data Members
1904 2049
1905=over 4 2050=over 4
1906 2051
1908 2053
1909=item ev_check_init (ev_check *, callback) 2054=item ev_check_init (ev_check *, callback)
1910 2055
1911Initialises and configures the prepare or check watcher - they have no 2056Initialises and configures the prepare or check watcher - they have no
1912parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 2057parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1913macros, but using them is utterly, utterly and completely pointless. 2058macros, but using them is utterly, utterly, utterly and completely
2059pointless.
1914 2060
1915=back 2061=back
1916 2062
1917=head3 Examples 2063=head3 Examples
1918 2064
1927and in a check watcher, destroy them and call into libadns. What follows 2073and in a check watcher, destroy them and call into libadns. What follows
1928is pseudo-code only of course. This requires you to either use a low 2074is pseudo-code only of course. This requires you to either use a low
1929priority for the check watcher or use C<ev_clear_pending> explicitly, as 2075priority for the check watcher or use C<ev_clear_pending> explicitly, as
1930the callbacks for the IO/timeout watchers might not have been called yet. 2076the callbacks for the IO/timeout watchers might not have been called yet.
1931 2077
1932 static ev_io iow [nfd]; 2078 static ev_io iow [nfd];
1933 static ev_timer tw; 2079 static ev_timer tw;
1934 2080
1935 static void 2081 static void
1936 io_cb (ev_loop *loop, ev_io *w, int revents) 2082 io_cb (ev_loop *loop, ev_io *w, int revents)
1937 { 2083 {
1938 } 2084 }
1939 2085
1940 // create io watchers for each fd and a timer before blocking 2086 // create io watchers for each fd and a timer before blocking
1941 static void 2087 static void
1942 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 2088 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1943 { 2089 {
1944 int timeout = 3600000; 2090 int timeout = 3600000;
1945 struct pollfd fds [nfd]; 2091 struct pollfd fds [nfd];
1946 // actual code will need to loop here and realloc etc. 2092 // actual code will need to loop here and realloc etc.
1947 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2093 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1948 2094
1949 /* the callback is illegal, but won't be called as we stop during check */ 2095 /* the callback is illegal, but won't be called as we stop during check */
1950 ev_timer_init (&tw, 0, timeout * 1e-3); 2096 ev_timer_init (&tw, 0, timeout * 1e-3);
1951 ev_timer_start (loop, &tw); 2097 ev_timer_start (loop, &tw);
1952 2098
1953 // create one ev_io per pollfd 2099 // create one ev_io per pollfd
1954 for (int i = 0; i < nfd; ++i) 2100 for (int i = 0; i < nfd; ++i)
1955 { 2101 {
1956 ev_io_init (iow + i, io_cb, fds [i].fd, 2102 ev_io_init (iow + i, io_cb, fds [i].fd,
1957 ((fds [i].events & POLLIN ? EV_READ : 0) 2103 ((fds [i].events & POLLIN ? EV_READ : 0)
1958 | (fds [i].events & POLLOUT ? EV_WRITE : 0))); 2104 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1959 2105
1960 fds [i].revents = 0; 2106 fds [i].revents = 0;
1961 ev_io_start (loop, iow + i); 2107 ev_io_start (loop, iow + i);
1962 } 2108 }
1963 } 2109 }
1964 2110
1965 // stop all watchers after blocking 2111 // stop all watchers after blocking
1966 static void 2112 static void
1967 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 2113 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1968 { 2114 {
1969 ev_timer_stop (loop, &tw); 2115 ev_timer_stop (loop, &tw);
1970 2116
1971 for (int i = 0; i < nfd; ++i) 2117 for (int i = 0; i < nfd; ++i)
1972 { 2118 {
1973 // set the relevant poll flags 2119 // set the relevant poll flags
1974 // could also call adns_processreadable etc. here 2120 // could also call adns_processreadable etc. here
1975 struct pollfd *fd = fds + i; 2121 struct pollfd *fd = fds + i;
1976 int revents = ev_clear_pending (iow + i); 2122 int revents = ev_clear_pending (iow + i);
1977 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN; 2123 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1978 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT; 2124 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1979 2125
1980 // now stop the watcher 2126 // now stop the watcher
1981 ev_io_stop (loop, iow + i); 2127 ev_io_stop (loop, iow + i);
1982 } 2128 }
1983 2129
1984 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); 2130 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1985 } 2131 }
1986 2132
1987Method 2: This would be just like method 1, but you run C<adns_afterpoll> 2133Method 2: This would be just like method 1, but you run C<adns_afterpoll>
1988in the prepare watcher and would dispose of the check watcher. 2134in the prepare watcher and would dispose of the check watcher.
1989 2135
1990Method 3: If the module to be embedded supports explicit event 2136Method 3: If the module to be embedded supports explicit event
1991notification (adns does), you can also make use of the actual watcher 2137notification (libadns does), you can also make use of the actual watcher
1992callbacks, and only destroy/create the watchers in the prepare watcher. 2138callbacks, and only destroy/create the watchers in the prepare watcher.
1993 2139
1994 static void 2140 static void
1995 timer_cb (EV_P_ ev_timer *w, int revents) 2141 timer_cb (EV_P_ ev_timer *w, int revents)
1996 { 2142 {
1997 adns_state ads = (adns_state)w->data; 2143 adns_state ads = (adns_state)w->data;
1998 update_now (EV_A); 2144 update_now (EV_A);
1999 2145
2000 adns_processtimeouts (ads, &tv_now); 2146 adns_processtimeouts (ads, &tv_now);
2001 } 2147 }
2002 2148
2003 static void 2149 static void
2004 io_cb (EV_P_ ev_io *w, int revents) 2150 io_cb (EV_P_ ev_io *w, int revents)
2005 { 2151 {
2006 adns_state ads = (adns_state)w->data; 2152 adns_state ads = (adns_state)w->data;
2007 update_now (EV_A); 2153 update_now (EV_A);
2008 2154
2009 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now); 2155 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
2010 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now); 2156 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
2011 } 2157 }
2012 2158
2013 // do not ever call adns_afterpoll 2159 // do not ever call adns_afterpoll
2014 2160
2015Method 4: Do not use a prepare or check watcher because the module you 2161Method 4: Do not use a prepare or check watcher because the module you
2016want to embed is too inflexible to support it. Instead, youc na override 2162want to embed is not flexible enough to support it. Instead, you can
2017their poll function. The drawback with this solution is that the main 2163override their poll function. The drawback with this solution is that the
2018loop is now no longer controllable by EV. The C<Glib::EV> module does 2164main loop is now no longer controllable by EV. The C<Glib::EV> module uses
2019this. 2165this approach, effectively embedding EV as a client into the horrible
2166libglib event loop.
2020 2167
2021 static gint 2168 static gint
2022 event_poll_func (GPollFD *fds, guint nfds, gint timeout) 2169 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
2023 { 2170 {
2024 int got_events = 0; 2171 int got_events = 0;
2025 2172
2026 for (n = 0; n < nfds; ++n) 2173 for (n = 0; n < nfds; ++n)
2027 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events 2174 // create/start io watcher that sets the relevant bits in fds[n] and increment got_events
2028 2175
2029 if (timeout >= 0) 2176 if (timeout >= 0)
2030 // create/start timer 2177 // create/start timer
2031 2178
2032 // poll 2179 // poll
2033 ev_loop (EV_A_ 0); 2180 ev_loop (EV_A_ 0);
2034 2181
2035 // stop timer again 2182 // stop timer again
2036 if (timeout >= 0) 2183 if (timeout >= 0)
2037 ev_timer_stop (EV_A_ &to); 2184 ev_timer_stop (EV_A_ &to);
2038 2185
2039 // stop io watchers again - their callbacks should have set 2186 // stop io watchers again - their callbacks should have set
2040 for (n = 0; n < nfds; ++n) 2187 for (n = 0; n < nfds; ++n)
2041 ev_io_stop (EV_A_ iow [n]); 2188 ev_io_stop (EV_A_ iow [n]);
2042 2189
2043 return got_events; 2190 return got_events;
2044 } 2191 }
2045 2192
2046 2193
2047=head2 C<ev_embed> - when one backend isn't enough... 2194=head2 C<ev_embed> - when one backend isn't enough...
2048 2195
2049This is a rather advanced watcher type that lets you embed one event loop 2196This is a rather advanced watcher type that lets you embed one event loop
2055prioritise I/O. 2202prioritise I/O.
2056 2203
2057As an example for a bug workaround, the kqueue backend might only support 2204As an example for a bug workaround, the kqueue backend might only support
2058sockets on some platform, so it is unusable as generic backend, but you 2205sockets on some platform, so it is unusable as generic backend, but you
2059still want to make use of it because you have many sockets and it scales 2206still want to make use of it because you have many sockets and it scales
2060so nicely. In this case, you would create a kqueue-based loop and embed it 2207so nicely. In this case, you would create a kqueue-based loop and embed
2061into your default loop (which might use e.g. poll). Overall operation will 2208it into your default loop (which might use e.g. poll). Overall operation
2062be a bit slower because first libev has to poll and then call kevent, but 2209will be a bit slower because first libev has to call C<poll> and then
2063at least you can use both at what they are best. 2210C<kevent>, but at least you can use both mechanisms for what they are
2211best: C<kqueue> for scalable sockets and C<poll> if you want it to work :)
2064 2212
2065As for prioritising I/O: rarely you have the case where some fds have 2213As for prioritising I/O: under rare circumstances you have the case where
2066to be watched and handled very quickly (with low latency), and even 2214some fds have to be watched and handled very quickly (with low latency),
2067priorities and idle watchers might have too much overhead. In this case 2215and even priorities and idle watchers might have too much overhead. In
2068you would put all the high priority stuff in one loop and all the rest in 2216this case you would put all the high priority stuff in one loop and all
2069a second one, and embed the second one in the first. 2217the rest in a second one, and embed the second one in the first.
2070 2218
2071As long as the watcher is active, the callback will be invoked every time 2219As long as the watcher is active, the callback will be invoked every time
2072there might be events pending in the embedded loop. The callback must then 2220there might be events pending in the embedded loop. The callback must then
2073call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke 2221call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke
2074their callbacks (you could also start an idle watcher to give the embedded 2222their callbacks (you could also start an idle watcher to give the embedded
2082interested in that. 2230interested in that.
2083 2231
2084Also, there have not currently been made special provisions for forking: 2232Also, there have not currently been made special provisions for forking:
2085when you fork, you not only have to call C<ev_loop_fork> on both loops, 2233when you fork, you not only have to call C<ev_loop_fork> on both loops,
2086but you will also have to stop and restart any C<ev_embed> watchers 2234but you will also have to stop and restart any C<ev_embed> watchers
2087yourself. 2235yourself - but you can use a fork watcher to handle this automatically,
2236and future versions of libev might do just that.
2088 2237
2089Unfortunately, not all backends are embeddable, only the ones returned by 2238Unfortunately, not all backends are embeddable: only the ones returned by
2090C<ev_embeddable_backends> are, which, unfortunately, does not include any 2239C<ev_embeddable_backends> are, which, unfortunately, does not include any
2091portable one. 2240portable one.
2092 2241
2093So when you want to use this feature you will always have to be prepared 2242So when you want to use this feature you will always have to be prepared
2094that you cannot get an embeddable loop. The recommended way to get around 2243that you cannot get an embeddable loop. The recommended way to get around
2095this is to have a separate variables for your embeddable loop, try to 2244this is to have a separate variables for your embeddable loop, try to
2096create it, and if that fails, use the normal loop for everything. 2245create it, and if that fails, use the normal loop for everything.
2097 2246
2247=head3 C<ev_embed> and fork
2248
2249While the C<ev_embed> watcher is running, forks in the embedding loop will
2250automatically be applied to the embedded loop as well, so no special
2251fork handling is required in that case. When the watcher is not running,
2252however, it is still the task of the libev user to call C<ev_loop_fork ()>
2253as applicable.
2254
2098=head3 Watcher-Specific Functions and Data Members 2255=head3 Watcher-Specific Functions and Data Members
2099 2256
2100=over 4 2257=over 4
2101 2258
2102=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 2259=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
2105 2262
2106Configures the watcher to embed the given loop, which must be 2263Configures the watcher to embed the given loop, which must be
2107embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 2264embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
2108invoked automatically, otherwise it is the responsibility of the callback 2265invoked automatically, otherwise it is the responsibility of the callback
2109to invoke it (it will continue to be called until the sweep has been done, 2266to invoke it (it will continue to be called until the sweep has been done,
2110if you do not want thta, you need to temporarily stop the embed watcher). 2267if you do not want that, you need to temporarily stop the embed watcher).
2111 2268
2112=item ev_embed_sweep (loop, ev_embed *) 2269=item ev_embed_sweep (loop, ev_embed *)
2113 2270
2114Make a single, non-blocking sweep over the embedded loop. This works 2271Make a single, non-blocking sweep over the embedded loop. This works
2115similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2272similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
2116apropriate way for embedded loops. 2273appropriate way for embedded loops.
2117 2274
2118=item struct ev_loop *other [read-only] 2275=item struct ev_loop *other [read-only]
2119 2276
2120The embedded event loop. 2277The embedded event loop.
2121 2278
2123 2280
2124=head3 Examples 2281=head3 Examples
2125 2282
2126Example: Try to get an embeddable event loop and embed it into the default 2283Example: Try to get an embeddable event loop and embed it into the default
2127event loop. If that is not possible, use the default loop. The default 2284event loop. If that is not possible, use the default loop. The default
2128loop is stored in C<loop_hi>, while the mebeddable loop is stored in 2285loop is stored in C<loop_hi>, while the embeddable loop is stored in
2129C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be 2286C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2130used). 2287used).
2131 2288
2132 struct ev_loop *loop_hi = ev_default_init (0); 2289 struct ev_loop *loop_hi = ev_default_init (0);
2133 struct ev_loop *loop_lo = 0; 2290 struct ev_loop *loop_lo = 0;
2134 struct ev_embed embed; 2291 struct ev_embed embed;
2135 2292
2136 // see if there is a chance of getting one that works 2293 // see if there is a chance of getting one that works
2137 // (remember that a flags value of 0 means autodetection) 2294 // (remember that a flags value of 0 means autodetection)
2138 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 2295 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2139 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 2296 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2140 : 0; 2297 : 0;
2141 2298
2142 // if we got one, then embed it, otherwise default to loop_hi 2299 // if we got one, then embed it, otherwise default to loop_hi
2143 if (loop_lo) 2300 if (loop_lo)
2144 { 2301 {
2145 ev_embed_init (&embed, 0, loop_lo); 2302 ev_embed_init (&embed, 0, loop_lo);
2146 ev_embed_start (loop_hi, &embed); 2303 ev_embed_start (loop_hi, &embed);
2147 } 2304 }
2148 else 2305 else
2149 loop_lo = loop_hi; 2306 loop_lo = loop_hi;
2150 2307
2151Example: Check if kqueue is available but not recommended and create 2308Example: Check if kqueue is available but not recommended and create
2152a kqueue backend for use with sockets (which usually work with any 2309a kqueue backend for use with sockets (which usually work with any
2153kqueue implementation). Store the kqueue/socket-only event loop in 2310kqueue implementation). Store the kqueue/socket-only event loop in
2154C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 2311C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2155 2312
2156 struct ev_loop *loop = ev_default_init (0); 2313 struct ev_loop *loop = ev_default_init (0);
2157 struct ev_loop *loop_socket = 0; 2314 struct ev_loop *loop_socket = 0;
2158 struct ev_embed embed; 2315 struct ev_embed embed;
2159 2316
2160 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 2317 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2161 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 2318 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2162 { 2319 {
2163 ev_embed_init (&embed, 0, loop_socket); 2320 ev_embed_init (&embed, 0, loop_socket);
2164 ev_embed_start (loop, &embed); 2321 ev_embed_start (loop, &embed);
2165 } 2322 }
2166 2323
2167 if (!loop_socket) 2324 if (!loop_socket)
2168 loop_socket = loop; 2325 loop_socket = loop;
2169 2326
2170 // now use loop_socket for all sockets, and loop for everything else 2327 // now use loop_socket for all sockets, and loop for everything else
2171 2328
2172 2329
2173=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2330=head2 C<ev_fork> - the audacity to resume the event loop after a fork
2174 2331
2175Fork watchers are called when a C<fork ()> was detected (usually because 2332Fork watchers are called when a C<fork ()> was detected (usually because
2219is that the author does not know of a simple (or any) algorithm for a 2376is that the author does not know of a simple (or any) algorithm for a
2220multiple-writer-single-reader queue that works in all cases and doesn't 2377multiple-writer-single-reader queue that works in all cases and doesn't
2221need elaborate support such as pthreads. 2378need elaborate support such as pthreads.
2222 2379
2223That means that if you want to queue data, you have to provide your own 2380That means that if you want to queue data, you have to provide your own
2224queue. But at least I can tell you would implement locking around your 2381queue. But at least I can tell you how to implement locking around your
2225queue: 2382queue:
2226 2383
2227=over 4 2384=over 4
2228 2385
2229=item queueing from a signal handler context 2386=item queueing from a signal handler context
2230 2387
2231To implement race-free queueing, you simply add to the queue in the signal 2388To implement race-free queueing, you simply add to the queue in the signal
2232handler but you block the signal handler in the watcher callback. Here is an example that does that for 2389handler but you block the signal handler in the watcher callback. Here is an example that does that for
2233some fictitiuous SIGUSR1 handler: 2390some fictitious SIGUSR1 handler:
2234 2391
2235 static ev_async mysig; 2392 static ev_async mysig;
2236 2393
2237 static void 2394 static void
2238 sigusr1_handler (void) 2395 sigusr1_handler (void)
2305 2462
2306=item ev_async_init (ev_async *, callback) 2463=item ev_async_init (ev_async *, callback)
2307 2464
2308Initialises and configures the async watcher - it has no parameters of any 2465Initialises and configures the async watcher - it has no parameters of any
2309kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, 2466kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,
2310believe me. 2467trust me.
2311 2468
2312=item ev_async_send (loop, ev_async *) 2469=item ev_async_send (loop, ev_async *)
2313 2470
2314Sends/signals/activates the given C<ev_async> watcher, that is, feeds 2471Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2315an C<EV_ASYNC> event on the watcher into the event loop. Unlike 2472an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2316C<ev_feed_event>, this call is safe to do in other threads, signal or 2473C<ev_feed_event>, this call is safe to do from other threads, signal or
2317similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding 2474similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2318section below on what exactly this means). 2475section below on what exactly this means).
2319 2476
2320This call incurs the overhead of a syscall only once per loop iteration, 2477This call incurs the overhead of a system call only once per loop iteration,
2321so while the overhead might be noticable, it doesn't apply to repeated 2478so while the overhead might be noticeable, it doesn't apply to repeated
2322calls to C<ev_async_send>. 2479calls to C<ev_async_send>.
2323 2480
2324=item bool = ev_async_pending (ev_async *) 2481=item bool = ev_async_pending (ev_async *)
2325 2482
2326Returns a non-zero value when C<ev_async_send> has been called on the 2483Returns a non-zero value when C<ev_async_send> has been called on the
2328event loop. 2485event loop.
2329 2486
2330C<ev_async_send> sets a flag in the watcher and wakes up the loop. When 2487C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2331the loop iterates next and checks for the watcher to have become active, 2488the loop iterates next and checks for the watcher to have become active,
2332it will reset the flag again. C<ev_async_pending> can be used to very 2489it will reset the flag again. C<ev_async_pending> can be used to very
2333quickly check wether invoking the loop might be a good idea. 2490quickly check whether invoking the loop might be a good idea.
2334 2491
2335Not that this does I<not> check wether the watcher itself is pending, only 2492Not that this does I<not> check whether the watcher itself is pending, only
2336wether it has been requested to make this watcher pending. 2493whether it has been requested to make this watcher pending.
2337 2494
2338=back 2495=back
2339 2496
2340 2497
2341=head1 OTHER FUNCTIONS 2498=head1 OTHER FUNCTIONS
2352or timeout without having to allocate/configure/start/stop/free one or 2509or timeout without having to allocate/configure/start/stop/free one or
2353more watchers yourself. 2510more watchers yourself.
2354 2511
2355If C<fd> is less than 0, then no I/O watcher will be started and events 2512If C<fd> is less than 0, then no I/O watcher will be started and events
2356is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and 2513is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
2357C<events> set will be craeted and started. 2514C<events> set will be created and started.
2358 2515
2359If C<timeout> is less than 0, then no timeout watcher will be 2516If C<timeout> is less than 0, then no timeout watcher will be
2360started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 2517started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2361repeat = 0) will be started. While C<0> is a valid timeout, it is of 2518repeat = 0) will be started. While C<0> is a valid timeout, it is of
2362dubious value. 2519dubious value.
2364The callback has the type C<void (*cb)(int revents, void *arg)> and gets 2521The callback has the type C<void (*cb)(int revents, void *arg)> and gets
2365passed an C<revents> set like normal event callbacks (a combination of 2522passed an C<revents> set like normal event callbacks (a combination of
2366C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 2523C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
2367value passed to C<ev_once>: 2524value passed to C<ev_once>:
2368 2525
2369 static void stdin_ready (int revents, void *arg) 2526 static void stdin_ready (int revents, void *arg)
2370 { 2527 {
2371 if (revents & EV_TIMEOUT) 2528 if (revents & EV_TIMEOUT)
2372 /* doh, nothing entered */; 2529 /* doh, nothing entered */;
2373 else if (revents & EV_READ) 2530 else if (revents & EV_READ)
2374 /* stdin might have data for us, joy! */; 2531 /* stdin might have data for us, joy! */;
2375 } 2532 }
2376 2533
2377 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 2534 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2378 2535
2379=item ev_feed_event (ev_loop *, watcher *, int revents) 2536=item ev_feed_event (ev_loop *, watcher *, int revents)
2380 2537
2381Feeds the given event set into the event loop, as if the specified event 2538Feeds the given event set into the event loop, as if the specified event
2382had happened for the specified watcher (which must be a pointer to an 2539had happened for the specified watcher (which must be a pointer to an
2387Feed an event on the given fd, as if a file descriptor backend detected 2544Feed an event on the given fd, as if a file descriptor backend detected
2388the given events it. 2545the given events it.
2389 2546
2390=item ev_feed_signal_event (ev_loop *loop, int signum) 2547=item ev_feed_signal_event (ev_loop *loop, int signum)
2391 2548
2392Feed an event as if the given signal occured (C<loop> must be the default 2549Feed an event as if the given signal occurred (C<loop> must be the default
2393loop!). 2550loop!).
2394 2551
2395=back 2552=back
2396 2553
2397 2554
2426=back 2583=back
2427 2584
2428=head1 C++ SUPPORT 2585=head1 C++ SUPPORT
2429 2586
2430Libev comes with some simplistic wrapper classes for C++ that mainly allow 2587Libev comes with some simplistic wrapper classes for C++ that mainly allow
2431you to use some convinience methods to start/stop watchers and also change 2588you to use some convenience methods to start/stop watchers and also change
2432the callback model to a model using method callbacks on objects. 2589the callback model to a model using method callbacks on objects.
2433 2590
2434To use it, 2591To use it,
2435 2592
2436 #include <ev++.h> 2593 #include <ev++.h>
2437 2594
2438This automatically includes F<ev.h> and puts all of its definitions (many 2595This automatically includes F<ev.h> and puts all of its definitions (many
2439of them macros) into the global namespace. All C++ specific things are 2596of them macros) into the global namespace. All C++ specific things are
2440put into the C<ev> namespace. It should support all the same embedding 2597put into the C<ev> namespace. It should support all the same embedding
2441options as F<ev.h>, most notably C<EV_MULTIPLICITY>. 2598options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
2508your compiler is good :), then the method will be fully inlined into the 2665your compiler is good :), then the method will be fully inlined into the
2509thunking function, making it as fast as a direct C callback. 2666thunking function, making it as fast as a direct C callback.
2510 2667
2511Example: simple class declaration and watcher initialisation 2668Example: simple class declaration and watcher initialisation
2512 2669
2513 struct myclass 2670 struct myclass
2514 { 2671 {
2515 void io_cb (ev::io &w, int revents) { } 2672 void io_cb (ev::io &w, int revents) { }
2516 } 2673 }
2517 2674
2518 myclass obj; 2675 myclass obj;
2519 ev::io iow; 2676 ev::io iow;
2520 iow.set <myclass, &myclass::io_cb> (&obj); 2677 iow.set <myclass, &myclass::io_cb> (&obj);
2521 2678
2522=item w->set<function> (void *data = 0) 2679=item w->set<function> (void *data = 0)
2523 2680
2524Also sets a callback, but uses a static method or plain function as 2681Also sets a callback, but uses a static method or plain function as
2525callback. The optional C<data> argument will be stored in the watcher's 2682callback. The optional C<data> argument will be stored in the watcher's
2527 2684
2528The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>. 2685The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>.
2529 2686
2530See the method-C<set> above for more details. 2687See the method-C<set> above for more details.
2531 2688
2532Example: 2689Example: Use a plain function as callback.
2533 2690
2534 static void io_cb (ev::io &w, int revents) { } 2691 static void io_cb (ev::io &w, int revents) { }
2535 iow.set <io_cb> (); 2692 iow.set <io_cb> ();
2536 2693
2537=item w->set (struct ev_loop *) 2694=item w->set (struct ev_loop *)
2538 2695
2539Associates a different C<struct ev_loop> with this watcher. You can only 2696Associates a different C<struct ev_loop> with this watcher. You can only
2540do this when the watcher is inactive (and not pending either). 2697do this when the watcher is inactive (and not pending either).
2541 2698
2542=item w->set ([args]) 2699=item w->set ([arguments])
2543 2700
2544Basically the same as C<ev_TYPE_set>, with the same args. Must be 2701Basically the same as C<ev_TYPE_set>, with the same arguments. Must be
2545called at least once. Unlike the C counterpart, an active watcher gets 2702called at least once. Unlike the C counterpart, an active watcher gets
2546automatically stopped and restarted when reconfiguring it with this 2703automatically stopped and restarted when reconfiguring it with this
2547method. 2704method.
2548 2705
2549=item w->start () 2706=item w->start ()
2573=back 2730=back
2574 2731
2575Example: Define a class with an IO and idle watcher, start one of them in 2732Example: Define a class with an IO and idle watcher, start one of them in
2576the constructor. 2733the constructor.
2577 2734
2578 class myclass 2735 class myclass
2579 { 2736 {
2580 ev::io io; void io_cb (ev::io &w, int revents); 2737 ev::io io ; void io_cb (ev::io &w, int revents);
2581 ev:idle idle void idle_cb (ev::idle &w, int revents); 2738 ev::idle idle; void idle_cb (ev::idle &w, int revents);
2582 2739
2583 myclass (int fd) 2740 myclass (int fd)
2584 { 2741 {
2585 io .set <myclass, &myclass::io_cb > (this); 2742 io .set <myclass, &myclass::io_cb > (this);
2586 idle.set <myclass, &myclass::idle_cb> (this); 2743 idle.set <myclass, &myclass::idle_cb> (this);
2587 2744
2588 io.start (fd, ev::READ); 2745 io.start (fd, ev::READ);
2589 } 2746 }
2590 }; 2747 };
2591 2748
2592 2749
2593=head1 OTHER LANGUAGE BINDINGS 2750=head1 OTHER LANGUAGE BINDINGS
2594 2751
2595Libev does not offer other language bindings itself, but bindings for a 2752Libev does not offer other language bindings itself, but bindings for a
2596numbe rof languages exist in the form of third-party packages. If you know 2753number of languages exist in the form of third-party packages. If you know
2597any interesting language binding in addition to the ones listed here, drop 2754any interesting language binding in addition to the ones listed here, drop
2598me a note. 2755me a note.
2599 2756
2600=over 4 2757=over 4
2601 2758
2602=item Perl 2759=item Perl
2603 2760
2604The EV module implements the full libev API and is actually used to test 2761The EV module implements the full libev API and is actually used to test
2605libev. EV is developed together with libev. Apart from the EV core module, 2762libev. EV is developed together with libev. Apart from the EV core module,
2606there are additional modules that implement libev-compatible interfaces 2763there are additional modules that implement libev-compatible interfaces
2607to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the 2764to C<libadns> (C<EV::ADNS>, but C<AnyEvent::DNS> is preferred nowadays),
2608C<libglib> event core (C<Glib::EV> and C<EV::Glib>). 2765C<Net::SNMP> (C<Net::SNMP::EV>) and the C<libglib> event core (C<Glib::EV>
2766and C<EV::Glib>).
2609 2767
2610It can be found and installed via CPAN, its homepage is found at 2768It can be found and installed via CPAN, its homepage is at
2611L<http://software.schmorp.de/pkg/EV>. 2769L<http://software.schmorp.de/pkg/EV>.
2612 2770
2771=item Python
2772
2773Python bindings can be found at L<http://code.google.com/p/pyev/>. It
2774seems to be quite complete and well-documented. Note, however, that the
2775patch they require for libev is outright dangerous as it breaks the ABI
2776for everybody else, and therefore, should never be applied in an installed
2777libev (if python requires an incompatible ABI then it needs to embed
2778libev).
2779
2613=item Ruby 2780=item Ruby
2614 2781
2615Tony Arcieri has written a ruby extension that offers access to a subset 2782Tony Arcieri has written a ruby extension that offers access to a subset
2616of the libev API and adds filehandle abstractions, asynchronous DNS and 2783of the libev API and adds file handle abstractions, asynchronous DNS and
2617more on top of it. It can be found via gem servers. Its homepage is at 2784more on top of it. It can be found via gem servers. Its homepage is at
2618L<http://rev.rubyforge.org/>. 2785L<http://rev.rubyforge.org/>.
2619 2786
2620=item D 2787=item D
2621 2788
2622Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to 2789Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2623be found at L<http://git.llucax.com.ar/?p=software/ev.d.git;a=summary>. 2790be found at L<http://proj.llucax.com.ar/wiki/evd>.
2624 2791
2625=back 2792=back
2626 2793
2627 2794
2628=head1 MACRO MAGIC 2795=head1 MACRO MAGIC
2629 2796
2630Libev can be compiled with a variety of options, the most fundamantal 2797Libev can be compiled with a variety of options, the most fundamental
2631of which is C<EV_MULTIPLICITY>. This option determines whether (most) 2798of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2632functions and callbacks have an initial C<struct ev_loop *> argument. 2799functions and callbacks have an initial C<struct ev_loop *> argument.
2633 2800
2634To make it easier to write programs that cope with either variant, the 2801To make it easier to write programs that cope with either variant, the
2635following macros are defined: 2802following macros are defined:
2640 2807
2641This provides the loop I<argument> for functions, if one is required ("ev 2808This provides the loop I<argument> for functions, if one is required ("ev
2642loop argument"). The C<EV_A> form is used when this is the sole argument, 2809loop argument"). The C<EV_A> form is used when this is the sole argument,
2643C<EV_A_> is used when other arguments are following. Example: 2810C<EV_A_> is used when other arguments are following. Example:
2644 2811
2645 ev_unref (EV_A); 2812 ev_unref (EV_A);
2646 ev_timer_add (EV_A_ watcher); 2813 ev_timer_add (EV_A_ watcher);
2647 ev_loop (EV_A_ 0); 2814 ev_loop (EV_A_ 0);
2648 2815
2649It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 2816It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2650which is often provided by the following macro. 2817which is often provided by the following macro.
2651 2818
2652=item C<EV_P>, C<EV_P_> 2819=item C<EV_P>, C<EV_P_>
2653 2820
2654This provides the loop I<parameter> for functions, if one is required ("ev 2821This provides the loop I<parameter> for functions, if one is required ("ev
2655loop parameter"). The C<EV_P> form is used when this is the sole parameter, 2822loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2656C<EV_P_> is used when other parameters are following. Example: 2823C<EV_P_> is used when other parameters are following. Example:
2657 2824
2658 // this is how ev_unref is being declared 2825 // this is how ev_unref is being declared
2659 static void ev_unref (EV_P); 2826 static void ev_unref (EV_P);
2660 2827
2661 // this is how you can declare your typical callback 2828 // this is how you can declare your typical callback
2662 static void cb (EV_P_ ev_timer *w, int revents) 2829 static void cb (EV_P_ ev_timer *w, int revents)
2663 2830
2664It declares a parameter C<loop> of type C<struct ev_loop *>, quite 2831It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2665suitable for use with C<EV_A>. 2832suitable for use with C<EV_A>.
2666 2833
2667=item C<EV_DEFAULT>, C<EV_DEFAULT_> 2834=item C<EV_DEFAULT>, C<EV_DEFAULT_>
2683 2850
2684Example: Declare and initialise a check watcher, utilising the above 2851Example: Declare and initialise a check watcher, utilising the above
2685macros so it will work regardless of whether multiple loops are supported 2852macros so it will work regardless of whether multiple loops are supported
2686or not. 2853or not.
2687 2854
2688 static void 2855 static void
2689 check_cb (EV_P_ ev_timer *w, int revents) 2856 check_cb (EV_P_ ev_timer *w, int revents)
2690 { 2857 {
2691 ev_check_stop (EV_A_ w); 2858 ev_check_stop (EV_A_ w);
2692 } 2859 }
2693 2860
2694 ev_check check; 2861 ev_check check;
2695 ev_check_init (&check, check_cb); 2862 ev_check_init (&check, check_cb);
2696 ev_check_start (EV_DEFAULT_ &check); 2863 ev_check_start (EV_DEFAULT_ &check);
2697 ev_loop (EV_DEFAULT_ 0); 2864 ev_loop (EV_DEFAULT_ 0);
2698 2865
2699=head1 EMBEDDING 2866=head1 EMBEDDING
2700 2867
2701Libev can (and often is) directly embedded into host 2868Libev can (and often is) directly embedded into host
2702applications. Examples of applications that embed it include the Deliantra 2869applications. Examples of applications that embed it include the Deliantra
2709libev somewhere in your source tree). 2876libev somewhere in your source tree).
2710 2877
2711=head2 FILESETS 2878=head2 FILESETS
2712 2879
2713Depending on what features you need you need to include one or more sets of files 2880Depending on what features you need you need to include one or more sets of files
2714in your app. 2881in your application.
2715 2882
2716=head3 CORE EVENT LOOP 2883=head3 CORE EVENT LOOP
2717 2884
2718To include only the libev core (all the C<ev_*> functions), with manual 2885To include only the libev core (all the C<ev_*> functions), with manual
2719configuration (no autoconf): 2886configuration (no autoconf):
2720 2887
2721 #define EV_STANDALONE 1 2888 #define EV_STANDALONE 1
2722 #include "ev.c" 2889 #include "ev.c"
2723 2890
2724This will automatically include F<ev.h>, too, and should be done in a 2891This will automatically include F<ev.h>, too, and should be done in a
2725single C source file only to provide the function implementations. To use 2892single C source file only to provide the function implementations. To use
2726it, do the same for F<ev.h> in all files wishing to use this API (best 2893it, do the same for F<ev.h> in all files wishing to use this API (best
2727done by writing a wrapper around F<ev.h> that you can include instead and 2894done by writing a wrapper around F<ev.h> that you can include instead and
2728where you can put other configuration options): 2895where you can put other configuration options):
2729 2896
2730 #define EV_STANDALONE 1 2897 #define EV_STANDALONE 1
2731 #include "ev.h" 2898 #include "ev.h"
2732 2899
2733Both header files and implementation files can be compiled with a C++ 2900Both header files and implementation files can be compiled with a C++
2734compiler (at least, thats a stated goal, and breakage will be treated 2901compiler (at least, thats a stated goal, and breakage will be treated
2735as a bug). 2902as a bug).
2736 2903
2737You need the following files in your source tree, or in a directory 2904You need the following files in your source tree, or in a directory
2738in your include path (e.g. in libev/ when using -Ilibev): 2905in your include path (e.g. in libev/ when using -Ilibev):
2739 2906
2740 ev.h 2907 ev.h
2741 ev.c 2908 ev.c
2742 ev_vars.h 2909 ev_vars.h
2743 ev_wrap.h 2910 ev_wrap.h
2744 2911
2745 ev_win32.c required on win32 platforms only 2912 ev_win32.c required on win32 platforms only
2746 2913
2747 ev_select.c only when select backend is enabled (which is enabled by default) 2914 ev_select.c only when select backend is enabled (which is enabled by default)
2748 ev_poll.c only when poll backend is enabled (disabled by default) 2915 ev_poll.c only when poll backend is enabled (disabled by default)
2749 ev_epoll.c only when the epoll backend is enabled (disabled by default) 2916 ev_epoll.c only when the epoll backend is enabled (disabled by default)
2750 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 2917 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2751 ev_port.c only when the solaris port backend is enabled (disabled by default) 2918 ev_port.c only when the solaris port backend is enabled (disabled by default)
2752 2919
2753F<ev.c> includes the backend files directly when enabled, so you only need 2920F<ev.c> includes the backend files directly when enabled, so you only need
2754to compile this single file. 2921to compile this single file.
2755 2922
2756=head3 LIBEVENT COMPATIBILITY API 2923=head3 LIBEVENT COMPATIBILITY API
2757 2924
2758To include the libevent compatibility API, also include: 2925To include the libevent compatibility API, also include:
2759 2926
2760 #include "event.c" 2927 #include "event.c"
2761 2928
2762in the file including F<ev.c>, and: 2929in the file including F<ev.c>, and:
2763 2930
2764 #include "event.h" 2931 #include "event.h"
2765 2932
2766in the files that want to use the libevent API. This also includes F<ev.h>. 2933in the files that want to use the libevent API. This also includes F<ev.h>.
2767 2934
2768You need the following additional files for this: 2935You need the following additional files for this:
2769 2936
2770 event.h 2937 event.h
2771 event.c 2938 event.c
2772 2939
2773=head3 AUTOCONF SUPPORT 2940=head3 AUTOCONF SUPPORT
2774 2941
2775Instead of using C<EV_STANDALONE=1> and providing your config in 2942Instead of using C<EV_STANDALONE=1> and providing your configuration in
2776whatever way you want, you can also C<m4_include([libev.m4])> in your 2943whatever way you want, you can also C<m4_include([libev.m4])> in your
2777F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then 2944F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2778include F<config.h> and configure itself accordingly. 2945include F<config.h> and configure itself accordingly.
2779 2946
2780For this of course you need the m4 file: 2947For this of course you need the m4 file:
2781 2948
2782 libev.m4 2949 libev.m4
2783 2950
2784=head2 PREPROCESSOR SYMBOLS/MACROS 2951=head2 PREPROCESSOR SYMBOLS/MACROS
2785 2952
2786Libev can be configured via a variety of preprocessor symbols you have to 2953Libev can be configured via a variety of preprocessor symbols you have to
2787define before including any of its files. The default in the absense of 2954define before including any of its files. The default in the absence of
2788autoconf is noted for every option. 2955autoconf is documented for every option.
2789 2956
2790=over 4 2957=over 4
2791 2958
2792=item EV_STANDALONE 2959=item EV_STANDALONE
2793 2960
2798F<event.h> that are not directly supported by the libev core alone. 2965F<event.h> that are not directly supported by the libev core alone.
2799 2966
2800=item EV_USE_MONOTONIC 2967=item EV_USE_MONOTONIC
2801 2968
2802If defined to be C<1>, libev will try to detect the availability of the 2969If defined to be C<1>, libev will try to detect the availability of the
2803monotonic clock option at both compiletime and runtime. Otherwise no use 2970monotonic clock option at both compile time and runtime. Otherwise no use
2804of the monotonic clock option will be attempted. If you enable this, you 2971of the monotonic clock option will be attempted. If you enable this, you
2805usually have to link against librt or something similar. Enabling it when 2972usually have to link against librt or something similar. Enabling it when
2806the functionality isn't available is safe, though, although you have 2973the functionality isn't available is safe, though, although you have
2807to make sure you link against any libraries where the C<clock_gettime> 2974to make sure you link against any libraries where the C<clock_gettime>
2808function is hiding in (often F<-lrt>). 2975function is hiding in (often F<-lrt>).
2809 2976
2810=item EV_USE_REALTIME 2977=item EV_USE_REALTIME
2811 2978
2812If defined to be C<1>, libev will try to detect the availability of the 2979If defined to be C<1>, libev will try to detect the availability of the
2813realtime clock option at compiletime (and assume its availability at 2980real-time clock option at compile time (and assume its availability at
2814runtime if successful). Otherwise no use of the realtime clock option will 2981runtime if successful). Otherwise no use of the real-time clock option will
2815be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2982be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2816(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the 2983(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2817note about libraries in the description of C<EV_USE_MONOTONIC>, though. 2984note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2818 2985
2819=item EV_USE_NANOSLEEP 2986=item EV_USE_NANOSLEEP
28302.7 or newer, otherwise disabled. 29972.7 or newer, otherwise disabled.
2831 2998
2832=item EV_USE_SELECT 2999=item EV_USE_SELECT
2833 3000
2834If undefined or defined to be C<1>, libev will compile in support for the 3001If undefined or defined to be C<1>, libev will compile in support for the
2835C<select>(2) backend. No attempt at autodetection will be done: if no 3002C<select>(2) backend. No attempt at auto-detection will be done: if no
2836other method takes over, select will be it. Otherwise the select backend 3003other method takes over, select will be it. Otherwise the select backend
2837will not be compiled in. 3004will not be compiled in.
2838 3005
2839=item EV_SELECT_USE_FD_SET 3006=item EV_SELECT_USE_FD_SET
2840 3007
2841If defined to C<1>, then the select backend will use the system C<fd_set> 3008If defined to C<1>, then the select backend will use the system C<fd_set>
2842structure. This is useful if libev doesn't compile due to a missing 3009structure. This is useful if libev doesn't compile due to a missing
2843C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on 3010C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on
2844exotic systems. This usually limits the range of file descriptors to some 3011exotic systems. This usually limits the range of file descriptors to some
2845low limit such as 1024 or might have other limitations (winsocket only 3012low limit such as 1024 or might have other limitations (winsocket only
2846allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 3013allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2847influence the size of the C<fd_set> used. 3014influence the size of the C<fd_set> used.
2848 3015
2897otherwise another method will be used as fallback. This is the preferred 3064otherwise another method will be used as fallback. This is the preferred
2898backend for Solaris 10 systems. 3065backend for Solaris 10 systems.
2899 3066
2900=item EV_USE_DEVPOLL 3067=item EV_USE_DEVPOLL
2901 3068
2902reserved for future expansion, works like the USE symbols above. 3069Reserved for future expansion, works like the USE symbols above.
2903 3070
2904=item EV_USE_INOTIFY 3071=item EV_USE_INOTIFY
2905 3072
2906If defined to be C<1>, libev will compile in support for the Linux inotify 3073If defined to be C<1>, libev will compile in support for the Linux inotify
2907interface to speed up C<ev_stat> watchers. Its actual availability will 3074interface to speed up C<ev_stat> watchers. Its actual availability will
2914access is atomic with respect to other threads or signal contexts. No such 3081access is atomic with respect to other threads or signal contexts. No such
2915type is easily found in the C language, so you can provide your own type 3082type is easily found in the C language, so you can provide your own type
2916that you know is safe for your purposes. It is used both for signal handler "locking" 3083that you know is safe for your purposes. It is used both for signal handler "locking"
2917as well as for signal and thread safety in C<ev_async> watchers. 3084as well as for signal and thread safety in C<ev_async> watchers.
2918 3085
2919In the absense of this define, libev will use C<sig_atomic_t volatile> 3086In the absence of this define, libev will use C<sig_atomic_t volatile>
2920(from F<signal.h>), which is usually good enough on most platforms. 3087(from F<signal.h>), which is usually good enough on most platforms.
2921 3088
2922=item EV_H 3089=item EV_H
2923 3090
2924The name of the F<ev.h> header file used to include it. The default if 3091The name of the F<ev.h> header file used to include it. The default if
2963When doing priority-based operations, libev usually has to linearly search 3130When doing priority-based operations, libev usually has to linearly search
2964all the priorities, so having many of them (hundreds) uses a lot of space 3131all the priorities, so having many of them (hundreds) uses a lot of space
2965and time, so using the defaults of five priorities (-2 .. +2) is usually 3132and time, so using the defaults of five priorities (-2 .. +2) is usually
2966fine. 3133fine.
2967 3134
2968If your embedding app does not need any priorities, defining these both to 3135If your embedding application does not need any priorities, defining these
2969C<0> will save some memory and cpu. 3136both to C<0> will save some memory and CPU.
2970 3137
2971=item EV_PERIODIC_ENABLE 3138=item EV_PERIODIC_ENABLE
2972 3139
2973If undefined or defined to be C<1>, then periodic timers are supported. If 3140If undefined or defined to be C<1>, then periodic timers are supported. If
2974defined to be C<0>, then they are not. Disabling them saves a few kB of 3141defined to be C<0>, then they are not. Disabling them saves a few kB of
2981code. 3148code.
2982 3149
2983=item EV_EMBED_ENABLE 3150=item EV_EMBED_ENABLE
2984 3151
2985If undefined or defined to be C<1>, then embed watchers are supported. If 3152If undefined or defined to be C<1>, then embed watchers are supported. If
2986defined to be C<0>, then they are not. 3153defined to be C<0>, then they are not. Embed watchers rely on most other
3154watcher types, which therefore must not be disabled.
2987 3155
2988=item EV_STAT_ENABLE 3156=item EV_STAT_ENABLE
2989 3157
2990If undefined or defined to be C<1>, then stat watchers are supported. If 3158If undefined or defined to be C<1>, then stat watchers are supported. If
2991defined to be C<0>, then they are not. 3159defined to be C<0>, then they are not.
3002 3170
3003=item EV_MINIMAL 3171=item EV_MINIMAL
3004 3172
3005If you need to shave off some kilobytes of code at the expense of some 3173If you need to shave off some kilobytes of code at the expense of some
3006speed, define this symbol to C<1>. Currently this is used to override some 3174speed, define this symbol to C<1>. Currently this is used to override some
3007inlining decisions, saves roughly 30% codesize of amd64. It also selects a 3175inlining decisions, saves roughly 30% code size on amd64. It also selects a
3008much smaller 2-heap for timer management over the default 4-heap. 3176much smaller 2-heap for timer management over the default 4-heap.
3009 3177
3010=item EV_PID_HASHSIZE 3178=item EV_PID_HASHSIZE
3011 3179
3012C<ev_child> watchers use a small hash table to distribute workload by 3180C<ev_child> watchers use a small hash table to distribute workload by
3023two). 3191two).
3024 3192
3025=item EV_USE_4HEAP 3193=item EV_USE_4HEAP
3026 3194
3027Heaps are not very cache-efficient. To improve the cache-efficiency of the 3195Heaps are not very cache-efficient. To improve the cache-efficiency of the
3028timer and periodics heap, libev uses a 4-heap when this symbol is defined 3196timer and periodics heaps, libev uses a 4-heap when this symbol is defined
3029to C<1>. The 4-heap uses more complicated (longer) code but has 3197to C<1>. The 4-heap uses more complicated (longer) code but has noticeably
3030noticably faster performance with many (thousands) of watchers. 3198faster performance with many (thousands) of watchers.
3031 3199
3032The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 3200The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3033(disabled). 3201(disabled).
3034 3202
3035=item EV_HEAP_CACHE_AT 3203=item EV_HEAP_CACHE_AT
3036 3204
3037Heaps are not very cache-efficient. To improve the cache-efficiency of the 3205Heaps are not very cache-efficient. To improve the cache-efficiency of the
3038timer and periodics heap, libev can cache the timestamp (I<at>) within 3206timer and periodics heaps, libev can cache the timestamp (I<at>) within
3039the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), 3207the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3040which uses 8-12 bytes more per watcher and a few hundred bytes more code, 3208which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3041but avoids random read accesses on heap changes. This improves performance 3209but avoids random read accesses on heap changes. This improves performance
3042noticably with with many (hundreds) of watchers. 3210noticeably with many (hundreds) of watchers.
3043 3211
3044The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> 3212The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3045(disabled). 3213(disabled).
3046 3214
3047=item EV_VERIFY 3215=item EV_VERIFY
3053called once per loop, which can slow down libev. If set to C<3>, then the 3221called once per loop, which can slow down libev. If set to C<3>, then the
3054verification code will be called very frequently, which will slow down 3222verification code will be called very frequently, which will slow down
3055libev considerably. 3223libev considerably.
3056 3224
3057The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be 3225The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be
3058C<0.> 3226C<0>.
3059 3227
3060=item EV_COMMON 3228=item EV_COMMON
3061 3229
3062By default, all watchers have a C<void *data> member. By redefining 3230By default, all watchers have a C<void *data> member. By redefining
3063this macro to a something else you can include more and other types of 3231this macro to a something else you can include more and other types of
3064members. You have to define it each time you include one of the files, 3232members. You have to define it each time you include one of the files,
3065though, and it must be identical each time. 3233though, and it must be identical each time.
3066 3234
3067For example, the perl EV module uses something like this: 3235For example, the perl EV module uses something like this:
3068 3236
3069 #define EV_COMMON \ 3237 #define EV_COMMON \
3070 SV *self; /* contains this struct */ \ 3238 SV *self; /* contains this struct */ \
3071 SV *cb_sv, *fh /* note no trailing ";" */ 3239 SV *cb_sv, *fh /* note no trailing ";" */
3072 3240
3073=item EV_CB_DECLARE (type) 3241=item EV_CB_DECLARE (type)
3074 3242
3075=item EV_CB_INVOKE (watcher, revents) 3243=item EV_CB_INVOKE (watcher, revents)
3076 3244
3081definition and a statement, respectively. See the F<ev.h> header file for 3249definition and a statement, respectively. See the F<ev.h> header file for
3082their default definitions. One possible use for overriding these is to 3250their default definitions. One possible use for overriding these is to
3083avoid the C<struct ev_loop *> as first argument in all cases, or to use 3251avoid the C<struct ev_loop *> as first argument in all cases, or to use
3084method calls instead of plain function calls in C++. 3252method calls instead of plain function calls in C++.
3085 3253
3254=back
3255
3086=head2 EXPORTED API SYMBOLS 3256=head2 EXPORTED API SYMBOLS
3087 3257
3088If you need to re-export the API (e.g. via a dll) and you need a list of 3258If you need to re-export the API (e.g. via a DLL) and you need a list of
3089exported symbols, you can use the provided F<Symbol.*> files which list 3259exported symbols, you can use the provided F<Symbol.*> files which list
3090all public symbols, one per line: 3260all public symbols, one per line:
3091 3261
3092 Symbols.ev for libev proper 3262 Symbols.ev for libev proper
3093 Symbols.event for the libevent emulation 3263 Symbols.event for the libevent emulation
3094 3264
3095This can also be used to rename all public symbols to avoid clashes with 3265This can also be used to rename all public symbols to avoid clashes with
3096multiple versions of libev linked together (which is obviously bad in 3266multiple versions of libev linked together (which is obviously bad in
3097itself, but sometimes it is inconvinient to avoid this). 3267itself, but sometimes it is inconvenient to avoid this).
3098 3268
3099A sed command like this will create wrapper C<#define>'s that you need to 3269A sed command like this will create wrapper C<#define>'s that you need to
3100include before including F<ev.h>: 3270include before including F<ev.h>:
3101 3271
3102 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h 3272 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
3119file. 3289file.
3120 3290
3121The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 3291The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3122that everybody includes and which overrides some configure choices: 3292that everybody includes and which overrides some configure choices:
3123 3293
3124 #define EV_MINIMAL 1 3294 #define EV_MINIMAL 1
3125 #define EV_USE_POLL 0 3295 #define EV_USE_POLL 0
3126 #define EV_MULTIPLICITY 0 3296 #define EV_MULTIPLICITY 0
3127 #define EV_PERIODIC_ENABLE 0 3297 #define EV_PERIODIC_ENABLE 0
3128 #define EV_STAT_ENABLE 0 3298 #define EV_STAT_ENABLE 0
3129 #define EV_FORK_ENABLE 0 3299 #define EV_FORK_ENABLE 0
3130 #define EV_CONFIG_H <config.h> 3300 #define EV_CONFIG_H <config.h>
3131 #define EV_MINPRI 0 3301 #define EV_MINPRI 0
3132 #define EV_MAXPRI 0 3302 #define EV_MAXPRI 0
3133 3303
3134 #include "ev++.h" 3304 #include "ev++.h"
3135 3305
3136And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 3306And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3137 3307
3138 #include "ev_cpp.h" 3308 #include "ev_cpp.h"
3139 #include "ev.c" 3309 #include "ev.c"
3140 3310
3141 3311
3142=head1 THREADS AND COROUTINES 3312=head1 THREADS AND COROUTINES
3143 3313
3144=head2 THREADS 3314=head2 THREADS
3145 3315
3146Libev itself is completely threadsafe, but it uses no locking. This 3316All libev functions are reentrant and thread-safe unless explicitly
3317documented otherwise, but it uses no locking itself. This means that you
3147means that you can use as many loops as you want in parallel, as long as 3318can use as many loops as you want in parallel, as long as there are no
3148only one thread ever calls into one libev function with the same loop 3319concurrent calls into any libev function with the same loop parameter
3149parameter. 3320(C<ev_default_*> calls have an implicit default loop parameter, of
3321course): libev guarantees that different event loops share no data
3322structures that need any locking.
3150 3323
3151Or put differently: calls with different loop parameters can be done in 3324Or to put it differently: calls with different loop parameters can be done
3152parallel from multiple threads, calls with the same loop parameter must be 3325concurrently from multiple threads, calls with the same loop parameter
3153done serially (but can be done from different threads, as long as only one 3326must be done serially (but can be done from different threads, as long as
3154thread ever is inside a call at any point in time, e.g. by using a mutex 3327only one thread ever is inside a call at any point in time, e.g. by using
3155per loop). 3328a mutex per loop).
3156 3329
3157If you want to know which design is best for your problem, then I cannot 3330Specifically to support threads (and signal handlers), libev implements
3331so-called C<ev_async> watchers, which allow some limited form of
3332concurrency on the same event loop, namely waking it up "from the
3333outside".
3334
3335If you want to know which design (one loop, locking, or multiple loops
3336without or something else still) is best for your problem, then I cannot
3158help you but by giving some generic advice: 3337help you, but here is some generic advice:
3159 3338
3160=over 4 3339=over 4
3161 3340
3162=item * most applications have a main thread: use the default libev loop 3341=item * most applications have a main thread: use the default libev loop
3163in that thread, or create a seperate thread running only the default loop. 3342in that thread, or create a separate thread running only the default loop.
3164 3343
3165This helps integrating other libraries or software modules that use libev 3344This helps integrating other libraries or software modules that use libev
3166themselves and don't care/know about threading. 3345themselves and don't care/know about threading.
3167 3346
3168=item * one loop per thread is usually a good model. 3347=item * one loop per thread is usually a good model.
3169 3348
3170Doing this is almost never wrong, sometimes a better-performance model 3349Doing this is almost never wrong, sometimes a better-performance model
3171exists, but it is always a good start. 3350exists, but it is always a good start.
3172 3351
3173=item * other models exist, such as the leader/follower pattern, where one 3352=item * other models exist, such as the leader/follower pattern, where one
3174loop is handed through multiple threads in a kind of round-robbin fashion. 3353loop is handed through multiple threads in a kind of round-robin fashion.
3175 3354
3176Chosing a model is hard - look around, learn, know that usually you cna do 3355Choosing a model is hard - look around, learn, know that usually you can do
3177better than you currently do :-) 3356better than you currently do :-)
3178 3357
3179=item * often you need to talk to some other thread which blocks in the 3358=item * often you need to talk to some other thread which blocks in the
3359event loop.
3360
3180event loop - C<ev_async> watchers can be used to wake them up from other 3361C<ev_async> watchers can be used to wake them up from other threads safely
3181threads safely (or from signal contexts...). 3362(or from signal contexts...).
3363
3364An example use would be to communicate signals or other events that only
3365work in the default loop by registering the signal watcher with the
3366default loop and triggering an C<ev_async> watcher from the default loop
3367watcher callback into the event loop interested in the signal.
3182 3368
3183=back 3369=back
3184 3370
3185=head2 COROUTINES 3371=head2 COROUTINES
3186 3372
3187Libev is much more accomodating to coroutines ("cooperative threads"): 3373Libev is much more accommodating to coroutines ("cooperative threads"):
3188libev fully supports nesting calls to it's functions from different 3374libev fully supports nesting calls to it's functions from different
3189coroutines (e.g. you can call C<ev_loop> on the same loop from two 3375coroutines (e.g. you can call C<ev_loop> on the same loop from two
3190different coroutines and switch freely between both coroutines running the 3376different coroutines and switch freely between both coroutines running the
3191loop, as long as you don't confuse yourself). The only exception is that 3377loop, as long as you don't confuse yourself). The only exception is that
3192you must not do this from C<ev_periodic> reschedule callbacks. 3378you must not do this from C<ev_periodic> reschedule callbacks.
3193 3379
3194Care has been invested into making sure that libev does not keep local 3380Care has been taken to ensure that libev does not keep local state inside
3195state inside C<ev_loop>, and other calls do not usually allow coroutine 3381C<ev_loop>, and other calls do not usually allow coroutine switches.
3196switches.
3197 3382
3198 3383
3199=head1 COMPLEXITIES 3384=head1 COMPLEXITIES
3200 3385
3201In this section the complexities of (many of) the algorithms used inside 3386In this section the complexities of (many of) the algorithms used inside
3240 3425
3241=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 3426=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
3242 3427
3243A change means an I/O watcher gets started or stopped, which requires 3428A change means an I/O watcher gets started or stopped, which requires
3244libev to recalculate its status (and possibly tell the kernel, depending 3429libev to recalculate its status (and possibly tell the kernel, depending
3245on backend and wether C<ev_io_set> was used). 3430on backend and whether C<ev_io_set> was used).
3246 3431
3247=item Activating one watcher (putting it into the pending state): O(1) 3432=item Activating one watcher (putting it into the pending state): O(1)
3248 3433
3249=item Priority handling: O(number_of_priorities) 3434=item Priority handling: O(number_of_priorities)
3250 3435
3251Priorities are implemented by allocating some space for each 3436Priorities are implemented by allocating some space for each
3252priority. When doing priority-based operations, libev usually has to 3437priority. When doing priority-based operations, libev usually has to
3253linearly search all the priorities, but starting/stopping and activating 3438linearly search all the priorities, but starting/stopping and activating
3254watchers becomes O(1) w.r.t. priority handling. 3439watchers becomes O(1) with respect to priority handling.
3255 3440
3256=item Sending an ev_async: O(1) 3441=item Sending an ev_async: O(1)
3257 3442
3258=item Processing ev_async_send: O(number_of_async_watchers) 3443=item Processing ev_async_send: O(number_of_async_watchers)
3259 3444
3260=item Processing signals: O(max_signal_number) 3445=item Processing signals: O(max_signal_number)
3261 3446
3262Sending involves a syscall I<iff> there were no other C<ev_async_send> 3447Sending involves a system call I<iff> there were no other C<ev_async_send>
3263calls in the current loop iteration. Checking for async and signal events 3448calls in the current loop iteration. Checking for async and signal events
3264involves iterating over all running async watchers or all signal numbers. 3449involves iterating over all running async watchers or all signal numbers.
3265 3450
3266=back 3451=back
3267 3452
3268 3453
3269=head1 Win32 platform limitations and workarounds 3454=head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
3270 3455
3271Win32 doesn't support any of the standards (e.g. POSIX) that libev 3456Win32 doesn't support any of the standards (e.g. POSIX) that libev
3272requires, and its I/O model is fundamentally incompatible with the POSIX 3457requires, and its I/O model is fundamentally incompatible with the POSIX
3273model. Libev still offers limited functionality on this platform in 3458model. Libev still offers limited functionality on this platform in
3274the form of the C<EVBACKEND_SELECT> backend, and only supports socket 3459the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3281way (note also that glib is the slowest event library known to man). 3466way (note also that glib is the slowest event library known to man).
3282 3467
3283There is no supported compilation method available on windows except 3468There is no supported compilation method available on windows except
3284embedding it into other applications. 3469embedding it into other applications.
3285 3470
3471Not a libev limitation but worth mentioning: windows apparently doesn't
3472accept large writes: instead of resulting in a partial write, windows will
3473either accept everything or return C<ENOBUFS> if the buffer is too large,
3474so make sure you only write small amounts into your sockets (less than a
3475megabyte seems safe, but this apparently depends on the amount of memory
3476available).
3477
3286Due to the many, low, and arbitrary limits on the win32 platform and 3478Due to the many, low, and arbitrary limits on the win32 platform and
3287the abysmal performance of winsockets, using a large number of sockets 3479the abysmal performance of winsockets, using a large number of sockets
3288is not recommended (and not reasonable). If your program needs to use 3480is not recommended (and not reasonable). If your program needs to use
3289more than a hundred or so sockets, then likely it needs to use a totally 3481more than a hundred or so sockets, then likely it needs to use a totally
3290different implementation for windows, as libev offers the POSIX readiness 3482different implementation for windows, as libev offers the POSIX readiness
3291notification model, which cannot be implemented efficiently on windows 3483notification model, which cannot be implemented efficiently on windows
3292(microsoft monopoly games). 3484(Microsoft monopoly games).
3485
3486A typical way to use libev under windows is to embed it (see the embedding
3487section for details) and use the following F<evwrap.h> header file instead
3488of F<ev.h>:
3489
3490 #define EV_STANDALONE /* keeps ev from requiring config.h */
3491 #define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
3492
3493 #include "ev.h"
3494
3495And compile the following F<evwrap.c> file into your project (make sure
3496you do I<not> compile the F<ev.c> or any other embedded source files!):
3497
3498 #include "evwrap.h"
3499 #include "ev.c"
3293 3500
3294=over 4 3501=over 4
3295 3502
3296=item The winsocket select function 3503=item The winsocket select function
3297 3504
3298The winsocket C<select> function doesn't follow POSIX in that it requires 3505The winsocket C<select> function doesn't follow POSIX in that it
3299socket I<handles> and not socket I<file descriptors>. This makes select 3506requires socket I<handles> and not socket I<file descriptors> (it is
3300very inefficient, and also requires a mapping from file descriptors 3507also extremely buggy). This makes select very inefficient, and also
3301to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>, 3508requires a mapping from file descriptors to socket handles (the Microsoft
3302C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor 3509C runtime provides the function C<_open_osfhandle> for this). See the
3303symbols for more info. 3510discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
3511C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
3304 3512
3305The configuration for a "naked" win32 using the microsoft runtime 3513The configuration for a "naked" win32 using the Microsoft runtime
3306libraries and raw winsocket select is: 3514libraries and raw winsocket select is:
3307 3515
3308 #define EV_USE_SELECT 1 3516 #define EV_USE_SELECT 1
3309 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 3517 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3310 3518
3311Note that winsockets handling of fd sets is O(n), so you can easily get a 3519Note that winsockets handling of fd sets is O(n), so you can easily get a
3312complexity in the O(n²) range when using win32. 3520complexity in the O(n²) range when using win32.
3313 3521
3314=item Limited number of file descriptors 3522=item Limited number of file descriptors
3315 3523
3316Windows has numerous arbitrary (and low) limits on things. 3524Windows has numerous arbitrary (and low) limits on things.
3317 3525
3318Early versions of winsocket's select only supported waiting for a maximum 3526Early versions of winsocket's select only supported waiting for a maximum
3319of C<64> handles (probably owning to the fact that all windows kernels 3527of C<64> handles (probably owning to the fact that all windows kernels
3320can only wait for C<64> things at the same time internally; microsoft 3528can only wait for C<64> things at the same time internally; Microsoft
3321recommends spawning a chain of threads and wait for 63 handles and the 3529recommends spawning a chain of threads and wait for 63 handles and the
3322previous thread in each. Great). 3530previous thread in each. Great).
3323 3531
3324Newer versions support more handles, but you need to define C<FD_SETSIZE> 3532Newer versions support more handles, but you need to define C<FD_SETSIZE>
3325to some high number (e.g. C<2048>) before compiling the winsocket select 3533to some high number (e.g. C<2048>) before compiling the winsocket select
3326call (which might be in libev or elsewhere, for example, perl does its own 3534call (which might be in libev or elsewhere, for example, perl does its own
3327select emulation on windows). 3535select emulation on windows).
3328 3536
3329Another limit is the number of file descriptors in the microsoft runtime 3537Another limit is the number of file descriptors in the Microsoft runtime
3330libraries, which by default is C<64> (there must be a hidden I<64> fetish 3538libraries, which by default is C<64> (there must be a hidden I<64> fetish
3331or something like this inside microsoft). You can increase this by calling 3539or something like this inside Microsoft). You can increase this by calling
3332C<_setmaxstdio>, which can increase this limit to C<2048> (another 3540C<_setmaxstdio>, which can increase this limit to C<2048> (another
3333arbitrary limit), but is broken in many versions of the microsoft runtime 3541arbitrary limit), but is broken in many versions of the Microsoft runtime
3334libraries. 3542libraries.
3335 3543
3336This might get you to about C<512> or C<2048> sockets (depending on 3544This might get you to about C<512> or C<2048> sockets (depending on
3337windows version and/or the phase of the moon). To get more, you need to 3545windows version and/or the phase of the moon). To get more, you need to
3338wrap all I/O functions and provide your own fd management, but the cost of 3546wrap all I/O functions and provide your own fd management, but the cost of
3346In addition to a working ISO-C implementation, libev relies on a few 3554In addition to a working ISO-C implementation, libev relies on a few
3347additional extensions: 3555additional extensions:
3348 3556
3349=over 4 3557=over 4
3350 3558
3559=item C<void (*)(ev_watcher_type *, int revents)> must have compatible
3560calling conventions regardless of C<ev_watcher_type *>.
3561
3562Libev assumes not only that all watcher pointers have the same internal
3563structure (guaranteed by POSIX but not by ISO C for example), but it also
3564assumes that the same (machine) code can be used to call any watcher
3565callback: The watcher callbacks have different type signatures, but libev
3566calls them using an C<ev_watcher *> internally.
3567
3351=item C<sig_atomic_t volatile> must be thread-atomic as well 3568=item C<sig_atomic_t volatile> must be thread-atomic as well
3352 3569
3353The type C<sig_atomic_t volatile> (or whatever is defined as 3570The type C<sig_atomic_t volatile> (or whatever is defined as
3354C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different 3571C<EV_ATOMIC_T>) must be atomic with respect to accesses from different
3355threads. This is not part of the specification for C<sig_atomic_t>, but is 3572threads. This is not part of the specification for C<sig_atomic_t>, but is
3356believed to be sufficiently portable. 3573believed to be sufficiently portable.
3357 3574
3358=item C<sigprocmask> must work in a threaded environment 3575=item C<sigprocmask> must work in a threaded environment
3359 3576
3386=back 3603=back
3387 3604
3388If you know of other additional requirements drop me a note. 3605If you know of other additional requirements drop me a note.
3389 3606
3390 3607
3608=head1 COMPILER WARNINGS
3609
3610Depending on your compiler and compiler settings, you might get no or a
3611lot of warnings when compiling libev code. Some people are apparently
3612scared by this.
3613
3614However, these are unavoidable for many reasons. For one, each compiler
3615has different warnings, and each user has different tastes regarding
3616warning options. "Warn-free" code therefore cannot be a goal except when
3617targeting a specific compiler and compiler-version.
3618
3619Another reason is that some compiler warnings require elaborate
3620workarounds, or other changes to the code that make it less clear and less
3621maintainable.
3622
3623And of course, some compiler warnings are just plain stupid, or simply
3624wrong (because they don't actually warn about the condition their message
3625seems to warn about).
3626
3627While libev is written to generate as few warnings as possible,
3628"warn-free" code is not a goal, and it is recommended not to build libev
3629with any compiler warnings enabled unless you are prepared to cope with
3630them (e.g. by ignoring them). Remember that warnings are just that:
3631warnings, not errors, or proof of bugs.
3632
3633
3391=head1 VALGRIND 3634=head1 VALGRIND
3392 3635
3393Valgrind has a special section here because it is a popular tool that is 3636Valgrind has a special section here because it is a popular tool that is
3394highly useful, but valgrind reports are very hard to interpret. 3637highly useful, but valgrind reports are very hard to interpret.
3395 3638
3398 3641
3399 ==2274== definitely lost: 0 bytes in 0 blocks. 3642 ==2274== definitely lost: 0 bytes in 0 blocks.
3400 ==2274== possibly lost: 0 bytes in 0 blocks. 3643 ==2274== possibly lost: 0 bytes in 0 blocks.
3401 ==2274== still reachable: 256 bytes in 1 blocks. 3644 ==2274== still reachable: 256 bytes in 1 blocks.
3402 3645
3403then there is no memory leak. Similarly, under some circumstances, 3646Then there is no memory leak. Similarly, under some circumstances,
3404valgrind might report kernel bugs as if it were a bug in libev, or it 3647valgrind might report kernel bugs as if it were a bug in libev, or it
3405might be confused (it is a very good tool, but only a tool). 3648might be confused (it is a very good tool, but only a tool).
3406 3649
3407If you are unsure about something, feel free to contact the mailing list 3650If you are unsure about something, feel free to contact the mailing list
3408with the full valgrind report and an explanation on why you think this is 3651with the full valgrind report and an explanation on why you think this is

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines