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

Comparing libev/ev.pod (file contents):
Revision 1.208 by root, Wed Oct 29 10:24:23 2008 UTC vs.
Revision 1.213 by root, Wed Nov 5 02:48:45 2008 UTC

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 event 391The epoll mechanism deserves honorable mention as the most misdesigned
392mechanisms: problems include silently dropping fds, requiring a system 392of the more advanced event mechanisms: mere annoyances include silently
393call per change per fd (and unnecessary guessing of parameters), problems 393dropping file descriptors, requiring a system call per change per file
394descriptor (and unnecessary guessing of parameters), problems with dup and
394with dup and so on. The biggest issue is fork races, however - if a 395so on. The biggest issue is fork races, however - if a program forks then
395program forks then I<both> parent and child process have to recreate the 396I<both> parent and child process have to recreate the epoll set, which can
396epoll set, which can take considerable time (one syscall per fd) and is of 397take considerable time (one syscall per file descriptor) and is of course
397course hard to detect. 398hard to detect.
398 399
399Epoll is also notoriously buggy - embedding epoll fds should work, but 400Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
400of course doesn't, and epoll just loves to report events for totally 401of course I<doesn't>, and epoll just loves to report events for totally
401I<different> file descriptors (even already closed ones, so one cannot 402I<different> file descriptors (even already closed ones, so one cannot
402even remove them from the set) than registered in the set (especially 403even remove them from the set) than registered in the set (especially
403on SMP systems). Libev tries to counter these spurious notifications by 404on SMP systems). Libev tries to counter these spurious notifications by
404employing an additional generation counter and comparing that against the 405employing an additional generation counter and comparing that against the
405events to filter out spurious ones. 406events to filter out spurious ones, recreating the set when required.
406 407
407While 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
408will 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
409(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
410best 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
411very well if you register events for both fds. 412file descriptors might not work very well if you register events for both
413file descriptors.
412 414
413Best performance from this backend is achieved by not unregistering all 415Best performance from this backend is achieved by not unregistering all
414watchers for a file descriptor until it has been closed, if possible, 416watchers for a file descriptor until it has been closed, if possible,
415i.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
416starting a watcher (without re-setting it) also usually doesn't cause 418starting a watcher (without re-setting it) also usually doesn't cause
417extra overhead. A fork can both result in spurious notifications as well 419extra overhead. A fork can both result in spurious notifications as well
418as in libev having to destroy and recreate the epoll object, which can 420as in libev having to destroy and recreate the epoll object, which can
419take considerable time and thus should be avoided. 421take considerable time and thus should be avoided.
420 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.
425
421While nominally embeddable in other event loops, this feature is broken in 426While nominally embeddable in other event loops, this feature is broken in
422all kernel versions tested so far. 427all kernel versions tested so far.
423 428
424This 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
425C<EVBACKEND_POLL>. 430C<EVBACKEND_POLL>.
426 431
427=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 432=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
428 433
429Kqueue deserves special mention, as at the time of this writing, it was 434Kqueue deserves special mention, as at the time of this writing, it
430broken 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
431anything but sockets and pipes, except on Darwin, where of course it's 436with anything but sockets and pipes, except on Darwin, where of course
432completely useless). For this reason it's not being "auto-detected" unless 437it's completely useless). Unlike epoll, however, whose brokenness
433you 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
434libev 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.
435 443
436You 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
437only 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
438the target platform). See C<ev_embed> watchers for more info. 446the target platform). See C<ev_embed> watchers for more info.
439 447
1927C<stat> on that path in regular intervals (or when the OS says it changed) 1935C<stat> on that path in regular intervals (or when the OS says it changed)
1928and sees if it changed compared to the last time, invoking the callback if 1936and sees if it changed compared to the last time, invoking the callback if
1929it did. 1937it did.
1930 1938
1931The 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
1932not 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
1933not 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
1934otherwise 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
1935the stat buffer having unspecified contents. 1943least one) and all the other fields of the stat buffer having unspecified
1944contents.
1936 1945
1937The path I<must not> end in a slash or contain special components such as 1946The 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 1947C<.> or C<..>. The path I<should> be absolute: If it is relative and
1939your working directory changes, then the behaviour is undefined. 1948your working directory changes, then the behaviour is undefined.
1940 1949
1950This watcher type is not meant for massive numbers of stat watchers, 1959This watcher type is not meant for massive numbers of stat watchers,
1951as even with OS-supported change notifications, this can be 1960as even with OS-supported change notifications, this can be
1952resource-intensive. 1961resource-intensive.
1953 1962
1954At the time of this writing, the only OS-specific interface implemented 1963At the time of this writing, the only OS-specific interface implemented
1955is the Linux inotify interface (implementing kqueue support is left as 1964is the Linux inotify interface (implementing kqueue support is left as an
1956an 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
1957of implementing C<ev_stat> semantics with kqueue). 1966implementing C<ev_stat> semantics with kqueue, except as a hint).
1958 1967
1959=head3 ABI Issues (Largefile Support) 1968=head3 ABI Issues (Largefile Support)
1960 1969
1961Libev by default (unless the user overrides this) uses the default 1970Libev by default (unless the user overrides this) uses the default
1962compilation environment, which means that on systems with large file 1971compilation environment, which means that on systems with large file
1973to exchange stat structures with application programs compiled using the 1982to exchange stat structures with application programs compiled using the
1974default compilation environment. 1983default compilation environment.
1975 1984
1976=head3 Inotify and Kqueue 1985=head3 Inotify and Kqueue
1977 1986
1978When C<inotify (7)> support has been compiled into libev (generally 1987When C<inotify (7)> support has been compiled into libev and present at
1979only 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
1980implementations) and present at runtime, it will be used to speed up 1989inotify descriptor will be created lazily when the first C<ev_stat>
1981change detection where possible. The inotify descriptor will be created 1990watcher is being started.
1982lazily when the first C<ev_stat> watcher is being started.
1983 1991
1984Inotify presence does not change the semantics of C<ev_stat> watchers 1992Inotify presence does not change the semantics of C<ev_stat> watchers
1985except 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
1986making regular C<stat> calls. Even in the presence of inotify support 1994making regular C<stat> calls. Even in the presence of inotify support
1987there 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,
1988but 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.
1989 2000
1990There 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
1991implement this functionality, due to the requirement of having a file 2002implement this functionality, due to the requirement of having a file
1992descriptor open on the object at all times, and detecting renames, unlinks 2003descriptor open on the object at all times, and detecting renames, unlinks
1993etc. is difficult. 2004etc. is difficult.
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.
1994 2023
1995=head3 The special problem of stat time resolution 2024=head3 The special problem of stat time resolution
1996 2025
1997The C<stat ()> system call only supports full-second resolution portably, 2026The C<stat ()> system call only supports full-second resolution portably,
1998and even on systems where the resolution is higher, most file systems 2027and even on systems where the resolution is higher, most file systems
3860=back 3889=back
3861 3890
3862 3891
3863=head1 AUTHOR 3892=head1 AUTHOR
3864 3893
3865Marc Lehmann <libev@schmorp.de>. 3894Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3866 3895

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines