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.433 by root, Fri May 2 07:05:42 2014 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines