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

Comparing libev/ev.pod (file contents):
Revision 1.238 by root, Sat Apr 18 12:10:41 2009 UTC vs.
Revision 1.250 by root, Thu Jul 9 09:11:20 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
1184 #include <stddef.h> 1208 #include <stddef.h>
1185 1209
1186 static void 1210 static void
1187 t1_cb (EV_P_ ev_timer *w, int revents) 1211 t1_cb (EV_P_ ev_timer *w, int revents)
1188 { 1212 {
1189 struct my_biggy big = (struct my_biggy * 1213 struct my_biggy big = (struct my_biggy *)
1190 (((char *)w) - offsetof (struct my_biggy, t1)); 1214 (((char *)w) - offsetof (struct my_biggy, t1));
1191 } 1215 }
1192 1216
1193 static void 1217 static void
1194 t2_cb (EV_P_ ev_timer *w, int revents) 1218 t2_cb (EV_P_ ev_timer *w, int revents)
1195 { 1219 {
1196 struct my_biggy big = (struct my_biggy * 1220 struct my_biggy big = (struct my_biggy *)
1197 (((char *)w) - offsetof (struct my_biggy, t2)); 1221 (((char *)w) - offsetof (struct my_biggy, t2));
1198 } 1222 }
1199 1223
1200=head2 WATCHER PRIORITY MODELS 1224=head2 WATCHER PRIORITY MODELS
1201 1225
1277 // with the default priority are receiving events. 1301 // with the default priority are receiving events.
1278 ev_idle_start (EV_A_ &idle); 1302 ev_idle_start (EV_A_ &idle);
1279 } 1303 }
1280 1304
1281 static void 1305 static void
1282 idle-cb (EV_P_ ev_idle *w, int revents) 1306 idle_cb (EV_P_ ev_idle *w, int revents)
1283 { 1307 {
1284 // actual processing 1308 // actual processing
1285 read (STDIN_FILENO, ...); 1309 read (STDIN_FILENO, ...);
1286 1310
1287 // have to start the I/O watcher again, as 1311 // have to start the I/O watcher again, as
1332descriptors to non-blocking mode is also usually a good idea (but not 1356descriptors to non-blocking mode is also usually a good idea (but not
1333required if you know what you are doing). 1357required if you know what you are doing).
1334 1358
1335If you cannot use non-blocking mode, then force the use of a 1359If you cannot use non-blocking mode, then force the use of a
1336known-to-be-good backend (at the time of this writing, this includes only 1360known-to-be-good backend (at the time of this writing, this includes only
1337C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1361C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1362descriptors for which non-blocking operation makes no sense (such as
1363files) - libev doesn't guarentee any specific behaviour in that case.
1338 1364
1339Another thing you have to watch out for is that it is quite easy to 1365Another thing you have to watch out for is that it is quite easy to
1340receive "spurious" readiness notifications, that is your callback might 1366receive "spurious" readiness notifications, that is your callback might
1341be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1367be called with C<EV_READ> but a subsequent C<read>(2) will actually block
1342because there is no data. Not only are some backends known to create a 1368because there is no data. Not only are some backends known to create a
1463year, it will still time out after (roughly) one hour. "Roughly" because 1489year, it will still time out after (roughly) one hour. "Roughly" because
1464detecting time jumps is hard, and some inaccuracies are unavoidable (the 1490detecting time jumps is hard, and some inaccuracies are unavoidable (the
1465monotonic clock option helps a lot here). 1491monotonic clock option helps a lot here).
1466 1492
1467The 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
1468passed. If multiple timers become ready during the same loop iteration 1494passed (not I<at>, so on systems with very low-resolution clocks this
1469then the ones with earlier time-out values are invoked before ones with 1495might introduce a small delay). If multiple timers become ready during the
1470later time-out values (but this is no longer true when a callback calls 1496same loop iteration then the ones with earlier time-out values are invoked
1471C<ev_loop> recursively). 1497before ones of the same priority with later time-out values (but this is
1498no longer true when a callback calls C<ev_loop> recursively).
1472 1499
1473=head3 Be smart about timeouts 1500=head3 Be smart about timeouts
1474 1501
1475Many real-world problems involve some kind of timeout, usually for error 1502Many real-world problems involve some kind of timeout, usually for error
1476recovery. 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,
1520C<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>
1521member and C<ev_timer_again>. 1548member and C<ev_timer_again>.
1522 1549
1523At start: 1550At start:
1524 1551
1525 ev_timer_init (timer, callback); 1552 ev_init (timer, callback);
1526 timer->repeat = 60.; 1553 timer->repeat = 60.;
1527 ev_timer_again (loop, timer); 1554 ev_timer_again (loop, timer);
1528 1555
1529Each time there is some activity: 1556Each time there is some activity:
1530 1557
1592 1619
1593To 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>
1594to 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
1595callback, which will "do the right thing" and start the timer: 1622callback, which will "do the right thing" and start the timer:
1596 1623
1597 ev_timer_init (timer, callback); 1624 ev_init (timer, callback);
1598 last_activity = ev_now (loop); 1625 last_activity = ev_now (loop);
1599 callback (loop, timer, EV_TIMEOUT); 1626 callback (loop, timer, EV_TIMEOUT);
1600 1627
1601And when there is some activity, simply store the current time in 1628And when there is some activity, simply store the current time in
1602C<last_activity>, no libev calls at all: 1629C<last_activity>, no libev calls at all:
1999some 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
2000exits). 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
2001has been forked (which implies it might have already exited), as long 2028has been forked (which implies it might have already exited), as long
2002as 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.,
2003forking and then immediately registering a watcher for the child is fine, 2030forking and then immediately registering a watcher for the child is fine,
2004but 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
2005not. 2032in the next callback invocation is not.
2006 2033
2007Only the default event loop is capable of handling signals, and therefore 2034Only the default event loop is capable of handling signals, and therefore
2008you 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)
2009 2040
2010=head3 Process Interaction 2041=head3 Process Interaction
2011 2042
2012Libev grabs C<SIGCHLD> as soon as the default event loop is 2043Libev grabs C<SIGCHLD> as soon as the default event loop is
2013initialised. This is necessary to guarantee proper behaviour even if 2044initialised. This is necessary to guarantee proper behaviour even if
2365 // no longer anything immediate to do. 2396 // no longer anything immediate to do.
2366 } 2397 }
2367 2398
2368 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2399 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2369 ev_idle_init (idle_watcher, idle_cb); 2400 ev_idle_init (idle_watcher, idle_cb);
2370 ev_idle_start (loop, idle_cb); 2401 ev_idle_start (loop, idle_watcher);
2371 2402
2372 2403
2373=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2404=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2374 2405
2375Prepare and check watchers are usually (but not always) used in pairs: 2406Prepare and check watchers are usually (but not always) used in pairs:
2468 struct pollfd fds [nfd]; 2499 struct pollfd fds [nfd];
2469 // actual code will need to loop here and realloc etc. 2500 // actual code will need to loop here and realloc etc.
2470 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2501 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2471 2502
2472 /* 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 */
2473 ev_timer_init (&tw, 0, timeout * 1e-3); 2504 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2474 ev_timer_start (loop, &tw); 2505 ev_timer_start (loop, &tw);
2475 2506
2476 // create one ev_io per pollfd 2507 // create one ev_io per pollfd
2477 for (int i = 0; i < nfd; ++i) 2508 for (int i = 0; i < nfd; ++i)
2478 { 2509 {
3640defined to be C<0>, then they are not. 3671defined to be C<0>, then they are not.
3641 3672
3642=item EV_MINIMAL 3673=item EV_MINIMAL
3643 3674
3644If you need to shave off some kilobytes of code at the expense of some 3675If you need to shave off some kilobytes of code at the expense of some
3645speed, define this symbol to C<1>. Currently this is used to override some 3676speed (but with the full API), define this symbol to C<1>. Currently this
3646inlining decisions, saves roughly 30% code size on amd64. It also selects a 3677is used to override some inlining decisions, saves roughly 30% code size
3647much smaller 2-heap for timer management over the default 4-heap. 3678on amd64. It also selects a much smaller 2-heap for timer management over
3679the default 4-heap.
3680
3681You can save even more by disabling watcher types you do not need and
3682setting C<EV_MAXPRI> == C<EV_MINPRI>.
3648 3683
3649=item EV_PID_HASHSIZE 3684=item EV_PID_HASHSIZE
3650 3685
3651C<ev_child> watchers use a small hash table to distribute workload by 3686C<ev_child> watchers use a small hash table to distribute workload by
3652pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more 3687pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
3932way (note also that glib is the slowest event library known to man). 3967way (note also that glib is the slowest event library known to man).
3933 3968
3934There is no supported compilation method available on windows except 3969There is no supported compilation method available on windows except
3935embedding it into other applications. 3970embedding it into other applications.
3936 3971
3972Sensible signal handling is officially unsupported by Microsoft - libev
3973tries its best, but under most conditions, signals will simply not work.
3974
3937Not a libev limitation but worth mentioning: windows apparently doesn't 3975Not a libev limitation but worth mentioning: windows apparently doesn't
3938accept large writes: instead of resulting in a partial write, windows will 3976accept large writes: instead of resulting in a partial write, windows will
3939either accept everything or return C<ENOBUFS> if the buffer is too large, 3977either accept everything or return C<ENOBUFS> if the buffer is too large,
3940so make sure you only write small amounts into your sockets (less than a 3978so make sure you only write small amounts into your sockets (less than a
3941megabyte seems safe, but this apparently depends on the amount of memory 3979megabyte seems safe, but this apparently depends on the amount of memory
3945the abysmal performance of winsockets, using a large number of sockets 3983the abysmal performance of winsockets, using a large number of sockets
3946is not recommended (and not reasonable). If your program needs to use 3984is not recommended (and not reasonable). If your program needs to use
3947more than a hundred or so sockets, then likely it needs to use a totally 3985more than a hundred or so sockets, then likely it needs to use a totally
3948different implementation for windows, as libev offers the POSIX readiness 3986different implementation for windows, as libev offers the POSIX readiness
3949notification model, which cannot be implemented efficiently on windows 3987notification model, which cannot be implemented efficiently on windows
3950(Microsoft monopoly games). 3988(due to Microsoft monopoly games).
3951 3989
3952A typical way to use libev under windows is to embed it (see the embedding 3990A typical way to use libev under windows is to embed it (see the embedding
3953section for details) and use the following F<evwrap.h> header file instead 3991section for details) and use the following F<evwrap.h> header file instead
3954of F<ev.h>: 3992of F<ev.h>:
3955 3993
3991 4029
3992Early versions of winsocket's select only supported waiting for a maximum 4030Early versions of winsocket's select only supported waiting for a maximum
3993of C<64> handles (probably owning to the fact that all windows kernels 4031of C<64> handles (probably owning to the fact that all windows kernels
3994can only wait for C<64> things at the same time internally; Microsoft 4032can only wait for C<64> things at the same time internally; Microsoft
3995recommends spawning a chain of threads and wait for 63 handles and the 4033recommends spawning a chain of threads and wait for 63 handles and the
3996previous thread in each. Great). 4034previous thread in each. Sounds great!).
3997 4035
3998Newer versions support more handles, but you need to define C<FD_SETSIZE> 4036Newer versions support more handles, but you need to define C<FD_SETSIZE>
3999to some high number (e.g. C<2048>) before compiling the winsocket select 4037to some high number (e.g. C<2048>) before compiling the winsocket select
4000call (which might be in libev or elsewhere, for example, perl does its own 4038call (which might be in libev or elsewhere, for example, perl and many
4001select emulation on windows). 4039other interpreters do their own select emulation on windows).
4002 4040
4003Another limit is the number of file descriptors in the Microsoft runtime 4041Another limit is the number of file descriptors in the Microsoft runtime
4004libraries, which by default is C<64> (there must be a hidden I<64> fetish 4042libraries, which by default is C<64> (there must be a hidden I<64>
4005or something like this inside Microsoft). You can increase this by calling 4043fetish or something like this inside Microsoft). You can increase this
4006C<_setmaxstdio>, which can increase this limit to C<2048> (another 4044by calling C<_setmaxstdio>, which can increase this limit to C<2048>
4007arbitrary limit), but is broken in many versions of the Microsoft runtime 4045(another arbitrary limit), but is broken in many versions of the Microsoft
4008libraries.
4009
4010This might get you to about C<512> or C<2048> sockets (depending on 4046runtime libraries. This might get you to about C<512> or C<2048> sockets
4011windows version and/or the phase of the moon). To get more, you need to 4047(depending on windows version and/or the phase of the moon). To get more,
4012wrap all I/O functions and provide your own fd management, but the cost of 4048you need to wrap all I/O functions and provide your own fd management, but
4013calling select (O(n²)) will likely make this unworkable. 4049the cost of calling select (O(n²)) will likely make this unworkable.
4014 4050
4015=back 4051=back
4016 4052
4017=head2 PORTABILITY REQUIREMENTS 4053=head2 PORTABILITY REQUIREMENTS
4018 4054
4061=item C<double> must hold a time value in seconds with enough accuracy 4097=item C<double> must hold a time value in seconds with enough accuracy
4062 4098
4063The type C<double> is used to represent timestamps. It is required to 4099The type C<double> is used to represent timestamps. It is required to
4064have at least 51 bits of mantissa (and 9 bits of exponent), which is good 4100have at least 51 bits of mantissa (and 9 bits of exponent), which is good
4065enough for at least into the year 4000. This requirement is fulfilled by 4101enough for at least into the year 4000. This requirement is fulfilled by
4066implementations implementing IEEE 754 (basically all existing ones). 4102implementations implementing IEEE 754, which is basically all existing
4103ones. With IEEE 754 doubles, you get microsecond accuracy until at least
41042200.
4067 4105
4068=back 4106=back
4069 4107
4070If you know of other additional requirements drop me a note. 4108If you know of other additional requirements drop me a note.
4071 4109

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines