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

Comparing libev/ev.pod (file contents):
Revision 1.151 by root, Tue May 6 23:42:16 2008 UTC vs.
Revision 1.183 by root, Tue Sep 23 08:37:38 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
69time: L<http://cvs.schmorp.de/libev/ev.html>. 69time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>.
70 70
71Libev is an event loop: you register interest in certain events (such as a 71Libev is an event loop: you register interest in certain events (such as a
72file descriptor being readable or a timeout occurring), and it will manage 72file descriptor being readable or a timeout occurring), and it will manage
73these event sources and provide your program with events. 73these event sources and provide your program with events.
74 74
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
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));
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
341readyness 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 readyness 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.
767
768=item ev_loop_verify (loop)
769
770This function only does something when C<EV_VERIFY> support has been
771compiled in. which is the default for non-minimal builds. It tries to go
772through all internal structures and checks them for validity. If anything
773is found to be inconsistent, it will print an error message to standard
774error and call C<abort ()>.
775
776This can be used to catch bugs inside libev itself: under normal
777circumstances, this function will never abort as of course libev keeps its
778data structures consistent.
693 779
694=back 780=back
695 781
696 782
697=head1 ANATOMY OF A WATCHER 783=head1 ANATOMY OF A WATCHER
698 784
699A 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
700interest 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
701become readable, you would create an C<ev_io> watcher for that: 787become readable, you would create an C<ev_io> watcher for that:
702 788
703 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)
704 { 790 {
705 ev_io_stop (w); 791 ev_io_stop (w);
706 ev_unloop (loop, EVUNLOOP_ALL); 792 ev_unloop (loop, EVUNLOOP_ALL);
707 } 793 }
708 794
709 struct ev_loop *loop = ev_default_loop (0); 795 struct ev_loop *loop = ev_default_loop (0);
710 struct ev_io stdin_watcher; 796 struct ev_io stdin_watcher;
711 ev_init (&stdin_watcher, my_cb); 797 ev_init (&stdin_watcher, my_cb);
712 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 798 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
713 ev_io_start (loop, &stdin_watcher); 799 ev_io_start (loop, &stdin_watcher);
714 ev_loop (loop, 0); 800 ev_loop (loop, 0);
715 801
716As 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
717watcher 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,
718although this can sometimes be quite valid). 804although this can sometimes be quite valid).
719 805
720Each 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
721(watcher *, callback)>, which expects a callback to be provided. This 807(watcher *, callback)>, which expects a callback to be provided. This
722callback 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
723watchers, each time the event loop detects that the file descriptor given 809watchers, each time the event loop detects that the file descriptor given
724is readable and/or writable). 810is readable and/or writable).
725 811
726Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro 812Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro
727with arguments specific to this watcher type. There is also a macro 813with arguments specific to this watcher type. There is also a macro
803 889
804The given async watcher has been asynchronously notified (see C<ev_async>). 890The given async watcher has been asynchronously notified (see C<ev_async>).
805 891
806=item C<EV_ERROR> 892=item C<EV_ERROR>
807 893
808An unspecified error has occured, the watcher has been stopped. This might 894An unspecified error has occurred, the watcher has been stopped. This might
809happen because the watcher could not be properly started because libev 895happen because the watcher could not be properly started because libev
810ran 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
811problem. 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
812with the watcher being stopped. 898with the watcher being stopped.
813 899
814Libev will usually signal a few "dummy" events together with an error, 900Libev will usually signal a few "dummy" events together with an error, for
815for 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
816your 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
817with 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
818programs, though, so beware. 904programs, though, as the fd could already be closed and reused for another
905thing, so beware.
819 906
820=back 907=back
821 908
822=head2 GENERIC WATCHER FUNCTIONS 909=head2 GENERIC WATCHER FUNCTIONS
823 910
839(or never started) and there are no pending events outstanding. 926(or never started) and there are no pending events outstanding.
840 927
841The 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,
842int revents)>. 929int revents)>.
843 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
844=item C<ev_TYPE_set> (ev_TYPE *, [args]) 937=item C<ev_TYPE_set> (ev_TYPE *, [args])
845 938
846This 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
847call 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
848call 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
850difference to the C<ev_init> macro). 943difference to the C<ev_init> macro).
851 944
852Although some watcher types do not have type-specific arguments 945Although some watcher types do not have type-specific arguments
853(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.
854 947
948See C<ev_init>, above, for an example.
949
855=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args]) 950=item C<ev_TYPE_init> (ev_TYPE *watcher, callback, [args])
856 951
857This 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
858calls 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
859a 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);
860 959
861=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 960=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher)
862 961
863Starts (activates) the given watcher. Only active watchers will receive 962Starts (activates) the given watcher. Only active watchers will receive
864events. 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);
865 969
866=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 970=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher)
867 971
868Stops the given watcher again (if active) and clears the pending 972Stops the given watcher again (if active) and clears the pending
869status. It is possible that stopped watchers are pending (for example, 973status. It is possible that stopped watchers are pending (for example,
926 1030
927=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1031=item ev_invoke (loop, ev_TYPE *watcher, int revents)
928 1032
929Invoke 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
930C<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
931can deal with that fact. 1035can deal with that fact, as both are simply passed through to the
1036callback.
932 1037
933=item int ev_clear_pending (loop, ev_TYPE *watcher) 1038=item int ev_clear_pending (loop, ev_TYPE *watcher)
934 1039
935If the watcher is pending, this function returns clears its pending status 1040If the watcher is pending, this function clears its pending status and
936and 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
937watcher isn't pending it does nothing and returns C<0>. 1042watcher isn't pending it does nothing and returns C<0>.
938 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
939=back 1047=back
940 1048
941 1049
942=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1050=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
943 1051
944Each 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
945and 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
946to 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
947don'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
948member, you can also "subclass" the watcher type and provide your own 1056member, you can also "subclass" the watcher type and provide your own
949data: 1057data:
950 1058
951 struct my_io 1059 struct my_io
952 { 1060 {
953 struct ev_io io; 1061 struct ev_io io;
954 int otherfd; 1062 int otherfd;
955 void *somedata; 1063 void *somedata;
956 struct whatever *mostinteresting; 1064 struct whatever *mostinteresting;
957 } 1065 };
1066
1067 ...
1068 struct my_io w;
1069 ev_io_init (&w.io, my_cb, fd, EV_READ);
958 1070
959And 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
960can cast it back to your own type: 1072can cast it back to your own type:
961 1073
962 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)
963 { 1075 {
964 struct my_io *w = (struct my_io *)w_; 1076 struct my_io *w = (struct my_io *)w_;
965 ... 1077 ...
966 } 1078 }
967 1079
968More interesting and less C-conformant ways of casting your callback type 1080More interesting and less C-conformant ways of casting your callback type
969instead have been omitted. 1081instead have been omitted.
970 1082
971Another common scenario is having some data structure with multiple 1083Another common scenario is to use some data structure with multiple
972watchers: 1084embedded watchers:
973 1085
974 struct my_biggy 1086 struct my_biggy
975 { 1087 {
976 int some_data; 1088 int some_data;
977 ev_timer t1; 1089 ev_timer t1;
978 ev_timer t2; 1090 ev_timer t2;
979 } 1091 }
980 1092
981In 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
982you 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):
983 1098
984 #include <stddef.h> 1099 #include <stddef.h>
985 1100
986 static void 1101 static void
987 t1_cb (EV_P_ struct ev_timer *w, int revents) 1102 t1_cb (EV_P_ struct ev_timer *w, int revents)
988 { 1103 {
989 struct my_biggy big = (struct my_biggy * 1104 struct my_biggy big = (struct my_biggy *
990 (((char *)w) - offsetof (struct my_biggy, t1)); 1105 (((char *)w) - offsetof (struct my_biggy, t1));
991 } 1106 }
992 1107
993 static void 1108 static void
994 t2_cb (EV_P_ struct ev_timer *w, int revents) 1109 t2_cb (EV_P_ struct ev_timer *w, int revents)
995 { 1110 {
996 struct my_biggy big = (struct my_biggy * 1111 struct my_biggy big = (struct my_biggy *
997 (((char *)w) - offsetof (struct my_biggy, t2)); 1112 (((char *)w) - offsetof (struct my_biggy, t2));
998 } 1113 }
999 1114
1000 1115
1001=head1 WATCHER TYPES 1116=head1 WATCHER TYPES
1002 1117
1003This section describes each watcher in detail, but will not repeat 1118This section describes each watcher in detail, but will not repeat
1027In 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
1028fd 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
1029descriptors 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
1030required if you know what you are doing). 1145required if you know what you are doing).
1031 1146
1032If 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
1033(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
1034C<EVBACKEND_POLL>). 1149C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>).
1035 1150
1036Another 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
1037receive "spurious" readyness notifications, that is your callback might 1152receive "spurious" readiness notifications, that is your callback might
1038be 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
1039because 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
1040lot 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
1041this situation even with a relatively standard program structure. Thus 1156this situation even with a relatively standard program structure. Thus
1042it 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
1043C<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.
1044 1159
1045If 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
1046play around with an Xlib connection), then you have to seperately re-test 1161not play around with an Xlib connection), then you have to separately
1047whether 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
1048such as poll (fortunately in our Xlib example, Xlib already does this on 1163interface such as poll (fortunately in our Xlib example, Xlib already
1049its 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.
1050 1169
1051=head3 The special problem of disappearing file descriptors 1170=head3 The special problem of disappearing file descriptors
1052 1171
1053Some 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
1054descriptor (either by calling C<close> explicitly or by any other means, 1173descriptor (either due to calling C<close> explicitly or any other means,
1055such 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
1056descriptor, but when it goes away, the operating system will silently drop 1175descriptor, but when it goes away, the operating system will silently drop
1057this interest. If another file descriptor with the same number then is 1176this interest. If another file descriptor with the same number then is
1058registered 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
1059fact, a different file descriptor. 1178fact, a different file descriptor.
1060 1179
1091enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or 1210enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1092C<EVBACKEND_POLL>. 1211C<EVBACKEND_POLL>.
1093 1212
1094=head3 The special problem of SIGPIPE 1213=head3 The special problem of SIGPIPE
1095 1214
1096While 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>:
1097when 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
1098gets send a SIGPIPE, which, by default, aborts your program. For most 1217sent a SIGPIPE, which, by default, aborts your program. For most programs
1099programs this is sensible behaviour, for daemons, this is usually 1218this is sensible behaviour, for daemons, this is usually undesirable.
1100undesirable.
1101 1219
1102So when you encounter spurious, unexplained daemon exits, make sure you 1220So when you encounter spurious, unexplained daemon exits, make sure you
1103ignore 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
1104somewhere, as that would have given you a big clue). 1222somewhere, as that would have given you a big clue).
1105 1223
1111=item ev_io_init (ev_io *, callback, int fd, int events) 1229=item ev_io_init (ev_io *, callback, int fd, int events)
1112 1230
1113=item ev_io_set (ev_io *, int fd, int events) 1231=item ev_io_set (ev_io *, int fd, int events)
1114 1232
1115Configures 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
1116rceeive 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
1117C<EV_READ | EV_WRITE> to receive the given events. 1235C<EV_READ | EV_WRITE>, to express the desire to receive the given events.
1118 1236
1119=item int fd [read-only] 1237=item int fd [read-only]
1120 1238
1121The file descriptor being watched. 1239The file descriptor being watched.
1122 1240
1130 1248
1131Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1249Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1132readable, but only once. Since it is likely line-buffered, you could 1250readable, but only once. Since it is likely line-buffered, you could
1133attempt to read a whole line in the callback. 1251attempt to read a whole line in the callback.
1134 1252
1135 static void 1253 static void
1136 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)
1137 { 1255 {
1138 ev_io_stop (loop, w); 1256 ev_io_stop (loop, w);
1139 .. 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
1140 } 1258 }
1141 1259
1142 ... 1260 ...
1143 struct ev_loop *loop = ev_default_init (0); 1261 struct ev_loop *loop = ev_default_init (0);
1144 struct ev_io stdin_readable; 1262 struct ev_io stdin_readable;
1145 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);
1146 ev_io_start (loop, &stdin_readable); 1264 ev_io_start (loop, &stdin_readable);
1147 ev_loop (loop, 0); 1265 ev_loop (loop, 0);
1148 1266
1149 1267
1150=head2 C<ev_timer> - relative and optionally repeating timeouts 1268=head2 C<ev_timer> - relative and optionally repeating timeouts
1151 1269
1152Timer watchers are simple relative timers that generate an event after a 1270Timer watchers are simple relative timers that generate an event after a
1153given time, and optionally repeating in regular intervals after that. 1271given time, and optionally repeating in regular intervals after that.
1154 1272
1155The 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
1156times out after an hour and you reset your system clock to last years 1274times out after an hour and you reset your system clock to January last
1157time, it will still time out after (roughly) and hour. "Roughly" because 1275year, it will still time out after (roughly) one hour. "Roughly" because
1158detecting time jumps is hard, and some inaccuracies are unavoidable (the 1276detecting time jumps is hard, and some inaccuracies are unavoidable (the
1159monotonic 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.
1160 1290
1161The relative timeouts are calculated relative to the C<ev_now ()> 1291The relative timeouts are calculated relative to the C<ev_now ()>
1162time. 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
1163of the event triggering whatever timeout you are modifying/starting. If 1293of the event triggering whatever timeout you are modifying/starting. If
1164you 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
1165on the current time, use something like this to adjust for this: 1295timeout on the current time, use something like this to adjust for this:
1166 1296
1167 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1297 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
1168 1298
1169The callback is guarenteed to be invoked only when its timeout has passed, 1299If the event loop is suspended for a long time, you can also force an
1170but 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
1171order of execution is undefined. 1301()>.
1172 1302
1173=head3 Watcher-Specific Functions and Data Members 1303=head3 Watcher-Specific Functions and Data Members
1174 1304
1175=over 4 1305=over 4
1176 1306
1177=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1307=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1178 1308
1179=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 1309=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
1180 1310
1181Configure the timer to trigger after C<after> seconds. If C<repeat> is 1311Configure the timer to trigger after C<after> seconds. If C<repeat>
1182C<0.>, then it will automatically be stopped. If it is positive, then the 1312is C<0.>, then it will automatically be stopped once the timeout is
1183timer will automatically be configured to trigger again C<repeat> seconds 1313reached. If it is positive, then the timer will automatically be
1184later, again, and again, until stopped manually. 1314configured to trigger again C<repeat> seconds later, again, and again,
1315until stopped manually.
1185 1316
1186The timer itself will do a best-effort at avoiding drift, that is, if you 1317The timer itself will do a best-effort at avoiding drift, that is, if
1187configure a timer to trigger every 10 seconds, then it will trigger at 1318you configure a timer to trigger every 10 seconds, then it will normally
1188exactly 10 second intervals. If, however, your program cannot keep up with 1319trigger at exactly 10 second intervals. If, however, your program cannot
1189the timer (because it takes longer than those 10 seconds to do stuff) the 1320keep up with the timer (because it takes longer than those 10 seconds to
1190timer will not fire more than once per event loop iteration. 1321do stuff) the timer will not fire more than once per event loop iteration.
1191 1322
1192=item ev_timer_again (loop, ev_timer *) 1323=item ev_timer_again (loop, ev_timer *)
1193 1324
1194This 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
1195repeating. The exact semantics are: 1326repeating. The exact semantics are:
1196 1327
1197If the timer is pending, its pending status is cleared. 1328If the timer is pending, its pending status is cleared.
1198 1329
1199If 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).
1200 1331
1201If the timer is repeating, either start it if necessary (with the 1332If the timer is repeating, either start it if necessary (with the
1202C<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.
1203 1334
1204This sounds a bit complicated, but here is a useful and typical 1335This sounds a bit complicated, but here is a useful and typical
1205example: 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
1206timeout, 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
1207seconds 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
1208configure 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
1209C<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
1210you 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
1224 ev_timer_again (loop, timer); 1355 ev_timer_again (loop, timer);
1225 1356
1226This is more slightly efficient then stopping/starting the timer each time 1357This is more slightly efficient then stopping/starting the timer each time
1227you want to modify its timeout value. 1358you want to modify its timeout value.
1228 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
1229=item ev_tstamp repeat [read-write] 1366=item ev_tstamp repeat [read-write]
1230 1367
1231The 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
1232or 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),
1233which is also when any modifications are taken into account. 1370which is also when any modifications are taken into account.
1234 1371
1235=back 1372=back
1236 1373
1237=head3 Examples 1374=head3 Examples
1238 1375
1239Example: Create a timer that fires after 60 seconds. 1376Example: Create a timer that fires after 60 seconds.
1240 1377
1241 static void 1378 static void
1242 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)
1243 { 1380 {
1244 .. one minute over, w is actually stopped right here 1381 .. one minute over, w is actually stopped right here
1245 } 1382 }
1246 1383
1247 struct ev_timer mytimer; 1384 struct ev_timer mytimer;
1248 ev_timer_init (&mytimer, one_minute_cb, 60., 0.); 1385 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1249 ev_timer_start (loop, &mytimer); 1386 ev_timer_start (loop, &mytimer);
1250 1387
1251Example: Create a timeout timer that times out after 10 seconds of 1388Example: Create a timeout timer that times out after 10 seconds of
1252inactivity. 1389inactivity.
1253 1390
1254 static void 1391 static void
1255 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)
1256 { 1393 {
1257 .. ten seconds without any activity 1394 .. ten seconds without any activity
1258 } 1395 }
1259 1396
1260 struct ev_timer mytimer; 1397 struct ev_timer mytimer;
1261 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 */
1262 ev_timer_again (&mytimer); /* start timer */ 1399 ev_timer_again (&mytimer); /* start timer */
1263 ev_loop (loop, 0); 1400 ev_loop (loop, 0);
1264 1401
1265 // 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":
1266 // reset the timeout to start ticking again at 10 seconds 1403 // reset the timeout to start ticking again at 10 seconds
1267 ev_timer_again (&mytimer); 1404 ev_timer_again (&mytimer);
1268 1405
1269 1406
1270=head2 C<ev_periodic> - to cron or not to cron? 1407=head2 C<ev_periodic> - to cron or not to cron?
1271 1408
1272Periodic 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
1273(and unfortunately a bit complex). 1410(and unfortunately a bit complex).
1274 1411
1275Unlike 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)
1276but on wallclock time (absolute time). You can tell a periodic watcher 1413but on wall clock time (absolute time). You can tell a periodic watcher
1277to trigger "at" 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
1278periodic 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 ()
1279+ 10.>) and then reset your system clock to the last year, then it will 1416+ 10.>, that is, an absolute time not a delay) and then reset your system
1417clock to January of the previous year, then it will take more than year
1280take a year to trigger the event (unlike an C<ev_timer>, which would trigger 1418to trigger the event (unlike an C<ev_timer>, which would still trigger
1281roughly 10 seconds later). 1419roughly 10 seconds later as it uses a relative timeout).
1282 1420
1283They can also be used to implement vastly more complex timers, such as 1421C<ev_periodic>s can also be used to implement vastly more complex timers,
1284triggering an event on each midnight, local time or other, complicated, 1422such as triggering an event on each "midnight, local time", or other
1285rules. 1423complicated rules.
1286 1424
1287As 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
1288time (C<at>) has been passed, but if multiple periodic timers become ready 1426time (C<at>) has passed, but if multiple periodic timers become ready
1289during the same loop iteration then order of execution is undefined. 1427during the same loop iteration, then order of execution is undefined.
1290 1428
1291=head3 Watcher-Specific Functions and Data Members 1429=head3 Watcher-Specific Functions and Data Members
1292 1430
1293=over 4 1431=over 4
1294 1432
1295=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)
1296 1434
1297=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)
1298 1436
1299Lots 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
1300operation, and we will explain them from simplest to complex: 1438operation, and we will explain them from simplest to most complex:
1301 1439
1302=over 4 1440=over 4
1303 1441
1304=item * absolute timer (at = time, interval = reschedule_cb = 0) 1442=item * absolute timer (at = time, interval = reschedule_cb = 0)
1305 1443
1306In this configuration the watcher triggers an event at the wallclock time 1444In this configuration the watcher triggers an event after the wall clock
1307C<at> and doesn't repeat. It will not adjust when a time jump occurs, 1445time C<at> has passed. It will not repeat and will not adjust when a time
1308that is, if it is to be run at January 1st 2011 then it will run when the 1446jump occurs, that is, if it is to be run at January 1st 2011 then it will
1309system time reaches or surpasses this time. 1447only run when the system clock reaches or surpasses this time.
1310 1448
1311=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) 1449=item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1312 1450
1313In 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
1314C<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)
1315and then repeat, regardless of any time jumps. 1453and then repeat, regardless of any time jumps.
1316 1454
1317This 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
1318time: 1456system clock, for example, here is a C<ev_periodic> that triggers each
1457hour, on the hour:
1319 1458
1320 ev_periodic_set (&periodic, 0., 3600., 0); 1459 ev_periodic_set (&periodic, 0., 3600., 0);
1321 1460
1322This 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,
1323but 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
1324full 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
1325by 3600. 1464by 3600.
1326 1465
1327Another way to think about it (for the mathematically inclined) is that 1466Another way to think about it (for the mathematically inclined) is that
1328C<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
1329time where C<time = at (mod interval)>, regardless of any time jumps. 1468time where C<time = at (mod interval)>, regardless of any time jumps.
1330 1469
1331For 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
1332C<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
1333this value. 1472this value, and in fact is often specified as zero.
1473
1474Note also that there is an upper limit to how often a timer can fire (CPU
1475speed for example), so if C<interval> is very small then timing stability
1476will of course deteriorate. Libev itself tries to be exact to be about one
1477millisecond (if the OS supports it and the machine is fast enough).
1334 1478
1335=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) 1479=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1336 1480
1337In 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
1338ignored. Instead, each time the periodic watcher gets scheduled, the 1482ignored. Instead, each time the periodic watcher gets scheduled, the
1339reschedule callback will be called with the watcher as first, and the 1483reschedule callback will be called with the watcher as first, and the
1340current time as second argument. 1484current time as second argument.
1341 1485
1342NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1486NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1343ever, or make any event loop modifications>. If you need to stop it, 1487ever, or make ANY event loop modifications whatsoever>.
1344return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1345starting an C<ev_prepare> watcher, which is legal).
1346 1488
1489If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
1490it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
1491only event loop modification you are allowed to do).
1492
1347Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1493The callback prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic
1348ev_tstamp now)>, e.g.: 1494*w, ev_tstamp now)>, e.g.:
1349 1495
1350 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1496 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1351 { 1497 {
1352 return now + 60.; 1498 return now + 60.;
1353 } 1499 }
1355It must return the next time to trigger, based on the passed time value 1501It must return the next time to trigger, based on the passed time value
1356(that is, the lowest time value larger than to the second argument). It 1502(that is, the lowest time value larger than to the second argument). It
1357will usually be called just before the callback will be triggered, but 1503will usually be called just before the callback will be triggered, but
1358might be called at other times, too. 1504might be called at other times, too.
1359 1505
1360NOTE: I<< This callback must always return a time that is later than the 1506NOTE: I<< This callback must always return a time that is higher than or
1361passed C<now> value >>. Not even C<now> itself will do, it I<must> be larger. 1507equal to the passed C<now> value >>.
1362 1508
1363This can be used to create very complex timers, such as a timer that 1509This can be used to create very complex timers, such as a timer that
1364triggers on each midnight, local time. To do this, you would calculate the 1510triggers on "next midnight, local time". To do this, you would calculate the
1365next midnight after C<now> and return the timestamp value for this. How 1511next midnight after C<now> and return the timestamp value for this. How
1366you do this is, again, up to you (but it is not trivial, which is the main 1512you do this is, again, up to you (but it is not trivial, which is the main
1367reason I omitted it as an example). 1513reason I omitted it as an example).
1368 1514
1369=back 1515=back
1403=back 1549=back
1404 1550
1405=head3 Examples 1551=head3 Examples
1406 1552
1407Example: Call a callback every hour, or, more precisely, whenever the 1553Example: Call a callback every hour, or, more precisely, whenever the
1408system clock is divisible by 3600. The callback invocation times have 1554system time is divisible by 3600. The callback invocation times have
1409potentially a lot of jittering, but good long-term stability. 1555potentially a lot of jitter, but good long-term stability.
1410 1556
1411 static void 1557 static void
1412 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)
1413 { 1559 {
1414 ... 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)
1415 } 1561 }
1416 1562
1417 struct ev_periodic hourly_tick; 1563 struct ev_periodic hourly_tick;
1418 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0); 1564 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1419 ev_periodic_start (loop, &hourly_tick); 1565 ev_periodic_start (loop, &hourly_tick);
1420 1566
1421Example: 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:
1422 1568
1423 #include <math.h> 1569 #include <math.h>
1424 1570
1425 static ev_tstamp 1571 static ev_tstamp
1426 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now) 1572 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now)
1427 { 1573 {
1428 return fmod (now, 3600.) + 3600.; 1574 return now + (3600. - fmod (now, 3600.));
1429 } 1575 }
1430 1576
1431 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);
1432 1578
1433Example: Call a callback every hour, starting now: 1579Example: Call a callback every hour, starting now:
1434 1580
1435 struct ev_periodic hourly_tick; 1581 struct ev_periodic hourly_tick;
1436 ev_periodic_init (&hourly_tick, clock_cb, 1582 ev_periodic_init (&hourly_tick, clock_cb,
1437 fmod (ev_now (loop), 3600.), 3600., 0); 1583 fmod (ev_now (loop), 3600.), 3600., 0);
1438 ev_periodic_start (loop, &hourly_tick); 1584 ev_periodic_start (loop, &hourly_tick);
1439 1585
1440 1586
1441=head2 C<ev_signal> - signal me when a signal gets signalled! 1587=head2 C<ev_signal> - signal me when a signal gets signalled!
1442 1588
1443Signal watchers will trigger an event when the process receives a specific 1589Signal watchers will trigger an event when the process receives a specific
1444signal one or more times. Even though signals are very asynchronous, libev 1590signal one or more times. Even though signals are very asynchronous, libev
1445will 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
1446normal event processing, like any other event. 1592normal event processing, like any other event.
1447 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
1448You 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
1449first watcher gets started will libev actually register a signal watcher 1599first watcher gets started will libev actually register a signal handler
1450with 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
1451as 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
1452watcher 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
1453SIG_DFL (regardless of what it was set to before). 1603signal handler to SIG_DFL (regardless of what it was set to before).
1454 1604
1455If possible and supported, libev will install its handlers with 1605If possible and supported, libev will install its handlers with
1456C<SA_RESTART> behaviour enabled, so syscalls should not be unduly 1606C<SA_RESTART> behaviour enabled, so system calls should not be unduly
1457interrupted. If you have a problem with syscalls getting interrupted by 1607interrupted. If you have a problem with system calls getting interrupted by
1458signals 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
1459them in an C<ev_prepare> watcher. 1609them in an C<ev_prepare> watcher.
1460 1610
1461=head3 Watcher-Specific Functions and Data Members 1611=head3 Watcher-Specific Functions and Data Members
1462 1612
1477 1627
1478=head3 Examples 1628=head3 Examples
1479 1629
1480Example: Try to exit cleanly on SIGINT and SIGTERM. 1630Example: Try to exit cleanly on SIGINT and SIGTERM.
1481 1631
1482 static void 1632 static void
1483 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)
1484 { 1634 {
1485 ev_unloop (loop, EVUNLOOP_ALL); 1635 ev_unloop (loop, EVUNLOOP_ALL);
1486 } 1636 }
1487 1637
1488 struct ev_signal signal_watcher; 1638 struct ev_signal signal_watcher;
1489 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 1639 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1490 ev_signal_start (loop, &sigint_cb); 1640 ev_signal_start (loop, &sigint_cb);
1491 1641
1492 1642
1493=head2 C<ev_child> - watch out for process status changes 1643=head2 C<ev_child> - watch out for process status changes
1494 1644
1495Child watchers trigger when your process receives a SIGCHLD in response to 1645Child watchers trigger when your process receives a SIGCHLD in response to
1496some 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
1497is 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
1498forked (which implies it might have already exited), as long as the event 1648has been forked (which implies it might have already exited), as long
1499loop 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.
1500 1653
1501Only the default event loop is capable of handling signals, and therefore 1654Only the default event loop is capable of handling signals, and therefore
1502you can only rgeister child watchers in the default event loop. 1655you can only register child watchers in the default event loop.
1503 1656
1504=head3 Process Interaction 1657=head3 Process Interaction
1505 1658
1506Libev grabs C<SIGCHLD> as soon as the default event loop is 1659Libev grabs C<SIGCHLD> as soon as the default event loop is
1507initialised. This is necessary to guarantee proper behaviour even if 1660initialised. This is necessary to guarantee proper behaviour even if
1508the first child watcher is started after the child exits. The occurance 1661the first child watcher is started after the child exits. The occurrence
1509of C<SIGCHLD> is recorded asynchronously, but child reaping is done 1662of C<SIGCHLD> is recorded asynchronously, but child reaping is done
1510synchronously as part of the event loop processing. Libev always reaps all 1663synchronously as part of the event loop processing. Libev always reaps all
1511children, even ones not watched. 1664children, even ones not watched.
1512 1665
1513=head3 Overriding the Built-In Processing 1666=head3 Overriding the Built-In Processing
1517handler, you can override it easily by installing your own handler for 1670handler, you can override it easily by installing your own handler for
1518C<SIGCHLD> after initialising the default loop, and making sure the 1671C<SIGCHLD> after initialising the default loop, and making sure the
1519default loop never gets destroyed. You are encouraged, however, to use an 1672default loop never gets destroyed. You are encouraged, however, to use an
1520event-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
1521that, 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.
1522 1682
1523=head3 Watcher-Specific Functions and Data Members 1683=head3 Watcher-Specific Functions and Data Members
1524 1684
1525=over 4 1685=over 4
1526 1686
1555=head3 Examples 1715=head3 Examples
1556 1716
1557Example: 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
1558its completion. 1718its completion.
1559 1719
1560 ev_child cw; 1720 ev_child cw;
1561 1721
1562 static void 1722 static void
1563 child_cb (EV_P_ struct ev_child *w, int revents) 1723 child_cb (EV_P_ struct ev_child *w, int revents)
1564 { 1724 {
1565 ev_child_stop (EV_A_ w); 1725 ev_child_stop (EV_A_ w);
1566 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);
1567 } 1727 }
1568 1728
1569 pid_t pid = fork (); 1729 pid_t pid = fork ();
1570 1730
1571 if (pid < 0) 1731 if (pid < 0)
1572 // error 1732 // error
1573 else if (pid == 0) 1733 else if (pid == 0)
1574 { 1734 {
1575 // the forked child executes here 1735 // the forked child executes here
1576 exit (1); 1736 exit (1);
1577 } 1737 }
1578 else 1738 else
1579 { 1739 {
1580 ev_child_init (&cw, child_cb, pid, 0); 1740 ev_child_init (&cw, child_cb, pid, 0);
1581 ev_child_start (EV_DEFAULT_ &cw); 1741 ev_child_start (EV_DEFAULT_ &cw);
1582 } 1742 }
1583 1743
1584 1744
1585=head2 C<ev_stat> - did the file attributes just change? 1745=head2 C<ev_stat> - did the file attributes just change?
1586 1746
1587This watches a filesystem path for attribute changes. That is, it calls 1747This watches a file system path for attribute changes. That is, it calls
1588C<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
1589compared to the last time, invoking the callback if it did. 1749compared to the last time, invoking the callback if it did.
1590 1750
1591The 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
1592not 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
1595the stat buffer having unspecified contents. 1755the stat buffer having unspecified contents.
1596 1756
1597The 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
1598relative and your working directory changes, the behaviour is undefined. 1758relative and your working directory changes, the behaviour is undefined.
1599 1759
1600Since there is no standard to do this, the portable implementation simply 1760Since there is no standard kernel interface to do this, the portable
1601calls 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
1602can specify a recommended polling interval for this case. If you specify 1762it changed somehow. You can specify a recommended polling interval for
1603a polling interval of C<0> (highly recommended!) then a I<suitable, 1763this case. If you specify a polling interval of C<0> (highly recommended!)
1604unspecified default> value will be used (which you can expect to be around 1764then a I<suitable, unspecified default> value will be used (which
1605five seconds, although this might change dynamically). Libev will also 1765you can expect to be around five seconds, although this might change
1606impose a minimum interval which is currently around C<0.1>, but thats 1766dynamically). Libev will also impose a minimum interval which is currently
1607usually overkill. 1767around C<0.1>, but thats usually overkill.
1608 1768
1609This watcher type is not meant for massive numbers of stat watchers, 1769This watcher type is not meant for massive numbers of stat watchers,
1610as even with OS-supported change notifications, this can be 1770as even with OS-supported change notifications, this can be
1611resource-intensive. 1771resource-intensive.
1612 1772
1613At the time of this writing, only the Linux inotify interface is 1773At the time of this writing, the only OS-specific interface implemented
1614implemented (implementing kqueue support is left as an exercise for the 1774is the Linux inotify interface (implementing kqueue support is left as
1615reader, 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
1616semantics with kqueue). Inotify will be used to give hints only and should 1776of implementing C<ev_stat> semantics with kqueue).
1617not change the semantics of C<ev_stat> watchers, which means that libev
1618sometimes needs to fall back to regular polling again even with inotify,
1619but changes are usually detected immediately, and if the file exists there
1620will be no polling.
1621 1777
1622=head3 ABI Issues (Largefile Support) 1778=head3 ABI Issues (Largefile Support)
1623 1779
1624Libev by default (unless the user overrides this) uses the default 1780Libev by default (unless the user overrides this) uses the default
1625compilation environment, which means that on systems with optionally 1781compilation environment, which means that on systems with large file
1626disabled 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
1627structure. When using the library from programs that change the ABI to 1783structure. When using the library from programs that change the ABI to
1628use 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
1629compile libev with the same flags to get binary compatibility. This is 1785compile libev with the same flags to get binary compatibility. This is
1630obviously 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
1631most noticably with ev_stat and largefile support. 1787most noticeably disabled with ev_stat and large file support.
1632 1788
1633=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
1634 1796
1635When C<inotify (7)> support has been compiled into libev (generally only 1797When C<inotify (7)> support has been compiled into libev (generally only
1636available 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
1637change detection where possible. The inotify descriptor will be created lazily 1799change detection where possible. The inotify descriptor will be created lazily
1638when the first C<ev_stat> watcher is being started. 1800when the first C<ev_stat> watcher is being started.
1639 1801
1640Inotify presence does not change the semantics of C<ev_stat> watchers 1802Inotify presence does not change the semantics of C<ev_stat> watchers
1641except 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
1642making regular C<stat> calls. Even in the presence of inotify support 1804making regular C<stat> calls. Even in the presence of inotify support
1643there 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.
1644 1807
1645(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
1646implement this functionality, due to the requirement of having a file 1809implement this functionality, due to the requirement of having a file
1647descriptor open on the object at all times). 1810descriptor open on the object at all times, and detecting renames, unlinks
1811etc. is difficult.
1648 1812
1649=head3 The special problem of stat time resolution 1813=head3 The special problem of stat time resolution
1650 1814
1651The C<stat ()> syscall only supports full-second resolution portably, and 1815The C<stat ()> system call only supports full-second resolution portably, and
1652even on systems where the resolution is higher, many filesystems still 1816even on systems where the resolution is higher, most file systems still
1653only support whole seconds. 1817only support whole seconds.
1654 1818
1655That 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
1656easily 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
1657calls your callback, which does something. When there is another update 1821calls your callback, which does something. When there is another update
1658within 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
1659data does not change. 1823stat data does change in other ways (e.g. file size).
1660 1824
1661The 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
1662than second (or till slightly after the next full second boundary), using 1826than a second (or till slightly after the next full second boundary), using
1663a 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);
1664ev_timer_again (loop, w)>). 1828ev_timer_again (loop, w)>).
1665 1829
1666The C<.02> offset is added to work around small timing inconsistencies 1830The C<.02> offset is added to work around small timing inconsistencies
1667of some operating systems (where the second counter of the current time 1831of some operating systems (where the second counter of the current time
1684C<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
1685be 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
1686a 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
1687path for as long as the watcher is active. 1851path for as long as the watcher is active.
1688 1852
1689The 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,
1690to 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
1691was detected). 1855last change was detected).
1692 1856
1693=item ev_stat_stat (loop, ev_stat *) 1857=item ev_stat_stat (loop, ev_stat *)
1694 1858
1695Updates the stat buffer immediately with new values. If you change the 1859Updates the stat buffer immediately with new values. If you change the
1696watched path in your callback, you could call this function to avoid 1860watched path in your callback, you could call this function to avoid
1717 1881
1718The specified interval. 1882The specified interval.
1719 1883
1720=item const char *path [read-only] 1884=item const char *path [read-only]
1721 1885
1722The filesystem path that is being watched. 1886The file system path that is being watched.
1723 1887
1724=back 1888=back
1725 1889
1726=head3 Examples 1890=head3 Examples
1727 1891
1728Example: Watch C</etc/passwd> for attribute changes. 1892Example: Watch C</etc/passwd> for attribute changes.
1729 1893
1730 static void 1894 static void
1731 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1895 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1732 { 1896 {
1733 /* /etc/passwd changed in some way */ 1897 /* /etc/passwd changed in some way */
1734 if (w->attr.st_nlink) 1898 if (w->attr.st_nlink)
1735 { 1899 {
1736 printf ("passwd current size %ld\n", (long)w->attr.st_size); 1900 printf ("passwd current size %ld\n", (long)w->attr.st_size);
1737 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime); 1901 printf ("passwd current atime %ld\n", (long)w->attr.st_mtime);
1738 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime); 1902 printf ("passwd current mtime %ld\n", (long)w->attr.st_mtime);
1739 } 1903 }
1740 else 1904 else
1741 /* you shalt not abuse printf for puts */ 1905 /* you shalt not abuse printf for puts */
1742 puts ("wow, /etc/passwd is not there, expect problems. " 1906 puts ("wow, /etc/passwd is not there, expect problems. "
1743 "if this is windows, they already arrived\n"); 1907 "if this is windows, they already arrived\n");
1744 } 1908 }
1745 1909
1746 ... 1910 ...
1747 ev_stat passwd; 1911 ev_stat passwd;
1748 1912
1749 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.); 1913 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1750 ev_stat_start (loop, &passwd); 1914 ev_stat_start (loop, &passwd);
1751 1915
1752Example: 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
1753miss updates (however, frequent updates will delay processing, too, so 1917miss updates (however, frequent updates will delay processing, too, so
1754one 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
1755C<ev_timer> callback invocation). 1919C<ev_timer> callback invocation).
1756 1920
1757 static ev_stat passwd; 1921 static ev_stat passwd;
1758 static ev_timer timer; 1922 static ev_timer timer;
1759 1923
1760 static void 1924 static void
1761 timer_cb (EV_P_ ev_timer *w, int revents) 1925 timer_cb (EV_P_ ev_timer *w, int revents)
1762 { 1926 {
1763 ev_timer_stop (EV_A_ w); 1927 ev_timer_stop (EV_A_ w);
1764 1928
1765 /* now it's one second after the most recent passwd change */ 1929 /* now it's one second after the most recent passwd change */
1766 } 1930 }
1767 1931
1768 static void 1932 static void
1769 stat_cb (EV_P_ ev_stat *w, int revents) 1933 stat_cb (EV_P_ ev_stat *w, int revents)
1770 { 1934 {
1771 /* reset the one-second timer */ 1935 /* reset the one-second timer */
1772 ev_timer_again (EV_A_ &timer); 1936 ev_timer_again (EV_A_ &timer);
1773 } 1937 }
1774 1938
1775 ... 1939 ...
1776 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.); 1940 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1777 ev_stat_start (loop, &passwd); 1941 ev_stat_start (loop, &passwd);
1778 ev_timer_init (&timer, timer_cb, 0., 1.02); 1942 ev_timer_init (&timer, timer_cb, 0., 1.02);
1779 1943
1780 1944
1781=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...
1782 1946
1783Idle 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
1784priority are pending (prepare, check and other idle watchers do not 1948priority are pending (prepare, check and other idle watchers do not count
1785count). 1949as receiving "events").
1786 1950
1787That 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
1788(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
1789triggered. But when your process is idle (or only lower-priority watchers 1953triggered. But when your process is idle (or only lower-priority watchers
1790are pending), the idle watchers are being called once per event loop 1954are pending), the idle watchers are being called once per event loop
1814=head3 Examples 1978=head3 Examples
1815 1979
1816Example: 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
1817callback, free it. Also, use no error checking, as usual. 1981callback, free it. Also, use no error checking, as usual.
1818 1982
1819 static void 1983 static void
1820 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)
1821 { 1985 {
1822 free (w); 1986 free (w);
1823 // now do something you wanted to do when the program has 1987 // now do something you wanted to do when the program has
1824 // no longer anything immediate to do. 1988 // no longer anything immediate to do.
1825 } 1989 }
1826 1990
1827 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); 1991 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1828 ev_idle_init (idle_watcher, idle_cb); 1992 ev_idle_init (idle_watcher, idle_cb);
1829 ev_idle_start (loop, idle_cb); 1993 ev_idle_start (loop, idle_cb);
1830 1994
1831 1995
1832=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!
1833 1997
1834Prepare and check watchers are usually (but not always) used in tandem: 1998Prepare and check watchers are usually (but not always) used in pairs:
1835prepare watchers get invoked before the process blocks and check watchers 1999prepare watchers get invoked before the process blocks and check watchers
1836afterwards. 2000afterwards.
1837 2001
1838You 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
1839the 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>
1842those 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,
1843C<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
1844called in pairs bracketing the blocking call. 2008called in pairs bracketing the blocking call.
1845 2009
1846Their main purpose is to integrate other event mechanisms into libev and 2010Their main purpose is to integrate other event mechanisms into libev and
1847their 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
1848variable changes, implement your own watchers, integrate net-snmp or a 2012variable changes, implement your own watchers, integrate net-snmp or a
1849coroutine library and lots more. They are also occasionally useful if 2013coroutine library and lots more. They are also occasionally useful if
1850you 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,
1851in 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>
1852watcher). 2016watcher).
1853 2017
1854This is done by examining in each prepare call which file descriptors need 2018This is done by examining in each prepare call which file descriptors
1855to 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
1856them 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
1857provide just this functionality). Then, in the check watcher you check for 2021libraries provide exactly this functionality). Then, in the check watcher,
1858any events that occured (by checking the pending status of all watchers 2022you check for any events that occurred (by checking the pending status
1859and 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
1860callbacks will never actually be called (but must be valid nevertheless, 2024I/O and timer callbacks will never actually be called (but must be valid
1861because you never know, you know?). 2025nevertheless, because you never know, you know?).
1862 2026
1863As another example, the Perl Coro module uses these hooks to integrate 2027As another example, the Perl Coro module uses these hooks to integrate
1864coroutines into libev programs, by yielding to other active coroutines 2028coroutines into libev programs, by yielding to other active coroutines
1865during each prepare and only letting the process block if no coroutines 2029during each prepare and only letting the process block if no coroutines
1866are 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
1869loop from blocking if lower-priority coroutines are active, thus mapping 2033loop from blocking if lower-priority coroutines are active, thus mapping
1870low-priority coroutines to idle/background tasks). 2034low-priority coroutines to idle/background tasks).
1871 2035
1872It 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>)
1873priority, 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
1874after 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
1875too) should not activate ("feed") events into libev. While libev fully 2041activate ("feed") events into libev. While libev fully supports this, they
1876supports this, they might get executed before other C<ev_check> watchers 2042might get executed before other C<ev_check> watchers did their job. As
1877did 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
1878(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
1879state until their C<ev_check> watcher ran (always remind yourself to 2045C<ev_check> watcher ran (always remind yourself to coexist peacefully with
1880coexist peacefully with others). 2046others).
1881 2047
1882=head3 Watcher-Specific Functions and Data Members 2048=head3 Watcher-Specific Functions and Data Members
1883 2049
1884=over 4 2050=over 4
1885 2051
1887 2053
1888=item ev_check_init (ev_check *, callback) 2054=item ev_check_init (ev_check *, callback)
1889 2055
1890Initialises and configures the prepare or check watcher - they have no 2056Initialises and configures the prepare or check watcher - they have no
1891parameters 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>
1892macros, but using them is utterly, utterly and completely pointless. 2058macros, but using them is utterly, utterly, utterly and completely
2059pointless.
1893 2060
1894=back 2061=back
1895 2062
1896=head3 Examples 2063=head3 Examples
1897 2064
1906and 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
1907is 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
1908priority 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
1909the 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.
1910 2077
1911 static ev_io iow [nfd]; 2078 static ev_io iow [nfd];
1912 static ev_timer tw; 2079 static ev_timer tw;
1913 2080
1914 static void 2081 static void
1915 io_cb (ev_loop *loop, ev_io *w, int revents) 2082 io_cb (ev_loop *loop, ev_io *w, int revents)
1916 { 2083 {
1917 } 2084 }
1918 2085
1919 // create io watchers for each fd and a timer before blocking 2086 // create io watchers for each fd and a timer before blocking
1920 static void 2087 static void
1921 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 2088 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents)
1922 { 2089 {
1923 int timeout = 3600000; 2090 int timeout = 3600000;
1924 struct pollfd fds [nfd]; 2091 struct pollfd fds [nfd];
1925 // actual code will need to loop here and realloc etc. 2092 // actual code will need to loop here and realloc etc.
1926 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2093 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
1927 2094
1928 /* 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 */
1929 ev_timer_init (&tw, 0, timeout * 1e-3); 2096 ev_timer_init (&tw, 0, timeout * 1e-3);
1930 ev_timer_start (loop, &tw); 2097 ev_timer_start (loop, &tw);
1931 2098
1932 // create one ev_io per pollfd 2099 // create one ev_io per pollfd
1933 for (int i = 0; i < nfd; ++i) 2100 for (int i = 0; i < nfd; ++i)
1934 { 2101 {
1935 ev_io_init (iow + i, io_cb, fds [i].fd, 2102 ev_io_init (iow + i, io_cb, fds [i].fd,
1936 ((fds [i].events & POLLIN ? EV_READ : 0) 2103 ((fds [i].events & POLLIN ? EV_READ : 0)
1937 | (fds [i].events & POLLOUT ? EV_WRITE : 0))); 2104 | (fds [i].events & POLLOUT ? EV_WRITE : 0)));
1938 2105
1939 fds [i].revents = 0; 2106 fds [i].revents = 0;
1940 ev_io_start (loop, iow + i); 2107 ev_io_start (loop, iow + i);
1941 } 2108 }
1942 } 2109 }
1943 2110
1944 // stop all watchers after blocking 2111 // stop all watchers after blocking
1945 static void 2112 static void
1946 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 2113 adns_check_cb (ev_loop *loop, ev_check *w, int revents)
1947 { 2114 {
1948 ev_timer_stop (loop, &tw); 2115 ev_timer_stop (loop, &tw);
1949 2116
1950 for (int i = 0; i < nfd; ++i) 2117 for (int i = 0; i < nfd; ++i)
1951 { 2118 {
1952 // set the relevant poll flags 2119 // set the relevant poll flags
1953 // could also call adns_processreadable etc. here 2120 // could also call adns_processreadable etc. here
1954 struct pollfd *fd = fds + i; 2121 struct pollfd *fd = fds + i;
1955 int revents = ev_clear_pending (iow + i); 2122 int revents = ev_clear_pending (iow + i);
1956 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN; 2123 if (revents & EV_READ ) fd->revents |= fd->events & POLLIN;
1957 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT; 2124 if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT;
1958 2125
1959 // now stop the watcher 2126 // now stop the watcher
1960 ev_io_stop (loop, iow + i); 2127 ev_io_stop (loop, iow + i);
1961 } 2128 }
1962 2129
1963 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); 2130 adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop));
1964 } 2131 }
1965 2132
1966Method 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>
1967in the prepare watcher and would dispose of the check watcher. 2134in the prepare watcher and would dispose of the check watcher.
1968 2135
1969Method 3: If the module to be embedded supports explicit event 2136Method 3: If the module to be embedded supports explicit event
1970notification (adns does), you can also make use of the actual watcher 2137notification (libadns does), you can also make use of the actual watcher
1971callbacks, and only destroy/create the watchers in the prepare watcher. 2138callbacks, and only destroy/create the watchers in the prepare watcher.
1972 2139
1973 static void 2140 static void
1974 timer_cb (EV_P_ ev_timer *w, int revents) 2141 timer_cb (EV_P_ ev_timer *w, int revents)
1975 { 2142 {
1976 adns_state ads = (adns_state)w->data; 2143 adns_state ads = (adns_state)w->data;
1977 update_now (EV_A); 2144 update_now (EV_A);
1978 2145
1979 adns_processtimeouts (ads, &tv_now); 2146 adns_processtimeouts (ads, &tv_now);
1980 } 2147 }
1981 2148
1982 static void 2149 static void
1983 io_cb (EV_P_ ev_io *w, int revents) 2150 io_cb (EV_P_ ev_io *w, int revents)
1984 { 2151 {
1985 adns_state ads = (adns_state)w->data; 2152 adns_state ads = (adns_state)w->data;
1986 update_now (EV_A); 2153 update_now (EV_A);
1987 2154
1988 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now); 2155 if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now);
1989 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now); 2156 if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now);
1990 } 2157 }
1991 2158
1992 // do not ever call adns_afterpoll 2159 // do not ever call adns_afterpoll
1993 2160
1994Method 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
1995want 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
1996their poll function. The drawback with this solution is that the main 2163override their poll function. The drawback with this solution is that the
1997loop 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
1998this. 2165this approach, effectively embedding EV as a client into the horrible
2166libglib event loop.
1999 2167
2000 static gint 2168 static gint
2001 event_poll_func (GPollFD *fds, guint nfds, gint timeout) 2169 event_poll_func (GPollFD *fds, guint nfds, gint timeout)
2002 { 2170 {
2003 int got_events = 0; 2171 int got_events = 0;
2004 2172
2005 for (n = 0; n < nfds; ++n) 2173 for (n = 0; n < nfds; ++n)
2006 // 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
2007 2175
2008 if (timeout >= 0) 2176 if (timeout >= 0)
2009 // create/start timer 2177 // create/start timer
2010 2178
2011 // poll 2179 // poll
2012 ev_loop (EV_A_ 0); 2180 ev_loop (EV_A_ 0);
2013 2181
2014 // stop timer again 2182 // stop timer again
2015 if (timeout >= 0) 2183 if (timeout >= 0)
2016 ev_timer_stop (EV_A_ &to); 2184 ev_timer_stop (EV_A_ &to);
2017 2185
2018 // stop io watchers again - their callbacks should have set 2186 // stop io watchers again - their callbacks should have set
2019 for (n = 0; n < nfds; ++n) 2187 for (n = 0; n < nfds; ++n)
2020 ev_io_stop (EV_A_ iow [n]); 2188 ev_io_stop (EV_A_ iow [n]);
2021 2189
2022 return got_events; 2190 return got_events;
2023 } 2191 }
2024 2192
2025 2193
2026=head2 C<ev_embed> - when one backend isn't enough... 2194=head2 C<ev_embed> - when one backend isn't enough...
2027 2195
2028This 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
2034prioritise I/O. 2202prioritise I/O.
2035 2203
2036As 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
2037sockets 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
2038still 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
2039so 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
2040into 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
2041be 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
2042at 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 :)
2043 2212
2044As 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
2045to be watched and handled very quickly (with low latency), and even 2214some fds have to be watched and handled very quickly (with low latency),
2046priorities and idle watchers might have too much overhead. In this case 2215and even priorities and idle watchers might have too much overhead. In
2047you 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
2048a second one, and embed the second one in the first. 2217the rest in a second one, and embed the second one in the first.
2049 2218
2050As 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
2051there 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
2052call 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
2053their 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
2061interested in that. 2230interested in that.
2062 2231
2063Also, there have not currently been made special provisions for forking: 2232Also, there have not currently been made special provisions for forking:
2064when 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,
2065but 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
2066yourself. 2235yourself - but you can use a fork watcher to handle this automatically,
2236and future versions of libev might do just that.
2067 2237
2068Unfortunately, not all backends are embeddable, only the ones returned by 2238Unfortunately, not all backends are embeddable, only the ones returned by
2069C<ev_embeddable_backends> are, which, unfortunately, does not include any 2239C<ev_embeddable_backends> are, which, unfortunately, does not include any
2070portable one. 2240portable one.
2071 2241
2084 2254
2085Configures the watcher to embed the given loop, which must be 2255Configures the watcher to embed the given loop, which must be
2086embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 2256embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
2087invoked automatically, otherwise it is the responsibility of the callback 2257invoked automatically, otherwise it is the responsibility of the callback
2088to invoke it (it will continue to be called until the sweep has been done, 2258to invoke it (it will continue to be called until the sweep has been done,
2089if you do not want thta, you need to temporarily stop the embed watcher). 2259if you do not want that, you need to temporarily stop the embed watcher).
2090 2260
2091=item ev_embed_sweep (loop, ev_embed *) 2261=item ev_embed_sweep (loop, ev_embed *)
2092 2262
2093Make a single, non-blocking sweep over the embedded loop. This works 2263Make a single, non-blocking sweep over the embedded loop. This works
2094similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 2264similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
2095apropriate way for embedded loops. 2265appropriate way for embedded loops.
2096 2266
2097=item struct ev_loop *other [read-only] 2267=item struct ev_loop *other [read-only]
2098 2268
2099The embedded event loop. 2269The embedded event loop.
2100 2270
2102 2272
2103=head3 Examples 2273=head3 Examples
2104 2274
2105Example: Try to get an embeddable event loop and embed it into the default 2275Example: Try to get an embeddable event loop and embed it into the default
2106event loop. If that is not possible, use the default loop. The default 2276event loop. If that is not possible, use the default loop. The default
2107loop is stored in C<loop_hi>, while the mebeddable loop is stored in 2277loop is stored in C<loop_hi>, while the embeddable loop is stored in
2108C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be 2278C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2109used). 2279used).
2110 2280
2111 struct ev_loop *loop_hi = ev_default_init (0); 2281 struct ev_loop *loop_hi = ev_default_init (0);
2112 struct ev_loop *loop_lo = 0; 2282 struct ev_loop *loop_lo = 0;
2113 struct ev_embed embed; 2283 struct ev_embed embed;
2114 2284
2115 // see if there is a chance of getting one that works 2285 // see if there is a chance of getting one that works
2116 // (remember that a flags value of 0 means autodetection) 2286 // (remember that a flags value of 0 means autodetection)
2117 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 2287 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2118 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 2288 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2119 : 0; 2289 : 0;
2120 2290
2121 // if we got one, then embed it, otherwise default to loop_hi 2291 // if we got one, then embed it, otherwise default to loop_hi
2122 if (loop_lo) 2292 if (loop_lo)
2123 { 2293 {
2124 ev_embed_init (&embed, 0, loop_lo); 2294 ev_embed_init (&embed, 0, loop_lo);
2125 ev_embed_start (loop_hi, &embed); 2295 ev_embed_start (loop_hi, &embed);
2126 } 2296 }
2127 else 2297 else
2128 loop_lo = loop_hi; 2298 loop_lo = loop_hi;
2129 2299
2130Example: Check if kqueue is available but not recommended and create 2300Example: Check if kqueue is available but not recommended and create
2131a kqueue backend for use with sockets (which usually work with any 2301a kqueue backend for use with sockets (which usually work with any
2132kqueue implementation). Store the kqueue/socket-only event loop in 2302kqueue implementation). Store the kqueue/socket-only event loop in
2133C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 2303C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2134 2304
2135 struct ev_loop *loop = ev_default_init (0); 2305 struct ev_loop *loop = ev_default_init (0);
2136 struct ev_loop *loop_socket = 0; 2306 struct ev_loop *loop_socket = 0;
2137 struct ev_embed embed; 2307 struct ev_embed embed;
2138 2308
2139 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 2309 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2140 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 2310 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2141 { 2311 {
2142 ev_embed_init (&embed, 0, loop_socket); 2312 ev_embed_init (&embed, 0, loop_socket);
2143 ev_embed_start (loop, &embed); 2313 ev_embed_start (loop, &embed);
2144 } 2314 }
2145 2315
2146 if (!loop_socket) 2316 if (!loop_socket)
2147 loop_socket = loop; 2317 loop_socket = loop;
2148 2318
2149 // now use loop_socket for all sockets, and loop for everything else 2319 // now use loop_socket for all sockets, and loop for everything else
2150 2320
2151 2321
2152=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2322=head2 C<ev_fork> - the audacity to resume the event loop after a fork
2153 2323
2154Fork watchers are called when a C<fork ()> was detected (usually because 2324Fork watchers are called when a C<fork ()> was detected (usually because
2207 2377
2208=item queueing from a signal handler context 2378=item queueing from a signal handler context
2209 2379
2210To implement race-free queueing, you simply add to the queue in the signal 2380To implement race-free queueing, you simply add to the queue in the signal
2211handler but you block the signal handler in the watcher callback. Here is an example that does that for 2381handler but you block the signal handler in the watcher callback. Here is an example that does that for
2212some fictitiuous SIGUSR1 handler: 2382some fictitious SIGUSR1 handler:
2213 2383
2214 static ev_async mysig; 2384 static ev_async mysig;
2215 2385
2216 static void 2386 static void
2217 sigusr1_handler (void) 2387 sigusr1_handler (void)
2291=item ev_async_send (loop, ev_async *) 2461=item ev_async_send (loop, ev_async *)
2292 2462
2293Sends/signals/activates the given C<ev_async> watcher, that is, feeds 2463Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2294an C<EV_ASYNC> event on the watcher into the event loop. Unlike 2464an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2295C<ev_feed_event>, this call is safe to do in other threads, signal or 2465C<ev_feed_event>, this call is safe to do in other threads, signal or
2296similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding 2466similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding
2297section below on what exactly this means). 2467section below on what exactly this means).
2298 2468
2299This call incurs the overhead of a syscall only once per loop iteration, 2469This call incurs the overhead of a system call only once per loop iteration,
2300so while the overhead might be noticable, it doesn't apply to repeated 2470so while the overhead might be noticeable, it doesn't apply to repeated
2301calls to C<ev_async_send>. 2471calls to C<ev_async_send>.
2302 2472
2303=item bool = ev_async_pending (ev_async *) 2473=item bool = ev_async_pending (ev_async *)
2304 2474
2305Returns a non-zero value when C<ev_async_send> has been called on the 2475Returns a non-zero value when C<ev_async_send> has been called on the
2307event loop. 2477event loop.
2308 2478
2309C<ev_async_send> sets a flag in the watcher and wakes up the loop. When 2479C<ev_async_send> sets a flag in the watcher and wakes up the loop. When
2310the loop iterates next and checks for the watcher to have become active, 2480the loop iterates next and checks for the watcher to have become active,
2311it will reset the flag again. C<ev_async_pending> can be used to very 2481it will reset the flag again. C<ev_async_pending> can be used to very
2312quickly check wether invoking the loop might be a good idea. 2482quickly check whether invoking the loop might be a good idea.
2313 2483
2314Not that this does I<not> check wether the watcher itself is pending, only 2484Not that this does I<not> check whether the watcher itself is pending, only
2315wether it has been requested to make this watcher pending. 2485whether it has been requested to make this watcher pending.
2316 2486
2317=back 2487=back
2318 2488
2319 2489
2320=head1 OTHER FUNCTIONS 2490=head1 OTHER FUNCTIONS
2331or timeout without having to allocate/configure/start/stop/free one or 2501or timeout without having to allocate/configure/start/stop/free one or
2332more watchers yourself. 2502more watchers yourself.
2333 2503
2334If C<fd> is less than 0, then no I/O watcher will be started and events 2504If C<fd> is less than 0, then no I/O watcher will be started and events
2335is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and 2505is being ignored. Otherwise, an C<ev_io> watcher for the given C<fd> and
2336C<events> set will be craeted and started. 2506C<events> set will be created and started.
2337 2507
2338If C<timeout> is less than 0, then no timeout watcher will be 2508If C<timeout> is less than 0, then no timeout watcher will be
2339started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and 2509started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and
2340repeat = 0) will be started. While C<0> is a valid timeout, it is of 2510repeat = 0) will be started. While C<0> is a valid timeout, it is of
2341dubious value. 2511dubious value.
2343The callback has the type C<void (*cb)(int revents, void *arg)> and gets 2513The callback has the type C<void (*cb)(int revents, void *arg)> and gets
2344passed an C<revents> set like normal event callbacks (a combination of 2514passed an C<revents> set like normal event callbacks (a combination of
2345C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> 2515C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg>
2346value passed to C<ev_once>: 2516value passed to C<ev_once>:
2347 2517
2348 static void stdin_ready (int revents, void *arg) 2518 static void stdin_ready (int revents, void *arg)
2349 { 2519 {
2350 if (revents & EV_TIMEOUT) 2520 if (revents & EV_TIMEOUT)
2351 /* doh, nothing entered */; 2521 /* doh, nothing entered */;
2352 else if (revents & EV_READ) 2522 else if (revents & EV_READ)
2353 /* stdin might have data for us, joy! */; 2523 /* stdin might have data for us, joy! */;
2354 } 2524 }
2355 2525
2356 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 2526 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2357 2527
2358=item ev_feed_event (ev_loop *, watcher *, int revents) 2528=item ev_feed_event (ev_loop *, watcher *, int revents)
2359 2529
2360Feeds the given event set into the event loop, as if the specified event 2530Feeds the given event set into the event loop, as if the specified event
2361had happened for the specified watcher (which must be a pointer to an 2531had happened for the specified watcher (which must be a pointer to an
2366Feed an event on the given fd, as if a file descriptor backend detected 2536Feed an event on the given fd, as if a file descriptor backend detected
2367the given events it. 2537the given events it.
2368 2538
2369=item ev_feed_signal_event (ev_loop *loop, int signum) 2539=item ev_feed_signal_event (ev_loop *loop, int signum)
2370 2540
2371Feed an event as if the given signal occured (C<loop> must be the default 2541Feed an event as if the given signal occurred (C<loop> must be the default
2372loop!). 2542loop!).
2373 2543
2374=back 2544=back
2375 2545
2376 2546
2405=back 2575=back
2406 2576
2407=head1 C++ SUPPORT 2577=head1 C++ SUPPORT
2408 2578
2409Libev comes with some simplistic wrapper classes for C++ that mainly allow 2579Libev comes with some simplistic wrapper classes for C++ that mainly allow
2410you to use some convinience methods to start/stop watchers and also change 2580you to use some convenience methods to start/stop watchers and also change
2411the callback model to a model using method callbacks on objects. 2581the callback model to a model using method callbacks on objects.
2412 2582
2413To use it, 2583To use it,
2414 2584
2415 #include <ev++.h> 2585 #include <ev++.h>
2416 2586
2417This automatically includes F<ev.h> and puts all of its definitions (many 2587This automatically includes F<ev.h> and puts all of its definitions (many
2418of them macros) into the global namespace. All C++ specific things are 2588of them macros) into the global namespace. All C++ specific things are
2419put into the C<ev> namespace. It should support all the same embedding 2589put into the C<ev> namespace. It should support all the same embedding
2420options as F<ev.h>, most notably C<EV_MULTIPLICITY>. 2590options as F<ev.h>, most notably C<EV_MULTIPLICITY>.
2487your compiler is good :), then the method will be fully inlined into the 2657your compiler is good :), then the method will be fully inlined into the
2488thunking function, making it as fast as a direct C callback. 2658thunking function, making it as fast as a direct C callback.
2489 2659
2490Example: simple class declaration and watcher initialisation 2660Example: simple class declaration and watcher initialisation
2491 2661
2492 struct myclass 2662 struct myclass
2493 { 2663 {
2494 void io_cb (ev::io &w, int revents) { } 2664 void io_cb (ev::io &w, int revents) { }
2495 } 2665 }
2496 2666
2497 myclass obj; 2667 myclass obj;
2498 ev::io iow; 2668 ev::io iow;
2499 iow.set <myclass, &myclass::io_cb> (&obj); 2669 iow.set <myclass, &myclass::io_cb> (&obj);
2500 2670
2501=item w->set<function> (void *data = 0) 2671=item w->set<function> (void *data = 0)
2502 2672
2503Also sets a callback, but uses a static method or plain function as 2673Also sets a callback, but uses a static method or plain function as
2504callback. The optional C<data> argument will be stored in the watcher's 2674callback. The optional C<data> argument will be stored in the watcher's
2508 2678
2509See the method-C<set> above for more details. 2679See the method-C<set> above for more details.
2510 2680
2511Example: 2681Example:
2512 2682
2513 static void io_cb (ev::io &w, int revents) { } 2683 static void io_cb (ev::io &w, int revents) { }
2514 iow.set <io_cb> (); 2684 iow.set <io_cb> ();
2515 2685
2516=item w->set (struct ev_loop *) 2686=item w->set (struct ev_loop *)
2517 2687
2518Associates a different C<struct ev_loop> with this watcher. You can only 2688Associates a different C<struct ev_loop> with this watcher. You can only
2519do this when the watcher is inactive (and not pending either). 2689do this when the watcher is inactive (and not pending either).
2520 2690
2521=item w->set ([args]) 2691=item w->set ([arguments])
2522 2692
2523Basically the same as C<ev_TYPE_set>, with the same args. Must be 2693Basically the same as C<ev_TYPE_set>, with the same arguments. Must be
2524called at least once. Unlike the C counterpart, an active watcher gets 2694called at least once. Unlike the C counterpart, an active watcher gets
2525automatically stopped and restarted when reconfiguring it with this 2695automatically stopped and restarted when reconfiguring it with this
2526method. 2696method.
2527 2697
2528=item w->start () 2698=item w->start ()
2552=back 2722=back
2553 2723
2554Example: Define a class with an IO and idle watcher, start one of them in 2724Example: Define a class with an IO and idle watcher, start one of them in
2555the constructor. 2725the constructor.
2556 2726
2557 class myclass 2727 class myclass
2558 { 2728 {
2559 ev::io io; void io_cb (ev::io &w, int revents); 2729 ev::io io; void io_cb (ev::io &w, int revents);
2560 ev:idle idle void idle_cb (ev::idle &w, int revents); 2730 ev:idle idle void idle_cb (ev::idle &w, int revents);
2561 2731
2562 myclass (int fd) 2732 myclass (int fd)
2563 { 2733 {
2564 io .set <myclass, &myclass::io_cb > (this); 2734 io .set <myclass, &myclass::io_cb > (this);
2565 idle.set <myclass, &myclass::idle_cb> (this); 2735 idle.set <myclass, &myclass::idle_cb> (this);
2566 2736
2567 io.start (fd, ev::READ); 2737 io.start (fd, ev::READ);
2568 } 2738 }
2569 }; 2739 };
2570 2740
2571 2741
2572=head1 OTHER LANGUAGE BINDINGS 2742=head1 OTHER LANGUAGE BINDINGS
2573 2743
2574Libev does not offer other language bindings itself, but bindings for a 2744Libev does not offer other language bindings itself, but bindings for a
2575numbe rof languages exist in the form of third-party packages. If you know 2745number of languages exist in the form of third-party packages. If you know
2576any interesting language binding in addition to the ones listed here, drop 2746any interesting language binding in addition to the ones listed here, drop
2577me a note. 2747me a note.
2578 2748
2579=over 4 2749=over 4
2580 2750
2584libev. EV is developed together with libev. Apart from the EV core module, 2754libev. EV is developed together with libev. Apart from the EV core module,
2585there are additional modules that implement libev-compatible interfaces 2755there are additional modules that implement libev-compatible interfaces
2586to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the 2756to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the
2587C<libglib> event core (C<Glib::EV> and C<EV::Glib>). 2757C<libglib> event core (C<Glib::EV> and C<EV::Glib>).
2588 2758
2589It can be found and installed via CPAN, its homepage is found at 2759It can be found and installed via CPAN, its homepage is at
2590L<http://software.schmorp.de/pkg/EV>. 2760L<http://software.schmorp.de/pkg/EV>.
2591 2761
2762=item Python
2763
2764Python bindings can be found at L<http://code.google.com/p/pyev/>. It
2765seems to be quite complete and well-documented. Note, however, that the
2766patch they require for libev is outright dangerous as it breaks the ABI
2767for everybody else, and therefore, should never be applied in an installed
2768libev (if python requires an incompatible ABI then it needs to embed
2769libev).
2770
2592=item Ruby 2771=item Ruby
2593 2772
2594Tony Arcieri has written a ruby extension that offers access to a subset 2773Tony Arcieri has written a ruby extension that offers access to a subset
2595of the libev API and adds filehandle abstractions, asynchronous DNS and 2774of the libev API and adds file handle abstractions, asynchronous DNS and
2596more on top of it. It can be found via gem servers. Its homepage is at 2775more on top of it. It can be found via gem servers. Its homepage is at
2597L<http://rev.rubyforge.org/>. 2776L<http://rev.rubyforge.org/>.
2598 2777
2599=item D 2778=item D
2600 2779
2601Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to 2780Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2602be found at L<http://git.llucax.com.ar/?p=software/ev.d.git;a=summary>. 2781be found at L<http://proj.llucax.com.ar/wiki/evd>.
2603 2782
2604=back 2783=back
2605 2784
2606 2785
2607=head1 MACRO MAGIC 2786=head1 MACRO MAGIC
2608 2787
2609Libev can be compiled with a variety of options, the most fundamantal 2788Libev can be compiled with a variety of options, the most fundamental
2610of which is C<EV_MULTIPLICITY>. This option determines whether (most) 2789of which is C<EV_MULTIPLICITY>. This option determines whether (most)
2611functions and callbacks have an initial C<struct ev_loop *> argument. 2790functions and callbacks have an initial C<struct ev_loop *> argument.
2612 2791
2613To make it easier to write programs that cope with either variant, the 2792To make it easier to write programs that cope with either variant, the
2614following macros are defined: 2793following macros are defined:
2619 2798
2620This provides the loop I<argument> for functions, if one is required ("ev 2799This provides the loop I<argument> for functions, if one is required ("ev
2621loop argument"). The C<EV_A> form is used when this is the sole argument, 2800loop argument"). The C<EV_A> form is used when this is the sole argument,
2622C<EV_A_> is used when other arguments are following. Example: 2801C<EV_A_> is used when other arguments are following. Example:
2623 2802
2624 ev_unref (EV_A); 2803 ev_unref (EV_A);
2625 ev_timer_add (EV_A_ watcher); 2804 ev_timer_add (EV_A_ watcher);
2626 ev_loop (EV_A_ 0); 2805 ev_loop (EV_A_ 0);
2627 2806
2628It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, 2807It assumes the variable C<loop> of type C<struct ev_loop *> is in scope,
2629which is often provided by the following macro. 2808which is often provided by the following macro.
2630 2809
2631=item C<EV_P>, C<EV_P_> 2810=item C<EV_P>, C<EV_P_>
2632 2811
2633This provides the loop I<parameter> for functions, if one is required ("ev 2812This provides the loop I<parameter> for functions, if one is required ("ev
2634loop parameter"). The C<EV_P> form is used when this is the sole parameter, 2813loop parameter"). The C<EV_P> form is used when this is the sole parameter,
2635C<EV_P_> is used when other parameters are following. Example: 2814C<EV_P_> is used when other parameters are following. Example:
2636 2815
2637 // this is how ev_unref is being declared 2816 // this is how ev_unref is being declared
2638 static void ev_unref (EV_P); 2817 static void ev_unref (EV_P);
2639 2818
2640 // this is how you can declare your typical callback 2819 // this is how you can declare your typical callback
2641 static void cb (EV_P_ ev_timer *w, int revents) 2820 static void cb (EV_P_ ev_timer *w, int revents)
2642 2821
2643It declares a parameter C<loop> of type C<struct ev_loop *>, quite 2822It declares a parameter C<loop> of type C<struct ev_loop *>, quite
2644suitable for use with C<EV_A>. 2823suitable for use with C<EV_A>.
2645 2824
2646=item C<EV_DEFAULT>, C<EV_DEFAULT_> 2825=item C<EV_DEFAULT>, C<EV_DEFAULT_>
2662 2841
2663Example: Declare and initialise a check watcher, utilising the above 2842Example: Declare and initialise a check watcher, utilising the above
2664macros so it will work regardless of whether multiple loops are supported 2843macros so it will work regardless of whether multiple loops are supported
2665or not. 2844or not.
2666 2845
2667 static void 2846 static void
2668 check_cb (EV_P_ ev_timer *w, int revents) 2847 check_cb (EV_P_ ev_timer *w, int revents)
2669 { 2848 {
2670 ev_check_stop (EV_A_ w); 2849 ev_check_stop (EV_A_ w);
2671 } 2850 }
2672 2851
2673 ev_check check; 2852 ev_check check;
2674 ev_check_init (&check, check_cb); 2853 ev_check_init (&check, check_cb);
2675 ev_check_start (EV_DEFAULT_ &check); 2854 ev_check_start (EV_DEFAULT_ &check);
2676 ev_loop (EV_DEFAULT_ 0); 2855 ev_loop (EV_DEFAULT_ 0);
2677 2856
2678=head1 EMBEDDING 2857=head1 EMBEDDING
2679 2858
2680Libev can (and often is) directly embedded into host 2859Libev can (and often is) directly embedded into host
2681applications. Examples of applications that embed it include the Deliantra 2860applications. Examples of applications that embed it include the Deliantra
2688libev somewhere in your source tree). 2867libev somewhere in your source tree).
2689 2868
2690=head2 FILESETS 2869=head2 FILESETS
2691 2870
2692Depending on what features you need you need to include one or more sets of files 2871Depending on what features you need you need to include one or more sets of files
2693in your app. 2872in your application.
2694 2873
2695=head3 CORE EVENT LOOP 2874=head3 CORE EVENT LOOP
2696 2875
2697To include only the libev core (all the C<ev_*> functions), with manual 2876To include only the libev core (all the C<ev_*> functions), with manual
2698configuration (no autoconf): 2877configuration (no autoconf):
2699 2878
2700 #define EV_STANDALONE 1 2879 #define EV_STANDALONE 1
2701 #include "ev.c" 2880 #include "ev.c"
2702 2881
2703This will automatically include F<ev.h>, too, and should be done in a 2882This will automatically include F<ev.h>, too, and should be done in a
2704single C source file only to provide the function implementations. To use 2883single C source file only to provide the function implementations. To use
2705it, do the same for F<ev.h> in all files wishing to use this API (best 2884it, do the same for F<ev.h> in all files wishing to use this API (best
2706done by writing a wrapper around F<ev.h> that you can include instead and 2885done by writing a wrapper around F<ev.h> that you can include instead and
2707where you can put other configuration options): 2886where you can put other configuration options):
2708 2887
2709 #define EV_STANDALONE 1 2888 #define EV_STANDALONE 1
2710 #include "ev.h" 2889 #include "ev.h"
2711 2890
2712Both header files and implementation files can be compiled with a C++ 2891Both header files and implementation files can be compiled with a C++
2713compiler (at least, thats a stated goal, and breakage will be treated 2892compiler (at least, thats a stated goal, and breakage will be treated
2714as a bug). 2893as a bug).
2715 2894
2716You need the following files in your source tree, or in a directory 2895You need the following files in your source tree, or in a directory
2717in your include path (e.g. in libev/ when using -Ilibev): 2896in your include path (e.g. in libev/ when using -Ilibev):
2718 2897
2719 ev.h 2898 ev.h
2720 ev.c 2899 ev.c
2721 ev_vars.h 2900 ev_vars.h
2722 ev_wrap.h 2901 ev_wrap.h
2723 2902
2724 ev_win32.c required on win32 platforms only 2903 ev_win32.c required on win32 platforms only
2725 2904
2726 ev_select.c only when select backend is enabled (which is enabled by default) 2905 ev_select.c only when select backend is enabled (which is enabled by default)
2727 ev_poll.c only when poll backend is enabled (disabled by default) 2906 ev_poll.c only when poll backend is enabled (disabled by default)
2728 ev_epoll.c only when the epoll backend is enabled (disabled by default) 2907 ev_epoll.c only when the epoll backend is enabled (disabled by default)
2729 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 2908 ev_kqueue.c only when the kqueue backend is enabled (disabled by default)
2730 ev_port.c only when the solaris port backend is enabled (disabled by default) 2909 ev_port.c only when the solaris port backend is enabled (disabled by default)
2731 2910
2732F<ev.c> includes the backend files directly when enabled, so you only need 2911F<ev.c> includes the backend files directly when enabled, so you only need
2733to compile this single file. 2912to compile this single file.
2734 2913
2735=head3 LIBEVENT COMPATIBILITY API 2914=head3 LIBEVENT COMPATIBILITY API
2736 2915
2737To include the libevent compatibility API, also include: 2916To include the libevent compatibility API, also include:
2738 2917
2739 #include "event.c" 2918 #include "event.c"
2740 2919
2741in the file including F<ev.c>, and: 2920in the file including F<ev.c>, and:
2742 2921
2743 #include "event.h" 2922 #include "event.h"
2744 2923
2745in the files that want to use the libevent API. This also includes F<ev.h>. 2924in the files that want to use the libevent API. This also includes F<ev.h>.
2746 2925
2747You need the following additional files for this: 2926You need the following additional files for this:
2748 2927
2749 event.h 2928 event.h
2750 event.c 2929 event.c
2751 2930
2752=head3 AUTOCONF SUPPORT 2931=head3 AUTOCONF SUPPORT
2753 2932
2754Instead of using C<EV_STANDALONE=1> and providing your config in 2933Instead of using C<EV_STANDALONE=1> and providing your configuration in
2755whatever way you want, you can also C<m4_include([libev.m4])> in your 2934whatever way you want, you can also C<m4_include([libev.m4])> in your
2756F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then 2935F<configure.ac> and leave C<EV_STANDALONE> undefined. F<ev.c> will then
2757include F<config.h> and configure itself accordingly. 2936include F<config.h> and configure itself accordingly.
2758 2937
2759For this of course you need the m4 file: 2938For this of course you need the m4 file:
2760 2939
2761 libev.m4 2940 libev.m4
2762 2941
2763=head2 PREPROCESSOR SYMBOLS/MACROS 2942=head2 PREPROCESSOR SYMBOLS/MACROS
2764 2943
2765Libev can be configured via a variety of preprocessor symbols you have to 2944Libev can be configured via a variety of preprocessor symbols you have to
2766define before including any of its files. The default in the absense of 2945define before including any of its files. The default in the absence of
2767autoconf is noted for every option. 2946autoconf is noted for every option.
2768 2947
2769=over 4 2948=over 4
2770 2949
2771=item EV_STANDALONE 2950=item EV_STANDALONE
2777F<event.h> that are not directly supported by the libev core alone. 2956F<event.h> that are not directly supported by the libev core alone.
2778 2957
2779=item EV_USE_MONOTONIC 2958=item EV_USE_MONOTONIC
2780 2959
2781If defined to be C<1>, libev will try to detect the availability of the 2960If defined to be C<1>, libev will try to detect the availability of the
2782monotonic clock option at both compiletime and runtime. Otherwise no use 2961monotonic clock option at both compile time and runtime. Otherwise no use
2783of the monotonic clock option will be attempted. If you enable this, you 2962of the monotonic clock option will be attempted. If you enable this, you
2784usually have to link against librt or something similar. Enabling it when 2963usually have to link against librt or something similar. Enabling it when
2785the functionality isn't available is safe, though, although you have 2964the functionality isn't available is safe, though, although you have
2786to make sure you link against any libraries where the C<clock_gettime> 2965to make sure you link against any libraries where the C<clock_gettime>
2787function is hiding in (often F<-lrt>). 2966function is hiding in (often F<-lrt>).
2788 2967
2789=item EV_USE_REALTIME 2968=item EV_USE_REALTIME
2790 2969
2791If defined to be C<1>, libev will try to detect the availability of the 2970If defined to be C<1>, libev will try to detect the availability of the
2792realtime clock option at compiletime (and assume its availability at 2971real-time clock option at compile time (and assume its availability at
2793runtime if successful). Otherwise no use of the realtime clock option will 2972runtime if successful). Otherwise no use of the real-time clock option will
2794be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2973be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2795(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the 2974(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2796note about libraries in the description of C<EV_USE_MONOTONIC>, though. 2975note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2797 2976
2798=item EV_USE_NANOSLEEP 2977=item EV_USE_NANOSLEEP
28092.7 or newer, otherwise disabled. 29882.7 or newer, otherwise disabled.
2810 2989
2811=item EV_USE_SELECT 2990=item EV_USE_SELECT
2812 2991
2813If undefined or defined to be C<1>, libev will compile in support for the 2992If undefined or defined to be C<1>, libev will compile in support for the
2814C<select>(2) backend. No attempt at autodetection will be done: if no 2993C<select>(2) backend. No attempt at auto-detection will be done: if no
2815other method takes over, select will be it. Otherwise the select backend 2994other method takes over, select will be it. Otherwise the select backend
2816will not be compiled in. 2995will not be compiled in.
2817 2996
2818=item EV_SELECT_USE_FD_SET 2997=item EV_SELECT_USE_FD_SET
2819 2998
2820If defined to C<1>, then the select backend will use the system C<fd_set> 2999If defined to C<1>, then the select backend will use the system C<fd_set>
2821structure. This is useful if libev doesn't compile due to a missing 3000structure. This is useful if libev doesn't compile due to a missing
2822C<NFDBITS> or C<fd_mask> definition or it misguesses the bitset layout on 3001C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on
2823exotic systems. This usually limits the range of file descriptors to some 3002exotic systems. This usually limits the range of file descriptors to some
2824low limit such as 1024 or might have other limitations (winsocket only 3003low limit such as 1024 or might have other limitations (winsocket only
2825allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 3004allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might
2826influence the size of the C<fd_set> used. 3005influence the size of the C<fd_set> used.
2827 3006
2876otherwise another method will be used as fallback. This is the preferred 3055otherwise another method will be used as fallback. This is the preferred
2877backend for Solaris 10 systems. 3056backend for Solaris 10 systems.
2878 3057
2879=item EV_USE_DEVPOLL 3058=item EV_USE_DEVPOLL
2880 3059
2881reserved for future expansion, works like the USE symbols above. 3060Reserved for future expansion, works like the USE symbols above.
2882 3061
2883=item EV_USE_INOTIFY 3062=item EV_USE_INOTIFY
2884 3063
2885If defined to be C<1>, libev will compile in support for the Linux inotify 3064If defined to be C<1>, libev will compile in support for the Linux inotify
2886interface to speed up C<ev_stat> watchers. Its actual availability will 3065interface to speed up C<ev_stat> watchers. Its actual availability will
2893access is atomic with respect to other threads or signal contexts. No such 3072access is atomic with respect to other threads or signal contexts. No such
2894type is easily found in the C language, so you can provide your own type 3073type is easily found in the C language, so you can provide your own type
2895that you know is safe for your purposes. It is used both for signal handler "locking" 3074that you know is safe for your purposes. It is used both for signal handler "locking"
2896as well as for signal and thread safety in C<ev_async> watchers. 3075as well as for signal and thread safety in C<ev_async> watchers.
2897 3076
2898In the absense of this define, libev will use C<sig_atomic_t volatile> 3077In the absence of this define, libev will use C<sig_atomic_t volatile>
2899(from F<signal.h>), which is usually good enough on most platforms. 3078(from F<signal.h>), which is usually good enough on most platforms.
2900 3079
2901=item EV_H 3080=item EV_H
2902 3081
2903The name of the F<ev.h> header file used to include it. The default if 3082The name of the F<ev.h> header file used to include it. The default if
2942When doing priority-based operations, libev usually has to linearly search 3121When doing priority-based operations, libev usually has to linearly search
2943all the priorities, so having many of them (hundreds) uses a lot of space 3122all the priorities, so having many of them (hundreds) uses a lot of space
2944and time, so using the defaults of five priorities (-2 .. +2) is usually 3123and time, so using the defaults of five priorities (-2 .. +2) is usually
2945fine. 3124fine.
2946 3125
2947If your embedding app does not need any priorities, defining these both to 3126If your embedding application does not need any priorities, defining these both to
2948C<0> will save some memory and cpu. 3127C<0> will save some memory and CPU.
2949 3128
2950=item EV_PERIODIC_ENABLE 3129=item EV_PERIODIC_ENABLE
2951 3130
2952If undefined or defined to be C<1>, then periodic timers are supported. If 3131If undefined or defined to be C<1>, then periodic timers are supported. If
2953defined to be C<0>, then they are not. Disabling them saves a few kB of 3132defined to be C<0>, then they are not. Disabling them saves a few kB of
2980defined to be C<0>, then they are not. 3159defined to be C<0>, then they are not.
2981 3160
2982=item EV_MINIMAL 3161=item EV_MINIMAL
2983 3162
2984If you need to shave off some kilobytes of code at the expense of some 3163If you need to shave off some kilobytes of code at the expense of some
2985speed, define this symbol to C<1>. Currently only used for gcc to override 3164speed, define this symbol to C<1>. Currently this is used to override some
2986some inlining decisions, saves roughly 30% codesize of amd64. 3165inlining decisions, saves roughly 30% code size on amd64. It also selects a
3166much smaller 2-heap for timer management over the default 4-heap.
2987 3167
2988=item EV_PID_HASHSIZE 3168=item EV_PID_HASHSIZE
2989 3169
2990C<ev_child> watchers use a small hash table to distribute workload by 3170C<ev_child> watchers use a small hash table to distribute workload by
2991pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 3171pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
2998inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 3178inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2999usually more than enough. If you need to manage thousands of C<ev_stat> 3179usually more than enough. If you need to manage thousands of C<ev_stat>
3000watchers you might want to increase this value (I<must> be a power of 3180watchers you might want to increase this value (I<must> be a power of
3001two). 3181two).
3002 3182
3183=item EV_USE_4HEAP
3184
3185Heaps are not very cache-efficient. To improve the cache-efficiency of the
3186timer and periodics heap, libev uses a 4-heap when this symbol is defined
3187to C<1>. The 4-heap uses more complicated (longer) code but has
3188noticeably faster performance with many (thousands) of watchers.
3189
3190The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3191(disabled).
3192
3193=item EV_HEAP_CACHE_AT
3194
3195Heaps are not very cache-efficient. To improve the cache-efficiency of the
3196timer and periodics heap, libev can cache the timestamp (I<at>) within
3197the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>),
3198which uses 8-12 bytes more per watcher and a few hundred bytes more code,
3199but avoids random read accesses on heap changes. This improves performance
3200noticeably with with many (hundreds) of watchers.
3201
3202The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0>
3203(disabled).
3204
3205=item EV_VERIFY
3206
3207Controls how much internal verification (see C<ev_loop_verify ()>) will
3208be done: If set to C<0>, no internal verification code will be compiled
3209in. If set to C<1>, then verification code will be compiled in, but not
3210called. If set to C<2>, then the internal verification code will be
3211called once per loop, which can slow down libev. If set to C<3>, then the
3212verification code will be called very frequently, which will slow down
3213libev considerably.
3214
3215The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be
3216C<0.>
3217
3003=item EV_COMMON 3218=item EV_COMMON
3004 3219
3005By default, all watchers have a C<void *data> member. By redefining 3220By default, all watchers have a C<void *data> member. By redefining
3006this macro to a something else you can include more and other types of 3221this macro to a something else you can include more and other types of
3007members. You have to define it each time you include one of the files, 3222members. You have to define it each time you include one of the files,
3008though, and it must be identical each time. 3223though, and it must be identical each time.
3009 3224
3010For example, the perl EV module uses something like this: 3225For example, the perl EV module uses something like this:
3011 3226
3012 #define EV_COMMON \ 3227 #define EV_COMMON \
3013 SV *self; /* contains this struct */ \ 3228 SV *self; /* contains this struct */ \
3014 SV *cb_sv, *fh /* note no trailing ";" */ 3229 SV *cb_sv, *fh /* note no trailing ";" */
3015 3230
3016=item EV_CB_DECLARE (type) 3231=item EV_CB_DECLARE (type)
3017 3232
3018=item EV_CB_INVOKE (watcher, revents) 3233=item EV_CB_INVOKE (watcher, revents)
3019 3234
3026avoid the C<struct ev_loop *> as first argument in all cases, or to use 3241avoid the C<struct ev_loop *> as first argument in all cases, or to use
3027method calls instead of plain function calls in C++. 3242method calls instead of plain function calls in C++.
3028 3243
3029=head2 EXPORTED API SYMBOLS 3244=head2 EXPORTED API SYMBOLS
3030 3245
3031If you need to re-export the API (e.g. via a dll) and you need a list of 3246If you need to re-export the API (e.g. via a DLL) and you need a list of
3032exported symbols, you can use the provided F<Symbol.*> files which list 3247exported symbols, you can use the provided F<Symbol.*> files which list
3033all public symbols, one per line: 3248all public symbols, one per line:
3034 3249
3035 Symbols.ev for libev proper 3250 Symbols.ev for libev proper
3036 Symbols.event for the libevent emulation 3251 Symbols.event for the libevent emulation
3037 3252
3038This can also be used to rename all public symbols to avoid clashes with 3253This can also be used to rename all public symbols to avoid clashes with
3039multiple versions of libev linked together (which is obviously bad in 3254multiple versions of libev linked together (which is obviously bad in
3040itself, but sometimes it is inconvinient to avoid this). 3255itself, but sometimes it is inconvenient to avoid this).
3041 3256
3042A sed command like this will create wrapper C<#define>'s that you need to 3257A sed command like this will create wrapper C<#define>'s that you need to
3043include before including F<ev.h>: 3258include before including F<ev.h>:
3044 3259
3045 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h 3260 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
3062file. 3277file.
3063 3278
3064The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file 3279The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file
3065that everybody includes and which overrides some configure choices: 3280that everybody includes and which overrides some configure choices:
3066 3281
3067 #define EV_MINIMAL 1 3282 #define EV_MINIMAL 1
3068 #define EV_USE_POLL 0 3283 #define EV_USE_POLL 0
3069 #define EV_MULTIPLICITY 0 3284 #define EV_MULTIPLICITY 0
3070 #define EV_PERIODIC_ENABLE 0 3285 #define EV_PERIODIC_ENABLE 0
3071 #define EV_STAT_ENABLE 0 3286 #define EV_STAT_ENABLE 0
3072 #define EV_FORK_ENABLE 0 3287 #define EV_FORK_ENABLE 0
3073 #define EV_CONFIG_H <config.h> 3288 #define EV_CONFIG_H <config.h>
3074 #define EV_MINPRI 0 3289 #define EV_MINPRI 0
3075 #define EV_MAXPRI 0 3290 #define EV_MAXPRI 0
3076 3291
3077 #include "ev++.h" 3292 #include "ev++.h"
3078 3293
3079And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: 3294And a F<ev_cpp.C> implementation file that contains libev proper and is compiled:
3080 3295
3081 #include "ev_cpp.h" 3296 #include "ev_cpp.h"
3082 #include "ev.c" 3297 #include "ev.c"
3083 3298
3084 3299
3085=head1 THREADS AND COROUTINES 3300=head1 THREADS AND COROUTINES
3086 3301
3087=head2 THREADS 3302=head2 THREADS
3088 3303
3089Libev itself is completely threadsafe, but it uses no locking. This 3304Libev itself is thread-safe (unless the opposite is specifically
3305documented for a function), but it uses no locking itself. This means that
3090means that you can use as many loops as you want in parallel, as long as 3306you can use as many loops as you want in parallel, as long as only one
3091only one thread ever calls into one libev function with the same loop 3307thread ever calls into one libev function with the same loop parameter:
3092parameter. 3308libev guarentees that different event loops share no data structures that
3309need locking.
3093 3310
3094Or put differently: calls with different loop parameters can be done in 3311Or to put it differently: calls with different loop parameters can be done
3095parallel from multiple threads, calls with the same loop parameter must be 3312concurrently from multiple threads, calls with the same loop parameter
3096done serially (but can be done from different threads, as long as only one 3313must be done serially (but can be done from different threads, as long as
3097thread ever is inside a call at any point in time, e.g. by using a mutex 3314only one thread ever is inside a call at any point in time, e.g. by using
3098per loop). 3315a mutex per loop).
3099 3316
3100If you want to know which design is best for your problem, then I cannot 3317Specifically to support threads (and signal handlers), libev implements
3101help you but by giving some generic advice: 3318so-called C<ev_async> watchers, which allow some limited form of
3319concurrency on the same event loop.
3320
3321If you want to know which design (one loop, locking, or multiple loops
3322without or something else still) is best for your problem, then I cannot
3323help you. I can give some generic advice however:
3102 3324
3103=over 4 3325=over 4
3104 3326
3105=item * most applications have a main thread: use the default libev loop 3327=item * most applications have a main thread: use the default libev loop
3106in that thread, or create a seperate thread running only the default loop. 3328in that thread, or create a separate thread running only the default loop.
3107 3329
3108This helps integrating other libraries or software modules that use libev 3330This helps integrating other libraries or software modules that use libev
3109themselves and don't care/know about threading. 3331themselves and don't care/know about threading.
3110 3332
3111=item * one loop per thread is usually a good model. 3333=item * one loop per thread is usually a good model.
3112 3334
3113Doing this is almost never wrong, sometimes a better-performance model 3335Doing this is almost never wrong, sometimes a better-performance model
3114exists, but it is always a good start. 3336exists, but it is always a good start.
3115 3337
3116=item * other models exist, such as the leader/follower pattern, where one 3338=item * other models exist, such as the leader/follower pattern, where one
3117loop is handed through multiple threads in a kind of round-robbin fashion. 3339loop is handed through multiple threads in a kind of round-robin fashion.
3118 3340
3119Chosing a model is hard - look around, learn, know that usually you cna do 3341Choosing a model is hard - look around, learn, know that usually you can do
3120better than you currently do :-) 3342better than you currently do :-)
3121 3343
3122=item * often you need to talk to some other thread which blocks in the 3344=item * often you need to talk to some other thread which blocks in the
3345event loop.
3346
3123event loop - C<ev_async> watchers can be used to wake them up from other 3347C<ev_async> watchers can be used to wake them up from other threads safely
3124threads safely (or from signal contexts...). 3348(or from signal contexts...).
3349
3350An example use would be to communicate signals or other events that only
3351work in the default loop by registering the signal watcher with the
3352default loop and triggering an C<ev_async> watcher from the default loop
3353watcher callback into the event loop interested in the signal.
3125 3354
3126=back 3355=back
3127 3356
3128=head2 COROUTINES 3357=head2 COROUTINES
3129 3358
3130Libev is much more accomodating to coroutines ("cooperative threads"): 3359Libev is much more accommodating to coroutines ("cooperative threads"):
3131libev fully supports nesting calls to it's functions from different 3360libev fully supports nesting calls to it's functions from different
3132coroutines (e.g. you can call C<ev_loop> on the same loop from two 3361coroutines (e.g. you can call C<ev_loop> on the same loop from two
3133different coroutines and switch freely between both coroutines running the 3362different coroutines and switch freely between both coroutines running the
3134loop, as long as you don't confuse yourself). The only exception is that 3363loop, as long as you don't confuse yourself). The only exception is that
3135you must not do this from C<ev_periodic> reschedule callbacks. 3364you must not do this from C<ev_periodic> reschedule callbacks.
3136 3365
3137Care has been invested into making sure that libev does not keep local 3366Care has been taken to ensure that libev does not keep local state inside
3138state inside C<ev_loop>, and other calls do not usually allow coroutine 3367C<ev_loop>, and other calls do not usually allow coroutine switches.
3139switches.
3140 3368
3141 3369
3142=head1 COMPLEXITIES 3370=head1 COMPLEXITIES
3143 3371
3144In this section the complexities of (many of) the algorithms used inside 3372In this section the complexities of (many of) the algorithms used inside
3176correct watcher to remove. The lists are usually short (you don't usually 3404correct watcher to remove. The lists are usually short (you don't usually
3177have many watchers waiting for the same fd or signal). 3405have many watchers waiting for the same fd or signal).
3178 3406
3179=item Finding the next timer in each loop iteration: O(1) 3407=item Finding the next timer in each loop iteration: O(1)
3180 3408
3181By virtue of using a binary heap, the next timer is always found at the 3409By virtue of using a binary or 4-heap, the next timer is always found at a
3182beginning of the storage array. 3410fixed position in the storage array.
3183 3411
3184=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 3412=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
3185 3413
3186A change means an I/O watcher gets started or stopped, which requires 3414A change means an I/O watcher gets started or stopped, which requires
3187libev to recalculate its status (and possibly tell the kernel, depending 3415libev to recalculate its status (and possibly tell the kernel, depending
3188on backend and wether C<ev_io_set> was used). 3416on backend and whether C<ev_io_set> was used).
3189 3417
3190=item Activating one watcher (putting it into the pending state): O(1) 3418=item Activating one watcher (putting it into the pending state): O(1)
3191 3419
3192=item Priority handling: O(number_of_priorities) 3420=item Priority handling: O(number_of_priorities)
3193 3421
3200 3428
3201=item Processing ev_async_send: O(number_of_async_watchers) 3429=item Processing ev_async_send: O(number_of_async_watchers)
3202 3430
3203=item Processing signals: O(max_signal_number) 3431=item Processing signals: O(max_signal_number)
3204 3432
3205Sending involves a syscall I<iff> there were no other C<ev_async_send> 3433Sending involves a system call I<iff> there were no other C<ev_async_send>
3206calls in the current loop iteration. Checking for async and signal events 3434calls in the current loop iteration. Checking for async and signal events
3207involves iterating over all running async watchers or all signal numbers. 3435involves iterating over all running async watchers or all signal numbers.
3208 3436
3209=back 3437=back
3210 3438
3211 3439
3212=head1 Win32 platform limitations and workarounds 3440=head1 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS
3213 3441
3214Win32 doesn't support any of the standards (e.g. POSIX) that libev 3442Win32 doesn't support any of the standards (e.g. POSIX) that libev
3215requires, and its I/O model is fundamentally incompatible with the POSIX 3443requires, and its I/O model is fundamentally incompatible with the POSIX
3216model. Libev still offers limited functionality on this platform in 3444model. Libev still offers limited functionality on this platform in
3217the form of the C<EVBACKEND_SELECT> backend, and only supports socket 3445the form of the C<EVBACKEND_SELECT> backend, and only supports socket
3224way (note also that glib is the slowest event library known to man). 3452way (note also that glib is the slowest event library known to man).
3225 3453
3226There is no supported compilation method available on windows except 3454There is no supported compilation method available on windows except
3227embedding it into other applications. 3455embedding it into other applications.
3228 3456
3457Not a libev limitation but worth mentioning: windows apparently doesn't
3458accept large writes: instead of resulting in a partial write, windows will
3459either accept everything or return C<ENOBUFS> if the buffer is too large,
3460so make sure you only write small amounts into your sockets (less than a
3461megabyte seems safe, but thsi apparently depends on the amount of memory
3462available).
3463
3229Due to the many, low, and arbitrary limits on the win32 platform and 3464Due to the many, low, and arbitrary limits on the win32 platform and
3230the abysmal performance of winsockets, using a large number of sockets 3465the abysmal performance of winsockets, using a large number of sockets
3231is not recommended (and not reasonable). If your program needs to use 3466is not recommended (and not reasonable). If your program needs to use
3232more than a hundred or so sockets, then likely it needs to use a totally 3467more than a hundred or so sockets, then likely it needs to use a totally
3233different implementation for windows, as libev offers the POSIX readyness 3468different implementation for windows, as libev offers the POSIX readiness
3234notification model, which cannot be implemented efficiently on windows 3469notification model, which cannot be implemented efficiently on windows
3235(microsoft monopoly games). 3470(Microsoft monopoly games).
3471
3472A typical way to use libev under windows is to embed it (see the embedding
3473section for details) and use the following F<evwrap.h> header file instead
3474of F<ev.h>:
3475
3476 #define EV_STANDALONE /* keeps ev from requiring config.h */
3477 #define EV_SELECT_IS_WINSOCKET 1 /* configure libev for windows select */
3478
3479 #include "ev.h"
3480
3481And compile the following F<evwrap.c> file into your project (make sure
3482you do I<not> compile the F<ev.c> or any other embedded soruce files!):
3483
3484 #include "evwrap.h"
3485 #include "ev.c"
3236 3486
3237=over 4 3487=over 4
3238 3488
3239=item The winsocket select function 3489=item The winsocket select function
3240 3490
3241The winsocket C<select> function doesn't follow POSIX in that it requires 3491The winsocket C<select> function doesn't follow POSIX in that it
3242socket I<handles> and not socket I<file descriptors>. This makes select 3492requires socket I<handles> and not socket I<file descriptors> (it is
3243very inefficient, and also requires a mapping from file descriptors 3493also extremely buggy). This makes select very inefficient, and also
3244to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>, 3494requires a mapping from file descriptors to socket handles (the Microsoft
3245C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor 3495C runtime provides the function C<_open_osfhandle> for this). See the
3246symbols for more info. 3496discussion of the C<EV_SELECT_USE_FD_SET>, C<EV_SELECT_IS_WINSOCKET> and
3497C<EV_FD_TO_WIN32_HANDLE> preprocessor symbols for more info.
3247 3498
3248The configuration for a "naked" win32 using the microsoft runtime 3499The configuration for a "naked" win32 using the Microsoft runtime
3249libraries and raw winsocket select is: 3500libraries and raw winsocket select is:
3250 3501
3251 #define EV_USE_SELECT 1 3502 #define EV_USE_SELECT 1
3252 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ 3503 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
3253 3504
3254Note that winsockets handling of fd sets is O(n), so you can easily get a 3505Note that winsockets handling of fd sets is O(n), so you can easily get a
3255complexity in the O(n²) range when using win32. 3506complexity in the O(n²) range when using win32.
3256 3507
3257=item Limited number of file descriptors 3508=item Limited number of file descriptors
3258 3509
3259Windows has numerous arbitrary (and low) limits on things. 3510Windows has numerous arbitrary (and low) limits on things.
3260 3511
3261Early versions of winsocket's select only supported waiting for a maximum 3512Early versions of winsocket's select only supported waiting for a maximum
3262of C<64> handles (probably owning to the fact that all windows kernels 3513of C<64> handles (probably owning to the fact that all windows kernels
3263can only wait for C<64> things at the same time internally; microsoft 3514can only wait for C<64> things at the same time internally; Microsoft
3264recommends spawning a chain of threads and wait for 63 handles and the 3515recommends spawning a chain of threads and wait for 63 handles and the
3265previous thread in each. Great). 3516previous thread in each. Great).
3266 3517
3267Newer versions support more handles, but you need to define C<FD_SETSIZE> 3518Newer versions support more handles, but you need to define C<FD_SETSIZE>
3268to some high number (e.g. C<2048>) before compiling the winsocket select 3519to some high number (e.g. C<2048>) before compiling the winsocket select
3269call (which might be in libev or elsewhere, for example, perl does its own 3520call (which might be in libev or elsewhere, for example, perl does its own
3270select emulation on windows). 3521select emulation on windows).
3271 3522
3272Another limit is the number of file descriptors in the microsoft runtime 3523Another limit is the number of file descriptors in the Microsoft runtime
3273libraries, which by default is C<64> (there must be a hidden I<64> fetish 3524libraries, which by default is C<64> (there must be a hidden I<64> fetish
3274or something like this inside microsoft). You can increase this by calling 3525or something like this inside Microsoft). You can increase this by calling
3275C<_setmaxstdio>, which can increase this limit to C<2048> (another 3526C<_setmaxstdio>, which can increase this limit to C<2048> (another
3276arbitrary limit), but is broken in many versions of the microsoft runtime 3527arbitrary limit), but is broken in many versions of the Microsoft runtime
3277libraries. 3528libraries.
3278 3529
3279This might get you to about C<512> or C<2048> sockets (depending on 3530This might get you to about C<512> or C<2048> sockets (depending on
3280windows version and/or the phase of the moon). To get more, you need to 3531windows version and/or the phase of the moon). To get more, you need to
3281wrap all I/O functions and provide your own fd management, but the cost of 3532wrap all I/O functions and provide your own fd management, but the cost of
3288 3539
3289In addition to a working ISO-C implementation, libev relies on a few 3540In addition to a working ISO-C implementation, libev relies on a few
3290additional extensions: 3541additional extensions:
3291 3542
3292=over 4 3543=over 4
3544
3545=item C<void (*)(ev_watcher_type *, int revents)> must have compatible
3546calling conventions regardless of C<ev_watcher_type *>.
3547
3548Libev assumes not only that all watcher pointers have the same internal
3549structure (guaranteed by POSIX but not by ISO C for example), but it also
3550assumes that the same (machine) code can be used to call any watcher
3551callback: The watcher callbacks have different type signatures, but libev
3552calls them using an C<ev_watcher *> internally.
3293 3553
3294=item C<sig_atomic_t volatile> must be thread-atomic as well 3554=item C<sig_atomic_t volatile> must be thread-atomic as well
3295 3555
3296The type C<sig_atomic_t volatile> (or whatever is defined as 3556The type C<sig_atomic_t volatile> (or whatever is defined as
3297C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different 3557C<EV_ATOMIC_T>) must be atomic w.r.t. accesses from different
3329=back 3589=back
3330 3590
3331If you know of other additional requirements drop me a note. 3591If you know of other additional requirements drop me a note.
3332 3592
3333 3593
3594=head1 COMPILER WARNINGS
3595
3596Depending on your compiler and compiler settings, you might get no or a
3597lot of warnings when compiling libev code. Some people are apparently
3598scared by this.
3599
3600However, these are unavoidable for many reasons. For one, each compiler
3601has different warnings, and each user has different tastes regarding
3602warning options. "Warn-free" code therefore cannot be a goal except when
3603targeting a specific compiler and compiler-version.
3604
3605Another reason is that some compiler warnings require elaborate
3606workarounds, or other changes to the code that make it less clear and less
3607maintainable.
3608
3609And of course, some compiler warnings are just plain stupid, or simply
3610wrong (because they don't actually warn about the condition their message
3611seems to warn about).
3612
3613While libev is written to generate as few warnings as possible,
3614"warn-free" code is not a goal, and it is recommended not to build libev
3615with any compiler warnings enabled unless you are prepared to cope with
3616them (e.g. by ignoring them). Remember that warnings are just that:
3617warnings, not errors, or proof of bugs.
3618
3619
3620=head1 VALGRIND
3621
3622Valgrind has a special section here because it is a popular tool that is
3623highly useful, but valgrind reports are very hard to interpret.
3624
3625If you think you found a bug (memory leak, uninitialised data access etc.)
3626in libev, then check twice: If valgrind reports something like:
3627
3628 ==2274== definitely lost: 0 bytes in 0 blocks.
3629 ==2274== possibly lost: 0 bytes in 0 blocks.
3630 ==2274== still reachable: 256 bytes in 1 blocks.
3631
3632Then there is no memory leak. Similarly, under some circumstances,
3633valgrind might report kernel bugs as if it were a bug in libev, or it
3634might be confused (it is a very good tool, but only a tool).
3635
3636If you are unsure about something, feel free to contact the mailing list
3637with the full valgrind report and an explanation on why you think this is
3638a bug in libev. However, don't be annoyed when you get a brisk "this is
3639no bug" answer and take the chance of learning how to interpret valgrind
3640properly.
3641
3642If you need, for some reason, empty reports from valgrind for your project
3643I suggest using suppression lists.
3644
3645
3334=head1 AUTHOR 3646=head1 AUTHOR
3335 3647
3336Marc Lehmann <libev@schmorp.de>. 3648Marc Lehmann <libev@schmorp.de>.
3337 3649

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines