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.140 by root, Mon May 26 06:18:53 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 (or calling the condition variable as if it
317were a callback, read about the caveats in the description for the C<<
318->send >> method).
303 319
304They are very useful to signal that a condition has been fulfilled, for 320Condition variables are similar to callbacks, except that you can
321optionally wait for them. They can also be called merge points - points
322in time where multiple outstanding events have been processed. And yet
323another way to call them is transactions - each condition variable can be
324used to represent a transaction, which finishes at some point and delivers
325a result.
326
327Condition variables are very useful to signal that something has finished,
305example, if you write a module that does asynchronous http requests, 328for example, if you write a module that does asynchronous http requests,
306then a condition variable would be the ideal candidate to signal the 329then a condition variable would be the ideal candidate to signal the
307availability of results. 330availability of results. The user can either act when the callback is
331called or can synchronously C<< ->recv >> for the results.
308 332
309You can also use condition variables to block your main program until 333You can also use them to simulate traditional event loops - for example,
310an event occurs - for example, you could C<< ->wait >> in your main 334you 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<< 335could C<< ->recv >> in your main program until the user clicks the Quit
312->broadcast >> the "quit" event. 336button of your app, which would C<< ->send >> the "quit" event.
313 337
314Note that condition variables recurse into the event loop - if you have 338Note 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 339two 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 340lose. Therefore, condition variables are good to export to your caller, but
317you should avoid making a blocking wait yourself, at least in callbacks, 341you should avoid making a blocking wait yourself, at least in callbacks,
318as this asks for trouble. 342as this asks for trouble.
319 343
320This object has two methods: 344Condition variables are represented by hash refs in perl, and the keys
345used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
346easy (it is often useful to build your own transaction class on top of
347AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
348it's C<new> method in your own C<new> method.
349
350There are two "sides" to a condition variable - the "producer side" which
351eventually calls C<< -> send >>, and the "consumer side", which waits
352for the send to occur.
353
354Example: wait for a timer.
355
356 # wait till the result is ready
357 my $result_ready = AnyEvent->condvar;
358
359 # do something such as adding a timer
360 # or socket watcher the calls $result_ready->send
361 # when the "result" is ready.
362 # in this case, we simply use a timer:
363 my $w = AnyEvent->timer (
364 after => 1,
365 cb => sub { $result_ready->send },
366 );
367
368 # this "blocks" (while handling events) till the callback
369 # calls send
370 $result_ready->recv;
371
372Example: wait for a timer, but take advantage of the fact that
373condition variables are also code references.
374
375 my $done = AnyEvent->condvar;
376 my $delay = AnyEvent->timer (after => 5, cb => $done);
377 $done->recv;
378
379=head3 METHODS FOR PRODUCERS
380
381These methods should only be used by the producing side, i.e. the
382code/module that eventually sends the signal. Note that it is also
383the producer side which creates the condvar in most cases, but it isn't
384uncommon for the consumer to create it as well.
321 385
322=over 4 386=over 4
323 387
388=item $cv->send (...)
389
390Flag the condition as ready - a running C<< ->recv >> and all further
391calls to C<recv> will (eventually) return after this method has been
392called. If nobody is waiting the send will be remembered.
393
394If a callback has been set on the condition variable, it is called
395immediately from within send.
396
397Any arguments passed to the C<send> call will be returned by all
398future C<< ->recv >> calls.
399
400Condition variables are overloaded so one can call them directly
401(as a code reference). Calling them directly is the same as calling
402C<send>. Note, however, that many C-based event loops do not handle
403overloading, so as tempting as it may be, passing a condition variable
404instead of a callback does not work. Both the pure perl and EV loops
405support overloading, however, as well as all functions that use perl to
406invoke a callback (as in L<AnyEvent::Socket> and L<AnyEvent::DNS> for
407example).
408
409=item $cv->croak ($error)
410
411Similar to send, but causes all call's to C<< ->recv >> to invoke
412C<Carp::croak> with the given error message/object/scalar.
413
414This can be used to signal any errors to the condition variable
415user/consumer.
416
417=item $cv->begin ([group callback])
418
324=item $cv->wait 419=item $cv->end
325 420
326Wait (blocking if necessary) until the C<< ->broadcast >> method has been 421These two methods are EXPERIMENTAL and MIGHT CHANGE.
422
423These two methods can be used to combine many transactions/events into
424one. For example, a function that pings many hosts in parallel might want
425to use a condition variable for the whole process.
426
427Every call to C<< ->begin >> will increment a counter, and every call to
428C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
429>>, the (last) callback passed to C<begin> will be executed. That callback
430is I<supposed> to call C<< ->send >>, but that is not required. If no
431callback was set, C<send> will be called without any arguments.
432
433Let's clarify this with the ping example:
434
435 my $cv = AnyEvent->condvar;
436
437 my %result;
438 $cv->begin (sub { $cv->send (\%result) });
439
440 for my $host (@list_of_hosts) {
441 $cv->begin;
442 ping_host_then_call_callback $host, sub {
443 $result{$host} = ...;
444 $cv->end;
445 };
446 }
447
448 $cv->end;
449
450This code fragment supposedly pings a number of hosts and calls
451C<send> after results for all then have have been gathered - in any
452order. To achieve this, the code issues a call to C<begin> when it starts
453each ping request and calls C<end> when it has received some result for
454it. Since C<begin> and C<end> only maintain a counter, the order in which
455results arrive is not relevant.
456
457There is an additional bracketing call to C<begin> and C<end> outside the
458loop, which serves two important purposes: first, it sets the callback
459to be called once the counter reaches C<0>, and second, it ensures that
460C<send> is called even when C<no> hosts are being pinged (the loop
461doesn't execute once).
462
463This is the general pattern when you "fan out" into multiple subrequests:
464use an outer C<begin>/C<end> pair to set the callback and ensure C<end>
465is called at least once, and then, for each subrequest you start, call
466C<begin> and for each subrequest you finish, call C<end>.
467
468=back
469
470=head3 METHODS FOR CONSUMERS
471
472These methods should only be used by the consuming side, i.e. the
473code awaits the condition.
474
475=over 4
476
477=item $cv->recv
478
479Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
327called on c<$cv>, while servicing other watchers normally. 480>> methods have been called on c<$cv>, while servicing other watchers
481normally.
328 482
329You can only wait once on a condition - additional calls will return 483You can only wait once on a condition - additional calls are valid but
330immediately. 484will return immediately.
485
486If an error condition has been set by calling C<< ->croak >>, then this
487function will call C<croak>.
488
489In list context, all parameters passed to C<send> will be returned,
490in scalar context only the first one will be returned.
331 491
332Not all event models support a blocking wait - some die in that case 492Not 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 493(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 494using 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 495caller decide whether the call will block or not (for example, by coupling
336condition variables with some kind of request results and supporting 496condition variables with some kind of request results and supporting
337callbacks so the caller knows that getting the result will not block, 497callbacks so the caller knows that getting the result will not block,
338while still suppporting blocking waits if the caller so desires). 498while still supporting blocking waits if the caller so desires).
339 499
340Another reason I<never> to C<< ->wait >> in a module is that you cannot 500Another 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 501sensibly have two C<< ->recv >>'s in parallel, as that would require
342multiple interpreters or coroutines/threads, none of which C<AnyEvent> 502multiple interpreters or coroutines/threads, none of which C<AnyEvent>
343can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and 503can supply.
344L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
345from different coroutines, however).
346 504
347=item $cv->broadcast 505The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
506fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
507versions and also integrates coroutines into AnyEvent, making blocking
508C<< ->recv >> calls perfectly safe as long as they are done from another
509coroutine (one that doesn't run the event loop).
348 510
349Flag the condition as ready - a running C<< ->wait >> and all further 511You can ensure that C<< -recv >> never blocks by setting a callback and
350calls to C<wait> will (eventually) return after this method has been 512only calling C<< ->recv >> from within that callback (or at a later
351called. If nobody is waiting the broadcast will be remembered.. 513time). This will work even when the event loop does not support blocking
514waits otherwise.
515
516=item $bool = $cv->ready
517
518Returns true when the condition is "true", i.e. whether C<send> or
519C<croak> have been called.
520
521=item $cb = $cv->cb ([new callback])
522
523This is a mutator function that returns the callback set and optionally
524replaces it before doing so.
525
526The callback will be called when the condition becomes "true", i.e. when
527C<send> or C<croak> are called. Calling C<recv> inside the callback
528or at any later time is guaranteed not to block.
352 529
353=back 530=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 531
373=head1 GLOBAL VARIABLES AND FUNCTIONS 532=head1 GLOBAL VARIABLES AND FUNCTIONS
374 533
375=over 4 534=over 4
376 535
382C<AnyEvent::Impl:xxx> modules, but can be any other class in the case 541C<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>). 542AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
384 543
385The known classes so far are: 544The known classes so far are:
386 545
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). 546 AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
390 AnyEvent::Impl::Event based on Event, second best choice. 547 AnyEvent::Impl::Event based on Event, second best choice.
548 AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
391 AnyEvent::Impl::Glib based on Glib, third-best choice. 549 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. 550 AnyEvent::Impl::Tk based on Tk, very bad choice.
394 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs). 551 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
395 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse. 552 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
396 AnyEvent::Impl::POE based on POE, not generic enough for full support. 553 AnyEvent::Impl::POE based on POE, not generic enough for full support.
397 554
410Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model 567Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
411if necessary. You should only call this function right before you would 568if necessary. You should only call this function right before you would
412have created an AnyEvent watcher anyway, that is, as late as possible at 569have created an AnyEvent watcher anyway, that is, as late as possible at
413runtime. 570runtime.
414 571
572=item $guard = AnyEvent::post_detect { BLOCK }
573
574Arranges for the code block to be executed as soon as the event model is
575autodetected (or immediately if this has already happened).
576
577If called in scalar or list context, then it creates and returns an object
578that automatically removes the callback again when it is destroyed. See
579L<Coro::BDB> for a case where this is useful.
580
581=item @AnyEvent::post_detect
582
583If there are any code references in this array (you can C<push> to it
584before or after loading AnyEvent), then they will called directly after
585the event loop has been chosen.
586
587You should check C<$AnyEvent::MODEL> before adding to this array, though:
588if it contains a true value then the event loop has already been detected,
589and the array will be ignored.
590
591Best use C<AnyEvent::post_detect { BLOCK }> instead.
592
415=back 593=back
416 594
417=head1 WHAT TO DO IN A MODULE 595=head1 WHAT TO DO IN A MODULE
418 596
419As a module author, you should C<use AnyEvent> and call AnyEvent methods 597As a module author, you should C<use AnyEvent> and call AnyEvent methods
422Be careful when you create watchers in the module body - AnyEvent will 600Be 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 601decide 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 602by calling AnyEvent in your module body you force the user of your module
425to load the event module first. 603to load the event module first.
426 604
427Never call C<< ->wait >> on a condition variable unless you I<know> that 605Never call C<< ->recv >> on a condition variable unless you I<know> that
428the C<< ->broadcast >> method has been called on it already. This is 606the C<< ->send >> method has been called on it already. This is
429because it will stall the whole program, and the whole point of using 607because it will stall the whole program, and the whole point of using
430events is to stay interactive. 608events is to stay interactive.
431 609
432It is fine, however, to call C<< ->wait >> when the user of your module 610It 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 611requests 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 >> 612called C<results> that returns the results, it should call C<< ->recv >>
435freely, as the user of your module knows what she is doing. always). 613freely, as the user of your module knows what she is doing. always).
436 614
437=head1 WHAT TO DO IN THE MAIN PROGRAM 615=head1 WHAT TO DO IN THE MAIN PROGRAM
438 616
439There will always be a single main program - the only place that should 617There will always be a single main program - the only place that should
441 619
442If it doesn't care, it can just "use AnyEvent" and use it itself, or not 620If it doesn't care, it can just "use AnyEvent" and use it itself, or not
443do anything special (it does not need to be event-based) and let AnyEvent 621do anything special (it does not need to be event-based) and let AnyEvent
444decide which implementation to chose if some module relies on it. 622decide which implementation to chose if some module relies on it.
445 623
446If the main program relies on a specific event model. For example, in 624If the main program relies on a specific event model - for example, in
447Gtk2 programs you have to rely on the Glib module. You should load the 625Gtk2 programs you have to rely on the Glib module - you should load the
448event module before loading AnyEvent or any module that uses it: generally 626event module before loading AnyEvent or any module that uses it: generally
449speaking, you should load it as early as possible. The reason is that 627speaking, you should load it as early as possible. The reason is that
450modules might create watchers when they are loaded, and AnyEvent will 628modules might create watchers when they are loaded, and AnyEvent will
451decide on the event model to use as soon as it creates watchers, and it 629decide on the event model to use as soon as it creates watchers, and it
452might chose the wrong one unless you load the correct one yourself. 630might chose the wrong one unless you load the correct one yourself.
453 631
454You can chose to use a rather inefficient pure-perl implementation by 632You can chose to use a pure-perl implementation by loading the
455loading the C<AnyEvent::Impl::Perl> module, which gives you similar 633C<AnyEvent::Impl::Perl> module, which gives you similar behaviour
456behaviour everywhere, but letting AnyEvent chose is generally better. 634everywhere, but letting AnyEvent chose the model is generally better.
635
636=head2 MAINLOOP EMULATION
637
638Sometimes (often for short test scripts, or even standalone programs who
639only want to use AnyEvent), you do not want to run a specific event loop.
640
641In that case, you can use a condition variable like this:
642
643 AnyEvent->condvar->recv;
644
645This has the effect of entering the event loop and looping forever.
646
647Note that usually your program has some exit condition, in which case
648it is better to use the "traditional" approach of storing a condition
649variable somewhere, waiting for it, and sending it when the program should
650exit cleanly.
651
652
653=head1 OTHER MODULES
654
655The following is a non-exhaustive list of additional modules that use
656AnyEvent and can therefore be mixed easily with other AnyEvent modules
657in the same program. Some of the modules come with AnyEvent, some are
658available via CPAN.
659
660=over 4
661
662=item L<AnyEvent::Util>
663
664Contains various utility functions that replace often-used but blocking
665functions such as C<inet_aton> by event-/callback-based versions.
666
667=item L<AnyEvent::Handle>
668
669Provide read and write buffers and manages watchers for reads and writes.
670
671=item L<AnyEvent::Socket>
672
673Provides various utility functions for (internet protocol) sockets,
674addresses and name resolution. Also functions to create non-blocking tcp
675connections or tcp servers, with IPv6 and SRV record support and more.
676
677=item L<AnyEvent::DNS>
678
679Provides rich asynchronous DNS resolver capabilities.
680
681=item L<AnyEvent::HTTPD>
682
683Provides a simple web application server framework.
684
685=item L<AnyEvent::FastPing>
686
687The fastest ping in the west.
688
689=item L<Net::IRC3>
690
691AnyEvent based IRC client module family.
692
693=item L<Net::XMPP2>
694
695AnyEvent based XMPP (Jabber protocol) module family.
696
697=item L<Net::FCP>
698
699AnyEvent-based implementation of the Freenet Client Protocol, birthplace
700of AnyEvent.
701
702=item L<Event::ExecFlow>
703
704High level API for event-based execution flow control.
705
706=item L<Coro>
707
708Has special support for AnyEvent via L<Coro::AnyEvent>.
709
710=item L<AnyEvent::AIO>, L<IO::AIO>
711
712Truly asynchronous I/O, should be in the toolbox of every event
713programmer. AnyEvent::AIO transparently fuses IO::AIO and AnyEvent
714together.
715
716=item L<AnyEvent::BDB>, L<BDB>
717
718Truly asynchronous Berkeley DB access. AnyEvent::AIO transparently fuses
719IO::AIO and AnyEvent together.
720
721=item L<IO::Lambda>
722
723The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
724
725=back
457 726
458=cut 727=cut
459 728
460package AnyEvent; 729package AnyEvent;
461 730
462no warnings; 731no warnings;
463use strict; 732use strict;
464 733
465use Carp; 734use Carp;
466 735
467our $VERSION = '3.3'; 736our $VERSION = '4.04';
468our $MODEL; 737our $MODEL;
469 738
470our $AUTOLOAD; 739our $AUTOLOAD;
471our @ISA; 740our @ISA;
472 741
742our @REGISTRY;
743
744our $WIN32;
745
746BEGIN {
747 my $win32 = ! ! ($^O =~ /mswin32/i);
748 eval "sub WIN32(){ $win32 }";
749}
750
473our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 751our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
474 752
475our @REGISTRY; 753our %PROTOCOL; # (ipv4|ipv6) => (1|2), higher numbers are preferred
754
755{
756 my $idx;
757 $PROTOCOL{$_} = ++$idx
758 for reverse split /\s*,\s*/,
759 $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
760}
476 761
477my @models = ( 762my @models = (
478 [Coro::EV:: => AnyEvent::Impl::CoroEV::],
479 [Coro::Event:: => AnyEvent::Impl::CoroEvent::],
480 [EV:: => AnyEvent::Impl::EV::], 763 [EV:: => AnyEvent::Impl::EV::],
481 [Event:: => AnyEvent::Impl::Event::], 764 [Event:: => AnyEvent::Impl::Event::],
482 [Glib:: => AnyEvent::Impl::Glib::],
483 [Tk:: => AnyEvent::Impl::Tk::],
484 [Wx:: => AnyEvent::Impl::POE::],
485 [Prima:: => AnyEvent::Impl::POE::],
486 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::], 765 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
487 # everything below here will not be autoprobed as the pureperl backend should work everywhere 766 # everything below here will not be autoprobed
767 # as the pureperl backend should work everywhere
768 # and is usually faster
769 [Tk:: => AnyEvent::Impl::Tk::], # crashes with many handles
770 [Glib:: => AnyEvent::Impl::Glib::], # becomes extremely slow with many watchers
488 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy 771 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
489 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program 772 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
490 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza 773 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
774 [Wx:: => AnyEvent::Impl::POE::],
775 [Prima:: => AnyEvent::Impl::POE::],
491); 776);
492 777
493our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY); 778our %method = map +($_ => 1), qw(io timer signal child condvar one_event DESTROY);
779
780our @post_detect;
781
782sub post_detect(&) {
783 my ($cb) = @_;
784
785 if ($MODEL) {
786 $cb->();
787
788 1
789 } else {
790 push @post_detect, $cb;
791
792 defined wantarray
793 ? bless \$cb, "AnyEvent::Util::PostDetect"
794 : ()
795 }
796}
797
798sub AnyEvent::Util::PostDetect::DESTROY {
799 @post_detect = grep $_ != ${$_[0]}, @post_detect;
800}
494 801
495sub detect() { 802sub detect() {
496 unless ($MODEL) { 803 unless ($MODEL) {
497 no strict 'refs'; 804 no strict 'refs';
805 local $SIG{__DIE__};
498 806
499 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) { 807 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) {
500 my $model = "AnyEvent::Impl::$1"; 808 my $model = "AnyEvent::Impl::$1";
501 if (eval "require $model") { 809 if (eval "require $model") {
502 $MODEL = $model; 810 $MODEL = $model;
532 last; 840 last;
533 } 841 }
534 } 842 }
535 843
536 $MODEL 844 $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."; 845 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.";
538 } 846 }
539 } 847 }
540 848
541 unshift @ISA, $MODEL; 849 unshift @ISA, $MODEL;
542 push @{"$MODEL\::ISA"}, "AnyEvent::Base"; 850 push @{"$MODEL\::ISA"}, "AnyEvent::Base";
851
852 (shift @post_detect)->() while @post_detect;
543 } 853 }
544 854
545 $MODEL 855 $MODEL
546} 856}
547 857
557 $class->$func (@_); 867 $class->$func (@_);
558} 868}
559 869
560package AnyEvent::Base; 870package AnyEvent::Base;
561 871
562# default implementation for ->condvar, ->wait, ->broadcast 872# default implementation for ->condvar
563 873
564sub condvar { 874sub condvar {
565 bless \my $flag, "AnyEvent::Base::CondVar" 875 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} 876}
575 877
576# default implementation for ->signal 878# default implementation for ->signal
577 879
578our %SIG_CB; 880our %SIG_CB;
631 or Carp::croak "required option 'pid' is missing"; 933 or Carp::croak "required option 'pid' is missing";
632 934
633 $PID_CB{$pid}{$arg{cb}} = $arg{cb}; 935 $PID_CB{$pid}{$arg{cb}} = $arg{cb};
634 936
635 unless ($WNOHANG) { 937 unless ($WNOHANG) {
636 $WNOHANG = eval { require POSIX; &POSIX::WNOHANG } || 1; 938 $WNOHANG = eval { local $SIG{__DIE__}; require POSIX; &POSIX::WNOHANG } || 1;
637 } 939 }
638 940
639 unless ($CHLD_W) { 941 unless ($CHLD_W) {
640 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld); 942 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld);
641 # child could be a zombie already, so make at least one round 943 # child could be a zombie already, so make at least one round
651 delete $PID_CB{$pid}{$cb}; 953 delete $PID_CB{$pid}{$cb};
652 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 954 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
653 955
654 undef $CHLD_W unless keys %PID_CB; 956 undef $CHLD_W unless keys %PID_CB;
655} 957}
958
959package AnyEvent::CondVar;
960
961our @ISA = AnyEvent::CondVar::Base::;
962
963package AnyEvent::CondVar::Base;
964
965use overload
966 '&{}' => sub { my $self = shift; sub { $self->send (@_) } },
967 fallback => 1;
968
969sub _send {
970 # nop
971}
972
973sub send {
974 my $cv = shift;
975 $cv->{_ae_sent} = [@_];
976 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
977 $cv->_send;
978}
979
980sub croak {
981 $_[0]{_ae_croak} = $_[1];
982 $_[0]->send;
983}
984
985sub ready {
986 $_[0]{_ae_sent}
987}
988
989sub _wait {
990 AnyEvent->one_event while !$_[0]{_ae_sent};
991}
992
993sub recv {
994 $_[0]->_wait;
995
996 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
997 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
998}
999
1000sub cb {
1001 $_[0]{_ae_cb} = $_[1] if @_ > 1;
1002 $_[0]{_ae_cb}
1003}
1004
1005sub begin {
1006 ++$_[0]{_ae_counter};
1007 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
1008}
1009
1010sub end {
1011 return if --$_[0]{_ae_counter};
1012 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
1013}
1014
1015# undocumented/compatibility with pre-3.4
1016*broadcast = \&send;
1017*wait = \&_wait;
656 1018
657=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 1019=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
658 1020
659This is an advanced topic that you do not normally need to use AnyEvent in 1021This 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 1022a module. This section is only of use to event loop authors who want to
717model it chooses. 1079model it chooses.
718 1080
719=item C<PERL_ANYEVENT_MODEL> 1081=item C<PERL_ANYEVENT_MODEL>
720 1082
721This can be used to specify the event model to be used by AnyEvent, before 1083This 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 1084auto detection and -probing kicks in. It must be a string consisting
723entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended 1085entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
724and the resulting module name is loaded and if the load was successful, 1086and 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 1087used as event model. If it fails to load AnyEvent will proceed with
726autodetection and -probing. 1088auto detection and -probing.
727 1089
728This functionality might change in future versions. 1090This functionality might change in future versions.
729 1091
730For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you 1092For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
731could start your program like this: 1093could start your program like this:
732 1094
733 PERL_ANYEVENT_MODEL=Perl perl ... 1095 PERL_ANYEVENT_MODEL=Perl perl ...
1096
1097=item C<PERL_ANYEVENT_PROTOCOLS>
1098
1099Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1100for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1101of auto probing).
1102
1103Must be set to a comma-separated list of protocols or address families,
1104current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1105used, and preference will be given to protocols mentioned earlier in the
1106list.
1107
1108This variable can effectively be used for denial-of-service attacks
1109against local programs (e.g. when setuid), although the impact is likely
1110small, as the program has to handle connection errors already-
1111
1112Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1113but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1114- only support IPv4, never try to resolve or contact IPv6
1115addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1116IPv6, but prefer IPv6 over IPv4.
1117
1118=item C<PERL_ANYEVENT_EDNS0>
1119
1120Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1121for DNS. This extension is generally useful to reduce DNS traffic, but
1122some (broken) firewalls drop such DNS packets, which is why it is off by
1123default.
1124
1125Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1126EDNS0 in its DNS requests.
734 1127
735=back 1128=back
736 1129
737=head1 EXAMPLE PROGRAM 1130=head1 EXAMPLE PROGRAM
738 1131
749 poll => 'r', 1142 poll => 'r',
750 cb => sub { 1143 cb => sub {
751 warn "io event <$_[0]>\n"; # will always output <r> 1144 warn "io event <$_[0]>\n"; # will always output <r>
752 chomp (my $input = <STDIN>); # read a line 1145 chomp (my $input = <STDIN>); # read a line
753 warn "read: $input\n"; # output what has been read 1146 warn "read: $input\n"; # output what has been read
754 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1147 $cv->send if $input =~ /^q/i; # quit program if /^q/i
755 }, 1148 },
756 ); 1149 );
757 1150
758 my $time_watcher; # can only be used once 1151 my $time_watcher; # can only be used once
759 1152
764 }); 1157 });
765 } 1158 }
766 1159
767 new_timer; # create first timer 1160 new_timer; # create first timer
768 1161
769 $cv->wait; # wait until user enters /^q/i 1162 $cv->recv; # wait until user enters /^q/i
770 1163
771=head1 REAL-WORLD EXAMPLE 1164=head1 REAL-WORLD EXAMPLE
772 1165
773Consider the L<Net::FCP> module. It features (among others) the following 1166Consider the L<Net::FCP> module. It features (among others) the following
774API calls, which are to freenet what HTTP GET requests are to http: 1167API calls, which are to freenet what HTTP GET requests are to http:
824 syswrite $txn->{fh}, $txn->{request} 1217 syswrite $txn->{fh}, $txn->{request}
825 or die "connection or write error"; 1218 or die "connection or write error";
826 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r }); 1219 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
827 1220
828Again, C<fh_ready_r> waits till all data has arrived, and then stores the 1221Again, 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: 1222result and signals any possible waiters that the request has finished:
830 1223
831 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1224 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
832 1225
833 if (end-of-file or data complete) { 1226 if (end-of-file or data complete) {
834 $txn->{result} = $txn->{buf}; 1227 $txn->{result} = $txn->{buf};
835 $txn->{finished}->broadcast; 1228 $txn->{finished}->send;
836 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1229 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
837 } 1230 }
838 1231
839The C<result> method, finally, just waits for the finished signal (if the 1232The 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 1233request was already finished, it doesn't wait, of course, and returns the
841data: 1234data:
842 1235
843 $txn->{finished}->wait; 1236 $txn->{finished}->recv;
844 return $txn->{result}; 1237 return $txn->{result};
845 1238
846The actual code goes further and collects all errors (C<die>s, exceptions) 1239The actual code goes further and collects all errors (C<die>s, exceptions)
847that occured during request processing. The C<result> method detects 1240that occurred during request processing. The C<result> method detects
848whether an exception as thrown (it is stored inside the $txn object) 1241whether an exception as thrown (it is stored inside the $txn object)
849and just throws the exception, which means connection errors and other 1242and 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 1243problems get reported tot he code that tries to use the result, not in a
851random callback. 1244random callback.
852 1245
883 1276
884 my $quit = AnyEvent->condvar; 1277 my $quit = AnyEvent->condvar;
885 1278
886 $fcp->txn_client_get ($url)->cb (sub { 1279 $fcp->txn_client_get ($url)->cb (sub {
887 ... 1280 ...
888 $quit->broadcast; 1281 $quit->send;
889 }); 1282 });
890 1283
891 $quit->wait; 1284 $quit->recv;
892 1285
893 1286
894=head1 BENCHMARK 1287=head1 BENCHMARKS
895 1288
896To give you an idea of the performance and overheads that AnyEvent adds 1289To 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 1290over 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 1291of various event loops I prepared some benchmarks.
899event models natively and with anyevent. The benchmark creates a lot of 1292
900timers (with a zero timeout) and I/O watchers (watching STDOUT, a pty, to 1293=head2 BENCHMARKING ANYEVENT OVERHEAD
1294
1295Here is a benchmark of various supported event models used natively and
1296through AnyEvent. The benchmark creates a lot of timers (with a zero
1297timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
901become writable, which it is), lets them fire exactly once and destroys 1298which it is), lets them fire exactly once and destroys them again.
902them again.
903 1299
904Rewriting the benchmark to use many different sockets instead of using 1300Source 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 1301distribution.
906(socket creation is expensive), but qualitatively the same figures, so it
907was not used.
908 1302
909=head2 Explanation of the columns 1303=head3 Explanation of the columns
910 1304
911I<watcher> is the number of event watchers created/destroyed. Since 1305I<watcher> is the number of event watchers created/destroyed. Since
912different event models feature vastly different performances, each event 1306different event models feature vastly different performances, each event
913loop was given a number of watchers so that overall runtime is acceptable 1307loop was given a number of watchers so that overall runtime is acceptable
914and similar between tested event loop (and keep them from crashing): Glib 1308and similar between tested event loop (and keep them from crashing): Glib
924all watchers, to avoid adding memory overhead. That means closure creation 1318all watchers, to avoid adding memory overhead. That means closure creation
925and memory usage is not included in the figures. 1319and memory usage is not included in the figures.
926 1320
927I<invoke> is the time, in microseconds, used to invoke a simple 1321I<invoke> is the time, in microseconds, used to invoke a simple
928callback. The callback simply counts down a Perl variable and after it was 1322callback. The callback simply counts down a Perl variable and after it was
929invoked "watcher" times, it would C<< ->broadcast >> a condvar once to 1323invoked "watcher" times, it would C<< ->send >> a condvar once to
930signal the end of this phase. 1324signal the end of this phase.
931 1325
932I<destroy> is the time, in microseconds, that it takes to destroy a single 1326I<destroy> is the time, in microseconds, that it takes to destroy a single
933watcher. 1327watcher.
934 1328
935=head2 Results 1329=head3 Results
936 1330
937 name watchers bytes create invoke destroy comment 1331 name watchers bytes create invoke destroy comment
938 EV/EV 400000 244 0.56 0.46 0.31 EV native interface 1332 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 1333 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 1334 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 1335 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 1336 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 1337 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 1338 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 1339 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 1340 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 1341 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
948 1342
949=head2 Discussion 1343=head3 Discussion
950 1344
951The benchmark does I<not> measure scalability of the event loop very 1345The 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) 1346well. 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 1347can 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 1348file descriptors grows high. In this benchmark, all events become ready at
955the same time, so select/poll-based implementations get an unnatural speed 1349the same time, so select/poll-based implementations get an unnatural speed
956boost. 1350boost.
957 1351
1352Also, note that the number of watchers usually has a nonlinear effect on
1353overall speed, that is, creating twice as many watchers doesn't take twice
1354the time - usually it takes longer. This puts event loops tested with a
1355higher number of watchers at a disadvantage.
1356
1357To put the range of results into perspective, consider that on the
1358benchmark machine, handling an event takes roughly 1600 CPU cycles with
1359EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1360cycles with POE.
1361
958C<EV> is the sole leader regarding speed and memory use, which are both 1362C<EV> is the sole leader regarding speed and memory use, which are both
959maximal/minimal, respectively. Even when going through AnyEvent, it uses 1363maximal/minimal, respectively. Even when going through AnyEvent, it uses
960far less memory than any other event loop and is still faster than Event 1364far less memory than any other event loop and is still faster than Event
961natively. 1365natively.
962 1366
963The pure perl implementation is hit in a few sweet spots (both the 1367The 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 1368constant 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 1369interpreter and the backend itself). Nevertheless this shows that it
966same time). Nevertheless this shows that it adds very little overhead in 1370adds very little overhead in itself. Like any select-based backend its
967itself. Like any select-based backend its performance becomes really bad 1371performance becomes really bad with lots of file descriptors (and few of
968with lots of file descriptors (and few of them active), of course, but 1372them active), of course, but this was not subject of this benchmark.
969this was not subject of this benchmark.
970 1373
971The C<Event> module has a relatively high setup and callback invocation cost, 1374The C<Event> module has a relatively high setup and callback invocation
972but overall scores on the third place. 1375cost, but overall scores in on the third place.
973 1376
974C<Glib>'s memory usage is quite a bit bit higher, but it features a 1377C<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 1378faster callback invocation and overall ends up in the same class as
976C<Event>. However, Glib scales extremely badly, doubling the number of 1379C<Event>. However, Glib scales extremely badly, doubling the number of
977watchers increases the processing time by more than a factor of four, 1380watchers increases the processing time by more than a factor of four,
978making it completely unusable when using larger numbers of watchers 1381making it completely unusable when using larger numbers of watchers
979(note that only a single file descriptor was used in the benchmark, so 1382(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 1385The C<Tk> adaptor works relatively well. The fact that it crashes with
983more than 2000 watchers is a big setback, however, as correctness takes 1386more than 2000 watchers is a big setback, however, as correctness takes
984precedence over speed. Nevertheless, its performance is surprising, as the 1387precedence over speed. Nevertheless, its performance is surprising, as the
985file descriptor is dup()ed for each watcher. This shows that the dup() 1388file 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 1389employed 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 1390hidden memory cost inside the kernel which is not reflected in the figures
988figures above). 1391above).
989 1392
990C<POE>, regardless of underlying event loop (wether using its pure perl 1393C<POE>, regardless of underlying event loop (whether using its pure perl
991select-based backend or the Event module) shows abysmal performance and 1394select-based backend or the Event module, the POE-EV backend couldn't
1395be tested because it wasn't working) shows abysmal performance and
992memory usage: Watchers use almost 30 times as much memory as EV watchers, 1396memory 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 1397as EV watchers, and 10 times as much memory as Event (the high memory
1398requirements are caused by requiring a session for each watcher). Watcher
994invocation is almost 900 times slower than with AnyEvent's pure perl 1399invocation speed is almost 900 times slower than with AnyEvent's pure perl
1400implementation.
1401
995implementation. The design of the POE adaptor class in AnyEvent can not 1402The design of the POE adaptor class in AnyEvent can not really account
996really account for this, as session creation overhead is small compared 1403for the performance issues, though, as session creation overhead is
997to execution of the state machine, which is coded pretty optimally within 1404small compared to execution of the state machine, which is coded pretty
998L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow. 1405optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
1406using multiple sessions is not a good approach, especially regarding
1407memory usage, even the author of POE could not come up with a faster
1408design).
999 1409
1000=head2 Summary 1410=head3 Summary
1001 1411
1412=over 4
1413
1002Using EV through AnyEvent is faster than any other event loop, but most 1414=item * Using EV through AnyEvent is faster than any other event loop
1003event loops have acceptable performance with or without AnyEvent. 1415(even when used without AnyEvent), but most event loops have acceptable
1416performance with or without AnyEvent.
1004 1417
1005The overhead AnyEvent adds is usually much smaller than the overhead of 1418=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 1419the actual event loop, only with extremely fast event loops such as EV
1007adds AnyEvent significant overhead. 1420adds AnyEvent significant overhead.
1008 1421
1009And you should simply avoid POE like the plague if you want performance or 1422=item * You should avoid POE like the plague if you want performance or
1010reasonable memory usage. 1423reasonable memory usage.
1011 1424
1425=back
1426
1427=head2 BENCHMARKING THE LARGE SERVER CASE
1428
1429This benchmark actually benchmarks the event loop itself. It works by
1430creating a number of "servers": each server consists of a socket pair, a
1431timeout watcher that gets reset on activity (but never fires), and an I/O
1432watcher waiting for input on one side of the socket. Each time the socket
1433watcher reads a byte it will write that byte to a random other "server".
1434
1435The effect is that there will be a lot of I/O watchers, only part of which
1436are active at any one point (so there is a constant number of active
1437fds for each loop iteration, but which fds these are is random). The
1438timeout is reset each time something is read because that reflects how
1439most timeouts work (and puts extra pressure on the event loops).
1440
1441In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1442(1%) are active. This mirrors the activity of large servers with many
1443connections, most of which are idle at any one point in time.
1444
1445Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1446distribution.
1447
1448=head3 Explanation of the columns
1449
1450I<sockets> is the number of sockets, and twice the number of "servers" (as
1451each server has a read and write socket end).
1452
1453I<create> is the time it takes to create a socket pair (which is
1454nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1455
1456I<request>, the most important value, is the time it takes to handle a
1457single "request", that is, reading the token from the pipe and forwarding
1458it to another server. This includes deleting the old timeout and creating
1459a new one that moves the timeout into the future.
1460
1461=head3 Results
1462
1463 name sockets create request
1464 EV 20000 69.01 11.16
1465 Perl 20000 73.32 35.87
1466 Event 20000 212.62 257.32
1467 Glib 20000 651.16 1896.30
1468 POE 20000 349.67 12317.24 uses POE::Loop::Event
1469
1470=head3 Discussion
1471
1472This benchmark I<does> measure scalability and overall performance of the
1473particular event loop.
1474
1475EV is again fastest. Since it is using epoll on my system, the setup time
1476is relatively high, though.
1477
1478Perl surprisingly comes second. It is much faster than the C-based event
1479loops Event and Glib.
1480
1481Event suffers from high setup time as well (look at its code and you will
1482understand why). Callback invocation also has a high overhead compared to
1483the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
1484uses select or poll in basically all documented configurations.
1485
1486Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
1487clearly fails to perform with many filehandles or in busy servers.
1488
1489POE is still completely out of the picture, taking over 1000 times as long
1490as EV, and over 100 times as long as the Perl implementation, even though
1491it uses a C-based event loop in this case.
1492
1493=head3 Summary
1494
1495=over 4
1496
1497=item * The pure perl implementation performs extremely well.
1498
1499=item * Avoid Glib or POE in large projects where performance matters.
1500
1501=back
1502
1503=head2 BENCHMARKING SMALL SERVERS
1504
1505While event loops should scale (and select-based ones do not...) even to
1506large servers, most programs we (or I :) actually write have only a few
1507I/O watchers.
1508
1509In this benchmark, I use the same benchmark program as in the large server
1510case, but it uses only eight "servers", of which three are active at any
1511one time. This should reflect performance for a small server relatively
1512well.
1513
1514The columns are identical to the previous table.
1515
1516=head3 Results
1517
1518 name sockets create request
1519 EV 16 20.00 6.54
1520 Perl 16 25.75 12.62
1521 Event 16 81.27 35.86
1522 Glib 16 32.63 15.48
1523 POE 16 261.87 276.28 uses POE::Loop::Event
1524
1525=head3 Discussion
1526
1527The benchmark tries to test the performance of a typical small
1528server. While knowing how various event loops perform is interesting, keep
1529in mind that their overhead in this case is usually not as important, due
1530to the small absolute number of watchers (that is, you need efficiency and
1531speed most when you have lots of watchers, not when you only have a few of
1532them).
1533
1534EV is again fastest.
1535
1536Perl again comes second. It is noticeably faster than the C-based event
1537loops Event and Glib, although the difference is too small to really
1538matter.
1539
1540POE also performs much better in this case, but is is still far behind the
1541others.
1542
1543=head3 Summary
1544
1545=over 4
1546
1547=item * C-based event loops perform very well with small number of
1548watchers, as the management overhead dominates.
1549
1550=back
1551
1012 1552
1013=head1 FORK 1553=head1 FORK
1014 1554
1015Most event libraries are not fork-safe. The ones who are usually are 1555Most event libraries are not fork-safe. The ones who are usually are
1016because they are so inefficient. Only L<EV> is fully fork-aware. 1556because they rely on inefficient but fork-safe C<select> or C<poll>
1557calls. Only L<EV> is fully fork-aware.
1017 1558
1018If you have to fork, you must either do so I<before> creating your first 1559If 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. 1560watcher OR you must not use AnyEvent at all in the child.
1020 1561
1021 1562
1033 1574
1034 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} } 1575 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
1035 1576
1036 use AnyEvent; 1577 use AnyEvent;
1037 1578
1579Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
1580be used to probe what backend is used and gain other information (which is
1581probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
1582
1038 1583
1039=head1 SEE ALSO 1584=head1 SEE ALSO
1040 1585
1041Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>, 1586Utility functions: L<AnyEvent::Util>.
1042L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>, 1587
1588Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1043L<Event::Lib>, L<Qt>, L<POE>. 1589L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1044 1590
1045Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>, 1591Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1046L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>, 1592L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1047L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>, 1593L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1048L<AnyEvent::Impl::Qt>, L<AnyEvent::Impl::POE>. 1594L<AnyEvent::Impl::POE>.
1049 1595
1596Non-blocking file handles, sockets, TCP clients and
1597servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1598
1599Asynchronous DNS: L<AnyEvent::DNS>.
1600
1601Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1602
1050Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1603Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1051 1604
1052 1605
1053=head1 AUTHOR 1606=head1 AUTHOR
1054 1607
1055 Marc Lehmann <schmorp@schmorp.de> 1608 Marc Lehmann <schmorp@schmorp.de>

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines