… | |
… | |
8 | |
8 | |
9 | =head2 EXAMPLE PROGRAM |
9 | =head2 EXAMPLE PROGRAM |
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 | |
|
|
14 | #include <stdio.h> // for puts |
13 | |
15 | |
14 | // every watcher type has its own typedef'd struct |
16 | // every watcher type has its own typedef'd struct |
15 | // with the name ev_TYPE |
17 | // with the name ev_TYPE |
16 | ev_io stdin_watcher; |
18 | ev_io stdin_watcher; |
17 | ev_timer timeout_watcher; |
19 | ev_timer timeout_watcher; |
… | |
… | |
41 | |
43 | |
42 | int |
44 | int |
43 | main (void) |
45 | main (void) |
44 | { |
46 | { |
45 | // use the default event loop unless you have special needs |
47 | // use the default event loop unless you have special needs |
46 | ev_loop *loop = ev_default_loop (0); |
48 | struct ev_loop *loop = ev_default_loop (0); |
47 | |
49 | |
48 | // initialise an io watcher, then start it |
50 | // initialise an io watcher, then start it |
49 | // this one will watch for stdin to become readable |
51 | // this one will watch for stdin to become readable |
50 | ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); |
52 | ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); |
51 | ev_io_start (loop, &stdin_watcher); |
53 | ev_io_start (loop, &stdin_watcher); |
… | |
… | |
418 | starting a watcher (without re-setting it) also usually doesn't cause |
420 | starting a watcher (without re-setting it) also usually doesn't cause |
419 | extra overhead. A fork can both result in spurious notifications as well |
421 | extra overhead. A fork can both result in spurious notifications as well |
420 | as in libev having to destroy and recreate the epoll object, which can |
422 | as in libev having to destroy and recreate the epoll object, which can |
421 | take considerable time and thus should be avoided. |
423 | take considerable time and thus should be avoided. |
422 | |
424 | |
|
|
425 | All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or |
|
|
426 | faster than epoll for maybe up to a hundred file descriptors, depending on |
|
|
427 | the usage. So sad. |
|
|
428 | |
423 | While nominally embeddable in other event loops, this feature is broken in |
429 | While nominally embeddable in other event loops, this feature is broken in |
424 | all kernel versions tested so far. |
430 | all kernel versions tested so far. |
425 | |
431 | |
426 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
432 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
427 | C<EVBACKEND_POLL>. |
433 | C<EVBACKEND_POLL>. |
… | |
… | |
454 | |
460 | |
455 | While nominally embeddable in other event loops, this doesn't work |
461 | While nominally embeddable in other event loops, this doesn't work |
456 | everywhere, so you might need to test for this. And since it is broken |
462 | everywhere, so you might need to test for this. And since it is broken |
457 | almost everywhere, you should only use it when you have a lot of sockets |
463 | almost everywhere, you should only use it when you have a lot of sockets |
458 | (for which it usually works), by embedding it into another event loop |
464 | (for which it usually works), by embedding it into another event loop |
459 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and, did I mention it, |
465 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> (but C<poll> is of course |
460 | using it only for sockets. |
466 | also broken on OS X)) and, did I mention it, using it only for sockets. |
461 | |
467 | |
462 | This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with |
468 | This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with |
463 | C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with |
469 | C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with |
464 | C<NOTE_EOF>. |
470 | C<NOTE_EOF>. |
465 | |
471 | |
… | |
… | |
627 | This function is rarely useful, but when some event callback runs for a |
633 | This function is rarely useful, but when some event callback runs for a |
628 | very long time without entering the event loop, updating libev's idea of |
634 | very long time without entering the event loop, updating libev's idea of |
629 | the current time is a good idea. |
635 | the current time is a good idea. |
630 | |
636 | |
631 | See also "The special problem of time updates" in the C<ev_timer> section. |
637 | See also "The special problem of time updates" in the C<ev_timer> section. |
|
|
638 | |
|
|
639 | =item ev_suspend (loop) |
|
|
640 | |
|
|
641 | =item ev_resume (loop) |
|
|
642 | |
|
|
643 | These two functions suspend and resume a loop, for use when the loop is |
|
|
644 | not used for a while and timeouts should not be processed. |
|
|
645 | |
|
|
646 | A typical use case would be an interactive program such as a game: When |
|
|
647 | the user presses C<^Z> to suspend the game and resumes it an hour later it |
|
|
648 | would be best to handle timeouts as if no time had actually passed while |
|
|
649 | the program was suspended. This can be achieved by calling C<ev_suspend> |
|
|
650 | in your C<SIGTSTP> handler, sending yourself a C<SIGSTOP> and calling |
|
|
651 | C<ev_resume> directly afterwards to resume timer processing. |
|
|
652 | |
|
|
653 | Effectively, all C<ev_timer> watchers will be delayed by the time spend |
|
|
654 | between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers |
|
|
655 | will be rescheduled (that is, they will lose any events that would have |
|
|
656 | occured while suspended). |
|
|
657 | |
|
|
658 | After calling C<ev_suspend> you B<must not> call I<any> function on the |
|
|
659 | given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> |
|
|
660 | without a previous call to C<ev_suspend>. |
|
|
661 | |
|
|
662 | Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the |
|
|
663 | event loop time (see C<ev_now_update>). |
632 | |
664 | |
633 | =item ev_loop (loop, int flags) |
665 | =item ev_loop (loop, int flags) |
634 | |
666 | |
635 | Finally, this is it, the event handler. This function usually is called |
667 | Finally, this is it, the event handler. This function usually is called |
636 | after you initialised all your watchers and you want to start handling |
668 | after you initialised all your watchers and you want to start handling |
… | |
… | |
720 | |
752 | |
721 | If you have a watcher you never unregister that should not keep C<ev_loop> |
753 | If you have a watcher you never unregister that should not keep C<ev_loop> |
722 | from returning, call ev_unref() after starting, and ev_ref() before |
754 | from returning, call ev_unref() after starting, and ev_ref() before |
723 | stopping it. |
755 | stopping it. |
724 | |
756 | |
725 | As an example, libev itself uses this for its internal signal pipe: It is |
757 | As an example, libev itself uses this for its internal signal pipe: It |
726 | not visible to the libev user and should not keep C<ev_loop> from exiting |
758 | is not visible to the libev user and should not keep C<ev_loop> from |
727 | if no event watchers registered by it are active. It is also an excellent |
759 | exiting if no event watchers registered by it are active. It is also an |
728 | way to do this for generic recurring timers or from within third-party |
760 | excellent way to do this for generic recurring timers or from within |
729 | libraries. Just remember to I<unref after start> and I<ref before stop> |
761 | third-party libraries. Just remember to I<unref after start> and I<ref |
730 | (but only if the watcher wasn't active before, or was active before, |
762 | before stop> (but only if the watcher wasn't active before, or was active |
731 | respectively). |
763 | before, respectively. Note also that libev might stop watchers itself |
|
|
764 | (e.g. non-repeating timers) in which case you have to C<ev_ref> |
|
|
765 | in the callback). |
732 | |
766 | |
733 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
767 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
734 | running when nothing else is active. |
768 | running when nothing else is active. |
735 | |
769 | |
736 | ev_signal exitsig; |
770 | ev_signal exitsig; |
… | |
… | |
920 | |
954 | |
921 | =item C<EV_ASYNC> |
955 | =item C<EV_ASYNC> |
922 | |
956 | |
923 | The given async watcher has been asynchronously notified (see C<ev_async>). |
957 | The given async watcher has been asynchronously notified (see C<ev_async>). |
924 | |
958 | |
|
|
959 | =item C<EV_CUSTOM> |
|
|
960 | |
|
|
961 | Not ever sent (or otherwise used) by libev itself, but can be freely used |
|
|
962 | by libev users to signal watchers (e.g. via C<ev_feed_event>). |
|
|
963 | |
925 | =item C<EV_ERROR> |
964 | =item C<EV_ERROR> |
926 | |
965 | |
927 | An unspecified error has occurred, the watcher has been stopped. This might |
966 | An unspecified error has occurred, the watcher has been stopped. This might |
928 | happen because the watcher could not be properly started because libev |
967 | happen because the watcher could not be properly started because libev |
929 | ran out of memory, a file descriptor was found to be closed or any other |
968 | ran out of memory, a file descriptor was found to be closed or any other |
… | |
… | |
1044 | integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> |
1083 | integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> |
1045 | (default: C<-2>). Pending watchers with higher priority will be invoked |
1084 | (default: C<-2>). Pending watchers with higher priority will be invoked |
1046 | before watchers with lower priority, but priority will not keep watchers |
1085 | before watchers with lower priority, but priority will not keep watchers |
1047 | from being executed (except for C<ev_idle> watchers). |
1086 | from being executed (except for C<ev_idle> watchers). |
1048 | |
1087 | |
1049 | This means that priorities are I<only> used for ordering callback |
|
|
1050 | invocation after new events have been received. This is useful, for |
|
|
1051 | example, to reduce latency after idling, or more often, to bind two |
|
|
1052 | watchers on the same event and make sure one is called first. |
|
|
1053 | |
|
|
1054 | If you need to suppress invocation when higher priority events are pending |
1088 | If you need to suppress invocation when higher priority events are pending |
1055 | you need to look at C<ev_idle> watchers, which provide this functionality. |
1089 | you need to look at C<ev_idle> watchers, which provide this functionality. |
1056 | |
1090 | |
1057 | You I<must not> change the priority of a watcher as long as it is active or |
1091 | You I<must not> change the priority of a watcher as long as it is active or |
1058 | pending. |
1092 | pending. |
1059 | |
|
|
1060 | The default priority used by watchers when no priority has been set is |
|
|
1061 | always C<0>, which is supposed to not be too high and not be too low :). |
|
|
1062 | |
1093 | |
1063 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
1094 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
1064 | fine, as long as you do not mind that the priority value you query might |
1095 | fine, as long as you do not mind that the priority value you query might |
1065 | or might not have been clamped to the valid range. |
1096 | or might not have been clamped to the valid range. |
|
|
1097 | |
|
|
1098 | The default priority used by watchers when no priority has been set is |
|
|
1099 | always C<0>, which is supposed to not be too high and not be too low :). |
|
|
1100 | |
|
|
1101 | See L<WATCHER PRIORITIES>, below, for a more thorough treatment of |
|
|
1102 | priorities. |
1066 | |
1103 | |
1067 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1104 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1068 | |
1105 | |
1069 | Invoke the C<watcher> with the given C<loop> and C<revents>. Neither |
1106 | Invoke the C<watcher> with the given C<loop> and C<revents>. Neither |
1070 | C<loop> nor C<revents> need to be valid as long as the watcher callback |
1107 | C<loop> nor C<revents> need to be valid as long as the watcher callback |
… | |
… | |
1145 | t2_cb (EV_P_ ev_timer *w, int revents) |
1182 | t2_cb (EV_P_ ev_timer *w, int revents) |
1146 | { |
1183 | { |
1147 | struct my_biggy big = (struct my_biggy * |
1184 | struct my_biggy big = (struct my_biggy * |
1148 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1185 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1149 | } |
1186 | } |
|
|
1187 | |
|
|
1188 | =head2 WATCHER PRIORITY MODELS |
|
|
1189 | |
|
|
1190 | Many event loops support I<watcher priorities>, which are usually small |
|
|
1191 | integers that influence the ordering of event callback invocation |
|
|
1192 | between watchers in some way, all else being equal. |
|
|
1193 | |
|
|
1194 | In libev, Watcher priorities can be set using C<ev_set_priority>. See its |
|
|
1195 | description for the more technical details such as the actual priority |
|
|
1196 | range. |
|
|
1197 | |
|
|
1198 | There are two common ways how these these priorities are being interpreted |
|
|
1199 | by event loops: |
|
|
1200 | |
|
|
1201 | In the more common lock-out model, higher priorities "lock out" invocation |
|
|
1202 | of lower priority watchers, which means as long as higher priority |
|
|
1203 | watchers receive events, lower priority watchers are not being invoked. |
|
|
1204 | |
|
|
1205 | The less common only-for-ordering model uses priorities solely to order |
|
|
1206 | callback invocation within a single event loop iteration: Higher priority |
|
|
1207 | watchers are invoked before lower priority ones, but they all get invoked |
|
|
1208 | before polling for new events. |
|
|
1209 | |
|
|
1210 | Libev uses the second (only-for-ordering) model for all its watchers |
|
|
1211 | except for idle watchers (which use the lock-out model). |
|
|
1212 | |
|
|
1213 | The rationale behind this is that implementing the lock-out model for |
|
|
1214 | watchers is not well supported by most kernel interfaces, and most event |
|
|
1215 | libraries will just poll for the same events again and again as long as |
|
|
1216 | their callbacks have not been executed, which is very inefficient in the |
|
|
1217 | common case of one high-priority watcher locking out a mass of lower |
|
|
1218 | priority ones. |
|
|
1219 | |
|
|
1220 | Static (ordering) priorities are most useful when you have two or more |
|
|
1221 | watchers handling the same resource: a typical usage example is having an |
|
|
1222 | C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle |
|
|
1223 | timeouts. Under load, data might be received while the program handles |
|
|
1224 | other jobs, but since timers normally get invoked first, the timeout |
|
|
1225 | handler will be executed before checking for data. In that case, giving |
|
|
1226 | the timer a lower priority than the I/O watcher ensures that I/O will be |
|
|
1227 | handled first even under adverse conditions (which is usually, but not |
|
|
1228 | always, what you want). |
|
|
1229 | |
|
|
1230 | Since idle watchers use the "lock-out" model, meaning that idle watchers |
|
|
1231 | will only be executed when no same or higher priority watchers have |
|
|
1232 | received events, they can be used to implement the "lock-out" model when |
|
|
1233 | required. |
|
|
1234 | |
|
|
1235 | For example, to emulate how many other event libraries handle priorities, |
|
|
1236 | you can associate an C<ev_idle> watcher to each such watcher, and in |
|
|
1237 | the normal watcher callback, you just start the idle watcher. The real |
|
|
1238 | processing is done in the idle watcher callback. This causes libev to |
|
|
1239 | continously poll and process kernel event data for the watcher, but when |
|
|
1240 | the lock-out case is known to be rare (which in turn is rare :), this is |
|
|
1241 | workable. |
|
|
1242 | |
|
|
1243 | Usually, however, the lock-out model implemented that way will perform |
|
|
1244 | miserably under the type of load it was designed to handle. In that case, |
|
|
1245 | it might be preferable to stop the real watcher before starting the |
|
|
1246 | idle watcher, so the kernel will not have to process the event in case |
|
|
1247 | the actual processing will be delayed for considerable time. |
|
|
1248 | |
|
|
1249 | Here is an example of an I/O watcher that should run at a strictly lower |
|
|
1250 | priority than the default, and which should only process data when no |
|
|
1251 | other events are pending: |
|
|
1252 | |
|
|
1253 | ev_idle idle; // actual processing watcher |
|
|
1254 | ev_io io; // actual event watcher |
|
|
1255 | |
|
|
1256 | static void |
|
|
1257 | io_cb (EV_P_ ev_io *w, int revents) |
|
|
1258 | { |
|
|
1259 | // stop the I/O watcher, we received the event, but |
|
|
1260 | // are not yet ready to handle it. |
|
|
1261 | ev_io_stop (EV_A_ w); |
|
|
1262 | |
|
|
1263 | // start the idle watcher to ahndle the actual event. |
|
|
1264 | // it will not be executed as long as other watchers |
|
|
1265 | // with the default priority are receiving events. |
|
|
1266 | ev_idle_start (EV_A_ &idle); |
|
|
1267 | } |
|
|
1268 | |
|
|
1269 | static void |
|
|
1270 | idle-cb (EV_P_ ev_idle *w, int revents) |
|
|
1271 | { |
|
|
1272 | // actual processing |
|
|
1273 | read (STDIN_FILENO, ...); |
|
|
1274 | |
|
|
1275 | // have to start the I/O watcher again, as |
|
|
1276 | // we have handled the event |
|
|
1277 | ev_io_start (EV_P_ &io); |
|
|
1278 | } |
|
|
1279 | |
|
|
1280 | // initialisation |
|
|
1281 | ev_idle_init (&idle, idle_cb); |
|
|
1282 | ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ); |
|
|
1283 | ev_io_start (EV_DEFAULT_ &io); |
|
|
1284 | |
|
|
1285 | In the "real" world, it might also be beneficial to start a timer, so that |
|
|
1286 | low-priority connections can not be locked out forever under load. This |
|
|
1287 | enables your program to keep a lower latency for important connections |
|
|
1288 | during short periods of high load, while not completely locking out less |
|
|
1289 | important ones. |
1150 | |
1290 | |
1151 | |
1291 | |
1152 | =head1 WATCHER TYPES |
1292 | =head1 WATCHER TYPES |
1153 | |
1293 | |
1154 | This section describes each watcher in detail, but will not repeat |
1294 | This section describes each watcher in detail, but will not repeat |
… | |
… | |
1311 | year, it will still time out after (roughly) one hour. "Roughly" because |
1451 | year, it will still time out after (roughly) one hour. "Roughly" because |
1312 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1452 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1313 | monotonic clock option helps a lot here). |
1453 | monotonic clock option helps a lot here). |
1314 | |
1454 | |
1315 | The callback is guaranteed to be invoked only I<after> its timeout has |
1455 | The callback is guaranteed to be invoked only I<after> its timeout has |
1316 | passed, but if multiple timers become ready during the same loop iteration |
1456 | passed. If multiple timers become ready during the same loop iteration |
1317 | then order of execution is undefined. |
1457 | then the ones with earlier time-out values are invoked before ones with |
|
|
1458 | later time-out values (but this is no longer true when a callback calls |
|
|
1459 | C<ev_loop> recursively). |
1318 | |
1460 | |
1319 | =head3 Be smart about timeouts |
1461 | =head3 Be smart about timeouts |
1320 | |
1462 | |
1321 | Many real-world problems involve some kind of timeout, usually for error |
1463 | Many real-world problems involve some kind of timeout, usually for error |
1322 | recovery. A typical example is an HTTP request - if the other side hangs, |
1464 | recovery. A typical example is an HTTP request - if the other side hangs, |
… | |
… | |
1415 | else |
1557 | else |
1416 | { |
1558 | { |
1417 | // callback was invoked, but there was some activity, re-arm |
1559 | // callback was invoked, but there was some activity, re-arm |
1418 | // the watcher to fire in last_activity + 60, which is |
1560 | // the watcher to fire in last_activity + 60, which is |
1419 | // guaranteed to be in the future, so "again" is positive: |
1561 | // guaranteed to be in the future, so "again" is positive: |
1420 | w->again = timeout - now; |
1562 | w->repeat = timeout - now; |
1421 | ev_timer_again (EV_A_ w); |
1563 | ev_timer_again (EV_A_ w); |
1422 | } |
1564 | } |
1423 | } |
1565 | } |
1424 | |
1566 | |
1425 | To summarise the callback: first calculate the real timeout (defined |
1567 | To summarise the callback: first calculate the real timeout (defined |
… | |
… | |
1541 | If the timer is started but non-repeating, stop it (as if it timed out). |
1683 | If the timer is started but non-repeating, stop it (as if it timed out). |
1542 | |
1684 | |
1543 | If the timer is repeating, either start it if necessary (with the |
1685 | If the timer is repeating, either start it if necessary (with the |
1544 | C<repeat> value), or reset the running timer to the C<repeat> value. |
1686 | C<repeat> value), or reset the running timer to the C<repeat> value. |
1545 | |
1687 | |
1546 | This sounds a bit complicated, see "Be smart about timeouts", above, for a |
1688 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
1547 | usage example. |
1689 | usage example. |
1548 | |
1690 | |
1549 | =item ev_tstamp repeat [read-write] |
1691 | =item ev_tstamp repeat [read-write] |
1550 | |
1692 | |
1551 | The current C<repeat> value. Will be used each time the watcher times out |
1693 | The current C<repeat> value. Will be used each time the watcher times out |
… | |
… | |
1590 | =head2 C<ev_periodic> - to cron or not to cron? |
1732 | =head2 C<ev_periodic> - to cron or not to cron? |
1591 | |
1733 | |
1592 | Periodic watchers are also timers of a kind, but they are very versatile |
1734 | Periodic watchers are also timers of a kind, but they are very versatile |
1593 | (and unfortunately a bit complex). |
1735 | (and unfortunately a bit complex). |
1594 | |
1736 | |
1595 | Unlike C<ev_timer>'s, they are not based on real time (or relative time) |
1737 | Unlike C<ev_timer>, periodic watchers are not based on real time (or |
1596 | but on wall clock time (absolute time). You can tell a periodic watcher |
1738 | relative time, the physical time that passes) but on wall clock time |
1597 | to trigger after some specific point in time. For example, if you tell a |
1739 | (absolute time, the thing you can read on your calender or clock). The |
1598 | periodic watcher to trigger in 10 seconds (by specifying e.g. C<ev_now () |
1740 | difference is that wall clock time can run faster or slower than real |
1599 | + 10.>, that is, an absolute time not a delay) and then reset your system |
1741 | time, and time jumps are not uncommon (e.g. when you adjust your |
1600 | clock to January of the previous year, then it will take more than year |
1742 | wrist-watch). |
1601 | to trigger the event (unlike an C<ev_timer>, which would still trigger |
|
|
1602 | roughly 10 seconds later as it uses a relative timeout). |
|
|
1603 | |
1743 | |
|
|
1744 | You can tell a periodic watcher to trigger after some specific point |
|
|
1745 | in time: for example, if you tell a periodic watcher to trigger "in 10 |
|
|
1746 | seconds" (by specifying e.g. C<ev_now () + 10.>, that is, an absolute time |
|
|
1747 | not a delay) and then reset your system clock to January of the previous |
|
|
1748 | year, then it will take a year or more to trigger the event (unlike an |
|
|
1749 | C<ev_timer>, which would still trigger roughly 10 seconds after starting |
|
|
1750 | it, as it uses a relative timeout). |
|
|
1751 | |
1604 | C<ev_periodic>s can also be used to implement vastly more complex timers, |
1752 | C<ev_periodic> watchers can also be used to implement vastly more complex |
1605 | such as triggering an event on each "midnight, local time", or other |
1753 | timers, such as triggering an event on each "midnight, local time", or |
1606 | complicated rules. |
1754 | other complicated rules. This cannot be done with C<ev_timer> watchers, as |
|
|
1755 | those cannot react to time jumps. |
1607 | |
1756 | |
1608 | As with timers, the callback is guaranteed to be invoked only when the |
1757 | As with timers, the callback is guaranteed to be invoked only when the |
1609 | time (C<at>) has passed, but if multiple periodic timers become ready |
1758 | point in time where it is supposed to trigger has passed. If multiple |
1610 | during the same loop iteration, then order of execution is undefined. |
1759 | timers become ready during the same loop iteration then the ones with |
|
|
1760 | earlier time-out values are invoked before ones with later time-out values |
|
|
1761 | (but this is no longer true when a callback calls C<ev_loop> recursively). |
1611 | |
1762 | |
1612 | =head3 Watcher-Specific Functions and Data Members |
1763 | =head3 Watcher-Specific Functions and Data Members |
1613 | |
1764 | |
1614 | =over 4 |
1765 | =over 4 |
1615 | |
1766 | |
1616 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) |
1767 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp offset, ev_tstamp interval, reschedule_cb) |
1617 | |
1768 | |
1618 | =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) |
1769 | =item ev_periodic_set (ev_periodic *, ev_tstamp offset, ev_tstamp interval, reschedule_cb) |
1619 | |
1770 | |
1620 | Lots of arguments, lets sort it out... There are basically three modes of |
1771 | Lots of arguments, let's sort it out... There are basically three modes of |
1621 | operation, and we will explain them from simplest to most complex: |
1772 | operation, and we will explain them from simplest to most complex: |
1622 | |
1773 | |
1623 | =over 4 |
1774 | =over 4 |
1624 | |
1775 | |
1625 | =item * absolute timer (at = time, interval = reschedule_cb = 0) |
1776 | =item * absolute timer (offset = absolute time, interval = 0, reschedule_cb = 0) |
1626 | |
1777 | |
1627 | In this configuration the watcher triggers an event after the wall clock |
1778 | In this configuration the watcher triggers an event after the wall clock |
1628 | time C<at> has passed. It will not repeat and will not adjust when a time |
1779 | time C<offset> has passed. It will not repeat and will not adjust when a |
1629 | jump occurs, that is, if it is to be run at January 1st 2011 then it will |
1780 | time jump occurs, that is, if it is to be run at January 1st 2011 then it |
1630 | only run when the system clock reaches or surpasses this time. |
1781 | will be stopped and invoked when the system clock reaches or surpasses |
|
|
1782 | this point in time. |
1631 | |
1783 | |
1632 | =item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) |
1784 | =item * repeating interval timer (offset = offset within interval, interval > 0, reschedule_cb = 0) |
1633 | |
1785 | |
1634 | In this mode the watcher will always be scheduled to time out at the next |
1786 | In this mode the watcher will always be scheduled to time out at the next |
1635 | C<at + N * interval> time (for some integer N, which can also be negative) |
1787 | C<offset + N * interval> time (for some integer N, which can also be |
1636 | and then repeat, regardless of any time jumps. |
1788 | negative) and then repeat, regardless of any time jumps. The C<offset> |
|
|
1789 | argument is merely an offset into the C<interval> periods. |
1637 | |
1790 | |
1638 | This can be used to create timers that do not drift with respect to the |
1791 | This can be used to create timers that do not drift with respect to the |
1639 | system clock, for example, here is a C<ev_periodic> that triggers each |
1792 | system clock, for example, here is an C<ev_periodic> that triggers each |
1640 | hour, on the hour: |
1793 | hour, on the hour (with respect to UTC): |
1641 | |
1794 | |
1642 | ev_periodic_set (&periodic, 0., 3600., 0); |
1795 | ev_periodic_set (&periodic, 0., 3600., 0); |
1643 | |
1796 | |
1644 | This doesn't mean there will always be 3600 seconds in between triggers, |
1797 | This doesn't mean there will always be 3600 seconds in between triggers, |
1645 | but only that the callback will be called when the system time shows a |
1798 | but only that the callback will be called when the system time shows a |
1646 | full hour (UTC), or more correctly, when the system time is evenly divisible |
1799 | full hour (UTC), or more correctly, when the system time is evenly divisible |
1647 | by 3600. |
1800 | by 3600. |
1648 | |
1801 | |
1649 | Another way to think about it (for the mathematically inclined) is that |
1802 | Another way to think about it (for the mathematically inclined) is that |
1650 | C<ev_periodic> will try to run the callback in this mode at the next possible |
1803 | C<ev_periodic> will try to run the callback in this mode at the next possible |
1651 | time where C<time = at (mod interval)>, regardless of any time jumps. |
1804 | time where C<time = offset (mod interval)>, regardless of any time jumps. |
1652 | |
1805 | |
1653 | For numerical stability it is preferable that the C<at> value is near |
1806 | For numerical stability it is preferable that the C<offset> value is near |
1654 | C<ev_now ()> (the current time), but there is no range requirement for |
1807 | C<ev_now ()> (the current time), but there is no range requirement for |
1655 | this value, and in fact is often specified as zero. |
1808 | this value, and in fact is often specified as zero. |
1656 | |
1809 | |
1657 | Note also that there is an upper limit to how often a timer can fire (CPU |
1810 | Note also that there is an upper limit to how often a timer can fire (CPU |
1658 | speed for example), so if C<interval> is very small then timing stability |
1811 | speed for example), so if C<interval> is very small then timing stability |
1659 | will of course deteriorate. Libev itself tries to be exact to be about one |
1812 | will of course deteriorate. Libev itself tries to be exact to be about one |
1660 | millisecond (if the OS supports it and the machine is fast enough). |
1813 | millisecond (if the OS supports it and the machine is fast enough). |
1661 | |
1814 | |
1662 | =item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) |
1815 | =item * manual reschedule mode (offset ignored, interval ignored, reschedule_cb = callback) |
1663 | |
1816 | |
1664 | In this mode the values for C<interval> and C<at> are both being |
1817 | In this mode the values for C<interval> and C<offset> are both being |
1665 | ignored. Instead, each time the periodic watcher gets scheduled, the |
1818 | ignored. Instead, each time the periodic watcher gets scheduled, the |
1666 | reschedule callback will be called with the watcher as first, and the |
1819 | reschedule callback will be called with the watcher as first, and the |
1667 | current time as second argument. |
1820 | current time as second argument. |
1668 | |
1821 | |
1669 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, |
1822 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, ever, |
1670 | ever, or make ANY event loop modifications whatsoever>. |
1823 | or make ANY other event loop modifications whatsoever, unless explicitly |
|
|
1824 | allowed by documentation here>. |
1671 | |
1825 | |
1672 | If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop |
1826 | If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop |
1673 | it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the |
1827 | it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the |
1674 | only event loop modification you are allowed to do). |
1828 | only event loop modification you are allowed to do). |
1675 | |
1829 | |
… | |
… | |
1705 | a different time than the last time it was called (e.g. in a crond like |
1859 | a different time than the last time it was called (e.g. in a crond like |
1706 | program when the crontabs have changed). |
1860 | program when the crontabs have changed). |
1707 | |
1861 | |
1708 | =item ev_tstamp ev_periodic_at (ev_periodic *) |
1862 | =item ev_tstamp ev_periodic_at (ev_periodic *) |
1709 | |
1863 | |
1710 | When active, returns the absolute time that the watcher is supposed to |
1864 | When active, returns the absolute time that the watcher is supposed |
1711 | trigger next. |
1865 | to trigger next. This is not the same as the C<offset> argument to |
|
|
1866 | C<ev_periodic_set>, but indeed works even in interval and manual |
|
|
1867 | rescheduling modes. |
1712 | |
1868 | |
1713 | =item ev_tstamp offset [read-write] |
1869 | =item ev_tstamp offset [read-write] |
1714 | |
1870 | |
1715 | When repeating, this contains the offset value, otherwise this is the |
1871 | When repeating, this contains the offset value, otherwise this is the |
1716 | absolute point in time (the C<at> value passed to C<ev_periodic_set>). |
1872 | absolute point in time (the C<offset> value passed to C<ev_periodic_set>, |
|
|
1873 | although libev might modify this value for better numerical stability). |
1717 | |
1874 | |
1718 | Can be modified any time, but changes only take effect when the periodic |
1875 | Can be modified any time, but changes only take effect when the periodic |
1719 | timer fires or C<ev_periodic_again> is being called. |
1876 | timer fires or C<ev_periodic_again> is being called. |
1720 | |
1877 | |
1721 | =item ev_tstamp interval [read-write] |
1878 | =item ev_tstamp interval [read-write] |
… | |
… | |
1932 | C<stat> on that path in regular intervals (or when the OS says it changed) |
2089 | C<stat> on that path in regular intervals (or when the OS says it changed) |
1933 | and sees if it changed compared to the last time, invoking the callback if |
2090 | and sees if it changed compared to the last time, invoking the callback if |
1934 | it did. |
2091 | it did. |
1935 | |
2092 | |
1936 | The path does not need to exist: changing from "path exists" to "path does |
2093 | The path does not need to exist: changing from "path exists" to "path does |
1937 | not exist" is a status change like any other. The condition "path does |
2094 | not exist" is a status change like any other. The condition "path does not |
1938 | not exist" is signified by the C<st_nlink> field being zero (which is |
2095 | exist" (or more correctly "path cannot be stat'ed") is signified by the |
1939 | otherwise always forced to be at least one) and all the other fields of |
2096 | C<st_nlink> field being zero (which is otherwise always forced to be at |
1940 | the stat buffer having unspecified contents. |
2097 | least one) and all the other fields of the stat buffer having unspecified |
|
|
2098 | contents. |
1941 | |
2099 | |
1942 | The path I<must not> end in a slash or contain special components such as |
2100 | The path I<must not> end in a slash or contain special components such as |
1943 | C<.> or C<..>. The path I<should> be absolute: If it is relative and |
2101 | C<.> or C<..>. The path I<should> be absolute: If it is relative and |
1944 | your working directory changes, then the behaviour is undefined. |
2102 | your working directory changes, then the behaviour is undefined. |
1945 | |
2103 | |
… | |
… | |
1955 | This watcher type is not meant for massive numbers of stat watchers, |
2113 | This watcher type is not meant for massive numbers of stat watchers, |
1956 | as even with OS-supported change notifications, this can be |
2114 | as even with OS-supported change notifications, this can be |
1957 | resource-intensive. |
2115 | resource-intensive. |
1958 | |
2116 | |
1959 | At the time of this writing, the only OS-specific interface implemented |
2117 | At the time of this writing, the only OS-specific interface implemented |
1960 | is the Linux inotify interface (implementing kqueue support is left as |
2118 | is the Linux inotify interface (implementing kqueue support is left as an |
1961 | an exercise for the reader. Note, however, that the author sees no way |
2119 | exercise for the reader. Note, however, that the author sees no way of |
1962 | of implementing C<ev_stat> semantics with kqueue). |
2120 | implementing C<ev_stat> semantics with kqueue, except as a hint). |
1963 | |
2121 | |
1964 | =head3 ABI Issues (Largefile Support) |
2122 | =head3 ABI Issues (Largefile Support) |
1965 | |
2123 | |
1966 | Libev by default (unless the user overrides this) uses the default |
2124 | Libev by default (unless the user overrides this) uses the default |
1967 | compilation environment, which means that on systems with large file |
2125 | compilation environment, which means that on systems with large file |
… | |
… | |
1978 | to exchange stat structures with application programs compiled using the |
2136 | to exchange stat structures with application programs compiled using the |
1979 | default compilation environment. |
2137 | default compilation environment. |
1980 | |
2138 | |
1981 | =head3 Inotify and Kqueue |
2139 | =head3 Inotify and Kqueue |
1982 | |
2140 | |
1983 | When C<inotify (7)> support has been compiled into libev (generally |
2141 | When C<inotify (7)> support has been compiled into libev and present at |
1984 | only available with Linux 2.6.25 or above due to bugs in earlier |
2142 | runtime, it will be used to speed up change detection where possible. The |
1985 | implementations) and present at runtime, it will be used to speed up |
2143 | inotify descriptor will be created lazily when the first C<ev_stat> |
1986 | change detection where possible. The inotify descriptor will be created |
2144 | watcher is being started. |
1987 | lazily when the first C<ev_stat> watcher is being started. |
|
|
1988 | |
2145 | |
1989 | Inotify presence does not change the semantics of C<ev_stat> watchers |
2146 | Inotify presence does not change the semantics of C<ev_stat> watchers |
1990 | except that changes might be detected earlier, and in some cases, to avoid |
2147 | except that changes might be detected earlier, and in some cases, to avoid |
1991 | making regular C<stat> calls. Even in the presence of inotify support |
2148 | making regular C<stat> calls. Even in the presence of inotify support |
1992 | there are many cases where libev has to resort to regular C<stat> polling, |
2149 | there are many cases where libev has to resort to regular C<stat> polling, |
1993 | but as long as the path exists, libev usually gets away without polling. |
2150 | but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too |
|
|
2151 | many bugs), the path exists (i.e. stat succeeds), and the path resides on |
|
|
2152 | a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and |
|
|
2153 | xfs are fully working) libev usually gets away without polling. |
1994 | |
2154 | |
1995 | There is no support for kqueue, as apparently it cannot be used to |
2155 | There is no support for kqueue, as apparently it cannot be used to |
1996 | implement this functionality, due to the requirement of having a file |
2156 | implement this functionality, due to the requirement of having a file |
1997 | descriptor open on the object at all times, and detecting renames, unlinks |
2157 | descriptor open on the object at all times, and detecting renames, unlinks |
1998 | etc. is difficult. |
2158 | etc. is difficult. |
|
|
2159 | |
|
|
2160 | =head3 C<stat ()> is a synchronous operation |
|
|
2161 | |
|
|
2162 | Libev doesn't normally do any kind of I/O itself, and so is not blocking |
|
|
2163 | the process. The exception are C<ev_stat> watchers - those call C<stat |
|
|
2164 | ()>, which is a synchronous operation. |
|
|
2165 | |
|
|
2166 | For local paths, this usually doesn't matter: unless the system is very |
|
|
2167 | busy or the intervals between stat's are large, a stat call will be fast, |
|
|
2168 | as the path data is usually in memory already (except when starting the |
|
|
2169 | watcher). |
|
|
2170 | |
|
|
2171 | For networked file systems, calling C<stat ()> can block an indefinite |
|
|
2172 | time due to network issues, and even under good conditions, a stat call |
|
|
2173 | often takes multiple milliseconds. |
|
|
2174 | |
|
|
2175 | Therefore, it is best to avoid using C<ev_stat> watchers on networked |
|
|
2176 | paths, although this is fully supported by libev. |
1999 | |
2177 | |
2000 | =head3 The special problem of stat time resolution |
2178 | =head3 The special problem of stat time resolution |
2001 | |
2179 | |
2002 | The C<stat ()> system call only supports full-second resolution portably, |
2180 | The C<stat ()> system call only supports full-second resolution portably, |
2003 | and even on systems where the resolution is higher, most file systems |
2181 | and even on systems where the resolution is higher, most file systems |
… | |
… | |
2152 | |
2330 | |
2153 | =head3 Watcher-Specific Functions and Data Members |
2331 | =head3 Watcher-Specific Functions and Data Members |
2154 | |
2332 | |
2155 | =over 4 |
2333 | =over 4 |
2156 | |
2334 | |
2157 | =item ev_idle_init (ev_signal *, callback) |
2335 | =item ev_idle_init (ev_idle *, callback) |
2158 | |
2336 | |
2159 | Initialises and configures the idle watcher - it has no parameters of any |
2337 | Initialises and configures the idle watcher - it has no parameters of any |
2160 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
2338 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
2161 | believe me. |
2339 | believe me. |
2162 | |
2340 | |
… | |
… | |
2401 | some fds have to be watched and handled very quickly (with low latency), |
2579 | some fds have to be watched and handled very quickly (with low latency), |
2402 | and even priorities and idle watchers might have too much overhead. In |
2580 | and even priorities and idle watchers might have too much overhead. In |
2403 | this case you would put all the high priority stuff in one loop and all |
2581 | this case you would put all the high priority stuff in one loop and all |
2404 | the rest in a second one, and embed the second one in the first. |
2582 | the rest in a second one, and embed the second one in the first. |
2405 | |
2583 | |
2406 | As long as the watcher is active, the callback will be invoked every time |
2584 | As long as the watcher is active, the callback will be invoked every |
2407 | there might be events pending in the embedded loop. The callback must then |
2585 | time there might be events pending in the embedded loop. The callback |
2408 | call C<ev_embed_sweep (mainloop, watcher)> to make a single sweep and invoke |
2586 | must then call C<ev_embed_sweep (mainloop, watcher)> to make a single |
2409 | their callbacks (you could also start an idle watcher to give the embedded |
2587 | sweep and invoke their callbacks (the callback doesn't need to invoke the |
2410 | loop strictly lower priority for example). You can also set the callback |
2588 | C<ev_embed_sweep> function directly, it could also start an idle watcher |
2411 | to C<0>, in which case the embed watcher will automatically execute the |
2589 | to give the embedded loop strictly lower priority for example). |
2412 | embedded loop sweep. |
|
|
2413 | |
2590 | |
2414 | As long as the watcher is started it will automatically handle events. The |
2591 | You can also set the callback to C<0>, in which case the embed watcher |
2415 | callback will be invoked whenever some events have been handled. You can |
2592 | will automatically execute the embedded loop sweep whenever necessary. |
2416 | set the callback to C<0> to avoid having to specify one if you are not |
|
|
2417 | interested in that. |
|
|
2418 | |
2593 | |
2419 | Also, there have not currently been made special provisions for forking: |
2594 | Fork detection will be handled transparently while the C<ev_embed> watcher |
2420 | when you fork, you not only have to call C<ev_loop_fork> on both loops, |
2595 | is active, i.e., the embedded loop will automatically be forked when the |
2421 | but you will also have to stop and restart any C<ev_embed> watchers |
2596 | embedding loop forks. In other cases, the user is responsible for calling |
2422 | yourself - but you can use a fork watcher to handle this automatically, |
2597 | C<ev_loop_fork> on the embedded loop. |
2423 | and future versions of libev might do just that. |
|
|
2424 | |
2598 | |
2425 | Unfortunately, not all backends are embeddable: only the ones returned by |
2599 | Unfortunately, not all backends are embeddable: only the ones returned by |
2426 | C<ev_embeddable_backends> are, which, unfortunately, does not include any |
2600 | C<ev_embeddable_backends> are, which, unfortunately, does not include any |
2427 | portable one. |
2601 | portable one. |
2428 | |
2602 | |
… | |
… | |
2659 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
2833 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
2660 | C<ev_feed_event>, this call is safe to do from other threads, signal or |
2834 | C<ev_feed_event>, this call is safe to do from other threads, signal or |
2661 | similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding |
2835 | similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding |
2662 | section below on what exactly this means). |
2836 | section below on what exactly this means). |
2663 | |
2837 | |
|
|
2838 | Note that, as with other watchers in libev, multiple events might get |
|
|
2839 | compressed into a single callback invocation (another way to look at this |
|
|
2840 | is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>, |
|
|
2841 | reset when the event loop detects that). |
|
|
2842 | |
2664 | This call incurs the overhead of a system call only once per loop iteration, |
2843 | This call incurs the overhead of a system call only once per event loop |
2665 | so while the overhead might be noticeable, it doesn't apply to repeated |
2844 | iteration, so while the overhead might be noticeable, it doesn't apply to |
2666 | calls to C<ev_async_send>. |
2845 | repeated calls to C<ev_async_send> for the same event loop. |
2667 | |
2846 | |
2668 | =item bool = ev_async_pending (ev_async *) |
2847 | =item bool = ev_async_pending (ev_async *) |
2669 | |
2848 | |
2670 | Returns a non-zero value when C<ev_async_send> has been called on the |
2849 | Returns a non-zero value when C<ev_async_send> has been called on the |
2671 | watcher but the event has not yet been processed (or even noted) by the |
2850 | watcher but the event has not yet been processed (or even noted) by the |
… | |
… | |
2674 | C<ev_async_send> sets a flag in the watcher and wakes up the loop. When |
2853 | C<ev_async_send> sets a flag in the watcher and wakes up the loop. When |
2675 | the loop iterates next and checks for the watcher to have become active, |
2854 | the loop iterates next and checks for the watcher to have become active, |
2676 | it will reset the flag again. C<ev_async_pending> can be used to very |
2855 | it will reset the flag again. C<ev_async_pending> can be used to very |
2677 | quickly check whether invoking the loop might be a good idea. |
2856 | quickly check whether invoking the loop might be a good idea. |
2678 | |
2857 | |
2679 | Not that this does I<not> check whether the watcher itself is pending, only |
2858 | Not that this does I<not> check whether the watcher itself is pending, |
2680 | whether it has been requested to make this watcher pending. |
2859 | only whether it has been requested to make this watcher pending: there |
|
|
2860 | is a time window between the event loop checking and resetting the async |
|
|
2861 | notification, and the callback being invoked. |
2681 | |
2862 | |
2682 | =back |
2863 | =back |
2683 | |
2864 | |
2684 | |
2865 | |
2685 | =head1 OTHER FUNCTIONS |
2866 | =head1 OTHER FUNCTIONS |
… | |
… | |
2864 | |
3045 | |
2865 | myclass obj; |
3046 | myclass obj; |
2866 | ev::io iow; |
3047 | ev::io iow; |
2867 | iow.set <myclass, &myclass::io_cb> (&obj); |
3048 | iow.set <myclass, &myclass::io_cb> (&obj); |
2868 | |
3049 | |
|
|
3050 | =item w->set (object *) |
|
|
3051 | |
|
|
3052 | This is an B<experimental> feature that might go away in a future version. |
|
|
3053 | |
|
|
3054 | This is a variation of a method callback - leaving out the method to call |
|
|
3055 | will default the method to C<operator ()>, which makes it possible to use |
|
|
3056 | functor objects without having to manually specify the C<operator ()> all |
|
|
3057 | the time. Incidentally, you can then also leave out the template argument |
|
|
3058 | list. |
|
|
3059 | |
|
|
3060 | The C<operator ()> method prototype must be C<void operator ()(watcher &w, |
|
|
3061 | int revents)>. |
|
|
3062 | |
|
|
3063 | See the method-C<set> above for more details. |
|
|
3064 | |
|
|
3065 | Example: use a functor object as callback. |
|
|
3066 | |
|
|
3067 | struct myfunctor |
|
|
3068 | { |
|
|
3069 | void operator() (ev::io &w, int revents) |
|
|
3070 | { |
|
|
3071 | ... |
|
|
3072 | } |
|
|
3073 | } |
|
|
3074 | |
|
|
3075 | myfunctor f; |
|
|
3076 | |
|
|
3077 | ev::io w; |
|
|
3078 | w.set (&f); |
|
|
3079 | |
2869 | =item w->set<function> (void *data = 0) |
3080 | =item w->set<function> (void *data = 0) |
2870 | |
3081 | |
2871 | Also sets a callback, but uses a static method or plain function as |
3082 | Also sets a callback, but uses a static method or plain function as |
2872 | callback. The optional C<data> argument will be stored in the watcher's |
3083 | callback. The optional C<data> argument will be stored in the watcher's |
2873 | C<data> member and is free for you to use. |
3084 | C<data> member and is free for you to use. |
… | |
… | |
2959 | L<http://software.schmorp.de/pkg/EV>. |
3170 | L<http://software.schmorp.de/pkg/EV>. |
2960 | |
3171 | |
2961 | =item Python |
3172 | =item Python |
2962 | |
3173 | |
2963 | Python bindings can be found at L<http://code.google.com/p/pyev/>. It |
3174 | Python bindings can be found at L<http://code.google.com/p/pyev/>. It |
2964 | seems to be quite complete and well-documented. Note, however, that the |
3175 | seems to be quite complete and well-documented. |
2965 | patch they require for libev is outright dangerous as it breaks the ABI |
|
|
2966 | for everybody else, and therefore, should never be applied in an installed |
|
|
2967 | libev (if python requires an incompatible ABI then it needs to embed |
|
|
2968 | libev). |
|
|
2969 | |
3176 | |
2970 | =item Ruby |
3177 | =item Ruby |
2971 | |
3178 | |
2972 | Tony Arcieri has written a ruby extension that offers access to a subset |
3179 | Tony Arcieri has written a ruby extension that offers access to a subset |
2973 | of the libev API and adds file handle abstractions, asynchronous DNS and |
3180 | of the libev API and adds file handle abstractions, asynchronous DNS and |
2974 | more on top of it. It can be found via gem servers. Its homepage is at |
3181 | more on top of it. It can be found via gem servers. Its homepage is at |
2975 | L<http://rev.rubyforge.org/>. |
3182 | L<http://rev.rubyforge.org/>. |
|
|
3183 | |
|
|
3184 | Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190> |
|
|
3185 | makes rev work even on mingw. |
|
|
3186 | |
|
|
3187 | =item Haskell |
|
|
3188 | |
|
|
3189 | A haskell binding to libev is available at |
|
|
3190 | L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>. |
2976 | |
3191 | |
2977 | =item D |
3192 | =item D |
2978 | |
3193 | |
2979 | Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to |
3194 | Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to |
2980 | be found at L<http://proj.llucax.com.ar/wiki/evd>. |
3195 | be found at L<http://proj.llucax.com.ar/wiki/evd>. |
… | |
… | |
3157 | keeps libev from including F<config.h>, and it also defines dummy |
3372 | keeps libev from including F<config.h>, and it also defines dummy |
3158 | implementations for some libevent functions (such as logging, which is not |
3373 | implementations for some libevent functions (such as logging, which is not |
3159 | supported). It will also not define any of the structs usually found in |
3374 | supported). It will also not define any of the structs usually found in |
3160 | F<event.h> that are not directly supported by the libev core alone. |
3375 | F<event.h> that are not directly supported by the libev core alone. |
3161 | |
3376 | |
|
|
3377 | In stanbdalone mode, libev will still try to automatically deduce the |
|
|
3378 | configuration, but has to be more conservative. |
|
|
3379 | |
3162 | =item EV_USE_MONOTONIC |
3380 | =item EV_USE_MONOTONIC |
3163 | |
3381 | |
3164 | If defined to be C<1>, libev will try to detect the availability of the |
3382 | If defined to be C<1>, libev will try to detect the availability of the |
3165 | monotonic clock option at both compile time and runtime. Otherwise no use |
3383 | monotonic clock option at both compile time and runtime. Otherwise no |
3166 | of the monotonic clock option will be attempted. If you enable this, you |
3384 | use of the monotonic clock option will be attempted. If you enable this, |
3167 | usually have to link against librt or something similar. Enabling it when |
3385 | you usually have to link against librt or something similar. Enabling it |
3168 | the functionality isn't available is safe, though, although you have |
3386 | when the functionality isn't available is safe, though, although you have |
3169 | to make sure you link against any libraries where the C<clock_gettime> |
3387 | to make sure you link against any libraries where the C<clock_gettime> |
3170 | function is hiding in (often F<-lrt>). |
3388 | function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>. |
3171 | |
3389 | |
3172 | =item EV_USE_REALTIME |
3390 | =item EV_USE_REALTIME |
3173 | |
3391 | |
3174 | If defined to be C<1>, libev will try to detect the availability of the |
3392 | If defined to be C<1>, libev will try to detect the availability of the |
3175 | real-time clock option at compile time (and assume its availability at |
3393 | real-time clock option at compile time (and assume its availability |
3176 | runtime if successful). Otherwise no use of the real-time clock option will |
3394 | at runtime if successful). Otherwise no use of the real-time clock |
3177 | be attempted. This effectively replaces C<gettimeofday> by C<clock_get |
3395 | option will be attempted. This effectively replaces C<gettimeofday> |
3178 | (CLOCK_REALTIME, ...)> and will not normally affect correctness. See the |
3396 | by C<clock_get (CLOCK_REALTIME, ...)> and will not normally affect |
3179 | note about libraries in the description of C<EV_USE_MONOTONIC>, though. |
3397 | correctness. See the note about libraries in the description of |
|
|
3398 | C<EV_USE_MONOTONIC>, though. Defaults to the opposite value of |
|
|
3399 | C<EV_USE_CLOCK_SYSCALL>. |
|
|
3400 | |
|
|
3401 | =item EV_USE_CLOCK_SYSCALL |
|
|
3402 | |
|
|
3403 | If defined to be C<1>, libev will try to use a direct syscall instead |
|
|
3404 | of calling the system-provided C<clock_gettime> function. This option |
|
|
3405 | exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt> |
|
|
3406 | unconditionally pulls in C<libpthread>, slowing down single-threaded |
|
|
3407 | programs needlessly. Using a direct syscall is slightly slower (in |
|
|
3408 | theory), because no optimised vdso implementation can be used, but avoids |
|
|
3409 | the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or |
|
|
3410 | higher, as it simplifies linking (no need for C<-lrt>). |
3180 | |
3411 | |
3181 | =item EV_USE_NANOSLEEP |
3412 | =item EV_USE_NANOSLEEP |
3182 | |
3413 | |
3183 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
3414 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
3184 | and will use it for delays. Otherwise it will use C<select ()>. |
3415 | and will use it for delays. Otherwise it will use C<select ()>. |
… | |
… | |
3200 | |
3431 | |
3201 | =item EV_SELECT_USE_FD_SET |
3432 | =item EV_SELECT_USE_FD_SET |
3202 | |
3433 | |
3203 | If defined to C<1>, then the select backend will use the system C<fd_set> |
3434 | If defined to C<1>, then the select backend will use the system C<fd_set> |
3204 | structure. This is useful if libev doesn't compile due to a missing |
3435 | structure. This is useful if libev doesn't compile due to a missing |
3205 | C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout on |
3436 | C<NFDBITS> or C<fd_mask> definition or it mis-guesses the bitset layout |
3206 | exotic systems. This usually limits the range of file descriptors to some |
3437 | on exotic systems. This usually limits the range of file descriptors to |
3207 | low limit such as 1024 or might have other limitations (winsocket only |
3438 | some low limit such as 1024 or might have other limitations (winsocket |
3208 | allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, might |
3439 | only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, |
3209 | influence the size of the C<fd_set> used. |
3440 | configures the maximum size of the C<fd_set>. |
3210 | |
3441 | |
3211 | =item EV_SELECT_IS_WINSOCKET |
3442 | =item EV_SELECT_IS_WINSOCKET |
3212 | |
3443 | |
3213 | When defined to C<1>, the select backend will assume that |
3444 | When defined to C<1>, the select backend will assume that |
3214 | select/socket/connect etc. don't understand file descriptors but |
3445 | select/socket/connect etc. don't understand file descriptors but |
… | |
… | |
3863 | involves iterating over all running async watchers or all signal numbers. |
4094 | involves iterating over all running async watchers or all signal numbers. |
3864 | |
4095 | |
3865 | =back |
4096 | =back |
3866 | |
4097 | |
3867 | |
4098 | |
|
|
4099 | =head1 GLOSSARY |
|
|
4100 | |
|
|
4101 | =over 4 |
|
|
4102 | |
|
|
4103 | =item active |
|
|
4104 | |
|
|
4105 | A watcher is active as long as it has been started (has been attached to |
|
|
4106 | an event loop) but not yet stopped (disassociated from the event loop). |
|
|
4107 | |
|
|
4108 | =item application |
|
|
4109 | |
|
|
4110 | In this document, an application is whatever is using libev. |
|
|
4111 | |
|
|
4112 | =item callback |
|
|
4113 | |
|
|
4114 | The address of a function that is called when some event has been |
|
|
4115 | detected. Callbacks are being passed the event loop, the watcher that |
|
|
4116 | received the event, and the actual event bitset. |
|
|
4117 | |
|
|
4118 | =item callback invocation |
|
|
4119 | |
|
|
4120 | The act of calling the callback associated with a watcher. |
|
|
4121 | |
|
|
4122 | =item event |
|
|
4123 | |
|
|
4124 | A change of state of some external event, such as data now being available |
|
|
4125 | for reading on a file descriptor, time having passed or simply not having |
|
|
4126 | any other events happening anymore. |
|
|
4127 | |
|
|
4128 | In libev, events are represented as single bits (such as C<EV_READ> or |
|
|
4129 | C<EV_TIMEOUT>). |
|
|
4130 | |
|
|
4131 | =item event library |
|
|
4132 | |
|
|
4133 | A software package implementing an event model and loop. |
|
|
4134 | |
|
|
4135 | =item event loop |
|
|
4136 | |
|
|
4137 | An entity that handles and processes external events and converts them |
|
|
4138 | into callback invocations. |
|
|
4139 | |
|
|
4140 | =item event model |
|
|
4141 | |
|
|
4142 | The model used to describe how an event loop handles and processes |
|
|
4143 | watchers and events. |
|
|
4144 | |
|
|
4145 | =item pending |
|
|
4146 | |
|
|
4147 | A watcher is pending as soon as the corresponding event has been detected, |
|
|
4148 | and stops being pending as soon as the watcher will be invoked or its |
|
|
4149 | pending status is explicitly cleared by the application. |
|
|
4150 | |
|
|
4151 | A watcher can be pending, but not active. Stopping a watcher also clears |
|
|
4152 | its pending status. |
|
|
4153 | |
|
|
4154 | =item real time |
|
|
4155 | |
|
|
4156 | The physical time that is observed. It is apparently strictly monotonic :) |
|
|
4157 | |
|
|
4158 | =item wall-clock time |
|
|
4159 | |
|
|
4160 | The time and date as shown on clocks. Unlike real time, it can actually |
|
|
4161 | be wrong and jump forwards and backwards, e.g. when the you adjust your |
|
|
4162 | clock. |
|
|
4163 | |
|
|
4164 | =item watcher |
|
|
4165 | |
|
|
4166 | A data structure that describes interest in certain events. Watchers need |
|
|
4167 | to be started (attached to an event loop) before they can receive events. |
|
|
4168 | |
|
|
4169 | =item watcher invocation |
|
|
4170 | |
|
|
4171 | The act of calling the callback associated with a watcher. |
|
|
4172 | |
|
|
4173 | =back |
|
|
4174 | |
3868 | =head1 AUTHOR |
4175 | =head1 AUTHOR |
3869 | |
4176 | |
3870 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
4177 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
3871 | |
4178 | |