ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
Revision: 1.271
Committed: Wed Aug 5 20:50:27 2009 UTC (14 years, 11 months ago) by root
Branch: MAIN
Changes since 1.270: +1 -1 lines
Log Message:
*** empty log message ***

File Contents

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