… | |
… | |
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 | #include <ev.h> |
11 | #include <ev.h> |
12 | |
12 | |
13 | ev_io stdin_watcher; |
13 | ev_io stdin_watcher; |
14 | ev_timer timeout_watcher; |
14 | ev_timer timeout_watcher; |
… | |
… | |
53 | The newest version of this document is also available as a html-formatted |
53 | The newest version of this document is also available as a html-formatted |
54 | web page you might find easier to navigate when reading it for the first |
54 | web page you might find easier to navigate when reading it for the first |
55 | time: L<http://cvs.schmorp.de/libev/ev.html>. |
55 | time: L<http://cvs.schmorp.de/libev/ev.html>. |
56 | |
56 | |
57 | Libev is an event loop: you register interest in certain events (such as a |
57 | Libev is an event loop: you register interest in certain events (such as a |
58 | file descriptor being readable or a timeout occuring), and it will manage |
58 | file descriptor being readable or a timeout occurring), and it will manage |
59 | these event sources and provide your program with events. |
59 | these event sources and provide your program with events. |
60 | |
60 | |
61 | To do this, it must take more or less complete control over your process |
61 | To do this, it must take more or less complete control over your process |
62 | (or thread) by executing the I<event loop> handler, and will then |
62 | (or thread) by executing the I<event loop> handler, and will then |
63 | communicate events via a callback mechanism. |
63 | communicate events via a callback mechanism. |
… | |
… | |
65 | You register interest in certain events by registering so-called I<event |
65 | You register interest in certain events by registering so-called I<event |
66 | watchers>, which are relatively small C structures you initialise with the |
66 | 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 |
67 | details of the event, and then hand it over to libev by I<starting> the |
68 | watcher. |
68 | watcher. |
69 | |
69 | |
70 | =head1 FEATURES |
70 | =head2 FEATURES |
71 | |
71 | |
72 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
72 | Libev supports C<select>, C<poll>, the Linux-specific C<epoll>, the |
73 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
73 | BSD-specific C<kqueue> and the Solaris-specific event port mechanisms |
74 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
74 | for file descriptor events (C<ev_io>), the Linux C<inotify> interface |
75 | (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers |
75 | (for C<ev_stat>), relative timers (C<ev_timer>), absolute timers |
… | |
… | |
82 | |
82 | |
83 | It also is quite fast (see this |
83 | It also is quite fast (see this |
84 | L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent |
84 | L<benchmark|http://libev.schmorp.de/bench.html> comparing it to libevent |
85 | for example). |
85 | for example). |
86 | |
86 | |
87 | =head1 CONVENTIONS |
87 | =head2 CONVENTIONS |
88 | |
88 | |
89 | Libev is very configurable. In this manual the default configuration will |
89 | Libev is very configurable. In this manual the default configuration will |
90 | be described, which supports multiple event loops. For more info about |
90 | be described, which supports multiple event loops. For more info about |
91 | various configuration options please have a look at B<EMBED> section in |
91 | various configuration options please have a look at B<EMBED> section in |
92 | this manual. If libev was configured without support for multiple event |
92 | this manual. If libev was configured without support for multiple event |
93 | loops, then all functions taking an initial argument of name C<loop> |
93 | loops, then all functions taking an initial argument of name C<loop> |
94 | (which is always of type C<struct ev_loop *>) will not have this argument. |
94 | (which is always of type C<struct ev_loop *>) will not have this argument. |
95 | |
95 | |
96 | =head1 TIME REPRESENTATION |
96 | =head2 TIME REPRESENTATION |
97 | |
97 | |
98 | Libev represents time as a single floating point number, representing the |
98 | Libev represents time as a single floating point number, representing the |
99 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
99 | (fractional) number of seconds since the (POSIX) epoch (somewhere near |
100 | the beginning of 1970, details are complicated, don't ask). This type is |
100 | 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 |
101 | called C<ev_tstamp>, which is what you should use too. It usually aliases |
102 | to the C<double> type in C, and when you need to do any calculations on |
102 | to the C<double> type in C, and when you need to do any calculations on |
103 | it, you should treat it as such. |
103 | it, you should treat it as some floatingpoint value. Unlike the name |
|
|
104 | component C<stamp> might indicate, it is also used for time differences |
|
|
105 | throughout libev. |
104 | |
106 | |
105 | =head1 GLOBAL FUNCTIONS |
107 | =head1 GLOBAL FUNCTIONS |
106 | |
108 | |
107 | These functions can be called anytime, even before initialising the |
109 | These functions can be called anytime, even before initialising the |
108 | library in any way. |
110 | library in any way. |
… | |
… | |
113 | |
115 | |
114 | Returns the current time as libev would use it. Please note that the |
116 | Returns the current time as libev would use it. Please note that the |
115 | C<ev_now> function is usually faster and also often returns the timestamp |
117 | C<ev_now> function is usually faster and also often returns the timestamp |
116 | you actually want to know. |
118 | you actually want to know. |
117 | |
119 | |
|
|
120 | =item ev_sleep (ev_tstamp interval) |
|
|
121 | |
|
|
122 | Sleep for the given interval: The current thread will be blocked until |
|
|
123 | either it is interrupted or the given time interval has passed. Basically |
|
|
124 | this is a subsecond-resolution C<sleep ()>. |
|
|
125 | |
118 | =item int ev_version_major () |
126 | =item int ev_version_major () |
119 | |
127 | |
120 | =item int ev_version_minor () |
128 | =item int ev_version_minor () |
121 | |
129 | |
122 | You can find out the major and minor version numbers of the library |
130 | You can find out the major and minor ABI version numbers of the library |
123 | you linked against by calling the functions C<ev_version_major> and |
131 | you linked against by calling the functions C<ev_version_major> and |
124 | C<ev_version_minor>. If you want, you can compare against the global |
132 | C<ev_version_minor>. If you want, you can compare against the global |
125 | symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the |
133 | symbols C<EV_VERSION_MAJOR> and C<EV_VERSION_MINOR>, which specify the |
126 | version of the library your program was compiled against. |
134 | version of the library your program was compiled against. |
127 | |
135 | |
|
|
136 | These version numbers refer to the ABI version of the library, not the |
|
|
137 | release version. |
|
|
138 | |
128 | Usually, it's a good idea to terminate if the major versions mismatch, |
139 | Usually, it's a good idea to terminate if the major versions mismatch, |
129 | as this indicates an incompatible change. Minor versions are usually |
140 | as this indicates an incompatible change. Minor versions are usually |
130 | compatible to older versions, so a larger minor version alone is usually |
141 | compatible to older versions, so a larger minor version alone is usually |
131 | not a problem. |
142 | not a problem. |
132 | |
143 | |
133 | Example: Make sure we haven't accidentally been linked against the wrong |
144 | Example: Make sure we haven't accidentally been linked against the wrong |
134 | version. |
145 | version. |
… | |
… | |
249 | flags. If that is troubling you, check C<ev_backend ()> afterwards). |
260 | flags. If that is troubling you, check C<ev_backend ()> afterwards). |
250 | |
261 | |
251 | If you don't know what event loop to use, use the one returned from this |
262 | If you don't know what event loop to use, use the one returned from this |
252 | function. |
263 | function. |
253 | |
264 | |
|
|
265 | The default loop is the only loop that can handle C<ev_signal> and |
|
|
266 | C<ev_child> watchers, and to do this, it always registers a handler |
|
|
267 | for C<SIGCHLD>. If this is a problem for your app you can either |
|
|
268 | create a dynamic loop with C<ev_loop_new> that doesn't do that, or you |
|
|
269 | can simply overwrite the C<SIGCHLD> signal handler I<after> calling |
|
|
270 | C<ev_default_init>. |
|
|
271 | |
254 | The flags argument can be used to specify special behaviour or specific |
272 | The flags argument can be used to specify special behaviour or specific |
255 | backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). |
273 | backends to use, and is usually specified as C<0> (or C<EVFLAG_AUTO>). |
256 | |
274 | |
257 | The following flags are supported: |
275 | The following flags are supported: |
258 | |
276 | |
… | |
… | |
295 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
313 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
296 | |
314 | |
297 | This is your standard select(2) backend. Not I<completely> standard, as |
315 | This is your standard select(2) backend. Not I<completely> standard, as |
298 | libev tries to roll its own fd_set with no limits on the number of fds, |
316 | libev tries to roll its own fd_set with no limits on the number of fds, |
299 | but if that fails, expect a fairly low limit on the number of fds when |
317 | but if that fails, expect a fairly low limit on the number of fds when |
300 | using this backend. It doesn't scale too well (O(highest_fd)), but its usually |
318 | using this backend. It doesn't scale too well (O(highest_fd)), but its |
301 | the fastest backend for a low number of fds. |
319 | usually the fastest backend for a low number of (low-numbered :) fds. |
|
|
320 | |
|
|
321 | To get good performance out of this backend you need a high amount of |
|
|
322 | parallelity (most of the file descriptors should be busy). If you are |
|
|
323 | writing a server, you should C<accept ()> in a loop to accept as many |
|
|
324 | connections as possible during one iteration. You might also want to have |
|
|
325 | a look at C<ev_set_io_collect_interval ()> to increase the amount of |
|
|
326 | readyness notifications you get per iteration. |
302 | |
327 | |
303 | =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) |
328 | =item C<EVBACKEND_POLL> (value 2, poll backend, available everywhere except on windows) |
304 | |
329 | |
305 | And this is your standard poll(2) backend. It's more complicated than |
330 | And this is your standard poll(2) backend. It's more complicated |
306 | select, but handles sparse fds better and has no artificial limit on the |
331 | than select, but handles sparse fds better and has no artificial |
307 | number of fds you can use (except it will slow down considerably with a |
332 | limit on the number of fds you can use (except it will slow down |
308 | lot of inactive fds). It scales similarly to select, i.e. O(total_fds). |
333 | considerably with a lot of inactive fds). It scales similarly to select, |
|
|
334 | i.e. O(total_fds). See the entry for C<EVBACKEND_SELECT>, above, for |
|
|
335 | performance tips. |
309 | |
336 | |
310 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
337 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
311 | |
338 | |
312 | For few fds, this backend is a bit little slower than poll and select, |
339 | For few fds, this backend is a bit little slower than poll and select, |
313 | but it scales phenomenally better. While poll and select usually scale like |
340 | but it scales phenomenally better. While poll and select usually scale |
314 | O(total_fds) where n is the total number of fds (or the highest fd), epoll scales |
341 | like O(total_fds) where n is the total number of fds (or the highest fd), |
315 | either O(1) or O(active_fds). |
342 | epoll scales either O(1) or O(active_fds). The epoll design has a number |
|
|
343 | of shortcomings, such as silently dropping events in some hard-to-detect |
|
|
344 | cases and rewiring a syscall per fd change, no fork support and bad |
|
|
345 | support for dup. |
316 | |
346 | |
317 | While stopping and starting an I/O watcher in the same iteration will |
347 | While stopping, setting and starting an I/O watcher in the same iteration |
318 | result in some caching, there is still a syscall per such incident |
348 | will result in some caching, there is still a syscall per such incident |
319 | (because the fd could point to a different file description now), so its |
349 | (because the fd could point to a different file description now), so its |
320 | best to avoid that. Also, dup()ed file descriptors might not work very |
350 | best to avoid that. Also, C<dup ()>'ed file descriptors might not work |
321 | well if you register events for both fds. |
351 | very well if you register events for both fds. |
322 | |
352 | |
323 | Please note that epoll sometimes generates spurious notifications, so you |
353 | Please note that epoll sometimes generates spurious notifications, so you |
324 | need to use non-blocking I/O or other means to avoid blocking when no data |
354 | need to use non-blocking I/O or other means to avoid blocking when no data |
325 | (or space) is available. |
355 | (or space) is available. |
326 | |
356 | |
|
|
357 | Best performance from this backend is achieved by not unregistering all |
|
|
358 | watchers for a file descriptor until it has been closed, if possible, i.e. |
|
|
359 | keep at least one watcher active per fd at all times. |
|
|
360 | |
|
|
361 | While nominally embeddeble in other event loops, this feature is broken in |
|
|
362 | all kernel versions tested so far. |
|
|
363 | |
327 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
364 | =item C<EVBACKEND_KQUEUE> (value 8, most BSD clones) |
328 | |
365 | |
329 | Kqueue deserves special mention, as at the time of this writing, it |
366 | Kqueue deserves special mention, as at the time of this writing, it |
330 | was broken on all BSDs except NetBSD (usually it doesn't work with |
367 | was broken on all BSDs except NetBSD (usually it doesn't work reliably |
331 | anything but sockets and pipes, except on Darwin, where of course its |
368 | with anything but sockets and pipes, except on Darwin, where of course |
332 | completely useless). For this reason its not being "autodetected" |
369 | it's completely useless). For this reason it's not being "autodetected" |
333 | unless you explicitly specify it explicitly in the flags (i.e. using |
370 | unless you explicitly specify it explicitly in the flags (i.e. using |
334 | C<EVBACKEND_KQUEUE>). |
371 | C<EVBACKEND_KQUEUE>) or libev was compiled on a known-to-be-good (-enough) |
|
|
372 | system like NetBSD. |
|
|
373 | |
|
|
374 | You still can embed kqueue into a normal poll or select backend and use it |
|
|
375 | only for sockets (after having made sure that sockets work with kqueue on |
|
|
376 | the target platform). See C<ev_embed> watchers for more info. |
335 | |
377 | |
336 | It scales in the same way as the epoll backend, but the interface to the |
378 | It scales in the same way as the epoll backend, but the interface to the |
337 | kernel is more efficient (which says nothing about its actual speed, of |
379 | kernel is more efficient (which says nothing about its actual speed, of |
338 | course). While starting and stopping an I/O watcher does not cause an |
380 | course). While stopping, setting and starting an I/O watcher does never |
339 | extra syscall as with epoll, it still adds up to four event changes per |
381 | cause an extra syscall as with C<EVBACKEND_EPOLL>, it still adds up to |
340 | incident, so its best to avoid that. |
382 | two event changes per incident, support for C<fork ()> is very bad and it |
|
|
383 | drops fds silently in similarly hard-to-detect cases. |
|
|
384 | |
|
|
385 | This backend usually performs well under most conditions. |
|
|
386 | |
|
|
387 | While nominally embeddable in other event loops, this doesn't work |
|
|
388 | everywhere, so you might need to test for this. And since it is broken |
|
|
389 | almost everywhere, you should only use it when you have a lot of sockets |
|
|
390 | (for which it usually works), by embedding it into another event loop |
|
|
391 | (e.g. C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>) and using it only for |
|
|
392 | sockets. |
341 | |
393 | |
342 | =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) |
394 | =item C<EVBACKEND_DEVPOLL> (value 16, Solaris 8) |
343 | |
395 | |
344 | This is not implemented yet (and might never be). |
396 | This is not implemented yet (and might never be, unless you send me an |
|
|
397 | implementation). According to reports, C</dev/poll> only supports sockets |
|
|
398 | and is not embeddable, which would limit the usefulness of this backend |
|
|
399 | immensely. |
345 | |
400 | |
346 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
401 | =item C<EVBACKEND_PORT> (value 32, Solaris 10) |
347 | |
402 | |
348 | This uses the Solaris 10 port mechanism. As with everything on Solaris, |
403 | This uses the Solaris 10 event port mechanism. As with everything on Solaris, |
349 | it's really slow, but it still scales very well (O(active_fds)). |
404 | it's really slow, but it still scales very well (O(active_fds)). |
350 | |
405 | |
351 | Please note that solaris ports can result in a lot of spurious |
406 | Please note that solaris event ports can deliver a lot of spurious |
352 | notifications, so you need to use non-blocking I/O or other means to avoid |
407 | notifications, so you need to use non-blocking I/O or other means to avoid |
353 | blocking when no data (or space) is available. |
408 | blocking when no data (or space) is available. |
|
|
409 | |
|
|
410 | While this backend scales well, it requires one system call per active |
|
|
411 | file descriptor per loop iteration. For small and medium numbers of file |
|
|
412 | descriptors a "slow" C<EVBACKEND_SELECT> or C<EVBACKEND_POLL> backend |
|
|
413 | might perform better. |
|
|
414 | |
|
|
415 | On the positive side, ignoring the spurious readyness notifications, this |
|
|
416 | backend actually performed to specification in all tests and is fully |
|
|
417 | embeddable, which is a rare feat among the OS-specific backends. |
354 | |
418 | |
355 | =item C<EVBACKEND_ALL> |
419 | =item C<EVBACKEND_ALL> |
356 | |
420 | |
357 | Try all backends (even potentially broken ones that wouldn't be tried |
421 | Try all backends (even potentially broken ones that wouldn't be tried |
358 | with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as |
422 | with C<EVFLAG_AUTO>). Since this is a mask, you can do stuff such as |
359 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
423 | C<EVBACKEND_ALL & ~EVBACKEND_KQUEUE>. |
360 | |
424 | |
|
|
425 | It is definitely not recommended to use this flag. |
|
|
426 | |
361 | =back |
427 | =back |
362 | |
428 | |
363 | If one or more of these are ored into the flags value, then only these |
429 | If one or more of these are ored into the flags value, then only these |
364 | backends will be tried (in the reverse order as given here). If none are |
430 | backends will be tried (in the reverse order as listed here). If none are |
365 | specified, most compiled-in backend will be tried, usually in reverse |
431 | specified, all backends in C<ev_recommended_backends ()> will be tried. |
366 | order of their flag values :) |
|
|
367 | |
432 | |
368 | The most typical usage is like this: |
433 | The most typical usage is like this: |
369 | |
434 | |
370 | if (!ev_default_loop (0)) |
435 | if (!ev_default_loop (0)) |
371 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
436 | fatal ("could not initialise libev, bad $LIBEV_FLAGS in environment?"); |
… | |
… | |
399 | Destroys the default loop again (frees all memory and kernel state |
464 | Destroys the default loop again (frees all memory and kernel state |
400 | etc.). None of the active event watchers will be stopped in the normal |
465 | etc.). None of the active event watchers will be stopped in the normal |
401 | sense, so e.g. C<ev_is_active> might still return true. It is your |
466 | sense, so e.g. C<ev_is_active> might still return true. It is your |
402 | responsibility to either stop all watchers cleanly yoursef I<before> |
467 | responsibility to either stop all watchers cleanly yoursef I<before> |
403 | calling this function, or cope with the fact afterwards (which is usually |
468 | calling this function, or cope with the fact afterwards (which is usually |
404 | the easiest thing, youc na just ignore the watchers and/or C<free ()> them |
469 | the easiest thing, you can just ignore the watchers and/or C<free ()> them |
405 | for example). |
470 | for example). |
|
|
471 | |
|
|
472 | Note that certain global state, such as signal state, will not be freed by |
|
|
473 | this function, and related watchers (such as signal and child watchers) |
|
|
474 | would need to be stopped manually. |
|
|
475 | |
|
|
476 | In general it is not advisable to call this function except in the |
|
|
477 | rare occasion where you really need to free e.g. the signal handling |
|
|
478 | pipe fds. If you need dynamically allocated loops it is better to use |
|
|
479 | C<ev_loop_new> and C<ev_loop_destroy>). |
406 | |
480 | |
407 | =item ev_loop_destroy (loop) |
481 | =item ev_loop_destroy (loop) |
408 | |
482 | |
409 | Like C<ev_default_destroy>, but destroys an event loop created by an |
483 | Like C<ev_default_destroy>, but destroys an event loop created by an |
410 | earlier call to C<ev_loop_new>. |
484 | earlier call to C<ev_loop_new>. |
411 | |
485 | |
412 | =item ev_default_fork () |
486 | =item ev_default_fork () |
413 | |
487 | |
|
|
488 | This function sets a flag that causes subsequent C<ev_loop> iterations |
414 | This function reinitialises the kernel state for backends that have |
489 | to reinitialise the kernel state for backends that have one. Despite the |
415 | one. Despite the name, you can call it anytime, but it makes most sense |
490 | name, you can call it anytime, but it makes most sense after forking, in |
416 | after forking, in either the parent or child process (or both, but that |
491 | the child process (or both child and parent, but that again makes little |
417 | again makes little sense). |
492 | sense). You I<must> call it in the child before using any of the libev |
|
|
493 | functions, and it will only take effect at the next C<ev_loop> iteration. |
418 | |
494 | |
419 | You I<must> call this function in the child process after forking if and |
495 | On the other hand, you only need to call this function in the child |
420 | only if you want to use the event library in both processes. If you just |
496 | process if and only if you want to use the event library in the child. If |
421 | fork+exec, you don't have to call it. |
497 | you just fork+exec, you don't have to call it at all. |
422 | |
498 | |
423 | The function itself is quite fast and it's usually not a problem to call |
499 | The function itself is quite fast and it's usually not a problem to call |
424 | it just in case after a fork. To make this easy, the function will fit in |
500 | it just in case after a fork. To make this easy, the function will fit in |
425 | quite nicely into a call to C<pthread_atfork>: |
501 | quite nicely into a call to C<pthread_atfork>: |
426 | |
502 | |
427 | pthread_atfork (0, 0, ev_default_fork); |
503 | pthread_atfork (0, 0, ev_default_fork); |
428 | |
|
|
429 | At the moment, C<EVBACKEND_SELECT> and C<EVBACKEND_POLL> are safe to use |
|
|
430 | without calling this function, so if you force one of those backends you |
|
|
431 | do not need to care. |
|
|
432 | |
504 | |
433 | =item ev_loop_fork (loop) |
505 | =item ev_loop_fork (loop) |
434 | |
506 | |
435 | Like C<ev_default_fork>, but acts on an event loop created by |
507 | Like C<ev_default_fork>, but acts on an event loop created by |
436 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
508 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
… | |
… | |
455 | |
527 | |
456 | Returns the current "event loop time", which is the time the event loop |
528 | Returns the current "event loop time", which is the time the event loop |
457 | received events and started processing them. This timestamp does not |
529 | received events and started processing them. This timestamp does not |
458 | change as long as callbacks are being processed, and this is also the base |
530 | change as long as callbacks are being processed, and this is also the base |
459 | time used for relative timers. You can treat it as the timestamp of the |
531 | time used for relative timers. You can treat it as the timestamp of the |
460 | event occuring (or more correctly, libev finding out about it). |
532 | event occurring (or more correctly, libev finding out about it). |
461 | |
533 | |
462 | =item ev_loop (loop, int flags) |
534 | =item ev_loop (loop, int flags) |
463 | |
535 | |
464 | Finally, this is it, the event handler. This function usually is called |
536 | Finally, this is it, the event handler. This function usually is called |
465 | after you initialised all your watchers and you want to start handling |
537 | after you initialised all your watchers and you want to start handling |
… | |
… | |
486 | libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is |
558 | libev watchers. However, a pair of C<ev_prepare>/C<ev_check> watchers is |
487 | usually a better approach for this kind of thing. |
559 | usually a better approach for this kind of thing. |
488 | |
560 | |
489 | Here are the gory details of what C<ev_loop> does: |
561 | Here are the gory details of what C<ev_loop> does: |
490 | |
562 | |
491 | * If there are no active watchers (reference count is zero), return. |
563 | - Before the first iteration, call any pending watchers. |
492 | - Queue prepare watchers and then call all outstanding watchers. |
564 | * If EVFLAG_FORKCHECK was used, check for a fork. |
|
|
565 | - If a fork was detected, queue and call all fork watchers. |
|
|
566 | - Queue and call all prepare watchers. |
493 | - If we have been forked, recreate the kernel state. |
567 | - If we have been forked, recreate the kernel state. |
494 | - Update the kernel state with all outstanding changes. |
568 | - Update the kernel state with all outstanding changes. |
495 | - Update the "event loop time". |
569 | - Update the "event loop time". |
496 | - Calculate for how long to block. |
570 | - Calculate for how long to sleep or block, if at all |
|
|
571 | (active idle watchers, EVLOOP_NONBLOCK or not having |
|
|
572 | any active watchers at all will result in not sleeping). |
|
|
573 | - Sleep if the I/O and timer collect interval say so. |
497 | - Block the process, waiting for any events. |
574 | - Block the process, waiting for any events. |
498 | - Queue all outstanding I/O (fd) events. |
575 | - Queue all outstanding I/O (fd) events. |
499 | - Update the "event loop time" and do time jump handling. |
576 | - Update the "event loop time" and do time jump handling. |
500 | - Queue all outstanding timers. |
577 | - Queue all outstanding timers. |
501 | - Queue all outstanding periodics. |
578 | - Queue all outstanding periodics. |
502 | - If no events are pending now, queue all idle watchers. |
579 | - If no events are pending now, queue all idle watchers. |
503 | - Queue all check watchers. |
580 | - Queue all check watchers. |
504 | - Call all queued watchers in reverse order (i.e. check watchers first). |
581 | - Call all queued watchers in reverse order (i.e. check watchers first). |
505 | Signals and child watchers are implemented as I/O watchers, and will |
582 | Signals and child watchers are implemented as I/O watchers, and will |
506 | be handled here by queueing them when their watcher gets executed. |
583 | be handled here by queueing them when their watcher gets executed. |
507 | - If ev_unloop has been called or EVLOOP_ONESHOT or EVLOOP_NONBLOCK |
584 | - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK |
508 | were used, return, otherwise continue with step *. |
585 | were used, or there are no active watchers, return, otherwise |
|
|
586 | continue with step *. |
509 | |
587 | |
510 | Example: Queue some jobs and then loop until no events are outsanding |
588 | Example: Queue some jobs and then loop until no events are outstanding |
511 | anymore. |
589 | anymore. |
512 | |
590 | |
513 | ... queue jobs here, make sure they register event watchers as long |
591 | ... queue jobs here, make sure they register event watchers as long |
514 | ... as they still have work to do (even an idle watcher will do..) |
592 | ... as they still have work to do (even an idle watcher will do..) |
515 | ev_loop (my_loop, 0); |
593 | ev_loop (my_loop, 0); |
… | |
… | |
519 | |
597 | |
520 | Can be used to make a call to C<ev_loop> return early (but only after it |
598 | Can be used to make a call to C<ev_loop> return early (but only after it |
521 | has processed all outstanding events). The C<how> argument must be either |
599 | has processed all outstanding events). The C<how> argument must be either |
522 | C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or |
600 | C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or |
523 | C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. |
601 | C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. |
|
|
602 | |
|
|
603 | This "unloop state" will be cleared when entering C<ev_loop> again. |
524 | |
604 | |
525 | =item ev_ref (loop) |
605 | =item ev_ref (loop) |
526 | |
606 | |
527 | =item ev_unref (loop) |
607 | =item ev_unref (loop) |
528 | |
608 | |
… | |
… | |
533 | returning, ev_unref() after starting, and ev_ref() before stopping it. For |
613 | returning, ev_unref() after starting, and ev_ref() before stopping it. For |
534 | example, libev itself uses this for its internal signal pipe: It is not |
614 | example, libev itself uses this for its internal signal pipe: It is not |
535 | visible to the libev user and should not keep C<ev_loop> from exiting if |
615 | visible to the libev user and should not keep C<ev_loop> from exiting if |
536 | no event watchers registered by it are active. It is also an excellent |
616 | no event watchers registered by it are active. It is also an excellent |
537 | way to do this for generic recurring timers or from within third-party |
617 | way to do this for generic recurring timers or from within third-party |
538 | libraries. Just remember to I<unref after start> and I<ref before stop>. |
618 | libraries. Just remember to I<unref after start> and I<ref before stop> |
|
|
619 | (but only if the watcher wasn't active before, or was active before, |
|
|
620 | respectively). |
539 | |
621 | |
540 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
622 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
541 | running when nothing else is active. |
623 | running when nothing else is active. |
542 | |
624 | |
543 | struct ev_signal exitsig; |
625 | struct ev_signal exitsig; |
… | |
… | |
547 | |
629 | |
548 | Example: For some weird reason, unregister the above signal handler again. |
630 | Example: For some weird reason, unregister the above signal handler again. |
549 | |
631 | |
550 | ev_ref (loop); |
632 | ev_ref (loop); |
551 | ev_signal_stop (loop, &exitsig); |
633 | ev_signal_stop (loop, &exitsig); |
|
|
634 | |
|
|
635 | =item ev_set_io_collect_interval (loop, ev_tstamp interval) |
|
|
636 | |
|
|
637 | =item ev_set_timeout_collect_interval (loop, ev_tstamp interval) |
|
|
638 | |
|
|
639 | These advanced functions influence the time that libev will spend waiting |
|
|
640 | for events. Both are by default C<0>, meaning that libev will try to |
|
|
641 | invoke timer/periodic callbacks and I/O callbacks with minimum latency. |
|
|
642 | |
|
|
643 | Setting these to a higher value (the C<interval> I<must> be >= C<0>) |
|
|
644 | allows libev to delay invocation of I/O and timer/periodic callbacks to |
|
|
645 | increase efficiency of loop iterations. |
|
|
646 | |
|
|
647 | The background is that sometimes your program runs just fast enough to |
|
|
648 | handle one (or very few) event(s) per loop iteration. While this makes |
|
|
649 | the program responsive, it also wastes a lot of CPU time to poll for new |
|
|
650 | events, especially with backends like C<select ()> which have a high |
|
|
651 | overhead for the actual polling but can deliver many events at once. |
|
|
652 | |
|
|
653 | By setting a higher I<io collect interval> you allow libev to spend more |
|
|
654 | time collecting I/O events, so you can handle more events per iteration, |
|
|
655 | at the cost of increasing latency. Timeouts (both C<ev_periodic> and |
|
|
656 | C<ev_timer>) will be not affected. Setting this to a non-null value will |
|
|
657 | introduce an additional C<ev_sleep ()> call into most loop iterations. |
|
|
658 | |
|
|
659 | Likewise, by setting a higher I<timeout collect interval> you allow libev |
|
|
660 | to spend more time collecting timeouts, at the expense of increased |
|
|
661 | latency (the watcher callback will be called later). C<ev_io> watchers |
|
|
662 | will not be affected. Setting this to a non-null value will not introduce |
|
|
663 | any overhead in libev. |
|
|
664 | |
|
|
665 | Many (busy) programs can usually benefit by setting the io collect |
|
|
666 | interval to a value near C<0.1> or so, which is often enough for |
|
|
667 | interactive servers (of course not for games), likewise for timeouts. It |
|
|
668 | usually doesn't make much sense to set it to a lower value than C<0.01>, |
|
|
669 | as this approsaches the timing granularity of most systems. |
552 | |
670 | |
553 | =back |
671 | =back |
554 | |
672 | |
555 | |
673 | |
556 | =head1 ANATOMY OF A WATCHER |
674 | =head1 ANATOMY OF A WATCHER |
… | |
… | |
656 | =item C<EV_FORK> |
774 | =item C<EV_FORK> |
657 | |
775 | |
658 | The event loop has been resumed in the child process after fork (see |
776 | The event loop has been resumed in the child process after fork (see |
659 | C<ev_fork>). |
777 | C<ev_fork>). |
660 | |
778 | |
|
|
779 | =item C<EV_ASYNC> |
|
|
780 | |
|
|
781 | The given async watcher has been asynchronously notified (see C<ev_async>). |
|
|
782 | |
661 | =item C<EV_ERROR> |
783 | =item C<EV_ERROR> |
662 | |
784 | |
663 | An unspecified error has occured, the watcher has been stopped. This might |
785 | An unspecified error has occured, the watcher has been stopped. This might |
664 | happen because the watcher could not be properly started because libev |
786 | happen because the watcher could not be properly started because libev |
665 | ran out of memory, a file descriptor was found to be closed or any other |
787 | ran out of memory, a file descriptor was found to be closed or any other |
… | |
… | |
776 | always C<0>, which is supposed to not be too high and not be too low :). |
898 | always C<0>, which is supposed to not be too high and not be too low :). |
777 | |
899 | |
778 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
900 | Setting a priority outside the range of C<EV_MINPRI> to C<EV_MAXPRI> is |
779 | fine, as long as you do not mind that the priority value you query might |
901 | fine, as long as you do not mind that the priority value you query might |
780 | or might not have been adjusted to be within valid range. |
902 | or might not have been adjusted to be within valid range. |
|
|
903 | |
|
|
904 | =item ev_invoke (loop, ev_TYPE *watcher, int revents) |
|
|
905 | |
|
|
906 | Invoke the C<watcher> with the given C<loop> and C<revents>. Neither |
|
|
907 | C<loop> nor C<revents> need to be valid as long as the watcher callback |
|
|
908 | can deal with that fact. |
|
|
909 | |
|
|
910 | =item int ev_clear_pending (loop, ev_TYPE *watcher) |
|
|
911 | |
|
|
912 | If the watcher is pending, this function returns clears its pending status |
|
|
913 | and returns its C<revents> bitset (as if its callback was invoked). If the |
|
|
914 | watcher isn't pending it does nothing and returns C<0>. |
781 | |
915 | |
782 | =back |
916 | =back |
783 | |
917 | |
784 | |
918 | |
785 | =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER |
919 | =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER |
… | |
… | |
870 | In general you can register as many read and/or write event watchers per |
1004 | In general you can register as many read and/or write event watchers per |
871 | fd as you want (as long as you don't confuse yourself). Setting all file |
1005 | fd as you want (as long as you don't confuse yourself). Setting all file |
872 | descriptors to non-blocking mode is also usually a good idea (but not |
1006 | descriptors to non-blocking mode is also usually a good idea (but not |
873 | required if you know what you are doing). |
1007 | required if you know what you are doing). |
874 | |
1008 | |
875 | You have to be careful with dup'ed file descriptors, though. Some backends |
|
|
876 | (the linux epoll backend is a notable example) cannot handle dup'ed file |
|
|
877 | descriptors correctly if you register interest in two or more fds pointing |
|
|
878 | to the same underlying file/socket/etc. description (that is, they share |
|
|
879 | the same underlying "file open"). |
|
|
880 | |
|
|
881 | If you must do this, then force the use of a known-to-be-good backend |
1009 | If you must do this, then force the use of a known-to-be-good backend |
882 | (at the time of this writing, this includes only C<EVBACKEND_SELECT> and |
1010 | (at the time of this writing, this includes only C<EVBACKEND_SELECT> and |
883 | C<EVBACKEND_POLL>). |
1011 | C<EVBACKEND_POLL>). |
884 | |
1012 | |
885 | Another thing you have to watch out for is that it is quite easy to |
1013 | Another thing you have to watch out for is that it is quite easy to |
… | |
… | |
895 | play around with an Xlib connection), then you have to seperately re-test |
1023 | play around with an Xlib connection), then you have to seperately re-test |
896 | whether a file descriptor is really ready with a known-to-be good interface |
1024 | whether a file descriptor is really ready with a known-to-be good interface |
897 | such as poll (fortunately in our Xlib example, Xlib already does this on |
1025 | such as poll (fortunately in our Xlib example, Xlib already does this on |
898 | its own, so its quite safe to use). |
1026 | its own, so its quite safe to use). |
899 | |
1027 | |
|
|
1028 | =head3 The special problem of disappearing file descriptors |
|
|
1029 | |
|
|
1030 | Some backends (e.g. kqueue, epoll) need to be told about closing a file |
|
|
1031 | descriptor (either by calling C<close> explicitly or by any other means, |
|
|
1032 | such as C<dup>). The reason is that you register interest in some file |
|
|
1033 | descriptor, but when it goes away, the operating system will silently drop |
|
|
1034 | this interest. If another file descriptor with the same number then is |
|
|
1035 | registered with libev, there is no efficient way to see that this is, in |
|
|
1036 | fact, a different file descriptor. |
|
|
1037 | |
|
|
1038 | To avoid having to explicitly tell libev about such cases, libev follows |
|
|
1039 | the following policy: Each time C<ev_io_set> is being called, libev |
|
|
1040 | will assume that this is potentially a new file descriptor, otherwise |
|
|
1041 | it is assumed that the file descriptor stays the same. That means that |
|
|
1042 | you I<have> to call C<ev_io_set> (or C<ev_io_init>) when you change the |
|
|
1043 | descriptor even if the file descriptor number itself did not change. |
|
|
1044 | |
|
|
1045 | This is how one would do it normally anyway, the important point is that |
|
|
1046 | the libev application should not optimise around libev but should leave |
|
|
1047 | optimisations to libev. |
|
|
1048 | |
|
|
1049 | =head3 The special problem of dup'ed file descriptors |
|
|
1050 | |
|
|
1051 | Some backends (e.g. epoll), cannot register events for file descriptors, |
|
|
1052 | but only events for the underlying file descriptions. That means when you |
|
|
1053 | have C<dup ()>'ed file descriptors or weirder constellations, and register |
|
|
1054 | events for them, only one file descriptor might actually receive events. |
|
|
1055 | |
|
|
1056 | There is no workaround possible except not registering events |
|
|
1057 | for potentially C<dup ()>'ed file descriptors, or to resort to |
|
|
1058 | C<EVBACKEND_SELECT> or C<EVBACKEND_POLL>. |
|
|
1059 | |
|
|
1060 | =head3 The special problem of fork |
|
|
1061 | |
|
|
1062 | Some backends (epoll, kqueue) do not support C<fork ()> at all or exhibit |
|
|
1063 | useless behaviour. Libev fully supports fork, but needs to be told about |
|
|
1064 | it in the child. |
|
|
1065 | |
|
|
1066 | To support fork in your programs, you either have to call |
|
|
1067 | C<ev_default_fork ()> or C<ev_loop_fork ()> after a fork in the child, |
|
|
1068 | enable C<EVFLAG_FORKCHECK>, or resort to C<EVBACKEND_SELECT> or |
|
|
1069 | C<EVBACKEND_POLL>. |
|
|
1070 | |
|
|
1071 | |
|
|
1072 | =head3 Watcher-Specific Functions |
|
|
1073 | |
900 | =over 4 |
1074 | =over 4 |
901 | |
1075 | |
902 | =item ev_io_init (ev_io *, callback, int fd, int events) |
1076 | =item ev_io_init (ev_io *, callback, int fd, int events) |
903 | |
1077 | |
904 | =item ev_io_set (ev_io *, int fd, int events) |
1078 | =item ev_io_set (ev_io *, int fd, int events) |
… | |
… | |
914 | =item int events [read-only] |
1088 | =item int events [read-only] |
915 | |
1089 | |
916 | The events being watched. |
1090 | The events being watched. |
917 | |
1091 | |
918 | =back |
1092 | =back |
|
|
1093 | |
|
|
1094 | =head3 Examples |
919 | |
1095 | |
920 | Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well |
1096 | Example: Call C<stdin_readable_cb> when STDIN_FILENO has become, well |
921 | readable, but only once. Since it is likely line-buffered, you could |
1097 | readable, but only once. Since it is likely line-buffered, you could |
922 | attempt to read a whole line in the callback. |
1098 | attempt to read a whole line in the callback. |
923 | |
1099 | |
… | |
… | |
956 | ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); |
1132 | ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); |
957 | |
1133 | |
958 | The callback is guarenteed to be invoked only when its timeout has passed, |
1134 | The callback is guarenteed to be invoked only when its timeout has passed, |
959 | but if multiple timers become ready during the same loop iteration then |
1135 | but if multiple timers become ready during the same loop iteration then |
960 | order of execution is undefined. |
1136 | order of execution is undefined. |
|
|
1137 | |
|
|
1138 | =head3 Watcher-Specific Functions and Data Members |
961 | |
1139 | |
962 | =over 4 |
1140 | =over 4 |
963 | |
1141 | |
964 | =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) |
1142 | =item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) |
965 | |
1143 | |
… | |
… | |
1019 | or C<ev_timer_again> is called and determines the next timeout (if any), |
1197 | or C<ev_timer_again> is called and determines the next timeout (if any), |
1020 | which is also when any modifications are taken into account. |
1198 | which is also when any modifications are taken into account. |
1021 | |
1199 | |
1022 | =back |
1200 | =back |
1023 | |
1201 | |
|
|
1202 | =head3 Examples |
|
|
1203 | |
1024 | Example: Create a timer that fires after 60 seconds. |
1204 | Example: Create a timer that fires after 60 seconds. |
1025 | |
1205 | |
1026 | static void |
1206 | static void |
1027 | one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) |
1207 | one_minute_cb (struct ev_loop *loop, struct ev_timer *w, int revents) |
1028 | { |
1208 | { |
… | |
… | |
1061 | but on wallclock time (absolute time). You can tell a periodic watcher |
1241 | but on wallclock time (absolute time). You can tell a periodic watcher |
1062 | to trigger "at" some specific point in time. For example, if you tell a |
1242 | to trigger "at" some specific point in time. For example, if you tell a |
1063 | periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () |
1243 | periodic watcher to trigger in 10 seconds (by specifiying e.g. C<ev_now () |
1064 | + 10.>) and then reset your system clock to the last year, then it will |
1244 | + 10.>) and then reset your system clock to the last year, then it will |
1065 | take a year to trigger the event (unlike an C<ev_timer>, which would trigger |
1245 | take a year to trigger the event (unlike an C<ev_timer>, which would trigger |
1066 | roughly 10 seconds later and of course not if you reset your system time |
1246 | roughly 10 seconds later). |
1067 | again). |
|
|
1068 | |
1247 | |
1069 | They can also be used to implement vastly more complex timers, such as |
1248 | They can also be used to implement vastly more complex timers, such as |
1070 | triggering an event on eahc midnight, local time. |
1249 | triggering an event on each midnight, local time or other, complicated, |
|
|
1250 | rules. |
1071 | |
1251 | |
1072 | As with timers, the callback is guarenteed to be invoked only when the |
1252 | As with timers, the callback is guarenteed to be invoked only when the |
1073 | time (C<at>) has been passed, but if multiple periodic timers become ready |
1253 | time (C<at>) has been passed, but if multiple periodic timers become ready |
1074 | during the same loop iteration then order of execution is undefined. |
1254 | during the same loop iteration then order of execution is undefined. |
1075 | |
1255 | |
|
|
1256 | =head3 Watcher-Specific Functions and Data Members |
|
|
1257 | |
1076 | =over 4 |
1258 | =over 4 |
1077 | |
1259 | |
1078 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) |
1260 | =item ev_periodic_init (ev_periodic *, callback, ev_tstamp at, ev_tstamp interval, reschedule_cb) |
1079 | |
1261 | |
1080 | =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) |
1262 | =item ev_periodic_set (ev_periodic *, ev_tstamp after, ev_tstamp repeat, reschedule_cb) |
… | |
… | |
1082 | Lots of arguments, lets sort it out... There are basically three modes of |
1264 | Lots of arguments, lets sort it out... There are basically three modes of |
1083 | operation, and we will explain them from simplest to complex: |
1265 | operation, and we will explain them from simplest to complex: |
1084 | |
1266 | |
1085 | =over 4 |
1267 | =over 4 |
1086 | |
1268 | |
1087 | =item * absolute timer (interval = reschedule_cb = 0) |
1269 | =item * absolute timer (at = time, interval = reschedule_cb = 0) |
1088 | |
1270 | |
1089 | In this configuration the watcher triggers an event at the wallclock time |
1271 | In this configuration the watcher triggers an event at the wallclock time |
1090 | C<at> and doesn't repeat. It will not adjust when a time jump occurs, |
1272 | C<at> and doesn't repeat. It will not adjust when a time jump occurs, |
1091 | that is, if it is to be run at January 1st 2011 then it will run when the |
1273 | that is, if it is to be run at January 1st 2011 then it will run when the |
1092 | system time reaches or surpasses this time. |
1274 | system time reaches or surpasses this time. |
1093 | |
1275 | |
1094 | =item * non-repeating interval timer (interval > 0, reschedule_cb = 0) |
1276 | =item * non-repeating interval timer (at = offset, interval > 0, reschedule_cb = 0) |
1095 | |
1277 | |
1096 | In this mode the watcher will always be scheduled to time out at the next |
1278 | In this mode the watcher will always be scheduled to time out at the next |
1097 | C<at + N * interval> time (for some integer N) and then repeat, regardless |
1279 | C<at + N * interval> time (for some integer N, which can also be negative) |
1098 | of any time jumps. |
1280 | and then repeat, regardless of any time jumps. |
1099 | |
1281 | |
1100 | This can be used to create timers that do not drift with respect to system |
1282 | This can be used to create timers that do not drift with respect to system |
1101 | time: |
1283 | time: |
1102 | |
1284 | |
1103 | ev_periodic_set (&periodic, 0., 3600., 0); |
1285 | ev_periodic_set (&periodic, 0., 3600., 0); |
… | |
… | |
1109 | |
1291 | |
1110 | Another way to think about it (for the mathematically inclined) is that |
1292 | Another way to think about it (for the mathematically inclined) is that |
1111 | C<ev_periodic> will try to run the callback in this mode at the next possible |
1293 | C<ev_periodic> will try to run the callback in this mode at the next possible |
1112 | time where C<time = at (mod interval)>, regardless of any time jumps. |
1294 | time where C<time = at (mod interval)>, regardless of any time jumps. |
1113 | |
1295 | |
|
|
1296 | For numerical stability it is preferable that the C<at> value is near |
|
|
1297 | C<ev_now ()> (the current time), but there is no range requirement for |
|
|
1298 | this value. |
|
|
1299 | |
1114 | =item * manual reschedule mode (reschedule_cb = callback) |
1300 | =item * manual reschedule mode (at and interval ignored, reschedule_cb = callback) |
1115 | |
1301 | |
1116 | In this mode the values for C<interval> and C<at> are both being |
1302 | In this mode the values for C<interval> and C<at> are both being |
1117 | ignored. Instead, each time the periodic watcher gets scheduled, the |
1303 | ignored. Instead, each time the periodic watcher gets scheduled, the |
1118 | reschedule callback will be called with the watcher as first, and the |
1304 | reschedule callback will be called with the watcher as first, and the |
1119 | current time as second argument. |
1305 | current time as second argument. |
1120 | |
1306 | |
1121 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, |
1307 | NOTE: I<This callback MUST NOT stop or destroy any periodic watcher, |
1122 | ever, or make any event loop modifications>. If you need to stop it, |
1308 | ever, or make any event loop modifications>. If you need to stop it, |
1123 | return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by |
1309 | return C<now + 1e30> (or so, fudge fudge) and stop it afterwards (e.g. by |
1124 | starting a prepare watcher). |
1310 | starting an C<ev_prepare> watcher, which is legal). |
1125 | |
1311 | |
1126 | Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, |
1312 | Its prototype is C<ev_tstamp (*reschedule_cb)(struct ev_periodic *w, |
1127 | ev_tstamp now)>, e.g.: |
1313 | ev_tstamp now)>, e.g.: |
1128 | |
1314 | |
1129 | static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) |
1315 | static ev_tstamp my_rescheduler (struct ev_periodic *w, ev_tstamp now) |
… | |
… | |
1152 | Simply stops and restarts the periodic watcher again. This is only useful |
1338 | Simply stops and restarts the periodic watcher again. This is only useful |
1153 | when you changed some parameters or the reschedule callback would return |
1339 | when you changed some parameters or the reschedule callback would return |
1154 | a different time than the last time it was called (e.g. in a crond like |
1340 | a different time than the last time it was called (e.g. in a crond like |
1155 | program when the crontabs have changed). |
1341 | program when the crontabs have changed). |
1156 | |
1342 | |
|
|
1343 | =item ev_tstamp offset [read-write] |
|
|
1344 | |
|
|
1345 | When repeating, this contains the offset value, otherwise this is the |
|
|
1346 | absolute point in time (the C<at> value passed to C<ev_periodic_set>). |
|
|
1347 | |
|
|
1348 | Can be modified any time, but changes only take effect when the periodic |
|
|
1349 | timer fires or C<ev_periodic_again> is being called. |
|
|
1350 | |
1157 | =item ev_tstamp interval [read-write] |
1351 | =item ev_tstamp interval [read-write] |
1158 | |
1352 | |
1159 | The current interval value. Can be modified any time, but changes only |
1353 | The current interval value. Can be modified any time, but changes only |
1160 | take effect when the periodic timer fires or C<ev_periodic_again> is being |
1354 | take effect when the periodic timer fires or C<ev_periodic_again> is being |
1161 | called. |
1355 | called. |
… | |
… | |
1164 | |
1358 | |
1165 | The current reschedule callback, or C<0>, if this functionality is |
1359 | The current reschedule callback, or C<0>, if this functionality is |
1166 | switched off. Can be changed any time, but changes only take effect when |
1360 | switched off. Can be changed any time, but changes only take effect when |
1167 | the periodic timer fires or C<ev_periodic_again> is being called. |
1361 | the periodic timer fires or C<ev_periodic_again> is being called. |
1168 | |
1362 | |
|
|
1363 | =item ev_tstamp at [read-only] |
|
|
1364 | |
|
|
1365 | When active, contains the absolute time that the watcher is supposed to |
|
|
1366 | trigger next. |
|
|
1367 | |
1169 | =back |
1368 | =back |
|
|
1369 | |
|
|
1370 | =head3 Examples |
1170 | |
1371 | |
1171 | Example: Call a callback every hour, or, more precisely, whenever the |
1372 | Example: Call a callback every hour, or, more precisely, whenever the |
1172 | system clock is divisible by 3600. The callback invocation times have |
1373 | system clock is divisible by 3600. The callback invocation times have |
1173 | potentially a lot of jittering, but good long-term stability. |
1374 | potentially a lot of jittering, but good long-term stability. |
1174 | |
1375 | |
… | |
… | |
1214 | with the kernel (thus it coexists with your own signal handlers as long |
1415 | with the kernel (thus it coexists with your own signal handlers as long |
1215 | as you don't register any with libev). Similarly, when the last signal |
1416 | as you don't register any with libev). Similarly, when the last signal |
1216 | watcher for a signal is stopped libev will reset the signal handler to |
1417 | watcher for a signal is stopped libev will reset the signal handler to |
1217 | SIG_DFL (regardless of what it was set to before). |
1418 | SIG_DFL (regardless of what it was set to before). |
1218 | |
1419 | |
|
|
1420 | =head3 Watcher-Specific Functions and Data Members |
|
|
1421 | |
1219 | =over 4 |
1422 | =over 4 |
1220 | |
1423 | |
1221 | =item ev_signal_init (ev_signal *, callback, int signum) |
1424 | =item ev_signal_init (ev_signal *, callback, int signum) |
1222 | |
1425 | |
1223 | =item ev_signal_set (ev_signal *, int signum) |
1426 | =item ev_signal_set (ev_signal *, int signum) |
… | |
… | |
1235 | =head2 C<ev_child> - watch out for process status changes |
1438 | =head2 C<ev_child> - watch out for process status changes |
1236 | |
1439 | |
1237 | Child watchers trigger when your process receives a SIGCHLD in response to |
1440 | Child watchers trigger when your process receives a SIGCHLD in response to |
1238 | some child status changes (most typically when a child of yours dies). |
1441 | some child status changes (most typically when a child of yours dies). |
1239 | |
1442 | |
|
|
1443 | =head3 Watcher-Specific Functions and Data Members |
|
|
1444 | |
1240 | =over 4 |
1445 | =over 4 |
1241 | |
1446 | |
1242 | =item ev_child_init (ev_child *, callback, int pid) |
1447 | =item ev_child_init (ev_child *, callback, int pid, int trace) |
1243 | |
1448 | |
1244 | =item ev_child_set (ev_child *, int pid) |
1449 | =item ev_child_set (ev_child *, int pid, int trace) |
1245 | |
1450 | |
1246 | Configures the watcher to wait for status changes of process C<pid> (or |
1451 | Configures the watcher to wait for status changes of process C<pid> (or |
1247 | I<any> process if C<pid> is specified as C<0>). The callback can look |
1452 | I<any> process if C<pid> is specified as C<0>). The callback can look |
1248 | at the C<rstatus> member of the C<ev_child> watcher structure to see |
1453 | at the C<rstatus> member of the C<ev_child> watcher structure to see |
1249 | the status word (use the macros from C<sys/wait.h> and see your systems |
1454 | the status word (use the macros from C<sys/wait.h> and see your systems |
1250 | C<waitpid> documentation). The C<rpid> member contains the pid of the |
1455 | C<waitpid> documentation). The C<rpid> member contains the pid of the |
1251 | process causing the status change. |
1456 | process causing the status change. C<trace> must be either C<0> (only |
|
|
1457 | activate the watcher when the process terminates) or C<1> (additionally |
|
|
1458 | activate the watcher when the process is stopped or continued). |
1252 | |
1459 | |
1253 | =item int pid [read-only] |
1460 | =item int pid [read-only] |
1254 | |
1461 | |
1255 | The process id this watcher watches out for, or C<0>, meaning any process id. |
1462 | The process id this watcher watches out for, or C<0>, meaning any process id. |
1256 | |
1463 | |
… | |
… | |
1262 | |
1469 | |
1263 | The process exit/trace status caused by C<rpid> (see your systems |
1470 | The process exit/trace status caused by C<rpid> (see your systems |
1264 | C<waitpid> and C<sys/wait.h> documentation for details). |
1471 | C<waitpid> and C<sys/wait.h> documentation for details). |
1265 | |
1472 | |
1266 | =back |
1473 | =back |
|
|
1474 | |
|
|
1475 | =head3 Examples |
1267 | |
1476 | |
1268 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1477 | Example: Try to exit cleanly on SIGINT and SIGTERM. |
1269 | |
1478 | |
1270 | static void |
1479 | static void |
1271 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
1480 | sigint_cb (struct ev_loop *loop, struct ev_signal *w, int revents) |
… | |
… | |
1312 | semantics of C<ev_stat> watchers, which means that libev sometimes needs |
1521 | semantics of C<ev_stat> watchers, which means that libev sometimes needs |
1313 | to fall back to regular polling again even with inotify, but changes are |
1522 | to fall back to regular polling again even with inotify, but changes are |
1314 | usually detected immediately, and if the file exists there will be no |
1523 | usually detected immediately, and if the file exists there will be no |
1315 | polling. |
1524 | polling. |
1316 | |
1525 | |
|
|
1526 | =head3 Inotify |
|
|
1527 | |
|
|
1528 | When C<inotify (7)> support has been compiled into libev (generally only |
|
|
1529 | available on Linux) and present at runtime, it will be used to speed up |
|
|
1530 | change detection where possible. The inotify descriptor will be created lazily |
|
|
1531 | when the first C<ev_stat> watcher is being started. |
|
|
1532 | |
|
|
1533 | Inotify presense does not change the semantics of C<ev_stat> watchers |
|
|
1534 | except that changes might be detected earlier, and in some cases, to avoid |
|
|
1535 | making regular C<stat> calls. Even in the presense of inotify support |
|
|
1536 | there are many cases where libev has to resort to regular C<stat> polling. |
|
|
1537 | |
|
|
1538 | (There is no support for kqueue, as apparently it cannot be used to |
|
|
1539 | implement this functionality, due to the requirement of having a file |
|
|
1540 | descriptor open on the object at all times). |
|
|
1541 | |
|
|
1542 | =head3 The special problem of stat time resolution |
|
|
1543 | |
|
|
1544 | The C<stat ()> syscall only supports full-second resolution portably, and |
|
|
1545 | even on systems where the resolution is higher, many filesystems still |
|
|
1546 | only support whole seconds. |
|
|
1547 | |
|
|
1548 | That means that, if the time is the only thing that changes, you might |
|
|
1549 | miss updates: on the first update, C<ev_stat> detects a change and calls |
|
|
1550 | your callback, which does something. When there is another update within |
|
|
1551 | the same second, C<ev_stat> will be unable to detect it. |
|
|
1552 | |
|
|
1553 | The solution to this is to delay acting on a change for a second (or till |
|
|
1554 | the next second boundary), using a roughly one-second delay C<ev_timer> |
|
|
1555 | (C<ev_timer_set (w, 0., 1.01); ev_timer_again (loop, w)>). The C<.01> |
|
|
1556 | is added to work around small timing inconsistencies of some operating |
|
|
1557 | systems. |
|
|
1558 | |
|
|
1559 | =head3 Watcher-Specific Functions and Data Members |
|
|
1560 | |
1317 | =over 4 |
1561 | =over 4 |
1318 | |
1562 | |
1319 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
1563 | =item ev_stat_init (ev_stat *, callback, const char *path, ev_tstamp interval) |
1320 | |
1564 | |
1321 | =item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval) |
1565 | =item ev_stat_set (ev_stat *, const char *path, ev_tstamp interval) |
… | |
… | |
1356 | =item const char *path [read-only] |
1600 | =item const char *path [read-only] |
1357 | |
1601 | |
1358 | The filesystem path that is being watched. |
1602 | The filesystem path that is being watched. |
1359 | |
1603 | |
1360 | =back |
1604 | =back |
|
|
1605 | |
|
|
1606 | =head3 Examples |
1361 | |
1607 | |
1362 | Example: Watch C</etc/passwd> for attribute changes. |
1608 | Example: Watch C</etc/passwd> for attribute changes. |
1363 | |
1609 | |
1364 | static void |
1610 | static void |
1365 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
1611 | passwd_cb (struct ev_loop *loop, ev_stat *w, int revents) |
… | |
… | |
1378 | } |
1624 | } |
1379 | |
1625 | |
1380 | ... |
1626 | ... |
1381 | ev_stat passwd; |
1627 | ev_stat passwd; |
1382 | |
1628 | |
1383 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd"); |
1629 | ev_stat_init (&passwd, passwd_cb, "/etc/passwd", 0.); |
1384 | ev_stat_start (loop, &passwd); |
1630 | ev_stat_start (loop, &passwd); |
|
|
1631 | |
|
|
1632 | Example: Like above, but additionally use a one-second delay so we do not |
|
|
1633 | miss updates (however, frequent updates will delay processing, too, so |
|
|
1634 | one might do the work both on C<ev_stat> callback invocation I<and> on |
|
|
1635 | C<ev_timer> callback invocation). |
|
|
1636 | |
|
|
1637 | static ev_stat passwd; |
|
|
1638 | static ev_timer timer; |
|
|
1639 | |
|
|
1640 | static void |
|
|
1641 | timer_cb (EV_P_ ev_timer *w, int revents) |
|
|
1642 | { |
|
|
1643 | ev_timer_stop (EV_A_ w); |
|
|
1644 | |
|
|
1645 | /* now it's one second after the most recent passwd change */ |
|
|
1646 | } |
|
|
1647 | |
|
|
1648 | static void |
|
|
1649 | stat_cb (EV_P_ ev_stat *w, int revents) |
|
|
1650 | { |
|
|
1651 | /* reset the one-second timer */ |
|
|
1652 | ev_timer_again (EV_A_ &timer); |
|
|
1653 | } |
|
|
1654 | |
|
|
1655 | ... |
|
|
1656 | ev_stat_init (&passwd, stat_cb, "/etc/passwd", 0.); |
|
|
1657 | ev_stat_start (loop, &passwd); |
|
|
1658 | ev_timer_init (&timer, timer_cb, 0., 1.01); |
1385 | |
1659 | |
1386 | |
1660 | |
1387 | =head2 C<ev_idle> - when you've got nothing better to do... |
1661 | =head2 C<ev_idle> - when you've got nothing better to do... |
1388 | |
1662 | |
1389 | Idle watchers trigger events when no other events of the same or higher |
1663 | Idle watchers trigger events when no other events of the same or higher |
… | |
… | |
1403 | Apart from keeping your process non-blocking (which is a useful |
1677 | Apart from keeping your process non-blocking (which is a useful |
1404 | effect on its own sometimes), idle watchers are a good place to do |
1678 | effect on its own sometimes), idle watchers are a good place to do |
1405 | "pseudo-background processing", or delay processing stuff to after the |
1679 | "pseudo-background processing", or delay processing stuff to after the |
1406 | event loop has handled all outstanding events. |
1680 | event loop has handled all outstanding events. |
1407 | |
1681 | |
|
|
1682 | =head3 Watcher-Specific Functions and Data Members |
|
|
1683 | |
1408 | =over 4 |
1684 | =over 4 |
1409 | |
1685 | |
1410 | =item ev_idle_init (ev_signal *, callback) |
1686 | =item ev_idle_init (ev_signal *, callback) |
1411 | |
1687 | |
1412 | Initialises and configures the idle watcher - it has no parameters of any |
1688 | Initialises and configures the idle watcher - it has no parameters of any |
1413 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
1689 | kind. There is a C<ev_idle_set> macro, but using it is utterly pointless, |
1414 | believe me. |
1690 | believe me. |
1415 | |
1691 | |
1416 | =back |
1692 | =back |
|
|
1693 | |
|
|
1694 | =head3 Examples |
1417 | |
1695 | |
1418 | Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the |
1696 | Example: Dynamically allocate an C<ev_idle> watcher, start it, and in the |
1419 | callback, free it. Also, use no error checking, as usual. |
1697 | callback, free it. Also, use no error checking, as usual. |
1420 | |
1698 | |
1421 | static void |
1699 | static void |
1422 | idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) |
1700 | idle_cb (struct ev_loop *loop, struct ev_idle *w, int revents) |
1423 | { |
1701 | { |
1424 | free (w); |
1702 | free (w); |
1425 | // now do something you wanted to do when the program has |
1703 | // now do something you wanted to do when the program has |
1426 | // no longer asnything immediate to do. |
1704 | // no longer anything immediate to do. |
1427 | } |
1705 | } |
1428 | |
1706 | |
1429 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1707 | struct ev_idle *idle_watcher = malloc (sizeof (struct ev_idle)); |
1430 | ev_idle_init (idle_watcher, idle_cb); |
1708 | ev_idle_init (idle_watcher, idle_cb); |
1431 | ev_idle_start (loop, idle_cb); |
1709 | ev_idle_start (loop, idle_cb); |
… | |
… | |
1469 | with priority higher than or equal to the event loop and one coroutine |
1747 | with priority higher than or equal to the event loop and one coroutine |
1470 | of lower priority, but only once, using idle watchers to keep the event |
1748 | of lower priority, but only once, using idle watchers to keep the event |
1471 | loop from blocking if lower-priority coroutines are active, thus mapping |
1749 | loop from blocking if lower-priority coroutines are active, thus mapping |
1472 | low-priority coroutines to idle/background tasks). |
1750 | low-priority coroutines to idle/background tasks). |
1473 | |
1751 | |
|
|
1752 | It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) |
|
|
1753 | priority, to ensure that they are being run before any other watchers |
|
|
1754 | after the poll. Also, C<ev_check> watchers (and C<ev_prepare> watchers, |
|
|
1755 | too) should not activate ("feed") events into libev. While libev fully |
|
|
1756 | supports this, they will be called before other C<ev_check> watchers |
|
|
1757 | did their job. As C<ev_check> watchers are often used to embed other |
|
|
1758 | (non-libev) event loops those other event loops might be in an unusable |
|
|
1759 | state until their C<ev_check> watcher ran (always remind yourself to |
|
|
1760 | coexist peacefully with others). |
|
|
1761 | |
|
|
1762 | =head3 Watcher-Specific Functions and Data Members |
|
|
1763 | |
1474 | =over 4 |
1764 | =over 4 |
1475 | |
1765 | |
1476 | =item ev_prepare_init (ev_prepare *, callback) |
1766 | =item ev_prepare_init (ev_prepare *, callback) |
1477 | |
1767 | |
1478 | =item ev_check_init (ev_check *, callback) |
1768 | =item ev_check_init (ev_check *, callback) |
… | |
… | |
1481 | parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> |
1771 | parameters of any kind. There are C<ev_prepare_set> and C<ev_check_set> |
1482 | macros, but using them is utterly, utterly and completely pointless. |
1772 | macros, but using them is utterly, utterly and completely pointless. |
1483 | |
1773 | |
1484 | =back |
1774 | =back |
1485 | |
1775 | |
1486 | Example: To include a library such as adns, you would add IO watchers |
1776 | =head3 Examples |
1487 | and a timeout watcher in a prepare handler, as required by libadns, and |
1777 | |
|
|
1778 | There are a number of principal ways to embed other event loops or modules |
|
|
1779 | into libev. Here are some ideas on how to include libadns into libev |
|
|
1780 | (there is a Perl module named C<EV::ADNS> that does this, which you could |
|
|
1781 | use for an actually working example. Another Perl module named C<EV::Glib> |
|
|
1782 | embeds a Glib main context into libev, and finally, C<Glib::EV> embeds EV |
|
|
1783 | into the Glib event loop). |
|
|
1784 | |
|
|
1785 | Method 1: Add IO watchers and a timeout watcher in a prepare handler, |
1488 | in a check watcher, destroy them and call into libadns. What follows is |
1786 | and in a check watcher, destroy them and call into libadns. What follows |
1489 | pseudo-code only of course: |
1787 | is pseudo-code only of course. This requires you to either use a low |
|
|
1788 | priority for the check watcher or use C<ev_clear_pending> explicitly, as |
|
|
1789 | the callbacks for the IO/timeout watchers might not have been called yet. |
1490 | |
1790 | |
1491 | static ev_io iow [nfd]; |
1791 | static ev_io iow [nfd]; |
1492 | static ev_timer tw; |
1792 | static ev_timer tw; |
1493 | |
1793 | |
1494 | static void |
1794 | static void |
1495 | io_cb (ev_loop *loop, ev_io *w, int revents) |
1795 | io_cb (ev_loop *loop, ev_io *w, int revents) |
1496 | { |
1796 | { |
1497 | // set the relevant poll flags |
|
|
1498 | // could also call adns_processreadable etc. here |
|
|
1499 | struct pollfd *fd = (struct pollfd *)w->data; |
|
|
1500 | if (revents & EV_READ ) fd->revents |= fd->events & POLLIN; |
|
|
1501 | if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT; |
|
|
1502 | } |
1797 | } |
1503 | |
1798 | |
1504 | // create io watchers for each fd and a timer before blocking |
1799 | // create io watchers for each fd and a timer before blocking |
1505 | static void |
1800 | static void |
1506 | adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) |
1801 | adns_prepare_cb (ev_loop *loop, ev_prepare *w, int revents) |
… | |
… | |
1512 | |
1807 | |
1513 | /* the callback is illegal, but won't be called as we stop during check */ |
1808 | /* the callback is illegal, but won't be called as we stop during check */ |
1514 | ev_timer_init (&tw, 0, timeout * 1e-3); |
1809 | ev_timer_init (&tw, 0, timeout * 1e-3); |
1515 | ev_timer_start (loop, &tw); |
1810 | ev_timer_start (loop, &tw); |
1516 | |
1811 | |
1517 | // create on ev_io per pollfd |
1812 | // create one ev_io per pollfd |
1518 | for (int i = 0; i < nfd; ++i) |
1813 | for (int i = 0; i < nfd; ++i) |
1519 | { |
1814 | { |
1520 | ev_io_init (iow + i, io_cb, fds [i].fd, |
1815 | ev_io_init (iow + i, io_cb, fds [i].fd, |
1521 | ((fds [i].events & POLLIN ? EV_READ : 0) |
1816 | ((fds [i].events & POLLIN ? EV_READ : 0) |
1522 | | (fds [i].events & POLLOUT ? EV_WRITE : 0))); |
1817 | | (fds [i].events & POLLOUT ? EV_WRITE : 0))); |
1523 | |
1818 | |
1524 | fds [i].revents = 0; |
1819 | fds [i].revents = 0; |
1525 | iow [i].data = fds + i; |
|
|
1526 | ev_io_start (loop, iow + i); |
1820 | ev_io_start (loop, iow + i); |
1527 | } |
1821 | } |
1528 | } |
1822 | } |
1529 | |
1823 | |
1530 | // stop all watchers after blocking |
1824 | // stop all watchers after blocking |
… | |
… | |
1532 | adns_check_cb (ev_loop *loop, ev_check *w, int revents) |
1826 | adns_check_cb (ev_loop *loop, ev_check *w, int revents) |
1533 | { |
1827 | { |
1534 | ev_timer_stop (loop, &tw); |
1828 | ev_timer_stop (loop, &tw); |
1535 | |
1829 | |
1536 | for (int i = 0; i < nfd; ++i) |
1830 | for (int i = 0; i < nfd; ++i) |
|
|
1831 | { |
|
|
1832 | // set the relevant poll flags |
|
|
1833 | // could also call adns_processreadable etc. here |
|
|
1834 | struct pollfd *fd = fds + i; |
|
|
1835 | int revents = ev_clear_pending (iow + i); |
|
|
1836 | if (revents & EV_READ ) fd->revents |= fd->events & POLLIN; |
|
|
1837 | if (revents & EV_WRITE) fd->revents |= fd->events & POLLOUT; |
|
|
1838 | |
|
|
1839 | // now stop the watcher |
1537 | ev_io_stop (loop, iow + i); |
1840 | ev_io_stop (loop, iow + i); |
|
|
1841 | } |
1538 | |
1842 | |
1539 | adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); |
1843 | adns_afterpoll (adns, fds, nfd, timeval_from (ev_now (loop)); |
|
|
1844 | } |
|
|
1845 | |
|
|
1846 | Method 2: This would be just like method 1, but you run C<adns_afterpoll> |
|
|
1847 | in the prepare watcher and would dispose of the check watcher. |
|
|
1848 | |
|
|
1849 | Method 3: If the module to be embedded supports explicit event |
|
|
1850 | notification (adns does), you can also make use of the actual watcher |
|
|
1851 | callbacks, and only destroy/create the watchers in the prepare watcher. |
|
|
1852 | |
|
|
1853 | static void |
|
|
1854 | timer_cb (EV_P_ ev_timer *w, int revents) |
|
|
1855 | { |
|
|
1856 | adns_state ads = (adns_state)w->data; |
|
|
1857 | update_now (EV_A); |
|
|
1858 | |
|
|
1859 | adns_processtimeouts (ads, &tv_now); |
|
|
1860 | } |
|
|
1861 | |
|
|
1862 | static void |
|
|
1863 | io_cb (EV_P_ ev_io *w, int revents) |
|
|
1864 | { |
|
|
1865 | adns_state ads = (adns_state)w->data; |
|
|
1866 | update_now (EV_A); |
|
|
1867 | |
|
|
1868 | if (revents & EV_READ ) adns_processreadable (ads, w->fd, &tv_now); |
|
|
1869 | if (revents & EV_WRITE) adns_processwriteable (ads, w->fd, &tv_now); |
|
|
1870 | } |
|
|
1871 | |
|
|
1872 | // do not ever call adns_afterpoll |
|
|
1873 | |
|
|
1874 | Method 4: Do not use a prepare or check watcher because the module you |
|
|
1875 | want to embed is too inflexible to support it. Instead, youc na override |
|
|
1876 | their poll function. The drawback with this solution is that the main |
|
|
1877 | loop is now no longer controllable by EV. The C<Glib::EV> module does |
|
|
1878 | this. |
|
|
1879 | |
|
|
1880 | static gint |
|
|
1881 | event_poll_func (GPollFD *fds, guint nfds, gint timeout) |
|
|
1882 | { |
|
|
1883 | int got_events = 0; |
|
|
1884 | |
|
|
1885 | for (n = 0; n < nfds; ++n) |
|
|
1886 | // create/start io watcher that sets the relevant bits in fds[n] and increment got_events |
|
|
1887 | |
|
|
1888 | if (timeout >= 0) |
|
|
1889 | // create/start timer |
|
|
1890 | |
|
|
1891 | // poll |
|
|
1892 | ev_loop (EV_A_ 0); |
|
|
1893 | |
|
|
1894 | // stop timer again |
|
|
1895 | if (timeout >= 0) |
|
|
1896 | ev_timer_stop (EV_A_ &to); |
|
|
1897 | |
|
|
1898 | // stop io watchers again - their callbacks should have set |
|
|
1899 | for (n = 0; n < nfds; ++n) |
|
|
1900 | ev_io_stop (EV_A_ iow [n]); |
|
|
1901 | |
|
|
1902 | return got_events; |
1540 | } |
1903 | } |
1541 | |
1904 | |
1542 | |
1905 | |
1543 | =head2 C<ev_embed> - when one backend isn't enough... |
1906 | =head2 C<ev_embed> - when one backend isn't enough... |
1544 | |
1907 | |
… | |
… | |
1587 | portable one. |
1950 | portable one. |
1588 | |
1951 | |
1589 | So when you want to use this feature you will always have to be prepared |
1952 | So when you want to use this feature you will always have to be prepared |
1590 | that you cannot get an embeddable loop. The recommended way to get around |
1953 | that you cannot get an embeddable loop. The recommended way to get around |
1591 | this is to have a separate variables for your embeddable loop, try to |
1954 | this is to have a separate variables for your embeddable loop, try to |
1592 | create it, and if that fails, use the normal loop for everything: |
1955 | create it, and if that fails, use the normal loop for everything. |
|
|
1956 | |
|
|
1957 | =head3 Watcher-Specific Functions and Data Members |
|
|
1958 | |
|
|
1959 | =over 4 |
|
|
1960 | |
|
|
1961 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
|
|
1962 | |
|
|
1963 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
|
|
1964 | |
|
|
1965 | Configures the watcher to embed the given loop, which must be |
|
|
1966 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
|
|
1967 | invoked automatically, otherwise it is the responsibility of the callback |
|
|
1968 | to invoke it (it will continue to be called until the sweep has been done, |
|
|
1969 | if you do not want thta, you need to temporarily stop the embed watcher). |
|
|
1970 | |
|
|
1971 | =item ev_embed_sweep (loop, ev_embed *) |
|
|
1972 | |
|
|
1973 | Make a single, non-blocking sweep over the embedded loop. This works |
|
|
1974 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
|
|
1975 | apropriate way for embedded loops. |
|
|
1976 | |
|
|
1977 | =item struct ev_loop *other [read-only] |
|
|
1978 | |
|
|
1979 | The embedded event loop. |
|
|
1980 | |
|
|
1981 | =back |
|
|
1982 | |
|
|
1983 | =head3 Examples |
|
|
1984 | |
|
|
1985 | Example: Try to get an embeddable event loop and embed it into the default |
|
|
1986 | event loop. If that is not possible, use the default loop. The default |
|
|
1987 | loop is stored in C<loop_hi>, while the mebeddable loop is stored in |
|
|
1988 | C<loop_lo> (which is C<loop_hi> in the acse no embeddable loop can be |
|
|
1989 | used). |
1593 | |
1990 | |
1594 | struct ev_loop *loop_hi = ev_default_init (0); |
1991 | struct ev_loop *loop_hi = ev_default_init (0); |
1595 | struct ev_loop *loop_lo = 0; |
1992 | struct ev_loop *loop_lo = 0; |
1596 | struct ev_embed embed; |
1993 | struct ev_embed embed; |
1597 | |
1994 | |
… | |
… | |
1608 | ev_embed_start (loop_hi, &embed); |
2005 | ev_embed_start (loop_hi, &embed); |
1609 | } |
2006 | } |
1610 | else |
2007 | else |
1611 | loop_lo = loop_hi; |
2008 | loop_lo = loop_hi; |
1612 | |
2009 | |
1613 | =over 4 |
2010 | Example: Check if kqueue is available but not recommended and create |
|
|
2011 | a kqueue backend for use with sockets (which usually work with any |
|
|
2012 | kqueue implementation). Store the kqueue/socket-only event loop in |
|
|
2013 | C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). |
1614 | |
2014 | |
1615 | =item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) |
2015 | struct ev_loop *loop = ev_default_init (0); |
|
|
2016 | struct ev_loop *loop_socket = 0; |
|
|
2017 | struct ev_embed embed; |
|
|
2018 | |
|
|
2019 | if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) |
|
|
2020 | if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) |
|
|
2021 | { |
|
|
2022 | ev_embed_init (&embed, 0, loop_socket); |
|
|
2023 | ev_embed_start (loop, &embed); |
|
|
2024 | } |
1616 | |
2025 | |
1617 | =item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) |
2026 | if (!loop_socket) |
|
|
2027 | loop_socket = loop; |
1618 | |
2028 | |
1619 | Configures the watcher to embed the given loop, which must be |
2029 | // now use loop_socket for all sockets, and loop for everything else |
1620 | embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be |
|
|
1621 | invoked automatically, otherwise it is the responsibility of the callback |
|
|
1622 | to invoke it (it will continue to be called until the sweep has been done, |
|
|
1623 | if you do not want thta, you need to temporarily stop the embed watcher). |
|
|
1624 | |
|
|
1625 | =item ev_embed_sweep (loop, ev_embed *) |
|
|
1626 | |
|
|
1627 | Make a single, non-blocking sweep over the embedded loop. This works |
|
|
1628 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
|
|
1629 | apropriate way for embedded loops. |
|
|
1630 | |
|
|
1631 | =item struct ev_loop *loop [read-only] |
|
|
1632 | |
|
|
1633 | The embedded event loop. |
|
|
1634 | |
|
|
1635 | =back |
|
|
1636 | |
2030 | |
1637 | |
2031 | |
1638 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
2032 | =head2 C<ev_fork> - the audacity to resume the event loop after a fork |
1639 | |
2033 | |
1640 | Fork watchers are called when a C<fork ()> was detected (usually because |
2034 | Fork watchers are called when a C<fork ()> was detected (usually because |
… | |
… | |
1643 | event loop blocks next and before C<ev_check> watchers are being called, |
2037 | event loop blocks next and before C<ev_check> watchers are being called, |
1644 | and only in the child after the fork. If whoever good citizen calling |
2038 | and only in the child after the fork. If whoever good citizen calling |
1645 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
2039 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
1646 | handlers will be invoked, too, of course. |
2040 | handlers will be invoked, too, of course. |
1647 | |
2041 | |
|
|
2042 | =head3 Watcher-Specific Functions and Data Members |
|
|
2043 | |
1648 | =over 4 |
2044 | =over 4 |
1649 | |
2045 | |
1650 | =item ev_fork_init (ev_signal *, callback) |
2046 | =item ev_fork_init (ev_signal *, callback) |
1651 | |
2047 | |
1652 | Initialises and configures the fork watcher - it has no parameters of any |
2048 | Initialises and configures the fork watcher - it has no parameters of any |
1653 | kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, |
2049 | kind. There is a C<ev_fork_set> macro, but using it is utterly pointless, |
1654 | believe me. |
2050 | believe me. |
|
|
2051 | |
|
|
2052 | =back |
|
|
2053 | |
|
|
2054 | |
|
|
2055 | =head2 C<ev_async> - how to wake up another event loop |
|
|
2056 | |
|
|
2057 | In general, you cannot use an C<ev_loop> from multiple threads or other |
|
|
2058 | asynchronous sources such as signal handlers (as opposed to multiple event |
|
|
2059 | loops - those are of course safe to use in different threads). |
|
|
2060 | |
|
|
2061 | Sometimes, however, you need to wake up another event loop you do not |
|
|
2062 | control, for example because it belongs to another thread. This is what |
|
|
2063 | C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you |
|
|
2064 | can signal it by calling C<ev_async_send>, which is thread- and signal |
|
|
2065 | safe. |
|
|
2066 | |
|
|
2067 | This functionality is very similar to C<ev_signal> watchers, as signals, |
|
|
2068 | too, are asynchronous in nature, and signals, too, will be compressed |
|
|
2069 | (i.e. the number of callback invocations may be less than the number of |
|
|
2070 | C<ev_async_sent> calls). |
|
|
2071 | |
|
|
2072 | Unlike C<ev_signal> watchers, C<ev_async> works with any event loop, not |
|
|
2073 | just the default loop. |
|
|
2074 | |
|
|
2075 | =head3 Queueing |
|
|
2076 | |
|
|
2077 | C<ev_async> does not support queueing of data in any way. The reason |
|
|
2078 | is that the author does not know of a simple (or any) algorithm for a |
|
|
2079 | multiple-writer-single-reader queue that works in all cases and doesn't |
|
|
2080 | need elaborate support such as pthreads. |
|
|
2081 | |
|
|
2082 | That means that if you want to queue data, you have to provide your own |
|
|
2083 | queue. And here is how you would implement locking: |
|
|
2084 | |
|
|
2085 | =over 4 |
|
|
2086 | |
|
|
2087 | =item queueing from a signal handler context |
|
|
2088 | |
|
|
2089 | To implement race-free queueing, you simply add to the queue in the signal |
|
|
2090 | handler but you block the signal handler in the watcher callback. Here is an example that does that for |
|
|
2091 | some fictitiuous SIGUSR1 handler: |
|
|
2092 | |
|
|
2093 | static ev_async mysig; |
|
|
2094 | |
|
|
2095 | static void |
|
|
2096 | sigusr1_handler (void) |
|
|
2097 | { |
|
|
2098 | sometype data; |
|
|
2099 | |
|
|
2100 | // no locking etc. |
|
|
2101 | queue_put (data); |
|
|
2102 | ev_async_send (DEFAULT_ &mysig); |
|
|
2103 | } |
|
|
2104 | |
|
|
2105 | static void |
|
|
2106 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2107 | { |
|
|
2108 | sometype data; |
|
|
2109 | sigset_t block, prev; |
|
|
2110 | |
|
|
2111 | sigemptyset (&block); |
|
|
2112 | sigaddset (&block, SIGUSR1); |
|
|
2113 | sigprocmask (SIG_BLOCK, &block, &prev); |
|
|
2114 | |
|
|
2115 | while (queue_get (&data)) |
|
|
2116 | process (data); |
|
|
2117 | |
|
|
2118 | if (sigismember (&prev, SIGUSR1) |
|
|
2119 | sigprocmask (SIG_UNBLOCK, &block, 0); |
|
|
2120 | } |
|
|
2121 | |
|
|
2122 | (Note: pthreads in theory requires you to use C<pthread_setmask> |
|
|
2123 | instead of C<sigprocmask> when you use threads, but libev doesn't do it |
|
|
2124 | either...). |
|
|
2125 | |
|
|
2126 | =item queueing from a thread context |
|
|
2127 | |
|
|
2128 | The strategy for threads is different, as you cannot (easily) block |
|
|
2129 | threads but you can easily preempt them, so to queue safely you need to |
|
|
2130 | emply a traditional mutex lock, such as in this pthread example: |
|
|
2131 | |
|
|
2132 | static ev_async mysig; |
|
|
2133 | static pthread_mutex_t mymutex = PTHREAD_MUTEX_INITIALIZER; |
|
|
2134 | |
|
|
2135 | static void |
|
|
2136 | otherthread (void) |
|
|
2137 | { |
|
|
2138 | // only need to lock the actual queueing operation |
|
|
2139 | pthread_mutex_lock (&mymutex); |
|
|
2140 | queue_put (data); |
|
|
2141 | pthread_mutex_unlock (&mymutex); |
|
|
2142 | |
|
|
2143 | ev_async_send (DEFAULT_ &mysig); |
|
|
2144 | } |
|
|
2145 | |
|
|
2146 | static void |
|
|
2147 | mysig_cb (EV_P_ ev_async *w, int revents) |
|
|
2148 | { |
|
|
2149 | pthread_mutex_lock (&mymutex); |
|
|
2150 | |
|
|
2151 | while (queue_get (&data)) |
|
|
2152 | process (data); |
|
|
2153 | |
|
|
2154 | pthread_mutex_unlock (&mymutex); |
|
|
2155 | } |
|
|
2156 | |
|
|
2157 | =back |
|
|
2158 | |
|
|
2159 | |
|
|
2160 | =head3 Watcher-Specific Functions and Data Members |
|
|
2161 | |
|
|
2162 | =over 4 |
|
|
2163 | |
|
|
2164 | =item ev_async_init (ev_async *, callback) |
|
|
2165 | |
|
|
2166 | Initialises and configures the async watcher - it has no parameters of any |
|
|
2167 | kind. There is a C<ev_asynd_set> macro, but using it is utterly pointless, |
|
|
2168 | believe me. |
|
|
2169 | |
|
|
2170 | =item ev_async_send (loop, ev_async *) |
|
|
2171 | |
|
|
2172 | Sends/signals/activates the given C<ev_async> watcher, that is, feeds |
|
|
2173 | an C<EV_ASYNC> event on the watcher into the event loop. Unlike |
|
|
2174 | C<ev_feed_event>, this call is safe to do in other threads, signal or |
|
|
2175 | similar contexts (see the dicusssion of C<EV_ATOMIC_T> in the embedding |
|
|
2176 | section below on what exactly this means). |
|
|
2177 | |
|
|
2178 | This call incurs the overhead of a syscall only once per loop iteration, |
|
|
2179 | so while the overhead might be noticable, it doesn't apply to repeated |
|
|
2180 | calls to C<ev_async_send>. |
1655 | |
2181 | |
1656 | =back |
2182 | =back |
1657 | |
2183 | |
1658 | |
2184 | |
1659 | =head1 OTHER FUNCTIONS |
2185 | =head1 OTHER FUNCTIONS |
… | |
… | |
1832 | |
2358 | |
1833 | myclass obj; |
2359 | myclass obj; |
1834 | ev::io iow; |
2360 | ev::io iow; |
1835 | iow.set <myclass, &myclass::io_cb> (&obj); |
2361 | iow.set <myclass, &myclass::io_cb> (&obj); |
1836 | |
2362 | |
1837 | =item w->set (void (*function)(watcher &w, int), void *data = 0) |
2363 | =item w->set<function> (void *data = 0) |
1838 | |
2364 | |
1839 | Also sets a callback, but uses a static method or plain function as |
2365 | Also sets a callback, but uses a static method or plain function as |
1840 | callback. The optional C<data> argument will be stored in the watcher's |
2366 | callback. The optional C<data> argument will be stored in the watcher's |
1841 | C<data> member and is free for you to use. |
2367 | C<data> member and is free for you to use. |
1842 | |
2368 | |
|
|
2369 | The prototype of the C<function> must be C<void (*)(ev::TYPE &w, int)>. |
|
|
2370 | |
1843 | See the method-C<set> above for more details. |
2371 | See the method-C<set> above for more details. |
|
|
2372 | |
|
|
2373 | Example: |
|
|
2374 | |
|
|
2375 | static void io_cb (ev::io &w, int revents) { } |
|
|
2376 | iow.set <io_cb> (); |
1844 | |
2377 | |
1845 | =item w->set (struct ev_loop *) |
2378 | =item w->set (struct ev_loop *) |
1846 | |
2379 | |
1847 | Associates a different C<struct ev_loop> with this watcher. You can only |
2380 | Associates a different C<struct ev_loop> with this watcher. You can only |
1848 | do this when the watcher is inactive (and not pending either). |
2381 | do this when the watcher is inactive (and not pending either). |
… | |
… | |
1861 | |
2394 | |
1862 | =item w->stop () |
2395 | =item w->stop () |
1863 | |
2396 | |
1864 | Stops the watcher if it is active. Again, no C<loop> argument. |
2397 | Stops the watcher if it is active. Again, no C<loop> argument. |
1865 | |
2398 | |
1866 | =item w->again () C<ev::timer>, C<ev::periodic> only |
2399 | =item w->again () (C<ev::timer>, C<ev::periodic> only) |
1867 | |
2400 | |
1868 | For C<ev::timer> and C<ev::periodic>, this invokes the corresponding |
2401 | For C<ev::timer> and C<ev::periodic>, this invokes the corresponding |
1869 | C<ev_TYPE_again> function. |
2402 | C<ev_TYPE_again> function. |
1870 | |
2403 | |
1871 | =item w->sweep () C<ev::embed> only |
2404 | =item w->sweep () (C<ev::embed> only) |
1872 | |
2405 | |
1873 | Invokes C<ev_embed_sweep>. |
2406 | Invokes C<ev_embed_sweep>. |
1874 | |
2407 | |
1875 | =item w->update () C<ev::stat> only |
2408 | =item w->update () (C<ev::stat> only) |
1876 | |
2409 | |
1877 | Invokes C<ev_stat_stat>. |
2410 | Invokes C<ev_stat_stat>. |
1878 | |
2411 | |
1879 | =back |
2412 | =back |
1880 | |
2413 | |
… | |
… | |
1883 | Example: Define a class with an IO and idle watcher, start one of them in |
2416 | Example: Define a class with an IO and idle watcher, start one of them in |
1884 | the constructor. |
2417 | the constructor. |
1885 | |
2418 | |
1886 | class myclass |
2419 | class myclass |
1887 | { |
2420 | { |
1888 | ev_io io; void io_cb (ev::io &w, int revents); |
2421 | ev::io io; void io_cb (ev::io &w, int revents); |
1889 | ev_idle idle void idle_cb (ev::idle &w, int revents); |
2422 | ev:idle idle void idle_cb (ev::idle &w, int revents); |
1890 | |
2423 | |
1891 | myclass (); |
2424 | myclass (int fd) |
1892 | } |
|
|
1893 | |
|
|
1894 | myclass::myclass (int fd) |
|
|
1895 | { |
2425 | { |
1896 | io .set <myclass, &myclass::io_cb > (this); |
2426 | io .set <myclass, &myclass::io_cb > (this); |
1897 | idle.set <myclass, &myclass::idle_cb> (this); |
2427 | idle.set <myclass, &myclass::idle_cb> (this); |
1898 | |
2428 | |
1899 | io.start (fd, ev::READ); |
2429 | io.start (fd, ev::READ); |
|
|
2430 | } |
1900 | } |
2431 | }; |
1901 | |
2432 | |
1902 | |
2433 | |
1903 | =head1 MACRO MAGIC |
2434 | =head1 MACRO MAGIC |
1904 | |
2435 | |
1905 | Libev can be compiled with a variety of options, the most fundemantal is |
2436 | Libev can be compiled with a variety of options, the most fundamantal |
1906 | C<EV_MULTIPLICITY>. This option determines whether (most) functions and |
2437 | of which is C<EV_MULTIPLICITY>. This option determines whether (most) |
1907 | callbacks have an initial C<struct ev_loop *> argument. |
2438 | functions and callbacks have an initial C<struct ev_loop *> argument. |
1908 | |
2439 | |
1909 | To make it easier to write programs that cope with either variant, the |
2440 | To make it easier to write programs that cope with either variant, the |
1910 | following macros are defined: |
2441 | following macros are defined: |
1911 | |
2442 | |
1912 | =over 4 |
2443 | =over 4 |
… | |
… | |
1966 | Libev can (and often is) directly embedded into host |
2497 | Libev can (and often is) directly embedded into host |
1967 | applications. Examples of applications that embed it include the Deliantra |
2498 | applications. Examples of applications that embed it include the Deliantra |
1968 | Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) |
2499 | Game Server, the EV perl module, the GNU Virtual Private Ethernet (gvpe) |
1969 | and rxvt-unicode. |
2500 | and rxvt-unicode. |
1970 | |
2501 | |
1971 | The goal is to enable you to just copy the neecssary files into your |
2502 | The goal is to enable you to just copy the necessary files into your |
1972 | source directory without having to change even a single line in them, so |
2503 | source directory without having to change even a single line in them, so |
1973 | you can easily upgrade by simply copying (or having a checked-out copy of |
2504 | you can easily upgrade by simply copying (or having a checked-out copy of |
1974 | libev somewhere in your source tree). |
2505 | libev somewhere in your source tree). |
1975 | |
2506 | |
1976 | =head2 FILESETS |
2507 | =head2 FILESETS |
… | |
… | |
2066 | |
2597 | |
2067 | If defined to be C<1>, libev will try to detect the availability of the |
2598 | If defined to be C<1>, libev will try to detect the availability of the |
2068 | monotonic clock option at both compiletime and runtime. Otherwise no use |
2599 | monotonic clock option at both compiletime and runtime. Otherwise no use |
2069 | of the monotonic clock option will be attempted. If you enable this, you |
2600 | of the monotonic clock option will be attempted. If you enable this, you |
2070 | usually have to link against librt or something similar. Enabling it when |
2601 | usually have to link against librt or something similar. Enabling it when |
2071 | the functionality isn't available is safe, though, althoguh you have |
2602 | the functionality isn't available is safe, though, although you have |
2072 | to make sure you link against any libraries where the C<clock_gettime> |
2603 | to make sure you link against any libraries where the C<clock_gettime> |
2073 | function is hiding in (often F<-lrt>). |
2604 | function is hiding in (often F<-lrt>). |
2074 | |
2605 | |
2075 | =item EV_USE_REALTIME |
2606 | =item EV_USE_REALTIME |
2076 | |
2607 | |
2077 | If defined to be C<1>, libev will try to detect the availability of the |
2608 | If defined to be C<1>, libev will try to detect the availability of the |
2078 | realtime clock option at compiletime (and assume its availability at |
2609 | realtime clock option at compiletime (and assume its availability at |
2079 | runtime if successful). Otherwise no use of the realtime clock option will |
2610 | runtime if successful). Otherwise no use of the realtime clock option will |
2080 | be attempted. This effectively replaces C<gettimeofday> by C<clock_get |
2611 | be attempted. This effectively replaces C<gettimeofday> by C<clock_get |
2081 | (CLOCK_REALTIME, ...)> and will not normally affect correctness. See tzhe note about libraries |
2612 | (CLOCK_REALTIME, ...)> and will not normally affect correctness. See the |
2082 | in the description of C<EV_USE_MONOTONIC>, though. |
2613 | note about libraries in the description of C<EV_USE_MONOTONIC>, though. |
|
|
2614 | |
|
|
2615 | =item EV_USE_NANOSLEEP |
|
|
2616 | |
|
|
2617 | If defined to be C<1>, libev will assume that C<nanosleep ()> is available |
|
|
2618 | and will use it for delays. Otherwise it will use C<select ()>. |
2083 | |
2619 | |
2084 | =item EV_USE_SELECT |
2620 | =item EV_USE_SELECT |
2085 | |
2621 | |
2086 | If undefined or defined to be C<1>, libev will compile in support for the |
2622 | If undefined or defined to be C<1>, libev will compile in support for the |
2087 | C<select>(2) backend. No attempt at autodetection will be done: if no |
2623 | C<select>(2) backend. No attempt at autodetection will be done: if no |
… | |
… | |
2105 | wants osf handles on win32 (this is the case when the select to |
2641 | wants osf handles on win32 (this is the case when the select to |
2106 | be used is the winsock select). This means that it will call |
2642 | be used is the winsock select). This means that it will call |
2107 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2643 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
2108 | it is assumed that all these functions actually work on fds, even |
2644 | it is assumed that all these functions actually work on fds, even |
2109 | on win32. Should not be defined on non-win32 platforms. |
2645 | on win32. Should not be defined on non-win32 platforms. |
|
|
2646 | |
|
|
2647 | =item EV_FD_TO_WIN32_HANDLE |
|
|
2648 | |
|
|
2649 | If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map |
|
|
2650 | file descriptors to socket handles. When not defining this symbol (the |
|
|
2651 | default), then libev will call C<_get_osfhandle>, which is usually |
|
|
2652 | correct. In some cases, programs use their own file descriptor management, |
|
|
2653 | in which case they can provide this function to map fds to socket handles. |
2110 | |
2654 | |
2111 | =item EV_USE_POLL |
2655 | =item EV_USE_POLL |
2112 | |
2656 | |
2113 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2657 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
2114 | backend. Otherwise it will be enabled on non-win32 platforms. It |
2658 | backend. Otherwise it will be enabled on non-win32 platforms. It |
… | |
… | |
2148 | |
2692 | |
2149 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2693 | If defined to be C<1>, libev will compile in support for the Linux inotify |
2150 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2694 | interface to speed up C<ev_stat> watchers. Its actual availability will |
2151 | be detected at runtime. |
2695 | be detected at runtime. |
2152 | |
2696 | |
|
|
2697 | =item EV_ATOMIC_T |
|
|
2698 | |
|
|
2699 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
|
|
2700 | access is atomic with respect to other threads or signal contexts. No such |
|
|
2701 | type is easily found in the C language, so you can provide your own type |
|
|
2702 | that you know is safe for your purposes. |
|
|
2703 | |
|
|
2704 | In the absense of this define, libev will use C<sig_atomic_t volatile> |
|
|
2705 | (from F<signal.h>), which is usually good enough on most platforms. |
|
|
2706 | |
2153 | =item EV_H |
2707 | =item EV_H |
2154 | |
2708 | |
2155 | The name of the F<ev.h> header file used to include it. The default if |
2709 | The name of the F<ev.h> header file used to include it. The default if |
2156 | undefined is C<< <ev.h> >> in F<event.h> and C<"ev.h"> in F<ev.c>. This |
2710 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
2157 | can be used to virtually rename the F<ev.h> header file in case of conflicts. |
2711 | used to virtually rename the F<ev.h> header file in case of conflicts. |
2158 | |
2712 | |
2159 | =item EV_CONFIG_H |
2713 | =item EV_CONFIG_H |
2160 | |
2714 | |
2161 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2715 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
2162 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2716 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
2163 | C<EV_H>, above. |
2717 | C<EV_H>, above. |
2164 | |
2718 | |
2165 | =item EV_EVENT_H |
2719 | =item EV_EVENT_H |
2166 | |
2720 | |
2167 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2721 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
2168 | of how the F<event.h> header can be found. |
2722 | of how the F<event.h> header can be found, the default is C<"event.h">. |
2169 | |
2723 | |
2170 | =item EV_PROTOTYPES |
2724 | =item EV_PROTOTYPES |
2171 | |
2725 | |
2172 | If defined to be C<0>, then F<ev.h> will not define any function |
2726 | If defined to be C<0>, then F<ev.h> will not define any function |
2173 | prototypes, but still define all the structs and other symbols. This is |
2727 | prototypes, but still define all the structs and other symbols. This is |
… | |
… | |
2224 | =item EV_FORK_ENABLE |
2778 | =item EV_FORK_ENABLE |
2225 | |
2779 | |
2226 | If undefined or defined to be C<1>, then fork watchers are supported. If |
2780 | If undefined or defined to be C<1>, then fork watchers are supported. If |
2227 | defined to be C<0>, then they are not. |
2781 | defined to be C<0>, then they are not. |
2228 | |
2782 | |
|
|
2783 | =item EV_ASYNC_ENABLE |
|
|
2784 | |
|
|
2785 | If undefined or defined to be C<1>, then async watchers are supported. If |
|
|
2786 | defined to be C<0>, then they are not. |
|
|
2787 | |
2229 | =item EV_MINIMAL |
2788 | =item EV_MINIMAL |
2230 | |
2789 | |
2231 | If you need to shave off some kilobytes of code at the expense of some |
2790 | If you need to shave off some kilobytes of code at the expense of some |
2232 | speed, define this symbol to C<1>. Currently only used for gcc to override |
2791 | speed, define this symbol to C<1>. Currently only used for gcc to override |
2233 | some inlining decisions, saves roughly 30% codesize of amd64. |
2792 | some inlining decisions, saves roughly 30% codesize of amd64. |
… | |
… | |
2239 | than enough. If you need to manage thousands of children you might want to |
2798 | than enough. If you need to manage thousands of children you might want to |
2240 | increase this value (I<must> be a power of two). |
2799 | increase this value (I<must> be a power of two). |
2241 | |
2800 | |
2242 | =item EV_INOTIFY_HASHSIZE |
2801 | =item EV_INOTIFY_HASHSIZE |
2243 | |
2802 | |
2244 | C<ev_staz> watchers use a small hash table to distribute workload by |
2803 | C<ev_stat> watchers use a small hash table to distribute workload by |
2245 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
2804 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
2246 | usually more than enough. If you need to manage thousands of C<ev_stat> |
2805 | usually more than enough. If you need to manage thousands of C<ev_stat> |
2247 | watchers you might want to increase this value (I<must> be a power of |
2806 | watchers you might want to increase this value (I<must> be a power of |
2248 | two). |
2807 | two). |
2249 | |
2808 | |
… | |
… | |
2266 | |
2825 | |
2267 | =item ev_set_cb (ev, cb) |
2826 | =item ev_set_cb (ev, cb) |
2268 | |
2827 | |
2269 | Can be used to change the callback member declaration in each watcher, |
2828 | Can be used to change the callback member declaration in each watcher, |
2270 | and the way callbacks are invoked and set. Must expand to a struct member |
2829 | and the way callbacks are invoked and set. Must expand to a struct member |
2271 | definition and a statement, respectively. See the F<ev.v> header file for |
2830 | definition and a statement, respectively. See the F<ev.h> header file for |
2272 | their default definitions. One possible use for overriding these is to |
2831 | their default definitions. One possible use for overriding these is to |
2273 | avoid the C<struct ev_loop *> as first argument in all cases, or to use |
2832 | avoid the C<struct ev_loop *> as first argument in all cases, or to use |
2274 | method calls instead of plain function calls in C++. |
2833 | method calls instead of plain function calls in C++. |
|
|
2834 | |
|
|
2835 | =head2 EXPORTED API SYMBOLS |
|
|
2836 | |
|
|
2837 | If you need to re-export the API (e.g. via a dll) and you need a list of |
|
|
2838 | exported symbols, you can use the provided F<Symbol.*> files which list |
|
|
2839 | all public symbols, one per line: |
|
|
2840 | |
|
|
2841 | Symbols.ev for libev proper |
|
|
2842 | Symbols.event for the libevent emulation |
|
|
2843 | |
|
|
2844 | This can also be used to rename all public symbols to avoid clashes with |
|
|
2845 | multiple versions of libev linked together (which is obviously bad in |
|
|
2846 | itself, but sometimes it is inconvinient to avoid this). |
|
|
2847 | |
|
|
2848 | A sed command like this will create wrapper C<#define>'s that you need to |
|
|
2849 | include before including F<ev.h>: |
|
|
2850 | |
|
|
2851 | <Symbols.ev sed -e "s/.*/#define & myprefix_&/" >wrap.h |
|
|
2852 | |
|
|
2853 | This would create a file F<wrap.h> which essentially looks like this: |
|
|
2854 | |
|
|
2855 | #define ev_backend myprefix_ev_backend |
|
|
2856 | #define ev_check_start myprefix_ev_check_start |
|
|
2857 | #define ev_check_stop myprefix_ev_check_stop |
|
|
2858 | ... |
2275 | |
2859 | |
2276 | =head2 EXAMPLES |
2860 | =head2 EXAMPLES |
2277 | |
2861 | |
2278 | For a real-world example of a program the includes libev |
2862 | For a real-world example of a program the includes libev |
2279 | verbatim, you can have a look at the EV perl module |
2863 | verbatim, you can have a look at the EV perl module |
… | |
… | |
2320 | |
2904 | |
2321 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
2905 | =item Starting and stopping timer/periodic watchers: O(log skipped_other_timers) |
2322 | |
2906 | |
2323 | This means that, when you have a watcher that triggers in one hour and |
2907 | This means that, when you have a watcher that triggers in one hour and |
2324 | there are 100 watchers that would trigger before that then inserting will |
2908 | there are 100 watchers that would trigger before that then inserting will |
2325 | have to skip those 100 watchers. |
2909 | have to skip roughly seven (C<ld 100>) of these watchers. |
2326 | |
2910 | |
2327 | =item Changing timer/periodic watchers (by autorepeat, again): O(log skipped_other_timers) |
2911 | =item Changing timer/periodic watchers (by autorepeat or calling again): O(log skipped_other_timers) |
2328 | |
2912 | |
2329 | That means that for changing a timer costs less than removing/adding them |
2913 | That means that changing a timer costs less than removing/adding them |
2330 | as only the relative motion in the event queue has to be paid for. |
2914 | as only the relative motion in the event queue has to be paid for. |
2331 | |
2915 | |
2332 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
2916 | =item Starting io/check/prepare/idle/signal/child watchers: O(1) |
2333 | |
2917 | |
2334 | These just add the watcher into an array or at the head of a list. |
2918 | These just add the watcher into an array or at the head of a list. |
|
|
2919 | |
2335 | =item Stopping check/prepare/idle watchers: O(1) |
2920 | =item Stopping check/prepare/idle watchers: O(1) |
2336 | |
2921 | |
2337 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2922 | =item Stopping an io/signal/child watcher: O(number_of_watchers_for_this_(fd/signal/pid % EV_PID_HASHSIZE)) |
2338 | |
2923 | |
2339 | These watchers are stored in lists then need to be walked to find the |
2924 | These watchers are stored in lists then need to be walked to find the |
2340 | correct watcher to remove. The lists are usually short (you don't usually |
2925 | correct watcher to remove. The lists are usually short (you don't usually |
2341 | have many watchers waiting for the same fd or signal). |
2926 | have many watchers waiting for the same fd or signal). |
2342 | |
2927 | |
2343 | =item Finding the next timer per loop iteration: O(1) |
2928 | =item Finding the next timer in each loop iteration: O(1) |
|
|
2929 | |
|
|
2930 | By virtue of using a binary heap, the next timer is always found at the |
|
|
2931 | beginning of the storage array. |
2344 | |
2932 | |
2345 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2933 | =item Each change on a file descriptor per loop iteration: O(number_of_watchers_for_this_fd) |
2346 | |
2934 | |
2347 | A change means an I/O watcher gets started or stopped, which requires |
2935 | A change means an I/O watcher gets started or stopped, which requires |
2348 | libev to recalculate its status (and possibly tell the kernel). |
2936 | libev to recalculate its status (and possibly tell the kernel, depending |
|
|
2937 | on backend and wether C<ev_io_set> was used). |
2349 | |
2938 | |
2350 | =item Activating one watcher: O(1) |
2939 | =item Activating one watcher (putting it into the pending state): O(1) |
2351 | |
2940 | |
2352 | =item Priority handling: O(number_of_priorities) |
2941 | =item Priority handling: O(number_of_priorities) |
2353 | |
2942 | |
2354 | Priorities are implemented by allocating some space for each |
2943 | Priorities are implemented by allocating some space for each |
2355 | priority. When doing priority-based operations, libev usually has to |
2944 | priority. When doing priority-based operations, libev usually has to |
2356 | linearly search all the priorities. |
2945 | linearly search all the priorities, but starting/stopping and activating |
|
|
2946 | watchers becomes O(1) w.r.t. prioritiy handling. |
2357 | |
2947 | |
2358 | =back |
2948 | =back |
2359 | |
2949 | |
2360 | |
2950 | |
|
|
2951 | =head1 Win32 platform limitations and workarounds |
|
|
2952 | |
|
|
2953 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
|
|
2954 | requires, and its I/O model is fundamentally incompatible with the POSIX |
|
|
2955 | model. Libev still offers limited functionality on this platform in |
|
|
2956 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
|
|
2957 | descriptors. This only applies when using Win32 natively, not when using |
|
|
2958 | e.g. cygwin. |
|
|
2959 | |
|
|
2960 | There is no supported compilation method available on windows except |
|
|
2961 | embedding it into other applications. |
|
|
2962 | |
|
|
2963 | Due to the many, low, and arbitrary limits on the win32 platform and the |
|
|
2964 | abysmal performance of winsockets, using a large number of sockets is not |
|
|
2965 | recommended (and not reasonable). If your program needs to use more than |
|
|
2966 | a hundred or so sockets, then likely it needs to use a totally different |
|
|
2967 | implementation for windows, as libev offers the POSIX model, which cannot |
|
|
2968 | be implemented efficiently on windows (microsoft monopoly games). |
|
|
2969 | |
|
|
2970 | =over 4 |
|
|
2971 | |
|
|
2972 | =item The winsocket select function |
|
|
2973 | |
|
|
2974 | The winsocket C<select> function doesn't follow POSIX in that it requires |
|
|
2975 | socket I<handles> and not socket I<file descriptors>. This makes select |
|
|
2976 | very inefficient, and also requires a mapping from file descriptors |
|
|
2977 | to socket handles. See the discussion of the C<EV_SELECT_USE_FD_SET>, |
|
|
2978 | C<EV_SELECT_IS_WINSOCKET> and C<EV_FD_TO_WIN32_HANDLE> preprocessor |
|
|
2979 | symbols for more info. |
|
|
2980 | |
|
|
2981 | The configuration for a "naked" win32 using the microsoft runtime |
|
|
2982 | libraries and raw winsocket select is: |
|
|
2983 | |
|
|
2984 | #define EV_USE_SELECT 1 |
|
|
2985 | #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ |
|
|
2986 | |
|
|
2987 | Note that winsockets handling of fd sets is O(n), so you can easily get a |
|
|
2988 | complexity in the O(n²) range when using win32. |
|
|
2989 | |
|
|
2990 | =item Limited number of file descriptors |
|
|
2991 | |
|
|
2992 | Windows has numerous arbitrary (and low) limits on things. Early versions |
|
|
2993 | of winsocket's select only supported waiting for a max. of C<64> handles |
|
|
2994 | (probably owning to the fact that all windows kernels can only wait for |
|
|
2995 | C<64> things at the same time internally; microsoft recommends spawning a |
|
|
2996 | chain of threads and wait for 63 handles and the previous thread in each). |
|
|
2997 | |
|
|
2998 | Newer versions support more handles, but you need to define C<FD_SETSIZE> |
|
|
2999 | to some high number (e.g. C<2048>) before compiling the winsocket select |
|
|
3000 | call (which might be in libev or elsewhere, for example, perl does its own |
|
|
3001 | select emulation on windows). |
|
|
3002 | |
|
|
3003 | Another limit is the number of file descriptors in the microsoft runtime |
|
|
3004 | libraries, which by default is C<64> (there must be a hidden I<64> fetish |
|
|
3005 | or something like this inside microsoft). You can increase this by calling |
|
|
3006 | C<_setmaxstdio>, which can increase this limit to C<2048> (another |
|
|
3007 | arbitrary limit), but is broken in many versions of the microsoft runtime |
|
|
3008 | libraries. |
|
|
3009 | |
|
|
3010 | This might get you to about C<512> or C<2048> sockets (depending on |
|
|
3011 | windows version and/or the phase of the moon). To get more, you need to |
|
|
3012 | wrap all I/O functions and provide your own fd management, but the cost of |
|
|
3013 | calling select (O(n²)) will likely make this unworkable. |
|
|
3014 | |
|
|
3015 | =back |
|
|
3016 | |
|
|
3017 | |
2361 | =head1 AUTHOR |
3018 | =head1 AUTHOR |
2362 | |
3019 | |
2363 | Marc Lehmann <libev@schmorp.de>. |
3020 | Marc Lehmann <libev@schmorp.de>. |
2364 | |
3021 | |