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

Comparing libev/ev.pod (file contents):
Revision 1.405 by root, Thu May 3 15:07:15 2012 UTC vs.
Revision 1.444 by root, Mon Oct 29 00:00:22 2018 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
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.
408 412
409This works by calling C<getpid ()> on every iteration of the loop, 413This 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 414and 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 415iterations 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 416GNU/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 417sequence without a system call and thus I<very> fast, but my GNU/Linux
414C<pthread_atfork> which is even faster). 418system also has C<pthread_atfork> which is even faster). (Update: glibc
419versions 2.25 apparently removed the C<getpid> optimisation again).
415 420
416The big advantage of this flag is that you can forget about fork (and 421The 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 422forget about forgetting to tell libev about forking, although you still
418flag. 423have to ignore C<SIGPIPE>) when you use this flag.
419 424
420This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS> 425This flag setting cannot be overridden or specified in the C<LIBEV_FLAGS>
421environment variable. 426environment variable.
422 427
423=item C<EVFLAG_NOINOTIFY> 428=item C<EVFLAG_NOINOTIFY>
569kernel is more efficient (which says nothing about its actual speed, of 574kernel is more efficient (which says nothing about its actual speed, of
570course). While stopping, setting and starting an I/O watcher does never 575course). 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 576cause 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 577two 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 578might 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 579drops fds silently in similarly hard-to-detect cases.
575 580
576This backend usually performs well under most conditions. 581This backend usually performs well under most conditions.
577 582
578While nominally embeddable in other event loops, this doesn't work 583While nominally embeddable in other event loops, this doesn't work
579everywhere, so you might need to test for this. And since it is broken 584everywhere, 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> 683If you need dynamically allocated loops it is better to use C<ev_loop_new>
679and C<ev_loop_destroy>. 684and C<ev_loop_destroy>.
680 685
681=item ev_loop_fork (loop) 686=item ev_loop_fork (loop)
682 687
683This function sets a flag that causes subsequent C<ev_run> iterations to 688This function sets a flag that causes subsequent C<ev_run> iterations
684reinitialise the kernel state for backends that have one. Despite the 689to reinitialise the kernel state for backends that have one. Despite
685name, you can call it anytime, but it makes most sense after forking, in 690the 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 691watchers (except inside an C<ev_prepare> callback), but it makes most
692sense after forking, in the child process. You I<must> call it (or use
687child before resuming or calling C<ev_run>. 693C<EVFLAG_FORKCHECK>) in the child before resuming or calling C<ev_run>.
688 694
695In addition, if you want to reuse a loop (via this function or
696C<EVFLAG_FORKCHECK>), you I<also> have to ignore C<SIGPIPE>.
697
689Again, you I<have> to call it on I<any> loop that you want to re-use after 698Again, 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 699a 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 700because some kernel interfaces *cough* I<kqueue> *cough* do funny things
692during fork. 701during fork.
693 702
694On the other hand, you only need to call this function in the child 703On the other hand, you only need to call this function in the child
764 773
765This function is rarely useful, but when some event callback runs for a 774This 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 775very long time without entering the event loop, updating libev's idea of
767the current time is a good idea. 776the current time is a good idea.
768 777
769See also L<The special problem of time updates> in the C<ev_timer> section. 778See also L</The special problem of time updates> in the C<ev_timer> section.
770 779
771=item ev_suspend (loop) 780=item ev_suspend (loop)
772 781
773=item ev_resume (loop) 782=item ev_resume (loop)
774 783
1318 1327
1319=item callback ev_cb (ev_TYPE *watcher) 1328=item callback ev_cb (ev_TYPE *watcher)
1320 1329
1321Returns the callback currently set on the watcher. 1330Returns the callback currently set on the watcher.
1322 1331
1323=item ev_cb_set (ev_TYPE *watcher, callback) 1332=item ev_set_cb (ev_TYPE *watcher, callback)
1324 1333
1325Change the callback. You can change the callback at virtually any time 1334Change the callback. You can change the callback at virtually any time
1326(modulo threads). 1335(modulo threads).
1327 1336
1328=item ev_set_priority (ev_TYPE *watcher, int priority) 1337=item ev_set_priority (ev_TYPE *watcher, int priority)
1346or might not have been clamped to the valid range. 1355or might not have been clamped to the valid range.
1347 1356
1348The default priority used by watchers when no priority has been set is 1357The default priority used by watchers when no priority has been set is
1349always C<0>, which is supposed to not be too high and not be too low :). 1358always C<0>, which is supposed to not be too high and not be too low :).
1350 1359
1351See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of 1360See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1352priorities. 1361priorities.
1353 1362
1354=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1363=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1355 1364
1356Invoke the C<watcher> with the given C<loop> and C<revents>. Neither 1365Invoke the C<watcher> with the given C<loop> and C<revents>. Neither
1381See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related 1390See also C<ev_feed_fd_event> and C<ev_feed_signal_event> for related
1382functions that do not need a watcher. 1391functions that do not need a watcher.
1383 1392
1384=back 1393=back
1385 1394
1386See also the L<ASSOCIATING CUSTOM DATA WITH A WATCHER> and L<BUILDING YOUR 1395See also the L</ASSOCIATING CUSTOM DATA WITH A WATCHER> and L</BUILDING YOUR
1387OWN COMPOSITE WATCHERS> idioms. 1396OWN COMPOSITE WATCHERS> idioms.
1388 1397
1389=head2 WATCHER STATES 1398=head2 WATCHER STATES
1390 1399
1391There are various watcher states mentioned throughout this manual - 1400There are various watcher states mentioned throughout this manual -
1393transition between them will be described in more detail - and while these 1402transition between them will be described in more detail - and while these
1394rules might look complicated, they usually do "the right thing". 1403rules might look complicated, they usually do "the right thing".
1395 1404
1396=over 4 1405=over 4
1397 1406
1398=item initialiased 1407=item initialised
1399 1408
1400Before a watcher can be registered with the event loop it has to be 1409Before a watcher can be registered with the event loop it has to be
1401initialised. This can be done with a call to C<ev_TYPE_init>, or calls to 1410initialised. This can be done with a call to C<ev_TYPE_init>, or calls to
1402C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function. 1411C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1403 1412
2024 2033
2025The relative timeouts are calculated relative to the C<ev_now ()> 2034The relative timeouts are calculated relative to the C<ev_now ()>
2026time. This is usually the right thing as this timestamp refers to the time 2035time. This is usually the right thing as this timestamp refers to the time
2027of the event triggering whatever timeout you are modifying/starting. If 2036of the event triggering whatever timeout you are modifying/starting. If
2028you suspect event processing to be delayed and you I<need> to base the 2037you suspect event processing to be delayed and you I<need> to base the
2029timeout on the current time, use something like this to adjust for this: 2038timeout on the current time, use something like the following to adjust
2039for it:
2030 2040
2031 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 2041 ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
2032 2042
2033If the event loop is suspended for a long time, you can also force an 2043If the event loop is suspended for a long time, you can also force an
2034update of the time returned by C<ev_now ()> by calling C<ev_now_update 2044update of the time returned by C<ev_now ()> by calling C<ev_now_update
2035()>. 2045()>, although that will push the event time of all outstanding events
2046further into the future.
2036 2047
2037=head3 The special problem of unsynchronised clocks 2048=head3 The special problem of unsynchronised clocks
2038 2049
2039Modern systems have a variety of clocks - libev itself uses the normal 2050Modern systems have a variety of clocks - libev itself uses the normal
2040"wall clock" clock and, if available, the monotonic clock (to avoid time 2051"wall clock" clock and, if available, the monotonic clock (to avoid time
2103 2114
2104=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat) 2115=item ev_timer_init (ev_timer *, callback, ev_tstamp after, ev_tstamp repeat)
2105 2116
2106=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat) 2117=item ev_timer_set (ev_timer *, ev_tstamp after, ev_tstamp repeat)
2107 2118
2108Configure the timer to trigger after C<after> seconds. If C<repeat> 2119Configure the timer to trigger after C<after> seconds (fractional and
2109is C<0.>, then it will automatically be stopped once the timeout is 2120negative values are supported). If C<repeat> is C<0.>, then it will
2110reached. If it is positive, then the timer will automatically be 2121automatically be stopped once the timeout is reached. If it is positive,
2111configured to trigger again C<repeat> seconds later, again, and again, 2122then the timer will automatically be configured to trigger again C<repeat>
2112until stopped manually. 2123seconds later, again, and again, until stopped manually.
2113 2124
2114The timer itself will do a best-effort at avoiding drift, that is, if 2125The timer itself will do a best-effort at avoiding drift, that is, if
2115you configure a timer to trigger every 10 seconds, then it will normally 2126you configure a timer to trigger every 10 seconds, then it will normally
2116trigger at exactly 10 second intervals. If, however, your program cannot 2127trigger at exactly 10 second intervals. If, however, your program cannot
2117keep up with the timer (because it takes longer than those 10 seconds to 2128keep up with the timer (because it takes longer than those 10 seconds to
2136=item If the timer is repeating, make the C<repeat> value the new timeout 2147=item If the timer is repeating, make the C<repeat> value the new timeout
2137and start the timer, if necessary. 2148and start the timer, if necessary.
2138 2149
2139=back 2150=back
2140 2151
2141This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2152This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2142usage example. 2153usage example.
2143 2154
2144=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2155=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2145 2156
2146Returns the remaining time until a timer fires. If the timer is active, 2157Returns the remaining time until a timer fires. If the timer is active,
2199Periodic watchers are also timers of a kind, but they are very versatile 2210Periodic watchers are also timers of a kind, but they are very versatile
2200(and unfortunately a bit complex). 2211(and unfortunately a bit complex).
2201 2212
2202Unlike C<ev_timer>, periodic watchers are not based on real time (or 2213Unlike C<ev_timer>, periodic watchers are not based on real time (or
2203relative time, the physical time that passes) but on wall clock time 2214relative time, the physical time that passes) but on wall clock time
2204(absolute time, the thing you can read on your calender or clock). The 2215(absolute time, the thing you can read on your calendar or clock). The
2205difference is that wall clock time can run faster or slower than real 2216difference is that wall clock time can run faster or slower than real
2206time, and time jumps are not uncommon (e.g. when you adjust your 2217time, and time jumps are not uncommon (e.g. when you adjust your
2207wrist-watch). 2218wrist-watch).
2208 2219
2209You can tell a periodic watcher to trigger after some specific point 2220You can tell a periodic watcher to trigger after some specific point
2214C<ev_timer>, which would still trigger roughly 10 seconds after starting 2225C<ev_timer>, which would still trigger roughly 10 seconds after starting
2215it, as it uses a relative timeout). 2226it, as it uses a relative timeout).
2216 2227
2217C<ev_periodic> watchers can also be used to implement vastly more complex 2228C<ev_periodic> watchers can also be used to implement vastly more complex
2218timers, such as triggering an event on each "midnight, local time", or 2229timers, such as triggering an event on each "midnight, local time", or
2219other complicated rules. This cannot be done with C<ev_timer> watchers, as 2230other complicated rules. This cannot easily be done with C<ev_timer>
2220those cannot react to time jumps. 2231watchers, as those cannot react to time jumps.
2221 2232
2222As with timers, the callback is guaranteed to be invoked only when the 2233As with timers, the callback is guaranteed to be invoked only when the
2223point in time where it is supposed to trigger has passed. If multiple 2234point in time where it is supposed to trigger has passed. If multiple
2224timers become ready during the same loop iteration then the ones with 2235timers become ready during the same loop iteration then the ones with
2225earlier time-out values are invoked before ones with later time-out values 2236earlier time-out values are invoked before ones with later time-out values
2311 2322
2312NOTE: I<< This callback must always return a time that is higher than or 2323NOTE: I<< This callback must always return a time that is higher than or
2313equal to the passed C<now> value >>. 2324equal to the passed C<now> value >>.
2314 2325
2315This can be used to create very complex timers, such as a timer that 2326This can be used to create very complex timers, such as a timer that
2316triggers on "next midnight, local time". To do this, you would calculate the 2327triggers on "next midnight, local time". To do this, you would calculate
2317next midnight after C<now> and return the timestamp value for this. How 2328the next midnight after C<now> and return the timestamp value for
2318you do this is, again, up to you (but it is not trivial, which is the main 2329this. Here is a (completely untested, no error checking) example on how to
2319reason I omitted it as an example). 2330do this:
2331
2332 #include <time.h>
2333
2334 static ev_tstamp
2335 my_rescheduler (ev_periodic *w, ev_tstamp now)
2336 {
2337 time_t tnow = (time_t)now;
2338 struct tm tm;
2339 localtime_r (&tnow, &tm);
2340
2341 tm.tm_sec = tm.tm_min = tm.tm_hour = 0; // midnight current day
2342 ++tm.tm_mday; // midnight next day
2343
2344 return mktime (&tm);
2345 }
2346
2347Note: this code might run into trouble on days that have more then two
2348midnights (beginning and end).
2320 2349
2321=back 2350=back
2322 2351
2323=item ev_periodic_again (loop, ev_periodic *) 2352=item ev_periodic_again (loop, ev_periodic *)
2324 2353
2389 2418
2390 ev_periodic hourly_tick; 2419 ev_periodic hourly_tick;
2391 ev_periodic_init (&hourly_tick, clock_cb, 2420 ev_periodic_init (&hourly_tick, clock_cb,
2392 fmod (ev_now (loop), 3600.), 3600., 0); 2421 fmod (ev_now (loop), 3600.), 3600., 0);
2393 ev_periodic_start (loop, &hourly_tick); 2422 ev_periodic_start (loop, &hourly_tick);
2394 2423
2395 2424
2396=head2 C<ev_signal> - signal me when a signal gets signalled! 2425=head2 C<ev_signal> - signal me when a signal gets signalled!
2397 2426
2398Signal watchers will trigger an event when the process receives a specific 2427Signal watchers will trigger an event when the process receives a specific
2399signal one or more times. Even though signals are very asynchronous, libev 2428signal one or more times. Even though signals are very asynchronous, libev
2409only within the same loop, i.e. you can watch for C<SIGINT> in your 2438only within the same loop, i.e. you can watch for C<SIGINT> in your
2410default loop and for C<SIGIO> in another loop, but you cannot watch for 2439default loop and for C<SIGIO> in another loop, but you cannot watch for
2411C<SIGINT> in both the default loop and another loop at the same time. At 2440C<SIGINT> in both the default loop and another loop at the same time. At
2412the moment, C<SIGCHLD> is permanently tied to the default loop. 2441the moment, C<SIGCHLD> is permanently tied to the default loop.
2413 2442
2414When the first watcher gets started will libev actually register something 2443Only after the first watcher for a signal is started will libev actually
2415with the kernel (thus it coexists with your own signal handlers as long as 2444register something with the kernel. It thus coexists with your own signal
2416you don't register any with libev for the same signal). 2445handlers as long as you don't register any with libev for the same signal.
2417 2446
2418If possible and supported, libev will install its handlers with 2447If possible and supported, libev will install its handlers with
2419C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should 2448C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2420not be unduly interrupted. If you have a problem with system calls getting 2449not be unduly interrupted. If you have a problem with system calls getting
2421interrupted by signals you can block all signals in an C<ev_check> watcher 2450interrupted by signals you can block all signals in an C<ev_check> watcher
2606 2635
2607=head2 C<ev_stat> - did the file attributes just change? 2636=head2 C<ev_stat> - did the file attributes just change?
2608 2637
2609This watches a file system path for attribute changes. That is, it calls 2638This watches a file system path for attribute changes. That is, it calls
2610C<stat> on that path in regular intervals (or when the OS says it changed) 2639C<stat> on that path in regular intervals (or when the OS says it changed)
2611and sees if it changed compared to the last time, invoking the callback if 2640and sees if it changed compared to the last time, invoking the callback
2612it did. 2641if it did. Starting the watcher C<stat>'s the file, so only changes that
2642happen after the watcher has been started will be reported.
2613 2643
2614The path does not need to exist: changing from "path exists" to "path does 2644The path does not need to exist: changing from "path exists" to "path does
2615not exist" is a status change like any other. The condition "path does not 2645not exist" is a status change like any other. The condition "path does not
2616exist" (or more correctly "path cannot be stat'ed") is signified by the 2646exist" (or more correctly "path cannot be stat'ed") is signified by the
2617C<st_nlink> field being zero (which is otherwise always forced to be at 2647C<st_nlink> field being zero (which is otherwise always forced to be at
2847Apart from keeping your process non-blocking (which is a useful 2877Apart from keeping your process non-blocking (which is a useful
2848effect on its own sometimes), idle watchers are a good place to do 2878effect on its own sometimes), idle watchers are a good place to do
2849"pseudo-background processing", or delay processing stuff to after the 2879"pseudo-background processing", or delay processing stuff to after the
2850event loop has handled all outstanding events. 2880event loop has handled all outstanding events.
2851 2881
2882=head3 Abusing an C<ev_idle> watcher for its side-effect
2883
2884As long as there is at least one active idle watcher, libev will never
2885sleep unnecessarily. Or in other words, it will loop as fast as possible.
2886For this to work, the idle watcher doesn't need to be invoked at all - the
2887lowest priority will do.
2888
2889This mode of operation can be useful together with an C<ev_check> watcher,
2890to do something on each event loop iteration - for example to balance load
2891between different connections.
2892
2893See L</Abusing an ev_check watcher for its side-effect> for a longer
2894example.
2895
2852=head3 Watcher-Specific Functions and Data Members 2896=head3 Watcher-Specific Functions and Data Members
2853 2897
2854=over 4 2898=over 4
2855 2899
2856=item ev_idle_init (ev_idle *, callback) 2900=item ev_idle_init (ev_idle *, callback)
2867callback, free it. Also, use no error checking, as usual. 2911callback, free it. Also, use no error checking, as usual.
2868 2912
2869 static void 2913 static void
2870 idle_cb (struct ev_loop *loop, ev_idle *w, int revents) 2914 idle_cb (struct ev_loop *loop, ev_idle *w, int revents)
2871 { 2915 {
2916 // stop the watcher
2917 ev_idle_stop (loop, w);
2918
2919 // now we can free it
2872 free (w); 2920 free (w);
2921
2873 // now do something you wanted to do when the program has 2922 // now do something you wanted to do when the program has
2874 // no longer anything immediate to do. 2923 // no longer anything immediate to do.
2875 } 2924 }
2876 2925
2877 ev_idle *idle_watcher = malloc (sizeof (ev_idle)); 2926 ev_idle *idle_watcher = malloc (sizeof (ev_idle));
2879 ev_idle_start (loop, idle_watcher); 2928 ev_idle_start (loop, idle_watcher);
2880 2929
2881 2930
2882=head2 C<ev_prepare> and C<ev_check> - customise your event loop! 2931=head2 C<ev_prepare> and C<ev_check> - customise your event loop!
2883 2932
2884Prepare and check watchers are usually (but not always) used in pairs: 2933Prepare and check watchers are often (but not always) used in pairs:
2885prepare watchers get invoked before the process blocks and check watchers 2934prepare watchers get invoked before the process blocks and check watchers
2886afterwards. 2935afterwards.
2887 2936
2888You I<must not> call C<ev_run> or similar functions that enter 2937You I<must not> call C<ev_run> (or similar functions that enter the
2889the current event loop from either C<ev_prepare> or C<ev_check> 2938current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2890watchers. Other loops than the current one are fine, however. The 2939C<ev_check> watchers. Other loops than the current one are fine,
2891rationale behind this is that you do not need to check for recursion in 2940however. The rationale behind this is that you do not need to check
2892those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2941for recursion in those watchers, i.e. the sequence will always be
2893C<ev_check> so if you have one watcher of each kind they will always be 2942C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2894called in pairs bracketing the blocking call. 2943kind they will always be called in pairs bracketing the blocking call.
2895 2944
2896Their main purpose is to integrate other event mechanisms into libev and 2945Their main purpose is to integrate other event mechanisms into libev and
2897their use is somewhat advanced. They could be used, for example, to track 2946their use is somewhat advanced. They could be used, for example, to track
2898variable changes, implement your own watchers, integrate net-snmp or a 2947variable changes, implement your own watchers, integrate net-snmp or a
2899coroutine library and lots more. They are also occasionally useful if 2948coroutine library and lots more. They are also occasionally useful if
2917with priority higher than or equal to the event loop and one coroutine 2966with priority higher than or equal to the event loop and one coroutine
2918of lower priority, but only once, using idle watchers to keep the event 2967of lower priority, but only once, using idle watchers to keep the event
2919loop from blocking if lower-priority coroutines are active, thus mapping 2968loop from blocking if lower-priority coroutines are active, thus mapping
2920low-priority coroutines to idle/background tasks). 2969low-priority coroutines to idle/background tasks).
2921 2970
2922It is recommended to give C<ev_check> watchers highest (C<EV_MAXPRI>) 2971When used for this purpose, it is recommended to give C<ev_check> watchers
2923priority, to ensure that they are being run before any other watchers 2972highest (C<EV_MAXPRI>) priority, to ensure that they are being run before
2924after the poll (this doesn't matter for C<ev_prepare> watchers). 2973any other watchers after the poll (this doesn't matter for C<ev_prepare>
2974watchers).
2925 2975
2926Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not 2976Also, C<ev_check> watchers (and C<ev_prepare> watchers, too) should not
2927activate ("feed") events into libev. While libev fully supports this, they 2977activate ("feed") events into libev. While libev fully supports this, they
2928might get executed before other C<ev_check> watchers did their job. As 2978might get executed before other C<ev_check> watchers did their job. As
2929C<ev_check> watchers are often used to embed other (non-libev) event 2979C<ev_check> watchers are often used to embed other (non-libev) event
2930loops those other event loops might be in an unusable state until their 2980loops those other event loops might be in an unusable state until their
2931C<ev_check> watcher ran (always remind yourself to coexist peacefully with 2981C<ev_check> watcher ran (always remind yourself to coexist peacefully with
2932others). 2982others).
2983
2984=head3 Abusing an C<ev_check> watcher for its side-effect
2985
2986C<ev_check> (and less often also C<ev_prepare>) watchers can also be
2987useful because they are called once per event loop iteration. For
2988example, if you want to handle a large number of connections fairly, you
2989normally only do a bit of work for each active connection, and if there
2990is more work to do, you wait for the next event loop iteration, so other
2991connections have a chance of making progress.
2992
2993Using an C<ev_check> watcher is almost enough: it will be called on the
2994next event loop iteration. However, that isn't as soon as possible -
2995without external events, your C<ev_check> watcher will not be invoked.
2996
2997This is where C<ev_idle> watchers come in handy - all you need is a
2998single global idle watcher that is active as long as you have one active
2999C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
3000will not sleep, and the C<ev_check> watcher makes sure a callback gets
3001invoked. Neither watcher alone can do that.
2933 3002
2934=head3 Watcher-Specific Functions and Data Members 3003=head3 Watcher-Specific Functions and Data Members
2935 3004
2936=over 4 3005=over 4
2937 3006
3138 3207
3139=over 4 3208=over 4
3140 3209
3141=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3210=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3142 3211
3143=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3212=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3144 3213
3145Configures the watcher to embed the given loop, which must be 3214Configures the watcher to embed the given loop, which must be
3146embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3215embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3147invoked automatically, otherwise it is the responsibility of the callback 3216invoked automatically, otherwise it is the responsibility of the callback
3148to invoke it (it will continue to be called until the sweep has been done, 3217to invoke it (it will continue to be called until the sweep has been done,
3169used). 3238used).
3170 3239
3171 struct ev_loop *loop_hi = ev_default_init (0); 3240 struct ev_loop *loop_hi = ev_default_init (0);
3172 struct ev_loop *loop_lo = 0; 3241 struct ev_loop *loop_lo = 0;
3173 ev_embed embed; 3242 ev_embed embed;
3174 3243
3175 // see if there is a chance of getting one that works 3244 // see if there is a chance of getting one that works
3176 // (remember that a flags value of 0 means autodetection) 3245 // (remember that a flags value of 0 means autodetection)
3177 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 3246 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3178 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 3247 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3179 : 0; 3248 : 0;
3193C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 3262C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3194 3263
3195 struct ev_loop *loop = ev_default_init (0); 3264 struct ev_loop *loop = ev_default_init (0);
3196 struct ev_loop *loop_socket = 0; 3265 struct ev_loop *loop_socket = 0;
3197 ev_embed embed; 3266 ev_embed embed;
3198 3267
3199 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 3268 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3200 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 3269 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3201 { 3270 {
3202 ev_embed_init (&embed, 0, loop_socket); 3271 ev_embed_init (&embed, 0, loop_socket);
3203 ev_embed_start (loop, &embed); 3272 ev_embed_start (loop, &embed);
3211 3280
3212=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3281=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3213 3282
3214Fork watchers are called when a C<fork ()> was detected (usually because 3283Fork watchers are called when a C<fork ()> was detected (usually because
3215whoever is a good citizen cared to tell libev about it by calling 3284whoever is a good citizen cared to tell libev about it by calling
3216C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the 3285C<ev_loop_fork>). The invocation is done before the event loop blocks next
3217event loop blocks next and before C<ev_check> watchers are being called, 3286and before C<ev_check> watchers are being called, and only in the child
3218and only in the child after the fork. If whoever good citizen calling 3287after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3219C<ev_default_fork> cheats and calls it in the wrong process, the fork 3288and calls it in the wrong process, the fork handlers will be invoked, too,
3220handlers will be invoked, too, of course. 3289of course.
3221 3290
3222=head3 The special problem of life after fork - how is it possible? 3291=head3 The special problem of life after fork - how is it possible?
3223 3292
3224Most uses of C<fork()> consist of forking, then some simple calls to set 3293Most uses of C<fork ()> consist of forking, then some simple calls to set
3225up/change the process environment, followed by a call to C<exec()>. This 3294up/change the process environment, followed by a call to C<exec()>. This
3226sequence should be handled by libev without any problems. 3295sequence should be handled by libev without any problems.
3227 3296
3228This changes when the application actually wants to do event handling 3297This changes when the application actually wants to do event handling
3229in the child, or both parent in child, in effect "continuing" after the 3298in the child, or both parent in child, in effect "continuing" after the
3467 3536
3468There are some other functions of possible interest. Described. Here. Now. 3537There are some other functions of possible interest. Described. Here. Now.
3469 3538
3470=over 4 3539=over 4
3471 3540
3472=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback) 3541=item ev_once (loop, int fd, int events, ev_tstamp timeout, callback, arg)
3473 3542
3474This function combines a simple timer and an I/O watcher, calls your 3543This function combines a simple timer and an I/O watcher, calls your
3475callback on whichever event happens first and automatically stops both 3544callback on whichever event happens first and automatically stops both
3476watchers. This is useful if you want to wait for a single event on an fd 3545watchers. This is useful if you want to wait for a single event on an fd
3477or timeout without having to allocate/configure/start/stop/free one or 3546or timeout without having to allocate/configure/start/stop/free one or
3619already been invoked. 3688already been invoked.
3620 3689
3621A common way around all these issues is to make sure that 3690A common way around all these issues is to make sure that
3622C<start_new_request> I<always> returns before the callback is invoked. If 3691C<start_new_request> I<always> returns before the callback is invoked. If
3623C<start_new_request> immediately knows the result, it can artificially 3692C<start_new_request> immediately knows the result, it can artificially
3624delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher 3693delay invoking the callback by using a C<prepare> or C<idle> watcher for
3625for example, or more sneakily, by reusing an existing (stopped) watcher 3694example, or more sneakily, by reusing an existing (stopped) watcher and
3626and pushing it into the pending queue: 3695pushing it into the pending queue:
3627 3696
3628 ev_set_cb (watcher, callback); 3697 ev_set_cb (watcher, callback);
3629 ev_feed_event (EV_A_ watcher, 0); 3698 ev_feed_event (EV_A_ watcher, 0);
3630 3699
3631This way, C<start_new_request> can safely return before the callback is 3700This way, C<start_new_request> can safely return before the callback is
3639 3708
3640This brings the problem of exiting - a callback might want to finish the 3709This brings the problem of exiting - a callback might want to finish the
3641main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but 3710main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3642a modal "Are you sure?" dialog is still waiting), or just the nested one 3711a modal "Are you sure?" dialog is still waiting), or just the nested one
3643and not the main one (e.g. user clocked "Ok" in a modal dialog), or some 3712and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3644other combination: In these cases, C<ev_break> will not work alone. 3713other combination: In these cases, a simple C<ev_break> will not work.
3645 3714
3646The solution is to maintain "break this loop" variable for each C<ev_run> 3715The solution is to maintain "break this loop" variable for each C<ev_run>
3647invocation, and use a loop around C<ev_run> until the condition is 3716invocation, and use a loop around C<ev_run> until the condition is
3648triggered, using C<EVRUN_ONCE>: 3717triggered, using C<EVRUN_ONCE>:
3649 3718
3835called): 3904called):
3836 3905
3837 void 3906 void
3838 wait_for_event (ev_watcher *w) 3907 wait_for_event (ev_watcher *w)
3839 { 3908 {
3840 ev_cb_set (w) = current_coro; 3909 ev_set_cb (w, current_coro);
3841 switch_to (libev_coro); 3910 switch_to (libev_coro);
3842 } 3911 }
3843 3912
3844That basically suspends the coroutine inside C<wait_for_event> and 3913That basically suspends the coroutine inside C<wait_for_event> and
3845continues the libev coroutine, which, when appropriate, switches back to 3914continues the libev coroutine, which, when appropriate, switches back to
3848You can do similar tricks if you have, say, threads with an event queue - 3917You can do similar tricks if you have, say, threads with an event queue -
3849instead of storing a coroutine, you store the queue object and instead of 3918instead of storing a coroutine, you store the queue object and instead of
3850switching to a coroutine, you push the watcher onto the queue and notify 3919switching to a coroutine, you push the watcher onto the queue and notify
3851any waiters. 3920any waiters.
3852 3921
3853To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two 3922To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
3854files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: 3923files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3855 3924
3856 // my_ev.h 3925 // my_ev.h
3857 #define EV_CB_DECLARE(type) struct my_coro *cb; 3926 #define EV_CB_DECLARE(type) struct my_coro *cb;
3858 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); 3927 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb)
3859 #include "../libev/ev.h" 3928 #include "../libev/ev.h"
3860 3929
3861 // my_ev.c 3930 // my_ev.c
3862 #define EV_H "my_ev.h" 3931 #define EV_H "my_ev.h"
3863 #include "../libev/ev.c" 3932 #include "../libev/ev.c"
3910libev sources can be compiled as C++. Therefore, code that uses the C API 3979libev sources can be compiled as C++. Therefore, code that uses the C API
3911will work fine. 3980will work fine.
3912 3981
3913Proper exception specifications might have to be added to callbacks passed 3982Proper exception specifications might have to be added to callbacks passed
3914to libev: exceptions may be thrown only from watcher callbacks, all 3983to libev: exceptions may be thrown only from watcher callbacks, all
3915other callbacks (allocator, syserr, loop acquire/release and periodioc 3984other callbacks (allocator, syserr, loop acquire/release and periodic
3916reschedule callbacks) must not throw exceptions, and might need a C<throw 3985reschedule callbacks) must not throw exceptions, and might need a C<throw
3917()> specification. If you have code that needs to be compiled as both C 3986()> specification. If you have code that needs to be compiled as both C
3918and C++ you can use the C<EV_THROW> macro for this: 3987and C++ you can use the C<EV_THROW> macro for this:
3919 3988
3920 static void 3989 static void
3940Libev comes with some simplistic wrapper classes for C++ that mainly allow 4009Libev comes with some simplistic wrapper classes for C++ that mainly allow
3941you to use some convenience methods to start/stop watchers and also change 4010you to use some convenience methods to start/stop watchers and also change
3942the callback model to a model using method callbacks on objects. 4011the callback model to a model using method callbacks on objects.
3943 4012
3944To use it, 4013To use it,
3945 4014
3946 #include <ev++.h> 4015 #include <ev++.h>
3947 4016
3948This automatically includes F<ev.h> and puts all of its definitions (many 4017This automatically includes F<ev.h> and puts all of its definitions (many
3949of them macros) into the global namespace. All C++ specific things are 4018of them macros) into the global namespace. All C++ specific things are
3950put into the C<ev> namespace. It should support all the same embedding 4019put into the C<ev> namespace. It should support all the same embedding
4053 void operator() (ev::io &w, int revents) 4122 void operator() (ev::io &w, int revents)
4054 { 4123 {
4055 ... 4124 ...
4056 } 4125 }
4057 } 4126 }
4058 4127
4059 myfunctor f; 4128 myfunctor f;
4060 4129
4061 ev::io w; 4130 ev::io w;
4062 w.set (&f); 4131 w.set (&f);
4063 4132
4081Associates a different C<struct ev_loop> with this watcher. You can only 4150Associates a different C<struct ev_loop> with this watcher. You can only
4082do this when the watcher is inactive (and not pending either). 4151do this when the watcher is inactive (and not pending either).
4083 4152
4084=item w->set ([arguments]) 4153=item w->set ([arguments])
4085 4154
4086Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4155Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
4087method or a suitable start method must be called at least once. Unlike the 4156with the same arguments. Either this method or a suitable start method
4088C counterpart, an active watcher gets automatically stopped and restarted 4157must be called at least once. Unlike the C counterpart, an active watcher
4089when reconfiguring it with this method. 4158gets automatically stopped and restarted when reconfiguring it with this
4159method.
4160
4161For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4162clashing with the C<set (loop)> method.
4090 4163
4091=item w->start () 4164=item w->start ()
4092 4165
4093Starts the watcher. Note that there is no C<loop> argument, as the 4166Starts the watcher. Note that there is no C<loop> argument, as the
4094constructor already stores the event loop. 4167constructor already stores the event loop.
4198 4271
4199Brian Maher has written a partial interface to libev for lua (at the 4272Brian Maher has written a partial interface to libev for lua (at the
4200time of this writing, only C<ev_io> and C<ev_timer>), to be found at 4273time of this writing, only C<ev_io> and C<ev_timer>), to be found at
4201L<http://github.com/brimworks/lua-ev>. 4274L<http://github.com/brimworks/lua-ev>.
4202 4275
4276=item Javascript
4277
4278Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
4279
4280=item Others
4281
4282There are others, and I stopped counting.
4283
4203=back 4284=back
4204 4285
4205 4286
4206=head1 MACRO MAGIC 4287=head1 MACRO MAGIC
4207 4288
4324 ev_vars.h 4405 ev_vars.h
4325 ev_wrap.h 4406 ev_wrap.h
4326 4407
4327 ev_win32.c required on win32 platforms only 4408 ev_win32.c required on win32 platforms only
4328 4409
4329 ev_select.c only when select backend is enabled (which is enabled by default) 4410 ev_select.c only when select backend is enabled
4330 ev_poll.c only when poll backend is enabled (disabled by default) 4411 ev_poll.c only when poll backend is enabled
4331 ev_epoll.c only when the epoll backend is enabled (disabled by default) 4412 ev_epoll.c only when the epoll backend is enabled
4332 ev_kqueue.c only when the kqueue backend is enabled (disabled by default) 4413 ev_kqueue.c only when the kqueue backend is enabled
4333 ev_port.c only when the solaris port backend is enabled (disabled by default) 4414 ev_port.c only when the solaris port backend is enabled
4334 4415
4335F<ev.c> includes the backend files directly when enabled, so you only need 4416F<ev.c> includes the backend files directly when enabled, so you only need
4336to compile this single file. 4417to compile this single file.
4337 4418
4338=head3 LIBEVENT COMPATIBILITY API 4419=head3 LIBEVENT COMPATIBILITY API
4505 4586
4506If programs implement their own fd to handle mapping on win32, then this 4587If programs implement their own fd to handle mapping on win32, then this
4507macro can be used to override the C<close> function, useful to unregister 4588macro can be used to override the C<close> function, useful to unregister
4508file descriptors again. Note that the replacement function has to close 4589file descriptors again. Note that the replacement function has to close
4509the underlying OS handle. 4590the underlying OS handle.
4591
4592=item EV_USE_WSASOCKET
4593
4594If defined to be C<1>, libev will use C<WSASocket> to create its internal
4595communication socket, which works better in some environments. Otherwise,
4596the normal C<socket> function will be used, which works better in other
4597environments.
4510 4598
4511=item EV_USE_POLL 4599=item EV_USE_POLL
4512 4600
4513If defined to be C<1>, libev will compile in support for the C<poll>(2) 4601If defined to be C<1>, libev will compile in support for the C<poll>(2)
4514backend. Otherwise it will be enabled on non-win32 platforms. It 4602backend. Otherwise it will be enabled on non-win32 platforms. It
4559different cpus (or different cpu cores). This reduces dependencies 4647different cpus (or different cpu cores). This reduces dependencies
4560and makes libev faster. 4648and makes libev faster.
4561 4649
4562=item EV_NO_THREADS 4650=item EV_NO_THREADS
4563 4651
4564If defined to be C<1>, libev will assume that it will never be called 4652If defined to be C<1>, libev will assume that it will never be called from
4565from different threads, which is a stronger assumption than C<EV_NO_SMP>, 4653different threads (that includes signal handlers), which is a stronger
4566above. This reduces dependencies and makes libev faster. 4654assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4655libev faster.
4567 4656
4568=item EV_ATOMIC_T 4657=item EV_ATOMIC_T
4569 4658
4570Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4659Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4571access is atomic and serialised with respect to other threads or signal 4660access is atomic with respect to other threads or signal contexts. No
4572contexts. No such type is easily found in the C language, so you can 4661such type is easily found in the C language, so you can provide your own
4573provide your own type that you know is safe for your purposes. It is used 4662type that you know is safe for your purposes. It is used both for signal
4574both for signal handler "locking" as well as for signal and thread safety 4663handler "locking" as well as for signal and thread safety in C<ev_async>
4575in C<ev_async> watchers. 4664watchers.
4576 4665
4577In the absence of this define, libev will use C<sig_atomic_t volatile> 4666In the absence of this define, libev will use C<sig_atomic_t volatile>
4578(from F<signal.h>), which is usually good enough on most platforms, 4667(from F<signal.h>), which is usually good enough on most platforms.
4579although strictly speaking using a type that also implies a memory fence
4580is required.
4581 4668
4582=item EV_H (h) 4669=item EV_H (h)
4583 4670
4584The name of the F<ev.h> header file used to include it. The default if 4671The name of the F<ev.h> header file used to include it. The default if
4585undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4672undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
4953default loop and triggering an C<ev_async> watcher from the default loop 5040default loop and triggering an C<ev_async> watcher from the default loop
4954watcher callback into the event loop interested in the signal. 5041watcher callback into the event loop interested in the signal.
4955 5042
4956=back 5043=back
4957 5044
4958See also L<THREAD LOCKING EXAMPLE>. 5045See also L</THREAD LOCKING EXAMPLE>.
4959 5046
4960=head3 COROUTINES 5047=head3 COROUTINES
4961 5048
4962Libev is very accommodating to coroutines ("cooperative threads"): 5049Libev is very accommodating to coroutines ("cooperative threads"):
4963libev fully supports nesting calls to its functions from different 5050libev fully supports nesting calls to its functions from different
5232structure (guaranteed by POSIX but not by ISO C for example), but it also 5319structure (guaranteed by POSIX but not by ISO C for example), but it also
5233assumes that the same (machine) code can be used to call any watcher 5320assumes that the same (machine) code can be used to call any watcher
5234callback: The watcher callbacks have different type signatures, but libev 5321callback: The watcher callbacks have different type signatures, but libev
5235calls them using an C<ev_watcher *> internally. 5322calls them using an C<ev_watcher *> internally.
5236 5323
5324=item null pointers and integer zero are represented by 0 bytes
5325
5326Libev uses C<memset> to initialise structs and arrays to C<0> bytes, and
5327relies on this setting pointers and integers to null.
5328
5237=item pointer accesses must be thread-atomic 5329=item pointer accesses must be thread-atomic
5238 5330
5239Accessing a pointer value must be atomic, it must both be readable and 5331Accessing a pointer value must be atomic, it must both be readable and
5240writable in one piece - this is the case on all current architectures. 5332writable in one piece - this is the case on all current architectures.
5241 5333
5254thread" or will block signals process-wide, both behaviours would 5346thread" or will block signals process-wide, both behaviours would
5255be compatible with libev. Interaction between C<sigprocmask> and 5347be compatible with libev. Interaction between C<sigprocmask> and
5256C<pthread_sigmask> could complicate things, however. 5348C<pthread_sigmask> could complicate things, however.
5257 5349
5258The most portable way to handle signals is to block signals in all threads 5350The most portable way to handle signals is to block signals in all threads
5259except the initial one, and run the default loop in the initial thread as 5351except the initial one, and run the signal handling loop in the initial
5260well. 5352thread as well.
5261 5353
5262=item C<long> must be large enough for common memory allocation sizes 5354=item C<long> must be large enough for common memory allocation sizes
5263 5355
5264To improve portability and simplify its API, libev uses C<long> internally 5356To improve portability and simplify its API, libev uses C<long> internally
5265instead of C<size_t> when allocating its data structures. On non-POSIX 5357instead of C<size_t> when allocating its data structures. On non-POSIX
5369=over 4 5461=over 4
5370 5462
5371=item C<EV_COMPAT3> backwards compatibility mechanism 5463=item C<EV_COMPAT3> backwards compatibility mechanism
5372 5464
5373The backward compatibility mechanism can be controlled by 5465The backward compatibility mechanism can be controlled by
5374C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> 5466C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5375section. 5467section.
5376 5468
5377=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5469=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5378 5470
5379These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5471These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5422=over 4 5514=over 4
5423 5515
5424=item active 5516=item active
5425 5517
5426A watcher is active as long as it has been started and not yet stopped. 5518A watcher is active as long as it has been started and not yet stopped.
5427See L<WATCHER STATES> for details. 5519See L</WATCHER STATES> for details.
5428 5520
5429=item application 5521=item application
5430 5522
5431In this document, an application is whatever is using libev. 5523In this document, an application is whatever is using libev.
5432 5524
5468watchers and events. 5560watchers and events.
5469 5561
5470=item pending 5562=item pending
5471 5563
5472A watcher is pending as soon as the corresponding event has been 5564A watcher is pending as soon as the corresponding event has been
5473detected. See L<WATCHER STATES> for details. 5565detected. See L</WATCHER STATES> for details.
5474 5566
5475=item real time 5567=item real time
5476 5568
5477The physical time that is observed. It is apparently strictly monotonic :) 5569The physical time that is observed. It is apparently strictly monotonic :)
5478 5570

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines