ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.pod
(Generate patch)

Comparing libev/ev.pod (file contents):
Revision 1.399 by root, Mon Apr 2 23:14:41 2012 UTC vs.
Revision 1.432 by root, Sat Apr 26 14:28:48 2014 UTC

1=encoding utf-8
2
1=head1 NAME 3=head1 NAME
2 4
3libev - a high performance full-featured event loop written in C 5libev - a high performance full-featured event loop written in C
4 6
5=head1 SYNOPSIS 7=head1 SYNOPSIS
82 84
83=head1 WHAT TO READ WHEN IN A HURRY 85=head1 WHAT TO READ WHEN IN A HURRY
84 86
85This manual tries to be very detailed, but unfortunately, this also makes 87This manual tries to be very detailed, but unfortunately, this also makes
86it very long. If you just want to know the basics of libev, I suggest 88it very long. If you just want to know the basics of libev, I suggest
87reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and 89reading L</ANATOMY OF A WATCHER>, then the L</EXAMPLE PROGRAM> above and
88look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and 90look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and
89C<ev_timer> sections in L<WATCHER TYPES>. 91C<ev_timer> sections in L</WATCHER TYPES>.
90 92
91=head1 ABOUT LIBEV 93=head1 ABOUT LIBEV
92 94
93Libev is an event loop: you register interest in certain events (such as a 95Libev is an event loop: you register interest in certain events (such as a
94file descriptor being readable or a timeout occurring), and it will manage 96file descriptor being readable or a timeout occurring), and it will manage
247the current system, you would need to look at C<ev_embeddable_backends () 249the current system, you would need to look at C<ev_embeddable_backends ()
248& ev_supported_backends ()>, likewise for recommended ones. 250& ev_supported_backends ()>, likewise for recommended ones.
249 251
250See the description of C<ev_embed> watchers for more info. 252See the description of C<ev_embed> watchers for more info.
251 253
252=item ev_set_allocator (void *(*cb)(void *ptr, long size)) 254=item ev_set_allocator (void *(*cb)(void *ptr, long size) throw ())
253 255
254Sets the allocation function to use (the prototype is similar - the 256Sets the allocation function to use (the prototype is similar - the
255semantics are identical to the C<realloc> C89/SuS/POSIX function). It is 257semantics are identical to the C<realloc> C89/SuS/POSIX function). It is
256used to allocate and free memory (no surprises here). If it returns zero 258used to allocate and free memory (no surprises here). If it returns zero
257when memory needs to be allocated (C<size != 0>), the library might abort 259when memory needs to be allocated (C<size != 0>), the library might abort
283 } 285 }
284 286
285 ... 287 ...
286 ev_set_allocator (persistent_realloc); 288 ev_set_allocator (persistent_realloc);
287 289
288=item ev_set_syserr_cb (void (*cb)(const char *msg)) 290=item ev_set_syserr_cb (void (*cb)(const char *msg) throw ())
289 291
290Set the callback function to call on a retryable system call error (such 292Set the callback function to call on a retryable system call error (such
291as failed select, poll, epoll_wait). The message is a printable string 293as failed select, poll, epoll_wait). The message is a printable string
292indicating the system call or subsystem causing the problem. If this 294indicating the system call or subsystem causing the problem. If this
293callback is set, then libev will expect it to remedy the situation, no 295callback is set, then libev will expect it to remedy the situation, no
396 398
397If this flag bit is or'ed into the flag value (or the program runs setuid 399If this flag bit is or'ed into the flag value (or the program runs setuid
398or setgid) then libev will I<not> look at the environment variable 400or setgid) then libev will I<not> look at the environment variable
399C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 401C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
400override the flags completely if it is found in the environment. This is 402override the flags completely if it is found in the environment. This is
401useful to try out specific backends to test their performance, or to work 403useful to try out specific backends to test their performance, to work
402around bugs. 404around bugs, or to make libev threadsafe (accessing environment variables
405cannot be done in a threadsafe way, but usually it works if no other
406thread modifies them).
403 407
404=item C<EVFLAG_FORKCHECK> 408=item C<EVFLAG_FORKCHECK>
405 409
406Instead of calling C<ev_loop_fork> manually after a fork, you can also 410Instead of calling C<ev_loop_fork> manually after a fork, you can also
407make libev check for a fork in each iteration by enabling this flag. 411make libev check for a fork in each iteration by enabling this flag.
569kernel is more efficient (which says nothing about its actual speed, of 573kernel is more efficient (which says nothing about its actual speed, of
570course). While stopping, setting and starting an I/O watcher does never 574course). While stopping, setting and starting an I/O watcher does never
571cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to 575cause an extra system call as with C<EVBACKEND_EPOLL>, it still adds up to
572two event changes per incident. Support for C<fork ()> is very bad (you 576two event changes per incident. Support for C<fork ()> is very bad (you
573might have to leak fd's on fork, but it's more sane than epoll) and it 577might have to leak fd's on fork, but it's more sane than epoll) and it
574drops fds silently in similarly hard-to-detect cases 578drops fds silently in similarly hard-to-detect cases.
575 579
576This backend usually performs well under most conditions. 580This backend usually performs well under most conditions.
577 581
578While nominally embeddable in other event loops, this doesn't work 582While nominally embeddable in other event loops, this doesn't work
579everywhere, so you might need to test for this. And since it is broken 583everywhere, so you might need to test for this. And since it is broken
684reinitialise the kernel state for backends that have one. Despite the 688reinitialise the kernel state for backends that have one. Despite the
685name, you can call it anytime, but it makes most sense after forking, in 689name, you can call it anytime, but it makes most sense after forking, in
686the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the 690the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
687child before resuming or calling C<ev_run>. 691child before resuming or calling C<ev_run>.
688 692
689Again, you I<have> to call it on I<any> loop that you want to re-use after 693Again, you I<have> to call it on I<any> loop that you want to re-use after
690a fork, I<even if you do not plan to use the loop in the parent>. This is 694a fork, I<even if you do not plan to use the loop in the parent>. This is
691because some kernel interfaces *cough* I<kqueue> *cough* do funny things 695because some kernel interfaces *cough* I<kqueue> *cough* do funny things
692during fork. 696during fork.
693 697
694On the other hand, you only need to call this function in the child 698On the other hand, you only need to call this function in the child
764 768
765This function is rarely useful, but when some event callback runs for a 769This function is rarely useful, but when some event callback runs for a
766very long time without entering the event loop, updating libev's idea of 770very long time without entering the event loop, updating libev's idea of
767the current time is a good idea. 771the current time is a good idea.
768 772
769See also L<The special problem of time updates> in the C<ev_timer> section. 773See also L</The special problem of time updates> in the C<ev_timer> section.
770 774
771=item ev_suspend (loop) 775=item ev_suspend (loop)
772 776
773=item ev_resume (loop) 777=item ev_resume (loop)
774 778
1016invoke the actual watchers inside another context (another thread etc.). 1020invoke the actual watchers inside another context (another thread etc.).
1017 1021
1018If you want to reset the callback, use C<ev_invoke_pending> as new 1022If you want to reset the callback, use C<ev_invoke_pending> as new
1019callback. 1023callback.
1020 1024
1021=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P)) 1025=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
1022 1026
1023Sometimes you want to share the same loop between multiple threads. This 1027Sometimes you want to share the same loop between multiple threads. This
1024can be done relatively simply by putting mutex_lock/unlock calls around 1028can be done relatively simply by putting mutex_lock/unlock calls around
1025each call to a libev function. 1029each call to a libev function.
1026 1030
1174 1178
1175=item C<EV_PREPARE> 1179=item C<EV_PREPARE>
1176 1180
1177=item C<EV_CHECK> 1181=item C<EV_CHECK>
1178 1182
1179All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts 1183All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1180to gather new events, and all C<ev_check> watchers are invoked just after 1184gather new events, and all C<ev_check> watchers are queued (not invoked)
1181C<ev_run> has gathered them, but before it invokes any callbacks for any 1185just after C<ev_run> has gathered them, but before it queues any callbacks
1186for any received events. That means C<ev_prepare> watchers are the last
1187watchers invoked before the event loop sleeps or polls for new events, and
1188C<ev_check> watchers will be invoked before any other watchers of the same
1189or lower priority within an event loop iteration.
1190
1182received events. Callbacks of both watcher types can start and stop as 1191Callbacks of both watcher types can start and stop as many watchers as
1183many watchers as they want, and all of them will be taken into account 1192they want, and all of them will be taken into account (for example, a
1184(for example, a C<ev_prepare> watcher might start an idle watcher to keep 1193C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1185C<ev_run> from blocking). 1194blocking).
1186 1195
1187=item C<EV_EMBED> 1196=item C<EV_EMBED>
1188 1197
1189The embedded event loop specified in the C<ev_embed> watcher needs attention. 1198The embedded event loop specified in the C<ev_embed> watcher needs attention.
1190 1199
1313 1322
1314=item callback ev_cb (ev_TYPE *watcher) 1323=item callback ev_cb (ev_TYPE *watcher)
1315 1324
1316Returns the callback currently set on the watcher. 1325Returns the callback currently set on the watcher.
1317 1326
1318=item ev_cb_set (ev_TYPE *watcher, callback) 1327=item ev_set_cb (ev_TYPE *watcher, callback)
1319 1328
1320Change the callback. You can change the callback at virtually any time 1329Change the callback. You can change the callback at virtually any time
1321(modulo threads). 1330(modulo threads).
1322 1331
1323=item ev_set_priority (ev_TYPE *watcher, int priority) 1332=item ev_set_priority (ev_TYPE *watcher, int priority)
1341or might not have been clamped to the valid range. 1350or might not have been clamped to the valid range.
1342 1351
1343The default priority used by watchers when no priority has been set is 1352The default priority used by watchers when no priority has been set is
1344always C<0>, which is supposed to not be too high and not be too low :). 1353always C<0>, which is supposed to not be too high and not be too low :).
1345 1354
1346See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of 1355See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1347priorities. 1356priorities.
1348 1357
1349=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1358=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1350 1359
1351Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1360Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1376See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1385See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1377functions that do not need a watcher. 1386functions that do not need a watcher.
1378 1387
1379=back 1388=back
1380 1389
1381See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR 1390See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1382OWN COMPOSITE WATCHERS> idioms. 1391OWN COMPOSITE WATCHERS> idioms.
1383 1392
1384=head2 WATCHER STATES 1393=head2 WATCHER STATES
1385 1394
1386There are various watcher states mentioned throughout this manual - 1395There are various watcher states mentioned throughout this manual -
1388transition between them will be described in more detail - and while these 1397transition between them will be described in more detail - and while these
1389rules might look complicated, they usually do "the right thing". 1398rules might look complicated, they usually do "the right thing".
1390 1399
1391=over 4 1400=over 4
1392 1401
1393=item initialiased 1402=item initialised
1394 1403
1395Before a watcher can be registered with the event loop it has to be 1404Before a watcher can be registered with the event loop it has to be
1396initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1405initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1397C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1406C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1398 1407
1874 callback (EV_P_ ev_timer *w, int revents) 1883 callback (EV_P_ ev_timer *w, int revents)
1875 { 1884 {
1876 // calculate when the timeout would happen 1885 // calculate when the timeout would happen
1877 ev_tstamp after = last_activity - ev_now (EV_A) + timeout; 1886 ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1878 1887
1879 // if negative, it means we the timeout already occured 1888 // if negative, it means we the timeout already occurred
1880 if (after < 0.) 1889 if (after < 0.)
1881 { 1890 {
1882 // timeout occurred, take action 1891 // timeout occurred, take action
1883 } 1892 }
1884 else 1893 else
1902 1911
1903Otherwise, we now the earliest time at which the timeout would trigger, 1912Otherwise, we now the earliest time at which the timeout would trigger,
1904and simply start the timer with this timeout value. 1913and simply start the timer with this timeout value.
1905 1914
1906In other words, each time the callback is invoked it will check whether 1915In other words, each time the callback is invoked it will check whether
1907the timeout cocured. If not, it will simply reschedule itself to check 1916the timeout occurred. If not, it will simply reschedule itself to check
1908again at the earliest time it could time out. Rinse. Repeat. 1917again at the earliest time it could time out. Rinse. Repeat.
1909 1918
1910This scheme causes more callback invocations (about one every 60 seconds 1919This scheme causes more callback invocations (about one every 60 seconds
1911minus half the average time between activity), but virtually no calls to 1920minus half the average time between activity), but virtually no calls to
1912libev to change the timeout. 1921libev to change the timeout.
1926 if (activity detected) 1935 if (activity detected)
1927 last_activity = ev_now (EV_A); 1936 last_activity = ev_now (EV_A);
1928 1937
1929When your timeout value changes, then the timeout can be changed by simply 1938When your timeout value changes, then the timeout can be changed by simply
1930providing a new value, stopping the timer and calling the callback, which 1939providing a new value, stopping the timer and calling the callback, which
1931will agaion do the right thing (for example, time out immediately :). 1940will again do the right thing (for example, time out immediately :).
1932 1941
1933 timeout = new_value; 1942 timeout = new_value;
1934 ev_timer_stop (EV_A_ &timer); 1943 ev_timer_stop (EV_A_ &timer);
1935 callback (EV_A_ &timer, 0); 1944 callback (EV_A_ &timer, 0);
1936 1945
2131=item If the timer is repeating, make the C<repeat> value the new timeout 2140=item If the timer is repeating, make the C<repeat> value the new timeout
2132and start the timer, if necessary. 2141and start the timer, if necessary.
2133 2142
2134=back 2143=back
2135 2144
2136This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2145This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2137usage example. 2146usage example.
2138 2147
2139=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2148=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2140 2149
2141Returns the remaining time until a timer fires. If the timer is active, 2150Returns the remaining time until a timer fires. If the timer is active,
2384 2393
2385 ev_periodic hourly_tick; 2394 ev_periodic hourly_tick;
2386 ev_periodic_init (&hourly_tick, clock_cb, 2395 ev_periodic_init (&hourly_tick, clock_cb,
2387 fmod (ev_now (loop), 3600.), 3600., 0); 2396 fmod (ev_now (loop), 3600.), 3600., 0);
2388 ev_periodic_start (loop, &hourly_tick); 2397 ev_periodic_start (loop, &hourly_tick);
2389 2398
2390 2399
2391=head2 C<ev_signal> - signal me when a signal gets signalled! 2400=head2 C<ev_signal> - signal me when a signal gets signalled!
2392 2401
2393Signal watchers will trigger an event when the process receives a specific 2402Signal watchers will trigger an event when the process receives a specific
2394signal one or more times. Even though signals are very asynchronous, libev 2403signal one or more times. Even though signals are very asynchronous, libev
2404only within the same loop, i.e. you can watch for C<SIGINT> in your 2413only within the same loop, i.e. you can watch for C<SIGINT> in your
2405default loop and for C<SIGIO> in another loop, but you cannot watch for 2414default loop and for C<SIGIO> in another loop, but you cannot watch for
2406C<SIGINT> in both the default loop and another loop at the same time. At 2415C<SIGINT> in both the default loop and another loop at the same time. At
2407the moment, C<SIGCHLD> is permanently tied to the default loop. 2416the moment, C<SIGCHLD> is permanently tied to the default loop.
2408 2417
2409When the first watcher gets started will libev actually register something 2418Only after the first watcher for a signal is started will libev actually
2410with the kernel (thus it coexists with your own signal handlers as long as 2419register something with the kernel. It thus coexists with your own signal
2411you don't register any with libev for the same signal). 2420handlers as long as you don't register any with libev for the same signal.
2412 2421
2413If possible and supported, libev will install its handlers with 2422If possible and supported, libev will install its handlers with
2414C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should 2423C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2415not be unduly interrupted. If you have a problem with system calls getting 2424not be unduly interrupted. If you have a problem with system calls getting
2416interrupted by signals you can block all signals in an C<ev_check> watcher 2425interrupted by signals you can block all signals in an C<ev_check> watcher
2601 2610
2602=head2 C<ev_stat> - did the file attributes just change? 2611=head2 C<ev_stat> - did the file attributes just change?
2603 2612
2604This watches a file system path for attribute changes. That is, it calls 2613This watches a file system path for attribute changes. That is, it calls
2605C<stat> on that path in regular intervals (or when the OS says it changed) 2614C<stat> on that path in regular intervals (or when the OS says it changed)
2606and sees if it changed compared to the last time, invoking the callback if 2615and sees if it changed compared to the last time, invoking the callback
2607it did. 2616if it did. Starting the watcher C<stat>'s the file, so only changes that
2617happen after the watcher has been started will be reported.
2608 2618
2609The path does not need to exist: changing from "path exists" to "path does 2619The path does not need to exist: changing from "path exists" to "path does
2610not exist" is a status change like any other. The condition "path does not 2620not exist" is a status change like any other. The condition "path does not
2611exist" (or more correctly "path cannot be stat'ed") is signified by the 2621exist" (or more correctly "path cannot be stat'ed") is signified by the
2612C<st_nlink> field being zero (which is otherwise always forced to be at 2622C<st_nlink> field being zero (which is otherwise always forced to be at
2842Apart from keeping your process non-blocking (which is a useful 2852Apart from keeping your process non-blocking (which is a useful
2843effect on its own sometimes), idle watchers are a good place to do 2853effect on its own sometimes), idle watchers are a good place to do
2844"pseudo-background processing", or delay processing stuff to after the 2854"pseudo-background processing", or delay processing stuff to after the
2845event loop has handled all outstanding events. 2855event loop has handled all outstanding events.
2846 2856
2857=head3 Abusing an C<ev_idle> watcher for its side-effect
2858
2859As long as there is at least one active idle watcher, libev will never
2860sleep unnecessarily. Or in other words, it will loop as fast as possible.
2861For this to work, the idle watcher doesn't need to be invoked at all - the
2862lowest priority will do.
2863
2864This mode of operation can be useful together with an C<ev_check> watcher,
2865to do something on each event loop iteration - for example to balance load
2866between different connections.
2867
2868See L</Abusing an ev_check watcher for its side-effect> for a longer
2869example.
2870
2847=head3 Watcher-Specific Functions and Data Members 2871=head3 Watcher-Specific Functions and Data Members
2848 2872
2849=over 4 2873=over 4
2850 2874
2851=item ev_idle_init (ev_idle *, callback) 2875=item ev_idle_init (ev_idle *, callback)
2862callback, free it. Also, use no error checking, as usual. 2886callback, free it. Also, use no error checking, as usual.
2863 2887
2864 static void 2888 static void
2865 idle_cb (struct ev_loop *loop, ev_idle *w, int revents) 2889 idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2866 { 2890 {
2891 // stop the watcher
2892 ev_idle_stop (loop, w);
2893
2894 // now we can free it
2867 free (w); 2895 free (w);
2896
2868 // now do something you wanted to do when the program has 2897 // now do something you wanted to do when the program has
2869 // no longer anything immediate to do. 2898 // no longer anything immediate to do.
2870 } 2899 }
2871 2900
2872 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2901 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2874 ev_idle_start (loop, idle_watcher); 2903 ev_idle_start (loop, idle_watcher);
2875 2904
2876 2905
2877=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2906=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2878 2907
2879Prepare and check watchers are usually (but not always) used in pairs: 2908Prepare and check watchers are often (but not always) used in pairs:
2880prepare watchers get invoked before the process blocks and check watchers 2909prepare watchers get invoked before the process blocks and check watchers
2881afterwards. 2910afterwards.
2882 2911
2883You I<must not> call C<ev_run> or similar functions that enter 2912You I<must not> call C<ev_run> or similar functions that enter
2884the current event loop from either C<ev_prepare> or C<ev_check> 2913the current event loop from either C<ev_prepare> or C<ev_check>
2912with priority higher than or equal to the event loop and one coroutine 2941with priority higher than or equal to the event loop and one coroutine
2913of lower priority, but only once, using idle watchers to keep the event 2942of lower priority, but only once, using idle watchers to keep the event
2914loop from blocking if lower-priority coroutines are active, thus mapping 2943loop from blocking if lower-priority coroutines are active, thus mapping
2915low-priority coroutines to idle/background tasks). 2944low-priority coroutines to idle/background tasks).
2916 2945
2917It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 2946When used for this purpose, it is recommended to give C<ev_check> watchers
2918priority, to ensure that they are being run before any other watchers 2947highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2919after the poll (this doesn't matter for C<ev_prepare> watchers). 2948any other watchers after the poll (this doesn't matter for C<ev_prepare>
2949watchers).
2920 2950
2921Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not 2951Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2922activate ("feed") events into libev. While libev fully supports this, they 2952activate ("feed") events into libev. While libev fully supports this, they
2923might get executed before other C<ev_check> watchers did their job. As 2953might get executed before other C<ev_check> watchers did their job. As
2924C<ev_check> watchers are often used to embed other (non-libev) event 2954C<ev_check> watchers are often used to embed other (non-libev) event
2925loops those other event loops might be in an unusable state until their 2955loops those other event loops might be in an unusable state until their
2926C<ev_check> watcher ran (always remind yourself to coexist peacefully with 2956C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2927others). 2957others).
2958
2959=head3 Abusing an C<ev_check> watcher for its side-effect
2960
2961C<ev_check> (and less often also C<ev_prepare>) watchers can also be
2962useful because they are called once per event loop iteration. For
2963example, if you want to handle a large number of connections fairly, you
2964normally only do a bit of work for each active connection, and if there
2965is more work to do, you wait for the next event loop iteration, so other
2966connections have a chance of making progress.
2967
2968Using an C<ev_check> watcher is almost enough: it will be called on the
2969next event loop iteration. However, that isn't as soon as possible -
2970without external events, your C<ev_check> watcher will not be invoked.
2971
2972This is where C<ev_idle> watchers come in handy - all you need is a
2973single global idle watcher that is active as long as you have one active
2974C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
2975will not sleep, and the C<ev_check> watcher makes sure a callback gets
2976invoked. Neither watcher alone can do that.
2928 2977
2929=head3 Watcher-Specific Functions and Data Members 2978=head3 Watcher-Specific Functions and Data Members
2930 2979
2931=over 4 2980=over 4
2932 2981
3133 3182
3134=over 4 3183=over 4
3135 3184
3136=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3185=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3137 3186
3138=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3187=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3139 3188
3140Configures the watcher to embed the given loop, which must be 3189Configures the watcher to embed the given loop, which must be
3141embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3190embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3142invoked automatically, otherwise it is the responsibility of the callback 3191invoked automatically, otherwise it is the responsibility of the callback
3143to invoke it (it will continue to be called until the sweep has been done, 3192to invoke it (it will continue to be called until the sweep has been done,
3164used). 3213used).
3165 3214
3166 struct ev_loop *loop_hi = ev_default_init (0); 3215 struct ev_loop *loop_hi = ev_default_init (0);
3167 struct ev_loop *loop_lo = 0; 3216 struct ev_loop *loop_lo = 0;
3168 ev_embed embed; 3217 ev_embed embed;
3169 3218
3170 // see if there is a chance of getting one that works 3219 // see if there is a chance of getting one that works
3171 // (remember that a flags value of 0 means autodetection) 3220 // (remember that a flags value of 0 means autodetection)
3172 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 3221 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3173 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 3222 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3174 : 0; 3223 : 0;
3188C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 3237C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3189 3238
3190 struct ev_loop *loop = ev_default_init (0); 3239 struct ev_loop *loop = ev_default_init (0);
3191 struct ev_loop *loop_socket = 0; 3240 struct ev_loop *loop_socket = 0;
3192 ev_embed embed; 3241 ev_embed embed;
3193 3242
3194 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 3243 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3195 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 3244 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3196 { 3245 {
3197 ev_embed_init (&embed, 0, loop_socket); 3246 ev_embed_init (&embed, 0, loop_socket);
3198 ev_embed_start (loop, &embed); 3247 ev_embed_start (loop, &embed);
3206 3255
3207=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3256=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3208 3257
3209Fork watchers are called when a C<fork ()> was detected (usually because 3258Fork watchers are called when a C<fork ()> was detected (usually because
3210whoever is a good citizen cared to tell libev about it by calling 3259whoever is a good citizen cared to tell libev about it by calling
3211C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the 3260C<ev_loop_fork>). The invocation is done before the event loop blocks next
3212event loop blocks next and before C<ev_check> watchers are being called, 3261and before C<ev_check> watchers are being called, and only in the child
3213and only in the child after the fork. If whoever good citizen calling 3262after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3214C<ev_default_fork> cheats and calls it in the wrong process, the fork 3263and calls it in the wrong process, the fork handlers will be invoked, too,
3215handlers will be invoked, too, of course. 3264of course.
3216 3265
3217=head3 The special problem of life after fork - how is it possible? 3266=head3 The special problem of life after fork - how is it possible?
3218 3267
3219Most uses of C<fork()> consist of forking, then some simple calls to set 3268Most uses of C<fork()> consist of forking, then some simple calls to set
3220up/change the process environment, followed by a call to C<exec()>. This 3269up/change the process environment, followed by a call to C<exec()>. This
3313it by calling C<ev_async_send>, which is thread- and signal safe. 3362it by calling C<ev_async_send>, which is thread- and signal safe.
3314 3363
3315This functionality is very similar to C<ev_signal> watchers, as signals, 3364This functionality is very similar to C<ev_signal> watchers, as signals,
3316too, are asynchronous in nature, and signals, too, will be compressed 3365too, are asynchronous in nature, and signals, too, will be compressed
3317(i.e. the number of callback invocations may be less than the number of 3366(i.e. the number of callback invocations may be less than the number of
3318C<ev_async_sent> calls). In fact, you could use signal watchers as a kind 3367C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3319of "global async watchers" by using a watcher on an otherwise unused 3368of "global async watchers" by using a watcher on an otherwise unused
3320signal, and C<ev_feed_signal> to signal this watcher from another thread, 3369signal, and C<ev_feed_signal> to signal this watcher from another thread,
3321even without knowing which loop owns the signal. 3370even without knowing which loop owns the signal.
3322 3371
3323=head3 Queueing 3372=head3 Queueing
3614already been invoked. 3663already been invoked.
3615 3664
3616A common way around all these issues is to make sure that 3665A common way around all these issues is to make sure that
3617C<start_new_request> I<always> returns before the callback is invoked. If 3666C<start_new_request> I<always> returns before the callback is invoked. If
3618C<start_new_request> immediately knows the result, it can artificially 3667C<start_new_request> immediately knows the result, it can artificially
3619delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher 3668delay invoking the callback by using a C<prepare> or C<idle> watcher for
3620for example, or more sneakily, by reusing an existing (stopped) watcher 3669example, or more sneakily, by reusing an existing (stopped) watcher and
3621and pushing it into the pending queue: 3670pushing it into the pending queue:
3622 3671
3623 ev_set_cb (watcher, callback); 3672 ev_set_cb (watcher, callback);
3624 ev_feed_event (EV_A_ watcher, 0); 3673 ev_feed_event (EV_A_ watcher, 0);
3625 3674
3626This way, C<start_new_request> can safely return before the callback is 3675This way, C<start_new_request> can safely return before the callback is
3634 3683
3635This brings the problem of exiting - a callback might want to finish the 3684This brings the problem of exiting - a callback might want to finish the
3636main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but 3685main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3637a modal "Are you sure?" dialog is still waiting), or just the nested one 3686a modal "Are you sure?" dialog is still waiting), or just the nested one
3638and not the main one (e.g. user clocked "Ok" in a modal dialog), or some 3687and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3639other combination: In these cases, C<ev_break> will not work alone. 3688other combination: In these cases, a simple C<ev_break> will not work.
3640 3689
3641The solution is to maintain "break this loop" variable for each C<ev_run> 3690The solution is to maintain "break this loop" variable for each C<ev_run>
3642invocation, and use a loop around C<ev_run> until the condition is 3691invocation, and use a loop around C<ev_run> until the condition is
3643triggered, using C<EVRUN_ONCE>: 3692triggered, using C<EVRUN_ONCE>:
3644 3693
3830called): 3879called):
3831 3880
3832 void 3881 void
3833 wait_for_event (ev_watcher *w) 3882 wait_for_event (ev_watcher *w)
3834 { 3883 {
3835 ev_cb_set (w) = current_coro; 3884 ev_set_cb (w, current_coro);
3836 switch_to (libev_coro); 3885 switch_to (libev_coro);
3837 } 3886 }
3838 3887
3839That basically suspends the coroutine inside C<wait_for_event> and 3888That basically suspends the coroutine inside C<wait_for_event> and
3840continues the libev coroutine, which, when appropriate, switches back to 3889continues the libev coroutine, which, when appropriate, switches back to
3843You can do similar tricks if you have, say, threads with an event queue - 3892You can do similar tricks if you have, say, threads with an event queue -
3844instead of storing a coroutine, you store the queue object and instead of 3893instead of storing a coroutine, you store the queue object and instead of
3845switching to a coroutine, you push the watcher onto the queue and notify 3894switching to a coroutine, you push the watcher onto the queue and notify
3846any waiters. 3895any waiters.
3847 3896
3848To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two 3897To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
3849files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: 3898files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3850 3899
3851 // my_ev.h 3900 // my_ev.h
3852 #define EV_CB_DECLARE(type) struct my_coro *cb; 3901 #define EV_CB_DECLARE(type) struct my_coro *cb;
3853 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); 3902 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3897 3946
3898=back 3947=back
3899 3948
3900=head1 C++ SUPPORT 3949=head1 C++ SUPPORT
3901 3950
3951=head2 C API
3952
3953The normal C API should work fine when used from C++: both ev.h and the
3954libev sources can be compiled as C++. Therefore, code that uses the C API
3955will work fine.
3956
3957Proper exception specifications might have to be added to callbacks passed
3958to libev: exceptions may be thrown only from watcher callbacks, all
3959other callbacks (allocator, syserr, loop acquire/release and periodic
3960reschedule callbacks) must not throw exceptions, and might need a C<throw
3961()> specification. If you have code that needs to be compiled as both C
3962and C++ you can use the C<EV_THROW> macro for this:
3963
3964 static void
3965 fatal_error (const char *msg) EV_THROW
3966 {
3967 perror (msg);
3968 abort ();
3969 }
3970
3971 ...
3972 ev_set_syserr_cb (fatal_error);
3973
3974The only API functions that can currently throw exceptions are C<ev_run>,
3975C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
3976because it runs cleanup watchers).
3977
3978Throwing exceptions in watcher callbacks is only supported if libev itself
3979is compiled with a C++ compiler or your C and C++ environments allow
3980throwing exceptions through C libraries (most do).
3981
3982=head2 C++ API
3983
3902Libev comes with some simplistic wrapper classes for C++ that mainly allow 3984Libev comes with some simplistic wrapper classes for C++ that mainly allow
3903you to use some convenience methods to start/stop watchers and also change 3985you to use some convenience methods to start/stop watchers and also change
3904the callback model to a model using method callbacks on objects. 3986the callback model to a model using method callbacks on objects.
3905 3987
3906To use it, 3988To use it,
3907 3989
3908 #include <ev++.h> 3990 #include <ev++.h>
3909 3991
3910This automatically includes F<ev.h> and puts all of its definitions (many 3992This automatically includes F<ev.h> and puts all of its definitions (many
3911of them macros) into the global namespace. All C++ specific things are 3993of them macros) into the global namespace. All C++ specific things are
3912put into the C<ev> namespace. It should support all the same embedding 3994put into the C<ev> namespace. It should support all the same embedding
4015 void operator() (ev::io &w, int revents) 4097 void operator() (ev::io &w, int revents)
4016 { 4098 {
4017 ... 4099 ...
4018 } 4100 }
4019 } 4101 }
4020 4102
4021 myfunctor f; 4103 myfunctor f;
4022 4104
4023 ev::io w; 4105 ev::io w;
4024 w.set (&f); 4106 w.set (&f);
4025 4107
4043Associates a different C<struct ev_loop> with this watcher. You can only 4125Associates a different C<struct ev_loop> with this watcher. You can only
4044do this when the watcher is inactive (and not pending either). 4126do this when the watcher is inactive (and not pending either).
4045 4127
4046=item w->set ([arguments]) 4128=item w->set ([arguments])
4047 4129
4048Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4130Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
4049method or a suitable start method must be called at least once. Unlike the 4131with the same arguments. Either this method or a suitable start method
4050C counterpart, an active watcher gets automatically stopped and restarted 4132must be called at least once. Unlike the C counterpart, an active watcher
4051when reconfiguring it with this method. 4133gets automatically stopped and restarted when reconfiguring it with this
4134method.
4135
4136For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4137clashing with the C<set (loop)> method.
4052 4138
4053=item w->start () 4139=item w->start ()
4054 4140
4055Starts the watcher. Note that there is no C<loop> argument, as the 4141Starts the watcher. Note that there is no C<loop> argument, as the
4056constructor already stores the event loop. 4142constructor already stores the event loop.
4159=item Lua 4245=item Lua
4160 4246
4161Brian Maher has written a partial interface to libev for lua (at the 4247Brian Maher has written a partial interface to libev for lua (at the
4162time of this writing, only C<ev_io> and C<ev_timer>), to be found at 4248time of this writing, only C<ev_io> and C<ev_timer>), to be found at
4163L<http://github.com/brimworks/lua-ev>. 4249L<http://github.com/brimworks/lua-ev>.
4250
4251=item Javascript
4252
4253Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
4254
4255=item Others
4256
4257There are others, and I stopped counting.
4164 4258
4165=back 4259=back
4166 4260
4167 4261
4168=head1 MACRO MAGIC 4262=head1 MACRO MAGIC
4467 4561
4468If programs implement their own fd to handle mapping on win32, then this 4562If programs implement their own fd to handle mapping on win32, then this
4469macro can be used to override the C<close> function, useful to unregister 4563macro can be used to override the C<close> function, useful to unregister
4470file descriptors again. Note that the replacement function has to close 4564file descriptors again. Note that the replacement function has to close
4471the underlying OS handle. 4565the underlying OS handle.
4566
4567=item EV_USE_WSASOCKET
4568
4569If defined to be C<1>, libev will use C<WSASocket> to create its internal
4570communication socket, which works better in some environments. Otherwise,
4571the normal C<socket> function will be used, which works better in other
4572environments.
4472 4573
4473=item EV_USE_POLL 4574=item EV_USE_POLL
4474 4575
4475If defined to be C<1>, libev will compile in support for the C<poll>(2) 4576If defined to be C<1>, libev will compile in support for the C<poll>(2)
4476backend. Otherwise it will be enabled on non-win32 platforms. It 4577backend. Otherwise it will be enabled on non-win32 platforms. It
4521different cpus (or different cpu cores). This reduces dependencies 4622different cpus (or different cpu cores). This reduces dependencies
4522and makes libev faster. 4623and makes libev faster.
4523 4624
4524=item EV_NO_THREADS 4625=item EV_NO_THREADS
4525 4626
4526If defined to be C<1>, libev will assume that it will never be called 4627If defined to be C<1>, libev will assume that it will never be called from
4527from different threads, which is a stronger assumption than C<EV_NO_SMP>, 4628different threads (that includes signal handlers), which is a stronger
4528above. This reduces dependencies and makes libev faster. 4629assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4630libev faster.
4529 4631
4530=item EV_ATOMIC_T 4632=item EV_ATOMIC_T
4531 4633
4532Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4634Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4533access is atomic and serialised with respect to other threads or signal 4635access is atomic with respect to other threads or signal contexts. No
4534contexts. No such type is easily found in the C language, so you can 4636such type is easily found in the C language, so you can provide your own
4535provide your own type that you know is safe for your purposes. It is used 4637type that you know is safe for your purposes. It is used both for signal
4536both for signal handler "locking" as well as for signal and thread safety 4638handler "locking" as well as for signal and thread safety in C<ev_async>
4537in C<ev_async> watchers. 4639watchers.
4538 4640
4539In the absence of this define, libev will use C<sig_atomic_t volatile> 4641In the absence of this define, libev will use C<sig_atomic_t volatile>
4540(from F<signal.h>), which is usually good enough on most platforms, 4642(from F<signal.h>), which is usually good enough on most platforms.
4541although strictly speaking using a type that also implies a memory fence
4542is required.
4543 4643
4544=item EV_H (h) 4644=item EV_H (h)
4545 4645
4546The name of the F<ev.h> header file used to include it. The default if 4646The name of the F<ev.h> header file used to include it. The default if
4547undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4647undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
4620 #define EV_USE_POLL 1 4720 #define EV_USE_POLL 1
4621 #define EV_CHILD_ENABLE 1 4721 #define EV_CHILD_ENABLE 1
4622 #define EV_ASYNC_ENABLE 1 4722 #define EV_ASYNC_ENABLE 1
4623 4723
4624The actual value is a bitset, it can be a combination of the following 4724The actual value is a bitset, it can be a combination of the following
4625values: 4725values (by default, all of these are enabled):
4626 4726
4627=over 4 4727=over 4
4628 4728
4629=item C<1> - faster/larger code 4729=item C<1> - faster/larger code
4630 4730
4634code size by roughly 30% on amd64). 4734code size by roughly 30% on amd64).
4635 4735
4636When optimising for size, use of compiler flags such as C<-Os> with 4736When optimising for size, use of compiler flags such as C<-Os> with
4637gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of 4737gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4638assertions. 4738assertions.
4739
4740The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4741(e.g. gcc with C<-Os>).
4639 4742
4640=item C<2> - faster/larger data structures 4743=item C<2> - faster/larger data structures
4641 4744
4642Replaces the small 2-heap for timer management by a faster 4-heap, larger 4745Replaces the small 2-heap for timer management by a faster 4-heap, larger
4643hash table sizes and so on. This will usually further increase code size 4746hash table sizes and so on. This will usually further increase code size
4644and can additionally have an effect on the size of data structures at 4747and can additionally have an effect on the size of data structures at
4645runtime. 4748runtime.
4749
4750The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4751(e.g. gcc with C<-Os>).
4646 4752
4647=item C<4> - full API configuration 4753=item C<4> - full API configuration
4648 4754
4649This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and 4755This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4650enables multiplicity (C<EV_MULTIPLICITY>=1). 4756enables multiplicity (C<EV_MULTIPLICITY>=1).
4909default loop and triggering an C<ev_async> watcher from the default loop 5015default loop and triggering an C<ev_async> watcher from the default loop
4910watcher callback into the event loop interested in the signal. 5016watcher callback into the event loop interested in the signal.
4911 5017
4912=back 5018=back
4913 5019
4914See also L<THREAD LOCKING EXAMPLE>. 5020See also L</THREAD LOCKING EXAMPLE>.
4915 5021
4916=head3 COROUTINES 5022=head3 COROUTINES
4917 5023
4918Libev is very accommodating to coroutines ("cooperative threads"): 5024Libev is very accommodating to coroutines ("cooperative threads"):
4919libev fully supports nesting calls to its functions from different 5025libev fully supports nesting calls to its functions from different
5210thread" or will block signals process-wide, both behaviours would 5316thread" or will block signals process-wide, both behaviours would
5211be compatible with libev. Interaction between C<sigprocmask> and 5317be compatible with libev. Interaction between C<sigprocmask> and
5212C<pthread_sigmask> could complicate things, however. 5318C<pthread_sigmask> could complicate things, however.
5213 5319
5214The most portable way to handle signals is to block signals in all threads 5320The most portable way to handle signals is to block signals in all threads
5215except the initial one, and run the default loop in the initial thread as 5321except the initial one, and run the signal handling loop in the initial
5216well. 5322thread as well.
5217 5323
5218=item C<long> must be large enough for common memory allocation sizes 5324=item C<long> must be large enough for common memory allocation sizes
5219 5325
5220To improve portability and simplify its API, libev uses C<long> internally 5326To improve portability and simplify its API, libev uses C<long> internally
5221instead of C<size_t> when allocating its data structures. On non-POSIX 5327instead of C<size_t> when allocating its data structures. On non-POSIX
5325=over 4 5431=over 4
5326 5432
5327=item C<EV_COMPAT3> backwards compatibility mechanism 5433=item C<EV_COMPAT3> backwards compatibility mechanism
5328 5434
5329The backward compatibility mechanism can be controlled by 5435The backward compatibility mechanism can be controlled by
5330C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> 5436C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5331section. 5437section.
5332 5438
5333=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5439=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5334 5440
5335These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5441These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5378=over 4 5484=over 4
5379 5485
5380=item active 5486=item active
5381 5487
5382A watcher is active as long as it has been started and not yet stopped. 5488A watcher is active as long as it has been started and not yet stopped.
5383See L<WATCHER STATES> for details. 5489See L</WATCHER STATES> for details.
5384 5490
5385=item application 5491=item application
5386 5492
5387In this document, an application is whatever is using libev. 5493In this document, an application is whatever is using libev.
5388 5494
5424watchers and events. 5530watchers and events.
5425 5531
5426=item pending 5532=item pending
5427 5533
5428A watcher is pending as soon as the corresponding event has been 5534A watcher is pending as soon as the corresponding event has been
5429detected. See L<WATCHER STATES> for details. 5535detected. See L</WATCHER STATES> for details.
5430 5536
5431=item real time 5537=item real time
5432 5538
5433The physical time that is observed. It is apparently strictly monotonic :) 5539The physical time that is observed. It is apparently strictly monotonic :)
5434 5540

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines