ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
Revision: 1.171
Committed: Wed Jul 16 21:17:59 2008 UTC (15 years, 11 months ago) by root
Branch: MAIN
CVS Tags: rel-4_21
Changes since 1.170: +1 -1 lines
Log Message:
*** empty log message ***

File Contents

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