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

Comparing libev/ev.pod (file contents):
Revision 1.205 by root, Mon Oct 27 12:20:32 2008 UTC vs.
Revision 1.209 by root, Wed Oct 29 14:12:34 2008 UTC

298If you don't know what event loop to use, use the one returned from this 298If you don't know what event loop to use, use the one returned from this
299function. 299function.
300 300
301Note that this function is I<not> thread-safe, so if you want to use it 301Note that this function is I<not> thread-safe, so if you want to use it
302from multiple threads, you have to lock (note also that this is unlikely, 302from multiple threads, you have to lock (note also that this is unlikely,
303as loops cannot bes hared easily between threads anyway). 303as loops cannot be shared easily between threads anyway).
304 304
305The default loop is the only loop that can handle C<ev_signal> and 305The default loop is the only loop that can handle C<ev_signal> and
306C<ev_child> watchers, and to do this, it always registers a handler 306C<ev_child> watchers, and to do this, it always registers a handler
307for C<SIGCHLD>. If this is a problem for your application you can either 307for C<SIGCHLD>. If this is a problem for your application you can either
308create a dynamic loop with C<ev_loop_new> that doesn't do that, or you 308create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
386For few fds, this backend is a bit little slower than poll and select, 386For few fds, this backend is a bit little slower than poll and select,
387but it scales phenomenally better. While poll and select usually scale 387but it scales phenomenally better. While poll and select usually scale
388like O(total_fds) where n is the total number of fds (or the highest fd), 388like O(total_fds) where n is the total number of fds (or the highest fd),
389epoll scales either O(1) or O(active_fds). 389epoll scales either O(1) or O(active_fds).
390 390
391The epoll syscalls are the most misdesigned of the more advanced 391The epoll syscalls are the most misdesigned of the more advanced event
392event mechanisms: probelsm include silently dropping events in some 392mechanisms: problems include silently dropping fds, requiring a system
393hard-to-detect cases, requiring a system call per fd change, no fork 393call per change per fd (and unnecessary guessing of parameters), problems
394support, problems with dup and so on. 394with dup and so on. The biggest issue is fork races, however - if a
395program forks then I<both> parent and child process have to recreate the
396epoll set, which can take considerable time (one syscall per fd) and is of
397course hard to detect.
395 398
396Epoll is also notoriously buggy - embedding epoll fds should work, but 399Epoll is also notoriously buggy - embedding epoll fds should work, but
397of course doesn't, and epoll just loves to report events for totally 400of course doesn't, and epoll just loves to report events for totally
398I<different> file descriptors (even already closed ones, so one cannot 401I<different> file descriptors (even already closed ones, so one cannot
399even remove them from the set) than registered in the set (especially 402even remove them from the set) than registered in the set (especially
409 412
410Best performance from this backend is achieved by not unregistering all 413Best performance from this backend is achieved by not unregistering all
411watchers for a file descriptor until it has been closed, if possible, 414watchers for a file descriptor until it has been closed, if possible,
412i.e. keep at least one watcher active per fd at all times. Stopping and 415i.e. keep at least one watcher active per fd at all times. Stopping and
413starting a watcher (without re-setting it) also usually doesn't cause 416starting a watcher (without re-setting it) also usually doesn't cause
414extra overhead. 417extra overhead. A fork can both result in spurious notifications as well
418as in libev having to destroy and recreate the epoll object, which can
419take considerable time and thus should be avoided.
415 420
416While nominally embeddable in other event loops, this feature is broken in 421While nominally embeddable in other event loops, this feature is broken in
417all kernel versions tested so far. 422all kernel versions tested so far.
418 423
419This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 424This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
434 439
435It scales in the same way as the epoll backend, but the interface to the 440It scales in the same way as the epoll backend, but the interface to the
436kernel is more efficient (which says nothing about its actual speed, of 441kernel is more efficient (which says nothing about its actual speed, of
437course). While stopping, setting and starting an I/O watcher does never 442course). While stopping, setting and starting an I/O watcher does never
438cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to 443cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
439two event changes per incident. Support for C<fork ()> is very bad and it 444two event changes per incident. Support for C<fork ()> is very bad (but
440drops fds silently in similarly hard-to-detect cases. 445sane, unlike epoll) and it drops fds silently in similarly hard-to-detect
446cases
441 447
442This backend usually performs well under most conditions. 448This backend usually performs well under most conditions.
443 449
444While nominally embeddable in other event loops, this doesn't work 450While nominally embeddable in other event loops, this doesn't work
445everywhere, so you might need to test for this. And since it is broken 451everywhere, so you might need to test for this. And since it is broken
474might perform better. 480might perform better.
475 481
476On the positive side, with the exception of the spurious readiness 482On the positive side, with the exception of the spurious readiness
477notifications, this backend actually performed fully to specification 483notifications, this backend actually performed fully to specification
478in all tests and is fully embeddable, which is a rare feat among the 484in all tests and is fully embeddable, which is a rare feat among the
479OS-specific backends. 485OS-specific backends (I vastly prefer correctness over speed hacks).
480 486
481This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 487This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
482C<EVBACKEND_POLL>. 488C<EVBACKEND_POLL>.
483 489
484=item C<EVBACKEND_ALL> 490=item C<EVBACKEND_ALL>
641the loop. 647the loop.
642 648
643A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 649A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
644necessary) and will handle those and any already outstanding ones. It 650necessary) and will handle those and any already outstanding ones. It
645will block your process until at least one new event arrives (which could 651will block your process until at least one new event arrives (which could
646be an event internal to libev itself, so there is no guarentee that a 652be an event internal to libev itself, so there is no guarantee that a
647user-registered callback will be called), and will return after one 653user-registered callback will be called), and will return after one
648iteration of the loop. 654iteration of the loop.
649 655
650This is useful if you are waiting for some external event in conjunction 656This is useful if you are waiting for some external event in conjunction
651with something not expressible using other libev watchers (i.e. "roll your 657with something not expressible using other libev watchers (i.e. "roll your
1916 1922
1917 1923
1918=head2 C<ev_stat> - did the file attributes just change? 1924=head2 C<ev_stat> - did the file attributes just change?
1919 1925
1920This watches a file system path for attribute changes. That is, it calls 1926This watches a file system path for attribute changes. That is, it calls
1921C<stat> regularly (or when the OS says it changed) and sees if it changed 1927C<stat> on that path in regular intervals (or when the OS says it changed)
1922compared to the last time, invoking the callback if it did. 1928and sees if it changed compared to the last time, invoking the callback if
1929it did.
1923 1930
1924The path does not need to exist: changing from "path exists" to "path does 1931The path does not need to exist: changing from "path exists" to "path does
1925not exist" is a status change like any other. The condition "path does 1932not exist" is a status change like any other. The condition "path does
1926not exist" is signified by the C<st_nlink> field being zero (which is 1933not exist" is signified by the C<st_nlink> field being zero (which is
1927otherwise always forced to be at least one) and all the other fields of 1934otherwise always forced to be at least one) and all the other fields of
1928the stat buffer having unspecified contents. 1935the stat buffer having unspecified contents.
1929 1936
1930The path I<should> be absolute and I<must not> end in a slash. If it is 1937The path I<must not> end in a slash or contain special components such as
1938C<.> or C<..>. The path I<should> be absolute: If it is relative and
1931relative and your working directory changes, the behaviour is undefined. 1939your working directory changes, then the behaviour is undefined.
1932 1940
1933Since there is no standard kernel interface to do this, the portable 1941Since there is no portable change notification interface available, the
1934implementation simply calls C<stat (2)> regularly on the path to see if 1942portable implementation simply calls C<stat(2)> regularly on the path
1935it changed somehow. You can specify a recommended polling interval for 1943to see if it changed somehow. You can specify a recommended polling
1936this case. If you specify a polling interval of C<0> (highly recommended!) 1944interval for this case. If you specify a polling interval of C<0> (highly
1937then a I<suitable, unspecified default> value will be used (which 1945recommended!) then a I<suitable, unspecified default> value will be used
1938you can expect to be around five seconds, although this might change 1946(which you can expect to be around five seconds, although this might
1939dynamically). Libev will also impose a minimum interval which is currently 1947change dynamically). Libev will also impose a minimum interval which is
1940around C<0.1>, but thats usually overkill. 1948currently around C<0.1>, but that's usually overkill.
1941 1949
1942This watcher type is not meant for massive numbers of stat watchers, 1950This watcher type is not meant for massive numbers of stat watchers,
1943as even with OS-supported change notifications, this can be 1951as even with OS-supported change notifications, this can be
1944resource-intensive. 1952resource-intensive.
1945 1953
1955support disabled by default, you get the 32 bit version of the stat 1963support disabled by default, you get the 32 bit version of the stat
1956structure. When using the library from programs that change the ABI to 1964structure. When using the library from programs that change the ABI to
1957use 64 bit file offsets the programs will fail. In that case you have to 1965use 64 bit file offsets the programs will fail. In that case you have to
1958compile libev with the same flags to get binary compatibility. This is 1966compile libev with the same flags to get binary compatibility. This is
1959obviously the case with any flags that change the ABI, but the problem is 1967obviously the case with any flags that change the ABI, but the problem is
1960most noticeably disabled with ev_stat and large file support. 1968most noticeably displayed with ev_stat and large file support.
1961 1969
1962The solution for this is to lobby your distribution maker to make large 1970The solution for this is to lobby your distribution maker to make large
1963file interfaces available by default (as e.g. FreeBSD does) and not 1971file interfaces available by default (as e.g. FreeBSD does) and not
1964optional. Libev cannot simply switch on large file support because it has 1972optional. Libev cannot simply switch on large file support because it has
1965to exchange stat structures with application programs compiled using the 1973to exchange stat structures with application programs compiled using the
1984descriptor open on the object at all times, and detecting renames, unlinks 1992descriptor open on the object at all times, and detecting renames, unlinks
1985etc. is difficult. 1993etc. is difficult.
1986 1994
1987=head3 The special problem of stat time resolution 1995=head3 The special problem of stat time resolution
1988 1996
1989The C<stat ()> system call only supports full-second resolution portably, and 1997The C<stat ()> system call only supports full-second resolution portably,
1990even on systems where the resolution is higher, most file systems still 1998and even on systems where the resolution is higher, most file systems
1991only support whole seconds. 1999still only support whole seconds.
1992 2000
1993That means that, if the time is the only thing that changes, you can 2001That means that, if the time is the only thing that changes, you can
1994easily miss updates: on the first update, C<ev_stat> detects a change and 2002easily miss updates: on the first update, C<ev_stat> detects a change and
1995calls your callback, which does something. When there is another update 2003calls your callback, which does something. When there is another update
1996within the same second, C<ev_stat> will be unable to detect unless the 2004within the same second, C<ev_stat> will be unable to detect unless the
2635=over 4 2643=over 4
2636 2644
2637=item ev_async_init (ev_async *, callback) 2645=item ev_async_init (ev_async *, callback)
2638 2646
2639Initialises and configures the async watcher - it has no parameters of any 2647Initialises and configures the async watcher - it has no parameters of any
2640kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, 2648kind. There is a C<ev_async_set> macro, but using it is utterly pointless,
2641trust me. 2649trust me.
2642 2650
2643=item ev_async_send (loop, ev_async *) 2651=item ev_async_send (loop, ev_async *)
2644 2652
2645Sends/signals/activates the given C<ev_async> watcher, that is, feeds 2653Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3078 3086
3079 #define EV_STANDALONE 1 3087 #define EV_STANDALONE 1
3080 #include "ev.h" 3088 #include "ev.h"
3081 3089
3082Both header files and implementation files can be compiled with a C++ 3090Both header files and implementation files can be compiled with a C++
3083compiler (at least, thats a stated goal, and breakage will be treated 3091compiler (at least, that's a stated goal, and breakage will be treated
3084as a bug). 3092as a bug).
3085 3093
3086You need the following files in your source tree, or in a directory 3094You need the following files in your source tree, or in a directory
3087in your include path (e.g. in libev/ when using -Ilibev): 3095in your include path (e.g. in libev/ when using -Ilibev):
3088 3096
3560loop, as long as you don't confuse yourself). The only exception is that 3568loop, as long as you don't confuse yourself). The only exception is that
3561you must not do this from C<ev_periodic> reschedule callbacks. 3569you must not do this from C<ev_periodic> reschedule callbacks.
3562 3570
3563Care has been taken to ensure that libev does not keep local state inside 3571Care has been taken to ensure that libev does not keep local state inside
3564C<ev_loop>, and other calls do not usually allow for coroutine switches as 3572C<ev_loop>, and other calls do not usually allow for coroutine switches as
3565they do not clal any callbacks. 3573they do not call any callbacks.
3566 3574
3567=head2 COMPILER WARNINGS 3575=head2 COMPILER WARNINGS
3568 3576
3569Depending on your compiler and compiler settings, you might get no or a 3577Depending on your compiler and compiler settings, you might get no or a
3570lot of warnings when compiling libev code. Some people are apparently 3578lot of warnings when compiling libev code. Some people are apparently
3604 ==2274== definitely lost: 0 bytes in 0 blocks. 3612 ==2274== definitely lost: 0 bytes in 0 blocks.
3605 ==2274== possibly lost: 0 bytes in 0 blocks. 3613 ==2274== possibly lost: 0 bytes in 0 blocks.
3606 ==2274== still reachable: 256 bytes in 1 blocks. 3614 ==2274== still reachable: 256 bytes in 1 blocks.
3607 3615
3608Then there is no memory leak, just as memory accounted to global variables 3616Then there is no memory leak, just as memory accounted to global variables
3609is not a memleak - the memory is still being refernced, and didn't leak. 3617is not a memleak - the memory is still being referenced, and didn't leak.
3610 3618
3611Similarly, under some circumstances, valgrind might report kernel bugs 3619Similarly, under some circumstances, valgrind might report kernel bugs
3612as if it were a bug in libev (e.g. in realloc or in the poll backend, 3620as if it were a bug in libev (e.g. in realloc or in the poll backend,
3613although an acceptable workaround has been found here), or it might be 3621although an acceptable workaround has been found here), or it might be
3614confused. 3622confused.
3852=back 3860=back
3853 3861
3854 3862
3855=head1 AUTHOR 3863=head1 AUTHOR
3856 3864
3857Marc Lehmann <libev@schmorp.de>. 3865Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3858 3866

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines