… | |
… | |
620 | happily wraps around with enough iterations. |
620 | happily wraps around with enough iterations. |
621 | |
621 | |
622 | This value can sometimes be useful as a generation counter of sorts (it |
622 | This value can sometimes be useful as a generation counter of sorts (it |
623 | "ticks" the number of loop iterations), as it roughly corresponds with |
623 | "ticks" the number of loop iterations), as it roughly corresponds with |
624 | C<ev_prepare> and C<ev_check> calls. |
624 | C<ev_prepare> and C<ev_check> calls. |
|
|
625 | |
|
|
626 | =item unsigned int ev_loop_depth (loop) |
|
|
627 | |
|
|
628 | Returns the number of times C<ev_loop> was entered minus the number of |
|
|
629 | times C<ev_loop> was exited, in other words, the recursion depth. |
|
|
630 | |
|
|
631 | Outside C<ev_loop>, this number is zero. In a callback, this number is |
|
|
632 | C<1>, unless C<ev_loop> was invoked recursively (or from another thread), |
|
|
633 | in which case it is higher. |
|
|
634 | |
|
|
635 | Leaving C<ev_loop> abnormally (setjmp/longjmp, cancelling the thread |
|
|
636 | etc.), doesn't count as exit. |
625 | |
637 | |
626 | =item unsigned int ev_backend (loop) |
638 | =item unsigned int ev_backend (loop) |
627 | |
639 | |
628 | Returns one of the C<EVBACKEND_*> flags indicating the event backend in |
640 | Returns one of the C<EVBACKEND_*> flags indicating the event backend in |
629 | use. |
641 | use. |
… | |
… | |
1480 | |
1492 | |
1481 | The callback is guaranteed to be invoked only I<after> its timeout has |
1493 | The callback is guaranteed to be invoked only I<after> its timeout has |
1482 | passed (not I<at>, so on systems with very low-resolution clocks this |
1494 | passed (not I<at>, so on systems with very low-resolution clocks this |
1483 | might introduce a small delay). If multiple timers become ready during the |
1495 | might introduce a small delay). If multiple timers become ready during the |
1484 | same loop iteration then the ones with earlier time-out values are invoked |
1496 | same loop iteration then the ones with earlier time-out values are invoked |
1485 | before ones with later time-out values (but this is no longer true when a |
1497 | before ones of the same priority with later time-out values (but this is |
1486 | callback calls C<ev_loop> recursively). |
1498 | no longer true when a callback calls C<ev_loop> recursively). |
1487 | |
1499 | |
1488 | =head3 Be smart about timeouts |
1500 | =head3 Be smart about timeouts |
1489 | |
1501 | |
1490 | Many real-world problems involve some kind of timeout, usually for error |
1502 | Many real-world problems involve some kind of timeout, usually for error |
1491 | recovery. A typical example is an HTTP request - if the other side hangs, |
1503 | recovery. A typical example is an HTTP request - if the other side hangs, |
… | |
… | |
2019 | but forking and registering a watcher a few event loop iterations later or |
2031 | but forking and registering a watcher a few event loop iterations later or |
2020 | in the next callback invocation is not. |
2032 | in the next callback invocation is not. |
2021 | |
2033 | |
2022 | Only the default event loop is capable of handling signals, and therefore |
2034 | Only the default event loop is capable of handling signals, and therefore |
2023 | you can only register child watchers in the default event loop. |
2035 | you can only register child watchers in the default event loop. |
|
|
2036 | |
|
|
2037 | Due to some design glitches inside libev, child watchers will always be |
|
|
2038 | handled at maximum priority (their priority is set to C<EV_MAXPRI> by |
|
|
2039 | libev) |
2024 | |
2040 | |
2025 | =head3 Process Interaction |
2041 | =head3 Process Interaction |
2026 | |
2042 | |
2027 | Libev grabs C<SIGCHLD> as soon as the default event loop is |
2043 | Libev grabs C<SIGCHLD> as soon as the default event loop is |
2028 | initialised. This is necessary to guarantee proper behaviour even if |
2044 | initialised. This is necessary to guarantee proper behaviour even if |
… | |
… | |
3655 | defined to be C<0>, then they are not. |
3671 | defined to be C<0>, then they are not. |
3656 | |
3672 | |
3657 | =item EV_MINIMAL |
3673 | =item EV_MINIMAL |
3658 | |
3674 | |
3659 | If you need to shave off some kilobytes of code at the expense of some |
3675 | If you need to shave off some kilobytes of code at the expense of some |
3660 | speed, define this symbol to C<1>. Currently this is used to override some |
3676 | speed (but with the full API), define this symbol to C<1>. Currently this |
3661 | inlining decisions, saves roughly 30% code size on amd64. It also selects a |
3677 | is used to override some inlining decisions, saves roughly 30% code size |
3662 | much smaller 2-heap for timer management over the default 4-heap. |
3678 | on amd64. It also selects a much smaller 2-heap for timer management over |
|
|
3679 | the default 4-heap. |
|
|
3680 | |
|
|
3681 | You can save even more by disabling watcher types you do not need and |
|
|
3682 | setting C<EV_MAXPRI> == C<EV_MINPRI>. |
3663 | |
3683 | |
3664 | =item EV_PID_HASHSIZE |
3684 | =item EV_PID_HASHSIZE |
3665 | |
3685 | |
3666 | C<ev_child> watchers use a small hash table to distribute workload by |
3686 | C<ev_child> watchers use a small hash table to distribute workload by |
3667 | pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more |
3687 | pid. The default size is C<16> (or C<1> with C<EV_MINIMAL>), usually more |