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

Comparing libev/ev.pod (file contents):
Revision 1.88 by ayin, Tue Dec 18 13:06:18 2007 UTC vs.
Revision 1.100 by root, Sat Dec 22 11:49:17 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.
115 115
116Returns 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
117C<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
118you actually want to know. 118you actually want to know.
119 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
120=item int ev_version_major () 126=item int ev_version_major ()
121 127
122=item int ev_version_minor () 128=item int ev_version_minor ()
123 129
124You can find out the major and minor ABI version numbers of the library 130You can find out the major and minor ABI version numbers of the library
313lot 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).
314 320
315=item C<EVBACKEND_EPOLL> (value 4, Linux) 321=item C<EVBACKEND_EPOLL> (value 4, Linux)
316 322
317For 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,
318but it scales phenomenally better. While poll and select usually scale like 324but it scales phenomenally better. While poll and select usually scale
319O(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),
320either 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:
321 330
322While 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
323result in some caching, there is still a syscall per such incident 332will result in some caching, there is still a syscall per such incident
324(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
325best 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
326well if you register events for both fds. 335very well if you register events for both fds.
327 336
328Please note that epoll sometimes generates spurious notifications, so you 337Please note that epoll sometimes generates spurious notifications, so you
329need 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
330(or space) is available. 339(or space) is available.
331 340
332=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 341=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
333 342
334Kqueue deserves special mention, as at the time of this writing, it 343Kqueue deserves special mention, as at the time of this writing, it
335was broken on all BSDs except NetBSD (usually it doesn't work with 344was broken on all BSDs except NetBSD (usually it doesn't work reliably
336anything but sockets and pipes, except on Darwin, where of course its 345with anything but sockets and pipes, except on Darwin, where of course
337completely useless). For this reason its not being "autodetected" 346it's completely useless). For this reason it's not being "autodetected"
338unless you explicitly specify it explicitly in the flags (i.e. using 347unless you explicitly specify it explicitly in the flags (i.e. using
339C<EVBACKEND_KQUEUE>). 348C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
349system like NetBSD.
350
351You still can embed kqueue into a normal poll or select backend and use it
352only for sockets (after having made sure that sockets work with kqueue on
353the target platform). See C<ev_embed> watchers for more info.
340 354
341It scales in the same way as the epoll backend, but the interface to the 355It scales in the same way as the epoll backend, but the interface to the
342kernel is more efficient (which says nothing about its actual speed, of 356kernel is more efficient (which says nothing about its actual speed, of
343course). While starting and stopping an I/O watcher does not cause an 357course). While stopping, setting and starting an I/O watcher does never
344extra syscall as with epoll, it still adds up to four event changes per 358cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to
345incident, so its best to avoid that. 359two event changes per incident, support for C<fork ()> is very bad and it
360drops fds silently in similarly hard-to-detect cases.
346 361
347=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) 362=item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8)
348 363
349This is not implemented yet (and might never be). 364This is not implemented yet (and might never be).
350 365
351=item C<EVBACKEND_PORT> (value 32, Solaris 10) 366=item C<EVBACKEND_PORT> (value 32, Solaris 10)
352 367
353This uses the Solaris 10 port mechanism. As with everything on Solaris, 368This uses the Solaris 10 event port mechanism. As with everything on Solaris,
354it's really slow, but it still scales very well (O(active_fds)). 369it's really slow, but it still scales very well (O(active_fds)).
355 370
356Please note that solaris ports can result in a lot of spurious 371Please note that solaris event ports can deliver a lot of spurious
357notifications, so you need to use non-blocking I/O or other means to avoid 372notifications, so you need to use non-blocking I/O or other means to avoid
358blocking when no data (or space) is available. 373blocking when no data (or space) is available.
359 374
360=item C<EVBACKEND_ALL> 375=item C<EVBACKEND_ALL>
361 376
469 484
470Returns the current "event loop time", which is the time the event loop 485Returns the current "event loop time", which is the time the event loop
471received events and started processing them. This timestamp does not 486received events and started processing them. This timestamp does not
472change as long as callbacks are being processed, and this is also the base 487change as long as callbacks are being processed, and this is also the base
473time used for relative timers. You can treat it as the timestamp of the 488time used for relative timers. You can treat it as the timestamp of the
474event occuring (or more correctly, libev finding out about it). 489event occurring (or more correctly, libev finding out about it).
475 490
476=item ev_loop (loop, int flags) 491=item ev_loop (loop, int flags)
477 492
478Finally, this is it, the event handler. This function usually is called 493Finally, this is it, the event handler. This function usually is called
479after you initialised all your watchers and you want to start handling 494after you initialised all your watchers and you want to start handling
563Example: For some weird reason, unregister the above signal handler again. 578Example: For some weird reason, unregister the above signal handler again.
564 579
565 ev_ref (loop); 580 ev_ref (loop);
566 ev_signal_stop (loop, &exitsig); 581 ev_signal_stop (loop, &exitsig);
567 582
583=item ev_set_io_collect_interval (loop, ev_tstamp interval)
584
585=item ev_set_timeout_collect_interval (loop, ev_tstamp interval)
586
587These advanced functions influence the time that libev will spend waiting
588for events. Both are by default C<0>, meaning that libev will try to
589invoke timer/periodic callbacks and I/O callbacks with minimum latency.
590
591Setting these to a higher value (the C<interval> I<must> be >= C<0>)
592allows libev to delay invocation of I/O and timer/periodic callbacks to
593increase efficiency of loop iterations.
594
595The background is that sometimes your program runs just fast enough to
596handle one (or very few) event(s) per loop iteration. While this makes
597the program responsive, it also wastes a lot of CPU time to poll for new
598events, especially with backends like C<select ()> which have a high
599overhead for the actual polling but can deliver many events at once.
600
601By setting a higher I<io collect interval> you allow libev to spend more
602time collecting I/O events, so you can handle more events per iteration,
603at the cost of increasing latency. Timeouts (both C<ev_periodic> and
604C<ev_timer>) will be not affected. Setting this to a non-null bvalue will
605introduce an additional C<ev_sleep ()> call into most loop iterations.
606
607Likewise, by setting a higher I<timeout collect interval> you allow libev
608to spend more time collecting timeouts, at the expense of increased
609latency (the watcher callback will be called later). C<ev_io> watchers
610will not be affected. Setting this to a non-null value will not introduce
611any overhead in libev.
612
613Many (busy) programs can usually benefit by setting the io collect
614interval to a value near C<0.1> or so, which is often enough for
615interactive servers (of course not for games), likewise for timeouts. It
616usually doesn't make much sense to set it to a lower value than C<0.01>,
617as this approsaches the timing granularity of most systems.
618
568=back 619=back
569 620
570 621
571=head1 ANATOMY OF A WATCHER 622=head1 ANATOMY OF A WATCHER
572 623
924such as poll (fortunately in our Xlib example, Xlib already does this on 975such as poll (fortunately in our Xlib example, Xlib already does this on
925its own, so its quite safe to use). 976its own, so its quite safe to use).
926 977
927=head3 The special problem of disappearing file descriptors 978=head3 The special problem of disappearing file descriptors
928 979
929Some backends (e.g kqueue, epoll) need to be told about closing a file 980Some backends (e.g. kqueue, epoll) need to be told about closing a file
930descriptor (either by calling C<close> explicitly or by any other means, 981descriptor (either by calling C<close> explicitly or by any other means,
931such as C<dup>). The reason is that you register interest in some file 982such as C<dup>). The reason is that you register interest in some file
932descriptor, but when it goes away, the operating system will silently drop 983descriptor, but when it goes away, the operating system will silently drop
933this interest. If another file descriptor with the same number then is 984this interest. If another file descriptor with the same number then is
934registered with libev, there is no efficient way to see that this is, in 985registered with libev, there is no efficient way to see that this is, in
942descriptor even if the file descriptor number itself did not change. 993descriptor even if the file descriptor number itself did not change.
943 994
944This is how one would do it normally anyway, the important point is that 995This is how one would do it normally anyway, the important point is that
945the libev application should not optimise around libev but should leave 996the libev application should not optimise around libev but should leave
946optimisations to libev. 997optimisations to libev.
998
999=head3 The special problem of dup'ed file descriptors
1000
1001Some backends (e.g. epoll), cannot register events for file descriptors,
1002but only events for the underlying file descriptions. That menas when you
1003have C<dup ()>'ed file descriptors and register events for them, only one
1004file descriptor might actually receive events.
1005
1006There is no workaorund possible except not registering events
1007for potentially C<dup ()>'ed file descriptors or to resort to
1008C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>.
1009
1010=head3 The special problem of fork
1011
1012Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit
1013useless behaviour. Libev fully supports fork, but needs to be told about
1014it in the child.
1015
1016To support fork in your programs, you either have to call
1017C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child,
1018enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or
1019C<EVBACKEND_POLL>.
947 1020
948 1021
949=head3 Watcher-Specific Functions 1022=head3 Watcher-Specific Functions
950 1023
951=over 4 1024=over 4
1553 1626
1554It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 1627It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>)
1555priority, to ensure that they are being run before any other watchers 1628priority, to ensure that they are being run before any other watchers
1556after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, 1629after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers,
1557too) should not activate ("feed") events into libev. While libev fully 1630too) should not activate ("feed") events into libev. While libev fully
1558supports this, they will be called before other C<ev_check> watchers did 1631supports this, they will be called before other C<ev_check> watchers
1559their job. As C<ev_check> watchers are often used to embed other event 1632did their job. As C<ev_check> watchers are often used to embed other
1560loops those other event loops might be in an unusable state until their 1633(non-libev) event loops those other event loops might be in an unusable
1561C<ev_check> watcher ran (always remind yourself to coexist peacefully with 1634state until their C<ev_check> watcher ran (always remind yourself to
1562others). 1635coexist peacefully with others).
1563 1636
1564=head3 Watcher-Specific Functions and Data Members 1637=head3 Watcher-Specific Functions and Data Members
1565 1638
1566=over 4 1639=over 4
1567 1640
1791 1864
1792Make a single, non-blocking sweep over the embedded loop. This works 1865Make a single, non-blocking sweep over the embedded loop. This works
1793similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most 1866similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most
1794apropriate way for embedded loops. 1867apropriate way for embedded loops.
1795 1868
1796=item struct ev_loop *loop [read-only] 1869=item struct ev_loop *other [read-only]
1797 1870
1798The embedded event loop. 1871The embedded event loop.
1799 1872
1800=back 1873=back
1801 1874
2140Libev can (and often is) directly embedded into host 2213Libev can (and often is) directly embedded into host
2141applications. Examples of applications that embed it include the Deliantra 2214applications. Examples of applications that embed it include the Deliantra
2142Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) 2215Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe)
2143and rxvt-unicode. 2216and rxvt-unicode.
2144 2217
2145The goal is to enable you to just copy the neecssary files into your 2218The goal is to enable you to just copy the necessary files into your
2146source directory without having to change even a single line in them, so 2219source directory without having to change even a single line in them, so
2147you can easily upgrade by simply copying (or having a checked-out copy of 2220you can easily upgrade by simply copying (or having a checked-out copy of
2148libev somewhere in your source tree). 2221libev somewhere in your source tree).
2149 2222
2150=head2 FILESETS 2223=head2 FILESETS
2240 2313
2241If defined to be C<1>, libev will try to detect the availability of the 2314If defined to be C<1>, libev will try to detect the availability of the
2242monotonic clock option at both compiletime and runtime. Otherwise no use 2315monotonic clock option at both compiletime and runtime. Otherwise no use
2243of the monotonic clock option will be attempted. If you enable this, you 2316of the monotonic clock option will be attempted. If you enable this, you
2244usually have to link against librt or something similar. Enabling it when 2317usually have to link against librt or something similar. Enabling it when
2245the functionality isn't available is safe, though, althoguh you have 2318the functionality isn't available is safe, though, although you have
2246to make sure you link against any libraries where the C<clock_gettime> 2319to make sure you link against any libraries where the C<clock_gettime>
2247function is hiding in (often F<-lrt>). 2320function is hiding in (often F<-lrt>).
2248 2321
2249=item EV_USE_REALTIME 2322=item EV_USE_REALTIME
2250 2323
2251If defined to be C<1>, libev will try to detect the availability of the 2324If defined to be C<1>, libev will try to detect the availability of the
2252realtime clock option at compiletime (and assume its availability at 2325realtime clock option at compiletime (and assume its availability at
2253runtime if successful). Otherwise no use of the realtime clock option will 2326runtime if successful). Otherwise no use of the realtime clock option will
2254be attempted. This effectively replaces C<gettimeofday> by C<clock_get 2327be attempted. This effectively replaces C<gettimeofday> by C<clock_get
2255(CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries 2328(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
2256in the description of C<EV_USE_MONOTONIC>, though. 2329note about libraries in the description of C<EV_USE_MONOTONIC>, though.
2330
2331=item EV_USE_NANOSLEEP
2332
2333If defined to be C<1>, libev will assume that C<nanosleep ()> is available
2334and will use it for delays. Otherwise it will use C<select ()>.
2257 2335
2258=item EV_USE_SELECT 2336=item EV_USE_SELECT
2259 2337
2260If undefined or defined to be C<1>, libev will compile in support for the 2338If undefined or defined to be C<1>, libev will compile in support for the
2261C<select>(2) backend. No attempt at autodetection will be done: if no 2339C<select>(2) backend. No attempt at autodetection will be done: if no
2440 2518
2441=item ev_set_cb (ev, cb) 2519=item ev_set_cb (ev, cb)
2442 2520
2443Can be used to change the callback member declaration in each watcher, 2521Can be used to change the callback member declaration in each watcher,
2444and the way callbacks are invoked and set. Must expand to a struct member 2522and the way callbacks are invoked and set. Must expand to a struct member
2445definition and a statement, respectively. See the F<ev.v> header file for 2523definition and a statement, respectively. See the F<ev.h> header file for
2446their default definitions. One possible use for overriding these is to 2524their default definitions. One possible use for overriding these is to
2447avoid the C<struct ev_loop *> as first argument in all cases, or to use 2525avoid the C<struct ev_loop *> as first argument in all cases, or to use
2448method calls instead of plain function calls in C++. 2526method calls instead of plain function calls in C++.
2527
2528=head2 EXPORTED API SYMBOLS
2529
2530If you need to re-export the API (e.g. via a dll) and you need a list of
2531exported symbols, you can use the provided F<Symbol.*> files which list
2532all public symbols, one per line:
2533
2534 Symbols.ev for libev proper
2535 Symbols.event for the libevent emulation
2536
2537This can also be used to rename all public symbols to avoid clashes with
2538multiple versions of libev linked together (which is obviously bad in
2539itself, but sometimes it is inconvinient to avoid this).
2540
2541A sed command like this will create wrapper C<#define>'s that you need to
2542include before including F<ev.h>:
2543
2544 <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h
2545
2546This would create a file F<wrap.h> which essentially looks like this:
2547
2548 #define ev_backend myprefix_ev_backend
2549 #define ev_check_start myprefix_ev_check_start
2550 #define ev_check_stop myprefix_ev_check_stop
2551 ...
2449 2552
2450=head2 EXAMPLES 2553=head2 EXAMPLES
2451 2554
2452For a real-world example of a program the includes libev 2555For a real-world example of a program the includes libev
2453verbatim, you can have a look at the EV perl module 2556verbatim, you can have a look at the EV perl module

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines