… | |
… | |
26 | puts ("stdin ready"); |
26 | puts ("stdin ready"); |
27 | // for one-shot events, one must manually stop the watcher |
27 | // for one-shot events, one must manually stop the watcher |
28 | // with its corresponding stop function. |
28 | // with its corresponding stop function. |
29 | ev_io_stop (EV_A_ w); |
29 | ev_io_stop (EV_A_ w); |
30 | |
30 | |
31 | // this causes all nested ev_loop's to stop iterating |
31 | // this causes all nested ev_run's to stop iterating |
32 | ev_unloop (EV_A_ EVUNLOOP_ALL); |
32 | ev_break (EV_A_ EVBREAK_ALL); |
33 | } |
33 | } |
34 | |
34 | |
35 | // another callback, this time for a time-out |
35 | // another callback, this time for a time-out |
36 | static void |
36 | static void |
37 | timeout_cb (EV_P_ ev_timer *w, int revents) |
37 | timeout_cb (EV_P_ ev_timer *w, int revents) |
38 | { |
38 | { |
39 | puts ("timeout"); |
39 | puts ("timeout"); |
40 | // this causes the innermost ev_loop to stop iterating |
40 | // this causes the innermost ev_run to stop iterating |
41 | ev_unloop (EV_A_ EVUNLOOP_ONE); |
41 | ev_break (EV_A_ EVBREAK_ONE); |
42 | } |
42 | } |
43 | |
43 | |
44 | int |
44 | int |
45 | main (void) |
45 | main (void) |
46 | { |
46 | { |
… | |
… | |
56 | // simple non-repeating 5.5 second timeout |
56 | // simple non-repeating 5.5 second timeout |
57 | ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); |
57 | ev_timer_init (&timeout_watcher, timeout_cb, 5.5, 0.); |
58 | ev_timer_start (loop, &timeout_watcher); |
58 | ev_timer_start (loop, &timeout_watcher); |
59 | |
59 | |
60 | // now wait for events to arrive |
60 | // now wait for events to arrive |
61 | ev_loop (loop, 0); |
61 | ev_run (loop, 0); |
62 | |
62 | |
63 | // unloop was called, so exit |
63 | // unloop was called, so exit |
64 | return 0; |
64 | return 0; |
65 | } |
65 | } |
66 | |
66 | |
… | |
… | |
75 | While this document tries to be as complete as possible in documenting |
75 | While this document tries to be as complete as possible in documenting |
76 | libev, its usage and the rationale behind its design, it is not a tutorial |
76 | libev, its usage and the rationale behind its design, it is not a tutorial |
77 | on event-based programming, nor will it introduce event-based programming |
77 | on event-based programming, nor will it introduce event-based programming |
78 | with libev. |
78 | with libev. |
79 | |
79 | |
80 | Familarity with event based programming techniques in general is assumed |
80 | Familiarity with event based programming techniques in general is assumed |
81 | throughout this document. |
81 | throughout this document. |
82 | |
82 | |
83 | =head1 ABOUT LIBEV |
83 | =head1 ABOUT LIBEV |
84 | |
84 | |
85 | Libev is an event loop: you register interest in certain events (such as a |
85 | Libev is an event loop: you register interest in certain events (such as a |
… | |
… | |
118 | Libev is very configurable. In this manual the default (and most common) |
118 | Libev is very configurable. In this manual the default (and most common) |
119 | configuration will be described, which supports multiple event loops. For |
119 | configuration will be described, which supports multiple event loops. For |
120 | more info about various configuration options please have a look at |
120 | more info about various configuration options please have a look at |
121 | B<EMBED> section in this manual. If libev was configured without support |
121 | B<EMBED> section in this manual. If libev was configured without support |
122 | for multiple event loops, then all functions taking an initial argument of |
122 | for multiple event loops, then all functions taking an initial argument of |
123 | name C<loop> (which is always of type C<ev_loop *>) will not have |
123 | name C<loop> (which is always of type C<struct ev_loop *>) will not have |
124 | this argument. |
124 | this argument. |
125 | |
125 | |
126 | =head2 TIME REPRESENTATION |
126 | =head2 TIME REPRESENTATION |
127 | |
127 | |
128 | Libev represents time as a single floating point number, representing |
128 | Libev represents time as a single floating point number, representing |
129 | the (fractional) number of seconds since the (POSIX) epoch (somewhere |
129 | the (fractional) number of seconds since the (POSIX) epoch (in practise |
130 | near the beginning of 1970, details are complicated, don't ask). This |
130 | somewhere near the beginning of 1970, details are complicated, don't |
131 | type is called C<ev_tstamp>, which is what you should use too. It usually |
131 | ask). This type is called C<ev_tstamp>, which is what you should use |
132 | aliases to the C<double> type in C. When you need to do any calculations |
132 | too. It usually aliases to the C<double> type in C. When you need to do |
133 | on it, you should treat it as some floating point value. Unlike the name |
133 | any calculations on it, you should treat it as some floating point value. |
|
|
134 | |
134 | component C<stamp> might indicate, it is also used for time differences |
135 | Unlike the name component C<stamp> might indicate, it is also used for |
135 | throughout libev. |
136 | time differences (e.g. delays) throughout libev. |
136 | |
137 | |
137 | =head1 ERROR HANDLING |
138 | =head1 ERROR HANDLING |
138 | |
139 | |
139 | Libev knows three classes of errors: operating system errors, usage errors |
140 | Libev knows three classes of errors: operating system errors, usage errors |
140 | and internal errors (bugs). |
141 | and internal errors (bugs). |
… | |
… | |
191 | as this indicates an incompatible change. Minor versions are usually |
192 | as this indicates an incompatible change. Minor versions are usually |
192 | compatible to older versions, so a larger minor version alone is usually |
193 | compatible to older versions, so a larger minor version alone is usually |
193 | not a problem. |
194 | not a problem. |
194 | |
195 | |
195 | Example: Make sure we haven't accidentally been linked against the wrong |
196 | Example: Make sure we haven't accidentally been linked against the wrong |
196 | version. |
197 | version (note, however, that this will not detect ABI mismatches :). |
197 | |
198 | |
198 | assert (("libev version mismatch", |
199 | assert (("libev version mismatch", |
199 | ev_version_major () == EV_VERSION_MAJOR |
200 | ev_version_major () == EV_VERSION_MAJOR |
200 | && ev_version_minor () >= EV_VERSION_MINOR)); |
201 | && ev_version_minor () >= EV_VERSION_MINOR)); |
201 | |
202 | |
… | |
… | |
291 | |
292 | |
292 | =back |
293 | =back |
293 | |
294 | |
294 | =head1 FUNCTIONS CONTROLLING THE EVENT LOOP |
295 | =head1 FUNCTIONS CONTROLLING THE EVENT LOOP |
295 | |
296 | |
296 | An event loop is described by a C<struct ev_loop *> (the C<struct> |
297 | An event loop is described by a C<struct ev_loop *> (the C<struct> is |
297 | is I<not> optional in this case, as there is also an C<ev_loop> |
298 | I<not> optional in this case unless libev 3 compatibility is disabled, as |
298 | I<function>). |
299 | libev 3 had an C<ev_loop> function colliding with the struct name). |
299 | |
300 | |
300 | The library knows two types of such loops, the I<default> loop, which |
301 | The library knows two types of such loops, the I<default> loop, which |
301 | supports signals and child events, and dynamically created loops which do |
302 | supports signals and child events, and dynamically created event loops |
302 | not. |
303 | which do not. |
303 | |
304 | |
304 | =over 4 |
305 | =over 4 |
305 | |
306 | |
306 | =item struct ev_loop *ev_default_loop (unsigned int flags) |
307 | =item struct ev_loop *ev_default_loop (unsigned int flags) |
307 | |
308 | |
… | |
… | |
345 | useful to try out specific backends to test their performance, or to work |
346 | useful to try out specific backends to test their performance, or to work |
346 | around bugs. |
347 | around bugs. |
347 | |
348 | |
348 | =item C<EVFLAG_FORKCHECK> |
349 | =item C<EVFLAG_FORKCHECK> |
349 | |
350 | |
350 | Instead of calling C<ev_default_fork> or C<ev_loop_fork> manually after |
351 | Instead of calling C<ev_loop_fork> manually after a fork, you can also |
351 | a fork, you can also make libev check for a fork in each iteration by |
352 | make libev check for a fork in each iteration by enabling this flag. |
352 | enabling this flag. |
|
|
353 | |
353 | |
354 | This works by calling C<getpid ()> on every iteration of the loop, |
354 | This works by calling C<getpid ()> on every iteration of the loop, |
355 | and thus this might slow down your event loop if you do a lot of loop |
355 | and thus this might slow down your event loop if you do a lot of loop |
356 | iterations and little real work, but is usually not noticeable (on my |
356 | iterations and little real work, but is usually not noticeable (on my |
357 | GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence |
357 | GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence |
… | |
… | |
370 | When this flag is specified, then libev will not attempt to use the |
370 | When this flag is specified, then libev will not attempt to use the |
371 | I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and |
371 | I<inotify> API for it's C<ev_stat> watchers. Apart from debugging and |
372 | testing, this flag can be useful to conserve inotify file descriptors, as |
372 | testing, this flag can be useful to conserve inotify file descriptors, as |
373 | otherwise each loop using C<ev_stat> watchers consumes one inotify handle. |
373 | otherwise each loop using C<ev_stat> watchers consumes one inotify handle. |
374 | |
374 | |
375 | =item C<EVFLAG_NOSIGNALFD> |
375 | =item C<EVFLAG_SIGNALFD> |
376 | |
376 | |
377 | When this flag is specified, then libev will not attempt to use the |
377 | When this flag is specified, then libev will attempt to use the |
378 | I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This is |
378 | I<signalfd> API for it's C<ev_signal> (and C<ev_child>) watchers. This API |
379 | probably only useful to work around any bugs in libev. Consequently, this |
379 | delivers signals synchronously, which makes it both faster and might make |
380 | flag might go away once the signalfd functionality is considered stable, |
380 | it possible to get the queued signal data. It can also simplify signal |
381 | so it's useful mostly in environment variables and not in program code. |
381 | handling with threads, as long as you properly block signals in your |
|
|
382 | threads that are not interested in handling them. |
|
|
383 | |
|
|
384 | Signalfd will not be used by default as this changes your signal mask, and |
|
|
385 | there are a lot of shoddy libraries and programs (glib's threadpool for |
|
|
386 | example) that can't properly initialise their signal masks. |
382 | |
387 | |
383 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
388 | =item C<EVBACKEND_SELECT> (value 1, portable select backend) |
384 | |
389 | |
385 | This is your standard select(2) backend. Not I<completely> standard, as |
390 | This is your standard select(2) backend. Not I<completely> standard, as |
386 | libev tries to roll its own fd_set with no limits on the number of fds, |
391 | libev tries to roll its own fd_set with no limits on the number of fds, |
… | |
… | |
410 | |
415 | |
411 | This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and |
416 | This backend maps C<EV_READ> to C<POLLIN | POLLERR | POLLHUP>, and |
412 | C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. |
417 | C<EV_WRITE> to C<POLLOUT | POLLERR | POLLHUP>. |
413 | |
418 | |
414 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
419 | =item C<EVBACKEND_EPOLL> (value 4, Linux) |
|
|
420 | |
|
|
421 | Use the linux-specific epoll(7) interface (for both pre- and post-2.6.9 |
|
|
422 | kernels). |
415 | |
423 | |
416 | For few fds, this backend is a bit little slower than poll and select, |
424 | For few fds, this backend is a bit little slower than poll and select, |
417 | but it scales phenomenally better. While poll and select usually scale |
425 | but it scales phenomenally better. While poll and select usually scale |
418 | like O(total_fds) where n is the total number of fds (or the highest fd), |
426 | like O(total_fds) where n is the total number of fds (or the highest fd), |
419 | epoll scales either O(1) or O(active_fds). |
427 | epoll scales either O(1) or O(active_fds). |
… | |
… | |
431 | of course I<doesn't>, and epoll just loves to report events for totally |
439 | of course I<doesn't>, and epoll just loves to report events for totally |
432 | I<different> file descriptors (even already closed ones, so one cannot |
440 | I<different> file descriptors (even already closed ones, so one cannot |
433 | even remove them from the set) than registered in the set (especially |
441 | even remove them from the set) than registered in the set (especially |
434 | on SMP systems). Libev tries to counter these spurious notifications by |
442 | on SMP systems). Libev tries to counter these spurious notifications by |
435 | employing an additional generation counter and comparing that against the |
443 | employing an additional generation counter and comparing that against the |
436 | events to filter out spurious ones, recreating the set when required. |
444 | events to filter out spurious ones, recreating the set when required. Last |
|
|
445 | not least, it also refuses to work with some file descriptors which work |
|
|
446 | perfectly fine with C<select> (files, many character devices...). |
437 | |
447 | |
438 | While stopping, setting and starting an I/O watcher in the same iteration |
448 | While stopping, setting and starting an I/O watcher in the same iteration |
439 | will result in some caching, there is still a system call per such |
449 | will result in some caching, there is still a system call per such |
440 | incident (because the same I<file descriptor> could point to a different |
450 | incident (because the same I<file descriptor> could point to a different |
441 | I<file description> now), so its best to avoid that. Also, C<dup ()>'ed |
451 | I<file description> now), so its best to avoid that. Also, C<dup ()>'ed |
… | |
… | |
559 | ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); |
569 | ev_default_loop (ev_recommended_backends () | EVBACKEND_KQUEUE); |
560 | |
570 | |
561 | =item struct ev_loop *ev_loop_new (unsigned int flags) |
571 | =item struct ev_loop *ev_loop_new (unsigned int flags) |
562 | |
572 | |
563 | Similar to C<ev_default_loop>, but always creates a new event loop that is |
573 | Similar to C<ev_default_loop>, but always creates a new event loop that is |
564 | always distinct from the default loop. Unlike the default loop, it cannot |
574 | always distinct from the default loop. |
565 | handle signal and child watchers, and attempts to do so will be greeted by |
|
|
566 | undefined behaviour (or a failed assertion if assertions are enabled). |
|
|
567 | |
575 | |
568 | Note that this function I<is> thread-safe, and the recommended way to use |
576 | Note that this function I<is> thread-safe, and one common way to use |
569 | libev with threads is indeed to create one loop per thread, and using the |
577 | libev with threads is indeed to create one loop per thread, and using the |
570 | default loop in the "main" or "initial" thread. |
578 | default loop in the "main" or "initial" thread. |
571 | |
579 | |
572 | Example: Try to create a event loop that uses epoll and nothing else. |
580 | Example: Try to create a event loop that uses epoll and nothing else. |
573 | |
581 | |
… | |
… | |
575 | if (!epoller) |
583 | if (!epoller) |
576 | fatal ("no epoll found here, maybe it hides under your chair"); |
584 | fatal ("no epoll found here, maybe it hides under your chair"); |
577 | |
585 | |
578 | =item ev_default_destroy () |
586 | =item ev_default_destroy () |
579 | |
587 | |
580 | Destroys the default loop again (frees all memory and kernel state |
588 | Destroys the default loop (frees all memory and kernel state etc.). None |
581 | etc.). None of the active event watchers will be stopped in the normal |
589 | of the active event watchers will be stopped in the normal sense, so |
582 | sense, so e.g. C<ev_is_active> might still return true. It is your |
590 | e.g. C<ev_is_active> might still return true. It is your responsibility to |
583 | responsibility to either stop all watchers cleanly yourself I<before> |
591 | either stop all watchers cleanly yourself I<before> calling this function, |
584 | calling this function, or cope with the fact afterwards (which is usually |
592 | or cope with the fact afterwards (which is usually the easiest thing, you |
585 | the easiest thing, you can just ignore the watchers and/or C<free ()> them |
593 | can just ignore the watchers and/or C<free ()> them for example). |
586 | for example). |
|
|
587 | |
594 | |
588 | Note that certain global state, such as signal state (and installed signal |
595 | Note that certain global state, such as signal state (and installed signal |
589 | handlers), will not be freed by this function, and related watchers (such |
596 | handlers), will not be freed by this function, and related watchers (such |
590 | as signal and child watchers) would need to be stopped manually. |
597 | as signal and child watchers) would need to be stopped manually. |
591 | |
598 | |
592 | In general it is not advisable to call this function except in the |
599 | In general it is not advisable to call this function except in the |
593 | rare occasion where you really need to free e.g. the signal handling |
600 | rare occasion where you really need to free e.g. the signal handling |
594 | pipe fds. If you need dynamically allocated loops it is better to use |
601 | pipe fds. If you need dynamically allocated loops it is better to use |
595 | C<ev_loop_new> and C<ev_loop_destroy>). |
602 | C<ev_loop_new> and C<ev_loop_destroy>. |
596 | |
603 | |
597 | =item ev_loop_destroy (loop) |
604 | =item ev_loop_destroy (loop) |
598 | |
605 | |
599 | Like C<ev_default_destroy>, but destroys an event loop created by an |
606 | Like C<ev_default_destroy>, but destroys an event loop created by an |
600 | earlier call to C<ev_loop_new>. |
607 | earlier call to C<ev_loop_new>. |
601 | |
608 | |
602 | =item ev_default_fork () |
609 | =item ev_default_fork () |
603 | |
610 | |
604 | This function sets a flag that causes subsequent C<ev_loop> iterations |
611 | This function sets a flag that causes subsequent C<ev_run> iterations |
605 | to reinitialise the kernel state for backends that have one. Despite the |
612 | to reinitialise the kernel state for backends that have one. Despite the |
606 | name, you can call it anytime, but it makes most sense after forking, in |
613 | name, you can call it anytime, but it makes most sense after forking, in |
607 | the child process (or both child and parent, but that again makes little |
614 | the child process (or both child and parent, but that again makes little |
608 | sense). You I<must> call it in the child before using any of the libev |
615 | sense). You I<must> call it in the child before using any of the libev |
609 | functions, and it will only take effect at the next C<ev_loop> iteration. |
616 | functions, and it will only take effect at the next C<ev_run> iteration. |
|
|
617 | |
|
|
618 | Again, you I<have> to call it on I<any> loop that you want to re-use after |
|
|
619 | a fork, I<even if you do not plan to use the loop in the parent>. This is |
|
|
620 | because some kernel interfaces *cough* I<kqueue> *cough* do funny things |
|
|
621 | during fork. |
610 | |
622 | |
611 | On the other hand, you only need to call this function in the child |
623 | On the other hand, you only need to call this function in the child |
612 | process if and only if you want to use the event library in the child. If |
624 | process if and only if you want to use the event loop in the child. If |
613 | you just fork+exec, you don't have to call it at all. |
625 | you just fork+exec or create a new loop in the child, you don't have to |
|
|
626 | call it at all (in fact, C<epoll> is so badly broken that it makes a |
|
|
627 | difference, but libev will usually detect this case on its own and do a |
|
|
628 | costly reset of the backend). |
614 | |
629 | |
615 | The function itself is quite fast and it's usually not a problem to call |
630 | The function itself is quite fast and it's usually not a problem to call |
616 | it just in case after a fork. To make this easy, the function will fit in |
631 | it just in case after a fork. To make this easy, the function will fit in |
617 | quite nicely into a call to C<pthread_atfork>: |
632 | quite nicely into a call to C<pthread_atfork>: |
618 | |
633 | |
… | |
… | |
620 | |
635 | |
621 | =item ev_loop_fork (loop) |
636 | =item ev_loop_fork (loop) |
622 | |
637 | |
623 | Like C<ev_default_fork>, but acts on an event loop created by |
638 | Like C<ev_default_fork>, but acts on an event loop created by |
624 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
639 | C<ev_loop_new>. Yes, you have to call this on every allocated event loop |
625 | after fork that you want to re-use in the child, and how you do this is |
640 | after fork that you want to re-use in the child, and how you keep track of |
626 | entirely your own problem. |
641 | them is entirely your own problem. |
627 | |
642 | |
628 | =item int ev_is_default_loop (loop) |
643 | =item int ev_is_default_loop (loop) |
629 | |
644 | |
630 | Returns true when the given loop is, in fact, the default loop, and false |
645 | Returns true when the given loop is, in fact, the default loop, and false |
631 | otherwise. |
646 | otherwise. |
632 | |
647 | |
633 | =item unsigned int ev_loop_count (loop) |
648 | =item unsigned int ev_iteration (loop) |
634 | |
649 | |
635 | Returns the count of loop iterations for the loop, which is identical to |
650 | Returns the current iteration count for the event loop, which is identical |
636 | the number of times libev did poll for new events. It starts at C<0> and |
651 | to the number of times libev did poll for new events. It starts at C<0> |
637 | happily wraps around with enough iterations. |
652 | and happily wraps around with enough iterations. |
638 | |
653 | |
639 | This value can sometimes be useful as a generation counter of sorts (it |
654 | This value can sometimes be useful as a generation counter of sorts (it |
640 | "ticks" the number of loop iterations), as it roughly corresponds with |
655 | "ticks" the number of loop iterations), as it roughly corresponds with |
641 | C<ev_prepare> and C<ev_check> calls. |
656 | C<ev_prepare> and C<ev_check> calls - and is incremented between the |
|
|
657 | prepare and check phases. |
642 | |
658 | |
643 | =item unsigned int ev_loop_depth (loop) |
659 | =item unsigned int ev_depth (loop) |
644 | |
660 | |
645 | Returns the number of times C<ev_loop> was entered minus the number of |
661 | Returns the number of times C<ev_run> was entered minus the number of |
646 | times C<ev_loop> was exited, in other words, the recursion depth. |
662 | times C<ev_run> was exited, in other words, the recursion depth. |
647 | |
663 | |
648 | Outside C<ev_loop>, this number is zero. In a callback, this number is |
664 | Outside C<ev_run>, this number is zero. In a callback, this number is |
649 | C<1>, unless C<ev_loop> was invoked recursively (or from another thread), |
665 | C<1>, unless C<ev_run> was invoked recursively (or from another thread), |
650 | in which case it is higher. |
666 | in which case it is higher. |
651 | |
667 | |
652 | Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread |
668 | Leaving C<ev_run> abnormally (setjmp/longjmp, cancelling the thread |
653 | etc.), doesn't count as exit. |
669 | etc.), doesn't count as "exit" - consider this as a hint to avoid such |
|
|
670 | ungentleman-like behaviour unless it's really convenient. |
654 | |
671 | |
655 | =item unsigned int ev_backend (loop) |
672 | =item unsigned int ev_backend (loop) |
656 | |
673 | |
657 | Returns one of the C<EVBACKEND_*> flags indicating the event backend in |
674 | Returns one of the C<EVBACKEND_*> flags indicating the event backend in |
658 | use. |
675 | use. |
… | |
… | |
667 | |
684 | |
668 | =item ev_now_update (loop) |
685 | =item ev_now_update (loop) |
669 | |
686 | |
670 | Establishes the current time by querying the kernel, updating the time |
687 | Establishes the current time by querying the kernel, updating the time |
671 | returned by C<ev_now ()> in the progress. This is a costly operation and |
688 | returned by C<ev_now ()> in the progress. This is a costly operation and |
672 | is usually done automatically within C<ev_loop ()>. |
689 | is usually done automatically within C<ev_run ()>. |
673 | |
690 | |
674 | This function is rarely useful, but when some event callback runs for a |
691 | This function is rarely useful, but when some event callback runs for a |
675 | very long time without entering the event loop, updating libev's idea of |
692 | very long time without entering the event loop, updating libev's idea of |
676 | the current time is a good idea. |
693 | the current time is a good idea. |
677 | |
694 | |
… | |
… | |
679 | |
696 | |
680 | =item ev_suspend (loop) |
697 | =item ev_suspend (loop) |
681 | |
698 | |
682 | =item ev_resume (loop) |
699 | =item ev_resume (loop) |
683 | |
700 | |
684 | These two functions suspend and resume a loop, for use when the loop is |
701 | These two functions suspend and resume an event loop, for use when the |
685 | not used for a while and timeouts should not be processed. |
702 | loop is not used for a while and timeouts should not be processed. |
686 | |
703 | |
687 | A typical use case would be an interactive program such as a game: When |
704 | A typical use case would be an interactive program such as a game: When |
688 | the user presses C<^Z> to suspend the game and resumes it an hour later it |
705 | the user presses C<^Z> to suspend the game and resumes it an hour later it |
689 | would be best to handle timeouts as if no time had actually passed while |
706 | would be best to handle timeouts as if no time had actually passed while |
690 | the program was suspended. This can be achieved by calling C<ev_suspend> |
707 | the program was suspended. This can be achieved by calling C<ev_suspend> |
… | |
… | |
692 | C<ev_resume> directly afterwards to resume timer processing. |
709 | C<ev_resume> directly afterwards to resume timer processing. |
693 | |
710 | |
694 | Effectively, all C<ev_timer> watchers will be delayed by the time spend |
711 | Effectively, all C<ev_timer> watchers will be delayed by the time spend |
695 | between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers |
712 | between C<ev_suspend> and C<ev_resume>, and all C<ev_periodic> watchers |
696 | will be rescheduled (that is, they will lose any events that would have |
713 | will be rescheduled (that is, they will lose any events that would have |
697 | occured while suspended). |
714 | occurred while suspended). |
698 | |
715 | |
699 | After calling C<ev_suspend> you B<must not> call I<any> function on the |
716 | After calling C<ev_suspend> you B<must not> call I<any> function on the |
700 | given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> |
717 | given loop other than C<ev_resume>, and you B<must not> call C<ev_resume> |
701 | without a previous call to C<ev_suspend>. |
718 | without a previous call to C<ev_suspend>. |
702 | |
719 | |
703 | Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the |
720 | Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the |
704 | event loop time (see C<ev_now_update>). |
721 | event loop time (see C<ev_now_update>). |
705 | |
722 | |
706 | =item ev_loop (loop, int flags) |
723 | =item ev_run (loop, int flags) |
707 | |
724 | |
708 | Finally, this is it, the event handler. This function usually is called |
725 | Finally, this is it, the event handler. This function usually is called |
709 | after you initialised all your watchers and you want to start handling |
726 | after you have initialised all your watchers and you want to start |
710 | events. |
727 | handling events. It will ask the operating system for any new events, call |
|
|
728 | the watcher callbacks, an then repeat the whole process indefinitely: This |
|
|
729 | is why event loops are called I<loops>. |
711 | |
730 | |
712 | If the flags argument is specified as C<0>, it will not return until |
731 | If the flags argument is specified as C<0>, it will keep handling events |
713 | either no event watchers are active anymore or C<ev_unloop> was called. |
732 | until either no event watchers are active anymore or C<ev_break> was |
|
|
733 | called. |
714 | |
734 | |
715 | Please note that an explicit C<ev_unloop> is usually better than |
735 | Please note that an explicit C<ev_break> is usually better than |
716 | relying on all watchers to be stopped when deciding when a program has |
736 | relying on all watchers to be stopped when deciding when a program has |
717 | finished (especially in interactive programs), but having a program |
737 | finished (especially in interactive programs), but having a program |
718 | that automatically loops as long as it has to and no longer by virtue |
738 | that automatically loops as long as it has to and no longer by virtue |
719 | of relying on its watchers stopping correctly, that is truly a thing of |
739 | of relying on its watchers stopping correctly, that is truly a thing of |
720 | beauty. |
740 | beauty. |
721 | |
741 | |
722 | A flags value of C<EVLOOP_NONBLOCK> will look for new events, will handle |
742 | A flags value of C<EVRUN_NOWAIT> will look for new events, will handle |
723 | those events and any already outstanding ones, but will not block your |
743 | those events and any already outstanding ones, but will not wait and |
724 | process in case there are no events and will return after one iteration of |
744 | block your process in case there are no events and will return after one |
725 | the loop. |
745 | iteration of the loop. This is sometimes useful to poll and handle new |
|
|
746 | events while doing lengthy calculations, to keep the program responsive. |
726 | |
747 | |
727 | A flags value of C<EVLOOP_ONESHOT> will look for new events (waiting if |
748 | A flags value of C<EVRUN_ONCE> will look for new events (waiting if |
728 | necessary) and will handle those and any already outstanding ones. It |
749 | necessary) and will handle those and any already outstanding ones. It |
729 | will block your process until at least one new event arrives (which could |
750 | will block your process until at least one new event arrives (which could |
730 | be an event internal to libev itself, so there is no guarantee that a |
751 | be an event internal to libev itself, so there is no guarantee that a |
731 | user-registered callback will be called), and will return after one |
752 | user-registered callback will be called), and will return after one |
732 | iteration of the loop. |
753 | iteration of the loop. |
733 | |
754 | |
734 | This is useful if you are waiting for some external event in conjunction |
755 | This is useful if you are waiting for some external event in conjunction |
735 | with something not expressible using other libev watchers (i.e. "roll your |
756 | with something not expressible using other libev watchers (i.e. "roll your |
736 | own C<ev_loop>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is |
757 | own C<ev_run>"). However, a pair of C<ev_prepare>/C<ev_check> watchers is |
737 | usually a better approach for this kind of thing. |
758 | usually a better approach for this kind of thing. |
738 | |
759 | |
739 | Here are the gory details of what C<ev_loop> does: |
760 | Here are the gory details of what C<ev_run> does: |
740 | |
761 | |
|
|
762 | - Increment loop depth. |
|
|
763 | - Reset the ev_break status. |
741 | - Before the first iteration, call any pending watchers. |
764 | - Before the first iteration, call any pending watchers. |
|
|
765 | LOOP: |
742 | * If EVFLAG_FORKCHECK was used, check for a fork. |
766 | - If EVFLAG_FORKCHECK was used, check for a fork. |
743 | - If a fork was detected (by any means), queue and call all fork watchers. |
767 | - If a fork was detected (by any means), queue and call all fork watchers. |
744 | - Queue and call all prepare watchers. |
768 | - Queue and call all prepare watchers. |
|
|
769 | - If ev_break was called, goto FINISH. |
745 | - If we have been forked, detach and recreate the kernel state |
770 | - If we have been forked, detach and recreate the kernel state |
746 | as to not disturb the other process. |
771 | as to not disturb the other process. |
747 | - Update the kernel state with all outstanding changes. |
772 | - Update the kernel state with all outstanding changes. |
748 | - Update the "event loop time" (ev_now ()). |
773 | - Update the "event loop time" (ev_now ()). |
749 | - Calculate for how long to sleep or block, if at all |
774 | - Calculate for how long to sleep or block, if at all |
750 | (active idle watchers, EVLOOP_NONBLOCK or not having |
775 | (active idle watchers, EVRUN_NOWAIT or not having |
751 | any active watchers at all will result in not sleeping). |
776 | any active watchers at all will result in not sleeping). |
752 | - Sleep if the I/O and timer collect interval say so. |
777 | - Sleep if the I/O and timer collect interval say so. |
|
|
778 | - Increment loop iteration counter. |
753 | - Block the process, waiting for any events. |
779 | - Block the process, waiting for any events. |
754 | - Queue all outstanding I/O (fd) events. |
780 | - Queue all outstanding I/O (fd) events. |
755 | - Update the "event loop time" (ev_now ()), and do time jump adjustments. |
781 | - Update the "event loop time" (ev_now ()), and do time jump adjustments. |
756 | - Queue all expired timers. |
782 | - Queue all expired timers. |
757 | - Queue all expired periodics. |
783 | - Queue all expired periodics. |
758 | - Unless any events are pending now, queue all idle watchers. |
784 | - Queue all idle watchers with priority higher than that of pending events. |
759 | - Queue all check watchers. |
785 | - Queue all check watchers. |
760 | - Call all queued watchers in reverse order (i.e. check watchers first). |
786 | - Call all queued watchers in reverse order (i.e. check watchers first). |
761 | Signals and child watchers are implemented as I/O watchers, and will |
787 | Signals and child watchers are implemented as I/O watchers, and will |
762 | be handled here by queueing them when their watcher gets executed. |
788 | be handled here by queueing them when their watcher gets executed. |
763 | - If ev_unloop has been called, or EVLOOP_ONESHOT or EVLOOP_NONBLOCK |
789 | - If ev_break has been called, or EVRUN_ONCE or EVRUN_NOWAIT |
764 | were used, or there are no active watchers, return, otherwise |
790 | were used, or there are no active watchers, goto FINISH, otherwise |
765 | continue with step *. |
791 | continue with step LOOP. |
|
|
792 | FINISH: |
|
|
793 | - Reset the ev_break status iff it was EVBREAK_ONE. |
|
|
794 | - Decrement the loop depth. |
|
|
795 | - Return. |
766 | |
796 | |
767 | Example: Queue some jobs and then loop until no events are outstanding |
797 | Example: Queue some jobs and then loop until no events are outstanding |
768 | anymore. |
798 | anymore. |
769 | |
799 | |
770 | ... queue jobs here, make sure they register event watchers as long |
800 | ... queue jobs here, make sure they register event watchers as long |
771 | ... as they still have work to do (even an idle watcher will do..) |
801 | ... as they still have work to do (even an idle watcher will do..) |
772 | ev_loop (my_loop, 0); |
802 | ev_run (my_loop, 0); |
773 | ... jobs done or somebody called unloop. yeah! |
803 | ... jobs done or somebody called unloop. yeah! |
774 | |
804 | |
775 | =item ev_unloop (loop, how) |
805 | =item ev_break (loop, how) |
776 | |
806 | |
777 | Can be used to make a call to C<ev_loop> return early (but only after it |
807 | Can be used to make a call to C<ev_run> return early (but only after it |
778 | has processed all outstanding events). The C<how> argument must be either |
808 | has processed all outstanding events). The C<how> argument must be either |
779 | C<EVUNLOOP_ONE>, which will make the innermost C<ev_loop> call return, or |
809 | C<EVBREAK_ONE>, which will make the innermost C<ev_run> call return, or |
780 | C<EVUNLOOP_ALL>, which will make all nested C<ev_loop> calls return. |
810 | C<EVBREAK_ALL>, which will make all nested C<ev_run> calls return. |
781 | |
811 | |
782 | This "unloop state" will be cleared when entering C<ev_loop> again. |
812 | This "unloop state" will be cleared when entering C<ev_run> again. |
783 | |
813 | |
784 | It is safe to call C<ev_unloop> from otuside any C<ev_loop> calls. |
814 | It is safe to call C<ev_break> from outside any C<ev_run> calls. ##TODO## |
785 | |
815 | |
786 | =item ev_ref (loop) |
816 | =item ev_ref (loop) |
787 | |
817 | |
788 | =item ev_unref (loop) |
818 | =item ev_unref (loop) |
789 | |
819 | |
790 | Ref/unref can be used to add or remove a reference count on the event |
820 | Ref/unref can be used to add or remove a reference count on the event |
791 | loop: Every watcher keeps one reference, and as long as the reference |
821 | loop: Every watcher keeps one reference, and as long as the reference |
792 | count is nonzero, C<ev_loop> will not return on its own. |
822 | count is nonzero, C<ev_run> will not return on its own. |
793 | |
823 | |
794 | If you have a watcher you never unregister that should not keep C<ev_loop> |
824 | This is useful when you have a watcher that you never intend to |
795 | from returning, call ev_unref() after starting, and ev_ref() before |
825 | unregister, but that nevertheless should not keep C<ev_run> from |
|
|
826 | returning. In such a case, call C<ev_unref> after starting, and C<ev_ref> |
796 | stopping it. |
827 | before stopping it. |
797 | |
828 | |
798 | As an example, libev itself uses this for its internal signal pipe: It |
829 | As an example, libev itself uses this for its internal signal pipe: It |
799 | is not visible to the libev user and should not keep C<ev_loop> from |
830 | is not visible to the libev user and should not keep C<ev_run> from |
800 | exiting if no event watchers registered by it are active. It is also an |
831 | exiting if no event watchers registered by it are active. It is also an |
801 | excellent way to do this for generic recurring timers or from within |
832 | excellent way to do this for generic recurring timers or from within |
802 | third-party libraries. Just remember to I<unref after start> and I<ref |
833 | third-party libraries. Just remember to I<unref after start> and I<ref |
803 | before stop> (but only if the watcher wasn't active before, or was active |
834 | before stop> (but only if the watcher wasn't active before, or was active |
804 | before, respectively. Note also that libev might stop watchers itself |
835 | before, respectively. Note also that libev might stop watchers itself |
805 | (e.g. non-repeating timers) in which case you have to C<ev_ref> |
836 | (e.g. non-repeating timers) in which case you have to C<ev_ref> |
806 | in the callback). |
837 | in the callback). |
807 | |
838 | |
808 | Example: Create a signal watcher, but keep it from keeping C<ev_loop> |
839 | Example: Create a signal watcher, but keep it from keeping C<ev_run> |
809 | running when nothing else is active. |
840 | running when nothing else is active. |
810 | |
841 | |
811 | ev_signal exitsig; |
842 | ev_signal exitsig; |
812 | ev_signal_init (&exitsig, sig_cb, SIGINT); |
843 | ev_signal_init (&exitsig, sig_cb, SIGINT); |
813 | ev_signal_start (loop, &exitsig); |
844 | ev_signal_start (loop, &exitsig); |
… | |
… | |
858 | usually doesn't make much sense to set it to a lower value than C<0.01>, |
889 | usually doesn't make much sense to set it to a lower value than C<0.01>, |
859 | as this approaches the timing granularity of most systems. Note that if |
890 | as this approaches the timing granularity of most systems. Note that if |
860 | you do transactions with the outside world and you can't increase the |
891 | you do transactions with the outside world and you can't increase the |
861 | parallelity, then this setting will limit your transaction rate (if you |
892 | parallelity, then this setting will limit your transaction rate (if you |
862 | need to poll once per transaction and the I/O collect interval is 0.01, |
893 | need to poll once per transaction and the I/O collect interval is 0.01, |
863 | then you can't do more than 100 transations per second). |
894 | then you can't do more than 100 transactions per second). |
864 | |
895 | |
865 | Setting the I<timeout collect interval> can improve the opportunity for |
896 | Setting the I<timeout collect interval> can improve the opportunity for |
866 | saving power, as the program will "bundle" timer callback invocations that |
897 | saving power, as the program will "bundle" timer callback invocations that |
867 | are "near" in time together, by delaying some, thus reducing the number of |
898 | are "near" in time together, by delaying some, thus reducing the number of |
868 | times the process sleeps and wakes up again. Another useful technique to |
899 | times the process sleeps and wakes up again. Another useful technique to |
… | |
… | |
876 | ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); |
907 | ev_set_io_collect_interval (EV_DEFAULT_UC_ 0.01); |
877 | |
908 | |
878 | =item ev_invoke_pending (loop) |
909 | =item ev_invoke_pending (loop) |
879 | |
910 | |
880 | This call will simply invoke all pending watchers while resetting their |
911 | This call will simply invoke all pending watchers while resetting their |
881 | pending state. Normally, C<ev_loop> does this automatically when required, |
912 | pending state. Normally, C<ev_run> does this automatically when required, |
882 | but when overriding the invoke callback this call comes handy. |
913 | but when overriding the invoke callback this call comes handy. |
883 | |
914 | |
884 | =item int ev_pending_count (loop) |
915 | =item int ev_pending_count (loop) |
885 | |
916 | |
886 | Returns the number of pending watchers - zero indicates that no watchers |
917 | Returns the number of pending watchers - zero indicates that no watchers |
887 | are pending. |
918 | are pending. |
888 | |
919 | |
889 | =item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P)) |
920 | =item ev_set_invoke_pending_cb (loop, void (*invoke_pending_cb)(EV_P)) |
890 | |
921 | |
891 | This overrides the invoke pending functionality of the loop: Instead of |
922 | This overrides the invoke pending functionality of the loop: Instead of |
892 | invoking all pending watchers when there are any, C<ev_loop> will call |
923 | invoking all pending watchers when there are any, C<ev_run> will call |
893 | this callback instead. This is useful, for example, when you want to |
924 | this callback instead. This is useful, for example, when you want to |
894 | invoke the actual watchers inside another context (another thread etc.). |
925 | invoke the actual watchers inside another context (another thread etc.). |
895 | |
926 | |
896 | If you want to reset the callback, use C<ev_invoke_pending> as new |
927 | If you want to reset the callback, use C<ev_invoke_pending> as new |
897 | callback. |
928 | callback. |
… | |
… | |
900 | |
931 | |
901 | Sometimes you want to share the same loop between multiple threads. This |
932 | Sometimes you want to share the same loop between multiple threads. This |
902 | can be done relatively simply by putting mutex_lock/unlock calls around |
933 | can be done relatively simply by putting mutex_lock/unlock calls around |
903 | each call to a libev function. |
934 | each call to a libev function. |
904 | |
935 | |
905 | However, C<ev_loop> can run an indefinite time, so it is not feasible to |
936 | However, C<ev_run> can run an indefinite time, so it is not feasible |
906 | wait for it to return. One way around this is to wake up the loop via |
937 | to wait for it to return. One way around this is to wake up the event |
907 | C<ev_unloop> and C<av_async_send>, another way is to set these I<release> |
938 | loop via C<ev_break> and C<av_async_send>, another way is to set these |
908 | and I<acquire> callbacks on the loop. |
939 | I<release> and I<acquire> callbacks on the loop. |
909 | |
940 | |
910 | When set, then C<release> will be called just before the thread is |
941 | When set, then C<release> will be called just before the thread is |
911 | suspended waiting for new events, and C<acquire> is called just |
942 | suspended waiting for new events, and C<acquire> is called just |
912 | afterwards. |
943 | afterwards. |
913 | |
944 | |
… | |
… | |
916 | |
947 | |
917 | While event loop modifications are allowed between invocations of |
948 | While event loop modifications are allowed between invocations of |
918 | C<release> and C<acquire> (that's their only purpose after all), no |
949 | C<release> and C<acquire> (that's their only purpose after all), no |
919 | modifications done will affect the event loop, i.e. adding watchers will |
950 | modifications done will affect the event loop, i.e. adding watchers will |
920 | have no effect on the set of file descriptors being watched, or the time |
951 | have no effect on the set of file descriptors being watched, or the time |
921 | waited. USe an C<ev_async> watcher to wake up C<ev_loop> when you want it |
952 | waited. Use an C<ev_async> watcher to wake up C<ev_run> when you want it |
922 | to take note of any changes you made. |
953 | to take note of any changes you made. |
923 | |
954 | |
924 | In theory, threads executing C<ev_loop> will be async-cancel safe between |
955 | In theory, threads executing C<ev_run> will be async-cancel safe between |
925 | invocations of C<release> and C<acquire>. |
956 | invocations of C<release> and C<acquire>. |
926 | |
957 | |
927 | See also the locking example in the C<THREADS> section later in this |
958 | See also the locking example in the C<THREADS> section later in this |
928 | document. |
959 | document. |
929 | |
960 | |
… | |
… | |
938 | These two functions can be used to associate arbitrary data with a loop, |
969 | These two functions can be used to associate arbitrary data with a loop, |
939 | and are intended solely for the C<invoke_pending_cb>, C<release> and |
970 | and are intended solely for the C<invoke_pending_cb>, C<release> and |
940 | C<acquire> callbacks described above, but of course can be (ab-)used for |
971 | C<acquire> callbacks described above, but of course can be (ab-)used for |
941 | any other purpose as well. |
972 | any other purpose as well. |
942 | |
973 | |
943 | =item ev_loop_verify (loop) |
974 | =item ev_verify (loop) |
944 | |
975 | |
945 | This function only does something when C<EV_VERIFY> support has been |
976 | This function only does something when C<EV_VERIFY> support has been |
946 | compiled in, which is the default for non-minimal builds. It tries to go |
977 | compiled in, which is the default for non-minimal builds. It tries to go |
947 | through all internal structures and checks them for validity. If anything |
978 | through all internal structures and checks them for validity. If anything |
948 | is found to be inconsistent, it will print an error message to standard |
979 | is found to be inconsistent, it will print an error message to standard |
… | |
… | |
959 | |
990 | |
960 | In the following description, uppercase C<TYPE> in names stands for the |
991 | In the following description, uppercase C<TYPE> in names stands for the |
961 | watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer |
992 | watcher type, e.g. C<ev_TYPE_start> can mean C<ev_timer_start> for timer |
962 | watchers and C<ev_io_start> for I/O watchers. |
993 | watchers and C<ev_io_start> for I/O watchers. |
963 | |
994 | |
964 | A watcher is a structure that you create and register to record your |
995 | A watcher is an opaque structure that you allocate and register to record |
965 | interest in some event. For instance, if you want to wait for STDIN to |
996 | your interest in some event. To make a concrete example, imagine you want |
966 | become readable, you would create an C<ev_io> watcher for that: |
997 | to wait for STDIN to become readable, you would create an C<ev_io> watcher |
|
|
998 | for that: |
967 | |
999 | |
968 | static void my_cb (struct ev_loop *loop, ev_io *w, int revents) |
1000 | static void my_cb (struct ev_loop *loop, ev_io *w, int revents) |
969 | { |
1001 | { |
970 | ev_io_stop (w); |
1002 | ev_io_stop (w); |
971 | ev_unloop (loop, EVUNLOOP_ALL); |
1003 | ev_break (loop, EVBREAK_ALL); |
972 | } |
1004 | } |
973 | |
1005 | |
974 | struct ev_loop *loop = ev_default_loop (0); |
1006 | struct ev_loop *loop = ev_default_loop (0); |
975 | |
1007 | |
976 | ev_io stdin_watcher; |
1008 | ev_io stdin_watcher; |
977 | |
1009 | |
978 | ev_init (&stdin_watcher, my_cb); |
1010 | ev_init (&stdin_watcher, my_cb); |
979 | ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); |
1011 | ev_io_set (&stdin_watcher, STDIN_FILENO, EV_READ); |
980 | ev_io_start (loop, &stdin_watcher); |
1012 | ev_io_start (loop, &stdin_watcher); |
981 | |
1013 | |
982 | ev_loop (loop, 0); |
1014 | ev_run (loop, 0); |
983 | |
1015 | |
984 | As you can see, you are responsible for allocating the memory for your |
1016 | As you can see, you are responsible for allocating the memory for your |
985 | watcher structures (and it is I<usually> a bad idea to do this on the |
1017 | watcher structures (and it is I<usually> a bad idea to do this on the |
986 | stack). |
1018 | stack). |
987 | |
1019 | |
988 | Each watcher has an associated watcher structure (called C<struct ev_TYPE> |
1020 | Each watcher has an associated watcher structure (called C<struct ev_TYPE> |
989 | or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). |
1021 | or simply C<ev_TYPE>, as typedefs are provided for all watcher structs). |
990 | |
1022 | |
991 | Each watcher structure must be initialised by a call to C<ev_init |
1023 | Each watcher structure must be initialised by a call to C<ev_init (watcher |
992 | (watcher *, callback)>, which expects a callback to be provided. This |
1024 | *, callback)>, which expects a callback to be provided. This callback is |
993 | callback gets invoked each time the event occurs (or, in the case of I/O |
1025 | invoked each time the event occurs (or, in the case of I/O watchers, each |
994 | watchers, each time the event loop detects that the file descriptor given |
1026 | time the event loop detects that the file descriptor given is readable |
995 | is readable and/or writable). |
1027 | and/or writable). |
996 | |
1028 | |
997 | Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> |
1029 | Each watcher type further has its own C<< ev_TYPE_set (watcher *, ...) >> |
998 | macro to configure it, with arguments specific to the watcher type. There |
1030 | macro to configure it, with arguments specific to the watcher type. There |
999 | is also a macro to combine initialisation and setting in one call: C<< |
1031 | is also a macro to combine initialisation and setting in one call: C<< |
1000 | ev_TYPE_init (watcher *, callback, ...) >>. |
1032 | ev_TYPE_init (watcher *, callback, ...) >>. |
… | |
… | |
1023 | =item C<EV_WRITE> |
1055 | =item C<EV_WRITE> |
1024 | |
1056 | |
1025 | The file descriptor in the C<ev_io> watcher has become readable and/or |
1057 | The file descriptor in the C<ev_io> watcher has become readable and/or |
1026 | writable. |
1058 | writable. |
1027 | |
1059 | |
1028 | =item C<EV_TIMEOUT> |
1060 | =item C<EV_TIMER> |
1029 | |
1061 | |
1030 | The C<ev_timer> watcher has timed out. |
1062 | The C<ev_timer> watcher has timed out. |
1031 | |
1063 | |
1032 | =item C<EV_PERIODIC> |
1064 | =item C<EV_PERIODIC> |
1033 | |
1065 | |
… | |
… | |
1051 | |
1083 | |
1052 | =item C<EV_PREPARE> |
1084 | =item C<EV_PREPARE> |
1053 | |
1085 | |
1054 | =item C<EV_CHECK> |
1086 | =item C<EV_CHECK> |
1055 | |
1087 | |
1056 | All C<ev_prepare> watchers are invoked just I<before> C<ev_loop> starts |
1088 | All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts |
1057 | to gather new events, and all C<ev_check> watchers are invoked just after |
1089 | to gather new events, and all C<ev_check> watchers are invoked just after |
1058 | C<ev_loop> has gathered them, but before it invokes any callbacks for any |
1090 | C<ev_run> has gathered them, but before it invokes any callbacks for any |
1059 | received events. Callbacks of both watcher types can start and stop as |
1091 | received events. Callbacks of both watcher types can start and stop as |
1060 | many watchers as they want, and all of them will be taken into account |
1092 | many watchers as they want, and all of them will be taken into account |
1061 | (for example, a C<ev_prepare> watcher might start an idle watcher to keep |
1093 | (for example, a C<ev_prepare> watcher might start an idle watcher to keep |
1062 | C<ev_loop> from blocking). |
1094 | C<ev_run> from blocking). |
1063 | |
1095 | |
1064 | =item C<EV_EMBED> |
1096 | =item C<EV_EMBED> |
1065 | |
1097 | |
1066 | The embedded event loop specified in the C<ev_embed> watcher needs attention. |
1098 | The embedded event loop specified in the C<ev_embed> watcher needs attention. |
1067 | |
1099 | |
… | |
… | |
1098 | programs, though, as the fd could already be closed and reused for another |
1130 | programs, though, as the fd could already be closed and reused for another |
1099 | thing, so beware. |
1131 | thing, so beware. |
1100 | |
1132 | |
1101 | =back |
1133 | =back |
1102 | |
1134 | |
|
|
1135 | =head2 WATCHER STATES |
|
|
1136 | |
|
|
1137 | There are various watcher states mentioned throughout this manual - |
|
|
1138 | active, pending and so on. In this section these states and the rules to |
|
|
1139 | transition between them will be described in more detail - and while these |
|
|
1140 | rules might look complicated, they usually do "the right thing". |
|
|
1141 | |
|
|
1142 | =over 4 |
|
|
1143 | |
|
|
1144 | =item initialiased |
|
|
1145 | |
|
|
1146 | Before a watcher can be registered with the event looop it has to be |
|
|
1147 | initialised. This can be done with a call to C<ev_TYPE_init>, or calls to |
|
|
1148 | C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. |
|
|
1149 | |
|
|
1150 | In this state it is simply some block of memory that is suitable for use |
|
|
1151 | in an event loop. It can be moved around, freed, reused etc. at will. |
|
|
1152 | |
|
|
1153 | =item started/running/active |
|
|
1154 | |
|
|
1155 | Once a watcher has been started with a call to C<ev_TYPE_start> it becomes |
|
|
1156 | property of the event loop, and is actively waiting for events. While in |
|
|
1157 | this state it cannot be accessed (except in a few documented ways), moved, |
|
|
1158 | freed or anything else - the only legal thing is to keep a pointer to it, |
|
|
1159 | and call libev functions on it that are documented to work on active watchers. |
|
|
1160 | |
|
|
1161 | =item pending |
|
|
1162 | |
|
|
1163 | If a watcher is active and libev determines that an event it is interested |
|
|
1164 | in has occured (such as a timer expiring), it will become pending. It will |
|
|
1165 | stay in this pending state until either it is stopped or its callback is |
|
|
1166 | about to be invoked, so it is not normally pending inside the watcher |
|
|
1167 | callback. |
|
|
1168 | |
|
|
1169 | The watcher might or might not be active while it is pending (for example, |
|
|
1170 | an expired non-repeating timer can be pending but no longer active). If it |
|
|
1171 | is stopped, it can be freely accessed (e.g. by calling C<ev_TYPE_set>), |
|
|
1172 | but it is still property of the event loop at this time, so cannot be |
|
|
1173 | moved, freed or reused. And if it is active the rules described in the |
|
|
1174 | previous item still apply. |
|
|
1175 | |
|
|
1176 | It is also possible to feed an event on a watcher that is not active (e.g. |
|
|
1177 | via C<ev_feed_event>), in which case it becomes pending without being |
|
|
1178 | active. |
|
|
1179 | |
|
|
1180 | =item stopped |
|
|
1181 | |
|
|
1182 | A watcher can be stopped implicitly by libev (in which case it might still |
|
|
1183 | be pending), or explicitly by calling its C<ev_TYPE_stop> function. The |
|
|
1184 | latter will clear any pending state the watcher might be in, regardless |
|
|
1185 | of whether it was active or not, so stopping a watcher explicitly before |
|
|
1186 | freeing it is often a good idea. |
|
|
1187 | |
|
|
1188 | While stopped (and not pending) the watcher is essentially in the |
|
|
1189 | initialised state, that is it can be reused, moved, modified in any way |
|
|
1190 | you wish. |
|
|
1191 | |
|
|
1192 | =back |
|
|
1193 | |
1103 | =head2 GENERIC WATCHER FUNCTIONS |
1194 | =head2 GENERIC WATCHER FUNCTIONS |
1104 | |
1195 | |
1105 | =over 4 |
1196 | =over 4 |
1106 | |
1197 | |
1107 | =item C<ev_init> (ev_TYPE *watcher, callback) |
1198 | =item C<ev_init> (ev_TYPE *watcher, callback) |
… | |
… | |
1123 | |
1214 | |
1124 | ev_io w; |
1215 | ev_io w; |
1125 | ev_init (&w, my_cb); |
1216 | ev_init (&w, my_cb); |
1126 | ev_io_set (&w, STDIN_FILENO, EV_READ); |
1217 | ev_io_set (&w, STDIN_FILENO, EV_READ); |
1127 | |
1218 | |
1128 | =item C<ev_TYPE_set> (ev_TYPE *, [args]) |
1219 | =item C<ev_TYPE_set> (ev_TYPE *watcher, [args]) |
1129 | |
1220 | |
1130 | This macro initialises the type-specific parts of a watcher. You need to |
1221 | This macro initialises the type-specific parts of a watcher. You need to |
1131 | call C<ev_init> at least once before you call this macro, but you can |
1222 | call C<ev_init> at least once before you call this macro, but you can |
1132 | call C<ev_TYPE_set> any number of times. You must not, however, call this |
1223 | call C<ev_TYPE_set> any number of times. You must not, however, call this |
1133 | macro on a watcher that is active (it can be pending, however, which is a |
1224 | macro on a watcher that is active (it can be pending, however, which is a |
… | |
… | |
1146 | |
1237 | |
1147 | Example: Initialise and set an C<ev_io> watcher in one step. |
1238 | Example: Initialise and set an C<ev_io> watcher in one step. |
1148 | |
1239 | |
1149 | ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); |
1240 | ev_io_init (&w, my_cb, STDIN_FILENO, EV_READ); |
1150 | |
1241 | |
1151 | =item C<ev_TYPE_start> (loop *, ev_TYPE *watcher) |
1242 | =item C<ev_TYPE_start> (loop, ev_TYPE *watcher) |
1152 | |
1243 | |
1153 | Starts (activates) the given watcher. Only active watchers will receive |
1244 | Starts (activates) the given watcher. Only active watchers will receive |
1154 | events. If the watcher is already active nothing will happen. |
1245 | events. If the watcher is already active nothing will happen. |
1155 | |
1246 | |
1156 | Example: Start the C<ev_io> watcher that is being abused as example in this |
1247 | Example: Start the C<ev_io> watcher that is being abused as example in this |
1157 | whole section. |
1248 | whole section. |
1158 | |
1249 | |
1159 | ev_io_start (EV_DEFAULT_UC, &w); |
1250 | ev_io_start (EV_DEFAULT_UC, &w); |
1160 | |
1251 | |
1161 | =item C<ev_TYPE_stop> (loop *, ev_TYPE *watcher) |
1252 | =item C<ev_TYPE_stop> (loop, ev_TYPE *watcher) |
1162 | |
1253 | |
1163 | Stops the given watcher if active, and clears the pending status (whether |
1254 | Stops the given watcher if active, and clears the pending status (whether |
1164 | the watcher was active or not). |
1255 | the watcher was active or not). |
1165 | |
1256 | |
1166 | It is possible that stopped watchers are pending - for example, |
1257 | It is possible that stopped watchers are pending - for example, |
… | |
… | |
1191 | =item ev_cb_set (ev_TYPE *watcher, callback) |
1282 | =item ev_cb_set (ev_TYPE *watcher, callback) |
1192 | |
1283 | |
1193 | Change the callback. You can change the callback at virtually any time |
1284 | Change the callback. You can change the callback at virtually any time |
1194 | (modulo threads). |
1285 | (modulo threads). |
1195 | |
1286 | |
1196 | =item ev_set_priority (ev_TYPE *watcher, priority) |
1287 | =item ev_set_priority (ev_TYPE *watcher, int priority) |
1197 | |
1288 | |
1198 | =item int ev_priority (ev_TYPE *watcher) |
1289 | =item int ev_priority (ev_TYPE *watcher) |
1199 | |
1290 | |
1200 | Set and query the priority of the watcher. The priority is a small |
1291 | Set and query the priority of the watcher. The priority is a small |
1201 | integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> |
1292 | integer between C<EV_MAXPRI> (default: C<2>) and C<EV_MINPRI> |
… | |
… | |
1232 | returns its C<revents> bitset (as if its callback was invoked). If the |
1323 | returns its C<revents> bitset (as if its callback was invoked). If the |
1233 | watcher isn't pending it does nothing and returns C<0>. |
1324 | watcher isn't pending it does nothing and returns C<0>. |
1234 | |
1325 | |
1235 | Sometimes it can be useful to "poll" a watcher instead of waiting for its |
1326 | Sometimes it can be useful to "poll" a watcher instead of waiting for its |
1236 | callback to be invoked, which can be accomplished with this function. |
1327 | callback to be invoked, which can be accomplished with this function. |
|
|
1328 | |
|
|
1329 | =item ev_feed_event (loop, ev_TYPE *watcher, int revents) |
|
|
1330 | |
|
|
1331 | Feeds the given event set into the event loop, as if the specified event |
|
|
1332 | had happened for the specified watcher (which must be a pointer to an |
|
|
1333 | initialised but not necessarily started event watcher). Obviously you must |
|
|
1334 | not free the watcher as long as it has pending events. |
|
|
1335 | |
|
|
1336 | Stopping the watcher, letting libev invoke it, or calling |
|
|
1337 | C<ev_clear_pending> will clear the pending event, even if the watcher was |
|
|
1338 | not started in the first place. |
|
|
1339 | |
|
|
1340 | See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related |
|
|
1341 | functions that do not need a watcher. |
1237 | |
1342 | |
1238 | =back |
1343 | =back |
1239 | |
1344 | |
1240 | |
1345 | |
1241 | =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER |
1346 | =head2 ASSOCIATING CUSTOM DATA WITH A WATCHER |
… | |
… | |
1352 | |
1457 | |
1353 | For example, to emulate how many other event libraries handle priorities, |
1458 | For example, to emulate how many other event libraries handle priorities, |
1354 | you can associate an C<ev_idle> watcher to each such watcher, and in |
1459 | you can associate an C<ev_idle> watcher to each such watcher, and in |
1355 | the normal watcher callback, you just start the idle watcher. The real |
1460 | the normal watcher callback, you just start the idle watcher. The real |
1356 | processing is done in the idle watcher callback. This causes libev to |
1461 | processing is done in the idle watcher callback. This causes libev to |
1357 | continously poll and process kernel event data for the watcher, but when |
1462 | continuously poll and process kernel event data for the watcher, but when |
1358 | the lock-out case is known to be rare (which in turn is rare :), this is |
1463 | the lock-out case is known to be rare (which in turn is rare :), this is |
1359 | workable. |
1464 | workable. |
1360 | |
1465 | |
1361 | Usually, however, the lock-out model implemented that way will perform |
1466 | Usually, however, the lock-out model implemented that way will perform |
1362 | miserably under the type of load it was designed to handle. In that case, |
1467 | miserably under the type of load it was designed to handle. In that case, |
… | |
… | |
1376 | { |
1481 | { |
1377 | // stop the I/O watcher, we received the event, but |
1482 | // stop the I/O watcher, we received the event, but |
1378 | // are not yet ready to handle it. |
1483 | // are not yet ready to handle it. |
1379 | ev_io_stop (EV_A_ w); |
1484 | ev_io_stop (EV_A_ w); |
1380 | |
1485 | |
1381 | // start the idle watcher to ahndle the actual event. |
1486 | // start the idle watcher to handle the actual event. |
1382 | // it will not be executed as long as other watchers |
1487 | // it will not be executed as long as other watchers |
1383 | // with the default priority are receiving events. |
1488 | // with the default priority are receiving events. |
1384 | ev_idle_start (EV_A_ &idle); |
1489 | ev_idle_start (EV_A_ &idle); |
1385 | } |
1490 | } |
1386 | |
1491 | |
… | |
… | |
1440 | |
1545 | |
1441 | If you cannot use non-blocking mode, then force the use of a |
1546 | If you cannot use non-blocking mode, then force the use of a |
1442 | known-to-be-good backend (at the time of this writing, this includes only |
1547 | known-to-be-good backend (at the time of this writing, this includes only |
1443 | C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file |
1548 | C<EVBACKEND_SELECT> and C<EVBACKEND_POLL>). The same applies to file |
1444 | descriptors for which non-blocking operation makes no sense (such as |
1549 | descriptors for which non-blocking operation makes no sense (such as |
1445 | files) - libev doesn't guarentee any specific behaviour in that case. |
1550 | files) - libev doesn't guarantee any specific behaviour in that case. |
1446 | |
1551 | |
1447 | Another thing you have to watch out for is that it is quite easy to |
1552 | Another thing you have to watch out for is that it is quite easy to |
1448 | receive "spurious" readiness notifications, that is your callback might |
1553 | receive "spurious" readiness notifications, that is your callback might |
1449 | be called with C<EV_READ> but a subsequent C<read>(2) will actually block |
1554 | be called with C<EV_READ> but a subsequent C<read>(2) will actually block |
1450 | because there is no data. Not only are some backends known to create a |
1555 | because there is no data. Not only are some backends known to create a |
… | |
… | |
1515 | |
1620 | |
1516 | So when you encounter spurious, unexplained daemon exits, make sure you |
1621 | So when you encounter spurious, unexplained daemon exits, make sure you |
1517 | ignore SIGPIPE (and maybe make sure you log the exit status of your daemon |
1622 | ignore SIGPIPE (and maybe make sure you log the exit status of your daemon |
1518 | somewhere, as that would have given you a big clue). |
1623 | somewhere, as that would have given you a big clue). |
1519 | |
1624 | |
|
|
1625 | =head3 The special problem of accept()ing when you can't |
|
|
1626 | |
|
|
1627 | Many implementations of the POSIX C<accept> function (for example, |
|
|
1628 | found in post-2004 Linux) have the peculiar behaviour of not removing a |
|
|
1629 | connection from the pending queue in all error cases. |
|
|
1630 | |
|
|
1631 | For example, larger servers often run out of file descriptors (because |
|
|
1632 | of resource limits), causing C<accept> to fail with C<ENFILE> but not |
|
|
1633 | rejecting the connection, leading to libev signalling readiness on |
|
|
1634 | the next iteration again (the connection still exists after all), and |
|
|
1635 | typically causing the program to loop at 100% CPU usage. |
|
|
1636 | |
|
|
1637 | Unfortunately, the set of errors that cause this issue differs between |
|
|
1638 | operating systems, there is usually little the app can do to remedy the |
|
|
1639 | situation, and no known thread-safe method of removing the connection to |
|
|
1640 | cope with overload is known (to me). |
|
|
1641 | |
|
|
1642 | One of the easiest ways to handle this situation is to just ignore it |
|
|
1643 | - when the program encounters an overload, it will just loop until the |
|
|
1644 | situation is over. While this is a form of busy waiting, no OS offers an |
|
|
1645 | event-based way to handle this situation, so it's the best one can do. |
|
|
1646 | |
|
|
1647 | A better way to handle the situation is to log any errors other than |
|
|
1648 | C<EAGAIN> and C<EWOULDBLOCK>, making sure not to flood the log with such |
|
|
1649 | messages, and continue as usual, which at least gives the user an idea of |
|
|
1650 | what could be wrong ("raise the ulimit!"). For extra points one could stop |
|
|
1651 | the C<ev_io> watcher on the listening fd "for a while", which reduces CPU |
|
|
1652 | usage. |
|
|
1653 | |
|
|
1654 | If your program is single-threaded, then you could also keep a dummy file |
|
|
1655 | descriptor for overload situations (e.g. by opening F</dev/null>), and |
|
|
1656 | when you run into C<ENFILE> or C<EMFILE>, close it, run C<accept>, |
|
|
1657 | close that fd, and create a new dummy fd. This will gracefully refuse |
|
|
1658 | clients under typical overload conditions. |
|
|
1659 | |
|
|
1660 | The last way to handle it is to simply log the error and C<exit>, as |
|
|
1661 | is often done with C<malloc> failures, but this results in an easy |
|
|
1662 | opportunity for a DoS attack. |
1520 | |
1663 | |
1521 | =head3 Watcher-Specific Functions |
1664 | =head3 Watcher-Specific Functions |
1522 | |
1665 | |
1523 | =over 4 |
1666 | =over 4 |
1524 | |
1667 | |
… | |
… | |
1556 | ... |
1699 | ... |
1557 | struct ev_loop *loop = ev_default_init (0); |
1700 | struct ev_loop *loop = ev_default_init (0); |
1558 | ev_io stdin_readable; |
1701 | ev_io stdin_readable; |
1559 | ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); |
1702 | ev_io_init (&stdin_readable, stdin_readable_cb, STDIN_FILENO, EV_READ); |
1560 | ev_io_start (loop, &stdin_readable); |
1703 | ev_io_start (loop, &stdin_readable); |
1561 | ev_loop (loop, 0); |
1704 | ev_run (loop, 0); |
1562 | |
1705 | |
1563 | |
1706 | |
1564 | =head2 C<ev_timer> - relative and optionally repeating timeouts |
1707 | =head2 C<ev_timer> - relative and optionally repeating timeouts |
1565 | |
1708 | |
1566 | Timer watchers are simple relative timers that generate an event after a |
1709 | Timer watchers are simple relative timers that generate an event after a |
… | |
… | |
1575 | The callback is guaranteed to be invoked only I<after> its timeout has |
1718 | The callback is guaranteed to be invoked only I<after> its timeout has |
1576 | passed (not I<at>, so on systems with very low-resolution clocks this |
1719 | passed (not I<at>, so on systems with very low-resolution clocks this |
1577 | might introduce a small delay). If multiple timers become ready during the |
1720 | might introduce a small delay). If multiple timers become ready during the |
1578 | same loop iteration then the ones with earlier time-out values are invoked |
1721 | same loop iteration then the ones with earlier time-out values are invoked |
1579 | before ones of the same priority with later time-out values (but this is |
1722 | before ones of the same priority with later time-out values (but this is |
1580 | no longer true when a callback calls C<ev_loop> recursively). |
1723 | no longer true when a callback calls C<ev_run> recursively). |
1581 | |
1724 | |
1582 | =head3 Be smart about timeouts |
1725 | =head3 Be smart about timeouts |
1583 | |
1726 | |
1584 | Many real-world problems involve some kind of timeout, usually for error |
1727 | Many real-world problems involve some kind of timeout, usually for error |
1585 | recovery. A typical example is an HTTP request - if the other side hangs, |
1728 | recovery. A typical example is an HTTP request - if the other side hangs, |
… | |
… | |
1671 | ev_tstamp timeout = last_activity + 60.; |
1814 | ev_tstamp timeout = last_activity + 60.; |
1672 | |
1815 | |
1673 | // if last_activity + 60. is older than now, we did time out |
1816 | // if last_activity + 60. is older than now, we did time out |
1674 | if (timeout < now) |
1817 | if (timeout < now) |
1675 | { |
1818 | { |
1676 | // timeout occured, take action |
1819 | // timeout occurred, take action |
1677 | } |
1820 | } |
1678 | else |
1821 | else |
1679 | { |
1822 | { |
1680 | // callback was invoked, but there was some activity, re-arm |
1823 | // callback was invoked, but there was some activity, re-arm |
1681 | // the watcher to fire in last_activity + 60, which is |
1824 | // the watcher to fire in last_activity + 60, which is |
… | |
… | |
1703 | to the current time (meaning we just have some activity :), then call the |
1846 | to the current time (meaning we just have some activity :), then call the |
1704 | callback, which will "do the right thing" and start the timer: |
1847 | callback, which will "do the right thing" and start the timer: |
1705 | |
1848 | |
1706 | ev_init (timer, callback); |
1849 | ev_init (timer, callback); |
1707 | last_activity = ev_now (loop); |
1850 | last_activity = ev_now (loop); |
1708 | callback (loop, timer, EV_TIMEOUT); |
1851 | callback (loop, timer, EV_TIMER); |
1709 | |
1852 | |
1710 | And when there is some activity, simply store the current time in |
1853 | And when there is some activity, simply store the current time in |
1711 | C<last_activity>, no libev calls at all: |
1854 | C<last_activity>, no libev calls at all: |
1712 | |
1855 | |
1713 | last_actiivty = ev_now (loop); |
1856 | last_activity = ev_now (loop); |
1714 | |
1857 | |
1715 | This technique is slightly more complex, but in most cases where the |
1858 | This technique is slightly more complex, but in most cases where the |
1716 | time-out is unlikely to be triggered, much more efficient. |
1859 | time-out is unlikely to be triggered, much more efficient. |
1717 | |
1860 | |
1718 | Changing the timeout is trivial as well (if it isn't hard-coded in the |
1861 | Changing the timeout is trivial as well (if it isn't hard-coded in the |
… | |
… | |
1756 | |
1899 | |
1757 | =head3 The special problem of time updates |
1900 | =head3 The special problem of time updates |
1758 | |
1901 | |
1759 | Establishing the current time is a costly operation (it usually takes at |
1902 | Establishing the current time is a costly operation (it usually takes at |
1760 | least two system calls): EV therefore updates its idea of the current |
1903 | least two system calls): EV therefore updates its idea of the current |
1761 | time only before and after C<ev_loop> collects new events, which causes a |
1904 | time only before and after C<ev_run> collects new events, which causes a |
1762 | growing difference between C<ev_now ()> and C<ev_time ()> when handling |
1905 | growing difference between C<ev_now ()> and C<ev_time ()> when handling |
1763 | lots of events in one iteration. |
1906 | lots of events in one iteration. |
1764 | |
1907 | |
1765 | The relative timeouts are calculated relative to the C<ev_now ()> |
1908 | The relative timeouts are calculated relative to the C<ev_now ()> |
1766 | time. This is usually the right thing as this timestamp refers to the time |
1909 | time. This is usually the right thing as this timestamp refers to the time |
… | |
… | |
1837 | C<repeat> value), or reset the running timer to the C<repeat> value. |
1980 | C<repeat> value), or reset the running timer to the C<repeat> value. |
1838 | |
1981 | |
1839 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
1982 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
1840 | usage example. |
1983 | usage example. |
1841 | |
1984 | |
1842 | =item ev_timer_remaining (loop, ev_timer *) |
1985 | =item ev_tstamp ev_timer_remaining (loop, ev_timer *) |
1843 | |
1986 | |
1844 | Returns the remaining time until a timer fires. If the timer is active, |
1987 | Returns the remaining time until a timer fires. If the timer is active, |
1845 | then this time is relative to the current event loop time, otherwise it's |
1988 | then this time is relative to the current event loop time, otherwise it's |
1846 | the timeout value currently configured. |
1989 | the timeout value currently configured. |
1847 | |
1990 | |
1848 | That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns |
1991 | That is, after an C<ev_timer_set (w, 5, 7)>, C<ev_timer_remaining> returns |
1849 | C<5>. When the timer is started and one second passes, C<ev_timer_remain> |
1992 | C<5>. When the timer is started and one second passes, C<ev_timer_remaining> |
1850 | will return C<4>. When the timer expires and is restarted, it will return |
1993 | will return C<4>. When the timer expires and is restarted, it will return |
1851 | roughly C<7> (likely slightly less as callback invocation takes some time, |
1994 | roughly C<7> (likely slightly less as callback invocation takes some time, |
1852 | too), and so on. |
1995 | too), and so on. |
1853 | |
1996 | |
1854 | =item ev_tstamp repeat [read-write] |
1997 | =item ev_tstamp repeat [read-write] |
… | |
… | |
1883 | } |
2026 | } |
1884 | |
2027 | |
1885 | ev_timer mytimer; |
2028 | ev_timer mytimer; |
1886 | ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ |
2029 | ev_timer_init (&mytimer, timeout_cb, 0., 10.); /* note, only repeat used */ |
1887 | ev_timer_again (&mytimer); /* start timer */ |
2030 | ev_timer_again (&mytimer); /* start timer */ |
1888 | ev_loop (loop, 0); |
2031 | ev_run (loop, 0); |
1889 | |
2032 | |
1890 | // and in some piece of code that gets executed on any "activity": |
2033 | // and in some piece of code that gets executed on any "activity": |
1891 | // reset the timeout to start ticking again at 10 seconds |
2034 | // reset the timeout to start ticking again at 10 seconds |
1892 | ev_timer_again (&mytimer); |
2035 | ev_timer_again (&mytimer); |
1893 | |
2036 | |
… | |
… | |
1919 | |
2062 | |
1920 | As with timers, the callback is guaranteed to be invoked only when the |
2063 | As with timers, the callback is guaranteed to be invoked only when the |
1921 | point in time where it is supposed to trigger has passed. If multiple |
2064 | point in time where it is supposed to trigger has passed. If multiple |
1922 | timers become ready during the same loop iteration then the ones with |
2065 | timers become ready during the same loop iteration then the ones with |
1923 | earlier time-out values are invoked before ones with later time-out values |
2066 | earlier time-out values are invoked before ones with later time-out values |
1924 | (but this is no longer true when a callback calls C<ev_loop> recursively). |
2067 | (but this is no longer true when a callback calls C<ev_run> recursively). |
1925 | |
2068 | |
1926 | =head3 Watcher-Specific Functions and Data Members |
2069 | =head3 Watcher-Specific Functions and Data Members |
1927 | |
2070 | |
1928 | =over 4 |
2071 | =over 4 |
1929 | |
2072 | |
… | |
… | |
2057 | Example: Call a callback every hour, or, more precisely, whenever the |
2200 | Example: Call a callback every hour, or, more precisely, whenever the |
2058 | system time is divisible by 3600. The callback invocation times have |
2201 | system time is divisible by 3600. The callback invocation times have |
2059 | potentially a lot of jitter, but good long-term stability. |
2202 | potentially a lot of jitter, but good long-term stability. |
2060 | |
2203 | |
2061 | static void |
2204 | static void |
2062 | clock_cb (struct ev_loop *loop, ev_io *w, int revents) |
2205 | clock_cb (struct ev_loop *loop, ev_periodic *w, int revents) |
2063 | { |
2206 | { |
2064 | ... its now a full hour (UTC, or TAI or whatever your clock follows) |
2207 | ... its now a full hour (UTC, or TAI or whatever your clock follows) |
2065 | } |
2208 | } |
2066 | |
2209 | |
2067 | ev_periodic hourly_tick; |
2210 | ev_periodic hourly_tick; |
… | |
… | |
2108 | |
2251 | |
2109 | When the first watcher gets started will libev actually register something |
2252 | When the first watcher gets started will libev actually register something |
2110 | with the kernel (thus it coexists with your own signal handlers as long as |
2253 | with the kernel (thus it coexists with your own signal handlers as long as |
2111 | you don't register any with libev for the same signal). |
2254 | you don't register any with libev for the same signal). |
2112 | |
2255 | |
2113 | Both the signal mask state (C<sigprocmask>) and the signal handler state |
|
|
2114 | (C<sigaction>) are unspecified after starting a signal watcher (and after |
|
|
2115 | sotpping it again), that is, libev might or might not block the signal, |
|
|
2116 | and might or might not set or restore the installed signal handler. |
|
|
2117 | |
|
|
2118 | If possible and supported, libev will install its handlers with |
2256 | If possible and supported, libev will install its handlers with |
2119 | C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should |
2257 | C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should |
2120 | not be unduly interrupted. If you have a problem with system calls getting |
2258 | not be unduly interrupted. If you have a problem with system calls getting |
2121 | interrupted by signals you can block all signals in an C<ev_check> watcher |
2259 | interrupted by signals you can block all signals in an C<ev_check> watcher |
2122 | and unblock them in an C<ev_prepare> watcher. |
2260 | and unblock them in an C<ev_prepare> watcher. |
2123 | |
2261 | |
|
|
2262 | =head3 The special problem of inheritance over fork/execve/pthread_create |
|
|
2263 | |
|
|
2264 | Both the signal mask (C<sigprocmask>) and the signal disposition |
|
|
2265 | (C<sigaction>) are unspecified after starting a signal watcher (and after |
|
|
2266 | stopping it again), that is, libev might or might not block the signal, |
|
|
2267 | and might or might not set or restore the installed signal handler. |
|
|
2268 | |
|
|
2269 | While this does not matter for the signal disposition (libev never |
|
|
2270 | sets signals to C<SIG_IGN>, so handlers will be reset to C<SIG_DFL> on |
|
|
2271 | C<execve>), this matters for the signal mask: many programs do not expect |
|
|
2272 | certain signals to be blocked. |
|
|
2273 | |
|
|
2274 | This means that before calling C<exec> (from the child) you should reset |
|
|
2275 | the signal mask to whatever "default" you expect (all clear is a good |
|
|
2276 | choice usually). |
|
|
2277 | |
|
|
2278 | The simplest way to ensure that the signal mask is reset in the child is |
|
|
2279 | to install a fork handler with C<pthread_atfork> that resets it. That will |
|
|
2280 | catch fork calls done by libraries (such as the libc) as well. |
|
|
2281 | |
|
|
2282 | In current versions of libev, the signal will not be blocked indefinitely |
|
|
2283 | unless you use the C<signalfd> API (C<EV_SIGNALFD>). While this reduces |
|
|
2284 | the window of opportunity for problems, it will not go away, as libev |
|
|
2285 | I<has> to modify the signal mask, at least temporarily. |
|
|
2286 | |
|
|
2287 | So I can't stress this enough: I<If you do not reset your signal mask when |
|
|
2288 | you expect it to be empty, you have a race condition in your code>. This |
|
|
2289 | is not a libev-specific thing, this is true for most event libraries. |
|
|
2290 | |
2124 | =head3 Watcher-Specific Functions and Data Members |
2291 | =head3 Watcher-Specific Functions and Data Members |
2125 | |
2292 | |
2126 | =over 4 |
2293 | =over 4 |
2127 | |
2294 | |
2128 | =item ev_signal_init (ev_signal *, callback, int signum) |
2295 | =item ev_signal_init (ev_signal *, callback, int signum) |
… | |
… | |
2143 | Example: Try to exit cleanly on SIGINT. |
2310 | Example: Try to exit cleanly on SIGINT. |
2144 | |
2311 | |
2145 | static void |
2312 | static void |
2146 | sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) |
2313 | sigint_cb (struct ev_loop *loop, ev_signal *w, int revents) |
2147 | { |
2314 | { |
2148 | ev_unloop (loop, EVUNLOOP_ALL); |
2315 | ev_break (loop, EVBREAK_ALL); |
2149 | } |
2316 | } |
2150 | |
2317 | |
2151 | ev_signal signal_watcher; |
2318 | ev_signal signal_watcher; |
2152 | ev_signal_init (&signal_watcher, sigint_cb, SIGINT); |
2319 | ev_signal_init (&signal_watcher, sigint_cb, SIGINT); |
2153 | ev_signal_start (loop, &signal_watcher); |
2320 | ev_signal_start (loop, &signal_watcher); |
… | |
… | |
2539 | |
2706 | |
2540 | Prepare and check watchers are usually (but not always) used in pairs: |
2707 | Prepare and check watchers are usually (but not always) used in pairs: |
2541 | prepare watchers get invoked before the process blocks and check watchers |
2708 | prepare watchers get invoked before the process blocks and check watchers |
2542 | afterwards. |
2709 | afterwards. |
2543 | |
2710 | |
2544 | You I<must not> call C<ev_loop> or similar functions that enter |
2711 | You I<must not> call C<ev_run> or similar functions that enter |
2545 | the current event loop from either C<ev_prepare> or C<ev_check> |
2712 | the current event loop from either C<ev_prepare> or C<ev_check> |
2546 | watchers. Other loops than the current one are fine, however. The |
2713 | watchers. Other loops than the current one are fine, however. The |
2547 | rationale behind this is that you do not need to check for recursion in |
2714 | rationale behind this is that you do not need to check for recursion in |
2548 | those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, |
2715 | those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, |
2549 | C<ev_check> so if you have one watcher of each kind they will always be |
2716 | C<ev_check> so if you have one watcher of each kind they will always be |
… | |
… | |
2717 | |
2884 | |
2718 | if (timeout >= 0) |
2885 | if (timeout >= 0) |
2719 | // create/start timer |
2886 | // create/start timer |
2720 | |
2887 | |
2721 | // poll |
2888 | // poll |
2722 | ev_loop (EV_A_ 0); |
2889 | ev_run (EV_A_ 0); |
2723 | |
2890 | |
2724 | // stop timer again |
2891 | // stop timer again |
2725 | if (timeout >= 0) |
2892 | if (timeout >= 0) |
2726 | ev_timer_stop (EV_A_ &to); |
2893 | ev_timer_stop (EV_A_ &to); |
2727 | |
2894 | |
… | |
… | |
2805 | if you do not want that, you need to temporarily stop the embed watcher). |
2972 | if you do not want that, you need to temporarily stop the embed watcher). |
2806 | |
2973 | |
2807 | =item ev_embed_sweep (loop, ev_embed *) |
2974 | =item ev_embed_sweep (loop, ev_embed *) |
2808 | |
2975 | |
2809 | Make a single, non-blocking sweep over the embedded loop. This works |
2976 | Make a single, non-blocking sweep over the embedded loop. This works |
2810 | similarly to C<ev_loop (embedded_loop, EVLOOP_NONBLOCK)>, but in the most |
2977 | similarly to C<ev_run (embedded_loop, EVRUN_NOWAIT)>, but in the most |
2811 | appropriate way for embedded loops. |
2978 | appropriate way for embedded loops. |
2812 | |
2979 | |
2813 | =item struct ev_loop *other [read-only] |
2980 | =item struct ev_loop *other [read-only] |
2814 | |
2981 | |
2815 | The embedded event loop. |
2982 | The embedded event loop. |
… | |
… | |
2875 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
3042 | C<ev_default_fork> cheats and calls it in the wrong process, the fork |
2876 | handlers will be invoked, too, of course. |
3043 | handlers will be invoked, too, of course. |
2877 | |
3044 | |
2878 | =head3 The special problem of life after fork - how is it possible? |
3045 | =head3 The special problem of life after fork - how is it possible? |
2879 | |
3046 | |
2880 | Most uses of C<fork()> consist of forking, then some simple calls to ste |
3047 | Most uses of C<fork()> consist of forking, then some simple calls to set |
2881 | up/change the process environment, followed by a call to C<exec()>. This |
3048 | up/change the process environment, followed by a call to C<exec()>. This |
2882 | sequence should be handled by libev without any problems. |
3049 | sequence should be handled by libev without any problems. |
2883 | |
3050 | |
2884 | This changes when the application actually wants to do event handling |
3051 | This changes when the application actually wants to do event handling |
2885 | in the child, or both parent in child, in effect "continuing" after the |
3052 | in the child, or both parent in child, in effect "continuing" after the |
… | |
… | |
2919 | believe me. |
3086 | believe me. |
2920 | |
3087 | |
2921 | =back |
3088 | =back |
2922 | |
3089 | |
2923 | |
3090 | |
2924 | =head2 C<ev_async> - how to wake up another event loop |
3091 | =head2 C<ev_async> - how to wake up an event loop |
2925 | |
3092 | |
2926 | In general, you cannot use an C<ev_loop> from multiple threads or other |
3093 | In general, you cannot use an C<ev_run> from multiple threads or other |
2927 | asynchronous sources such as signal handlers (as opposed to multiple event |
3094 | asynchronous sources such as signal handlers (as opposed to multiple event |
2928 | loops - those are of course safe to use in different threads). |
3095 | loops - those are of course safe to use in different threads). |
2929 | |
3096 | |
2930 | Sometimes, however, you need to wake up another event loop you do not |
3097 | Sometimes, however, you need to wake up an event loop you do not control, |
2931 | control, for example because it belongs to another thread. This is what |
3098 | for example because it belongs to another thread. This is what C<ev_async> |
2932 | C<ev_async> watchers do: as long as the C<ev_async> watcher is active, you |
3099 | watchers do: as long as the C<ev_async> watcher is active, you can signal |
2933 | can signal it by calling C<ev_async_send>, which is thread- and signal |
3100 | it by calling C<ev_async_send>, which is thread- and signal safe. |
2934 | safe. |
|
|
2935 | |
3101 | |
2936 | This functionality is very similar to C<ev_signal> watchers, as signals, |
3102 | This functionality is very similar to C<ev_signal> watchers, as signals, |
2937 | too, are asynchronous in nature, and signals, too, will be compressed |
3103 | too, are asynchronous in nature, and signals, too, will be compressed |
2938 | (i.e. the number of callback invocations may be less than the number of |
3104 | (i.e. the number of callback invocations may be less than the number of |
2939 | C<ev_async_sent> calls). |
3105 | C<ev_async_sent> calls). |
… | |
… | |
2944 | =head3 Queueing |
3110 | =head3 Queueing |
2945 | |
3111 | |
2946 | C<ev_async> does not support queueing of data in any way. The reason |
3112 | C<ev_async> does not support queueing of data in any way. The reason |
2947 | is that the author does not know of a simple (or any) algorithm for a |
3113 | is that the author does not know of a simple (or any) algorithm for a |
2948 | multiple-writer-single-reader queue that works in all cases and doesn't |
3114 | multiple-writer-single-reader queue that works in all cases and doesn't |
2949 | need elaborate support such as pthreads. |
3115 | need elaborate support such as pthreads or unportable memory access |
|
|
3116 | semantics. |
2950 | |
3117 | |
2951 | That means that if you want to queue data, you have to provide your own |
3118 | That means that if you want to queue data, you have to provide your own |
2952 | queue. But at least I can tell you how to implement locking around your |
3119 | queue. But at least I can tell you how to implement locking around your |
2953 | queue: |
3120 | queue: |
2954 | |
3121 | |
… | |
… | |
3093 | |
3260 | |
3094 | If C<timeout> is less than 0, then no timeout watcher will be |
3261 | If C<timeout> is less than 0, then no timeout watcher will be |
3095 | started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and |
3262 | started. Otherwise an C<ev_timer> watcher with after = C<timeout> (and |
3096 | repeat = 0) will be started. C<0> is a valid timeout. |
3263 | repeat = 0) will be started. C<0> is a valid timeout. |
3097 | |
3264 | |
3098 | The callback has the type C<void (*cb)(int revents, void *arg)> and gets |
3265 | The callback has the type C<void (*cb)(int revents, void *arg)> and is |
3099 | passed an C<revents> set like normal event callbacks (a combination of |
3266 | passed an C<revents> set like normal event callbacks (a combination of |
3100 | C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMEOUT>) and the C<arg> |
3267 | C<EV_ERROR>, C<EV_READ>, C<EV_WRITE> or C<EV_TIMER>) and the C<arg> |
3101 | value passed to C<ev_once>. Note that it is possible to receive I<both> |
3268 | value passed to C<ev_once>. Note that it is possible to receive I<both> |
3102 | a timeout and an io event at the same time - you probably should give io |
3269 | a timeout and an io event at the same time - you probably should give io |
3103 | events precedence. |
3270 | events precedence. |
3104 | |
3271 | |
3105 | Example: wait up to ten seconds for data to appear on STDIN_FILENO. |
3272 | Example: wait up to ten seconds for data to appear on STDIN_FILENO. |
3106 | |
3273 | |
3107 | static void stdin_ready (int revents, void *arg) |
3274 | static void stdin_ready (int revents, void *arg) |
3108 | { |
3275 | { |
3109 | if (revents & EV_READ) |
3276 | if (revents & EV_READ) |
3110 | /* stdin might have data for us, joy! */; |
3277 | /* stdin might have data for us, joy! */; |
3111 | else if (revents & EV_TIMEOUT) |
3278 | else if (revents & EV_TIMER) |
3112 | /* doh, nothing entered */; |
3279 | /* doh, nothing entered */; |
3113 | } |
3280 | } |
3114 | |
3281 | |
3115 | ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); |
3282 | ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); |
3116 | |
3283 | |
3117 | =item ev_feed_event (struct ev_loop *, watcher *, int revents) |
|
|
3118 | |
|
|
3119 | Feeds the given event set into the event loop, as if the specified event |
|
|
3120 | had happened for the specified watcher (which must be a pointer to an |
|
|
3121 | initialised but not necessarily started event watcher). |
|
|
3122 | |
|
|
3123 | =item ev_feed_fd_event (struct ev_loop *, int fd, int revents) |
3284 | =item ev_feed_fd_event (loop, int fd, int revents) |
3124 | |
3285 | |
3125 | Feed an event on the given fd, as if a file descriptor backend detected |
3286 | Feed an event on the given fd, as if a file descriptor backend detected |
3126 | the given events it. |
3287 | the given events it. |
3127 | |
3288 | |
3128 | =item ev_feed_signal_event (struct ev_loop *loop, int signum) |
3289 | =item ev_feed_signal_event (loop, int signum) |
3129 | |
3290 | |
3130 | Feed an event as if the given signal occurred (C<loop> must be the default |
3291 | Feed an event as if the given signal occurred (C<loop> must be the default |
3131 | loop!). |
3292 | loop!). |
3132 | |
3293 | |
3133 | =back |
3294 | =back |
… | |
… | |
3213 | |
3374 | |
3214 | =over 4 |
3375 | =over 4 |
3215 | |
3376 | |
3216 | =item ev::TYPE::TYPE () |
3377 | =item ev::TYPE::TYPE () |
3217 | |
3378 | |
3218 | =item ev::TYPE::TYPE (struct ev_loop *) |
3379 | =item ev::TYPE::TYPE (loop) |
3219 | |
3380 | |
3220 | =item ev::TYPE::~TYPE |
3381 | =item ev::TYPE::~TYPE |
3221 | |
3382 | |
3222 | The constructor (optionally) takes an event loop to associate the watcher |
3383 | The constructor (optionally) takes an event loop to associate the watcher |
3223 | with. If it is omitted, it will use C<EV_DEFAULT>. |
3384 | with. If it is omitted, it will use C<EV_DEFAULT>. |
… | |
… | |
3256 | myclass obj; |
3417 | myclass obj; |
3257 | ev::io iow; |
3418 | ev::io iow; |
3258 | iow.set <myclass, &myclass::io_cb> (&obj); |
3419 | iow.set <myclass, &myclass::io_cb> (&obj); |
3259 | |
3420 | |
3260 | =item w->set (object *) |
3421 | =item w->set (object *) |
3261 | |
|
|
3262 | This is an B<experimental> feature that might go away in a future version. |
|
|
3263 | |
3422 | |
3264 | This is a variation of a method callback - leaving out the method to call |
3423 | This is a variation of a method callback - leaving out the method to call |
3265 | will default the method to C<operator ()>, which makes it possible to use |
3424 | will default the method to C<operator ()>, which makes it possible to use |
3266 | functor objects without having to manually specify the C<operator ()> all |
3425 | functor objects without having to manually specify the C<operator ()> all |
3267 | the time. Incidentally, you can then also leave out the template argument |
3426 | the time. Incidentally, you can then also leave out the template argument |
… | |
… | |
3300 | Example: Use a plain function as callback. |
3459 | Example: Use a plain function as callback. |
3301 | |
3460 | |
3302 | static void io_cb (ev::io &w, int revents) { } |
3461 | static void io_cb (ev::io &w, int revents) { } |
3303 | iow.set <io_cb> (); |
3462 | iow.set <io_cb> (); |
3304 | |
3463 | |
3305 | =item w->set (struct ev_loop *) |
3464 | =item w->set (loop) |
3306 | |
3465 | |
3307 | Associates a different C<struct ev_loop> with this watcher. You can only |
3466 | Associates a different C<struct ev_loop> with this watcher. You can only |
3308 | do this when the watcher is inactive (and not pending either). |
3467 | do this when the watcher is inactive (and not pending either). |
3309 | |
3468 | |
3310 | =item w->set ([arguments]) |
3469 | =item w->set ([arguments]) |
3311 | |
3470 | |
3312 | Basically the same as C<ev_TYPE_set>, with the same arguments. Must be |
3471 | Basically the same as C<ev_TYPE_set>, with the same arguments. Either this |
3313 | called at least once. Unlike the C counterpart, an active watcher gets |
3472 | method or a suitable start method must be called at least once. Unlike the |
3314 | automatically stopped and restarted when reconfiguring it with this |
3473 | C counterpart, an active watcher gets automatically stopped and restarted |
3315 | method. |
3474 | when reconfiguring it with this method. |
3316 | |
3475 | |
3317 | =item w->start () |
3476 | =item w->start () |
3318 | |
3477 | |
3319 | Starts the watcher. Note that there is no C<loop> argument, as the |
3478 | Starts the watcher. Note that there is no C<loop> argument, as the |
3320 | constructor already stores the event loop. |
3479 | constructor already stores the event loop. |
3321 | |
3480 | |
|
|
3481 | =item w->start ([arguments]) |
|
|
3482 | |
|
|
3483 | Instead of calling C<set> and C<start> methods separately, it is often |
|
|
3484 | convenient to wrap them in one call. Uses the same type of arguments as |
|
|
3485 | the configure C<set> method of the watcher. |
|
|
3486 | |
3322 | =item w->stop () |
3487 | =item w->stop () |
3323 | |
3488 | |
3324 | Stops the watcher if it is active. Again, no C<loop> argument. |
3489 | Stops the watcher if it is active. Again, no C<loop> argument. |
3325 | |
3490 | |
3326 | =item w->again () (C<ev::timer>, C<ev::periodic> only) |
3491 | =item w->again () (C<ev::timer>, C<ev::periodic> only) |
… | |
… | |
3338 | |
3503 | |
3339 | =back |
3504 | =back |
3340 | |
3505 | |
3341 | =back |
3506 | =back |
3342 | |
3507 | |
3343 | Example: Define a class with an IO and idle watcher, start one of them in |
3508 | Example: Define a class with two I/O and idle watchers, start the I/O |
3344 | the constructor. |
3509 | watchers in the constructor. |
3345 | |
3510 | |
3346 | class myclass |
3511 | class myclass |
3347 | { |
3512 | { |
3348 | ev::io io ; void io_cb (ev::io &w, int revents); |
3513 | ev::io io ; void io_cb (ev::io &w, int revents); |
|
|
3514 | ev::io2 io2 ; void io2_cb (ev::io &w, int revents); |
3349 | ev::idle idle; void idle_cb (ev::idle &w, int revents); |
3515 | ev::idle idle; void idle_cb (ev::idle &w, int revents); |
3350 | |
3516 | |
3351 | myclass (int fd) |
3517 | myclass (int fd) |
3352 | { |
3518 | { |
3353 | io .set <myclass, &myclass::io_cb > (this); |
3519 | io .set <myclass, &myclass::io_cb > (this); |
|
|
3520 | io2 .set <myclass, &myclass::io2_cb > (this); |
3354 | idle.set <myclass, &myclass::idle_cb> (this); |
3521 | idle.set <myclass, &myclass::idle_cb> (this); |
3355 | |
3522 | |
3356 | io.start (fd, ev::READ); |
3523 | io.set (fd, ev::WRITE); // configure the watcher |
|
|
3524 | io.start (); // start it whenever convenient |
|
|
3525 | |
|
|
3526 | io2.start (fd, ev::READ); // set + start in one call |
3357 | } |
3527 | } |
3358 | }; |
3528 | }; |
3359 | |
3529 | |
3360 | |
3530 | |
3361 | =head1 OTHER LANGUAGE BINDINGS |
3531 | =head1 OTHER LANGUAGE BINDINGS |
… | |
… | |
3407 | =item Ocaml |
3577 | =item Ocaml |
3408 | |
3578 | |
3409 | Erkki Seppala has written Ocaml bindings for libev, to be found at |
3579 | Erkki Seppala has written Ocaml bindings for libev, to be found at |
3410 | L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. |
3580 | L<http://modeemi.cs.tut.fi/~flux/software/ocaml-ev/>. |
3411 | |
3581 | |
|
|
3582 | =item Lua |
|
|
3583 | |
|
|
3584 | Brian Maher has written a partial interface to libev for lua (at the |
|
|
3585 | time of this writing, only C<ev_io> and C<ev_timer>), to be found at |
|
|
3586 | L<http://github.com/brimworks/lua-ev>. |
|
|
3587 | |
3412 | =back |
3588 | =back |
3413 | |
3589 | |
3414 | |
3590 | |
3415 | =head1 MACRO MAGIC |
3591 | =head1 MACRO MAGIC |
3416 | |
3592 | |
… | |
… | |
3429 | loop argument"). The C<EV_A> form is used when this is the sole argument, |
3605 | loop argument"). The C<EV_A> form is used when this is the sole argument, |
3430 | C<EV_A_> is used when other arguments are following. Example: |
3606 | C<EV_A_> is used when other arguments are following. Example: |
3431 | |
3607 | |
3432 | ev_unref (EV_A); |
3608 | ev_unref (EV_A); |
3433 | ev_timer_add (EV_A_ watcher); |
3609 | ev_timer_add (EV_A_ watcher); |
3434 | ev_loop (EV_A_ 0); |
3610 | ev_run (EV_A_ 0); |
3435 | |
3611 | |
3436 | It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, |
3612 | It assumes the variable C<loop> of type C<struct ev_loop *> is in scope, |
3437 | which is often provided by the following macro. |
3613 | which is often provided by the following macro. |
3438 | |
3614 | |
3439 | =item C<EV_P>, C<EV_P_> |
3615 | =item C<EV_P>, C<EV_P_> |
… | |
… | |
3479 | } |
3655 | } |
3480 | |
3656 | |
3481 | ev_check check; |
3657 | ev_check check; |
3482 | ev_check_init (&check, check_cb); |
3658 | ev_check_init (&check, check_cb); |
3483 | ev_check_start (EV_DEFAULT_ &check); |
3659 | ev_check_start (EV_DEFAULT_ &check); |
3484 | ev_loop (EV_DEFAULT_ 0); |
3660 | ev_run (EV_DEFAULT_ 0); |
3485 | |
3661 | |
3486 | =head1 EMBEDDING |
3662 | =head1 EMBEDDING |
3487 | |
3663 | |
3488 | Libev can (and often is) directly embedded into host |
3664 | Libev can (and often is) directly embedded into host |
3489 | applications. Examples of applications that embed it include the Deliantra |
3665 | applications. Examples of applications that embed it include the Deliantra |
… | |
… | |
3569 | libev.m4 |
3745 | libev.m4 |
3570 | |
3746 | |
3571 | =head2 PREPROCESSOR SYMBOLS/MACROS |
3747 | =head2 PREPROCESSOR SYMBOLS/MACROS |
3572 | |
3748 | |
3573 | Libev can be configured via a variety of preprocessor symbols you have to |
3749 | Libev can be configured via a variety of preprocessor symbols you have to |
3574 | define before including any of its files. The default in the absence of |
3750 | define before including (or compiling) any of its files. The default in |
3575 | autoconf is documented for every option. |
3751 | the absence of autoconf is documented for every option. |
|
|
3752 | |
|
|
3753 | Symbols marked with "(h)" do not change the ABI, and can have different |
|
|
3754 | values when compiling libev vs. including F<ev.h>, so it is permissible |
|
|
3755 | to redefine them before including F<ev.h> without breaking compatibility |
|
|
3756 | to a compiled library. All other symbols change the ABI, which means all |
|
|
3757 | users of libev and the libev code itself must be compiled with compatible |
|
|
3758 | settings. |
3576 | |
3759 | |
3577 | =over 4 |
3760 | =over 4 |
3578 | |
3761 | |
|
|
3762 | =item EV_COMPAT3 (h) |
|
|
3763 | |
|
|
3764 | Backwards compatibility is a major concern for libev. This is why this |
|
|
3765 | release of libev comes with wrappers for the functions and symbols that |
|
|
3766 | have been renamed between libev version 3 and 4. |
|
|
3767 | |
|
|
3768 | You can disable these wrappers (to test compatibility with future |
|
|
3769 | versions) by defining C<EV_COMPAT3> to C<0> when compiling your |
|
|
3770 | sources. This has the additional advantage that you can drop the C<struct> |
|
|
3771 | from C<struct ev_loop> declarations, as libev will provide an C<ev_loop> |
|
|
3772 | typedef in that case. |
|
|
3773 | |
|
|
3774 | In some future version, the default for C<EV_COMPAT3> will become C<0>, |
|
|
3775 | and in some even more future version the compatibility code will be |
|
|
3776 | removed completely. |
|
|
3777 | |
3579 | =item EV_STANDALONE |
3778 | =item EV_STANDALONE (h) |
3580 | |
3779 | |
3581 | Must always be C<1> if you do not use autoconf configuration, which |
3780 | Must always be C<1> if you do not use autoconf configuration, which |
3582 | keeps libev from including F<config.h>, and it also defines dummy |
3781 | keeps libev from including F<config.h>, and it also defines dummy |
3583 | implementations for some libevent functions (such as logging, which is not |
3782 | implementations for some libevent functions (such as logging, which is not |
3584 | supported). It will also not define any of the structs usually found in |
3783 | supported). It will also not define any of the structs usually found in |
… | |
… | |
3657 | be used is the winsock select). This means that it will call |
3856 | be used is the winsock select). This means that it will call |
3658 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
3857 | C<_get_osfhandle> on the fd to convert it to an OS handle. Otherwise, |
3659 | it is assumed that all these functions actually work on fds, even |
3858 | it is assumed that all these functions actually work on fds, even |
3660 | on win32. Should not be defined on non-win32 platforms. |
3859 | on win32. Should not be defined on non-win32 platforms. |
3661 | |
3860 | |
3662 | =item EV_FD_TO_WIN32_HANDLE |
3861 | =item EV_FD_TO_WIN32_HANDLE(fd) |
3663 | |
3862 | |
3664 | If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map |
3863 | If C<EV_SELECT_IS_WINSOCKET> is enabled, then libev needs a way to map |
3665 | file descriptors to socket handles. When not defining this symbol (the |
3864 | file descriptors to socket handles. When not defining this symbol (the |
3666 | default), then libev will call C<_get_osfhandle>, which is usually |
3865 | default), then libev will call C<_get_osfhandle>, which is usually |
3667 | correct. In some cases, programs use their own file descriptor management, |
3866 | correct. In some cases, programs use their own file descriptor management, |
3668 | in which case they can provide this function to map fds to socket handles. |
3867 | in which case they can provide this function to map fds to socket handles. |
|
|
3868 | |
|
|
3869 | =item EV_WIN32_HANDLE_TO_FD(handle) |
|
|
3870 | |
|
|
3871 | If C<EV_SELECT_IS_WINSOCKET> then libev maps handles to file descriptors |
|
|
3872 | using the standard C<_open_osfhandle> function. For programs implementing |
|
|
3873 | their own fd to handle mapping, overwriting this function makes it easier |
|
|
3874 | to do so. This can be done by defining this macro to an appropriate value. |
|
|
3875 | |
|
|
3876 | =item EV_WIN32_CLOSE_FD(fd) |
|
|
3877 | |
|
|
3878 | If programs implement their own fd to handle mapping on win32, then this |
|
|
3879 | macro can be used to override the C<close> function, useful to unregister |
|
|
3880 | file descriptors again. Note that the replacement function has to close |
|
|
3881 | the underlying OS handle. |
3669 | |
3882 | |
3670 | =item EV_USE_POLL |
3883 | =item EV_USE_POLL |
3671 | |
3884 | |
3672 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
3885 | If defined to be C<1>, libev will compile in support for the C<poll>(2) |
3673 | backend. Otherwise it will be enabled on non-win32 platforms. It |
3886 | backend. Otherwise it will be enabled on non-win32 platforms. It |
… | |
… | |
3720 | as well as for signal and thread safety in C<ev_async> watchers. |
3933 | as well as for signal and thread safety in C<ev_async> watchers. |
3721 | |
3934 | |
3722 | In the absence of this define, libev will use C<sig_atomic_t volatile> |
3935 | In the absence of this define, libev will use C<sig_atomic_t volatile> |
3723 | (from F<signal.h>), which is usually good enough on most platforms. |
3936 | (from F<signal.h>), which is usually good enough on most platforms. |
3724 | |
3937 | |
3725 | =item EV_H |
3938 | =item EV_H (h) |
3726 | |
3939 | |
3727 | The name of the F<ev.h> header file used to include it. The default if |
3940 | The name of the F<ev.h> header file used to include it. The default if |
3728 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
3941 | undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be |
3729 | used to virtually rename the F<ev.h> header file in case of conflicts. |
3942 | used to virtually rename the F<ev.h> header file in case of conflicts. |
3730 | |
3943 | |
3731 | =item EV_CONFIG_H |
3944 | =item EV_CONFIG_H (h) |
3732 | |
3945 | |
3733 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
3946 | If C<EV_STANDALONE> isn't C<1>, this variable can be used to override |
3734 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
3947 | F<ev.c>'s idea of where to find the F<config.h> file, similarly to |
3735 | C<EV_H>, above. |
3948 | C<EV_H>, above. |
3736 | |
3949 | |
3737 | =item EV_EVENT_H |
3950 | =item EV_EVENT_H (h) |
3738 | |
3951 | |
3739 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
3952 | Similarly to C<EV_H>, this macro can be used to override F<event.c>'s idea |
3740 | of how the F<event.h> header can be found, the default is C<"event.h">. |
3953 | of how the F<event.h> header can be found, the default is C<"event.h">. |
3741 | |
3954 | |
3742 | =item EV_PROTOTYPES |
3955 | =item EV_PROTOTYPES (h) |
3743 | |
3956 | |
3744 | If defined to be C<0>, then F<ev.h> will not define any function |
3957 | If defined to be C<0>, then F<ev.h> will not define any function |
3745 | prototypes, but still define all the structs and other symbols. This is |
3958 | prototypes, but still define all the structs and other symbols. This is |
3746 | occasionally useful if you want to provide your own wrapper functions |
3959 | occasionally useful if you want to provide your own wrapper functions |
3747 | around libev functions. |
3960 | around libev functions. |
… | |
… | |
3769 | fine. |
3982 | fine. |
3770 | |
3983 | |
3771 | If your embedding application does not need any priorities, defining these |
3984 | If your embedding application does not need any priorities, defining these |
3772 | both to C<0> will save some memory and CPU. |
3985 | both to C<0> will save some memory and CPU. |
3773 | |
3986 | |
3774 | =item EV_PERIODIC_ENABLE |
3987 | =item EV_PERIODIC_ENABLE, EV_IDLE_ENABLE, EV_EMBED_ENABLE, EV_STAT_ENABLE, |
|
|
3988 | EV_PREPARE_ENABLE, EV_CHECK_ENABLE, EV_FORK_ENABLE, EV_SIGNAL_ENABLE, |
|
|
3989 | EV_ASYNC_ENABLE, EV_CHILD_ENABLE. |
3775 | |
3990 | |
3776 | If undefined or defined to be C<1>, then periodic timers are supported. If |
3991 | If undefined or defined to be C<1> (and the platform supports it), then |
3777 | defined to be C<0>, then they are not. Disabling them saves a few kB of |
3992 | the respective watcher type is supported. If defined to be C<0>, then it |
3778 | code. |
3993 | is not. Disabling watcher types mainly saves code size. |
3779 | |
3994 | |
3780 | =item EV_IDLE_ENABLE |
3995 | =item EV_FEATURES |
3781 | |
|
|
3782 | If undefined or defined to be C<1>, then idle watchers are supported. If |
|
|
3783 | defined to be C<0>, then they are not. Disabling them saves a few kB of |
|
|
3784 | code. |
|
|
3785 | |
|
|
3786 | =item EV_EMBED_ENABLE |
|
|
3787 | |
|
|
3788 | If undefined or defined to be C<1>, then embed watchers are supported. If |
|
|
3789 | defined to be C<0>, then they are not. Embed watchers rely on most other |
|
|
3790 | watcher types, which therefore must not be disabled. |
|
|
3791 | |
|
|
3792 | =item EV_STAT_ENABLE |
|
|
3793 | |
|
|
3794 | If undefined or defined to be C<1>, then stat watchers are supported. If |
|
|
3795 | defined to be C<0>, then they are not. |
|
|
3796 | |
|
|
3797 | =item EV_FORK_ENABLE |
|
|
3798 | |
|
|
3799 | If undefined or defined to be C<1>, then fork watchers are supported. If |
|
|
3800 | defined to be C<0>, then they are not. |
|
|
3801 | |
|
|
3802 | =item EV_ASYNC_ENABLE |
|
|
3803 | |
|
|
3804 | If undefined or defined to be C<1>, then async watchers are supported. If |
|
|
3805 | defined to be C<0>, then they are not. |
|
|
3806 | |
|
|
3807 | =item EV_MINIMAL |
|
|
3808 | |
3996 | |
3809 | If you need to shave off some kilobytes of code at the expense of some |
3997 | If you need to shave off some kilobytes of code at the expense of some |
3810 | speed (but with the full API), define this symbol to C<1>. Currently this |
3998 | speed (but with the full API), you can define this symbol to request |
3811 | is used to override some inlining decisions, saves roughly 30% code size |
3999 | certain subsets of functionality. The default is to enable all features |
3812 | on amd64. It also selects a much smaller 2-heap for timer management over |
4000 | that can be enabled on the platform. |
3813 | the default 4-heap. |
|
|
3814 | |
4001 | |
3815 | You can save even more by disabling watcher types you do not need |
4002 | A typical way to use this symbol is to define it to C<0> (or to a bitset |
3816 | and setting C<EV_MAXPRI> == C<EV_MINPRI>. Also, disabling C<assert> |
4003 | with some broad features you want) and then selectively re-enable |
3817 | (C<-DNDEBUG>) will usually reduce code size a lot. |
4004 | additional parts you want, for example if you want everything minimal, |
|
|
4005 | but multiple event loop support, async and child watchers and the poll |
|
|
4006 | backend, use this: |
3818 | |
4007 | |
3819 | Defining C<EV_MINIMAL> to C<2> will additionally reduce the core API to |
4008 | #define EV_FEATURES 0 |
3820 | provide a bare-bones event library. See C<ev.h> for details on what parts |
4009 | #define EV_MULTIPLICITY 1 |
3821 | of the API are still available, and do not complain if this subset changes |
4010 | #define EV_USE_POLL 1 |
3822 | over time. |
4011 | #define EV_CHILD_ENABLE 1 |
|
|
4012 | #define EV_ASYNC_ENABLE 1 |
|
|
4013 | |
|
|
4014 | The actual value is a bitset, it can be a combination of the following |
|
|
4015 | values: |
|
|
4016 | |
|
|
4017 | =over 4 |
|
|
4018 | |
|
|
4019 | =item C<1> - faster/larger code |
|
|
4020 | |
|
|
4021 | Use larger code to speed up some operations. |
|
|
4022 | |
|
|
4023 | Currently this is used to override some inlining decisions (enlarging the |
|
|
4024 | code size by roughly 30% on amd64). |
|
|
4025 | |
|
|
4026 | When optimising for size, use of compiler flags such as C<-Os> with |
|
|
4027 | gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of |
|
|
4028 | assertions. |
|
|
4029 | |
|
|
4030 | =item C<2> - faster/larger data structures |
|
|
4031 | |
|
|
4032 | Replaces the small 2-heap for timer management by a faster 4-heap, larger |
|
|
4033 | hash table sizes and so on. This will usually further increase code size |
|
|
4034 | and can additionally have an effect on the size of data structures at |
|
|
4035 | runtime. |
|
|
4036 | |
|
|
4037 | =item C<4> - full API configuration |
|
|
4038 | |
|
|
4039 | This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and |
|
|
4040 | enables multiplicity (C<EV_MULTIPLICITY>=1). |
|
|
4041 | |
|
|
4042 | =item C<8> - full API |
|
|
4043 | |
|
|
4044 | This enables a lot of the "lesser used" API functions. See C<ev.h> for |
|
|
4045 | details on which parts of the API are still available without this |
|
|
4046 | feature, and do not complain if this subset changes over time. |
|
|
4047 | |
|
|
4048 | =item C<16> - enable all optional watcher types |
|
|
4049 | |
|
|
4050 | Enables all optional watcher types. If you want to selectively enable |
|
|
4051 | only some watcher types other than I/O and timers (e.g. prepare, |
|
|
4052 | embed, async, child...) you can enable them manually by defining |
|
|
4053 | C<EV_watchertype_ENABLE> to C<1> instead. |
|
|
4054 | |
|
|
4055 | =item C<32> - enable all backends |
|
|
4056 | |
|
|
4057 | This enables all backends - without this feature, you need to enable at |
|
|
4058 | least one backend manually (C<EV_USE_SELECT> is a good choice). |
|
|
4059 | |
|
|
4060 | =item C<64> - enable OS-specific "helper" APIs |
|
|
4061 | |
|
|
4062 | Enable inotify, eventfd, signalfd and similar OS-specific helper APIs by |
|
|
4063 | default. |
|
|
4064 | |
|
|
4065 | =back |
|
|
4066 | |
|
|
4067 | Compiling with C<gcc -Os -DEV_STANDALONE -DEV_USE_EPOLL=1 -DEV_FEATURES=0> |
|
|
4068 | reduces the compiled size of libev from 24.7Kb code/2.8Kb data to 6.5Kb |
|
|
4069 | code/0.3Kb data on my GNU/Linux amd64 system, while still giving you I/O |
|
|
4070 | watchers, timers and monotonic clock support. |
|
|
4071 | |
|
|
4072 | With an intelligent-enough linker (gcc+binutils are intelligent enough |
|
|
4073 | when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by |
|
|
4074 | your program might be left out as well - a binary starting a timer and an |
|
|
4075 | I/O watcher then might come out at only 5Kb. |
|
|
4076 | |
|
|
4077 | =item EV_AVOID_STDIO |
|
|
4078 | |
|
|
4079 | If this is set to C<1> at compiletime, then libev will avoid using stdio |
|
|
4080 | functions (printf, scanf, perror etc.). This will increase the code size |
|
|
4081 | somewhat, but if your program doesn't otherwise depend on stdio and your |
|
|
4082 | libc allows it, this avoids linking in the stdio library which is quite |
|
|
4083 | big. |
|
|
4084 | |
|
|
4085 | Note that error messages might become less precise when this option is |
|
|
4086 | enabled. |
3823 | |
4087 | |
3824 | =item EV_NSIG |
4088 | =item EV_NSIG |
3825 | |
4089 | |
3826 | The highest supported signal number, +1 (or, the number of |
4090 | The highest supported signal number, +1 (or, the number of |
3827 | signals): Normally, libev tries to deduce the maximum number of signals |
4091 | signals): Normally, libev tries to deduce the maximum number of signals |
3828 | automatically, but sometimes this fails, in which case it can be |
4092 | automatically, but sometimes this fails, in which case it can be |
3829 | specified. Also, using a lower number than detected (C<32> should be |
4093 | specified. Also, using a lower number than detected (C<32> should be |
3830 | good for about any system in existance) can save some memory, as libev |
4094 | good for about any system in existence) can save some memory, as libev |
3831 | statically allocates some 12-24 bytes per signal number. |
4095 | statically allocates some 12-24 bytes per signal number. |
3832 | |
4096 | |
3833 | =item EV_PID_HASHSIZE |
4097 | =item EV_PID_HASHSIZE |
3834 | |
4098 | |
3835 | C<ev_child> watchers use a small hash table to distribute workload by |
4099 | C<ev_child> watchers use a small hash table to distribute workload by |
3836 | pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more |
4100 | pid. The default size is C<16> (or C<1> with C<EV_FEATURES> disabled), |
3837 | than enough. If you need to manage thousands of children you might want to |
4101 | usually more than enough. If you need to manage thousands of children you |
3838 | increase this value (I<must> be a power of two). |
4102 | might want to increase this value (I<must> be a power of two). |
3839 | |
4103 | |
3840 | =item EV_INOTIFY_HASHSIZE |
4104 | =item EV_INOTIFY_HASHSIZE |
3841 | |
4105 | |
3842 | C<ev_stat> watchers use a small hash table to distribute workload by |
4106 | C<ev_stat> watchers use a small hash table to distribute workload by |
3843 | inotify watch id. The default size is C<16> (or C<1> with C<EV_MINIMAL>), |
4107 | inotify watch id. The default size is C<16> (or C<1> with C<EV_FEATURES> |
3844 | usually more than enough. If you need to manage thousands of C<ev_stat> |
4108 | disabled), usually more than enough. If you need to manage thousands of |
3845 | watchers you might want to increase this value (I<must> be a power of |
4109 | C<ev_stat> watchers you might want to increase this value (I<must> be a |
3846 | two). |
4110 | power of two). |
3847 | |
4111 | |
3848 | =item EV_USE_4HEAP |
4112 | =item EV_USE_4HEAP |
3849 | |
4113 | |
3850 | Heaps are not very cache-efficient. To improve the cache-efficiency of the |
4114 | Heaps are not very cache-efficient. To improve the cache-efficiency of the |
3851 | timer and periodics heaps, libev uses a 4-heap when this symbol is defined |
4115 | timer and periodics heaps, libev uses a 4-heap when this symbol is defined |
3852 | to C<1>. The 4-heap uses more complicated (longer) code but has noticeably |
4116 | to C<1>. The 4-heap uses more complicated (longer) code but has noticeably |
3853 | faster performance with many (thousands) of watchers. |
4117 | faster performance with many (thousands) of watchers. |
3854 | |
4118 | |
3855 | The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> |
4119 | The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it |
3856 | (disabled). |
4120 | will be C<0>. |
3857 | |
4121 | |
3858 | =item EV_HEAP_CACHE_AT |
4122 | =item EV_HEAP_CACHE_AT |
3859 | |
4123 | |
3860 | Heaps are not very cache-efficient. To improve the cache-efficiency of the |
4124 | Heaps are not very cache-efficient. To improve the cache-efficiency of the |
3861 | timer and periodics heaps, libev can cache the timestamp (I<at>) within |
4125 | timer and periodics heaps, libev can cache the timestamp (I<at>) within |
3862 | the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), |
4126 | the heap structure (selected by defining C<EV_HEAP_CACHE_AT> to C<1>), |
3863 | which uses 8-12 bytes more per watcher and a few hundred bytes more code, |
4127 | which uses 8-12 bytes more per watcher and a few hundred bytes more code, |
3864 | but avoids random read accesses on heap changes. This improves performance |
4128 | but avoids random read accesses on heap changes. This improves performance |
3865 | noticeably with many (hundreds) of watchers. |
4129 | noticeably with many (hundreds) of watchers. |
3866 | |
4130 | |
3867 | The default is C<1> unless C<EV_MINIMAL> is set in which case it is C<0> |
4131 | The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it |
3868 | (disabled). |
4132 | will be C<0>. |
3869 | |
4133 | |
3870 | =item EV_VERIFY |
4134 | =item EV_VERIFY |
3871 | |
4135 | |
3872 | Controls how much internal verification (see C<ev_loop_verify ()>) will |
4136 | Controls how much internal verification (see C<ev_verify ()>) will |
3873 | be done: If set to C<0>, no internal verification code will be compiled |
4137 | be done: If set to C<0>, no internal verification code will be compiled |
3874 | in. If set to C<1>, then verification code will be compiled in, but not |
4138 | in. If set to C<1>, then verification code will be compiled in, but not |
3875 | called. If set to C<2>, then the internal verification code will be |
4139 | called. If set to C<2>, then the internal verification code will be |
3876 | called once per loop, which can slow down libev. If set to C<3>, then the |
4140 | called once per loop, which can slow down libev. If set to C<3>, then the |
3877 | verification code will be called very frequently, which will slow down |
4141 | verification code will be called very frequently, which will slow down |
3878 | libev considerably. |
4142 | libev considerably. |
3879 | |
4143 | |
3880 | The default is C<1>, unless C<EV_MINIMAL> is set, in which case it will be |
4144 | The default is C<1>, unless C<EV_FEATURES> overrides it, in which case it |
3881 | C<0>. |
4145 | will be C<0>. |
3882 | |
4146 | |
3883 | =item EV_COMMON |
4147 | =item EV_COMMON |
3884 | |
4148 | |
3885 | By default, all watchers have a C<void *data> member. By redefining |
4149 | By default, all watchers have a C<void *data> member. By redefining |
3886 | this macro to a something else you can include more and other types of |
4150 | this macro to something else you can include more and other types of |
3887 | members. You have to define it each time you include one of the files, |
4151 | members. You have to define it each time you include one of the files, |
3888 | though, and it must be identical each time. |
4152 | though, and it must be identical each time. |
3889 | |
4153 | |
3890 | For example, the perl EV module uses something like this: |
4154 | For example, the perl EV module uses something like this: |
3891 | |
4155 | |
… | |
… | |
3944 | file. |
4208 | file. |
3945 | |
4209 | |
3946 | The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file |
4210 | The usage in rxvt-unicode is simpler. It has a F<ev_cpp.h> header file |
3947 | that everybody includes and which overrides some configure choices: |
4211 | that everybody includes and which overrides some configure choices: |
3948 | |
4212 | |
3949 | #define EV_MINIMAL 1 |
4213 | #define EV_FEATURES 8 |
3950 | #define EV_USE_POLL 0 |
4214 | #define EV_USE_SELECT 1 |
3951 | #define EV_MULTIPLICITY 0 |
|
|
3952 | #define EV_PERIODIC_ENABLE 0 |
4215 | #define EV_PREPARE_ENABLE 1 |
|
|
4216 | #define EV_IDLE_ENABLE 1 |
3953 | #define EV_STAT_ENABLE 0 |
4217 | #define EV_SIGNAL_ENABLE 1 |
3954 | #define EV_FORK_ENABLE 0 |
4218 | #define EV_CHILD_ENABLE 1 |
|
|
4219 | #define EV_USE_STDEXCEPT 0 |
3955 | #define EV_CONFIG_H <config.h> |
4220 | #define EV_CONFIG_H <config.h> |
3956 | #define EV_MINPRI 0 |
|
|
3957 | #define EV_MAXPRI 0 |
|
|
3958 | |
4221 | |
3959 | #include "ev++.h" |
4222 | #include "ev++.h" |
3960 | |
4223 | |
3961 | And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: |
4224 | And a F<ev_cpp.C> implementation file that contains libev proper and is compiled: |
3962 | |
4225 | |
… | |
… | |
4093 | userdata *u = ev_userdata (EV_A); |
4356 | userdata *u = ev_userdata (EV_A); |
4094 | pthread_mutex_lock (&u->lock); |
4357 | pthread_mutex_lock (&u->lock); |
4095 | } |
4358 | } |
4096 | |
4359 | |
4097 | The event loop thread first acquires the mutex, and then jumps straight |
4360 | The event loop thread first acquires the mutex, and then jumps straight |
4098 | into C<ev_loop>: |
4361 | into C<ev_run>: |
4099 | |
4362 | |
4100 | void * |
4363 | void * |
4101 | l_run (void *thr_arg) |
4364 | l_run (void *thr_arg) |
4102 | { |
4365 | { |
4103 | struct ev_loop *loop = (struct ev_loop *)thr_arg; |
4366 | struct ev_loop *loop = (struct ev_loop *)thr_arg; |
4104 | |
4367 | |
4105 | l_acquire (EV_A); |
4368 | l_acquire (EV_A); |
4106 | pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0); |
4369 | pthread_setcanceltype (PTHREAD_CANCEL_ASYNCHRONOUS, 0); |
4107 | ev_loop (EV_A_ 0); |
4370 | ev_run (EV_A_ 0); |
4108 | l_release (EV_A); |
4371 | l_release (EV_A); |
4109 | |
4372 | |
4110 | return 0; |
4373 | return 0; |
4111 | } |
4374 | } |
4112 | |
4375 | |
… | |
… | |
4164 | |
4427 | |
4165 | =head3 COROUTINES |
4428 | =head3 COROUTINES |
4166 | |
4429 | |
4167 | Libev is very accommodating to coroutines ("cooperative threads"): |
4430 | Libev is very accommodating to coroutines ("cooperative threads"): |
4168 | libev fully supports nesting calls to its functions from different |
4431 | libev fully supports nesting calls to its functions from different |
4169 | coroutines (e.g. you can call C<ev_loop> on the same loop from two |
4432 | coroutines (e.g. you can call C<ev_run> on the same loop from two |
4170 | different coroutines, and switch freely between both coroutines running |
4433 | different coroutines, and switch freely between both coroutines running |
4171 | the loop, as long as you don't confuse yourself). The only exception is |
4434 | the loop, as long as you don't confuse yourself). The only exception is |
4172 | that you must not do this from C<ev_periodic> reschedule callbacks. |
4435 | that you must not do this from C<ev_periodic> reschedule callbacks. |
4173 | |
4436 | |
4174 | Care has been taken to ensure that libev does not keep local state inside |
4437 | Care has been taken to ensure that libev does not keep local state inside |
4175 | C<ev_loop>, and other calls do not usually allow for coroutine switches as |
4438 | C<ev_run>, and other calls do not usually allow for coroutine switches as |
4176 | they do not call any callbacks. |
4439 | they do not call any callbacks. |
4177 | |
4440 | |
4178 | =head2 COMPILER WARNINGS |
4441 | =head2 COMPILER WARNINGS |
4179 | |
4442 | |
4180 | Depending on your compiler and compiler settings, you might get no or a |
4443 | Depending on your compiler and compiler settings, you might get no or a |
… | |
… | |
4191 | maintainable. |
4454 | maintainable. |
4192 | |
4455 | |
4193 | And of course, some compiler warnings are just plain stupid, or simply |
4456 | And of course, some compiler warnings are just plain stupid, or simply |
4194 | wrong (because they don't actually warn about the condition their message |
4457 | wrong (because they don't actually warn about the condition their message |
4195 | seems to warn about). For example, certain older gcc versions had some |
4458 | seems to warn about). For example, certain older gcc versions had some |
4196 | warnings that resulted an extreme number of false positives. These have |
4459 | warnings that resulted in an extreme number of false positives. These have |
4197 | been fixed, but some people still insist on making code warn-free with |
4460 | been fixed, but some people still insist on making code warn-free with |
4198 | such buggy versions. |
4461 | such buggy versions. |
4199 | |
4462 | |
4200 | While libev is written to generate as few warnings as possible, |
4463 | While libev is written to generate as few warnings as possible, |
4201 | "warn-free" code is not a goal, and it is recommended not to build libev |
4464 | "warn-free" code is not a goal, and it is recommended not to build libev |
… | |
… | |
4237 | I suggest using suppression lists. |
4500 | I suggest using suppression lists. |
4238 | |
4501 | |
4239 | |
4502 | |
4240 | =head1 PORTABILITY NOTES |
4503 | =head1 PORTABILITY NOTES |
4241 | |
4504 | |
|
|
4505 | =head2 GNU/LINUX 32 BIT LIMITATIONS |
|
|
4506 | |
|
|
4507 | GNU/Linux is the only common platform that supports 64 bit file/large file |
|
|
4508 | interfaces but I<disables> them by default. |
|
|
4509 | |
|
|
4510 | That means that libev compiled in the default environment doesn't support |
|
|
4511 | files larger than 2GiB or so, which mainly affects C<ev_stat> watchers. |
|
|
4512 | |
|
|
4513 | Unfortunately, many programs try to work around this GNU/Linux issue |
|
|
4514 | by enabling the large file API, which makes them incompatible with the |
|
|
4515 | standard libev compiled for their system. |
|
|
4516 | |
|
|
4517 | Likewise, libev cannot enable the large file API itself as this would |
|
|
4518 | suddenly make it incompatible to the default compile time environment, |
|
|
4519 | i.e. all programs not using special compile switches. |
|
|
4520 | |
|
|
4521 | =head2 OS/X AND DARWIN BUGS |
|
|
4522 | |
|
|
4523 | The whole thing is a bug if you ask me - basically any system interface |
|
|
4524 | you touch is broken, whether it is locales, poll, kqueue or even the |
|
|
4525 | OpenGL drivers. |
|
|
4526 | |
|
|
4527 | =head3 C<kqueue> is buggy |
|
|
4528 | |
|
|
4529 | The kqueue syscall is broken in all known versions - most versions support |
|
|
4530 | only sockets, many support pipes. |
|
|
4531 | |
|
|
4532 | Libev tries to work around this by not using C<kqueue> by default on |
|
|
4533 | this rotten platform, but of course you can still ask for it when creating |
|
|
4534 | a loop. |
|
|
4535 | |
|
|
4536 | =head3 C<poll> is buggy |
|
|
4537 | |
|
|
4538 | Instead of fixing C<kqueue>, Apple replaced their (working) C<poll> |
|
|
4539 | implementation by something calling C<kqueue> internally around the 10.5.6 |
|
|
4540 | release, so now C<kqueue> I<and> C<poll> are broken. |
|
|
4541 | |
|
|
4542 | Libev tries to work around this by not using C<poll> by default on |
|
|
4543 | this rotten platform, but of course you can still ask for it when creating |
|
|
4544 | a loop. |
|
|
4545 | |
|
|
4546 | =head3 C<select> is buggy |
|
|
4547 | |
|
|
4548 | All that's left is C<select>, and of course Apple found a way to fuck this |
|
|
4549 | one up as well: On OS/X, C<select> actively limits the number of file |
|
|
4550 | descriptors you can pass in to 1024 - your program suddenly crashes when |
|
|
4551 | you use more. |
|
|
4552 | |
|
|
4553 | There is an undocumented "workaround" for this - defining |
|
|
4554 | C<_DARWIN_UNLIMITED_SELECT>, which libev tries to use, so select I<should> |
|
|
4555 | work on OS/X. |
|
|
4556 | |
|
|
4557 | =head2 SOLARIS PROBLEMS AND WORKAROUNDS |
|
|
4558 | |
|
|
4559 | =head3 C<errno> reentrancy |
|
|
4560 | |
|
|
4561 | The default compile environment on Solaris is unfortunately so |
|
|
4562 | thread-unsafe that you can't even use components/libraries compiled |
|
|
4563 | without C<-D_REENTRANT> (as long as they use C<errno>), which, of course, |
|
|
4564 | isn't defined by default. |
|
|
4565 | |
|
|
4566 | If you want to use libev in threaded environments you have to make sure |
|
|
4567 | it's compiled with C<_REENTRANT> defined. |
|
|
4568 | |
|
|
4569 | =head3 Event port backend |
|
|
4570 | |
|
|
4571 | The scalable event interface for Solaris is called "event ports". Unfortunately, |
|
|
4572 | this mechanism is very buggy. If you run into high CPU usage, your program |
|
|
4573 | freezes or you get a large number of spurious wakeups, make sure you have |
|
|
4574 | all the relevant and latest kernel patches applied. No, I don't know which |
|
|
4575 | ones, but there are multiple ones. |
|
|
4576 | |
|
|
4577 | If you can't get it to work, you can try running the program by setting |
|
|
4578 | the environment variable C<LIBEV_FLAGS=3> to only allow C<poll> and |
|
|
4579 | C<select> backends. |
|
|
4580 | |
|
|
4581 | =head2 AIX POLL BUG |
|
|
4582 | |
|
|
4583 | AIX unfortunately has a broken C<poll.h> header. Libev works around |
|
|
4584 | this by trying to avoid the poll backend altogether (i.e. it's not even |
|
|
4585 | compiled in), which normally isn't a big problem as C<select> works fine |
|
|
4586 | with large bitsets, and AIX is dead anyway. |
|
|
4587 | |
4242 | =head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS |
4588 | =head2 WIN32 PLATFORM LIMITATIONS AND WORKAROUNDS |
|
|
4589 | |
|
|
4590 | =head3 General issues |
4243 | |
4591 | |
4244 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
4592 | Win32 doesn't support any of the standards (e.g. POSIX) that libev |
4245 | requires, and its I/O model is fundamentally incompatible with the POSIX |
4593 | requires, and its I/O model is fundamentally incompatible with the POSIX |
4246 | model. Libev still offers limited functionality on this platform in |
4594 | model. Libev still offers limited functionality on this platform in |
4247 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
4595 | the form of the C<EVBACKEND_SELECT> backend, and only supports socket |
4248 | descriptors. This only applies when using Win32 natively, not when using |
4596 | descriptors. This only applies when using Win32 natively, not when using |
4249 | e.g. cygwin. |
4597 | e.g. cygwin. Actually, it only applies to the microsofts own compilers, |
|
|
4598 | as every compielr comes with a slightly differently broken/incompatible |
|
|
4599 | environment. |
4250 | |
4600 | |
4251 | Lifting these limitations would basically require the full |
4601 | Lifting these limitations would basically require the full |
4252 | re-implementation of the I/O system. If you are into these kinds of |
4602 | re-implementation of the I/O system. If you are into this kind of thing, |
4253 | things, then note that glib does exactly that for you in a very portable |
4603 | then note that glib does exactly that for you in a very portable way (note |
4254 | way (note also that glib is the slowest event library known to man). |
4604 | also that glib is the slowest event library known to man). |
4255 | |
4605 | |
4256 | There is no supported compilation method available on windows except |
4606 | There is no supported compilation method available on windows except |
4257 | embedding it into other applications. |
4607 | embedding it into other applications. |
4258 | |
4608 | |
4259 | Sensible signal handling is officially unsupported by Microsoft - libev |
4609 | Sensible signal handling is officially unsupported by Microsoft - libev |
… | |
… | |
4287 | you do I<not> compile the F<ev.c> or any other embedded source files!): |
4637 | you do I<not> compile the F<ev.c> or any other embedded source files!): |
4288 | |
4638 | |
4289 | #include "evwrap.h" |
4639 | #include "evwrap.h" |
4290 | #include "ev.c" |
4640 | #include "ev.c" |
4291 | |
4641 | |
4292 | =over 4 |
|
|
4293 | |
|
|
4294 | =item The winsocket select function |
4642 | =head3 The winsocket C<select> function |
4295 | |
4643 | |
4296 | The winsocket C<select> function doesn't follow POSIX in that it |
4644 | The winsocket C<select> function doesn't follow POSIX in that it |
4297 | requires socket I<handles> and not socket I<file descriptors> (it is |
4645 | requires socket I<handles> and not socket I<file descriptors> (it is |
4298 | also extremely buggy). This makes select very inefficient, and also |
4646 | also extremely buggy). This makes select very inefficient, and also |
4299 | requires a mapping from file descriptors to socket handles (the Microsoft |
4647 | requires a mapping from file descriptors to socket handles (the Microsoft |
… | |
… | |
4308 | #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ |
4656 | #define EV_SELECT_IS_WINSOCKET 1 /* forces EV_SELECT_USE_FD_SET, too */ |
4309 | |
4657 | |
4310 | Note that winsockets handling of fd sets is O(n), so you can easily get a |
4658 | Note that winsockets handling of fd sets is O(n), so you can easily get a |
4311 | complexity in the O(n²) range when using win32. |
4659 | complexity in the O(n²) range when using win32. |
4312 | |
4660 | |
4313 | =item Limited number of file descriptors |
4661 | =head3 Limited number of file descriptors |
4314 | |
4662 | |
4315 | Windows has numerous arbitrary (and low) limits on things. |
4663 | Windows has numerous arbitrary (and low) limits on things. |
4316 | |
4664 | |
4317 | Early versions of winsocket's select only supported waiting for a maximum |
4665 | Early versions of winsocket's select only supported waiting for a maximum |
4318 | of C<64> handles (probably owning to the fact that all windows kernels |
4666 | of C<64> handles (probably owning to the fact that all windows kernels |
… | |
… | |
4333 | runtime libraries. This might get you to about C<512> or C<2048> sockets |
4681 | runtime libraries. This might get you to about C<512> or C<2048> sockets |
4334 | (depending on windows version and/or the phase of the moon). To get more, |
4682 | (depending on windows version and/or the phase of the moon). To get more, |
4335 | you need to wrap all I/O functions and provide your own fd management, but |
4683 | you need to wrap all I/O functions and provide your own fd management, but |
4336 | the cost of calling select (O(n²)) will likely make this unworkable. |
4684 | the cost of calling select (O(n²)) will likely make this unworkable. |
4337 | |
4685 | |
4338 | =back |
|
|
4339 | |
|
|
4340 | =head2 PORTABILITY REQUIREMENTS |
4686 | =head2 PORTABILITY REQUIREMENTS |
4341 | |
4687 | |
4342 | In addition to a working ISO-C implementation and of course the |
4688 | In addition to a working ISO-C implementation and of course the |
4343 | backend-specific APIs, libev relies on a few additional extensions: |
4689 | backend-specific APIs, libev relies on a few additional extensions: |
4344 | |
4690 | |
… | |
… | |
4382 | watchers. |
4728 | watchers. |
4383 | |
4729 | |
4384 | =item C<double> must hold a time value in seconds with enough accuracy |
4730 | =item C<double> must hold a time value in seconds with enough accuracy |
4385 | |
4731 | |
4386 | The type C<double> is used to represent timestamps. It is required to |
4732 | The type C<double> is used to represent timestamps. It is required to |
4387 | have at least 51 bits of mantissa (and 9 bits of exponent), which is good |
4733 | have at least 51 bits of mantissa (and 9 bits of exponent), which is |
4388 | enough for at least into the year 4000. This requirement is fulfilled by |
4734 | good enough for at least into the year 4000 with millisecond accuracy |
|
|
4735 | (the design goal for libev). This requirement is overfulfilled by |
4389 | implementations implementing IEEE 754, which is basically all existing |
4736 | implementations using IEEE 754, which is basically all existing ones. With |
4390 | ones. With IEEE 754 doubles, you get microsecond accuracy until at least |
4737 | IEEE 754 doubles, you get microsecond accuracy until at least 2200. |
4391 | 2200. |
|
|
4392 | |
4738 | |
4393 | =back |
4739 | =back |
4394 | |
4740 | |
4395 | If you know of other additional requirements drop me a note. |
4741 | If you know of other additional requirements drop me a note. |
4396 | |
4742 | |
… | |
… | |
4464 | involves iterating over all running async watchers or all signal numbers. |
4810 | involves iterating over all running async watchers or all signal numbers. |
4465 | |
4811 | |
4466 | =back |
4812 | =back |
4467 | |
4813 | |
4468 | |
4814 | |
|
|
4815 | =head1 PORTING FROM LIBEV 3.X TO 4.X |
|
|
4816 | |
|
|
4817 | The major version 4 introduced some minor incompatible changes to the API. |
|
|
4818 | |
|
|
4819 | At the moment, the C<ev.h> header file tries to implement superficial |
|
|
4820 | compatibility, so most programs should still compile. Those might be |
|
|
4821 | removed in later versions of libev, so better update early than late. |
|
|
4822 | |
|
|
4823 | =over 4 |
|
|
4824 | |
|
|
4825 | =item function/symbol renames |
|
|
4826 | |
|
|
4827 | A number of functions and symbols have been renamed: |
|
|
4828 | |
|
|
4829 | ev_loop => ev_run |
|
|
4830 | EVLOOP_NONBLOCK => EVRUN_NOWAIT |
|
|
4831 | EVLOOP_ONESHOT => EVRUN_ONCE |
|
|
4832 | |
|
|
4833 | ev_unloop => ev_break |
|
|
4834 | EVUNLOOP_CANCEL => EVBREAK_CANCEL |
|
|
4835 | EVUNLOOP_ONE => EVBREAK_ONE |
|
|
4836 | EVUNLOOP_ALL => EVBREAK_ALL |
|
|
4837 | |
|
|
4838 | EV_TIMEOUT => EV_TIMER |
|
|
4839 | |
|
|
4840 | ev_loop_count => ev_iteration |
|
|
4841 | ev_loop_depth => ev_depth |
|
|
4842 | ev_loop_verify => ev_verify |
|
|
4843 | |
|
|
4844 | Most functions working on C<struct ev_loop> objects don't have an |
|
|
4845 | C<ev_loop_> prefix, so it was removed; C<ev_loop>, C<ev_unloop> and |
|
|
4846 | associated constants have been renamed to not collide with the C<struct |
|
|
4847 | ev_loop> anymore and C<EV_TIMER> now follows the same naming scheme |
|
|
4848 | as all other watcher types. Note that C<ev_loop_fork> is still called |
|
|
4849 | C<ev_loop_fork> because it would otherwise clash with the C<ev_fork> |
|
|
4850 | typedef. |
|
|
4851 | |
|
|
4852 | =item C<EV_COMPAT3> backwards compatibility mechanism |
|
|
4853 | |
|
|
4854 | The backward compatibility mechanism can be controlled by |
|
|
4855 | C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> |
|
|
4856 | section. |
|
|
4857 | |
|
|
4858 | =item C<EV_MINIMAL> mechanism replaced by C<EV_FEATURES> |
|
|
4859 | |
|
|
4860 | The preprocessor symbol C<EV_MINIMAL> has been replaced by a different |
|
|
4861 | mechanism, C<EV_FEATURES>. Programs using C<EV_MINIMAL> usually compile |
|
|
4862 | and work, but the library code will of course be larger. |
|
|
4863 | |
|
|
4864 | =back |
|
|
4865 | |
|
|
4866 | |
4469 | =head1 GLOSSARY |
4867 | =head1 GLOSSARY |
4470 | |
4868 | |
4471 | =over 4 |
4869 | =over 4 |
4472 | |
4870 | |
4473 | =item active |
4871 | =item active |
… | |
… | |
4494 | A change of state of some external event, such as data now being available |
4892 | A change of state of some external event, such as data now being available |
4495 | for reading on a file descriptor, time having passed or simply not having |
4893 | for reading on a file descriptor, time having passed or simply not having |
4496 | any other events happening anymore. |
4894 | any other events happening anymore. |
4497 | |
4895 | |
4498 | In libev, events are represented as single bits (such as C<EV_READ> or |
4896 | In libev, events are represented as single bits (such as C<EV_READ> or |
4499 | C<EV_TIMEOUT>). |
4897 | C<EV_TIMER>). |
4500 | |
4898 | |
4501 | =item event library |
4899 | =item event library |
4502 | |
4900 | |
4503 | A software package implementing an event model and loop. |
4901 | A software package implementing an event model and loop. |
4504 | |
4902 | |