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

Comparing libev/ev.pod (file contents):
Revision 1.199 by root, Thu Oct 23 07:18:21 2008 UTC vs.
Revision 1.206 by root, Tue Oct 28 12:31:38 2008 UTC

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 13
14 // every watcher type has its own typedef'd struct 14 // every watcher type has its own typedef'd struct
15 // with the name ev_<type> 15 // with the name ev_TYPE
16 ev_io stdin_watcher; 16 ev_io stdin_watcher;
17 ev_timer timeout_watcher; 17 ev_timer timeout_watcher;
18 18
19 // all watcher callbacks have a similar signature 19 // all watcher callbacks have a similar signature
20 // this callback is called when data is readable on stdin 20 // this callback is called when data is readable on stdin
276 276
277=back 277=back
278 278
279=head1 FUNCTIONS CONTROLLING THE EVENT LOOP 279=head1 FUNCTIONS CONTROLLING THE EVENT LOOP
280 280
281An event loop is described by a C<ev_loop *>. The library knows two 281An event loop is described by a C<struct ev_loop *> (the C<struct>
282types of such loops, the I<default> loop, which supports signals and child 282is I<not> optional in this case, as there is also an C<ev_loop>
283events, and dynamically created loops which do not. 283I<function>).
284
285The library knows two types of such loops, the I<default> loop, which
286supports signals and child events, and dynamically created loops which do
287not.
284 288
285=over 4 289=over 4
286 290
287=item struct ev_loop *ev_default_loop (unsigned int flags) 291=item struct ev_loop *ev_default_loop (unsigned int flags)
288 292
380=item C<EVBACKEND_EPOLL> (value 4, Linux) 384=item C<EVBACKEND_EPOLL> (value 4, Linux)
381 385
382For 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,
383but it scales phenomenally better. While poll and select usually scale 387but it scales phenomenally better. While poll and select usually scale
384like 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),
385epoll scales either O(1) or O(active_fds). The epoll design has a number 389epoll scales either O(1) or O(active_fds).
386of shortcomings, such as silently dropping events in some hard-to-detect 390
387cases and requiring a system call per fd change, no fork support and bad 391The epoll syscalls are the most misdesigned of the more advanced event
388support for dup. 392mechanisms: problems include silently dropping fds, requiring a system
393call per change per fd (and unnecessary guessing of parameters), problems
394with dup and so on. The biggest issue is fork races, however - if a
395program forks then I<both> parent and child process have to recreate the
396epoll set, which can take considerable time (one syscall per fd) and is of
397course hard to detect.
398
399Epoll is also notoriously buggy - embedding epoll fds should work, but
400of course doesn't, and epoll just loves to report events for totally
401I<different> file descriptors (even already closed ones, so one cannot
402even remove them from the set) than registered in the set (especially
403on SMP systems). Libev tries to counter these spurious notifications by
404employing an additional generation counter and comparing that against the
405events to filter out spurious ones.
389 406
390While stopping, setting and starting an I/O watcher in the same iteration 407While stopping, setting and starting an I/O watcher in the same iteration
391will result in some caching, there is still a system call per such incident 408will result in some caching, there is still a system call per such incident
392(because the fd could point to a different file description now), so its 409(because the fd could point to a different file description now), so its
393best to avoid that. Also, C<dup ()>'ed file descriptors might not work 410best to avoid that. Also, C<dup ()>'ed file descriptors might not work
394very well if you register events for both fds. 411very well if you register events for both fds.
395 412
396Please note that epoll sometimes generates spurious notifications, so you
397need to use non-blocking I/O or other means to avoid blocking when no data
398(or space) is available.
399
400Best performance from this backend is achieved by not unregistering all 413Best performance from this backend is achieved by not unregistering all
401watchers for a file descriptor until it has been closed, if possible, 414watchers for a file descriptor until it has been closed, if possible,
402i.e. keep at least one watcher active per fd at all times. Stopping and 415i.e. keep at least one watcher active per fd at all times. Stopping and
403starting a watcher (without re-setting it) also usually doesn't cause 416starting a watcher (without re-setting it) also usually doesn't cause
404extra overhead. 417extra overhead. A fork can both result in spurious notifications as well
418as in libev having to destroy and recreate the epoll object, which can
419take considerable time and thus should be avoided.
405 420
406While nominally embeddable in other event loops, this feature is broken in 421While nominally embeddable in other event loops, this feature is broken in
407all kernel versions tested so far. 422all kernel versions tested so far.
408 423
409This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 424This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
424 439
425It scales in the same way as the epoll backend, but the interface to the 440It scales in the same way as the epoll backend, but the interface to the
426kernel is more efficient (which says nothing about its actual speed, of 441kernel is more efficient (which says nothing about its actual speed, of
427course). While stopping, setting and starting an I/O watcher does never 442course). While stopping, setting and starting an I/O watcher does never
428cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to 443cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
429two event changes per incident. Support for C<fork ()> is very bad and it 444two event changes per incident. Support for C<fork ()> is very bad (but
430drops fds silently in similarly hard-to-detect cases. 445sane, unlike epoll) and it drops fds silently in similarly hard-to-detect
446cases
431 447
432This backend usually performs well under most conditions. 448This backend usually performs well under most conditions.
433 449
434While nominally embeddable in other event loops, this doesn't work 450While nominally embeddable in other event loops, this doesn't work
435everywhere, so you might need to test for this. And since it is broken 451everywhere, so you might need to test for this. And since it is broken
464might perform better. 480might perform better.
465 481
466On the positive side, with the exception of the spurious readiness 482On the positive side, with the exception of the spurious readiness
467notifications, this backend actually performed fully to specification 483notifications, this backend actually performed fully to specification
468in all tests and is fully embeddable, which is a rare feat among the 484in all tests and is fully embeddable, which is a rare feat among the
469OS-specific backends. 485OS-specific backends (I vastly prefer correctness over speed hacks).
470 486
471This backend maps C<EV_READ> and C<EV_WRITE> in the same way as 487This backend maps C<EV_READ> and C<EV_WRITE> in the same way as
472C<EVBACKEND_POLL>. 488C<EVBACKEND_POLL>.
473 489
474=item C<EVBACKEND_ALL> 490=item C<EVBACKEND_ALL>
527responsibility to either stop all watchers cleanly yourself I<before> 543responsibility to either stop all watchers cleanly yourself I<before>
528calling this function, or cope with the fact afterwards (which is usually 544calling this function, or cope with the fact afterwards (which is usually
529the easiest thing, you can just ignore the watchers and/or C<free ()> them 545the easiest thing, you can just ignore the watchers and/or C<free ()> them
530for example). 546for example).
531 547
532Note that certain global state, such as signal state, will not be freed by 548Note that certain global state, such as signal state (and installed signal
533this function, and related watchers (such as signal and child watchers) 549handlers), will not be freed by this function, and related watchers (such
534would need to be stopped manually. 550as signal and child watchers) would need to be stopped manually.
535 551
536In general it is not advisable to call this function except in the 552In general it is not advisable to call this function except in the
537rare occasion where you really need to free e.g. the signal handling 553rare occasion where you really need to free e.g. the signal handling
538pipe fds. If you need dynamically allocated loops it is better to use 554pipe fds. If you need dynamically allocated loops it is better to use
539C<ev_loop_new> and C<ev_loop_destroy>). 555C<ev_loop_new> and C<ev_loop_destroy>).
768they fire on, say, one-second boundaries only. 784they fire on, say, one-second boundaries only.
769 785
770=item ev_loop_verify (loop) 786=item ev_loop_verify (loop)
771 787
772This function only does something when C<EV_VERIFY> support has been 788This function only does something when C<EV_VERIFY> support has been
773compiled in. which is the default for non-minimal builds. It tries to go 789compiled in, which is the default for non-minimal builds. It tries to go
774through all internal structures and checks them for validity. If anything 790through all internal structures and checks them for validity. If anything
775is found to be inconsistent, it will print an error message to standard 791is found to be inconsistent, it will print an error message to standard
776error and call C<abort ()>. 792error and call C<abort ()>.
777 793
778This can be used to catch bugs inside libev itself: under normal 794This can be used to catch bugs inside libev itself: under normal
781 797
782=back 798=back
783 799
784 800
785=head1 ANATOMY OF A WATCHER 801=head1 ANATOMY OF A WATCHER
802
803In the following description, uppercase C<TYPE> in names stands for the
804watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer
805watchers and C<ev_io_start> for I/O watchers.
786 806
787A watcher is a structure that you create and register to record your 807A watcher is a structure that you create and register to record your
788interest in some event. For instance, if you want to wait for STDIN to 808interest in some event. For instance, if you want to wait for STDIN to
789become readable, you would create an C<ev_io> watcher for that: 809become readable, you would create an C<ev_io> watcher for that:
790 810
793 ev_io_stop (w); 813 ev_io_stop (w);
794 ev_unloop (loop, EVUNLOOP_ALL); 814 ev_unloop (loop, EVUNLOOP_ALL);
795 } 815 }
796 816
797 struct ev_loop *loop = ev_default_loop (0); 817 struct ev_loop *loop = ev_default_loop (0);
818
798 ev_io stdin_watcher; 819 ev_io stdin_watcher;
820
799 ev_init (&stdin_watcher, my_cb); 821 ev_init (&stdin_watcher, my_cb);
800 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); 822 ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ);
801 ev_io_start (loop, &stdin_watcher); 823 ev_io_start (loop, &stdin_watcher);
824
802 ev_loop (loop, 0); 825 ev_loop (loop, 0);
803 826
804As you can see, you are responsible for allocating the memory for your 827As you can see, you are responsible for allocating the memory for your
805watcher structures (and it is usually a bad idea to do this on the stack, 828watcher structures (and it is I<usually> a bad idea to do this on the
806although this can sometimes be quite valid). 829stack).
830
831Each watcher has an associated watcher structure (called C<struct ev_TYPE>
832or simply C<ev_TYPE>, as typedefs are provided for all watcher structs).
807 833
808Each watcher structure must be initialised by a call to C<ev_init 834Each watcher structure must be initialised by a call to C<ev_init
809(watcher *, callback)>, which expects a callback to be provided. This 835(watcher *, callback)>, which expects a callback to be provided. This
810callback gets invoked each time the event occurs (or, in the case of I/O 836callback gets invoked each time the event occurs (or, in the case of I/O
811watchers, each time the event loop detects that the file descriptor given 837watchers, each time the event loop detects that the file descriptor given
812is readable and/or writable). 838is readable and/or writable).
813 839
814Each watcher type has its own C<< ev_<type>_set (watcher *, ...) >> macro 840Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >>
815with arguments specific to this watcher type. There is also a macro 841macro to configure it, with arguments specific to the watcher type. There
816to combine initialisation and setting in one call: C<< ev_<type>_init 842is also a macro to combine initialisation and setting in one call: C<<
817(watcher *, callback, ...) >>. 843ev_TYPE_init (watcher *, callback, ...) >>.
818 844
819To make the watcher actually watch out for events, you have to start it 845To make the watcher actually watch out for events, you have to start it
820with a watcher-specific start function (C<< ev_<type>_start (loop, watcher 846with a watcher-specific start function (C<< ev_TYPE_start (loop, watcher
821*) >>), and you can stop watching for events at any time by calling the 847*) >>), and you can stop watching for events at any time by calling the
822corresponding stop function (C<< ev_<type>_stop (loop, watcher *) >>. 848corresponding stop function (C<< ev_TYPE_stop (loop, watcher *) >>.
823 849
824As long as your watcher is active (has been started but not stopped) you 850As long as your watcher is active (has been started but not stopped) you
825must not touch the values stored in it. Most specifically you must never 851must not touch the values stored in it. Most specifically you must never
826reinitialise it or call its C<set> macro. 852reinitialise it or call its C<ev_TYPE_set> macro.
827 853
828Each and every callback receives the event loop pointer as first, the 854Each and every callback receives the event loop pointer as first, the
829registered watcher structure as second, and a bitset of received events as 855registered watcher structure as second, and a bitset of received events as
830third argument. 856third argument.
831 857
912 938
913=back 939=back
914 940
915=head2 GENERIC WATCHER FUNCTIONS 941=head2 GENERIC WATCHER FUNCTIONS
916 942
917In the following description, C<TYPE> stands for the watcher type,
918e.g. C<timer> for C<ev_timer> watchers and C<io> for C<ev_io> watchers.
919
920=over 4 943=over 4
921 944
922=item C<ev_init> (ev_TYPE *watcher, callback) 945=item C<ev_init> (ev_TYPE *watcher, callback)
923 946
924This macro initialises the generic portion of a watcher. The contents 947This macro initialises the generic portion of a watcher. The contents
1032The default priority used by watchers when no priority has been set is 1055The default priority used by watchers when no priority has been set is
1033always C<0>, which is supposed to not be too high and not be too low :). 1056always C<0>, which is supposed to not be too high and not be too low :).
1034 1057
1035Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is 1058Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is
1036fine, as long as you do not mind that the priority value you query might 1059fine, as long as you do not mind that the priority value you query might
1037or might not have been adjusted to be within valid range. 1060or might not have been clamped to the valid range.
1038 1061
1039=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1062=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1040 1063
1041Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1064Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1042C<loop> nor C<revents> need to be valid as long as the watcher callback 1065C<loop> nor C<revents> need to be valid as long as the watcher callback
1426 1449
1427Changing the timeout is trivial as well (if it isn't hard-coded in the 1450Changing the timeout is trivial as well (if it isn't hard-coded in the
1428callback :) - just change the timeout and invoke the callback, which will 1451callback :) - just change the timeout and invoke the callback, which will
1429fix things for you. 1452fix things for you.
1430 1453
1431=item 4. Whee, use a double-linked list for your timeouts. 1454=item 4. Wee, just use a double-linked list for your timeouts.
1432 1455
1433If there is not one request, but many thousands, all employing some kind 1456If there is not one request, but many thousands (millions...), all
1434of timeout with the same timeout value, then one can do even better: 1457employing some kind of timeout with the same timeout value, then one can
1458do even better:
1435 1459
1436When starting the timeout, calculate the timeout value and put the timeout 1460When starting the timeout, calculate the timeout value and put the timeout
1437at the I<end> of the list. 1461at the I<end> of the list.
1438 1462
1439Then use an C<ev_timer> to fire when the timeout at the I<beginning> of 1463Then use an C<ev_timer> to fire when the timeout at the I<beginning> of
1448complication, and having to use a constant timeout. The constant timeout 1472complication, and having to use a constant timeout. The constant timeout
1449ensures that the list stays sorted. 1473ensures that the list stays sorted.
1450 1474
1451=back 1475=back
1452 1476
1453So what method is the best? 1477So which method the best?
1454 1478
1455The method #2 is a simple no-brain-required solution that is adequate in 1479Method #2 is a simple no-brain-required solution that is adequate in most
1456most situations. Method #3 requires a bit more thinking, but handles many 1480situations. Method #3 requires a bit more thinking, but handles many cases
1457cases better, and isn't very complicated either. In most case, choosing 1481better, and isn't very complicated either. In most case, choosing either
1458either one is fine. 1482one is fine, with #3 being better in typical situations.
1459 1483
1460Method #1 is almost always a bad idea, and buys you nothing. Method #4 is 1484Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1461rather complicated, but extremely efficient, something that really pays 1485rather complicated, but extremely efficient, something that really pays
1462off after the first or so million of active timers, i.e. it's usually 1486off after the first million or so of active timers, i.e. it's usually
1463overkill :) 1487overkill :)
1464 1488
1465=head3 The special problem of time updates 1489=head3 The special problem of time updates
1466 1490
1467Establishing the current time is a costly operation (it usually takes at 1491Establishing the current time is a costly operation (it usually takes at
2946=item D 2970=item D
2947 2971
2948Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to 2972Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2949be found at L<http://proj.llucax.com.ar/wiki/evd>. 2973be found at L<http://proj.llucax.com.ar/wiki/evd>.
2950 2974
2975=item Ocaml
2976
2977Erkki Seppala has written Ocaml bindings for libev, to be found at
2978L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
2979
2951=back 2980=back
2952 2981
2953 2982
2954=head1 MACRO MAGIC 2983=head1 MACRO MAGIC
2955 2984

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines