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.446 by root, Mon Mar 18 19:28:15 2019 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
263 265
264You could override this function in high-availability programs to, say, 266You could override this function in high-availability programs to, say,
265free some memory if it cannot allocate memory, to use a special allocator, 267free some memory if it cannot allocate memory, to use a special allocator,
266or even to sleep a while and retry until some memory is available. 268or even to sleep a while and retry until some memory is available.
267 269
270Example: The following is the C<realloc> function that libev itself uses
271which should work with C<realloc> and C<free> functions of all kinds and
272is probably a good basis for your own implementation.
273
274 static void *
275 ev_realloc_emul (void *ptr, long size) EV_NOEXCEPT
276 {
277 if (size)
278 return realloc (ptr, size);
279
280 free (ptr);
281 return 0;
282 }
283
268Example: Replace the libev allocator with one that waits a bit and then 284Example: Replace the libev allocator with one that waits a bit and then
269retries (example requires a standards-compliant C<realloc>). 285retries.
270 286
271 static void * 287 static void *
272 persistent_realloc (void *ptr, size_t size) 288 persistent_realloc (void *ptr, size_t size)
273 { 289 {
290 if (!size)
291 {
292 free (ptr);
293 return 0;
294 }
295
274 for (;;) 296 for (;;)
275 { 297 {
276 void *newptr = realloc (ptr, size); 298 void *newptr = realloc (ptr, size);
277 299
278 if (newptr) 300 if (newptr)
283 } 305 }
284 306
285 ... 307 ...
286 ev_set_allocator (persistent_realloc); 308 ev_set_allocator (persistent_realloc);
287 309
288=item ev_set_syserr_cb (void (*cb)(const char *msg)) 310=item ev_set_syserr_cb (void (*cb)(const char *msg) throw ())
289 311
290Set the callback function to call on a retryable system call error (such 312Set the callback function to call on a retryable system call error (such
291as failed select, poll, epoll_wait). The message is a printable string 313as failed select, poll, epoll_wait). The message is a printable string
292indicating the system call or subsystem causing the problem. If this 314indicating the system call or subsystem causing the problem. If this
293callback is set, then libev will expect it to remedy the situation, no 315callback is set, then libev will expect it to remedy the situation, no
396 418
397If this flag bit is or'ed into the flag value (or the program runs setuid 419If 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 420or setgid) then libev will I<not> look at the environment variable
399C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 421C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
400override the flags completely if it is found in the environment. This is 422override 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 423useful to try out specific backends to test their performance, to work
402around bugs. 424around bugs, or to make libev threadsafe (accessing environment variables
425cannot be done in a threadsafe way, but usually it works if no other
426thread modifies them).
403 427
404=item C<EVFLAG_FORKCHECK> 428=item C<EVFLAG_FORKCHECK>
405 429
406Instead of calling C<ev_loop_fork> manually after a fork, you can also 430Instead 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. 431make libev check for a fork in each iteration by enabling this flag.
408 432
409This works by calling C<getpid ()> on every iteration of the loop, 433This works by calling C<getpid ()> on every iteration of the loop,
410and thus this might slow down your event loop if you do a lot of loop 434and thus this might slow down your event loop if you do a lot of loop
411iterations and little real work, but is usually not noticeable (on my 435iterations and little real work, but is usually not noticeable (on my
412GNU/Linux system for example, C<getpid> is actually a simple 5-insn sequence 436GNU/Linux system for example, C<getpid> is actually a simple 5-insn
413without a system call and thus I<very> fast, but my GNU/Linux system also has 437sequence without a system call and thus I<very> fast, but my GNU/Linux
414C<pthread_atfork> which is even faster). 438system also has C<pthread_atfork> which is even faster). (Update: glibc
439versions 2.25 apparently removed the C<getpid> optimisation again).
415 440
416The big advantage of this flag is that you can forget about fork (and 441The big advantage of this flag is that you can forget about fork (and
417forget about forgetting to tell libev about forking) when you use this 442forget about forgetting to tell libev about forking, although you still
418flag. 443have to ignore C<SIGPIPE>) when you use this flag.
419 444
420This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 445This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
421environment variable. 446environment variable.
422 447
423=item C<EVFLAG_NOINOTIFY> 448=item C<EVFLAG_NOINOTIFY>
569kernel is more efficient (which says nothing about its actual speed, of 594kernel is more efficient (which says nothing about its actual speed, of
570course). While stopping, setting and starting an I/O watcher does never 595course). 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 596cause 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 597two 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 598might 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 599drops fds silently in similarly hard-to-detect cases.
575 600
576This backend usually performs well under most conditions. 601This backend usually performs well under most conditions.
577 602
578While nominally embeddable in other event loops, this doesn't work 603While nominally embeddable in other event loops, this doesn't work
579everywhere, so you might need to test for this. And since it is broken 604everywhere, 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> 703If you need dynamically allocated loops it is better to use C<ev_loop_new>
679and C<ev_loop_destroy>. 704and C<ev_loop_destroy>.
680 705
681=item ev_loop_fork (loop) 706=item ev_loop_fork (loop)
682 707
683This function sets a flag that causes subsequent C<ev_run> iterations to 708This function sets a flag that causes subsequent C<ev_run> iterations
684reinitialise the kernel state for backends that have one. Despite the 709to reinitialise the kernel state for backends that have one. Despite
685name, you can call it anytime, but it makes most sense after forking, in 710the 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 711watchers (except inside an C<ev_prepare> callback), but it makes most
712sense after forking, in the child process. You I<must> call it (or use
687child before resuming or calling C<ev_run>. 713C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
688 714
715In addition, if you want to reuse a loop (via this function or
716C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
717
689Again, you I<have> to call it on I<any> loop that you want to re-use after 718Again, 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 719a 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 720because some kernel interfaces *cough* I<kqueue> *cough* do funny things
692during fork. 721during fork.
693 722
694On the other hand, you only need to call this function in the child 723On the other hand, you only need to call this function in the child
764 793
765This function is rarely useful, but when some event callback runs for a 794This 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 795very long time without entering the event loop, updating libev's idea of
767the current time is a good idea. 796the current time is a good idea.
768 797
769See also L<The special problem of time updates> in the C<ev_timer> section. 798See also L</The special problem of time updates> in the C<ev_timer> section.
770 799
771=item ev_suspend (loop) 800=item ev_suspend (loop)
772 801
773=item ev_resume (loop) 802=item ev_resume (loop)
774 803
1016invoke the actual watchers inside another context (another thread etc.). 1045invoke the actual watchers inside another context (another thread etc.).
1017 1046
1018If you want to reset the callback, use C<ev_invoke_pending> as new 1047If you want to reset the callback, use C<ev_invoke_pending> as new
1019callback. 1048callback.
1020 1049
1021=item ev_set_loop_release_cb (loop, void (*release)(EV_P), void (*acquire)(EV_P)) 1050=item ev_set_loop_release_cb (loop, void (*release)(EV_P) throw (), void (*acquire)(EV_P) throw ())
1022 1051
1023Sometimes you want to share the same loop between multiple threads. This 1052Sometimes you want to share the same loop between multiple threads. This
1024can be done relatively simply by putting mutex_lock/unlock calls around 1053can be done relatively simply by putting mutex_lock/unlock calls around
1025each call to a libev function. 1054each call to a libev function.
1026 1055
1174 1203
1175=item C<EV_PREPARE> 1204=item C<EV_PREPARE>
1176 1205
1177=item C<EV_CHECK> 1206=item C<EV_CHECK>
1178 1207
1179All C<ev_prepare> watchers are invoked just I<before> C<ev_run> starts 1208All 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 1209gather 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 1210just after C<ev_run> has gathered them, but before it queues any callbacks
1211for any received events. That means C<ev_prepare> watchers are the last
1212watchers invoked before the event loop sleeps or polls for new events, and
1213C<ev_check> watchers will be invoked before any other watchers of the same
1214or lower priority within an event loop iteration.
1215
1182received events. Callbacks of both watcher types can start and stop as 1216Callbacks 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 1217they 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 1218C<ev_prepare> watcher might start an idle watcher to keep C<ev_run> from
1185C<ev_run> from blocking). 1219blocking).
1186 1220
1187=item C<EV_EMBED> 1221=item C<EV_EMBED>
1188 1222
1189The embedded event loop specified in the C<ev_embed> watcher needs attention. 1223The embedded event loop specified in the C<ev_embed> watcher needs attention.
1190 1224
1313 1347
1314=item callback ev_cb (ev_TYPE *watcher) 1348=item callback ev_cb (ev_TYPE *watcher)
1315 1349
1316Returns the callback currently set on the watcher. 1350Returns the callback currently set on the watcher.
1317 1351
1318=item ev_cb_set (ev_TYPE *watcher, callback) 1352=item ev_set_cb (ev_TYPE *watcher, callback)
1319 1353
1320Change the callback. You can change the callback at virtually any time 1354Change the callback. You can change the callback at virtually any time
1321(modulo threads). 1355(modulo threads).
1322 1356
1323=item ev_set_priority (ev_TYPE *watcher, int priority) 1357=item ev_set_priority (ev_TYPE *watcher, int priority)
1341or might not have been clamped to the valid range. 1375or might not have been clamped to the valid range.
1342 1376
1343The default priority used by watchers when no priority has been set is 1377The 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 :). 1378always C<0>, which is supposed to not be too high and not be too low :).
1345 1379
1346See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of 1380See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1347priorities. 1381priorities.
1348 1382
1349=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1383=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1350 1384
1351Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1385Invoke 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 1410See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1377functions that do not need a watcher. 1411functions that do not need a watcher.
1378 1412
1379=back 1413=back
1380 1414
1381See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR 1415See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1382OWN COMPOSITE WATCHERS> idioms. 1416OWN COMPOSITE WATCHERS> idioms.
1383 1417
1384=head2 WATCHER STATES 1418=head2 WATCHER STATES
1385 1419
1386There are various watcher states mentioned throughout this manual - 1420There are various watcher states mentioned throughout this manual -
1388transition between them will be described in more detail - and while these 1422transition between them will be described in more detail - and while these
1389rules might look complicated, they usually do "the right thing". 1423rules might look complicated, they usually do "the right thing".
1390 1424
1391=over 4 1425=over 4
1392 1426
1393=item initialiased 1427=item initialised
1394 1428
1395Before a watcher can be registered with the event loop it has to be 1429Before 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 1430initialised. 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. 1431C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1398 1432
1874 callback (EV_P_ ev_timer *w, int revents) 1908 callback (EV_P_ ev_timer *w, int revents)
1875 { 1909 {
1876 // calculate when the timeout would happen 1910 // calculate when the timeout would happen
1877 ev_tstamp after = last_activity - ev_now (EV_A) + timeout; 1911 ev_tstamp after = last_activity - ev_now (EV_A) + timeout;
1878 1912
1879 // if negative, it means we the timeout already occured 1913 // if negative, it means we the timeout already occurred
1880 if (after < 0.) 1914 if (after < 0.)
1881 { 1915 {
1882 // timeout occurred, take action 1916 // timeout occurred, take action
1883 } 1917 }
1884 else 1918 else
1902 1936
1903Otherwise, we now the earliest time at which the timeout would trigger, 1937Otherwise, we now the earliest time at which the timeout would trigger,
1904and simply start the timer with this timeout value. 1938and simply start the timer with this timeout value.
1905 1939
1906In other words, each time the callback is invoked it will check whether 1940In other words, each time the callback is invoked it will check whether
1907the timeout cocured. If not, it will simply reschedule itself to check 1941the timeout occurred. If not, it will simply reschedule itself to check
1908again at the earliest time it could time out. Rinse. Repeat. 1942again at the earliest time it could time out. Rinse. Repeat.
1909 1943
1910This scheme causes more callback invocations (about one every 60 seconds 1944This scheme causes more callback invocations (about one every 60 seconds
1911minus half the average time between activity), but virtually no calls to 1945minus half the average time between activity), but virtually no calls to
1912libev to change the timeout. 1946libev to change the timeout.
1926 if (activity detected) 1960 if (activity detected)
1927 last_activity = ev_now (EV_A); 1961 last_activity = ev_now (EV_A);
1928 1962
1929When your timeout value changes, then the timeout can be changed by simply 1963When your timeout value changes, then the timeout can be changed by simply
1930providing a new value, stopping the timer and calling the callback, which 1964providing a new value, stopping the timer and calling the callback, which
1931will agaion do the right thing (for example, time out immediately :). 1965will again do the right thing (for example, time out immediately :).
1932 1966
1933 timeout = new_value; 1967 timeout = new_value;
1934 ev_timer_stop (EV_A_ &timer); 1968 ev_timer_stop (EV_A_ &timer);
1935 callback (EV_A_ &timer, 0); 1969 callback (EV_A_ &timer, 0);
1936 1970
2019 2053
2020The relative timeouts are calculated relative to the C<ev_now ()> 2054The relative timeouts are calculated relative to the C<ev_now ()>
2021time. This is usually the right thing as this timestamp refers to the time 2055time. This is usually the right thing as this timestamp refers to the time
2022of the event triggering whatever timeout you are modifying/starting. If 2056of the event triggering whatever timeout you are modifying/starting. If
2023you suspect event processing to be delayed and you I<need> to base the 2057you suspect event processing to be delayed and you I<need> to base the
2024timeout on the current time, use something like this to adjust for this: 2058timeout on the current time, use something like the following to adjust
2059for it:
2025 2060
2026 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 2061 ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
2027 2062
2028If the event loop is suspended for a long time, you can also force an 2063If the event loop is suspended for a long time, you can also force an
2029update of the time returned by C<ev_now ()> by calling C<ev_now_update 2064update of the time returned by C<ev_now ()> by calling C<ev_now_update
2030()>. 2065()>, although that will push the event time of all outstanding events
2066further into the future.
2031 2067
2032=head3 The special problem of unsynchronised clocks 2068=head3 The special problem of unsynchronised clocks
2033 2069
2034Modern systems have a variety of clocks - libev itself uses the normal 2070Modern systems have a variety of clocks - libev itself uses the normal
2035"wall clock" clock and, if available, the monotonic clock (to avoid time 2071"wall clock" clock and, if available, the monotonic clock (to avoid time
2098 2134
2099=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 2135=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
2100 2136
2101=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 2137=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
2102 2138
2103Configure the timer to trigger after C<after> seconds. If C<repeat> 2139Configure the timer to trigger after C<after> seconds (fractional and
2104is C<0.>, then it will automatically be stopped once the timeout is 2140negative values are supported). If C<repeat> is C<0.>, then it will
2105reached. If it is positive, then the timer will automatically be 2141automatically be stopped once the timeout is reached. If it is positive,
2106configured to trigger again C<repeat> seconds later, again, and again, 2142then the timer will automatically be configured to trigger again C<repeat>
2107until stopped manually. 2143seconds later, again, and again, until stopped manually.
2108 2144
2109The timer itself will do a best-effort at avoiding drift, that is, if 2145The timer itself will do a best-effort at avoiding drift, that is, if
2110you configure a timer to trigger every 10 seconds, then it will normally 2146you configure a timer to trigger every 10 seconds, then it will normally
2111trigger at exactly 10 second intervals. If, however, your program cannot 2147trigger at exactly 10 second intervals. If, however, your program cannot
2112keep up with the timer (because it takes longer than those 10 seconds to 2148keep up with the timer (because it takes longer than those 10 seconds to
2131=item If the timer is repeating, make the C<repeat> value the new timeout 2167=item If the timer is repeating, make the C<repeat> value the new timeout
2132and start the timer, if necessary. 2168and start the timer, if necessary.
2133 2169
2134=back 2170=back
2135 2171
2136This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2172This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2137usage example. 2173usage example.
2138 2174
2139=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2175=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2140 2176
2141Returns the remaining time until a timer fires. If the timer is active, 2177Returns the remaining time until a timer fires. If the timer is active,
2194Periodic watchers are also timers of a kind, but they are very versatile 2230Periodic watchers are also timers of a kind, but they are very versatile
2195(and unfortunately a bit complex). 2231(and unfortunately a bit complex).
2196 2232
2197Unlike C<ev_timer>, periodic watchers are not based on real time (or 2233Unlike C<ev_timer>, periodic watchers are not based on real time (or
2198relative time, the physical time that passes) but on wall clock time 2234relative time, the physical time that passes) but on wall clock time
2199(absolute time, the thing you can read on your calender or clock). The 2235(absolute time, the thing you can read on your calendar or clock). The
2200difference is that wall clock time can run faster or slower than real 2236difference is that wall clock time can run faster or slower than real
2201time, and time jumps are not uncommon (e.g. when you adjust your 2237time, and time jumps are not uncommon (e.g. when you adjust your
2202wrist-watch). 2238wrist-watch).
2203 2239
2204You can tell a periodic watcher to trigger after some specific point 2240You can tell a periodic watcher to trigger after some specific point
2209C<ev_timer>, which would still trigger roughly 10 seconds after starting 2245C<ev_timer>, which would still trigger roughly 10 seconds after starting
2210it, as it uses a relative timeout). 2246it, as it uses a relative timeout).
2211 2247
2212C<ev_periodic> watchers can also be used to implement vastly more complex 2248C<ev_periodic> watchers can also be used to implement vastly more complex
2213timers, such as triggering an event on each "midnight, local time", or 2249timers, such as triggering an event on each "midnight, local time", or
2214other complicated rules. This cannot be done with C<ev_timer> watchers, as 2250other complicated rules. This cannot easily be done with C<ev_timer>
2215those cannot react to time jumps. 2251watchers, as those cannot react to time jumps.
2216 2252
2217As with timers, the callback is guaranteed to be invoked only when the 2253As with timers, the callback is guaranteed to be invoked only when the
2218point in time where it is supposed to trigger has passed. If multiple 2254point in time where it is supposed to trigger has passed. If multiple
2219timers become ready during the same loop iteration then the ones with 2255timers become ready during the same loop iteration then the ones with
2220earlier time-out values are invoked before ones with later time-out values 2256earlier time-out values are invoked before ones with later time-out values
2306 2342
2307NOTE: I<< This callback must always return a time that is higher than or 2343NOTE: I<< This callback must always return a time that is higher than or
2308equal to the passed C<now> value >>. 2344equal to the passed C<now> value >>.
2309 2345
2310This can be used to create very complex timers, such as a timer that 2346This can be used to create very complex timers, such as a timer that
2311triggers on "next midnight, local time". To do this, you would calculate the 2347triggers on "next midnight, local time". To do this, you would calculate
2312next midnight after C<now> and return the timestamp value for this. How 2348the next midnight after C<now> and return the timestamp value for
2313you do this is, again, up to you (but it is not trivial, which is the main 2349this. Here is a (completely untested, no error checking) example on how to
2314reason I omitted it as an example). 2350do this:
2351
2352 #include <time.h>
2353
2354 static ev_tstamp
2355 my_rescheduler (ev_periodic *w, ev_tstamp now)
2356 {
2357 time_t tnow = (time_t)now;
2358 struct tm tm;
2359 localtime_r (&tnow, &tm);
2360
2361 tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day
2362 ++tm.tm_mday; // midnight next day
2363
2364 return mktime (&tm);
2365 }
2366
2367Note: this code might run into trouble on days that have more then two
2368midnights (beginning and end).
2315 2369
2316=back 2370=back
2317 2371
2318=item ev_periodic_again (loop, ev_periodic *) 2372=item ev_periodic_again (loop, ev_periodic *)
2319 2373
2384 2438
2385 ev_periodic hourly_tick; 2439 ev_periodic hourly_tick;
2386 ev_periodic_init (&hourly_tick, clock_cb, 2440 ev_periodic_init (&hourly_tick, clock_cb,
2387 fmod (ev_now (loop), 3600.), 3600., 0); 2441 fmod (ev_now (loop), 3600.), 3600., 0);
2388 ev_periodic_start (loop, &hourly_tick); 2442 ev_periodic_start (loop, &hourly_tick);
2389 2443
2390 2444
2391=head2 C<ev_signal> - signal me when a signal gets signalled! 2445=head2 C<ev_signal> - signal me when a signal gets signalled!
2392 2446
2393Signal watchers will trigger an event when the process receives a specific 2447Signal watchers will trigger an event when the process receives a specific
2394signal one or more times. Even though signals are very asynchronous, libev 2448signal 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 2458only 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 2459default 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 2460C<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. 2461the moment, C<SIGCHLD> is permanently tied to the default loop.
2408 2462
2409When the first watcher gets started will libev actually register something 2463Only 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 2464register something with the kernel. It thus coexists with your own signal
2411you don't register any with libev for the same signal). 2465handlers as long as you don't register any with libev for the same signal.
2412 2466
2413If possible and supported, libev will install its handlers with 2467If possible and supported, libev will install its handlers with
2414C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should 2468C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2415not be unduly interrupted. If you have a problem with system calls getting 2469not 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 2470interrupted by signals you can block all signals in an C<ev_check> watcher
2601 2655
2602=head2 C<ev_stat> - did the file attributes just change? 2656=head2 C<ev_stat> - did the file attributes just change?
2603 2657
2604This watches a file system path for attribute changes. That is, it calls 2658This 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) 2659C<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 2660and sees if it changed compared to the last time, invoking the callback
2607it did. 2661if it did. Starting the watcher C<stat>'s the file, so only changes that
2662happen after the watcher has been started will be reported.
2608 2663
2609The path does not need to exist: changing from "path exists" to "path does 2664The 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 2665not 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 2666exist" (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 2667C<st_nlink> field being zero (which is otherwise always forced to be at
2842Apart from keeping your process non-blocking (which is a useful 2897Apart from keeping your process non-blocking (which is a useful
2843effect on its own sometimes), idle watchers are a good place to do 2898effect on its own sometimes), idle watchers are a good place to do
2844"pseudo-background processing", or delay processing stuff to after the 2899"pseudo-background processing", or delay processing stuff to after the
2845event loop has handled all outstanding events. 2900event loop has handled all outstanding events.
2846 2901
2902=head3 Abusing an C<ev_idle> watcher for its side-effect
2903
2904As long as there is at least one active idle watcher, libev will never
2905sleep unnecessarily. Or in other words, it will loop as fast as possible.
2906For this to work, the idle watcher doesn't need to be invoked at all - the
2907lowest priority will do.
2908
2909This mode of operation can be useful together with an C<ev_check> watcher,
2910to do something on each event loop iteration - for example to balance load
2911between different connections.
2912
2913See L</Abusing an ev_check watcher for its side-effect> for a longer
2914example.
2915
2847=head3 Watcher-Specific Functions and Data Members 2916=head3 Watcher-Specific Functions and Data Members
2848 2917
2849=over 4 2918=over 4
2850 2919
2851=item ev_idle_init (ev_idle *, callback) 2920=item ev_idle_init (ev_idle *, callback)
2862callback, free it. Also, use no error checking, as usual. 2931callback, free it. Also, use no error checking, as usual.
2863 2932
2864 static void 2933 static void
2865 idle_cb (struct ev_loop *loop, ev_idle *w, int revents) 2934 idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2866 { 2935 {
2936 // stop the watcher
2937 ev_idle_stop (loop, w);
2938
2939 // now we can free it
2867 free (w); 2940 free (w);
2941
2868 // now do something you wanted to do when the program has 2942 // now do something you wanted to do when the program has
2869 // no longer anything immediate to do. 2943 // no longer anything immediate to do.
2870 } 2944 }
2871 2945
2872 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2946 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2874 ev_idle_start (loop, idle_watcher); 2948 ev_idle_start (loop, idle_watcher);
2875 2949
2876 2950
2877=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2951=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2878 2952
2879Prepare and check watchers are usually (but not always) used in pairs: 2953Prepare and check watchers are often (but not always) used in pairs:
2880prepare watchers get invoked before the process blocks and check watchers 2954prepare watchers get invoked before the process blocks and check watchers
2881afterwards. 2955afterwards.
2882 2956
2883You I<must not> call C<ev_run> or similar functions that enter 2957You I<must not> call C<ev_run> (or similar functions that enter the
2884the current event loop from either C<ev_prepare> or C<ev_check> 2958current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2885watchers. Other loops than the current one are fine, however. The 2959C<ev_check> watchers. Other loops than the current one are fine,
2886rationale behind this is that you do not need to check for recursion in 2960however. The rationale behind this is that you do not need to check
2887those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2961for recursion in those watchers, i.e. the sequence will always be
2888C<ev_check> so if you have one watcher of each kind they will always be 2962C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2889called in pairs bracketing the blocking call. 2963kind they will always be called in pairs bracketing the blocking call.
2890 2964
2891Their main purpose is to integrate other event mechanisms into libev and 2965Their main purpose is to integrate other event mechanisms into libev and
2892their use is somewhat advanced. They could be used, for example, to track 2966their use is somewhat advanced. They could be used, for example, to track
2893variable changes, implement your own watchers, integrate net-snmp or a 2967variable changes, implement your own watchers, integrate net-snmp or a
2894coroutine library and lots more. They are also occasionally useful if 2968coroutine library and lots more. They are also occasionally useful if
2912with priority higher than or equal to the event loop and one coroutine 2986with 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 2987of lower priority, but only once, using idle watchers to keep the event
2914loop from blocking if lower-priority coroutines are active, thus mapping 2988loop from blocking if lower-priority coroutines are active, thus mapping
2915low-priority coroutines to idle/background tasks). 2989low-priority coroutines to idle/background tasks).
2916 2990
2917It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 2991When 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 2992highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2919after the poll (this doesn't matter for C<ev_prepare> watchers). 2993any other watchers after the poll (this doesn't matter for C<ev_prepare>
2994watchers).
2920 2995
2921Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not 2996Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2922activate ("feed") events into libev. While libev fully supports this, they 2997activate ("feed") events into libev. While libev fully supports this, they
2923might get executed before other C<ev_check> watchers did their job. As 2998might 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 2999C<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 3000loops those other event loops might be in an unusable state until their
2926C<ev_check> watcher ran (always remind yourself to coexist peacefully with 3001C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2927others). 3002others).
3003
3004=head3 Abusing an C<ev_check> watcher for its side-effect
3005
3006C<ev_check> (and less often also C<ev_prepare>) watchers can also be
3007useful because they are called once per event loop iteration. For
3008example, if you want to handle a large number of connections fairly, you
3009normally only do a bit of work for each active connection, and if there
3010is more work to do, you wait for the next event loop iteration, so other
3011connections have a chance of making progress.
3012
3013Using an C<ev_check> watcher is almost enough: it will be called on the
3014next event loop iteration. However, that isn't as soon as possible -
3015without external events, your C<ev_check> watcher will not be invoked.
3016
3017This is where C<ev_idle> watchers come in handy - all you need is a
3018single global idle watcher that is active as long as you have one active
3019C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
3020will not sleep, and the C<ev_check> watcher makes sure a callback gets
3021invoked. Neither watcher alone can do that.
2928 3022
2929=head3 Watcher-Specific Functions and Data Members 3023=head3 Watcher-Specific Functions and Data Members
2930 3024
2931=over 4 3025=over 4
2932 3026
3133 3227
3134=over 4 3228=over 4
3135 3229
3136=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3230=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3137 3231
3138=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3232=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3139 3233
3140Configures the watcher to embed the given loop, which must be 3234Configures the watcher to embed the given loop, which must be
3141embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3235embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3142invoked automatically, otherwise it is the responsibility of the callback 3236invoked automatically, otherwise it is the responsibility of the callback
3143to invoke it (it will continue to be called until the sweep has been done, 3237to invoke it (it will continue to be called until the sweep has been done,
3164used). 3258used).
3165 3259
3166 struct ev_loop *loop_hi = ev_default_init (0); 3260 struct ev_loop *loop_hi = ev_default_init (0);
3167 struct ev_loop *loop_lo = 0; 3261 struct ev_loop *loop_lo = 0;
3168 ev_embed embed; 3262 ev_embed embed;
3169 3263
3170 // see if there is a chance of getting one that works 3264 // see if there is a chance of getting one that works
3171 // (remember that a flags value of 0 means autodetection) 3265 // (remember that a flags value of 0 means autodetection)
3172 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 3266 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3173 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 3267 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3174 : 0; 3268 : 0;
3188C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 3282C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3189 3283
3190 struct ev_loop *loop = ev_default_init (0); 3284 struct ev_loop *loop = ev_default_init (0);
3191 struct ev_loop *loop_socket = 0; 3285 struct ev_loop *loop_socket = 0;
3192 ev_embed embed; 3286 ev_embed embed;
3193 3287
3194 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 3288 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3195 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 3289 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3196 { 3290 {
3197 ev_embed_init (&embed, 0, loop_socket); 3291 ev_embed_init (&embed, 0, loop_socket);
3198 ev_embed_start (loop, &embed); 3292 ev_embed_start (loop, &embed);
3206 3300
3207=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3301=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3208 3302
3209Fork watchers are called when a C<fork ()> was detected (usually because 3303Fork watchers are called when a C<fork ()> was detected (usually because
3210whoever is a good citizen cared to tell libev about it by calling 3304whoever 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 3305C<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, 3306and 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 3307after 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 3308and calls it in the wrong process, the fork handlers will be invoked, too,
3215handlers will be invoked, too, of course. 3309of course.
3216 3310
3217=head3 The special problem of life after fork - how is it possible? 3311=head3 The special problem of life after fork - how is it possible?
3218 3312
3219Most uses of C<fork()> consist of forking, then some simple calls to set 3313Most 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 3314up/change the process environment, followed by a call to C<exec()>. This
3221sequence should be handled by libev without any problems. 3315sequence should be handled by libev without any problems.
3222 3316
3223This changes when the application actually wants to do event handling 3317This changes when the application actually wants to do event handling
3224in the child, or both parent in child, in effect "continuing" after the 3318in the child, or both parent in child, in effect "continuing" after the
3313it by calling C<ev_async_send>, which is thread- and signal safe. 3407it by calling C<ev_async_send>, which is thread- and signal safe.
3314 3408
3315This functionality is very similar to C<ev_signal> watchers, as signals, 3409This functionality is very similar to C<ev_signal> watchers, as signals,
3316too, are asynchronous in nature, and signals, too, will be compressed 3410too, 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 3411(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 3412C<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 3413of "global async watchers" by using a watcher on an otherwise unused
3320signal, and C<ev_feed_signal> to signal this watcher from another thread, 3414signal, and C<ev_feed_signal> to signal this watcher from another thread,
3321even without knowing which loop owns the signal. 3415even without knowing which loop owns the signal.
3322 3416
3323=head3 Queueing 3417=head3 Queueing
3462 3556
3463There are some other functions of possible interest. Described. Here. Now. 3557There are some other functions of possible interest. Described. Here. Now.
3464 3558
3465=over 4 3559=over 4
3466 3560
3467=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback) 3561=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg)
3468 3562
3469This function combines a simple timer and an I/O watcher, calls your 3563This function combines a simple timer and an I/O watcher, calls your
3470callback on whichever event happens first and automatically stops both 3564callback on whichever event happens first and automatically stops both
3471watchers. This is useful if you want to wait for a single event on an fd 3565watchers. This is useful if you want to wait for a single event on an fd
3472or timeout without having to allocate/configure/start/stop/free one or 3566or timeout without having to allocate/configure/start/stop/free one or
3614already been invoked. 3708already been invoked.
3615 3709
3616A common way around all these issues is to make sure that 3710A common way around all these issues is to make sure that
3617C<start_new_request> I<always> returns before the callback is invoked. If 3711C<start_new_request> I<always> returns before the callback is invoked. If
3618C<start_new_request> immediately knows the result, it can artificially 3712C<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 3713delay invoking the callback by using a C<prepare> or C<idle> watcher for
3620for example, or more sneakily, by reusing an existing (stopped) watcher 3714example, or more sneakily, by reusing an existing (stopped) watcher and
3621and pushing it into the pending queue: 3715pushing it into the pending queue:
3622 3716
3623 ev_set_cb (watcher, callback); 3717 ev_set_cb (watcher, callback);
3624 ev_feed_event (EV_A_ watcher, 0); 3718 ev_feed_event (EV_A_ watcher, 0);
3625 3719
3626This way, C<start_new_request> can safely return before the callback is 3720This way, C<start_new_request> can safely return before the callback is
3634 3728
3635This brings the problem of exiting - a callback might want to finish the 3729This 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 3730main 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 3731a 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 3732and 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. 3733other combination: In these cases, a simple C<ev_break> will not work.
3640 3734
3641The solution is to maintain "break this loop" variable for each C<ev_run> 3735The 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 3736invocation, and use a loop around C<ev_run> until the condition is
3643triggered, using C<EVRUN_ONCE>: 3737triggered, using C<EVRUN_ONCE>:
3644 3738
3830called): 3924called):
3831 3925
3832 void 3926 void
3833 wait_for_event (ev_watcher *w) 3927 wait_for_event (ev_watcher *w)
3834 { 3928 {
3835 ev_cb_set (w) = current_coro; 3929 ev_set_cb (w, current_coro);
3836 switch_to (libev_coro); 3930 switch_to (libev_coro);
3837 } 3931 }
3838 3932
3839That basically suspends the coroutine inside C<wait_for_event> and 3933That basically suspends the coroutine inside C<wait_for_event> and
3840continues the libev coroutine, which, when appropriate, switches back to 3934continues the libev coroutine, which, when appropriate, switches back to
3843You can do similar tricks if you have, say, threads with an event queue - 3937You 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 3938instead 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 3939switching to a coroutine, you push the watcher onto the queue and notify
3846any waiters. 3940any waiters.
3847 3941
3848To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two 3942To 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: 3943files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3850 3944
3851 // my_ev.h 3945 // my_ev.h
3852 #define EV_CB_DECLARE(type) struct my_coro *cb; 3946 #define EV_CB_DECLARE(type) struct my_coro *cb;
3853 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); 3947 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3854 #include "../libev/ev.h" 3948 #include "../libev/ev.h"
3855 3949
3856 // my_ev.c 3950 // my_ev.c
3857 #define EV_H "my_ev.h" 3951 #define EV_H "my_ev.h"
3858 #include "../libev/ev.c" 3952 #include "../libev/ev.c"
3897 3991
3898=back 3992=back
3899 3993
3900=head1 C++ SUPPORT 3994=head1 C++ SUPPORT
3901 3995
3996=head2 C API
3997
3998The normal C API should work fine when used from C++: both ev.h and the
3999libev sources can be compiled as C++. Therefore, code that uses the C API
4000will work fine.
4001
4002Proper exception specifications might have to be added to callbacks passed
4003to libev: exceptions may be thrown only from watcher callbacks, all other
4004callbacks (allocator, syserr, loop acquire/release and periodic reschedule
4005callbacks) must not throw exceptions, and might need a C<noexcept>
4006specification. If you have code that needs to be compiled as both C and
4007C++ you can use the C<EV_NOEXCEPT> macro for this:
4008
4009 static void
4010 fatal_error (const char *msg) EV_NOEXCEPT
4011 {
4012 perror (msg);
4013 abort ();
4014 }
4015
4016 ...
4017 ev_set_syserr_cb (fatal_error);
4018
4019The only API functions that can currently throw exceptions are C<ev_run>,
4020C<ev_invoke>, C<ev_invoke_pending> and C<ev_loop_destroy> (the latter
4021because it runs cleanup watchers).
4022
4023Throwing exceptions in watcher callbacks is only supported if libev itself
4024is compiled with a C++ compiler or your C and C++ environments allow
4025throwing exceptions through C libraries (most do).
4026
4027=head2 C++ API
4028
3902Libev comes with some simplistic wrapper classes for C++ that mainly allow 4029Libev comes with some simplistic wrapper classes for C++ that mainly allow
3903you to use some convenience methods to start/stop watchers and also change 4030you to use some convenience methods to start/stop watchers and also change
3904the callback model to a model using method callbacks on objects. 4031the callback model to a model using method callbacks on objects.
3905 4032
3906To use it, 4033To use it,
3907 4034
3908 #include <ev++.h> 4035 #include <ev++.h>
3909 4036
3910This automatically includes F<ev.h> and puts all of its definitions (many 4037This automatically includes F<ev.h> and puts all of its definitions (many
3911of them macros) into the global namespace. All C++ specific things are 4038of them macros) into the global namespace. All C++ specific things are
3912put into the C<ev> namespace. It should support all the same embedding 4039put into the C<ev> namespace. It should support all the same embedding
4015 void operator() (ev::io &w, int revents) 4142 void operator() (ev::io &w, int revents)
4016 { 4143 {
4017 ... 4144 ...
4018 } 4145 }
4019 } 4146 }
4020 4147
4021 myfunctor f; 4148 myfunctor f;
4022 4149
4023 ev::io w; 4150 ev::io w;
4024 w.set (&f); 4151 w.set (&f);
4025 4152
4043Associates a different C<struct ev_loop> with this watcher. You can only 4170Associates a different C<struct ev_loop> with this watcher. You can only
4044do this when the watcher is inactive (and not pending either). 4171do this when the watcher is inactive (and not pending either).
4045 4172
4046=item w->set ([arguments]) 4173=item w->set ([arguments])
4047 4174
4048Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4175Basically 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 4176with the same arguments. Either this method or a suitable start method
4050C counterpart, an active watcher gets automatically stopped and restarted 4177must be called at least once. Unlike the C counterpart, an active watcher
4051when reconfiguring it with this method. 4178gets automatically stopped and restarted when reconfiguring it with this
4179method.
4180
4181For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4182clashing with the C<set (loop)> method.
4052 4183
4053=item w->start () 4184=item w->start ()
4054 4185
4055Starts the watcher. Note that there is no C<loop> argument, as the 4186Starts the watcher. Note that there is no C<loop> argument, as the
4056constructor already stores the event loop. 4187constructor already stores the event loop.
4160 4291
4161Brian Maher has written a partial interface to libev for lua (at the 4292Brian 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 4293time of this writing, only C<ev_io> and C<ev_timer>), to be found at
4163L<http://github.com/brimworks/lua-ev>. 4294L<http://github.com/brimworks/lua-ev>.
4164 4295
4296=item Javascript
4297
4298Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
4299
4300=item Others
4301
4302There are others, and I stopped counting.
4303
4165=back 4304=back
4166 4305
4167 4306
4168=head1 MACRO MAGIC 4307=head1 MACRO MAGIC
4169 4308
4286 ev_vars.h 4425 ev_vars.h
4287 ev_wrap.h 4426 ev_wrap.h
4288 4427
4289 ev_win32.c required on win32 platforms only 4428 ev_win32.c required on win32 platforms only
4290 4429
4291 ev_select.c only when select backend is enabled (which is enabled by default) 4430 ev_select.c only when select backend is enabled
4292 ev_poll.c only when poll backend is enabled (disabled by default) 4431 ev_poll.c only when poll backend is enabled
4293 ev_epoll.c only when the epoll backend is enabled (disabled by default) 4432 ev_epoll.c only when the epoll backend is enabled
4294 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 4433 ev_kqueue.c only when the kqueue backend is enabled
4295 ev_port.c only when the solaris port backend is enabled (disabled by default) 4434 ev_port.c only when the solaris port backend is enabled
4296 4435
4297F<ev.c> includes the backend files directly when enabled, so you only need 4436F<ev.c> includes the backend files directly when enabled, so you only need
4298to compile this single file. 4437to compile this single file.
4299 4438
4300=head3 LIBEVENT COMPATIBILITY API 4439=head3 LIBEVENT COMPATIBILITY API
4467 4606
4468If programs implement their own fd to handle mapping on win32, then this 4607If 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 4608macro can be used to override the C<close> function, useful to unregister
4470file descriptors again. Note that the replacement function has to close 4609file descriptors again. Note that the replacement function has to close
4471the underlying OS handle. 4610the underlying OS handle.
4611
4612=item EV_USE_WSASOCKET
4613
4614If defined to be C<1>, libev will use C<WSASocket> to create its internal
4615communication socket, which works better in some environments. Otherwise,
4616the normal C<socket> function will be used, which works better in other
4617environments.
4472 4618
4473=item EV_USE_POLL 4619=item EV_USE_POLL
4474 4620
4475If defined to be C<1>, libev will compile in support for the C<poll>(2) 4621If 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 4622backend. Otherwise it will be enabled on non-win32 platforms. It
4521different cpus (or different cpu cores). This reduces dependencies 4667different cpus (or different cpu cores). This reduces dependencies
4522and makes libev faster. 4668and makes libev faster.
4523 4669
4524=item EV_NO_THREADS 4670=item EV_NO_THREADS
4525 4671
4526If defined to be C<1>, libev will assume that it will never be called 4672If 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>, 4673different threads (that includes signal handlers), which is a stronger
4528above. This reduces dependencies and makes libev faster. 4674assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4675libev faster.
4529 4676
4530=item EV_ATOMIC_T 4677=item EV_ATOMIC_T
4531 4678
4532Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4679Libev 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 4680access 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 4681such 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 4682type 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 4683handler "locking" as well as for signal and thread safety in C<ev_async>
4537in C<ev_async> watchers. 4684watchers.
4538 4685
4539In the absence of this define, libev will use C<sig_atomic_t volatile> 4686In 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, 4687(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 4688
4544=item EV_H (h) 4689=item EV_H (h)
4545 4690
4546The name of the F<ev.h> header file used to include it. The default if 4691The 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 4692undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
4620 #define EV_USE_POLL 1 4765 #define EV_USE_POLL 1
4621 #define EV_CHILD_ENABLE 1 4766 #define EV_CHILD_ENABLE 1
4622 #define EV_ASYNC_ENABLE 1 4767 #define EV_ASYNC_ENABLE 1
4623 4768
4624The actual value is a bitset, it can be a combination of the following 4769The actual value is a bitset, it can be a combination of the following
4625values: 4770values (by default, all of these are enabled):
4626 4771
4627=over 4 4772=over 4
4628 4773
4629=item C<1> - faster/larger code 4774=item C<1> - faster/larger code
4630 4775
4634code size by roughly 30% on amd64). 4779code size by roughly 30% on amd64).
4635 4780
4636When optimising for size, use of compiler flags such as C<-Os> with 4781When 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 4782gcc is recommended, as well as C<-DNDEBUG>, as libev contains a number of
4638assertions. 4783assertions.
4784
4785The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4786(e.g. gcc with C<-Os>).
4639 4787
4640=item C<2> - faster/larger data structures 4788=item C<2> - faster/larger data structures
4641 4789
4642Replaces the small 2-heap for timer management by a faster 4-heap, larger 4790Replaces 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 4791hash 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 4792and can additionally have an effect on the size of data structures at
4645runtime. 4793runtime.
4794
4795The default is off when C<__OPTIMIZE_SIZE__> is defined by your compiler
4796(e.g. gcc with C<-Os>).
4646 4797
4647=item C<4> - full API configuration 4798=item C<4> - full API configuration
4648 4799
4649This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and 4800This enables priorities (sets C<EV_MAXPRI>=2 and C<EV_MINPRI>=-2), and
4650enables multiplicity (C<EV_MULTIPLICITY>=1). 4801enables multiplicity (C<EV_MULTIPLICITY>=1).
4909default loop and triggering an C<ev_async> watcher from the default loop 5060default loop and triggering an C<ev_async> watcher from the default loop
4910watcher callback into the event loop interested in the signal. 5061watcher callback into the event loop interested in the signal.
4911 5062
4912=back 5063=back
4913 5064
4914See also L<THREAD LOCKING EXAMPLE>. 5065See also L</THREAD LOCKING EXAMPLE>.
4915 5066
4916=head3 COROUTINES 5067=head3 COROUTINES
4917 5068
4918Libev is very accommodating to coroutines ("cooperative threads"): 5069Libev is very accommodating to coroutines ("cooperative threads"):
4919libev fully supports nesting calls to its functions from different 5070libev fully supports nesting calls to its functions from different
5188structure (guaranteed by POSIX but not by ISO C for example), but it also 5339structure (guaranteed by POSIX but not by ISO C for example), but it also
5189assumes that the same (machine) code can be used to call any watcher 5340assumes that the same (machine) code can be used to call any watcher
5190callback: The watcher callbacks have different type signatures, but libev 5341callback: The watcher callbacks have different type signatures, but libev
5191calls them using an C<ev_watcher *> internally. 5342calls them using an C<ev_watcher *> internally.
5192 5343
5344=item null pointers and integer zero are represented by 0 bytes
5345
5346Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and
5347relies on this setting pointers and integers to null.
5348
5193=item pointer accesses must be thread-atomic 5349=item pointer accesses must be thread-atomic
5194 5350
5195Accessing a pointer value must be atomic, it must both be readable and 5351Accessing a pointer value must be atomic, it must both be readable and
5196writable in one piece - this is the case on all current architectures. 5352writable in one piece - this is the case on all current architectures.
5197 5353
5210thread" or will block signals process-wide, both behaviours would 5366thread" or will block signals process-wide, both behaviours would
5211be compatible with libev. Interaction between C<sigprocmask> and 5367be compatible with libev. Interaction between C<sigprocmask> and
5212C<pthread_sigmask> could complicate things, however. 5368C<pthread_sigmask> could complicate things, however.
5213 5369
5214The most portable way to handle signals is to block signals in all threads 5370The 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 5371except the initial one, and run the signal handling loop in the initial
5216well. 5372thread as well.
5217 5373
5218=item C<long> must be large enough for common memory allocation sizes 5374=item C<long> must be large enough for common memory allocation sizes
5219 5375
5220To improve portability and simplify its API, libev uses C<long> internally 5376To improve portability and simplify its API, libev uses C<long> internally
5221instead of C<size_t> when allocating its data structures. On non-POSIX 5377instead of C<size_t> when allocating its data structures. On non-POSIX
5325=over 4 5481=over 4
5326 5482
5327=item C<EV_COMPAT3> backwards compatibility mechanism 5483=item C<EV_COMPAT3> backwards compatibility mechanism
5328 5484
5329The backward compatibility mechanism can be controlled by 5485The backward compatibility mechanism can be controlled by
5330C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> 5486C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5331section. 5487section.
5332 5488
5333=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5489=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5334 5490
5335These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5491These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5378=over 4 5534=over 4
5379 5535
5380=item active 5536=item active
5381 5537
5382A watcher is active as long as it has been started and not yet stopped. 5538A watcher is active as long as it has been started and not yet stopped.
5383See L<WATCHER STATES> for details. 5539See L</WATCHER STATES> for details.
5384 5540
5385=item application 5541=item application
5386 5542
5387In this document, an application is whatever is using libev. 5543In this document, an application is whatever is using libev.
5388 5544
5424watchers and events. 5580watchers and events.
5425 5581
5426=item pending 5582=item pending
5427 5583
5428A watcher is pending as soon as the corresponding event has been 5584A watcher is pending as soon as the corresponding event has been
5429detected. See L<WATCHER STATES> for details. 5585detected. See L</WATCHER STATES> for details.
5430 5586
5431=item real time 5587=item real time
5432 5588
5433The physical time that is observed. It is apparently strictly monotonic :) 5589The physical time that is observed. It is apparently strictly monotonic :)
5434 5590

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines