… | |
… | |
62 | |
62 | |
63 | // unloop was called, so exit |
63 | // unloop was called, so exit |
64 | return 0; |
64 | return 0; |
65 | } |
65 | } |
66 | |
66 | |
67 | =head1 DESCRIPTION |
67 | =head1 ABOUT THIS DOCUMENT |
|
|
68 | |
|
|
69 | This document documents the libev software package. |
68 | |
70 | |
69 | The newest version of this document is also available as an html-formatted |
71 | The newest version of this document is also available as an html-formatted |
70 | web page you might find easier to navigate when reading it for the first |
72 | web page you might find easier to navigate when reading it for the first |
71 | time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>. |
73 | time: L<http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod>. |
|
|
74 | |
|
|
75 | While this document tries to be as complete as possible in documenting |
|
|
76 | libev, its usage and the rationale behind its design, it is not a tutorial |
|
|
77 | on event-based programming, nor will it introduce event-based programming |
|
|
78 | with libev. |
|
|
79 | |
|
|
80 | Familarity with event based programming techniques in general is assumed |
|
|
81 | throughout this document. |
|
|
82 | |
|
|
83 | =head1 ABOUT LIBEV |
72 | |
84 | |
73 | Libev is an event loop: you register interest in certain events (such as a |
85 | Libev is an event loop: you register interest in certain events (such as a |
74 | file descriptor being readable or a timeout occurring), and it will manage |
86 | file descriptor being readable or a timeout occurring), and it will manage |
75 | these event sources and provide your program with events. |
87 | these event sources and provide your program with events. |
76 | |
88 | |
… | |
… | |
110 | name C<loop> (which is always of type C<ev_loop *>) will not have |
122 | name C<loop> (which is always of type C<ev_loop *>) will not have |
111 | this argument. |
123 | this argument. |
112 | |
124 | |
113 | =head2 TIME REPRESENTATION |
125 | =head2 TIME REPRESENTATION |
114 | |
126 | |
115 | Libev represents time as a single floating point number, representing the |
127 | Libev represents time as a single floating point number, representing |
116 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
128 | the (fractional) number of seconds since the (POSIX) epoch (somewhere |
117 | the beginning of 1970, details are complicated, don't ask). This type is |
129 | near the beginning of 1970, details are complicated, don't ask). This |
118 | called C<ev_tstamp>, which is what you should use too. It usually aliases |
130 | type is called C<ev_tstamp>, which is what you should use too. It usually |
119 | to the C<double> type in C, and when you need to do any calculations on |
131 | aliases to the C<double> type in C. When you need to do any calculations |
120 | it, you should treat it as some floating point value. Unlike the name |
132 | on it, you should treat it as some floating point value. Unlike the name |
121 | component C<stamp> might indicate, it is also used for time differences |
133 | component C<stamp> might indicate, it is also used for time differences |
122 | throughout libev. |
134 | throughout libev. |
123 | |
135 | |
124 | =head1 ERROR HANDLING |
136 | =head1 ERROR HANDLING |
125 | |
137 | |
… | |
… | |
609 | |
621 | |
610 | This value can sometimes be useful as a generation counter of sorts (it |
622 | This value can sometimes be useful as a generation counter of sorts (it |
611 | "ticks" the number of loop iterations), as it roughly corresponds with |
623 | "ticks" the number of loop iterations), as it roughly corresponds with |
612 | C<ev_prepare> and C<ev_check> calls. |
624 | C<ev_prepare> and C<ev_check> calls. |
613 | |
625 | |
|
|
626 | =item unsigned int ev_loop_depth (loop) |
|
|
627 | |
|
|
628 | Returns the number of times C<ev_loop> was entered minus the number of |
|
|
629 | times C<ev_loop> was exited, in other words, the recursion depth. |
|
|
630 | |
|
|
631 | Outside C<ev_loop>, this number is zero. In a callback, this number is |
|
|
632 | C<1>, unless C<ev_loop> was invoked recursively (or from another thread), |
|
|
633 | in which case it is higher. |
|
|
634 | |
|
|
635 | Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread |
|
|
636 | etc.), doesn't count as exit. |
|
|
637 | |
614 | =item unsigned int ev_backend (loop) |
638 | =item unsigned int ev_backend (loop) |
615 | |
639 | |
616 | Returns one of the C<EVBACKEND_*> flags indicating the event backend in |
640 | Returns one of the C<EVBACKEND_*> flags indicating the event backend in |
617 | use. |
641 | use. |
618 | |
642 | |
… | |
… | |
632 | |
656 | |
633 | This function is rarely useful, but when some event callback runs for a |
657 | This function is rarely useful, but when some event callback runs for a |
634 | very long time without entering the event loop, updating libev's idea of |
658 | very long time without entering the event loop, updating libev's idea of |
635 | the current time is a good idea. |
659 | the current time is a good idea. |
636 | |
660 | |
637 | See also "The special problem of time updates" in the C<ev_timer> section. |
661 | See also L<The special problem of time updates> in the C<ev_timer> section. |
|
|
662 | |
|
|
663 | =item ev_suspend (loop) |
|
|
664 | |
|
|
665 | =item ev_resume (loop) |
|
|
666 | |
|
|
667 | These two functions suspend and resume a loop, for use when the loop is |
|
|
668 | not used for a while and timeouts should not be processed. |
|
|
669 | |
|
|
670 | A typical use case would be an interactive program such as a game: When |
|
|
671 | the user presses C<^Z> to suspend the game and resumes it an hour later it |
|
|
672 | would be best to handle timeouts as if no time had actually passed while |
|
|
673 | the program was suspended. This can be achieved by calling C<ev_suspend> |
|
|
674 | in your C<SIGTSTP> handler, sending yourself a C<SIGSTOP> and calling |
|
|
675 | C<ev_resume> directly afterwards to resume timer processing. |
|
|
676 | |
|
|
677 | Effectively, all C<ev_timer> watchers will be delayed by the time spend |
|
|
678 | between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers |
|
|
679 | will be rescheduled (that is, they will lose any events that would have |
|
|
680 | occured while suspended). |
|
|
681 | |
|
|
682 | After calling C<ev_suspend> you B<must not> call I<any> function on the |
|
|
683 | given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> |
|
|
684 | without a previous call to C<ev_suspend>. |
|
|
685 | |
|
|
686 | Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the |
|
|
687 | event loop time (see C<ev_now_update>). |
638 | |
688 | |
639 | =item ev_loop (loop, int flags) |
689 | =item ev_loop (loop, int flags) |
640 | |
690 | |
641 | Finally, this is it, the event handler. This function usually is called |
691 | Finally, this is it, the event handler. This function usually is called |
642 | after you initialised all your watchers and you want to start handling |
692 | after you initialised all your watchers and you want to start handling |
… | |
… | |
773 | |
823 | |
774 | By setting a higher I<io collect interval> you allow libev to spend more |
824 | By setting a higher I<io collect interval> you allow libev to spend more |
775 | time collecting I/O events, so you can handle more events per iteration, |
825 | time collecting I/O events, so you can handle more events per iteration, |
776 | at the cost of increasing latency. Timeouts (both C<ev_periodic> and |
826 | at the cost of increasing latency. Timeouts (both C<ev_periodic> and |
777 | C<ev_timer>) will be not affected. Setting this to a non-null value will |
827 | C<ev_timer>) will be not affected. Setting this to a non-null value will |
778 | introduce an additional C<ev_sleep ()> call into most loop iterations. |
828 | introduce an additional C<ev_sleep ()> call into most loop iterations. The |
|
|
829 | sleep time ensures that libev will not poll for I/O events more often then |
|
|
830 | once per this interval, on average. |
779 | |
831 | |
780 | Likewise, by setting a higher I<timeout collect interval> you allow libev |
832 | Likewise, by setting a higher I<timeout collect interval> you allow libev |
781 | to spend more time collecting timeouts, at the expense of increased |
833 | to spend more time collecting timeouts, at the expense of increased |
782 | latency/jitter/inexactness (the watcher callback will be called |
834 | latency/jitter/inexactness (the watcher callback will be called |
783 | later). C<ev_io> watchers will not be affected. Setting this to a non-null |
835 | later). C<ev_io> watchers will not be affected. Setting this to a non-null |
… | |
… | |
785 | |
837 | |
786 | Many (busy) programs can usually benefit by setting the I/O collect |
838 | Many (busy) programs can usually benefit by setting the I/O collect |
787 | interval to a value near C<0.1> or so, which is often enough for |
839 | interval to a value near C<0.1> or so, which is often enough for |
788 | interactive servers (of course not for games), likewise for timeouts. It |
840 | interactive servers (of course not for games), likewise for timeouts. It |
789 | usually doesn't make much sense to set it to a lower value than C<0.01>, |
841 | usually doesn't make much sense to set it to a lower value than C<0.01>, |
790 | as this approaches the timing granularity of most systems. |
842 | as this approaches the timing granularity of most systems. Note that if |
|
|
843 | you do transactions with the outside world and you can't increase the |
|
|
844 | parallelity, then this setting will limit your transaction rate (if you |
|
|
845 | need to poll once per transaction and the I/O collect interval is 0.01, |
|
|
846 | then you can't do more than 100 transations per second). |
791 | |
847 | |
792 | Setting the I<timeout collect interval> can improve the opportunity for |
848 | Setting the I<timeout collect interval> can improve the opportunity for |
793 | saving power, as the program will "bundle" timer callback invocations that |
849 | saving power, as the program will "bundle" timer callback invocations that |
794 | are "near" in time together, by delaying some, thus reducing the number of |
850 | are "near" in time together, by delaying some, thus reducing the number of |
795 | times the process sleeps and wakes up again. Another useful technique to |
851 | times the process sleeps and wakes up again. Another useful technique to |
796 | reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure |
852 | reduce iterations/wake-ups is to use C<ev_periodic> watchers and make sure |
797 | they fire on, say, one-second boundaries only. |
853 | they fire on, say, one-second boundaries only. |
|
|
854 | |
|
|
855 | Example: we only need 0.1s timeout granularity, and we wish not to poll |
|
|
856 | more often than 100 times per second: |
|
|
857 | |
|
|
858 | ev_set_timeout_collect_interval (EV_DEFAULT_UC_ 0.1); |
|
|
859 | ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); |
798 | |
860 | |
799 | =item ev_loop_verify (loop) |
861 | =item ev_loop_verify (loop) |
800 | |
862 | |
801 | This function only does something when C<EV_VERIFY> support has been |
863 | This function only does something when C<EV_VERIFY> support has been |
802 | compiled in, which is the default for non-minimal builds. It tries to go |
864 | compiled in, which is the default for non-minimal builds. It tries to go |
… | |
… | |
1057 | integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> |
1119 | integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> |
1058 | (default: C<-2>). Pending watchers with higher priority will be invoked |
1120 | (default: C<-2>). Pending watchers with higher priority will be invoked |
1059 | before watchers with lower priority, but priority will not keep watchers |
1121 | before watchers with lower priority, but priority will not keep watchers |
1060 | from being executed (except for C<ev_idle> watchers). |
1122 | from being executed (except for C<ev_idle> watchers). |
1061 | |
1123 | |
1062 | This means that priorities are I<only> used for ordering callback |
|
|
1063 | invocation after new events have been received. This is useful, for |
|
|
1064 | example, to reduce latency after idling, or more often, to bind two |
|
|
1065 | watchers on the same event and make sure one is called first. |
|
|
1066 | |
|
|
1067 | If you need to suppress invocation when higher priority events are pending |
1124 | If you need to suppress invocation when higher priority events are pending |
1068 | you need to look at C<ev_idle> watchers, which provide this functionality. |
1125 | you need to look at C<ev_idle> watchers, which provide this functionality. |
1069 | |
1126 | |
1070 | You I<must not> change the priority of a watcher as long as it is active or |
1127 | You I<must not> change the priority of a watcher as long as it is active or |
1071 | pending. |
1128 | pending. |
1072 | |
|
|
1073 | The default priority used by watchers when no priority has been set is |
|
|
1074 | always C<0>, which is supposed to not be too high and not be too low :). |
|
|
1075 | |
1129 | |
1076 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
1130 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
1077 | fine, as long as you do not mind that the priority value you query might |
1131 | fine, as long as you do not mind that the priority value you query might |
1078 | or might not have been clamped to the valid range. |
1132 | or might not have been clamped to the valid range. |
|
|
1133 | |
|
|
1134 | The default priority used by watchers when no priority has been set is |
|
|
1135 | always C<0>, which is supposed to not be too high and not be too low :). |
|
|
1136 | |
|
|
1137 | See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of |
|
|
1138 | priorities. |
1079 | |
1139 | |
1080 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1140 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1081 | |
1141 | |
1082 | Invoke the C<watcher> with the given C<loop> and C<revents>. Neither |
1142 | Invoke the C<watcher> with the given C<loop> and C<revents>. Neither |
1083 | C<loop> nor C<revents> need to be valid as long as the watcher callback |
1143 | C<loop> nor C<revents> need to be valid as long as the watcher callback |
… | |
… | |
1148 | #include <stddef.h> |
1208 | #include <stddef.h> |
1149 | |
1209 | |
1150 | static void |
1210 | static void |
1151 | t1_cb (EV_P_ ev_timer *w, int revents) |
1211 | t1_cb (EV_P_ ev_timer *w, int revents) |
1152 | { |
1212 | { |
1153 | struct my_biggy big = (struct my_biggy * |
1213 | struct my_biggy big = (struct my_biggy *) |
1154 | (((char *)w) - offsetof (struct my_biggy, t1)); |
1214 | (((char *)w) - offsetof (struct my_biggy, t1)); |
1155 | } |
1215 | } |
1156 | |
1216 | |
1157 | static void |
1217 | static void |
1158 | t2_cb (EV_P_ ev_timer *w, int revents) |
1218 | t2_cb (EV_P_ ev_timer *w, int revents) |
1159 | { |
1219 | { |
1160 | struct my_biggy big = (struct my_biggy * |
1220 | struct my_biggy big = (struct my_biggy *) |
1161 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1221 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1162 | } |
1222 | } |
|
|
1223 | |
|
|
1224 | =head2 WATCHER PRIORITY MODELS |
|
|
1225 | |
|
|
1226 | Many event loops support I<watcher priorities>, which are usually small |
|
|
1227 | integers that influence the ordering of event callback invocation |
|
|
1228 | between watchers in some way, all else being equal. |
|
|
1229 | |
|
|
1230 | In libev, Watcher priorities can be set using C<ev_set_priority>. See its |
|
|
1231 | description for the more technical details such as the actual priority |
|
|
1232 | range. |
|
|
1233 | |
|
|
1234 | There are two common ways how these these priorities are being interpreted |
|
|
1235 | by event loops: |
|
|
1236 | |
|
|
1237 | In the more common lock-out model, higher priorities "lock out" invocation |
|
|
1238 | of lower priority watchers, which means as long as higher priority |
|
|
1239 | watchers receive events, lower priority watchers are not being invoked. |
|
|
1240 | |
|
|
1241 | The less common only-for-ordering model uses priorities solely to order |
|
|
1242 | callback invocation within a single event loop iteration: Higher priority |
|
|
1243 | watchers are invoked before lower priority ones, but they all get invoked |
|
|
1244 | before polling for new events. |
|
|
1245 | |
|
|
1246 | Libev uses the second (only-for-ordering) model for all its watchers |
|
|
1247 | except for idle watchers (which use the lock-out model). |
|
|
1248 | |
|
|
1249 | The rationale behind this is that implementing the lock-out model for |
|
|
1250 | watchers is not well supported by most kernel interfaces, and most event |
|
|
1251 | libraries will just poll for the same events again and again as long as |
|
|
1252 | their callbacks have not been executed, which is very inefficient in the |
|
|
1253 | common case of one high-priority watcher locking out a mass of lower |
|
|
1254 | priority ones. |
|
|
1255 | |
|
|
1256 | Static (ordering) priorities are most useful when you have two or more |
|
|
1257 | watchers handling the same resource: a typical usage example is having an |
|
|
1258 | C<ev_io> watcher to receive data, and an associated C<ev_timer> to handle |
|
|
1259 | timeouts. Under load, data might be received while the program handles |
|
|
1260 | other jobs, but since timers normally get invoked first, the timeout |
|
|
1261 | handler will be executed before checking for data. In that case, giving |
|
|
1262 | the timer a lower priority than the I/O watcher ensures that I/O will be |
|
|
1263 | handled first even under adverse conditions (which is usually, but not |
|
|
1264 | always, what you want). |
|
|
1265 | |
|
|
1266 | Since idle watchers use the "lock-out" model, meaning that idle watchers |
|
|
1267 | will only be executed when no same or higher priority watchers have |
|
|
1268 | received events, they can be used to implement the "lock-out" model when |
|
|
1269 | required. |
|
|
1270 | |
|
|
1271 | For example, to emulate how many other event libraries handle priorities, |
|
|
1272 | you can associate an C<ev_idle> watcher to each such watcher, and in |
|
|
1273 | the normal watcher callback, you just start the idle watcher. The real |
|
|
1274 | processing is done in the idle watcher callback. This causes libev to |
|
|
1275 | continously poll and process kernel event data for the watcher, but when |
|
|
1276 | the lock-out case is known to be rare (which in turn is rare :), this is |
|
|
1277 | workable. |
|
|
1278 | |
|
|
1279 | Usually, however, the lock-out model implemented that way will perform |
|
|
1280 | miserably under the type of load it was designed to handle. In that case, |
|
|
1281 | it might be preferable to stop the real watcher before starting the |
|
|
1282 | idle watcher, so the kernel will not have to process the event in case |
|
|
1283 | the actual processing will be delayed for considerable time. |
|
|
1284 | |
|
|
1285 | Here is an example of an I/O watcher that should run at a strictly lower |
|
|
1286 | priority than the default, and which should only process data when no |
|
|
1287 | other events are pending: |
|
|
1288 | |
|
|
1289 | ev_idle idle; // actual processing watcher |
|
|
1290 | ev_io io; // actual event watcher |
|
|
1291 | |
|
|
1292 | static void |
|
|
1293 | io_cb (EV_P_ ev_io *w, int revents) |
|
|
1294 | { |
|
|
1295 | // stop the I/O watcher, we received the event, but |
|
|
1296 | // are not yet ready to handle it. |
|
|
1297 | ev_io_stop (EV_A_ w); |
|
|
1298 | |
|
|
1299 | // start the idle watcher to ahndle the actual event. |
|
|
1300 | // it will not be executed as long as other watchers |
|
|
1301 | // with the default priority are receiving events. |
|
|
1302 | ev_idle_start (EV_A_ &idle); |
|
|
1303 | } |
|
|
1304 | |
|
|
1305 | static void |
|
|
1306 | idle_cb (EV_P_ ev_idle *w, int revents) |
|
|
1307 | { |
|
|
1308 | // actual processing |
|
|
1309 | read (STDIN_FILENO, ...); |
|
|
1310 | |
|
|
1311 | // have to start the I/O watcher again, as |
|
|
1312 | // we have handled the event |
|
|
1313 | ev_io_start (EV_P_ &io); |
|
|
1314 | } |
|
|
1315 | |
|
|
1316 | // initialisation |
|
|
1317 | ev_idle_init (&idle, idle_cb); |
|
|
1318 | ev_io_init (&io, io_cb, STDIN_FILENO, EV_READ); |
|
|
1319 | ev_io_start (EV_DEFAULT_ &io); |
|
|
1320 | |
|
|
1321 | In the "real" world, it might also be beneficial to start a timer, so that |
|
|
1322 | low-priority connections can not be locked out forever under load. This |
|
|
1323 | enables your program to keep a lower latency for important connections |
|
|
1324 | during short periods of high load, while not completely locking out less |
|
|
1325 | important ones. |
1163 | |
1326 | |
1164 | |
1327 | |
1165 | =head1 WATCHER TYPES |
1328 | =head1 WATCHER TYPES |
1166 | |
1329 | |
1167 | This section describes each watcher in detail, but will not repeat |
1330 | This section describes each watcher in detail, but will not repeat |
… | |
… | |
1193 | descriptors to non-blocking mode is also usually a good idea (but not |
1356 | descriptors to non-blocking mode is also usually a good idea (but not |
1194 | required if you know what you are doing). |
1357 | required if you know what you are doing). |
1195 | |
1358 | |
1196 | If you cannot use non-blocking mode, then force the use of a |
1359 | If you cannot use non-blocking mode, then force the use of a |
1197 | known-to-be-good backend (at the time of this writing, this includes only |
1360 | known-to-be-good backend (at the time of this writing, this includes only |
1198 | C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). |
1361 | C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file |
|
|
1362 | descriptors for which non-blocking operation makes no sense (such as |
|
|
1363 | files) - libev doesn't guarentee any specific behaviour in that case. |
1199 | |
1364 | |
1200 | Another thing you have to watch out for is that it is quite easy to |
1365 | Another thing you have to watch out for is that it is quite easy to |
1201 | receive "spurious" readiness notifications, that is your callback might |
1366 | receive "spurious" readiness notifications, that is your callback might |
1202 | be called with C<EV_READ> but a subsequent C<read>(2) will actually block |
1367 | be called with C<EV_READ> but a subsequent C<read>(2) will actually block |
1203 | because there is no data. Not only are some backends known to create a |
1368 | because there is no data. Not only are some backends known to create a |
… | |
… | |
1324 | year, it will still time out after (roughly) one hour. "Roughly" because |
1489 | year, it will still time out after (roughly) one hour. "Roughly" because |
1325 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1490 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1326 | monotonic clock option helps a lot here). |
1491 | monotonic clock option helps a lot here). |
1327 | |
1492 | |
1328 | The callback is guaranteed to be invoked only I<after> its timeout has |
1493 | The callback is guaranteed to be invoked only I<after> its timeout has |
1329 | passed. If multiple timers become ready during the same loop iteration |
1494 | passed (not I<at>, so on systems with very low-resolution clocks this |
1330 | then the ones with earlier time-out values are invoked before ones with |
1495 | might introduce a small delay). If multiple timers become ready during the |
1331 | later time-out values (but this is no longer true when a callback calls |
1496 | same loop iteration then the ones with earlier time-out values are invoked |
1332 | C<ev_loop> recursively). |
1497 | before ones of the same priority with later time-out values (but this is |
|
|
1498 | no longer true when a callback calls C<ev_loop> recursively). |
1333 | |
1499 | |
1334 | =head3 Be smart about timeouts |
1500 | =head3 Be smart about timeouts |
1335 | |
1501 | |
1336 | Many real-world problems involve some kind of timeout, usually for error |
1502 | Many real-world problems involve some kind of timeout, usually for error |
1337 | recovery. A typical example is an HTTP request - if the other side hangs, |
1503 | recovery. A typical example is an HTTP request - if the other side hangs, |
… | |
… | |
1381 | C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> |
1547 | C<after> argument to C<ev_timer_set>, and only ever use the C<repeat> |
1382 | member and C<ev_timer_again>. |
1548 | member and C<ev_timer_again>. |
1383 | |
1549 | |
1384 | At start: |
1550 | At start: |
1385 | |
1551 | |
1386 | ev_timer_init (timer, callback); |
1552 | ev_init (timer, callback); |
1387 | timer->repeat = 60.; |
1553 | timer->repeat = 60.; |
1388 | ev_timer_again (loop, timer); |
1554 | ev_timer_again (loop, timer); |
1389 | |
1555 | |
1390 | Each time there is some activity: |
1556 | Each time there is some activity: |
1391 | |
1557 | |
… | |
… | |
1453 | |
1619 | |
1454 | To start the timer, simply initialise the watcher and set C<last_activity> |
1620 | To start the timer, simply initialise the watcher and set C<last_activity> |
1455 | to the current time (meaning we just have some activity :), then call the |
1621 | to the current time (meaning we just have some activity :), then call the |
1456 | callback, which will "do the right thing" and start the timer: |
1622 | callback, which will "do the right thing" and start the timer: |
1457 | |
1623 | |
1458 | ev_timer_init (timer, callback); |
1624 | ev_init (timer, callback); |
1459 | last_activity = ev_now (loop); |
1625 | last_activity = ev_now (loop); |
1460 | callback (loop, timer, EV_TIMEOUT); |
1626 | callback (loop, timer, EV_TIMEOUT); |
1461 | |
1627 | |
1462 | And when there is some activity, simply store the current time in |
1628 | And when there is some activity, simply store the current time in |
1463 | C<last_activity>, no libev calls at all: |
1629 | C<last_activity>, no libev calls at all: |
… | |
… | |
1556 | If the timer is started but non-repeating, stop it (as if it timed out). |
1722 | If the timer is started but non-repeating, stop it (as if it timed out). |
1557 | |
1723 | |
1558 | If the timer is repeating, either start it if necessary (with the |
1724 | If the timer is repeating, either start it if necessary (with the |
1559 | C<repeat> value), or reset the running timer to the C<repeat> value. |
1725 | C<repeat> value), or reset the running timer to the C<repeat> value. |
1560 | |
1726 | |
1561 | This sounds a bit complicated, see "Be smart about timeouts", above, for a |
1727 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
1562 | usage example. |
1728 | usage example. |
1563 | |
1729 | |
1564 | =item ev_tstamp repeat [read-write] |
1730 | =item ev_tstamp repeat [read-write] |
1565 | |
1731 | |
1566 | The current C<repeat> value. Will be used each time the watcher times out |
1732 | The current C<repeat> value. Will be used each time the watcher times out |
… | |
… | |
1860 | some child status changes (most typically when a child of yours dies or |
2026 | some child status changes (most typically when a child of yours dies or |
1861 | exits). It is permissible to install a child watcher I<after> the child |
2027 | exits). It is permissible to install a child watcher I<after> the child |
1862 | has been forked (which implies it might have already exited), as long |
2028 | has been forked (which implies it might have already exited), as long |
1863 | as the event loop isn't entered (or is continued from a watcher), i.e., |
2029 | as the event loop isn't entered (or is continued from a watcher), i.e., |
1864 | forking and then immediately registering a watcher for the child is fine, |
2030 | forking and then immediately registering a watcher for the child is fine, |
1865 | but forking and registering a watcher a few event loop iterations later is |
2031 | but forking and registering a watcher a few event loop iterations later or |
1866 | not. |
2032 | in the next callback invocation is not. |
1867 | |
2033 | |
1868 | Only the default event loop is capable of handling signals, and therefore |
2034 | Only the default event loop is capable of handling signals, and therefore |
1869 | you can only register child watchers in the default event loop. |
2035 | you can only register child watchers in the default event loop. |
|
|
2036 | |
|
|
2037 | Due to some design glitches inside libev, child watchers will always be |
|
|
2038 | handled at maximum priority (their priority is set to C<EV_MAXPRI> by |
|
|
2039 | libev) |
1870 | |
2040 | |
1871 | =head3 Process Interaction |
2041 | =head3 Process Interaction |
1872 | |
2042 | |
1873 | Libev grabs C<SIGCHLD> as soon as the default event loop is |
2043 | Libev grabs C<SIGCHLD> as soon as the default event loop is |
1874 | initialised. This is necessary to guarantee proper behaviour even if |
2044 | initialised. This is necessary to guarantee proper behaviour even if |
… | |
… | |
2226 | // no longer anything immediate to do. |
2396 | // no longer anything immediate to do. |
2227 | } |
2397 | } |
2228 | |
2398 | |
2229 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
2399 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
2230 | ev_idle_init (idle_watcher, idle_cb); |
2400 | ev_idle_init (idle_watcher, idle_cb); |
2231 | ev_idle_start (loop, idle_cb); |
2401 | ev_idle_start (loop, idle_watcher); |
2232 | |
2402 | |
2233 | |
2403 | |
2234 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
2404 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
2235 | |
2405 | |
2236 | Prepare and check watchers are usually (but not always) used in pairs: |
2406 | Prepare and check watchers are usually (but not always) used in pairs: |
… | |
… | |
2329 | struct pollfd fds [nfd]; |
2499 | struct pollfd fds [nfd]; |
2330 | // actual code will need to loop here and realloc etc. |
2500 | // actual code will need to loop here and realloc etc. |
2331 | adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); |
2501 | adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); |
2332 | |
2502 | |
2333 | /* the callback is illegal, but won't be called as we stop during check */ |
2503 | /* the callback is illegal, but won't be called as we stop during check */ |
2334 | ev_timer_init (&tw, 0, timeout * 1e-3); |
2504 | ev_timer_init (&tw, 0, timeout * 1e-3, 0.); |
2335 | ev_timer_start (loop, &tw); |
2505 | ev_timer_start (loop, &tw); |
2336 | |
2506 | |
2337 | // create one ev_io per pollfd |
2507 | // create one ev_io per pollfd |
2338 | for (int i = 0; i < nfd; ++i) |
2508 | for (int i = 0; i < nfd; ++i) |
2339 | { |
2509 | { |
… | |
… | |
2569 | event loop blocks next and before C<ev_check> watchers are being called, |
2739 | event loop blocks next and before C<ev_check> watchers are being called, |
2570 | and only in the child after the fork. If whoever good citizen calling |
2740 | and only in the child after the fork. If whoever good citizen calling |
2571 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
2741 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
2572 | handlers will be invoked, too, of course. |
2742 | handlers will be invoked, too, of course. |
2573 | |
2743 | |
|
|
2744 | =head3 The special problem of life after fork - how is it possible? |
|
|
2745 | |
|
|
2746 | Most uses of C<fork()> consist of forking, then some simple calls to ste |
|
|
2747 | up/change the process environment, followed by a call to C<exec()>. This |
|
|
2748 | sequence should be handled by libev without any problems. |
|
|
2749 | |
|
|
2750 | This changes when the application actually wants to do event handling |
|
|
2751 | in the child, or both parent in child, in effect "continuing" after the |
|
|
2752 | fork. |
|
|
2753 | |
|
|
2754 | The default mode of operation (for libev, with application help to detect |
|
|
2755 | forks) is to duplicate all the state in the child, as would be expected |
|
|
2756 | when I<either> the parent I<or> the child process continues. |
|
|
2757 | |
|
|
2758 | When both processes want to continue using libev, then this is usually the |
|
|
2759 | wrong result. In that case, usually one process (typically the parent) is |
|
|
2760 | supposed to continue with all watchers in place as before, while the other |
|
|
2761 | process typically wants to start fresh, i.e. without any active watchers. |
|
|
2762 | |
|
|
2763 | The cleanest and most efficient way to achieve that with libev is to |
|
|
2764 | simply create a new event loop, which of course will be "empty", and |
|
|
2765 | use that for new watchers. This has the advantage of not touching more |
|
|
2766 | memory than necessary, and thus avoiding the copy-on-write, and the |
|
|
2767 | disadvantage of having to use multiple event loops (which do not support |
|
|
2768 | signal watchers). |
|
|
2769 | |
|
|
2770 | When this is not possible, or you want to use the default loop for |
|
|
2771 | other reasons, then in the process that wants to start "fresh", call |
|
|
2772 | C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying |
|
|
2773 | the default loop will "orphan" (not stop) all registered watchers, so you |
|
|
2774 | have to be careful not to execute code that modifies those watchers. Note |
|
|
2775 | also that in that case, you have to re-register any signal watchers. |
|
|
2776 | |
2574 | =head3 Watcher-Specific Functions and Data Members |
2777 | =head3 Watcher-Specific Functions and Data Members |
2575 | |
2778 | |
2576 | =over 4 |
2779 | =over 4 |
2577 | |
2780 | |
2578 | =item ev_fork_init (ev_signal *, callback) |
2781 | =item ev_fork_init (ev_signal *, callback) |
… | |
… | |
3760 | way (note also that glib is the slowest event library known to man). |
3963 | way (note also that glib is the slowest event library known to man). |
3761 | |
3964 | |
3762 | There is no supported compilation method available on windows except |
3965 | There is no supported compilation method available on windows except |
3763 | embedding it into other applications. |
3966 | embedding it into other applications. |
3764 | |
3967 | |
|
|
3968 | Sensible signal handling is officially unsupported by Microsoft - libev |
|
|
3969 | tries its best, but under most conditions, signals will simply not work. |
|
|
3970 | |
3765 | Not a libev limitation but worth mentioning: windows apparently doesn't |
3971 | Not a libev limitation but worth mentioning: windows apparently doesn't |
3766 | accept large writes: instead of resulting in a partial write, windows will |
3972 | accept large writes: instead of resulting in a partial write, windows will |
3767 | either accept everything or return C<ENOBUFS> if the buffer is too large, |
3973 | either accept everything or return C<ENOBUFS> if the buffer is too large, |
3768 | so make sure you only write small amounts into your sockets (less than a |
3974 | so make sure you only write small amounts into your sockets (less than a |
3769 | megabyte seems safe, but this apparently depends on the amount of memory |
3975 | megabyte seems safe, but this apparently depends on the amount of memory |
… | |
… | |
3773 | the abysmal performance of winsockets, using a large number of sockets |
3979 | the abysmal performance of winsockets, using a large number of sockets |
3774 | is not recommended (and not reasonable). If your program needs to use |
3980 | is not recommended (and not reasonable). If your program needs to use |
3775 | more than a hundred or so sockets, then likely it needs to use a totally |
3981 | more than a hundred or so sockets, then likely it needs to use a totally |
3776 | different implementation for windows, as libev offers the POSIX readiness |
3982 | different implementation for windows, as libev offers the POSIX readiness |
3777 | notification model, which cannot be implemented efficiently on windows |
3983 | notification model, which cannot be implemented efficiently on windows |
3778 | (Microsoft monopoly games). |
3984 | (due to Microsoft monopoly games). |
3779 | |
3985 | |
3780 | A typical way to use libev under windows is to embed it (see the embedding |
3986 | A typical way to use libev under windows is to embed it (see the embedding |
3781 | section for details) and use the following F<evwrap.h> header file instead |
3987 | section for details) and use the following F<evwrap.h> header file instead |
3782 | of F<ev.h>: |
3988 | of F<ev.h>: |
3783 | |
3989 | |
… | |
… | |
3819 | |
4025 | |
3820 | Early versions of winsocket's select only supported waiting for a maximum |
4026 | Early versions of winsocket's select only supported waiting for a maximum |
3821 | of C<64> handles (probably owning to the fact that all windows kernels |
4027 | of C<64> handles (probably owning to the fact that all windows kernels |
3822 | can only wait for C<64> things at the same time internally; Microsoft |
4028 | can only wait for C<64> things at the same time internally; Microsoft |
3823 | recommends spawning a chain of threads and wait for 63 handles and the |
4029 | recommends spawning a chain of threads and wait for 63 handles and the |
3824 | previous thread in each. Great). |
4030 | previous thread in each. Sounds great!). |
3825 | |
4031 | |
3826 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
4032 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
3827 | to some high number (e.g. C<2048>) before compiling the winsocket select |
4033 | to some high number (e.g. C<2048>) before compiling the winsocket select |
3828 | call (which might be in libev or elsewhere, for example, perl does its own |
4034 | call (which might be in libev or elsewhere, for example, perl and many |
3829 | select emulation on windows). |
4035 | other interpreters do their own select emulation on windows). |
3830 | |
4036 | |
3831 | Another limit is the number of file descriptors in the Microsoft runtime |
4037 | Another limit is the number of file descriptors in the Microsoft runtime |
3832 | libraries, which by default is C<64> (there must be a hidden I<64> fetish |
4038 | libraries, which by default is C<64> (there must be a hidden I<64> |
3833 | or something like this inside Microsoft). You can increase this by calling |
4039 | fetish or something like this inside Microsoft). You can increase this |
3834 | C<_setmaxstdio>, which can increase this limit to C<2048> (another |
4040 | by calling C<_setmaxstdio>, which can increase this limit to C<2048> |
3835 | arbitrary limit), but is broken in many versions of the Microsoft runtime |
4041 | (another arbitrary limit), but is broken in many versions of the Microsoft |
3836 | libraries. |
|
|
3837 | |
|
|
3838 | This might get you to about C<512> or C<2048> sockets (depending on |
4042 | runtime libraries. This might get you to about C<512> or C<2048> sockets |
3839 | windows version and/or the phase of the moon). To get more, you need to |
4043 | (depending on windows version and/or the phase of the moon). To get more, |
3840 | wrap all I/O functions and provide your own fd management, but the cost of |
4044 | you need to wrap all I/O functions and provide your own fd management, but |
3841 | calling select (O(n²)) will likely make this unworkable. |
4045 | the cost of calling select (O(n²)) will likely make this unworkable. |
3842 | |
4046 | |
3843 | =back |
4047 | =back |
3844 | |
4048 | |
3845 | =head2 PORTABILITY REQUIREMENTS |
4049 | =head2 PORTABILITY REQUIREMENTS |
3846 | |
4050 | |
… | |
… | |
3889 | =item C<double> must hold a time value in seconds with enough accuracy |
4093 | =item C<double> must hold a time value in seconds with enough accuracy |
3890 | |
4094 | |
3891 | The type C<double> is used to represent timestamps. It is required to |
4095 | The type C<double> is used to represent timestamps. It is required to |
3892 | have at least 51 bits of mantissa (and 9 bits of exponent), which is good |
4096 | have at least 51 bits of mantissa (and 9 bits of exponent), which is good |
3893 | enough for at least into the year 4000. This requirement is fulfilled by |
4097 | enough for at least into the year 4000. This requirement is fulfilled by |
3894 | implementations implementing IEEE 754 (basically all existing ones). |
4098 | implementations implementing IEEE 754, which is basically all existing |
|
|
4099 | ones. With IEEE 754 doubles, you get microsecond accuracy until at least |
|
|
4100 | 2200. |
3895 | |
4101 | |
3896 | =back |
4102 | =back |
3897 | |
4103 | |
3898 | If you know of other additional requirements drop me a note. |
4104 | If you know of other additional requirements drop me a note. |
3899 | |
4105 | |
… | |
… | |
3967 | involves iterating over all running async watchers or all signal numbers. |
4173 | involves iterating over all running async watchers or all signal numbers. |
3968 | |
4174 | |
3969 | =back |
4175 | =back |
3970 | |
4176 | |
3971 | |
4177 | |
|
|
4178 | =head1 GLOSSARY |
|
|
4179 | |
|
|
4180 | =over 4 |
|
|
4181 | |
|
|
4182 | =item active |
|
|
4183 | |
|
|
4184 | A watcher is active as long as it has been started (has been attached to |
|
|
4185 | an event loop) but not yet stopped (disassociated from the event loop). |
|
|
4186 | |
|
|
4187 | =item application |
|
|
4188 | |
|
|
4189 | In this document, an application is whatever is using libev. |
|
|
4190 | |
|
|
4191 | =item callback |
|
|
4192 | |
|
|
4193 | The address of a function that is called when some event has been |
|
|
4194 | detected. Callbacks are being passed the event loop, the watcher that |
|
|
4195 | received the event, and the actual event bitset. |
|
|
4196 | |
|
|
4197 | =item callback invocation |
|
|
4198 | |
|
|
4199 | The act of calling the callback associated with a watcher. |
|
|
4200 | |
|
|
4201 | =item event |
|
|
4202 | |
|
|
4203 | A change of state of some external event, such as data now being available |
|
|
4204 | for reading on a file descriptor, time having passed or simply not having |
|
|
4205 | any other events happening anymore. |
|
|
4206 | |
|
|
4207 | In libev, events are represented as single bits (such as C<EV_READ> or |
|
|
4208 | C<EV_TIMEOUT>). |
|
|
4209 | |
|
|
4210 | =item event library |
|
|
4211 | |
|
|
4212 | A software package implementing an event model and loop. |
|
|
4213 | |
|
|
4214 | =item event loop |
|
|
4215 | |
|
|
4216 | An entity that handles and processes external events and converts them |
|
|
4217 | into callback invocations. |
|
|
4218 | |
|
|
4219 | =item event model |
|
|
4220 | |
|
|
4221 | The model used to describe how an event loop handles and processes |
|
|
4222 | watchers and events. |
|
|
4223 | |
|
|
4224 | =item pending |
|
|
4225 | |
|
|
4226 | A watcher is pending as soon as the corresponding event has been detected, |
|
|
4227 | and stops being pending as soon as the watcher will be invoked or its |
|
|
4228 | pending status is explicitly cleared by the application. |
|
|
4229 | |
|
|
4230 | A watcher can be pending, but not active. Stopping a watcher also clears |
|
|
4231 | its pending status. |
|
|
4232 | |
|
|
4233 | =item real time |
|
|
4234 | |
|
|
4235 | The physical time that is observed. It is apparently strictly monotonic :) |
|
|
4236 | |
|
|
4237 | =item wall-clock time |
|
|
4238 | |
|
|
4239 | The time and date as shown on clocks. Unlike real time, it can actually |
|
|
4240 | be wrong and jump forwards and backwards, e.g. when the you adjust your |
|
|
4241 | clock. |
|
|
4242 | |
|
|
4243 | =item watcher |
|
|
4244 | |
|
|
4245 | A data structure that describes interest in certain events. Watchers need |
|
|
4246 | to be started (attached to an event loop) before they can receive events. |
|
|
4247 | |
|
|
4248 | =item watcher invocation |
|
|
4249 | |
|
|
4250 | The act of calling the callback associated with a watcher. |
|
|
4251 | |
|
|
4252 | =back |
|
|
4253 | |
3972 | =head1 AUTHOR |
4254 | =head1 AUTHOR |
3973 | |
4255 | |
3974 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
4256 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
3975 | |
4257 | |