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

Comparing libev/ev.pod (file contents):
Revision 1.85 by root, Mon Dec 17 07:24:12 2007 UTC vs.
Revision 1.97 by root, Sat Dec 22 05:48:02 2007 UTC

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.
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.
112=item ev_tstamp ev_time () 114=item ev_tstamp ev_time ()
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.
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 ()>.
117 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
311lot of inactive fds). It scales similarly to select, i.e. O(total_fds). 319lot of inactive fds). It scales similarly to select, i.e. O(total_fds).
312 320
313=item C<EVBACKEND_EPOLL> (value 4, Linux) 321=item C<EVBACKEND_EPOLL> (value 4, Linux)
314 322
315For few fds, this backend is a bit little slower than poll and select, 323For few fds, this backend is a bit little slower than poll and select,
316but it scales phenomenally better. While poll and select usually scale like 324but it scales phenomenally better. While poll and select usually scale
317O(total_fds) where n is the total number of fds (or the highest fd), epoll scales 325like O(total_fds) where n is the total number of fds (or the highest fd),
318either O(1) or O(active_fds). 326epoll scales either O(1) or O(active_fds). The epoll design has a number
327of shortcomings, such as silently dropping events in some hard-to-detect
328cases and rewiring a syscall per fd change, no fork support and bad
329support for dup:
319 330
320While stopping and starting an I/O watcher in the same iteration will 331While stopping, setting and starting an I/O watcher in the same iteration
321result in some caching, there is still a syscall per such incident 332will result in some caching, there is still a syscall per such incident
322(because the fd could point to a different file description now), so its 333(because the fd could point to a different file description now), so its
323best to avoid that. Also, dup()ed file descriptors might not work very 334best to avoid that. Also, C<dup ()>'ed file descriptors might not work
324well if you register events for both fds. 335very well if you register events for both fds.
325 336
326Please note that epoll sometimes generates spurious notifications, so you 337Please note that epoll sometimes generates spurious notifications, so you
327need to use non-blocking I/O or other means to avoid blocking when no data 338need to use non-blocking I/O or other means to avoid blocking when no data
328(or space) is available. 339(or space) is available.
329 340
330=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 341=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
331 342
332Kqueue deserves special mention, as at the time of this writing, it 343Kqueue deserves special mention, as at the time of this writing, it
333was broken on all BSDs except NetBSD (usually it doesn't work with 344was broken on I<all> BSDs (usually it doesn't work with anything but
334anything but sockets and pipes, except on Darwin, where of course its 345sockets and pipes, except on Darwin, where of course it's completely
346useless. On NetBSD, it seems to work for all the FD types I tested, so it
335completely useless). For this reason its not being "autodetected" 347is used by default there). For this reason it's not being "autodetected"
336unless you explicitly specify it explicitly in the flags (i.e. using 348unless you explicitly specify it explicitly in the flags (i.e. using
337C<EVBACKEND_KQUEUE>). 349C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
350system like NetBSD.
338 351
339It scales in the same way as the epoll backend, but the interface to the 352It scales in the same way as the epoll backend, but the interface to the
340kernel is more efficient (which says nothing about its actual speed, of 353kernel is more efficient (which says nothing about its actual speed,
341course). While starting and stopping an I/O watcher does not cause an 354of course). While stopping, setting and starting an I/O watcher does
342extra syscall as with epoll, it still adds up to four event changes per 355never cause an extra syscall as with epoll, it still adds up to two event
343incident, so its best to avoid that. 356changes per incident, support for C<fork ()> is very bad and it drops fds
357silently in similarly hard-to-detetc cases.
344 358
345=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 359=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
346 360
347This is not implemented yet (and might never be). 361This is not implemented yet (and might never be).
348 362
349=item C<EVBACKEND_PORT> (value 32, Solaris 10) 363=item C<EVBACKEND_PORT> (value 32, Solaris 10)
350 364
351This uses the Solaris 10 port mechanism. As with everything on Solaris, 365This uses the Solaris 10 event port mechanism. As with everything on Solaris,
352it's really slow, but it still scales very well (O(active_fds)). 366it's really slow, but it still scales very well (O(active_fds)).
353 367
354Please note that solaris ports can result in a lot of spurious 368Please note that solaris event ports can deliver a lot of spurious
355notifications, so you need to use non-blocking I/O or other means to avoid 369notifications, so you need to use non-blocking I/O or other means to avoid
356blocking when no data (or space) is available. 370blocking when no data (or space) is available.
357 371
358=item C<EVBACKEND_ALL> 372=item C<EVBACKEND_ALL>
359 373
402Destroys the default loop again (frees all memory and kernel state 416Destroys the default loop again (frees all memory and kernel state
403etc.). None of the active event watchers will be stopped in the normal 417etc.). None of the active event watchers will be stopped in the normal
404sense, so e.g. C<ev_is_active> might still return true. It is your 418sense, so e.g. C<ev_is_active> might still return true. It is your
405responsibility to either stop all watchers cleanly yoursef I<before> 419responsibility to either stop all watchers cleanly yoursef I<before>
406calling this function, or cope with the fact afterwards (which is usually 420calling this function, or cope with the fact afterwards (which is usually
407the easiest thing, youc na just ignore the watchers and/or C<free ()> them 421the easiest thing, you can just ignore the watchers and/or C<free ()> them
408for example). 422for example).
423
424Note that certain global state, such as signal state, will not be freed by
425this function, and related watchers (such as signal and child watchers)
426would need to be stopped manually.
427
428In general it is not advisable to call this function except in the
429rare occasion where you really need to free e.g. the signal handling
430pipe fds. If you need dynamically allocated loops it is better to use
431C<ev_loop_new> and C<ev_loop_destroy>).
409 432
410=item ev_loop_destroy (loop) 433=item ev_loop_destroy (loop)
411 434
412Like C<ev_default_destroy>, but destroys an event loop created by an 435Like C<ev_default_destroy>, but destroys an event loop created by an
413earlier call to C<ev_loop_new>. 436earlier call to C<ev_loop_new>.
458 481
459Returns the current "event loop time", which is the time the event loop 482Returns the current "event loop time", which is the time the event loop
460received events and started processing them. This timestamp does not 483received events and started processing them. This timestamp does not
461change as long as callbacks are being processed, and this is also the base 484change as long as callbacks are being processed, and this is also the base
462time used for relative timers. You can treat it as the timestamp of the 485time used for relative timers. You can treat it as the timestamp of the
463event occuring (or more correctly, libev finding out about it). 486event occurring (or more correctly, libev finding out about it).
464 487
465=item ev_loop (loop, int flags) 488=item ev_loop (loop, int flags)
466 489
467Finally, this is it, the event handler. This function usually is called 490Finally, this is it, the event handler. This function usually is called
468after you initialised all your watchers and you want to start handling 491after you initialised all your watchers and you want to start handling
552Example: For some weird reason, unregister the above signal handler again. 575Example: For some weird reason, unregister the above signal handler again.
553 576
554 ev_ref (loop); 577 ev_ref (loop);
555 ev_signal_stop (loop, &exitsig); 578 ev_signal_stop (loop, &exitsig);
556 579
580=item ev_set_io_collect_interval (loop, ev_tstamp interval)
581
582=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
583
584These advanced functions influence the time that libev will spend waiting
585for events. Both are by default C<0>, meaning that libev will try to
586invoke timer/periodic callbacks and I/O callbacks with minimum latency.
587
588Setting these to a higher value (the C<interval> I<must> be >= C<0>)
589allows libev to delay invocation of I/O and timer/periodic callbacks to
590increase efficiency of loop iterations.
591
592The background is that sometimes your program runs just fast enough to
593handle one (or very few) event(s) per loop iteration. While this makes
594the program responsive, it also wastes a lot of CPU time to poll for new
595events, especially with backends like C<select ()> which have a high
596overhead for the actual polling but can deliver many events at once.
597
598By setting a higher I<io collect interval> you allow libev to spend more
599time collecting I/O events, so you can handle more events per iteration,
600at the cost of increasing latency. Timeouts (both C<ev_periodic> and
601C<ev_timer>) will be not affected.
602
603Likewise, by setting a higher I<timeout collect interval> you allow libev
604to spend more time collecting timeouts, at the expense of increased
605latency (the watcher callback will be called later). C<ev_io> watchers
606will not be affected.
607
608Many programs can usually benefit by setting the io collect interval to
609a value near C<0.1> or so, which is often enough for interactive servers
610(of course not for games), likewise for timeouts. It usually doesn't make
611much sense to set it to a lower value than C<0.01>, as this approsaches
612the timing granularity of most systems.
613
557=back 614=back
558 615
559 616
560=head1 ANATOMY OF A WATCHER 617=head1 ANATOMY OF A WATCHER
561 618
913such as poll (fortunately in our Xlib example, Xlib already does this on 970such as poll (fortunately in our Xlib example, Xlib already does this on
914its own, so its quite safe to use). 971its own, so its quite safe to use).
915 972
916=head3 The special problem of disappearing file descriptors 973=head3 The special problem of disappearing file descriptors
917 974
918Some backends (e.g kqueue, epoll) need to be told about closing a file 975Some backends (e.g. kqueue, epoll) need to be told about closing a file
919descriptor (either by calling C<close> explicitly or by any other means, 976descriptor (either by calling C<close> explicitly or by any other means,
920such as C<dup>). The reason is that you register interest in some file 977such as C<dup>). The reason is that you register interest in some file
921descriptor, but when it goes away, the operating system will silently drop 978descriptor, but when it goes away, the operating system will silently drop
922this interest. If another file descriptor with the same number then is 979this interest. If another file descriptor with the same number then is
923registered with libev, there is no efficient way to see that this is, in 980registered with libev, there is no efficient way to see that this is, in
931descriptor even if the file descriptor number itself did not change. 988descriptor even if the file descriptor number itself did not change.
932 989
933This is how one would do it normally anyway, the important point is that 990This is how one would do it normally anyway, the important point is that
934the libev application should not optimise around libev but should leave 991the libev application should not optimise around libev but should leave
935optimisations to libev. 992optimisations to libev.
993
994=head3 The special problem of dup'ed file descriptors
995
996Some backends (e.g. epoll), cannot register events for file descriptors,
997but only events for the underlying file descriptions. That menas when you
998have C<dup ()>'ed file descriptors and register events for them, only one
999file descriptor might actually receive events.
1000
1001There is no workaorund possible except not registering events
1002for potentially C<dup ()>'ed file descriptors or to resort to
1003C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1004
1005=head3 The special problem of fork
1006
1007Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1008useless behaviour. Libev fully supports fork, but needs to be told about
1009it in the child.
1010
1011To support fork in your programs, you either have to call
1012C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1013enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1014C<EVBACKEND_POLL>.
936 1015
937 1016
938=head3 Watcher-Specific Functions 1017=head3 Watcher-Specific Functions
939 1018
940=over 4 1019=over 4
1695=head2 C<ev_embed> - when one backend isn't enough... 1774=head2 C<ev_embed> - when one backend isn't enough...
1696 1775
1697This is a rather advanced watcher type that lets you embed one event loop 1776This is a rather advanced watcher type that lets you embed one event loop
1698into another (currently only C<ev_io> events are supported in the embedded 1777into another (currently only C<ev_io> events are supported in the embedded
1699loop, other types of watchers might be handled in a delayed or incorrect 1778loop, other types of watchers might be handled in a delayed or incorrect
1700fashion and must not be used). 1779fashion and must not be used). (See portability notes, below).
1701 1780
1702There are primarily two reasons you would want that: work around bugs and 1781There are primarily two reasons you would want that: work around bugs and
1703prioritise I/O. 1782prioritise I/O.
1704 1783
1705As an example for a bug workaround, the kqueue backend might only support 1784As an example for a bug workaround, the kqueue backend might only support
1760 ev_embed_start (loop_hi, &embed); 1839 ev_embed_start (loop_hi, &embed);
1761 } 1840 }
1762 else 1841 else
1763 loop_lo = loop_hi; 1842 loop_lo = loop_hi;
1764 1843
1844=head2 Portability notes
1845
1846Kqueue is nominally embeddable, but this is broken on all BSDs that I
1847tried, in various ways. Usually the embedded event loop will simply never
1848receive events, sometimes it will only trigger a few times, sometimes in a
1849loop. Epoll is also nominally embeddable, but many Linux kernel versions
1850will always eport the epoll fd as ready, even when no events are pending.
1851
1852While libev allows embedding these backends (they are contained in
1853C<ev_embeddable_backends ()>), take extreme care that it will actually
1854work.
1855
1856When in doubt, create a dynamic event loop forced to use sockets (this
1857usually works) and possibly another thread and a pipe or so to report to
1858your main event loop.
1859
1765=head3 Watcher-Specific Functions and Data Members 1860=head3 Watcher-Specific Functions and Data Members
1766 1861
1767=over 4 1862=over 4
1768 1863
1769=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 1864=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
1780 1875
1781Make a single, non-blocking sweep over the embedded loop. This works 1876Make a single, non-blocking sweep over the embedded loop. This works
1782similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 1877similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1783apropriate way for embedded loops. 1878apropriate way for embedded loops.
1784 1879
1785=item struct ev_loop *loop [read-only] 1880=item struct ev_loop *other [read-only]
1786 1881
1787The embedded event loop. 1882The embedded event loop.
1788 1883
1789=back 1884=back
1790 1885
2129Libev can (and often is) directly embedded into host 2224Libev can (and often is) directly embedded into host
2130applications. Examples of applications that embed it include the Deliantra 2225applications. Examples of applications that embed it include the Deliantra
2131Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2226Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2132and rxvt-unicode. 2227and rxvt-unicode.
2133 2228
2134The goal is to enable you to just copy the neecssary files into your 2229The goal is to enable you to just copy the necessary files into your
2135source directory without having to change even a single line in them, so 2230source directory without having to change even a single line in them, so
2136you can easily upgrade by simply copying (or having a checked-out copy of 2231you can easily upgrade by simply copying (or having a checked-out copy of
2137libev somewhere in your source tree). 2232libev somewhere in your source tree).
2138 2233
2139=head2 FILESETS 2234=head2 FILESETS
2229 2324
2230If defined to be C<1>, libev will try to detect the availability of the 2325If defined to be C<1>, libev will try to detect the availability of the
2231monotonic clock option at both compiletime and runtime. Otherwise no use 2326monotonic clock option at both compiletime and runtime. Otherwise no use
2232of the monotonic clock option will be attempted. If you enable this, you 2327of the monotonic clock option will be attempted. If you enable this, you
2233usually have to link against librt or something similar. Enabling it when 2328usually have to link against librt or something similar. Enabling it when
2234the functionality isn't available is safe, though, althoguh you have 2329the functionality isn't available is safe, though, although you have
2235to make sure you link against any libraries where the C<clock_gettime> 2330to make sure you link against any libraries where the C<clock_gettime>
2236function is hiding in (often F<-lrt>). 2331function is hiding in (often F<-lrt>).
2237 2332
2238=item EV_USE_REALTIME 2333=item EV_USE_REALTIME
2239 2334
2240If defined to be C<1>, libev will try to detect the availability of the 2335If defined to be C<1>, libev will try to detect the availability of the
2241realtime clock option at compiletime (and assume its availability at 2336realtime clock option at compiletime (and assume its availability at
2242runtime if successful). Otherwise no use of the realtime clock option will 2337runtime if successful). Otherwise no use of the realtime clock option will
2243be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2338be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2244(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2339(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2245in the description of C<EV_USE_MONOTONIC>, though. 2340note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2341
2342=item EV_USE_NANOSLEEP
2343
2344If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2345and will use it for delays. Otherwise it will use C<select ()>.
2246 2346
2247=item EV_USE_SELECT 2347=item EV_USE_SELECT
2248 2348
2249If undefined or defined to be C<1>, libev will compile in support for the 2349If undefined or defined to be C<1>, libev will compile in support for the
2250C<select>(2) backend. No attempt at autodetection will be done: if no 2350C<select>(2) backend. No attempt at autodetection will be done: if no
2429 2529
2430=item ev_set_cb (ev, cb) 2530=item ev_set_cb (ev, cb)
2431 2531
2432Can be used to change the callback member declaration in each watcher, 2532Can be used to change the callback member declaration in each watcher,
2433and the way callbacks are invoked and set. Must expand to a struct member 2533and the way callbacks are invoked and set. Must expand to a struct member
2434definition and a statement, respectively. See the F<ev.v> header file for 2534definition and a statement, respectively. See the F<ev.h> header file for
2435their default definitions. One possible use for overriding these is to 2535their default definitions. One possible use for overriding these is to
2436avoid the C<struct ev_loop *> as first argument in all cases, or to use 2536avoid the C<struct ev_loop *> as first argument in all cases, or to use
2437method calls instead of plain function calls in C++. 2537method calls instead of plain function calls in C++.
2538
2539=head2 EXPORTED API SYMBOLS
2540
2541If you need to re-export the API (e.g. via a dll) and you need a list of
2542exported symbols, you can use the provided F<Symbol.*> files which list
2543all public symbols, one per line:
2544
2545 Symbols.ev for libev proper
2546 Symbols.event for the libevent emulation
2547
2548This can also be used to rename all public symbols to avoid clashes with
2549multiple versions of libev linked together (which is obviously bad in
2550itself, but sometimes it is inconvinient to avoid this).
2551
2552A sed command like this will create wrapper C<#define>'s that you need to
2553include before including F<ev.h>:
2554
2555 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2556
2557This would create a file F<wrap.h> which essentially looks like this:
2558
2559 #define ev_backend myprefix_ev_backend
2560 #define ev_check_start myprefix_ev_check_start
2561 #define ev_check_stop myprefix_ev_check_stop
2562 ...
2438 2563
2439=head2 EXAMPLES 2564=head2 EXAMPLES
2440 2565
2441For a real-world example of a program the includes libev 2566For a real-world example of a program the includes libev
2442verbatim, you can have a look at the EV perl module 2567verbatim, you can have a look at the EV perl module

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines