… | |
… | |
63 | details of the event, and then hand it over to libev by I<starting> the |
63 | details of the event, and then hand it over to libev by I<starting> the |
64 | watcher. |
64 | watcher. |
65 | |
65 | |
66 | =head1 FEATURES |
66 | =head1 FEATURES |
67 | |
67 | |
68 | Libev supports C<select>, C<poll>, the linux-specific C<epoll>, the |
68 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
69 | bsd-specific C<kqueue> and the solaris-specific event port mechanisms |
69 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
70 | for file descriptor events (C<ev_io>), relative timers (C<ev_timer>), |
70 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
|
|
71 | (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers |
71 | absolute timers with customised rescheduling (C<ev_periodic>), synchronous |
72 | with customised rescheduling (C<ev_periodic>), synchronous signals |
72 | signals (C<ev_signal>), process status change events (C<ev_child>), and |
73 | (C<ev_signal>), process status change events (C<ev_child>), and event |
73 | event watchers dealing with the event loop mechanism itself (C<ev_idle>, |
74 | watchers dealing with the event loop mechanism itself (C<ev_idle>, |
74 | C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as |
75 | C<ev_embed>, C<ev_prepare> and C<ev_check> watchers) as well as |
75 | file watchers (C<ev_stat>) and even limited support for fork events |
76 | file watchers (C<ev_stat>) and even limited support for fork events |
76 | (C<ev_fork>). |
77 | (C<ev_fork>). |
77 | |
78 | |
78 | It also is quite fast (see this |
79 | It also is quite fast (see this |
… | |
… | |
162 | C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for |
163 | C<ev_embeddable_backends () & ev_supported_backends ()>, likewise for |
163 | recommended ones. |
164 | recommended ones. |
164 | |
165 | |
165 | See the description of C<ev_embed> watchers for more info. |
166 | See the description of C<ev_embed> watchers for more info. |
166 | |
167 | |
167 | =item ev_set_allocator (void *(*cb)(void *ptr, size_t size)) |
168 | =item ev_set_allocator (void *(*cb)(void *ptr, long size)) |
168 | |
169 | |
169 | Sets the allocation function to use (the prototype and semantics are |
170 | Sets the allocation function to use (the prototype is similar - the |
170 | identical to the realloc C function). It is used to allocate and free |
171 | semantics is identical - to the realloc C function). It is used to |
171 | memory (no surprises here). If it returns zero when memory needs to be |
172 | allocate and free memory (no surprises here). If it returns zero when |
172 | allocated, the library might abort or take some potentially destructive |
173 | memory needs to be allocated, the library might abort or take some |
173 | action. The default is your system realloc function. |
174 | potentially destructive action. The default is your system realloc |
|
|
175 | function. |
174 | |
176 | |
175 | You could override this function in high-availability programs to, say, |
177 | You could override this function in high-availability programs to, say, |
176 | free some memory if it cannot allocate memory, to use a special allocator, |
178 | free some memory if it cannot allocate memory, to use a special allocator, |
177 | or even to sleep a while and retry until some memory is available. |
179 | or even to sleep a while and retry until some memory is available. |
178 | |
180 | |
… | |
… | |
703 | events but its callback has not yet been invoked). As long as a watcher |
705 | events but its callback has not yet been invoked). As long as a watcher |
704 | is pending (but not active) you must not call an init function on it (but |
706 | is pending (but not active) you must not call an init function on it (but |
705 | C<ev_TYPE_set> is safe) and you must make sure the watcher is available to |
707 | C<ev_TYPE_set> is safe) and you must make sure the watcher is available to |
706 | libev (e.g. you cnanot C<free ()> it). |
708 | libev (e.g. you cnanot C<free ()> it). |
707 | |
709 | |
708 | =item callback = ev_cb (ev_TYPE *watcher) |
710 | =item callback ev_cb (ev_TYPE *watcher) |
709 | |
711 | |
710 | Returns the callback currently set on the watcher. |
712 | Returns the callback currently set on the watcher. |
711 | |
713 | |
712 | =item ev_cb_set (ev_TYPE *watcher, callback) |
714 | =item ev_cb_set (ev_TYPE *watcher, callback) |
713 | |
715 | |
… | |
… | |
741 | { |
743 | { |
742 | struct my_io *w = (struct my_io *)w_; |
744 | struct my_io *w = (struct my_io *)w_; |
743 | ... |
745 | ... |
744 | } |
746 | } |
745 | |
747 | |
746 | More interesting and less C-conformant ways of catsing your callback type |
748 | More interesting and less C-conformant ways of casting your callback type |
747 | have been omitted.... |
749 | instead have been omitted. |
|
|
750 | |
|
|
751 | Another common scenario is having some data structure with multiple |
|
|
752 | watchers: |
|
|
753 | |
|
|
754 | struct my_biggy |
|
|
755 | { |
|
|
756 | int some_data; |
|
|
757 | ev_timer t1; |
|
|
758 | ev_timer t2; |
|
|
759 | } |
|
|
760 | |
|
|
761 | In this case getting the pointer to C<my_biggy> is a bit more complicated, |
|
|
762 | you need to use C<offsetof>: |
|
|
763 | |
|
|
764 | #include <stddef.h> |
|
|
765 | |
|
|
766 | static void |
|
|
767 | t1_cb (EV_P_ struct ev_timer *w, int revents) |
|
|
768 | { |
|
|
769 | struct my_biggy big = (struct my_biggy * |
|
|
770 | (((char *)w) - offsetof (struct my_biggy, t1)); |
|
|
771 | } |
|
|
772 | |
|
|
773 | static void |
|
|
774 | t2_cb (EV_P_ struct ev_timer *w, int revents) |
|
|
775 | { |
|
|
776 | struct my_biggy big = (struct my_biggy * |
|
|
777 | (((char *)w) - offsetof (struct my_biggy, t2)); |
|
|
778 | } |
748 | |
779 | |
749 | |
780 | |
750 | =head1 WATCHER TYPES |
781 | =head1 WATCHER TYPES |
751 | |
782 | |
752 | This section describes each watcher in detail, but will not repeat |
783 | This section describes each watcher in detail, but will not repeat |
… | |
… | |
885 | =item ev_timer_again (loop) |
916 | =item ev_timer_again (loop) |
886 | |
917 | |
887 | This will act as if the timer timed out and restart it again if it is |
918 | This will act as if the timer timed out and restart it again if it is |
888 | repeating. The exact semantics are: |
919 | repeating. The exact semantics are: |
889 | |
920 | |
|
|
921 | If the timer is pending, its pending status is cleared. |
|
|
922 | |
890 | If the timer is started but nonrepeating, stop it. |
923 | If the timer is started but nonrepeating, stop it (as if it timed out). |
891 | |
924 | |
892 | If the timer is repeating, either start it if necessary (with the repeat |
925 | If the timer is repeating, either start it if necessary (with the |
893 | value), or reset the running timer to the repeat value. |
926 | C<repeat> value), or reset the running timer to the C<repeat> value. |
894 | |
927 | |
895 | This sounds a bit complicated, but here is a useful and typical |
928 | This sounds a bit complicated, but here is a useful and typical |
896 | example: Imagine you have a tcp connection and you want a so-called |
929 | example: Imagine you have a tcp connection and you want a so-called idle |
897 | idle timeout, that is, you want to be called when there have been, |
930 | timeout, that is, you want to be called when there have been, say, 60 |
898 | say, 60 seconds of inactivity on the socket. The easiest way to do |
931 | seconds of inactivity on the socket. The easiest way to do this is to |
899 | this is to configure an C<ev_timer> with C<after>=C<repeat>=C<60> and calling |
932 | configure an C<ev_timer> with a C<repeat> value of C<60> and then call |
900 | C<ev_timer_again> each time you successfully read or write some data. If |
933 | C<ev_timer_again> each time you successfully read or write some data. If |
901 | you go into an idle state where you do not expect data to travel on the |
934 | you go into an idle state where you do not expect data to travel on the |
902 | socket, you can stop the timer, and again will automatically restart it if |
935 | socket, you can C<ev_timer_stop> the timer, and C<ev_timer_again> will |
903 | need be. |
936 | automatically restart it if need be. |
904 | |
937 | |
905 | You can also ignore the C<after> value and C<ev_timer_start> altogether |
938 | That means you can ignore the C<after> value and C<ev_timer_start> |
906 | and only ever use the C<repeat> value: |
939 | altogether and only ever use the C<repeat> value and C<ev_timer_again>: |
907 | |
940 | |
908 | ev_timer_init (timer, callback, 0., 5.); |
941 | ev_timer_init (timer, callback, 0., 5.); |
909 | ev_timer_again (loop, timer); |
942 | ev_timer_again (loop, timer); |
910 | ... |
943 | ... |
911 | timer->again = 17.; |
944 | timer->again = 17.; |
912 | ev_timer_again (loop, timer); |
945 | ev_timer_again (loop, timer); |
913 | ... |
946 | ... |
914 | timer->again = 10.; |
947 | timer->again = 10.; |
915 | ev_timer_again (loop, timer); |
948 | ev_timer_again (loop, timer); |
916 | |
949 | |
917 | This is more efficient then stopping/starting the timer eahc time you want |
950 | This is more slightly efficient then stopping/starting the timer each time |
918 | to modify its timeout value. |
951 | you want to modify its timeout value. |
919 | |
952 | |
920 | =item ev_tstamp repeat [read-write] |
953 | =item ev_tstamp repeat [read-write] |
921 | |
954 | |
922 | The current C<repeat> value. Will be used each time the watcher times out |
955 | The current C<repeat> value. Will be used each time the watcher times out |
923 | or C<ev_timer_again> is called and determines the next timeout (if any), |
956 | or C<ev_timer_again> is called and determines the next timeout (if any), |
… | |
… | |
1192 | not exist" is a status change like any other. The condition "path does |
1225 | not exist" is a status change like any other. The condition "path does |
1193 | not exist" is signified by the C<st_nlink> field being zero (which is |
1226 | not exist" is signified by the C<st_nlink> field being zero (which is |
1194 | otherwise always forced to be at least one) and all the other fields of |
1227 | otherwise always forced to be at least one) and all the other fields of |
1195 | the stat buffer having unspecified contents. |
1228 | the stat buffer having unspecified contents. |
1196 | |
1229 | |
|
|
1230 | The path I<should> be absolute and I<must not> end in a slash. If it is |
|
|
1231 | relative and your working directory changes, the behaviour is undefined. |
|
|
1232 | |
1197 | Since there is no standard to do this, the portable implementation simply |
1233 | Since there is no standard to do this, the portable implementation simply |
1198 | calls C<stat (2)> regulalry on the path to see if it changed somehow. You |
1234 | calls C<stat (2)> regularly on the path to see if it changed somehow. You |
1199 | can specify a recommended polling interval for this case. If you specify |
1235 | can specify a recommended polling interval for this case. If you specify |
1200 | a polling interval of C<0> (highly recommended!) then a I<suitable, |
1236 | a polling interval of C<0> (highly recommended!) then a I<suitable, |
1201 | unspecified default> value will be used (which you can expect to be around |
1237 | unspecified default> value will be used (which you can expect to be around |
1202 | five seconds, although this might change dynamically). Libev will also |
1238 | five seconds, although this might change dynamically). Libev will also |
1203 | impose a minimum interval which is currently around C<0.1>, but thats |
1239 | impose a minimum interval which is currently around C<0.1>, but thats |
… | |
… | |
1205 | |
1241 | |
1206 | This watcher type is not meant for massive numbers of stat watchers, |
1242 | This watcher type is not meant for massive numbers of stat watchers, |
1207 | as even with OS-supported change notifications, this can be |
1243 | as even with OS-supported change notifications, this can be |
1208 | resource-intensive. |
1244 | resource-intensive. |
1209 | |
1245 | |
1210 | At the time of this writing, no specific OS backends are implemented, but |
1246 | At the time of this writing, only the Linux inotify interface is |
1211 | if demand increases, at least a kqueue and inotify backend will be added. |
1247 | implemented (implementing kqueue support is left as an exercise for the |
|
|
1248 | reader). Inotify will be used to give hints only and should not change the |
|
|
1249 | semantics of C<ev_stat> watchers, which means that libev sometimes needs |
|
|
1250 | to fall back to regular polling again even with inotify, but changes are |
|
|
1251 | usually detected immediately, and if the file exists there will be no |
|
|
1252 | polling. |
1212 | |
1253 | |
1213 | =over 4 |
1254 | =over 4 |
1214 | |
1255 | |
1215 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
1256 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
1216 | |
1257 | |
… | |
… | |
1985 | |
2026 | |
1986 | =item EV_USE_DEVPOLL |
2027 | =item EV_USE_DEVPOLL |
1987 | |
2028 | |
1988 | reserved for future expansion, works like the USE symbols above. |
2029 | reserved for future expansion, works like the USE symbols above. |
1989 | |
2030 | |
|
|
2031 | =item EV_USE_INOTIFY |
|
|
2032 | |
|
|
2033 | If defined to be C<1>, libev will compile in support for the Linux inotify |
|
|
2034 | interface to speed up C<ev_stat> watchers. Its actual availability will |
|
|
2035 | be detected at runtime. |
|
|
2036 | |
1990 | =item EV_H |
2037 | =item EV_H |
1991 | |
2038 | |
1992 | The name of the F<ev.h> header file used to include it. The default if |
2039 | The name of the F<ev.h> header file used to include it. The default if |
1993 | undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This |
2040 | undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This |
1994 | can be used to virtually rename the F<ev.h> header file in case of conflicts. |
2041 | can be used to virtually rename the F<ev.h> header file in case of conflicts. |
… | |
… | |
2049 | =item EV_PID_HASHSIZE |
2096 | =item EV_PID_HASHSIZE |
2050 | |
2097 | |
2051 | C<ev_child> watchers use a small hash table to distribute workload by |
2098 | C<ev_child> watchers use a small hash table to distribute workload by |
2052 | pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more |
2099 | pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more |
2053 | than enough. If you need to manage thousands of children you might want to |
2100 | than enough. If you need to manage thousands of children you might want to |
2054 | increase this value. |
2101 | increase this value (I<must> be a power of two). |
|
|
2102 | |
|
|
2103 | =item EV_INOTIFY_HASHSIZE |
|
|
2104 | |
|
|
2105 | C<ev_staz> watchers use a small hash table to distribute workload by |
|
|
2106 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
|
|
2107 | usually more than enough. If you need to manage thousands of C<ev_stat> |
|
|
2108 | watchers you might want to increase this value (I<must> be a power of |
|
|
2109 | two). |
2055 | |
2110 | |
2056 | =item EV_COMMON |
2111 | =item EV_COMMON |
2057 | |
2112 | |
2058 | By default, all watchers have a C<void *data> member. By redefining |
2113 | By default, all watchers have a C<void *data> member. By redefining |
2059 | this macro to a something else you can include more and other types of |
2114 | this macro to a something else you can include more and other types of |
… | |
… | |
2119 | |
2174 | |
2120 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
2175 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
2121 | |
2176 | |
2122 | =item Stopping check/prepare/idle watchers: O(1) |
2177 | =item Stopping check/prepare/idle watchers: O(1) |
2123 | |
2178 | |
2124 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % 16)) |
2179 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2125 | |
2180 | |
2126 | =item Finding the next timer per loop iteration: O(1) |
2181 | =item Finding the next timer per loop iteration: O(1) |
2127 | |
2182 | |
2128 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2183 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2129 | |
2184 | |