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.275 by root, Sat Dec 26 09:21:54 2009 UTC

98=head2 FEATURES 98=head2 FEATURES
99 99
100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the 100Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the
101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms 101BSD-specific C<kqueue> and the Solaris-specific event port mechanisms
102for file descriptor events (C<ev_io>), the Linux C<inotify> interface 102for file descriptor events (C<ev_io>), the Linux C<inotify> interface
103(for C<ev_stat>), relative timers (C<ev_timer>), absolute timers 103(for C<ev_stat>), Linux eventfd/signalfd (for faster and cleaner
104with customised rescheduling (C<ev_periodic>), synchronous signals 104inter-thread wakeup (C<ev_async>)/signal handling (C<ev_signal>)) relative
105(C<ev_signal>), process status change events (C<ev_child>), and event 105timers (C<ev_timer>), absolute timers with customised rescheduling
106watchers dealing with the event loop mechanism itself (C<ev_idle>, 106(C<ev_periodic>), synchronous signals (C<ev_signal>), process status
107C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as 107change events (C<ev_child>), and event watchers dealing with the event
108file watchers (C<ev_stat>) and even limited support for fork events 108loop mechanism itself (C<ev_idle>, C<ev_embed>, C<ev_prepare> and
109(C<ev_fork>). 109C<ev_check> watchers) as well as file watchers (C<ev_stat>) and even
110limited support for fork events (C<ev_fork>).
110 111
111It also is quite fast (see this 112It also is quite fast (see this
112L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent 113L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent
113for example). 114for example).
114 115
117Libev is very configurable. In this manual the default (and most common) 118Libev is very configurable. In this manual the default (and most common)
118configuration will be described, which supports multiple event loops. For 119configuration will be described, which supports multiple event loops. For
119more info about various configuration options please have a look at 120more info about various configuration options please have a look at
120B<EMBED> section in this manual. If libev was configured without support 121B<EMBED> section in this manual. If libev was configured without support
121for multiple event loops, then all functions taking an initial argument of 122for multiple event loops, then all functions taking an initial argument of
122name C<loop> (which is always of type C<ev_loop *>) will not have 123name C<loop> (which is always of type C<struct ev_loop *>) will not have
123this argument. 124this argument.
124 125
125=head2 TIME REPRESENTATION 126=head2 TIME REPRESENTATION
126 127
127Libev represents time as a single floating point number, representing 128Libev represents time as a single floating point number, representing
362flag. 363flag.
363 364
364This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 365This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
365environment variable. 366environment variable.
366 367
368=item C<EVFLAG_NOINOTIFY>
369
370When this flag is specified, then libev will not attempt to use the
371I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and
372testing, this flag can be useful to conserve inotify file descriptors, as
373otherwise each loop using C<ev_stat> watchers consumes one inotify handle.
374
375=item C<EVFLAG_NOSIGFD>
376
377When this flag is specified, then libev will not attempt to use the
378I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This is
379probably only useful to work around any bugs in libev. Consequently, this
380flag might go away once the signalfd functionality is considered stable,
381so it's useful mostly in environment variables and not in program code.
382
367=item C<EVBACKEND_SELECT> (value 1, portable select backend) 383=item C<EVBACKEND_SELECT> (value 1, portable select backend)
368 384
369This is your standard select(2) backend. Not I<completely> standard, as 385This is your standard select(2) backend. Not I<completely> standard, as
370libev tries to roll its own fd_set with no limits on the number of fds, 386libev tries to roll its own fd_set with no limits on the number of fds,
371but if that fails, expect a fairly low limit on the number of fds when 387but if that fails, expect a fairly low limit on the number of fds when
394 410
395This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and 411This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and
396C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. 412C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>.
397 413
398=item C<EVBACKEND_EPOLL> (value 4, Linux) 414=item C<EVBACKEND_EPOLL> (value 4, Linux)
415
416Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9
417kernels).
399 418
400For few fds, this backend is a bit little slower than poll and select, 419For few fds, this backend is a bit little slower than poll and select,
401but it scales phenomenally better. While poll and select usually scale 420but it scales phenomenally better. While poll and select usually scale
402like O(total_fds) where n is the total number of fds (or the highest fd), 421like O(total_fds) where n is the total number of fds (or the highest fd),
403epoll scales either O(1) or O(active_fds). 422epoll scales either O(1) or O(active_fds).
518 537
519It is definitely not recommended to use this flag. 538It is definitely not recommended to use this flag.
520 539
521=back 540=back
522 541
523If one or more of these are or'ed into the flags value, then only these 542If one or more of the backend flags are or'ed into the flags value,
524backends will be tried (in the reverse order as listed here). If none are 543then only these backends will be tried (in the reverse order as listed
525specified, all backends in C<ev_recommended_backends ()> will be tried. 544here). If none are specified, all backends in C<ev_recommended_backends
545()> will be tried.
526 546
527Example: This is the most typical usage. 547Example: This is the most typical usage.
528 548
529 if (!ev_default_loop (0)) 549 if (!ev_default_loop (0))
530 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); 550 fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?");
573as signal and child watchers) would need to be stopped manually. 593as signal and child watchers) would need to be stopped manually.
574 594
575In general it is not advisable to call this function except in the 595In general it is not advisable to call this function except in the
576rare occasion where you really need to free e.g. the signal handling 596rare occasion where you really need to free e.g. the signal handling
577pipe fds. If you need dynamically allocated loops it is better to use 597pipe fds. If you need dynamically allocated loops it is better to use
578C<ev_loop_new> and C<ev_loop_destroy>). 598C<ev_loop_new> and C<ev_loop_destroy>.
579 599
580=item ev_loop_destroy (loop) 600=item ev_loop_destroy (loop)
581 601
582Like C<ev_default_destroy>, but destroys an event loop created by an 602Like C<ev_default_destroy>, but destroys an event loop created by an
583earlier call to C<ev_loop_new>. 603earlier call to C<ev_loop_new>.
621 641
622This value can sometimes be useful as a generation counter of sorts (it 642This value can sometimes be useful as a generation counter of sorts (it
623"ticks" the number of loop iterations), as it roughly corresponds with 643"ticks" the number of loop iterations), as it roughly corresponds with
624C<ev_prepare> and C<ev_check> calls. 644C<ev_prepare> and C<ev_check> calls.
625 645
646=item unsigned int ev_loop_depth (loop)
647
648Returns the number of times C<ev_loop> was entered minus the number of
649times C<ev_loop> was exited, in other words, the recursion depth.
650
651Outside C<ev_loop>, this number is zero. In a callback, this number is
652C<1>, unless C<ev_loop> was invoked recursively (or from another thread),
653in which case it is higher.
654
655Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread
656etc.), doesn't count as exit.
657
626=item unsigned int ev_backend (loop) 658=item unsigned int ev_backend (loop)
627 659
628Returns one of the C<EVBACKEND_*> flags indicating the event backend in 660Returns one of the C<EVBACKEND_*> flags indicating the event backend in
629use. 661use.
630 662
675event loop time (see C<ev_now_update>). 707event loop time (see C<ev_now_update>).
676 708
677=item ev_loop (loop, int flags) 709=item ev_loop (loop, int flags)
678 710
679Finally, this is it, the event handler. This function usually is called 711Finally, this is it, the event handler. This function usually is called
680after you initialised all your watchers and you want to start handling 712after you have initialised all your watchers and you want to start
681events. 713handling events.
682 714
683If the flags argument is specified as C<0>, it will not return until 715If the flags argument is specified as C<0>, it will not return until
684either no event watchers are active anymore or C<ev_unloop> was called. 716either no event watchers are active anymore or C<ev_unloop> was called.
685 717
686Please note that an explicit C<ev_unloop> is usually better than 718Please note that an explicit C<ev_unloop> is usually better than
811 843
812By setting a higher I<io collect interval> you allow libev to spend more 844By 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, 845time collecting I/O events, so you can handle more events per iteration,
814at the cost of increasing latency. Timeouts (both C<ev_periodic> and 846at 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 847C<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. 848introduce an additional C<ev_sleep ()> call into most loop iterations. The
849sleep time ensures that libev will not poll for I/O events more often then
850once per this interval, on average.
817 851
818Likewise, by setting a higher I<timeout collect interval> you allow libev 852Likewise, by setting a higher I<timeout collect interval> you allow libev
819to spend more time collecting timeouts, at the expense of increased 853to spend more time collecting timeouts, at the expense of increased
820latency/jitter/inexactness (the watcher callback will be called 854latency/jitter/inexactness (the watcher callback will be called
821later). C<ev_io> watchers will not be affected. Setting this to a non-null 855later). C<ev_io> watchers will not be affected. Setting this to a non-null
823 857
824Many (busy) programs can usually benefit by setting the I/O collect 858Many (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 859interval 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 860interactive 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>, 861usually 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. 862as this approaches the timing granularity of most systems. Note that if
863you do transactions with the outside world and you can't increase the
864parallelity, then this setting will limit your transaction rate (if you
865need to poll once per transaction and the I/O collect interval is 0.01,
866then you can't do more than 100 transations per second).
829 867
830Setting the I<timeout collect interval> can improve the opportunity for 868Setting the I<timeout collect interval> can improve the opportunity for
831saving power, as the program will "bundle" timer callback invocations that 869saving power, as the program will "bundle" timer callback invocations that
832are "near" in time together, by delaying some, thus reducing the number of 870are "near" in time together, by delaying some, thus reducing the number of
833times the process sleeps and wakes up again. Another useful technique to 871times 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 872reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure
835they fire on, say, one-second boundaries only. 873they fire on, say, one-second boundaries only.
874
875Example: we only need 0.1s timeout granularity, and we wish not to poll
876more often than 100 times per second:
877
878 ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1);
879 ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01);
880
881=item ev_invoke_pending (loop)
882
883This call will simply invoke all pending watchers while resetting their
884pending state. Normally, C<ev_loop> does this automatically when required,
885but when overriding the invoke callback this call comes handy.
886
887=item int ev_pending_count (loop)
888
889Returns the number of pending watchers - zero indicates that no watchers
890are pending.
891
892=item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P))
893
894This overrides the invoke pending functionality of the loop: Instead of
895invoking all pending watchers when there are any, C<ev_loop> will call
896this callback instead. This is useful, for example, when you want to
897invoke the actual watchers inside another context (another thread etc.).
898
899If you want to reset the callback, use C<ev_invoke_pending> as new
900callback.
901
902=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P))
903
904Sometimes you want to share the same loop between multiple threads. This
905can be done relatively simply by putting mutex_lock/unlock calls around
906each call to a libev function.
907
908However, C<ev_loop> can run an indefinite time, so it is not feasible to
909wait for it to return. One way around this is to wake up the loop via
910C<ev_unloop> and C<av_async_send>, another way is to set these I<release>
911and I<acquire> callbacks on the loop.
912
913When set, then C<release> will be called just before the thread is
914suspended waiting for new events, and C<acquire> is called just
915afterwards.
916
917Ideally, C<release> will just call your mutex_unlock function, and
918C<acquire> will just call the mutex_lock function again.
919
920While event loop modifications are allowed between invocations of
921C<release> and C<acquire> (that's their only purpose after all), no
922modifications done will affect the event loop, i.e. adding watchers will
923have no effect on the set of file descriptors being watched, or the time
924waited. Use an C<ev_async> watcher to wake up C<ev_loop> when you want it
925to take note of any changes you made.
926
927In theory, threads executing C<ev_loop> will be async-cancel safe between
928invocations of C<release> and C<acquire>.
929
930See also the locking example in the C<THREADS> section later in this
931document.
932
933=item ev_set_userdata (loop, void *data)
934
935=item ev_userdata (loop)
936
937Set and retrieve a single C<void *> associated with a loop. When
938C<ev_set_userdata> has never been called, then C<ev_userdata> returns
939C<0.>
940
941These two functions can be used to associate arbitrary data with a loop,
942and are intended solely for the C<invoke_pending_cb>, C<release> and
943C<acquire> callbacks described above, but of course can be (ab-)used for
944any other purpose as well.
836 945
837=item ev_loop_verify (loop) 946=item ev_loop_verify (loop)
838 947
839This function only does something when C<EV_VERIFY> support has been 948This 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 949compiled in, which is the default for non-minimal builds. It tries to go
1017 1126
1018 ev_io w; 1127 ev_io w;
1019 ev_init (&w, my_cb); 1128 ev_init (&w, my_cb);
1020 ev_io_set (&w, STDIN_FILENO, EV_READ); 1129 ev_io_set (&w, STDIN_FILENO, EV_READ);
1021 1130
1022=item C<ev_TYPE_set> (ev_TYPE *, [args]) 1131=item C<ev_TYPE_set> (ev_TYPE *watcher, [args])
1023 1132
1024This macro initialises the type-specific parts of a watcher. You need to 1133This macro initialises the type-specific parts of a watcher. You need to
1025call C<ev_init> at least once before you call this macro, but you can 1134call C<ev_init> at least once before you call this macro, but you can
1026call C<ev_TYPE_set> any number of times. You must not, however, call this 1135call C<ev_TYPE_set> any number of times. You must not, however, call this
1027macro on a watcher that is active (it can be pending, however, which is a 1136macro on a watcher that is active (it can be pending, however, which is a
1040 1149
1041Example: Initialise and set an C<ev_io> watcher in one step. 1150Example: Initialise and set an C<ev_io> watcher in one step.
1042 1151
1043 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); 1152 ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ);
1044 1153
1045=item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) 1154=item C<ev_TYPE_start> (loop, ev_TYPE *watcher)
1046 1155
1047Starts (activates) the given watcher. Only active watchers will receive 1156Starts (activates) the given watcher. Only active watchers will receive
1048events. If the watcher is already active nothing will happen. 1157events. If the watcher is already active nothing will happen.
1049 1158
1050Example: Start the C<ev_io> watcher that is being abused as example in this 1159Example: Start the C<ev_io> watcher that is being abused as example in this
1051whole section. 1160whole section.
1052 1161
1053 ev_io_start (EV_DEFAULT_UC, &w); 1162 ev_io_start (EV_DEFAULT_UC, &w);
1054 1163
1055=item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) 1164=item C<ev_TYPE_stop> (loop, ev_TYPE *watcher)
1056 1165
1057Stops the given watcher if active, and clears the pending status (whether 1166Stops the given watcher if active, and clears the pending status (whether
1058the watcher was active or not). 1167the watcher was active or not).
1059 1168
1060It is possible that stopped watchers are pending - for example, 1169It is possible that stopped watchers are pending - for example,
1085=item ev_cb_set (ev_TYPE *watcher, callback) 1194=item ev_cb_set (ev_TYPE *watcher, callback)
1086 1195
1087Change the callback. You can change the callback at virtually any time 1196Change the callback. You can change the callback at virtually any time
1088(modulo threads). 1197(modulo threads).
1089 1198
1090=item ev_set_priority (ev_TYPE *watcher, priority) 1199=item ev_set_priority (ev_TYPE *watcher, int priority)
1091 1200
1092=item int ev_priority (ev_TYPE *watcher) 1201=item int ev_priority (ev_TYPE *watcher)
1093 1202
1094Set and query the priority of the watcher. The priority is a small 1203Set and query the priority of the watcher. The priority is a small
1095integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> 1204integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI>
1126returns its C<revents> bitset (as if its callback was invoked). If the 1235returns its C<revents> bitset (as if its callback was invoked). If the
1127watcher isn't pending it does nothing and returns C<0>. 1236watcher isn't pending it does nothing and returns C<0>.
1128 1237
1129Sometimes it can be useful to "poll" a watcher instead of waiting for its 1238Sometimes it can be useful to "poll" a watcher instead of waiting for its
1130callback to be invoked, which can be accomplished with this function. 1239callback to be invoked, which can be accomplished with this function.
1240
1241=item ev_feed_event (loop, ev_TYPE *watcher, int revents)
1242
1243Feeds the given event set into the event loop, as if the specified event
1244had happened for the specified watcher (which must be a pointer to an
1245initialised but not necessarily started event watcher). Obviously you must
1246not free the watcher as long as it has pending events.
1247
1248Stopping the watcher, letting libev invoke it, or calling
1249C<ev_clear_pending> will clear the pending event, even if the watcher was
1250not started in the first place.
1251
1252See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1253functions that do not need a watcher.
1131 1254
1132=back 1255=back
1133 1256
1134 1257
1135=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER 1258=head2 ASSOCIATING CUSTOM DATA WITH A WATCHER
1184 #include <stddef.h> 1307 #include <stddef.h>
1185 1308
1186 static void 1309 static void
1187 t1_cb (EV_P_ ev_timer *w, int revents) 1310 t1_cb (EV_P_ ev_timer *w, int revents)
1188 { 1311 {
1189 struct my_biggy big = (struct my_biggy * 1312 struct my_biggy big = (struct my_biggy *)
1190 (((char *)w) - offsetof (struct my_biggy, t1)); 1313 (((char *)w) - offsetof (struct my_biggy, t1));
1191 } 1314 }
1192 1315
1193 static void 1316 static void
1194 t2_cb (EV_P_ ev_timer *w, int revents) 1317 t2_cb (EV_P_ ev_timer *w, int revents)
1195 { 1318 {
1196 struct my_biggy big = (struct my_biggy * 1319 struct my_biggy big = (struct my_biggy *)
1197 (((char *)w) - offsetof (struct my_biggy, t2)); 1320 (((char *)w) - offsetof (struct my_biggy, t2));
1198 } 1321 }
1199 1322
1200=head2 WATCHER PRIORITY MODELS 1323=head2 WATCHER PRIORITY MODELS
1201 1324
1277 // with the default priority are receiving events. 1400 // with the default priority are receiving events.
1278 ev_idle_start (EV_A_ &idle); 1401 ev_idle_start (EV_A_ &idle);
1279 } 1402 }
1280 1403
1281 static void 1404 static void
1282 idle-cb (EV_P_ ev_idle *w, int revents) 1405 idle_cb (EV_P_ ev_idle *w, int revents)
1283 { 1406 {
1284 // actual processing 1407 // actual processing
1285 read (STDIN_FILENO, ...); 1408 read (STDIN_FILENO, ...);
1286 1409
1287 // have to start the I/O watcher again, as 1410 // have to start the I/O watcher again, as
1332descriptors to non-blocking mode is also usually a good idea (but not 1455descriptors to non-blocking mode is also usually a good idea (but not
1333required if you know what you are doing). 1456required if you know what you are doing).
1334 1457
1335If you cannot use non-blocking mode, then force the use of a 1458If 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 1459known-to-be-good backend (at the time of this writing, this includes only
1337C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). 1460C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file
1461descriptors for which non-blocking operation makes no sense (such as
1462files) - libev doesn't guarentee any specific behaviour in that case.
1338 1463
1339Another thing you have to watch out for is that it is quite easy to 1464Another thing you have to watch out for is that it is quite easy to
1340receive "spurious" readiness notifications, that is your callback might 1465receive "spurious" readiness notifications, that is your callback might
1341be called with C<EV_READ> but a subsequent C<read>(2) will actually block 1466be 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 1467because 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 1588year, it will still time out after (roughly) one hour. "Roughly" because
1464detecting time jumps is hard, and some inaccuracies are unavoidable (the 1589detecting time jumps is hard, and some inaccuracies are unavoidable (the
1465monotonic clock option helps a lot here). 1590monotonic clock option helps a lot here).
1466 1591
1467The callback is guaranteed to be invoked only I<after> its timeout has 1592The callback is guaranteed to be invoked only I<after> its timeout has
1468passed. If multiple timers become ready during the same loop iteration 1593passed (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 1594might 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 1595same loop iteration then the ones with earlier time-out values are invoked
1471C<ev_loop> recursively). 1596before ones of the same priority with later time-out values (but this is
1597no longer true when a callback calls C<ev_loop> recursively).
1472 1598
1473=head3 Be smart about timeouts 1599=head3 Be smart about timeouts
1474 1600
1475Many real-world problems involve some kind of timeout, usually for error 1601Many real-world problems involve some kind of timeout, usually for error
1476recovery. A typical example is an HTTP request - if the other side hangs, 1602recovery. 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> 1646C<after> argument to C<ev_timer_set>, and only ever use the C<repeat>
1521member and C<ev_timer_again>. 1647member and C<ev_timer_again>.
1522 1648
1523At start: 1649At start:
1524 1650
1525 ev_timer_init (timer, callback); 1651 ev_init (timer, callback);
1526 timer->repeat = 60.; 1652 timer->repeat = 60.;
1527 ev_timer_again (loop, timer); 1653 ev_timer_again (loop, timer);
1528 1654
1529Each time there is some activity: 1655Each time there is some activity:
1530 1656
1592 1718
1593To start the timer, simply initialise the watcher and set C<last_activity> 1719To 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 1720to the current time (meaning we just have some activity :), then call the
1595callback, which will "do the right thing" and start the timer: 1721callback, which will "do the right thing" and start the timer:
1596 1722
1597 ev_timer_init (timer, callback); 1723 ev_init (timer, callback);
1598 last_activity = ev_now (loop); 1724 last_activity = ev_now (loop);
1599 callback (loop, timer, EV_TIMEOUT); 1725 callback (loop, timer, EV_TIMEOUT);
1600 1726
1601And when there is some activity, simply store the current time in 1727And when there is some activity, simply store the current time in
1602C<last_activity>, no libev calls at all: 1728C<last_activity>, no libev calls at all:
1663 1789
1664If the event loop is suspended for a long time, you can also force an 1790If the event loop is suspended for a long time, you can also force an
1665update of the time returned by C<ev_now ()> by calling C<ev_now_update 1791update of the time returned by C<ev_now ()> by calling C<ev_now_update
1666()>. 1792()>.
1667 1793
1794=head3 The special problems of suspended animation
1795
1796When you leave the server world it is quite customary to hit machines that
1797can suspend/hibernate - what happens to the clocks during such a suspend?
1798
1799Some quick tests made with a Linux 2.6.28 indicate that a suspend freezes
1800all processes, while the clocks (C<times>, C<CLOCK_MONOTONIC>) continue
1801to run until the system is suspended, but they will not advance while the
1802system is suspended. That means, on resume, it will be as if the program
1803was frozen for a few seconds, but the suspend time will not be counted
1804towards C<ev_timer> when a monotonic clock source is used. The real time
1805clock advanced as expected, but if it is used as sole clocksource, then a
1806long suspend would be detected as a time jump by libev, and timers would
1807be adjusted accordingly.
1808
1809I would not be surprised to see different behaviour in different between
1810operating systems, OS versions or even different hardware.
1811
1812The other form of suspend (job control, or sending a SIGSTOP) will see a
1813time jump in the monotonic clocks and the realtime clock. If the program
1814is suspended for a very long time, and monotonic clock sources are in use,
1815then you can expect C<ev_timer>s to expire as the full suspension time
1816will be counted towards the timers. When no monotonic clock source is in
1817use, then libev will again assume a timejump and adjust accordingly.
1818
1819It might be beneficial for this latter case to call C<ev_suspend>
1820and C<ev_resume> in code that handles C<SIGTSTP>, to at least get
1821deterministic behaviour in this case (you can do nothing against
1822C<SIGSTOP>).
1823
1668=head3 Watcher-Specific Functions and Data Members 1824=head3 Watcher-Specific Functions and Data Members
1669 1825
1670=over 4 1826=over 4
1671 1827
1672=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 1828=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
1697If the timer is repeating, either start it if necessary (with the 1853If the timer is repeating, either start it if necessary (with the
1698C<repeat> value), or reset the running timer to the C<repeat> value. 1854C<repeat> value), or reset the running timer to the C<repeat> value.
1699 1855
1700This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 1856This sounds a bit complicated, see L<Be smart about timeouts>, above, for a
1701usage example. 1857usage example.
1858
1859=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
1860
1861Returns the remaining time until a timer fires. If the timer is active,
1862then this time is relative to the current event loop time, otherwise it's
1863the timeout value currently configured.
1864
1865That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns
1866C<5>. When the timer is started and one second passes, C<ev_timer_remain>
1867will return C<4>. When the timer expires and is restarted, it will return
1868roughly C<7> (likely slightly less as callback invocation takes some time,
1869too), and so on.
1702 1870
1703=item ev_tstamp repeat [read-write] 1871=item ev_tstamp repeat [read-write]
1704 1872
1705The current C<repeat> value. Will be used each time the watcher times out 1873The current C<repeat> value. Will be used each time the watcher times out
1706or C<ev_timer_again> is called, and determines the next timeout (if any), 1874or C<ev_timer_again> is called, and determines the next timeout (if any),
1942Signal watchers will trigger an event when the process receives a specific 2110Signal watchers will trigger an event when the process receives a specific
1943signal one or more times. Even though signals are very asynchronous, libev 2111signal one or more times. Even though signals are very asynchronous, libev
1944will try it's best to deliver signals synchronously, i.e. as part of the 2112will try it's best to deliver signals synchronously, i.e. as part of the
1945normal event processing, like any other event. 2113normal event processing, like any other event.
1946 2114
1947If you want signals asynchronously, just use C<sigaction> as you would 2115If you want signals to be delivered truly asynchronously, just use
1948do without libev and forget about sharing the signal. You can even use 2116C<sigaction> as you would do without libev and forget about sharing
1949C<ev_async> from a signal handler to synchronously wake up an event loop. 2117the signal. You can even use C<ev_async> from a signal handler to
2118synchronously wake up an event loop.
1950 2119
1951You can configure as many watchers as you like per signal. Only when the 2120You can configure as many watchers as you like for the same signal, but
2121only within the same loop, i.e. you can watch for C<SIGINT> in your
2122default loop and for C<SIGIO> in another loop, but you cannot watch for
2123C<SIGINT> in both the default loop and another loop at the same time. At
2124the moment, C<SIGCHLD> is permanently tied to the default loop.
2125
1952first watcher gets started will libev actually register a signal handler 2126When the first watcher gets started will libev actually register something
1953with the kernel (thus it coexists with your own signal handlers as long as 2127with the kernel (thus it coexists with your own signal handlers as long as
1954you don't register any with libev for the same signal). Similarly, when 2128you don't register any with libev for the same signal).
1955the last signal watcher for a signal is stopped, libev will reset the
1956signal handler to SIG_DFL (regardless of what it was set to before).
1957 2129
1958If possible and supported, libev will install its handlers with 2130If possible and supported, libev will install its handlers with
1959C<SA_RESTART> behaviour enabled, so system calls should not be unduly 2131C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
1960interrupted. If you have a problem with system calls getting interrupted by 2132not be unduly interrupted. If you have a problem with system calls getting
1961signals you can block all signals in an C<ev_check> watcher and unblock 2133interrupted by signals you can block all signals in an C<ev_check> watcher
1962them in an C<ev_prepare> watcher. 2134and unblock them in an C<ev_prepare> watcher.
2135
2136=head3 The special problem of inheritance over execve
2137
2138Both the signal mask (C<sigprocmask>) and the signal disposition
2139(C<sigaction>) are unspecified after starting a signal watcher (and after
2140stopping it again), that is, libev might or might not block the signal,
2141and might or might not set or restore the installed signal handler.
2142
2143While this does not matter for the signal disposition (libev never
2144sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on
2145C<execve>), this matters for the signal mask: many programs do not expect
2146certain signals to be blocked.
2147
2148This means that before calling C<exec> (from the child) you should reset
2149the signal mask to whatever "default" you expect (all clear is a good
2150choice usually).
2151
2152The simplest way to ensure that the signal mask is reset in the child is
2153to install a fork handler with C<pthread_atfork> that resets it. That will
2154catch fork calls done by libraries (such as the libc) as well.
2155
2156In current versions of libev, you can also ensure that the signal mask is
2157not blocking any signals (except temporarily, so thread users watch out)
2158by specifying the C<EVFLAG_NOSIGFD> when creating the event loop. This
2159is not guaranteed for future versions, however.
1963 2160
1964=head3 Watcher-Specific Functions and Data Members 2161=head3 Watcher-Specific Functions and Data Members
1965 2162
1966=over 4 2163=over 4
1967 2164
1999some child status changes (most typically when a child of yours dies or 2196some 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 2197exits). It is permissible to install a child watcher I<after> the child
2001has been forked (which implies it might have already exited), as long 2198has 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., 2199as 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, 2200forking and then immediately registering a watcher for the child is fine,
2004but forking and registering a watcher a few event loop iterations later is 2201but forking and registering a watcher a few event loop iterations later or
2005not. 2202in the next callback invocation is not.
2006 2203
2007Only the default event loop is capable of handling signals, and therefore 2204Only the default event loop is capable of handling signals, and therefore
2008you can only register child watchers in the default event loop. 2205you can only register child watchers in the default event loop.
2009 2206
2207Due to some design glitches inside libev, child watchers will always be
2208handled at maximum priority (their priority is set to C<EV_MAXPRI> by
2209libev)
2210
2010=head3 Process Interaction 2211=head3 Process Interaction
2011 2212
2012Libev grabs C<SIGCHLD> as soon as the default event loop is 2213Libev grabs C<SIGCHLD> as soon as the default event loop is
2013initialised. This is necessary to guarantee proper behaviour even if 2214initialised. This is necessary to guarantee proper behaviour even if the
2014the first child watcher is started after the child exits. The occurrence 2215first child watcher is started after the child exits. The occurrence
2015of C<SIGCHLD> is recorded asynchronously, but child reaping is done 2216of C<SIGCHLD> is recorded asynchronously, but child reaping is done
2016synchronously as part of the event loop processing. Libev always reaps all 2217synchronously as part of the event loop processing. Libev always reaps all
2017children, even ones not watched. 2218children, even ones not watched.
2018 2219
2019=head3 Overriding the Built-In Processing 2220=head3 Overriding the Built-In Processing
2029=head3 Stopping the Child Watcher 2230=head3 Stopping the Child Watcher
2030 2231
2031Currently, the child watcher never gets stopped, even when the 2232Currently, the child watcher never gets stopped, even when the
2032child terminates, so normally one needs to stop the watcher in the 2233child terminates, so normally one needs to stop the watcher in the
2033callback. Future versions of libev might stop the watcher automatically 2234callback. Future versions of libev might stop the watcher automatically
2034when a child exit is detected. 2235when a child exit is detected (calling C<ev_child_stop> twice is not a
2236problem).
2035 2237
2036=head3 Watcher-Specific Functions and Data Members 2238=head3 Watcher-Specific Functions and Data Members
2037 2239
2038=over 4 2240=over 4
2039 2241
2365 // no longer anything immediate to do. 2567 // no longer anything immediate to do.
2366 } 2568 }
2367 2569
2368 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2570 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2369 ev_idle_init (idle_watcher, idle_cb); 2571 ev_idle_init (idle_watcher, idle_cb);
2370 ev_idle_start (loop, idle_cb); 2572 ev_idle_start (loop, idle_watcher);
2371 2573
2372 2574
2373=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2575=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2374 2576
2375Prepare and check watchers are usually (but not always) used in pairs: 2577Prepare and check watchers are usually (but not always) used in pairs:
2468 struct pollfd fds [nfd]; 2670 struct pollfd fds [nfd];
2469 // actual code will need to loop here and realloc etc. 2671 // actual code will need to loop here and realloc etc.
2470 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); 2672 adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ()));
2471 2673
2472 /* the callback is illegal, but won't be called as we stop during check */ 2674 /* the callback is illegal, but won't be called as we stop during check */
2473 ev_timer_init (&tw, 0, timeout * 1e-3); 2675 ev_timer_init (&tw, 0, timeout * 1e-3, 0.);
2474 ev_timer_start (loop, &tw); 2676 ev_timer_start (loop, &tw);
2475 2677
2476 // create one ev_io per pollfd 2678 // create one ev_io per pollfd
2477 for (int i = 0; i < nfd; ++i) 2679 for (int i = 0; i < nfd; ++i)
2478 { 2680 {
2779=head3 Queueing 2981=head3 Queueing
2780 2982
2781C<ev_async> does not support queueing of data in any way. The reason 2983C<ev_async> does not support queueing of data in any way. The reason
2782is that the author does not know of a simple (or any) algorithm for a 2984is that the author does not know of a simple (or any) algorithm for a
2783multiple-writer-single-reader queue that works in all cases and doesn't 2985multiple-writer-single-reader queue that works in all cases and doesn't
2784need elaborate support such as pthreads. 2986need elaborate support such as pthreads or unportable memory access
2987semantics.
2785 2988
2786That means that if you want to queue data, you have to provide your own 2989That means that if you want to queue data, you have to provide your own
2787queue. But at least I can tell you how to implement locking around your 2990queue. But at least I can tell you how to implement locking around your
2788queue: 2991queue:
2789 2992
2947 /* doh, nothing entered */; 3150 /* doh, nothing entered */;
2948 } 3151 }
2949 3152
2950 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); 3153 ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0);
2951 3154
2952=item ev_feed_event (struct ev_loop *, watcher *, int revents)
2953
2954Feeds the given event set into the event loop, as if the specified event
2955had happened for the specified watcher (which must be a pointer to an
2956initialised but not necessarily started event watcher).
2957
2958=item ev_feed_fd_event (struct ev_loop *, int fd, int revents) 3155=item ev_feed_fd_event (loop, int fd, int revents)
2959 3156
2960Feed an event on the given fd, as if a file descriptor backend detected 3157Feed an event on the given fd, as if a file descriptor backend detected
2961the given events it. 3158the given events it.
2962 3159
2963=item ev_feed_signal_event (struct ev_loop *loop, int signum) 3160=item ev_feed_signal_event (loop, int signum)
2964 3161
2965Feed an event as if the given signal occurred (C<loop> must be the default 3162Feed an event as if the given signal occurred (C<loop> must be the default
2966loop!). 3163loop!).
2967 3164
2968=back 3165=back
3048 3245
3049=over 4 3246=over 4
3050 3247
3051=item ev::TYPE::TYPE () 3248=item ev::TYPE::TYPE ()
3052 3249
3053=item ev::TYPE::TYPE (struct ev_loop *) 3250=item ev::TYPE::TYPE (loop)
3054 3251
3055=item ev::TYPE::~TYPE 3252=item ev::TYPE::~TYPE
3056 3253
3057The constructor (optionally) takes an event loop to associate the watcher 3254The constructor (optionally) takes an event loop to associate the watcher
3058with. If it is omitted, it will use C<EV_DEFAULT>. 3255with. If it is omitted, it will use C<EV_DEFAULT>.
3135Example: Use a plain function as callback. 3332Example: Use a plain function as callback.
3136 3333
3137 static void io_cb (ev::io &w, int revents) { } 3334 static void io_cb (ev::io &w, int revents) { }
3138 iow.set <io_cb> (); 3335 iow.set <io_cb> ();
3139 3336
3140=item w->set (struct ev_loop *) 3337=item w->set (loop)
3141 3338
3142Associates a different C<struct ev_loop> with this watcher. You can only 3339Associates a different C<struct ev_loop> with this watcher. You can only
3143do this when the watcher is inactive (and not pending either). 3340do this when the watcher is inactive (and not pending either).
3144 3341
3145=item w->set ([arguments]) 3342=item w->set ([arguments])
3242=item Ocaml 3439=item Ocaml
3243 3440
3244Erkki Seppala has written Ocaml bindings for libev, to be found at 3441Erkki Seppala has written Ocaml bindings for libev, to be found at
3245L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. 3442L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>.
3246 3443
3444=item Lua
3445
3446Brian Maher has written a partial interface to libev
3447for lua (only C<ev_io> and C<ev_timer>), to be found at
3448L<http://github.com/brimworks/lua-ev>.
3449
3247=back 3450=back
3248 3451
3249 3452
3250=head1 MACRO MAGIC 3453=head1 MACRO MAGIC
3251 3454
3417keeps libev from including F<config.h>, and it also defines dummy 3620keeps libev from including F<config.h>, and it also defines dummy
3418implementations for some libevent functions (such as logging, which is not 3621implementations for some libevent functions (such as logging, which is not
3419supported). It will also not define any of the structs usually found in 3622supported). It will also not define any of the structs usually found in
3420F<event.h> that are not directly supported by the libev core alone. 3623F<event.h> that are not directly supported by the libev core alone.
3421 3624
3422In stanbdalone mode, libev will still try to automatically deduce the 3625In standalone mode, libev will still try to automatically deduce the
3423configuration, but has to be more conservative. 3626configuration, but has to be more conservative.
3424 3627
3425=item EV_USE_MONOTONIC 3628=item EV_USE_MONOTONIC
3426 3629
3427If defined to be C<1>, libev will try to detect the availability of the 3630If defined to be C<1>, libev will try to detect the availability of the
3492be used is the winsock select). This means that it will call 3695be used is the winsock select). This means that it will call
3493C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, 3696C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise,
3494it is assumed that all these functions actually work on fds, even 3697it is assumed that all these functions actually work on fds, even
3495on win32. Should not be defined on non-win32 platforms. 3698on win32. Should not be defined on non-win32 platforms.
3496 3699
3497=item EV_FD_TO_WIN32_HANDLE 3700=item EV_FD_TO_WIN32_HANDLE(fd)
3498 3701
3499If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map 3702If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map
3500file descriptors to socket handles. When not defining this symbol (the 3703file descriptors to socket handles. When not defining this symbol (the
3501default), then libev will call C<_get_osfhandle>, which is usually 3704default), then libev will call C<_get_osfhandle>, which is usually
3502correct. In some cases, programs use their own file descriptor management, 3705correct. In some cases, programs use their own file descriptor management,
3503in which case they can provide this function to map fds to socket handles. 3706in which case they can provide this function to map fds to socket handles.
3707
3708=item EV_WIN32_HANDLE_TO_FD(handle)
3709
3710If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors
3711using the standard C<_open_osfhandle> function. For programs implementing
3712their own fd to handle mapping, overwriting this function makes it easier
3713to do so. This can be done by defining this macro to an appropriate value.
3714
3715=item EV_WIN32_CLOSE_FD(fd)
3716
3717If programs implement their own fd to handle mapping on win32, then this
3718macro can be used to override the C<close> function, useful to unregister
3719file descriptors again. Note that the replacement function has to close
3720the underlying OS handle.
3504 3721
3505=item EV_USE_POLL 3722=item EV_USE_POLL
3506 3723
3507If defined to be C<1>, libev will compile in support for the C<poll>(2) 3724If defined to be C<1>, libev will compile in support for the C<poll>(2)
3508backend. Otherwise it will be enabled on non-win32 platforms. It 3725backend. Otherwise it will be enabled on non-win32 platforms. It
3640defined to be C<0>, then they are not. 3857defined to be C<0>, then they are not.
3641 3858
3642=item EV_MINIMAL 3859=item EV_MINIMAL
3643 3860
3644If you need to shave off some kilobytes of code at the expense of some 3861If 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 3862speed (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 3863is used to override some inlining decisions, saves roughly 30% code size
3647much smaller 2-heap for timer management over the default 4-heap. 3864on amd64. It also selects a much smaller 2-heap for timer management over
3865the default 4-heap.
3866
3867You can save even more by disabling watcher types you do not need
3868and setting C<EV_MAXPRI> == C<EV_MINPRI>. Also, disabling C<assert>
3869(C<-DNDEBUG>) will usually reduce code size a lot.
3870
3871Defining C<EV_MINIMAL> to C<2> will additionally reduce the core API to
3872provide a bare-bones event library. See C<ev.h> for details on what parts
3873of the API are still available, and do not complain if this subset changes
3874over time.
3875
3876=item EV_NSIG
3877
3878The highest supported signal number, +1 (or, the number of
3879signals): Normally, libev tries to deduce the maximum number of signals
3880automatically, but sometimes this fails, in which case it can be
3881specified. Also, using a lower number than detected (C<32> should be
3882good for about any system in existance) can save some memory, as libev
3883statically allocates some 12-24 bytes per signal number.
3648 3884
3649=item EV_PID_HASHSIZE 3885=item EV_PID_HASHSIZE
3650 3886
3651C<ev_child> watchers use a small hash table to distribute workload by 3887C<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 3888pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more
3838default loop and triggering an C<ev_async> watcher from the default loop 4074default loop and triggering an C<ev_async> watcher from the default loop
3839watcher callback into the event loop interested in the signal. 4075watcher callback into the event loop interested in the signal.
3840 4076
3841=back 4077=back
3842 4078
4079=head4 THREAD LOCKING EXAMPLE
4080
4081Here is a fictitious example of how to run an event loop in a different
4082thread than where callbacks are being invoked and watchers are
4083created/added/removed.
4084
4085For a real-world example, see the C<EV::Loop::Async> perl module,
4086which uses exactly this technique (which is suited for many high-level
4087languages).
4088
4089The example uses a pthread mutex to protect the loop data, a condition
4090variable to wait for callback invocations, an async watcher to notify the
4091event loop thread and an unspecified mechanism to wake up the main thread.
4092
4093First, you need to associate some data with the event loop:
4094
4095 typedef struct {
4096 mutex_t lock; /* global loop lock */
4097 ev_async async_w;
4098 thread_t tid;
4099 cond_t invoke_cv;
4100 } userdata;
4101
4102 void prepare_loop (EV_P)
4103 {
4104 // for simplicity, we use a static userdata struct.
4105 static userdata u;
4106
4107 ev_async_init (&u->async_w, async_cb);
4108 ev_async_start (EV_A_ &u->async_w);
4109
4110 pthread_mutex_init (&u->lock, 0);
4111 pthread_cond_init (&u->invoke_cv, 0);
4112
4113 // now associate this with the loop
4114 ev_set_userdata (EV_A_ u);
4115 ev_set_invoke_pending_cb (EV_A_ l_invoke);
4116 ev_set_loop_release_cb (EV_A_ l_release, l_acquire);
4117
4118 // then create the thread running ev_loop
4119 pthread_create (&u->tid, 0, l_run, EV_A);
4120 }
4121
4122The callback for the C<ev_async> watcher does nothing: the watcher is used
4123solely to wake up the event loop so it takes notice of any new watchers
4124that might have been added:
4125
4126 static void
4127 async_cb (EV_P_ ev_async *w, int revents)
4128 {
4129 // just used for the side effects
4130 }
4131
4132The C<l_release> and C<l_acquire> callbacks simply unlock/lock the mutex
4133protecting the loop data, respectively.
4134
4135 static void
4136 l_release (EV_P)
4137 {
4138 userdata *u = ev_userdata (EV_A);
4139 pthread_mutex_unlock (&u->lock);
4140 }
4141
4142 static void
4143 l_acquire (EV_P)
4144 {
4145 userdata *u = ev_userdata (EV_A);
4146 pthread_mutex_lock (&u->lock);
4147 }
4148
4149The event loop thread first acquires the mutex, and then jumps straight
4150into C<ev_loop>:
4151
4152 void *
4153 l_run (void *thr_arg)
4154 {
4155 struct ev_loop *loop = (struct ev_loop *)thr_arg;
4156
4157 l_acquire (EV_A);
4158 pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0);
4159 ev_loop (EV_A_ 0);
4160 l_release (EV_A);
4161
4162 return 0;
4163 }
4164
4165Instead of invoking all pending watchers, the C<l_invoke> callback will
4166signal the main thread via some unspecified mechanism (signals? pipe
4167writes? C<Async::Interrupt>?) and then waits until all pending watchers
4168have been called (in a while loop because a) spurious wakeups are possible
4169and b) skipping inter-thread-communication when there are no pending
4170watchers is very beneficial):
4171
4172 static void
4173 l_invoke (EV_P)
4174 {
4175 userdata *u = ev_userdata (EV_A);
4176
4177 while (ev_pending_count (EV_A))
4178 {
4179 wake_up_other_thread_in_some_magic_or_not_so_magic_way ();
4180 pthread_cond_wait (&u->invoke_cv, &u->lock);
4181 }
4182 }
4183
4184Now, whenever the main thread gets told to invoke pending watchers, it
4185will grab the lock, call C<ev_invoke_pending> and then signal the loop
4186thread to continue:
4187
4188 static void
4189 real_invoke_pending (EV_P)
4190 {
4191 userdata *u = ev_userdata (EV_A);
4192
4193 pthread_mutex_lock (&u->lock);
4194 ev_invoke_pending (EV_A);
4195 pthread_cond_signal (&u->invoke_cv);
4196 pthread_mutex_unlock (&u->lock);
4197 }
4198
4199Whenever you want to start/stop a watcher or do other modifications to an
4200event loop, you will now have to lock:
4201
4202 ev_timer timeout_watcher;
4203 userdata *u = ev_userdata (EV_A);
4204
4205 ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.);
4206
4207 pthread_mutex_lock (&u->lock);
4208 ev_timer_start (EV_A_ &timeout_watcher);
4209 ev_async_send (EV_A_ &u->async_w);
4210 pthread_mutex_unlock (&u->lock);
4211
4212Note that sending the C<ev_async> watcher is required because otherwise
4213an event loop currently blocking in the kernel will have no knowledge
4214about the newly added timer. By waking up the loop it will pick up any new
4215watchers in the next event loop iteration.
4216
3843=head3 COROUTINES 4217=head3 COROUTINES
3844 4218
3845Libev is very accommodating to coroutines ("cooperative threads"): 4219Libev is very accommodating to coroutines ("cooperative threads"):
3846libev fully supports nesting calls to its functions from different 4220libev fully supports nesting calls to its functions from different
3847coroutines (e.g. you can call C<ev_loop> on the same loop from two 4221coroutines (e.g. you can call C<ev_loop> on the same loop from two
3848different coroutines, and switch freely between both coroutines running the 4222different coroutines, and switch freely between both coroutines running
3849loop, as long as you don't confuse yourself). The only exception is that 4223the loop, as long as you don't confuse yourself). The only exception is
3850you must not do this from C<ev_periodic> reschedule callbacks. 4224that you must not do this from C<ev_periodic> reschedule callbacks.
3851 4225
3852Care has been taken to ensure that libev does not keep local state inside 4226Care has been taken to ensure that libev does not keep local state inside
3853C<ev_loop>, and other calls do not usually allow for coroutine switches as 4227C<ev_loop>, and other calls do not usually allow for coroutine switches as
3854they do not call any callbacks. 4228they do not call any callbacks.
3855 4229
3932way (note also that glib is the slowest event library known to man). 4306way (note also that glib is the slowest event library known to man).
3933 4307
3934There is no supported compilation method available on windows except 4308There is no supported compilation method available on windows except
3935embedding it into other applications. 4309embedding it into other applications.
3936 4310
4311Sensible signal handling is officially unsupported by Microsoft - libev
4312tries its best, but under most conditions, signals will simply not work.
4313
3937Not a libev limitation but worth mentioning: windows apparently doesn't 4314Not a libev limitation but worth mentioning: windows apparently doesn't
3938accept large writes: instead of resulting in a partial write, windows will 4315accept large writes: instead of resulting in a partial write, windows will
3939either accept everything or return C<ENOBUFS> if the buffer is too large, 4316either 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 4317so 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 4318megabyte seems safe, but this apparently depends on the amount of memory
3945the abysmal performance of winsockets, using a large number of sockets 4322the abysmal performance of winsockets, using a large number of sockets
3946is not recommended (and not reasonable). If your program needs to use 4323is 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 4324more than a hundred or so sockets, then likely it needs to use a totally
3948different implementation for windows, as libev offers the POSIX readiness 4325different implementation for windows, as libev offers the POSIX readiness
3949notification model, which cannot be implemented efficiently on windows 4326notification model, which cannot be implemented efficiently on windows
3950(Microsoft monopoly games). 4327(due to Microsoft monopoly games).
3951 4328
3952A typical way to use libev under windows is to embed it (see the embedding 4329A 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 4330section for details) and use the following F<evwrap.h> header file instead
3954of F<ev.h>: 4331of F<ev.h>:
3955 4332
3991 4368
3992Early versions of winsocket's select only supported waiting for a maximum 4369Early versions of winsocket's select only supported waiting for a maximum
3993of C<64> handles (probably owning to the fact that all windows kernels 4370of 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 4371can 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 4372recommends spawning a chain of threads and wait for 63 handles and the
3996previous thread in each. Great). 4373previous thread in each. Sounds great!).
3997 4374
3998Newer versions support more handles, but you need to define C<FD_SETSIZE> 4375Newer 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 4376to 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 4377call (which might be in libev or elsewhere, for example, perl and many
4001select emulation on windows). 4378other interpreters do their own select emulation on windows).
4002 4379
4003Another limit is the number of file descriptors in the Microsoft runtime 4380Another 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 4381libraries, 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 4382fetish or something like this inside Microsoft). You can increase this
4006C<_setmaxstdio>, which can increase this limit to C<2048> (another 4383by calling C<_setmaxstdio>, which can increase this limit to C<2048>
4007arbitrary limit), but is broken in many versions of the Microsoft runtime 4384(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 4385runtime 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 4386(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 4387you need to wrap all I/O functions and provide your own fd management, but
4013calling select (O(n²)) will likely make this unworkable. 4388the cost of calling select (O(n²)) will likely make this unworkable.
4014 4389
4015=back 4390=back
4016 4391
4017=head2 PORTABILITY REQUIREMENTS 4392=head2 PORTABILITY REQUIREMENTS
4018 4393
4061=item C<double> must hold a time value in seconds with enough accuracy 4436=item C<double> must hold a time value in seconds with enough accuracy
4062 4437
4063The type C<double> is used to represent timestamps. It is required to 4438The 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 4439have 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 4440enough for at least into the year 4000. This requirement is fulfilled by
4066implementations implementing IEEE 754 (basically all existing ones). 4441implementations implementing IEEE 754, which is basically all existing
4442ones. With IEEE 754 doubles, you get microsecond accuracy until at least
44432200.
4067 4444
4068=back 4445=back
4069 4446
4070If you know of other additional requirements drop me a note. 4447If you know of other additional requirements drop me a note.
4071 4448

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines