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

Comparing libev/ev.pod (file contents):
Revision 1.213 by root, Wed Nov 5 02:48:45 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);
418starting a watcher (without re-setting it) also usually doesn't cause 420starting a watcher (without re-setting it) also usually doesn't cause
419extra overhead. A fork can both result in spurious notifications as well 421extra overhead. A fork can both result in spurious notifications as well
420as 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
421take considerable time and thus should be avoided. 423take considerable time and thus should be avoided.
422 424
423All this means that, in practise, C<EVBACKEND_SELECT> is as fast or faster 425All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or
424then epoll for maybe up to a hundred file descriptors. So sad. 426faster than epoll for maybe up to a hundred file descriptors, depending on
427the usage. So sad.
425 428
426While nominally embeddable in other event loops, this feature is broken in 429While nominally embeddable in other event loops, this feature is broken in
427all kernel versions tested so far. 430all kernel versions tested so far.
428 431
429This 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
457 460
458While nominally embeddable in other event loops, this doesn't work 461While nominally embeddable in other event loops, this doesn't work
459everywhere, 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
460almost 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
461(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
462(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
463using it only for sockets. 466also broken on OS X)) and, did I mention it, using it only for sockets.
464 467
465This 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
466C<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
467C<NOTE_EOF>. 470C<NOTE_EOF>.
468 471
1418 else 1421 else
1419 { 1422 {
1420 // callback was invoked, but there was some activity, re-arm 1423 // callback was invoked, but there was some activity, re-arm
1421 // the watcher to fire in last_activity + 60, which is 1424 // the watcher to fire in last_activity + 60, which is
1422 // guaranteed to be in the future, so "again" is positive: 1425 // guaranteed to be in the future, so "again" is positive:
1423 w->again = timeout - now; 1426 w->repeat = timeout - now;
1424 ev_timer_again (EV_A_ w); 1427 ev_timer_again (EV_A_ w);
1425 } 1428 }
1426 } 1429 }
1427 1430
1428To summarise the callback: first calculate the real timeout (defined 1431To summarise the callback: first calculate the real timeout (defined
2009the process. The exception are C<ev_stat> watchers - those call C<stat 2012the process. The exception are C<ev_stat> watchers - those call C<stat
2010()>, which is a synchronous operation. 2013()>, which is a synchronous operation.
2011 2014
2012For local paths, this usually doesn't matter: unless the system is very 2015For 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, 2016busy 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 2017as the path data is usually in memory already (except when starting the
2015watcher). 2018watcher).
2016 2019
2017For networked file systems, calling C<stat ()> can block an indefinite 2020For networked file systems, calling C<stat ()> can block an indefinite
2018time due to network issues, and even under good conditions, a stat call 2021time due to network issues, and even under good conditions, a stat call
2019often takes multiple milliseconds. 2022often takes multiple milliseconds.
2425some 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),
2426and even priorities and idle watchers might have too much overhead. In 2429and even priorities and idle watchers might have too much overhead. In
2427this 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
2428the 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.
2429 2432
2430As 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
2431there might be events pending in the embedded loop. The callback must then 2434time there might be events pending in the embedded loop. The callback
2432call 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
2433their 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
2434loop strictly lower priority for example). You can also set the callback 2437C<ev_embed_sweep> function directly, it could also start an idle watcher
2435to C<0>, in which case the embed watcher will automatically execute the 2438to give the embedded loop strictly lower priority for example).
2436embedded loop sweep.
2437 2439
2438As 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
2439callback will be invoked whenever some events have been handled. You can 2441will automatically execute the embedded loop sweep whenever necessary.
2440set the callback to C<0> to avoid having to specify one if you are not
2441interested in that.
2442 2442
2443Also, there have not currently been made special provisions for forking: 2443Fork detection will be handled transparently while the C<ev_embed> watcher
2444when 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
2445but 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
2446yourself - but you can use a fork watcher to handle this automatically, 2446C<ev_loop_fork> on the embedded loop.
2447and future versions of libev might do just that.
2448 2447
2449Unfortunately, not all backends are embeddable: only the ones returned by 2448Unfortunately, not all backends are embeddable: only the ones returned by
2450C<ev_embeddable_backends> are, which, unfortunately, does not include any 2449C<ev_embeddable_backends> are, which, unfortunately, does not include any
2451portable one. 2450portable one.
2452 2451
2888 2887
2889 myclass obj; 2888 myclass obj;
2890 ev::io iow; 2889 ev::io iow;
2891 iow.set <myclass, &myclass::io_cb> (&obj); 2890 iow.set <myclass, &myclass::io_cb> (&obj);
2892 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
2893=item w->set<function> (void *data = 0) 2922=item w->set<function> (void *data = 0)
2894 2923
2895Also 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
2896callback. 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
2897C<data> member and is free for you to use. 2926C<data> member and is free for you to use.
2996Tony 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
2997of the libev API and adds file handle abstractions, asynchronous DNS and 3026of the libev API and adds file handle abstractions, asynchronous DNS and
2998more 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
2999L<http://rev.rubyforge.org/>. 3028L<http://rev.rubyforge.org/>.
3000 3029
3030Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190>
3031makes rev work even on mingw.
3032
3001=item D 3033=item D
3002 3034
3003Leandro 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
3004be found at L<http://proj.llucax.com.ar/wiki/evd>. 3036be found at L<http://proj.llucax.com.ar/wiki/evd>.
3005 3037
3181keeps libev from including F<config.h>, and it also defines dummy 3213keeps libev from including F<config.h>, and it also defines dummy
3182implementations for some libevent functions (such as logging, which is not 3214implementations for some libevent functions (such as logging, which is not
3183supported). 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
3184F<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.
3185 3217
3218In stanbdalone mode, libev will still try to automatically deduce the
3219configuration, but has to be more conservative.
3220
3186=item EV_USE_MONOTONIC 3221=item EV_USE_MONOTONIC
3187 3222
3188If 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
3189monotonic clock option at both compile time and runtime. Otherwise no use 3224monotonic clock option at both compile time and runtime. Otherwise no
3190of 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,
3191usually have to link against librt or something similar. Enabling it when 3226you usually have to link against librt or something similar. Enabling it
3192the functionality isn't available is safe, though, although you have 3227when the functionality isn't available is safe, though, although you have
3193to 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>
3194function is hiding in (often F<-lrt>). 3229function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>.
3195 3230
3196=item EV_USE_REALTIME 3231=item EV_USE_REALTIME
3197 3232
3198If 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
3199real-time clock option at compile time (and assume its availability at 3234real-time clock option at compile time (and assume its availability at
3200runtime 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
3201be attempted. This effectively replaces C<gettimeofday> by C<clock_get 3236be attempted. This effectively replaces C<gettimeofday> by C<clock_get
3202(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the 3237(CLOCK_REALTIME, ...)> and will not normally affect correctness. See the
3203note about libraries in the description of C<EV_USE_MONOTONIC>, though. 3238note about libraries in the description of C<EV_USE_MONOTONIC>, though.
3204 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
3205=item EV_USE_NANOSLEEP 3251=item EV_USE_NANOSLEEP
3206 3252
3207If 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
3208and will use it for delays. Otherwise it will use C<select ()>. 3254and will use it for delays. Otherwise it will use C<select ()>.
3209 3255
3224 3270
3225=item EV_SELECT_USE_FD_SET 3271=item EV_SELECT_USE_FD_SET
3226 3272
3227If 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>
3228structure. 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
3229C<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
3230exotic systems. This usually limits the range of file descriptors to some 3276on exotic systems. This usually limits the range of file descriptors to
3231low limit such as 1024 or might have other limitations (winsocket only 3277some low limit such as 1024 or might have other limitations (winsocket
3232allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might 3278only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation,
3233influence the size of the C<fd_set> used. 3279configures the maximum size of the C<fd_set>.
3234 3280
3235=item EV_SELECT_IS_WINSOCKET 3281=item EV_SELECT_IS_WINSOCKET
3236 3282
3237When defined to C<1>, the select backend will assume that 3283When defined to C<1>, the select backend will assume that
3238select/socket/connect etc. don't understand file descriptors but 3284select/socket/connect etc. don't understand file descriptors but

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines