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

Comparing libev/ev.pod (file contents):
Revision 1.206 by root, Tue Oct 28 12:31:38 2008 UTC vs.
Revision 1.211 by root, Mon Nov 3 14:34:16 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 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
647the loop. 652the loop.
648 653
649A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 654A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
650necessary) and will handle those and any already outstanding ones. It 655necessary) and will handle those and any already outstanding ones. It
651will block your process until at least one new event arrives (which could 656will block your process until at least one new event arrives (which could
652be an event internal to libev itself, so there is no guarentee that a 657be an event internal to libev itself, so there is no guarantee that a
653user-registered callback will be called), and will return after one 658user-registered callback will be called), and will return after one
654iteration of the loop. 659iteration of the loop.
655 660
656This is useful if you are waiting for some external event in conjunction 661This is useful if you are waiting for some external event in conjunction
657with something not expressible using other libev watchers (i.e. "roll your 662with something not expressible using other libev watchers (i.e. "roll your
1922 1927
1923 1928
1924=head2 C<ev_stat> - did the file attributes just change? 1929=head2 C<ev_stat> - did the file attributes just change?
1925 1930
1926This watches a file system path for attribute changes. That is, it calls 1931This watches a file system path for attribute changes. That is, it calls
1927C<stat> regularly (or when the OS says it changed) and sees if it changed 1932C<stat> on that path in regular intervals (or when the OS says it changed)
1928compared to the last time, invoking the callback if it did. 1933and sees if it changed compared to the last time, invoking the callback if
1934it did.
1929 1935
1930The 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
1931not 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
1932not 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
1933otherwise 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
1934the stat buffer having unspecified contents. 1940least one) and all the other fields of the stat buffer having unspecified
1941contents.
1935 1942
1936The path I<should> be absolute and I<must not> end in a slash. If it is 1943The path I<must not> end in a slash or contain special components such as
1944C<.> or C<..>. The path I<should> be absolute: If it is relative and
1937relative and your working directory changes, the behaviour is undefined. 1945your working directory changes, then the behaviour is undefined.
1938 1946
1939Since there is no standard kernel interface to do this, the portable 1947Since there is no portable change notification interface available, the
1940implementation simply calls C<stat (2)> regularly on the path to see if 1948portable implementation simply calls C<stat(2)> regularly on the path
1941it changed somehow. You can specify a recommended polling interval for 1949to see if it changed somehow. You can specify a recommended polling
1942this case. If you specify a polling interval of C<0> (highly recommended!) 1950interval for this case. If you specify a polling interval of C<0> (highly
1943then a I<suitable, unspecified default> value will be used (which 1951recommended!) then a I<suitable, unspecified default> value will be used
1944you can expect to be around five seconds, although this might change 1952(which you can expect to be around five seconds, although this might
1945dynamically). Libev will also impose a minimum interval which is currently 1953change dynamically). Libev will also impose a minimum interval which is
1946around C<0.1>, but thats usually overkill. 1954currently around C<0.1>, but that's usually overkill.
1947 1955
1948This watcher type is not meant for massive numbers of stat watchers, 1956This watcher type is not meant for massive numbers of stat watchers,
1949as even with OS-supported change notifications, this can be 1957as even with OS-supported change notifications, this can be
1950resource-intensive. 1958resource-intensive.
1951 1959
1952At the time of this writing, the only OS-specific interface implemented 1960At the time of this writing, the only OS-specific interface implemented
1953is the Linux inotify interface (implementing kqueue support is left as 1961is the Linux inotify interface (implementing kqueue support is left as an
1954an 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
1955of implementing C<ev_stat> semantics with kqueue). 1963implementing C<ev_stat> semantics with kqueue, except as a hint).
1956 1964
1957=head3 ABI Issues (Largefile Support) 1965=head3 ABI Issues (Largefile Support)
1958 1966
1959Libev by default (unless the user overrides this) uses the default 1967Libev by default (unless the user overrides this) uses the default
1960compilation environment, which means that on systems with large file 1968compilation environment, which means that on systems with large file
1961support disabled by default, you get the 32 bit version of the stat 1969support disabled by default, you get the 32 bit version of the stat
1962structure. When using the library from programs that change the ABI to 1970structure. When using the library from programs that change the ABI to
1963use 64 bit file offsets the programs will fail. In that case you have to 1971use 64 bit file offsets the programs will fail. In that case you have to
1964compile libev with the same flags to get binary compatibility. This is 1972compile libev with the same flags to get binary compatibility. This is
1965obviously the case with any flags that change the ABI, but the problem is 1973obviously the case with any flags that change the ABI, but the problem is
1966most noticeably disabled with ev_stat and large file support. 1974most noticeably displayed with ev_stat and large file support.
1967 1975
1968The solution for this is to lobby your distribution maker to make large 1976The solution for this is to lobby your distribution maker to make large
1969file interfaces available by default (as e.g. FreeBSD does) and not 1977file interfaces available by default (as e.g. FreeBSD does) and not
1970optional. Libev cannot simply switch on large file support because it has 1978optional. Libev cannot simply switch on large file support because it has
1971to exchange stat structures with application programs compiled using the 1979to exchange stat structures with application programs compiled using the
1972default compilation environment. 1980default compilation environment.
1973 1981
1974=head3 Inotify and Kqueue 1982=head3 Inotify and Kqueue
1975 1983
1976When C<inotify (7)> support has been compiled into libev (generally 1984When C<inotify (7)> support has been compiled into libev and present at
1977only 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
1978implementations) and present at runtime, it will be used to speed up 1986inotify descriptor will be created lazily when the first C<ev_stat>
1979change detection where possible. The inotify descriptor will be created 1987watcher is being started.
1980lazily when the first C<ev_stat> watcher is being started.
1981 1988
1982Inotify presence does not change the semantics of C<ev_stat> watchers 1989Inotify presence does not change the semantics of C<ev_stat> watchers
1983except 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
1984making regular C<stat> calls. Even in the presence of inotify support 1991making regular C<stat> calls. Even in the presence of inotify support
1985there 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,
1986but 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.
1987 1997
1988There 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
1989implement this functionality, due to the requirement of having a file 1999implement this functionality, due to the requirement of having a file
1990descriptor open on the object at all times, and detecting renames, unlinks 2000descriptor open on the object at all times, and detecting renames, unlinks
1991etc. is difficult. 2001etc. is difficult.
1992 2002
1993=head3 The special problem of stat time resolution 2003=head3 The special problem of stat time resolution
1994 2004
1995The C<stat ()> system call only supports full-second resolution portably, and 2005The C<stat ()> system call only supports full-second resolution portably,
1996even on systems where the resolution is higher, most file systems still 2006and even on systems where the resolution is higher, most file systems
1997only support whole seconds. 2007still only support whole seconds.
1998 2008
1999That means that, if the time is the only thing that changes, you can 2009That means that, if the time is the only thing that changes, you can
2000easily miss updates: on the first update, C<ev_stat> detects a change and 2010easily miss updates: on the first update, C<ev_stat> detects a change and
2001calls your callback, which does something. When there is another update 2011calls your callback, which does something. When there is another update
2002within the same second, C<ev_stat> will be unable to detect unless the 2012within the same second, C<ev_stat> will be unable to detect unless the
2641=over 4 2651=over 4
2642 2652
2643=item ev_async_init (ev_async *, callback) 2653=item ev_async_init (ev_async *, callback)
2644 2654
2645Initialises and configures the async watcher - it has no parameters of any 2655Initialises and configures the async watcher - it has no parameters of any
2646kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, 2656kind. There is a C<ev_async_set> macro, but using it is utterly pointless,
2647trust me. 2657trust me.
2648 2658
2649=item ev_async_send (loop, ev_async *) 2659=item ev_async_send (loop, ev_async *)
2650 2660
2651Sends/signals/activates the given C<ev_async> watcher, that is, feeds 2661Sends/signals/activates the given C<ev_async> watcher, that is, feeds
3084 3094
3085 #define EV_STANDALONE 1 3095 #define EV_STANDALONE 1
3086 #include "ev.h" 3096 #include "ev.h"
3087 3097
3088Both header files and implementation files can be compiled with a C++ 3098Both header files and implementation files can be compiled with a C++
3089compiler (at least, thats a stated goal, and breakage will be treated 3099compiler (at least, that's a stated goal, and breakage will be treated
3090as a bug). 3100as a bug).
3091 3101
3092You need the following files in your source tree, or in a directory 3102You need the following files in your source tree, or in a directory
3093in your include path (e.g. in libev/ when using -Ilibev): 3103in your include path (e.g. in libev/ when using -Ilibev):
3094 3104
3566loop, as long as you don't confuse yourself). The only exception is that 3576loop, as long as you don't confuse yourself). The only exception is that
3567you must not do this from C<ev_periodic> reschedule callbacks. 3577you must not do this from C<ev_periodic> reschedule callbacks.
3568 3578
3569Care has been taken to ensure that libev does not keep local state inside 3579Care has been taken to ensure that libev does not keep local state inside
3570C<ev_loop>, and other calls do not usually allow for coroutine switches as 3580C<ev_loop>, and other calls do not usually allow for coroutine switches as
3571they do not clal any callbacks. 3581they do not call any callbacks.
3572 3582
3573=head2 COMPILER WARNINGS 3583=head2 COMPILER WARNINGS
3574 3584
3575Depending on your compiler and compiler settings, you might get no or a 3585Depending on your compiler and compiler settings, you might get no or a
3576lot of warnings when compiling libev code. Some people are apparently 3586lot of warnings when compiling libev code. Some people are apparently
3610 ==2274== definitely lost: 0 bytes in 0 blocks. 3620 ==2274== definitely lost: 0 bytes in 0 blocks.
3611 ==2274== possibly lost: 0 bytes in 0 blocks. 3621 ==2274== possibly lost: 0 bytes in 0 blocks.
3612 ==2274== still reachable: 256 bytes in 1 blocks. 3622 ==2274== still reachable: 256 bytes in 1 blocks.
3613 3623
3614Then there is no memory leak, just as memory accounted to global variables 3624Then there is no memory leak, just as memory accounted to global variables
3615is not a memleak - the memory is still being refernced, and didn't leak. 3625is not a memleak - the memory is still being referenced, and didn't leak.
3616 3626
3617Similarly, under some circumstances, valgrind might report kernel bugs 3627Similarly, under some circumstances, valgrind might report kernel bugs
3618as if it were a bug in libev (e.g. in realloc or in the poll backend, 3628as if it were a bug in libev (e.g. in realloc or in the poll backend,
3619although an acceptable workaround has been found here), or it might be 3629although an acceptable workaround has been found here), or it might be
3620confused. 3630confused.
3858=back 3868=back
3859 3869
3860 3870
3861=head1 AUTHOR 3871=head1 AUTHOR
3862 3872
3863Marc Lehmann <libev@schmorp.de>. 3873Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3864 3874

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines