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.114 by root, Sat May 10 21:12:49 2008 UTC vs.
Revision 1.132 by root, Sun May 25 01:05:27 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
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
310Condition variables can be created by calling the C<< AnyEvent->condvar 310Condition variables can be created by calling the C<< AnyEvent->condvar
311>> method, usually without arguments. The only argument pair allowed is 311>> method, usually without arguments. The only argument pair allowed is
312C<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
313becomes true. 313becomes true.
314 314
315After creation, the conditon variable is "false" until it becomes "true" 315After creation, the condition variable is "false" until it becomes "true"
316by calling the C<send> method. 316by calling the C<send> method (or calling the condition variable as if it
317were a callback).
317 318
318Condition variables are similar to callbacks, except that you can 319Condition variables are similar to callbacks, except that you can
319optionally wait for them. They can also be called merge points - points 320optionally wait for them. They can also be called merge points - points
320in time where multiple outstandign events have been processed. And yet 321in time where multiple outstanding events have been processed. And yet
321another way to call them is transations - each condition variable can be 322another way to call them is transactions - each condition variable can be
322used to represent a transaction, which finishes at some point and delivers 323used to represent a transaction, which finishes at some point and delivers
323a result. 324a result.
324 325
325Condition variables are very useful to signal that something has finished, 326Condition variables are very useful to signal that something has finished,
326for example, if you write a module that does asynchronous http requests, 327for example, if you write a module that does asynchronous http requests,
332you can block your main program until an event occurs - for example, you 333you can block your main program until an event occurs - for example, you
333could C<< ->recv >> in your main program until the user clicks the Quit 334could C<< ->recv >> in your main program until the user clicks the Quit
334button of your app, which would C<< ->send >> the "quit" event. 335button of your app, which would C<< ->send >> the "quit" event.
335 336
336Note that condition variables recurse into the event loop - if you have 337Note that condition variables recurse into the event loop - if you have
337two pieces of code that call C<< ->recv >> in a round-robbin fashion, you 338two pieces of code that call C<< ->recv >> in a round-robin fashion, you
338lose. Therefore, condition variables are good to export to your caller, but 339lose. Therefore, condition variables are good to export to your caller, but
339you should avoid making a blocking wait yourself, at least in callbacks, 340you should avoid making a blocking wait yourself, at least in callbacks,
340as this asks for trouble. 341as this asks for trouble.
341 342
342Condition variables are represented by hash refs in perl, and the keys 343Condition variables are represented by hash refs in perl, and the keys
347 348
348There are two "sides" to a condition variable - the "producer side" which 349There are two "sides" to a condition variable - the "producer side" which
349eventually calls C<< -> send >>, and the "consumer side", which waits 350eventually calls C<< -> send >>, and the "consumer side", which waits
350for the send to occur. 351for the send to occur.
351 352
352Example: 353Example: wait for a timer.
353 354
354 # wait till the result is ready 355 # wait till the result is ready
355 my $result_ready = AnyEvent->condvar; 356 my $result_ready = AnyEvent->condvar;
356 357
357 # do something such as adding a timer 358 # do something such as adding a timer
365 366
366 # this "blocks" (while handling events) till the callback 367 # this "blocks" (while handling events) till the callback
367 # calls send 368 # calls send
368 $result_ready->recv; 369 $result_ready->recv;
369 370
371Example: wait for a timer, but take advantage of the fact that
372condition variables are also code references.
373
374 my $done = AnyEvent->condvar;
375 my $delay = AnyEvent->timer (after => 5, cb => $done);
376 $done->recv;
377
370=head3 METHODS FOR PRODUCERS 378=head3 METHODS FOR PRODUCERS
371 379
372These methods should only be used by the producing side, i.e. the 380These methods should only be used by the producing side, i.e. the
373code/module that eventually sends the signal. Note that it is also 381code/module that eventually sends the signal. Note that it is also
374the producer side which creates the condvar in most cases, but it isn't 382the producer side which creates the condvar in most cases, but it isn't
385If a callback has been set on the condition variable, it is called 393If a callback has been set on the condition variable, it is called
386immediately from within send. 394immediately from within send.
387 395
388Any arguments passed to the C<send> call will be returned by all 396Any arguments passed to the C<send> call will be returned by all
389future C<< ->recv >> calls. 397future C<< ->recv >> calls.
398
399Condition variables are overloaded so one can call them directly (as a
400code reference). Calling them directly is the same as calling C<send>.
390 401
391=item $cv->croak ($error) 402=item $cv->croak ($error)
392 403
393Similar to send, but causes all call's to C<< ->recv >> to invoke 404Similar to send, but causes all call's to C<< ->recv >> to invoke
394C<Carp::croak> with the given error message/object/scalar. 405C<Carp::croak> with the given error message/object/scalar.
443doesn't execute once). 454doesn't execute once).
444 455
445This is the general pattern when you "fan out" into multiple subrequests: 456This 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> 457use 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 458is called at least once, and then, for each subrequest you start, call
448C<begin> and for eahc subrequest you finish, call C<end>. 459C<begin> and for each subrequest you finish, call C<end>.
449 460
450=back 461=back
451 462
452=head3 METHODS FOR CONSUMERS 463=head3 METHODS FOR CONSUMERS
453 464
475(programs might want to do that to stay interactive), so I<if you are 486(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 487using 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 488caller decide whether the call will block or not (for example, by coupling
478condition variables with some kind of request results and supporting 489condition variables with some kind of request results and supporting
479callbacks so the caller knows that getting the result will not block, 490callbacks so the caller knows that getting the result will not block,
480while still suppporting blocking waits if the caller so desires). 491while still supporting blocking waits if the caller so desires).
481 492
482Another reason I<never> to C<< ->recv >> in a module is that you cannot 493Another reason I<never> to C<< ->recv >> in a module is that you cannot
483sensibly have two C<< ->recv >>'s in parallel, as that would require 494sensibly have two C<< ->recv >>'s in parallel, as that would require
484multiple interpreters or coroutines/threads, none of which C<AnyEvent> 495multiple interpreters or coroutines/threads, none of which C<AnyEvent>
485can supply. 496can supply.
631 642
632=item L<AnyEvent::Handle> 643=item L<AnyEvent::Handle>
633 644
634Provide read and write buffers and manages watchers for reads and writes. 645Provide read and write buffers and manages watchers for reads and writes.
635 646
647=item L<AnyEvent::Socket>
648
649Provides various utility functions for (internet protocol) sockets,
650addresses and name resolution. Also functions to create non-blocking tcp
651connections or tcp servers, with IPv6 and SRV record support and more.
652
636=item L<AnyEvent::HTTPD> 653=item L<AnyEvent::HTTPD>
637 654
638Provides a simple web application server framework. 655Provides a simple web application server framework.
639 656
640=item L<AnyEvent::DNS> 657=item L<AnyEvent::DNS>
641 658
642Provides asynchronous DNS resolver capabilities, beyond what 659Provides rich asynchronous DNS resolver capabilities.
643L<AnyEvent::Util> offers.
644 660
645=item L<AnyEvent::FastPing> 661=item L<AnyEvent::FastPing>
646 662
647The fastest ping in the west. 663The fastest ping in the west.
648 664
691no warnings; 707no warnings;
692use strict; 708use strict;
693 709
694use Carp; 710use Carp;
695 711
696our $VERSION = '3.4'; 712our $VERSION = '4.03';
697our $MODEL; 713our $MODEL;
698 714
699our $AUTOLOAD; 715our $AUTOLOAD;
700our @ISA; 716our @ISA;
701 717
702our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 718our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
703 719
704our @REGISTRY; 720our @REGISTRY;
721
722our %PROTOCOL; # (ipv4|ipv6) => (1|2)
723
724{
725 my $idx;
726 $PROTOCOL{$_} = ++$idx
727 for split /\s*,\s*/, $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
728}
705 729
706my @models = ( 730my @models = (
707 [EV:: => AnyEvent::Impl::EV::], 731 [EV:: => AnyEvent::Impl::EV::],
708 [Event:: => AnyEvent::Impl::Event::], 732 [Event:: => AnyEvent::Impl::Event::],
709 [Tk:: => AnyEvent::Impl::Tk::], 733 [Tk:: => AnyEvent::Impl::Tk::],
730 1 754 1
731 } else { 755 } else {
732 push @post_detect, $cb; 756 push @post_detect, $cb;
733 757
734 defined wantarray 758 defined wantarray
735 ? bless \$cb, "AnyEvent::Util::Guard" 759 ? bless \$cb, "AnyEvent::Util::PostDetect"
736 : () 760 : ()
737 } 761 }
738} 762}
739 763
740sub AnyEvent::Util::Guard::DESTROY { 764sub AnyEvent::Util::PostDetect::DESTROY {
741 @post_detect = grep $_ != ${$_[0]}, @post_detect; 765 @post_detect = grep $_ != ${$_[0]}, @post_detect;
742} 766}
743 767
744sub detect() { 768sub detect() {
745 unless ($MODEL) { 769 unless ($MODEL) {
811package AnyEvent::Base; 835package AnyEvent::Base;
812 836
813# default implementation for ->condvar 837# default implementation for ->condvar
814 838
815sub condvar { 839sub condvar {
816 bless {}, "AnyEvent::Base::CondVar" 840 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
817} 841}
818 842
819# default implementation for ->signal 843# default implementation for ->signal
820 844
821our %SIG_CB; 845our %SIG_CB;
895 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 919 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
896 920
897 undef $CHLD_W unless keys %PID_CB; 921 undef $CHLD_W unless keys %PID_CB;
898} 922}
899 923
900package AnyEvent::Base::CondVar; 924package AnyEvent::CondVar;
901 925
902# wake up the waiter 926our @ISA = AnyEvent::CondVar::Base::;
927
928package AnyEvent::CondVar::Base;
929
930use overload
931 '&{}' => sub { my $self = shift; sub { $self->send (@_) } },
932 fallback => 1;
933
903sub _send { 934sub _send {
904 &{ $_[0]{_ae_cb} } if $_[0]{_ae_cb}; 935 # nop
905} 936}
906 937
907sub send { 938sub send {
939 my $cv = shift;
908 $_[0]{_ae_sent} = [@_]; 940 $cv->{_ae_sent} = [@_];
941 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
909 $_[0]->_send; 942 $cv->_send;
910} 943}
911 944
912sub croak { 945sub croak {
913 $_[0]{_ae_croak} = $_[0]; 946 $_[0]{_ae_croak} = $_[1];
914 $_[0]->send; 947 $_[0]->send;
915} 948}
916 949
917sub ready { 950sub ready {
918 $_[0]{_ae_sent} 951 $_[0]{_ae_sent}
919} 952}
920 953
954sub _wait {
955 AnyEvent->one_event while !$_[0]{_ae_sent};
956}
957
921sub recv { 958sub recv {
922 AnyEvent->one_event while !$_[0]{_ae_sent}; 959 $_[0]->_wait;
923 960
924 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak}; 961 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
925 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0] 962 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
926} 963}
927 964
935 $_[0]{_ae_end_cb} = $_[1] if @_ > 1; 972 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
936} 973}
937 974
938sub end { 975sub end {
939 return if --$_[0]{_ae_counter}; 976 return if --$_[0]{_ae_counter};
940 &{ $_[0]{_ae_end_cb} } if $_[0]{_ae_end_cb}; 977 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
941} 978}
942 979
943# undocumented/compatibility with pre-3.4 980# undocumented/compatibility with pre-3.4
944*broadcast = \&send; 981*broadcast = \&send;
945*wait = \&recv; 982*wait = \&_wait;
946 983
947=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 984=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
948 985
949This is an advanced topic that you do not normally need to use AnyEvent in 986This is an advanced topic that you do not normally need to use AnyEvent in
950a module. This section is only of use to event loop authors who want to 987a module. This section is only of use to event loop authors who want to
1007model it chooses. 1044model it chooses.
1008 1045
1009=item C<PERL_ANYEVENT_MODEL> 1046=item C<PERL_ANYEVENT_MODEL>
1010 1047
1011This can be used to specify the event model to be used by AnyEvent, before 1048This can be used to specify the event model to be used by AnyEvent, before
1012autodetection and -probing kicks in. It must be a string consisting 1049auto detection and -probing kicks in. It must be a string consisting
1013entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended 1050entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
1014and the resulting module name is loaded and if the load was successful, 1051and the resulting module name is loaded and if the load was successful,
1015used as event model. If it fails to load AnyEvent will proceed with 1052used as event model. If it fails to load AnyEvent will proceed with
1016autodetection and -probing. 1053auto detection and -probing.
1017 1054
1018This functionality might change in future versions. 1055This functionality might change in future versions.
1019 1056
1020For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you 1057For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
1021could start your program like this: 1058could start your program like this:
1022 1059
1023 PERL_ANYEVENT_MODEL=Perl perl ... 1060 PERL_ANYEVENT_MODEL=Perl perl ...
1061
1062=item C<PERL_ANYEVENT_PROTOCOLS>
1063
1064Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1065for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1066of auto probing).
1067
1068Must be set to a comma-separated list of protocols or address families,
1069current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1070used, and preference will be given to protocols mentioned earlier in the
1071list.
1072
1073This variable can effectively be used for denial-of-service attacks
1074against local programs (e.g. when setuid), although the impact is likely
1075small, as the program has to handle connection errors already-
1076
1077Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1078but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1079- only support IPv4, never try to resolve or contact IPv6
1080addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1081IPv6, but prefer IPv6 over IPv4.
1082
1083=item C<PERL_ANYEVENT_EDNS0>
1084
1085Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1086for DNS. This extension is generally useful to reduce DNS traffic, but
1087some (broken) firewalls drop such DNS packets, which is why it is off by
1088default.
1089
1090Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1091EDNS0 in its DNS requests.
1024 1092
1025=back 1093=back
1026 1094
1027=head1 EXAMPLE PROGRAM 1095=head1 EXAMPLE PROGRAM
1028 1096
1039 poll => 'r', 1107 poll => 'r',
1040 cb => sub { 1108 cb => sub {
1041 warn "io event <$_[0]>\n"; # will always output <r> 1109 warn "io event <$_[0]>\n"; # will always output <r>
1042 chomp (my $input = <STDIN>); # read a line 1110 chomp (my $input = <STDIN>); # read a line
1043 warn "read: $input\n"; # output what has been read 1111 warn "read: $input\n"; # output what has been read
1044 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1112 $cv->send if $input =~ /^q/i; # quit program if /^q/i
1045 }, 1113 },
1046 ); 1114 );
1047 1115
1048 my $time_watcher; # can only be used once 1116 my $time_watcher; # can only be used once
1049 1117
1054 }); 1122 });
1055 } 1123 }
1056 1124
1057 new_timer; # create first timer 1125 new_timer; # create first timer
1058 1126
1059 $cv->wait; # wait until user enters /^q/i 1127 $cv->recv; # wait until user enters /^q/i
1060 1128
1061=head1 REAL-WORLD EXAMPLE 1129=head1 REAL-WORLD EXAMPLE
1062 1130
1063Consider the L<Net::FCP> module. It features (among others) the following 1131Consider the L<Net::FCP> module. It features (among others) the following
1064API calls, which are to freenet what HTTP GET requests are to http: 1132API calls, which are to freenet what HTTP GET requests are to http:
1114 syswrite $txn->{fh}, $txn->{request} 1182 syswrite $txn->{fh}, $txn->{request}
1115 or die "connection or write error"; 1183 or die "connection or write error";
1116 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r }); 1184 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
1117 1185
1118Again, C<fh_ready_r> waits till all data has arrived, and then stores the 1186Again, C<fh_ready_r> waits till all data has arrived, and then stores the
1119result and signals any possible waiters that the request ahs finished: 1187result and signals any possible waiters that the request has finished:
1120 1188
1121 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1189 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
1122 1190
1123 if (end-of-file or data complete) { 1191 if (end-of-file or data complete) {
1124 $txn->{result} = $txn->{buf}; 1192 $txn->{result} = $txn->{buf};
1125 $txn->{finished}->broadcast; 1193 $txn->{finished}->send;
1126 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1194 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
1127 } 1195 }
1128 1196
1129The C<result> method, finally, just waits for the finished signal (if the 1197The C<result> method, finally, just waits for the finished signal (if the
1130request was already finished, it doesn't wait, of course, and returns the 1198request was already finished, it doesn't wait, of course, and returns the
1131data: 1199data:
1132 1200
1133 $txn->{finished}->wait; 1201 $txn->{finished}->recv;
1134 return $txn->{result}; 1202 return $txn->{result};
1135 1203
1136The actual code goes further and collects all errors (C<die>s, exceptions) 1204The actual code goes further and collects all errors (C<die>s, exceptions)
1137that occured during request processing. The C<result> method detects 1205that occurred during request processing. The C<result> method detects
1138whether an exception as thrown (it is stored inside the $txn object) 1206whether an exception as thrown (it is stored inside the $txn object)
1139and just throws the exception, which means connection errors and other 1207and just throws the exception, which means connection errors and other
1140problems get reported tot he code that tries to use the result, not in a 1208problems get reported tot he code that tries to use the result, not in a
1141random callback. 1209random callback.
1142 1210
1173 1241
1174 my $quit = AnyEvent->condvar; 1242 my $quit = AnyEvent->condvar;
1175 1243
1176 $fcp->txn_client_get ($url)->cb (sub { 1244 $fcp->txn_client_get ($url)->cb (sub {
1177 ... 1245 ...
1178 $quit->broadcast; 1246 $quit->send;
1179 }); 1247 });
1180 1248
1181 $quit->wait; 1249 $quit->recv;
1182 1250
1183 1251
1184=head1 BENCHMARKS 1252=head1 BENCHMARKS
1185 1253
1186To give you an idea of the performance and overheads that AnyEvent adds 1254To give you an idea of the performance and overheads that AnyEvent adds
1188of various event loops I prepared some benchmarks. 1256of various event loops I prepared some benchmarks.
1189 1257
1190=head2 BENCHMARKING ANYEVENT OVERHEAD 1258=head2 BENCHMARKING ANYEVENT OVERHEAD
1191 1259
1192Here is a benchmark of various supported event models used natively and 1260Here is a benchmark of various supported event models used natively and
1193through anyevent. The benchmark creates a lot of timers (with a zero 1261through AnyEvent. The benchmark creates a lot of timers (with a zero
1194timeout) and I/O watchers (watching STDOUT, a pty, to become writable, 1262timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
1195which it is), lets them fire exactly once and destroys them again. 1263which it is), lets them fire exactly once and destroys them again.
1196 1264
1197Source code for this benchmark is found as F<eg/bench> in the AnyEvent 1265Source code for this benchmark is found as F<eg/bench> in the AnyEvent
1198distribution. 1266distribution.
1215all watchers, to avoid adding memory overhead. That means closure creation 1283all watchers, to avoid adding memory overhead. That means closure creation
1216and memory usage is not included in the figures. 1284and memory usage is not included in the figures.
1217 1285
1218I<invoke> is the time, in microseconds, used to invoke a simple 1286I<invoke> is the time, in microseconds, used to invoke a simple
1219callback. The callback simply counts down a Perl variable and after it was 1287callback. The callback simply counts down a Perl variable and after it was
1220invoked "watcher" times, it would C<< ->broadcast >> a condvar once to 1288invoked "watcher" times, it would C<< ->send >> a condvar once to
1221signal the end of this phase. 1289signal the end of this phase.
1222 1290
1223I<destroy> is the time, in microseconds, that it takes to destroy a single 1291I<destroy> is the time, in microseconds, that it takes to destroy a single
1224watcher. 1292watcher.
1225 1293
1321 1389
1322=back 1390=back
1323 1391
1324=head2 BENCHMARKING THE LARGE SERVER CASE 1392=head2 BENCHMARKING THE LARGE SERVER CASE
1325 1393
1326This benchmark atcually benchmarks the event loop itself. It works by 1394This benchmark actually benchmarks the event loop itself. It works by
1327creating a number of "servers": each server consists of a socketpair, a 1395creating a number of "servers": each server consists of a socket pair, a
1328timeout watcher that gets reset on activity (but never fires), and an I/O 1396timeout watcher that gets reset on activity (but never fires), and an I/O
1329watcher waiting for input on one side of the socket. Each time the socket 1397watcher waiting for input on one side of the socket. Each time the socket
1330watcher reads a byte it will write that byte to a random other "server". 1398watcher reads a byte it will write that byte to a random other "server".
1331 1399
1332The effect is that there will be a lot of I/O watchers, only part of which 1400The effect is that there will be a lot of I/O watchers, only part of which
1333are active at any one point (so there is a constant number of active 1401are active at any one point (so there is a constant number of active
1334fds for each loop iterstaion, but which fds these are is random). The 1402fds for each loop iteration, but which fds these are is random). The
1335timeout is reset each time something is read because that reflects how 1403timeout is reset each time something is read because that reflects how
1336most timeouts work (and puts extra pressure on the event loops). 1404most timeouts work (and puts extra pressure on the event loops).
1337 1405
1338In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100 1406In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1339(1%) are active. This mirrors the activity of large servers with many 1407(1%) are active. This mirrors the activity of large servers with many
1340connections, most of which are idle at any one point in time. 1408connections, most of which are idle at any one point in time.
1341 1409
1342Source code for this benchmark is found as F<eg/bench2> in the AnyEvent 1410Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1343distribution. 1411distribution.
1345=head3 Explanation of the columns 1413=head3 Explanation of the columns
1346 1414
1347I<sockets> is the number of sockets, and twice the number of "servers" (as 1415I<sockets> is the number of sockets, and twice the number of "servers" (as
1348each server has a read and write socket end). 1416each server has a read and write socket end).
1349 1417
1350I<create> is the time it takes to create a socketpair (which is 1418I<create> is the time it takes to create a socket pair (which is
1351nontrivial) and two watchers: an I/O watcher and a timeout watcher. 1419nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1352 1420
1353I<request>, the most important value, is the time it takes to handle a 1421I<request>, the most important value, is the time it takes to handle a
1354single "request", that is, reading the token from the pipe and forwarding 1422single "request", that is, reading the token from the pipe and forwarding
1355it to another server. This includes deleting the old timeout and creating 1423it to another server. This includes deleting the old timeout and creating
1428speed most when you have lots of watchers, not when you only have a few of 1496speed most when you have lots of watchers, not when you only have a few of
1429them). 1497them).
1430 1498
1431EV is again fastest. 1499EV is again fastest.
1432 1500
1433Perl again comes second. It is noticably faster than the C-based event 1501Perl again comes second. It is noticeably faster than the C-based event
1434loops Event and Glib, although the difference is too small to really 1502loops Event and Glib, although the difference is too small to really
1435matter. 1503matter.
1436 1504
1437POE also performs much better in this case, but is is still far behind the 1505POE also performs much better in this case, but is is still far behind the
1438others. 1506others.
1478probably even less useful to an attacker than PERL_ANYEVENT_MODEL). 1546probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
1479 1547
1480 1548
1481=head1 SEE ALSO 1549=head1 SEE ALSO
1482 1550
1551Utility functions: L<AnyEvent::Util>.
1552
1483Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>, 1553Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1484L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>. 1554L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1485 1555
1486Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>, 1556Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1487L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, 1557L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1488L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>, 1558L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1489L<AnyEvent::Impl::POE>. 1559L<AnyEvent::Impl::POE>.
1490 1560
1561Non-blocking file handles, sockets, TCP clients and
1562servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1563
1564Asynchronous DNS: L<AnyEvent::DNS>.
1565
1491Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>, 1566Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1492 1567
1493Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1568Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1494 1569
1495 1570
1496=head1 AUTHOR 1571=head1 AUTHOR
1497 1572
1498 Marc Lehmann <schmorp@schmorp.de> 1573 Marc Lehmann <schmorp@schmorp.de>

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines