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

Comparing libev/ev.pod (file contents):
Revision 1.418 by sf-exg, Mon May 7 07:00:00 2012 UTC vs.
Revision 1.426 by root, Sat Feb 23 23:06:40 2013 UTC

569kernel is more efficient (which says nothing about its actual speed, of 569kernel is more efficient (which says nothing about its actual speed, of
570course). While stopping, setting and starting an I/O watcher does never 570course). 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 571cause 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 572two 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 573might 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 574drops fds silently in similarly hard-to-detect cases.
575 575
576This backend usually performs well under most conditions. 576This backend usually performs well under most conditions.
577 577
578While nominally embeddable in other event loops, this doesn't work 578While nominally embeddable in other event loops, this doesn't work
579everywhere, so you might need to test for this. And since it is broken 579everywhere, so you might need to test for this. And since it is broken
1393transition between them will be described in more detail - and while these 1393transition between them will be described in more detail - and while these
1394rules might look complicated, they usually do "the right thing". 1394rules might look complicated, they usually do "the right thing".
1395 1395
1396=over 4 1396=over 4
1397 1397
1398=item initialiased 1398=item initialised
1399 1399
1400Before a watcher can be registered with the event loop it has to be 1400Before 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 1401initialised. 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. 1402C<ev_init> followed by the watcher-specific C<ev_TYPE_set> function.
1403 1403
2606 2606
2607=head2 C<ev_stat> - did the file attributes just change? 2607=head2 C<ev_stat> - did the file attributes just change?
2608 2608
2609This watches a file system path for attribute changes. That is, it calls 2609This 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) 2610C<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 2611and sees if it changed compared to the last time, invoking the callback
2612it did. 2612if it did. Starting the watcher C<stat>'s the file, so only changes that
2613happen after the watcher has been started will be reported.
2613 2614
2614The path does not need to exist: changing from "path exists" to "path does 2615The 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 2616not 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 2617exist" (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 2618C<st_nlink> field being zero (which is otherwise always forced to be at
2962 2963
2963Using an C<ev_check> watcher is almost enough: it will be called on the 2964Using 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 - 2965next event loop iteration. However, that isn't as soon as possible -
2965without external events, your C<ev_check> watcher will not be invoked. 2966without external events, your C<ev_check> watcher will not be invoked.
2966 2967
2967
2968This is where C<ev_idle> watchers come in handy - all you need is a 2968This 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 2969single 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 2970C<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 2971will not sleep, and the C<ev_check> watcher makes sure a callback gets
2972invoked. Neither watcher alone can do that. 2972invoked. Neither watcher alone can do that.
3178 3178
3179=over 4 3179=over 4
3180 3180
3181=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop) 3181=item ev_embed_init (ev_embed *, callback, struct ev_loop *embedded_loop)
3182 3182
3183=item ev_embed_set (ev_embed *, callback, struct ev_loop *embedded_loop) 3183=item ev_embed_set (ev_embed *, struct ev_loop *embedded_loop)
3184 3184
3185Configures the watcher to embed the given loop, which must be 3185Configures the watcher to embed the given loop, which must be
3186embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be 3186embeddable. If the callback is C<0>, then C<ev_embed_sweep> will be
3187invoked automatically, otherwise it is the responsibility of the callback 3187invoked automatically, otherwise it is the responsibility of the callback
3188to invoke it (it will continue to be called until the sweep has been done, 3188to invoke it (it will continue to be called until the sweep has been done,
3251 3251
3252=head2 C<ev_fork> - the audacity to resume the event loop after a fork 3252=head2 C<ev_fork> - the audacity to resume the event loop after a fork
3253 3253
3254Fork watchers are called when a C<fork ()> was detected (usually because 3254Fork watchers are called when a C<fork ()> was detected (usually because
3255whoever is a good citizen cared to tell libev about it by calling 3255whoever 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 3256C<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, 3257and 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 3258after 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 3259and calls it in the wrong process, the fork handlers will be invoked, too,
3260handlers will be invoked, too, of course. 3260of course.
3261 3261
3262=head3 The special problem of life after fork - how is it possible? 3262=head3 The special problem of life after fork - how is it possible?
3263 3263
3264Most uses of C<fork()> consist of forking, then some simple calls to set 3264Most 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 3265up/change the process environment, followed by a call to C<exec()>. This
3659already been invoked. 3659already been invoked.
3660 3660
3661A common way around all these issues is to make sure that 3661A common way around all these issues is to make sure that
3662C<start_new_request> I<always> returns before the callback is invoked. If 3662C<start_new_request> I<always> returns before the callback is invoked. If
3663C<start_new_request> immediately knows the result, it can artificially 3663C<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 3664delay invoking the callback by using a C<prepare> or C<idle> watcher for
3665for example, or more sneakily, by reusing an existing (stopped) watcher 3665example, or more sneakily, by reusing an existing (stopped) watcher and
3666and pushing it into the pending queue: 3666pushing it into the pending queue:
3667 3667
3668 ev_set_cb (watcher, callback); 3668 ev_set_cb (watcher, callback);
3669 ev_feed_event (EV_A_ watcher, 0); 3669 ev_feed_event (EV_A_ watcher, 0);
3670 3670
3671This way, C<start_new_request> can safely return before the callback is 3671This way, C<start_new_request> can safely return before the callback is
3679 3679
3680This brings the problem of exiting - a callback might want to finish the 3680This 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 3681main 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 3682a 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 3683and 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. 3684other combination: In these cases, a simple C<ev_break> will not work.
3685 3685
3686The solution is to maintain "break this loop" variable for each C<ev_run> 3686The 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 3687invocation, and use a loop around C<ev_run> until the condition is
3688triggered, using C<EVRUN_ONCE>: 3688triggered, using C<EVRUN_ONCE>:
3689 3689
4121Associates a different C<struct ev_loop> with this watcher. You can only 4121Associates a different C<struct ev_loop> with this watcher. You can only
4122do this when the watcher is inactive (and not pending either). 4122do this when the watcher is inactive (and not pending either).
4123 4123
4124=item w->set ([arguments]) 4124=item w->set ([arguments])
4125 4125
4126Basically the same as C<ev_TYPE_set>, with the same arguments. Either this 4126Basically 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 4127with the same arguments. Either this method or a suitable start method
4128C counterpart, an active watcher gets automatically stopped and restarted 4128must be called at least once. Unlike the C counterpart, an active watcher
4129when reconfiguring it with this method. 4129gets automatically stopped and restarted when reconfiguring it with this
4130method.
4131
4132For C<ev::embed> watchers this method is called C<set_embed>, to avoid
4133clashing with the C<set (loop)> method.
4130 4134
4131=item w->start () 4135=item w->start ()
4132 4136
4133Starts the watcher. Note that there is no C<loop> argument, as the 4137Starts the watcher. Note that there is no C<loop> argument, as the
4134constructor already stores the event loop. 4138constructor already stores the event loop.
4614different cpus (or different cpu cores). This reduces dependencies 4618different cpus (or different cpu cores). This reduces dependencies
4615and makes libev faster. 4619and makes libev faster.
4616 4620
4617=item EV_NO_THREADS 4621=item EV_NO_THREADS
4618 4622
4619If defined to be C<1>, libev will assume that it will never be called 4623If defined to be C<1>, libev will assume that it will never be called from
4620from different threads, which is a stronger assumption than C<EV_NO_SMP>, 4624different threads (that includes signal handlers), which is a stronger
4621above. This reduces dependencies and makes libev faster. 4625assumption than C<EV_NO_SMP>, above. This reduces dependencies and makes
4626libev faster.
4622 4627
4623=item EV_ATOMIC_T 4628=item EV_ATOMIC_T
4624 4629
4625Libev requires an integer type (suitable for storing C<0> or C<1>) whose 4630Libev requires an integer type (suitable for storing C<0> or C<1>) whose
4626access is atomic and serialised with respect to other threads or signal 4631access is atomic with respect to other threads or signal contexts. No
4627contexts. No such type is easily found in the C language, so you can 4632such type is easily found in the C language, so you can provide your own
4628provide your own type that you know is safe for your purposes. It is used 4633type that you know is safe for your purposes. It is used both for signal
4629both for signal handler "locking" as well as for signal and thread safety 4634handler "locking" as well as for signal and thread safety in C<ev_async>
4630in C<ev_async> watchers. 4635watchers.
4631 4636
4632In the absence of this define, libev will use C<sig_atomic_t volatile> 4637In the absence of this define, libev will use C<sig_atomic_t volatile>
4633(from F<signal.h>), which is usually good enough on most platforms, 4638(from F<signal.h>), which is usually good enough on most platforms.
4634although strictly speaking using a type that also implies a memory fence
4635is required.
4636 4639
4637=item EV_H (h) 4640=item EV_H (h)
4638 4641
4639The name of the F<ev.h> header file used to include it. The default if 4642The name of the F<ev.h> header file used to include it. The default if
4640undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be 4643undefined is C<"ev.h"> in F<event.h>, F<ev.c> and F<ev++.h>. This can be
5309thread" or will block signals process-wide, both behaviours would 5312thread" or will block signals process-wide, both behaviours would
5310be compatible with libev. Interaction between C<sigprocmask> and 5313be compatible with libev. Interaction between C<sigprocmask> and
5311C<pthread_sigmask> could complicate things, however. 5314C<pthread_sigmask> could complicate things, however.
5312 5315
5313The most portable way to handle signals is to block signals in all threads 5316The most portable way to handle signals is to block signals in all threads
5314except the initial one, and run the default loop in the initial thread as 5317except the initial one, and run the signal handling loop in the initial
5315well. 5318thread as well.
5316 5319
5317=item C<long> must be large enough for common memory allocation sizes 5320=item C<long> must be large enough for common memory allocation sizes
5318 5321
5319To improve portability and simplify its API, libev uses C<long> internally 5322To improve portability and simplify its API, libev uses C<long> internally
5320instead of C<size_t> when allocating its data structures. On non-POSIX 5323instead of C<size_t> when allocating its data structures. On non-POSIX

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines