ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/AnyEvent/lib/AnyEvent.pm
(Generate patch)

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.82 by root, Fri Apr 25 13:32:39 2008 UTC vs.
Revision 1.125 by root, Fri May 23 23:37:13 2008 UTC

1=head1 NAME 1=head1 => NAME
2 2
3AnyEvent - provide framework for multiple event loops 3AnyEvent - provide framework for multiple event loops
4 4
5EV, Event, Coro::EV, Coro::Event, Glib, Tk, Perl, Event::Lib, Qt, POE - various supported event loops 5EV, Event, Glib, Tk, Perl, Event::Lib, Qt, POE - various supported event loops
6 6
7=head1 SYNOPSIS 7=head1 SYNOPSIS
8 8
9 use AnyEvent; 9 use AnyEvent;
10 10
15 my $w = AnyEvent->timer (after => $seconds, cb => sub { 15 my $w = AnyEvent->timer (after => $seconds, cb => sub {
16 ... 16 ...
17 }); 17 });
18 18
19 my $w = AnyEvent->condvar; # stores whether a condition was flagged 19 my $w = AnyEvent->condvar; # stores whether a condition was flagged
20 $w->send; # wake up current and all future recv's
20 $w->wait; # enters "main loop" till $condvar gets ->broadcast 21 $w->recv; # enters "main loop" till $condvar gets ->send
21 $w->broadcast; # wake up current and all future wait's
22 22
23=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT) 23=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT)
24 24
25Glib, POE, IO::Async, Event... CPAN offers event models by the dozen 25Glib, POE, IO::Async, Event... CPAN offers event models by the dozen
26nowadays. So what is different about AnyEvent? 26nowadays. So what is different about AnyEvent?
66 66
67Of course, if you want lots of policy (this can arguably be somewhat 67Of course, if you want lots of policy (this can arguably be somewhat
68useful) and you want to force your users to use the one and only event 68useful) and you want to force your users to use the one and only event
69model, you should I<not> use this module. 69model, you should I<not> use this module.
70 70
71
72=head1 DESCRIPTION 71=head1 DESCRIPTION
73 72
74L<AnyEvent> provides an identical interface to multiple event loops. This 73L<AnyEvent> provides an identical interface to multiple event loops. This
75allows module authors to utilise an event loop without forcing module 74allows module authors to utilise an event loop without forcing module
76users to use the same event loop (as only a single event loop can coexist 75users to use the same event loop (as only a single event loop can coexist
79The interface itself is vaguely similar, but not identical to the L<Event> 78The interface itself is vaguely similar, but not identical to the L<Event>
80module. 79module.
81 80
82During the first call of any watcher-creation method, the module tries 81During the first call of any watcher-creation method, the module tries
83to detect the currently loaded event loop by probing whether one of the 82to detect the currently loaded event loop by probing whether one of the
84following modules is already loaded: L<Coro::EV>, L<Coro::Event>, L<EV>, 83following modules is already loaded: L<EV>,
85L<Event>, L<Glib>, L<AnyEvent::Impl::Perl>, L<Tk>, L<Event::Lib>, L<Qt>, 84L<Event>, L<Glib>, L<AnyEvent::Impl::Perl>, L<Tk>, L<Event::Lib>, L<Qt>,
86L<POE>. The first one found is used. If none are found, the module tries 85L<POE>. The first one found is used. If none are found, the module tries
87to load these modules (excluding Tk, Event::Lib, Qt and POE as the pure perl 86to load these modules (excluding Tk, Event::Lib, Qt and POE as the pure perl
88adaptor should always succeed) in the order given. The first one that can 87adaptor should always succeed) in the order given. The first one that can
89be successfully loaded will be used. If, after this, still none could be 88be successfully loaded will be used. If, after this, still none could be
141=head2 I/O WATCHERS 140=head2 I/O WATCHERS
142 141
143You can create an I/O watcher by calling the C<< AnyEvent->io >> method 142You can create an I/O watcher by calling the C<< AnyEvent->io >> method
144with the following mandatory key-value pairs as arguments: 143with the following mandatory key-value pairs as arguments:
145 144
146C<fh> the Perl I<file handle> (I<not> file descriptor) to watch for 145C<fh> the Perl I<file handle> (I<not> file descriptor) to watch
147events. C<poll> must be a string that is either C<r> or C<w>, which 146for events. C<poll> must be a string that is either C<r> or C<w>,
148creates a watcher waiting for "r"eadable or "w"ritable events, 147which creates a watcher waiting for "r"eadable or "w"ritable events,
149respectively. C<cb> is the callback to invoke each time the file handle 148respectively. C<cb> is the callback to invoke each time the file handle
150becomes ready. 149becomes ready.
151 150
151Although the callback might get passed parameters, their value and
152presence is undefined and you cannot rely on them. Portable AnyEvent
153callbacks cannot use arguments passed to I/O watcher callbacks.
154
152The I/O watcher might use the underlying file descriptor or a copy of it. 155The I/O watcher might use the underlying file descriptor or a copy of it.
153It is not allowed to close a file handle as long as any watcher is active 156You must not close a file handle as long as any watcher is active on the
154on the underlying file descriptor. 157underlying file descriptor.
155 158
156Some event loops issue spurious readyness notifications, so you should 159Some event loops issue spurious readyness notifications, so you should
157always use non-blocking calls when reading/writing from/to your file 160always use non-blocking calls when reading/writing from/to your file
158handles. 161handles.
159 162
170 173
171You can create a time watcher by calling the C<< AnyEvent->timer >> 174You can create a time watcher by calling the C<< AnyEvent->timer >>
172method with the following mandatory arguments: 175method with the following mandatory arguments:
173 176
174C<after> specifies after how many seconds (fractional values are 177C<after> specifies after how many seconds (fractional values are
175supported) should the timer activate. C<cb> the callback to invoke in that 178supported) the callback should be invoked. C<cb> is the callback to invoke
176case. 179in that case.
180
181Although the callback might get passed parameters, their value and
182presence is undefined and you cannot rely on them. Portable AnyEvent
183callbacks cannot use arguments passed to time watcher callbacks.
177 184
178The timer callback will be invoked at most once: if you want a repeating 185The timer callback will be invoked at most once: if you want a repeating
179timer you have to create a new watcher (this is a limitation by both Tk 186timer you have to create a new watcher (this is a limitation by both Tk
180and Glib). 187and Glib).
181 188
226 233
227You can watch for signals using a signal watcher, C<signal> is the signal 234You can watch for signals using a signal watcher, C<signal> is the signal
228I<name> without any C<SIG> prefix, C<cb> is the Perl callback to 235I<name> without any C<SIG> prefix, C<cb> is the Perl callback to
229be invoked whenever a signal occurs. 236be invoked whenever a signal occurs.
230 237
238Although the callback might get passed parameters, their value and
239presence is undefined and you cannot rely on them. Portable AnyEvent
240callbacks cannot use arguments passed to signal watcher callbacks.
241
231Multiple signal occurances can be clumped together into one callback 242Multiple signal occurances can be clumped together into one callback
232invocation, and callback invocation will be synchronous. synchronous means 243invocation, and callback invocation will be synchronous. synchronous means
233that it might take a while until the signal gets handled by the process, 244that it might take a while until the signal gets handled by the process,
234but it is guarenteed not to interrupt any other callbacks. 245but it is guarenteed not to interrupt any other callbacks.
235 246
249 260
250The child process is specified by the C<pid> argument (if set to C<0>, it 261The child process is specified by the C<pid> argument (if set to C<0>, it
251watches for any child process exit). The watcher will trigger as often 262watches for any child process exit). The watcher will trigger as often
252as status change for the child are received. This works by installing a 263as status change for the child are received. This works by installing a
253signal handler for C<SIGCHLD>. The callback will be called with the pid 264signal handler for C<SIGCHLD>. The callback will be called with the pid
254and exit status (as returned by waitpid). 265and exit status (as returned by waitpid), so unlike other watcher types,
266you I<can> rely on child watcher callback arguments.
255 267
256There is a slight catch to child watchers, however: you usually start them 268There is a slight catch to child watchers, however: you usually start them
257I<after> the child process was created, and this means the process could 269I<after> the child process was created, and this means the process could
258have exited already (and no SIGCHLD will be sent anymore). 270have exited already (and no SIGCHLD will be sent anymore).
259 271
266C<fork> the child (alternatively, you can call C<AnyEvent::detect>). 278C<fork> the child (alternatively, you can call C<AnyEvent::detect>).
267 279
268Example: fork a process and wait for it 280Example: fork a process and wait for it
269 281
270 my $done = AnyEvent->condvar; 282 my $done = AnyEvent->condvar;
271
272 AnyEvent::detect; # force event module to be initialised
273 283
274 my $pid = fork or exit 5; 284 my $pid = fork or exit 5;
275 285
276 my $w = AnyEvent->child ( 286 my $w = AnyEvent->child (
277 pid => $pid, 287 pid => $pid,
278 cb => sub { 288 cb => sub {
279 my ($pid, $status) = @_; 289 my ($pid, $status) = @_;
280 warn "pid $pid exited with status $status"; 290 warn "pid $pid exited with status $status";
281 $done->broadcast; 291 $done->send;
282 }, 292 },
283 ); 293 );
284 294
285 # do something else, then wait for process exit 295 # do something else, then wait for process exit
286 $done->wait; 296 $done->recv;
287 297
288=head2 CONDITION VARIABLES 298=head2 CONDITION VARIABLES
289 299
300If you are familiar with some event loops you will know that all of them
301require you to run some blocking "loop", "run" or similar function that
302will actively watch for new events and call your callbacks.
303
304AnyEvent is different, it expects somebody else to run the event loop and
305will only block when necessary (usually when told by the user).
306
307The instrument to do that is called a "condition variable", so called
308because they represent a condition that must become true.
309
290Condition variables can be created by calling the C<< AnyEvent->condvar >> 310Condition variables can be created by calling the C<< AnyEvent->condvar
291method without any arguments. 311>> method, usually without arguments. The only argument pair allowed is
312C<cb>, which specifies a callback to be called when the condition variable
313becomes true.
292 314
293A condition variable waits for a condition - precisely that the C<< 315After creation, the conditon variable is "false" until it becomes "true"
294->broadcast >> method has been called. 316by calling the C<send> method.
295 317
296They are very useful to signal that a condition has been fulfilled, for 318Condition variables are similar to callbacks, except that you can
319optionally wait for them. They can also be called merge points - points
320in time where multiple outstandign events have been processed. And yet
321another way to call them is transations - each condition variable can be
322used to represent a transaction, which finishes at some point and delivers
323a result.
324
325Condition variables are very useful to signal that something has finished,
297example, if you write a module that does asynchronous http requests, 326for example, if you write a module that does asynchronous http requests,
298then a condition variable would be the ideal candidate to signal the 327then a condition variable would be the ideal candidate to signal the
299availability of results. 328availability of results. The user can either act when the callback is
329called or can synchronously C<< ->recv >> for the results.
300 330
301You can also use condition variables to block your main program until 331You can also use them to simulate traditional event loops - for example,
302an event occurs - for example, you could C<< ->wait >> in your main 332you can block your main program until an event occurs - for example, you
303program until the user clicks the Quit button in your app, which would C<< 333could C<< ->recv >> in your main program until the user clicks the Quit
304->broadcast >> the "quit" event. 334button of your app, which would C<< ->send >> the "quit" event.
305 335
306Note that condition variables recurse into the event loop - if you have 336Note that condition variables recurse into the event loop - if you have
307two pirces of code that call C<< ->wait >> in a round-robbin fashion, you 337two pieces of code that call C<< ->recv >> in a round-robbin fashion, you
308lose. Therefore, condition variables are good to export to your caller, but 338lose. Therefore, condition variables are good to export to your caller, but
309you should avoid making a blocking wait yourself, at least in callbacks, 339you should avoid making a blocking wait yourself, at least in callbacks,
310as this asks for trouble. 340as this asks for trouble.
311 341
312This object has two methods: 342Condition variables are represented by hash refs in perl, and the keys
343used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
344easy (it is often useful to build your own transaction class on top of
345AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
346it's C<new> method in your own C<new> method.
347
348There are two "sides" to a condition variable - the "producer side" which
349eventually calls C<< -> send >>, and the "consumer side", which waits
350for the send to occur.
351
352Example:
353
354 # wait till the result is ready
355 my $result_ready = AnyEvent->condvar;
356
357 # do something such as adding a timer
358 # or socket watcher the calls $result_ready->send
359 # when the "result" is ready.
360 # in this case, we simply use a timer:
361 my $w = AnyEvent->timer (
362 after => 1,
363 cb => sub { $result_ready->send },
364 );
365
366 # this "blocks" (while handling events) till the callback
367 # calls send
368 $result_ready->recv;
369
370=head3 METHODS FOR PRODUCERS
371
372These methods should only be used by the producing side, i.e. the
373code/module that eventually sends the signal. Note that it is also
374the producer side which creates the condvar in most cases, but it isn't
375uncommon for the consumer to create it as well.
313 376
314=over 4 377=over 4
315 378
379=item $cv->send (...)
380
381Flag the condition as ready - a running C<< ->recv >> and all further
382calls to C<recv> will (eventually) return after this method has been
383called. If nobody is waiting the send will be remembered.
384
385If a callback has been set on the condition variable, it is called
386immediately from within send.
387
388Any arguments passed to the C<send> call will be returned by all
389future C<< ->recv >> calls.
390
391=item $cv->croak ($error)
392
393Similar to send, but causes all call's to C<< ->recv >> to invoke
394C<Carp::croak> with the given error message/object/scalar.
395
396This can be used to signal any errors to the condition variable
397user/consumer.
398
399=item $cv->begin ([group callback])
400
316=item $cv->wait 401=item $cv->end
317 402
318Wait (blocking if necessary) until the C<< ->broadcast >> method has been 403These two methods are EXPERIMENTAL and MIGHT CHANGE.
404
405These two methods can be used to combine many transactions/events into
406one. For example, a function that pings many hosts in parallel might want
407to use a condition variable for the whole process.
408
409Every call to C<< ->begin >> will increment a counter, and every call to
410C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
411>>, the (last) callback passed to C<begin> will be executed. That callback
412is I<supposed> to call C<< ->send >>, but that is not required. If no
413callback was set, C<send> will be called without any arguments.
414
415Let's clarify this with the ping example:
416
417 my $cv = AnyEvent->condvar;
418
419 my %result;
420 $cv->begin (sub { $cv->send (\%result) });
421
422 for my $host (@list_of_hosts) {
423 $cv->begin;
424 ping_host_then_call_callback $host, sub {
425 $result{$host} = ...;
426 $cv->end;
427 };
428 }
429
430 $cv->end;
431
432This code fragment supposedly pings a number of hosts and calls
433C<send> after results for all then have have been gathered - in any
434order. To achieve this, the code issues a call to C<begin> when it starts
435each ping request and calls C<end> when it has received some result for
436it. Since C<begin> and C<end> only maintain a counter, the order in which
437results arrive is not relevant.
438
439There is an additional bracketing call to C<begin> and C<end> outside the
440loop, which serves two important purposes: first, it sets the callback
441to be called once the counter reaches C<0>, and second, it ensures that
442C<send> is called even when C<no> hosts are being pinged (the loop
443doesn't execute once).
444
445This is the general pattern when you "fan out" into multiple subrequests:
446use an outer C<begin>/C<end> pair to set the callback and ensure C<end>
447is called at least once, and then, for each subrequest you start, call
448C<begin> and for eahc subrequest you finish, call C<end>.
449
450=back
451
452=head3 METHODS FOR CONSUMERS
453
454These methods should only be used by the consuming side, i.e. the
455code awaits the condition.
456
457=over 4
458
459=item $cv->recv
460
461Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
319called on c<$cv>, while servicing other watchers normally. 462>> methods have been called on c<$cv>, while servicing other watchers
463normally.
320 464
321You can only wait once on a condition - additional calls will return 465You can only wait once on a condition - additional calls are valid but
322immediately. 466will return immediately.
467
468If an error condition has been set by calling C<< ->croak >>, then this
469function will call C<croak>.
470
471In list context, all parameters passed to C<send> will be returned,
472in scalar context only the first one will be returned.
323 473
324Not all event models support a blocking wait - some die in that case 474Not all event models support a blocking wait - some die in that case
325(programs might want to do that to stay interactive), so I<if you are 475(programs might want to do that to stay interactive), so I<if you are
326using this from a module, never require a blocking wait>, but let the 476using this from a module, never require a blocking wait>, but let the
327caller decide whether the call will block or not (for example, by coupling 477caller decide whether the call will block or not (for example, by coupling
328condition variables with some kind of request results and supporting 478condition variables with some kind of request results and supporting
329callbacks so the caller knows that getting the result will not block, 479callbacks so the caller knows that getting the result will not block,
330while still suppporting blocking waits if the caller so desires). 480while still suppporting blocking waits if the caller so desires).
331 481
332Another reason I<never> to C<< ->wait >> in a module is that you cannot 482Another reason I<never> to C<< ->recv >> in a module is that you cannot
333sensibly have two C<< ->wait >>'s in parallel, as that would require 483sensibly have two C<< ->recv >>'s in parallel, as that would require
334multiple interpreters or coroutines/threads, none of which C<AnyEvent> 484multiple interpreters or coroutines/threads, none of which C<AnyEvent>
335can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and 485can supply.
336L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
337from different coroutines, however).
338 486
339=item $cv->broadcast 487The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
488fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
489versions and also integrates coroutines into AnyEvent, making blocking
490C<< ->recv >> calls perfectly safe as long as they are done from another
491coroutine (one that doesn't run the event loop).
340 492
341Flag the condition as ready - a running C<< ->wait >> and all further 493You can ensure that C<< -recv >> never blocks by setting a callback and
342calls to C<wait> will (eventually) return after this method has been 494only calling C<< ->recv >> from within that callback (or at a later
343called. If nobody is waiting the broadcast will be remembered.. 495time). This will work even when the event loop does not support blocking
496waits otherwise.
497
498=item $bool = $cv->ready
499
500Returns true when the condition is "true", i.e. whether C<send> or
501C<croak> have been called.
502
503=item $cb = $cv->cb ([new callback])
504
505This is a mutator function that returns the callback set and optionally
506replaces it before doing so.
507
508The callback will be called when the condition becomes "true", i.e. when
509C<send> or C<croak> are called. Calling C<recv> inside the callback
510or at any later time is guaranteed not to block.
344 511
345=back 512=back
346
347Example:
348
349 # wait till the result is ready
350 my $result_ready = AnyEvent->condvar;
351
352 # do something such as adding a timer
353 # or socket watcher the calls $result_ready->broadcast
354 # when the "result" is ready.
355 # in this case, we simply use a timer:
356 my $w = AnyEvent->timer (
357 after => 1,
358 cb => sub { $result_ready->broadcast },
359 );
360
361 # this "blocks" (while handling events) till the watcher
362 # calls broadcast
363 $result_ready->wait;
364 513
365=head1 GLOBAL VARIABLES AND FUNCTIONS 514=head1 GLOBAL VARIABLES AND FUNCTIONS
366 515
367=over 4 516=over 4
368 517
374C<AnyEvent::Impl:xxx> modules, but can be any other class in the case 523C<AnyEvent::Impl:xxx> modules, but can be any other class in the case
375AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>). 524AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
376 525
377The known classes so far are: 526The known classes so far are:
378 527
379 AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
380 AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
381 AnyEvent::Impl::EV based on EV (an interface to libev, best choice). 528 AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
382 AnyEvent::Impl::Event based on Event, second best choice. 529 AnyEvent::Impl::Event based on Event, second best choice.
530 AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
383 AnyEvent::Impl::Glib based on Glib, third-best choice. 531 AnyEvent::Impl::Glib based on Glib, third-best choice.
384 AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
385 AnyEvent::Impl::Tk based on Tk, very bad choice. 532 AnyEvent::Impl::Tk based on Tk, very bad choice.
386 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs). 533 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
387 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse. 534 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
388 AnyEvent::Impl::POE based on POE, not generic enough for full support. 535 AnyEvent::Impl::POE based on POE, not generic enough for full support.
389 536
402Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model 549Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
403if necessary. You should only call this function right before you would 550if necessary. You should only call this function right before you would
404have created an AnyEvent watcher anyway, that is, as late as possible at 551have created an AnyEvent watcher anyway, that is, as late as possible at
405runtime. 552runtime.
406 553
554=item $guard = AnyEvent::post_detect { BLOCK }
555
556Arranges for the code block to be executed as soon as the event model is
557autodetected (or immediately if this has already happened).
558
559If called in scalar or list context, then it creates and returns an object
560that automatically removes the callback again when it is destroyed. See
561L<Coro::BDB> for a case where this is useful.
562
563=item @AnyEvent::post_detect
564
565If there are any code references in this array (you can C<push> to it
566before or after loading AnyEvent), then they will called directly after
567the event loop has been chosen.
568
569You should check C<$AnyEvent::MODEL> before adding to this array, though:
570if it contains a true value then the event loop has already been detected,
571and the array will be ignored.
572
573Best use C<AnyEvent::post_detect { BLOCK }> instead.
574
407=back 575=back
408 576
409=head1 WHAT TO DO IN A MODULE 577=head1 WHAT TO DO IN A MODULE
410 578
411As a module author, you should C<use AnyEvent> and call AnyEvent methods 579As a module author, you should C<use AnyEvent> and call AnyEvent methods
414Be careful when you create watchers in the module body - AnyEvent will 582Be careful when you create watchers in the module body - AnyEvent will
415decide which event module to use as soon as the first method is called, so 583decide which event module to use as soon as the first method is called, so
416by calling AnyEvent in your module body you force the user of your module 584by calling AnyEvent in your module body you force the user of your module
417to load the event module first. 585to load the event module first.
418 586
419Never call C<< ->wait >> on a condition variable unless you I<know> that 587Never call C<< ->recv >> on a condition variable unless you I<know> that
420the C<< ->broadcast >> method has been called on it already. This is 588the C<< ->send >> method has been called on it already. This is
421because it will stall the whole program, and the whole point of using 589because it will stall the whole program, and the whole point of using
422events is to stay interactive. 590events is to stay interactive.
423 591
424It is fine, however, to call C<< ->wait >> when the user of your module 592It is fine, however, to call C<< ->recv >> when the user of your module
425requests it (i.e. if you create a http request object ad have a method 593requests it (i.e. if you create a http request object ad have a method
426called C<results> that returns the results, it should call C<< ->wait >> 594called C<results> that returns the results, it should call C<< ->recv >>
427freely, as the user of your module knows what she is doing. always). 595freely, as the user of your module knows what she is doing. always).
428 596
429=head1 WHAT TO DO IN THE MAIN PROGRAM 597=head1 WHAT TO DO IN THE MAIN PROGRAM
430 598
431There will always be a single main program - the only place that should 599There will always be a single main program - the only place that should
445 613
446You can chose to use a rather inefficient pure-perl implementation by 614You can chose to use a rather inefficient pure-perl implementation by
447loading the C<AnyEvent::Impl::Perl> module, which gives you similar 615loading the C<AnyEvent::Impl::Perl> module, which gives you similar
448behaviour everywhere, but letting AnyEvent chose is generally better. 616behaviour everywhere, but letting AnyEvent chose is generally better.
449 617
618=head1 OTHER MODULES
619
620The following is a non-exhaustive list of additional modules that use
621AnyEvent and can therefore be mixed easily with other AnyEvent modules
622in the same program. Some of the modules come with AnyEvent, some are
623available via CPAN.
624
625=over 4
626
627=item L<AnyEvent::Util>
628
629Contains various utility functions that replace often-used but blocking
630functions such as C<inet_aton> by event-/callback-based versions.
631
632=item L<AnyEvent::Handle>
633
634Provide read and write buffers and manages watchers for reads and writes.
635
636=item L<AnyEvent::Socket>
637
638Provides various utility functions for (internet protocol) sockets,
639addresses and name resolution. Also functions to create non-blocking tcp
640connections or tcp servers, with IPv6 and SRV record support and more.
641
642=item L<AnyEvent::HTTPD>
643
644Provides a simple web application server framework.
645
646=item L<AnyEvent::DNS>
647
648Provides rich asynchronous DNS resolver capabilities.
649
650=item L<AnyEvent::FastPing>
651
652The fastest ping in the west.
653
654=item L<Net::IRC3>
655
656AnyEvent based IRC client module family.
657
658=item L<Net::XMPP2>
659
660AnyEvent based XMPP (Jabber protocol) module family.
661
662=item L<Net::FCP>
663
664AnyEvent-based implementation of the Freenet Client Protocol, birthplace
665of AnyEvent.
666
667=item L<Event::ExecFlow>
668
669High level API for event-based execution flow control.
670
671=item L<Coro>
672
673Has special support for AnyEvent via L<Coro::AnyEvent>.
674
675=item L<AnyEvent::AIO>, L<IO::AIO>
676
677Truly asynchronous I/O, should be in the toolbox of every event
678programmer. AnyEvent::AIO transparently fuses IO::AIO and AnyEvent
679together.
680
681=item L<AnyEvent::BDB>, L<BDB>
682
683Truly asynchronous Berkeley DB access. AnyEvent::AIO transparently fuses
684IO::AIO and AnyEvent together.
685
686=item L<IO::Lambda>
687
688The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
689
690=back
691
450=cut 692=cut
451 693
452package AnyEvent; 694package AnyEvent;
453 695
454no warnings; 696no warnings;
455use strict; 697use strict;
456 698
457use Carp; 699use Carp;
458 700
459our $VERSION = '3.3'; 701our $VERSION = '3.6';
460our $MODEL; 702our $MODEL;
461 703
462our $AUTOLOAD; 704our $AUTOLOAD;
463our @ISA; 705our @ISA;
464 706
465our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 707our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
466 708
467our @REGISTRY; 709our @REGISTRY;
468 710
469my @models = ( 711my @models = (
470 [Coro::EV:: => AnyEvent::Impl::CoroEV::],
471 [Coro::Event:: => AnyEvent::Impl::CoroEvent::],
472 [EV:: => AnyEvent::Impl::EV::], 712 [EV:: => AnyEvent::Impl::EV::],
473 [Event:: => AnyEvent::Impl::Event::], 713 [Event:: => AnyEvent::Impl::Event::],
474 [Glib:: => AnyEvent::Impl::Glib::],
475 [Tk:: => AnyEvent::Impl::Tk::], 714 [Tk:: => AnyEvent::Impl::Tk::],
476 [Wx:: => AnyEvent::Impl::POE::], 715 [Wx:: => AnyEvent::Impl::POE::],
477 [Prima:: => AnyEvent::Impl::POE::], 716 [Prima:: => AnyEvent::Impl::POE::],
478 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::], 717 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
479 # everything below here will not be autoprobed as the pureperl backend should work everywhere 718 # everything below here will not be autoprobed as the pureperl backend should work everywhere
719 [Glib:: => AnyEvent::Impl::Glib::],
480 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy 720 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
481 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program 721 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
482 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza 722 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
483); 723);
484 724
485our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY); 725our %method = map +($_ => 1), qw(io timer signal child condvar one_event DESTROY);
726
727our @post_detect;
728
729sub post_detect(&) {
730 my ($cb) = @_;
731
732 if ($MODEL) {
733 $cb->();
734
735 1
736 } else {
737 push @post_detect, $cb;
738
739 defined wantarray
740 ? bless \$cb, "AnyEvent::Util::PostDetect"
741 : ()
742 }
743}
744
745sub AnyEvent::Util::PostDetect::DESTROY {
746 @post_detect = grep $_ != ${$_[0]}, @post_detect;
747}
486 748
487sub detect() { 749sub detect() {
488 unless ($MODEL) { 750 unless ($MODEL) {
489 no strict 'refs'; 751 no strict 'refs';
490 752
524 last; 786 last;
525 } 787 }
526 } 788 }
527 789
528 $MODEL 790 $MODEL
529 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV (or Coro+EV), Event (or Coro+Event) or Glib."; 791 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.";
530 } 792 }
531 } 793 }
532 794
533 unshift @ISA, $MODEL; 795 unshift @ISA, $MODEL;
534 push @{"$MODEL\::ISA"}, "AnyEvent::Base"; 796 push @{"$MODEL\::ISA"}, "AnyEvent::Base";
797
798 (shift @post_detect)->() while @post_detect;
535 } 799 }
536 800
537 $MODEL 801 $MODEL
538} 802}
539 803
549 $class->$func (@_); 813 $class->$func (@_);
550} 814}
551 815
552package AnyEvent::Base; 816package AnyEvent::Base;
553 817
554# default implementation for ->condvar, ->wait, ->broadcast 818# default implementation for ->condvar
555 819
556sub condvar { 820sub condvar {
557 bless \my $flag, "AnyEvent::Base::CondVar" 821 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
558}
559
560sub AnyEvent::Base::CondVar::broadcast {
561 ${$_[0]}++;
562}
563
564sub AnyEvent::Base::CondVar::wait {
565 AnyEvent->one_event while !${$_[0]};
566} 822}
567 823
568# default implementation for ->signal 824# default implementation for ->signal
569 825
570our %SIG_CB; 826our %SIG_CB;
644 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 900 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
645 901
646 undef $CHLD_W unless keys %PID_CB; 902 undef $CHLD_W unless keys %PID_CB;
647} 903}
648 904
905package AnyEvent::CondVar;
906
907our @ISA = AnyEvent::CondVar::Base::;
908
909package AnyEvent::CondVar::Base;
910
911sub _send {
912 # nop
913}
914
915sub send {
916 my $cv = shift;
917 $cv->{_ae_sent} = [@_];
918 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
919 $cv->_send;
920}
921
922sub croak {
923 $_[0]{_ae_croak} = $_[1];
924 $_[0]->send;
925}
926
927sub ready {
928 $_[0]{_ae_sent}
929}
930
931sub _wait {
932 AnyEvent->one_event while !$_[0]{_ae_sent};
933}
934
935sub recv {
936 $_[0]->_wait;
937
938 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
939 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
940}
941
942sub cb {
943 $_[0]{_ae_cb} = $_[1] if @_ > 1;
944 $_[0]{_ae_cb}
945}
946
947sub begin {
948 ++$_[0]{_ae_counter};
949 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
950}
951
952sub end {
953 return if --$_[0]{_ae_counter};
954 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
955}
956
957# undocumented/compatibility with pre-3.4
958*broadcast = \&send;
959*wait = \&_wait;
960
649=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 961=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
650 962
651This is an advanced topic that you do not normally need to use AnyEvent in 963This is an advanced topic that you do not normally need to use AnyEvent in
652a module. This section is only of use to event loop authors who want to 964a module. This section is only of use to event loop authors who want to
653provide AnyEvent compatibility. 965provide AnyEvent compatibility.
721 1033
722For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you 1034For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
723could start your program like this: 1035could start your program like this:
724 1036
725 PERL_ANYEVENT_MODEL=Perl perl ... 1037 PERL_ANYEVENT_MODEL=Perl perl ...
1038
1039=item C<PERL_ANYEVENT_PROTOCOLS>
1040
1041Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1042for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1043of autoprobing).
1044
1045Must be set to a comma-separated list of protocols or address families,
1046current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1047used, and preference will be given to protocols mentioned earlier in the
1048list.
1049
1050Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1051but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1052- only support IPv4, never try to resolve or contact IPv6
1053addressses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1054IPv6, but prefer IPv6 over IPv4.
726 1055
727=back 1056=back
728 1057
729=head1 EXAMPLE PROGRAM 1058=head1 EXAMPLE PROGRAM
730 1059
741 poll => 'r', 1070 poll => 'r',
742 cb => sub { 1071 cb => sub {
743 warn "io event <$_[0]>\n"; # will always output <r> 1072 warn "io event <$_[0]>\n"; # will always output <r>
744 chomp (my $input = <STDIN>); # read a line 1073 chomp (my $input = <STDIN>); # read a line
745 warn "read: $input\n"; # output what has been read 1074 warn "read: $input\n"; # output what has been read
746 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1075 $cv->send if $input =~ /^q/i; # quit program if /^q/i
747 }, 1076 },
748 ); 1077 );
749 1078
750 my $time_watcher; # can only be used once 1079 my $time_watcher; # can only be used once
751 1080
756 }); 1085 });
757 } 1086 }
758 1087
759 new_timer; # create first timer 1088 new_timer; # create first timer
760 1089
761 $cv->wait; # wait until user enters /^q/i 1090 $cv->recv; # wait until user enters /^q/i
762 1091
763=head1 REAL-WORLD EXAMPLE 1092=head1 REAL-WORLD EXAMPLE
764 1093
765Consider the L<Net::FCP> module. It features (among others) the following 1094Consider the L<Net::FCP> module. It features (among others) the following
766API calls, which are to freenet what HTTP GET requests are to http: 1095API calls, which are to freenet what HTTP GET requests are to http:
822 1151
823 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1152 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
824 1153
825 if (end-of-file or data complete) { 1154 if (end-of-file or data complete) {
826 $txn->{result} = $txn->{buf}; 1155 $txn->{result} = $txn->{buf};
827 $txn->{finished}->broadcast; 1156 $txn->{finished}->send;
828 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1157 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
829 } 1158 }
830 1159
831The C<result> method, finally, just waits for the finished signal (if the 1160The C<result> method, finally, just waits for the finished signal (if the
832request was already finished, it doesn't wait, of course, and returns the 1161request was already finished, it doesn't wait, of course, and returns the
833data: 1162data:
834 1163
835 $txn->{finished}->wait; 1164 $txn->{finished}->recv;
836 return $txn->{result}; 1165 return $txn->{result};
837 1166
838The actual code goes further and collects all errors (C<die>s, exceptions) 1167The actual code goes further and collects all errors (C<die>s, exceptions)
839that occured during request processing. The C<result> method detects 1168that occured during request processing. The C<result> method detects
840whether an exception as thrown (it is stored inside the $txn object) 1169whether an exception as thrown (it is stored inside the $txn object)
875 1204
876 my $quit = AnyEvent->condvar; 1205 my $quit = AnyEvent->condvar;
877 1206
878 $fcp->txn_client_get ($url)->cb (sub { 1207 $fcp->txn_client_get ($url)->cb (sub {
879 ... 1208 ...
880 $quit->broadcast; 1209 $quit->send;
881 }); 1210 });
882 1211
883 $quit->wait; 1212 $quit->recv;
884 1213
885 1214
886=head1 BENCHMARK 1215=head1 BENCHMARKS
887 1216
888To give you an idea of the performance and overheads that AnyEvent adds 1217To give you an idea of the performance and overheads that AnyEvent adds
889over the event loops themselves (and to give you an impression of the 1218over the event loops themselves and to give you an impression of the speed
890speed of various event loops), here is a benchmark of various supported 1219of various event loops I prepared some benchmarks.
891event models natively and with anyevent. The benchmark creates a lot of 1220
892timers (with a zero timeout) and I/O watchers (watching STDOUT, a pty, to 1221=head2 BENCHMARKING ANYEVENT OVERHEAD
1222
1223Here is a benchmark of various supported event models used natively and
1224through anyevent. The benchmark creates a lot of timers (with a zero
1225timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
893become writable, which it is), lets them fire exactly once and destroys 1226which it is), lets them fire exactly once and destroys them again.
894them again.
895 1227
896Rewriting the benchmark to use many different sockets instead of using 1228Source code for this benchmark is found as F<eg/bench> in the AnyEvent
897the same filehandle for all I/O watchers results in a much longer runtime 1229distribution.
898(socket creation is expensive), but qualitatively the same figures, so it
899was not used.
900 1230
901=head2 Explanation of the columns 1231=head3 Explanation of the columns
902 1232
903I<watcher> is the number of event watchers created/destroyed. Since 1233I<watcher> is the number of event watchers created/destroyed. Since
904different event models feature vastly different performances, each event 1234different event models feature vastly different performances, each event
905loop was given a number of watchers so that overall runtime is acceptable 1235loop was given a number of watchers so that overall runtime is acceptable
906and similar between tested event loop (and keep them from crashing): Glib 1236and similar between tested event loop (and keep them from crashing): Glib
916all watchers, to avoid adding memory overhead. That means closure creation 1246all watchers, to avoid adding memory overhead. That means closure creation
917and memory usage is not included in the figures. 1247and memory usage is not included in the figures.
918 1248
919I<invoke> is the time, in microseconds, used to invoke a simple 1249I<invoke> is the time, in microseconds, used to invoke a simple
920callback. The callback simply counts down a Perl variable and after it was 1250callback. The callback simply counts down a Perl variable and after it was
921invoked "watcher" times, it would C<< ->broadcast >> a condvar once to 1251invoked "watcher" times, it would C<< ->send >> a condvar once to
922signal the end of this phase. 1252signal the end of this phase.
923 1253
924I<destroy> is the time, in microseconds, that it takes to destroy a single 1254I<destroy> is the time, in microseconds, that it takes to destroy a single
925watcher. 1255watcher.
926 1256
927=head2 Results 1257=head3 Results
928 1258
929 name watchers bytes create invoke destroy comment 1259 name watchers bytes create invoke destroy comment
930 EV/EV 400000 244 0.56 0.46 0.31 EV native interface 1260 EV/EV 400000 244 0.56 0.46 0.31 EV native interface
931 EV/Any 100000 610 3.52 0.91 0.75 EV + AnyEvent watchers 1261 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
932 CoroEV/Any 100000 610 3.49 0.92 0.75 coroutines + Coro::Signal 1262 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
933 Perl/Any 100000 513 4.91 0.92 1.15 pure perl implementation 1263 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
934 Event/Event 16000 523 28.05 21.38 0.86 Event native interface 1264 Event/Event 16000 516 31.88 31.30 0.85 Event native interface
935 Event/Any 16000 943 34.43 20.48 1.39 Event + AnyEvent watchers 1265 Event/Any 16000 590 35.75 31.42 1.08 Event + AnyEvent watchers
936 Glib/Any 16000 1357 96.99 12.55 55.51 quadratic behaviour 1266 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
937 Tk/Any 2000 1855 27.01 66.61 14.03 SEGV with >> 2000 watchers 1267 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
938 POE/Event 2000 6644 108.15 768.19 14.33 via POE::Loop::Event 1268 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
939 POE/Select 2000 6343 94.69 807.65 562.69 via POE::Loop::Select 1269 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
940 1270
941=head2 Discussion 1271=head3 Discussion
942 1272
943The benchmark does I<not> measure scalability of the event loop very 1273The benchmark does I<not> measure scalability of the event loop very
944well. For example, a select-based event loop (such as the pure perl one) 1274well. For example, a select-based event loop (such as the pure perl one)
945can never compete with an event loop that uses epoll when the number of 1275can never compete with an event loop that uses epoll when the number of
946file descriptors grows high. In this benchmark, all events become ready at 1276file descriptors grows high. In this benchmark, all events become ready at
947the same time, so select/poll-based implementations get an unnatural speed 1277the same time, so select/poll-based implementations get an unnatural speed
948boost. 1278boost.
949 1279
1280Also, note that the number of watchers usually has a nonlinear effect on
1281overall speed, that is, creating twice as many watchers doesn't take twice
1282the time - usually it takes longer. This puts event loops tested with a
1283higher number of watchers at a disadvantage.
1284
1285To put the range of results into perspective, consider that on the
1286benchmark machine, handling an event takes roughly 1600 CPU cycles with
1287EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1288cycles with POE.
1289
950C<EV> is the sole leader regarding speed and memory use, which are both 1290C<EV> is the sole leader regarding speed and memory use, which are both
951maximal/minimal, respectively. Even when going through AnyEvent, there are 1291maximal/minimal, respectively. Even when going through AnyEvent, it uses
952only two event loops that use slightly less memory (the C<Event> module 1292far less memory than any other event loop and is still faster than Event
953natively and the pure perl backend), and no faster event models, not even 1293natively.
954C<Event> natively.
955 1294
956The pure perl implementation is hit in a few sweet spots (both the 1295The pure perl implementation is hit in a few sweet spots (both the
957zero timeout and the use of a single fd hit optimisations in the perl 1296constant timeout and the use of a single fd hit optimisations in the perl
958interpreter and the backend itself, and all watchers become ready at the 1297interpreter and the backend itself). Nevertheless this shows that it
959same time). Nevertheless this shows that it adds very little overhead in 1298adds very little overhead in itself. Like any select-based backend its
960itself. Like any select-based backend its performance becomes really bad 1299performance becomes really bad with lots of file descriptors (and few of
961with lots of file descriptors (and few of them active), of course, but 1300them active), of course, but this was not subject of this benchmark.
962this was not subject of this benchmark.
963 1301
964The C<Event> module has a relatively high setup and callback invocation cost, 1302The C<Event> module has a relatively high setup and callback invocation
965but overall scores on the third place. 1303cost, but overall scores in on the third place.
966 1304
967C<Glib>'s memory usage is quite a bit bit higher, but it features a 1305C<Glib>'s memory usage is quite a bit higher, but it features a
968faster callback invocation and overall ends up in the same class as 1306faster callback invocation and overall ends up in the same class as
969C<Event>. However, Glib scales extremely badly, doubling the number of 1307C<Event>. However, Glib scales extremely badly, doubling the number of
970watchers increases the processing time by more than a factor of four, 1308watchers increases the processing time by more than a factor of four,
971making it completely unusable when using larger numbers of watchers 1309making it completely unusable when using larger numbers of watchers
972(note that only a single file descriptor was used in the benchmark, so 1310(note that only a single file descriptor was used in the benchmark, so
975The C<Tk> adaptor works relatively well. The fact that it crashes with 1313The C<Tk> adaptor works relatively well. The fact that it crashes with
976more than 2000 watchers is a big setback, however, as correctness takes 1314more than 2000 watchers is a big setback, however, as correctness takes
977precedence over speed. Nevertheless, its performance is surprising, as the 1315precedence over speed. Nevertheless, its performance is surprising, as the
978file descriptor is dup()ed for each watcher. This shows that the dup() 1316file descriptor is dup()ed for each watcher. This shows that the dup()
979employed by some adaptors is not a big performance issue (it does incur a 1317employed by some adaptors is not a big performance issue (it does incur a
980hidden memory cost inside the kernel, though, that is not reflected in the 1318hidden memory cost inside the kernel which is not reflected in the figures
981figures above). 1319above).
982 1320
983C<POE>, regardless of underlying event loop (wether using its pure perl 1321C<POE>, regardless of underlying event loop (whether using its pure perl
984select-based backend or the Event module) shows abysmal performance and 1322select-based backend or the Event module, the POE-EV backend couldn't
1323be tested because it wasn't working) shows abysmal performance and
985memory usage: Watchers use almost 30 times as much memory as EV watchers, 1324memory usage with AnyEvent: Watchers use almost 30 times as much memory
986and 10 times as much memory as both Event or EV via AnyEvent. Watcher 1325as EV watchers, and 10 times as much memory as Event (the high memory
1326requirements are caused by requiring a session for each watcher). Watcher
987invocation is almost 900 times slower than with AnyEvent's pure perl 1327invocation speed is almost 900 times slower than with AnyEvent's pure perl
1328implementation.
1329
988implementation. The design of the POE adaptor class in AnyEvent can not 1330The design of the POE adaptor class in AnyEvent can not really account
989really account for this, as session creation overhead is small compared 1331for the performance issues, though, as session creation overhead is
990to execution of the state machine, which is coded pretty optimally within 1332small compared to execution of the state machine, which is coded pretty
991L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow. 1333optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
1334using multiple sessions is not a good approach, especially regarding
1335memory usage, even the author of POE could not come up with a faster
1336design).
992 1337
993=head2 Summary 1338=head3 Summary
994 1339
1340=over 4
1341
995Using EV through AnyEvent is faster than any other event loop, but most 1342=item * Using EV through AnyEvent is faster than any other event loop
996event loops have acceptable performance with or without AnyEvent. 1343(even when used without AnyEvent), but most event loops have acceptable
1344performance with or without AnyEvent.
997 1345
998The overhead AnyEvent adds is usually much smaller than the overhead of 1346=item * The overhead AnyEvent adds is usually much smaller than the overhead of
999the actual event loop, only with extremely fast event loops such as the EV 1347the actual event loop, only with extremely fast event loops such as EV
1000adds AnyEvent significant overhead. 1348adds AnyEvent significant overhead.
1001 1349
1002And you should simply avoid POE like the plague if you want performance or 1350=item * You should avoid POE like the plague if you want performance or
1003reasonable memory usage. 1351reasonable memory usage.
1004 1352
1353=back
1354
1355=head2 BENCHMARKING THE LARGE SERVER CASE
1356
1357This benchmark atcually benchmarks the event loop itself. It works by
1358creating a number of "servers": each server consists of a socketpair, a
1359timeout watcher that gets reset on activity (but never fires), and an I/O
1360watcher waiting for input on one side of the socket. Each time the socket
1361watcher reads a byte it will write that byte to a random other "server".
1362
1363The effect is that there will be a lot of I/O watchers, only part of which
1364are active at any one point (so there is a constant number of active
1365fds for each loop iterstaion, but which fds these are is random). The
1366timeout is reset each time something is read because that reflects how
1367most timeouts work (and puts extra pressure on the event loops).
1368
1369In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100
1370(1%) are active. This mirrors the activity of large servers with many
1371connections, most of which are idle at any one point in time.
1372
1373Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1374distribution.
1375
1376=head3 Explanation of the columns
1377
1378I<sockets> is the number of sockets, and twice the number of "servers" (as
1379each server has a read and write socket end).
1380
1381I<create> is the time it takes to create a socketpair (which is
1382nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1383
1384I<request>, the most important value, is the time it takes to handle a
1385single "request", that is, reading the token from the pipe and forwarding
1386it to another server. This includes deleting the old timeout and creating
1387a new one that moves the timeout into the future.
1388
1389=head3 Results
1390
1391 name sockets create request
1392 EV 20000 69.01 11.16
1393 Perl 20000 73.32 35.87
1394 Event 20000 212.62 257.32
1395 Glib 20000 651.16 1896.30
1396 POE 20000 349.67 12317.24 uses POE::Loop::Event
1397
1398=head3 Discussion
1399
1400This benchmark I<does> measure scalability and overall performance of the
1401particular event loop.
1402
1403EV is again fastest. Since it is using epoll on my system, the setup time
1404is relatively high, though.
1405
1406Perl surprisingly comes second. It is much faster than the C-based event
1407loops Event and Glib.
1408
1409Event suffers from high setup time as well (look at its code and you will
1410understand why). Callback invocation also has a high overhead compared to
1411the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
1412uses select or poll in basically all documented configurations.
1413
1414Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
1415clearly fails to perform with many filehandles or in busy servers.
1416
1417POE is still completely out of the picture, taking over 1000 times as long
1418as EV, and over 100 times as long as the Perl implementation, even though
1419it uses a C-based event loop in this case.
1420
1421=head3 Summary
1422
1423=over 4
1424
1425=item * The pure perl implementation performs extremely well.
1426
1427=item * Avoid Glib or POE in large projects where performance matters.
1428
1429=back
1430
1431=head2 BENCHMARKING SMALL SERVERS
1432
1433While event loops should scale (and select-based ones do not...) even to
1434large servers, most programs we (or I :) actually write have only a few
1435I/O watchers.
1436
1437In this benchmark, I use the same benchmark program as in the large server
1438case, but it uses only eight "servers", of which three are active at any
1439one time. This should reflect performance for a small server relatively
1440well.
1441
1442The columns are identical to the previous table.
1443
1444=head3 Results
1445
1446 name sockets create request
1447 EV 16 20.00 6.54
1448 Perl 16 25.75 12.62
1449 Event 16 81.27 35.86
1450 Glib 16 32.63 15.48
1451 POE 16 261.87 276.28 uses POE::Loop::Event
1452
1453=head3 Discussion
1454
1455The benchmark tries to test the performance of a typical small
1456server. While knowing how various event loops perform is interesting, keep
1457in mind that their overhead in this case is usually not as important, due
1458to the small absolute number of watchers (that is, you need efficiency and
1459speed most when you have lots of watchers, not when you only have a few of
1460them).
1461
1462EV is again fastest.
1463
1464Perl again comes second. It is noticably faster than the C-based event
1465loops Event and Glib, although the difference is too small to really
1466matter.
1467
1468POE also performs much better in this case, but is is still far behind the
1469others.
1470
1471=head3 Summary
1472
1473=over 4
1474
1475=item * C-based event loops perform very well with small number of
1476watchers, as the management overhead dominates.
1477
1478=back
1479
1005 1480
1006=head1 FORK 1481=head1 FORK
1007 1482
1008Most event libraries are not fork-safe. The ones who are usually are 1483Most event libraries are not fork-safe. The ones who are usually are
1009because they are so inefficient. Only L<EV> is fully fork-aware. 1484because they rely on inefficient but fork-safe C<select> or C<poll>
1485calls. Only L<EV> is fully fork-aware.
1010 1486
1011If you have to fork, you must either do so I<before> creating your first 1487If you have to fork, you must either do so I<before> creating your first
1012watcher OR you must not use AnyEvent at all in the child. 1488watcher OR you must not use AnyEvent at all in the child.
1013 1489
1014 1490
1026 1502
1027 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} } 1503 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
1028 1504
1029 use AnyEvent; 1505 use AnyEvent;
1030 1506
1507Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
1508be used to probe what backend is used and gain other information (which is
1509probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
1510
1031 1511
1032=head1 SEE ALSO 1512=head1 SEE ALSO
1033 1513
1034Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>, 1514Utility functions: L<AnyEvent::Util>.
1035L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>, 1515
1516Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1036L<Event::Lib>, L<Qt>, L<POE>. 1517L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1037 1518
1038Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>, 1519Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1039L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>, 1520L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1040L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>, 1521L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1041L<AnyEvent::Impl::Qt>, L<AnyEvent::Impl::POE>. 1522L<AnyEvent::Impl::POE>.
1042 1523
1524Non-blocking file handles, sockets, TCP clients and
1525servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1526
1527Asynchronous DNS: L<AnyEvent::DNS>.
1528
1529Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1530
1043Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1531Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1044 1532
1045 1533
1046=head1 AUTHOR 1534=head1 AUTHOR
1047 1535
1048 Marc Lehmann <schmorp@schmorp.de> 1536 Marc Lehmann <schmorp@schmorp.de>

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines