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

Comparing libev/ev.pod (file contents):
Revision 1.242 by root, Thu Jun 18 18:16:54 2009 UTC vs.
Revision 1.249 by root, Wed Jul 8 04:29:31 2009 UTC

620happily wraps around with enough iterations. 620happily wraps around with enough iterations.
621 621
622This value can sometimes be useful as a generation counter of sorts (it 622This value can sometimes be useful as a generation counter of sorts (it
623"ticks" the number of loop iterations), as it roughly corresponds with 623"ticks" the number of loop iterations), as it roughly corresponds with
624C<ev_prepare> and C<ev_check> calls. 624C<ev_prepare> and C<ev_check> calls.
625
626=item unsigned int ev_loop_depth (loop)
627
628Returns the number of times C<ev_loop> was entered minus the number of
629times C<ev_loop> was exited, in other words, the recursion depth.
630
631Outside C<ev_loop>, this number is zero. In a callback, this number is
632C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
633in which case it is higher.
634
635Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
636etc.), doesn't count as exit.
625 637
626=item unsigned int ev_backend (loop) 638=item unsigned int ev_backend (loop)
627 639
628Returns one of the C<EVBACKEND_*> flags indicating the event backend in 640Returns one of the C<EVBACKEND_*> flags indicating the event backend in
629use. 641use.
811 823
812By setting a higher I<io collect interval> you allow libev to spend more 824By setting a higher I<io collect interval> you allow libev to spend more
813time collecting I/O events, so you can handle more events per iteration, 825time collecting I/O events, so you can handle more events per iteration,
814at the cost of increasing latency. Timeouts (both C<ev_periodic> and 826at the cost of increasing latency. Timeouts (both C<ev_periodic> and
815C<ev_timer>) will be not affected. Setting this to a non-null value will 827C<ev_timer>) will be not affected. Setting this to a non-null value will
816introduce an additional C<ev_sleep ()> call into most loop iterations. 828introduce an additional C<ev_sleep ()> call into most loop iterations. The
829sleep time ensures that libev will not poll for I/O events more often then
830once per this interval, on average.
817 831
818Likewise, by setting a higher I<timeout collect interval> you allow libev 832Likewise, by setting a higher I<timeout collect interval> you allow libev
819to spend more time collecting timeouts, at the expense of increased 833to spend more time collecting timeouts, at the expense of increased
820latency/jitter/inexactness (the watcher callback will be called 834latency/jitter/inexactness (the watcher callback will be called
821later). C<ev_io> watchers will not be affected. Setting this to a non-null 835later). C<ev_io> watchers will not be affected. Setting this to a non-null
823 837
824Many (busy) programs can usually benefit by setting the I/O collect 838Many (busy) programs can usually benefit by setting the I/O collect
825interval to a value near C<0.1> or so, which is often enough for 839interval to a value near C<0.1> or so, which is often enough for
826interactive servers (of course not for games), likewise for timeouts. It 840interactive servers (of course not for games), likewise for timeouts. It
827usually doesn't make much sense to set it to a lower value than C<0.01>, 841usually doesn't make much sense to set it to a lower value than C<0.01>,
828as this approaches the timing granularity of most systems. 842as this approaches the timing granularity of most systems. Note that if
843you do transactions with the outside world and you can't increase the
844parallelity, then this setting will limit your transaction rate (if you
845need to poll once per transaction and the I/O collect interval is 0.01,
846then you can't do more than 100 transations per second).
829 847
830Setting the I<timeout collect interval> can improve the opportunity for 848Setting the I<timeout collect interval> can improve the opportunity for
831saving power, as the program will "bundle" timer callback invocations that 849saving power, as the program will "bundle" timer callback invocations that
832are "near" in time together, by delaying some, thus reducing the number of 850are "near" in time together, by delaying some, thus reducing the number of
833times the process sleeps and wakes up again. Another useful technique to 851times the process sleeps and wakes up again. Another useful technique to
834reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure 852reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
835they fire on, say, one-second boundaries only. 853they fire on, say, one-second boundaries only.
854
855Example: we only need 0.1s timeout granularity, and we wish not to poll
856more often than 100 times per second:
857
858 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
859 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
836 860
837=item ev_loop_verify (loop) 861=item ev_loop_verify (loop)
838 862
839This function only does something when C<EV_VERIFY> support has been 863This function only does something when C<EV_VERIFY> support has been
840compiled in, which is the default for non-minimal builds. It tries to go 864compiled in, which is the default for non-minimal builds. It tries to go
1468 1492
1469The callback is guaranteed to be invoked only I<after> its timeout has 1493The callback is guaranteed to be invoked only I<after> its timeout has
1470passed (not I<at>, so on systems with very low-resolution clocks this 1494passed (not I<at>, so on systems with very low-resolution clocks this
1471might introduce a small delay). If multiple timers become ready during the 1495might introduce a small delay). If multiple timers become ready during the
1472same loop iteration then the ones with earlier time-out values are invoked 1496same loop iteration then the ones with earlier time-out values are invoked
1473before ones with later time-out values (but this is no longer true when a 1497before ones of the same priority with later time-out values (but this is
1474callback calls C<ev_loop> recursively). 1498no longer true when a callback calls C<ev_loop> recursively).
1475 1499
1476=head3 Be smart about timeouts 1500=head3 Be smart about timeouts
1477 1501
1478Many real-world problems involve some kind of timeout, usually for error 1502Many real-world problems involve some kind of timeout, usually for error
1479recovery. A typical example is an HTTP request - if the other side hangs, 1503recovery. A typical example is an HTTP request - if the other side hangs,
1523C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> 1547C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1524member and C<ev_timer_again>. 1548member and C<ev_timer_again>.
1525 1549
1526At start: 1550At start:
1527 1551
1528 ev_timer_init (timer, callback); 1552 ev_init (timer, callback);
1529 timer->repeat = 60.; 1553 timer->repeat = 60.;
1530 ev_timer_again (loop, timer); 1554 ev_timer_again (loop, timer);
1531 1555
1532Each time there is some activity: 1556Each time there is some activity:
1533 1557
1595 1619
1596To start the timer, simply initialise the watcher and set C<last_activity> 1620To start the timer, simply initialise the watcher and set C<last_activity>
1597to the current time (meaning we just have some activity :), then call the 1621to the current time (meaning we just have some activity :), then call the
1598callback, which will "do the right thing" and start the timer: 1622callback, which will "do the right thing" and start the timer:
1599 1623
1600 ev_timer_init (timer, callback); 1624 ev_init (timer, callback);
1601 last_activity = ev_now (loop); 1625 last_activity = ev_now (loop);
1602 callback (loop, timer, EV_TIMEOUT); 1626 callback (loop, timer, EV_TIMEOUT);
1603 1627
1604And when there is some activity, simply store the current time in 1628And when there is some activity, simply store the current time in
1605C<last_activity>, no libev calls at all: 1629C<last_activity>, no libev calls at all:
2002some child status changes (most typically when a child of yours dies or 2026some child status changes (most typically when a child of yours dies or
2003exits). It is permissible to install a child watcher I<after> the child 2027exits). It is permissible to install a child watcher I<after> the child
2004has been forked (which implies it might have already exited), as long 2028has been forked (which implies it might have already exited), as long
2005as the event loop isn't entered (or is continued from a watcher), i.e., 2029as the event loop isn't entered (or is continued from a watcher), i.e.,
2006forking and then immediately registering a watcher for the child is fine, 2030forking and then immediately registering a watcher for the child is fine,
2007but forking and registering a watcher a few event loop iterations later is 2031but forking and registering a watcher a few event loop iterations later or
2008not. 2032in the next callback invocation is not.
2009 2033
2010Only the default event loop is capable of handling signals, and therefore 2034Only the default event loop is capable of handling signals, and therefore
2011you can only register child watchers in the default event loop. 2035you can only register child watchers in the default event loop.
2036
2037Due to some design glitches inside libev, child watchers will always be
2038handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2039libev)
2012 2040
2013=head3 Process Interaction 2041=head3 Process Interaction
2014 2042
2015Libev grabs C<SIGCHLD> as soon as the default event loop is 2043Libev grabs C<SIGCHLD> as soon as the default event loop is
2016initialised. This is necessary to guarantee proper behaviour even if 2044initialised. This is necessary to guarantee proper behaviour even if
2471 struct pollfd fds [nfd]; 2499 struct pollfd fds [nfd];
2472 // actual code will need to loop here and realloc etc. 2500 // actual code will need to loop here and realloc etc.
2473 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2501 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2474 2502
2475 /* the callback is illegal, but won't be called as we stop during check */ 2503 /* the callback is illegal, but won't be called as we stop during check */
2476 ev_timer_init (&tw, 0, timeout * 1e-3); 2504 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2477 ev_timer_start (loop, &tw); 2505 ev_timer_start (loop, &tw);
2478 2506
2479 // create one ev_io per pollfd 2507 // create one ev_io per pollfd
2480 for (int i = 0; i < nfd; ++i) 2508 for (int i = 0; i < nfd; ++i)
2481 { 2509 {
4065=item C<double> must hold a time value in seconds with enough accuracy 4093=item C<double> must hold a time value in seconds with enough accuracy
4066 4094
4067The type C<double> is used to represent timestamps. It is required to 4095The type C<double> is used to represent timestamps. It is required to
4068have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4096have at least 51 bits of mantissa (and 9 bits of exponent), which is good
4069enough for at least into the year 4000. This requirement is fulfilled by 4097enough for at least into the year 4000. This requirement is fulfilled by
4070implementations implementing IEEE 754 (basically all existing ones). 4098implementations implementing IEEE 754, which is basically all existing
4099ones. With IEEE 754 doubles, you get microsecond accuracy until at least
41002200.
4071 4101
4072=back 4102=back
4073 4103
4074If you know of other additional requirements drop me a note. 4104If you know of other additional requirements drop me a note.
4075 4105

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines