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