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.84 by root, Fri Apr 25 13:48:42 2008 UTC vs.
Revision 1.130 by root, Sat May 24 17:21:50 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?
57as those use one of the supported event loops. It is trivial to add new 57as those use one of the supported event loops. It is trivial to add new
58event loops to AnyEvent, too, so it is future-proof). 58event loops to AnyEvent, too, so it is future-proof).
59 59
60In addition to being free of having to use I<the one and only true event 60In addition to being free of having to use I<the one and only true event
61model>, AnyEvent also is free of bloat and policy: with POE or similar 61model>, AnyEvent also is free of bloat and policy: with POE or similar
62modules, you get an enourmous amount of code and strict rules you have to 62modules, you get an enormous amount of code and strict rules you have to
63follow. AnyEvent, on the other hand, is lean and up to the point, by only 63follow. AnyEvent, on the other hand, is lean and up to the point, by only
64offering the functionality that is necessary, in as thin as a wrapper as 64offering the functionality that is necessary, in as thin as a wrapper as
65technically possible. 65technically possible.
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
71 70
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
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
109 108
110=head1 WATCHERS 109=head1 WATCHERS
111 110
112AnyEvent has the central concept of a I<watcher>, which is an object that 111AnyEvent has the central concept of a I<watcher>, which is an object that
113stores relevant data for each kind of event you are waiting for, such as 112stores relevant data for each kind of event you are waiting for, such as
114the callback to call, the filehandle to watch, etc. 113the callback to call, the file handle to watch, etc.
115 114
116These watchers are normal Perl objects with normal Perl lifetime. After 115These watchers are normal Perl objects with normal Perl lifetime. After
117creating a watcher it will immediately "watch" for events and invoke the 116creating a watcher it will immediately "watch" for events and invoke the
118callback when the event occurs (of course, only when the event model 117callback when the event occurs (of course, only when the event model
119is in control). 118is in control).
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.
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.
151 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.
153You must not close a file handle as long as any watcher is active on the 156You must not close a file handle as long as any watcher is active on the
154underlying 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
160Although the callback might get passed parameters, their value and
161presence is undefined and you cannot rely on them. Portable AnyEvent
162callbacks cannot use arguments passed to I/O watcher callbacks.
163 162
164Example: 163Example:
165 164
166 # wait for readability of STDIN, then read a line and disable the watcher 165 # wait for readability of STDIN, then read a line and disable the watcher
167 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub { 166 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
174 173
175You can create a time watcher by calling the C<< AnyEvent->timer >> 174You can create a time watcher by calling the C<< AnyEvent->timer >>
176method with the following mandatory arguments: 175method with the following mandatory arguments:
177 176
178C<after> specifies after how many seconds (fractional values are 177C<after> specifies after how many seconds (fractional values are
179supported) 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
180case. 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.
181 184
182The 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
183timer 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
184and Glib). 187and Glib).
185
186Although the callback might get passed parameters, their value and
187presence is undefined and you cannot rely on them. Portable AnyEvent
188callbacks cannot use arguments passed to time watcher callbacks.
189 188
190Example: 189Example:
191 190
192 # fire an event after 7.7 seconds 191 # fire an event after 7.7 seconds
193 my $w = AnyEvent->timer (after => 7.7, cb => sub { 192 my $w = AnyEvent->timer (after => 7.7, cb => sub {
234 233
235You 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
236I<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
237be invoked whenever a signal occurs. 236be invoked whenever a signal occurs.
238 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
239Multiple signal occurances can be clumped together into one callback 242Multiple signal occurrences can be clumped together into one callback
240invocation, and callback invocation will be synchronous. synchronous means 243invocation, and callback invocation will be synchronous. Synchronous means
241that 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,
242but it is guarenteed not to interrupt any other callbacks. 245but it is guaranteed not to interrupt any other callbacks.
243 246
244The main advantage of using these watchers is that you can share a signal 247The main advantage of using these watchers is that you can share a signal
245between multiple watchers. 248between multiple watchers.
246 249
247This watcher might use C<%SIG>, so programs overwriting those signals 250This watcher might use C<%SIG>, so programs overwriting those signals
257 260
258The 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
259watches for any child process exit). The watcher will trigger as often 262watches for any child process exit). The watcher will trigger as often
260as 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
261signal 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
262and 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.
263 267
264There 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
265I<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
266have exited already (and no SIGCHLD will be sent anymore). 270have exited already (and no SIGCHLD will be sent anymore).
267 271
274C<fork> the child (alternatively, you can call C<AnyEvent::detect>). 278C<fork> the child (alternatively, you can call C<AnyEvent::detect>).
275 279
276Example: fork a process and wait for it 280Example: fork a process and wait for it
277 281
278 my $done = AnyEvent->condvar; 282 my $done = AnyEvent->condvar;
279
280 AnyEvent::detect; # force event module to be initialised
281 283
282 my $pid = fork or exit 5; 284 my $pid = fork or exit 5;
283 285
284 my $w = AnyEvent->child ( 286 my $w = AnyEvent->child (
285 pid => $pid, 287 pid => $pid,
286 cb => sub { 288 cb => sub {
287 my ($pid, $status) = @_; 289 my ($pid, $status) = @_;
288 warn "pid $pid exited with status $status"; 290 warn "pid $pid exited with status $status";
289 $done->broadcast; 291 $done->send;
290 }, 292 },
291 ); 293 );
292 294
293 # do something else, then wait for process exit 295 # do something else, then wait for process exit
294 $done->wait; 296 $done->recv;
295 297
296=head2 CONDITION VARIABLES 298=head2 CONDITION VARIABLES
297 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
298Condition variables can be created by calling the C<< AnyEvent->condvar >> 310Condition variables can be created by calling the C<< AnyEvent->condvar
299method 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.
300 314
301A condition variable waits for a condition - precisely that the C<< 315After creation, the condition variable is "false" until it becomes "true"
302->broadcast >> method has been called. 316by calling the C<send> method.
303 317
304They 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 outstanding events have been processed. And yet
321another way to call them is transactions - 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,
305example, if you write a module that does asynchronous http requests, 326for example, if you write a module that does asynchronous http requests,
306then a condition variable would be the ideal candidate to signal the 327then a condition variable would be the ideal candidate to signal the
307availability of results. 328availability of results. The user can either act when the callback is
329called or can synchronously C<< ->recv >> for the results.
308 330
309You can also use condition variables to block your main program until 331You can also use them to simulate traditional event loops - for example,
310an event occurs - for example, you could C<< ->wait >> in your main 332you can block your main program until an event occurs - for example, you
311program 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
312->broadcast >> the "quit" event. 334button of your app, which would C<< ->send >> the "quit" event.
313 335
314Note that condition variables recurse into the event loop - if you have 336Note that condition variables recurse into the event loop - if you have
315two pirces of code that call C<< ->wait >> in a round-robbin fashion, you 337two pieces of code that call C<< ->recv >> in a round-robin fashion, you
316lose. Therefore, condition variables are good to export to your caller, but 338lose. Therefore, condition variables are good to export to your caller, but
317you should avoid making a blocking wait yourself, at least in callbacks, 339you should avoid making a blocking wait yourself, at least in callbacks,
318as this asks for trouble. 340as this asks for trouble.
319 341
320This 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.
321 376
322=over 4 377=over 4
323 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
324=item $cv->wait 401=item $cv->end
325 402
326Wait (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 each 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
327called on c<$cv>, while servicing other watchers normally. 462>> methods have been called on c<$cv>, while servicing other watchers
463normally.
328 464
329You can only wait once on a condition - additional calls will return 465You can only wait once on a condition - additional calls are valid but
330immediately. 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.
331 473
332Not 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
333(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
334using 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
335caller 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
336condition variables with some kind of request results and supporting 478condition variables with some kind of request results and supporting
337callbacks so the caller knows that getting the result will not block, 479callbacks so the caller knows that getting the result will not block,
338while still suppporting blocking waits if the caller so desires). 480while still supporting blocking waits if the caller so desires).
339 481
340Another 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
341sensibly have two C<< ->wait >>'s in parallel, as that would require 483sensibly have two C<< ->recv >>'s in parallel, as that would require
342multiple interpreters or coroutines/threads, none of which C<AnyEvent> 484multiple interpreters or coroutines/threads, none of which C<AnyEvent>
343can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and 485can supply.
344L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
345from different coroutines, however).
346 486
347=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).
348 492
349Flag the condition as ready - a running C<< ->wait >> and all further 493You can ensure that C<< -recv >> never blocks by setting a callback and
350calls to C<wait> will (eventually) return after this method has been 494only calling C<< ->recv >> from within that callback (or at a later
351called. 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.
352 511
353=back 512=back
354
355Example:
356
357 # wait till the result is ready
358 my $result_ready = AnyEvent->condvar;
359
360 # do something such as adding a timer
361 # or socket watcher the calls $result_ready->broadcast
362 # when the "result" is ready.
363 # in this case, we simply use a timer:
364 my $w = AnyEvent->timer (
365 after => 1,
366 cb => sub { $result_ready->broadcast },
367 );
368
369 # this "blocks" (while handling events) till the watcher
370 # calls broadcast
371 $result_ready->wait;
372 513
373=head1 GLOBAL VARIABLES AND FUNCTIONS 514=head1 GLOBAL VARIABLES AND FUNCTIONS
374 515
375=over 4 516=over 4
376 517
382C<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
383AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>). 524AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
384 525
385The known classes so far are: 526The known classes so far are:
386 527
387 AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
388 AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
389 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).
390 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.
391 AnyEvent::Impl::Glib based on Glib, third-best choice. 531 AnyEvent::Impl::Glib based on Glib, third-best choice.
392 AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
393 AnyEvent::Impl::Tk based on Tk, very bad choice. 532 AnyEvent::Impl::Tk based on Tk, very bad choice.
394 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).
395 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse. 534 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
396 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.
397 536
410Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model 549Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
411if necessary. You should only call this function right before you would 550if necessary. You should only call this function right before you would
412have 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
413runtime. 552runtime.
414 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
415=back 575=back
416 576
417=head1 WHAT TO DO IN A MODULE 577=head1 WHAT TO DO IN A MODULE
418 578
419As 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
422Be careful when you create watchers in the module body - AnyEvent will 582Be careful when you create watchers in the module body - AnyEvent will
423decide 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
424by 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
425to load the event module first. 585to load the event module first.
426 586
427Never 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
428the C<< ->broadcast >> method has been called on it already. This is 588the C<< ->send >> method has been called on it already. This is
429because 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
430events is to stay interactive. 590events is to stay interactive.
431 591
432It 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
433requests 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
434called C<results> that returns the results, it should call C<< ->wait >> 594called C<results> that returns the results, it should call C<< ->recv >>
435freely, 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).
436 596
437=head1 WHAT TO DO IN THE MAIN PROGRAM 597=head1 WHAT TO DO IN THE MAIN PROGRAM
438 598
439There 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
453 613
454You can chose to use a rather inefficient pure-perl implementation by 614You can chose to use a rather inefficient pure-perl implementation by
455loading the C<AnyEvent::Impl::Perl> module, which gives you similar 615loading the C<AnyEvent::Impl::Perl> module, which gives you similar
456behaviour everywhere, but letting AnyEvent chose is generally better. 616behaviour everywhere, but letting AnyEvent chose is generally better.
457 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
458=cut 692=cut
459 693
460package AnyEvent; 694package AnyEvent;
461 695
462no warnings; 696no warnings;
463use strict; 697use strict;
464 698
465use Carp; 699use Carp;
466 700
467our $VERSION = '3.3'; 701our $VERSION = '4.0';
468our $MODEL; 702our $MODEL;
469 703
470our $AUTOLOAD; 704our $AUTOLOAD;
471our @ISA; 705our @ISA;
472 706
473our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 707our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
474 708
475our @REGISTRY; 709our @REGISTRY;
476 710
711our %PROTOCOL; # (ipv4|ipv6) => (1|2)
712
713{
714 my $idx;
715 $PROTOCOL{$_} = ++$idx
716 for split /\s*,\s*/, $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
717}
718
477my @models = ( 719my @models = (
478 [Coro::EV:: => AnyEvent::Impl::CoroEV::],
479 [Coro::Event:: => AnyEvent::Impl::CoroEvent::],
480 [EV:: => AnyEvent::Impl::EV::], 720 [EV:: => AnyEvent::Impl::EV::],
481 [Event:: => AnyEvent::Impl::Event::], 721 [Event:: => AnyEvent::Impl::Event::],
482 [Glib:: => AnyEvent::Impl::Glib::],
483 [Tk:: => AnyEvent::Impl::Tk::], 722 [Tk:: => AnyEvent::Impl::Tk::],
484 [Wx:: => AnyEvent::Impl::POE::], 723 [Wx:: => AnyEvent::Impl::POE::],
485 [Prima:: => AnyEvent::Impl::POE::], 724 [Prima:: => AnyEvent::Impl::POE::],
486 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::], 725 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
487 # everything below here will not be autoprobed as the pureperl backend should work everywhere 726 # everything below here will not be autoprobed as the pureperl backend should work everywhere
727 [Glib:: => AnyEvent::Impl::Glib::],
488 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy 728 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
489 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program 729 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
490 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza 730 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
491); 731);
492 732
493our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY); 733our %method = map +($_ => 1), qw(io timer signal child condvar one_event DESTROY);
734
735our @post_detect;
736
737sub post_detect(&) {
738 my ($cb) = @_;
739
740 if ($MODEL) {
741 $cb->();
742
743 1
744 } else {
745 push @post_detect, $cb;
746
747 defined wantarray
748 ? bless \$cb, "AnyEvent::Util::PostDetect"
749 : ()
750 }
751}
752
753sub AnyEvent::Util::PostDetect::DESTROY {
754 @post_detect = grep $_ != ${$_[0]}, @post_detect;
755}
494 756
495sub detect() { 757sub detect() {
496 unless ($MODEL) { 758 unless ($MODEL) {
497 no strict 'refs'; 759 no strict 'refs';
498 760
532 last; 794 last;
533 } 795 }
534 } 796 }
535 797
536 $MODEL 798 $MODEL
537 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."; 799 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.";
538 } 800 }
539 } 801 }
540 802
541 unshift @ISA, $MODEL; 803 unshift @ISA, $MODEL;
542 push @{"$MODEL\::ISA"}, "AnyEvent::Base"; 804 push @{"$MODEL\::ISA"}, "AnyEvent::Base";
805
806 (shift @post_detect)->() while @post_detect;
543 } 807 }
544 808
545 $MODEL 809 $MODEL
546} 810}
547 811
557 $class->$func (@_); 821 $class->$func (@_);
558} 822}
559 823
560package AnyEvent::Base; 824package AnyEvent::Base;
561 825
562# default implementation for ->condvar, ->wait, ->broadcast 826# default implementation for ->condvar
563 827
564sub condvar { 828sub condvar {
565 bless \my $flag, "AnyEvent::Base::CondVar" 829 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
566}
567
568sub AnyEvent::Base::CondVar::broadcast {
569 ${$_[0]}++;
570}
571
572sub AnyEvent::Base::CondVar::wait {
573 AnyEvent->one_event while !${$_[0]};
574} 830}
575 831
576# default implementation for ->signal 832# default implementation for ->signal
577 833
578our %SIG_CB; 834our %SIG_CB;
652 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 908 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
653 909
654 undef $CHLD_W unless keys %PID_CB; 910 undef $CHLD_W unless keys %PID_CB;
655} 911}
656 912
913package AnyEvent::CondVar;
914
915our @ISA = AnyEvent::CondVar::Base::;
916
917package AnyEvent::CondVar::Base;
918
919sub _send {
920 # nop
921}
922
923sub send {
924 my $cv = shift;
925 $cv->{_ae_sent} = [@_];
926 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
927 $cv->_send;
928}
929
930sub croak {
931 $_[0]{_ae_croak} = $_[1];
932 $_[0]->send;
933}
934
935sub ready {
936 $_[0]{_ae_sent}
937}
938
939sub _wait {
940 AnyEvent->one_event while !$_[0]{_ae_sent};
941}
942
943sub recv {
944 $_[0]->_wait;
945
946 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
947 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
948}
949
950sub cb {
951 $_[0]{_ae_cb} = $_[1] if @_ > 1;
952 $_[0]{_ae_cb}
953}
954
955sub begin {
956 ++$_[0]{_ae_counter};
957 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
958}
959
960sub end {
961 return if --$_[0]{_ae_counter};
962 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
963}
964
965# undocumented/compatibility with pre-3.4
966*broadcast = \&send;
967*wait = \&_wait;
968
657=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 969=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
658 970
659This is an advanced topic that you do not normally need to use AnyEvent in 971This is an advanced topic that you do not normally need to use AnyEvent in
660a module. This section is only of use to event loop authors who want to 972a module. This section is only of use to event loop authors who want to
661provide AnyEvent compatibility. 973provide AnyEvent compatibility.
717model it chooses. 1029model it chooses.
718 1030
719=item C<PERL_ANYEVENT_MODEL> 1031=item C<PERL_ANYEVENT_MODEL>
720 1032
721This can be used to specify the event model to be used by AnyEvent, before 1033This can be used to specify the event model to be used by AnyEvent, before
722autodetection and -probing kicks in. It must be a string consisting 1034auto detection and -probing kicks in. It must be a string consisting
723entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended 1035entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
724and the resulting module name is loaded and if the load was successful, 1036and the resulting module name is loaded and if the load was successful,
725used as event model. If it fails to load AnyEvent will proceed with 1037used as event model. If it fails to load AnyEvent will proceed with
726autodetection and -probing. 1038auto detection and -probing.
727 1039
728This functionality might change in future versions. 1040This functionality might change in future versions.
729 1041
730For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you 1042For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
731could start your program like this: 1043could start your program like this:
732 1044
733 PERL_ANYEVENT_MODEL=Perl perl ... 1045 PERL_ANYEVENT_MODEL=Perl perl ...
1046
1047=item C<PERL_ANYEVENT_PROTOCOLS>
1048
1049Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1050for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1051of auto probing).
1052
1053Must be set to a comma-separated list of protocols or address families,
1054current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1055used, and preference will be given to protocols mentioned earlier in the
1056list.
1057
1058This variable can effectively be used for denial-of-service attacks
1059against local programs (e.g. when setuid), although the impact is likely
1060small, as the program has to handle connection errors already-
1061
1062Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1063but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1064- only support IPv4, never try to resolve or contact IPv6
1065addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1066IPv6, but prefer IPv6 over IPv4.
1067
1068=item C<PERL_ANYEVENT_EDNS0>
1069
1070Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1071for DNS. This extension is generally useful to reduce DNS traffic, but
1072some (broken) firewalls drop such DNS packets, which is why it is off by
1073default.
1074
1075Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1076EDNS0 in its DNS requests.
734 1077
735=back 1078=back
736 1079
737=head1 EXAMPLE PROGRAM 1080=head1 EXAMPLE PROGRAM
738 1081
749 poll => 'r', 1092 poll => 'r',
750 cb => sub { 1093 cb => sub {
751 warn "io event <$_[0]>\n"; # will always output <r> 1094 warn "io event <$_[0]>\n"; # will always output <r>
752 chomp (my $input = <STDIN>); # read a line 1095 chomp (my $input = <STDIN>); # read a line
753 warn "read: $input\n"; # output what has been read 1096 warn "read: $input\n"; # output what has been read
754 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1097 $cv->send if $input =~ /^q/i; # quit program if /^q/i
755 }, 1098 },
756 ); 1099 );
757 1100
758 my $time_watcher; # can only be used once 1101 my $time_watcher; # can only be used once
759 1102
764 }); 1107 });
765 } 1108 }
766 1109
767 new_timer; # create first timer 1110 new_timer; # create first timer
768 1111
769 $cv->wait; # wait until user enters /^q/i 1112 $cv->recv; # wait until user enters /^q/i
770 1113
771=head1 REAL-WORLD EXAMPLE 1114=head1 REAL-WORLD EXAMPLE
772 1115
773Consider the L<Net::FCP> module. It features (among others) the following 1116Consider the L<Net::FCP> module. It features (among others) the following
774API calls, which are to freenet what HTTP GET requests are to http: 1117API calls, which are to freenet what HTTP GET requests are to http:
824 syswrite $txn->{fh}, $txn->{request} 1167 syswrite $txn->{fh}, $txn->{request}
825 or die "connection or write error"; 1168 or die "connection or write error";
826 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r }); 1169 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
827 1170
828Again, C<fh_ready_r> waits till all data has arrived, and then stores the 1171Again, C<fh_ready_r> waits till all data has arrived, and then stores the
829result and signals any possible waiters that the request ahs finished: 1172result and signals any possible waiters that the request has finished:
830 1173
831 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1174 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
832 1175
833 if (end-of-file or data complete) { 1176 if (end-of-file or data complete) {
834 $txn->{result} = $txn->{buf}; 1177 $txn->{result} = $txn->{buf};
835 $txn->{finished}->broadcast; 1178 $txn->{finished}->send;
836 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1179 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
837 } 1180 }
838 1181
839The C<result> method, finally, just waits for the finished signal (if the 1182The C<result> method, finally, just waits for the finished signal (if the
840request was already finished, it doesn't wait, of course, and returns the 1183request was already finished, it doesn't wait, of course, and returns the
841data: 1184data:
842 1185
843 $txn->{finished}->wait; 1186 $txn->{finished}->recv;
844 return $txn->{result}; 1187 return $txn->{result};
845 1188
846The actual code goes further and collects all errors (C<die>s, exceptions) 1189The actual code goes further and collects all errors (C<die>s, exceptions)
847that occured during request processing. The C<result> method detects 1190that occurred during request processing. The C<result> method detects
848whether an exception as thrown (it is stored inside the $txn object) 1191whether an exception as thrown (it is stored inside the $txn object)
849and just throws the exception, which means connection errors and other 1192and just throws the exception, which means connection errors and other
850problems get reported tot he code that tries to use the result, not in a 1193problems get reported tot he code that tries to use the result, not in a
851random callback. 1194random callback.
852 1195
883 1226
884 my $quit = AnyEvent->condvar; 1227 my $quit = AnyEvent->condvar;
885 1228
886 $fcp->txn_client_get ($url)->cb (sub { 1229 $fcp->txn_client_get ($url)->cb (sub {
887 ... 1230 ...
888 $quit->broadcast; 1231 $quit->send;
889 }); 1232 });
890 1233
891 $quit->wait; 1234 $quit->recv;
892 1235
893 1236
894=head1 BENCHMARK 1237=head1 BENCHMARKS
895 1238
896To give you an idea of the performance and overheads that AnyEvent adds 1239To give you an idea of the performance and overheads that AnyEvent adds
897over the event loops themselves (and to give you an impression of the 1240over the event loops themselves and to give you an impression of the speed
898speed of various event loops), here is a benchmark of various supported 1241of various event loops I prepared some benchmarks.
899event models natively and with anyevent. The benchmark creates a lot of 1242
900timers (with a zero timeout) and I/O watchers (watching STDOUT, a pty, to 1243=head2 BENCHMARKING ANYEVENT OVERHEAD
1244
1245Here is a benchmark of various supported event models used natively and
1246through AnyEvent. The benchmark creates a lot of timers (with a zero
1247timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
901become writable, which it is), lets them fire exactly once and destroys 1248which it is), lets them fire exactly once and destroys them again.
902them again.
903 1249
904Rewriting the benchmark to use many different sockets instead of using 1250Source code for this benchmark is found as F<eg/bench> in the AnyEvent
905the same filehandle for all I/O watchers results in a much longer runtime 1251distribution.
906(socket creation is expensive), but qualitatively the same figures, so it
907was not used.
908 1252
909=head2 Explanation of the columns 1253=head3 Explanation of the columns
910 1254
911I<watcher> is the number of event watchers created/destroyed. Since 1255I<watcher> is the number of event watchers created/destroyed. Since
912different event models feature vastly different performances, each event 1256different event models feature vastly different performances, each event
913loop was given a number of watchers so that overall runtime is acceptable 1257loop was given a number of watchers so that overall runtime is acceptable
914and similar between tested event loop (and keep them from crashing): Glib 1258and similar between tested event loop (and keep them from crashing): Glib
924all watchers, to avoid adding memory overhead. That means closure creation 1268all watchers, to avoid adding memory overhead. That means closure creation
925and memory usage is not included in the figures. 1269and memory usage is not included in the figures.
926 1270
927I<invoke> is the time, in microseconds, used to invoke a simple 1271I<invoke> is the time, in microseconds, used to invoke a simple
928callback. The callback simply counts down a Perl variable and after it was 1272callback. The callback simply counts down a Perl variable and after it was
929invoked "watcher" times, it would C<< ->broadcast >> a condvar once to 1273invoked "watcher" times, it would C<< ->send >> a condvar once to
930signal the end of this phase. 1274signal the end of this phase.
931 1275
932I<destroy> is the time, in microseconds, that it takes to destroy a single 1276I<destroy> is the time, in microseconds, that it takes to destroy a single
933watcher. 1277watcher.
934 1278
935=head2 Results 1279=head3 Results
936 1280
937 name watchers bytes create invoke destroy comment 1281 name watchers bytes create invoke destroy comment
938 EV/EV 400000 244 0.56 0.46 0.31 EV native interface 1282 EV/EV 400000 244 0.56 0.46 0.31 EV native interface
939 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers 1283 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
940 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal 1284 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
941 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation 1285 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
942 Event/Event 16000 516 31.88 31.30 0.85 Event native interface 1286 Event/Event 16000 516 31.88 31.30 0.85 Event native interface
943 Event/Any 16000 936 39.17 33.63 1.43 Event + AnyEvent watchers 1287 Event/Any 16000 590 35.75 31.42 1.08 Event + AnyEvent watchers
944 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour 1288 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
945 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers 1289 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
946 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event 1290 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
947 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select 1291 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
948 1292
949=head2 Discussion 1293=head3 Discussion
950 1294
951The benchmark does I<not> measure scalability of the event loop very 1295The benchmark does I<not> measure scalability of the event loop very
952well. For example, a select-based event loop (such as the pure perl one) 1296well. For example, a select-based event loop (such as the pure perl one)
953can never compete with an event loop that uses epoll when the number of 1297can never compete with an event loop that uses epoll when the number of
954file descriptors grows high. In this benchmark, all events become ready at 1298file descriptors grows high. In this benchmark, all events become ready at
955the same time, so select/poll-based implementations get an unnatural speed 1299the same time, so select/poll-based implementations get an unnatural speed
956boost. 1300boost.
957 1301
1302Also, note that the number of watchers usually has a nonlinear effect on
1303overall speed, that is, creating twice as many watchers doesn't take twice
1304the time - usually it takes longer. This puts event loops tested with a
1305higher number of watchers at a disadvantage.
1306
1307To put the range of results into perspective, consider that on the
1308benchmark machine, handling an event takes roughly 1600 CPU cycles with
1309EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1310cycles with POE.
1311
958C<EV> is the sole leader regarding speed and memory use, which are both 1312C<EV> is the sole leader regarding speed and memory use, which are both
959maximal/minimal, respectively. Even when going through AnyEvent, it uses 1313maximal/minimal, respectively. Even when going through AnyEvent, it uses
960far less memory than any other event loop and is still faster than Event 1314far less memory than any other event loop and is still faster than Event
961natively. 1315natively.
962 1316
963The pure perl implementation is hit in a few sweet spots (both the 1317The pure perl implementation is hit in a few sweet spots (both the
964zero timeout and the use of a single fd hit optimisations in the perl 1318constant timeout and the use of a single fd hit optimisations in the perl
965interpreter and the backend itself, and all watchers become ready at the 1319interpreter and the backend itself). Nevertheless this shows that it
966same time). Nevertheless this shows that it adds very little overhead in 1320adds very little overhead in itself. Like any select-based backend its
967itself. Like any select-based backend its performance becomes really bad 1321performance becomes really bad with lots of file descriptors (and few of
968with lots of file descriptors (and few of them active), of course, but 1322them active), of course, but this was not subject of this benchmark.
969this was not subject of this benchmark.
970 1323
971The C<Event> module has a relatively high setup and callback invocation cost, 1324The C<Event> module has a relatively high setup and callback invocation
972but overall scores on the third place. 1325cost, but overall scores in on the third place.
973 1326
974C<Glib>'s memory usage is quite a bit bit higher, but it features a 1327C<Glib>'s memory usage is quite a bit higher, but it features a
975faster callback invocation and overall ends up in the same class as 1328faster callback invocation and overall ends up in the same class as
976C<Event>. However, Glib scales extremely badly, doubling the number of 1329C<Event>. However, Glib scales extremely badly, doubling the number of
977watchers increases the processing time by more than a factor of four, 1330watchers increases the processing time by more than a factor of four,
978making it completely unusable when using larger numbers of watchers 1331making it completely unusable when using larger numbers of watchers
979(note that only a single file descriptor was used in the benchmark, so 1332(note that only a single file descriptor was used in the benchmark, so
982The C<Tk> adaptor works relatively well. The fact that it crashes with 1335The C<Tk> adaptor works relatively well. The fact that it crashes with
983more than 2000 watchers is a big setback, however, as correctness takes 1336more than 2000 watchers is a big setback, however, as correctness takes
984precedence over speed. Nevertheless, its performance is surprising, as the 1337precedence over speed. Nevertheless, its performance is surprising, as the
985file descriptor is dup()ed for each watcher. This shows that the dup() 1338file descriptor is dup()ed for each watcher. This shows that the dup()
986employed by some adaptors is not a big performance issue (it does incur a 1339employed by some adaptors is not a big performance issue (it does incur a
987hidden memory cost inside the kernel, though, that is not reflected in the 1340hidden memory cost inside the kernel which is not reflected in the figures
988figures above). 1341above).
989 1342
990C<POE>, regardless of underlying event loop (wether using its pure perl 1343C<POE>, regardless of underlying event loop (whether using its pure perl
991select-based backend or the Event module) shows abysmal performance and 1344select-based backend or the Event module, the POE-EV backend couldn't
1345be tested because it wasn't working) shows abysmal performance and
992memory usage: Watchers use almost 30 times as much memory as EV watchers, 1346memory usage with AnyEvent: Watchers use almost 30 times as much memory
993and 10 times as much memory as both Event or EV via AnyEvent. Watcher 1347as EV watchers, and 10 times as much memory as Event (the high memory
1348requirements are caused by requiring a session for each watcher). Watcher
994invocation is almost 900 times slower than with AnyEvent's pure perl 1349invocation speed is almost 900 times slower than with AnyEvent's pure perl
1350implementation.
1351
995implementation. The design of the POE adaptor class in AnyEvent can not 1352The design of the POE adaptor class in AnyEvent can not really account
996really account for this, as session creation overhead is small compared 1353for the performance issues, though, as session creation overhead is
997to execution of the state machine, which is coded pretty optimally within 1354small compared to execution of the state machine, which is coded pretty
998L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow. 1355optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
1356using multiple sessions is not a good approach, especially regarding
1357memory usage, even the author of POE could not come up with a faster
1358design).
999 1359
1000=head2 Summary 1360=head3 Summary
1001 1361
1362=over 4
1363
1002Using EV through AnyEvent is faster than any other event loop, but most 1364=item * Using EV through AnyEvent is faster than any other event loop
1003event loops have acceptable performance with or without AnyEvent. 1365(even when used without AnyEvent), but most event loops have acceptable
1366performance with or without AnyEvent.
1004 1367
1005The overhead AnyEvent adds is usually much smaller than the overhead of 1368=item * The overhead AnyEvent adds is usually much smaller than the overhead of
1006the actual event loop, only with extremely fast event loops such as the EV 1369the actual event loop, only with extremely fast event loops such as EV
1007adds AnyEvent significant overhead. 1370adds AnyEvent significant overhead.
1008 1371
1009And you should simply avoid POE like the plague if you want performance or 1372=item * You should avoid POE like the plague if you want performance or
1010reasonable memory usage. 1373reasonable memory usage.
1011 1374
1375=back
1376
1377=head2 BENCHMARKING THE LARGE SERVER CASE
1378
1379This benchmark actually benchmarks the event loop itself. It works by
1380creating a number of "servers": each server consists of a socket pair, a
1381timeout watcher that gets reset on activity (but never fires), and an I/O
1382watcher waiting for input on one side of the socket. Each time the socket
1383watcher reads a byte it will write that byte to a random other "server".
1384
1385The effect is that there will be a lot of I/O watchers, only part of which
1386are active at any one point (so there is a constant number of active
1387fds for each loop iteration, but which fds these are is random). The
1388timeout is reset each time something is read because that reflects how
1389most timeouts work (and puts extra pressure on the event loops).
1390
1391In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1392(1%) are active. This mirrors the activity of large servers with many
1393connections, most of which are idle at any one point in time.
1394
1395Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1396distribution.
1397
1398=head3 Explanation of the columns
1399
1400I<sockets> is the number of sockets, and twice the number of "servers" (as
1401each server has a read and write socket end).
1402
1403I<create> is the time it takes to create a socket pair (which is
1404nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1405
1406I<request>, the most important value, is the time it takes to handle a
1407single "request", that is, reading the token from the pipe and forwarding
1408it to another server. This includes deleting the old timeout and creating
1409a new one that moves the timeout into the future.
1410
1411=head3 Results
1412
1413 name sockets create request
1414 EV 20000 69.01 11.16
1415 Perl 20000 73.32 35.87
1416 Event 20000 212.62 257.32
1417 Glib 20000 651.16 1896.30
1418 POE 20000 349.67 12317.24 uses POE::Loop::Event
1419
1420=head3 Discussion
1421
1422This benchmark I<does> measure scalability and overall performance of the
1423particular event loop.
1424
1425EV is again fastest. Since it is using epoll on my system, the setup time
1426is relatively high, though.
1427
1428Perl surprisingly comes second. It is much faster than the C-based event
1429loops Event and Glib.
1430
1431Event suffers from high setup time as well (look at its code and you will
1432understand why). Callback invocation also has a high overhead compared to
1433the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
1434uses select or poll in basically all documented configurations.
1435
1436Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
1437clearly fails to perform with many filehandles or in busy servers.
1438
1439POE is still completely out of the picture, taking over 1000 times as long
1440as EV, and over 100 times as long as the Perl implementation, even though
1441it uses a C-based event loop in this case.
1442
1443=head3 Summary
1444
1445=over 4
1446
1447=item * The pure perl implementation performs extremely well.
1448
1449=item * Avoid Glib or POE in large projects where performance matters.
1450
1451=back
1452
1453=head2 BENCHMARKING SMALL SERVERS
1454
1455While event loops should scale (and select-based ones do not...) even to
1456large servers, most programs we (or I :) actually write have only a few
1457I/O watchers.
1458
1459In this benchmark, I use the same benchmark program as in the large server
1460case, but it uses only eight "servers", of which three are active at any
1461one time. This should reflect performance for a small server relatively
1462well.
1463
1464The columns are identical to the previous table.
1465
1466=head3 Results
1467
1468 name sockets create request
1469 EV 16 20.00 6.54
1470 Perl 16 25.75 12.62
1471 Event 16 81.27 35.86
1472 Glib 16 32.63 15.48
1473 POE 16 261.87 276.28 uses POE::Loop::Event
1474
1475=head3 Discussion
1476
1477The benchmark tries to test the performance of a typical small
1478server. While knowing how various event loops perform is interesting, keep
1479in mind that their overhead in this case is usually not as important, due
1480to the small absolute number of watchers (that is, you need efficiency and
1481speed most when you have lots of watchers, not when you only have a few of
1482them).
1483
1484EV is again fastest.
1485
1486Perl again comes second. It is noticeably faster than the C-based event
1487loops Event and Glib, although the difference is too small to really
1488matter.
1489
1490POE also performs much better in this case, but is is still far behind the
1491others.
1492
1493=head3 Summary
1494
1495=over 4
1496
1497=item * C-based event loops perform very well with small number of
1498watchers, as the management overhead dominates.
1499
1500=back
1501
1012 1502
1013=head1 FORK 1503=head1 FORK
1014 1504
1015Most event libraries are not fork-safe. The ones who are usually are 1505Most event libraries are not fork-safe. The ones who are usually are
1016because they are so inefficient. Only L<EV> is fully fork-aware. 1506because they rely on inefficient but fork-safe C<select> or C<poll>
1507calls. Only L<EV> is fully fork-aware.
1017 1508
1018If you have to fork, you must either do so I<before> creating your first 1509If you have to fork, you must either do so I<before> creating your first
1019watcher OR you must not use AnyEvent at all in the child. 1510watcher OR you must not use AnyEvent at all in the child.
1020 1511
1021 1512
1033 1524
1034 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} } 1525 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
1035 1526
1036 use AnyEvent; 1527 use AnyEvent;
1037 1528
1529Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
1530be used to probe what backend is used and gain other information (which is
1531probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
1532
1038 1533
1039=head1 SEE ALSO 1534=head1 SEE ALSO
1040 1535
1041Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>, 1536Utility functions: L<AnyEvent::Util>.
1042L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>, 1537
1538Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1043L<Event::Lib>, L<Qt>, L<POE>. 1539L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1044 1540
1045Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>, 1541Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1046L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>, 1542L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1047L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>, 1543L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1048L<AnyEvent::Impl::Qt>, L<AnyEvent::Impl::POE>. 1544L<AnyEvent::Impl::POE>.
1049 1545
1546Non-blocking file handles, sockets, TCP clients and
1547servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1548
1549Asynchronous DNS: L<AnyEvent::DNS>.
1550
1551Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1552
1050Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1553Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1051 1554
1052 1555
1053=head1 AUTHOR 1556=head1 AUTHOR
1054 1557
1055 Marc Lehmann <schmorp@schmorp.de> 1558 Marc Lehmann <schmorp@schmorp.de>

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines