ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
Revision: 1.229
Committed: Wed Jul 8 02:01:12 2009 UTC (15 years ago) by root
Branch: MAIN
Changes since 1.228: +6 -31 lines
Log Message:
*** empty log message ***

File Contents

# User Rev Content
1 root 1.150 =head1 NAME
2 root 1.1
3 root 1.211 AnyEvent - provide framework for multiple event loops
4 root 1.2
5 root 1.211 EV, Event, Glib, Tk, Perl, Event::Lib, Qt and POE are various supported
6     event loops.
7 root 1.1
8     =head1 SYNOPSIS
9    
10 root 1.7 use AnyEvent;
11 root 1.2
12 root 1.207 # file descriptor readable
13     my $w = AnyEvent->io (fh => $fh, poll => "r", cb => sub { ... });
14 root 1.173
15 root 1.207 # one-shot or repeating timers
16 root 1.173 my $w = AnyEvent->timer (after => $seconds, cb => sub { ... });
17     my $w = AnyEvent->timer (after => $seconds, interval => $seconds, cb => ...
18    
19     print AnyEvent->now; # prints current event loop time
20     print AnyEvent->time; # think Time::HiRes::time or simply CORE::time.
21    
22 root 1.207 # POSIX signal
23 root 1.173 my $w = AnyEvent->signal (signal => "TERM", cb => sub { ... });
24 root 1.5
25 root 1.207 # child process exit
26 root 1.173 my $w = AnyEvent->child (pid => $pid, cb => sub {
27     my ($pid, $status) = @_;
28 root 1.2 ...
29     });
30    
31 root 1.207 # called when event loop idle (if applicable)
32     my $w = AnyEvent->idle (cb => sub { ... });
33    
34 root 1.52 my $w = AnyEvent->condvar; # stores whether a condition was flagged
35 root 1.114 $w->send; # wake up current and all future recv's
36     $w->recv; # enters "main loop" till $condvar gets ->send
37 root 1.173 # use a condvar in callback mode:
38     $w->cb (sub { $_[0]->recv });
39 root 1.5
40 root 1.148 =head1 INTRODUCTION/TUTORIAL
41    
42     This manpage is mainly a reference manual. If you are interested
43     in a tutorial or some gentle introduction, have a look at the
44     L<AnyEvent::Intro> manpage.
45    
46 root 1.43 =head1 WHY YOU SHOULD USE THIS MODULE (OR NOT)
47 root 1.41
48     Glib, POE, IO::Async, Event... CPAN offers event models by the dozen
49     nowadays. So what is different about AnyEvent?
50    
51     Executive Summary: AnyEvent is I<compatible>, AnyEvent is I<free of
52     policy> and AnyEvent is I<small and efficient>.
53    
54     First and foremost, I<AnyEvent is not an event model> itself, it only
55 root 1.168 interfaces to whatever event model the main program happens to use, in a
56 root 1.41 pragmatic way. For event models and certain classes of immortals alike,
57 root 1.53 the statement "there can only be one" is a bitter reality: In general,
58     only one event loop can be active at the same time in a process. AnyEvent
59 root 1.168 cannot change this, but it can hide the differences between those event
60     loops.
61 root 1.41
62     The goal of AnyEvent is to offer module authors the ability to do event
63     programming (waiting for I/O or timer events) without subscribing to a
64     religion, a way of living, and most importantly: without forcing your
65     module users into the same thing by forcing them to use the same event
66     model you use.
67    
68 root 1.53 For modules like POE or IO::Async (which is a total misnomer as it is
69     actually doing all I/O I<synchronously>...), using them in your module is
70     like joining a cult: After you joined, you are dependent on them and you
71 root 1.168 cannot use anything else, as they are simply incompatible to everything
72     that isn't them. What's worse, all the potential users of your
73     module are I<also> forced to use the same event loop you use.
74 root 1.53
75     AnyEvent is different: AnyEvent + POE works fine. AnyEvent + Glib works
76     fine. AnyEvent + Tk works fine etc. etc. but none of these work together
77 root 1.142 with the rest: POE + IO::Async? No go. Tk + Event? No go. Again: if
78 root 1.53 your module uses one of those, every user of your module has to use it,
79     too. But if your module uses AnyEvent, it works transparently with all
80 root 1.168 event models it supports (including stuff like IO::Async, as long as those
81     use one of the supported event loops. It is trivial to add new event loops
82     to AnyEvent, too, so it is future-proof).
83 root 1.41
84 root 1.53 In addition to being free of having to use I<the one and only true event
85 root 1.41 model>, AnyEvent also is free of bloat and policy: with POE or similar
86 root 1.128 modules, you get an enormous amount of code and strict rules you have to
87 root 1.53 follow. AnyEvent, on the other hand, is lean and up to the point, by only
88     offering the functionality that is necessary, in as thin as a wrapper as
89 root 1.41 technically possible.
90    
91 root 1.142 Of course, AnyEvent comes with a big (and fully optional!) toolbox
92     of useful functionality, such as an asynchronous DNS resolver, 100%
93     non-blocking connects (even with TLS/SSL, IPv6 and on broken platforms
94     such as Windows) and lots of real-world knowledge and workarounds for
95     platform bugs and differences.
96    
97     Now, if you I<do want> lots of policy (this can arguably be somewhat
98 root 1.46 useful) and you want to force your users to use the one and only event
99     model, you should I<not> use this module.
100 root 1.43
101 root 1.1 =head1 DESCRIPTION
102    
103 root 1.2 L<AnyEvent> provides an identical interface to multiple event loops. This
104 root 1.13 allows module authors to utilise an event loop without forcing module
105 root 1.2 users to use the same event loop (as only a single event loop can coexist
106     peacefully at any one time).
107    
108 root 1.53 The interface itself is vaguely similar, but not identical to the L<Event>
109 root 1.2 module.
110    
111 root 1.53 During the first call of any watcher-creation method, the module tries
112 root 1.61 to detect the currently loaded event loop by probing whether one of the
113 root 1.108 following modules is already loaded: L<EV>,
114 root 1.81 L<Event>, L<Glib>, L<AnyEvent::Impl::Perl>, L<Tk>, L<Event::Lib>, L<Qt>,
115 root 1.61 L<POE>. The first one found is used. If none are found, the module tries
116 root 1.81 to load these modules (excluding Tk, Event::Lib, Qt and POE as the pure perl
117 root 1.61 adaptor should always succeed) in the order given. The first one that can
118 root 1.57 be successfully loaded will be used. If, after this, still none could be
119     found, AnyEvent will fall back to a pure-perl event loop, which is not
120     very efficient, but should work everywhere.
121 root 1.14
122     Because AnyEvent first checks for modules that are already loaded, loading
123 root 1.53 an event model explicitly before first using AnyEvent will likely make
124 root 1.14 that model the default. For example:
125    
126     use Tk;
127     use AnyEvent;
128    
129     # .. AnyEvent will likely default to Tk
130    
131 root 1.53 The I<likely> means that, if any module loads another event model and
132     starts using it, all bets are off. Maybe you should tell their authors to
133     use AnyEvent so their modules work together with others seamlessly...
134    
135 root 1.14 The pure-perl implementation of AnyEvent is called
136     C<AnyEvent::Impl::Perl>. Like other event modules you can load it
137 root 1.142 explicitly and enjoy the high availability of that event loop :)
138 root 1.14
139     =head1 WATCHERS
140    
141     AnyEvent has the central concept of a I<watcher>, which is an object that
142     stores relevant data for each kind of event you are waiting for, such as
143 root 1.128 the callback to call, the file handle to watch, etc.
144 root 1.14
145     These watchers are normal Perl objects with normal Perl lifetime. After
146 root 1.53 creating a watcher it will immediately "watch" for events and invoke the
147     callback when the event occurs (of course, only when the event model
148     is in control).
149    
150 root 1.196 Note that B<callbacks must not permanently change global variables>
151     potentially in use by the event loop (such as C<$_> or C<$[>) and that B<<
152     callbacks must not C<die> >>. The former is good programming practise in
153     Perl and the latter stems from the fact that exception handling differs
154     widely between event loops.
155    
156 root 1.53 To disable the watcher you have to destroy it (e.g. by setting the
157     variable you store it in to C<undef> or otherwise deleting all references
158     to it).
159 root 1.14
160     All watchers are created by calling a method on the C<AnyEvent> class.
161    
162 root 1.53 Many watchers either are used with "recursion" (repeating timers for
163     example), or need to refer to their watcher object in other ways.
164    
165     An any way to achieve that is this pattern:
166    
167 root 1.151 my $w; $w = AnyEvent->type (arg => value ..., cb => sub {
168     # you can use $w here, for example to undef it
169     undef $w;
170     });
171 root 1.53
172     Note that C<my $w; $w => combination. This is necessary because in Perl,
173     my variables are only visible after the statement in which they are
174     declared.
175    
176 root 1.78 =head2 I/O WATCHERS
177 root 1.14
178 root 1.53 You can create an I/O watcher by calling the C<< AnyEvent->io >> method
179     with the following mandatory key-value pairs as arguments:
180 root 1.14
181 root 1.229 C<fh> is the Perl I<file handle> (or a naked file descriptor) to watch
182     for events (AnyEvent might or might not keep a reference to this file
183     handle). Note that only file handles pointing to things for which
184 root 1.199 non-blocking operation makes sense are allowed. This includes sockets,
185     most character devices, pipes, fifos and so on, but not for example files
186     or block devices.
187    
188     C<poll> must be a string that is either C<r> or C<w>, which creates a
189     watcher waiting for "r"eadable or "w"ritable events, respectively.
190    
191     C<cb> is the callback to invoke each time the file handle becomes ready.
192 root 1.53
193 root 1.85 Although the callback might get passed parameters, their value and
194     presence is undefined and you cannot rely on them. Portable AnyEvent
195     callbacks cannot use arguments passed to I/O watcher callbacks.
196    
197 root 1.82 The I/O watcher might use the underlying file descriptor or a copy of it.
198 root 1.84 You must not close a file handle as long as any watcher is active on the
199     underlying file descriptor.
200 root 1.53
201     Some event loops issue spurious readyness notifications, so you should
202     always use non-blocking calls when reading/writing from/to your file
203     handles.
204 root 1.14
205 root 1.164 Example: wait for readability of STDIN, then read a line and disable the
206     watcher.
207 root 1.14
208     my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
209     chomp (my $input = <STDIN>);
210     warn "read: $input\n";
211     undef $w;
212     });
213    
214 root 1.19 =head2 TIME WATCHERS
215 root 1.14
216 root 1.19 You can create a time watcher by calling the C<< AnyEvent->timer >>
217 root 1.14 method with the following mandatory arguments:
218    
219 root 1.53 C<after> specifies after how many seconds (fractional values are
220 root 1.85 supported) the callback should be invoked. C<cb> is the callback to invoke
221     in that case.
222    
223     Although the callback might get passed parameters, their value and
224     presence is undefined and you cannot rely on them. Portable AnyEvent
225     callbacks cannot use arguments passed to time watcher callbacks.
226 root 1.14
227 root 1.164 The callback will normally be invoked once only. If you specify another
228 root 1.165 parameter, C<interval>, as a strictly positive number (> 0), then the
229     callback will be invoked regularly at that interval (in fractional
230     seconds) after the first invocation. If C<interval> is specified with a
231     false value, then it is treated as if it were missing.
232 root 1.164
233     The callback will be rescheduled before invoking the callback, but no
234     attempt is done to avoid timer drift in most backends, so the interval is
235     only approximate.
236 root 1.14
237 root 1.164 Example: fire an event after 7.7 seconds.
238 root 1.14
239     my $w = AnyEvent->timer (after => 7.7, cb => sub {
240     warn "timeout\n";
241     });
242    
243     # to cancel the timer:
244 root 1.37 undef $w;
245 root 1.14
246 root 1.164 Example 2: fire an event after 0.5 seconds, then roughly every second.
247 root 1.53
248 root 1.164 my $w = AnyEvent->timer (after => 0.5, interval => 1, cb => sub {
249     warn "timeout\n";
250 root 1.53 };
251    
252     =head3 TIMING ISSUES
253    
254     There are two ways to handle timers: based on real time (relative, "fire
255     in 10 seconds") and based on wallclock time (absolute, "fire at 12
256     o'clock").
257    
258 root 1.58 While most event loops expect timers to specified in a relative way, they
259     use absolute time internally. This makes a difference when your clock
260     "jumps", for example, when ntp decides to set your clock backwards from
261     the wrong date of 2014-01-01 to 2008-01-01, a watcher that is supposed to
262     fire "after" a second might actually take six years to finally fire.
263 root 1.53
264     AnyEvent cannot compensate for this. The only event loop that is conscious
265 root 1.58 about these issues is L<EV>, which offers both relative (ev_timer, based
266     on true relative time) and absolute (ev_periodic, based on wallclock time)
267     timers.
268 root 1.53
269     AnyEvent always prefers relative timers, if available, matching the
270     AnyEvent API.
271    
272 root 1.143 AnyEvent has two additional methods that return the "current time":
273    
274     =over 4
275    
276     =item AnyEvent->time
277    
278     This returns the "current wallclock time" as a fractional number of
279     seconds since the Epoch (the same thing as C<time> or C<Time::HiRes::time>
280     return, and the result is guaranteed to be compatible with those).
281    
282 root 1.144 It progresses independently of any event loop processing, i.e. each call
283     will check the system clock, which usually gets updated frequently.
284 root 1.143
285     =item AnyEvent->now
286    
287     This also returns the "current wallclock time", but unlike C<time>, above,
288     this value might change only once per event loop iteration, depending on
289     the event loop (most return the same time as C<time>, above). This is the
290 root 1.144 time that AnyEvent's timers get scheduled against.
291    
292     I<In almost all cases (in all cases if you don't care), this is the
293     function to call when you want to know the current time.>
294    
295     This function is also often faster then C<< AnyEvent->time >>, and
296     thus the preferred method if you want some timestamp (for example,
297     L<AnyEvent::Handle> uses this to update it's activity timeouts).
298    
299     The rest of this section is only of relevance if you try to be very exact
300     with your timing, you can skip it without bad conscience.
301 root 1.143
302     For a practical example of when these times differ, consider L<Event::Lib>
303     and L<EV> and the following set-up:
304    
305     The event loop is running and has just invoked one of your callback at
306     time=500 (assume no other callbacks delay processing). In your callback,
307     you wait a second by executing C<sleep 1> (blocking the process for a
308     second) and then (at time=501) you create a relative timer that fires
309     after three seconds.
310    
311     With L<Event::Lib>, C<< AnyEvent->time >> and C<< AnyEvent->now >> will
312     both return C<501>, because that is the current time, and the timer will
313     be scheduled to fire at time=504 (C<501> + C<3>).
314    
315 root 1.144 With L<EV>, C<< AnyEvent->time >> returns C<501> (as that is the current
316 root 1.143 time), but C<< AnyEvent->now >> returns C<500>, as that is the time the
317     last event processing phase started. With L<EV>, your timer gets scheduled
318     to run at time=503 (C<500> + C<3>).
319    
320     In one sense, L<Event::Lib> is more exact, as it uses the current time
321     regardless of any delays introduced by event processing. However, most
322     callbacks do not expect large delays in processing, so this causes a
323 root 1.144 higher drift (and a lot more system calls to get the current time).
324 root 1.143
325     In another sense, L<EV> is more exact, as your timer will be scheduled at
326     the same time, regardless of how long event processing actually took.
327    
328     In either case, if you care (and in most cases, you don't), then you
329     can get whatever behaviour you want with any event loop, by taking the
330     difference between C<< AnyEvent->time >> and C<< AnyEvent->now >> into
331     account.
332    
333 root 1.205 =item AnyEvent->now_update
334    
335     Some event loops (such as L<EV> or L<AnyEvent::Impl::Perl>) cache
336     the current time for each loop iteration (see the discussion of L<<
337     AnyEvent->now >>, above).
338    
339     When a callback runs for a long time (or when the process sleeps), then
340     this "current" time will differ substantially from the real time, which
341     might affect timers and time-outs.
342    
343     When this is the case, you can call this method, which will update the
344     event loop's idea of "current time".
345    
346     Note that updating the time I<might> cause some events to be handled.
347    
348 root 1.143 =back
349    
350 root 1.53 =head2 SIGNAL WATCHERS
351 root 1.14
352 root 1.53 You can watch for signals using a signal watcher, C<signal> is the signal
353 root 1.167 I<name> in uppercase and without any C<SIG> prefix, C<cb> is the Perl
354     callback to be invoked whenever a signal occurs.
355 root 1.53
356 root 1.85 Although the callback might get passed parameters, their value and
357     presence is undefined and you cannot rely on them. Portable AnyEvent
358     callbacks cannot use arguments passed to signal watcher callbacks.
359    
360 elmex 1.129 Multiple signal occurrences can be clumped together into one callback
361     invocation, and callback invocation will be synchronous. Synchronous means
362 root 1.53 that it might take a while until the signal gets handled by the process,
363 elmex 1.129 but it is guaranteed not to interrupt any other callbacks.
364 root 1.53
365     The main advantage of using these watchers is that you can share a signal
366     between multiple watchers.
367    
368     This watcher might use C<%SIG>, so programs overwriting those signals
369     directly will likely not work correctly.
370    
371     Example: exit on SIGINT
372    
373     my $w = AnyEvent->signal (signal => "INT", cb => sub { exit 1 });
374    
375     =head2 CHILD PROCESS WATCHERS
376    
377     You can also watch on a child process exit and catch its exit status.
378    
379     The child process is specified by the C<pid> argument (if set to C<0>, it
380 root 1.181 watches for any child process exit). The watcher will triggered only when
381     the child process has finished and an exit status is available, not on
382     any trace events (stopped/continued).
383    
384     The callback will be called with the pid and exit status (as returned by
385     waitpid), so unlike other watcher types, you I<can> rely on child watcher
386     callback arguments.
387    
388     This watcher type works by installing a signal handler for C<SIGCHLD>,
389     and since it cannot be shared, nothing else should use SIGCHLD or reap
390     random child processes (waiting for specific child processes, e.g. inside
391     C<system>, is just fine).
392 root 1.53
393 root 1.82 There is a slight catch to child watchers, however: you usually start them
394     I<after> the child process was created, and this means the process could
395     have exited already (and no SIGCHLD will be sent anymore).
396    
397 root 1.219 Not all event models handle this correctly (neither POE nor IO::Async do,
398     see their AnyEvent::Impl manpages for details), but even for event models
399     that I<do> handle this correctly, they usually need to be loaded before
400     the process exits (i.e. before you fork in the first place). AnyEvent's
401     pure perl event loop handles all cases correctly regardless of when you
402     start the watcher.
403    
404     This means you cannot create a child watcher as the very first
405     thing in an AnyEvent program, you I<have> to create at least one
406     watcher before you C<fork> the child (alternatively, you can call
407     C<AnyEvent::detect>).
408 root 1.82
409     Example: fork a process and wait for it
410    
411 root 1.151 my $done = AnyEvent->condvar;
412    
413     my $pid = fork or exit 5;
414    
415     my $w = AnyEvent->child (
416     pid => $pid,
417     cb => sub {
418     my ($pid, $status) = @_;
419     warn "pid $pid exited with status $status";
420     $done->send;
421     },
422     );
423    
424     # do something else, then wait for process exit
425     $done->recv;
426 root 1.82
427 root 1.207 =head2 IDLE WATCHERS
428    
429     Sometimes there is a need to do something, but it is not so important
430     to do it instantly, but only when there is nothing better to do. This
431     "nothing better to do" is usually defined to be "no other events need
432     attention by the event loop".
433    
434     Idle watchers ideally get invoked when the event loop has nothing
435     better to do, just before it would block the process to wait for new
436     events. Instead of blocking, the idle watcher is invoked.
437    
438     Most event loops unfortunately do not really support idle watchers (only
439     EV, Event and Glib do it in a usable fashion) - for the rest, AnyEvent
440     will simply call the callback "from time to time".
441    
442     Example: read lines from STDIN, but only process them when the
443     program is otherwise idle:
444    
445     my @lines; # read data
446     my $idle_w;
447     my $io_w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
448     push @lines, scalar <STDIN>;
449    
450     # start an idle watcher, if not already done
451     $idle_w ||= AnyEvent->idle (cb => sub {
452     # handle only one line, when there are lines left
453     if (my $line = shift @lines) {
454     print "handled when idle: $line";
455     } else {
456     # otherwise disable the idle watcher again
457     undef $idle_w;
458     }
459     });
460     });
461    
462 root 1.53 =head2 CONDITION VARIABLES
463    
464 root 1.105 If you are familiar with some event loops you will know that all of them
465     require you to run some blocking "loop", "run" or similar function that
466     will actively watch for new events and call your callbacks.
467    
468     AnyEvent is different, it expects somebody else to run the event loop and
469     will only block when necessary (usually when told by the user).
470    
471     The instrument to do that is called a "condition variable", so called
472     because they represent a condition that must become true.
473    
474     Condition variables can be created by calling the C<< AnyEvent->condvar
475     >> method, usually without arguments. The only argument pair allowed is
476 root 1.173
477 root 1.105 C<cb>, which specifies a callback to be called when the condition variable
478 root 1.173 becomes true, with the condition variable as the first argument (but not
479     the results).
480 root 1.105
481 elmex 1.129 After creation, the condition variable is "false" until it becomes "true"
482 root 1.131 by calling the C<send> method (or calling the condition variable as if it
483 root 1.135 were a callback, read about the caveats in the description for the C<<
484     ->send >> method).
485 root 1.105
486     Condition variables are similar to callbacks, except that you can
487     optionally wait for them. They can also be called merge points - points
488 elmex 1.129 in time where multiple outstanding events have been processed. And yet
489     another way to call them is transactions - each condition variable can be
490 root 1.105 used to represent a transaction, which finishes at some point and delivers
491     a result.
492 root 1.14
493 root 1.105 Condition variables are very useful to signal that something has finished,
494     for example, if you write a module that does asynchronous http requests,
495 root 1.53 then a condition variable would be the ideal candidate to signal the
496 root 1.105 availability of results. The user can either act when the callback is
497 root 1.114 called or can synchronously C<< ->recv >> for the results.
498 root 1.53
499 root 1.105 You can also use them to simulate traditional event loops - for example,
500     you can block your main program until an event occurs - for example, you
501 root 1.114 could C<< ->recv >> in your main program until the user clicks the Quit
502 root 1.106 button of your app, which would C<< ->send >> the "quit" event.
503 root 1.53
504     Note that condition variables recurse into the event loop - if you have
505 elmex 1.129 two pieces of code that call C<< ->recv >> in a round-robin fashion, you
506 root 1.53 lose. Therefore, condition variables are good to export to your caller, but
507     you should avoid making a blocking wait yourself, at least in callbacks,
508     as this asks for trouble.
509 root 1.41
510 root 1.105 Condition variables are represented by hash refs in perl, and the keys
511     used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
512     easy (it is often useful to build your own transaction class on top of
513     AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
514     it's C<new> method in your own C<new> method.
515    
516     There are two "sides" to a condition variable - the "producer side" which
517 root 1.106 eventually calls C<< -> send >>, and the "consumer side", which waits
518     for the send to occur.
519 root 1.105
520 root 1.131 Example: wait for a timer.
521 root 1.105
522     # wait till the result is ready
523     my $result_ready = AnyEvent->condvar;
524    
525     # do something such as adding a timer
526 root 1.106 # or socket watcher the calls $result_ready->send
527 root 1.105 # when the "result" is ready.
528     # in this case, we simply use a timer:
529     my $w = AnyEvent->timer (
530     after => 1,
531 root 1.106 cb => sub { $result_ready->send },
532 root 1.105 );
533    
534     # this "blocks" (while handling events) till the callback
535 root 1.106 # calls send
536 root 1.114 $result_ready->recv;
537 root 1.105
538 root 1.131 Example: wait for a timer, but take advantage of the fact that
539     condition variables are also code references.
540    
541     my $done = AnyEvent->condvar;
542     my $delay = AnyEvent->timer (after => 5, cb => $done);
543     $done->recv;
544    
545 root 1.173 Example: Imagine an API that returns a condvar and doesn't support
546     callbacks. This is how you make a synchronous call, for example from
547     the main program:
548    
549     use AnyEvent::CouchDB;
550    
551     ...
552    
553     my @info = $couchdb->info->recv;
554    
555     And this is how you would just ste a callback to be called whenever the
556     results are available:
557    
558     $couchdb->info->cb (sub {
559     my @info = $_[0]->recv;
560     });
561    
562 root 1.105 =head3 METHODS FOR PRODUCERS
563    
564     These methods should only be used by the producing side, i.e. the
565 root 1.106 code/module that eventually sends the signal. Note that it is also
566 root 1.105 the producer side which creates the condvar in most cases, but it isn't
567     uncommon for the consumer to create it as well.
568 root 1.2
569 root 1.1 =over 4
570    
571 root 1.106 =item $cv->send (...)
572 root 1.105
573 root 1.114 Flag the condition as ready - a running C<< ->recv >> and all further
574     calls to C<recv> will (eventually) return after this method has been
575 root 1.106 called. If nobody is waiting the send will be remembered.
576 root 1.105
577     If a callback has been set on the condition variable, it is called
578 root 1.106 immediately from within send.
579 root 1.105
580 root 1.106 Any arguments passed to the C<send> call will be returned by all
581 root 1.114 future C<< ->recv >> calls.
582 root 1.105
583 root 1.135 Condition variables are overloaded so one can call them directly
584     (as a code reference). Calling them directly is the same as calling
585     C<send>. Note, however, that many C-based event loops do not handle
586     overloading, so as tempting as it may be, passing a condition variable
587     instead of a callback does not work. Both the pure perl and EV loops
588     support overloading, however, as well as all functions that use perl to
589     invoke a callback (as in L<AnyEvent::Socket> and L<AnyEvent::DNS> for
590     example).
591 root 1.131
592 root 1.105 =item $cv->croak ($error)
593    
594 root 1.114 Similar to send, but causes all call's to C<< ->recv >> to invoke
595 root 1.105 C<Carp::croak> with the given error message/object/scalar.
596    
597     This can be used to signal any errors to the condition variable
598     user/consumer.
599    
600     =item $cv->begin ([group callback])
601    
602     =item $cv->end
603    
604     These two methods can be used to combine many transactions/events into
605     one. For example, a function that pings many hosts in parallel might want
606     to use a condition variable for the whole process.
607    
608     Every call to C<< ->begin >> will increment a counter, and every call to
609     C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
610     >>, the (last) callback passed to C<begin> will be executed. That callback
611 root 1.106 is I<supposed> to call C<< ->send >>, but that is not required. If no
612     callback was set, C<send> will be called without any arguments.
613 root 1.105
614 root 1.222 You can think of C<< $cv->send >> giving you an OR condition (one call
615     sends), while C<< $cv->begin >> and C<< $cv->end >> giving you an AND
616     condition (all C<begin> calls must be C<end>'ed before the condvar sends).
617    
618     Let's start with a simple example: you have two I/O watchers (for example,
619     STDOUT and STDERR for a program), and you want to wait for both streams to
620     close before activating a condvar:
621    
622     my $cv = AnyEvent->condvar;
623    
624     $cv->begin; # first watcher
625     my $w1 = AnyEvent->io (fh => $fh1, cb => sub {
626     defined sysread $fh1, my $buf, 4096
627     or $cv->end;
628     });
629    
630     $cv->begin; # second watcher
631     my $w2 = AnyEvent->io (fh => $fh2, cb => sub {
632     defined sysread $fh2, my $buf, 4096
633     or $cv->end;
634     });
635    
636     $cv->recv;
637    
638     This works because for every event source (EOF on file handle), there is
639     one call to C<begin>, so the condvar waits for all calls to C<end> before
640     sending.
641    
642     The ping example mentioned above is slightly more complicated, as the
643     there are results to be passwd back, and the number of tasks that are
644     begung can potentially be zero:
645 root 1.105
646     my $cv = AnyEvent->condvar;
647    
648     my %result;
649 root 1.106 $cv->begin (sub { $cv->send (\%result) });
650 root 1.105
651     for my $host (@list_of_hosts) {
652     $cv->begin;
653     ping_host_then_call_callback $host, sub {
654     $result{$host} = ...;
655     $cv->end;
656     };
657     }
658    
659     $cv->end;
660    
661     This code fragment supposedly pings a number of hosts and calls
662 root 1.106 C<send> after results for all then have have been gathered - in any
663 root 1.105 order. To achieve this, the code issues a call to C<begin> when it starts
664     each ping request and calls C<end> when it has received some result for
665     it. Since C<begin> and C<end> only maintain a counter, the order in which
666     results arrive is not relevant.
667    
668     There is an additional bracketing call to C<begin> and C<end> outside the
669     loop, which serves two important purposes: first, it sets the callback
670     to be called once the counter reaches C<0>, and second, it ensures that
671 root 1.106 C<send> is called even when C<no> hosts are being pinged (the loop
672 root 1.105 doesn't execute once).
673    
674 root 1.222 This is the general pattern when you "fan out" into multiple (but
675     potentially none) subrequests: use an outer C<begin>/C<end> pair to set
676     the callback and ensure C<end> is called at least once, and then, for each
677     subrequest you start, call C<begin> and for each subrequest you finish,
678     call C<end>.
679 root 1.105
680     =back
681    
682     =head3 METHODS FOR CONSUMERS
683    
684     These methods should only be used by the consuming side, i.e. the
685     code awaits the condition.
686    
687 root 1.106 =over 4
688    
689 root 1.114 =item $cv->recv
690 root 1.14
691 root 1.106 Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
692 root 1.105 >> methods have been called on c<$cv>, while servicing other watchers
693     normally.
694    
695     You can only wait once on a condition - additional calls are valid but
696     will return immediately.
697    
698     If an error condition has been set by calling C<< ->croak >>, then this
699     function will call C<croak>.
700 root 1.14
701 root 1.106 In list context, all parameters passed to C<send> will be returned,
702 root 1.105 in scalar context only the first one will be returned.
703 root 1.14
704 root 1.47 Not all event models support a blocking wait - some die in that case
705 root 1.53 (programs might want to do that to stay interactive), so I<if you are
706     using this from a module, never require a blocking wait>, but let the
707 root 1.52 caller decide whether the call will block or not (for example, by coupling
708 root 1.47 condition variables with some kind of request results and supporting
709     callbacks so the caller knows that getting the result will not block,
710 elmex 1.129 while still supporting blocking waits if the caller so desires).
711 root 1.47
712 root 1.114 Another reason I<never> to C<< ->recv >> in a module is that you cannot
713     sensibly have two C<< ->recv >>'s in parallel, as that would require
714 root 1.47 multiple interpreters or coroutines/threads, none of which C<AnyEvent>
715 root 1.108 can supply.
716    
717     The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
718     fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
719     versions and also integrates coroutines into AnyEvent, making blocking
720 root 1.114 C<< ->recv >> calls perfectly safe as long as they are done from another
721 root 1.108 coroutine (one that doesn't run the event loop).
722 root 1.47
723 root 1.114 You can ensure that C<< -recv >> never blocks by setting a callback and
724     only calling C<< ->recv >> from within that callback (or at a later
725 root 1.105 time). This will work even when the event loop does not support blocking
726     waits otherwise.
727 root 1.53
728 root 1.106 =item $bool = $cv->ready
729    
730     Returns true when the condition is "true", i.e. whether C<send> or
731     C<croak> have been called.
732    
733 root 1.173 =item $cb = $cv->cb ($cb->($cv))
734 root 1.106
735     This is a mutator function that returns the callback set and optionally
736     replaces it before doing so.
737    
738     The callback will be called when the condition becomes "true", i.e. when
739 root 1.149 C<send> or C<croak> are called, with the only argument being the condition
740     variable itself. Calling C<recv> inside the callback or at any later time
741     is guaranteed not to block.
742 root 1.106
743 root 1.53 =back
744 root 1.14
745 root 1.53 =head1 GLOBAL VARIABLES AND FUNCTIONS
746 root 1.16
747     =over 4
748    
749     =item $AnyEvent::MODEL
750    
751     Contains C<undef> until the first watcher is being created. Then it
752     contains the event model that is being used, which is the name of the
753     Perl class implementing the model. This class is usually one of the
754     C<AnyEvent::Impl:xxx> modules, but can be any other class in the case
755     AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
756    
757     The known classes so far are:
758    
759 root 1.56 AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
760     AnyEvent::Impl::Event based on Event, second best choice.
761 root 1.104 AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
762 root 1.48 AnyEvent::Impl::Glib based on Glib, third-best choice.
763 root 1.16 AnyEvent::Impl::Tk based on Tk, very bad choice.
764 root 1.56 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
765 root 1.55 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
766 root 1.61 AnyEvent::Impl::POE based on POE, not generic enough for full support.
767    
768 root 1.219 # warning, support for IO::Async is only partial, as it is too broken
769     # and limited toe ven support the AnyEvent API. See AnyEvent::Impl::Async.
770     AnyEvent::Impl::IOAsync based on IO::Async, cannot be autoprobed (see its docs).
771    
772 root 1.61 There is no support for WxWidgets, as WxWidgets has no support for
773     watching file handles. However, you can use WxWidgets through the
774     POE Adaptor, as POE has a Wx backend that simply polls 20 times per
775     second, which was considered to be too horrible to even consider for
776 root 1.62 AnyEvent. Likewise, other POE backends can be used by AnyEvent by using
777 root 1.61 it's adaptor.
778 root 1.16
779 root 1.62 AnyEvent knows about L<Prima> and L<Wx> and will try to use L<POE> when
780     autodetecting them.
781    
782 root 1.19 =item AnyEvent::detect
783    
784 root 1.53 Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
785     if necessary. You should only call this function right before you would
786     have created an AnyEvent watcher anyway, that is, as late as possible at
787     runtime.
788 root 1.19
789 root 1.111 =item $guard = AnyEvent::post_detect { BLOCK }
790 root 1.109
791     Arranges for the code block to be executed as soon as the event model is
792     autodetected (or immediately if this has already happened).
793    
794 root 1.110 If called in scalar or list context, then it creates and returns an object
795 root 1.112 that automatically removes the callback again when it is destroyed. See
796     L<Coro::BDB> for a case where this is useful.
797 root 1.110
798 root 1.111 =item @AnyEvent::post_detect
799 root 1.108
800     If there are any code references in this array (you can C<push> to it
801     before or after loading AnyEvent), then they will called directly after
802     the event loop has been chosen.
803    
804     You should check C<$AnyEvent::MODEL> before adding to this array, though:
805     if it contains a true value then the event loop has already been detected,
806     and the array will be ignored.
807    
808 root 1.111 Best use C<AnyEvent::post_detect { BLOCK }> instead.
809 root 1.109
810 root 1.16 =back
811    
812 root 1.14 =head1 WHAT TO DO IN A MODULE
813    
814 root 1.53 As a module author, you should C<use AnyEvent> and call AnyEvent methods
815 root 1.14 freely, but you should not load a specific event module or rely on it.
816    
817 root 1.53 Be careful when you create watchers in the module body - AnyEvent will
818 root 1.14 decide which event module to use as soon as the first method is called, so
819     by calling AnyEvent in your module body you force the user of your module
820     to load the event module first.
821    
822 root 1.114 Never call C<< ->recv >> on a condition variable unless you I<know> that
823 root 1.106 the C<< ->send >> method has been called on it already. This is
824 root 1.53 because it will stall the whole program, and the whole point of using
825     events is to stay interactive.
826    
827 root 1.114 It is fine, however, to call C<< ->recv >> when the user of your module
828 root 1.53 requests it (i.e. if you create a http request object ad have a method
829 root 1.114 called C<results> that returns the results, it should call C<< ->recv >>
830 root 1.53 freely, as the user of your module knows what she is doing. always).
831    
832 root 1.14 =head1 WHAT TO DO IN THE MAIN PROGRAM
833    
834     There will always be a single main program - the only place that should
835     dictate which event model to use.
836    
837     If it doesn't care, it can just "use AnyEvent" and use it itself, or not
838 root 1.53 do anything special (it does not need to be event-based) and let AnyEvent
839     decide which implementation to chose if some module relies on it.
840 root 1.14
841 root 1.134 If the main program relies on a specific event model - for example, in
842     Gtk2 programs you have to rely on the Glib module - you should load the
843 root 1.53 event module before loading AnyEvent or any module that uses it: generally
844     speaking, you should load it as early as possible. The reason is that
845     modules might create watchers when they are loaded, and AnyEvent will
846     decide on the event model to use as soon as it creates watchers, and it
847     might chose the wrong one unless you load the correct one yourself.
848 root 1.14
849 root 1.134 You can chose to use a pure-perl implementation by loading the
850     C<AnyEvent::Impl::Perl> module, which gives you similar behaviour
851     everywhere, but letting AnyEvent chose the model is generally better.
852    
853     =head2 MAINLOOP EMULATION
854    
855     Sometimes (often for short test scripts, or even standalone programs who
856     only want to use AnyEvent), you do not want to run a specific event loop.
857    
858     In that case, you can use a condition variable like this:
859    
860     AnyEvent->condvar->recv;
861    
862     This has the effect of entering the event loop and looping forever.
863    
864     Note that usually your program has some exit condition, in which case
865     it is better to use the "traditional" approach of storing a condition
866     variable somewhere, waiting for it, and sending it when the program should
867     exit cleanly.
868    
869 root 1.14
870 elmex 1.100 =head1 OTHER MODULES
871    
872 root 1.101 The following is a non-exhaustive list of additional modules that use
873     AnyEvent and can therefore be mixed easily with other AnyEvent modules
874     in the same program. Some of the modules come with AnyEvent, some are
875     available via CPAN.
876    
877     =over 4
878    
879     =item L<AnyEvent::Util>
880    
881     Contains various utility functions that replace often-used but blocking
882     functions such as C<inet_aton> by event-/callback-based versions.
883    
884 root 1.125 =item L<AnyEvent::Socket>
885    
886     Provides various utility functions for (internet protocol) sockets,
887     addresses and name resolution. Also functions to create non-blocking tcp
888     connections or tcp servers, with IPv6 and SRV record support and more.
889    
890 root 1.164 =item L<AnyEvent::Handle>
891    
892     Provide read and write buffers, manages watchers for reads and writes,
893     supports raw and formatted I/O, I/O queued and fully transparent and
894     non-blocking SSL/TLS.
895    
896 root 1.134 =item L<AnyEvent::DNS>
897    
898     Provides rich asynchronous DNS resolver capabilities.
899    
900 root 1.155 =item L<AnyEvent::HTTP>
901    
902     A simple-to-use HTTP library that is capable of making a lot of concurrent
903     HTTP requests.
904    
905 root 1.101 =item L<AnyEvent::HTTPD>
906    
907     Provides a simple web application server framework.
908    
909 elmex 1.100 =item L<AnyEvent::FastPing>
910    
911 root 1.101 The fastest ping in the west.
912    
913 root 1.159 =item L<AnyEvent::DBI>
914    
915 root 1.164 Executes L<DBI> requests asynchronously in a proxy process.
916    
917     =item L<AnyEvent::AIO>
918    
919     Truly asynchronous I/O, should be in the toolbox of every event
920     programmer. AnyEvent::AIO transparently fuses L<IO::AIO> and AnyEvent
921     together.
922    
923     =item L<AnyEvent::BDB>
924    
925     Truly asynchronous Berkeley DB access. AnyEvent::BDB transparently fuses
926     L<BDB> and AnyEvent together.
927    
928     =item L<AnyEvent::GPSD>
929    
930     A non-blocking interface to gpsd, a daemon delivering GPS information.
931    
932     =item L<AnyEvent::IGS>
933    
934     A non-blocking interface to the Internet Go Server protocol (used by
935     L<App::IGS>).
936 root 1.159
937 root 1.184 =item L<AnyEvent::IRC>
938 elmex 1.100
939 root 1.184 AnyEvent based IRC client module family (replacing the older Net::IRC3).
940 root 1.101
941 elmex 1.100 =item L<Net::XMPP2>
942    
943 root 1.101 AnyEvent based XMPP (Jabber protocol) module family.
944    
945     =item L<Net::FCP>
946    
947     AnyEvent-based implementation of the Freenet Client Protocol, birthplace
948     of AnyEvent.
949    
950     =item L<Event::ExecFlow>
951    
952     High level API for event-based execution flow control.
953    
954     =item L<Coro>
955    
956 root 1.108 Has special support for AnyEvent via L<Coro::AnyEvent>.
957 root 1.101
958 root 1.113 =item L<IO::Lambda>
959 root 1.101
960 root 1.113 The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
961 root 1.101
962 elmex 1.100 =back
963    
964 root 1.1 =cut
965    
966     package AnyEvent;
967    
968 root 1.2 no warnings;
969 root 1.180 use strict qw(vars subs);
970 root 1.24
971 root 1.1 use Carp;
972    
973 root 1.225 our $VERSION = 4.8;
974 root 1.2 our $MODEL;
975 root 1.1
976 root 1.2 our $AUTOLOAD;
977     our @ISA;
978 root 1.1
979 root 1.135 our @REGISTRY;
980    
981 root 1.138 our $WIN32;
982    
983     BEGIN {
984 root 1.214 eval "sub WIN32(){ " . (($^O =~ /mswin32/i)*1) ." }";
985     eval "sub TAINT(){ " . (${^TAINT}*1) . " }";
986    
987     delete @ENV{grep /^PERL_ANYEVENT_/, keys %ENV}
988     if ${^TAINT};
989 root 1.138 }
990    
991 root 1.7 our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
992    
993 root 1.136 our %PROTOCOL; # (ipv4|ipv6) => (1|2), higher numbers are preferred
994 root 1.126
995     {
996     my $idx;
997     $PROTOCOL{$_} = ++$idx
998 root 1.136 for reverse split /\s*,\s*/,
999     $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
1000 root 1.126 }
1001    
1002 root 1.1 my @models = (
1003 root 1.33 [EV:: => AnyEvent::Impl::EV::],
1004 root 1.18 [Event:: => AnyEvent::Impl::Event::],
1005     [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
1006 root 1.135 # everything below here will not be autoprobed
1007     # as the pureperl backend should work everywhere
1008     # and is usually faster
1009     [Tk:: => AnyEvent::Impl::Tk::], # crashes with many handles
1010     [Glib:: => AnyEvent::Impl::Glib::], # becomes extremely slow with many watchers
1011 root 1.61 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
1012 root 1.56 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
1013 root 1.61 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
1014 root 1.135 [Wx:: => AnyEvent::Impl::POE::],
1015     [Prima:: => AnyEvent::Impl::POE::],
1016 root 1.219 # IO::Async is just too broken - we would need workaorunds for its
1017     # byzantine signal and broken child handling, among others.
1018     # IO::Async is rather hard to detect, as it doesn't have any
1019     # obvious default class.
1020     # [IO::Async:: => AnyEvent::Impl::IOAsync::], # requires special main program
1021     # [IO::Async::Loop:: => AnyEvent::Impl::IOAsync::], # requires special main program
1022     # [IO::Async::Notifier:: => AnyEvent::Impl::IOAsync::], # requires special main program
1023 root 1.1 );
1024    
1025 root 1.205 our %method = map +($_ => 1),
1026 root 1.207 qw(io timer time now now_update signal child idle condvar one_event DESTROY);
1027 root 1.3
1028 root 1.111 our @post_detect;
1029 root 1.109
1030 root 1.111 sub post_detect(&) {
1031 root 1.110 my ($cb) = @_;
1032    
1033 root 1.109 if ($MODEL) {
1034 root 1.110 $cb->();
1035    
1036     1
1037 root 1.109 } else {
1038 root 1.111 push @post_detect, $cb;
1039 root 1.110
1040     defined wantarray
1041 root 1.207 ? bless \$cb, "AnyEvent::Util::postdetect"
1042 root 1.110 : ()
1043 root 1.109 }
1044     }
1045 root 1.108
1046 root 1.207 sub AnyEvent::Util::postdetect::DESTROY {
1047 root 1.111 @post_detect = grep $_ != ${$_[0]}, @post_detect;
1048 root 1.110 }
1049    
1050 root 1.19 sub detect() {
1051     unless ($MODEL) {
1052     no strict 'refs';
1053 root 1.137 local $SIG{__DIE__};
1054 root 1.1
1055 root 1.55 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) {
1056     my $model = "AnyEvent::Impl::$1";
1057     if (eval "require $model") {
1058     $MODEL = $model;
1059     warn "AnyEvent: loaded model '$model' (forced by \$PERL_ANYEVENT_MODEL), using it.\n" if $verbose > 1;
1060 root 1.60 } else {
1061     warn "AnyEvent: unable to load model '$model' (from \$PERL_ANYEVENT_MODEL):\n$@" if $verbose;
1062 root 1.2 }
1063 root 1.1 }
1064    
1065 root 1.55 # check for already loaded models
1066 root 1.2 unless ($MODEL) {
1067 root 1.61 for (@REGISTRY, @models) {
1068 root 1.8 my ($package, $model) = @$_;
1069 root 1.55 if (${"$package\::VERSION"} > 0) {
1070     if (eval "require $model") {
1071     $MODEL = $model;
1072     warn "AnyEvent: autodetected model '$model', using it.\n" if $verbose > 1;
1073     last;
1074     }
1075 root 1.8 }
1076 root 1.2 }
1077    
1078 root 1.55 unless ($MODEL) {
1079     # try to load a model
1080    
1081     for (@REGISTRY, @models) {
1082     my ($package, $model) = @$_;
1083     if (eval "require $package"
1084     and ${"$package\::VERSION"} > 0
1085     and eval "require $model") {
1086     $MODEL = $model;
1087     warn "AnyEvent: autoprobed model '$model', using it.\n" if $verbose > 1;
1088     last;
1089     }
1090     }
1091    
1092     $MODEL
1093 root 1.204 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.\n";
1094 root 1.55 }
1095 root 1.1 }
1096 root 1.19
1097     push @{"$MODEL\::ISA"}, "AnyEvent::Base";
1098 root 1.108
1099 root 1.168 unshift @ISA, $MODEL;
1100    
1101     require AnyEvent::Strict if $ENV{PERL_ANYEVENT_STRICT};
1102 root 1.167
1103 root 1.111 (shift @post_detect)->() while @post_detect;
1104 root 1.1 }
1105    
1106 root 1.19 $MODEL
1107     }
1108    
1109     sub AUTOLOAD {
1110     (my $func = $AUTOLOAD) =~ s/.*://;
1111    
1112     $method{$func}
1113     or croak "$func: not a valid method for AnyEvent objects";
1114    
1115     detect unless $MODEL;
1116 root 1.2
1117     my $class = shift;
1118 root 1.18 $class->$func (@_);
1119 root 1.1 }
1120    
1121 root 1.169 # utility function to dup a filehandle. this is used by many backends
1122     # to support binding more than one watcher per filehandle (they usually
1123     # allow only one watcher per fd, so we dup it to get a different one).
1124 root 1.219 sub _dupfh($$;$$) {
1125 root 1.169 my ($poll, $fh, $r, $w) = @_;
1126    
1127     # cygwin requires the fh mode to be matching, unix doesn't
1128 root 1.229 my ($rw, $mode) = $poll eq "r" ? ($r, "<") : ($w, ">");
1129 root 1.169
1130 root 1.229 open my $fh2, "$mode&", $fh
1131     or die "AnyEvent->io: cannot dup() filehandle in mode '$poll': $!,";
1132 root 1.169
1133     # we assume CLOEXEC is already set by perl in all important cases
1134    
1135     ($fh2, $rw)
1136     }
1137    
1138 root 1.19 package AnyEvent::Base;
1139    
1140 root 1.205 # default implementations for many methods
1141 root 1.143
1142 root 1.179 BEGIN {
1143 root 1.207 if (eval "use Time::HiRes (); Time::HiRes::time (); 1") {
1144 root 1.179 *_time = \&Time::HiRes::time;
1145     # if (eval "use POSIX (); (POSIX::times())...
1146     } else {
1147 root 1.182 *_time = sub { time }; # epic fail
1148 root 1.179 }
1149     }
1150 root 1.143
1151 root 1.179 sub time { _time }
1152     sub now { _time }
1153 root 1.205 sub now_update { }
1154 root 1.143
1155 root 1.114 # default implementation for ->condvar
1156 root 1.20
1157     sub condvar {
1158 root 1.207 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, "AnyEvent::CondVar"
1159 root 1.20 }
1160    
1161     # default implementation for ->signal
1162 root 1.19
1163 root 1.195 our ($SIGPIPE_R, $SIGPIPE_W, %SIG_CB, %SIG_EV, $SIG_IO);
1164    
1165     sub _signal_exec {
1166 root 1.198 sysread $SIGPIPE_R, my $dummy, 4;
1167    
1168 root 1.195 while (%SIG_EV) {
1169     for (keys %SIG_EV) {
1170     delete $SIG_EV{$_};
1171     $_->() for values %{ $SIG_CB{$_} || {} };
1172     }
1173     }
1174     }
1175 root 1.19
1176     sub signal {
1177     my (undef, %arg) = @_;
1178    
1179 root 1.195 unless ($SIGPIPE_R) {
1180 root 1.200 require Fcntl;
1181    
1182 root 1.195 if (AnyEvent::WIN32) {
1183 root 1.200 require AnyEvent::Util;
1184    
1185 root 1.195 ($SIGPIPE_R, $SIGPIPE_W) = AnyEvent::Util::portable_pipe ();
1186     AnyEvent::Util::fh_nonblocking ($SIGPIPE_R) if $SIGPIPE_R;
1187     AnyEvent::Util::fh_nonblocking ($SIGPIPE_W) if $SIGPIPE_W; # just in case
1188     } else {
1189     pipe $SIGPIPE_R, $SIGPIPE_W;
1190     fcntl $SIGPIPE_R, &Fcntl::F_SETFL, &Fcntl::O_NONBLOCK if $SIGPIPE_R;
1191     fcntl $SIGPIPE_W, &Fcntl::F_SETFL, &Fcntl::O_NONBLOCK if $SIGPIPE_W; # just in case
1192 root 1.211
1193     # not strictly required, as $^F is normally 2, but let's make sure...
1194     fcntl $SIGPIPE_R, &Fcntl::F_SETFD, &Fcntl::FD_CLOEXEC;
1195     fcntl $SIGPIPE_W, &Fcntl::F_SETFD, &Fcntl::FD_CLOEXEC;
1196 root 1.195 }
1197    
1198     $SIGPIPE_R
1199     or Carp::croak "AnyEvent: unable to create a signal reporting pipe: $!\n";
1200    
1201     $SIG_IO = AnyEvent->io (fh => $SIGPIPE_R, poll => "r", cb => \&_signal_exec);
1202     }
1203    
1204 root 1.19 my $signal = uc $arg{signal}
1205     or Carp::croak "required option 'signal' is missing";
1206    
1207 root 1.31 $SIG_CB{$signal}{$arg{cb}} = $arg{cb};
1208 root 1.19 $SIG{$signal} ||= sub {
1209 root 1.202 local $!;
1210 root 1.195 syswrite $SIGPIPE_W, "\x00", 1 unless %SIG_EV;
1211     undef $SIG_EV{$signal};
1212 root 1.19 };
1213    
1214 root 1.207 bless [$signal, $arg{cb}], "AnyEvent::Base::signal"
1215 root 1.19 }
1216    
1217 root 1.207 sub AnyEvent::Base::signal::DESTROY {
1218 root 1.19 my ($signal, $cb) = @{$_[0]};
1219    
1220     delete $SIG_CB{$signal}{$cb};
1221    
1222 root 1.210 # delete doesn't work with older perls - they then
1223     # print weird messages, or just unconditionally exit
1224     # instead of getting the default action.
1225     undef $SIG{$signal} unless keys %{ $SIG_CB{$signal} };
1226 root 1.19 }
1227    
1228 root 1.20 # default implementation for ->child
1229    
1230     our %PID_CB;
1231     our $CHLD_W;
1232 root 1.37 our $CHLD_DELAY_W;
1233 root 1.20 our $WNOHANG;
1234    
1235 root 1.210 sub _sigchld {
1236 root 1.38 while (0 < (my $pid = waitpid -1, $WNOHANG)) {
1237 root 1.32 $_->($pid, $?) for (values %{ $PID_CB{$pid} || {} }),
1238     (values %{ $PID_CB{0} || {} });
1239 root 1.20 }
1240 root 1.37 }
1241    
1242 root 1.20 sub child {
1243     my (undef, %arg) = @_;
1244    
1245 root 1.31 defined (my $pid = $arg{pid} + 0)
1246 root 1.20 or Carp::croak "required option 'pid' is missing";
1247    
1248     $PID_CB{$pid}{$arg{cb}} = $arg{cb};
1249    
1250 root 1.210 $WNOHANG ||= eval { local $SIG{__DIE__}; require POSIX; &POSIX::WNOHANG } || 1;
1251 root 1.20
1252 root 1.23 unless ($CHLD_W) {
1253 root 1.37 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld);
1254     # child could be a zombie already, so make at least one round
1255     &_sigchld;
1256 root 1.23 }
1257 root 1.20
1258 root 1.207 bless [$pid, $arg{cb}], "AnyEvent::Base::child"
1259 root 1.20 }
1260    
1261 root 1.207 sub AnyEvent::Base::child::DESTROY {
1262 root 1.20 my ($pid, $cb) = @{$_[0]};
1263    
1264     delete $PID_CB{$pid}{$cb};
1265     delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
1266    
1267     undef $CHLD_W unless keys %PID_CB;
1268     }
1269    
1270 root 1.207 # idle emulation is done by simply using a timer, regardless
1271 root 1.210 # of whether the process is idle or not, and not letting
1272 root 1.207 # the callback use more than 50% of the time.
1273     sub idle {
1274     my (undef, %arg) = @_;
1275    
1276     my ($cb, $w, $rcb) = $arg{cb};
1277    
1278     $rcb = sub {
1279     if ($cb) {
1280     $w = _time;
1281     &$cb;
1282     $w = _time - $w;
1283    
1284     # never use more then 50% of the time for the idle watcher,
1285     # within some limits
1286     $w = 0.0001 if $w < 0.0001;
1287     $w = 5 if $w > 5;
1288    
1289     $w = AnyEvent->timer (after => $w, cb => $rcb);
1290     } else {
1291     # clean up...
1292     undef $w;
1293     undef $rcb;
1294     }
1295     };
1296    
1297     $w = AnyEvent->timer (after => 0.05, cb => $rcb);
1298    
1299     bless \\$cb, "AnyEvent::Base::idle"
1300     }
1301    
1302     sub AnyEvent::Base::idle::DESTROY {
1303     undef $${$_[0]};
1304     }
1305    
1306 root 1.116 package AnyEvent::CondVar;
1307    
1308     our @ISA = AnyEvent::CondVar::Base::;
1309    
1310     package AnyEvent::CondVar::Base;
1311 root 1.114
1312 root 1.131 use overload
1313     '&{}' => sub { my $self = shift; sub { $self->send (@_) } },
1314     fallback => 1;
1315    
1316 root 1.114 sub _send {
1317 root 1.116 # nop
1318 root 1.114 }
1319    
1320     sub send {
1321 root 1.115 my $cv = shift;
1322     $cv->{_ae_sent} = [@_];
1323 root 1.116 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
1324 root 1.115 $cv->_send;
1325 root 1.114 }
1326    
1327     sub croak {
1328 root 1.115 $_[0]{_ae_croak} = $_[1];
1329 root 1.114 $_[0]->send;
1330     }
1331    
1332     sub ready {
1333     $_[0]{_ae_sent}
1334     }
1335    
1336 root 1.116 sub _wait {
1337     AnyEvent->one_event while !$_[0]{_ae_sent};
1338     }
1339    
1340 root 1.114 sub recv {
1341 root 1.116 $_[0]->_wait;
1342 root 1.114
1343     Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
1344     wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
1345     }
1346    
1347     sub cb {
1348     $_[0]{_ae_cb} = $_[1] if @_ > 1;
1349     $_[0]{_ae_cb}
1350     }
1351    
1352     sub begin {
1353     ++$_[0]{_ae_counter};
1354     $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
1355     }
1356    
1357     sub end {
1358     return if --$_[0]{_ae_counter};
1359 root 1.124 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
1360 root 1.114 }
1361    
1362     # undocumented/compatibility with pre-3.4
1363     *broadcast = \&send;
1364 root 1.116 *wait = \&_wait;
1365 root 1.114
1366 root 1.180 =head1 ERROR AND EXCEPTION HANDLING
1367 root 1.53
1368 root 1.180 In general, AnyEvent does not do any error handling - it relies on the
1369     caller to do that if required. The L<AnyEvent::Strict> module (see also
1370     the C<PERL_ANYEVENT_STRICT> environment variable, below) provides strict
1371     checking of all AnyEvent methods, however, which is highly useful during
1372     development.
1373    
1374     As for exception handling (i.e. runtime errors and exceptions thrown while
1375     executing a callback), this is not only highly event-loop specific, but
1376     also not in any way wrapped by this module, as this is the job of the main
1377     program.
1378    
1379     The pure perl event loop simply re-throws the exception (usually
1380     within C<< condvar->recv >>), the L<Event> and L<EV> modules call C<<
1381     $Event/EV::DIED->() >>, L<Glib> uses C<< install_exception_handler >> and
1382     so on.
1383 root 1.12
1384 root 1.7 =head1 ENVIRONMENT VARIABLES
1385    
1386 root 1.180 The following environment variables are used by this module or its
1387 root 1.214 submodules.
1388    
1389     Note that AnyEvent will remove I<all> environment variables starting with
1390     C<PERL_ANYEVENT_> from C<%ENV> when it is loaded while taint mode is
1391     enabled.
1392 root 1.7
1393 root 1.55 =over 4
1394    
1395     =item C<PERL_ANYEVENT_VERBOSE>
1396    
1397 root 1.60 By default, AnyEvent will be completely silent except in fatal
1398     conditions. You can set this environment variable to make AnyEvent more
1399     talkative.
1400    
1401     When set to C<1> or higher, causes AnyEvent to warn about unexpected
1402     conditions, such as not being able to load the event model specified by
1403     C<PERL_ANYEVENT_MODEL>.
1404    
1405 root 1.55 When set to C<2> or higher, cause AnyEvent to report to STDERR which event
1406     model it chooses.
1407    
1408 root 1.167 =item C<PERL_ANYEVENT_STRICT>
1409    
1410     AnyEvent does not do much argument checking by default, as thorough
1411     argument checking is very costly. Setting this variable to a true value
1412 root 1.170 will cause AnyEvent to load C<AnyEvent::Strict> and then to thoroughly
1413 root 1.218 check the arguments passed to most method calls. If it finds any problems,
1414 root 1.170 it will croak.
1415    
1416     In other words, enables "strict" mode.
1417    
1418 root 1.218 Unlike C<use strict>, it is definitely recommended to keep it off in
1419 root 1.180 production. Keeping C<PERL_ANYEVENT_STRICT=1> in your environment while
1420     developing programs can be very useful, however.
1421 root 1.167
1422 root 1.55 =item C<PERL_ANYEVENT_MODEL>
1423    
1424     This can be used to specify the event model to be used by AnyEvent, before
1425 root 1.128 auto detection and -probing kicks in. It must be a string consisting
1426 root 1.55 entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
1427     and the resulting module name is loaded and if the load was successful,
1428     used as event model. If it fails to load AnyEvent will proceed with
1429 root 1.128 auto detection and -probing.
1430 root 1.55
1431     This functionality might change in future versions.
1432    
1433     For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
1434     could start your program like this:
1435    
1436 root 1.151 PERL_ANYEVENT_MODEL=Perl perl ...
1437 root 1.55
1438 root 1.125 =item C<PERL_ANYEVENT_PROTOCOLS>
1439    
1440     Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1441     for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1442 root 1.128 of auto probing).
1443 root 1.125
1444     Must be set to a comma-separated list of protocols or address families,
1445     current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1446     used, and preference will be given to protocols mentioned earlier in the
1447     list.
1448    
1449 root 1.127 This variable can effectively be used for denial-of-service attacks
1450     against local programs (e.g. when setuid), although the impact is likely
1451 root 1.194 small, as the program has to handle conenction and other failures anyways.
1452 root 1.127
1453 root 1.125 Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1454     but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1455     - only support IPv4, never try to resolve or contact IPv6
1456 root 1.128 addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1457 root 1.125 IPv6, but prefer IPv6 over IPv4.
1458    
1459 root 1.127 =item C<PERL_ANYEVENT_EDNS0>
1460    
1461 root 1.128 Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1462 root 1.127 for DNS. This extension is generally useful to reduce DNS traffic, but
1463     some (broken) firewalls drop such DNS packets, which is why it is off by
1464     default.
1465    
1466     Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1467     EDNS0 in its DNS requests.
1468    
1469 root 1.142 =item C<PERL_ANYEVENT_MAX_FORKS>
1470    
1471     The maximum number of child processes that C<AnyEvent::Util::fork_call>
1472     will create in parallel.
1473    
1474 root 1.226 =item C<PERL_ANYEVENT_MAX_OUTSTANDING_DNS>
1475    
1476     The default value for the C<max_outstanding> parameter for the default DNS
1477     resolver - this is the maximum number of parallel DNS requests that are
1478     sent to the DNS server.
1479    
1480     =item C<PERL_ANYEVENT_RESOLV_CONF>
1481    
1482     The file to use instead of F</etc/resolv.conf> (or OS-specific
1483     configuration) in the default resolver. When set to the empty string, no
1484     default config will be used.
1485    
1486 root 1.227 =item C<PERL_ANYEVENT_CA_FILE>, C<PERL_ANYEVENT_CA_PATH>.
1487    
1488     When neither C<ca_file> nor C<ca_path> was specified during
1489     L<AnyEvent::TLS> context creation, and either of these environment
1490     variables exist, they will be used to specify CA certificate locations
1491     instead of a system-dependent default.
1492    
1493 root 1.55 =back
1494 root 1.7
1495 root 1.180 =head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
1496    
1497     This is an advanced topic that you do not normally need to use AnyEvent in
1498     a module. This section is only of use to event loop authors who want to
1499     provide AnyEvent compatibility.
1500    
1501     If you need to support another event library which isn't directly
1502     supported by AnyEvent, you can supply your own interface to it by
1503     pushing, before the first watcher gets created, the package name of
1504     the event module and the package name of the interface to use onto
1505     C<@AnyEvent::REGISTRY>. You can do that before and even without loading
1506     AnyEvent, so it is reasonably cheap.
1507    
1508     Example:
1509    
1510     push @AnyEvent::REGISTRY, [urxvt => urxvt::anyevent::];
1511    
1512     This tells AnyEvent to (literally) use the C<urxvt::anyevent::>
1513     package/class when it finds the C<urxvt> package/module is already loaded.
1514    
1515     When AnyEvent is loaded and asked to find a suitable event model, it
1516     will first check for the presence of urxvt by trying to C<use> the
1517     C<urxvt::anyevent> module.
1518    
1519     The class should provide implementations for all watcher types. See
1520     L<AnyEvent::Impl::EV> (source code), L<AnyEvent::Impl::Glib> (Source code)
1521     and so on for actual examples. Use C<perldoc -m AnyEvent::Impl::Glib> to
1522     see the sources.
1523    
1524     If you don't provide C<signal> and C<child> watchers than AnyEvent will
1525     provide suitable (hopefully) replacements.
1526    
1527     The above example isn't fictitious, the I<rxvt-unicode> (a.k.a. urxvt)
1528     terminal emulator uses the above line as-is. An interface isn't included
1529     in AnyEvent because it doesn't make sense outside the embedded interpreter
1530     inside I<rxvt-unicode>, and it is updated and maintained as part of the
1531     I<rxvt-unicode> distribution.
1532    
1533     I<rxvt-unicode> also cheats a bit by not providing blocking access to
1534     condition variables: code blocking while waiting for a condition will
1535     C<die>. This still works with most modules/usages, and blocking calls must
1536     not be done in an interactive application, so it makes sense.
1537    
1538 root 1.53 =head1 EXAMPLE PROGRAM
1539 root 1.2
1540 root 1.78 The following program uses an I/O watcher to read data from STDIN, a timer
1541 root 1.53 to display a message once per second, and a condition variable to quit the
1542     program when the user enters quit:
1543 root 1.2
1544     use AnyEvent;
1545    
1546     my $cv = AnyEvent->condvar;
1547    
1548 root 1.53 my $io_watcher = AnyEvent->io (
1549     fh => \*STDIN,
1550     poll => 'r',
1551     cb => sub {
1552     warn "io event <$_[0]>\n"; # will always output <r>
1553     chomp (my $input = <STDIN>); # read a line
1554     warn "read: $input\n"; # output what has been read
1555 root 1.118 $cv->send if $input =~ /^q/i; # quit program if /^q/i
1556 root 1.53 },
1557     );
1558 root 1.2
1559     my $time_watcher; # can only be used once
1560    
1561     sub new_timer {
1562     $timer = AnyEvent->timer (after => 1, cb => sub {
1563     warn "timeout\n"; # print 'timeout' about every second
1564     &new_timer; # and restart the time
1565     });
1566     }
1567    
1568     new_timer; # create first timer
1569    
1570 root 1.118 $cv->recv; # wait until user enters /^q/i
1571 root 1.2
1572 root 1.5 =head1 REAL-WORLD EXAMPLE
1573    
1574     Consider the L<Net::FCP> module. It features (among others) the following
1575     API calls, which are to freenet what HTTP GET requests are to http:
1576    
1577     my $data = $fcp->client_get ($url); # blocks
1578    
1579     my $transaction = $fcp->txn_client_get ($url); # does not block
1580     $transaction->cb ( sub { ... } ); # set optional result callback
1581     my $data = $transaction->result; # possibly blocks
1582    
1583     The C<client_get> method works like C<LWP::Simple::get>: it requests the
1584     given URL and waits till the data has arrived. It is defined to be:
1585    
1586     sub client_get { $_[0]->txn_client_get ($_[1])->result }
1587    
1588     And in fact is automatically generated. This is the blocking API of
1589     L<Net::FCP>, and it works as simple as in any other, similar, module.
1590    
1591     More complicated is C<txn_client_get>: It only creates a transaction
1592     (completion, result, ...) object and initiates the transaction.
1593    
1594     my $txn = bless { }, Net::FCP::Txn::;
1595    
1596     It also creates a condition variable that is used to signal the completion
1597     of the request:
1598    
1599     $txn->{finished} = AnyAvent->condvar;
1600    
1601     It then creates a socket in non-blocking mode.
1602    
1603     socket $txn->{fh}, ...;
1604     fcntl $txn->{fh}, F_SETFL, O_NONBLOCK;
1605     connect $txn->{fh}, ...
1606     and !$!{EWOULDBLOCK}
1607     and !$!{EINPROGRESS}
1608     and Carp::croak "unable to connect: $!\n";
1609    
1610 root 1.6 Then it creates a write-watcher which gets called whenever an error occurs
1611 root 1.5 or the connection succeeds:
1612    
1613     $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'w', cb => sub { $txn->fh_ready_w });
1614    
1615     And returns this transaction object. The C<fh_ready_w> callback gets
1616     called as soon as the event loop detects that the socket is ready for
1617     writing.
1618    
1619     The C<fh_ready_w> method makes the socket blocking again, writes the
1620     request data and replaces the watcher by a read watcher (waiting for reply
1621     data). The actual code is more complicated, but that doesn't matter for
1622     this example:
1623    
1624     fcntl $txn->{fh}, F_SETFL, 0;
1625     syswrite $txn->{fh}, $txn->{request}
1626     or die "connection or write error";
1627     $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
1628    
1629     Again, C<fh_ready_r> waits till all data has arrived, and then stores the
1630 root 1.128 result and signals any possible waiters that the request has finished:
1631 root 1.5
1632     sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
1633    
1634     if (end-of-file or data complete) {
1635     $txn->{result} = $txn->{buf};
1636 root 1.118 $txn->{finished}->send;
1637 root 1.6 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
1638 root 1.5 }
1639    
1640     The C<result> method, finally, just waits for the finished signal (if the
1641     request was already finished, it doesn't wait, of course, and returns the
1642     data:
1643    
1644 root 1.118 $txn->{finished}->recv;
1645 root 1.6 return $txn->{result};
1646 root 1.5
1647     The actual code goes further and collects all errors (C<die>s, exceptions)
1648 root 1.128 that occurred during request processing. The C<result> method detects
1649 root 1.52 whether an exception as thrown (it is stored inside the $txn object)
1650 root 1.5 and just throws the exception, which means connection errors and other
1651     problems get reported tot he code that tries to use the result, not in a
1652     random callback.
1653    
1654     All of this enables the following usage styles:
1655    
1656     1. Blocking:
1657    
1658     my $data = $fcp->client_get ($url);
1659    
1660 root 1.49 2. Blocking, but running in parallel:
1661 root 1.5
1662     my @datas = map $_->result,
1663     map $fcp->txn_client_get ($_),
1664     @urls;
1665    
1666     Both blocking examples work without the module user having to know
1667     anything about events.
1668    
1669 root 1.49 3a. Event-based in a main program, using any supported event module:
1670 root 1.5
1671 root 1.49 use EV;
1672 root 1.5
1673     $fcp->txn_client_get ($url)->cb (sub {
1674     my $txn = shift;
1675     my $data = $txn->result;
1676     ...
1677     });
1678    
1679 root 1.49 EV::loop;
1680 root 1.5
1681     3b. The module user could use AnyEvent, too:
1682    
1683     use AnyEvent;
1684    
1685     my $quit = AnyEvent->condvar;
1686    
1687     $fcp->txn_client_get ($url)->cb (sub {
1688     ...
1689 root 1.118 $quit->send;
1690 root 1.5 });
1691    
1692 root 1.118 $quit->recv;
1693 root 1.5
1694 root 1.64
1695 root 1.91 =head1 BENCHMARKS
1696 root 1.64
1697 root 1.65 To give you an idea of the performance and overheads that AnyEvent adds
1698 root 1.91 over the event loops themselves and to give you an impression of the speed
1699     of various event loops I prepared some benchmarks.
1700 root 1.77
1701 root 1.91 =head2 BENCHMARKING ANYEVENT OVERHEAD
1702    
1703     Here is a benchmark of various supported event models used natively and
1704 root 1.128 through AnyEvent. The benchmark creates a lot of timers (with a zero
1705 root 1.91 timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
1706     which it is), lets them fire exactly once and destroys them again.
1707    
1708     Source code for this benchmark is found as F<eg/bench> in the AnyEvent
1709     distribution.
1710    
1711     =head3 Explanation of the columns
1712 root 1.68
1713     I<watcher> is the number of event watchers created/destroyed. Since
1714     different event models feature vastly different performances, each event
1715     loop was given a number of watchers so that overall runtime is acceptable
1716     and similar between tested event loop (and keep them from crashing): Glib
1717     would probably take thousands of years if asked to process the same number
1718     of watchers as EV in this benchmark.
1719    
1720     I<bytes> is the number of bytes (as measured by the resident set size,
1721     RSS) consumed by each watcher. This method of measuring captures both C
1722     and Perl-based overheads.
1723    
1724     I<create> is the time, in microseconds (millionths of seconds), that it
1725     takes to create a single watcher. The callback is a closure shared between
1726     all watchers, to avoid adding memory overhead. That means closure creation
1727     and memory usage is not included in the figures.
1728    
1729     I<invoke> is the time, in microseconds, used to invoke a simple
1730     callback. The callback simply counts down a Perl variable and after it was
1731 root 1.118 invoked "watcher" times, it would C<< ->send >> a condvar once to
1732 root 1.69 signal the end of this phase.
1733 root 1.64
1734 root 1.71 I<destroy> is the time, in microseconds, that it takes to destroy a single
1735 root 1.68 watcher.
1736 root 1.64
1737 root 1.91 =head3 Results
1738 root 1.64
1739 root 1.75 name watchers bytes create invoke destroy comment
1740 root 1.187 EV/EV 400000 224 0.47 0.35 0.27 EV native interface
1741     EV/Any 100000 224 2.88 0.34 0.27 EV + AnyEvent watchers
1742     CoroEV/Any 100000 224 2.85 0.35 0.28 coroutines + Coro::Signal
1743 root 1.190 Perl/Any 100000 452 4.13 0.73 0.95 pure perl implementation
1744 root 1.186 Event/Event 16000 517 32.20 31.80 0.81 Event native interface
1745     Event/Any 16000 590 35.85 31.55 1.06 Event + AnyEvent watchers
1746 root 1.220 IOAsync/Any 16000 989 38.10 32.77 11.13 via IO::Async::Loop::IO_Poll
1747     IOAsync/Any 16000 990 37.59 29.50 10.61 via IO::Async::Loop::Epoll
1748 root 1.186 Glib/Any 16000 1357 102.33 12.31 51.00 quadratic behaviour
1749     Tk/Any 2000 1860 27.20 66.31 14.00 SEGV with >> 2000 watchers
1750     POE/Event 2000 6328 109.99 751.67 14.02 via POE::Loop::Event
1751     POE/Select 2000 6027 94.54 809.13 579.80 via POE::Loop::Select
1752 root 1.64
1753 root 1.91 =head3 Discussion
1754 root 1.68
1755     The benchmark does I<not> measure scalability of the event loop very
1756     well. For example, a select-based event loop (such as the pure perl one)
1757     can never compete with an event loop that uses epoll when the number of
1758 root 1.80 file descriptors grows high. In this benchmark, all events become ready at
1759     the same time, so select/poll-based implementations get an unnatural speed
1760     boost.
1761 root 1.68
1762 root 1.95 Also, note that the number of watchers usually has a nonlinear effect on
1763     overall speed, that is, creating twice as many watchers doesn't take twice
1764     the time - usually it takes longer. This puts event loops tested with a
1765     higher number of watchers at a disadvantage.
1766    
1767 root 1.96 To put the range of results into perspective, consider that on the
1768     benchmark machine, handling an event takes roughly 1600 CPU cycles with
1769     EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1770     cycles with POE.
1771    
1772 root 1.68 C<EV> is the sole leader regarding speed and memory use, which are both
1773 root 1.84 maximal/minimal, respectively. Even when going through AnyEvent, it uses
1774     far less memory than any other event loop and is still faster than Event
1775     natively.
1776 root 1.64
1777     The pure perl implementation is hit in a few sweet spots (both the
1778 root 1.86 constant timeout and the use of a single fd hit optimisations in the perl
1779     interpreter and the backend itself). Nevertheless this shows that it
1780     adds very little overhead in itself. Like any select-based backend its
1781     performance becomes really bad with lots of file descriptors (and few of
1782     them active), of course, but this was not subject of this benchmark.
1783 root 1.64
1784 root 1.90 The C<Event> module has a relatively high setup and callback invocation
1785     cost, but overall scores in on the third place.
1786 root 1.64
1787 root 1.220 C<IO::Async> performs admirably well, about on par with C<Event>, even
1788     when using its pure perl backend.
1789    
1790 root 1.90 C<Glib>'s memory usage is quite a bit higher, but it features a
1791 root 1.73 faster callback invocation and overall ends up in the same class as
1792     C<Event>. However, Glib scales extremely badly, doubling the number of
1793     watchers increases the processing time by more than a factor of four,
1794     making it completely unusable when using larger numbers of watchers
1795     (note that only a single file descriptor was used in the benchmark, so
1796     inefficiencies of C<poll> do not account for this).
1797 root 1.64
1798 root 1.73 The C<Tk> adaptor works relatively well. The fact that it crashes with
1799 root 1.64 more than 2000 watchers is a big setback, however, as correctness takes
1800 root 1.68 precedence over speed. Nevertheless, its performance is surprising, as the
1801     file descriptor is dup()ed for each watcher. This shows that the dup()
1802     employed by some adaptors is not a big performance issue (it does incur a
1803 root 1.87 hidden memory cost inside the kernel which is not reflected in the figures
1804     above).
1805 root 1.68
1806 root 1.103 C<POE>, regardless of underlying event loop (whether using its pure perl
1807     select-based backend or the Event module, the POE-EV backend couldn't
1808     be tested because it wasn't working) shows abysmal performance and
1809     memory usage with AnyEvent: Watchers use almost 30 times as much memory
1810     as EV watchers, and 10 times as much memory as Event (the high memory
1811 root 1.87 requirements are caused by requiring a session for each watcher). Watcher
1812     invocation speed is almost 900 times slower than with AnyEvent's pure perl
1813 root 1.103 implementation.
1814    
1815     The design of the POE adaptor class in AnyEvent can not really account
1816     for the performance issues, though, as session creation overhead is
1817     small compared to execution of the state machine, which is coded pretty
1818     optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
1819     using multiple sessions is not a good approach, especially regarding
1820     memory usage, even the author of POE could not come up with a faster
1821     design).
1822 root 1.72
1823 root 1.91 =head3 Summary
1824 root 1.72
1825 root 1.87 =over 4
1826    
1827 root 1.89 =item * Using EV through AnyEvent is faster than any other event loop
1828     (even when used without AnyEvent), but most event loops have acceptable
1829     performance with or without AnyEvent.
1830 root 1.72
1831 root 1.87 =item * The overhead AnyEvent adds is usually much smaller than the overhead of
1832 root 1.89 the actual event loop, only with extremely fast event loops such as EV
1833 root 1.73 adds AnyEvent significant overhead.
1834 root 1.72
1835 root 1.90 =item * You should avoid POE like the plague if you want performance or
1836 root 1.72 reasonable memory usage.
1837 root 1.64
1838 root 1.87 =back
1839    
1840 root 1.91 =head2 BENCHMARKING THE LARGE SERVER CASE
1841    
1842 root 1.128 This benchmark actually benchmarks the event loop itself. It works by
1843     creating a number of "servers": each server consists of a socket pair, a
1844 root 1.91 timeout watcher that gets reset on activity (but never fires), and an I/O
1845     watcher waiting for input on one side of the socket. Each time the socket
1846     watcher reads a byte it will write that byte to a random other "server".
1847    
1848     The effect is that there will be a lot of I/O watchers, only part of which
1849     are active at any one point (so there is a constant number of active
1850 root 1.128 fds for each loop iteration, but which fds these are is random). The
1851 root 1.91 timeout is reset each time something is read because that reflects how
1852     most timeouts work (and puts extra pressure on the event loops).
1853    
1854 root 1.128 In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1855 root 1.91 (1%) are active. This mirrors the activity of large servers with many
1856 root 1.92 connections, most of which are idle at any one point in time.
1857 root 1.91
1858     Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1859     distribution.
1860    
1861     =head3 Explanation of the columns
1862    
1863     I<sockets> is the number of sockets, and twice the number of "servers" (as
1864 root 1.94 each server has a read and write socket end).
1865 root 1.91
1866 root 1.128 I<create> is the time it takes to create a socket pair (which is
1867 root 1.91 nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1868    
1869     I<request>, the most important value, is the time it takes to handle a
1870     single "request", that is, reading the token from the pipe and forwarding
1871 root 1.93 it to another server. This includes deleting the old timeout and creating
1872     a new one that moves the timeout into the future.
1873 root 1.91
1874     =head3 Results
1875    
1876 root 1.220 name sockets create request
1877     EV 20000 69.01 11.16
1878     Perl 20000 73.32 35.87
1879     IOAsync 20000 157.00 98.14 epoll
1880     IOAsync 20000 159.31 616.06 poll
1881     Event 20000 212.62 257.32
1882     Glib 20000 651.16 1896.30
1883     POE 20000 349.67 12317.24 uses POE::Loop::Event
1884 root 1.91
1885     =head3 Discussion
1886    
1887     This benchmark I<does> measure scalability and overall performance of the
1888     particular event loop.
1889    
1890     EV is again fastest. Since it is using epoll on my system, the setup time
1891     is relatively high, though.
1892    
1893     Perl surprisingly comes second. It is much faster than the C-based event
1894     loops Event and Glib.
1895    
1896 root 1.220 IO::Async performs very well when using its epoll backend, and still quite
1897     good compared to Glib when using its pure perl backend.
1898    
1899 root 1.91 Event suffers from high setup time as well (look at its code and you will
1900     understand why). Callback invocation also has a high overhead compared to
1901     the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
1902     uses select or poll in basically all documented configurations.
1903    
1904     Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
1905     clearly fails to perform with many filehandles or in busy servers.
1906    
1907     POE is still completely out of the picture, taking over 1000 times as long
1908     as EV, and over 100 times as long as the Perl implementation, even though
1909     it uses a C-based event loop in this case.
1910    
1911     =head3 Summary
1912    
1913     =over 4
1914    
1915 root 1.103 =item * The pure perl implementation performs extremely well.
1916 root 1.91
1917     =item * Avoid Glib or POE in large projects where performance matters.
1918    
1919     =back
1920    
1921     =head2 BENCHMARKING SMALL SERVERS
1922    
1923     While event loops should scale (and select-based ones do not...) even to
1924     large servers, most programs we (or I :) actually write have only a few
1925     I/O watchers.
1926    
1927     In this benchmark, I use the same benchmark program as in the large server
1928     case, but it uses only eight "servers", of which three are active at any
1929     one time. This should reflect performance for a small server relatively
1930     well.
1931    
1932     The columns are identical to the previous table.
1933    
1934     =head3 Results
1935    
1936     name sockets create request
1937     EV 16 20.00 6.54
1938 root 1.99 Perl 16 25.75 12.62
1939 root 1.91 Event 16 81.27 35.86
1940     Glib 16 32.63 15.48
1941     POE 16 261.87 276.28 uses POE::Loop::Event
1942    
1943     =head3 Discussion
1944    
1945     The benchmark tries to test the performance of a typical small
1946     server. While knowing how various event loops perform is interesting, keep
1947     in mind that their overhead in this case is usually not as important, due
1948 root 1.97 to the small absolute number of watchers (that is, you need efficiency and
1949     speed most when you have lots of watchers, not when you only have a few of
1950     them).
1951 root 1.91
1952     EV is again fastest.
1953    
1954 elmex 1.129 Perl again comes second. It is noticeably faster than the C-based event
1955 root 1.102 loops Event and Glib, although the difference is too small to really
1956     matter.
1957 root 1.91
1958 root 1.97 POE also performs much better in this case, but is is still far behind the
1959 root 1.91 others.
1960    
1961     =head3 Summary
1962    
1963     =over 4
1964    
1965     =item * C-based event loops perform very well with small number of
1966     watchers, as the management overhead dominates.
1967    
1968     =back
1969    
1970 root 1.215 =head2 THE IO::Lambda BENCHMARK
1971    
1972     Recently I was told about the benchmark in the IO::Lambda manpage, which
1973     could be misinterpreted to make AnyEvent look bad. In fact, the benchmark
1974     simply compares IO::Lambda with POE, and IO::Lambda looks better (which
1975     shouldn't come as a surprise to anybody). As such, the benchmark is
1976 root 1.218 fine, and mostly shows that the AnyEvent backend from IO::Lambda isn't
1977     very optimal. But how would AnyEvent compare when used without the extra
1978 root 1.215 baggage? To explore this, I wrote the equivalent benchmark for AnyEvent.
1979    
1980     The benchmark itself creates an echo-server, and then, for 500 times,
1981     connects to the echo server, sends a line, waits for the reply, and then
1982     creates the next connection. This is a rather bad benchmark, as it doesn't
1983 root 1.218 test the efficiency of the framework or much non-blocking I/O, but it is a
1984     benchmark nevertheless.
1985 root 1.215
1986     name runtime
1987     Lambda/select 0.330 sec
1988     + optimized 0.122 sec
1989     Lambda/AnyEvent 0.327 sec
1990     + optimized 0.138 sec
1991     Raw sockets/select 0.077 sec
1992     POE/select, components 0.662 sec
1993     POE/select, raw sockets 0.226 sec
1994     POE/select, optimized 0.404 sec
1995    
1996     AnyEvent/select/nb 0.085 sec
1997     AnyEvent/EV/nb 0.068 sec
1998     +state machine 0.134 sec
1999    
2000 root 1.218 The benchmark is also a bit unfair (my fault): the IO::Lambda/POE
2001 root 1.215 benchmarks actually make blocking connects and use 100% blocking I/O,
2002     defeating the purpose of an event-based solution. All of the newly
2003     written AnyEvent benchmarks use 100% non-blocking connects (using
2004     AnyEvent::Socket::tcp_connect and the asynchronous pure perl DNS
2005 root 1.218 resolver), so AnyEvent is at a disadvantage here, as non-blocking connects
2006 root 1.215 generally require a lot more bookkeeping and event handling than blocking
2007     connects (which involve a single syscall only).
2008    
2009     The last AnyEvent benchmark additionally uses L<AnyEvent::Handle>, which
2010 root 1.218 offers similar expressive power as POE and IO::Lambda, using conventional
2011     Perl syntax. This means that both the echo server and the client are 100%
2012     non-blocking, further placing it at a disadvantage.
2013    
2014     As you can see, the AnyEvent + EV combination even beats the
2015     hand-optimised "raw sockets benchmark", while AnyEvent + its pure perl
2016     backend easily beats IO::Lambda and POE.
2017 root 1.215
2018     And even the 100% non-blocking version written using the high-level (and
2019 root 1.218 slow :) L<AnyEvent::Handle> abstraction beats both POE and IO::Lambda by a
2020     large margin, even though it does all of DNS, tcp-connect and socket I/O
2021     in a non-blocking way.
2022    
2023     The two AnyEvent benchmarks programs can be found as F<eg/ae0.pl> and
2024     F<eg/ae2.pl> in the AnyEvent distribution, the remaining benchmarks are
2025     part of the IO::lambda distribution and were used without any changes.
2026 root 1.216
2027 root 1.64
2028 root 1.185 =head1 SIGNALS
2029    
2030     AnyEvent currently installs handlers for these signals:
2031    
2032     =over 4
2033    
2034     =item SIGCHLD
2035    
2036     A handler for C<SIGCHLD> is installed by AnyEvent's child watcher
2037     emulation for event loops that do not support them natively. Also, some
2038     event loops install a similar handler.
2039    
2040 root 1.219 If, when AnyEvent is loaded, SIGCHLD is set to IGNORE, then AnyEvent will
2041     reset it to default, to avoid losing child exit statuses.
2042    
2043 root 1.185 =item SIGPIPE
2044    
2045     A no-op handler is installed for C<SIGPIPE> when C<$SIG{PIPE}> is C<undef>
2046     when AnyEvent gets loaded.
2047    
2048     The rationale for this is that AnyEvent users usually do not really depend
2049     on SIGPIPE delivery (which is purely an optimisation for shell use, or
2050     badly-written programs), but C<SIGPIPE> can cause spurious and rare
2051     program exits as a lot of people do not expect C<SIGPIPE> when writing to
2052     some random socket.
2053    
2054     The rationale for installing a no-op handler as opposed to ignoring it is
2055     that this way, the handler will be restored to defaults on exec.
2056    
2057     Feel free to install your own handler, or reset it to defaults.
2058    
2059     =back
2060    
2061     =cut
2062    
2063 root 1.219 undef $SIG{CHLD}
2064     if $SIG{CHLD} eq 'IGNORE';
2065    
2066 root 1.185 $SIG{PIPE} = sub { }
2067     unless defined $SIG{PIPE};
2068    
2069 root 1.55 =head1 FORK
2070    
2071     Most event libraries are not fork-safe. The ones who are usually are
2072 root 1.104 because they rely on inefficient but fork-safe C<select> or C<poll>
2073     calls. Only L<EV> is fully fork-aware.
2074 root 1.55
2075     If you have to fork, you must either do so I<before> creating your first
2076     watcher OR you must not use AnyEvent at all in the child.
2077    
2078 root 1.64
2079 root 1.55 =head1 SECURITY CONSIDERATIONS
2080    
2081     AnyEvent can be forced to load any event model via
2082     $ENV{PERL_ANYEVENT_MODEL}. While this cannot (to my knowledge) be used to
2083     execute arbitrary code or directly gain access, it can easily be used to
2084     make the program hang or malfunction in subtle ways, as AnyEvent watchers
2085     will not be active when the program uses a different event model than
2086     specified in the variable.
2087    
2088     You can make AnyEvent completely ignore this variable by deleting it
2089     before the first watcher gets created, e.g. with a C<BEGIN> block:
2090    
2091 root 1.151 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
2092    
2093     use AnyEvent;
2094 root 1.55
2095 root 1.107 Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
2096     be used to probe what backend is used and gain other information (which is
2097 root 1.167 probably even less useful to an attacker than PERL_ANYEVENT_MODEL), and
2098 root 1.213 $ENV{PERL_ANYEVENT_STRICT}.
2099 root 1.107
2100 root 1.218 Note that AnyEvent will remove I<all> environment variables starting with
2101     C<PERL_ANYEVENT_> from C<%ENV> when it is loaded while taint mode is
2102     enabled.
2103    
2104 root 1.64
2105 root 1.156 =head1 BUGS
2106    
2107     Perl 5.8 has numerous memleaks that sometimes hit this module and are hard
2108     to work around. If you suffer from memleaks, first upgrade to Perl 5.10
2109     and check wether the leaks still show up. (Perl 5.10.0 has other annoying
2110 root 1.197 memleaks, such as leaking on C<map> and C<grep> but it is usually not as
2111 root 1.156 pronounced).
2112    
2113    
2114 root 1.2 =head1 SEE ALSO
2115    
2116 root 1.125 Utility functions: L<AnyEvent::Util>.
2117    
2118 root 1.108 Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
2119     L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
2120    
2121     Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
2122     L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
2123     L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
2124     L<AnyEvent::Impl::POE>.
2125    
2126 root 1.125 Non-blocking file handles, sockets, TCP clients and
2127     servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
2128    
2129 root 1.122 Asynchronous DNS: L<AnyEvent::DNS>.
2130    
2131 root 1.108 Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
2132 root 1.5
2133 root 1.125 Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
2134 root 1.2
2135 root 1.64
2136 root 1.54 =head1 AUTHOR
2137    
2138 root 1.151 Marc Lehmann <schmorp@schmorp.de>
2139     http://home.schmorp.de/
2140 root 1.2
2141     =cut
2142    
2143     1
2144 root 1.1