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

Comparing libev/ev.pod (file contents):
Revision 1.388 by root, Tue Dec 20 04:08:35 2011 UTC vs.
Revision 1.434 by root, Tue May 6 13:24:39 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.
567 571
568It scales in the same way as the epoll backend, but the interface to the 572It scales in the same way as the epoll backend, but the interface to the
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 (but 576two event changes per incident. Support for C<fork ()> is very bad (you
573sane, unlike epoll) and it drops fds silently in similarly hard-to-detect 577might have to leak fd's on fork, but it's more sane than epoll) and it
574cases 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
678If you need dynamically allocated loops it is better to use C<ev_loop_new> 682If you need dynamically allocated loops it is better to use C<ev_loop_new>
679and C<ev_loop_destroy>. 683and C<ev_loop_destroy>.
680 684
681=item ev_loop_fork (loop) 685=item ev_loop_fork (loop)
682 686
683This function sets a flag that causes subsequent C<ev_run> iterations to 687This function sets a flag that causes subsequent C<ev_run> iterations
684reinitialise the kernel state for backends that have one. Despite the 688to reinitialise the kernel state for backends that have one. Despite
685name, you can call it anytime, but it makes most sense after forking, in 689the name, you can call it anytime you are allowed to start or stop
686the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the 690watchers (except inside an C<ev_prepare> callback), but it makes most
691sense after forking, in the child process. You I<must> call it (or use
687child before resuming or calling C<ev_run>. 692C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
688 693
689Again, you I<have> to call it on I<any> loop that you want to re-use after 694Again, 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 695a 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 696because some kernel interfaces *cough* I<kqueue> *cough* do funny things
692during fork. 697during fork.
693 698
694On the other hand, you only need to call this function in the child 699On the other hand, you only need to call this function in the child
764 769
765This function is rarely useful, but when some event callback runs for a 770This 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 771very long time without entering the event loop, updating libev's idea of
767the current time is a good idea. 772the current time is a good idea.
768 773
769See also L<The special problem of time updates> in the C<ev_timer> section. 774See also L</The special problem of time updates> in the C<ev_timer> section.
770 775
771=item ev_suspend (loop) 776=item ev_suspend (loop)
772 777
773=item ev_resume (loop) 778=item ev_resume (loop)
774 779
792without a previous call to C<ev_suspend>. 797without a previous call to C<ev_suspend>.
793 798
794Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the 799Calling C<ev_suspend>/C<ev_resume> has the side effect of updating the
795event loop time (see C<ev_now_update>). 800event loop time (see C<ev_now_update>).
796 801
797=item ev_run (loop, int flags) 802=item bool ev_run (loop, int flags)
798 803
799Finally, this is it, the event handler. This function usually is called 804Finally, this is it, the event handler. This function usually is called
800after you have initialised all your watchers and you want to start 805after you have initialised all your watchers and you want to start
801handling events. It will ask the operating system for any new events, call 806handling events. It will ask the operating system for any new events, call
802the watcher callbacks, an then repeat the whole process indefinitely: This 807the watcher callbacks, and then repeat the whole process indefinitely: This
803is why event loops are called I<loops>. 808is why event loops are called I<loops>.
804 809
805If the flags argument is specified as C<0>, it will keep handling events 810If the flags argument is specified as C<0>, it will keep handling events
806until either no event watchers are active anymore or C<ev_break> was 811until either no event watchers are active anymore or C<ev_break> was
807called. 812called.
813
814The return value is false if there are no more active watchers (which
815usually means "all jobs done" or "deadlock"), and true in all other cases
816(which usually means " you should call C<ev_run> again").
808 817
809Please note that an explicit C<ev_break> is usually better than 818Please note that an explicit C<ev_break> is usually better than
810relying on all watchers to be stopped when deciding when a program has 819relying on all watchers to be stopped when deciding when a program has
811finished (especially in interactive programs), but having a program 820finished (especially in interactive programs), but having a program
812that automatically loops as long as it has to and no longer by virtue 821that automatically loops as long as it has to and no longer by virtue
813of relying on its watchers stopping correctly, that is truly a thing of 822of relying on its watchers stopping correctly, that is truly a thing of
814beauty. 823beauty.
815 824
816This function is also I<mostly> exception-safe - you can break out of 825This function is I<mostly> exception-safe - you can break out of a
817a C<ev_run> call by calling C<longjmp> in a callback, throwing a C++ 826C<ev_run> call by calling C<longjmp> in a callback, throwing a C++
818exception and so on. This does not decrement the C<ev_depth> value, nor 827exception and so on. This does not decrement the C<ev_depth> value, nor
819will it clear any outstanding C<EVBREAK_ONE> breaks. 828will it clear any outstanding C<EVBREAK_ONE> breaks.
820 829
821A flags value of C<EVRUN_NOWAIT> will look for new events, will handle 830A flags value of C<EVRUN_NOWAIT> will look for new events, will handle
822those events and any already outstanding ones, but will not wait and 831those events and any already outstanding ones, but will not wait and
1012invoke the actual watchers inside another context (another thread etc.). 1021invoke the actual watchers inside another context (another thread etc.).
1013 1022
1014If you want to reset the callback, use C<ev_invoke_pending> as new 1023If you want to reset the callback, use C<ev_invoke_pending> as new
1015callback. 1024callback.
1016 1025
1017=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P)) 1026=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
1018 1027
1019Sometimes you want to share the same loop between multiple threads. This 1028Sometimes you want to share the same loop between multiple threads. This
1020can be done relatively simply by putting mutex_lock/unlock calls around 1029can be done relatively simply by putting mutex_lock/unlock calls around
1021each call to a libev function. 1030each call to a libev function.
1022 1031
1170 1179
1171=item C<EV_PREPARE> 1180=item C<EV_PREPARE>
1172 1181
1173=item C<EV_CHECK> 1182=item C<EV_CHECK>
1174 1183
1175All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts 1184All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts to
1176to gather new events, and all C<ev_check> watchers are invoked just after 1185gather new events, and all C<ev_check> watchers are queued (not invoked)
1177C<ev_run> has gathered them, but before it invokes any callbacks for any 1186just after C<ev_run> has gathered them, but before it queues any callbacks
1187for any received events. That means C<ev_prepare> watchers are the last
1188watchers invoked before the event loop sleeps or polls for new events, and
1189C<ev_check> watchers will be invoked before any other watchers of the same
1190or lower priority within an event loop iteration.
1191
1178received events. Callbacks of both watcher types can start and stop as 1192Callbacks of both watcher types can start and stop as many watchers as
1179many watchers as they want, and all of them will be taken into account 1193they 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 1194C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1181C<ev_run> from blocking). 1195blocking).
1182 1196
1183=item C<EV_EMBED> 1197=item C<EV_EMBED>
1184 1198
1185The embedded event loop specified in the C<ev_embed> watcher needs attention. 1199The embedded event loop specified in the C<ev_embed> watcher needs attention.
1186 1200
1309 1323
1310=item callback ev_cb (ev_TYPE *watcher) 1324=item callback ev_cb (ev_TYPE *watcher)
1311 1325
1312Returns the callback currently set on the watcher. 1326Returns the callback currently set on the watcher.
1313 1327
1314=item ev_cb_set (ev_TYPE *watcher, callback) 1328=item ev_set_cb (ev_TYPE *watcher, callback)
1315 1329
1316Change the callback. You can change the callback at virtually any time 1330Change the callback. You can change the callback at virtually any time
1317(modulo threads). 1331(modulo threads).
1318 1332
1319=item ev_set_priority (ev_TYPE *watcher, int priority) 1333=item ev_set_priority (ev_TYPE *watcher, int priority)
1337or might not have been clamped to the valid range. 1351or might not have been clamped to the valid range.
1338 1352
1339The default priority used by watchers when no priority has been set is 1353The default priority used by watchers when no priority has been set is
1340always C<0>, which is supposed to not be too high and not be too low :). 1354always C<0>, which is supposed to not be too high and not be too low :).
1341 1355
1342See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of 1356See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1343priorities. 1357priorities.
1344 1358
1345=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1359=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1346 1360
1347Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1361Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1372See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1386See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1373functions that do not need a watcher. 1387functions that do not need a watcher.
1374 1388
1375=back 1389=back
1376 1390
1377See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR 1391See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1378OWN COMPOSITE WATCHERS> idioms. 1392OWN COMPOSITE WATCHERS> idioms.
1379 1393
1380=head2 WATCHER STATES 1394=head2 WATCHER STATES
1381 1395
1382There are various watcher states mentioned throughout this manual - 1396There are various watcher states mentioned throughout this manual -
1384transition between them will be described in more detail - and while these 1398transition between them will be described in more detail - and while these
1385rules might look complicated, they usually do "the right thing". 1399rules might look complicated, they usually do "the right thing".
1386 1400
1387=over 4 1401=over 4
1388 1402
1389=item initialiased 1403=item initialised
1390 1404
1391Before a watcher can be registered with the event loop it has to be 1405Before a watcher can be registered with the event loop it has to be
1392initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1406initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1393C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1407C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1394 1408
1870 callback (EV_P_ ev_timer *w, int revents) 1884 callback (EV_P_ ev_timer *w, int revents)
1871 { 1885 {
1872 // calculate when the timeout would happen 1886 // calculate when the timeout would happen
1873 ev_tstamp after = last_activity - ev_now (EV_A) + timeout; 1887 ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1874 1888
1875 // if negative, it means we the timeout already occured 1889 // if negative, it means we the timeout already occurred
1876 if (after < 0.) 1890 if (after < 0.)
1877 { 1891 {
1878 // timeout occurred, take action 1892 // timeout occurred, take action
1879 } 1893 }
1880 else 1894 else
1881 { 1895 {
1882 // callback was invoked, but there was some recent 1896 // callback was invoked, but there was some recent
1883 // activity. simply restart the timer to time out 1897 // activity. simply restart the timer to time out
1884 // after "after" seconds, which is the earliest time 1898 // after "after" seconds, which is the earliest time
1885 // the timeout can occur. 1899 // the timeout can occur.
1886 ev_timer_set (w, after, 0.); 1900 ev_timer_set (w, after, 0.);
1887 ev_timer_start (EV_A_ w); 1901 ev_timer_start (EV_A_ w);
1888 } 1902 }
1898 1912
1899Otherwise, we now the earliest time at which the timeout would trigger, 1913Otherwise, we now the earliest time at which the timeout would trigger,
1900and simply start the timer with this timeout value. 1914and simply start the timer with this timeout value.
1901 1915
1902In other words, each time the callback is invoked it will check whether 1916In other words, each time the callback is invoked it will check whether
1903the timeout cocured. If not, it will simply reschedule itself to check 1917the timeout occurred. If not, it will simply reschedule itself to check
1904again at the earliest time it could time out. Rinse. Repeat. 1918again at the earliest time it could time out. Rinse. Repeat.
1905 1919
1906This scheme causes more callback invocations (about one every 60 seconds 1920This scheme causes more callback invocations (about one every 60 seconds
1907minus half the average time between activity), but virtually no calls to 1921minus half the average time between activity), but virtually no calls to
1908libev to change the timeout. 1922libev to change the timeout.
1922 if (activity detected) 1936 if (activity detected)
1923 last_activity = ev_now (EV_A); 1937 last_activity = ev_now (EV_A);
1924 1938
1925When your timeout value changes, then the timeout can be changed by simply 1939When your timeout value changes, then the timeout can be changed by simply
1926providing a new value, stopping the timer and calling the callback, which 1940providing a new value, stopping the timer and calling the callback, which
1927will agaion do the right thing (for example, time out immediately :). 1941will again do the right thing (for example, time out immediately :).
1928 1942
1929 timeout = new_value; 1943 timeout = new_value;
1930 ev_timer_stop (EV_A_ &timer); 1944 ev_timer_stop (EV_A_ &timer);
1931 callback (EV_A_ &timer, 0); 1945 callback (EV_A_ &timer, 0);
1932 1946
2015 2029
2016The relative timeouts are calculated relative to the C<ev_now ()> 2030The relative timeouts are calculated relative to the C<ev_now ()>
2017time. This is usually the right thing as this timestamp refers to the time 2031time. This is usually the right thing as this timestamp refers to the time
2018of the event triggering whatever timeout you are modifying/starting. If 2032of the event triggering whatever timeout you are modifying/starting. If
2019you suspect event processing to be delayed and you I<need> to base the 2033you suspect event processing to be delayed and you I<need> to base the
2020timeout on the current time, use something like this to adjust for this: 2034timeout on the current time, use something like the following to adjust
2035for it:
2021 2036
2022 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 2037 ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
2023 2038
2024If the event loop is suspended for a long time, you can also force an 2039If the event loop is suspended for a long time, you can also force an
2025update of the time returned by C<ev_now ()> by calling C<ev_now_update 2040update of the time returned by C<ev_now ()> by calling C<ev_now_update
2026()>. 2041()>, although that will push the event time of all outstanding events
2042further into the future.
2027 2043
2028=head3 The special problem of unsynchronised clocks 2044=head3 The special problem of unsynchronised clocks
2029 2045
2030Modern systems have a variety of clocks - libev itself uses the normal 2046Modern systems have a variety of clocks - libev itself uses the normal
2031"wall clock" clock and, if available, the monotonic clock (to avoid time 2047"wall clock" clock and, if available, the monotonic clock (to avoid time
2108keep up with the timer (because it takes longer than those 10 seconds to 2124keep up with the timer (because it takes longer than those 10 seconds to
2109do stuff) the timer will not fire more than once per event loop iteration. 2125do stuff) the timer will not fire more than once per event loop iteration.
2110 2126
2111=item ev_timer_again (loop, ev_timer *) 2127=item ev_timer_again (loop, ev_timer *)
2112 2128
2113This will act as if the timer timed out and restarts it again if it is 2129This will act as if the timer timed out, and restarts it again if it is
2114repeating. The exact semantics are: 2130repeating. It basically works like calling C<ev_timer_stop>, updating the
2131timeout to the C<repeat> value and calling C<ev_timer_start>.
2115 2132
2133The exact semantics are as in the following rules, all of which will be
2134applied to the watcher:
2135
2136=over 4
2137
2116If the timer is pending, its pending status is cleared. 2138=item If the timer is pending, the pending status is always cleared.
2117 2139
2118If the timer is started but non-repeating, stop it (as if it timed out). 2140=item If the timer is started but non-repeating, stop it (as if it timed
2141out, without invoking it).
2119 2142
2120If the timer is repeating, either start it if necessary (with the 2143=item If the timer is repeating, make the C<repeat> value the new timeout
2121C<repeat> value), or reset the running timer to the C<repeat> value. 2144and start the timer, if necessary.
2122 2145
2146=back
2147
2123This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2148This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2124usage example. 2149usage example.
2125 2150
2126=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2151=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2127 2152
2128Returns the remaining time until a timer fires. If the timer is active, 2153Returns the remaining time until a timer fires. If the timer is active,
2371 2396
2372 ev_periodic hourly_tick; 2397 ev_periodic hourly_tick;
2373 ev_periodic_init (&hourly_tick, clock_cb, 2398 ev_periodic_init (&hourly_tick, clock_cb,
2374 fmod (ev_now (loop), 3600.), 3600., 0); 2399 fmod (ev_now (loop), 3600.), 3600., 0);
2375 ev_periodic_start (loop, &hourly_tick); 2400 ev_periodic_start (loop, &hourly_tick);
2376 2401
2377 2402
2378=head2 C<ev_signal> - signal me when a signal gets signalled! 2403=head2 C<ev_signal> - signal me when a signal gets signalled!
2379 2404
2380Signal watchers will trigger an event when the process receives a specific 2405Signal watchers will trigger an event when the process receives a specific
2381signal one or more times. Even though signals are very asynchronous, libev 2406signal one or more times. Even though signals are very asynchronous, libev
2391only within the same loop, i.e. you can watch for C<SIGINT> in your 2416only within the same loop, i.e. you can watch for C<SIGINT> in your
2392default loop and for C<SIGIO> in another loop, but you cannot watch for 2417default loop and for C<SIGIO> in another loop, but you cannot watch for
2393C<SIGINT> in both the default loop and another loop at the same time. At 2418C<SIGINT> in both the default loop and another loop at the same time. At
2394the moment, C<SIGCHLD> is permanently tied to the default loop. 2419the moment, C<SIGCHLD> is permanently tied to the default loop.
2395 2420
2396When the first watcher gets started will libev actually register something 2421Only after the first watcher for a signal is started will libev actually
2397with the kernel (thus it coexists with your own signal handlers as long as 2422register something with the kernel. It thus coexists with your own signal
2398you don't register any with libev for the same signal). 2423handlers as long as you don't register any with libev for the same signal.
2399 2424
2400If possible and supported, libev will install its handlers with 2425If possible and supported, libev will install its handlers with
2401C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should 2426C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2402not be unduly interrupted. If you have a problem with system calls getting 2427not be unduly interrupted. If you have a problem with system calls getting
2403interrupted by signals you can block all signals in an C<ev_check> watcher 2428interrupted by signals you can block all signals in an C<ev_check> watcher
2588 2613
2589=head2 C<ev_stat> - did the file attributes just change? 2614=head2 C<ev_stat> - did the file attributes just change?
2590 2615
2591This watches a file system path for attribute changes. That is, it calls 2616This watches a file system path for attribute changes. That is, it calls
2592C<stat> on that path in regular intervals (or when the OS says it changed) 2617C<stat> on that path in regular intervals (or when the OS says it changed)
2593and sees if it changed compared to the last time, invoking the callback if 2618and sees if it changed compared to the last time, invoking the callback
2594it did. 2619if it did. Starting the watcher C<stat>'s the file, so only changes that
2620happen after the watcher has been started will be reported.
2595 2621
2596The path does not need to exist: changing from "path exists" to "path does 2622The path does not need to exist: changing from "path exists" to "path does
2597not exist" is a status change like any other. The condition "path does not 2623not exist" is a status change like any other. The condition "path does not
2598exist" (or more correctly "path cannot be stat'ed") is signified by the 2624exist" (or more correctly "path cannot be stat'ed") is signified by the
2599C<st_nlink> field being zero (which is otherwise always forced to be at 2625C<st_nlink> field being zero (which is otherwise always forced to be at
2829Apart from keeping your process non-blocking (which is a useful 2855Apart from keeping your process non-blocking (which is a useful
2830effect on its own sometimes), idle watchers are a good place to do 2856effect on its own sometimes), idle watchers are a good place to do
2831"pseudo-background processing", or delay processing stuff to after the 2857"pseudo-background processing", or delay processing stuff to after the
2832event loop has handled all outstanding events. 2858event loop has handled all outstanding events.
2833 2859
2860=head3 Abusing an C<ev_idle> watcher for its side-effect
2861
2862As long as there is at least one active idle watcher, libev will never
2863sleep unnecessarily. Or in other words, it will loop as fast as possible.
2864For this to work, the idle watcher doesn't need to be invoked at all - the
2865lowest priority will do.
2866
2867This mode of operation can be useful together with an C<ev_check> watcher,
2868to do something on each event loop iteration - for example to balance load
2869between different connections.
2870
2871See L</Abusing an ev_check watcher for its side-effect> for a longer
2872example.
2873
2834=head3 Watcher-Specific Functions and Data Members 2874=head3 Watcher-Specific Functions and Data Members
2835 2875
2836=over 4 2876=over 4
2837 2877
2838=item ev_idle_init (ev_idle *, callback) 2878=item ev_idle_init (ev_idle *, callback)
2849callback, free it. Also, use no error checking, as usual. 2889callback, free it. Also, use no error checking, as usual.
2850 2890
2851 static void 2891 static void
2852 idle_cb (struct ev_loop *loop, ev_idle *w, int revents) 2892 idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2853 { 2893 {
2894 // stop the watcher
2895 ev_idle_stop (loop, w);
2896
2897 // now we can free it
2854 free (w); 2898 free (w);
2899
2855 // now do something you wanted to do when the program has 2900 // now do something you wanted to do when the program has
2856 // no longer anything immediate to do. 2901 // no longer anything immediate to do.
2857 } 2902 }
2858 2903
2859 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2904 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2861 ev_idle_start (loop, idle_watcher); 2906 ev_idle_start (loop, idle_watcher);
2862 2907
2863 2908
2864=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2909=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2865 2910
2866Prepare and check watchers are usually (but not always) used in pairs: 2911Prepare and check watchers are often (but not always) used in pairs:
2867prepare watchers get invoked before the process blocks and check watchers 2912prepare watchers get invoked before the process blocks and check watchers
2868afterwards. 2913afterwards.
2869 2914
2870You I<must not> call C<ev_run> or similar functions that enter 2915You I<must not> call C<ev_run> (or similar functions that enter the
2871the current event loop from either C<ev_prepare> or C<ev_check> 2916current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2872watchers. Other loops than the current one are fine, however. The 2917C<ev_check> watchers. Other loops than the current one are fine,
2873rationale behind this is that you do not need to check for recursion in 2918however. The rationale behind this is that you do not need to check
2874those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2919for recursion in those watchers, i.e. the sequence will always be
2875C<ev_check> so if you have one watcher of each kind they will always be 2920C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2876called in pairs bracketing the blocking call. 2921kind they will always be called in pairs bracketing the blocking call.
2877 2922
2878Their main purpose is to integrate other event mechanisms into libev and 2923Their main purpose is to integrate other event mechanisms into libev and
2879their use is somewhat advanced. They could be used, for example, to track 2924their use is somewhat advanced. They could be used, for example, to track
2880variable changes, implement your own watchers, integrate net-snmp or a 2925variable changes, implement your own watchers, integrate net-snmp or a
2881coroutine library and lots more. They are also occasionally useful if 2926coroutine library and lots more. They are also occasionally useful if
2899with priority higher than or equal to the event loop and one coroutine 2944with priority higher than or equal to the event loop and one coroutine
2900of lower priority, but only once, using idle watchers to keep the event 2945of lower priority, but only once, using idle watchers to keep the event
2901loop from blocking if lower-priority coroutines are active, thus mapping 2946loop from blocking if lower-priority coroutines are active, thus mapping
2902low-priority coroutines to idle/background tasks). 2947low-priority coroutines to idle/background tasks).
2903 2948
2904It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 2949When used for this purpose, it is recommended to give C<ev_check> watchers
2905priority, to ensure that they are being run before any other watchers 2950highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2906after the poll (this doesn't matter for C<ev_prepare> watchers). 2951any other watchers after the poll (this doesn't matter for C<ev_prepare>
2952watchers).
2907 2953
2908Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not 2954Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2909activate ("feed") events into libev. While libev fully supports this, they 2955activate ("feed") events into libev. While libev fully supports this, they
2910might get executed before other C<ev_check> watchers did their job. As 2956might get executed before other C<ev_check> watchers did their job. As
2911C<ev_check> watchers are often used to embed other (non-libev) event 2957C<ev_check> watchers are often used to embed other (non-libev) event
2912loops those other event loops might be in an unusable state until their 2958loops those other event loops might be in an unusable state until their
2913C<ev_check> watcher ran (always remind yourself to coexist peacefully with 2959C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2914others). 2960others).
2961
2962=head3 Abusing an C<ev_check> watcher for its side-effect
2963
2964C<ev_check> (and less often also C<ev_prepare>) watchers can also be
2965useful because they are called once per event loop iteration. For
2966example, if you want to handle a large number of connections fairly, you
2967normally only do a bit of work for each active connection, and if there
2968is more work to do, you wait for the next event loop iteration, so other
2969connections have a chance of making progress.
2970
2971Using an C<ev_check> watcher is almost enough: it will be called on the
2972next event loop iteration. However, that isn't as soon as possible -
2973without external events, your C<ev_check> watcher will not be invoked.
2974
2975This is where C<ev_idle> watchers come in handy - all you need is a
2976single global idle watcher that is active as long as you have one active
2977C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
2978will not sleep, and the C<ev_check> watcher makes sure a callback gets
2979invoked. Neither watcher alone can do that.
2915 2980
2916=head3 Watcher-Specific Functions and Data Members 2981=head3 Watcher-Specific Functions and Data Members
2917 2982
2918=over 4 2983=over 4
2919 2984
3120 3185
3121=over 4 3186=over 4
3122 3187
3123=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3188=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3124 3189
3125=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3190=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3126 3191
3127Configures the watcher to embed the given loop, which must be 3192Configures the watcher to embed the given loop, which must be
3128embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3193embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3129invoked automatically, otherwise it is the responsibility of the callback 3194invoked automatically, otherwise it is the responsibility of the callback
3130to invoke it (it will continue to be called until the sweep has been done, 3195to invoke it (it will continue to be called until the sweep has been done,
3151used). 3216used).
3152 3217
3153 struct ev_loop *loop_hi = ev_default_init (0); 3218 struct ev_loop *loop_hi = ev_default_init (0);
3154 struct ev_loop *loop_lo = 0; 3219 struct ev_loop *loop_lo = 0;
3155 ev_embed embed; 3220 ev_embed embed;
3156 3221
3157 // see if there is a chance of getting one that works 3222 // see if there is a chance of getting one that works
3158 // (remember that a flags value of 0 means autodetection) 3223 // (remember that a flags value of 0 means autodetection)
3159 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 3224 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3160 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 3225 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3161 : 0; 3226 : 0;
3175C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 3240C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3176 3241
3177 struct ev_loop *loop = ev_default_init (0); 3242 struct ev_loop *loop = ev_default_init (0);
3178 struct ev_loop *loop_socket = 0; 3243 struct ev_loop *loop_socket = 0;
3179 ev_embed embed; 3244 ev_embed embed;
3180 3245
3181 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 3246 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3182 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 3247 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3183 { 3248 {
3184 ev_embed_init (&embed, 0, loop_socket); 3249 ev_embed_init (&embed, 0, loop_socket);
3185 ev_embed_start (loop, &embed); 3250 ev_embed_start (loop, &embed);
3193 3258
3194=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3259=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3195 3260
3196Fork watchers are called when a C<fork ()> was detected (usually because 3261Fork watchers are called when a C<fork ()> was detected (usually because
3197whoever is a good citizen cared to tell libev about it by calling 3262whoever is a good citizen cared to tell libev about it by calling
3198C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the 3263C<ev_loop_fork>). The invocation is done before the event loop blocks next
3199event loop blocks next and before C<ev_check> watchers are being called, 3264and before C<ev_check> watchers are being called, and only in the child
3200and only in the child after the fork. If whoever good citizen calling 3265after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3201C<ev_default_fork> cheats and calls it in the wrong process, the fork 3266and calls it in the wrong process, the fork handlers will be invoked, too,
3202handlers will be invoked, too, of course. 3267of course.
3203 3268
3204=head3 The special problem of life after fork - how is it possible? 3269=head3 The special problem of life after fork - how is it possible?
3205 3270
3206Most uses of C<fork()> consist of forking, then some simple calls to set 3271Most uses of C<fork ()> consist of forking, then some simple calls to set
3207up/change the process environment, followed by a call to C<exec()>. This 3272up/change the process environment, followed by a call to C<exec()>. This
3208sequence should be handled by libev without any problems. 3273sequence should be handled by libev without any problems.
3209 3274
3210This changes when the application actually wants to do event handling 3275This changes when the application actually wants to do event handling
3211in the child, or both parent in child, in effect "continuing" after the 3276in the child, or both parent in child, in effect "continuing" after the
3300it by calling C<ev_async_send>, which is thread- and signal safe. 3365it by calling C<ev_async_send>, which is thread- and signal safe.
3301 3366
3302This functionality is very similar to C<ev_signal> watchers, as signals, 3367This functionality is very similar to C<ev_signal> watchers, as signals,
3303too, are asynchronous in nature, and signals, too, will be compressed 3368too, 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 3369(i.e. the number of callback invocations may be less than the number of
3305C<ev_async_sent> calls). In fact, you could use signal watchers as a kind 3370C<ev_async_send> calls). In fact, you could use signal watchers as a kind
3306of "global async watchers" by using a watcher on an otherwise unused 3371of "global async watchers" by using a watcher on an otherwise unused
3307signal, and C<ev_feed_signal> to signal this watcher from another thread, 3372signal, and C<ev_feed_signal> to signal this watcher from another thread,
3308even without knowing which loop owns the signal. 3373even without knowing which loop owns the signal.
3309 3374
3310=head3 Queueing 3375=head3 Queueing
3601already been invoked. 3666already been invoked.
3602 3667
3603A common way around all these issues is to make sure that 3668A common way around all these issues is to make sure that
3604C<start_new_request> I<always> returns before the callback is invoked. If 3669C<start_new_request> I<always> returns before the callback is invoked. If
3605C<start_new_request> immediately knows the result, it can artificially 3670C<start_new_request> immediately knows the result, it can artificially
3606delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher 3671delay invoking the callback by using a C<prepare> or C<idle> watcher for
3607for example, or more sneakily, by reusing an existing (stopped) watcher 3672example, or more sneakily, by reusing an existing (stopped) watcher and
3608and pushing it into the pending queue: 3673pushing it into the pending queue:
3609 3674
3610 ev_set_cb (watcher, callback); 3675 ev_set_cb (watcher, callback);
3611 ev_feed_event (EV_A_ watcher, 0); 3676 ev_feed_event (EV_A_ watcher, 0);
3612 3677
3613This way, C<start_new_request> can safely return before the callback is 3678This way, C<start_new_request> can safely return before the callback is
3621 3686
3622This brings the problem of exiting - a callback might want to finish the 3687This brings the problem of exiting - a callback might want to finish the
3623main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but 3688main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3624a modal "Are you sure?" dialog is still waiting), or just the nested one 3689a modal "Are you sure?" dialog is still waiting), or just the nested one
3625and not the main one (e.g. user clocked "Ok" in a modal dialog), or some 3690and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3626other combination: In these cases, C<ev_break> will not work alone. 3691other combination: In these cases, a simple C<ev_break> will not work.
3627 3692
3628The solution is to maintain "break this loop" variable for each C<ev_run> 3693The solution is to maintain "break this loop" variable for each C<ev_run>
3629invocation, and use a loop around C<ev_run> until the condition is 3694invocation, and use a loop around C<ev_run> until the condition is
3630triggered, using C<EVRUN_ONCE>: 3695triggered, using C<EVRUN_ONCE>:
3631 3696
3633 int exit_main_loop = 0; 3698 int exit_main_loop = 0;
3634 3699
3635 while (!exit_main_loop) 3700 while (!exit_main_loop)
3636 ev_run (EV_DEFAULT_ EVRUN_ONCE); 3701 ev_run (EV_DEFAULT_ EVRUN_ONCE);
3637 3702
3638 // in a model watcher 3703 // in a modal watcher
3639 int exit_nested_loop = 0; 3704 int exit_nested_loop = 0;
3640 3705
3641 while (!exit_nested_loop) 3706 while (!exit_nested_loop)
3642 ev_run (EV_A_ EVRUN_ONCE); 3707 ev_run (EV_A_ EVRUN_ONCE);
3643 3708
3817called): 3882called):
3818 3883
3819 void 3884 void
3820 wait_for_event (ev_watcher *w) 3885 wait_for_event (ev_watcher *w)
3821 { 3886 {
3822 ev_cb_set (w) = current_coro; 3887 ev_set_cb (w, current_coro);
3823 switch_to (libev_coro); 3888 switch_to (libev_coro);
3824 } 3889 }
3825 3890
3826That basically suspends the coroutine inside C<wait_for_event> and 3891That basically suspends the coroutine inside C<wait_for_event> and
3827continues the libev coroutine, which, when appropriate, switches back to 3892continues the libev coroutine, which, when appropriate, switches back to
3828this or any other coroutine. I am sure if you sue this your own :) 3893this or any other coroutine.
3829 3894
3830You can do similar tricks if you have, say, threads with an event queue - 3895You can do similar tricks if you have, say, threads with an event queue -
3831instead of storing a coroutine, you store the queue object and instead of 3896instead of storing a coroutine, you store the queue object and instead of
3832switching to a coroutine, you push the watcher onto the queue and notify 3897switching to a coroutine, you push the watcher onto the queue and notify
3833any waiters. 3898any waiters.
3834 3899
3835To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two 3900To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
3836files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: 3901files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3837 3902
3838 // my_ev.h 3903 // my_ev.h
3839 #define EV_CB_DECLARE(type) struct my_coro *cb; 3904 #define EV_CB_DECLARE(type) struct my_coro *cb;
3840 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); 3905 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3884 3949
3885=back 3950=back
3886 3951
3887=head1 C++ SUPPORT 3952=head1 C++ SUPPORT
3888 3953
3954=head2 C API
3955
3956The normal C API should work fine when used from C++: both ev.h and the
3957libev sources can be compiled as C++. Therefore, code that uses the C API
3958will work fine.
3959
3960Proper exception specifications might have to be added to callbacks passed
3961to libev: exceptions may be thrown only from watcher callbacks, all
3962other callbacks (allocator, syserr, loop acquire/release and periodic
3963reschedule callbacks) must not throw exceptions, and might need a C<throw
3964()> specification. If you have code that needs to be compiled as both C
3965and C++ you can use the C<EV_THROW> macro for this:
3966
3967 static void
3968 fatal_error (const char *msg) EV_THROW
3969 {
3970 perror (msg);
3971 abort ();
3972 }
3973
3974 ...
3975 ev_set_syserr_cb (fatal_error);
3976
3977The only API functions that can currently throw exceptions are C<ev_run>,
3978C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
3979because it runs cleanup watchers).
3980
3981Throwing exceptions in watcher callbacks is only supported if libev itself
3982is compiled with a C++ compiler or your C and C++ environments allow
3983throwing exceptions through C libraries (most do).
3984
3985=head2 C++ API
3986
3889Libev comes with some simplistic wrapper classes for C++ that mainly allow 3987Libev comes with some simplistic wrapper classes for C++ that mainly allow
3890you to use some convenience methods to start/stop watchers and also change 3988you to use some convenience methods to start/stop watchers and also change
3891the callback model to a model using method callbacks on objects. 3989the callback model to a model using method callbacks on objects.
3892 3990
3893To use it, 3991To use it,
3894 3992
3895 #include <ev++.h> 3993 #include <ev++.h>
3896 3994
3897This automatically includes F<ev.h> and puts all of its definitions (many 3995This automatically includes F<ev.h> and puts all of its definitions (many
3898of them macros) into the global namespace. All C++ specific things are 3996of them macros) into the global namespace. All C++ specific things are
3899put into the C<ev> namespace. It should support all the same embedding 3997put into the C<ev> namespace. It should support all the same embedding
3908with C<operator ()> can be used as callbacks. Other types should be easy 4006with C<operator ()> can be used as callbacks. Other types should be easy
3909to add as long as they only need one additional pointer for context. If 4007to add as long as they only need one additional pointer for context. If
3910you need support for other types of functors please contact the author 4008you need support for other types of functors please contact the author
3911(preferably after implementing it). 4009(preferably after implementing it).
3912 4010
4011For all this to work, your C++ compiler either has to use the same calling
4012conventions as your C compiler (for static member functions), or you have
4013to embed libev and compile libev itself as C++.
4014
3913Here is a list of things available in the C<ev> namespace: 4015Here is a list of things available in the C<ev> namespace:
3914 4016
3915=over 4 4017=over 4
3916 4018
3917=item C<ev::READ>, C<ev::WRITE> etc. 4019=item C<ev::READ>, C<ev::WRITE> etc.
3926=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc. 4028=item C<ev::io>, C<ev::timer>, C<ev::periodic>, C<ev::idle>, C<ev::sig> etc.
3927 4029
3928For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of 4030For each C<ev_TYPE> watcher in F<ev.h> there is a corresponding class of
3929the same name in the C<ev> namespace, with the exception of C<ev_signal> 4031the same name in the C<ev> namespace, with the exception of C<ev_signal>
3930which is called C<ev::sig> to avoid clashes with the C<signal> macro 4032which is called C<ev::sig> to avoid clashes with the C<signal> macro
3931defines by many implementations. 4033defined by many implementations.
3932 4034
3933All of those classes have these methods: 4035All of those classes have these methods:
3934 4036
3935=over 4 4037=over 4
3936 4038
3998 void operator() (ev::io &w, int revents) 4100 void operator() (ev::io &w, int revents)
3999 { 4101 {
4000 ... 4102 ...
4001 } 4103 }
4002 } 4104 }
4003 4105
4004 myfunctor f; 4106 myfunctor f;
4005 4107
4006 ev::io w; 4108 ev::io w;
4007 w.set (&f); 4109 w.set (&f);
4008 4110
4026Associates a different C<struct ev_loop> with this watcher. You can only 4128Associates a different C<struct ev_loop> with this watcher. You can only
4027do this when the watcher is inactive (and not pending either). 4129do this when the watcher is inactive (and not pending either).
4028 4130
4029=item w->set ([arguments]) 4131=item w->set ([arguments])
4030 4132
4031Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4133Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
4032method or a suitable start method must be called at least once. Unlike the 4134with the same arguments. Either this method or a suitable start method
4033C counterpart, an active watcher gets automatically stopped and restarted 4135must be called at least once. Unlike the C counterpart, an active watcher
4034when reconfiguring it with this method. 4136gets automatically stopped and restarted when reconfiguring it with this
4137method.
4138
4139For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4140clashing with the C<set (loop)> method.
4035 4141
4036=item w->start () 4142=item w->start ()
4037 4143
4038Starts the watcher. Note that there is no C<loop> argument, as the 4144Starts the watcher. Note that there is no C<loop> argument, as the
4039constructor already stores the event loop. 4145constructor already stores the event loop.
4142=item Lua 4248=item Lua
4143 4249
4144Brian Maher has written a partial interface to libev for lua (at the 4250Brian Maher has written a partial interface to libev for lua (at the
4145time of this writing, only C<ev_io> and C<ev_timer>), to be found at 4251time of this writing, only C<ev_io> and C<ev_timer>), to be found at
4146L<http://github.com/brimworks/lua-ev>. 4252L<http://github.com/brimworks/lua-ev>.
4253
4254=item Javascript
4255
4256Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
4257
4258=item Others
4259
4260There are others, and I stopped counting.
4147 4261
4148=back 4262=back
4149 4263
4150 4264
4151=head1 MACRO MAGIC 4265=head1 MACRO MAGIC
4450 4564
4451If programs implement their own fd to handle mapping on win32, then this 4565If programs implement their own fd to handle mapping on win32, then this
4452macro can be used to override the C<close> function, useful to unregister 4566macro can be used to override the C<close> function, useful to unregister
4453file descriptors again. Note that the replacement function has to close 4567file descriptors again. Note that the replacement function has to close
4454the underlying OS handle. 4568the underlying OS handle.
4569
4570=item EV_USE_WSASOCKET
4571
4572If defined to be C<1>, libev will use C<WSASocket> to create its internal
4573communication socket, which works better in some environments. Otherwise,
4574the normal C<socket> function will be used, which works better in other
4575environments.
4455 4576
4456=item EV_USE_POLL 4577=item EV_USE_POLL
4457 4578
4458If defined to be C<1>, libev will compile in support for the C<poll>(2) 4579If defined to be C<1>, libev will compile in support for the C<poll>(2)
4459backend. Otherwise it will be enabled on non-win32 platforms. It 4580backend. Otherwise it will be enabled on non-win32 platforms. It
4495If defined to be C<1>, libev will compile in support for the Linux inotify 4616If defined to be C<1>, libev will compile in support for the Linux inotify
4496interface to speed up C<ev_stat> watchers. Its actual availability will 4617interface to speed up C<ev_stat> watchers. Its actual availability will
4497be detected at runtime. If undefined, it will be enabled if the headers 4618be detected at runtime. If undefined, it will be enabled if the headers
4498indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled. 4619indicate GNU/Linux + Glibc 2.4 or newer, otherwise disabled.
4499 4620
4621=item EV_NO_SMP
4622
4623If defined to be C<1>, libev will assume that memory is always coherent
4624between threads, that is, threads can be used, but threads never run on
4625different cpus (or different cpu cores). This reduces dependencies
4626and makes libev faster.
4627
4628=item EV_NO_THREADS
4629
4630If defined to be C<1>, libev will assume that it will never be called from
4631different threads (that includes signal handlers), which is a stronger
4632assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4633libev faster.
4634
4500=item EV_ATOMIC_T 4635=item EV_ATOMIC_T
4501 4636
4502Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4637Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4503access is atomic and serialised with respect to other threads or signal 4638access is atomic with respect to other threads or signal contexts. No
4504contexts. No such type is easily found in the C language, so you can 4639such type is easily found in the C language, so you can provide your own
4505provide your own type that you know is safe for your purposes. It is used 4640type that you know is safe for your purposes. It is used both for signal
4506both for signal handler "locking" as well as for signal and thread safety 4641handler "locking" as well as for signal and thread safety in C<ev_async>
4507in C<ev_async> watchers. 4642watchers.
4508 4643
4509In the absence of this define, libev will use C<sig_atomic_t volatile> 4644In the absence of this define, libev will use C<sig_atomic_t volatile>
4510(from F<signal.h>), which is usually good enough on most platforms, 4645(from F<signal.h>), which is usually good enough on most platforms.
4511although strictly speaking using a type that also implies a memory fence
4512is required.
4513 4646
4514=item EV_H (h) 4647=item EV_H (h)
4515 4648
4516The name of the F<ev.h> header file used to include it. The default if 4649The name of the F<ev.h> header file used to include it. The default if
4517undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4650undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
4590 #define EV_USE_POLL 1 4723 #define EV_USE_POLL 1
4591 #define EV_CHILD_ENABLE 1 4724 #define EV_CHILD_ENABLE 1
4592 #define EV_ASYNC_ENABLE 1 4725 #define EV_ASYNC_ENABLE 1
4593 4726
4594The actual value is a bitset, it can be a combination of the following 4727The actual value is a bitset, it can be a combination of the following
4595values: 4728values (by default, all of these are enabled):
4596 4729
4597=over 4 4730=over 4
4598 4731
4599=item C<1> - faster/larger code 4732=item C<1> - faster/larger code
4600 4733
4604code size by roughly 30% on amd64). 4737code size by roughly 30% on amd64).
4605 4738
4606When optimising for size, use of compiler flags such as C<-Os> with 4739When optimising for size, use of compiler flags such as C<-Os> with
4607gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of 4740gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4608assertions. 4741assertions.
4742
4743The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4744(e.g. gcc with C<-Os>).
4609 4745
4610=item C<2> - faster/larger data structures 4746=item C<2> - faster/larger data structures
4611 4747
4612Replaces the small 2-heap for timer management by a faster 4-heap, larger 4748Replaces the small 2-heap for timer management by a faster 4-heap, larger
4613hash table sizes and so on. This will usually further increase code size 4749hash table sizes and so on. This will usually further increase code size
4614and can additionally have an effect on the size of data structures at 4750and can additionally have an effect on the size of data structures at
4615runtime. 4751runtime.
4752
4753The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4754(e.g. gcc with C<-Os>).
4616 4755
4617=item C<4> - full API configuration 4756=item C<4> - full API configuration
4618 4757
4619This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and 4758This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4620enables multiplicity (C<EV_MULTIPLICITY>=1). 4759enables multiplicity (C<EV_MULTIPLICITY>=1).
4662when you embed libev, only want to use libev functions in a single file, 4801when you embed libev, only want to use libev functions in a single file,
4663and do not want its identifiers to be visible. 4802and do not want its identifiers to be visible.
4664 4803
4665To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that 4804To use this, define C<EV_API_STATIC> and include F<ev.c> in the file that
4666wants to use libev. 4805wants to use libev.
4806
4807This option only works when libev is compiled with a C compiler, as C++
4808doesn't support the required declaration syntax.
4667 4809
4668=item EV_AVOID_STDIO 4810=item EV_AVOID_STDIO
4669 4811
4670If this is set to C<1> at compiletime, then libev will avoid using stdio 4812If this is set to C<1> at compiletime, then libev will avoid using stdio
4671functions (printf, scanf, perror etc.). This will increase the code size 4813functions (printf, scanf, perror etc.). This will increase the code size
4876default loop and triggering an C<ev_async> watcher from the default loop 5018default loop and triggering an C<ev_async> watcher from the default loop
4877watcher callback into the event loop interested in the signal. 5019watcher callback into the event loop interested in the signal.
4878 5020
4879=back 5021=back
4880 5022
4881See also L<THREAD LOCKING EXAMPLE>. 5023See also L</THREAD LOCKING EXAMPLE>.
4882 5024
4883=head3 COROUTINES 5025=head3 COROUTINES
4884 5026
4885Libev is very accommodating to coroutines ("cooperative threads"): 5027Libev is very accommodating to coroutines ("cooperative threads"):
4886libev fully supports nesting calls to its functions from different 5028libev fully supports nesting calls to its functions from different
5177thread" or will block signals process-wide, both behaviours would 5319thread" or will block signals process-wide, both behaviours would
5178be compatible with libev. Interaction between C<sigprocmask> and 5320be compatible with libev. Interaction between C<sigprocmask> and
5179C<pthread_sigmask> could complicate things, however. 5321C<pthread_sigmask> could complicate things, however.
5180 5322
5181The most portable way to handle signals is to block signals in all threads 5323The most portable way to handle signals is to block signals in all threads
5182except the initial one, and run the default loop in the initial thread as 5324except the initial one, and run the signal handling loop in the initial
5183well. 5325thread as well.
5184 5326
5185=item C<long> must be large enough for common memory allocation sizes 5327=item C<long> must be large enough for common memory allocation sizes
5186 5328
5187To improve portability and simplify its API, libev uses C<long> internally 5329To improve portability and simplify its API, libev uses C<long> internally
5188instead of C<size_t> when allocating its data structures. On non-POSIX 5330instead of C<size_t> when allocating its data structures. On non-POSIX
5292=over 4 5434=over 4
5293 5435
5294=item C<EV_COMPAT3> backwards compatibility mechanism 5436=item C<EV_COMPAT3> backwards compatibility mechanism
5295 5437
5296The backward compatibility mechanism can be controlled by 5438The backward compatibility mechanism can be controlled by
5297C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> 5439C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5298section. 5440section.
5299 5441
5300=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5442=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5301 5443
5302These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5444These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5345=over 4 5487=over 4
5346 5488
5347=item active 5489=item active
5348 5490
5349A watcher is active as long as it has been started and not yet stopped. 5491A watcher is active as long as it has been started and not yet stopped.
5350See L<WATCHER STATES> for details. 5492See L</WATCHER STATES> for details.
5351 5493
5352=item application 5494=item application
5353 5495
5354In this document, an application is whatever is using libev. 5496In this document, an application is whatever is using libev.
5355 5497
5391watchers and events. 5533watchers and events.
5392 5534
5393=item pending 5535=item pending
5394 5536
5395A watcher is pending as soon as the corresponding event has been 5537A watcher is pending as soon as the corresponding event has been
5396detected. See L<WATCHER STATES> for details. 5538detected. See L</WATCHER STATES> for details.
5397 5539
5398=item real time 5540=item real time
5399 5541
5400The physical time that is observed. It is apparently strictly monotonic :) 5542The physical time that is observed. It is apparently strictly monotonic :)
5401 5543

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines