ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
Revision: 1.145
Committed: Thu May 29 03:45:37 2008 UTC (16 years, 1 month ago) by root
Branch: MAIN
CVS Tags: rel-4_1
Changes since 1.144: +1 -1 lines
Log Message:
work around perl 5.8 bug, add some notes into makefile.pl

File Contents

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