ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
Revision: 1.243
Committed: Fri Jul 17 23:12:20 2009 UTC (15 years ago) by root
Branch: MAIN
Changes since 1.242: +26 -10 lines
Log Message:
*** empty log message ***

File Contents

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