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

Comparing libev/ev.pod (file contents):
Revision 1.411 by root, Fri May 4 20:47:27 2012 UTC vs.
Revision 1.434 by root, Tue May 6 13:24:39 2014 UTC

1=encoding utf-8
2
1=head1 NAME 3=head1 NAME
2 4
3libev - a high performance full-featured event loop written in C 5libev - a high performance full-featured event loop written in C
4 6
5=head1 SYNOPSIS 7=head1 SYNOPSIS
82 84
83=head1 WHAT TO READ WHEN IN A HURRY 85=head1 WHAT TO READ WHEN IN A HURRY
84 86
85This manual tries to be very detailed, but unfortunately, this also makes 87This manual tries to be very detailed, but unfortunately, this also makes
86it very long. If you just want to know the basics of libev, I suggest 88it very long. If you just want to know the basics of libev, I suggest
87reading L<ANATOMY OF A WATCHER>, then the L<EXAMPLE PROGRAM> above and 89reading L</ANATOMY OF A WATCHER>, then the L</EXAMPLE PROGRAM> above and
88look up the missing functions in L<GLOBAL FUNCTIONS> and the C<ev_io> and 90look up the missing functions in L</GLOBAL FUNCTIONS> and the C<ev_io> and
89C<ev_timer> sections in L<WATCHER TYPES>. 91C<ev_timer> sections in L</WATCHER TYPES>.
90 92
91=head1 ABOUT LIBEV 93=head1 ABOUT LIBEV
92 94
93Libev is an event loop: you register interest in certain events (such as a 95Libev is an event loop: you register interest in certain events (such as a
94file descriptor being readable or a timeout occurring), and it will manage 96file descriptor being readable or a timeout occurring), and it will manage
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
1346or might not have been clamped to the valid range. 1351or might not have been clamped to the valid range.
1347 1352
1348The 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
1349always 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 :).
1350 1355
1351See L<WATCHER PRIORITY MODELS>, below, for a more thorough treatment of 1356See L</WATCHER PRIORITY MODELS>, below, for a more thorough treatment of
1352priorities. 1357priorities.
1353 1358
1354=item ev_invoke (loop, ev_TYPE *watcher, int revents) 1359=item ev_invoke (loop, ev_TYPE *watcher, int revents)
1355 1360
1356Invoke 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
1381See 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
1382functions that do not need a watcher. 1387functions that do not need a watcher.
1383 1388
1384=back 1389=back
1385 1390
1386See 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
1387OWN COMPOSITE WATCHERS> idioms. 1392OWN COMPOSITE WATCHERS> idioms.
1388 1393
1389=head2 WATCHER STATES 1394=head2 WATCHER STATES
1390 1395
1391There are various watcher states mentioned throughout this manual - 1396There are various watcher states mentioned throughout this manual -
1393transition between them will be described in more detail - and while these 1398transition between them will be described in more detail - and while these
1394rules might look complicated, they usually do "the right thing". 1399rules might look complicated, they usually do "the right thing".
1395 1400
1396=over 4 1401=over 4
1397 1402
1398=item initialiased 1403=item initialised
1399 1404
1400Before 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
1401initialised. 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
1402C<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.
1403 1408
2024 2029
2025The relative timeouts are calculated relative to the C<ev_now ()> 2030The relative timeouts are calculated relative to the C<ev_now ()>
2026time. This is usually the right thing as this timestamp refers to the time 2031time. This is usually the right thing as this timestamp refers to the time
2027of the event triggering whatever timeout you are modifying/starting. If 2032of the event triggering whatever timeout you are modifying/starting. If
2028you suspect event processing to be delayed and you I<need> to base the 2033you suspect event processing to be delayed and you I<need> to base the
2029timeout on the current time, use something like this to adjust for this: 2034timeout on the current time, use something like the following to adjust
2035for it:
2030 2036
2031 ev_timer_set (&timer, after + ev_now () - ev_time (), 0.); 2037 ev_timer_set (&timer, after + (ev_time () - ev_now ()), 0.);
2032 2038
2033If the event loop is suspended for a long time, you can also force an 2039If the event loop is suspended for a long time, you can also force an
2034update of the time returned by C<ev_now ()> by calling C<ev_now_update 2040update of the time returned by C<ev_now ()> by calling C<ev_now_update
2035()>. 2041()>, although that will push the event time of all outstanding events
2042further into the future.
2036 2043
2037=head3 The special problem of unsynchronised clocks 2044=head3 The special problem of unsynchronised clocks
2038 2045
2039Modern systems have a variety of clocks - libev itself uses the normal 2046Modern systems have a variety of clocks - libev itself uses the normal
2040"wall clock" clock and, if available, the monotonic clock (to avoid time 2047"wall clock" clock and, if available, the monotonic clock (to avoid time
2136=item If the timer is repeating, make the C<repeat> value the new timeout 2143=item If the timer is repeating, make the C<repeat> value the new timeout
2137and start the timer, if necessary. 2144and start the timer, if necessary.
2138 2145
2139=back 2146=back
2140 2147
2141This sounds a bit complicated, see L<Be smart about timeouts>, above, for a 2148This sounds a bit complicated, see L</Be smart about timeouts>, above, for a
2142usage example. 2149usage example.
2143 2150
2144=item ev_tstamp ev_timer_remaining (loop, ev_timer *) 2151=item ev_tstamp ev_timer_remaining (loop, ev_timer *)
2145 2152
2146Returns the remaining time until a timer fires. If the timer is active, 2153Returns the remaining time until a timer fires. If the timer is active,
2389 2396
2390 ev_periodic hourly_tick; 2397 ev_periodic hourly_tick;
2391 ev_periodic_init (&hourly_tick, clock_cb, 2398 ev_periodic_init (&hourly_tick, clock_cb,
2392 fmod (ev_now (loop), 3600.), 3600., 0); 2399 fmod (ev_now (loop), 3600.), 3600., 0);
2393 ev_periodic_start (loop, &hourly_tick); 2400 ev_periodic_start (loop, &hourly_tick);
2394 2401
2395 2402
2396=head2 C<ev_signal> - signal me when a signal gets signalled! 2403=head2 C<ev_signal> - signal me when a signal gets signalled!
2397 2404
2398Signal watchers will trigger an event when the process receives a specific 2405Signal watchers will trigger an event when the process receives a specific
2399signal one or more times. Even though signals are very asynchronous, libev 2406signal 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 2416only 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 2417default 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 2418C<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. 2419the moment, C<SIGCHLD> is permanently tied to the default loop.
2413 2420
2414When the first watcher gets started will libev actually register something 2421Only 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 2422register something with the kernel. It thus coexists with your own signal
2416you don't register any with libev for the same signal). 2423handlers as long as you don't register any with libev for the same signal.
2417 2424
2418If possible and supported, libev will install its handlers with 2425If possible and supported, libev will install its handlers with
2419C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should 2426C<SA_RESTART> (or equivalent) behaviour enabled, so system calls should
2420not be unduly interrupted. If you have a problem with system calls getting 2427not be unduly interrupted. If you have a problem with system calls getting
2421interrupted by signals you can block all signals in an C<ev_check> watcher 2428interrupted by signals you can block all signals in an C<ev_check> watcher
2606 2613
2607=head2 C<ev_stat> - did the file attributes just change? 2614=head2 C<ev_stat> - did the file attributes just change?
2608 2615
2609This watches a file system path for attribute changes. That is, it calls 2616This watches a file system path for attribute changes. That is, it calls
2610C<stat> on that path in regular intervals (or when the OS says it changed) 2617C<stat> on that path in regular intervals (or when the OS says it changed)
2611and sees if it changed compared to the last time, invoking the callback if 2618and sees if it changed compared to the last time, invoking the callback
2612it did. 2619if it did. Starting the watcher C<stat>'s the file, so only changes that
2620happen after the watcher has been started will be reported.
2613 2621
2614The path does not need to exist: changing from "path exists" to "path does 2622The path does not need to exist: changing from "path exists" to "path does
2615not exist" is a status change like any other. The condition "path does not 2623not exist" is a status change like any other. The condition "path does not
2616exist" (or more correctly "path cannot be stat'ed") is signified by the 2624exist" (or more correctly "path cannot be stat'ed") is signified by the
2617C<st_nlink> field being zero (which is otherwise always forced to be at 2625C<st_nlink> field being zero (which is otherwise always forced to be at
2858 2866
2859This mode of operation can be useful together with an C<ev_check> watcher, 2867This mode of operation can be useful together with an C<ev_check> watcher,
2860to do something on each event loop iteration - for example to balance load 2868to do something on each event loop iteration - for example to balance load
2861between different connections. 2869between different connections.
2862 2870
2863See L<Abusing an ev_check watcher for its side-effect> for a longer 2871See L</Abusing an ev_check watcher for its side-effect> for a longer
2864example. 2872example.
2865 2873
2866=head3 Watcher-Specific Functions and Data Members 2874=head3 Watcher-Specific Functions and Data Members
2867 2875
2868=over 4 2876=over 4
2902 2910
2903Prepare and check watchers are often (but not always) used in pairs: 2911Prepare and check watchers are often (but not always) used in pairs:
2904prepare watchers get invoked before the process blocks and check watchers 2912prepare watchers get invoked before the process blocks and check watchers
2905afterwards. 2913afterwards.
2906 2914
2907You I<must not> call C<ev_run> or similar functions that enter 2915You I<must not> call C<ev_run> (or similar functions that enter the
2908the current event loop from either C<ev_prepare> or C<ev_check> 2916current event loop) or C<ev_loop_fork> from either C<ev_prepare> or
2909watchers. Other loops than the current one are fine, however. The 2917C<ev_check> watchers. Other loops than the current one are fine,
2910rationale behind this is that you do not need to check for recursion in 2918however. The rationale behind this is that you do not need to check
2911those watchers, i.e. the sequence will always be C<ev_prepare>, blocking, 2919for recursion in those watchers, i.e. the sequence will always be
2912C<ev_check> so if you have one watcher of each kind they will always be 2920C<ev_prepare>, blocking, C<ev_check> so if you have one watcher of each
2913called in pairs bracketing the blocking call. 2921kind they will always be called in pairs bracketing the blocking call.
2914 2922
2915Their main purpose is to integrate other event mechanisms into libev and 2923Their main purpose is to integrate other event mechanisms into libev and
2916their use is somewhat advanced. They could be used, for example, to track 2924their use is somewhat advanced. They could be used, for example, to track
2917variable changes, implement your own watchers, integrate net-snmp or a 2925variable changes, implement your own watchers, integrate net-snmp or a
2918coroutine library and lots more. They are also occasionally useful if 2926coroutine library and lots more. They are also occasionally useful if
2962 2970
2963Using an C<ev_check> watcher is almost enough: it will be called on the 2971Using an C<ev_check> watcher is almost enough: it will be called on the
2964next event loop iteration. However, that isn't as soon as possible - 2972next event loop iteration. However, that isn't as soon as possible -
2965without external events, your C<ev_check> watcher will not be invoked. 2973without external events, your C<ev_check> watcher will not be invoked.
2966 2974
2967
2968This is where C<ev_idle> watchers come in handy - all you need is a 2975This is where C<ev_idle> watchers come in handy - all you need is a
2969single global idle watcher that is active as long as you have one active 2976single global idle watcher that is active as long as you have one active
2970C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop 2977C<ev_check> watcher. The C<ev_idle> watcher makes sure the event loop
2971will not sleep, and the C<ev_check> watcher makes sure a callback gets 2978will not sleep, and the C<ev_check> watcher makes sure a callback gets
2972invoked. Neither watcher alone can do that. 2979invoked. Neither watcher alone can do that.
3178 3185
3179=over 4 3186=over 4
3180 3187
3181=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3188=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3182 3189
3183=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3190=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3184 3191
3185Configures the watcher to embed the given loop, which must be 3192Configures the watcher to embed the given loop, which must be
3186embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3193embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3187invoked automatically, otherwise it is the responsibility of the callback 3194invoked automatically, otherwise it is the responsibility of the callback
3188to invoke it (it will continue to be called until the sweep has been done, 3195to invoke it (it will continue to be called until the sweep has been done,
3209used). 3216used).
3210 3217
3211 struct ev_loop *loop_hi = ev_default_init (0); 3218 struct ev_loop *loop_hi = ev_default_init (0);
3212 struct ev_loop *loop_lo = 0; 3219 struct ev_loop *loop_lo = 0;
3213 ev_embed embed; 3220 ev_embed embed;
3214 3221
3215 // see if there is a chance of getting one that works 3222 // see if there is a chance of getting one that works
3216 // (remember that a flags value of 0 means autodetection) 3223 // (remember that a flags value of 0 means autodetection)
3217 loop_lo = ev_embeddable_backends () & ev_recommended_backends () 3224 loop_lo = ev_embeddable_backends () & ev_recommended_backends ()
3218 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ()) 3225 ? ev_loop_new (ev_embeddable_backends () & ev_recommended_backends ())
3219 : 0; 3226 : 0;
3233C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too). 3240C<loop_socket>. (One might optionally use C<EVFLAG_NOENV>, too).
3234 3241
3235 struct ev_loop *loop = ev_default_init (0); 3242 struct ev_loop *loop = ev_default_init (0);
3236 struct ev_loop *loop_socket = 0; 3243 struct ev_loop *loop_socket = 0;
3237 ev_embed embed; 3244 ev_embed embed;
3238 3245
3239 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE) 3246 if (ev_supported_backends () & ~ev_recommended_backends () & EVBACKEND_KQUEUE)
3240 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE)) 3247 if ((loop_socket = ev_loop_new (EVBACKEND_KQUEUE))
3241 { 3248 {
3242 ev_embed_init (&embed, 0, loop_socket); 3249 ev_embed_init (&embed, 0, loop_socket);
3243 ev_embed_start (loop, &embed); 3250 ev_embed_start (loop, &embed);
3251 3258
3252=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3259=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3253 3260
3254Fork watchers are called when a C<fork ()> was detected (usually because 3261Fork watchers are called when a C<fork ()> was detected (usually because
3255whoever is a good citizen cared to tell libev about it by calling 3262whoever is a good citizen cared to tell libev about it by calling
3256C<ev_default_fork> or C<ev_loop_fork>). The invocation is done before the 3263C<ev_loop_fork>). The invocation is done before the event loop blocks next
3257event loop blocks next and before C<ev_check> watchers are being called, 3264and before C<ev_check> watchers are being called, and only in the child
3258and only in the child after the fork. If whoever good citizen calling 3265after the fork. If whoever good citizen calling C<ev_default_fork> cheats
3259C<ev_default_fork> cheats and calls it in the wrong process, the fork 3266and calls it in the wrong process, the fork handlers will be invoked, too,
3260handlers will be invoked, too, of course. 3267of course.
3261 3268
3262=head3 The special problem of life after fork - how is it possible? 3269=head3 The special problem of life after fork - how is it possible?
3263 3270
3264Most uses of C<fork()> consist of forking, then some simple calls to set 3271Most uses of C<fork ()> consist of forking, then some simple calls to set
3265up/change the process environment, followed by a call to C<exec()>. This 3272up/change the process environment, followed by a call to C<exec()>. This
3266sequence should be handled by libev without any problems. 3273sequence should be handled by libev without any problems.
3267 3274
3268This changes when the application actually wants to do event handling 3275This changes when the application actually wants to do event handling
3269in the child, or both parent in child, in effect "continuing" after the 3276in the child, or both parent in child, in effect "continuing" after the
3659already been invoked. 3666already been invoked.
3660 3667
3661A common way around all these issues is to make sure that 3668A common way around all these issues is to make sure that
3662C<start_new_request> I<always> returns before the callback is invoked. If 3669C<start_new_request> I<always> returns before the callback is invoked. If
3663C<start_new_request> immediately knows the result, it can artificially 3670C<start_new_request> immediately knows the result, it can artificially
3664delay invoking the callback by e.g. using a C<prepare> or C<idle> watcher 3671delay invoking the callback by using a C<prepare> or C<idle> watcher for
3665for example, or more sneakily, by reusing an existing (stopped) watcher 3672example, or more sneakily, by reusing an existing (stopped) watcher and
3666and pushing it into the pending queue: 3673pushing it into the pending queue:
3667 3674
3668 ev_set_cb (watcher, callback); 3675 ev_set_cb (watcher, callback);
3669 ev_feed_event (EV_A_ watcher, 0); 3676 ev_feed_event (EV_A_ watcher, 0);
3670 3677
3671This way, C<start_new_request> can safely return before the callback is 3678This way, C<start_new_request> can safely return before the callback is
3679 3686
3680This brings the problem of exiting - a callback might want to finish the 3687This brings the problem of exiting - a callback might want to finish the
3681main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but 3688main C<ev_run> call, but not the nested one (e.g. user clicked "Quit", but
3682a modal "Are you sure?" dialog is still waiting), or just the nested one 3689a modal "Are you sure?" dialog is still waiting), or just the nested one
3683and not the main one (e.g. user clocked "Ok" in a modal dialog), or some 3690and not the main one (e.g. user clocked "Ok" in a modal dialog), or some
3684other combination: In these cases, C<ev_break> will not work alone. 3691other combination: In these cases, a simple C<ev_break> will not work.
3685 3692
3686The solution is to maintain "break this loop" variable for each C<ev_run> 3693The solution is to maintain "break this loop" variable for each C<ev_run>
3687invocation, and use a loop around C<ev_run> until the condition is 3694invocation, and use a loop around C<ev_run> until the condition is
3688triggered, using C<EVRUN_ONCE>: 3695triggered, using C<EVRUN_ONCE>:
3689 3696
3888You can do similar tricks if you have, say, threads with an event queue - 3895You can do similar tricks if you have, say, threads with an event queue -
3889instead of storing a coroutine, you store the queue object and instead of 3896instead of storing a coroutine, you store the queue object and instead of
3890switching to a coroutine, you push the watcher onto the queue and notify 3897switching to a coroutine, you push the watcher onto the queue and notify
3891any waiters. 3898any waiters.
3892 3899
3893To embed libev, see L<EMBEDDING>, but in short, it's easiest to create two 3900To embed libev, see L</EMBEDDING>, but in short, it's easiest to create two
3894files, F<my_ev.h> and F<my_ev.c> that include the respective libev files: 3901files, F<my_ev.h> and F<my_ev.c> that include the respective libev files:
3895 3902
3896 // my_ev.h 3903 // my_ev.h
3897 #define EV_CB_DECLARE(type) struct my_coro *cb; 3904 #define EV_CB_DECLARE(type) struct my_coro *cb;
3898 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb); 3905 #define EV_CB_INVOKE(watcher) switch_to ((watcher)->cb);
3950libev sources can be compiled as C++. Therefore, code that uses the C API 3957libev sources can be compiled as C++. Therefore, code that uses the C API
3951will work fine. 3958will work fine.
3952 3959
3953Proper exception specifications might have to be added to callbacks passed 3960Proper exception specifications might have to be added to callbacks passed
3954to libev: exceptions may be thrown only from watcher callbacks, all 3961to libev: exceptions may be thrown only from watcher callbacks, all
3955other callbacks (allocator, syserr, loop acquire/release and periodioc 3962other callbacks (allocator, syserr, loop acquire/release and periodic
3956reschedule callbacks) must not throw exceptions, and might need a C<throw 3963reschedule callbacks) must not throw exceptions, and might need a C<throw
3957()> specification. If you have code that needs to be compiled as both C 3964()> specification. If you have code that needs to be compiled as both C
3958and C++ you can use the C<EV_THROW> macro for this: 3965and C++ you can use the C<EV_THROW> macro for this:
3959 3966
3960 static void 3967 static void
3980Libev comes with some simplistic wrapper classes for C++ that mainly allow 3987Libev comes with some simplistic wrapper classes for C++ that mainly allow
3981you to use some convenience methods to start/stop watchers and also change 3988you to use some convenience methods to start/stop watchers and also change
3982the callback model to a model using method callbacks on objects. 3989the callback model to a model using method callbacks on objects.
3983 3990
3984To use it, 3991To use it,
3985 3992
3986 #include <ev++.h> 3993 #include <ev++.h>
3987 3994
3988This automatically includes F<ev.h> and puts all of its definitions (many 3995This automatically includes F<ev.h> and puts all of its definitions (many
3989of them macros) into the global namespace. All C++ specific things are 3996of them macros) into the global namespace. All C++ specific things are
3990put into the C<ev> namespace. It should support all the same embedding 3997put into the C<ev> namespace. It should support all the same embedding
4093 void operator() (ev::io &w, int revents) 4100 void operator() (ev::io &w, int revents)
4094 { 4101 {
4095 ... 4102 ...
4096 } 4103 }
4097 } 4104 }
4098 4105
4099 myfunctor f; 4106 myfunctor f;
4100 4107
4101 ev::io w; 4108 ev::io w;
4102 w.set (&f); 4109 w.set (&f);
4103 4110
4121Associates a different C<struct ev_loop> with this watcher. You can only 4128Associates a different C<struct ev_loop> with this watcher. You can only
4122do this when the watcher is inactive (and not pending either). 4129do this when the watcher is inactive (and not pending either).
4123 4130
4124=item w->set ([arguments]) 4131=item w->set ([arguments])
4125 4132
4126Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4133Basically the same as C<ev_TYPE_set> (except for C<ev::embed> watchers>),
4127method or a suitable start method must be called at least once. Unlike the 4134with the same arguments. Either this method or a suitable start method
4128C counterpart, an active watcher gets automatically stopped and restarted 4135must be called at least once. Unlike the C counterpart, an active watcher
4129when reconfiguring it with this method. 4136gets automatically stopped and restarted when reconfiguring it with this
4137method.
4138
4139For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4140clashing with the C<set (loop)> method.
4130 4141
4131=item w->start () 4142=item w->start ()
4132 4143
4133Starts the watcher. Note that there is no C<loop> argument, as the 4144Starts the watcher. Note that there is no C<loop> argument, as the
4134constructor already stores the event loop. 4145constructor already stores the event loop.
4237=item Lua 4248=item Lua
4238 4249
4239Brian Maher has written a partial interface to libev for lua (at the 4250Brian Maher has written a partial interface to libev for lua (at the
4240time of this writing, only C<ev_io> and C<ev_timer>), to be found at 4251time of this writing, only C<ev_io> and C<ev_timer>), to be found at
4241L<http://github.com/brimworks/lua-ev>. 4252L<http://github.com/brimworks/lua-ev>.
4253
4254=item Javascript
4255
4256Node.js (L<http://nodejs.org>) uses libev as the underlying event library.
4257
4258=item Others
4259
4260There are others, and I stopped counting.
4242 4261
4243=back 4262=back
4244 4263
4245 4264
4246=head1 MACRO MAGIC 4265=head1 MACRO MAGIC
4545 4564
4546If programs implement their own fd to handle mapping on win32, then this 4565If programs implement their own fd to handle mapping on win32, then this
4547macro can be used to override the C<close> function, useful to unregister 4566macro can be used to override the C<close> function, useful to unregister
4548file descriptors again. Note that the replacement function has to close 4567file descriptors again. Note that the replacement function has to close
4549the underlying OS handle. 4568the underlying OS handle.
4569
4570=item EV_USE_WSASOCKET
4571
4572If defined to be C<1>, libev will use C<WSASocket> to create its internal
4573communication socket, which works better in some environments. Otherwise,
4574the normal C<socket> function will be used, which works better in other
4575environments.
4550 4576
4551=item EV_USE_POLL 4577=item EV_USE_POLL
4552 4578
4553If defined to be C<1>, libev will compile in support for the C<poll>(2) 4579If defined to be C<1>, libev will compile in support for the C<poll>(2)
4554backend. Otherwise it will be enabled on non-win32 platforms. It 4580backend. Otherwise it will be enabled on non-win32 platforms. It
4599different cpus (or different cpu cores). This reduces dependencies 4625different cpus (or different cpu cores). This reduces dependencies
4600and makes libev faster. 4626and makes libev faster.
4601 4627
4602=item EV_NO_THREADS 4628=item EV_NO_THREADS
4603 4629
4604If defined to be C<1>, libev will assume that it will never be called 4630If defined to be C<1>, libev will assume that it will never be called from
4605from different threads, which is a stronger assumption than C<EV_NO_SMP>, 4631different threads (that includes signal handlers), which is a stronger
4606above. This reduces dependencies and makes libev faster. 4632assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4633libev faster.
4607 4634
4608=item EV_ATOMIC_T 4635=item EV_ATOMIC_T
4609 4636
4610Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4637Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4611access is atomic and serialised with respect to other threads or signal 4638access is atomic with respect to other threads or signal contexts. No
4612contexts. No such type is easily found in the C language, so you can 4639such type is easily found in the C language, so you can provide your own
4613provide your own type that you know is safe for your purposes. It is used 4640type that you know is safe for your purposes. It is used both for signal
4614both for signal handler "locking" as well as for signal and thread safety 4641handler "locking" as well as for signal and thread safety in C<ev_async>
4615in C<ev_async> watchers. 4642watchers.
4616 4643
4617In the absence of this define, libev will use C<sig_atomic_t volatile> 4644In the absence of this define, libev will use C<sig_atomic_t volatile>
4618(from F<signal.h>), which is usually good enough on most platforms, 4645(from F<signal.h>), which is usually good enough on most platforms.
4619although strictly speaking using a type that also implies a memory fence
4620is required.
4621 4646
4622=item EV_H (h) 4647=item EV_H (h)
4623 4648
4624The name of the F<ev.h> header file used to include it. The default if 4649The name of the F<ev.h> header file used to include it. The default if
4625undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4650undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
4993default loop and triggering an C<ev_async> watcher from the default loop 5018default loop and triggering an C<ev_async> watcher from the default loop
4994watcher callback into the event loop interested in the signal. 5019watcher callback into the event loop interested in the signal.
4995 5020
4996=back 5021=back
4997 5022
4998See also L<THREAD LOCKING EXAMPLE>. 5023See also L</THREAD LOCKING EXAMPLE>.
4999 5024
5000=head3 COROUTINES 5025=head3 COROUTINES
5001 5026
5002Libev is very accommodating to coroutines ("cooperative threads"): 5027Libev is very accommodating to coroutines ("cooperative threads"):
5003libev fully supports nesting calls to its functions from different 5028libev fully supports nesting calls to its functions from different
5294thread" or will block signals process-wide, both behaviours would 5319thread" or will block signals process-wide, both behaviours would
5295be compatible with libev. Interaction between C<sigprocmask> and 5320be compatible with libev. Interaction between C<sigprocmask> and
5296C<pthread_sigmask> could complicate things, however. 5321C<pthread_sigmask> could complicate things, however.
5297 5322
5298The most portable way to handle signals is to block signals in all threads 5323The most portable way to handle signals is to block signals in all threads
5299except the initial one, and run the default loop in the initial thread as 5324except the initial one, and run the signal handling loop in the initial
5300well. 5325thread as well.
5301 5326
5302=item C<long> must be large enough for common memory allocation sizes 5327=item C<long> must be large enough for common memory allocation sizes
5303 5328
5304To improve portability and simplify its API, libev uses C<long> internally 5329To improve portability and simplify its API, libev uses C<long> internally
5305instead of C<size_t> when allocating its data structures. On non-POSIX 5330instead of C<size_t> when allocating its data structures. On non-POSIX
5409=over 4 5434=over 4
5410 5435
5411=item C<EV_COMPAT3> backwards compatibility mechanism 5436=item C<EV_COMPAT3> backwards compatibility mechanism
5412 5437
5413The backward compatibility mechanism can be controlled by 5438The backward compatibility mechanism can be controlled by
5414C<EV_COMPAT3>. See L<PREPROCESSOR SYMBOLS/MACROS> in the L<EMBEDDING> 5439C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5415section. 5440section.
5416 5441
5417=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5442=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5418 5443
5419These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5444These calls can be replaced easily by their C<ev_loop_xxx> counterparts:
5462=over 4 5487=over 4
5463 5488
5464=item active 5489=item active
5465 5490
5466A watcher is active as long as it has been started and not yet stopped. 5491A watcher is active as long as it has been started and not yet stopped.
5467See L<WATCHER STATES> for details. 5492See L</WATCHER STATES> for details.
5468 5493
5469=item application 5494=item application
5470 5495
5471In this document, an application is whatever is using libev. 5496In this document, an application is whatever is using libev.
5472 5497
5508watchers and events. 5533watchers and events.
5509 5534
5510=item pending 5535=item pending
5511 5536
5512A watcher is pending as soon as the corresponding event has been 5537A watcher is pending as soon as the corresponding event has been
5513detected. See L<WATCHER STATES> for details. 5538detected. See L</WATCHER STATES> for details.
5514 5539
5515=item real time 5540=item real time
5516 5541
5517The physical time that is observed. It is apparently strictly monotonic :) 5542The physical time that is observed. It is apparently strictly monotonic :)
5518 5543

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines