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.112 by root, Sat May 10 01:04:42 2008 UTC vs.
Revision 1.129 by elmex, Sat May 24 15:19:30 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, 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
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 ->send 21 $w->recv; # enters "main loop" till $condvar gets ->send
21 $w->send; # 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
108 108
109=head1 WATCHERS 109=head1 WATCHERS
110 110
111AnyEvent 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
112stores 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
113the callback to call, the filehandle to watch, etc. 113the callback to call, the file handle to watch, etc.
114 114
115These watchers are normal Perl objects with normal Perl lifetime. After 115These watchers are normal Perl objects with normal Perl lifetime. After
116creating a watcher it will immediately "watch" for events and invoke the 116creating a watcher it will immediately "watch" for events and invoke the
117callback when the event occurs (of course, only when the event model 117callback when the event occurs (of course, only when the event model
118is in control). 118is in control).
237 237
238Although the callback might get passed parameters, their value and 238Although the callback might get passed parameters, their value and
239presence is undefined and you cannot rely on them. Portable AnyEvent 239presence is undefined and you cannot rely on them. Portable AnyEvent
240callbacks cannot use arguments passed to signal watcher callbacks. 240callbacks cannot use arguments passed to signal watcher callbacks.
241 241
242Multiple signal occurances can be clumped together into one callback 242Multiple signal occurrences can be clumped together into one callback
243invocation, and callback invocation will be synchronous. synchronous means 243invocation, and callback invocation will be synchronous. Synchronous means
244that 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,
245but it is guarenteed not to interrupt any other callbacks. 245but it is guaranteed not to interrupt any other callbacks.
246 246
247The 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
248between multiple watchers. 248between multiple watchers.
249 249
250This watcher might use C<%SIG>, so programs overwriting those signals 250This watcher might use C<%SIG>, so programs overwriting those signals
278C<fork> the child (alternatively, you can call C<AnyEvent::detect>). 278C<fork> the child (alternatively, you can call C<AnyEvent::detect>).
279 279
280Example: fork a process and wait for it 280Example: fork a process and wait for it
281 281
282 my $done = AnyEvent->condvar; 282 my $done = AnyEvent->condvar;
283
284 AnyEvent::detect; # force event module to be initialised
285 283
286 my $pid = fork or exit 5; 284 my $pid = fork or exit 5;
287 285
288 my $w = AnyEvent->child ( 286 my $w = AnyEvent->child (
289 pid => $pid, 287 pid => $pid,
293 $done->send; 291 $done->send;
294 }, 292 },
295 ); 293 );
296 294
297 # do something else, then wait for process exit 295 # do something else, then wait for process exit
298 $done->wait; 296 $done->recv;
299 297
300=head2 CONDITION VARIABLES 298=head2 CONDITION VARIABLES
301 299
302If you are familiar with some event loops you will know that all of them 300If you are familiar with some event loops you will know that all of them
303require you to run some blocking "loop", "run" or similar function that 301require you to run some blocking "loop", "run" or similar function that
312Condition variables can be created by calling the C<< AnyEvent->condvar 310Condition variables can be created by calling the C<< AnyEvent->condvar
313>> method, usually without arguments. The only argument pair allowed is 311>> method, usually without arguments. The only argument pair allowed is
314C<cb>, which specifies a callback to be called when the condition variable 312C<cb>, which specifies a callback to be called when the condition variable
315becomes true. 313becomes true.
316 314
317After creation, the conditon variable is "false" until it becomes "true" 315After creation, the condition variable is "false" until it becomes "true"
318by calling the C<send> method. 316by calling the C<send> method.
319 317
320Condition variables are similar to callbacks, except that you can 318Condition variables are similar to callbacks, except that you can
321optionally wait for them. They can also be called merge points - points 319optionally wait for them. They can also be called merge points - points
322in time where multiple outstandign events have been processed. And yet 320in time where multiple outstanding events have been processed. And yet
323another way to call them is transations - each condition variable can be 321another way to call them is transactions - each condition variable can be
324used to represent a transaction, which finishes at some point and delivers 322used to represent a transaction, which finishes at some point and delivers
325a result. 323a result.
326 324
327Condition variables are very useful to signal that something has finished, 325Condition variables are very useful to signal that something has finished,
328for example, if you write a module that does asynchronous http requests, 326for example, if you write a module that does asynchronous http requests,
329then a condition variable would be the ideal candidate to signal the 327then a condition variable would be the ideal candidate to signal the
330availability of results. The user can either act when the callback is 328availability of results. The user can either act when the callback is
331called or can synchronously C<< ->wait >> for the results. 329called or can synchronously C<< ->recv >> for the results.
332 330
333You can also use them to simulate traditional event loops - for example, 331You can also use them to simulate traditional event loops - for example,
334you can block your main program until an event occurs - for example, you 332you can block your main program until an event occurs - for example, you
335could C<< ->wait >> in your main program until the user clicks the Quit 333could C<< ->recv >> in your main program until the user clicks the Quit
336button of your app, which would C<< ->send >> the "quit" event. 334button of your app, which would C<< ->send >> the "quit" event.
337 335
338Note that condition variables recurse into the event loop - if you have 336Note that condition variables recurse into the event loop - if you have
339two pieces 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
340lose. Therefore, condition variables are good to export to your caller, but 338lose. Therefore, condition variables are good to export to your caller, but
341you should avoid making a blocking wait yourself, at least in callbacks, 339you should avoid making a blocking wait yourself, at least in callbacks,
342as this asks for trouble. 340as this asks for trouble.
343 341
344Condition variables are represented by hash refs in perl, and the keys 342Condition variables are represented by hash refs in perl, and the keys
365 cb => sub { $result_ready->send }, 363 cb => sub { $result_ready->send },
366 ); 364 );
367 365
368 # this "blocks" (while handling events) till the callback 366 # this "blocks" (while handling events) till the callback
369 # calls send 367 # calls send
370 $result_ready->wait; 368 $result_ready->recv;
371 369
372=head3 METHODS FOR PRODUCERS 370=head3 METHODS FOR PRODUCERS
373 371
374These methods should only be used by the producing side, i.e. the 372These methods should only be used by the producing side, i.e. the
375code/module that eventually sends the signal. Note that it is also 373code/module that eventually sends the signal. Note that it is also
378 376
379=over 4 377=over 4
380 378
381=item $cv->send (...) 379=item $cv->send (...)
382 380
383Flag the condition as ready - a running C<< ->wait >> and all further 381Flag the condition as ready - a running C<< ->recv >> and all further
384calls to C<wait> will (eventually) return after this method has been 382calls to C<recv> will (eventually) return after this method has been
385called. If nobody is waiting the send will be remembered. 383called. If nobody is waiting the send will be remembered.
386 384
387If a callback has been set on the condition variable, it is called 385If a callback has been set on the condition variable, it is called
388immediately from within send. 386immediately from within send.
389 387
390Any arguments passed to the C<send> call will be returned by all 388Any arguments passed to the C<send> call will be returned by all
391future C<< ->wait >> calls. 389future C<< ->recv >> calls.
392 390
393=item $cv->croak ($error) 391=item $cv->croak ($error)
394 392
395Similar to send, but causes all call's wait C<< ->wait >> to invoke 393Similar to send, but causes all call's to C<< ->recv >> to invoke
396C<Carp::croak> with the given error message/object/scalar. 394C<Carp::croak> with the given error message/object/scalar.
397 395
398This can be used to signal any errors to the condition variable 396This can be used to signal any errors to the condition variable
399user/consumer. 397user/consumer.
400 398
401=item $cv->begin ([group callback]) 399=item $cv->begin ([group callback])
402 400
403=item $cv->end 401=item $cv->end
402
403These two methods are EXPERIMENTAL and MIGHT CHANGE.
404 404
405These two methods can be used to combine many transactions/events into 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 406one. For example, a function that pings many hosts in parallel might want
407to use a condition variable for the whole process. 407to use a condition variable for the whole process.
408 408
443doesn't execute once). 443doesn't execute once).
444 444
445This is the general pattern when you "fan out" into multiple subrequests: 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> 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 447is called at least once, and then, for each subrequest you start, call
448C<begin> and for eahc subrequest you finish, call C<end>. 448C<begin> and for each subrequest you finish, call C<end>.
449 449
450=back 450=back
451 451
452=head3 METHODS FOR CONSUMERS 452=head3 METHODS FOR CONSUMERS
453 453
454These methods should only be used by the consuming side, i.e. the 454These methods should only be used by the consuming side, i.e. the
455code awaits the condition. 455code awaits the condition.
456 456
457=over 4 457=over 4
458 458
459=item $cv->wait 459=item $cv->recv
460 460
461Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak 461Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
462>> methods have been called on c<$cv>, while servicing other watchers 462>> methods have been called on c<$cv>, while servicing other watchers
463normally. 463normally.
464 464
475(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
476using 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
477caller 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
478condition variables with some kind of request results and supporting 478condition variables with some kind of request results and supporting
479callbacks so the caller knows that getting the result will not block, 479callbacks so the caller knows that getting the result will not block,
480while still suppporting blocking waits if the caller so desires). 480while still supporting blocking waits if the caller so desires).
481 481
482Another 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
483sensibly have two C<< ->wait >>'s in parallel, as that would require 483sensibly have two C<< ->recv >>'s in parallel, as that would require
484multiple interpreters or coroutines/threads, none of which C<AnyEvent> 484multiple interpreters or coroutines/threads, none of which C<AnyEvent>
485can supply. 485can supply.
486 486
487The L<Coro> module, however, I<can> and I<does> supply coroutines and, in 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 488fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
489versions and also integrates coroutines into AnyEvent, making blocking 489versions and also integrates coroutines into AnyEvent, making blocking
490C<< ->wait >> calls perfectly safe as long as they are done from another 490C<< ->recv >> calls perfectly safe as long as they are done from another
491coroutine (one that doesn't run the event loop). 491coroutine (one that doesn't run the event loop).
492 492
493You can ensure that C<< -wait >> never blocks by setting a callback and 493You can ensure that C<< -recv >> never blocks by setting a callback and
494only calling C<< ->wait >> from within that callback (or at a later 494only calling C<< ->recv >> from within that callback (or at a later
495time). This will work even when the event loop does not support blocking 495time). This will work even when the event loop does not support blocking
496waits otherwise. 496waits otherwise.
497 497
498=item $bool = $cv->ready 498=item $bool = $cv->ready
499 499
504 504
505This is a mutator function that returns the callback set and optionally 505This is a mutator function that returns the callback set and optionally
506replaces it before doing so. 506replaces it before doing so.
507 507
508The callback will be called when the condition becomes "true", i.e. when 508The callback will be called when the condition becomes "true", i.e. when
509C<send> or C<croak> are called. Calling C<wait> inside the callback 509C<send> or C<croak> are called. Calling C<recv> inside the callback
510or at any later time is guaranteed not to block. 510or at any later time is guaranteed not to block.
511 511
512=back 512=back
513 513
514=head1 GLOBAL VARIABLES AND FUNCTIONS 514=head1 GLOBAL VARIABLES AND FUNCTIONS
582Be careful when you create watchers in the module body - AnyEvent will 582Be careful when you create watchers in the module body - AnyEvent will
583decide 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
584by 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
585to load the event module first. 585to load the event module first.
586 586
587Never 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
588the C<< ->send >> method has been called on it already. This is 588the C<< ->send >> method has been called on it already. This is
589because 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
590events is to stay interactive. 590events is to stay interactive.
591 591
592It 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
593requests 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
594called C<results> that returns the results, it should call C<< ->wait >> 594called C<results> that returns the results, it should call C<< ->recv >>
595freely, 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).
596 596
597=head1 WHAT TO DO IN THE MAIN PROGRAM 597=head1 WHAT TO DO IN THE MAIN PROGRAM
598 598
599There 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
633 633
634Provide read and write buffers and manages watchers for reads and writes. 634Provide read and write buffers and manages watchers for reads and writes.
635 635
636=item L<AnyEvent::Socket> 636=item L<AnyEvent::Socket>
637 637
638Provides a means to do non-blocking connects, accepts etc. 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.
639 641
640=item L<AnyEvent::HTTPD> 642=item L<AnyEvent::HTTPD>
641 643
642Provides a simple web application server framework. 644Provides a simple web application server framework.
643 645
644=item L<AnyEvent::DNS> 646=item L<AnyEvent::DNS>
645 647
646Provides asynchronous DNS resolver capabilities, beyond what 648Provides rich asynchronous DNS resolver capabilities.
647L<AnyEvent::Util> offers.
648 649
649=item L<AnyEvent::FastPing> 650=item L<AnyEvent::FastPing>
650 651
651The fastest ping in the west. 652The fastest ping in the west.
652 653
669 670
670=item L<Coro> 671=item L<Coro>
671 672
672Has special support for AnyEvent via L<Coro::AnyEvent>. 673Has special support for AnyEvent via L<Coro::AnyEvent>.
673 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
674=item L<IO::Lambda> 686=item L<IO::Lambda>
675 687
676The lambda approach to I/O - don't ask, look there. Can use AnyEvent. 688The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
677
678=item L<IO::AIO>
679
680Truly asynchronous I/O, should be in the toolbox of every event
681programmer. Can be trivially made to use AnyEvent.
682
683=item L<BDB>
684
685Truly asynchronous Berkeley DB access. Can be trivially made to use
686AnyEvent.
687 689
688=back 690=back
689 691
690=cut 692=cut
691 693
694no warnings; 696no warnings;
695use strict; 697use strict;
696 698
697use Carp; 699use Carp;
698 700
699our $VERSION = '3.4'; 701our $VERSION = '3.6';
700our $MODEL; 702our $MODEL;
701 703
702our $AUTOLOAD; 704our $AUTOLOAD;
703our @ISA; 705our @ISA;
704 706
705our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 707our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
706 708
707our @REGISTRY; 709our @REGISTRY;
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}
708 718
709my @models = ( 719my @models = (
710 [EV:: => AnyEvent::Impl::EV::], 720 [EV:: => AnyEvent::Impl::EV::],
711 [Event:: => AnyEvent::Impl::Event::], 721 [Event:: => AnyEvent::Impl::Event::],
712 [Tk:: => AnyEvent::Impl::Tk::], 722 [Tk:: => AnyEvent::Impl::Tk::],
733 1 743 1
734 } else { 744 } else {
735 push @post_detect, $cb; 745 push @post_detect, $cb;
736 746
737 defined wantarray 747 defined wantarray
738 ? bless \$cb, "AnyEvent::Util::Guard" 748 ? bless \$cb, "AnyEvent::Util::PostDetect"
739 : () 749 : ()
740 } 750 }
741} 751}
742 752
743sub AnyEvent::Util::Guard::DESTROY { 753sub AnyEvent::Util::PostDetect::DESTROY {
744 @post_detect = grep $_ != ${$_[0]}, @post_detect; 754 @post_detect = grep $_ != ${$_[0]}, @post_detect;
745} 755}
746 756
747sub detect() { 757sub detect() {
748 unless ($MODEL) { 758 unless ($MODEL) {
811 $class->$func (@_); 821 $class->$func (@_);
812} 822}
813 823
814package AnyEvent::Base; 824package AnyEvent::Base;
815 825
816# default implementation for ->condvar, ->wait, ->broadcast 826# default implementation for ->condvar
817 827
818sub condvar { 828sub condvar {
819 bless \my $flag, "AnyEvent::Base::CondVar" 829 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
820}
821
822sub AnyEvent::Base::CondVar::broadcast {
823 ${$_[0]}++;
824}
825
826sub AnyEvent::Base::CondVar::wait {
827 AnyEvent->one_event while !${$_[0]};
828} 830}
829 831
830# default implementation for ->signal 832# default implementation for ->signal
831 833
832our %SIG_CB; 834our %SIG_CB;
906 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 908 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
907 909
908 undef $CHLD_W unless keys %PID_CB; 910 undef $CHLD_W unless keys %PID_CB;
909} 911}
910 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
911=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 969=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
912 970
913This 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
914a 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
915provide AnyEvent compatibility. 973provide AnyEvent compatibility.
971model it chooses. 1029model it chooses.
972 1030
973=item C<PERL_ANYEVENT_MODEL> 1031=item C<PERL_ANYEVENT_MODEL>
974 1032
975This 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
976autodetection and -probing kicks in. It must be a string consisting 1034auto detection and -probing kicks in. It must be a string consisting
977entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended 1035entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
978and 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,
979used 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
980autodetection and -probing. 1038auto detection and -probing.
981 1039
982This functionality might change in future versions. 1040This functionality might change in future versions.
983 1041
984For 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
985could start your program like this: 1043could start your program like this:
986 1044
987 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.
988 1077
989=back 1078=back
990 1079
991=head1 EXAMPLE PROGRAM 1080=head1 EXAMPLE PROGRAM
992 1081
1003 poll => 'r', 1092 poll => 'r',
1004 cb => sub { 1093 cb => sub {
1005 warn "io event <$_[0]>\n"; # will always output <r> 1094 warn "io event <$_[0]>\n"; # will always output <r>
1006 chomp (my $input = <STDIN>); # read a line 1095 chomp (my $input = <STDIN>); # read a line
1007 warn "read: $input\n"; # output what has been read 1096 warn "read: $input\n"; # output what has been read
1008 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1097 $cv->send if $input =~ /^q/i; # quit program if /^q/i
1009 }, 1098 },
1010 ); 1099 );
1011 1100
1012 my $time_watcher; # can only be used once 1101 my $time_watcher; # can only be used once
1013 1102
1018 }); 1107 });
1019 } 1108 }
1020 1109
1021 new_timer; # create first timer 1110 new_timer; # create first timer
1022 1111
1023 $cv->wait; # wait until user enters /^q/i 1112 $cv->recv; # wait until user enters /^q/i
1024 1113
1025=head1 REAL-WORLD EXAMPLE 1114=head1 REAL-WORLD EXAMPLE
1026 1115
1027Consider the L<Net::FCP> module. It features (among others) the following 1116Consider the L<Net::FCP> module. It features (among others) the following
1028API 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:
1078 syswrite $txn->{fh}, $txn->{request} 1167 syswrite $txn->{fh}, $txn->{request}
1079 or die "connection or write error"; 1168 or die "connection or write error";
1080 $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 });
1081 1170
1082Again, 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
1083result and signals any possible waiters that the request ahs finished: 1172result and signals any possible waiters that the request has finished:
1084 1173
1085 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1174 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
1086 1175
1087 if (end-of-file or data complete) { 1176 if (end-of-file or data complete) {
1088 $txn->{result} = $txn->{buf}; 1177 $txn->{result} = $txn->{buf};
1089 $txn->{finished}->broadcast; 1178 $txn->{finished}->send;
1090 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1179 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
1091 } 1180 }
1092 1181
1093The 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
1094request 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
1095data: 1184data:
1096 1185
1097 $txn->{finished}->wait; 1186 $txn->{finished}->recv;
1098 return $txn->{result}; 1187 return $txn->{result};
1099 1188
1100The 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)
1101that occured during request processing. The C<result> method detects 1190that occurred during request processing. The C<result> method detects
1102whether an exception as thrown (it is stored inside the $txn object) 1191whether an exception as thrown (it is stored inside the $txn object)
1103and just throws the exception, which means connection errors and other 1192and just throws the exception, which means connection errors and other
1104problems 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
1105random callback. 1194random callback.
1106 1195
1137 1226
1138 my $quit = AnyEvent->condvar; 1227 my $quit = AnyEvent->condvar;
1139 1228
1140 $fcp->txn_client_get ($url)->cb (sub { 1229 $fcp->txn_client_get ($url)->cb (sub {
1141 ... 1230 ...
1142 $quit->broadcast; 1231 $quit->send;
1143 }); 1232 });
1144 1233
1145 $quit->wait; 1234 $quit->recv;
1146 1235
1147 1236
1148=head1 BENCHMARKS 1237=head1 BENCHMARKS
1149 1238
1150To 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
1152of various event loops I prepared some benchmarks. 1241of various event loops I prepared some benchmarks.
1153 1242
1154=head2 BENCHMARKING ANYEVENT OVERHEAD 1243=head2 BENCHMARKING ANYEVENT OVERHEAD
1155 1244
1156Here is a benchmark of various supported event models used natively and 1245Here is a benchmark of various supported event models used natively and
1157through anyevent. The benchmark creates a lot of timers (with a zero 1246through AnyEvent. The benchmark creates a lot of timers (with a zero
1158timeout) and I/O watchers (watching STDOUT, a pty, to become writable, 1247timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
1159which it is), lets them fire exactly once and destroys them again. 1248which it is), lets them fire exactly once and destroys them again.
1160 1249
1161Source code for this benchmark is found as F<eg/bench> in the AnyEvent 1250Source code for this benchmark is found as F<eg/bench> in the AnyEvent
1162distribution. 1251distribution.
1179all watchers, to avoid adding memory overhead. That means closure creation 1268all watchers, to avoid adding memory overhead. That means closure creation
1180and memory usage is not included in the figures. 1269and memory usage is not included in the figures.
1181 1270
1182I<invoke> is the time, in microseconds, used to invoke a simple 1271I<invoke> is the time, in microseconds, used to invoke a simple
1183callback. 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
1184invoked "watcher" times, it would C<< ->broadcast >> a condvar once to 1273invoked "watcher" times, it would C<< ->send >> a condvar once to
1185signal the end of this phase. 1274signal the end of this phase.
1186 1275
1187I<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
1188watcher. 1277watcher.
1189 1278
1285 1374
1286=back 1375=back
1287 1376
1288=head2 BENCHMARKING THE LARGE SERVER CASE 1377=head2 BENCHMARKING THE LARGE SERVER CASE
1289 1378
1290This benchmark atcually benchmarks the event loop itself. It works by 1379This benchmark actually benchmarks the event loop itself. It works by
1291creating a number of "servers": each server consists of a socketpair, a 1380creating a number of "servers": each server consists of a socket pair, a
1292timeout watcher that gets reset on activity (but never fires), and an I/O 1381timeout watcher that gets reset on activity (but never fires), and an I/O
1293watcher waiting for input on one side of the socket. Each time the socket 1382watcher waiting for input on one side of the socket. Each time the socket
1294watcher reads a byte it will write that byte to a random other "server". 1383watcher reads a byte it will write that byte to a random other "server".
1295 1384
1296The effect is that there will be a lot of I/O watchers, only part of which 1385The effect is that there will be a lot of I/O watchers, only part of which
1297are active at any one point (so there is a constant number of active 1386are active at any one point (so there is a constant number of active
1298fds for each loop iterstaion, but which fds these are is random). The 1387fds for each loop iteration, but which fds these are is random). The
1299timeout is reset each time something is read because that reflects how 1388timeout is reset each time something is read because that reflects how
1300most timeouts work (and puts extra pressure on the event loops). 1389most timeouts work (and puts extra pressure on the event loops).
1301 1390
1302In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100 1391In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1303(1%) are active. This mirrors the activity of large servers with many 1392(1%) are active. This mirrors the activity of large servers with many
1304connections, most of which are idle at any one point in time. 1393connections, most of which are idle at any one point in time.
1305 1394
1306Source code for this benchmark is found as F<eg/bench2> in the AnyEvent 1395Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1307distribution. 1396distribution.
1309=head3 Explanation of the columns 1398=head3 Explanation of the columns
1310 1399
1311I<sockets> is the number of sockets, and twice the number of "servers" (as 1400I<sockets> is the number of sockets, and twice the number of "servers" (as
1312each server has a read and write socket end). 1401each server has a read and write socket end).
1313 1402
1314I<create> is the time it takes to create a socketpair (which is 1403I<create> is the time it takes to create a socket pair (which is
1315nontrivial) and two watchers: an I/O watcher and a timeout watcher. 1404nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1316 1405
1317I<request>, the most important value, is the time it takes to handle a 1406I<request>, the most important value, is the time it takes to handle a
1318single "request", that is, reading the token from the pipe and forwarding 1407single "request", that is, reading the token from the pipe and forwarding
1319it to another server. This includes deleting the old timeout and creating 1408it to another server. This includes deleting the old timeout and creating
1392speed most when you have lots of watchers, not when you only have a few of 1481speed most when you have lots of watchers, not when you only have a few of
1393them). 1482them).
1394 1483
1395EV is again fastest. 1484EV is again fastest.
1396 1485
1397Perl again comes second. It is noticably faster than the C-based event 1486Perl again comes second. It is noticeably faster than the C-based event
1398loops Event and Glib, although the difference is too small to really 1487loops Event and Glib, although the difference is too small to really
1399matter. 1488matter.
1400 1489
1401POE also performs much better in this case, but is is still far behind the 1490POE also performs much better in this case, but is is still far behind the
1402others. 1491others.
1442probably even less useful to an attacker than PERL_ANYEVENT_MODEL). 1531probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
1443 1532
1444 1533
1445=head1 SEE ALSO 1534=head1 SEE ALSO
1446 1535
1536Utility functions: L<AnyEvent::Util>.
1537
1447Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>, 1538Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1448L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>. 1539L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1449 1540
1450Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>, 1541Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1451L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, 1542L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1452L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>, 1543L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1453L<AnyEvent::Impl::POE>. 1544L<AnyEvent::Impl::POE>.
1454 1545
1546Non-blocking file handles, sockets, TCP clients and
1547servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1548
1549Asynchronous DNS: L<AnyEvent::DNS>.
1550
1455Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>, 1551Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1456 1552
1457Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1553Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1458 1554
1459 1555
1460=head1 AUTHOR 1556=head1 AUTHOR
1461 1557
1462 Marc Lehmann <schmorp@schmorp.de> 1558 Marc Lehmann <schmorp@schmorp.de>

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines