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

Comparing libev/ev.pod (file contents):
Revision 1.197 by root, Tue Oct 21 20:52:30 2008 UTC vs.
Revision 1.208 by root, Wed Oct 29 10:24:23 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
21 static void 21 static void
22 stdin_cb (EV_P_ struct ev_io *w, int revents) 22 stdin_cb (EV_P_ ev_io *w, int revents)
23 { 23 {
24 puts ("stdin ready"); 24 puts ("stdin ready");
25 // for one-shot events, one must manually stop the watcher 25 // for one-shot events, one must manually stop the watcher
26 // with its corresponding stop function. 26 // with its corresponding stop function.
27 ev_io_stop (EV_A_ w); 27 ev_io_stop (EV_A_ w);
30 ev_unloop (EV_A_ EVUNLOOP_ALL); 30 ev_unloop (EV_A_ EVUNLOOP_ALL);
31 } 31 }
32 32
33 // another callback, this time for a time-out 33 // another callback, this time for a time-out
34 static void 34 static void
35 timeout_cb (EV_P_ struct ev_timer *w, int revents) 35 timeout_cb (EV_P_ ev_timer *w, int revents)
36 { 36 {
37 puts ("timeout"); 37 puts ("timeout");
38 // this causes the innermost ev_loop to stop iterating 38 // this causes the innermost ev_loop to stop iterating
39 ev_unloop (EV_A_ EVUNLOOP_ONE); 39 ev_unloop (EV_A_ EVUNLOOP_ONE);
40 } 40 }
41 41
42 int 42 int
43 main (void) 43 main (void)
44 { 44 {
45 // use the default event loop unless you have special needs 45 // use the default event loop unless you have special needs
46 struct ev_loop *loop = ev_default_loop (0); 46 ev_loop *loop = ev_default_loop (0);
47 47
48 // initialise an io watcher, then start it 48 // initialise an io watcher, then start it
49 // this one will watch for stdin to become readable 49 // this one will watch for stdin to become readable
50 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); 50 ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ);
51 ev_io_start (loop, &stdin_watcher); 51 ev_io_start (loop, &stdin_watcher);
103Libev is very configurable. In this manual the default (and most common) 103Libev is very configurable. In this manual the default (and most common)
104configuration will be described, which supports multiple event loops. For 104configuration will be described, which supports multiple event loops. For
105more info about various configuration options please have a look at 105more info about various configuration options please have a look at
106B<EMBED> section in this manual. If libev was configured without support 106B<EMBED> section in this manual. If libev was configured without support
107for multiple event loops, then all functions taking an initial argument of 107for multiple event loops, then all functions taking an initial argument of
108name C<loop> (which is always of type C<struct ev_loop *>) will not have 108name C<loop> (which is always of type C<ev_loop *>) will not have
109this argument. 109this argument.
110 110
111=head2 TIME REPRESENTATION 111=head2 TIME REPRESENTATION
112 112
113Libev represents time as a single floating point number, representing the 113Libev represents time as a single floating point number, representing the
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<struct 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
294If you don't know what event loop to use, use the one returned from this 298If you don't know what event loop to use, use the one returned from this
295function. 299function.
296 300
297Note that this function is I<not> thread-safe, so if you want to use it 301Note that this function is I<not> thread-safe, so if you want to use it
298from multiple threads, you have to lock (note also that this is unlikely, 302from multiple threads, you have to lock (note also that this is unlikely,
299as loops cannot bes hared easily between threads anyway). 303as loops cannot be shared easily between threads anyway).
300 304
301The default loop is the only loop that can handle C<ev_signal> and 305The default loop is the only loop that can handle C<ev_signal> and
302C<ev_child> watchers, and to do this, it always registers a handler 306C<ev_child> watchers, and to do this, it always registers a handler
303for C<SIGCHLD>. If this is a problem for your application you can either 307for C<SIGCHLD>. If this is a problem for your application you can either
304create a dynamic loop with C<ev_loop_new> that doesn't do that, or you 308create a dynamic loop with C<ev_loop_new> that doesn't do that, or you
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>).
631the loop. 647the loop.
632 648
633A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if 649A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if
634necessary) and will handle those and any already outstanding ones. It 650necessary) and will handle those and any already outstanding ones. It
635will block your process until at least one new event arrives (which could 651will block your process until at least one new event arrives (which could
636be an event internal to libev itself, so there is no guarentee that a 652be an event internal to libev itself, so there is no guarantee that a
637user-registered callback will be called), and will return after one 653user-registered callback will be called), and will return after one
638iteration of the loop. 654iteration of the loop.
639 655
640This is useful if you are waiting for some external event in conjunction 656This is useful if you are waiting for some external event in conjunction
641with something not expressible using other libev watchers (i.e. "roll your 657with something not expressible using other libev watchers (i.e. "roll your
710respectively). 726respectively).
711 727
712Example: Create a signal watcher, but keep it from keeping C<ev_loop> 728Example: Create a signal watcher, but keep it from keeping C<ev_loop>
713running when nothing else is active. 729running when nothing else is active.
714 730
715 struct ev_signal exitsig; 731 ev_signal exitsig;
716 ev_signal_init (&exitsig, sig_cb, SIGINT); 732 ev_signal_init (&exitsig, sig_cb, SIGINT);
717 ev_signal_start (loop, &exitsig); 733 ev_signal_start (loop, &exitsig);
718 evf_unref (loop); 734 evf_unref (loop);
719 735
720Example: For some weird reason, unregister the above signal handler again. 736Example: For some weird reason, unregister the above signal handler again.
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
782=back 798=back
783 799
784 800
785=head1 ANATOMY OF A WATCHER 801=head1 ANATOMY OF A WATCHER
786 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.
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
791 static void my_cb (struct ev_loop *loop, struct ev_io *w, int revents) 811 static void my_cb (struct ev_loop *loop, ev_io *w, int revents)
792 { 812 {
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 struct 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
929which rolls both calls into one. 952which rolls both calls into one.
930 953
931You can reinitialise a watcher at any time as long as it has been stopped 954You can reinitialise a watcher at any time as long as it has been stopped
932(or never started) and there are no pending events outstanding. 955(or never started) and there are no pending events outstanding.
933 956
934The callback is always of type C<void (*)(ev_loop *loop, ev_TYPE *watcher, 957The callback is always of type C<void (*)(struct ev_loop *loop, ev_TYPE *watcher,
935int revents)>. 958int revents)>.
936 959
937Example: Initialise an C<ev_io> watcher in two steps. 960Example: Initialise an C<ev_io> watcher in two steps.
938 961
939 ev_io w; 962 ev_io w;
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
1064member, you can also "subclass" the watcher type and provide your own 1087member, you can also "subclass" the watcher type and provide your own
1065data: 1088data:
1066 1089
1067 struct my_io 1090 struct my_io
1068 { 1091 {
1069 struct ev_io io; 1092 ev_io io;
1070 int otherfd; 1093 int otherfd;
1071 void *somedata; 1094 void *somedata;
1072 struct whatever *mostinteresting; 1095 struct whatever *mostinteresting;
1073 }; 1096 };
1074 1097
1077 ev_io_init (&w.io, my_cb, fd, EV_READ); 1100 ev_io_init (&w.io, my_cb, fd, EV_READ);
1078 1101
1079And since your callback will be called with a pointer to the watcher, you 1102And since your callback will be called with a pointer to the watcher, you
1080can cast it back to your own type: 1103can cast it back to your own type:
1081 1104
1082 static void my_cb (struct ev_loop *loop, struct ev_io *w_, int revents) 1105 static void my_cb (struct ev_loop *loop, ev_io *w_, int revents)
1083 { 1106 {
1084 struct my_io *w = (struct my_io *)w_; 1107 struct my_io *w = (struct my_io *)w_;
1085 ... 1108 ...
1086 } 1109 }
1087 1110
1105programmers): 1128programmers):
1106 1129
1107 #include <stddef.h> 1130 #include <stddef.h>
1108 1131
1109 static void 1132 static void
1110 t1_cb (EV_P_ struct ev_timer *w, int revents) 1133 t1_cb (EV_P_ ev_timer *w, int revents)
1111 { 1134 {
1112 struct my_biggy big = (struct my_biggy * 1135 struct my_biggy big = (struct my_biggy *
1113 (((char *)w) - offsetof (struct my_biggy, t1)); 1136 (((char *)w) - offsetof (struct my_biggy, t1));
1114 } 1137 }
1115 1138
1116 static void 1139 static void
1117 t2_cb (EV_P_ struct ev_timer *w, int revents) 1140 t2_cb (EV_P_ ev_timer *w, int revents)
1118 { 1141 {
1119 struct my_biggy big = (struct my_biggy * 1142 struct my_biggy big = (struct my_biggy *
1120 (((char *)w) - offsetof (struct my_biggy, t2)); 1143 (((char *)w) - offsetof (struct my_biggy, t2));
1121 } 1144 }
1122 1145
1257Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well 1280Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well
1258readable, but only once. Since it is likely line-buffered, you could 1281readable, but only once. Since it is likely line-buffered, you could
1259attempt to read a whole line in the callback. 1282attempt to read a whole line in the callback.
1260 1283
1261 static void 1284 static void
1262 stdin_readable_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1285 stdin_readable_cb (struct ev_loop *loop, ev_io *w, int revents)
1263 { 1286 {
1264 ev_io_stop (loop, w); 1287 ev_io_stop (loop, w);
1265 .. read from stdin here (or from w->fd) and handle any I/O errors 1288 .. read from stdin here (or from w->fd) and handle any I/O errors
1266 } 1289 }
1267 1290
1268 ... 1291 ...
1269 struct ev_loop *loop = ev_default_init (0); 1292 struct ev_loop *loop = ev_default_init (0);
1270 struct ev_io stdin_readable; 1293 ev_io stdin_readable;
1271 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); 1294 ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ);
1272 ev_io_start (loop, &stdin_readable); 1295 ev_io_start (loop, &stdin_readable);
1273 ev_loop (loop, 0); 1296 ev_loop (loop, 0);
1274 1297
1275 1298
1286 1309
1287The callback is guaranteed to be invoked only I<after> its timeout has 1310The callback is guaranteed to be invoked only I<after> its timeout has
1288passed, but if multiple timers become ready during the same loop iteration 1311passed, but if multiple timers become ready during the same loop iteration
1289then order of execution is undefined. 1312then order of execution is undefined.
1290 1313
1314=head3 Be smart about timeouts
1315
1316Many real-world problems involve some kind of timeout, usually for error
1317recovery. A typical example is an HTTP request - if the other side hangs,
1318you want to raise some error after a while.
1319
1320What follows are some ways to handle this problem, from obvious and
1321inefficient to smart and efficient.
1322
1323In the following, a 60 second activity timeout is assumed - a timeout that
1324gets reset to 60 seconds each time there is activity (e.g. each time some
1325data or other life sign was received).
1326
1327=over 4
1328
1329=item 1. Use a timer and stop, reinitialise and start it on activity.
1330
1331This is the most obvious, but not the most simple way: In the beginning,
1332start the watcher:
1333
1334 ev_timer_init (timer, callback, 60., 0.);
1335 ev_timer_start (loop, timer);
1336
1337Then, each time there is some activity, C<ev_timer_stop> it, initialise it
1338and start it again:
1339
1340 ev_timer_stop (loop, timer);
1341 ev_timer_set (timer, 60., 0.);
1342 ev_timer_start (loop, timer);
1343
1344This is relatively simple to implement, but means that each time there is
1345some activity, libev will first have to remove the timer from its internal
1346data structure and then add it again. Libev tries to be fast, but it's
1347still not a constant-time operation.
1348
1349=item 2. Use a timer and re-start it with C<ev_timer_again> inactivity.
1350
1351This is the easiest way, and involves using C<ev_timer_again> instead of
1352C<ev_timer_start>.
1353
1354To implement this, configure an C<ev_timer> with a C<repeat> value
1355of C<60> and then call C<ev_timer_again> at start and each time you
1356successfully read or write some data. If you go into an idle state where
1357you do not expect data to travel on the socket, you can C<ev_timer_stop>
1358the timer, and C<ev_timer_again> will automatically restart it if need be.
1359
1360That means you can ignore both the C<ev_timer_start> function and the
1361C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1362member and C<ev_timer_again>.
1363
1364At start:
1365
1366 ev_timer_init (timer, callback);
1367 timer->repeat = 60.;
1368 ev_timer_again (loop, timer);
1369
1370Each time there is some activity:
1371
1372 ev_timer_again (loop, timer);
1373
1374It is even possible to change the time-out on the fly, regardless of
1375whether the watcher is active or not:
1376
1377 timer->repeat = 30.;
1378 ev_timer_again (loop, timer);
1379
1380This is slightly more efficient then stopping/starting the timer each time
1381you want to modify its timeout value, as libev does not have to completely
1382remove and re-insert the timer from/into its internal data structure.
1383
1384It is, however, even simpler than the "obvious" way to do it.
1385
1386=item 3. Let the timer time out, but then re-arm it as required.
1387
1388This method is more tricky, but usually most efficient: Most timeouts are
1389relatively long compared to the intervals between other activity - in
1390our example, within 60 seconds, there are usually many I/O events with
1391associated activity resets.
1392
1393In this case, it would be more efficient to leave the C<ev_timer> alone,
1394but remember the time of last activity, and check for a real timeout only
1395within the callback:
1396
1397 ev_tstamp last_activity; // time of last activity
1398
1399 static void
1400 callback (EV_P_ ev_timer *w, int revents)
1401 {
1402 ev_tstamp now = ev_now (EV_A);
1403 ev_tstamp timeout = last_activity + 60.;
1404
1405 // if last_activity + 60. is older than now, we did time out
1406 if (timeout < now)
1407 {
1408 // timeout occured, take action
1409 }
1410 else
1411 {
1412 // callback was invoked, but there was some activity, re-arm
1413 // the watcher to fire in last_activity + 60, which is
1414 // guaranteed to be in the future, so "again" is positive:
1415 w->again = timeout - now;
1416 ev_timer_again (EV_A_ w);
1417 }
1418 }
1419
1420To summarise the callback: first calculate the real timeout (defined
1421as "60 seconds after the last activity"), then check if that time has
1422been reached, which means something I<did>, in fact, time out. Otherwise
1423the callback was invoked too early (C<timeout> is in the future), so
1424re-schedule the timer to fire at that future time, to see if maybe we have
1425a timeout then.
1426
1427Note how C<ev_timer_again> is used, taking advantage of the
1428C<ev_timer_again> optimisation when the timer is already running.
1429
1430This scheme causes more callback invocations (about one every 60 seconds
1431minus half the average time between activity), but virtually no calls to
1432libev to change the timeout.
1433
1434To start the timer, simply initialise the watcher and set C<last_activity>
1435to the current time (meaning we just have some activity :), then call the
1436callback, which will "do the right thing" and start the timer:
1437
1438 ev_timer_init (timer, callback);
1439 last_activity = ev_now (loop);
1440 callback (loop, timer, EV_TIMEOUT);
1441
1442And when there is some activity, simply store the current time in
1443C<last_activity>, no libev calls at all:
1444
1445 last_actiivty = ev_now (loop);
1446
1447This technique is slightly more complex, but in most cases where the
1448time-out is unlikely to be triggered, much more efficient.
1449
1450Changing the timeout is trivial as well (if it isn't hard-coded in the
1451callback :) - just change the timeout and invoke the callback, which will
1452fix things for you.
1453
1454=item 4. Wee, just use a double-linked list for your timeouts.
1455
1456If there is not one request, but many thousands (millions...), all
1457employing some kind of timeout with the same timeout value, then one can
1458do even better:
1459
1460When starting the timeout, calculate the timeout value and put the timeout
1461at the I<end> of the list.
1462
1463Then use an C<ev_timer> to fire when the timeout at the I<beginning> of
1464the list is expected to fire (for example, using the technique #3).
1465
1466When there is some activity, remove the timer from the list, recalculate
1467the timeout, append it to the end of the list again, and make sure to
1468update the C<ev_timer> if it was taken from the beginning of the list.
1469
1470This way, one can manage an unlimited number of timeouts in O(1) time for
1471starting, stopping and updating the timers, at the expense of a major
1472complication, and having to use a constant timeout. The constant timeout
1473ensures that the list stays sorted.
1474
1475=back
1476
1477So which method the best?
1478
1479Method #2 is a simple no-brain-required solution that is adequate in most
1480situations. Method #3 requires a bit more thinking, but handles many cases
1481better, and isn't very complicated either. In most case, choosing either
1482one is fine, with #3 being better in typical situations.
1483
1484Method #1 is almost always a bad idea, and buys you nothing. Method #4 is
1485rather complicated, but extremely efficient, something that really pays
1486off after the first million or so of active timers, i.e. it's usually
1487overkill :)
1488
1291=head3 The special problem of time updates 1489=head3 The special problem of time updates
1292 1490
1293Establishing the current time is a costly operation (it usually takes at 1491Establishing the current time is a costly operation (it usually takes at
1294least two system calls): EV therefore updates its idea of the current 1492least two system calls): EV therefore updates its idea of the current
1295time only before and after C<ev_loop> collects new events, which causes a 1493time only before and after C<ev_loop> collects new events, which causes a
1338If the timer is started but non-repeating, stop it (as if it timed out). 1536If the timer is started but non-repeating, stop it (as if it timed out).
1339 1537
1340If the timer is repeating, either start it if necessary (with the 1538If the timer is repeating, either start it if necessary (with the
1341C<repeat> value), or reset the running timer to the C<repeat> value. 1539C<repeat> value), or reset the running timer to the C<repeat> value.
1342 1540
1343This sounds a bit complicated, but here is a useful and typical 1541This sounds a bit complicated, see "Be smart about timeouts", above, for a
1344example: Imagine you have a TCP connection and you want a so-called idle 1542usage example.
1345timeout, that is, you want to be called when there have been, say, 60
1346seconds of inactivity on the socket. The easiest way to do this is to
1347configure an C<ev_timer> with a C<repeat> value of C<60> and then call
1348C<ev_timer_again> each time you successfully read or write some data. If
1349you go into an idle state where you do not expect data to travel on the
1350socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will
1351automatically restart it if need be.
1352
1353That means you can ignore the C<after> value and C<ev_timer_start>
1354altogether and only ever use the C<repeat> value and C<ev_timer_again>:
1355
1356 ev_timer_init (timer, callback, 0., 5.);
1357 ev_timer_again (loop, timer);
1358 ...
1359 timer->again = 17.;
1360 ev_timer_again (loop, timer);
1361 ...
1362 timer->again = 10.;
1363 ev_timer_again (loop, timer);
1364
1365This is more slightly efficient then stopping/starting the timer each time
1366you want to modify its timeout value.
1367
1368Note, however, that it is often even more efficient to remember the
1369time of the last activity and let the timer time-out naturally. In the
1370callback, you then check whether the time-out is real, or, if there was
1371some activity, you reschedule the watcher to time-out in "last_activity +
1372timeout - ev_now ()" seconds.
1373 1543
1374=item ev_tstamp repeat [read-write] 1544=item ev_tstamp repeat [read-write]
1375 1545
1376The current C<repeat> value. Will be used each time the watcher times out 1546The current C<repeat> value. Will be used each time the watcher times out
1377or C<ev_timer_again> is called, and determines the next timeout (if any), 1547or C<ev_timer_again> is called, and determines the next timeout (if any),
1382=head3 Examples 1552=head3 Examples
1383 1553
1384Example: Create a timer that fires after 60 seconds. 1554Example: Create a timer that fires after 60 seconds.
1385 1555
1386 static void 1556 static void
1387 one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1557 one_minute_cb (struct ev_loop *loop, ev_timer *w, int revents)
1388 { 1558 {
1389 .. one minute over, w is actually stopped right here 1559 .. one minute over, w is actually stopped right here
1390 } 1560 }
1391 1561
1392 struct ev_timer mytimer; 1562 ev_timer mytimer;
1393 ev_timer_init (&mytimer, one_minute_cb, 60., 0.); 1563 ev_timer_init (&mytimer, one_minute_cb, 60., 0.);
1394 ev_timer_start (loop, &mytimer); 1564 ev_timer_start (loop, &mytimer);
1395 1565
1396Example: Create a timeout timer that times out after 10 seconds of 1566Example: Create a timeout timer that times out after 10 seconds of
1397inactivity. 1567inactivity.
1398 1568
1399 static void 1569 static void
1400 timeout_cb (struct ev_loop *loop, struct ev_timer *w, int revents) 1570 timeout_cb (struct ev_loop *loop, ev_timer *w, int revents)
1401 { 1571 {
1402 .. ten seconds without any activity 1572 .. ten seconds without any activity
1403 } 1573 }
1404 1574
1405 struct ev_timer mytimer; 1575 ev_timer mytimer;
1406 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ 1576 ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */
1407 ev_timer_again (&mytimer); /* start timer */ 1577 ev_timer_again (&mytimer); /* start timer */
1408 ev_loop (loop, 0); 1578 ev_loop (loop, 0);
1409 1579
1410 // and in some piece of code that gets executed on any "activity": 1580 // and in some piece of code that gets executed on any "activity":
1496 1666
1497If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop 1667If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop
1498it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the 1668it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the
1499only event loop modification you are allowed to do). 1669only event loop modification you are allowed to do).
1500 1670
1501The callback prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic 1671The callback prototype is C<ev_tstamp (*reschedule_cb)(ev_periodic
1502*w, ev_tstamp now)>, e.g.: 1672*w, ev_tstamp now)>, e.g.:
1503 1673
1674 static ev_tstamp
1504 static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) 1675 my_rescheduler (ev_periodic *w, ev_tstamp now)
1505 { 1676 {
1506 return now + 60.; 1677 return now + 60.;
1507 } 1678 }
1508 1679
1509It must return the next time to trigger, based on the passed time value 1680It must return the next time to trigger, based on the passed time value
1546 1717
1547The current interval value. Can be modified any time, but changes only 1718The current interval value. Can be modified any time, but changes only
1548take effect when the periodic timer fires or C<ev_periodic_again> is being 1719take effect when the periodic timer fires or C<ev_periodic_again> is being
1549called. 1720called.
1550 1721
1551=item ev_tstamp (*reschedule_cb)(struct ev_periodic *w, ev_tstamp now) [read-write] 1722=item ev_tstamp (*reschedule_cb)(ev_periodic *w, ev_tstamp now) [read-write]
1552 1723
1553The current reschedule callback, or C<0>, if this functionality is 1724The current reschedule callback, or C<0>, if this functionality is
1554switched off. Can be changed any time, but changes only take effect when 1725switched off. Can be changed any time, but changes only take effect when
1555the periodic timer fires or C<ev_periodic_again> is being called. 1726the periodic timer fires or C<ev_periodic_again> is being called.
1556 1727
1561Example: Call a callback every hour, or, more precisely, whenever the 1732Example: Call a callback every hour, or, more precisely, whenever the
1562system time is divisible by 3600. The callback invocation times have 1733system time is divisible by 3600. The callback invocation times have
1563potentially a lot of jitter, but good long-term stability. 1734potentially a lot of jitter, but good long-term stability.
1564 1735
1565 static void 1736 static void
1566 clock_cb (struct ev_loop *loop, struct ev_io *w, int revents) 1737 clock_cb (struct ev_loop *loop, ev_io *w, int revents)
1567 { 1738 {
1568 ... its now a full hour (UTC, or TAI or whatever your clock follows) 1739 ... its now a full hour (UTC, or TAI or whatever your clock follows)
1569 } 1740 }
1570 1741
1571 struct ev_periodic hourly_tick; 1742 ev_periodic hourly_tick;
1572 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0); 1743 ev_periodic_init (&hourly_tick, clock_cb, 0., 3600., 0);
1573 ev_periodic_start (loop, &hourly_tick); 1744 ev_periodic_start (loop, &hourly_tick);
1574 1745
1575Example: The same as above, but use a reschedule callback to do it: 1746Example: The same as above, but use a reschedule callback to do it:
1576 1747
1577 #include <math.h> 1748 #include <math.h>
1578 1749
1579 static ev_tstamp 1750 static ev_tstamp
1580 my_scheduler_cb (struct ev_periodic *w, ev_tstamp now) 1751 my_scheduler_cb (ev_periodic *w, ev_tstamp now)
1581 { 1752 {
1582 return now + (3600. - fmod (now, 3600.)); 1753 return now + (3600. - fmod (now, 3600.));
1583 } 1754 }
1584 1755
1585 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb); 1756 ev_periodic_init (&hourly_tick, clock_cb, 0., 0., my_scheduler_cb);
1586 1757
1587Example: Call a callback every hour, starting now: 1758Example: Call a callback every hour, starting now:
1588 1759
1589 struct ev_periodic hourly_tick; 1760 ev_periodic hourly_tick;
1590 ev_periodic_init (&hourly_tick, clock_cb, 1761 ev_periodic_init (&hourly_tick, clock_cb,
1591 fmod (ev_now (loop), 3600.), 3600., 0); 1762 fmod (ev_now (loop), 3600.), 3600., 0);
1592 ev_periodic_start (loop, &hourly_tick); 1763 ev_periodic_start (loop, &hourly_tick);
1593 1764
1594 1765
1636=head3 Examples 1807=head3 Examples
1637 1808
1638Example: Try to exit cleanly on SIGINT. 1809Example: Try to exit cleanly on SIGINT.
1639 1810
1640 static void 1811 static void
1641 sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) 1812 sigint_cb (struct ev_loop *loop, ev_signal *w, int revents)
1642 { 1813 {
1643 ev_unloop (loop, EVUNLOOP_ALL); 1814 ev_unloop (loop, EVUNLOOP_ALL);
1644 } 1815 }
1645 1816
1646 struct ev_signal signal_watcher; 1817 ev_signal signal_watcher;
1647 ev_signal_init (&signal_watcher, sigint_cb, SIGINT); 1818 ev_signal_init (&signal_watcher, sigint_cb, SIGINT);
1648 ev_signal_start (loop, &signal_watcher); 1819 ev_signal_start (loop, &signal_watcher);
1649 1820
1650 1821
1651=head2 C<ev_child> - watch out for process status changes 1822=head2 C<ev_child> - watch out for process status changes
1726its completion. 1897its completion.
1727 1898
1728 ev_child cw; 1899 ev_child cw;
1729 1900
1730 static void 1901 static void
1731 child_cb (EV_P_ struct ev_child *w, int revents) 1902 child_cb (EV_P_ ev_child *w, int revents)
1732 { 1903 {
1733 ev_child_stop (EV_A_ w); 1904 ev_child_stop (EV_A_ w);
1734 printf ("process %d exited with status %x\n", w->rpid, w->rstatus); 1905 printf ("process %d exited with status %x\n", w->rpid, w->rstatus);
1735 } 1906 }
1736 1907
1751 1922
1752 1923
1753=head2 C<ev_stat> - did the file attributes just change? 1924=head2 C<ev_stat> - did the file attributes just change?
1754 1925
1755This watches a file system path for attribute changes. That is, it calls 1926This watches a file system path for attribute changes. That is, it calls
1756C<stat> regularly (or when the OS says it changed) and sees if it changed 1927C<stat> on that path in regular intervals (or when the OS says it changed)
1757compared to the last time, invoking the callback if it did. 1928and sees if it changed compared to the last time, invoking the callback if
1929it did.
1758 1930
1759The path does not need to exist: changing from "path exists" to "path does 1931The path does not need to exist: changing from "path exists" to "path does
1760not exist" is a status change like any other. The condition "path does 1932not exist" is a status change like any other. The condition "path does
1761not exist" is signified by the C<st_nlink> field being zero (which is 1933not exist" is signified by the C<st_nlink> field being zero (which is
1762otherwise always forced to be at least one) and all the other fields of 1934otherwise always forced to be at least one) and all the other fields of
1763the stat buffer having unspecified contents. 1935the stat buffer having unspecified contents.
1764 1936
1765The path I<should> be absolute and I<must not> end in a slash. If it is 1937The 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
1766relative and your working directory changes, the behaviour is undefined. 1939your working directory changes, then the behaviour is undefined.
1767 1940
1768Since there is no standard kernel interface to do this, the portable 1941Since there is no portable change notification interface available, the
1769implementation simply calls C<stat (2)> regularly on the path to see if 1942portable implementation simply calls C<stat(2)> regularly on the path
1770it changed somehow. You can specify a recommended polling interval for 1943to see if it changed somehow. You can specify a recommended polling
1771this case. If you specify a polling interval of C<0> (highly recommended!) 1944interval for this case. If you specify a polling interval of C<0> (highly
1772then a I<suitable, unspecified default> value will be used (which 1945recommended!) then a I<suitable, unspecified default> value will be used
1773you can expect to be around five seconds, although this might change 1946(which you can expect to be around five seconds, although this might
1774dynamically). Libev will also impose a minimum interval which is currently 1947change dynamically). Libev will also impose a minimum interval which is
1775around C<0.1>, but thats usually overkill. 1948currently around C<0.1>, but that's usually overkill.
1776 1949
1777This watcher type is not meant for massive numbers of stat watchers, 1950This watcher type is not meant for massive numbers of stat watchers,
1778as even with OS-supported change notifications, this can be 1951as even with OS-supported change notifications, this can be
1779resource-intensive. 1952resource-intensive.
1780 1953
1790support disabled by default, you get the 32 bit version of the stat 1963support disabled by default, you get the 32 bit version of the stat
1791structure. When using the library from programs that change the ABI to 1964structure. When using the library from programs that change the ABI to
1792use 64 bit file offsets the programs will fail. In that case you have to 1965use 64 bit file offsets the programs will fail. In that case you have to
1793compile libev with the same flags to get binary compatibility. This is 1966compile libev with the same flags to get binary compatibility. This is
1794obviously the case with any flags that change the ABI, but the problem is 1967obviously the case with any flags that change the ABI, but the problem is
1795most noticeably disabled with ev_stat and large file support. 1968most noticeably displayed with ev_stat and large file support.
1796 1969
1797The solution for this is to lobby your distribution maker to make large 1970The solution for this is to lobby your distribution maker to make large
1798file interfaces available by default (as e.g. FreeBSD does) and not 1971file interfaces available by default (as e.g. FreeBSD does) and not
1799optional. Libev cannot simply switch on large file support because it has 1972optional. Libev cannot simply switch on large file support because it has
1800to exchange stat structures with application programs compiled using the 1973to exchange stat structures with application programs compiled using the
1819descriptor open on the object at all times, and detecting renames, unlinks 1992descriptor open on the object at all times, and detecting renames, unlinks
1820etc. is difficult. 1993etc. is difficult.
1821 1994
1822=head3 The special problem of stat time resolution 1995=head3 The special problem of stat time resolution
1823 1996
1824The C<stat ()> system call only supports full-second resolution portably, and 1997The C<stat ()> system call only supports full-second resolution portably,
1825even on systems where the resolution is higher, most file systems still 1998and even on systems where the resolution is higher, most file systems
1826only support whole seconds. 1999still only support whole seconds.
1827 2000
1828That means that, if the time is the only thing that changes, you can 2001That means that, if the time is the only thing that changes, you can
1829easily miss updates: on the first update, C<ev_stat> detects a change and 2002easily miss updates: on the first update, C<ev_stat> detects a change and
1830calls your callback, which does something. When there is another update 2003calls your callback, which does something. When there is another update
1831within the same second, C<ev_stat> will be unable to detect unless the 2004within the same second, C<ev_stat> will be unable to detect unless the
1988 2161
1989Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the 2162Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the
1990callback, free it. Also, use no error checking, as usual. 2163callback, free it. Also, use no error checking, as usual.
1991 2164
1992 static void 2165 static void
1993 idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) 2166 idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
1994 { 2167 {
1995 free (w); 2168 free (w);
1996 // now do something you wanted to do when the program has 2169 // now do something you wanted to do when the program has
1997 // no longer anything immediate to do. 2170 // no longer anything immediate to do.
1998 } 2171 }
1999 2172
2000 struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); 2173 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2001 ev_idle_init (idle_watcher, idle_cb); 2174 ev_idle_init (idle_watcher, idle_cb);
2002 ev_idle_start (loop, idle_cb); 2175 ev_idle_start (loop, idle_cb);
2003 2176
2004 2177
2005=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2178=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2086 2259
2087 static ev_io iow [nfd]; 2260 static ev_io iow [nfd];
2088 static ev_timer tw; 2261 static ev_timer tw;
2089 2262
2090 static void 2263 static void
2091 io_cb (ev_loop *loop, ev_io *w, int revents) 2264 io_cb (struct ev_loop *loop, ev_io *w, int revents)
2092 { 2265 {
2093 } 2266 }
2094 2267
2095 // create io watchers for each fd and a timer before blocking 2268 // create io watchers for each fd and a timer before blocking
2096 static void 2269 static void
2097 adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) 2270 adns_prepare_cb (struct ev_loop *loop, ev_prepare *w, int revents)
2098 { 2271 {
2099 int timeout = 3600000; 2272 int timeout = 3600000;
2100 struct pollfd fds [nfd]; 2273 struct pollfd fds [nfd];
2101 // actual code will need to loop here and realloc etc. 2274 // actual code will need to loop here and realloc etc.
2102 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2275 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2117 } 2290 }
2118 } 2291 }
2119 2292
2120 // stop all watchers after blocking 2293 // stop all watchers after blocking
2121 static void 2294 static void
2122 adns_check_cb (ev_loop *loop, ev_check *w, int revents) 2295 adns_check_cb (struct ev_loop *loop, ev_check *w, int revents)
2123 { 2296 {
2124 ev_timer_stop (loop, &tw); 2297 ev_timer_stop (loop, &tw);
2125 2298
2126 for (int i = 0; i < nfd; ++i) 2299 for (int i = 0; i < nfd; ++i)
2127 { 2300 {
2295C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be 2468C<loop_lo> (which is C<loop_hi> in the case no embeddable loop can be
2296used). 2469used).
2297 2470
2298 struct ev_loop *loop_hi = ev_default_init (0); 2471 struct ev_loop *loop_hi = ev_default_init (0);
2299 struct ev_loop *loop_lo = 0; 2472 struct ev_loop *loop_lo = 0;
2300 struct ev_embed embed; 2473 ev_embed embed;
2301 2474
2302 // see if there is a chance of getting one that works 2475 // see if there is a chance of getting one that works
2303 // (remember that a flags value of 0 means autodetection) 2476 // (remember that a flags value of 0 means autodetection)
2304 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 2477 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
2305 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 2478 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
2319kqueue implementation). Store the kqueue/socket-only event loop in 2492kqueue implementation). Store the kqueue/socket-only event loop in
2320C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 2493C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
2321 2494
2322 struct ev_loop *loop = ev_default_init (0); 2495 struct ev_loop *loop = ev_default_init (0);
2323 struct ev_loop *loop_socket = 0; 2496 struct ev_loop *loop_socket = 0;
2324 struct ev_embed embed; 2497 ev_embed embed;
2325 2498
2326 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 2499 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
2327 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 2500 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
2328 { 2501 {
2329 ev_embed_init (&embed, 0, loop_socket); 2502 ev_embed_init (&embed, 0, loop_socket);
2470=over 4 2643=over 4
2471 2644
2472=item ev_async_init (ev_async *, callback) 2645=item ev_async_init (ev_async *, callback)
2473 2646
2474Initialises and configures the async watcher - it has no parameters of any 2647Initialises and configures the async watcher - it has no parameters of any
2475kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, 2648kind. There is a C<ev_async_set> macro, but using it is utterly pointless,
2476trust me. 2649trust me.
2477 2650
2478=item ev_async_send (loop, ev_async *) 2651=item ev_async_send (loop, ev_async *)
2479 2652
2480Sends/signals/activates the given C<ev_async> watcher, that is, feeds 2653Sends/signals/activates the given C<ev_async> watcher, that is, feeds
2543 /* doh, nothing entered */; 2716 /* doh, nothing entered */;
2544 } 2717 }
2545 2718
2546 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 2719 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2547 2720
2548=item ev_feed_event (ev_loop *, watcher *, int revents) 2721=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2549 2722
2550Feeds the given event set into the event loop, as if the specified event 2723Feeds the given event set into the event loop, as if the specified event
2551had happened for the specified watcher (which must be a pointer to an 2724had happened for the specified watcher (which must be a pointer to an
2552initialised but not necessarily started event watcher). 2725initialised but not necessarily started event watcher).
2553 2726
2554=item ev_feed_fd_event (ev_loop *, int fd, int revents) 2727=item ev_feed_fd_event (struct ev_loop *, int fd, int revents)
2555 2728
2556Feed an event on the given fd, as if a file descriptor backend detected 2729Feed an event on the given fd, as if a file descriptor backend detected
2557the given events it. 2730the given events it.
2558 2731
2559=item ev_feed_signal_event (ev_loop *loop, int signum) 2732=item ev_feed_signal_event (struct ev_loop *loop, int signum)
2560 2733
2561Feed an event as if the given signal occurred (C<loop> must be the default 2734Feed an event as if the given signal occurred (C<loop> must be the default
2562loop!). 2735loop!).
2563 2736
2564=back 2737=back
2799=item D 2972=item D
2800 2973
2801Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to 2974Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to
2802be found at L<http://proj.llucax.com.ar/wiki/evd>. 2975be found at L<http://proj.llucax.com.ar/wiki/evd>.
2803 2976
2977=item Ocaml
2978
2979Erkki Seppala has written Ocaml bindings for libev, to be found at
2980L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
2981
2804=back 2982=back
2805 2983
2806 2984
2807=head1 MACRO MAGIC 2985=head1 MACRO MAGIC
2808 2986
2908 3086
2909 #define EV_STANDALONE 1 3087 #define EV_STANDALONE 1
2910 #include "ev.h" 3088 #include "ev.h"
2911 3089
2912Both header files and implementation files can be compiled with a C++ 3090Both header files and implementation files can be compiled with a C++
2913compiler (at least, thats a stated goal, and breakage will be treated 3091compiler (at least, that's a stated goal, and breakage will be treated
2914as a bug). 3092as a bug).
2915 3093
2916You need the following files in your source tree, or in a directory 3094You need the following files in your source tree, or in a directory
2917in your include path (e.g. in libev/ when using -Ilibev): 3095in your include path (e.g. in libev/ when using -Ilibev):
2918 3096
3390loop, as long as you don't confuse yourself). The only exception is that 3568loop, as long as you don't confuse yourself). The only exception is that
3391you must not do this from C<ev_periodic> reschedule callbacks. 3569you must not do this from C<ev_periodic> reschedule callbacks.
3392 3570
3393Care has been taken to ensure that libev does not keep local state inside 3571Care has been taken to ensure that libev does not keep local state inside
3394C<ev_loop>, and other calls do not usually allow for coroutine switches as 3572C<ev_loop>, and other calls do not usually allow for coroutine switches as
3395they do not clal any callbacks. 3573they do not call any callbacks.
3396 3574
3397=head2 COMPILER WARNINGS 3575=head2 COMPILER WARNINGS
3398 3576
3399Depending on your compiler and compiler settings, you might get no or a 3577Depending on your compiler and compiler settings, you might get no or a
3400lot of warnings when compiling libev code. Some people are apparently 3578lot of warnings when compiling libev code. Some people are apparently
3434 ==2274== definitely lost: 0 bytes in 0 blocks. 3612 ==2274== definitely lost: 0 bytes in 0 blocks.
3435 ==2274== possibly lost: 0 bytes in 0 blocks. 3613 ==2274== possibly lost: 0 bytes in 0 blocks.
3436 ==2274== still reachable: 256 bytes in 1 blocks. 3614 ==2274== still reachable: 256 bytes in 1 blocks.
3437 3615
3438Then there is no memory leak, just as memory accounted to global variables 3616Then there is no memory leak, just as memory accounted to global variables
3439is not a memleak - the memory is still being refernced, and didn't leak. 3617is not a memleak - the memory is still being referenced, and didn't leak.
3440 3618
3441Similarly, under some circumstances, valgrind might report kernel bugs 3619Similarly, under some circumstances, valgrind might report kernel bugs
3442as if it were a bug in libev (e.g. in realloc or in the poll backend, 3620as if it were a bug in libev (e.g. in realloc or in the poll backend,
3443although an acceptable workaround has been found here), or it might be 3621although an acceptable workaround has been found here), or it might be
3444confused. 3622confused.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines