ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
Revision: 1.173
Committed: Mon Jul 21 03:47:22 2008 UTC (16 years ago) by root
Branch: MAIN
Changes since 1.172: +35 -6 lines
Log Message:
*** empty log message ***

File Contents

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