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