… | |
… | |
4 | |
4 | |
5 | =head1 SYNOPSIS |
5 | =head1 SYNOPSIS |
6 | |
6 | |
7 | #include <ev.h> |
7 | #include <ev.h> |
8 | |
8 | |
9 | =head1 EXAMPLE PROGRAM |
9 | =head2 EXAMPLE PROGRAM |
10 | |
10 | |
|
|
11 | // a single header file is required |
11 | #include <ev.h> |
12 | #include <ev.h> |
12 | |
13 | |
|
|
14 | // every watcher type has its own typedef'd struct |
|
|
15 | // with the name ev_<type> |
13 | ev_io stdin_watcher; |
16 | ev_io stdin_watcher; |
14 | ev_timer timeout_watcher; |
17 | ev_timer timeout_watcher; |
15 | |
18 | |
|
|
19 | // all watcher callbacks have a similar signature |
16 | /* called when data readable on stdin */ |
20 | // this callback is called when data is readable on stdin |
17 | static void |
21 | static void |
18 | stdin_cb (EV_P_ struct ev_io *w, int revents) |
22 | stdin_cb (EV_P_ struct ev_io *w, int revents) |
19 | { |
23 | { |
20 | /* puts ("stdin ready"); */ |
24 | puts ("stdin ready"); |
21 | ev_io_stop (EV_A_ w); /* just a syntax example */ |
25 | // for one-shot events, one must manually stop the watcher |
22 | ev_unloop (EV_A_ EVUNLOOP_ALL); /* leave all loop calls */ |
26 | // with its corresponding stop function. |
|
|
27 | ev_io_stop (EV_A_ w); |
|
|
28 | |
|
|
29 | // this causes all nested ev_loop's to stop iterating |
|
|
30 | ev_unloop (EV_A_ EVUNLOOP_ALL); |
23 | } |
31 | } |
24 | |
32 | |
|
|
33 | // another callback, this time for a time-out |
25 | static void |
34 | static void |
26 | timeout_cb (EV_P_ struct ev_timer *w, int revents) |
35 | timeout_cb (EV_P_ struct ev_timer *w, int revents) |
27 | { |
36 | { |
28 | /* puts ("timeout"); */ |
37 | puts ("timeout"); |
29 | ev_unloop (EV_A_ EVUNLOOP_ONE); /* leave one loop call */ |
38 | // this causes the innermost ev_loop to stop iterating |
|
|
39 | ev_unloop (EV_A_ EVUNLOOP_ONE); |
30 | } |
40 | } |
31 | |
41 | |
32 | int |
42 | int |
33 | main (void) |
43 | main (void) |
34 | { |
44 | { |
|
|
45 | // use the default event loop unless you have special needs |
35 | struct ev_loop *loop = ev_default_loop (0); |
46 | struct ev_loop *loop = ev_default_loop (0); |
36 | |
47 | |
37 | /* initialise an io watcher, then start it */ |
48 | // initialise an io watcher, then start it |
|
|
49 | // this one will watch for stdin to become readable |
38 | ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); |
50 | ev_io_init (&stdin_watcher, stdin_cb, /*STDIN_FILENO*/ 0, EV_READ); |
39 | ev_io_start (loop, &stdin_watcher); |
51 | ev_io_start (loop, &stdin_watcher); |
40 | |
52 | |
|
|
53 | // initialise a timer watcher, then start it |
41 | /* simple non-repeating 5.5 second timeout */ |
54 | // simple non-repeating 5.5 second timeout |
42 | ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); |
55 | ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); |
43 | ev_timer_start (loop, &timeout_watcher); |
56 | ev_timer_start (loop, &timeout_watcher); |
44 | |
57 | |
45 | /* loop till timeout or data ready */ |
58 | // now wait for events to arrive |
46 | ev_loop (loop, 0); |
59 | ev_loop (loop, 0); |
47 | |
60 | |
|
|
61 | // unloop was called, so exit |
48 | return 0; |
62 | return 0; |
49 | } |
63 | } |
50 | |
64 | |
51 | =head1 DESCRIPTION |
65 | =head1 DESCRIPTION |
52 | |
66 | |
53 | The newest version of this document is also available as a html-formatted |
67 | The newest version of this document is also available as an html-formatted |
54 | web page you might find easier to navigate when reading it for the first |
68 | web page you might find easier to navigate when reading it for the first |
55 | time: L<http://cvs.schmorp.de/libev/ev.html>. |
69 | time: L<http://cvs.schmorp.de/libev/ev.html>. |
56 | |
70 | |
57 | Libev is an event loop: you register interest in certain events (such as a |
71 | Libev is an event loop: you register interest in certain events (such as a |
58 | file descriptor being readable or a timeout occurring), and it will manage |
72 | file descriptor being readable or a timeout occurring), and it will manage |
… | |
… | |
65 | You register interest in certain events by registering so-called I<event |
79 | You register interest in certain events by registering so-called I<event |
66 | watchers>, which are relatively small C structures you initialise with the |
80 | watchers>, which are relatively small C structures you initialise with the |
67 | details of the event, and then hand it over to libev by I<starting> the |
81 | details of the event, and then hand it over to libev by I<starting> the |
68 | watcher. |
82 | watcher. |
69 | |
83 | |
70 | =head1 FEATURES |
84 | =head2 FEATURES |
71 | |
85 | |
72 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
86 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
73 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
87 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
74 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
88 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
75 | (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers |
89 | (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers |
… | |
… | |
82 | |
96 | |
83 | It also is quite fast (see this |
97 | It also is quite fast (see this |
84 | L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent |
98 | L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent |
85 | for example). |
99 | for example). |
86 | |
100 | |
87 | =head1 CONVENTIONS |
101 | =head2 CONVENTIONS |
88 | |
102 | |
89 | Libev is very configurable. In this manual the default configuration will |
103 | Libev is very configurable. In this manual the default (and most common) |
90 | be described, which supports multiple event loops. For more info about |
104 | configuration will be described, which supports multiple event loops. For |
91 | various configuration options please have a look at B<EMBED> section in |
105 | more info about various configuration options please have a look at |
92 | this manual. If libev was configured without support for multiple event |
106 | B<EMBED> section in this manual. If libev was configured without support |
93 | loops, then all functions taking an initial argument of name C<loop> |
107 | for multiple event loops, then all functions taking an initial argument of |
94 | (which is always of type C<struct ev_loop *>) will not have this argument. |
108 | name C<loop> (which is always of type C<struct ev_loop *>) will not have |
|
|
109 | this argument. |
95 | |
110 | |
96 | =head1 TIME REPRESENTATION |
111 | =head2 TIME REPRESENTATION |
97 | |
112 | |
98 | Libev represents time as a single floating point number, representing the |
113 | Libev represents time as a single floating point number, representing the |
99 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
114 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
100 | the beginning of 1970, details are complicated, don't ask). This type is |
115 | the beginning of 1970, details are complicated, don't ask). This type is |
101 | called C<ev_tstamp>, which is what you should use too. It usually aliases |
116 | called C<ev_tstamp>, which is what you should use too. It usually aliases |
… | |
… | |
181 | See the description of C<ev_embed> watchers for more info. |
196 | See the description of C<ev_embed> watchers for more info. |
182 | |
197 | |
183 | =item ev_set_allocator (void *(*cb)(void *ptr, long size)) |
198 | =item ev_set_allocator (void *(*cb)(void *ptr, long size)) |
184 | |
199 | |
185 | Sets the allocation function to use (the prototype is similar - the |
200 | Sets the allocation function to use (the prototype is similar - the |
186 | semantics is identical - to the realloc C function). It is used to |
201 | semantics are identical to the C<realloc> C89/SuS/POSIX function). It is |
187 | allocate and free memory (no surprises here). If it returns zero when |
202 | used to allocate and free memory (no surprises here). If it returns zero |
188 | memory needs to be allocated, the library might abort or take some |
203 | when memory needs to be allocated (C<size != 0>), the library might abort |
189 | potentially destructive action. The default is your system realloc |
204 | or take some potentially destructive action. |
190 | function. |
205 | |
|
|
206 | Since some systems (at least OpenBSD and Darwin) fail to implement |
|
|
207 | correct C<realloc> semantics, libev will use a wrapper around the system |
|
|
208 | C<realloc> and C<free> functions by default. |
191 | |
209 | |
192 | You could override this function in high-availability programs to, say, |
210 | You could override this function in high-availability programs to, say, |
193 | free some memory if it cannot allocate memory, to use a special allocator, |
211 | free some memory if it cannot allocate memory, to use a special allocator, |
194 | or even to sleep a while and retry until some memory is available. |
212 | or even to sleep a while and retry until some memory is available. |
195 | |
213 | |
196 | Example: Replace the libev allocator with one that waits a bit and then |
214 | Example: Replace the libev allocator with one that waits a bit and then |
197 | retries). |
215 | retries (example requires a standards-compliant C<realloc>). |
198 | |
216 | |
199 | static void * |
217 | static void * |
200 | persistent_realloc (void *ptr, size_t size) |
218 | persistent_realloc (void *ptr, size_t size) |
201 | { |
219 | { |
202 | for (;;) |
220 | for (;;) |
… | |
… | |
241 | |
259 | |
242 | An event loop is described by a C<struct ev_loop *>. The library knows two |
260 | An event loop is described by a C<struct ev_loop *>. The library knows two |
243 | types of such loops, the I<default> loop, which supports signals and child |
261 | types of such loops, the I<default> loop, which supports signals and child |
244 | events, and dynamically created loops which do not. |
262 | events, and dynamically created loops which do not. |
245 | |
263 | |
246 | If you use threads, a common model is to run the default event loop |
|
|
247 | in your main thread (or in a separate thread) and for each thread you |
|
|
248 | create, you also create another event loop. Libev itself does no locking |
|
|
249 | whatsoever, so if you mix calls to the same event loop in different |
|
|
250 | threads, make sure you lock (this is usually a bad idea, though, even if |
|
|
251 | done correctly, because it's hideous and inefficient). |
|
|
252 | |
|
|
253 | =over 4 |
264 | =over 4 |
254 | |
265 | |
255 | =item struct ev_loop *ev_default_loop (unsigned int flags) |
266 | =item struct ev_loop *ev_default_loop (unsigned int flags) |
256 | |
267 | |
257 | This will initialise the default event loop if it hasn't been initialised |
268 | This will initialise the default event loop if it hasn't been initialised |
… | |
… | |
259 | false. If it already was initialised it simply returns it (and ignores the |
270 | false. If it already was initialised it simply returns it (and ignores the |
260 | flags. If that is troubling you, check C<ev_backend ()> afterwards). |
271 | flags. If that is troubling you, check C<ev_backend ()> afterwards). |
261 | |
272 | |
262 | If you don't know what event loop to use, use the one returned from this |
273 | If you don't know what event loop to use, use the one returned from this |
263 | function. |
274 | function. |
|
|
275 | |
|
|
276 | Note that this function is I<not> thread-safe, so if you want to use it |
|
|
277 | from multiple threads, you have to lock (note also that this is unlikely, |
|
|
278 | as loops cannot bes hared easily between threads anyway). |
|
|
279 | |
|
|
280 | The default loop is the only loop that can handle C<ev_signal> and |
|
|
281 | C<ev_child> watchers, and to do this, it always registers a handler |
|
|
282 | for C<SIGCHLD>. If this is a problem for your app you can either |
|
|
283 | create a dynamic loop with C<ev_loop_new> that doesn't do that, or you |
|
|
284 | can simply overwrite the C<SIGCHLD> signal handler I<after> calling |
|
|
285 | C<ev_default_init>. |
264 | |
286 | |
265 | The flags argument can be used to specify special behaviour or specific |
287 | The flags argument can be used to specify special behaviour or specific |
266 | backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). |
288 | backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). |
267 | |
289 | |
268 | The following flags are supported: |
290 | The following flags are supported: |
… | |
… | |
290 | enabling this flag. |
312 | enabling this flag. |
291 | |
313 | |
292 | This works by calling C<getpid ()> on every iteration of the loop, |
314 | This works by calling C<getpid ()> on every iteration of the loop, |
293 | and thus this might slow down your event loop if you do a lot of loop |
315 | and thus this might slow down your event loop if you do a lot of loop |
294 | iterations and little real work, but is usually not noticeable (on my |
316 | iterations and little real work, but is usually not noticeable (on my |
295 | Linux system for example, C<getpid> is actually a simple 5-insn sequence |
317 | GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence |
296 | without a syscall and thus I<very> fast, but my Linux system also has |
318 | without a syscall and thus I<very> fast, but my GNU/Linux system also has |
297 | C<pthread_atfork> which is even faster). |
319 | C<pthread_atfork> which is even faster). |
298 | |
320 | |
299 | The big advantage of this flag is that you can forget about fork (and |
321 | The big advantage of this flag is that you can forget about fork (and |
300 | forget about forgetting to tell libev about forking) when you use this |
322 | forget about forgetting to tell libev about forking) when you use this |
301 | flag. |
323 | flag. |
… | |
… | |
306 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
328 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
307 | |
329 | |
308 | This is your standard select(2) backend. Not I<completely> standard, as |
330 | This is your standard select(2) backend. Not I<completely> standard, as |
309 | libev tries to roll its own fd_set with no limits on the number of fds, |
331 | libev tries to roll its own fd_set with no limits on the number of fds, |
310 | but if that fails, expect a fairly low limit on the number of fds when |
332 | but if that fails, expect a fairly low limit on the number of fds when |
311 | using this backend. It doesn't scale too well (O(highest_fd)), but its usually |
333 | using this backend. It doesn't scale too well (O(highest_fd)), but its |
312 | the fastest backend for a low number of fds. |
334 | usually the fastest backend for a low number of (low-numbered :) fds. |
|
|
335 | |
|
|
336 | To get good performance out of this backend you need a high amount of |
|
|
337 | parallelity (most of the file descriptors should be busy). If you are |
|
|
338 | writing a server, you should C<accept ()> in a loop to accept as many |
|
|
339 | connections as possible during one iteration. You might also want to have |
|
|
340 | a look at C<ev_set_io_collect_interval ()> to increase the amount of |
|
|
341 | readyness notifications you get per iteration. |
313 | |
342 | |
314 | =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) |
343 | =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) |
315 | |
344 | |
316 | And this is your standard poll(2) backend. It's more complicated than |
345 | And this is your standard poll(2) backend. It's more complicated |
317 | select, but handles sparse fds better and has no artificial limit on the |
346 | than select, but handles sparse fds better and has no artificial |
318 | number of fds you can use (except it will slow down considerably with a |
347 | limit on the number of fds you can use (except it will slow down |
319 | lot of inactive fds). It scales similarly to select, i.e. O(total_fds). |
348 | considerably with a lot of inactive fds). It scales similarly to select, |
|
|
349 | i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for |
|
|
350 | performance tips. |
320 | |
351 | |
321 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
352 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
322 | |
353 | |
323 | For few fds, this backend is a bit little slower than poll and select, |
354 | For few fds, this backend is a bit little slower than poll and select, |
324 | but it scales phenomenally better. While poll and select usually scale |
355 | but it scales phenomenally better. While poll and select usually scale |
325 | like O(total_fds) where n is the total number of fds (or the highest fd), |
356 | like O(total_fds) where n is the total number of fds (or the highest fd), |
326 | epoll scales either O(1) or O(active_fds). The epoll design has a number |
357 | epoll scales either O(1) or O(active_fds). The epoll design has a number |
327 | of shortcomings, such as silently dropping events in some hard-to-detect |
358 | of shortcomings, such as silently dropping events in some hard-to-detect |
328 | cases and rewiring a syscall per fd change, no fork support and bad |
359 | cases and requiring a syscall per fd change, no fork support and bad |
329 | support for dup: |
360 | support for dup. |
330 | |
361 | |
331 | While stopping, setting and starting an I/O watcher in the same iteration |
362 | While stopping, setting and starting an I/O watcher in the same iteration |
332 | will result in some caching, there is still a syscall per such incident |
363 | will result in some caching, there is still a syscall per such incident |
333 | (because the fd could point to a different file description now), so its |
364 | (because the fd could point to a different file description now), so its |
334 | best to avoid that. Also, C<dup ()>'ed file descriptors might not work |
365 | best to avoid that. Also, C<dup ()>'ed file descriptors might not work |
335 | very well if you register events for both fds. |
366 | very well if you register events for both fds. |
336 | |
367 | |
337 | Please note that epoll sometimes generates spurious notifications, so you |
368 | Please note that epoll sometimes generates spurious notifications, so you |
338 | need to use non-blocking I/O or other means to avoid blocking when no data |
369 | need to use non-blocking I/O or other means to avoid blocking when no data |
339 | (or space) is available. |
370 | (or space) is available. |
|
|
371 | |
|
|
372 | Best performance from this backend is achieved by not unregistering all |
|
|
373 | watchers for a file descriptor until it has been closed, if possible, i.e. |
|
|
374 | keep at least one watcher active per fd at all times. |
|
|
375 | |
|
|
376 | While nominally embeddeble in other event loops, this feature is broken in |
|
|
377 | all kernel versions tested so far. |
340 | |
378 | |
341 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
379 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
342 | |
380 | |
343 | Kqueue deserves special mention, as at the time of this writing, it |
381 | Kqueue deserves special mention, as at the time of this writing, it |
344 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
382 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
… | |
… | |
357 | course). While stopping, setting and starting an I/O watcher does never |
395 | course). While stopping, setting and starting an I/O watcher does never |
358 | cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to |
396 | cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to |
359 | two event changes per incident, support for C<fork ()> is very bad and it |
397 | two event changes per incident, support for C<fork ()> is very bad and it |
360 | drops fds silently in similarly hard-to-detect cases. |
398 | drops fds silently in similarly hard-to-detect cases. |
361 | |
399 | |
|
|
400 | This backend usually performs well under most conditions. |
|
|
401 | |
|
|
402 | While nominally embeddable in other event loops, this doesn't work |
|
|
403 | everywhere, so you might need to test for this. And since it is broken |
|
|
404 | almost everywhere, you should only use it when you have a lot of sockets |
|
|
405 | (for which it usually works), by embedding it into another event loop |
|
|
406 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for |
|
|
407 | sockets. |
|
|
408 | |
362 | =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) |
409 | =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) |
363 | |
410 | |
364 | This is not implemented yet (and might never be). |
411 | This is not implemented yet (and might never be, unless you send me an |
|
|
412 | implementation). According to reports, C</dev/poll> only supports sockets |
|
|
413 | and is not embeddable, which would limit the usefulness of this backend |
|
|
414 | immensely. |
365 | |
415 | |
366 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
416 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
367 | |
417 | |
368 | This uses the Solaris 10 event port mechanism. As with everything on Solaris, |
418 | This uses the Solaris 10 event port mechanism. As with everything on Solaris, |
369 | it's really slow, but it still scales very well (O(active_fds)). |
419 | it's really slow, but it still scales very well (O(active_fds)). |
370 | |
420 | |
371 | Please note that solaris event ports can deliver a lot of spurious |
421 | Please note that solaris event ports can deliver a lot of spurious |
372 | notifications, so you need to use non-blocking I/O or other means to avoid |
422 | notifications, so you need to use non-blocking I/O or other means to avoid |
373 | blocking when no data (or space) is available. |
423 | blocking when no data (or space) is available. |
374 | |
424 | |
|
|
425 | While this backend scales well, it requires one system call per active |
|
|
426 | file descriptor per loop iteration. For small and medium numbers of file |
|
|
427 | descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend |
|
|
428 | might perform better. |
|
|
429 | |
|
|
430 | On the positive side, ignoring the spurious readyness notifications, this |
|
|
431 | backend actually performed to specification in all tests and is fully |
|
|
432 | embeddable, which is a rare feat among the OS-specific backends. |
|
|
433 | |
375 | =item C<EVBACKEND_ALL> |
434 | =item C<EVBACKEND_ALL> |
376 | |
435 | |
377 | Try all backends (even potentially broken ones that wouldn't be tried |
436 | Try all backends (even potentially broken ones that wouldn't be tried |
378 | with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as |
437 | with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as |
379 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
438 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
380 | |
439 | |
|
|
440 | It is definitely not recommended to use this flag. |
|
|
441 | |
381 | =back |
442 | =back |
382 | |
443 | |
383 | If one or more of these are ored into the flags value, then only these |
444 | If one or more of these are ored into the flags value, then only these |
384 | backends will be tried (in the reverse order as given here). If none are |
445 | backends will be tried (in the reverse order as listed here). If none are |
385 | specified, most compiled-in backend will be tried, usually in reverse |
446 | specified, all backends in C<ev_recommended_backends ()> will be tried. |
386 | order of their flag values :) |
|
|
387 | |
447 | |
388 | The most typical usage is like this: |
448 | The most typical usage is like this: |
389 | |
449 | |
390 | if (!ev_default_loop (0)) |
450 | if (!ev_default_loop (0)) |
391 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
451 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
… | |
… | |
405 | |
465 | |
406 | Similar to C<ev_default_loop>, but always creates a new event loop that is |
466 | Similar to C<ev_default_loop>, but always creates a new event loop that is |
407 | always distinct from the default loop. Unlike the default loop, it cannot |
467 | always distinct from the default loop. Unlike the default loop, it cannot |
408 | handle signal and child watchers, and attempts to do so will be greeted by |
468 | handle signal and child watchers, and attempts to do so will be greeted by |
409 | undefined behaviour (or a failed assertion if assertions are enabled). |
469 | undefined behaviour (or a failed assertion if assertions are enabled). |
|
|
470 | |
|
|
471 | Note that this function I<is> thread-safe, and the recommended way to use |
|
|
472 | libev with threads is indeed to create one loop per thread, and using the |
|
|
473 | default loop in the "main" or "initial" thread. |
410 | |
474 | |
411 | Example: Try to create a event loop that uses epoll and nothing else. |
475 | Example: Try to create a event loop that uses epoll and nothing else. |
412 | |
476 | |
413 | struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); |
477 | struct ev_loop *epoller = ev_loop_new (EVBACKEND_EPOLL | EVFLAG_NOENV); |
414 | if (!epoller) |
478 | if (!epoller) |
… | |
… | |
438 | Like C<ev_default_destroy>, but destroys an event loop created by an |
502 | Like C<ev_default_destroy>, but destroys an event loop created by an |
439 | earlier call to C<ev_loop_new>. |
503 | earlier call to C<ev_loop_new>. |
440 | |
504 | |
441 | =item ev_default_fork () |
505 | =item ev_default_fork () |
442 | |
506 | |
|
|
507 | This function sets a flag that causes subsequent C<ev_loop> iterations |
443 | This function reinitialises the kernel state for backends that have |
508 | to reinitialise the kernel state for backends that have one. Despite the |
444 | one. Despite the name, you can call it anytime, but it makes most sense |
509 | name, you can call it anytime, but it makes most sense after forking, in |
445 | after forking, in either the parent or child process (or both, but that |
510 | the child process (or both child and parent, but that again makes little |
446 | again makes little sense). |
511 | sense). You I<must> call it in the child before using any of the libev |
|
|
512 | functions, and it will only take effect at the next C<ev_loop> iteration. |
447 | |
513 | |
448 | You I<must> call this function in the child process after forking if and |
514 | On the other hand, you only need to call this function in the child |
449 | only if you want to use the event library in both processes. If you just |
515 | process if and only if you want to use the event library in the child. If |
450 | fork+exec, you don't have to call it. |
516 | you just fork+exec, you don't have to call it at all. |
451 | |
517 | |
452 | The function itself is quite fast and it's usually not a problem to call |
518 | The function itself is quite fast and it's usually not a problem to call |
453 | it just in case after a fork. To make this easy, the function will fit in |
519 | it just in case after a fork. To make this easy, the function will fit in |
454 | quite nicely into a call to C<pthread_atfork>: |
520 | quite nicely into a call to C<pthread_atfork>: |
455 | |
521 | |
456 | pthread_atfork (0, 0, ev_default_fork); |
522 | pthread_atfork (0, 0, ev_default_fork); |
457 | |
523 | |
458 | At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use |
|
|
459 | without calling this function, so if you force one of those backends you |
|
|
460 | do not need to care. |
|
|
461 | |
|
|
462 | =item ev_loop_fork (loop) |
524 | =item ev_loop_fork (loop) |
463 | |
525 | |
464 | Like C<ev_default_fork>, but acts on an event loop created by |
526 | Like C<ev_default_fork>, but acts on an event loop created by |
465 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
527 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
466 | after fork, and how you do this is entirely your own problem. |
528 | after fork, and how you do this is entirely your own problem. |
|
|
529 | |
|
|
530 | =item int ev_is_default_loop (loop) |
|
|
531 | |
|
|
532 | Returns true when the given loop actually is the default loop, false otherwise. |
467 | |
533 | |
468 | =item unsigned int ev_loop_count (loop) |
534 | =item unsigned int ev_loop_count (loop) |
469 | |
535 | |
470 | Returns the count of loop iterations for the loop, which is identical to |
536 | Returns the count of loop iterations for the loop, which is identical to |
471 | the number of times libev did poll for new events. It starts at C<0> and |
537 | the number of times libev did poll for new events. It starts at C<0> and |
… | |
… | |
516 | usually a better approach for this kind of thing. |
582 | usually a better approach for this kind of thing. |
517 | |
583 | |
518 | Here are the gory details of what C<ev_loop> does: |
584 | Here are the gory details of what C<ev_loop> does: |
519 | |
585 | |
520 | - Before the first iteration, call any pending watchers. |
586 | - Before the first iteration, call any pending watchers. |
521 | * If there are no active watchers (reference count is zero), return. |
587 | * If EVFLAG_FORKCHECK was used, check for a fork. |
522 | - Queue all prepare watchers and then call all outstanding watchers. |
588 | - If a fork was detected, queue and call all fork watchers. |
|
|
589 | - Queue and call all prepare watchers. |
523 | - If we have been forked, recreate the kernel state. |
590 | - If we have been forked, recreate the kernel state. |
524 | - Update the kernel state with all outstanding changes. |
591 | - Update the kernel state with all outstanding changes. |
525 | - Update the "event loop time". |
592 | - Update the "event loop time". |
526 | - Calculate for how long to block. |
593 | - Calculate for how long to sleep or block, if at all |
|
|
594 | (active idle watchers, EVLOOP_NONBLOCK or not having |
|
|
595 | any active watchers at all will result in not sleeping). |
|
|
596 | - Sleep if the I/O and timer collect interval say so. |
527 | - Block the process, waiting for any events. |
597 | - Block the process, waiting for any events. |
528 | - Queue all outstanding I/O (fd) events. |
598 | - Queue all outstanding I/O (fd) events. |
529 | - Update the "event loop time" and do time jump handling. |
599 | - Update the "event loop time" and do time jump handling. |
530 | - Queue all outstanding timers. |
600 | - Queue all outstanding timers. |
531 | - Queue all outstanding periodics. |
601 | - Queue all outstanding periodics. |
532 | - If no events are pending now, queue all idle watchers. |
602 | - If no events are pending now, queue all idle watchers. |
533 | - Queue all check watchers. |
603 | - Queue all check watchers. |
534 | - Call all queued watchers in reverse order (i.e. check watchers first). |
604 | - Call all queued watchers in reverse order (i.e. check watchers first). |
535 | Signals and child watchers are implemented as I/O watchers, and will |
605 | Signals and child watchers are implemented as I/O watchers, and will |
536 | be handled here by queueing them when their watcher gets executed. |
606 | be handled here by queueing them when their watcher gets executed. |
537 | - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK |
607 | - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK |
538 | were used, return, otherwise continue with step *. |
608 | were used, or there are no active watchers, return, otherwise |
|
|
609 | continue with step *. |
539 | |
610 | |
540 | Example: Queue some jobs and then loop until no events are outsanding |
611 | Example: Queue some jobs and then loop until no events are outstanding |
541 | anymore. |
612 | anymore. |
542 | |
613 | |
543 | ... queue jobs here, make sure they register event watchers as long |
614 | ... queue jobs here, make sure they register event watchers as long |
544 | ... as they still have work to do (even an idle watcher will do..) |
615 | ... as they still have work to do (even an idle watcher will do..) |
545 | ev_loop (my_loop, 0); |
616 | ev_loop (my_loop, 0); |
… | |
… | |
549 | |
620 | |
550 | Can be used to make a call to C<ev_loop> return early (but only after it |
621 | Can be used to make a call to C<ev_loop> return early (but only after it |
551 | has processed all outstanding events). The C<how> argument must be either |
622 | has processed all outstanding events). The C<how> argument must be either |
552 | C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or |
623 | C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or |
553 | C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. |
624 | C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. |
|
|
625 | |
|
|
626 | This "unloop state" will be cleared when entering C<ev_loop> again. |
554 | |
627 | |
555 | =item ev_ref (loop) |
628 | =item ev_ref (loop) |
556 | |
629 | |
557 | =item ev_unref (loop) |
630 | =item ev_unref (loop) |
558 | |
631 | |
… | |
… | |
563 | returning, ev_unref() after starting, and ev_ref() before stopping it. For |
636 | returning, ev_unref() after starting, and ev_ref() before stopping it. For |
564 | example, libev itself uses this for its internal signal pipe: It is not |
637 | example, libev itself uses this for its internal signal pipe: It is not |
565 | visible to the libev user and should not keep C<ev_loop> from exiting if |
638 | visible to the libev user and should not keep C<ev_loop> from exiting if |
566 | no event watchers registered by it are active. It is also an excellent |
639 | no event watchers registered by it are active. It is also an excellent |
567 | way to do this for generic recurring timers or from within third-party |
640 | way to do this for generic recurring timers or from within third-party |
568 | libraries. Just remember to I<unref after start> and I<ref before stop>. |
641 | libraries. Just remember to I<unref after start> and I<ref before stop> |
|
|
642 | (but only if the watcher wasn't active before, or was active before, |
|
|
643 | respectively). |
569 | |
644 | |
570 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
645 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
571 | running when nothing else is active. |
646 | running when nothing else is active. |
572 | |
647 | |
573 | struct ev_signal exitsig; |
648 | struct ev_signal exitsig; |
… | |
… | |
721 | |
796 | |
722 | =item C<EV_FORK> |
797 | =item C<EV_FORK> |
723 | |
798 | |
724 | The event loop has been resumed in the child process after fork (see |
799 | The event loop has been resumed in the child process after fork (see |
725 | C<ev_fork>). |
800 | C<ev_fork>). |
|
|
801 | |
|
|
802 | =item C<EV_ASYNC> |
|
|
803 | |
|
|
804 | The given async watcher has been asynchronously notified (see C<ev_async>). |
726 | |
805 | |
727 | =item C<EV_ERROR> |
806 | =item C<EV_ERROR> |
728 | |
807 | |
729 | An unspecified error has occured, the watcher has been stopped. This might |
808 | An unspecified error has occured, the watcher has been stopped. This might |
730 | happen because the watcher could not be properly started because libev |
809 | happen because the watcher could not be properly started because libev |
… | |
… | |
948 | In general you can register as many read and/or write event watchers per |
1027 | In general you can register as many read and/or write event watchers per |
949 | fd as you want (as long as you don't confuse yourself). Setting all file |
1028 | fd as you want (as long as you don't confuse yourself). Setting all file |
950 | descriptors to non-blocking mode is also usually a good idea (but not |
1029 | descriptors to non-blocking mode is also usually a good idea (but not |
951 | required if you know what you are doing). |
1030 | required if you know what you are doing). |
952 | |
1031 | |
953 | You have to be careful with dup'ed file descriptors, though. Some backends |
|
|
954 | (the linux epoll backend is a notable example) cannot handle dup'ed file |
|
|
955 | descriptors correctly if you register interest in two or more fds pointing |
|
|
956 | to the same underlying file/socket/etc. description (that is, they share |
|
|
957 | the same underlying "file open"). |
|
|
958 | |
|
|
959 | If you must do this, then force the use of a known-to-be-good backend |
1032 | If you must do this, then force the use of a known-to-be-good backend |
960 | (at the time of this writing, this includes only C<EVBACKEND_SELECT> and |
1033 | (at the time of this writing, this includes only C<EVBACKEND_SELECT> and |
961 | C<EVBACKEND_POLL>). |
1034 | C<EVBACKEND_POLL>). |
962 | |
1035 | |
963 | Another thing you have to watch out for is that it is quite easy to |
1036 | Another thing you have to watch out for is that it is quite easy to |
… | |
… | |
997 | optimisations to libev. |
1070 | optimisations to libev. |
998 | |
1071 | |
999 | =head3 The special problem of dup'ed file descriptors |
1072 | =head3 The special problem of dup'ed file descriptors |
1000 | |
1073 | |
1001 | Some backends (e.g. epoll), cannot register events for file descriptors, |
1074 | Some backends (e.g. epoll), cannot register events for file descriptors, |
1002 | but only events for the underlying file descriptions. That menas when you |
1075 | but only events for the underlying file descriptions. That means when you |
1003 | have C<dup ()>'ed file descriptors and register events for them, only one |
1076 | have C<dup ()>'ed file descriptors or weirder constellations, and register |
1004 | file descriptor might actually receive events. |
1077 | events for them, only one file descriptor might actually receive events. |
1005 | |
1078 | |
1006 | There is no workaorund possible except not registering events |
1079 | There is no workaround possible except not registering events |
1007 | for potentially C<dup ()>'ed file descriptors or to resort to |
1080 | for potentially C<dup ()>'ed file descriptors, or to resort to |
1008 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1081 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
1009 | |
1082 | |
1010 | =head3 The special problem of fork |
1083 | =head3 The special problem of fork |
1011 | |
1084 | |
1012 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
1085 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
… | |
… | |
1016 | To support fork in your programs, you either have to call |
1089 | To support fork in your programs, you either have to call |
1017 | C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, |
1090 | C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, |
1018 | enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or |
1091 | enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or |
1019 | C<EVBACKEND_POLL>. |
1092 | C<EVBACKEND_POLL>. |
1020 | |
1093 | |
|
|
1094 | =head3 The special problem of SIGPIPE |
|
|
1095 | |
|
|
1096 | While not really specific to libev, it is easy to forget about SIGPIPE: |
|
|
1097 | when reading from a pipe whose other end has been closed, your program |
|
|
1098 | gets send a SIGPIPE, which, by default, aborts your program. For most |
|
|
1099 | programs this is sensible behaviour, for daemons, this is usually |
|
|
1100 | undesirable. |
|
|
1101 | |
|
|
1102 | So when you encounter spurious, unexplained daemon exits, make sure you |
|
|
1103 | ignore SIGPIPE (and maybe make sure you log the exit status of your daemon |
|
|
1104 | somewhere, as that would have given you a big clue). |
|
|
1105 | |
1021 | |
1106 | |
1022 | =head3 Watcher-Specific Functions |
1107 | =head3 Watcher-Specific Functions |
1023 | |
1108 | |
1024 | =over 4 |
1109 | =over 4 |
1025 | |
1110 | |
… | |
… | |
1038 | =item int events [read-only] |
1123 | =item int events [read-only] |
1039 | |
1124 | |
1040 | The events being watched. |
1125 | The events being watched. |
1041 | |
1126 | |
1042 | =back |
1127 | =back |
|
|
1128 | |
|
|
1129 | =head3 Examples |
1043 | |
1130 | |
1044 | Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well |
1131 | Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well |
1045 | readable, but only once. Since it is likely line-buffered, you could |
1132 | readable, but only once. Since it is likely line-buffered, you could |
1046 | attempt to read a whole line in the callback. |
1133 | attempt to read a whole line in the callback. |
1047 | |
1134 | |
… | |
… | |
1100 | configure a timer to trigger every 10 seconds, then it will trigger at |
1187 | configure a timer to trigger every 10 seconds, then it will trigger at |
1101 | exactly 10 second intervals. If, however, your program cannot keep up with |
1188 | exactly 10 second intervals. If, however, your program cannot keep up with |
1102 | the timer (because it takes longer than those 10 seconds to do stuff) the |
1189 | the timer (because it takes longer than those 10 seconds to do stuff) the |
1103 | timer will not fire more than once per event loop iteration. |
1190 | timer will not fire more than once per event loop iteration. |
1104 | |
1191 | |
1105 | =item ev_timer_again (loop) |
1192 | =item ev_timer_again (loop, ev_timer *) |
1106 | |
1193 | |
1107 | This will act as if the timer timed out and restart it again if it is |
1194 | This will act as if the timer timed out and restart it again if it is |
1108 | repeating. The exact semantics are: |
1195 | repeating. The exact semantics are: |
1109 | |
1196 | |
1110 | If the timer is pending, its pending status is cleared. |
1197 | If the timer is pending, its pending status is cleared. |
… | |
… | |
1145 | or C<ev_timer_again> is called and determines the next timeout (if any), |
1232 | or C<ev_timer_again> is called and determines the next timeout (if any), |
1146 | which is also when any modifications are taken into account. |
1233 | which is also when any modifications are taken into account. |
1147 | |
1234 | |
1148 | =back |
1235 | =back |
1149 | |
1236 | |
|
|
1237 | =head3 Examples |
|
|
1238 | |
1150 | Example: Create a timer that fires after 60 seconds. |
1239 | Example: Create a timer that fires after 60 seconds. |
1151 | |
1240 | |
1152 | static void |
1241 | static void |
1153 | one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) |
1242 | one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) |
1154 | { |
1243 | { |
… | |
… | |
1217 | In this configuration the watcher triggers an event at the wallclock time |
1306 | In this configuration the watcher triggers an event at the wallclock time |
1218 | C<at> and doesn't repeat. It will not adjust when a time jump occurs, |
1307 | C<at> and doesn't repeat. It will not adjust when a time jump occurs, |
1219 | that is, if it is to be run at January 1st 2011 then it will run when the |
1308 | that is, if it is to be run at January 1st 2011 then it will run when the |
1220 | system time reaches or surpasses this time. |
1309 | system time reaches or surpasses this time. |
1221 | |
1310 | |
1222 | =item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) |
1311 | =item * repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) |
1223 | |
1312 | |
1224 | In this mode the watcher will always be scheduled to time out at the next |
1313 | In this mode the watcher will always be scheduled to time out at the next |
1225 | C<at + N * interval> time (for some integer N, which can also be negative) |
1314 | C<at + N * interval> time (for some integer N, which can also be negative) |
1226 | and then repeat, regardless of any time jumps. |
1315 | and then repeat, regardless of any time jumps. |
1227 | |
1316 | |
… | |
… | |
1310 | |
1399 | |
1311 | When active, contains the absolute time that the watcher is supposed to |
1400 | When active, contains the absolute time that the watcher is supposed to |
1312 | trigger next. |
1401 | trigger next. |
1313 | |
1402 | |
1314 | =back |
1403 | =back |
|
|
1404 | |
|
|
1405 | =head3 Examples |
1315 | |
1406 | |
1316 | Example: Call a callback every hour, or, more precisely, whenever the |
1407 | Example: Call a callback every hour, or, more precisely, whenever the |
1317 | system clock is divisible by 3600. The callback invocation times have |
1408 | system clock is divisible by 3600. The callback invocation times have |
1318 | potentially a lot of jittering, but good long-term stability. |
1409 | potentially a lot of jittering, but good long-term stability. |
1319 | |
1410 | |
… | |
… | |
1359 | with the kernel (thus it coexists with your own signal handlers as long |
1450 | with the kernel (thus it coexists with your own signal handlers as long |
1360 | as you don't register any with libev). Similarly, when the last signal |
1451 | as you don't register any with libev). Similarly, when the last signal |
1361 | watcher for a signal is stopped libev will reset the signal handler to |
1452 | watcher for a signal is stopped libev will reset the signal handler to |
1362 | SIG_DFL (regardless of what it was set to before). |
1453 | SIG_DFL (regardless of what it was set to before). |
1363 | |
1454 | |
|
|
1455 | If possible and supported, libev will install its handlers with |
|
|
1456 | C<SA_RESTART> behaviour enabled, so syscalls should not be unduly |
|
|
1457 | interrupted. If you have a problem with syscalls getting interrupted by |
|
|
1458 | signals you can block all signals in an C<ev_check> watcher and unblock |
|
|
1459 | them in an C<ev_prepare> watcher. |
|
|
1460 | |
1364 | =head3 Watcher-Specific Functions and Data Members |
1461 | =head3 Watcher-Specific Functions and Data Members |
1365 | |
1462 | |
1366 | =over 4 |
1463 | =over 4 |
1367 | |
1464 | |
1368 | =item ev_signal_init (ev_signal *, callback, int signum) |
1465 | =item ev_signal_init (ev_signal *, callback, int signum) |
… | |
… | |
1376 | |
1473 | |
1377 | The signal the watcher watches out for. |
1474 | The signal the watcher watches out for. |
1378 | |
1475 | |
1379 | =back |
1476 | =back |
1380 | |
1477 | |
|
|
1478 | =head3 Examples |
|
|
1479 | |
|
|
1480 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
|
|
1481 | |
|
|
1482 | static void |
|
|
1483 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
|
|
1484 | { |
|
|
1485 | ev_unloop (loop, EVUNLOOP_ALL); |
|
|
1486 | } |
|
|
1487 | |
|
|
1488 | struct ev_signal signal_watcher; |
|
|
1489 | ev_signal_init (&signal_watcher, sigint_cb, SIGINT); |
|
|
1490 | ev_signal_start (loop, &sigint_cb); |
|
|
1491 | |
1381 | |
1492 | |
1382 | =head2 C<ev_child> - watch out for process status changes |
1493 | =head2 C<ev_child> - watch out for process status changes |
1383 | |
1494 | |
1384 | Child watchers trigger when your process receives a SIGCHLD in response to |
1495 | Child watchers trigger when your process receives a SIGCHLD in response to |
1385 | some child status changes (most typically when a child of yours dies). |
1496 | some child status changes (most typically when a child of yours dies). It |
|
|
1497 | is permissible to install a child watcher I<after> the child has been |
|
|
1498 | forked (which implies it might have already exited), as long as the event |
|
|
1499 | loop isn't entered (or is continued from a watcher). |
|
|
1500 | |
|
|
1501 | Only the default event loop is capable of handling signals, and therefore |
|
|
1502 | you can only rgeister child watchers in the default event loop. |
|
|
1503 | |
|
|
1504 | =head3 Process Interaction |
|
|
1505 | |
|
|
1506 | Libev grabs C<SIGCHLD> as soon as the default event loop is |
|
|
1507 | initialised. This is necessary to guarantee proper behaviour even if |
|
|
1508 | the first child watcher is started after the child exits. The occurance |
|
|
1509 | of C<SIGCHLD> is recorded asynchronously, but child reaping is done |
|
|
1510 | synchronously as part of the event loop processing. Libev always reaps all |
|
|
1511 | children, even ones not watched. |
|
|
1512 | |
|
|
1513 | =head3 Overriding the Built-In Processing |
|
|
1514 | |
|
|
1515 | Libev offers no special support for overriding the built-in child |
|
|
1516 | processing, but if your application collides with libev's default child |
|
|
1517 | handler, you can override it easily by installing your own handler for |
|
|
1518 | C<SIGCHLD> after initialising the default loop, and making sure the |
|
|
1519 | default loop never gets destroyed. You are encouraged, however, to use an |
|
|
1520 | event-based approach to child reaping and thus use libev's support for |
|
|
1521 | that, so other libev users can use C<ev_child> watchers freely. |
1386 | |
1522 | |
1387 | =head3 Watcher-Specific Functions and Data Members |
1523 | =head3 Watcher-Specific Functions and Data Members |
1388 | |
1524 | |
1389 | =over 4 |
1525 | =over 4 |
1390 | |
1526 | |
1391 | =item ev_child_init (ev_child *, callback, int pid) |
1527 | =item ev_child_init (ev_child *, callback, int pid, int trace) |
1392 | |
1528 | |
1393 | =item ev_child_set (ev_child *, int pid) |
1529 | =item ev_child_set (ev_child *, int pid, int trace) |
1394 | |
1530 | |
1395 | Configures the watcher to wait for status changes of process C<pid> (or |
1531 | Configures the watcher to wait for status changes of process C<pid> (or |
1396 | I<any> process if C<pid> is specified as C<0>). The callback can look |
1532 | I<any> process if C<pid> is specified as C<0>). The callback can look |
1397 | at the C<rstatus> member of the C<ev_child> watcher structure to see |
1533 | at the C<rstatus> member of the C<ev_child> watcher structure to see |
1398 | the status word (use the macros from C<sys/wait.h> and see your systems |
1534 | the status word (use the macros from C<sys/wait.h> and see your systems |
1399 | C<waitpid> documentation). The C<rpid> member contains the pid of the |
1535 | C<waitpid> documentation). The C<rpid> member contains the pid of the |
1400 | process causing the status change. |
1536 | process causing the status change. C<trace> must be either C<0> (only |
|
|
1537 | activate the watcher when the process terminates) or C<1> (additionally |
|
|
1538 | activate the watcher when the process is stopped or continued). |
1401 | |
1539 | |
1402 | =item int pid [read-only] |
1540 | =item int pid [read-only] |
1403 | |
1541 | |
1404 | The process id this watcher watches out for, or C<0>, meaning any process id. |
1542 | The process id this watcher watches out for, or C<0>, meaning any process id. |
1405 | |
1543 | |
… | |
… | |
1412 | The process exit/trace status caused by C<rpid> (see your systems |
1550 | The process exit/trace status caused by C<rpid> (see your systems |
1413 | C<waitpid> and C<sys/wait.h> documentation for details). |
1551 | C<waitpid> and C<sys/wait.h> documentation for details). |
1414 | |
1552 | |
1415 | =back |
1553 | =back |
1416 | |
1554 | |
1417 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1555 | =head3 Examples |
|
|
1556 | |
|
|
1557 | Example: C<fork()> a new process and install a child handler to wait for |
|
|
1558 | its completion. |
|
|
1559 | |
|
|
1560 | ev_child cw; |
1418 | |
1561 | |
1419 | static void |
1562 | static void |
1420 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
1563 | child_cb (EV_P_ struct ev_child *w, int revents) |
1421 | { |
1564 | { |
1422 | ev_unloop (loop, EVUNLOOP_ALL); |
1565 | ev_child_stop (EV_A_ w); |
|
|
1566 | printf ("process %d exited with status %x\n", w->rpid, w->rstatus); |
1423 | } |
1567 | } |
1424 | |
1568 | |
1425 | struct ev_signal signal_watcher; |
1569 | pid_t pid = fork (); |
1426 | ev_signal_init (&signal_watcher, sigint_cb, SIGINT); |
1570 | |
1427 | ev_signal_start (loop, &sigint_cb); |
1571 | if (pid < 0) |
|
|
1572 | // error |
|
|
1573 | else if (pid == 0) |
|
|
1574 | { |
|
|
1575 | // the forked child executes here |
|
|
1576 | exit (1); |
|
|
1577 | } |
|
|
1578 | else |
|
|
1579 | { |
|
|
1580 | ev_child_init (&cw, child_cb, pid, 0); |
|
|
1581 | ev_child_start (EV_DEFAULT_ &cw); |
|
|
1582 | } |
1428 | |
1583 | |
1429 | |
1584 | |
1430 | =head2 C<ev_stat> - did the file attributes just change? |
1585 | =head2 C<ev_stat> - did the file attributes just change? |
1431 | |
1586 | |
1432 | This watches a filesystem path for attribute changes. That is, it calls |
1587 | This watches a filesystem path for attribute changes. That is, it calls |
… | |
… | |
1461 | semantics of C<ev_stat> watchers, which means that libev sometimes needs |
1616 | semantics of C<ev_stat> watchers, which means that libev sometimes needs |
1462 | to fall back to regular polling again even with inotify, but changes are |
1617 | to fall back to regular polling again even with inotify, but changes are |
1463 | usually detected immediately, and if the file exists there will be no |
1618 | usually detected immediately, and if the file exists there will be no |
1464 | polling. |
1619 | polling. |
1465 | |
1620 | |
|
|
1621 | =head3 ABI Issues (Largefile Support) |
|
|
1622 | |
|
|
1623 | Libev by default (unless the user overrides this) uses the default |
|
|
1624 | compilation environment, which means that on systems with optionally |
|
|
1625 | disabled large file support, you get the 32 bit version of the stat |
|
|
1626 | structure. When using the library from programs that change the ABI to |
|
|
1627 | use 64 bit file offsets the programs will fail. In that case you have to |
|
|
1628 | compile libev with the same flags to get binary compatibility. This is |
|
|
1629 | obviously the case with any flags that change the ABI, but the problem is |
|
|
1630 | most noticably with ev_stat and largefile support. |
|
|
1631 | |
|
|
1632 | =head3 Inotify |
|
|
1633 | |
|
|
1634 | When C<inotify (7)> support has been compiled into libev (generally only |
|
|
1635 | available on Linux) and present at runtime, it will be used to speed up |
|
|
1636 | change detection where possible. The inotify descriptor will be created lazily |
|
|
1637 | when the first C<ev_stat> watcher is being started. |
|
|
1638 | |
|
|
1639 | Inotify presense does not change the semantics of C<ev_stat> watchers |
|
|
1640 | except that changes might be detected earlier, and in some cases, to avoid |
|
|
1641 | making regular C<stat> calls. Even in the presense of inotify support |
|
|
1642 | there are many cases where libev has to resort to regular C<stat> polling. |
|
|
1643 | |
|
|
1644 | (There is no support for kqueue, as apparently it cannot be used to |
|
|
1645 | implement this functionality, due to the requirement of having a file |
|
|
1646 | descriptor open on the object at all times). |
|
|
1647 | |
|
|
1648 | =head3 The special problem of stat time resolution |
|
|
1649 | |
|
|
1650 | The C<stat ()> syscall only supports full-second resolution portably, and |
|
|
1651 | even on systems where the resolution is higher, many filesystems still |
|
|
1652 | only support whole seconds. |
|
|
1653 | |
|
|
1654 | That means that, if the time is the only thing that changes, you might |
|
|
1655 | miss updates: on the first update, C<ev_stat> detects a change and calls |
|
|
1656 | your callback, which does something. When there is another update within |
|
|
1657 | the same second, C<ev_stat> will be unable to detect it. |
|
|
1658 | |
|
|
1659 | The solution to this is to delay acting on a change for a second (or till |
|
|
1660 | the next second boundary), using a roughly one-second delay C<ev_timer> |
|
|
1661 | (C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01> |
|
|
1662 | is added to work around small timing inconsistencies of some operating |
|
|
1663 | systems. |
|
|
1664 | |
1466 | =head3 Watcher-Specific Functions and Data Members |
1665 | =head3 Watcher-Specific Functions and Data Members |
1467 | |
1666 | |
1468 | =over 4 |
1667 | =over 4 |
1469 | |
1668 | |
1470 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
1669 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
… | |
… | |
1479 | |
1678 | |
1480 | The callback will be receive C<EV_STAT> when a change was detected, |
1679 | The callback will be receive C<EV_STAT> when a change was detected, |
1481 | relative to the attributes at the time the watcher was started (or the |
1680 | relative to the attributes at the time the watcher was started (or the |
1482 | last change was detected). |
1681 | last change was detected). |
1483 | |
1682 | |
1484 | =item ev_stat_stat (ev_stat *) |
1683 | =item ev_stat_stat (loop, ev_stat *) |
1485 | |
1684 | |
1486 | Updates the stat buffer immediately with new values. If you change the |
1685 | Updates the stat buffer immediately with new values. If you change the |
1487 | watched path in your callback, you could call this fucntion to avoid |
1686 | watched path in your callback, you could call this fucntion to avoid |
1488 | detecting this change (while introducing a race condition). Can also be |
1687 | detecting this change (while introducing a race condition). Can also be |
1489 | useful simply to find out the new values. |
1688 | useful simply to find out the new values. |
… | |
… | |
1507 | =item const char *path [read-only] |
1706 | =item const char *path [read-only] |
1508 | |
1707 | |
1509 | The filesystem path that is being watched. |
1708 | The filesystem path that is being watched. |
1510 | |
1709 | |
1511 | =back |
1710 | =back |
|
|
1711 | |
|
|
1712 | =head3 Examples |
1512 | |
1713 | |
1513 | Example: Watch C</etc/passwd> for attribute changes. |
1714 | Example: Watch C</etc/passwd> for attribute changes. |
1514 | |
1715 | |
1515 | static void |
1716 | static void |
1516 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
1717 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
… | |
… | |
1529 | } |
1730 | } |
1530 | |
1731 | |
1531 | ... |
1732 | ... |
1532 | ev_stat passwd; |
1733 | ev_stat passwd; |
1533 | |
1734 | |
1534 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); |
1735 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.); |
1535 | ev_stat_start (loop, &passwd); |
1736 | ev_stat_start (loop, &passwd); |
|
|
1737 | |
|
|
1738 | Example: Like above, but additionally use a one-second delay so we do not |
|
|
1739 | miss updates (however, frequent updates will delay processing, too, so |
|
|
1740 | one might do the work both on C<ev_stat> callback invocation I<and> on |
|
|
1741 | C<ev_timer> callback invocation). |
|
|
1742 | |
|
|
1743 | static ev_stat passwd; |
|
|
1744 | static ev_timer timer; |
|
|
1745 | |
|
|
1746 | static void |
|
|
1747 | timer_cb (EV_P_ ev_timer *w, int revents) |
|
|
1748 | { |
|
|
1749 | ev_timer_stop (EV_A_ w); |
|
|
1750 | |
|
|
1751 | /* now it's one second after the most recent passwd change */ |
|
|
1752 | } |
|
|
1753 | |
|
|
1754 | static void |
|
|
1755 | stat_cb (EV_P_ ev_stat *w, int revents) |
|
|
1756 | { |
|
|
1757 | /* reset the one-second timer */ |
|
|
1758 | ev_timer_again (EV_A_ &timer); |
|
|
1759 | } |
|
|
1760 | |
|
|
1761 | ... |
|
|
1762 | ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.); |
|
|
1763 | ev_stat_start (loop, &passwd); |
|
|
1764 | ev_timer_init (&timer, timer_cb, 0., 1.01); |
1536 | |
1765 | |
1537 | |
1766 | |
1538 | =head2 C<ev_idle> - when you've got nothing better to do... |
1767 | =head2 C<ev_idle> - when you've got nothing better to do... |
1539 | |
1768 | |
1540 | Idle watchers trigger events when no other events of the same or higher |
1769 | Idle watchers trigger events when no other events of the same or higher |
… | |
… | |
1566 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
1795 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
1567 | believe me. |
1796 | believe me. |
1568 | |
1797 | |
1569 | =back |
1798 | =back |
1570 | |
1799 | |
|
|
1800 | =head3 Examples |
|
|
1801 | |
1571 | Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the |
1802 | Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the |
1572 | callback, free it. Also, use no error checking, as usual. |
1803 | callback, free it. Also, use no error checking, as usual. |
1573 | |
1804 | |
1574 | static void |
1805 | static void |
1575 | idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) |
1806 | idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) |
1576 | { |
1807 | { |
1577 | free (w); |
1808 | free (w); |
1578 | // now do something you wanted to do when the program has |
1809 | // now do something you wanted to do when the program has |
1579 | // no longer asnything immediate to do. |
1810 | // no longer anything immediate to do. |
1580 | } |
1811 | } |
1581 | |
1812 | |
1582 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1813 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1583 | ev_idle_init (idle_watcher, idle_cb); |
1814 | ev_idle_init (idle_watcher, idle_cb); |
1584 | ev_idle_start (loop, idle_cb); |
1815 | ev_idle_start (loop, idle_cb); |
… | |
… | |
1646 | parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> |
1877 | parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> |
1647 | macros, but using them is utterly, utterly and completely pointless. |
1878 | macros, but using them is utterly, utterly and completely pointless. |
1648 | |
1879 | |
1649 | =back |
1880 | =back |
1650 | |
1881 | |
|
|
1882 | =head3 Examples |
|
|
1883 | |
1651 | There are a number of principal ways to embed other event loops or modules |
1884 | There are a number of principal ways to embed other event loops or modules |
1652 | into libev. Here are some ideas on how to include libadns into libev |
1885 | into libev. Here are some ideas on how to include libadns into libev |
1653 | (there is a Perl module named C<EV::ADNS> that does this, which you could |
1886 | (there is a Perl module named C<EV::ADNS> that does this, which you could |
1654 | use for an actually working example. Another Perl module named C<EV::Glib> |
1887 | use for an actually working example. Another Perl module named C<EV::Glib> |
1655 | embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV |
1888 | embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV |
… | |
… | |
1823 | portable one. |
2056 | portable one. |
1824 | |
2057 | |
1825 | So when you want to use this feature you will always have to be prepared |
2058 | So when you want to use this feature you will always have to be prepared |
1826 | that you cannot get an embeddable loop. The recommended way to get around |
2059 | that you cannot get an embeddable loop. The recommended way to get around |
1827 | this is to have a separate variables for your embeddable loop, try to |
2060 | this is to have a separate variables for your embeddable loop, try to |
1828 | create it, and if that fails, use the normal loop for everything: |
2061 | create it, and if that fails, use the normal loop for everything. |
|
|
2062 | |
|
|
2063 | =head3 Watcher-Specific Functions and Data Members |
|
|
2064 | |
|
|
2065 | =over 4 |
|
|
2066 | |
|
|
2067 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
|
|
2068 | |
|
|
2069 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
|
|
2070 | |
|
|
2071 | Configures the watcher to embed the given loop, which must be |
|
|
2072 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
|
|
2073 | invoked automatically, otherwise it is the responsibility of the callback |
|
|
2074 | to invoke it (it will continue to be called until the sweep has been done, |
|
|
2075 | if you do not want thta, you need to temporarily stop the embed watcher). |
|
|
2076 | |
|
|
2077 | =item ev_embed_sweep (loop, ev_embed *) |
|
|
2078 | |
|
|
2079 | Make a single, non-blocking sweep over the embedded loop. This works |
|
|
2080 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
|
|
2081 | apropriate way for embedded loops. |
|
|
2082 | |
|
|
2083 | =item struct ev_loop *other [read-only] |
|
|
2084 | |
|
|
2085 | The embedded event loop. |
|
|
2086 | |
|
|
2087 | =back |
|
|
2088 | |
|
|
2089 | =head3 Examples |
|
|
2090 | |
|
|
2091 | Example: Try to get an embeddable event loop and embed it into the default |
|
|
2092 | event loop. If that is not possible, use the default loop. The default |
|
|
2093 | loop is stored in C<loop_hi>, while the mebeddable loop is stored in |
|
|
2094 | C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be |
|
|
2095 | used). |
1829 | |
2096 | |
1830 | struct ev_loop *loop_hi = ev_default_init (0); |
2097 | struct ev_loop *loop_hi = ev_default_init (0); |
1831 | struct ev_loop *loop_lo = 0; |
2098 | struct ev_loop *loop_lo = 0; |
1832 | struct ev_embed embed; |
2099 | struct ev_embed embed; |
1833 | |
2100 | |
… | |
… | |
1844 | ev_embed_start (loop_hi, &embed); |
2111 | ev_embed_start (loop_hi, &embed); |
1845 | } |
2112 | } |
1846 | else |
2113 | else |
1847 | loop_lo = loop_hi; |
2114 | loop_lo = loop_hi; |
1848 | |
2115 | |
1849 | =head3 Watcher-Specific Functions and Data Members |
2116 | Example: Check if kqueue is available but not recommended and create |
|
|
2117 | a kqueue backend for use with sockets (which usually work with any |
|
|
2118 | kqueue implementation). Store the kqueue/socket-only event loop in |
|
|
2119 | C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). |
1850 | |
2120 | |
1851 | =over 4 |
2121 | struct ev_loop *loop = ev_default_init (0); |
|
|
2122 | struct ev_loop *loop_socket = 0; |
|
|
2123 | struct ev_embed embed; |
|
|
2124 | |
|
|
2125 | if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) |
|
|
2126 | if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) |
|
|
2127 | { |
|
|
2128 | ev_embed_init (&embed, 0, loop_socket); |
|
|
2129 | ev_embed_start (loop, &embed); |
|
|
2130 | } |
1852 | |
2131 | |
1853 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
2132 | if (!loop_socket) |
|
|
2133 | loop_socket = loop; |
1854 | |
2134 | |
1855 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
2135 | // now use loop_socket for all sockets, and loop for everything else |
1856 | |
|
|
1857 | Configures the watcher to embed the given loop, which must be |
|
|
1858 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
|
|
1859 | invoked automatically, otherwise it is the responsibility of the callback |
|
|
1860 | to invoke it (it will continue to be called until the sweep has been done, |
|
|
1861 | if you do not want thta, you need to temporarily stop the embed watcher). |
|
|
1862 | |
|
|
1863 | =item ev_embed_sweep (loop, ev_embed *) |
|
|
1864 | |
|
|
1865 | Make a single, non-blocking sweep over the embedded loop. This works |
|
|
1866 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
|
|
1867 | apropriate way for embedded loops. |
|
|
1868 | |
|
|
1869 | =item struct ev_loop *other [read-only] |
|
|
1870 | |
|
|
1871 | The embedded event loop. |
|
|
1872 | |
|
|
1873 | =back |
|
|
1874 | |
2136 | |
1875 | |
2137 | |
1876 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
2138 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
1877 | |
2139 | |
1878 | Fork watchers are called when a C<fork ()> was detected (usually because |
2140 | Fork watchers are called when a C<fork ()> was detected (usually because |
… | |
… | |
1894 | believe me. |
2156 | believe me. |
1895 | |
2157 | |
1896 | =back |
2158 | =back |
1897 | |
2159 | |
1898 | |
2160 | |
|
|
2161 | =head2 C<ev_async> - how to wake up another event loop |
|
|
2162 | |
|
|
2163 | In general, you cannot use an C<ev_loop> from multiple threads or other |
|
|
2164 | asynchronous sources such as signal handlers (as opposed to multiple event |
|
|
2165 | loops - those are of course safe to use in different threads). |
|
|
2166 | |
|
|
2167 | Sometimes, however, you need to wake up another event loop you do not |
|
|
2168 | control, for example because it belongs to another thread. This is what |
|
|
2169 | C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you |
|
|
2170 | can signal it by calling C<ev_async_send>, which is thread- and signal |
|
|
2171 | safe. |
|
|
2172 | |
|
|
2173 | This functionality is very similar to C<ev_signal> watchers, as signals, |
|
|
2174 | too, are asynchronous in nature, and signals, too, will be compressed |
|
|
2175 | (i.e. the number of callback invocations may be less than the number of |
|
|
2176 | C<ev_async_sent> calls). |
|
|
2177 | |
|
|
2178 | Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not |
|
|
2179 | just the default loop. |
|
|
2180 | |
|
|
2181 | =head3 Queueing |
|
|
2182 | |
|
|
2183 | C<ev_async> does not support queueing of data in any way. The reason |
|
|
2184 | is that the author does not know of a simple (or any) algorithm for a |
|
|
2185 | multiple-writer-single-reader queue that works in all cases and doesn't |
|
|
2186 | need elaborate support such as pthreads. |
|
|
2187 | |
|
|
2188 | That means that if you want to queue data, you have to provide your own |
|
|
2189 | queue. But at least I can tell you would implement locking around your |
|
|
2190 | queue: |
|
|
2191 | |
|
|
2192 | =over 4 |
|
|
2193 | |
|
|
2194 | =item queueing from a signal handler context |
|
|
2195 | |
|
|
2196 | To implement race-free queueing, you simply add to the queue in the signal |
|
|
2197 | handler but you block the signal handler in the watcher callback. Here is an example that does that for |
|
|
2198 | some fictitiuous SIGUSR1 handler: |
|
|
2199 | |
|
|
2200 | static ev_async mysig; |
|
|
2201 | |
|
|
2202 | static void |
|
|
2203 | sigusr1_handler (void) |
|
|
2204 | { |
|
|
2205 | sometype data; |
|
|
2206 | |
|
|
2207 | // no locking etc. |
|
|
2208 | queue_put (data); |
|
|
2209 | ev_async_send (EV_DEFAULT_ &mysig); |
|
|
2210 | } |
|
|
2211 | |
|
|
2212 | static void |
|
|
2213 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2214 | { |
|
|
2215 | sometype data; |
|
|
2216 | sigset_t block, prev; |
|
|
2217 | |
|
|
2218 | sigemptyset (&block); |
|
|
2219 | sigaddset (&block, SIGUSR1); |
|
|
2220 | sigprocmask (SIG_BLOCK, &block, &prev); |
|
|
2221 | |
|
|
2222 | while (queue_get (&data)) |
|
|
2223 | process (data); |
|
|
2224 | |
|
|
2225 | if (sigismember (&prev, SIGUSR1) |
|
|
2226 | sigprocmask (SIG_UNBLOCK, &block, 0); |
|
|
2227 | } |
|
|
2228 | |
|
|
2229 | (Note: pthreads in theory requires you to use C<pthread_setmask> |
|
|
2230 | instead of C<sigprocmask> when you use threads, but libev doesn't do it |
|
|
2231 | either...). |
|
|
2232 | |
|
|
2233 | =item queueing from a thread context |
|
|
2234 | |
|
|
2235 | The strategy for threads is different, as you cannot (easily) block |
|
|
2236 | threads but you can easily preempt them, so to queue safely you need to |
|
|
2237 | employ a traditional mutex lock, such as in this pthread example: |
|
|
2238 | |
|
|
2239 | static ev_async mysig; |
|
|
2240 | static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER; |
|
|
2241 | |
|
|
2242 | static void |
|
|
2243 | otherthread (void) |
|
|
2244 | { |
|
|
2245 | // only need to lock the actual queueing operation |
|
|
2246 | pthread_mutex_lock (&mymutex); |
|
|
2247 | queue_put (data); |
|
|
2248 | pthread_mutex_unlock (&mymutex); |
|
|
2249 | |
|
|
2250 | ev_async_send (EV_DEFAULT_ &mysig); |
|
|
2251 | } |
|
|
2252 | |
|
|
2253 | static void |
|
|
2254 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2255 | { |
|
|
2256 | pthread_mutex_lock (&mymutex); |
|
|
2257 | |
|
|
2258 | while (queue_get (&data)) |
|
|
2259 | process (data); |
|
|
2260 | |
|
|
2261 | pthread_mutex_unlock (&mymutex); |
|
|
2262 | } |
|
|
2263 | |
|
|
2264 | =back |
|
|
2265 | |
|
|
2266 | |
|
|
2267 | =head3 Watcher-Specific Functions and Data Members |
|
|
2268 | |
|
|
2269 | =over 4 |
|
|
2270 | |
|
|
2271 | =item ev_async_init (ev_async *, callback) |
|
|
2272 | |
|
|
2273 | Initialises and configures the async watcher - it has no parameters of any |
|
|
2274 | kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, |
|
|
2275 | believe me. |
|
|
2276 | |
|
|
2277 | =item ev_async_send (loop, ev_async *) |
|
|
2278 | |
|
|
2279 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
|
|
2280 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
|
|
2281 | C<ev_feed_event>, this call is safe to do in other threads, signal or |
|
|
2282 | similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding |
|
|
2283 | section below on what exactly this means). |
|
|
2284 | |
|
|
2285 | This call incurs the overhead of a syscall only once per loop iteration, |
|
|
2286 | so while the overhead might be noticable, it doesn't apply to repeated |
|
|
2287 | calls to C<ev_async_send>. |
|
|
2288 | |
|
|
2289 | =item bool = ev_async_pending (ev_async *) |
|
|
2290 | |
|
|
2291 | Returns a non-zero value when C<ev_async_send> has been called on the |
|
|
2292 | watcher but the event has not yet been processed (or even noted) by the |
|
|
2293 | event loop. |
|
|
2294 | |
|
|
2295 | C<ev_async_send> sets a flag in the watcher and wakes up the loop. When |
|
|
2296 | the loop iterates next and checks for the watcher to have become active, |
|
|
2297 | it will reset the flag again. C<ev_async_pending> can be used to very |
|
|
2298 | quickly check wether invoking the loop might be a good idea. |
|
|
2299 | |
|
|
2300 | Not that this does I<not> check wether the watcher itself is pending, only |
|
|
2301 | wether it has been requested to make this watcher pending. |
|
|
2302 | |
|
|
2303 | =back |
|
|
2304 | |
|
|
2305 | |
1899 | =head1 OTHER FUNCTIONS |
2306 | =head1 OTHER FUNCTIONS |
1900 | |
2307 | |
1901 | There are some other functions of possible interest. Described. Here. Now. |
2308 | There are some other functions of possible interest. Described. Here. Now. |
1902 | |
2309 | |
1903 | =over 4 |
2310 | =over 4 |
… | |
… | |
2130 | Example: Define a class with an IO and idle watcher, start one of them in |
2537 | Example: Define a class with an IO and idle watcher, start one of them in |
2131 | the constructor. |
2538 | the constructor. |
2132 | |
2539 | |
2133 | class myclass |
2540 | class myclass |
2134 | { |
2541 | { |
2135 | ev_io io; void io_cb (ev::io &w, int revents); |
2542 | ev::io io; void io_cb (ev::io &w, int revents); |
2136 | ev_idle idle void idle_cb (ev::idle &w, int revents); |
2543 | ev:idle idle void idle_cb (ev::idle &w, int revents); |
2137 | |
2544 | |
2138 | myclass (); |
2545 | myclass (int fd) |
2139 | } |
|
|
2140 | |
|
|
2141 | myclass::myclass (int fd) |
|
|
2142 | { |
2546 | { |
2143 | io .set <myclass, &myclass::io_cb > (this); |
2547 | io .set <myclass, &myclass::io_cb > (this); |
2144 | idle.set <myclass, &myclass::idle_cb> (this); |
2548 | idle.set <myclass, &myclass::idle_cb> (this); |
2145 | |
2549 | |
2146 | io.start (fd, ev::READ); |
2550 | io.start (fd, ev::READ); |
|
|
2551 | } |
2147 | } |
2552 | }; |
|
|
2553 | |
|
|
2554 | |
|
|
2555 | =head1 OTHER LANGUAGE BINDINGS |
|
|
2556 | |
|
|
2557 | Libev does not offer other language bindings itself, but bindings for a |
|
|
2558 | numbe rof languages exist in the form of third-party packages. If you know |
|
|
2559 | any interesting language binding in addition to the ones listed here, drop |
|
|
2560 | me a note. |
|
|
2561 | |
|
|
2562 | =over 4 |
|
|
2563 | |
|
|
2564 | =item Perl |
|
|
2565 | |
|
|
2566 | The EV module implements the full libev API and is actually used to test |
|
|
2567 | libev. EV is developed together with libev. Apart from the EV core module, |
|
|
2568 | there are additional modules that implement libev-compatible interfaces |
|
|
2569 | to C<libadns> (C<EV::ADNS>), C<Net::SNMP> (C<Net::SNMP::EV>) and the |
|
|
2570 | C<libglib> event core (C<Glib::EV> and C<EV::Glib>). |
|
|
2571 | |
|
|
2572 | It can be found and installed via CPAN, its homepage is found at |
|
|
2573 | L<http://software.schmorp.de/pkg/EV>. |
|
|
2574 | |
|
|
2575 | =item Ruby |
|
|
2576 | |
|
|
2577 | Tony Arcieri has written a ruby extension that offers access to a subset |
|
|
2578 | of the libev API and adds filehandle abstractions, asynchronous DNS and |
|
|
2579 | more on top of it. It can be found via gem servers. Its homepage is at |
|
|
2580 | L<http://rev.rubyforge.org/>. |
|
|
2581 | |
|
|
2582 | =item D |
|
|
2583 | |
|
|
2584 | Leandro Lucarella has written a D language binding (F<ev.d>) for libev, to |
|
|
2585 | be found at L<http://git.llucax.com.ar/?p=software/ev.d.git;a=summary>. |
|
|
2586 | |
|
|
2587 | =back |
2148 | |
2588 | |
2149 | |
2589 | |
2150 | =head1 MACRO MAGIC |
2590 | =head1 MACRO MAGIC |
2151 | |
2591 | |
2152 | Libev can be compiled with a variety of options, the most fundamantal |
2592 | Libev can be compiled with a variety of options, the most fundamantal |
… | |
… | |
2188 | |
2628 | |
2189 | =item C<EV_DEFAULT>, C<EV_DEFAULT_> |
2629 | =item C<EV_DEFAULT>, C<EV_DEFAULT_> |
2190 | |
2630 | |
2191 | Similar to the other two macros, this gives you the value of the default |
2631 | Similar to the other two macros, this gives you the value of the default |
2192 | loop, if multiple loops are supported ("ev loop default"). |
2632 | loop, if multiple loops are supported ("ev loop default"). |
|
|
2633 | |
|
|
2634 | =item C<EV_DEFAULT_UC>, C<EV_DEFAULT_UC_> |
|
|
2635 | |
|
|
2636 | Usage identical to C<EV_DEFAULT> and C<EV_DEFAULT_>, but requires that the |
|
|
2637 | default loop has been initialised (C<UC> == unchecked). Their behaviour |
|
|
2638 | is undefined when the default loop has not been initialised by a previous |
|
|
2639 | execution of C<EV_DEFAULT>, C<EV_DEFAULT_> or C<ev_default_init (...)>. |
|
|
2640 | |
|
|
2641 | It is often prudent to use C<EV_DEFAULT> when initialising the first |
|
|
2642 | watcher in a function but use C<EV_DEFAULT_UC> afterwards. |
2193 | |
2643 | |
2194 | =back |
2644 | =back |
2195 | |
2645 | |
2196 | Example: Declare and initialise a check watcher, utilising the above |
2646 | Example: Declare and initialise a check watcher, utilising the above |
2197 | macros so it will work regardless of whether multiple loops are supported |
2647 | macros so it will work regardless of whether multiple loops are supported |
… | |
… | |
2293 | |
2743 | |
2294 | libev.m4 |
2744 | libev.m4 |
2295 | |
2745 | |
2296 | =head2 PREPROCESSOR SYMBOLS/MACROS |
2746 | =head2 PREPROCESSOR SYMBOLS/MACROS |
2297 | |
2747 | |
2298 | Libev can be configured via a variety of preprocessor symbols you have to define |
2748 | Libev can be configured via a variety of preprocessor symbols you have to |
2299 | before including any of its files. The default is not to build for multiplicity |
2749 | define before including any of its files. The default in the absense of |
2300 | and only include the select backend. |
2750 | autoconf is noted for every option. |
2301 | |
2751 | |
2302 | =over 4 |
2752 | =over 4 |
2303 | |
2753 | |
2304 | =item EV_STANDALONE |
2754 | =item EV_STANDALONE |
2305 | |
2755 | |
… | |
… | |
2331 | =item EV_USE_NANOSLEEP |
2781 | =item EV_USE_NANOSLEEP |
2332 | |
2782 | |
2333 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
2783 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
2334 | and will use it for delays. Otherwise it will use C<select ()>. |
2784 | and will use it for delays. Otherwise it will use C<select ()>. |
2335 | |
2785 | |
|
|
2786 | =item EV_USE_EVENTFD |
|
|
2787 | |
|
|
2788 | If defined to be C<1>, then libev will assume that C<eventfd ()> is |
|
|
2789 | available and will probe for kernel support at runtime. This will improve |
|
|
2790 | C<ev_signal> and C<ev_async> performance and reduce resource consumption. |
|
|
2791 | If undefined, it will be enabled if the headers indicate GNU/Linux + Glibc |
|
|
2792 | 2.7 or newer, otherwise disabled. |
|
|
2793 | |
2336 | =item EV_USE_SELECT |
2794 | =item EV_USE_SELECT |
2337 | |
2795 | |
2338 | If undefined or defined to be C<1>, libev will compile in support for the |
2796 | If undefined or defined to be C<1>, libev will compile in support for the |
2339 | C<select>(2) backend. No attempt at autodetection will be done: if no |
2797 | C<select>(2) backend. No attempt at autodetection will be done: if no |
2340 | other method takes over, select will be it. Otherwise the select backend |
2798 | other method takes over, select will be it. Otherwise the select backend |
… | |
… | |
2358 | be used is the winsock select). This means that it will call |
2816 | be used is the winsock select). This means that it will call |
2359 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2817 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2360 | it is assumed that all these functions actually work on fds, even |
2818 | it is assumed that all these functions actually work on fds, even |
2361 | on win32. Should not be defined on non-win32 platforms. |
2819 | on win32. Should not be defined on non-win32 platforms. |
2362 | |
2820 | |
|
|
2821 | =item EV_FD_TO_WIN32_HANDLE |
|
|
2822 | |
|
|
2823 | If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map |
|
|
2824 | file descriptors to socket handles. When not defining this symbol (the |
|
|
2825 | default), then libev will call C<_get_osfhandle>, which is usually |
|
|
2826 | correct. In some cases, programs use their own file descriptor management, |
|
|
2827 | in which case they can provide this function to map fds to socket handles. |
|
|
2828 | |
2363 | =item EV_USE_POLL |
2829 | =item EV_USE_POLL |
2364 | |
2830 | |
2365 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2831 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2366 | backend. Otherwise it will be enabled on non-win32 platforms. It |
2832 | backend. Otherwise it will be enabled on non-win32 platforms. It |
2367 | takes precedence over select. |
2833 | takes precedence over select. |
2368 | |
2834 | |
2369 | =item EV_USE_EPOLL |
2835 | =item EV_USE_EPOLL |
2370 | |
2836 | |
2371 | If defined to be C<1>, libev will compile in support for the Linux |
2837 | If defined to be C<1>, libev will compile in support for the Linux |
2372 | C<epoll>(7) backend. Its availability will be detected at runtime, |
2838 | C<epoll>(7) backend. Its availability will be detected at runtime, |
2373 | otherwise another method will be used as fallback. This is the |
2839 | otherwise another method will be used as fallback. This is the preferred |
2374 | preferred backend for GNU/Linux systems. |
2840 | backend for GNU/Linux systems. If undefined, it will be enabled if the |
|
|
2841 | headers indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
2375 | |
2842 | |
2376 | =item EV_USE_KQUEUE |
2843 | =item EV_USE_KQUEUE |
2377 | |
2844 | |
2378 | If defined to be C<1>, libev will compile in support for the BSD style |
2845 | If defined to be C<1>, libev will compile in support for the BSD style |
2379 | C<kqueue>(2) backend. Its actual availability will be detected at runtime, |
2846 | C<kqueue>(2) backend. Its actual availability will be detected at runtime, |
… | |
… | |
2398 | |
2865 | |
2399 | =item EV_USE_INOTIFY |
2866 | =item EV_USE_INOTIFY |
2400 | |
2867 | |
2401 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2868 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2402 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2869 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2403 | be detected at runtime. |
2870 | be detected at runtime. If undefined, it will be enabled if the headers |
|
|
2871 | indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
|
|
2872 | |
|
|
2873 | =item EV_ATOMIC_T |
|
|
2874 | |
|
|
2875 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
|
|
2876 | access is atomic with respect to other threads or signal contexts. No such |
|
|
2877 | type is easily found in the C language, so you can provide your own type |
|
|
2878 | that you know is safe for your purposes. It is used both for signal handler "locking" |
|
|
2879 | as well as for signal and thread safety in C<ev_async> watchers. |
|
|
2880 | |
|
|
2881 | In the absense of this define, libev will use C<sig_atomic_t volatile> |
|
|
2882 | (from F<signal.h>), which is usually good enough on most platforms. |
2404 | |
2883 | |
2405 | =item EV_H |
2884 | =item EV_H |
2406 | |
2885 | |
2407 | The name of the F<ev.h> header file used to include it. The default if |
2886 | The name of the F<ev.h> header file used to include it. The default if |
2408 | undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This |
2887 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
2409 | can be used to virtually rename the F<ev.h> header file in case of conflicts. |
2888 | used to virtually rename the F<ev.h> header file in case of conflicts. |
2410 | |
2889 | |
2411 | =item EV_CONFIG_H |
2890 | =item EV_CONFIG_H |
2412 | |
2891 | |
2413 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2892 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2414 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2893 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2415 | C<EV_H>, above. |
2894 | C<EV_H>, above. |
2416 | |
2895 | |
2417 | =item EV_EVENT_H |
2896 | =item EV_EVENT_H |
2418 | |
2897 | |
2419 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2898 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2420 | of how the F<event.h> header can be found. |
2899 | of how the F<event.h> header can be found, the default is C<"event.h">. |
2421 | |
2900 | |
2422 | =item EV_PROTOTYPES |
2901 | =item EV_PROTOTYPES |
2423 | |
2902 | |
2424 | If defined to be C<0>, then F<ev.h> will not define any function |
2903 | If defined to be C<0>, then F<ev.h> will not define any function |
2425 | prototypes, but still define all the structs and other symbols. This is |
2904 | prototypes, but still define all the structs and other symbols. This is |
… | |
… | |
2476 | =item EV_FORK_ENABLE |
2955 | =item EV_FORK_ENABLE |
2477 | |
2956 | |
2478 | If undefined or defined to be C<1>, then fork watchers are supported. If |
2957 | If undefined or defined to be C<1>, then fork watchers are supported. If |
2479 | defined to be C<0>, then they are not. |
2958 | defined to be C<0>, then they are not. |
2480 | |
2959 | |
|
|
2960 | =item EV_ASYNC_ENABLE |
|
|
2961 | |
|
|
2962 | If undefined or defined to be C<1>, then async watchers are supported. If |
|
|
2963 | defined to be C<0>, then they are not. |
|
|
2964 | |
2481 | =item EV_MINIMAL |
2965 | =item EV_MINIMAL |
2482 | |
2966 | |
2483 | If you need to shave off some kilobytes of code at the expense of some |
2967 | If you need to shave off some kilobytes of code at the expense of some |
2484 | speed, define this symbol to C<1>. Currently only used for gcc to override |
2968 | speed, define this symbol to C<1>. Currently only used for gcc to override |
2485 | some inlining decisions, saves roughly 30% codesize of amd64. |
2969 | some inlining decisions, saves roughly 30% codesize of amd64. |
… | |
… | |
2491 | than enough. If you need to manage thousands of children you might want to |
2975 | than enough. If you need to manage thousands of children you might want to |
2492 | increase this value (I<must> be a power of two). |
2976 | increase this value (I<must> be a power of two). |
2493 | |
2977 | |
2494 | =item EV_INOTIFY_HASHSIZE |
2978 | =item EV_INOTIFY_HASHSIZE |
2495 | |
2979 | |
2496 | C<ev_staz> watchers use a small hash table to distribute workload by |
2980 | C<ev_stat> watchers use a small hash table to distribute workload by |
2497 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
2981 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
2498 | usually more than enough. If you need to manage thousands of C<ev_stat> |
2982 | usually more than enough. If you need to manage thousands of C<ev_stat> |
2499 | watchers you might want to increase this value (I<must> be a power of |
2983 | watchers you might want to increase this value (I<must> be a power of |
2500 | two). |
2984 | two). |
2501 | |
2985 | |
… | |
… | |
2579 | |
3063 | |
2580 | #include "ev_cpp.h" |
3064 | #include "ev_cpp.h" |
2581 | #include "ev.c" |
3065 | #include "ev.c" |
2582 | |
3066 | |
2583 | |
3067 | |
|
|
3068 | =head1 THREADS AND COROUTINES |
|
|
3069 | |
|
|
3070 | =head2 THREADS |
|
|
3071 | |
|
|
3072 | Libev itself is completely threadsafe, but it uses no locking. This |
|
|
3073 | means that you can use as many loops as you want in parallel, as long as |
|
|
3074 | only one thread ever calls into one libev function with the same loop |
|
|
3075 | parameter. |
|
|
3076 | |
|
|
3077 | Or put differently: calls with different loop parameters can be done in |
|
|
3078 | parallel from multiple threads, calls with the same loop parameter must be |
|
|
3079 | done serially (but can be done from different threads, as long as only one |
|
|
3080 | thread ever is inside a call at any point in time, e.g. by using a mutex |
|
|
3081 | per loop). |
|
|
3082 | |
|
|
3083 | If you want to know which design is best for your problem, then I cannot |
|
|
3084 | help you but by giving some generic advice: |
|
|
3085 | |
|
|
3086 | =over 4 |
|
|
3087 | |
|
|
3088 | =item * most applications have a main thread: use the default libev loop |
|
|
3089 | in that thread, or create a seperate thread running only the default loop. |
|
|
3090 | |
|
|
3091 | This helps integrating other libraries or software modules that use libev |
|
|
3092 | themselves and don't care/know about threading. |
|
|
3093 | |
|
|
3094 | =item * one loop per thread is usually a good model. |
|
|
3095 | |
|
|
3096 | Doing this is almost never wrong, sometimes a better-performance model |
|
|
3097 | exists, but it is always a good start. |
|
|
3098 | |
|
|
3099 | =item * other models exist, such as the leader/follower pattern, where one |
|
|
3100 | loop is handed through multiple threads in a kind of round-robbin fashion. |
|
|
3101 | |
|
|
3102 | Chosing a model is hard - look around, learn, know that usually you cna do |
|
|
3103 | better than you currently do :-) |
|
|
3104 | |
|
|
3105 | =item * often you need to talk to some other thread which blocks in the |
|
|
3106 | event loop - C<ev_async> watchers can be used to wake them up from other |
|
|
3107 | threads safely (or from signal contexts...). |
|
|
3108 | |
|
|
3109 | =back |
|
|
3110 | |
|
|
3111 | =head2 COROUTINES |
|
|
3112 | |
|
|
3113 | Libev is much more accomodating to coroutines ("cooperative threads"): |
|
|
3114 | libev fully supports nesting calls to it's functions from different |
|
|
3115 | coroutines (e.g. you can call C<ev_loop> on the same loop from two |
|
|
3116 | different coroutines and switch freely between both coroutines running the |
|
|
3117 | loop, as long as you don't confuse yourself). The only exception is that |
|
|
3118 | you must not do this from C<ev_periodic> reschedule callbacks. |
|
|
3119 | |
|
|
3120 | Care has been invested into making sure that libev does not keep local |
|
|
3121 | state inside C<ev_loop>, and other calls do not usually allow coroutine |
|
|
3122 | switches. |
|
|
3123 | |
|
|
3124 | |
2584 | =head1 COMPLEXITIES |
3125 | =head1 COMPLEXITIES |
2585 | |
3126 | |
2586 | In this section the complexities of (many of) the algorithms used inside |
3127 | In this section the complexities of (many of) the algorithms used inside |
2587 | libev will be explained. For complexity discussions about backends see the |
3128 | libev will be explained. For complexity discussions about backends see the |
2588 | documentation for C<ev_default_init>. |
3129 | documentation for C<ev_default_init>. |
… | |
… | |
2597 | |
3138 | |
2598 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
3139 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
2599 | |
3140 | |
2600 | This means that, when you have a watcher that triggers in one hour and |
3141 | This means that, when you have a watcher that triggers in one hour and |
2601 | there are 100 watchers that would trigger before that then inserting will |
3142 | there are 100 watchers that would trigger before that then inserting will |
2602 | have to skip those 100 watchers. |
3143 | have to skip roughly seven (C<ld 100>) of these watchers. |
2603 | |
3144 | |
2604 | =item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) |
3145 | =item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers) |
2605 | |
3146 | |
2606 | That means that for changing a timer costs less than removing/adding them |
3147 | That means that changing a timer costs less than removing/adding them |
2607 | as only the relative motion in the event queue has to be paid for. |
3148 | as only the relative motion in the event queue has to be paid for. |
2608 | |
3149 | |
2609 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
3150 | =item Starting io/check/prepare/idle/signal/child/fork/async watchers: O(1) |
2610 | |
3151 | |
2611 | These just add the watcher into an array or at the head of a list. |
3152 | These just add the watcher into an array or at the head of a list. |
|
|
3153 | |
2612 | =item Stopping check/prepare/idle watchers: O(1) |
3154 | =item Stopping check/prepare/idle/fork/async watchers: O(1) |
2613 | |
3155 | |
2614 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
3156 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2615 | |
3157 | |
2616 | These watchers are stored in lists then need to be walked to find the |
3158 | These watchers are stored in lists then need to be walked to find the |
2617 | correct watcher to remove. The lists are usually short (you don't usually |
3159 | correct watcher to remove. The lists are usually short (you don't usually |
2618 | have many watchers waiting for the same fd or signal). |
3160 | have many watchers waiting for the same fd or signal). |
2619 | |
3161 | |
2620 | =item Finding the next timer per loop iteration: O(1) |
3162 | =item Finding the next timer in each loop iteration: O(1) |
|
|
3163 | |
|
|
3164 | By virtue of using a binary heap, the next timer is always found at the |
|
|
3165 | beginning of the storage array. |
2621 | |
3166 | |
2622 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
3167 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2623 | |
3168 | |
2624 | A change means an I/O watcher gets started or stopped, which requires |
3169 | A change means an I/O watcher gets started or stopped, which requires |
2625 | libev to recalculate its status (and possibly tell the kernel). |
3170 | libev to recalculate its status (and possibly tell the kernel, depending |
|
|
3171 | on backend and wether C<ev_io_set> was used). |
2626 | |
3172 | |
2627 | =item Activating one watcher: O(1) |
3173 | =item Activating one watcher (putting it into the pending state): O(1) |
2628 | |
3174 | |
2629 | =item Priority handling: O(number_of_priorities) |
3175 | =item Priority handling: O(number_of_priorities) |
2630 | |
3176 | |
2631 | Priorities are implemented by allocating some space for each |
3177 | Priorities are implemented by allocating some space for each |
2632 | priority. When doing priority-based operations, libev usually has to |
3178 | priority. When doing priority-based operations, libev usually has to |
2633 | linearly search all the priorities. |
3179 | linearly search all the priorities, but starting/stopping and activating |
|
|
3180 | watchers becomes O(1) w.r.t. priority handling. |
|
|
3181 | |
|
|
3182 | =item Sending an ev_async: O(1) |
|
|
3183 | |
|
|
3184 | =item Processing ev_async_send: O(number_of_async_watchers) |
|
|
3185 | |
|
|
3186 | =item Processing signals: O(max_signal_number) |
|
|
3187 | |
|
|
3188 | Sending involves a syscall I<iff> there were no other C<ev_async_send> |
|
|
3189 | calls in the current loop iteration. Checking for async and signal events |
|
|
3190 | involves iterating over all running async watchers or all signal numbers. |
2634 | |
3191 | |
2635 | =back |
3192 | =back |
2636 | |
3193 | |
2637 | |
3194 | |
|
|
3195 | =head1 Win32 platform limitations and workarounds |
|
|
3196 | |
|
|
3197 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
|
|
3198 | requires, and its I/O model is fundamentally incompatible with the POSIX |
|
|
3199 | model. Libev still offers limited functionality on this platform in |
|
|
3200 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
|
|
3201 | descriptors. This only applies when using Win32 natively, not when using |
|
|
3202 | e.g. cygwin. |
|
|
3203 | |
|
|
3204 | There is no supported compilation method available on windows except |
|
|
3205 | embedding it into other applications. |
|
|
3206 | |
|
|
3207 | Due to the many, low, and arbitrary limits on the win32 platform and the |
|
|
3208 | abysmal performance of winsockets, using a large number of sockets is not |
|
|
3209 | recommended (and not reasonable). If your program needs to use more than |
|
|
3210 | a hundred or so sockets, then likely it needs to use a totally different |
|
|
3211 | implementation for windows, as libev offers the POSIX model, which cannot |
|
|
3212 | be implemented efficiently on windows (microsoft monopoly games). |
|
|
3213 | |
|
|
3214 | =over 4 |
|
|
3215 | |
|
|
3216 | =item The winsocket select function |
|
|
3217 | |
|
|
3218 | The winsocket C<select> function doesn't follow POSIX in that it requires |
|
|
3219 | socket I<handles> and not socket I<file descriptors>. This makes select |
|
|
3220 | very inefficient, and also requires a mapping from file descriptors |
|
|
3221 | to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>, |
|
|
3222 | C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor |
|
|
3223 | symbols for more info. |
|
|
3224 | |
|
|
3225 | The configuration for a "naked" win32 using the microsoft runtime |
|
|
3226 | libraries and raw winsocket select is: |
|
|
3227 | |
|
|
3228 | #define EV_USE_SELECT 1 |
|
|
3229 | #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ |
|
|
3230 | |
|
|
3231 | Note that winsockets handling of fd sets is O(n), so you can easily get a |
|
|
3232 | complexity in the O(n²) range when using win32. |
|
|
3233 | |
|
|
3234 | =item Limited number of file descriptors |
|
|
3235 | |
|
|
3236 | Windows has numerous arbitrary (and low) limits on things. Early versions |
|
|
3237 | of winsocket's select only supported waiting for a max. of C<64> handles |
|
|
3238 | (probably owning to the fact that all windows kernels can only wait for |
|
|
3239 | C<64> things at the same time internally; microsoft recommends spawning a |
|
|
3240 | chain of threads and wait for 63 handles and the previous thread in each). |
|
|
3241 | |
|
|
3242 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
|
|
3243 | to some high number (e.g. C<2048>) before compiling the winsocket select |
|
|
3244 | call (which might be in libev or elsewhere, for example, perl does its own |
|
|
3245 | select emulation on windows). |
|
|
3246 | |
|
|
3247 | Another limit is the number of file descriptors in the microsoft runtime |
|
|
3248 | libraries, which by default is C<64> (there must be a hidden I<64> fetish |
|
|
3249 | or something like this inside microsoft). You can increase this by calling |
|
|
3250 | C<_setmaxstdio>, which can increase this limit to C<2048> (another |
|
|
3251 | arbitrary limit), but is broken in many versions of the microsoft runtime |
|
|
3252 | libraries. |
|
|
3253 | |
|
|
3254 | This might get you to about C<512> or C<2048> sockets (depending on |
|
|
3255 | windows version and/or the phase of the moon). To get more, you need to |
|
|
3256 | wrap all I/O functions and provide your own fd management, but the cost of |
|
|
3257 | calling select (O(n²)) will likely make this unworkable. |
|
|
3258 | |
|
|
3259 | =back |
|
|
3260 | |
|
|
3261 | |
2638 | =head1 AUTHOR |
3262 | =head1 AUTHOR |
2639 | |
3263 | |
2640 | Marc Lehmann <libev@schmorp.de>. |
3264 | Marc Lehmann <libev@schmorp.de>. |
2641 | |
3265 | |