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.211 by root, Mon Nov 3 14:34:16 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
424This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 426This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
425C<EVBACKEND_POLL>. 427C<EVBACKEND_POLL>.
426 428
427=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 429=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
428 430
429Kqueue deserves special mention, as at the time of this writing, it was 431Kqueue deserves special mention, as at the time of this writing, it
430broken on all BSDs except NetBSD (usually it doesn't work reliably with 432was 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 433with anything but sockets and pipes, except on Darwin, where of course
432completely useless). For this reason it's not being "auto-detected" unless 434it's completely useless). Unlike epoll, however, whose brokenness
433you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or 435is by design, these kqueue bugs can (and eventually will) be fixed
434libev was compiled on a known-to-be-good (-enough) system like NetBSD. 436without API changes to existing programs. For this reason it's not being
437"auto-detected" unless you explicitly specify it in the flags (i.e. using
438C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
439system like NetBSD.
435 440
436You still can embed kqueue into a normal poll or select backend and use it 441You 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 442only for sockets (after having made sure that sockets work with kqueue on
438the target platform). See C<ev_embed> watchers for more info. 443the target platform). See C<ev_embed> watchers for more info.
439 444
1927C<stat> on that path in regular intervals (or when the OS says it changed) 1932C<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 1933and sees if it changed compared to the last time, invoking the callback if
1929it did. 1934it did.
1930 1935
1931The path does not need to exist: changing from "path exists" to "path does 1936The 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 1937not 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 1938exist" (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 1939C<st_nlink> field being zero (which is otherwise always forced to be at
1935the stat buffer having unspecified contents. 1940least one) and all the other fields of the stat buffer having unspecified
1941contents.
1936 1942
1937The path I<must not> end in a slash or contain special components such as 1943The 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 1944C<.> or C<..>. The path I<should> be absolute: If it is relative and
1939your working directory changes, then the behaviour is undefined. 1945your working directory changes, then the behaviour is undefined.
1940 1946
1950This watcher type is not meant for massive numbers of stat watchers, 1956This watcher type is not meant for massive numbers of stat watchers,
1951as even with OS-supported change notifications, this can be 1957as even with OS-supported change notifications, this can be
1952resource-intensive. 1958resource-intensive.
1953 1959
1954At the time of this writing, the only OS-specific interface implemented 1960At the time of this writing, the only OS-specific interface implemented
1955is the Linux inotify interface (implementing kqueue support is left as 1961is the Linux inotify interface (implementing kqueue support is left as an
1956an exercise for the reader. Note, however, that the author sees no way 1962exercise for the reader. Note, however, that the author sees no way of
1957of implementing C<ev_stat> semantics with kqueue). 1963implementing C<ev_stat> semantics with kqueue, except as a hint).
1958 1964
1959=head3 ABI Issues (Largefile Support) 1965=head3 ABI Issues (Largefile Support)
1960 1966
1961Libev by default (unless the user overrides this) uses the default 1967Libev by default (unless the user overrides this) uses the default
1962compilation environment, which means that on systems with large file 1968compilation environment, which means that on systems with large file
1973to exchange stat structures with application programs compiled using the 1979to exchange stat structures with application programs compiled using the
1974default compilation environment. 1980default compilation environment.
1975 1981
1976=head3 Inotify and Kqueue 1982=head3 Inotify and Kqueue
1977 1983
1978When C<inotify (7)> support has been compiled into libev (generally 1984When 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 1985runtime, it will be used to speed up change detection where possible. The
1980implementations) and present at runtime, it will be used to speed up 1986inotify descriptor will be created lazily when the first C<ev_stat>
1981change detection where possible. The inotify descriptor will be created 1987watcher is being started.
1982lazily when the first C<ev_stat> watcher is being started.
1983 1988
1984Inotify presence does not change the semantics of C<ev_stat> watchers 1989Inotify presence does not change the semantics of C<ev_stat> watchers
1985except that changes might be detected earlier, and in some cases, to avoid 1990except that changes might be detected earlier, and in some cases, to avoid
1986making regular C<stat> calls. Even in the presence of inotify support 1991making 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, 1992there 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. 1993but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too
1994many bugs), the path exists (i.e. stat succeeds), and the path resides on
1995a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and
1996xfs are fully working) libev usually gets away without polling.
1989 1997
1990There is no support for kqueue, as apparently it cannot be used to 1998There is no support for kqueue, as apparently it cannot be used to
1991implement this functionality, due to the requirement of having a file 1999implement this functionality, due to the requirement of having a file
1992descriptor open on the object at all times, and detecting renames, unlinks 2000descriptor open on the object at all times, and detecting renames, unlinks
1993etc. is difficult. 2001etc. is difficult.
3860=back 3868=back
3861 3869
3862 3870
3863=head1 AUTHOR 3871=head1 AUTHOR
3864 3872
3865Marc Lehmann <libev@schmorp.de>. 3873Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3866 3874

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines