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

Comparing libev/ev.pod (file contents):
Revision 1.76 by root, Sat Dec 8 15:30:30 2007 UTC vs.
Revision 1.130 by root, Wed Feb 6 18:34:24 2008 UTC

4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 #include <ev.h> 7 #include <ev.h>
8 8
9=head1 EXAMPLE PROGRAM 9=head2 EXAMPLE PROGRAM
10 10
11 #include <ev.h> 11 #include <ev.h>
12 12
13 ev_io stdin_watcher; 13 ev_io stdin_watcher;
14 ev_timer timeout_watcher; 14 ev_timer timeout_watcher;
53The newest version of this document is also available as a html-formatted 53The newest version of this document is also available as a html-formatted
54web page you might find easier to navigate when reading it for the first 54web page you might find easier to navigate when reading it for the first
55time: L<http://cvs.schmorp.de/libev/ev.html>. 55time: L<http://cvs.schmorp.de/libev/ev.html>.
56 56
57Libev is an event loop: you register interest in certain events (such as a 57Libev is an event loop: you register interest in certain events (such as a
58file descriptor being readable or a timeout occuring), and it will manage 58file descriptor being readable or a timeout occurring), and it will manage
59these event sources and provide your program with events. 59these event sources and provide your program with events.
60 60
61To do this, it must take more or less complete control over your process 61To do this, it must take more or less complete control over your process
62(or thread) by executing the I<event loop> handler, and will then 62(or thread) by executing the I<event loop> handler, and will then
63communicate events via a callback mechanism. 63communicate events via a callback mechanism.
65You register interest in certain events by registering so-called I<event 65You register interest in certain events by registering so-called I<event
66watchers>, which are relatively small C structures you initialise with the 66watchers>, which are relatively small C structures you initialise with the
67details of the event, and then hand it over to libev by I<starting> the 67details of the event, and then hand it over to libev by I<starting> the
68watcher. 68watcher.
69 69
70=head1 FEATURES 70=head2 FEATURES
71 71
72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 72Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 73BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
74for file descriptor events (C<ev_io>), the Linux C<inotify> interface 74for file descriptor events (C<ev_io>), the Linux C<inotify> interface
75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 75(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers
82 82
83It also is quite fast (see this 83It also is quite fast (see this
84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 84L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
85for example). 85for example).
86 86
87=head1 CONVENTIONS 87=head2 CONVENTIONS
88 88
89Libev is very configurable. In this manual the default configuration will 89Libev is very configurable. In this manual the default configuration will
90be described, which supports multiple event loops. For more info about 90be described, which supports multiple event loops. For more info about
91various configuration options please have a look at B<EMBED> section in 91various configuration options please have a look at B<EMBED> section in
92this manual. If libev was configured without support for multiple event 92this manual. If libev was configured without support for multiple event
93loops, then all functions taking an initial argument of name C<loop> 93loops, then all functions taking an initial argument of name C<loop>
94(which is always of type C<struct ev_loop *>) will not have this argument. 94(which is always of type C<struct ev_loop *>) will not have this argument.
95 95
96=head1 TIME REPRESENTATION 96=head2 TIME REPRESENTATION
97 97
98Libev represents time as a single floating point number, representing the 98Libev represents time as a single floating point number, representing the
99(fractional) number of seconds since the (POSIX) epoch (somewhere near 99(fractional) number of seconds since the (POSIX) epoch (somewhere near
100the beginning of 1970, details are complicated, don't ask). This type is 100the beginning of 1970, details are complicated, don't ask). This type is
101called C<ev_tstamp>, which is what you should use too. It usually aliases 101called C<ev_tstamp>, which is what you should use too. It usually aliases
102to the C<double> type in C, and when you need to do any calculations on 102to the C<double> type in C, and when you need to do any calculations on
103it, you should treat it as such. 103it, you should treat it as some floatingpoint value. Unlike the name
104component C<stamp> might indicate, it is also used for time differences
105throughout libev.
104 106
105=head1 GLOBAL FUNCTIONS 107=head1 GLOBAL FUNCTIONS
106 108
107These functions can be called anytime, even before initialising the 109These functions can be called anytime, even before initialising the
108library in any way. 110library in any way.
113 115
114Returns the current time as libev would use it. Please note that the 116Returns the current time as libev would use it. Please note that the
115C<ev_now> function is usually faster and also often returns the timestamp 117C<ev_now> function is usually faster and also often returns the timestamp
116you actually want to know. 118you actually want to know.
117 119
120=item ev_sleep (ev_tstamp interval)
121
122Sleep for the given interval: The current thread will be blocked until
123either it is interrupted or the given time interval has passed. Basically
124this is a subsecond-resolution C<sleep ()>.
125
118=item int ev_version_major () 126=item int ev_version_major ()
119 127
120=item int ev_version_minor () 128=item int ev_version_minor ()
121 129
122You can find out the major and minor version numbers of the library 130You can find out the major and minor ABI version numbers of the library
123you linked against by calling the functions C<ev_version_major> and 131you linked against by calling the functions C<ev_version_major> and
124C<ev_version_minor>. If you want, you can compare against the global 132C<ev_version_minor>. If you want, you can compare against the global
125symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the 133symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the
126version of the library your program was compiled against. 134version of the library your program was compiled against.
127 135
136These version numbers refer to the ABI version of the library, not the
137release version.
138
128Usually, it's a good idea to terminate if the major versions mismatch, 139Usually, it's a good idea to terminate if the major versions mismatch,
129as this indicates an incompatible change. Minor versions are usually 140as this indicates an incompatible change. Minor versions are usually
130compatible to older versions, so a larger minor version alone is usually 141compatible to older versions, so a larger minor version alone is usually
131not a problem. 142not a problem.
132 143
133Example: Make sure we haven't accidentally been linked against the wrong 144Example: Make sure we haven't accidentally been linked against the wrong
134version. 145version.
249flags. If that is troubling you, check C<ev_backend ()> afterwards). 260flags. If that is troubling you, check C<ev_backend ()> afterwards).
250 261
251If you don't know what event loop to use, use the one returned from this 262If you don't know what event loop to use, use the one returned from this
252function. 263function.
253 264
265The default loop is the only loop that can handle C<ev_signal> and
266C<ev_child> watchers, and to do this, it always registers a handler
267for C<SIGCHLD>. If this is a problem for your app you can either
268create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
269can simply overwrite the C<SIGCHLD> signal handler I<after> calling
270C<ev_default_init>.
271
254The flags argument can be used to specify special behaviour or specific 272The flags argument can be used to specify special behaviour or specific
255backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). 273backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>).
256 274
257The following flags are supported: 275The following flags are supported:
258 276
295=item C<EVBACKEND_SELECT> (value 1, portable select backend) 313=item C<EVBACKEND_SELECT> (value 1, portable select backend)
296 314
297This is your standard select(2) backend. Not I<completely> standard, as 315This is your standard select(2) backend. Not I<completely> standard, as
298libev tries to roll its own fd_set with no limits on the number of fds, 316libev tries to roll its own fd_set with no limits on the number of fds,
299but if that fails, expect a fairly low limit on the number of fds when 317but if that fails, expect a fairly low limit on the number of fds when
300using this backend. It doesn't scale too well (O(highest_fd)), but its usually 318using this backend. It doesn't scale too well (O(highest_fd)), but its
301the fastest backend for a low number of fds. 319usually the fastest backend for a low number of (low-numbered :) fds.
320
321To get good performance out of this backend you need a high amount of
322parallelity (most of the file descriptors should be busy). If you are
323writing a server, you should C<accept ()> in a loop to accept as many
324connections as possible during one iteration. You might also want to have
325a look at C<ev_set_io_collect_interval ()> to increase the amount of
326readyness notifications you get per iteration.
302 327
303=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) 328=item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows)
304 329
305And this is your standard poll(2) backend. It's more complicated than 330And this is your standard poll(2) backend. It's more complicated
306select, but handles sparse fds better and has no artificial limit on the 331than select, but handles sparse fds better and has no artificial
307number of fds you can use (except it will slow down considerably with a 332limit on the number of fds you can use (except it will slow down
308lot of inactive fds). It scales similarly to select, i.e. O(total_fds). 333considerably with a lot of inactive fds). It scales similarly to select,
334i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for
335performance tips.
309 336
310=item C<EVBACKEND_EPOLL> (value 4, Linux) 337=item C<EVBACKEND_EPOLL> (value 4, Linux)
311 338
312For few fds, this backend is a bit little slower than poll and select, 339For few fds, this backend is a bit little slower than poll and select,
313but it scales phenomenally better. While poll and select usually scale like 340but it scales phenomenally better. While poll and select usually scale
314O(total_fds) where n is the total number of fds (or the highest fd), epoll scales 341like O(total_fds) where n is the total number of fds (or the highest fd),
315either O(1) or O(active_fds). 342epoll scales either O(1) or O(active_fds). The epoll design has a number
343of shortcomings, such as silently dropping events in some hard-to-detect
344cases and rewiring a syscall per fd change, no fork support and bad
345support for dup.
316 346
317While stopping and starting an I/O watcher in the same iteration will 347While stopping, setting and starting an I/O watcher in the same iteration
318result in some caching, there is still a syscall per such incident 348will result in some caching, there is still a syscall per such incident
319(because the fd could point to a different file description now), so its 349(because the fd could point to a different file description now), so its
320best to avoid that. Also, dup()ed file descriptors might not work very 350best to avoid that. Also, C<dup ()>'ed file descriptors might not work
321well if you register events for both fds. 351very well if you register events for both fds.
322 352
323Please note that epoll sometimes generates spurious notifications, so you 353Please note that epoll sometimes generates spurious notifications, so you
324need to use non-blocking I/O or other means to avoid blocking when no data 354need to use non-blocking I/O or other means to avoid blocking when no data
325(or space) is available. 355(or space) is available.
326 356
357Best performance from this backend is achieved by not unregistering all
358watchers for a file descriptor until it has been closed, if possible, i.e.
359keep at least one watcher active per fd at all times.
360
361While nominally embeddeble in other event loops, this feature is broken in
362all kernel versions tested so far.
363
327=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 364=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
328 365
329Kqueue deserves special mention, as at the time of this writing, it 366Kqueue deserves special mention, as at the time of this writing, it
330was broken on all BSDs except NetBSD (usually it doesn't work with 367was broken on all BSDs except NetBSD (usually it doesn't work reliably
331anything but sockets and pipes, except on Darwin, where of course its 368with anything but sockets and pipes, except on Darwin, where of course
332completely useless). For this reason its not being "autodetected" 369it's completely useless). For this reason it's not being "autodetected"
333unless you explicitly specify it explicitly in the flags (i.e. using 370unless you explicitly specify it explicitly in the flags (i.e. using
334C<EVBACKEND_KQUEUE>). 371C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
372system like NetBSD.
373
374You still can embed kqueue into a normal poll or select backend and use it
375only for sockets (after having made sure that sockets work with kqueue on
376the target platform). See C<ev_embed> watchers for more info.
335 377
336It scales in the same way as the epoll backend, but the interface to the 378It scales in the same way as the epoll backend, but the interface to the
337kernel is more efficient (which says nothing about its actual speed, of 379kernel is more efficient (which says nothing about its actual speed, of
338course). While starting and stopping an I/O watcher does not cause an 380course). While stopping, setting and starting an I/O watcher does never
339extra syscall as with epoll, it still adds up to four event changes per 381cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
340incident, so its best to avoid that. 382two event changes per incident, support for C<fork ()> is very bad and it
383drops fds silently in similarly hard-to-detect cases.
384
385This backend usually performs well under most conditions.
386
387While nominally embeddable in other event loops, this doesn't work
388everywhere, so you might need to test for this. And since it is broken
389almost everywhere, you should only use it when you have a lot of sockets
390(for which it usually works), by embedding it into another event loop
391(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for
392sockets.
341 393
342=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 394=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
343 395
344This is not implemented yet (and might never be). 396This is not implemented yet (and might never be, unless you send me an
397implementation). According to reports, C</dev/poll> only supports sockets
398and is not embeddable, which would limit the usefulness of this backend
399immensely.
345 400
346=item C<EVBACKEND_PORT> (value 32, Solaris 10) 401=item C<EVBACKEND_PORT> (value 32, Solaris 10)
347 402
348This uses the Solaris 10 port mechanism. As with everything on Solaris, 403This uses the Solaris 10 event port mechanism. As with everything on Solaris,
349it's really slow, but it still scales very well (O(active_fds)). 404it's really slow, but it still scales very well (O(active_fds)).
350 405
351Please note that solaris ports can result in a lot of spurious 406Please note that solaris event ports can deliver a lot of spurious
352notifications, so you need to use non-blocking I/O or other means to avoid 407notifications, so you need to use non-blocking I/O or other means to avoid
353blocking when no data (or space) is available. 408blocking when no data (or space) is available.
409
410While this backend scales well, it requires one system call per active
411file descriptor per loop iteration. For small and medium numbers of file
412descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend
413might perform better.
414
415On the positive side, ignoring the spurious readyness notifications, this
416backend actually performed to specification in all tests and is fully
417embeddable, which is a rare feat among the OS-specific backends.
354 418
355=item C<EVBACKEND_ALL> 419=item C<EVBACKEND_ALL>
356 420
357Try all backends (even potentially broken ones that wouldn't be tried 421Try all backends (even potentially broken ones that wouldn't be tried
358with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as 422with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as
359C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. 423C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>.
360 424
425It is definitely not recommended to use this flag.
426
361=back 427=back
362 428
363If one or more of these are ored into the flags value, then only these 429If one or more of these are ored into the flags value, then only these
364backends will be tried (in the reverse order as given here). If none are 430backends will be tried (in the reverse order as listed here). If none are
365specified, most compiled-in backend will be tried, usually in reverse 431specified, all backends in C<ev_recommended_backends ()> will be tried.
366order of their flag values :)
367 432
368The most typical usage is like this: 433The most typical usage is like this:
369 434
370 if (!ev_default_loop (0)) 435 if (!ev_default_loop (0))
371 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 436 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
399Destroys the default loop again (frees all memory and kernel state 464Destroys the default loop again (frees all memory and kernel state
400etc.). None of the active event watchers will be stopped in the normal 465etc.). None of the active event watchers will be stopped in the normal
401sense, so e.g. C<ev_is_active> might still return true. It is your 466sense, so e.g. C<ev_is_active> might still return true. It is your
402responsibility to either stop all watchers cleanly yoursef I<before> 467responsibility to either stop all watchers cleanly yoursef I<before>
403calling this function, or cope with the fact afterwards (which is usually 468calling this function, or cope with the fact afterwards (which is usually
404the easiest thing, youc na just ignore the watchers and/or C<free ()> them 469the easiest thing, you can just ignore the watchers and/or C<free ()> them
405for example). 470for example).
471
472Note that certain global state, such as signal state, will not be freed by
473this function, and related watchers (such as signal and child watchers)
474would need to be stopped manually.
475
476In general it is not advisable to call this function except in the
477rare occasion where you really need to free e.g. the signal handling
478pipe fds. If you need dynamically allocated loops it is better to use
479C<ev_loop_new> and C<ev_loop_destroy>).
406 480
407=item ev_loop_destroy (loop) 481=item ev_loop_destroy (loop)
408 482
409Like C<ev_default_destroy>, but destroys an event loop created by an 483Like C<ev_default_destroy>, but destroys an event loop created by an
410earlier call to C<ev_loop_new>. 484earlier call to C<ev_loop_new>.
411 485
412=item ev_default_fork () 486=item ev_default_fork ()
413 487
488This function sets a flag that causes subsequent C<ev_loop> iterations
414This function reinitialises the kernel state for backends that have 489to reinitialise the kernel state for backends that have one. Despite the
415one. Despite the name, you can call it anytime, but it makes most sense 490name, you can call it anytime, but it makes most sense after forking, in
416after forking, in either the parent or child process (or both, but that 491the child process (or both child and parent, but that again makes little
417again makes little sense). 492sense). You I<must> call it in the child before using any of the libev
493functions, and it will only take effect at the next C<ev_loop> iteration.
418 494
419You I<must> call this function in the child process after forking if and 495On the other hand, you only need to call this function in the child
420only if you want to use the event library in both processes. If you just 496process if and only if you want to use the event library in the child. If
421fork+exec, you don't have to call it. 497you just fork+exec, you don't have to call it at all.
422 498
423The function itself is quite fast and it's usually not a problem to call 499The function itself is quite fast and it's usually not a problem to call
424it just in case after a fork. To make this easy, the function will fit in 500it just in case after a fork. To make this easy, the function will fit in
425quite nicely into a call to C<pthread_atfork>: 501quite nicely into a call to C<pthread_atfork>:
426 502
427 pthread_atfork (0, 0, ev_default_fork); 503 pthread_atfork (0, 0, ev_default_fork);
428
429At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use
430without calling this function, so if you force one of those backends you
431do not need to care.
432 504
433=item ev_loop_fork (loop) 505=item ev_loop_fork (loop)
434 506
435Like C<ev_default_fork>, but acts on an event loop created by 507Like C<ev_default_fork>, but acts on an event loop created by
436C<ev_loop_new>. Yes, you have to call this on every allocated event loop 508C<ev_loop_new>. Yes, you have to call this on every allocated event loop
455 527
456Returns the current "event loop time", which is the time the event loop 528Returns the current "event loop time", which is the time the event loop
457received events and started processing them. This timestamp does not 529received events and started processing them. This timestamp does not
458change as long as callbacks are being processed, and this is also the base 530change as long as callbacks are being processed, and this is also the base
459time used for relative timers. You can treat it as the timestamp of the 531time used for relative timers. You can treat it as the timestamp of the
460event occuring (or more correctly, libev finding out about it). 532event occurring (or more correctly, libev finding out about it).
461 533
462=item ev_loop (loop, int flags) 534=item ev_loop (loop, int flags)
463 535
464Finally, this is it, the event handler. This function usually is called 536Finally, this is it, the event handler. This function usually is called
465after you initialised all your watchers and you want to start handling 537after you initialised all your watchers and you want to start handling
486libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is 558libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is
487usually a better approach for this kind of thing. 559usually a better approach for this kind of thing.
488 560
489Here are the gory details of what C<ev_loop> does: 561Here are the gory details of what C<ev_loop> does:
490 562
491 * If there are no active watchers (reference count is zero), return. 563 - Before the first iteration, call any pending watchers.
492 - Queue prepare watchers and then call all outstanding watchers. 564 * If EVFLAG_FORKCHECK was used, check for a fork.
565 - If a fork was detected, queue and call all fork watchers.
566 - Queue and call all prepare watchers.
493 - If we have been forked, recreate the kernel state. 567 - If we have been forked, recreate the kernel state.
494 - Update the kernel state with all outstanding changes. 568 - Update the kernel state with all outstanding changes.
495 - Update the "event loop time". 569 - Update the "event loop time".
496 - Calculate for how long to block. 570 - Calculate for how long to sleep or block, if at all
571 (active idle watchers, EVLOOP_NONBLOCK or not having
572 any active watchers at all will result in not sleeping).
573 - Sleep if the I/O and timer collect interval say so.
497 - Block the process, waiting for any events. 574 - Block the process, waiting for any events.
498 - Queue all outstanding I/O (fd) events. 575 - Queue all outstanding I/O (fd) events.
499 - Update the "event loop time" and do time jump handling. 576 - Update the "event loop time" and do time jump handling.
500 - Queue all outstanding timers. 577 - Queue all outstanding timers.
501 - Queue all outstanding periodics. 578 - Queue all outstanding periodics.
502 - If no events are pending now, queue all idle watchers. 579 - If no events are pending now, queue all idle watchers.
503 - Queue all check watchers. 580 - Queue all check watchers.
504 - Call all queued watchers in reverse order (i.e. check watchers first). 581 - Call all queued watchers in reverse order (i.e. check watchers first).
505 Signals and child watchers are implemented as I/O watchers, and will 582 Signals and child watchers are implemented as I/O watchers, and will
506 be handled here by queueing them when their watcher gets executed. 583 be handled here by queueing them when their watcher gets executed.
507 - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK 584 - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK
508 were used, return, otherwise continue with step *. 585 were used, or there are no active watchers, return, otherwise
586 continue with step *.
509 587
510Example: Queue some jobs and then loop until no events are outsanding 588Example: Queue some jobs and then loop until no events are outstanding
511anymore. 589anymore.
512 590
513 ... queue jobs here, make sure they register event watchers as long 591 ... queue jobs here, make sure they register event watchers as long
514 ... as they still have work to do (even an idle watcher will do..) 592 ... as they still have work to do (even an idle watcher will do..)
515 ev_loop (my_loop, 0); 593 ev_loop (my_loop, 0);
519 597
520Can be used to make a call to C<ev_loop> return early (but only after it 598Can be used to make a call to C<ev_loop> return early (but only after it
521has processed all outstanding events). The C<how> argument must be either 599has processed all outstanding events). The C<how> argument must be either
522C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or 600C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or
523C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. 601C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return.
602
603This "unloop state" will be cleared when entering C<ev_loop> again.
524 604
525=item ev_ref (loop) 605=item ev_ref (loop)
526 606
527=item ev_unref (loop) 607=item ev_unref (loop)
528 608
533returning, ev_unref() after starting, and ev_ref() before stopping it. For 613returning, ev_unref() after starting, and ev_ref() before stopping it. For
534example, libev itself uses this for its internal signal pipe: It is not 614example, libev itself uses this for its internal signal pipe: It is not
535visible to the libev user and should not keep C<ev_loop> from exiting if 615visible to the libev user and should not keep C<ev_loop> from exiting if
536no event watchers registered by it are active. It is also an excellent 616no event watchers registered by it are active. It is also an excellent
537way to do this for generic recurring timers or from within third-party 617way to do this for generic recurring timers or from within third-party
538libraries. Just remember to I<unref after start> and I<ref before stop>. 618libraries. Just remember to I<unref after start> and I<ref before stop>
619(but only if the watcher wasn't active before, or was active before,
620respectively).
539 621
540Example: Create a signal watcher, but keep it from keeping C<ev_loop> 622Example: Create a signal watcher, but keep it from keeping C<ev_loop>
541running when nothing else is active. 623running when nothing else is active.
542 624
543 struct ev_signal exitsig; 625 struct ev_signal exitsig;
547 629
548Example: For some weird reason, unregister the above signal handler again. 630Example: For some weird reason, unregister the above signal handler again.
549 631
550 ev_ref (loop); 632 ev_ref (loop);
551 ev_signal_stop (loop, &exitsig); 633 ev_signal_stop (loop, &exitsig);
634
635=item ev_set_io_collect_interval (loop, ev_tstamp interval)
636
637=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
638
639These advanced functions influence the time that libev will spend waiting
640for events. Both are by default C<0>, meaning that libev will try to
641invoke timer/periodic callbacks and I/O callbacks with minimum latency.
642
643Setting these to a higher value (the C<interval> I<must> be >= C<0>)
644allows libev to delay invocation of I/O and timer/periodic callbacks to
645increase efficiency of loop iterations.
646
647The background is that sometimes your program runs just fast enough to
648handle one (or very few) event(s) per loop iteration. While this makes
649the program responsive, it also wastes a lot of CPU time to poll for new
650events, especially with backends like C<select ()> which have a high
651overhead for the actual polling but can deliver many events at once.
652
653By setting a higher I<io collect interval> you allow libev to spend more
654time collecting I/O events, so you can handle more events per iteration,
655at the cost of increasing latency. Timeouts (both C<ev_periodic> and
656C<ev_timer>) will be not affected. Setting this to a non-null value will
657introduce an additional C<ev_sleep ()> call into most loop iterations.
658
659Likewise, by setting a higher I<timeout collect interval> you allow libev
660to spend more time collecting timeouts, at the expense of increased
661latency (the watcher callback will be called later). C<ev_io> watchers
662will not be affected. Setting this to a non-null value will not introduce
663any overhead in libev.
664
665Many (busy) programs can usually benefit by setting the io collect
666interval to a value near C<0.1> or so, which is often enough for
667interactive servers (of course not for games), likewise for timeouts. It
668usually doesn't make much sense to set it to a lower value than C<0.01>,
669as this approsaches the timing granularity of most systems.
552 670
553=back 671=back
554 672
555 673
556=head1 ANATOMY OF A WATCHER 674=head1 ANATOMY OF A WATCHER
655 773
656=item C<EV_FORK> 774=item C<EV_FORK>
657 775
658The event loop has been resumed in the child process after fork (see 776The event loop has been resumed in the child process after fork (see
659C<ev_fork>). 777C<ev_fork>).
778
779=item C<EV_ASYNC>
780
781The given async watcher has been asynchronously notified (see C<ev_async>).
660 782
661=item C<EV_ERROR> 783=item C<EV_ERROR>
662 784
663An unspecified error has occured, the watcher has been stopped. This might 785An unspecified error has occured, the watcher has been stopped. This might
664happen because the watcher could not be properly started because libev 786happen because the watcher could not be properly started because libev
882In general you can register as many read and/or write event watchers per 1004In general you can register as many read and/or write event watchers per
883fd as you want (as long as you don't confuse yourself). Setting all file 1005fd as you want (as long as you don't confuse yourself). Setting all file
884descriptors to non-blocking mode is also usually a good idea (but not 1006descriptors to non-blocking mode is also usually a good idea (but not
885required if you know what you are doing). 1007required if you know what you are doing).
886 1008
887You have to be careful with dup'ed file descriptors, though. Some backends
888(the linux epoll backend is a notable example) cannot handle dup'ed file
889descriptors correctly if you register interest in two or more fds pointing
890to the same underlying file/socket/etc. description (that is, they share
891the same underlying "file open").
892
893If you must do this, then force the use of a known-to-be-good backend 1009If you must do this, then force the use of a known-to-be-good backend
894(at the time of this writing, this includes only C<EVBACKEND_SELECT> and 1010(at the time of this writing, this includes only C<EVBACKEND_SELECT> and
895C<EVBACKEND_POLL>). 1011C<EVBACKEND_POLL>).
896 1012
897Another thing you have to watch out for is that it is quite easy to 1013Another thing you have to watch out for is that it is quite easy to
907play around with an Xlib connection), then you have to seperately re-test 1023play around with an Xlib connection), then you have to seperately re-test
908whether a file descriptor is really ready with a known-to-be good interface 1024whether a file descriptor is really ready with a known-to-be good interface
909such as poll (fortunately in our Xlib example, Xlib already does this on 1025such as poll (fortunately in our Xlib example, Xlib already does this on
910its own, so its quite safe to use). 1026its own, so its quite safe to use).
911 1027
1028=head3 The special problem of disappearing file descriptors
1029
1030Some backends (e.g. kqueue, epoll) need to be told about closing a file
1031descriptor (either by calling C<close> explicitly or by any other means,
1032such as C<dup>). The reason is that you register interest in some file
1033descriptor, but when it goes away, the operating system will silently drop
1034this interest. If another file descriptor with the same number then is
1035registered with libev, there is no efficient way to see that this is, in
1036fact, a different file descriptor.
1037
1038To avoid having to explicitly tell libev about such cases, libev follows
1039the following policy: Each time C<ev_io_set> is being called, libev
1040will assume that this is potentially a new file descriptor, otherwise
1041it is assumed that the file descriptor stays the same. That means that
1042you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the
1043descriptor even if the file descriptor number itself did not change.
1044
1045This is how one would do it normally anyway, the important point is that
1046the libev application should not optimise around libev but should leave
1047optimisations to libev.
1048
1049=head3 The special problem of dup'ed file descriptors
1050
1051Some backends (e.g. epoll), cannot register events for file descriptors,
1052but only events for the underlying file descriptions. That means when you
1053have C<dup ()>'ed file descriptors or weirder constellations, and register
1054events for them, only one file descriptor might actually receive events.
1055
1056There is no workaround possible except not registering events
1057for potentially C<dup ()>'ed file descriptors, or to resort to
1058C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1059
1060=head3 The special problem of fork
1061
1062Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1063useless behaviour. Libev fully supports fork, but needs to be told about
1064it in the child.
1065
1066To support fork in your programs, you either have to call
1067C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1068enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1069C<EVBACKEND_POLL>.
1070
1071
1072=head3 Watcher-Specific Functions
1073
912=over 4 1074=over 4
913 1075
914=item ev_io_init (ev_io *, callback, int fd, int events) 1076=item ev_io_init (ev_io *, callback, int fd, int events)
915 1077
916=item ev_io_set (ev_io *, int fd, int events) 1078=item ev_io_set (ev_io *, int fd, int events)
926=item int events [read-only] 1088=item int events [read-only]
927 1089
928The events being watched. 1090The events being watched.
929 1091
930=back 1092=back
1093
1094=head3 Examples
931 1095
932Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1096Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
933readable, but only once. Since it is likely line-buffered, you could 1097readable, but only once. Since it is likely line-buffered, you could
934attempt to read a whole line in the callback. 1098attempt to read a whole line in the callback.
935 1099
968 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 1132 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.);
969 1133
970The callback is guarenteed to be invoked only when its timeout has passed, 1134The callback is guarenteed to be invoked only when its timeout has passed,
971but if multiple timers become ready during the same loop iteration then 1135but if multiple timers become ready during the same loop iteration then
972order of execution is undefined. 1136order of execution is undefined.
1137
1138=head3 Watcher-Specific Functions and Data Members
973 1139
974=over 4 1140=over 4
975 1141
976=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1142=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
977 1143
1031or C<ev_timer_again> is called and determines the next timeout (if any), 1197or C<ev_timer_again> is called and determines the next timeout (if any),
1032which is also when any modifications are taken into account. 1198which is also when any modifications are taken into account.
1033 1199
1034=back 1200=back
1035 1201
1202=head3 Examples
1203
1036Example: Create a timer that fires after 60 seconds. 1204Example: Create a timer that fires after 60 seconds.
1037 1205
1038 static void 1206 static void
1039 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1207 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents)
1040 { 1208 {
1073but on wallclock time (absolute time). You can tell a periodic watcher 1241but on wallclock time (absolute time). You can tell a periodic watcher
1074to trigger "at" some specific point in time. For example, if you tell a 1242to trigger "at" some specific point in time. For example, if you tell a
1075periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () 1243periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now ()
1076+ 10.>) and then reset your system clock to the last year, then it will 1244+ 10.>) and then reset your system clock to the last year, then it will
1077take a year to trigger the event (unlike an C<ev_timer>, which would trigger 1245take a year to trigger the event (unlike an C<ev_timer>, which would trigger
1078roughly 10 seconds later and of course not if you reset your system time 1246roughly 10 seconds later).
1079again).
1080 1247
1081They can also be used to implement vastly more complex timers, such as 1248They can also be used to implement vastly more complex timers, such as
1082triggering an event on eahc midnight, local time. 1249triggering an event on each midnight, local time or other, complicated,
1250rules.
1083 1251
1084As with timers, the callback is guarenteed to be invoked only when the 1252As with timers, the callback is guarenteed to be invoked only when the
1085time (C<at>) has been passed, but if multiple periodic timers become ready 1253time (C<at>) has been passed, but if multiple periodic timers become ready
1086during the same loop iteration then order of execution is undefined. 1254during the same loop iteration then order of execution is undefined.
1087 1255
1256=head3 Watcher-Specific Functions and Data Members
1257
1088=over 4 1258=over 4
1089 1259
1090=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) 1260=item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb)
1091 1261
1092=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) 1262=item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb)
1094Lots of arguments, lets sort it out... There are basically three modes of 1264Lots of arguments, lets sort it out... There are basically three modes of
1095operation, and we will explain them from simplest to complex: 1265operation, and we will explain them from simplest to complex:
1096 1266
1097=over 4 1267=over 4
1098 1268
1099=item * absolute timer (interval = reschedule_cb = 0) 1269=item * absolute timer (at = time, interval = reschedule_cb = 0)
1100 1270
1101In this configuration the watcher triggers an event at the wallclock time 1271In this configuration the watcher triggers an event at the wallclock time
1102C<at> and doesn't repeat. It will not adjust when a time jump occurs, 1272C<at> and doesn't repeat. It will not adjust when a time jump occurs,
1103that is, if it is to be run at January 1st 2011 then it will run when the 1273that is, if it is to be run at January 1st 2011 then it will run when the
1104system time reaches or surpasses this time. 1274system time reaches or surpasses this time.
1105 1275
1106=item * non-repeating interval timer (interval > 0, reschedule_cb = 0) 1276=item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0)
1107 1277
1108In this mode the watcher will always be scheduled to time out at the next 1278In this mode the watcher will always be scheduled to time out at the next
1109C<at + N * interval> time (for some integer N) and then repeat, regardless 1279C<at + N * interval> time (for some integer N, which can also be negative)
1110of any time jumps. 1280and then repeat, regardless of any time jumps.
1111 1281
1112This can be used to create timers that do not drift with respect to system 1282This can be used to create timers that do not drift with respect to system
1113time: 1283time:
1114 1284
1115 ev_periodic_set (&periodic, 0., 3600., 0); 1285 ev_periodic_set (&periodic, 0., 3600., 0);
1121 1291
1122Another way to think about it (for the mathematically inclined) is that 1292Another way to think about it (for the mathematically inclined) is that
1123C<ev_periodic> will try to run the callback in this mode at the next possible 1293C<ev_periodic> will try to run the callback in this mode at the next possible
1124time where C<time = at (mod interval)>, regardless of any time jumps. 1294time where C<time = at (mod interval)>, regardless of any time jumps.
1125 1295
1296For numerical stability it is preferable that the C<at> value is near
1297C<ev_now ()> (the current time), but there is no range requirement for
1298this value.
1299
1126=item * manual reschedule mode (reschedule_cb = callback) 1300=item * manual reschedule mode (at and interval ignored, reschedule_cb = callback)
1127 1301
1128In this mode the values for C<interval> and C<at> are both being 1302In this mode the values for C<interval> and C<at> are both being
1129ignored. Instead, each time the periodic watcher gets scheduled, the 1303ignored. Instead, each time the periodic watcher gets scheduled, the
1130reschedule callback will be called with the watcher as first, and the 1304reschedule callback will be called with the watcher as first, and the
1131current time as second argument. 1305current time as second argument.
1132 1306
1133NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, 1307NOTE: I<This callback MUST NOT stop or destroy any periodic watcher,
1134ever, or make any event loop modifications>. If you need to stop it, 1308ever, or make any event loop modifications>. If you need to stop it,
1135return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by 1309return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by
1136starting a prepare watcher). 1310starting an C<ev_prepare> watcher, which is legal).
1137 1311
1138Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, 1312Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w,
1139ev_tstamp now)>, e.g.: 1313ev_tstamp now)>, e.g.:
1140 1314
1141 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1315 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now)
1164Simply stops and restarts the periodic watcher again. This is only useful 1338Simply stops and restarts the periodic watcher again. This is only useful
1165when you changed some parameters or the reschedule callback would return 1339when you changed some parameters or the reschedule callback would return
1166a different time than the last time it was called (e.g. in a crond like 1340a different time than the last time it was called (e.g. in a crond like
1167program when the crontabs have changed). 1341program when the crontabs have changed).
1168 1342
1343=item ev_tstamp offset [read-write]
1344
1345When repeating, this contains the offset value, otherwise this is the
1346absolute point in time (the C<at> value passed to C<ev_periodic_set>).
1347
1348Can be modified any time, but changes only take effect when the periodic
1349timer fires or C<ev_periodic_again> is being called.
1350
1169=item ev_tstamp interval [read-write] 1351=item ev_tstamp interval [read-write]
1170 1352
1171The current interval value. Can be modified any time, but changes only 1353The current interval value. Can be modified any time, but changes only
1172take effect when the periodic timer fires or C<ev_periodic_again> is being 1354take effect when the periodic timer fires or C<ev_periodic_again> is being
1173called. 1355called.
1176 1358
1177The current reschedule callback, or C<0>, if this functionality is 1359The current reschedule callback, or C<0>, if this functionality is
1178switched off. Can be changed any time, but changes only take effect when 1360switched off. Can be changed any time, but changes only take effect when
1179the periodic timer fires or C<ev_periodic_again> is being called. 1361the periodic timer fires or C<ev_periodic_again> is being called.
1180 1362
1363=item ev_tstamp at [read-only]
1364
1365When active, contains the absolute time that the watcher is supposed to
1366trigger next.
1367
1181=back 1368=back
1369
1370=head3 Examples
1182 1371
1183Example: Call a callback every hour, or, more precisely, whenever the 1372Example: Call a callback every hour, or, more precisely, whenever the
1184system clock is divisible by 3600. The callback invocation times have 1373system clock is divisible by 3600. The callback invocation times have
1185potentially a lot of jittering, but good long-term stability. 1374potentially a lot of jittering, but good long-term stability.
1186 1375
1226with the kernel (thus it coexists with your own signal handlers as long 1415with the kernel (thus it coexists with your own signal handlers as long
1227as you don't register any with libev). Similarly, when the last signal 1416as you don't register any with libev). Similarly, when the last signal
1228watcher for a signal is stopped libev will reset the signal handler to 1417watcher for a signal is stopped libev will reset the signal handler to
1229SIG_DFL (regardless of what it was set to before). 1418SIG_DFL (regardless of what it was set to before).
1230 1419
1420=head3 Watcher-Specific Functions and Data Members
1421
1231=over 4 1422=over 4
1232 1423
1233=item ev_signal_init (ev_signal *, callback, int signum) 1424=item ev_signal_init (ev_signal *, callback, int signum)
1234 1425
1235=item ev_signal_set (ev_signal *, int signum) 1426=item ev_signal_set (ev_signal *, int signum)
1247=head2 C<ev_child> - watch out for process status changes 1438=head2 C<ev_child> - watch out for process status changes
1248 1439
1249Child watchers trigger when your process receives a SIGCHLD in response to 1440Child watchers trigger when your process receives a SIGCHLD in response to
1250some child status changes (most typically when a child of yours dies). 1441some child status changes (most typically when a child of yours dies).
1251 1442
1443=head3 Watcher-Specific Functions and Data Members
1444
1252=over 4 1445=over 4
1253 1446
1254=item ev_child_init (ev_child *, callback, int pid) 1447=item ev_child_init (ev_child *, callback, int pid, int trace)
1255 1448
1256=item ev_child_set (ev_child *, int pid) 1449=item ev_child_set (ev_child *, int pid, int trace)
1257 1450
1258Configures the watcher to wait for status changes of process C<pid> (or 1451Configures the watcher to wait for status changes of process C<pid> (or
1259I<any> process if C<pid> is specified as C<0>). The callback can look 1452I<any> process if C<pid> is specified as C<0>). The callback can look
1260at the C<rstatus> member of the C<ev_child> watcher structure to see 1453at the C<rstatus> member of the C<ev_child> watcher structure to see
1261the status word (use the macros from C<sys/wait.h> and see your systems 1454the status word (use the macros from C<sys/wait.h> and see your systems
1262C<waitpid> documentation). The C<rpid> member contains the pid of the 1455C<waitpid> documentation). The C<rpid> member contains the pid of the
1263process causing the status change. 1456process causing the status change. C<trace> must be either C<0> (only
1457activate the watcher when the process terminates) or C<1> (additionally
1458activate the watcher when the process is stopped or continued).
1264 1459
1265=item int pid [read-only] 1460=item int pid [read-only]
1266 1461
1267The process id this watcher watches out for, or C<0>, meaning any process id. 1462The process id this watcher watches out for, or C<0>, meaning any process id.
1268 1463
1274 1469
1275The process exit/trace status caused by C<rpid> (see your systems 1470The process exit/trace status caused by C<rpid> (see your systems
1276C<waitpid> and C<sys/wait.h> documentation for details). 1471C<waitpid> and C<sys/wait.h> documentation for details).
1277 1472
1278=back 1473=back
1474
1475=head3 Examples
1279 1476
1280Example: Try to exit cleanly on SIGINT and SIGTERM. 1477Example: Try to exit cleanly on SIGINT and SIGTERM.
1281 1478
1282 static void 1479 static void
1283 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1480 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents)
1324semantics of C<ev_stat> watchers, which means that libev sometimes needs 1521semantics of C<ev_stat> watchers, which means that libev sometimes needs
1325to fall back to regular polling again even with inotify, but changes are 1522to fall back to regular polling again even with inotify, but changes are
1326usually detected immediately, and if the file exists there will be no 1523usually detected immediately, and if the file exists there will be no
1327polling. 1524polling.
1328 1525
1526=head3 Inotify
1527
1528When C<inotify (7)> support has been compiled into libev (generally only
1529available on Linux) and present at runtime, it will be used to speed up
1530change detection where possible. The inotify descriptor will be created lazily
1531when the first C<ev_stat> watcher is being started.
1532
1533Inotify presense does not change the semantics of C<ev_stat> watchers
1534except that changes might be detected earlier, and in some cases, to avoid
1535making regular C<stat> calls. Even in the presense of inotify support
1536there are many cases where libev has to resort to regular C<stat> polling.
1537
1538(There is no support for kqueue, as apparently it cannot be used to
1539implement this functionality, due to the requirement of having a file
1540descriptor open on the object at all times).
1541
1542=head3 The special problem of stat time resolution
1543
1544The C<stat ()> syscall only supports full-second resolution portably, and
1545even on systems where the resolution is higher, many filesystems still
1546only support whole seconds.
1547
1548That means that, if the time is the only thing that changes, you might
1549miss updates: on the first update, C<ev_stat> detects a change and calls
1550your callback, which does something. When there is another update within
1551the same second, C<ev_stat> will be unable to detect it.
1552
1553The solution to this is to delay acting on a change for a second (or till
1554the next second boundary), using a roughly one-second delay C<ev_timer>
1555(C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01>
1556is added to work around small timing inconsistencies of some operating
1557systems.
1558
1559=head3 Watcher-Specific Functions and Data Members
1560
1329=over 4 1561=over 4
1330 1562
1331=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) 1563=item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval)
1332 1564
1333=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval) 1565=item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval)
1368=item const char *path [read-only] 1600=item const char *path [read-only]
1369 1601
1370The filesystem path that is being watched. 1602The filesystem path that is being watched.
1371 1603
1372=back 1604=back
1605
1606=head3 Examples
1373 1607
1374Example: Watch C</etc/passwd> for attribute changes. 1608Example: Watch C</etc/passwd> for attribute changes.
1375 1609
1376 static void 1610 static void
1377 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) 1611 passwd_cb (struct ev_loop *loop, ev_stat *w, int revents)
1390 } 1624 }
1391 1625
1392 ... 1626 ...
1393 ev_stat passwd; 1627 ev_stat passwd;
1394 1628
1395 ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); 1629 ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.);
1396 ev_stat_start (loop, &passwd); 1630 ev_stat_start (loop, &passwd);
1631
1632Example: Like above, but additionally use a one-second delay so we do not
1633miss updates (however, frequent updates will delay processing, too, so
1634one might do the work both on C<ev_stat> callback invocation I<and> on
1635C<ev_timer> callback invocation).
1636
1637 static ev_stat passwd;
1638 static ev_timer timer;
1639
1640 static void
1641 timer_cb (EV_P_ ev_timer *w, int revents)
1642 {
1643 ev_timer_stop (EV_A_ w);
1644
1645 /* now it's one second after the most recent passwd change */
1646 }
1647
1648 static void
1649 stat_cb (EV_P_ ev_stat *w, int revents)
1650 {
1651 /* reset the one-second timer */
1652 ev_timer_again (EV_A_ &timer);
1653 }
1654
1655 ...
1656 ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.);
1657 ev_stat_start (loop, &passwd);
1658 ev_timer_init (&timer, timer_cb, 0., 1.01);
1397 1659
1398 1660
1399=head2 C<ev_idle> - when you've got nothing better to do... 1661=head2 C<ev_idle> - when you've got nothing better to do...
1400 1662
1401Idle watchers trigger events when no other events of the same or higher 1663Idle watchers trigger events when no other events of the same or higher
1415Apart from keeping your process non-blocking (which is a useful 1677Apart from keeping your process non-blocking (which is a useful
1416effect on its own sometimes), idle watchers are a good place to do 1678effect on its own sometimes), idle watchers are a good place to do
1417"pseudo-background processing", or delay processing stuff to after the 1679"pseudo-background processing", or delay processing stuff to after the
1418event loop has handled all outstanding events. 1680event loop has handled all outstanding events.
1419 1681
1682=head3 Watcher-Specific Functions and Data Members
1683
1420=over 4 1684=over 4
1421 1685
1422=item ev_idle_init (ev_signal *, callback) 1686=item ev_idle_init (ev_signal *, callback)
1423 1687
1424Initialises and configures the idle watcher - it has no parameters of any 1688Initialises and configures the idle watcher - it has no parameters of any
1425kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, 1689kind. There is a C<ev_idle_set> macro, but using it is utterly pointless,
1426believe me. 1690believe me.
1427 1691
1428=back 1692=back
1693
1694=head3 Examples
1429 1695
1430Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 1696Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1431callback, free it. Also, use no error checking, as usual. 1697callback, free it. Also, use no error checking, as usual.
1432 1698
1433 static void 1699 static void
1434 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 1700 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents)
1435 { 1701 {
1436 free (w); 1702 free (w);
1437 // now do something you wanted to do when the program has 1703 // now do something you wanted to do when the program has
1438 // no longer asnything immediate to do. 1704 // no longer anything immediate to do.
1439 } 1705 }
1440 1706
1441 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); 1707 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle));
1442 ev_idle_init (idle_watcher, idle_cb); 1708 ev_idle_init (idle_watcher, idle_cb);
1443 ev_idle_start (loop, idle_cb); 1709 ev_idle_start (loop, idle_cb);
1481with priority higher than or equal to the event loop and one coroutine 1747with priority higher than or equal to the event loop and one coroutine
1482of lower priority, but only once, using idle watchers to keep the event 1748of lower priority, but only once, using idle watchers to keep the event
1483loop from blocking if lower-priority coroutines are active, thus mapping 1749loop from blocking if lower-priority coroutines are active, thus mapping
1484low-priority coroutines to idle/background tasks). 1750low-priority coroutines to idle/background tasks).
1485 1751
1752It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1753priority, to ensure that they are being run before any other watchers
1754after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1755too) should not activate ("feed") events into libev. While libev fully
1756supports this, they will be called before other C<ev_check> watchers
1757did their job. As C<ev_check> watchers are often used to embed other
1758(non-libev) event loops those other event loops might be in an unusable
1759state until their C<ev_check> watcher ran (always remind yourself to
1760coexist peacefully with others).
1761
1762=head3 Watcher-Specific Functions and Data Members
1763
1486=over 4 1764=over 4
1487 1765
1488=item ev_prepare_init (ev_prepare *, callback) 1766=item ev_prepare_init (ev_prepare *, callback)
1489 1767
1490=item ev_check_init (ev_check *, callback) 1768=item ev_check_init (ev_check *, callback)
1492Initialises and configures the prepare or check watcher - they have no 1770Initialises and configures the prepare or check watcher - they have no
1493parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> 1771parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set>
1494macros, but using them is utterly, utterly and completely pointless. 1772macros, but using them is utterly, utterly and completely pointless.
1495 1773
1496=back 1774=back
1775
1776=head3 Examples
1497 1777
1498There are a number of principal ways to embed other event loops or modules 1778There are a number of principal ways to embed other event loops or modules
1499into libev. Here are some ideas on how to include libadns into libev 1779into libev. Here are some ideas on how to include libadns into libev
1500(there is a Perl module named C<EV::ADNS> that does this, which you could 1780(there is a Perl module named C<EV::ADNS> that does this, which you could
1501use for an actually working example. Another Perl module named C<EV::Glib> 1781use for an actually working example. Another Perl module named C<EV::Glib>
1670portable one. 1950portable one.
1671 1951
1672So when you want to use this feature you will always have to be prepared 1952So when you want to use this feature you will always have to be prepared
1673that you cannot get an embeddable loop. The recommended way to get around 1953that you cannot get an embeddable loop. The recommended way to get around
1674this is to have a separate variables for your embeddable loop, try to 1954this is to have a separate variables for your embeddable loop, try to
1675create it, and if that fails, use the normal loop for everything: 1955create it, and if that fails, use the normal loop for everything.
1956
1957=head3 Watcher-Specific Functions and Data Members
1958
1959=over 4
1960
1961=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1962
1963=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop)
1964
1965Configures the watcher to embed the given loop, which must be
1966embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1967invoked automatically, otherwise it is the responsibility of the callback
1968to invoke it (it will continue to be called until the sweep has been done,
1969if you do not want thta, you need to temporarily stop the embed watcher).
1970
1971=item ev_embed_sweep (loop, ev_embed *)
1972
1973Make a single, non-blocking sweep over the embedded loop. This works
1974similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1975apropriate way for embedded loops.
1976
1977=item struct ev_loop *other [read-only]
1978
1979The embedded event loop.
1980
1981=back
1982
1983=head3 Examples
1984
1985Example: Try to get an embeddable event loop and embed it into the default
1986event loop. If that is not possible, use the default loop. The default
1987loop is stored in C<loop_hi>, while the mebeddable loop is stored in
1988C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be
1989used).
1676 1990
1677 struct ev_loop *loop_hi = ev_default_init (0); 1991 struct ev_loop *loop_hi = ev_default_init (0);
1678 struct ev_loop *loop_lo = 0; 1992 struct ev_loop *loop_lo = 0;
1679 struct ev_embed embed; 1993 struct ev_embed embed;
1680 1994
1691 ev_embed_start (loop_hi, &embed); 2005 ev_embed_start (loop_hi, &embed);
1692 } 2006 }
1693 else 2007 else
1694 loop_lo = loop_hi; 2008 loop_lo = loop_hi;
1695 2009
1696=over 4 2010Example: Check if kqueue is available but not recommended and create
2011a kqueue backend for use with sockets (which usually work with any
2012kqueue implementation). Store the kqueue/socket-only event loop in
2013C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
1697 2014
1698=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 2015 struct ev_loop *loop = ev_default_init (0);
2016 struct ev_loop *loop_socket = 0;
2017 struct ev_embed embed;
2018
2019 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2020 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2021 {
2022 ev_embed_init (&embed, 0, loop_socket);
2023 ev_embed_start (loop, &embed);
2024 }
1699 2025
1700=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 2026 if (!loop_socket)
2027 loop_socket = loop;
1701 2028
1702Configures the watcher to embed the given loop, which must be 2029 // now use loop_socket for all sockets, and loop for everything else
1703embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
1704invoked automatically, otherwise it is the responsibility of the callback
1705to invoke it (it will continue to be called until the sweep has been done,
1706if you do not want thta, you need to temporarily stop the embed watcher).
1707
1708=item ev_embed_sweep (loop, ev_embed *)
1709
1710Make a single, non-blocking sweep over the embedded loop. This works
1711similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1712apropriate way for embedded loops.
1713
1714=item struct ev_loop *loop [read-only]
1715
1716The embedded event loop.
1717
1718=back
1719 2030
1720 2031
1721=head2 C<ev_fork> - the audacity to resume the event loop after a fork 2032=head2 C<ev_fork> - the audacity to resume the event loop after a fork
1722 2033
1723Fork watchers are called when a C<fork ()> was detected (usually because 2034Fork watchers are called when a C<fork ()> was detected (usually because
1726event loop blocks next and before C<ev_check> watchers are being called, 2037event loop blocks next and before C<ev_check> watchers are being called,
1727and only in the child after the fork. If whoever good citizen calling 2038and only in the child after the fork. If whoever good citizen calling
1728C<ev_default_fork> cheats and calls it in the wrong process, the fork 2039C<ev_default_fork> cheats and calls it in the wrong process, the fork
1729handlers will be invoked, too, of course. 2040handlers will be invoked, too, of course.
1730 2041
2042=head3 Watcher-Specific Functions and Data Members
2043
1731=over 4 2044=over 4
1732 2045
1733=item ev_fork_init (ev_signal *, callback) 2046=item ev_fork_init (ev_signal *, callback)
1734 2047
1735Initialises and configures the fork watcher - it has no parameters of any 2048Initialises and configures the fork watcher - it has no parameters of any
1736kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, 2049kind. There is a C<ev_fork_set> macro, but using it is utterly pointless,
1737believe me. 2050believe me.
2051
2052=back
2053
2054
2055=head2 C<ev_async> - how to wake up another event loop
2056
2057In general, you cannot use an C<ev_loop> from multiple threads or other
2058asynchronous sources such as signal handlers (as opposed to multiple event
2059loops - those are of course safe to use in different threads).
2060
2061Sometimes, however, you need to wake up another event loop you do not
2062control, for example because it belongs to another thread. This is what
2063C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you
2064can signal it by calling C<ev_async_send>, which is thread- and signal
2065safe.
2066
2067This functionality is very similar to C<ev_signal> watchers, as signals,
2068too, are asynchronous in nature, and signals, too, will be compressed
2069(i.e. the number of callback invocations may be less than the number of
2070C<ev_async_sent> calls).
2071
2072Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not
2073just the default loop.
2074
2075=head3 Queueing
2076
2077C<ev_async> does not support queueing of data in any way. The reason
2078is that the author does not know of a simple (or any) algorithm for a
2079multiple-writer-single-reader queue that works in all cases and doesn't
2080need elaborate support such as pthreads.
2081
2082That means that if you want to queue data, you have to provide your own
2083queue. But at least I can tell you would implement locking around your
2084queue:
2085
2086=over 4
2087
2088=item queueing from a signal handler context
2089
2090To implement race-free queueing, you simply add to the queue in the signal
2091handler but you block the signal handler in the watcher callback. Here is an example that does that for
2092some fictitiuous SIGUSR1 handler:
2093
2094 static ev_async mysig;
2095
2096 static void
2097 sigusr1_handler (void)
2098 {
2099 sometype data;
2100
2101 // no locking etc.
2102 queue_put (data);
2103 ev_async_send (DEFAULT_ &mysig);
2104 }
2105
2106 static void
2107 mysig_cb (EV_P_ ev_async *w, int revents)
2108 {
2109 sometype data;
2110 sigset_t block, prev;
2111
2112 sigemptyset (&block);
2113 sigaddset (&block, SIGUSR1);
2114 sigprocmask (SIG_BLOCK, &block, &prev);
2115
2116 while (queue_get (&data))
2117 process (data);
2118
2119 if (sigismember (&prev, SIGUSR1)
2120 sigprocmask (SIG_UNBLOCK, &block, 0);
2121 }
2122
2123(Note: pthreads in theory requires you to use C<pthread_setmask>
2124instead of C<sigprocmask> when you use threads, but libev doesn't do it
2125either...).
2126
2127=item queueing from a thread context
2128
2129The strategy for threads is different, as you cannot (easily) block
2130threads but you can easily preempt them, so to queue safely you need to
2131employ a traditional mutex lock, such as in this pthread example:
2132
2133 static ev_async mysig;
2134 static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER;
2135
2136 static void
2137 otherthread (void)
2138 {
2139 // only need to lock the actual queueing operation
2140 pthread_mutex_lock (&mymutex);
2141 queue_put (data);
2142 pthread_mutex_unlock (&mymutex);
2143
2144 ev_async_send (DEFAULT_ &mysig);
2145 }
2146
2147 static void
2148 mysig_cb (EV_P_ ev_async *w, int revents)
2149 {
2150 pthread_mutex_lock (&mymutex);
2151
2152 while (queue_get (&data))
2153 process (data);
2154
2155 pthread_mutex_unlock (&mymutex);
2156 }
2157
2158=back
2159
2160
2161=head3 Watcher-Specific Functions and Data Members
2162
2163=over 4
2164
2165=item ev_async_init (ev_async *, callback)
2166
2167Initialises and configures the async watcher - it has no parameters of any
2168kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless,
2169believe me.
2170
2171=item ev_async_send (loop, ev_async *)
2172
2173Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2174an C<EV_ASYNC> event on the watcher into the event loop. Unlike
2175C<ev_feed_event>, this call is safe to do in other threads, signal or
2176similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding
2177section below on what exactly this means).
2178
2179This call incurs the overhead of a syscall only once per loop iteration,
2180so while the overhead might be noticable, it doesn't apply to repeated
2181calls to C<ev_async_send>.
1738 2182
1739=back 2183=back
1740 2184
1741 2185
1742=head1 OTHER FUNCTIONS 2186=head1 OTHER FUNCTIONS
1951 2395
1952=item w->stop () 2396=item w->stop ()
1953 2397
1954Stops the watcher if it is active. Again, no C<loop> argument. 2398Stops the watcher if it is active. Again, no C<loop> argument.
1955 2399
1956=item w->again () C<ev::timer>, C<ev::periodic> only 2400=item w->again () (C<ev::timer>, C<ev::periodic> only)
1957 2401
1958For C<ev::timer> and C<ev::periodic>, this invokes the corresponding 2402For C<ev::timer> and C<ev::periodic>, this invokes the corresponding
1959C<ev_TYPE_again> function. 2403C<ev_TYPE_again> function.
1960 2404
1961=item w->sweep () C<ev::embed> only 2405=item w->sweep () (C<ev::embed> only)
1962 2406
1963Invokes C<ev_embed_sweep>. 2407Invokes C<ev_embed_sweep>.
1964 2408
1965=item w->update () C<ev::stat> only 2409=item w->update () (C<ev::stat> only)
1966 2410
1967Invokes C<ev_stat_stat>. 2411Invokes C<ev_stat_stat>.
1968 2412
1969=back 2413=back
1970 2414
1973Example: Define a class with an IO and idle watcher, start one of them in 2417Example: Define a class with an IO and idle watcher, start one of them in
1974the constructor. 2418the constructor.
1975 2419
1976 class myclass 2420 class myclass
1977 { 2421 {
1978 ev_io io; void io_cb (ev::io &w, int revents); 2422 ev::io io; void io_cb (ev::io &w, int revents);
1979 ev_idle idle void idle_cb (ev::idle &w, int revents); 2423 ev:idle idle void idle_cb (ev::idle &w, int revents);
1980 2424
1981 myclass (); 2425 myclass (int fd)
1982 }
1983
1984 myclass::myclass (int fd)
1985 { 2426 {
1986 io .set <myclass, &myclass::io_cb > (this); 2427 io .set <myclass, &myclass::io_cb > (this);
1987 idle.set <myclass, &myclass::idle_cb> (this); 2428 idle.set <myclass, &myclass::idle_cb> (this);
1988 2429
1989 io.start (fd, ev::READ); 2430 io.start (fd, ev::READ);
2431 }
1990 } 2432 };
1991 2433
1992 2434
1993=head1 MACRO MAGIC 2435=head1 MACRO MAGIC
1994 2436
1995Libev can be compiled with a variety of options, the most fundemantal is 2437Libev can be compiled with a variety of options, the most fundamantal
1996C<EV_MULTIPLICITY>. This option determines whether (most) functions and 2438of which is C<EV_MULTIPLICITY>. This option determines whether (most)
1997callbacks have an initial C<struct ev_loop *> argument. 2439functions and callbacks have an initial C<struct ev_loop *> argument.
1998 2440
1999To make it easier to write programs that cope with either variant, the 2441To make it easier to write programs that cope with either variant, the
2000following macros are defined: 2442following macros are defined:
2001 2443
2002=over 4 2444=over 4
2056Libev can (and often is) directly embedded into host 2498Libev can (and often is) directly embedded into host
2057applications. Examples of applications that embed it include the Deliantra 2499applications. Examples of applications that embed it include the Deliantra
2058Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2500Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2059and rxvt-unicode. 2501and rxvt-unicode.
2060 2502
2061The goal is to enable you to just copy the neecssary files into your 2503The goal is to enable you to just copy the necessary files into your
2062source directory without having to change even a single line in them, so 2504source directory without having to change even a single line in them, so
2063you can easily upgrade by simply copying (or having a checked-out copy of 2505you can easily upgrade by simply copying (or having a checked-out copy of
2064libev somewhere in your source tree). 2506libev somewhere in your source tree).
2065 2507
2066=head2 FILESETS 2508=head2 FILESETS
2156 2598
2157If defined to be C<1>, libev will try to detect the availability of the 2599If defined to be C<1>, libev will try to detect the availability of the
2158monotonic clock option at both compiletime and runtime. Otherwise no use 2600monotonic clock option at both compiletime and runtime. Otherwise no use
2159of the monotonic clock option will be attempted. If you enable this, you 2601of the monotonic clock option will be attempted. If you enable this, you
2160usually have to link against librt or something similar. Enabling it when 2602usually have to link against librt or something similar. Enabling it when
2161the functionality isn't available is safe, though, althoguh you have 2603the functionality isn't available is safe, though, although you have
2162to make sure you link against any libraries where the C<clock_gettime> 2604to make sure you link against any libraries where the C<clock_gettime>
2163function is hiding in (often F<-lrt>). 2605function is hiding in (often F<-lrt>).
2164 2606
2165=item EV_USE_REALTIME 2607=item EV_USE_REALTIME
2166 2608
2167If defined to be C<1>, libev will try to detect the availability of the 2609If defined to be C<1>, libev will try to detect the availability of the
2168realtime clock option at compiletime (and assume its availability at 2610realtime clock option at compiletime (and assume its availability at
2169runtime if successful). Otherwise no use of the realtime clock option will 2611runtime if successful). Otherwise no use of the realtime clock option will
2170be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2612be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2171(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2613(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2172in the description of C<EV_USE_MONOTONIC>, though. 2614note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2615
2616=item EV_USE_NANOSLEEP
2617
2618If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2619and will use it for delays. Otherwise it will use C<select ()>.
2173 2620
2174=item EV_USE_SELECT 2621=item EV_USE_SELECT
2175 2622
2176If undefined or defined to be C<1>, libev will compile in support for the 2623If undefined or defined to be C<1>, libev will compile in support for the
2177C<select>(2) backend. No attempt at autodetection will be done: if no 2624C<select>(2) backend. No attempt at autodetection will be done: if no
2195wants osf handles on win32 (this is the case when the select to 2642wants osf handles on win32 (this is the case when the select to
2196be used is the winsock select). This means that it will call 2643be used is the winsock select). This means that it will call
2197C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 2644C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
2198it is assumed that all these functions actually work on fds, even 2645it is assumed that all these functions actually work on fds, even
2199on win32. Should not be defined on non-win32 platforms. 2646on win32. Should not be defined on non-win32 platforms.
2647
2648=item EV_FD_TO_WIN32_HANDLE
2649
2650If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
2651file descriptors to socket handles. When not defining this symbol (the
2652default), then libev will call C<_get_osfhandle>, which is usually
2653correct. In some cases, programs use their own file descriptor management,
2654in which case they can provide this function to map fds to socket handles.
2200 2655
2201=item EV_USE_POLL 2656=item EV_USE_POLL
2202 2657
2203If defined to be C<1>, libev will compile in support for the C<poll>(2) 2658If defined to be C<1>, libev will compile in support for the C<poll>(2)
2204backend. Otherwise it will be enabled on non-win32 platforms. It 2659backend. Otherwise it will be enabled on non-win32 platforms. It
2238 2693
2239If defined to be C<1>, libev will compile in support for the Linux inotify 2694If defined to be C<1>, libev will compile in support for the Linux inotify
2240interface to speed up C<ev_stat> watchers. Its actual availability will 2695interface to speed up C<ev_stat> watchers. Its actual availability will
2241be detected at runtime. 2696be detected at runtime.
2242 2697
2698=item EV_ATOMIC_T
2699
2700Libev requires an integer type (suitable for storing C<0> or C<1>) whose
2701access is atomic with respect to other threads or signal contexts. No such
2702type is easily found in the C language, so you can provide your own type
2703that you know is safe for your purposes. It is used both for signal handler "locking"
2704as well as for signal and thread safety in C<ev_async> watchers.
2705
2706In the absense of this define, libev will use C<sig_atomic_t volatile>
2707(from F<signal.h>), which is usually good enough on most platforms.
2708
2243=item EV_H 2709=item EV_H
2244 2710
2245The name of the F<ev.h> header file used to include it. The default if 2711The name of the F<ev.h> header file used to include it. The default if
2246undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This 2712undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
2247can be used to virtually rename the F<ev.h> header file in case of conflicts. 2713used to virtually rename the F<ev.h> header file in case of conflicts.
2248 2714
2249=item EV_CONFIG_H 2715=item EV_CONFIG_H
2250 2716
2251If C<EV_STANDALONE> isn't C<1>, this variable can be used to override 2717If C<EV_STANDALONE> isn't C<1>, this variable can be used to override
2252F<ev.c>'s idea of where to find the F<config.h> file, similarly to 2718F<ev.c>'s idea of where to find the F<config.h> file, similarly to
2253C<EV_H>, above. 2719C<EV_H>, above.
2254 2720
2255=item EV_EVENT_H 2721=item EV_EVENT_H
2256 2722
2257Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea 2723Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea
2258of how the F<event.h> header can be found. 2724of how the F<event.h> header can be found, the default is C<"event.h">.
2259 2725
2260=item EV_PROTOTYPES 2726=item EV_PROTOTYPES
2261 2727
2262If defined to be C<0>, then F<ev.h> will not define any function 2728If defined to be C<0>, then F<ev.h> will not define any function
2263prototypes, but still define all the structs and other symbols. This is 2729prototypes, but still define all the structs and other symbols. This is
2314=item EV_FORK_ENABLE 2780=item EV_FORK_ENABLE
2315 2781
2316If undefined or defined to be C<1>, then fork watchers are supported. If 2782If undefined or defined to be C<1>, then fork watchers are supported. If
2317defined to be C<0>, then they are not. 2783defined to be C<0>, then they are not.
2318 2784
2785=item EV_ASYNC_ENABLE
2786
2787If undefined or defined to be C<1>, then async watchers are supported. If
2788defined to be C<0>, then they are not.
2789
2319=item EV_MINIMAL 2790=item EV_MINIMAL
2320 2791
2321If you need to shave off some kilobytes of code at the expense of some 2792If you need to shave off some kilobytes of code at the expense of some
2322speed, define this symbol to C<1>. Currently only used for gcc to override 2793speed, define this symbol to C<1>. Currently only used for gcc to override
2323some inlining decisions, saves roughly 30% codesize of amd64. 2794some inlining decisions, saves roughly 30% codesize of amd64.
2329than enough. If you need to manage thousands of children you might want to 2800than enough. If you need to manage thousands of children you might want to
2330increase this value (I<must> be a power of two). 2801increase this value (I<must> be a power of two).
2331 2802
2332=item EV_INOTIFY_HASHSIZE 2803=item EV_INOTIFY_HASHSIZE
2333 2804
2334C<ev_staz> watchers use a small hash table to distribute workload by 2805C<ev_stat> watchers use a small hash table to distribute workload by
2335inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), 2806inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>),
2336usually more than enough. If you need to manage thousands of C<ev_stat> 2807usually more than enough. If you need to manage thousands of C<ev_stat>
2337watchers you might want to increase this value (I<must> be a power of 2808watchers you might want to increase this value (I<must> be a power of
2338two). 2809two).
2339 2810
2356 2827
2357=item ev_set_cb (ev, cb) 2828=item ev_set_cb (ev, cb)
2358 2829
2359Can be used to change the callback member declaration in each watcher, 2830Can be used to change the callback member declaration in each watcher,
2360and the way callbacks are invoked and set. Must expand to a struct member 2831and the way callbacks are invoked and set. Must expand to a struct member
2361definition and a statement, respectively. See the F<ev.v> header file for 2832definition and a statement, respectively. See the F<ev.h> header file for
2362their default definitions. One possible use for overriding these is to 2833their default definitions. One possible use for overriding these is to
2363avoid the C<struct ev_loop *> as first argument in all cases, or to use 2834avoid the C<struct ev_loop *> as first argument in all cases, or to use
2364method calls instead of plain function calls in C++. 2835method calls instead of plain function calls in C++.
2836
2837=head2 EXPORTED API SYMBOLS
2838
2839If you need to re-export the API (e.g. via a dll) and you need a list of
2840exported symbols, you can use the provided F<Symbol.*> files which list
2841all public symbols, one per line:
2842
2843 Symbols.ev for libev proper
2844 Symbols.event for the libevent emulation
2845
2846This can also be used to rename all public symbols to avoid clashes with
2847multiple versions of libev linked together (which is obviously bad in
2848itself, but sometimes it is inconvinient to avoid this).
2849
2850A sed command like this will create wrapper C<#define>'s that you need to
2851include before including F<ev.h>:
2852
2853 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2854
2855This would create a file F<wrap.h> which essentially looks like this:
2856
2857 #define ev_backend myprefix_ev_backend
2858 #define ev_check_start myprefix_ev_check_start
2859 #define ev_check_stop myprefix_ev_check_stop
2860 ...
2365 2861
2366=head2 EXAMPLES 2862=head2 EXAMPLES
2367 2863
2368For a real-world example of a program the includes libev 2864For a real-world example of a program the includes libev
2369verbatim, you can have a look at the EV perl module 2865verbatim, you can have a look at the EV perl module
2410 2906
2411=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) 2907=item Starting and stopping timer/periodic watchers: O(log skipped_other_timers)
2412 2908
2413This means that, when you have a watcher that triggers in one hour and 2909This means that, when you have a watcher that triggers in one hour and
2414there are 100 watchers that would trigger before that then inserting will 2910there are 100 watchers that would trigger before that then inserting will
2415have to skip those 100 watchers. 2911have to skip roughly seven (C<ld 100>) of these watchers.
2416 2912
2417=item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) 2913=item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers)
2418 2914
2419That means that for changing a timer costs less than removing/adding them 2915That means that changing a timer costs less than removing/adding them
2420as only the relative motion in the event queue has to be paid for. 2916as only the relative motion in the event queue has to be paid for.
2421 2917
2422=item Starting io/check/prepare/idle/signal/child watchers: O(1) 2918=item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1)
2423 2919
2424These just add the watcher into an array or at the head of a list. 2920These just add the watcher into an array or at the head of a list.
2921
2425=item Stopping check/prepare/idle watchers: O(1) 2922=item Stopping check/prepare/idle/fork/async watchers: O(1)
2426 2923
2427=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) 2924=item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE))
2428 2925
2429These watchers are stored in lists then need to be walked to find the 2926These watchers are stored in lists then need to be walked to find the
2430correct watcher to remove. The lists are usually short (you don't usually 2927correct watcher to remove. The lists are usually short (you don't usually
2431have many watchers waiting for the same fd or signal). 2928have many watchers waiting for the same fd or signal).
2432 2929
2433=item Finding the next timer per loop iteration: O(1) 2930=item Finding the next timer in each loop iteration: O(1)
2931
2932By virtue of using a binary heap, the next timer is always found at the
2933beginning of the storage array.
2434 2934
2435=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) 2935=item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd)
2436 2936
2437A change means an I/O watcher gets started or stopped, which requires 2937A change means an I/O watcher gets started or stopped, which requires
2438libev to recalculate its status (and possibly tell the kernel). 2938libev to recalculate its status (and possibly tell the kernel, depending
2939on backend and wether C<ev_io_set> was used).
2439 2940
2440=item Activating one watcher: O(1) 2941=item Activating one watcher (putting it into the pending state): O(1)
2441 2942
2442=item Priority handling: O(number_of_priorities) 2943=item Priority handling: O(number_of_priorities)
2443 2944
2444Priorities are implemented by allocating some space for each 2945Priorities are implemented by allocating some space for each
2445priority. When doing priority-based operations, libev usually has to 2946priority. When doing priority-based operations, libev usually has to
2446linearly search all the priorities. 2947linearly search all the priorities, but starting/stopping and activating
2948watchers becomes O(1) w.r.t. priority handling.
2949
2950=item Sending an ev_async: O(1)
2951
2952=item Processing ev_async_send: O(number_of_async_watchers)
2953
2954=item Processing signals: O(max_signal_number)
2955
2956Sending involves a syscall I<iff> there were no other C<ev_async_send>
2957calls in the current loop iteration. Checking for async and signal events
2958involves iterating over all running async watchers or all signal numbers.
2447 2959
2448=back 2960=back
2449 2961
2450 2962
2963=head1 Win32 platform limitations and workarounds
2964
2965Win32 doesn't support any of the standards (e.g. POSIX) that libev
2966requires, and its I/O model is fundamentally incompatible with the POSIX
2967model. Libev still offers limited functionality on this platform in
2968the form of the C<EVBACKEND_SELECT> backend, and only supports socket
2969descriptors. This only applies when using Win32 natively, not when using
2970e.g. cygwin.
2971
2972There is no supported compilation method available on windows except
2973embedding it into other applications.
2974
2975Due to the many, low, and arbitrary limits on the win32 platform and the
2976abysmal performance of winsockets, using a large number of sockets is not
2977recommended (and not reasonable). If your program needs to use more than
2978a hundred or so sockets, then likely it needs to use a totally different
2979implementation for windows, as libev offers the POSIX model, which cannot
2980be implemented efficiently on windows (microsoft monopoly games).
2981
2982=over 4
2983
2984=item The winsocket select function
2985
2986The winsocket C<select> function doesn't follow POSIX in that it requires
2987socket I<handles> and not socket I<file descriptors>. This makes select
2988very inefficient, and also requires a mapping from file descriptors
2989to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>,
2990C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor
2991symbols for more info.
2992
2993The configuration for a "naked" win32 using the microsoft runtime
2994libraries and raw winsocket select is:
2995
2996 #define EV_USE_SELECT 1
2997 #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */
2998
2999Note that winsockets handling of fd sets is O(n), so you can easily get a
3000complexity in the O(n²) range when using win32.
3001
3002=item Limited number of file descriptors
3003
3004Windows has numerous arbitrary (and low) limits on things. Early versions
3005of winsocket's select only supported waiting for a max. of C<64> handles
3006(probably owning to the fact that all windows kernels can only wait for
3007C<64> things at the same time internally; microsoft recommends spawning a
3008chain of threads and wait for 63 handles and the previous thread in each).
3009
3010Newer versions support more handles, but you need to define C<FD_SETSIZE>
3011to some high number (e.g. C<2048>) before compiling the winsocket select
3012call (which might be in libev or elsewhere, for example, perl does its own
3013select emulation on windows).
3014
3015Another limit is the number of file descriptors in the microsoft runtime
3016libraries, which by default is C<64> (there must be a hidden I<64> fetish
3017or something like this inside microsoft). You can increase this by calling
3018C<_setmaxstdio>, which can increase this limit to C<2048> (another
3019arbitrary limit), but is broken in many versions of the microsoft runtime
3020libraries.
3021
3022This might get you to about C<512> or C<2048> sockets (depending on
3023windows version and/or the phase of the moon). To get more, you need to
3024wrap all I/O functions and provide your own fd management, but the cost of
3025calling select (O(n²)) will likely make this unworkable.
3026
3027=back
3028
3029
2451=head1 AUTHOR 3030=head1 AUTHOR
2452 3031
2453Marc Lehmann <libev@schmorp.de>. 3032Marc Lehmann <libev@schmorp.de>.
2454 3033

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines