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

Comparing libev/ev.pod (file contents):
Revision 1.419 by root, Sun Jun 24 14:30:40 2012 UTC vs.
Revision 1.429 by root, Fri Oct 11 07:50:43 2013 UTC

396 396
397If this flag bit is or'ed into the flag value (or the program runs setuid 397If 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 398or setgid) then libev will I<not> look at the environment variable
399C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will 399C<LIBEV_FLAGS>. Otherwise (the default), this environment variable will
400override the flags completely if it is found in the environment. This is 400override 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 401useful to try out specific backends to test their performance, to work
402around bugs. 402around bugs, or to make libev threadsafe (accessing environment variables
403cannot be done in a threadsafe way, but usually it works if no other
404thread modifies them).
403 405
404=item C<EVFLAG_FORKCHECK> 406=item C<EVFLAG_FORKCHECK>
405 407
406Instead of calling C<ev_loop_fork> manually after a fork, you can also 408Instead 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. 409make libev check for a fork in each iteration by enabling this flag.
569kernel is more efficient (which says nothing about its actual speed, of 571kernel is more efficient (which says nothing about its actual speed, of
570course). While stopping, setting and starting an I/O watcher does never 572course). 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 573cause 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 574two 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 575might 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 576drops fds silently in similarly hard-to-detect cases.
575 577
576This backend usually performs well under most conditions. 578This backend usually performs well under most conditions.
577 579
578While nominally embeddable in other event loops, this doesn't work 580While nominally embeddable in other event loops, this doesn't work
579everywhere, so you might need to test for this. And since it is broken 581everywhere, so you might need to test for this. And since it is broken
684reinitialise the kernel state for backends that have one. Despite the 686reinitialise the kernel state for backends that have one. Despite the
685name, you can call it anytime, but it makes most sense after forking, in 687name, you can call it anytime, but it makes most sense after forking, in
686the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the 688the child process. You I<must> call it (or use C<EVFLAG_FORKCHECK>) in the
687child before resuming or calling C<ev_run>. 689child before resuming or calling C<ev_run>.
688 690
689Again, you I<have> to call it on I<any> loop that you want to re-use after 691Again, 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 692a 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 693because some kernel interfaces *cough* I<kqueue> *cough* do funny things
692during fork. 694during fork.
693 695
694On the other hand, you only need to call this function in the child 696On the other hand, you only need to call this function in the child
1393transition between them will be described in more detail - and while these 1395transition between them will be described in more detail - and while these
1394rules might look complicated, they usually do "the right thing". 1396rules might look complicated, they usually do "the right thing".
1395 1397
1396=over 4 1398=over 4
1397 1399
1398=item initialiased 1400=item initialised
1399 1401
1400Before a watcher can be registered with the event loop it has to be 1402Before 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 1403initialised. 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. 1404C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1403 1405
2606 2608
2607=head2 C<ev_stat> - did the file attributes just change? 2609=head2 C<ev_stat> - did the file attributes just change?
2608 2610
2609This watches a file system path for attribute changes. That is, it calls 2611This 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) 2612C<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 2613and sees if it changed compared to the last time, invoking the callback
2612it did. 2614if it did. Starting the watcher C<stat>'s the file, so only changes that
2615happen after the watcher has been started will be reported.
2613 2616
2614The path does not need to exist: changing from "path exists" to "path does 2617The 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 2618not 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 2619exist" (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 2620C<st_nlink> field being zero (which is otherwise always forced to be at
2962 2965
2963Using an C<ev_check> watcher is almost enough: it will be called on the 2966Using 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 - 2967next event loop iteration. However, that isn't as soon as possible -
2965without external events, your C<ev_check> watcher will not be invoked. 2968without external events, your C<ev_check> watcher will not be invoked.
2966 2969
2967
2968This is where C<ev_idle> watchers come in handy - all you need is a 2970This 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 2971single 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 2972C<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 2973will not sleep, and the C<ev_check> watcher makes sure a callback gets
2972invoked. Neither watcher alone can do that. 2974invoked. Neither watcher alone can do that.
3178 3180
3179=over 4 3181=over 4
3180 3182
3181=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3183=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3182 3184
3183=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3185=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3184 3186
3185Configures the watcher to embed the given loop, which must be 3187Configures the watcher to embed the given loop, which must be
3186embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3188embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3187invoked automatically, otherwise it is the responsibility of the callback 3189invoked automatically, otherwise it is the responsibility of the callback
3188to invoke it (it will continue to be called until the sweep has been done, 3190to invoke it (it will continue to be called until the sweep has been done,
3251 3253
3252=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3254=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3253 3255
3254Fork watchers are called when a C<fork ()> was detected (usually because 3256Fork watchers are called when a C<fork ()> was detected (usually because
3255whoever is a good citizen cared to tell libev about it by calling 3257whoever 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 3258C<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, 3259and 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 3260after 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 3261and calls it in the wrong process, the fork handlers will be invoked, too,
3260handlers will be invoked, too, of course. 3262of course.
3261 3263
3262=head3 The special problem of life after fork - how is it possible? 3264=head3 The special problem of life after fork - how is it possible?
3263 3265
3264Most uses of C<fork()> consist of forking, then some simple calls to set 3266Most 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 3267up/change the process environment, followed by a call to C<exec()>. This
3659already been invoked. 3661already been invoked.
3660 3662
3661A common way around all these issues is to make sure that 3663A common way around all these issues is to make sure that
3662C<start_new_request> I<always> returns before the callback is invoked. If 3664C<start_new_request> I<always> returns before the callback is invoked. If
3663C<start_new_request> immediately knows the result, it can artificially 3665C<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 3666delay invoking the callback by using a C<prepare> or C<idle> watcher for
3665for example, or more sneakily, by reusing an existing (stopped) watcher 3667example, or more sneakily, by reusing an existing (stopped) watcher and
3666and pushing it into the pending queue: 3668pushing it into the pending queue:
3667 3669
3668 ev_set_cb (watcher, callback); 3670 ev_set_cb (watcher, callback);
3669 ev_feed_event (EV_A_ watcher, 0); 3671 ev_feed_event (EV_A_ watcher, 0);
3670 3672
3671This way, C<start_new_request> can safely return before the callback is 3673This way, C<start_new_request> can safely return before the callback is
3679 3681
3680This brings the problem of exiting - a callback might want to finish the 3682This 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 3683main 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 3684a 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 3685and 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. 3686other combination: In these cases, a simple C<ev_break> will not work.
3685 3687
3686The solution is to maintain "break this loop" variable for each C<ev_run> 3688The 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 3689invocation, and use a loop around C<ev_run> until the condition is
3688triggered, using C<EVRUN_ONCE>: 3690triggered, using C<EVRUN_ONCE>:
3689 3691
3980Libev comes with some simplistic wrapper classes for C++ that mainly allow 3982Libev comes with some simplistic wrapper classes for C++ that mainly allow
3981you to use some convenience methods to start/stop watchers and also change 3983you to use some convenience methods to start/stop watchers and also change
3982the callback model to a model using method callbacks on objects. 3984the callback model to a model using method callbacks on objects.
3983 3985
3984To use it, 3986To use it,
3985 3987
3986 #include <ev++.h> 3988 #include <ev++.h>
3987 3989
3988This automatically includes F<ev.h> and puts all of its definitions (many 3990This automatically includes F<ev.h> and puts all of its definitions (many
3989of them macros) into the global namespace. All C++ specific things are 3991of them macros) into the global namespace. All C++ specific things are
3990put into the C<ev> namespace. It should support all the same embedding 3992put into the C<ev> namespace. It should support all the same embedding
4618different cpus (or different cpu cores). This reduces dependencies 4620different cpus (or different cpu cores). This reduces dependencies
4619and makes libev faster. 4621and makes libev faster.
4620 4622
4621=item EV_NO_THREADS 4623=item EV_NO_THREADS
4622 4624
4623If defined to be C<1>, libev will assume that it will never be called 4625If defined to be C<1>, libev will assume that it will never be called from
4624from different threads, which is a stronger assumption than C<EV_NO_SMP>, 4626different threads (that includes signal handlers), which is a stronger
4625above. This reduces dependencies and makes libev faster. 4627assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4628libev faster.
4626 4629
4627=item EV_ATOMIC_T 4630=item EV_ATOMIC_T
4628 4631
4629Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4632Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4630access is atomic and serialised with respect to other threads or signal 4633access is atomic with respect to other threads or signal contexts. No
4631contexts. No such type is easily found in the C language, so you can 4634such type is easily found in the C language, so you can provide your own
4632provide your own type that you know is safe for your purposes. It is used 4635type that you know is safe for your purposes. It is used both for signal
4633both for signal handler "locking" as well as for signal and thread safety 4636handler "locking" as well as for signal and thread safety in C<ev_async>
4634in C<ev_async> watchers. 4637watchers.
4635 4638
4636In the absence of this define, libev will use C<sig_atomic_t volatile> 4639In the absence of this define, libev will use C<sig_atomic_t volatile>
4637(from F<signal.h>), which is usually good enough on most platforms, 4640(from F<signal.h>), which is usually good enough on most platforms.
4638although strictly speaking using a type that also implies a memory fence
4639is required.
4640 4641
4641=item EV_H (h) 4642=item EV_H (h)
4642 4643
4643The name of the F<ev.h> header file used to include it. The default if 4644The name of the F<ev.h> header file used to include it. The default if
4644undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4645undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
5313thread" or will block signals process-wide, both behaviours would 5314thread" or will block signals process-wide, both behaviours would
5314be compatible with libev. Interaction between C<sigprocmask> and 5315be compatible with libev. Interaction between C<sigprocmask> and
5315C<pthread_sigmask> could complicate things, however. 5316C<pthread_sigmask> could complicate things, however.
5316 5317
5317The most portable way to handle signals is to block signals in all threads 5318The most portable way to handle signals is to block signals in all threads
5318except the initial one, and run the default loop in the initial thread as 5319except the initial one, and run the signal handling loop in the initial
5319well. 5320thread as well.
5320 5321
5321=item C<long> must be large enough for common memory allocation sizes 5322=item C<long> must be large enough for common memory allocation sizes
5322 5323
5323To improve portability and simplify its API, libev uses C<long> internally 5324To improve portability and simplify its API, libev uses C<long> internally
5324instead of C<size_t> when allocating its data structures. On non-POSIX 5325instead of C<size_t> when allocating its data structures. On non-POSIX
5428=over 4 5429=over 4
5429 5430
5430=item C<EV_COMPAT3> backwards compatibility mechanism 5431=item C<EV_COMPAT3> backwards compatibility mechanism
5431 5432
5432The backward compatibility mechanism can be controlled by 5433The backward compatibility mechanism can be controlled by
5433C<EV_COMPAT3>. See L</PREPROCESSOR SYMBOLS/MACROS> in the L</EMBEDDING> 5434C<EV_COMPAT3>. See L</"PREPROCESSOR SYMBOLS/MACROS"> in the L</EMBEDDING>
5434section. 5435section.
5435 5436
5436=item C<ev_default_destroy> and C<ev_default_fork> have been removed 5437=item C<ev_default_destroy> and C<ev_default_fork> have been removed
5437 5438
5438These calls can be replaced easily by their C<ev_loop_xxx> counterparts: 5439These calls can be replaced easily by their C<ev_loop_xxx> counterparts:

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines