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

Comparing libev/ev.pod (file contents):
Revision 1.202 by root, Fri Oct 24 08:30:01 2008 UTC vs.
Revision 1.213 by root, Wed Nov 5 02:48:45 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
384=item C<EVBACKEND_EPOLL> (value 4, Linux) 384=item C<EVBACKEND_EPOLL> (value 4, Linux)
385 385
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). The epoll design has a number 389epoll scales either O(1) or O(active_fds).
390of shortcomings, such as silently dropping events in some hard-to-detect 390
391cases and requiring a system call per fd change, no fork support and bad 391The epoll mechanism deserves honorable mention as the most misdesigned
392support for dup. 392of the more advanced event mechanisms: mere annoyances include silently
393dropping file descriptors, requiring a system call per change per file
394descriptor (and unnecessary guessing of parameters), problems with dup and
395so on. The biggest issue is fork races, however - if a program forks then
396I<both> parent and child process have to recreate the epoll set, which can
397take considerable time (one syscall per file descriptor) and is of course
398hard to detect.
399
400Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
401of course I<doesn't>, and epoll just loves to report events for totally
402I<different> file descriptors (even already closed ones, so one cannot
403even remove them from the set) than registered in the set (especially
404on SMP systems). Libev tries to counter these spurious notifications by
405employing an additional generation counter and comparing that against the
406events to filter out spurious ones, recreating the set when required.
393 407
394While stopping, setting and starting an I/O watcher in the same iteration 408While stopping, setting and starting an I/O watcher in the same iteration
395will result in some caching, there is still a system call per such incident 409will result in some caching, there is still a system call per such
396(because the fd could point to a different file description now), so its 410incident (because the same I<file descriptor> could point to a different
397best to avoid that. Also, C<dup ()>'ed file descriptors might not work 411I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
398very well if you register events for both fds. 412file descriptors might not work very well if you register events for both
399 413file descriptors.
400Please note that epoll sometimes generates spurious notifications, so you
401need to use non-blocking I/O or other means to avoid blocking when no data
402(or space) is available.
403 414
404Best performance from this backend is achieved by not unregistering all 415Best performance from this backend is achieved by not unregistering all
405watchers for a file descriptor until it has been closed, if possible, 416watchers for a file descriptor until it has been closed, if possible,
406i.e. keep at least one watcher active per fd at all times. Stopping and 417i.e. keep at least one watcher active per fd at all times. Stopping and
407starting a watcher (without re-setting it) also usually doesn't cause 418starting a watcher (without re-setting it) also usually doesn't cause
408extra overhead. 419extra overhead. A fork can both result in spurious notifications as well
420as in libev having to destroy and recreate the epoll object, which can
421take considerable time and thus should be avoided.
422
423All this means that, in practise, C<EVBACKEND_SELECT> is as fast or faster
424then epoll for maybe up to a hundred file descriptors. So sad.
409 425
410While nominally embeddable in other event loops, this feature is broken in 426While nominally embeddable in other event loops, this feature is broken in
411all kernel versions tested so far. 427all kernel versions tested so far.
412 428
413This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 429This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
414C<EVBACKEND_POLL>. 430C<EVBACKEND_POLL>.
415 431
416=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 432=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
417 433
418Kqueue deserves special mention, as at the time of this writing, it was 434Kqueue deserves special mention, as at the time of this writing, it
419broken on all BSDs except NetBSD (usually it doesn't work reliably with 435was broken on all BSDs except NetBSD (usually it doesn't work reliably
420anything but sockets and pipes, except on Darwin, where of course it's 436with anything but sockets and pipes, except on Darwin, where of course
421completely useless). For this reason it's not being "auto-detected" unless 437it's completely useless). Unlike epoll, however, whose brokenness
422you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or 438is by design, these kqueue bugs can (and eventually will) be fixed
423libev was compiled on a known-to-be-good (-enough) system like NetBSD. 439without API changes to existing programs. For this reason it's not being
440"auto-detected" unless you explicitly specify it in the flags (i.e. using
441C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
442system like NetBSD.
424 443
425You still can embed kqueue into a normal poll or select backend and use it 444You still can embed kqueue into a normal poll or select backend and use it
426only for sockets (after having made sure that sockets work with kqueue on 445only for sockets (after having made sure that sockets work with kqueue on
427the target platform). See C<ev_embed> watchers for more info. 446the target platform). See C<ev_embed> watchers for more info.
428 447
429It scales in the same way as the epoll backend, but the interface to the 448It scales in the same way as the epoll backend, but the interface to the
430kernel is more efficient (which says nothing about its actual speed, of 449kernel is more efficient (which says nothing about its actual speed, of
431course). While stopping, setting and starting an I/O watcher does never 450course). While stopping, setting and starting an I/O watcher does never
432cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to 451cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
433two event changes per incident. Support for C<fork ()> is very bad and it 452two event changes per incident. Support for C<fork ()> is very bad (but
434drops fds silently in similarly hard-to-detect cases. 453sane, unlike epoll) and it drops fds silently in similarly hard-to-detect
454cases
435 455
436This backend usually performs well under most conditions. 456This backend usually performs well under most conditions.
437 457
438While nominally embeddable in other event loops, this doesn't work 458While nominally embeddable in other event loops, this doesn't work
439everywhere, so you might need to test for this. And since it is broken 459everywhere, so you might need to test for this. And since it is broken
468might perform better. 488might perform better.
469 489
470On the positive side, with the exception of the spurious readiness 490On the positive side, with the exception of the spurious readiness
471notifications, this backend actually performed fully to specification 491notifications, this backend actually performed fully to specification
472in all tests and is fully embeddable, which is a rare feat among the 492in all tests and is fully embeddable, which is a rare feat among the
473OS-specific backends. 493OS-specific backends (I vastly prefer correctness over speed hacks).
474 494
475This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 495This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
476C<EVBACKEND_POLL>. 496C<EVBACKEND_POLL>.
477 497
478=item C<EVBACKEND_ALL> 498=item C<EVBACKEND_ALL>
531responsibility to either stop all watchers cleanly yourself I<before> 551responsibility to either stop all watchers cleanly yourself I<before>
532calling this function, or cope with the fact afterwards (which is usually 552calling this function, or cope with the fact afterwards (which is usually
533the easiest thing, you can just ignore the watchers and/or C<free ()> them 553the easiest thing, you can just ignore the watchers and/or C<free ()> them
534for example). 554for example).
535 555
536Note that certain global state, such as signal state, will not be freed by 556Note that certain global state, such as signal state (and installed signal
537this function, and related watchers (such as signal and child watchers) 557handlers), will not be freed by this function, and related watchers (such
538would need to be stopped manually. 558as signal and child watchers) would need to be stopped manually.
539 559
540In general it is not advisable to call this function except in the 560In general it is not advisable to call this function except in the
541rare occasion where you really need to free e.g. the signal handling 561rare occasion where you really need to free e.g. the signal handling
542pipe fds. If you need dynamically allocated loops it is better to use 562pipe fds. If you need dynamically allocated loops it is better to use
543C<ev_loop_new> and C<ev_loop_destroy>). 563C<ev_loop_new> and C<ev_loop_destroy>).
635the loop. 655the loop.
636 656
637A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 657A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
638necessary) and will handle those and any already outstanding ones. It 658necessary) and will handle those and any already outstanding ones. It
639will block your process until at least one new event arrives (which could 659will block your process until at least one new event arrives (which could
640be an event internal to libev itself, so there is no guarentee that a 660be an event internal to libev itself, so there is no guarantee that a
641user-registered callback will be called), and will return after one 661user-registered callback will be called), and will return after one
642iteration of the loop. 662iteration of the loop.
643 663
644This is useful if you are waiting for some external event in conjunction 664This is useful if you are waiting for some external event in conjunction
645with something not expressible using other libev watchers (i.e. "roll your 665with something not expressible using other libev watchers (i.e. "roll your
1910 1930
1911 1931
1912=head2 C<ev_stat> - did the file attributes just change? 1932=head2 C<ev_stat> - did the file attributes just change?
1913 1933
1914This watches a file system path for attribute changes. That is, it calls 1934This watches a file system path for attribute changes. That is, it calls
1915C<stat> regularly (or when the OS says it changed) and sees if it changed 1935C<stat> on that path in regular intervals (or when the OS says it changed)
1916compared to the last time, invoking the callback if it did. 1936and sees if it changed compared to the last time, invoking the callback if
1937it did.
1917 1938
1918The path does not need to exist: changing from "path exists" to "path does 1939The path does not need to exist: changing from "path exists" to "path does
1919not exist" is a status change like any other. The condition "path does 1940not exist" is a status change like any other. The condition "path does not
1920not exist" is signified by the C<st_nlink> field being zero (which is 1941exist" (or more correctly "path cannot be stat'ed") is signified by the
1921otherwise always forced to be at least one) and all the other fields of 1942C<st_nlink> field being zero (which is otherwise always forced to be at
1922the stat buffer having unspecified contents. 1943least one) and all the other fields of the stat buffer having unspecified
1944contents.
1923 1945
1924The path I<should> be absolute and I<must not> end in a slash. If it is 1946The path I<must not> end in a slash or contain special components such as
1947C<.> or C<..>. The path I<should> be absolute: If it is relative and
1925relative and your working directory changes, the behaviour is undefined. 1948your working directory changes, then the behaviour is undefined.
1926 1949
1927Since there is no standard kernel interface to do this, the portable 1950Since there is no portable change notification interface available, the
1928implementation simply calls C<stat (2)> regularly on the path to see if 1951portable implementation simply calls C<stat(2)> regularly on the path
1929it changed somehow. You can specify a recommended polling interval for 1952to see if it changed somehow. You can specify a recommended polling
1930this case. If you specify a polling interval of C<0> (highly recommended!) 1953interval for this case. If you specify a polling interval of C<0> (highly
1931then a I<suitable, unspecified default> value will be used (which 1954recommended!) then a I<suitable, unspecified default> value will be used
1932you can expect to be around five seconds, although this might change 1955(which you can expect to be around five seconds, although this might
1933dynamically). Libev will also impose a minimum interval which is currently 1956change dynamically). Libev will also impose a minimum interval which is
1934around C<0.1>, but thats usually overkill. 1957currently around C<0.1>, but that's usually overkill.
1935 1958
1936This watcher type is not meant for massive numbers of stat watchers, 1959This watcher type is not meant for massive numbers of stat watchers,
1937as even with OS-supported change notifications, this can be 1960as even with OS-supported change notifications, this can be
1938resource-intensive. 1961resource-intensive.
1939 1962
1940At the time of this writing, the only OS-specific interface implemented 1963At the time of this writing, the only OS-specific interface implemented
1941is the Linux inotify interface (implementing kqueue support is left as 1964is the Linux inotify interface (implementing kqueue support is left as an
1942an exercise for the reader. Note, however, that the author sees no way 1965exercise for the reader. Note, however, that the author sees no way of
1943of implementing C<ev_stat> semantics with kqueue). 1966implementing C<ev_stat> semantics with kqueue, except as a hint).
1944 1967
1945=head3 ABI Issues (Largefile Support) 1968=head3 ABI Issues (Largefile Support)
1946 1969
1947Libev by default (unless the user overrides this) uses the default 1970Libev by default (unless the user overrides this) uses the default
1948compilation environment, which means that on systems with large file 1971compilation environment, which means that on systems with large file
1949support disabled by default, you get the 32 bit version of the stat 1972support disabled by default, you get the 32 bit version of the stat
1950structure. When using the library from programs that change the ABI to 1973structure. When using the library from programs that change the ABI to
1951use 64 bit file offsets the programs will fail. In that case you have to 1974use 64 bit file offsets the programs will fail. In that case you have to
1952compile libev with the same flags to get binary compatibility. This is 1975compile libev with the same flags to get binary compatibility. This is
1953obviously the case with any flags that change the ABI, but the problem is 1976obviously the case with any flags that change the ABI, but the problem is
1954most noticeably disabled with ev_stat and large file support. 1977most noticeably displayed with ev_stat and large file support.
1955 1978
1956The solution for this is to lobby your distribution maker to make large 1979The solution for this is to lobby your distribution maker to make large
1957file interfaces available by default (as e.g. FreeBSD does) and not 1980file interfaces available by default (as e.g. FreeBSD does) and not
1958optional. Libev cannot simply switch on large file support because it has 1981optional. Libev cannot simply switch on large file support because it has
1959to exchange stat structures with application programs compiled using the 1982to exchange stat structures with application programs compiled using the
1960default compilation environment. 1983default compilation environment.
1961 1984
1962=head3 Inotify and Kqueue 1985=head3 Inotify and Kqueue
1963 1986
1964When C<inotify (7)> support has been compiled into libev (generally 1987When C<inotify (7)> support has been compiled into libev and present at
1965only available with Linux 2.6.25 or above due to bugs in earlier 1988runtime, it will be used to speed up change detection where possible. The
1966implementations) and present at runtime, it will be used to speed up 1989inotify descriptor will be created lazily when the first C<ev_stat>
1967change detection where possible. The inotify descriptor will be created 1990watcher is being started.
1968lazily when the first C<ev_stat> watcher is being started.
1969 1991
1970Inotify presence does not change the semantics of C<ev_stat> watchers 1992Inotify presence does not change the semantics of C<ev_stat> watchers
1971except that changes might be detected earlier, and in some cases, to avoid 1993except that changes might be detected earlier, and in some cases, to avoid
1972making regular C<stat> calls. Even in the presence of inotify support 1994making regular C<stat> calls. Even in the presence of inotify support
1973there are many cases where libev has to resort to regular C<stat> polling, 1995there are many cases where libev has to resort to regular C<stat> polling,
1974but as long as the path exists, libev usually gets away without polling. 1996but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too
1997many bugs), the path exists (i.e. stat succeeds), and the path resides on
1998a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and
1999xfs are fully working) libev usually gets away without polling.
1975 2000
1976There is no support for kqueue, as apparently it cannot be used to 2001There is no support for kqueue, as apparently it cannot be used to
1977implement this functionality, due to the requirement of having a file 2002implement this functionality, due to the requirement of having a file
1978descriptor open on the object at all times, and detecting renames, unlinks 2003descriptor open on the object at all times, and detecting renames, unlinks
1979etc. is difficult. 2004etc. is difficult.
1980 2005
2006=head3 C<stat ()> is a synchronous operation
2007
2008Libev doesn't normally do any kind of I/O itself, and so is not blocking
2009the process. The exception are C<ev_stat> watchers - those call C<stat
2010()>, which is a synchronous operation.
2011
2012For local paths, this usually doesn't matter: unless the system is very
2013busy or the intervals between stat's are large, a stat call will be fast,
2014as the path data is suually in memory already (except when starting the
2015watcher).
2016
2017For networked file systems, calling C<stat ()> can block an indefinite
2018time due to network issues, and even under good conditions, a stat call
2019often takes multiple milliseconds.
2020
2021Therefore, it is best to avoid using C<ev_stat> watchers on networked
2022paths, although this is fully supported by libev.
2023
1981=head3 The special problem of stat time resolution 2024=head3 The special problem of stat time resolution
1982 2025
1983The C<stat ()> system call only supports full-second resolution portably, and 2026The C<stat ()> system call only supports full-second resolution portably,
1984even on systems where the resolution is higher, most file systems still 2027and even on systems where the resolution is higher, most file systems
1985only support whole seconds. 2028still only support whole seconds.
1986 2029
1987That means that, if the time is the only thing that changes, you can 2030That means that, if the time is the only thing that changes, you can
1988easily miss updates: on the first update, C<ev_stat> detects a change and 2031easily miss updates: on the first update, C<ev_stat> detects a change and
1989calls your callback, which does something. When there is another update 2032calls your callback, which does something. When there is another update
1990within the same second, C<ev_stat> will be unable to detect unless the 2033within the same second, C<ev_stat> will be unable to detect unless the
2629=over 4 2672=over 4
2630 2673
2631=item ev_async_init (ev_async *, callback) 2674=item ev_async_init (ev_async *, callback)
2632 2675
2633Initialises and configures the async watcher - it has no parameters of any 2676Initialises and configures the async watcher - it has no parameters of any
2634kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, 2677kind. There is a C<ev_async_set> macro, but using it is utterly pointless,
2635trust me. 2678trust me.
2636 2679
2637=item ev_async_send (loop, ev_async *) 2680=item ev_async_send (loop, ev_async *)
2638 2681
2639Sends/signals/activates the given C<ev_async> watcher, that is, feeds 2682Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3072 3115
3073 #define EV_STANDALONE 1 3116 #define EV_STANDALONE 1
3074 #include "ev.h" 3117 #include "ev.h"
3075 3118
3076Both header files and implementation files can be compiled with a C++ 3119Both header files and implementation files can be compiled with a C++
3077compiler (at least, thats a stated goal, and breakage will be treated 3120compiler (at least, that's a stated goal, and breakage will be treated
3078as a bug). 3121as a bug).
3079 3122
3080You need the following files in your source tree, or in a directory 3123You need the following files in your source tree, or in a directory
3081in your include path (e.g. in libev/ when using -Ilibev): 3124in your include path (e.g. in libev/ when using -Ilibev):
3082 3125
3554loop, as long as you don't confuse yourself). The only exception is that 3597loop, as long as you don't confuse yourself). The only exception is that
3555you must not do this from C<ev_periodic> reschedule callbacks. 3598you must not do this from C<ev_periodic> reschedule callbacks.
3556 3599
3557Care has been taken to ensure that libev does not keep local state inside 3600Care has been taken to ensure that libev does not keep local state inside
3558C<ev_loop>, and other calls do not usually allow for coroutine switches as 3601C<ev_loop>, and other calls do not usually allow for coroutine switches as
3559they do not clal any callbacks. 3602they do not call any callbacks.
3560 3603
3561=head2 COMPILER WARNINGS 3604=head2 COMPILER WARNINGS
3562 3605
3563Depending on your compiler and compiler settings, you might get no or a 3606Depending on your compiler and compiler settings, you might get no or a
3564lot of warnings when compiling libev code. Some people are apparently 3607lot of warnings when compiling libev code. Some people are apparently
3598 ==2274== definitely lost: 0 bytes in 0 blocks. 3641 ==2274== definitely lost: 0 bytes in 0 blocks.
3599 ==2274== possibly lost: 0 bytes in 0 blocks. 3642 ==2274== possibly lost: 0 bytes in 0 blocks.
3600 ==2274== still reachable: 256 bytes in 1 blocks. 3643 ==2274== still reachable: 256 bytes in 1 blocks.
3601 3644
3602Then there is no memory leak, just as memory accounted to global variables 3645Then there is no memory leak, just as memory accounted to global variables
3603is not a memleak - the memory is still being refernced, and didn't leak. 3646is not a memleak - the memory is still being referenced, and didn't leak.
3604 3647
3605Similarly, under some circumstances, valgrind might report kernel bugs 3648Similarly, under some circumstances, valgrind might report kernel bugs
3606as if it were a bug in libev (e.g. in realloc or in the poll backend, 3649as if it were a bug in libev (e.g. in realloc or in the poll backend,
3607although an acceptable workaround has been found here), or it might be 3650although an acceptable workaround has been found here), or it might be
3608confused. 3651confused.
3846=back 3889=back
3847 3890
3848 3891
3849=head1 AUTHOR 3892=head1 AUTHOR
3850 3893
3851Marc Lehmann <libev@schmorp.de>. 3894Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3852 3895

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines