… | |
… | |
174 | =item ev_tstamp ev_time () |
174 | =item ev_tstamp ev_time () |
175 | |
175 | |
176 | Returns the current time as libev would use it. Please note that the |
176 | Returns the current time as libev would use it. Please note that the |
177 | C<ev_now> function is usually faster and also often returns the timestamp |
177 | C<ev_now> function is usually faster and also often returns the timestamp |
178 | you actually want to know. Also interesting is the combination of |
178 | you actually want to know. Also interesting is the combination of |
179 | C<ev_update_now> and C<ev_now>. |
179 | C<ev_now_update> and C<ev_now>. |
180 | |
180 | |
181 | =item ev_sleep (ev_tstamp interval) |
181 | =item ev_sleep (ev_tstamp interval) |
182 | |
182 | |
183 | Sleep for the given interval: The current thread will be blocked |
183 | Sleep for the given interval: The current thread will be blocked |
184 | until either it is interrupted or the given time interval has |
184 | until either it is interrupted or the given time interval has |
… | |
… | |
567 | |
567 | |
568 | It scales in the same way as the epoll backend, but the interface to the |
568 | It scales in the same way as the epoll backend, but the interface to the |
569 | kernel is more efficient (which says nothing about its actual speed, of |
569 | kernel is more efficient (which says nothing about its actual speed, of |
570 | course). While stopping, setting and starting an I/O watcher does never |
570 | course). While stopping, setting and starting an I/O watcher does never |
571 | cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to |
571 | cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to |
572 | two event changes per incident. Support for C<fork ()> is very bad (but |
572 | two event changes per incident. Support for C<fork ()> is very bad (you |
573 | sane, unlike epoll) and it drops fds silently in similarly hard-to-detect |
573 | might have to leak fd's on fork, but it's more sane than epoll) and it |
574 | cases |
574 | drops fds silently in similarly hard-to-detect cases |
575 | |
575 | |
576 | This backend usually performs well under most conditions. |
576 | This backend usually performs well under most conditions. |
577 | |
577 | |
578 | While nominally embeddable in other event loops, this doesn't work |
578 | While nominally embeddable in other event loops, this doesn't work |
579 | everywhere, so you might need to test for this. And since it is broken |
579 | everywhere, so you might need to test for this. And since it is broken |
… | |
… | |
792 | without a previous call to C<ev_suspend>. |
792 | without a previous call to C<ev_suspend>. |
793 | |
793 | |
794 | Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the |
794 | Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the |
795 | event loop time (see C<ev_now_update>). |
795 | event loop time (see C<ev_now_update>). |
796 | |
796 | |
797 | =item ev_run (loop, int flags) |
797 | =item bool ev_run (loop, int flags) |
798 | |
798 | |
799 | Finally, this is it, the event handler. This function usually is called |
799 | Finally, this is it, the event handler. This function usually is called |
800 | after you have initialised all your watchers and you want to start |
800 | after you have initialised all your watchers and you want to start |
801 | handling events. It will ask the operating system for any new events, call |
801 | handling events. It will ask the operating system for any new events, call |
802 | the watcher callbacks, an then repeat the whole process indefinitely: This |
802 | the watcher callbacks, and then repeat the whole process indefinitely: This |
803 | is why event loops are called I<loops>. |
803 | is why event loops are called I<loops>. |
804 | |
804 | |
805 | If the flags argument is specified as C<0>, it will keep handling events |
805 | If the flags argument is specified as C<0>, it will keep handling events |
806 | until either no event watchers are active anymore or C<ev_break> was |
806 | until either no event watchers are active anymore or C<ev_break> was |
807 | called. |
807 | called. |
|
|
808 | |
|
|
809 | The return value is false if there are no more active watchers (which |
|
|
810 | usually means "all jobs done" or "deadlock"), and true in all other cases |
|
|
811 | (which usually means " you should call C<ev_run> again"). |
808 | |
812 | |
809 | Please note that an explicit C<ev_break> is usually better than |
813 | Please note that an explicit C<ev_break> is usually better than |
810 | relying on all watchers to be stopped when deciding when a program has |
814 | relying on all watchers to be stopped when deciding when a program has |
811 | finished (especially in interactive programs), but having a program |
815 | finished (especially in interactive programs), but having a program |
812 | that automatically loops as long as it has to and no longer by virtue |
816 | that automatically loops as long as it has to and no longer by virtue |
813 | of relying on its watchers stopping correctly, that is truly a thing of |
817 | of relying on its watchers stopping correctly, that is truly a thing of |
814 | beauty. |
818 | beauty. |
815 | |
819 | |
816 | This function is also I<mostly> exception-safe - you can break out of |
820 | This function is I<mostly> exception-safe - you can break out of a |
817 | a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++ |
821 | C<ev_run> call by calling C<longjmp> in a callback, throwing a C++ |
818 | exception and so on. This does not decrement the C<ev_depth> value, nor |
822 | exception and so on. This does not decrement the C<ev_depth> value, nor |
819 | will it clear any outstanding C<EVBREAK_ONE> breaks. |
823 | will it clear any outstanding C<EVBREAK_ONE> breaks. |
820 | |
824 | |
821 | A flags value of C<EVRUN_NOWAIT> will look for new events, will handle |
825 | A flags value of C<EVRUN_NOWAIT> will look for new events, will handle |
822 | those events and any already outstanding ones, but will not wait and |
826 | those events and any already outstanding ones, but will not wait and |
… | |
… | |
1020 | can be done relatively simply by putting mutex_lock/unlock calls around |
1024 | can be done relatively simply by putting mutex_lock/unlock calls around |
1021 | each call to a libev function. |
1025 | each call to a libev function. |
1022 | |
1026 | |
1023 | However, C<ev_run> can run an indefinite time, so it is not feasible |
1027 | However, C<ev_run> can run an indefinite time, so it is not feasible |
1024 | to wait for it to return. One way around this is to wake up the event |
1028 | to wait for it to return. One way around this is to wake up the event |
1025 | loop via C<ev_break> and C<av_async_send>, another way is to set these |
1029 | loop via C<ev_break> and C<ev_async_send>, another way is to set these |
1026 | I<release> and I<acquire> callbacks on the loop. |
1030 | I<release> and I<acquire> callbacks on the loop. |
1027 | |
1031 | |
1028 | When set, then C<release> will be called just before the thread is |
1032 | When set, then C<release> will be called just before the thread is |
1029 | suspended waiting for new events, and C<acquire> is called just |
1033 | suspended waiting for new events, and C<acquire> is called just |
1030 | afterwards. |
1034 | afterwards. |
… | |
… | |
1860 | |
1864 | |
1861 | In this case, it would be more efficient to leave the C<ev_timer> alone, |
1865 | In this case, it would be more efficient to leave the C<ev_timer> alone, |
1862 | but remember the time of last activity, and check for a real timeout only |
1866 | but remember the time of last activity, and check for a real timeout only |
1863 | within the callback: |
1867 | within the callback: |
1864 | |
1868 | |
|
|
1869 | ev_tstamp timeout = 60.; |
1865 | ev_tstamp last_activity; // time of last activity |
1870 | ev_tstamp last_activity; // time of last activity |
|
|
1871 | ev_timer timer; |
1866 | |
1872 | |
1867 | static void |
1873 | static void |
1868 | callback (EV_P_ ev_timer *w, int revents) |
1874 | callback (EV_P_ ev_timer *w, int revents) |
1869 | { |
1875 | { |
1870 | ev_tstamp now = ev_now (EV_A); |
1876 | // calculate when the timeout would happen |
1871 | ev_tstamp timeout = last_activity + 60.; |
1877 | ev_tstamp after = last_activity - ev_now (EV_A) + timeout; |
1872 | |
1878 | |
1873 | // if last_activity + 60. is older than now, we did time out |
1879 | // if negative, it means we the timeout already occured |
1874 | if (timeout < now) |
1880 | if (after < 0.) |
1875 | { |
1881 | { |
1876 | // timeout occurred, take action |
1882 | // timeout occurred, take action |
1877 | } |
1883 | } |
1878 | else |
1884 | else |
1879 | { |
1885 | { |
1880 | // callback was invoked, but there was some activity, re-arm |
1886 | // callback was invoked, but there was some recent |
1881 | // the watcher to fire in last_activity + 60, which is |
1887 | // activity. simply restart the timer to time out |
1882 | // guaranteed to be in the future, so "again" is positive: |
1888 | // after "after" seconds, which is the earliest time |
1883 | w->repeat = timeout - now; |
1889 | // the timeout can occur. |
|
|
1890 | ev_timer_set (w, after, 0.); |
1884 | ev_timer_again (EV_A_ w); |
1891 | ev_timer_start (EV_A_ w); |
1885 | } |
1892 | } |
1886 | } |
1893 | } |
1887 | |
1894 | |
1888 | To summarise the callback: first calculate the real timeout (defined |
1895 | To summarise the callback: first calculate in how many seconds the |
1889 | as "60 seconds after the last activity"), then check if that time has |
1896 | timeout will occur (by calculating the absolute time when it would occur, |
1890 | been reached, which means something I<did>, in fact, time out. Otherwise |
1897 | C<last_activity + timeout>, and subtracting the current time, C<ev_now |
1891 | the callback was invoked too early (C<timeout> is in the future), so |
1898 | (EV_A)> from that). |
1892 | re-schedule the timer to fire at that future time, to see if maybe we have |
|
|
1893 | a timeout then. |
|
|
1894 | |
1899 | |
1895 | Note how C<ev_timer_again> is used, taking advantage of the |
1900 | If this value is negative, then we are already past the timeout, i.e. we |
1896 | C<ev_timer_again> optimisation when the timer is already running. |
1901 | timed out, and need to do whatever is needed in this case. |
|
|
1902 | |
|
|
1903 | Otherwise, we now the earliest time at which the timeout would trigger, |
|
|
1904 | and simply start the timer with this timeout value. |
|
|
1905 | |
|
|
1906 | In other words, each time the callback is invoked it will check whether |
|
|
1907 | the timeout cocured. If not, it will simply reschedule itself to check |
|
|
1908 | again at the earliest time it could time out. Rinse. Repeat. |
1897 | |
1909 | |
1898 | This scheme causes more callback invocations (about one every 60 seconds |
1910 | This scheme causes more callback invocations (about one every 60 seconds |
1899 | minus half the average time between activity), but virtually no calls to |
1911 | minus half the average time between activity), but virtually no calls to |
1900 | libev to change the timeout. |
1912 | libev to change the timeout. |
1901 | |
1913 | |
1902 | To start the timer, simply initialise the watcher and set C<last_activity> |
1914 | To start the machinery, simply initialise the watcher and set |
1903 | to the current time (meaning we just have some activity :), then call the |
1915 | C<last_activity> to the current time (meaning there was some activity just |
1904 | callback, which will "do the right thing" and start the timer: |
1916 | now), then call the callback, which will "do the right thing" and start |
|
|
1917 | the timer: |
1905 | |
1918 | |
|
|
1919 | last_activity = ev_now (EV_A); |
1906 | ev_init (timer, callback); |
1920 | ev_init (&timer, callback); |
1907 | last_activity = ev_now (loop); |
1921 | callback (EV_A_ &timer, 0); |
1908 | callback (loop, timer, EV_TIMER); |
|
|
1909 | |
1922 | |
1910 | And when there is some activity, simply store the current time in |
1923 | When there is some activity, simply store the current time in |
1911 | C<last_activity>, no libev calls at all: |
1924 | C<last_activity>, no libev calls at all: |
1912 | |
1925 | |
|
|
1926 | if (activity detected) |
1913 | last_activity = ev_now (loop); |
1927 | last_activity = ev_now (EV_A); |
|
|
1928 | |
|
|
1929 | When your timeout value changes, then the timeout can be changed by simply |
|
|
1930 | providing a new value, stopping the timer and calling the callback, which |
|
|
1931 | will agaion do the right thing (for example, time out immediately :). |
|
|
1932 | |
|
|
1933 | timeout = new_value; |
|
|
1934 | ev_timer_stop (EV_A_ &timer); |
|
|
1935 | callback (EV_A_ &timer, 0); |
1914 | |
1936 | |
1915 | This technique is slightly more complex, but in most cases where the |
1937 | This technique is slightly more complex, but in most cases where the |
1916 | time-out is unlikely to be triggered, much more efficient. |
1938 | time-out is unlikely to be triggered, much more efficient. |
1917 | |
|
|
1918 | Changing the timeout is trivial as well (if it isn't hard-coded in the |
|
|
1919 | callback :) - just change the timeout and invoke the callback, which will |
|
|
1920 | fix things for you. |
|
|
1921 | |
1939 | |
1922 | =item 4. Wee, just use a double-linked list for your timeouts. |
1940 | =item 4. Wee, just use a double-linked list for your timeouts. |
1923 | |
1941 | |
1924 | If there is not one request, but many thousands (millions...), all |
1942 | If there is not one request, but many thousands (millions...), all |
1925 | employing some kind of timeout with the same timeout value, then one can |
1943 | employing some kind of timeout with the same timeout value, then one can |
… | |
… | |
1958 | |
1976 | |
1959 | If you ask a timer to call your callback after three seconds, then |
1977 | If you ask a timer to call your callback after three seconds, then |
1960 | you expect it to be invoked after three seconds - but of course, this |
1978 | you expect it to be invoked after three seconds - but of course, this |
1961 | cannot be guaranteed to infinite precision. Less obviously, it cannot be |
1979 | cannot be guaranteed to infinite precision. Less obviously, it cannot be |
1962 | guaranteed to any precision by libev - imagine somebody suspending the |
1980 | guaranteed to any precision by libev - imagine somebody suspending the |
1963 | process a STOP signal for a few hours for example. |
1981 | process with a STOP signal for a few hours for example. |
1964 | |
1982 | |
1965 | So, libev tries to invoke your callback as soon as possible I<after> the |
1983 | So, libev tries to invoke your callback as soon as possible I<after> the |
1966 | delay has occurred, but cannot guarantee this. |
1984 | delay has occurred, but cannot guarantee this. |
1967 | |
1985 | |
1968 | A less obvious failure mode is calling your callback too early: many event |
1986 | A less obvious failure mode is calling your callback too early: many event |
… | |
… | |
1991 | delay has actually elapsed, or in other words, it always errs on the "too |
2009 | delay has actually elapsed, or in other words, it always errs on the "too |
1992 | late" side of things. |
2010 | late" side of things. |
1993 | |
2011 | |
1994 | =head3 The special problem of time updates |
2012 | =head3 The special problem of time updates |
1995 | |
2013 | |
1996 | Establishing the current time is a costly operation (it usually takes at |
2014 | Establishing the current time is a costly operation (it usually takes |
1997 | least two system calls): EV therefore updates its idea of the current |
2015 | at least one system call): EV therefore updates its idea of the current |
1998 | time only before and after C<ev_run> collects new events, which causes a |
2016 | time only before and after C<ev_run> collects new events, which causes a |
1999 | growing difference between C<ev_now ()> and C<ev_time ()> when handling |
2017 | growing difference between C<ev_now ()> and C<ev_time ()> when handling |
2000 | lots of events in one iteration. |
2018 | lots of events in one iteration. |
2001 | |
2019 | |
2002 | The relative timeouts are calculated relative to the C<ev_now ()> |
2020 | The relative timeouts are calculated relative to the C<ev_now ()> |
… | |
… | |
2009 | |
2027 | |
2010 | If the event loop is suspended for a long time, you can also force an |
2028 | If the event loop is suspended for a long time, you can also force an |
2011 | update of the time returned by C<ev_now ()> by calling C<ev_now_update |
2029 | update of the time returned by C<ev_now ()> by calling C<ev_now_update |
2012 | ()>. |
2030 | ()>. |
2013 | |
2031 | |
2014 | =head3 The special problem of unsychronised clocks |
2032 | =head3 The special problem of unsynchronised clocks |
2015 | |
2033 | |
2016 | Modern systems have a variety of clocks - libev itself uses the normal |
2034 | Modern systems have a variety of clocks - libev itself uses the normal |
2017 | "wall clock" clock and, if available, the monotonic clock (to avoid time |
2035 | "wall clock" clock and, if available, the monotonic clock (to avoid time |
2018 | jumps). |
2036 | jumps). |
2019 | |
2037 | |
… | |
… | |
2094 | keep up with the timer (because it takes longer than those 10 seconds to |
2112 | keep up with the timer (because it takes longer than those 10 seconds to |
2095 | do stuff) the timer will not fire more than once per event loop iteration. |
2113 | do stuff) the timer will not fire more than once per event loop iteration. |
2096 | |
2114 | |
2097 | =item ev_timer_again (loop, ev_timer *) |
2115 | =item ev_timer_again (loop, ev_timer *) |
2098 | |
2116 | |
2099 | This will act as if the timer timed out and restarts it again if it is |
2117 | This will act as if the timer timed out, and restarts it again if it is |
2100 | repeating. The exact semantics are: |
2118 | repeating. It basically works like calling C<ev_timer_stop>, updating the |
|
|
2119 | timeout to the C<repeat> value and calling C<ev_timer_start>. |
2101 | |
2120 | |
|
|
2121 | The exact semantics are as in the following rules, all of which will be |
|
|
2122 | applied to the watcher: |
|
|
2123 | |
|
|
2124 | =over 4 |
|
|
2125 | |
2102 | If the timer is pending, its pending status is cleared. |
2126 | =item If the timer is pending, the pending status is always cleared. |
2103 | |
2127 | |
2104 | If the timer is started but non-repeating, stop it (as if it timed out). |
2128 | =item If the timer is started but non-repeating, stop it (as if it timed |
|
|
2129 | out, without invoking it). |
2105 | |
2130 | |
2106 | If the timer is repeating, either start it if necessary (with the |
2131 | =item If the timer is repeating, make the C<repeat> value the new timeout |
2107 | C<repeat> value), or reset the running timer to the C<repeat> value. |
2132 | and start the timer, if necessary. |
|
|
2133 | |
|
|
2134 | =back |
2108 | |
2135 | |
2109 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
2136 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
2110 | usage example. |
2137 | usage example. |
2111 | |
2138 | |
2112 | =item ev_tstamp ev_timer_remaining (loop, ev_timer *) |
2139 | =item ev_tstamp ev_timer_remaining (loop, ev_timer *) |
… | |
… | |
3473 | ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); |
3500 | ev_once (STDIN_FILENO, EV_READ, 10., stdin_ready, 0); |
3474 | |
3501 | |
3475 | =item ev_feed_fd_event (loop, int fd, int revents) |
3502 | =item ev_feed_fd_event (loop, int fd, int revents) |
3476 | |
3503 | |
3477 | Feed an event on the given fd, as if a file descriptor backend detected |
3504 | Feed an event on the given fd, as if a file descriptor backend detected |
3478 | the given events it. |
3505 | the given events. |
3479 | |
3506 | |
3480 | =item ev_feed_signal_event (loop, int signum) |
3507 | =item ev_feed_signal_event (loop, int signum) |
3481 | |
3508 | |
3482 | Feed an event as if the given signal occurred. See also C<ev_feed_signal>, |
3509 | Feed an event as if the given signal occurred. See also C<ev_feed_signal>, |
3483 | which is async-safe. |
3510 | which is async-safe. |
… | |
… | |
3557 | { |
3584 | { |
3558 | struct my_biggy big = (struct my_biggy *) |
3585 | struct my_biggy big = (struct my_biggy *) |
3559 | (((char *)w) - offsetof (struct my_biggy, t2)); |
3586 | (((char *)w) - offsetof (struct my_biggy, t2)); |
3560 | } |
3587 | } |
3561 | |
3588 | |
|
|
3589 | =head2 AVOIDING FINISHING BEFORE RETURNING |
|
|
3590 | |
|
|
3591 | Often you have structures like this in event-based programs: |
|
|
3592 | |
|
|
3593 | callback () |
|
|
3594 | { |
|
|
3595 | free (request); |
|
|
3596 | } |
|
|
3597 | |
|
|
3598 | request = start_new_request (..., callback); |
|
|
3599 | |
|
|
3600 | The intent is to start some "lengthy" operation. The C<request> could be |
|
|
3601 | used to cancel the operation, or do other things with it. |
|
|
3602 | |
|
|
3603 | It's not uncommon to have code paths in C<start_new_request> that |
|
|
3604 | immediately invoke the callback, for example, to report errors. Or you add |
|
|
3605 | some caching layer that finds that it can skip the lengthy aspects of the |
|
|
3606 | operation and simply invoke the callback with the result. |
|
|
3607 | |
|
|
3608 | The problem here is that this will happen I<before> C<start_new_request> |
|
|
3609 | has returned, so C<request> is not set. |
|
|
3610 | |
|
|
3611 | Even if you pass the request by some safer means to the callback, you |
|
|
3612 | might want to do something to the request after starting it, such as |
|
|
3613 | canceling it, which probably isn't working so well when the callback has |
|
|
3614 | already been invoked. |
|
|
3615 | |
|
|
3616 | A common way around all these issues is to make sure that |
|
|
3617 | C<start_new_request> I<always> returns before the callback is invoked. If |
|
|
3618 | C<start_new_request> immediately knows the result, it can artificially |
|
|
3619 | delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher |
|
|
3620 | for example, or more sneakily, by reusing an existing (stopped) watcher |
|
|
3621 | and pushing it into the pending queue: |
|
|
3622 | |
|
|
3623 | ev_set_cb (watcher, callback); |
|
|
3624 | ev_feed_event (EV_A_ watcher, 0); |
|
|
3625 | |
|
|
3626 | This way, C<start_new_request> can safely return before the callback is |
|
|
3627 | invoked, while not delaying callback invocation too much. |
|
|
3628 | |
3562 | =head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS |
3629 | =head2 MODEL/NESTED EVENT LOOP INVOCATIONS AND EXIT CONDITIONS |
3563 | |
3630 | |
3564 | Often (especially in GUI toolkits) there are places where you have |
3631 | Often (especially in GUI toolkits) there are places where you have |
3565 | I<modal> interaction, which is most easily implemented by recursively |
3632 | I<modal> interaction, which is most easily implemented by recursively |
3566 | invoking C<ev_run>. |
3633 | invoking C<ev_run>. |
… | |
… | |
3579 | int exit_main_loop = 0; |
3646 | int exit_main_loop = 0; |
3580 | |
3647 | |
3581 | while (!exit_main_loop) |
3648 | while (!exit_main_loop) |
3582 | ev_run (EV_DEFAULT_ EVRUN_ONCE); |
3649 | ev_run (EV_DEFAULT_ EVRUN_ONCE); |
3583 | |
3650 | |
3584 | // in a model watcher |
3651 | // in a modal watcher |
3585 | int exit_nested_loop = 0; |
3652 | int exit_nested_loop = 0; |
3586 | |
3653 | |
3587 | while (!exit_nested_loop) |
3654 | while (!exit_nested_loop) |
3588 | ev_run (EV_A_ EVRUN_ONCE); |
3655 | ev_run (EV_A_ EVRUN_ONCE); |
3589 | |
3656 | |
… | |
… | |
3769 | switch_to (libev_coro); |
3836 | switch_to (libev_coro); |
3770 | } |
3837 | } |
3771 | |
3838 | |
3772 | That basically suspends the coroutine inside C<wait_for_event> and |
3839 | That basically suspends the coroutine inside C<wait_for_event> and |
3773 | continues the libev coroutine, which, when appropriate, switches back to |
3840 | continues the libev coroutine, which, when appropriate, switches back to |
3774 | this or any other coroutine. I am sure if you sue this your own :) |
3841 | this or any other coroutine. |
3775 | |
3842 | |
3776 | You can do similar tricks if you have, say, threads with an event queue - |
3843 | You can do similar tricks if you have, say, threads with an event queue - |
3777 | instead of storing a coroutine, you store the queue object and instead of |
3844 | instead of storing a coroutine, you store the queue object and instead of |
3778 | switching to a coroutine, you push the watcher onto the queue and notify |
3845 | switching to a coroutine, you push the watcher onto the queue and notify |
3779 | any waiters. |
3846 | any waiters. |
… | |
… | |
3854 | with C<operator ()> can be used as callbacks. Other types should be easy |
3921 | with C<operator ()> can be used as callbacks. Other types should be easy |
3855 | to add as long as they only need one additional pointer for context. If |
3922 | to add as long as they only need one additional pointer for context. If |
3856 | you need support for other types of functors please contact the author |
3923 | you need support for other types of functors please contact the author |
3857 | (preferably after implementing it). |
3924 | (preferably after implementing it). |
3858 | |
3925 | |
|
|
3926 | For all this to work, your C++ compiler either has to use the same calling |
|
|
3927 | conventions as your C compiler (for static member functions), or you have |
|
|
3928 | to embed libev and compile libev itself as C++. |
|
|
3929 | |
3859 | Here is a list of things available in the C<ev> namespace: |
3930 | Here is a list of things available in the C<ev> namespace: |
3860 | |
3931 | |
3861 | =over 4 |
3932 | =over 4 |
3862 | |
3933 | |
3863 | =item C<ev::READ>, C<ev::WRITE> etc. |
3934 | =item C<ev::READ>, C<ev::WRITE> etc. |
… | |
… | |
3872 | =item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc. |
3943 | =item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc. |
3873 | |
3944 | |
3874 | For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of |
3945 | For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of |
3875 | the same name in the C<ev> namespace, with the exception of C<ev_signal> |
3946 | the same name in the C<ev> namespace, with the exception of C<ev_signal> |
3876 | which is called C<ev::sig> to avoid clashes with the C<signal> macro |
3947 | which is called C<ev::sig> to avoid clashes with the C<signal> macro |
3877 | defines by many implementations. |
3948 | defined by many implementations. |
3878 | |
3949 | |
3879 | All of those classes have these methods: |
3950 | All of those classes have these methods: |
3880 | |
3951 | |
3881 | =over 4 |
3952 | =over 4 |
3882 | |
3953 | |
… | |
… | |
4441 | If defined to be C<1>, libev will compile in support for the Linux inotify |
4512 | If defined to be C<1>, libev will compile in support for the Linux inotify |
4442 | interface to speed up C<ev_stat> watchers. Its actual availability will |
4513 | interface to speed up C<ev_stat> watchers. Its actual availability will |
4443 | be detected at runtime. If undefined, it will be enabled if the headers |
4514 | be detected at runtime. If undefined, it will be enabled if the headers |
4444 | indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
4515 | indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
4445 | |
4516 | |
|
|
4517 | =item EV_NO_SMP |
|
|
4518 | |
|
|
4519 | If defined to be C<1>, libev will assume that memory is always coherent |
|
|
4520 | between threads, that is, threads can be used, but threads never run on |
|
|
4521 | different cpus (or different cpu cores). This reduces dependencies |
|
|
4522 | and makes libev faster. |
|
|
4523 | |
|
|
4524 | =item EV_NO_THREADS |
|
|
4525 | |
|
|
4526 | If defined to be C<1>, libev will assume that it will never be called |
|
|
4527 | from different threads, which is a stronger assumption than C<EV_NO_SMP>, |
|
|
4528 | above. This reduces dependencies and makes libev faster. |
|
|
4529 | |
4446 | =item EV_ATOMIC_T |
4530 | =item EV_ATOMIC_T |
4447 | |
4531 | |
4448 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4532 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4449 | access is atomic and serialised with respect to other threads or signal |
4533 | access is atomic and serialised with respect to other threads or signal |
4450 | contexts. No such type is easily found in the C language, so you can |
4534 | contexts. No such type is easily found in the C language, so you can |
… | |
… | |
4597 | |
4681 | |
4598 | With an intelligent-enough linker (gcc+binutils are intelligent enough |
4682 | With an intelligent-enough linker (gcc+binutils are intelligent enough |
4599 | when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by |
4683 | when you use C<-Wl,--gc-sections -ffunction-sections>) functions unused by |
4600 | your program might be left out as well - a binary starting a timer and an |
4684 | your program might be left out as well - a binary starting a timer and an |
4601 | I/O watcher then might come out at only 5Kb. |
4685 | I/O watcher then might come out at only 5Kb. |
|
|
4686 | |
|
|
4687 | =item EV_API_STATIC |
|
|
4688 | |
|
|
4689 | If this symbol is defined (by default it is not), then all identifiers |
|
|
4690 | will have static linkage. This means that libev will not export any |
|
|
4691 | identifiers, and you cannot link against libev anymore. This can be useful |
|
|
4692 | when you embed libev, only want to use libev functions in a single file, |
|
|
4693 | and do not want its identifiers to be visible. |
|
|
4694 | |
|
|
4695 | To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that |
|
|
4696 | wants to use libev. |
|
|
4697 | |
|
|
4698 | This option only works when libev is compiled with a C compiler, as C++ |
|
|
4699 | doesn't support the required declaration syntax. |
4602 | |
4700 | |
4603 | =item EV_AVOID_STDIO |
4701 | =item EV_AVOID_STDIO |
4604 | |
4702 | |
4605 | If this is set to C<1> at compiletime, then libev will avoid using stdio |
4703 | If this is set to C<1> at compiletime, then libev will avoid using stdio |
4606 | functions (printf, scanf, perror etc.). This will increase the code size |
4704 | functions (printf, scanf, perror etc.). This will increase the code size |