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.223 by root, Sun Dec 14 21:58:08 2008 UTC

8 8
9=head2 EXAMPLE PROGRAM 9=head2 EXAMPLE PROGRAM
10 10
11 // a single header file is required 11 // a single header file is required
12 #include <ev.h> 12 #include <ev.h>
13
14 #include <stdio.h> // for puts
13 15
14 // every watcher type has its own typedef'd struct 16 // every watcher type has its own typedef'd struct
15 // with the name ev_TYPE 17 // with the name ev_TYPE
16 ev_io stdin_watcher; 18 ev_io stdin_watcher;
17 ev_timer timeout_watcher; 19 ev_timer timeout_watcher;
41 43
42 int 44 int
43 main (void) 45 main (void)
44 { 46 {
45 // use the default event loop unless you have special needs 47 // use the default event loop unless you have special needs
46 ev_loop *loop = ev_default_loop (0); 48 struct ev_loop *loop = ev_default_loop (0);
47 49
48 // initialise an io watcher, then start it 50 // initialise an io watcher, then start it
49 // this one will watch for stdin to become readable 51 // this one will watch for stdin to become readable
50 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); 52 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
51 ev_io_start (loop, &stdin_watcher); 53 ev_io_start (loop, &stdin_watcher);
386For few fds, this backend is a bit little slower than poll and select, 388For few fds, this backend is a bit little slower than poll and select,
387but it scales phenomenally better. While poll and select usually scale 389but 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), 390like O(total_fds) where n is the total number of fds (or the highest fd),
389epoll scales either O(1) or O(active_fds). 391epoll scales either O(1) or O(active_fds).
390 392
391The epoll syscalls are the most misdesigned of the more advanced event 393The epoll mechanism deserves honorable mention as the most misdesigned
392mechanisms: problems include silently dropping fds, requiring a system 394of the more advanced event mechanisms: mere annoyances include silently
393call per change per fd (and unnecessary guessing of parameters), problems 395dropping file descriptors, requiring a system call per change per file
396descriptor (and unnecessary guessing of parameters), problems with dup and
394with dup and so on. The biggest issue is fork races, however - if a 397so 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 398I<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 399take considerable time (one syscall per file descriptor) and is of course
397course hard to detect. 400hard to detect.
398 401
399Epoll is also notoriously buggy - embedding epoll fds should work, but 402Epoll is also notoriously buggy - embedding epoll fds I<should> work, but
400of course doesn't, and epoll just loves to report events for totally 403of course I<doesn't>, and epoll just loves to report events for totally
401I<different> file descriptors (even already closed ones, so one cannot 404I<different> file descriptors (even already closed ones, so one cannot
402even remove them from the set) than registered in the set (especially 405even remove them from the set) than registered in the set (especially
403on SMP systems). Libev tries to counter these spurious notifications by 406on SMP systems). Libev tries to counter these spurious notifications by
404employing an additional generation counter and comparing that against the 407employing an additional generation counter and comparing that against the
405events to filter out spurious ones. 408events to filter out spurious ones, recreating the set when required.
406 409
407While stopping, setting and starting an I/O watcher in the same iteration 410While 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 411will 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 412incident (because the same I<file descriptor> could point to a different
410best to avoid that. Also, C<dup ()>'ed file descriptors might not work 413I<file description> now), so its best to avoid that. Also, C<dup ()>'ed
411very well if you register events for both fds. 414file descriptors might not work very well if you register events for both
415file descriptors.
412 416
413Best performance from this backend is achieved by not unregistering all 417Best performance from this backend is achieved by not unregistering all
414watchers for a file descriptor until it has been closed, if possible, 418watchers 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 419i.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 420starting a watcher (without re-setting it) also usually doesn't cause
417extra overhead. A fork can both result in spurious notifications as well 421extra overhead. A fork can both result in spurious notifications as well
418as in libev having to destroy and recreate the epoll object, which can 422as in libev having to destroy and recreate the epoll object, which can
419take considerable time and thus should be avoided. 423take considerable time and thus should be avoided.
420 424
425All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
426faster than epoll for maybe up to a hundred file descriptors, depending on
427the usage. So sad.
428
421While nominally embeddable in other event loops, this feature is broken in 429While nominally embeddable in other event loops, this feature is broken in
422all kernel versions tested so far. 430all kernel versions tested so far.
423 431
424This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 432This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
425C<EVBACKEND_POLL>. 433C<EVBACKEND_POLL>.
426 434
427=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) 435=item C<EVBACKEND_KQUEUE> (value 8, most BSD clones)
428 436
429Kqueue deserves special mention, as at the time of this writing, it was 437Kqueue deserves special mention, as at the time of this writing, it
430broken on all BSDs except NetBSD (usually it doesn't work reliably with 438was 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 439with anything but sockets and pipes, except on Darwin, where of course
432completely useless). For this reason it's not being "auto-detected" unless 440it's completely useless). Unlike epoll, however, whose brokenness
433you explicitly specify it in the flags (i.e. using C<EVBACKEND_KQUEUE>) or 441is by design, these kqueue bugs can (and eventually will) be fixed
434libev was compiled on a known-to-be-good (-enough) system like NetBSD. 442without API changes to existing programs. For this reason it's not being
443"auto-detected" unless you explicitly specify it in the flags (i.e. using
444C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough)
445system like NetBSD.
435 446
436You still can embed kqueue into a normal poll or select backend and use it 447You 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 448only for sockets (after having made sure that sockets work with kqueue on
438the target platform). See C<ev_embed> watchers for more info. 449the target platform). See C<ev_embed> watchers for more info.
439 450
449 460
450While nominally embeddable in other event loops, this doesn't work 461While nominally embeddable in other event loops, this doesn't work
451everywhere, so you might need to test for this. And since it is broken 462everywhere, so you might need to test for this. And since it is broken
452almost everywhere, you should only use it when you have a lot of sockets 463almost everywhere, you should only use it when you have a lot of sockets
453(for which it usually works), by embedding it into another event loop 464(for which it usually works), by embedding it into another event loop
454(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and, did I mention it, 465(e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> (but C<poll> is of course
455using it only for sockets. 466also broken on OS X)) and, did I mention it, using it only for sockets.
456 467
457This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with 468This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with
458C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with 469C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with
459C<NOTE_EOF>. 470C<NOTE_EOF>.
460 471
1410 else 1421 else
1411 { 1422 {
1412 // callback was invoked, but there was some activity, re-arm 1423 // callback was invoked, but there was some activity, re-arm
1413 // the watcher to fire in last_activity + 60, which is 1424 // the watcher to fire in last_activity + 60, which is
1414 // guaranteed to be in the future, so "again" is positive: 1425 // guaranteed to be in the future, so "again" is positive:
1415 w->again = timeout - now; 1426 w->repeat = timeout - now;
1416 ev_timer_again (EV_A_ w); 1427 ev_timer_again (EV_A_ w);
1417 } 1428 }
1418 } 1429 }
1419 1430
1420To summarise the callback: first calculate the real timeout (defined 1431To summarise the callback: first calculate the real timeout (defined
1927C<stat> on that path in regular intervals (or when the OS says it changed) 1938C<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 1939and sees if it changed compared to the last time, invoking the callback if
1929it did. 1940it did.
1930 1941
1931The path does not need to exist: changing from "path exists" to "path does 1942The 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 1943not 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 1944exist" (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 1945C<st_nlink> field being zero (which is otherwise always forced to be at
1935the stat buffer having unspecified contents. 1946least one) and all the other fields of the stat buffer having unspecified
1947contents.
1936 1948
1937The path I<must not> end in a slash or contain special components such as 1949The 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 1950C<.> or C<..>. The path I<should> be absolute: If it is relative and
1939your working directory changes, then the behaviour is undefined. 1951your working directory changes, then the behaviour is undefined.
1940 1952
1950This watcher type is not meant for massive numbers of stat watchers, 1962This watcher type is not meant for massive numbers of stat watchers,
1951as even with OS-supported change notifications, this can be 1963as even with OS-supported change notifications, this can be
1952resource-intensive. 1964resource-intensive.
1953 1965
1954At the time of this writing, the only OS-specific interface implemented 1966At the time of this writing, the only OS-specific interface implemented
1955is the Linux inotify interface (implementing kqueue support is left as 1967is the Linux inotify interface (implementing kqueue support is left as an
1956an exercise for the reader. Note, however, that the author sees no way 1968exercise for the reader. Note, however, that the author sees no way of
1957of implementing C<ev_stat> semantics with kqueue). 1969implementing C<ev_stat> semantics with kqueue, except as a hint).
1958 1970
1959=head3 ABI Issues (Largefile Support) 1971=head3 ABI Issues (Largefile Support)
1960 1972
1961Libev by default (unless the user overrides this) uses the default 1973Libev by default (unless the user overrides this) uses the default
1962compilation environment, which means that on systems with large file 1974compilation environment, which means that on systems with large file
1973to exchange stat structures with application programs compiled using the 1985to exchange stat structures with application programs compiled using the
1974default compilation environment. 1986default compilation environment.
1975 1987
1976=head3 Inotify and Kqueue 1988=head3 Inotify and Kqueue
1977 1989
1978When C<inotify (7)> support has been compiled into libev (generally 1990When 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 1991runtime, it will be used to speed up change detection where possible. The
1980implementations) and present at runtime, it will be used to speed up 1992inotify descriptor will be created lazily when the first C<ev_stat>
1981change detection where possible. The inotify descriptor will be created 1993watcher is being started.
1982lazily when the first C<ev_stat> watcher is being started.
1983 1994
1984Inotify presence does not change the semantics of C<ev_stat> watchers 1995Inotify presence does not change the semantics of C<ev_stat> watchers
1985except that changes might be detected earlier, and in some cases, to avoid 1996except that changes might be detected earlier, and in some cases, to avoid
1986making regular C<stat> calls. Even in the presence of inotify support 1997making 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, 1998there 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. 1999but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too
2000many bugs), the path exists (i.e. stat succeeds), and the path resides on
2001a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and
2002xfs are fully working) libev usually gets away without polling.
1989 2003
1990There is no support for kqueue, as apparently it cannot be used to 2004There is no support for kqueue, as apparently it cannot be used to
1991implement this functionality, due to the requirement of having a file 2005implement this functionality, due to the requirement of having a file
1992descriptor open on the object at all times, and detecting renames, unlinks 2006descriptor open on the object at all times, and detecting renames, unlinks
1993etc. is difficult. 2007etc. is difficult.
2008
2009=head3 C<stat ()> is a synchronous operation
2010
2011Libev doesn't normally do any kind of I/O itself, and so is not blocking
2012the process. The exception are C<ev_stat> watchers - those call C<stat
2013()>, which is a synchronous operation.
2014
2015For local paths, this usually doesn't matter: unless the system is very
2016busy or the intervals between stat's are large, a stat call will be fast,
2017as the path data is usually in memory already (except when starting the
2018watcher).
2019
2020For networked file systems, calling C<stat ()> can block an indefinite
2021time due to network issues, and even under good conditions, a stat call
2022often takes multiple milliseconds.
2023
2024Therefore, it is best to avoid using C<ev_stat> watchers on networked
2025paths, although this is fully supported by libev.
1994 2026
1995=head3 The special problem of stat time resolution 2027=head3 The special problem of stat time resolution
1996 2028
1997The C<stat ()> system call only supports full-second resolution portably, 2029The C<stat ()> system call only supports full-second resolution portably,
1998and even on systems where the resolution is higher, most file systems 2030and even on systems where the resolution is higher, most file systems
2396some fds have to be watched and handled very quickly (with low latency), 2428some fds have to be watched and handled very quickly (with low latency),
2397and even priorities and idle watchers might have too much overhead. In 2429and even priorities and idle watchers might have too much overhead. In
2398this case you would put all the high priority stuff in one loop and all 2430this case you would put all the high priority stuff in one loop and all
2399the rest in a second one, and embed the second one in the first. 2431the rest in a second one, and embed the second one in the first.
2400 2432
2401As long as the watcher is active, the callback will be invoked every time 2433As long as the watcher is active, the callback will be invoked every
2402there might be events pending in the embedded loop. The callback must then 2434time there might be events pending in the embedded loop. The callback
2403call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke 2435must then call C<ev_embed_sweep (mainloop, watcher)> to make a single
2404their callbacks (you could also start an idle watcher to give the embedded 2436sweep and invoke their callbacks (the callback doesn't need to invoke the
2405loop strictly lower priority for example). You can also set the callback 2437C<ev_embed_sweep> function directly, it could also start an idle watcher
2406to C<0>, in which case the embed watcher will automatically execute the 2438to give the embedded loop strictly lower priority for example).
2407embedded loop sweep.
2408 2439
2409As long as the watcher is started it will automatically handle events. The 2440You can also set the callback to C<0>, in which case the embed watcher
2410callback will be invoked whenever some events have been handled. You can 2441will automatically execute the embedded loop sweep whenever necessary.
2411set the callback to C<0> to avoid having to specify one if you are not
2412interested in that.
2413 2442
2414Also, there have not currently been made special provisions for forking: 2443Fork detection will be handled transparently while the C<ev_embed> watcher
2415when you fork, you not only have to call C<ev_loop_fork> on both loops, 2444is active, i.e., the embedded loop will automatically be forked when the
2416but you will also have to stop and restart any C<ev_embed> watchers 2445embedding loop forks. In other cases, the user is responsible for calling
2417yourself - but you can use a fork watcher to handle this automatically, 2446C<ev_loop_fork> on the embedded loop.
2418and future versions of libev might do just that.
2419 2447
2420Unfortunately, not all backends are embeddable: only the ones returned by 2448Unfortunately, not all backends are embeddable: only the ones returned by
2421C<ev_embeddable_backends> are, which, unfortunately, does not include any 2449C<ev_embeddable_backends> are, which, unfortunately, does not include any
2422portable one. 2450portable one.
2423 2451
2859 2887
2860 myclass obj; 2888 myclass obj;
2861 ev::io iow; 2889 ev::io iow;
2862 iow.set <myclass, &myclass::io_cb> (&obj); 2890 iow.set <myclass, &myclass::io_cb> (&obj);
2863 2891
2892=item w->set (object *)
2893
2894This is an B<experimental> feature that might go away in a future version.
2895
2896This is a variation of a method callback - leaving out the method to call
2897will default the method to C<operator ()>, which makes it possible to use
2898functor objects without having to manually specify the C<operator ()> all
2899the time. Incidentally, you can then also leave out the template argument
2900list.
2901
2902The C<operator ()> method prototype must be C<void operator ()(watcher &w,
2903int revents)>.
2904
2905See the method-C<set> above for more details.
2906
2907Example: use a functor object as callback.
2908
2909 struct myfunctor
2910 {
2911 void operator() (ev::io &w, int revents)
2912 {
2913 ...
2914 }
2915 }
2916
2917 myfunctor f;
2918
2919 ev::io w;
2920 w.set (&f);
2921
2864=item w->set<function> (void *data = 0) 2922=item w->set<function> (void *data = 0)
2865 2923
2866Also sets a callback, but uses a static method or plain function as 2924Also sets a callback, but uses a static method or plain function as
2867callback. The optional C<data> argument will be stored in the watcher's 2925callback. The optional C<data> argument will be stored in the watcher's
2868C<data> member and is free for you to use. 2926C<data> member and is free for you to use.
2967Tony Arcieri has written a ruby extension that offers access to a subset 3025Tony Arcieri has written a ruby extension that offers access to a subset
2968of the libev API and adds file handle abstractions, asynchronous DNS and 3026of the libev API and adds file handle abstractions, asynchronous DNS and
2969more on top of it. It can be found via gem servers. Its homepage is at 3027more on top of it. It can be found via gem servers. Its homepage is at
2970L<http://rev.rubyforge.org/>. 3028L<http://rev.rubyforge.org/>.
2971 3029
3030Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190>
3031makes rev work even on mingw.
3032
2972=item D 3033=item D
2973 3034
2974Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to 3035Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2975be found at L<http://proj.llucax.com.ar/wiki/evd>. 3036be found at L<http://proj.llucax.com.ar/wiki/evd>.
2976 3037
3152keeps libev from including F<config.h>, and it also defines dummy 3213keeps libev from including F<config.h>, and it also defines dummy
3153implementations for some libevent functions (such as logging, which is not 3214implementations for some libevent functions (such as logging, which is not
3154supported). It will also not define any of the structs usually found in 3215supported). It will also not define any of the structs usually found in
3155F<event.h> that are not directly supported by the libev core alone. 3216F<event.h> that are not directly supported by the libev core alone.
3156 3217
3218In stanbdalone mode, libev will still try to automatically deduce the
3219configuration, but has to be more conservative.
3220
3157=item EV_USE_MONOTONIC 3221=item EV_USE_MONOTONIC
3158 3222
3159If defined to be C<1>, libev will try to detect the availability of the 3223If defined to be C<1>, libev will try to detect the availability of the
3160monotonic clock option at both compile time and runtime. Otherwise no use 3224monotonic clock option at both compile time and runtime. Otherwise no
3161of the monotonic clock option will be attempted. If you enable this, you 3225use of the monotonic clock option will be attempted. If you enable this,
3162usually have to link against librt or something similar. Enabling it when 3226you usually have to link against librt or something similar. Enabling it
3163the functionality isn't available is safe, though, although you have 3227when the functionality isn't available is safe, though, although you have
3164to make sure you link against any libraries where the C<clock_gettime> 3228to make sure you link against any libraries where the C<clock_gettime>
3165function is hiding in (often F<-lrt>). 3229function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>.
3166 3230
3167=item EV_USE_REALTIME 3231=item EV_USE_REALTIME
3168 3232
3169If defined to be C<1>, libev will try to detect the availability of the 3233If defined to be C<1>, libev will try to detect the availability of the
3170real-time clock option at compile time (and assume its availability at 3234real-time clock option at compile time (and assume its availability at
3171runtime if successful). Otherwise no use of the real-time clock option will 3235runtime if successful). Otherwise no use of the real-time clock option will
3172be attempted. This effectively replaces C<gettimeofday> by C<clock_get 3236be attempted. This effectively replaces C<gettimeofday> by C<clock_get
3173(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the 3237(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
3174note about libraries in the description of C<EV_USE_MONOTONIC>, though. 3238note about libraries in the description of C<EV_USE_MONOTONIC>, though.
3175 3239
3240=item EV_USE_CLOCK_SYSCALL
3241
3242If defined to be C<1>, libev will try to use a direct syscall instead
3243of calling the system-provided C<clock_gettime> function. This option
3244exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt>
3245unconditionally pulls in C<libpthread>, slowing down single-threaded
3246programs needlessly. Using a direct syscall is slightly slower (in
3247theory), because no optimised vdso implementation can be used, but avoids
3248the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or
3249higher, as it simplifies linking (no need for C<-lrt>).
3250
3176=item EV_USE_NANOSLEEP 3251=item EV_USE_NANOSLEEP
3177 3252
3178If defined to be C<1>, libev will assume that C<nanosleep ()> is available 3253If defined to be C<1>, libev will assume that C<nanosleep ()> is available
3179and will use it for delays. Otherwise it will use C<select ()>. 3254and will use it for delays. Otherwise it will use C<select ()>.
3180 3255
3195 3270
3196=item EV_SELECT_USE_FD_SET 3271=item EV_SELECT_USE_FD_SET
3197 3272
3198If defined to C<1>, then the select backend will use the system C<fd_set> 3273If defined to C<1>, then the select backend will use the system C<fd_set>
3199structure. This is useful if libev doesn't compile due to a missing 3274structure. This is useful if libev doesn't compile due to a missing
3200C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on 3275C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout
3201exotic systems. This usually limits the range of file descriptors to some 3276on exotic systems. This usually limits the range of file descriptors to
3202low limit such as 1024 or might have other limitations (winsocket only 3277some low limit such as 1024 or might have other limitations (winsocket
3203allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 3278only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation,
3204influence the size of the C<fd_set> used. 3279configures the maximum size of the C<fd_set>.
3205 3280
3206=item EV_SELECT_IS_WINSOCKET 3281=item EV_SELECT_IS_WINSOCKET
3207 3282
3208When defined to C<1>, the select backend will assume that 3283When defined to C<1>, the select backend will assume that
3209select/socket/connect etc. don't understand file descriptors but 3284select/socket/connect etc. don't understand file descriptors but
3860=back 3935=back
3861 3936
3862 3937
3863=head1 AUTHOR 3938=head1 AUTHOR
3864 3939
3865Marc Lehmann <libev@schmorp.de>. 3940Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson.
3866 3941

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines