… | |
… | |
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); |
… | |
… | |
60 | |
62 | |
61 | // unloop was called, so exit |
63 | // unloop was called, so exit |
62 | return 0; |
64 | return 0; |
63 | } |
65 | } |
64 | |
66 | |
65 | =head1 DESCRIPTION |
67 | =head1 ABOUT THIS DOCUMENT |
|
|
68 | |
|
|
69 | This document documents the libev software package. |
66 | |
70 | |
67 | 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 |
68 | 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 |
69 | 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 |
70 | |
84 | |
71 | 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 |
72 | 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 |
73 | these event sources and provide your program with events. |
87 | these event sources and provide your program with events. |
74 | |
88 | |
… | |
… | |
108 | 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 |
109 | this argument. |
123 | this argument. |
110 | |
124 | |
111 | =head2 TIME REPRESENTATION |
125 | =head2 TIME REPRESENTATION |
112 | |
126 | |
113 | Libev represents time as a single floating point number, representing the |
127 | Libev represents time as a single floating point number, representing |
114 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
128 | the (fractional) number of seconds since the (POSIX) epoch (somewhere |
115 | 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 |
116 | 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 |
117 | 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 |
118 | 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 |
119 | 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 |
120 | throughout libev. |
134 | throughout libev. |
121 | |
135 | |
122 | =head1 ERROR HANDLING |
136 | =head1 ERROR HANDLING |
123 | |
137 | |
… | |
… | |
417 | i.e. keep at least one watcher active per fd at all times. Stopping and |
431 | i.e. keep at least one watcher active per fd at all times. Stopping and |
418 | starting a watcher (without re-setting it) also usually doesn't cause |
432 | 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 |
433 | 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 |
434 | as in libev having to destroy and recreate the epoll object, which can |
421 | take considerable time and thus should be avoided. |
435 | take considerable time and thus should be avoided. |
|
|
436 | |
|
|
437 | All this means that, in practice, C<EVBACKEND_SELECT> can be as fast or |
|
|
438 | faster than epoll for maybe up to a hundred file descriptors, depending on |
|
|
439 | the usage. So sad. |
422 | |
440 | |
423 | While nominally embeddable in other event loops, this feature is broken in |
441 | While nominally embeddable in other event loops, this feature is broken in |
424 | all kernel versions tested so far. |
442 | all kernel versions tested so far. |
425 | |
443 | |
426 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
444 | This backend maps C<EV_READ> and C<EV_WRITE> in the same way as |
… | |
… | |
454 | |
472 | |
455 | While nominally embeddable in other event loops, this doesn't work |
473 | 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 |
474 | 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 |
475 | 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 |
476 | (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, |
477 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> (but C<poll> is of course |
460 | using it only for sockets. |
478 | also broken on OS X)) and, did I mention it, using it only for sockets. |
461 | |
479 | |
462 | This backend maps C<EV_READ> into an C<EVFILT_READ> kevent with |
480 | 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 |
481 | C<NOTE_EOF>, and C<EV_WRITE> into an C<EVFILT_WRITE> kevent with |
464 | C<NOTE_EOF>. |
482 | C<NOTE_EOF>. |
465 | |
483 | |
… | |
… | |
603 | |
621 | |
604 | 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 |
605 | "ticks" the number of loop iterations), as it roughly corresponds with |
623 | "ticks" the number of loop iterations), as it roughly corresponds with |
606 | C<ev_prepare> and C<ev_check> calls. |
624 | C<ev_prepare> and C<ev_check> calls. |
607 | |
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 | |
608 | =item unsigned int ev_backend (loop) |
638 | =item unsigned int ev_backend (loop) |
609 | |
639 | |
610 | 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 |
611 | use. |
641 | use. |
612 | |
642 | |
… | |
… | |
626 | |
656 | |
627 | 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 |
628 | 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 |
629 | the current time is a good idea. |
659 | the current time is a good idea. |
630 | |
660 | |
631 | 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>). |
632 | |
688 | |
633 | =item ev_loop (loop, int flags) |
689 | =item ev_loop (loop, int flags) |
634 | |
690 | |
635 | 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 |
636 | 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 |
… | |
… | |
720 | |
776 | |
721 | If you have a watcher you never unregister that should not keep C<ev_loop> |
777 | 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 |
778 | from returning, call ev_unref() after starting, and ev_ref() before |
723 | stopping it. |
779 | stopping it. |
724 | |
780 | |
725 | As an example, libev itself uses this for its internal signal pipe: It is |
781 | 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 |
782 | 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 |
783 | 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 |
784 | 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> |
785 | 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, |
786 | before stop> (but only if the watcher wasn't active before, or was active |
731 | respectively). |
787 | before, respectively. Note also that libev might stop watchers itself |
|
|
788 | (e.g. non-repeating timers) in which case you have to C<ev_ref> |
|
|
789 | in the callback). |
732 | |
790 | |
733 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
791 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
734 | running when nothing else is active. |
792 | running when nothing else is active. |
735 | |
793 | |
736 | ev_signal exitsig; |
794 | ev_signal exitsig; |
… | |
… | |
765 | |
823 | |
766 | 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 |
767 | 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, |
768 | 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 |
769 | 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 |
770 | 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. |
771 | |
831 | |
772 | 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 |
773 | to spend more time collecting timeouts, at the expense of increased |
833 | to spend more time collecting timeouts, at the expense of increased |
774 | latency/jitter/inexactness (the watcher callback will be called |
834 | latency/jitter/inexactness (the watcher callback will be called |
775 | 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 |
… | |
… | |
777 | |
837 | |
778 | 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 |
779 | 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 |
780 | interactive servers (of course not for games), likewise for timeouts. It |
840 | interactive servers (of course not for games), likewise for timeouts. It |
781 | 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>, |
782 | 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). |
783 | |
847 | |
784 | Setting the I<timeout collect interval> can improve the opportunity for |
848 | Setting the I<timeout collect interval> can improve the opportunity for |
785 | saving power, as the program will "bundle" timer callback invocations that |
849 | saving power, as the program will "bundle" timer callback invocations that |
786 | 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 |
787 | 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 |
788 | 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 |
789 | 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); |
790 | |
860 | |
791 | =item ev_loop_verify (loop) |
861 | =item ev_loop_verify (loop) |
792 | |
862 | |
793 | 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 |
794 | 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 |
… | |
… | |
920 | |
990 | |
921 | =item C<EV_ASYNC> |
991 | =item C<EV_ASYNC> |
922 | |
992 | |
923 | The given async watcher has been asynchronously notified (see C<ev_async>). |
993 | The given async watcher has been asynchronously notified (see C<ev_async>). |
924 | |
994 | |
|
|
995 | =item C<EV_CUSTOM> |
|
|
996 | |
|
|
997 | Not ever sent (or otherwise used) by libev itself, but can be freely used |
|
|
998 | by libev users to signal watchers (e.g. via C<ev_feed_event>). |
|
|
999 | |
925 | =item C<EV_ERROR> |
1000 | =item C<EV_ERROR> |
926 | |
1001 | |
927 | An unspecified error has occurred, the watcher has been stopped. This might |
1002 | An unspecified error has occurred, the watcher has been stopped. This might |
928 | happen because the watcher could not be properly started because libev |
1003 | 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 |
1004 | 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> |
1119 | integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> |
1045 | (default: C<-2>). Pending watchers with higher priority will be invoked |
1120 | (default: C<-2>). Pending watchers with higher priority will be invoked |
1046 | before watchers with lower priority, but priority will not keep watchers |
1121 | before watchers with lower priority, but priority will not keep watchers |
1047 | from being executed (except for C<ev_idle> watchers). |
1122 | from being executed (except for C<ev_idle> watchers). |
1048 | |
1123 | |
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 |
1124 | 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. |
1125 | you need to look at C<ev_idle> watchers, which provide this functionality. |
1056 | |
1126 | |
1057 | 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 |
1058 | pending. |
1128 | 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 | |
1129 | |
1063 | 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 |
1064 | 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 |
1065 | 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. |
1066 | |
1139 | |
1067 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1140 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
1068 | |
1141 | |
1069 | 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 |
1070 | 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 |
… | |
… | |
1135 | #include <stddef.h> |
1208 | #include <stddef.h> |
1136 | |
1209 | |
1137 | static void |
1210 | static void |
1138 | t1_cb (EV_P_ ev_timer *w, int revents) |
1211 | t1_cb (EV_P_ ev_timer *w, int revents) |
1139 | { |
1212 | { |
1140 | struct my_biggy big = (struct my_biggy * |
1213 | struct my_biggy big = (struct my_biggy *) |
1141 | (((char *)w) - offsetof (struct my_biggy, t1)); |
1214 | (((char *)w) - offsetof (struct my_biggy, t1)); |
1142 | } |
1215 | } |
1143 | |
1216 | |
1144 | static void |
1217 | static void |
1145 | t2_cb (EV_P_ ev_timer *w, int revents) |
1218 | t2_cb (EV_P_ ev_timer *w, int revents) |
1146 | { |
1219 | { |
1147 | struct my_biggy big = (struct my_biggy * |
1220 | struct my_biggy big = (struct my_biggy *) |
1148 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1221 | (((char *)w) - offsetof (struct my_biggy, t2)); |
1149 | } |
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. |
1150 | |
1326 | |
1151 | |
1327 | |
1152 | =head1 WATCHER TYPES |
1328 | =head1 WATCHER TYPES |
1153 | |
1329 | |
1154 | This section describes each watcher in detail, but will not repeat |
1330 | This section describes each watcher in detail, but will not repeat |
… | |
… | |
1180 | 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 |
1181 | required if you know what you are doing). |
1357 | required if you know what you are doing). |
1182 | |
1358 | |
1183 | 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 |
1184 | 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 |
1185 | 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. |
1186 | |
1364 | |
1187 | 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 |
1188 | receive "spurious" readiness notifications, that is your callback might |
1366 | receive "spurious" readiness notifications, that is your callback might |
1189 | 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 |
1190 | 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 |
… | |
… | |
1311 | 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 |
1312 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1490 | detecting time jumps is hard, and some inaccuracies are unavoidable (the |
1313 | monotonic clock option helps a lot here). |
1491 | monotonic clock option helps a lot here). |
1314 | |
1492 | |
1315 | 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 |
1316 | passed, but if multiple timers become ready during the same loop iteration |
1494 | passed (not I<at>, so on systems with very low-resolution clocks this |
1317 | then order of execution is undefined. |
1495 | might introduce a small delay). If multiple timers become ready during the |
|
|
1496 | same loop iteration then the ones with earlier time-out values are invoked |
|
|
1497 | before ones with later time-out values (but this is no longer true when a |
|
|
1498 | callback calls C<ev_loop> recursively). |
1318 | |
1499 | |
1319 | =head3 Be smart about timeouts |
1500 | =head3 Be smart about timeouts |
1320 | |
1501 | |
1321 | 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 |
1322 | 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, |
… | |
… | |
1366 | 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> |
1367 | member and C<ev_timer_again>. |
1548 | member and C<ev_timer_again>. |
1368 | |
1549 | |
1369 | At start: |
1550 | At start: |
1370 | |
1551 | |
1371 | ev_timer_init (timer, callback); |
1552 | ev_init (timer, callback); |
1372 | timer->repeat = 60.; |
1553 | timer->repeat = 60.; |
1373 | ev_timer_again (loop, timer); |
1554 | ev_timer_again (loop, timer); |
1374 | |
1555 | |
1375 | Each time there is some activity: |
1556 | Each time there is some activity: |
1376 | |
1557 | |
… | |
… | |
1415 | else |
1596 | else |
1416 | { |
1597 | { |
1417 | // callback was invoked, but there was some activity, re-arm |
1598 | // callback was invoked, but there was some activity, re-arm |
1418 | // the watcher to fire in last_activity + 60, which is |
1599 | // the watcher to fire in last_activity + 60, which is |
1419 | // guaranteed to be in the future, so "again" is positive: |
1600 | // guaranteed to be in the future, so "again" is positive: |
1420 | w->again = timeout - now; |
1601 | w->repeat = timeout - now; |
1421 | ev_timer_again (EV_A_ w); |
1602 | ev_timer_again (EV_A_ w); |
1422 | } |
1603 | } |
1423 | } |
1604 | } |
1424 | |
1605 | |
1425 | To summarise the callback: first calculate the real timeout (defined |
1606 | To summarise the callback: first calculate the real timeout (defined |
… | |
… | |
1438 | |
1619 | |
1439 | 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> |
1440 | 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 |
1441 | callback, which will "do the right thing" and start the timer: |
1622 | callback, which will "do the right thing" and start the timer: |
1442 | |
1623 | |
1443 | ev_timer_init (timer, callback); |
1624 | ev_init (timer, callback); |
1444 | last_activity = ev_now (loop); |
1625 | last_activity = ev_now (loop); |
1445 | callback (loop, timer, EV_TIMEOUT); |
1626 | callback (loop, timer, EV_TIMEOUT); |
1446 | |
1627 | |
1447 | 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 |
1448 | C<last_activity>, no libev calls at all: |
1629 | C<last_activity>, no libev calls at all: |
… | |
… | |
1541 | 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). |
1542 | |
1723 | |
1543 | 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 |
1544 | 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. |
1545 | |
1726 | |
1546 | 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 |
1547 | usage example. |
1728 | usage example. |
1548 | |
1729 | |
1549 | =item ev_tstamp repeat [read-write] |
1730 | =item ev_tstamp repeat [read-write] |
1550 | |
1731 | |
1551 | 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 |
… | |
… | |
1590 | =head2 C<ev_periodic> - to cron or not to cron? |
1771 | =head2 C<ev_periodic> - to cron or not to cron? |
1591 | |
1772 | |
1592 | Periodic watchers are also timers of a kind, but they are very versatile |
1773 | Periodic watchers are also timers of a kind, but they are very versatile |
1593 | (and unfortunately a bit complex). |
1774 | (and unfortunately a bit complex). |
1594 | |
1775 | |
1595 | Unlike C<ev_timer>'s, they are not based on real time (or relative time) |
1776 | 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 |
1777 | 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 |
1778 | (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 () |
1779 | 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 |
1780 | 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 |
1781 | 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 | |
1782 | |
|
|
1783 | You can tell a periodic watcher to trigger after some specific point |
|
|
1784 | in time: for example, if you tell a periodic watcher to trigger "in 10 |
|
|
1785 | seconds" (by specifying e.g. C<ev_now () + 10.>, that is, an absolute time |
|
|
1786 | not a delay) and then reset your system clock to January of the previous |
|
|
1787 | year, then it will take a year or more to trigger the event (unlike an |
|
|
1788 | C<ev_timer>, which would still trigger roughly 10 seconds after starting |
|
|
1789 | it, as it uses a relative timeout). |
|
|
1790 | |
1604 | C<ev_periodic>s can also be used to implement vastly more complex timers, |
1791 | 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 |
1792 | timers, such as triggering an event on each "midnight, local time", or |
1606 | complicated rules. |
1793 | other complicated rules. This cannot be done with C<ev_timer> watchers, as |
|
|
1794 | those cannot react to time jumps. |
1607 | |
1795 | |
1608 | As with timers, the callback is guaranteed to be invoked only when the |
1796 | 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 |
1797 | 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. |
1798 | timers become ready during the same loop iteration then the ones with |
|
|
1799 | earlier time-out values are invoked before ones with later time-out values |
|
|
1800 | (but this is no longer true when a callback calls C<ev_loop> recursively). |
1611 | |
1801 | |
1612 | =head3 Watcher-Specific Functions and Data Members |
1802 | =head3 Watcher-Specific Functions and Data Members |
1613 | |
1803 | |
1614 | =over 4 |
1804 | =over 4 |
1615 | |
1805 | |
1616 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) |
1806 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp offset, ev_tstamp interval, reschedule_cb) |
1617 | |
1807 | |
1618 | =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) |
1808 | =item ev_periodic_set (ev_periodic *, ev_tstamp offset, ev_tstamp interval, reschedule_cb) |
1619 | |
1809 | |
1620 | Lots of arguments, lets sort it out... There are basically three modes of |
1810 | 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: |
1811 | operation, and we will explain them from simplest to most complex: |
1622 | |
1812 | |
1623 | =over 4 |
1813 | =over 4 |
1624 | |
1814 | |
1625 | =item * absolute timer (at = time, interval = reschedule_cb = 0) |
1815 | =item * absolute timer (offset = absolute time, interval = 0, reschedule_cb = 0) |
1626 | |
1816 | |
1627 | In this configuration the watcher triggers an event after the wall clock |
1817 | 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 |
1818 | 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 |
1819 | 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. |
1820 | will be stopped and invoked when the system clock reaches or surpasses |
|
|
1821 | this point in time. |
1631 | |
1822 | |
1632 | =item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) |
1823 | =item * repeating interval timer (offset = offset within interval, interval > 0, reschedule_cb = 0) |
1633 | |
1824 | |
1634 | In this mode the watcher will always be scheduled to time out at the next |
1825 | 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) |
1826 | C<offset + N * interval> time (for some integer N, which can also be |
1636 | and then repeat, regardless of any time jumps. |
1827 | negative) and then repeat, regardless of any time jumps. The C<offset> |
|
|
1828 | argument is merely an offset into the C<interval> periods. |
1637 | |
1829 | |
1638 | This can be used to create timers that do not drift with respect to the |
1830 | 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 |
1831 | system clock, for example, here is an C<ev_periodic> that triggers each |
1640 | hour, on the hour: |
1832 | hour, on the hour (with respect to UTC): |
1641 | |
1833 | |
1642 | ev_periodic_set (&periodic, 0., 3600., 0); |
1834 | ev_periodic_set (&periodic, 0., 3600., 0); |
1643 | |
1835 | |
1644 | This doesn't mean there will always be 3600 seconds in between triggers, |
1836 | 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 |
1837 | 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 |
1838 | full hour (UTC), or more correctly, when the system time is evenly divisible |
1647 | by 3600. |
1839 | by 3600. |
1648 | |
1840 | |
1649 | Another way to think about it (for the mathematically inclined) is that |
1841 | 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 |
1842 | 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. |
1843 | time where C<time = offset (mod interval)>, regardless of any time jumps. |
1652 | |
1844 | |
1653 | For numerical stability it is preferable that the C<at> value is near |
1845 | 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 |
1846 | C<ev_now ()> (the current time), but there is no range requirement for |
1655 | this value, and in fact is often specified as zero. |
1847 | this value, and in fact is often specified as zero. |
1656 | |
1848 | |
1657 | Note also that there is an upper limit to how often a timer can fire (CPU |
1849 | 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 |
1850 | 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 |
1851 | 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). |
1852 | millisecond (if the OS supports it and the machine is fast enough). |
1661 | |
1853 | |
1662 | =item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) |
1854 | =item * manual reschedule mode (offset ignored, interval ignored, reschedule_cb = callback) |
1663 | |
1855 | |
1664 | In this mode the values for C<interval> and C<at> are both being |
1856 | 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 |
1857 | ignored. Instead, each time the periodic watcher gets scheduled, the |
1666 | reschedule callback will be called with the watcher as first, and the |
1858 | reschedule callback will be called with the watcher as first, and the |
1667 | current time as second argument. |
1859 | current time as second argument. |
1668 | |
1860 | |
1669 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, |
1861 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, ever, |
1670 | ever, or make ANY event loop modifications whatsoever>. |
1862 | or make ANY other event loop modifications whatsoever, unless explicitly |
|
|
1863 | allowed by documentation here>. |
1671 | |
1864 | |
1672 | If you need to stop it, return C<now + 1e30> (or so, fudge fudge) and stop |
1865 | 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 |
1866 | it afterwards (e.g. by starting an C<ev_prepare> watcher, which is the |
1674 | only event loop modification you are allowed to do). |
1867 | only event loop modification you are allowed to do). |
1675 | |
1868 | |
… | |
… | |
1705 | a different time than the last time it was called (e.g. in a crond like |
1898 | a different time than the last time it was called (e.g. in a crond like |
1706 | program when the crontabs have changed). |
1899 | program when the crontabs have changed). |
1707 | |
1900 | |
1708 | =item ev_tstamp ev_periodic_at (ev_periodic *) |
1901 | =item ev_tstamp ev_periodic_at (ev_periodic *) |
1709 | |
1902 | |
1710 | When active, returns the absolute time that the watcher is supposed to |
1903 | When active, returns the absolute time that the watcher is supposed |
1711 | trigger next. |
1904 | to trigger next. This is not the same as the C<offset> argument to |
|
|
1905 | C<ev_periodic_set>, but indeed works even in interval and manual |
|
|
1906 | rescheduling modes. |
1712 | |
1907 | |
1713 | =item ev_tstamp offset [read-write] |
1908 | =item ev_tstamp offset [read-write] |
1714 | |
1909 | |
1715 | When repeating, this contains the offset value, otherwise this is the |
1910 | 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>). |
1911 | absolute point in time (the C<offset> value passed to C<ev_periodic_set>, |
|
|
1912 | although libev might modify this value for better numerical stability). |
1717 | |
1913 | |
1718 | Can be modified any time, but changes only take effect when the periodic |
1914 | Can be modified any time, but changes only take effect when the periodic |
1719 | timer fires or C<ev_periodic_again> is being called. |
1915 | timer fires or C<ev_periodic_again> is being called. |
1720 | |
1916 | |
1721 | =item ev_tstamp interval [read-write] |
1917 | =item ev_tstamp interval [read-write] |
… | |
… | |
1830 | 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 |
1831 | 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 |
1832 | 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 |
1833 | 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., |
1834 | 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, |
1835 | 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 |
1836 | not. |
2032 | in the next callback invocation is not. |
1837 | |
2033 | |
1838 | 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 |
1839 | you can only register child watchers in the default event loop. |
2035 | you can only register child watchers in the default event loop. |
1840 | |
2036 | |
1841 | =head3 Process Interaction |
2037 | =head3 Process Interaction |
… | |
… | |
1932 | C<stat> on that path in regular intervals (or when the OS says it changed) |
2128 | 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 |
2129 | and sees if it changed compared to the last time, invoking the callback if |
1934 | it did. |
2130 | it did. |
1935 | |
2131 | |
1936 | The path does not need to exist: changing from "path exists" to "path does |
2132 | 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 |
2133 | 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 |
2134 | 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 |
2135 | C<st_nlink> field being zero (which is otherwise always forced to be at |
1940 | the stat buffer having unspecified contents. |
2136 | least one) and all the other fields of the stat buffer having unspecified |
|
|
2137 | contents. |
1941 | |
2138 | |
1942 | The path I<must not> end in a slash or contain special components such as |
2139 | 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 |
2140 | C<.> or C<..>. The path I<should> be absolute: If it is relative and |
1944 | your working directory changes, then the behaviour is undefined. |
2141 | your working directory changes, then the behaviour is undefined. |
1945 | |
2142 | |
… | |
… | |
1955 | This watcher type is not meant for massive numbers of stat watchers, |
2152 | This watcher type is not meant for massive numbers of stat watchers, |
1956 | as even with OS-supported change notifications, this can be |
2153 | as even with OS-supported change notifications, this can be |
1957 | resource-intensive. |
2154 | resource-intensive. |
1958 | |
2155 | |
1959 | At the time of this writing, the only OS-specific interface implemented |
2156 | At the time of this writing, the only OS-specific interface implemented |
1960 | is the Linux inotify interface (implementing kqueue support is left as |
2157 | 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 |
2158 | exercise for the reader. Note, however, that the author sees no way of |
1962 | of implementing C<ev_stat> semantics with kqueue). |
2159 | implementing C<ev_stat> semantics with kqueue, except as a hint). |
1963 | |
2160 | |
1964 | =head3 ABI Issues (Largefile Support) |
2161 | =head3 ABI Issues (Largefile Support) |
1965 | |
2162 | |
1966 | Libev by default (unless the user overrides this) uses the default |
2163 | Libev by default (unless the user overrides this) uses the default |
1967 | compilation environment, which means that on systems with large file |
2164 | compilation environment, which means that on systems with large file |
… | |
… | |
1978 | to exchange stat structures with application programs compiled using the |
2175 | to exchange stat structures with application programs compiled using the |
1979 | default compilation environment. |
2176 | default compilation environment. |
1980 | |
2177 | |
1981 | =head3 Inotify and Kqueue |
2178 | =head3 Inotify and Kqueue |
1982 | |
2179 | |
1983 | When C<inotify (7)> support has been compiled into libev (generally |
2180 | 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 |
2181 | 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 |
2182 | inotify descriptor will be created lazily when the first C<ev_stat> |
1986 | change detection where possible. The inotify descriptor will be created |
2183 | watcher is being started. |
1987 | lazily when the first C<ev_stat> watcher is being started. |
|
|
1988 | |
2184 | |
1989 | Inotify presence does not change the semantics of C<ev_stat> watchers |
2185 | 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 |
2186 | 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 |
2187 | 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, |
2188 | 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. |
2189 | but as long as kernel 2.6.25 or newer is used (2.6.24 and older have too |
|
|
2190 | many bugs), the path exists (i.e. stat succeeds), and the path resides on |
|
|
2191 | a local filesystem (libev currently assumes only ext2/3, jfs, reiserfs and |
|
|
2192 | xfs are fully working) libev usually gets away without polling. |
1994 | |
2193 | |
1995 | There is no support for kqueue, as apparently it cannot be used to |
2194 | 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 |
2195 | implement this functionality, due to the requirement of having a file |
1997 | descriptor open on the object at all times, and detecting renames, unlinks |
2196 | descriptor open on the object at all times, and detecting renames, unlinks |
1998 | etc. is difficult. |
2197 | etc. is difficult. |
|
|
2198 | |
|
|
2199 | =head3 C<stat ()> is a synchronous operation |
|
|
2200 | |
|
|
2201 | Libev doesn't normally do any kind of I/O itself, and so is not blocking |
|
|
2202 | the process. The exception are C<ev_stat> watchers - those call C<stat |
|
|
2203 | ()>, which is a synchronous operation. |
|
|
2204 | |
|
|
2205 | For local paths, this usually doesn't matter: unless the system is very |
|
|
2206 | busy or the intervals between stat's are large, a stat call will be fast, |
|
|
2207 | as the path data is usually in memory already (except when starting the |
|
|
2208 | watcher). |
|
|
2209 | |
|
|
2210 | For networked file systems, calling C<stat ()> can block an indefinite |
|
|
2211 | time due to network issues, and even under good conditions, a stat call |
|
|
2212 | often takes multiple milliseconds. |
|
|
2213 | |
|
|
2214 | Therefore, it is best to avoid using C<ev_stat> watchers on networked |
|
|
2215 | paths, although this is fully supported by libev. |
1999 | |
2216 | |
2000 | =head3 The special problem of stat time resolution |
2217 | =head3 The special problem of stat time resolution |
2001 | |
2218 | |
2002 | The C<stat ()> system call only supports full-second resolution portably, |
2219 | The C<stat ()> system call only supports full-second resolution portably, |
2003 | and even on systems where the resolution is higher, most file systems |
2220 | and even on systems where the resolution is higher, most file systems |
… | |
… | |
2152 | |
2369 | |
2153 | =head3 Watcher-Specific Functions and Data Members |
2370 | =head3 Watcher-Specific Functions and Data Members |
2154 | |
2371 | |
2155 | =over 4 |
2372 | =over 4 |
2156 | |
2373 | |
2157 | =item ev_idle_init (ev_signal *, callback) |
2374 | =item ev_idle_init (ev_idle *, callback) |
2158 | |
2375 | |
2159 | Initialises and configures the idle watcher - it has no parameters of any |
2376 | 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, |
2377 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
2161 | believe me. |
2378 | believe me. |
2162 | |
2379 | |
… | |
… | |
2175 | // no longer anything immediate to do. |
2392 | // no longer anything immediate to do. |
2176 | } |
2393 | } |
2177 | |
2394 | |
2178 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
2395 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
2179 | ev_idle_init (idle_watcher, idle_cb); |
2396 | ev_idle_init (idle_watcher, idle_cb); |
2180 | ev_idle_start (loop, idle_cb); |
2397 | ev_idle_start (loop, idle_watcher); |
2181 | |
2398 | |
2182 | |
2399 | |
2183 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
2400 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
2184 | |
2401 | |
2185 | Prepare and check watchers are usually (but not always) used in pairs: |
2402 | Prepare and check watchers are usually (but not always) used in pairs: |
… | |
… | |
2278 | struct pollfd fds [nfd]; |
2495 | struct pollfd fds [nfd]; |
2279 | // actual code will need to loop here and realloc etc. |
2496 | // actual code will need to loop here and realloc etc. |
2280 | adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); |
2497 | adns_beforepoll (ads, fds, &nfd, &timeout, timeval_from (ev_time ())); |
2281 | |
2498 | |
2282 | /* the callback is illegal, but won't be called as we stop during check */ |
2499 | /* the callback is illegal, but won't be called as we stop during check */ |
2283 | ev_timer_init (&tw, 0, timeout * 1e-3); |
2500 | ev_timer_init (&tw, 0, timeout * 1e-3, 0.); |
2284 | ev_timer_start (loop, &tw); |
2501 | ev_timer_start (loop, &tw); |
2285 | |
2502 | |
2286 | // create one ev_io per pollfd |
2503 | // create one ev_io per pollfd |
2287 | for (int i = 0; i < nfd; ++i) |
2504 | for (int i = 0; i < nfd; ++i) |
2288 | { |
2505 | { |
… | |
… | |
2401 | some fds have to be watched and handled very quickly (with low latency), |
2618 | 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 |
2619 | 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 |
2620 | 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. |
2621 | the rest in a second one, and embed the second one in the first. |
2405 | |
2622 | |
2406 | As long as the watcher is active, the callback will be invoked every time |
2623 | 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 |
2624 | 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 |
2625 | 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 |
2626 | 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 |
2627 | 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 |
2628 | to give the embedded loop strictly lower priority for example). |
2412 | embedded loop sweep. |
|
|
2413 | |
2629 | |
2414 | As long as the watcher is started it will automatically handle events. The |
2630 | 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 |
2631 | 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 | |
2632 | |
2419 | Also, there have not currently been made special provisions for forking: |
2633 | 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, |
2634 | 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 |
2635 | 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, |
2636 | C<ev_loop_fork> on the embedded loop. |
2423 | and future versions of libev might do just that. |
|
|
2424 | |
2637 | |
2425 | Unfortunately, not all backends are embeddable: only the ones returned by |
2638 | Unfortunately, not all backends are embeddable: only the ones returned by |
2426 | C<ev_embeddable_backends> are, which, unfortunately, does not include any |
2639 | C<ev_embeddable_backends> are, which, unfortunately, does not include any |
2427 | portable one. |
2640 | portable one. |
2428 | |
2641 | |
… | |
… | |
2522 | event loop blocks next and before C<ev_check> watchers are being called, |
2735 | event loop blocks next and before C<ev_check> watchers are being called, |
2523 | and only in the child after the fork. If whoever good citizen calling |
2736 | and only in the child after the fork. If whoever good citizen calling |
2524 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
2737 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
2525 | handlers will be invoked, too, of course. |
2738 | handlers will be invoked, too, of course. |
2526 | |
2739 | |
|
|
2740 | =head3 The special problem of life after fork - how is it possible? |
|
|
2741 | |
|
|
2742 | Most uses of C<fork()> consist of forking, then some simple calls to ste |
|
|
2743 | up/change the process environment, followed by a call to C<exec()>. This |
|
|
2744 | sequence should be handled by libev without any problems. |
|
|
2745 | |
|
|
2746 | This changes when the application actually wants to do event handling |
|
|
2747 | in the child, or both parent in child, in effect "continuing" after the |
|
|
2748 | fork. |
|
|
2749 | |
|
|
2750 | The default mode of operation (for libev, with application help to detect |
|
|
2751 | forks) is to duplicate all the state in the child, as would be expected |
|
|
2752 | when I<either> the parent I<or> the child process continues. |
|
|
2753 | |
|
|
2754 | When both processes want to continue using libev, then this is usually the |
|
|
2755 | wrong result. In that case, usually one process (typically the parent) is |
|
|
2756 | supposed to continue with all watchers in place as before, while the other |
|
|
2757 | process typically wants to start fresh, i.e. without any active watchers. |
|
|
2758 | |
|
|
2759 | The cleanest and most efficient way to achieve that with libev is to |
|
|
2760 | simply create a new event loop, which of course will be "empty", and |
|
|
2761 | use that for new watchers. This has the advantage of not touching more |
|
|
2762 | memory than necessary, and thus avoiding the copy-on-write, and the |
|
|
2763 | disadvantage of having to use multiple event loops (which do not support |
|
|
2764 | signal watchers). |
|
|
2765 | |
|
|
2766 | When this is not possible, or you want to use the default loop for |
|
|
2767 | other reasons, then in the process that wants to start "fresh", call |
|
|
2768 | C<ev_default_destroy ()> followed by C<ev_default_loop (...)>. Destroying |
|
|
2769 | the default loop will "orphan" (not stop) all registered watchers, so you |
|
|
2770 | have to be careful not to execute code that modifies those watchers. Note |
|
|
2771 | also that in that case, you have to re-register any signal watchers. |
|
|
2772 | |
2527 | =head3 Watcher-Specific Functions and Data Members |
2773 | =head3 Watcher-Specific Functions and Data Members |
2528 | |
2774 | |
2529 | =over 4 |
2775 | =over 4 |
2530 | |
2776 | |
2531 | =item ev_fork_init (ev_signal *, callback) |
2777 | =item ev_fork_init (ev_signal *, callback) |
… | |
… | |
2659 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
2905 | 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 |
2906 | 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 |
2907 | similar contexts (see the discussion of C<EV_ATOMIC_T> in the embedding |
2662 | section below on what exactly this means). |
2908 | section below on what exactly this means). |
2663 | |
2909 | |
|
|
2910 | Note that, as with other watchers in libev, multiple events might get |
|
|
2911 | compressed into a single callback invocation (another way to look at this |
|
|
2912 | is that C<ev_async> watchers are level-triggered, set on C<ev_async_send>, |
|
|
2913 | reset when the event loop detects that). |
|
|
2914 | |
2664 | This call incurs the overhead of a system call only once per loop iteration, |
2915 | 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 |
2916 | iteration, so while the overhead might be noticeable, it doesn't apply to |
2666 | calls to C<ev_async_send>. |
2917 | repeated calls to C<ev_async_send> for the same event loop. |
2667 | |
2918 | |
2668 | =item bool = ev_async_pending (ev_async *) |
2919 | =item bool = ev_async_pending (ev_async *) |
2669 | |
2920 | |
2670 | Returns a non-zero value when C<ev_async_send> has been called on the |
2921 | 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 |
2922 | 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 |
2925 | 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, |
2926 | 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 |
2927 | 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. |
2928 | quickly check whether invoking the loop might be a good idea. |
2678 | |
2929 | |
2679 | Not that this does I<not> check whether the watcher itself is pending, only |
2930 | Not that this does I<not> check whether the watcher itself is pending, |
2680 | whether it has been requested to make this watcher pending. |
2931 | only whether it has been requested to make this watcher pending: there |
|
|
2932 | is a time window between the event loop checking and resetting the async |
|
|
2933 | notification, and the callback being invoked. |
2681 | |
2934 | |
2682 | =back |
2935 | =back |
2683 | |
2936 | |
2684 | |
2937 | |
2685 | =head1 OTHER FUNCTIONS |
2938 | =head1 OTHER FUNCTIONS |
… | |
… | |
2864 | |
3117 | |
2865 | myclass obj; |
3118 | myclass obj; |
2866 | ev::io iow; |
3119 | ev::io iow; |
2867 | iow.set <myclass, &myclass::io_cb> (&obj); |
3120 | iow.set <myclass, &myclass::io_cb> (&obj); |
2868 | |
3121 | |
|
|
3122 | =item w->set (object *) |
|
|
3123 | |
|
|
3124 | This is an B<experimental> feature that might go away in a future version. |
|
|
3125 | |
|
|
3126 | This is a variation of a method callback - leaving out the method to call |
|
|
3127 | will default the method to C<operator ()>, which makes it possible to use |
|
|
3128 | functor objects without having to manually specify the C<operator ()> all |
|
|
3129 | the time. Incidentally, you can then also leave out the template argument |
|
|
3130 | list. |
|
|
3131 | |
|
|
3132 | The C<operator ()> method prototype must be C<void operator ()(watcher &w, |
|
|
3133 | int revents)>. |
|
|
3134 | |
|
|
3135 | See the method-C<set> above for more details. |
|
|
3136 | |
|
|
3137 | Example: use a functor object as callback. |
|
|
3138 | |
|
|
3139 | struct myfunctor |
|
|
3140 | { |
|
|
3141 | void operator() (ev::io &w, int revents) |
|
|
3142 | { |
|
|
3143 | ... |
|
|
3144 | } |
|
|
3145 | } |
|
|
3146 | |
|
|
3147 | myfunctor f; |
|
|
3148 | |
|
|
3149 | ev::io w; |
|
|
3150 | w.set (&f); |
|
|
3151 | |
2869 | =item w->set<function> (void *data = 0) |
3152 | =item w->set<function> (void *data = 0) |
2870 | |
3153 | |
2871 | Also sets a callback, but uses a static method or plain function as |
3154 | 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 |
3155 | callback. The optional C<data> argument will be stored in the watcher's |
2873 | C<data> member and is free for you to use. |
3156 | C<data> member and is free for you to use. |
… | |
… | |
2959 | L<http://software.schmorp.de/pkg/EV>. |
3242 | L<http://software.schmorp.de/pkg/EV>. |
2960 | |
3243 | |
2961 | =item Python |
3244 | =item Python |
2962 | |
3245 | |
2963 | Python bindings can be found at L<http://code.google.com/p/pyev/>. It |
3246 | 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 |
3247 | 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 | |
3248 | |
2970 | =item Ruby |
3249 | =item Ruby |
2971 | |
3250 | |
2972 | Tony Arcieri has written a ruby extension that offers access to a subset |
3251 | 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 |
3252 | 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 |
3253 | more on top of it. It can be found via gem servers. Its homepage is at |
2975 | L<http://rev.rubyforge.org/>. |
3254 | L<http://rev.rubyforge.org/>. |
|
|
3255 | |
|
|
3256 | Roger Pack reports that using the link order C<-lws2_32 -lmsvcrt-ruby-190> |
|
|
3257 | makes rev work even on mingw. |
|
|
3258 | |
|
|
3259 | =item Haskell |
|
|
3260 | |
|
|
3261 | A haskell binding to libev is available at |
|
|
3262 | L<http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hlibev>. |
2976 | |
3263 | |
2977 | =item D |
3264 | =item D |
2978 | |
3265 | |
2979 | Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to |
3266 | 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>. |
3267 | be found at L<http://proj.llucax.com.ar/wiki/evd>. |
… | |
… | |
3157 | keeps libev from including F<config.h>, and it also defines dummy |
3444 | keeps libev from including F<config.h>, and it also defines dummy |
3158 | implementations for some libevent functions (such as logging, which is not |
3445 | 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 |
3446 | 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. |
3447 | F<event.h> that are not directly supported by the libev core alone. |
3161 | |
3448 | |
|
|
3449 | In stanbdalone mode, libev will still try to automatically deduce the |
|
|
3450 | configuration, but has to be more conservative. |
|
|
3451 | |
3162 | =item EV_USE_MONOTONIC |
3452 | =item EV_USE_MONOTONIC |
3163 | |
3453 | |
3164 | If defined to be C<1>, libev will try to detect the availability of the |
3454 | 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 |
3455 | 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 |
3456 | 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 |
3457 | you usually have to link against librt or something similar. Enabling it |
3168 | the functionality isn't available is safe, though, although you have |
3458 | 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> |
3459 | to make sure you link against any libraries where the C<clock_gettime> |
3170 | function is hiding in (often F<-lrt>). |
3460 | function is hiding in (often F<-lrt>). See also C<EV_USE_CLOCK_SYSCALL>. |
3171 | |
3461 | |
3172 | =item EV_USE_REALTIME |
3462 | =item EV_USE_REALTIME |
3173 | |
3463 | |
3174 | If defined to be C<1>, libev will try to detect the availability of the |
3464 | 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 |
3465 | 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 |
3466 | at runtime if successful). Otherwise no use of the real-time clock |
3177 | be attempted. This effectively replaces C<gettimeofday> by C<clock_get |
3467 | option will be attempted. This effectively replaces C<gettimeofday> |
3178 | (CLOCK_REALTIME, ...)> and will not normally affect correctness. See the |
3468 | by C<clock_get (CLOCK_REALTIME, ...)> and will not normally affect |
3179 | note about libraries in the description of C<EV_USE_MONOTONIC>, though. |
3469 | correctness. See the note about libraries in the description of |
|
|
3470 | C<EV_USE_MONOTONIC>, though. Defaults to the opposite value of |
|
|
3471 | C<EV_USE_CLOCK_SYSCALL>. |
|
|
3472 | |
|
|
3473 | =item EV_USE_CLOCK_SYSCALL |
|
|
3474 | |
|
|
3475 | If defined to be C<1>, libev will try to use a direct syscall instead |
|
|
3476 | of calling the system-provided C<clock_gettime> function. This option |
|
|
3477 | exists because on GNU/Linux, C<clock_gettime> is in C<librt>, but C<librt> |
|
|
3478 | unconditionally pulls in C<libpthread>, slowing down single-threaded |
|
|
3479 | programs needlessly. Using a direct syscall is slightly slower (in |
|
|
3480 | theory), because no optimised vdso implementation can be used, but avoids |
|
|
3481 | the pthread dependency. Defaults to C<1> on GNU/Linux with glibc 2.x or |
|
|
3482 | higher, as it simplifies linking (no need for C<-lrt>). |
3180 | |
3483 | |
3181 | =item EV_USE_NANOSLEEP |
3484 | =item EV_USE_NANOSLEEP |
3182 | |
3485 | |
3183 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
3486 | 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 ()>. |
3487 | and will use it for delays. Otherwise it will use C<select ()>. |
… | |
… | |
3200 | |
3503 | |
3201 | =item EV_SELECT_USE_FD_SET |
3504 | =item EV_SELECT_USE_FD_SET |
3202 | |
3505 | |
3203 | If defined to C<1>, then the select backend will use the system C<fd_set> |
3506 | 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 |
3507 | 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 |
3508 | 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 |
3509 | 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 |
3510 | 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 |
3511 | only allows 64 sockets). The C<FD_SETSIZE> macro, set before compilation, |
3209 | influence the size of the C<fd_set> used. |
3512 | configures the maximum size of the C<fd_set>. |
3210 | |
3513 | |
3211 | =item EV_SELECT_IS_WINSOCKET |
3514 | =item EV_SELECT_IS_WINSOCKET |
3212 | |
3515 | |
3213 | When defined to C<1>, the select backend will assume that |
3516 | When defined to C<1>, the select backend will assume that |
3214 | select/socket/connect etc. don't understand file descriptors but |
3517 | select/socket/connect etc. don't understand file descriptors but |
… | |
… | |
3656 | way (note also that glib is the slowest event library known to man). |
3959 | way (note also that glib is the slowest event library known to man). |
3657 | |
3960 | |
3658 | There is no supported compilation method available on windows except |
3961 | There is no supported compilation method available on windows except |
3659 | embedding it into other applications. |
3962 | embedding it into other applications. |
3660 | |
3963 | |
|
|
3964 | Sensible signal handling is officially unsupported by Microsoft - libev |
|
|
3965 | tries its best, but under most conditions, signals will simply not work. |
|
|
3966 | |
3661 | Not a libev limitation but worth mentioning: windows apparently doesn't |
3967 | Not a libev limitation but worth mentioning: windows apparently doesn't |
3662 | accept large writes: instead of resulting in a partial write, windows will |
3968 | accept large writes: instead of resulting in a partial write, windows will |
3663 | either accept everything or return C<ENOBUFS> if the buffer is too large, |
3969 | either accept everything or return C<ENOBUFS> if the buffer is too large, |
3664 | so make sure you only write small amounts into your sockets (less than a |
3970 | so make sure you only write small amounts into your sockets (less than a |
3665 | megabyte seems safe, but this apparently depends on the amount of memory |
3971 | megabyte seems safe, but this apparently depends on the amount of memory |
… | |
… | |
3669 | the abysmal performance of winsockets, using a large number of sockets |
3975 | the abysmal performance of winsockets, using a large number of sockets |
3670 | is not recommended (and not reasonable). If your program needs to use |
3976 | is not recommended (and not reasonable). If your program needs to use |
3671 | more than a hundred or so sockets, then likely it needs to use a totally |
3977 | more than a hundred or so sockets, then likely it needs to use a totally |
3672 | different implementation for windows, as libev offers the POSIX readiness |
3978 | different implementation for windows, as libev offers the POSIX readiness |
3673 | notification model, which cannot be implemented efficiently on windows |
3979 | notification model, which cannot be implemented efficiently on windows |
3674 | (Microsoft monopoly games). |
3980 | (due to Microsoft monopoly games). |
3675 | |
3981 | |
3676 | A typical way to use libev under windows is to embed it (see the embedding |
3982 | A typical way to use libev under windows is to embed it (see the embedding |
3677 | section for details) and use the following F<evwrap.h> header file instead |
3983 | section for details) and use the following F<evwrap.h> header file instead |
3678 | of F<ev.h>: |
3984 | of F<ev.h>: |
3679 | |
3985 | |
… | |
… | |
3715 | |
4021 | |
3716 | Early versions of winsocket's select only supported waiting for a maximum |
4022 | Early versions of winsocket's select only supported waiting for a maximum |
3717 | of C<64> handles (probably owning to the fact that all windows kernels |
4023 | of C<64> handles (probably owning to the fact that all windows kernels |
3718 | can only wait for C<64> things at the same time internally; Microsoft |
4024 | can only wait for C<64> things at the same time internally; Microsoft |
3719 | recommends spawning a chain of threads and wait for 63 handles and the |
4025 | recommends spawning a chain of threads and wait for 63 handles and the |
3720 | previous thread in each. Great). |
4026 | previous thread in each. Sounds great!). |
3721 | |
4027 | |
3722 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
4028 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
3723 | to some high number (e.g. C<2048>) before compiling the winsocket select |
4029 | to some high number (e.g. C<2048>) before compiling the winsocket select |
3724 | call (which might be in libev or elsewhere, for example, perl does its own |
4030 | call (which might be in libev or elsewhere, for example, perl and many |
3725 | select emulation on windows). |
4031 | other interpreters do their own select emulation on windows). |
3726 | |
4032 | |
3727 | Another limit is the number of file descriptors in the Microsoft runtime |
4033 | Another limit is the number of file descriptors in the Microsoft runtime |
3728 | libraries, which by default is C<64> (there must be a hidden I<64> fetish |
4034 | libraries, which by default is C<64> (there must be a hidden I<64> |
3729 | or something like this inside Microsoft). You can increase this by calling |
4035 | fetish or something like this inside Microsoft). You can increase this |
3730 | C<_setmaxstdio>, which can increase this limit to C<2048> (another |
4036 | by calling C<_setmaxstdio>, which can increase this limit to C<2048> |
3731 | arbitrary limit), but is broken in many versions of the Microsoft runtime |
4037 | (another arbitrary limit), but is broken in many versions of the Microsoft |
3732 | libraries. |
|
|
3733 | |
|
|
3734 | This might get you to about C<512> or C<2048> sockets (depending on |
4038 | runtime libraries. This might get you to about C<512> or C<2048> sockets |
3735 | windows version and/or the phase of the moon). To get more, you need to |
4039 | (depending on windows version and/or the phase of the moon). To get more, |
3736 | wrap all I/O functions and provide your own fd management, but the cost of |
4040 | you need to wrap all I/O functions and provide your own fd management, but |
3737 | calling select (O(n²)) will likely make this unworkable. |
4041 | the cost of calling select (O(n²)) will likely make this unworkable. |
3738 | |
4042 | |
3739 | =back |
4043 | =back |
3740 | |
4044 | |
3741 | =head2 PORTABILITY REQUIREMENTS |
4045 | =head2 PORTABILITY REQUIREMENTS |
3742 | |
4046 | |
… | |
… | |
3785 | =item C<double> must hold a time value in seconds with enough accuracy |
4089 | =item C<double> must hold a time value in seconds with enough accuracy |
3786 | |
4090 | |
3787 | The type C<double> is used to represent timestamps. It is required to |
4091 | The type C<double> is used to represent timestamps. It is required to |
3788 | have at least 51 bits of mantissa (and 9 bits of exponent), which is good |
4092 | have at least 51 bits of mantissa (and 9 bits of exponent), which is good |
3789 | enough for at least into the year 4000. This requirement is fulfilled by |
4093 | enough for at least into the year 4000. This requirement is fulfilled by |
3790 | implementations implementing IEEE 754 (basically all existing ones). |
4094 | implementations implementing IEEE 754, which is basically all existing |
|
|
4095 | ones. With IEEE 754 doubles, you get microsecond accuracy until at least |
|
|
4096 | 2200. |
3791 | |
4097 | |
3792 | =back |
4098 | =back |
3793 | |
4099 | |
3794 | If you know of other additional requirements drop me a note. |
4100 | If you know of other additional requirements drop me a note. |
3795 | |
4101 | |
… | |
… | |
3863 | involves iterating over all running async watchers or all signal numbers. |
4169 | involves iterating over all running async watchers or all signal numbers. |
3864 | |
4170 | |
3865 | =back |
4171 | =back |
3866 | |
4172 | |
3867 | |
4173 | |
|
|
4174 | =head1 GLOSSARY |
|
|
4175 | |
|
|
4176 | =over 4 |
|
|
4177 | |
|
|
4178 | =item active |
|
|
4179 | |
|
|
4180 | A watcher is active as long as it has been started (has been attached to |
|
|
4181 | an event loop) but not yet stopped (disassociated from the event loop). |
|
|
4182 | |
|
|
4183 | =item application |
|
|
4184 | |
|
|
4185 | In this document, an application is whatever is using libev. |
|
|
4186 | |
|
|
4187 | =item callback |
|
|
4188 | |
|
|
4189 | The address of a function that is called when some event has been |
|
|
4190 | detected. Callbacks are being passed the event loop, the watcher that |
|
|
4191 | received the event, and the actual event bitset. |
|
|
4192 | |
|
|
4193 | =item callback invocation |
|
|
4194 | |
|
|
4195 | The act of calling the callback associated with a watcher. |
|
|
4196 | |
|
|
4197 | =item event |
|
|
4198 | |
|
|
4199 | A change of state of some external event, such as data now being available |
|
|
4200 | for reading on a file descriptor, time having passed or simply not having |
|
|
4201 | any other events happening anymore. |
|
|
4202 | |
|
|
4203 | In libev, events are represented as single bits (such as C<EV_READ> or |
|
|
4204 | C<EV_TIMEOUT>). |
|
|
4205 | |
|
|
4206 | =item event library |
|
|
4207 | |
|
|
4208 | A software package implementing an event model and loop. |
|
|
4209 | |
|
|
4210 | =item event loop |
|
|
4211 | |
|
|
4212 | An entity that handles and processes external events and converts them |
|
|
4213 | into callback invocations. |
|
|
4214 | |
|
|
4215 | =item event model |
|
|
4216 | |
|
|
4217 | The model used to describe how an event loop handles and processes |
|
|
4218 | watchers and events. |
|
|
4219 | |
|
|
4220 | =item pending |
|
|
4221 | |
|
|
4222 | A watcher is pending as soon as the corresponding event has been detected, |
|
|
4223 | and stops being pending as soon as the watcher will be invoked or its |
|
|
4224 | pending status is explicitly cleared by the application. |
|
|
4225 | |
|
|
4226 | A watcher can be pending, but not active. Stopping a watcher also clears |
|
|
4227 | its pending status. |
|
|
4228 | |
|
|
4229 | =item real time |
|
|
4230 | |
|
|
4231 | The physical time that is observed. It is apparently strictly monotonic :) |
|
|
4232 | |
|
|
4233 | =item wall-clock time |
|
|
4234 | |
|
|
4235 | The time and date as shown on clocks. Unlike real time, it can actually |
|
|
4236 | be wrong and jump forwards and backwards, e.g. when the you adjust your |
|
|
4237 | clock. |
|
|
4238 | |
|
|
4239 | =item watcher |
|
|
4240 | |
|
|
4241 | A data structure that describes interest in certain events. Watchers need |
|
|
4242 | to be started (attached to an event loop) before they can receive events. |
|
|
4243 | |
|
|
4244 | =item watcher invocation |
|
|
4245 | |
|
|
4246 | The act of calling the callback associated with a watcher. |
|
|
4247 | |
|
|
4248 | =back |
|
|
4249 | |
3868 | =head1 AUTHOR |
4250 | =head1 AUTHOR |
3869 | |
4251 | |
3870 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
4252 | Marc Lehmann <libev@schmorp.de>, with repeated corrections by Mikael Magnusson. |
3871 | |
4253 | |