… | |
… | |
247 | the current system, you would need to look at C<ev_embeddable_backends () |
247 | the current system, you would need to look at C<ev_embeddable_backends () |
248 | & ev_supported_backends ()>, likewise for recommended ones. |
248 | & ev_supported_backends ()>, likewise for recommended ones. |
249 | |
249 | |
250 | See the description of C<ev_embed> watchers for more info. |
250 | See the description of C<ev_embed> watchers for more info. |
251 | |
251 | |
252 | =item ev_set_allocator (void *(*cb)(void *ptr, long size)) |
252 | =item ev_set_allocator (void *(*cb)(void *ptr, long size) throw ()) |
253 | |
253 | |
254 | Sets the allocation function to use (the prototype is similar - the |
254 | Sets the allocation function to use (the prototype is similar - the |
255 | semantics are identical to the C<realloc> C89/SuS/POSIX function). It is |
255 | semantics are identical to the C<realloc> C89/SuS/POSIX function). It is |
256 | used to allocate and free memory (no surprises here). If it returns zero |
256 | used to allocate and free memory (no surprises here). If it returns zero |
257 | when memory needs to be allocated (C<size != 0>), the library might abort |
257 | when memory needs to be allocated (C<size != 0>), the library might abort |
… | |
… | |
283 | } |
283 | } |
284 | |
284 | |
285 | ... |
285 | ... |
286 | ev_set_allocator (persistent_realloc); |
286 | ev_set_allocator (persistent_realloc); |
287 | |
287 | |
288 | =item ev_set_syserr_cb (void (*cb)(const char *msg)) |
288 | =item ev_set_syserr_cb (void (*cb)(const char *msg) throw ()) |
289 | |
289 | |
290 | Set the callback function to call on a retryable system call error (such |
290 | Set the callback function to call on a retryable system call error (such |
291 | as failed select, poll, epoll_wait). The message is a printable string |
291 | as failed select, poll, epoll_wait). The message is a printable string |
292 | indicating the system call or subsystem causing the problem. If this |
292 | indicating the system call or subsystem causing the problem. If this |
293 | callback is set, then libev will expect it to remedy the situation, no |
293 | callback is set, then libev will expect it to remedy the situation, no |
… | |
… | |
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 |
… | |
… | |
1012 | invoke the actual watchers inside another context (another thread etc.). |
1016 | invoke the actual watchers inside another context (another thread etc.). |
1013 | |
1017 | |
1014 | If you want to reset the callback, use C<ev_invoke_pending> as new |
1018 | If you want to reset the callback, use C<ev_invoke_pending> as new |
1015 | callback. |
1019 | callback. |
1016 | |
1020 | |
1017 | =item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P)) |
1021 | =item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ()) |
1018 | |
1022 | |
1019 | Sometimes you want to share the same loop between multiple threads. This |
1023 | Sometimes you want to share the same loop between multiple threads. This |
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 | |
… | |
… | |
1170 | |
1174 | |
1171 | =item C<EV_PREPARE> |
1175 | =item C<EV_PREPARE> |
1172 | |
1176 | |
1173 | =item C<EV_CHECK> |
1177 | =item C<EV_CHECK> |
1174 | |
1178 | |
1175 | All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts |
1179 | All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to |
1176 | to gather new events, and all C<ev_check> watchers are invoked just after |
1180 | gather new events, and all C<ev_check> watchers are queued (not invoked) |
1177 | C<ev_run> has gathered them, but before it invokes any callbacks for any |
1181 | just after C<ev_run> has gathered them, but before it queues any callbacks |
|
|
1182 | for any received events. That means C<ev_prepare> watchers are the last |
|
|
1183 | watchers invoked before the event loop sleeps or polls for new events, and |
|
|
1184 | C<ev_check> watchers will be invoked before any other watchers of the same |
|
|
1185 | or lower priority within an event loop iteration. |
|
|
1186 | |
1178 | received events. Callbacks of both watcher types can start and stop as |
1187 | Callbacks of both watcher types can start and stop as many watchers as |
1179 | many watchers as they want, and all of them will be taken into account |
1188 | they want, and all of them will be taken into account (for example, a |
1180 | (for example, a C<ev_prepare> watcher might start an idle watcher to keep |
1189 | C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from |
1181 | C<ev_run> from blocking). |
1190 | blocking). |
1182 | |
1191 | |
1183 | =item C<EV_EMBED> |
1192 | =item C<EV_EMBED> |
1184 | |
1193 | |
1185 | The embedded event loop specified in the C<ev_embed> watcher needs attention. |
1194 | The embedded event loop specified in the C<ev_embed> watcher needs attention. |
1186 | |
1195 | |
… | |
… | |
1870 | callback (EV_P_ ev_timer *w, int revents) |
1879 | callback (EV_P_ ev_timer *w, int revents) |
1871 | { |
1880 | { |
1872 | // calculate when the timeout would happen |
1881 | // calculate when the timeout would happen |
1873 | ev_tstamp after = last_activity - ev_now (EV_A) + timeout; |
1882 | ev_tstamp after = last_activity - ev_now (EV_A) + timeout; |
1874 | |
1883 | |
1875 | // if negative, it means we the timeout already occured |
1884 | // if negative, it means we the timeout already occurred |
1876 | if (after < 0.) |
1885 | if (after < 0.) |
1877 | { |
1886 | { |
1878 | // timeout occurred, take action |
1887 | // timeout occurred, take action |
1879 | } |
1888 | } |
1880 | else |
1889 | else |
… | |
… | |
1898 | |
1907 | |
1899 | Otherwise, we now the earliest time at which the timeout would trigger, |
1908 | Otherwise, we now the earliest time at which the timeout would trigger, |
1900 | and simply start the timer with this timeout value. |
1909 | and simply start the timer with this timeout value. |
1901 | |
1910 | |
1902 | In other words, each time the callback is invoked it will check whether |
1911 | In other words, each time the callback is invoked it will check whether |
1903 | the timeout cocured. If not, it will simply reschedule itself to check |
1912 | the timeout occurred. If not, it will simply reschedule itself to check |
1904 | again at the earliest time it could time out. Rinse. Repeat. |
1913 | again at the earliest time it could time out. Rinse. Repeat. |
1905 | |
1914 | |
1906 | This scheme causes more callback invocations (about one every 60 seconds |
1915 | This scheme causes more callback invocations (about one every 60 seconds |
1907 | minus half the average time between activity), but virtually no calls to |
1916 | minus half the average time between activity), but virtually no calls to |
1908 | libev to change the timeout. |
1917 | libev to change the timeout. |
… | |
… | |
1922 | if (activity detected) |
1931 | if (activity detected) |
1923 | last_activity = ev_now (EV_A); |
1932 | last_activity = ev_now (EV_A); |
1924 | |
1933 | |
1925 | When your timeout value changes, then the timeout can be changed by simply |
1934 | When your timeout value changes, then the timeout can be changed by simply |
1926 | providing a new value, stopping the timer and calling the callback, which |
1935 | providing a new value, stopping the timer and calling the callback, which |
1927 | will agaion do the right thing (for example, time out immediately :). |
1936 | will again do the right thing (for example, time out immediately :). |
1928 | |
1937 | |
1929 | timeout = new_value; |
1938 | timeout = new_value; |
1930 | ev_timer_stop (EV_A_ &timer); |
1939 | ev_timer_stop (EV_A_ &timer); |
1931 | callback (EV_A_ &timer, 0); |
1940 | callback (EV_A_ &timer, 0); |
1932 | |
1941 | |
… | |
… | |
2108 | keep up with the timer (because it takes longer than those 10 seconds to |
2117 | keep up with the timer (because it takes longer than those 10 seconds to |
2109 | do stuff) the timer will not fire more than once per event loop iteration. |
2118 | do stuff) the timer will not fire more than once per event loop iteration. |
2110 | |
2119 | |
2111 | =item ev_timer_again (loop, ev_timer *) |
2120 | =item ev_timer_again (loop, ev_timer *) |
2112 | |
2121 | |
2113 | This will act as if the timer timed out and restarts it again if it is |
2122 | This will act as if the timer timed out, and restarts it again if it is |
2114 | repeating. The exact semantics are: |
2123 | repeating. It basically works like calling C<ev_timer_stop>, updating the |
|
|
2124 | timeout to the C<repeat> value and calling C<ev_timer_start>. |
2115 | |
2125 | |
|
|
2126 | The exact semantics are as in the following rules, all of which will be |
|
|
2127 | applied to the watcher: |
|
|
2128 | |
|
|
2129 | =over 4 |
|
|
2130 | |
2116 | If the timer is pending, its pending status is cleared. |
2131 | =item If the timer is pending, the pending status is always cleared. |
2117 | |
2132 | |
2118 | If the timer is started but non-repeating, stop it (as if it timed out). |
2133 | =item If the timer is started but non-repeating, stop it (as if it timed |
|
|
2134 | out, without invoking it). |
2119 | |
2135 | |
2120 | If the timer is repeating, either start it if necessary (with the |
2136 | =item If the timer is repeating, make the C<repeat> value the new timeout |
2121 | C<repeat> value), or reset the running timer to the C<repeat> value. |
2137 | and start the timer, if necessary. |
|
|
2138 | |
|
|
2139 | =back |
2122 | |
2140 | |
2123 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
2141 | This sounds a bit complicated, see L<Be smart about timeouts>, above, for a |
2124 | usage example. |
2142 | usage example. |
2125 | |
2143 | |
2126 | =item ev_tstamp ev_timer_remaining (loop, ev_timer *) |
2144 | =item ev_tstamp ev_timer_remaining (loop, ev_timer *) |
… | |
… | |
2829 | Apart from keeping your process non-blocking (which is a useful |
2847 | Apart from keeping your process non-blocking (which is a useful |
2830 | effect on its own sometimes), idle watchers are a good place to do |
2848 | effect on its own sometimes), idle watchers are a good place to do |
2831 | "pseudo-background processing", or delay processing stuff to after the |
2849 | "pseudo-background processing", or delay processing stuff to after the |
2832 | event loop has handled all outstanding events. |
2850 | event loop has handled all outstanding events. |
2833 | |
2851 | |
|
|
2852 | =head3 Abusing an C<ev_idle> watcher for its side-effect |
|
|
2853 | |
|
|
2854 | As long as there is at least one active idle watcher, libev will never |
|
|
2855 | sleep unnecessarily. Or in other words, it will loop as fast as possible. |
|
|
2856 | For this to work, the idle watcher doesn't need to be invoked at all - the |
|
|
2857 | lowest priority will do. |
|
|
2858 | |
|
|
2859 | This mode of operation can be useful together with an C<ev_check> watcher, |
|
|
2860 | to do something on each event loop iteration - for example to balance load |
|
|
2861 | between different connections. |
|
|
2862 | |
|
|
2863 | See L<Abusing an C<ev_check> watcher for its side-effect> for a longer |
|
|
2864 | example. |
|
|
2865 | |
2834 | =head3 Watcher-Specific Functions and Data Members |
2866 | =head3 Watcher-Specific Functions and Data Members |
2835 | |
2867 | |
2836 | =over 4 |
2868 | =over 4 |
2837 | |
2869 | |
2838 | =item ev_idle_init (ev_idle *, callback) |
2870 | =item ev_idle_init (ev_idle *, callback) |
… | |
… | |
2849 | callback, free it. Also, use no error checking, as usual. |
2881 | callback, free it. Also, use no error checking, as usual. |
2850 | |
2882 | |
2851 | static void |
2883 | static void |
2852 | idle_cb (struct ev_loop *loop, ev_idle *w, int revents) |
2884 | idle_cb (struct ev_loop *loop, ev_idle *w, int revents) |
2853 | { |
2885 | { |
|
|
2886 | // stop the watcher |
|
|
2887 | ev_idle_stop (loop, w); |
|
|
2888 | |
|
|
2889 | // now we can free it |
2854 | free (w); |
2890 | free (w); |
|
|
2891 | |
2855 | // now do something you wanted to do when the program has |
2892 | // now do something you wanted to do when the program has |
2856 | // no longer anything immediate to do. |
2893 | // no longer anything immediate to do. |
2857 | } |
2894 | } |
2858 | |
2895 | |
2859 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
2896 | ev_idle *idle_watcher = malloc (sizeof (ev_idle)); |
… | |
… | |
2861 | ev_idle_start (loop, idle_watcher); |
2898 | ev_idle_start (loop, idle_watcher); |
2862 | |
2899 | |
2863 | |
2900 | |
2864 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
2901 | =head2 C<ev_prepare> and C<ev_check> - customise your event loop! |
2865 | |
2902 | |
2866 | Prepare and check watchers are usually (but not always) used in pairs: |
2903 | Prepare and check watchers are often (but not always) used in pairs: |
2867 | prepare watchers get invoked before the process blocks and check watchers |
2904 | prepare watchers get invoked before the process blocks and check watchers |
2868 | afterwards. |
2905 | afterwards. |
2869 | |
2906 | |
2870 | You I<must not> call C<ev_run> or similar functions that enter |
2907 | You I<must not> call C<ev_run> or similar functions that enter |
2871 | the current event loop from either C<ev_prepare> or C<ev_check> |
2908 | the current event loop from either C<ev_prepare> or C<ev_check> |
… | |
… | |
2899 | with priority higher than or equal to the event loop and one coroutine |
2936 | with priority higher than or equal to the event loop and one coroutine |
2900 | of lower priority, but only once, using idle watchers to keep the event |
2937 | of lower priority, but only once, using idle watchers to keep the event |
2901 | loop from blocking if lower-priority coroutines are active, thus mapping |
2938 | loop from blocking if lower-priority coroutines are active, thus mapping |
2902 | low-priority coroutines to idle/background tasks). |
2939 | low-priority coroutines to idle/background tasks). |
2903 | |
2940 | |
2904 | It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) |
2941 | When used for this purpose, it is recommended to give C<ev_check> watchers |
2905 | priority, to ensure that they are being run before any other watchers |
2942 | highest (C<EV_MAXPRI>) priority, to ensure that they are being run before |
2906 | after the poll (this doesn't matter for C<ev_prepare> watchers). |
2943 | any other watchers after the poll (this doesn't matter for C<ev_prepare> |
|
|
2944 | watchers). |
2907 | |
2945 | |
2908 | Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not |
2946 | Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not |
2909 | activate ("feed") events into libev. While libev fully supports this, they |
2947 | activate ("feed") events into libev. While libev fully supports this, they |
2910 | might get executed before other C<ev_check> watchers did their job. As |
2948 | might get executed before other C<ev_check> watchers did their job. As |
2911 | C<ev_check> watchers are often used to embed other (non-libev) event |
2949 | C<ev_check> watchers are often used to embed other (non-libev) event |
2912 | loops those other event loops might be in an unusable state until their |
2950 | loops those other event loops might be in an unusable state until their |
2913 | C<ev_check> watcher ran (always remind yourself to coexist peacefully with |
2951 | C<ev_check> watcher ran (always remind yourself to coexist peacefully with |
2914 | others). |
2952 | others). |
|
|
2953 | |
|
|
2954 | =head3 Abusing an C<ev_check> watcher for its side-effect |
|
|
2955 | |
|
|
2956 | C<ev_check> (and less often also C<ev_prepare>) watchers can also be |
|
|
2957 | useful because they are called once per event loop iteration. For |
|
|
2958 | example, if you want to handle a large number of connections fairly, you |
|
|
2959 | normally only do a bit of work for each active connection, and if there |
|
|
2960 | is more work to do, you wait for the next event loop iteration, so other |
|
|
2961 | connections have a chance of making progress. |
|
|
2962 | |
|
|
2963 | Using an C<ev_check> watcher is almost enough: it will be called on the |
|
|
2964 | next event loop iteration. However, that isn't as soon as possible - |
|
|
2965 | without external events, your C<ev_check> watcher will not be invoked. |
|
|
2966 | |
|
|
2967 | |
|
|
2968 | This is where C<ev_idle> watchers come in handy - all you need is a |
|
|
2969 | single global idle watcher that is active as long as you have one active |
|
|
2970 | C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop |
|
|
2971 | will not sleep, and the C<ev_check> watcher makes sure a callback gets |
|
|
2972 | invoked. Neither watcher alone can do that. |
2915 | |
2973 | |
2916 | =head3 Watcher-Specific Functions and Data Members |
2974 | =head3 Watcher-Specific Functions and Data Members |
2917 | |
2975 | |
2918 | =over 4 |
2976 | =over 4 |
2919 | |
2977 | |
… | |
… | |
3300 | it by calling C<ev_async_send>, which is thread- and signal safe. |
3358 | it by calling C<ev_async_send>, which is thread- and signal safe. |
3301 | |
3359 | |
3302 | This functionality is very similar to C<ev_signal> watchers, as signals, |
3360 | This functionality is very similar to C<ev_signal> watchers, as signals, |
3303 | too, are asynchronous in nature, and signals, too, will be compressed |
3361 | too, are asynchronous in nature, and signals, too, will be compressed |
3304 | (i.e. the number of callback invocations may be less than the number of |
3362 | (i.e. the number of callback invocations may be less than the number of |
3305 | C<ev_async_sent> calls). In fact, you could use signal watchers as a kind |
3363 | C<ev_async_send> calls). In fact, you could use signal watchers as a kind |
3306 | of "global async watchers" by using a watcher on an otherwise unused |
3364 | of "global async watchers" by using a watcher on an otherwise unused |
3307 | signal, and C<ev_feed_signal> to signal this watcher from another thread, |
3365 | signal, and C<ev_feed_signal> to signal this watcher from another thread, |
3308 | even without knowing which loop owns the signal. |
3366 | even without knowing which loop owns the signal. |
3309 | |
3367 | |
3310 | =head3 Queueing |
3368 | =head3 Queueing |
… | |
… | |
3884 | |
3942 | |
3885 | =back |
3943 | =back |
3886 | |
3944 | |
3887 | =head1 C++ SUPPORT |
3945 | =head1 C++ SUPPORT |
3888 | |
3946 | |
|
|
3947 | =head2 C API |
|
|
3948 | |
|
|
3949 | The normal C API should work fine when used from C++: both ev.h and the |
|
|
3950 | libev sources can be compiled as C++. Therefore, code that uses the C API |
|
|
3951 | will work fine. |
|
|
3952 | |
|
|
3953 | Proper exception specifications might have to be added to callbacks passed |
|
|
3954 | to libev: exceptions may be thrown only from watcher callbacks, all |
|
|
3955 | other callbacks (allocator, syserr, loop acquire/release and periodioc |
|
|
3956 | reschedule callbacks) must not throw exceptions, and might need a C<throw |
|
|
3957 | ()> specification. If you have code that needs to be compiled as both C |
|
|
3958 | and C++ you can use the C<EV_THROW> macro for this: |
|
|
3959 | |
|
|
3960 | static void |
|
|
3961 | fatal_error (const char *msg) EV_THROW |
|
|
3962 | { |
|
|
3963 | perror (msg); |
|
|
3964 | abort (); |
|
|
3965 | } |
|
|
3966 | |
|
|
3967 | ... |
|
|
3968 | ev_set_syserr_cb (fatal_error); |
|
|
3969 | |
|
|
3970 | The only API functions that can currently throw exceptions are C<ev_run>, |
|
|
3971 | C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter |
|
|
3972 | because it runs cleanup watchers). |
|
|
3973 | |
|
|
3974 | Throwing exceptions in watcher callbacks is only supported if libev itself |
|
|
3975 | is compiled with a C++ compiler or your C and C++ environments allow |
|
|
3976 | throwing exceptions through C libraries (most do). |
|
|
3977 | |
|
|
3978 | =head2 C++ API |
|
|
3979 | |
3889 | Libev comes with some simplistic wrapper classes for C++ that mainly allow |
3980 | Libev comes with some simplistic wrapper classes for C++ that mainly allow |
3890 | you to use some convenience methods to start/stop watchers and also change |
3981 | you to use some convenience methods to start/stop watchers and also change |
3891 | the callback model to a model using method callbacks on objects. |
3982 | the callback model to a model using method callbacks on objects. |
3892 | |
3983 | |
3893 | To use it, |
3984 | To use it, |
… | |
… | |
3907 | Currently, functions, static and non-static member functions and classes |
3998 | Currently, functions, static and non-static member functions and classes |
3908 | with C<operator ()> can be used as callbacks. Other types should be easy |
3999 | with C<operator ()> can be used as callbacks. Other types should be easy |
3909 | to add as long as they only need one additional pointer for context. If |
4000 | to add as long as they only need one additional pointer for context. If |
3910 | you need support for other types of functors please contact the author |
4001 | you need support for other types of functors please contact the author |
3911 | (preferably after implementing it). |
4002 | (preferably after implementing it). |
|
|
4003 | |
|
|
4004 | For all this to work, your C++ compiler either has to use the same calling |
|
|
4005 | conventions as your C compiler (for static member functions), or you have |
|
|
4006 | to embed libev and compile libev itself as C++. |
3912 | |
4007 | |
3913 | Here is a list of things available in the C<ev> namespace: |
4008 | Here is a list of things available in the C<ev> namespace: |
3914 | |
4009 | |
3915 | =over 4 |
4010 | =over 4 |
3916 | |
4011 | |
… | |
… | |
4495 | If defined to be C<1>, libev will compile in support for the Linux inotify |
4590 | If defined to be C<1>, libev will compile in support for the Linux inotify |
4496 | interface to speed up C<ev_stat> watchers. Its actual availability will |
4591 | interface to speed up C<ev_stat> watchers. Its actual availability will |
4497 | be detected at runtime. If undefined, it will be enabled if the headers |
4592 | be detected at runtime. If undefined, it will be enabled if the headers |
4498 | indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
4593 | indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. |
4499 | |
4594 | |
|
|
4595 | =item EV_NO_SMP |
|
|
4596 | |
|
|
4597 | If defined to be C<1>, libev will assume that memory is always coherent |
|
|
4598 | between threads, that is, threads can be used, but threads never run on |
|
|
4599 | different cpus (or different cpu cores). This reduces dependencies |
|
|
4600 | and makes libev faster. |
|
|
4601 | |
|
|
4602 | =item EV_NO_THREADS |
|
|
4603 | |
|
|
4604 | If defined to be C<1>, libev will assume that it will never be called |
|
|
4605 | from different threads, which is a stronger assumption than C<EV_NO_SMP>, |
|
|
4606 | above. This reduces dependencies and makes libev faster. |
|
|
4607 | |
4500 | =item EV_ATOMIC_T |
4608 | =item EV_ATOMIC_T |
4501 | |
4609 | |
4502 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4610 | Libev requires an integer type (suitable for storing C<0> or C<1>) whose |
4503 | access is atomic and serialised with respect to other threads or signal |
4611 | access is atomic and serialised with respect to other threads or signal |
4504 | contexts. No such type is easily found in the C language, so you can |
4612 | contexts. No such type is easily found in the C language, so you can |
… | |
… | |
4590 | #define EV_USE_POLL 1 |
4698 | #define EV_USE_POLL 1 |
4591 | #define EV_CHILD_ENABLE 1 |
4699 | #define EV_CHILD_ENABLE 1 |
4592 | #define EV_ASYNC_ENABLE 1 |
4700 | #define EV_ASYNC_ENABLE 1 |
4593 | |
4701 | |
4594 | The actual value is a bitset, it can be a combination of the following |
4702 | The actual value is a bitset, it can be a combination of the following |
4595 | values: |
4703 | values (by default, all of these are enabled): |
4596 | |
4704 | |
4597 | =over 4 |
4705 | =over 4 |
4598 | |
4706 | |
4599 | =item C<1> - faster/larger code |
4707 | =item C<1> - faster/larger code |
4600 | |
4708 | |
… | |
… | |
4604 | code size by roughly 30% on amd64). |
4712 | code size by roughly 30% on amd64). |
4605 | |
4713 | |
4606 | When optimising for size, use of compiler flags such as C<-Os> with |
4714 | When optimising for size, use of compiler flags such as C<-Os> with |
4607 | gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of |
4715 | gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of |
4608 | assertions. |
4716 | assertions. |
|
|
4717 | |
|
|
4718 | The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler |
|
|
4719 | (e.g. gcc with C<-Os>). |
4609 | |
4720 | |
4610 | =item C<2> - faster/larger data structures |
4721 | =item C<2> - faster/larger data structures |
4611 | |
4722 | |
4612 | Replaces the small 2-heap for timer management by a faster 4-heap, larger |
4723 | Replaces the small 2-heap for timer management by a faster 4-heap, larger |
4613 | hash table sizes and so on. This will usually further increase code size |
4724 | hash table sizes and so on. This will usually further increase code size |
4614 | and can additionally have an effect on the size of data structures at |
4725 | and can additionally have an effect on the size of data structures at |
4615 | runtime. |
4726 | runtime. |
|
|
4727 | |
|
|
4728 | The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler |
|
|
4729 | (e.g. gcc with C<-Os>). |
4616 | |
4730 | |
4617 | =item C<4> - full API configuration |
4731 | =item C<4> - full API configuration |
4618 | |
4732 | |
4619 | This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and |
4733 | This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and |
4620 | enables multiplicity (C<EV_MULTIPLICITY>=1). |
4734 | enables multiplicity (C<EV_MULTIPLICITY>=1). |