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.119 by root, Sat May 17 19:39:33 2008 UTC vs.
Revision 1.133 by root, Sun May 25 03:44:03 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.
508The callback will be called when the condition becomes "true", i.e. when 519The callback will be called when the condition becomes "true", i.e. when
509C<send> or C<croak> are called. Calling C<recv> inside the callback 520C<send> or C<croak> are called. Calling C<recv> inside the callback
510or at any later time is guaranteed not to block. 521or at any later time is guaranteed not to block.
511 522
512=back 523=back
524
525=head3 MAINLOOP EMULATION
526
527Sometimes (often for short test scripts, or even standalone programs
528who only want to use AnyEvent), you I<do> want your program to block
529indefinitely in some event loop.
530
531In that case, you cna use a condition variable like this:
532
533 AnyEvent->condvar->recv;
534
535This has the effect of entering the event loop and looping forever.
536
537Note that usually your program has some exit condition, in which case
538it is better to use the "traditional" approach of storing a condition
539variable, waiting for it, and sending it when the program should exit
540cleanly.
541
513 542
514=head1 GLOBAL VARIABLES AND FUNCTIONS 543=head1 GLOBAL VARIABLES AND FUNCTIONS
515 544
516=over 4 545=over 4
517 546
631 660
632=item L<AnyEvent::Handle> 661=item L<AnyEvent::Handle>
633 662
634Provide read and write buffers and manages watchers for reads and writes. 663Provide read and write buffers and manages watchers for reads and writes.
635 664
665=item L<AnyEvent::Socket>
666
667Provides various utility functions for (internet protocol) sockets,
668addresses and name resolution. Also functions to create non-blocking tcp
669connections or tcp servers, with IPv6 and SRV record support and more.
670
636=item L<AnyEvent::HTTPD> 671=item L<AnyEvent::HTTPD>
637 672
638Provides a simple web application server framework. 673Provides a simple web application server framework.
639 674
640=item L<AnyEvent::DNS> 675=item L<AnyEvent::DNS>
641 676
642Provides asynchronous DNS resolver capabilities, beyond what 677Provides rich asynchronous DNS resolver capabilities.
643L<AnyEvent::Util> offers.
644 678
645=item L<AnyEvent::FastPing> 679=item L<AnyEvent::FastPing>
646 680
647The fastest ping in the west. 681The fastest ping in the west.
648 682
691no warnings; 725no warnings;
692use strict; 726use strict;
693 727
694use Carp; 728use Carp;
695 729
696our $VERSION = '3.41'; 730our $VERSION = '4.03';
697our $MODEL; 731our $MODEL;
698 732
699our $AUTOLOAD; 733our $AUTOLOAD;
700our @ISA; 734our @ISA;
701 735
702our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 736our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
703 737
704our @REGISTRY; 738our @REGISTRY;
739
740our %PROTOCOL; # (ipv4|ipv6) => (1|2)
741
742{
743 my $idx;
744 $PROTOCOL{$_} = ++$idx
745 for split /\s*,\s*/, $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
746}
705 747
706my @models = ( 748my @models = (
707 [EV:: => AnyEvent::Impl::EV::], 749 [EV:: => AnyEvent::Impl::EV::],
708 [Event:: => AnyEvent::Impl::Event::], 750 [Event:: => AnyEvent::Impl::Event::],
709 [Tk:: => AnyEvent::Impl::Tk::], 751 [Tk:: => AnyEvent::Impl::Tk::],
811package AnyEvent::Base; 853package AnyEvent::Base;
812 854
813# default implementation for ->condvar 855# default implementation for ->condvar
814 856
815sub condvar { 857sub condvar {
816 bless {}, AnyEvent::CondVar:: 858 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
817} 859}
818 860
819# default implementation for ->signal 861# default implementation for ->signal
820 862
821our %SIG_CB; 863our %SIG_CB;
901 943
902our @ISA = AnyEvent::CondVar::Base::; 944our @ISA = AnyEvent::CondVar::Base::;
903 945
904package AnyEvent::CondVar::Base; 946package AnyEvent::CondVar::Base;
905 947
948use overload
949 '&{}' => sub { my $self = shift; sub { $self->send (@_) } },
950 fallback => 1;
951
906sub _send { 952sub _send {
907 # nop 953 # nop
908} 954}
909 955
910sub send { 956sub send {
944 $_[0]{_ae_end_cb} = $_[1] if @_ > 1; 990 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
945} 991}
946 992
947sub end { 993sub end {
948 return if --$_[0]{_ae_counter}; 994 return if --$_[0]{_ae_counter};
949 &{ $_[0]{_ae_end_cb} } if $_[0]{_ae_end_cb}; 995 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
950} 996}
951 997
952# undocumented/compatibility with pre-3.4 998# undocumented/compatibility with pre-3.4
953*broadcast = \&send; 999*broadcast = \&send;
954*wait = \&_wait; 1000*wait = \&_wait;
1016model it chooses. 1062model it chooses.
1017 1063
1018=item C<PERL_ANYEVENT_MODEL> 1064=item C<PERL_ANYEVENT_MODEL>
1019 1065
1020This can be used to specify the event model to be used by AnyEvent, before 1066This can be used to specify the event model to be used by AnyEvent, before
1021autodetection and -probing kicks in. It must be a string consisting 1067auto detection and -probing kicks in. It must be a string consisting
1022entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended 1068entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
1023and the resulting module name is loaded and if the load was successful, 1069and the resulting module name is loaded and if the load was successful,
1024used as event model. If it fails to load AnyEvent will proceed with 1070used as event model. If it fails to load AnyEvent will proceed with
1025autodetection and -probing. 1071auto detection and -probing.
1026 1072
1027This functionality might change in future versions. 1073This functionality might change in future versions.
1028 1074
1029For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you 1075For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
1030could start your program like this: 1076could start your program like this:
1031 1077
1032 PERL_ANYEVENT_MODEL=Perl perl ... 1078 PERL_ANYEVENT_MODEL=Perl perl ...
1079
1080=item C<PERL_ANYEVENT_PROTOCOLS>
1081
1082Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1083for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1084of auto probing).
1085
1086Must be set to a comma-separated list of protocols or address families,
1087current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1088used, and preference will be given to protocols mentioned earlier in the
1089list.
1090
1091This variable can effectively be used for denial-of-service attacks
1092against local programs (e.g. when setuid), although the impact is likely
1093small, as the program has to handle connection errors already-
1094
1095Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1096but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1097- only support IPv4, never try to resolve or contact IPv6
1098addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1099IPv6, but prefer IPv6 over IPv4.
1100
1101=item C<PERL_ANYEVENT_EDNS0>
1102
1103Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1104for DNS. This extension is generally useful to reduce DNS traffic, but
1105some (broken) firewalls drop such DNS packets, which is why it is off by
1106default.
1107
1108Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1109EDNS0 in its DNS requests.
1033 1110
1034=back 1111=back
1035 1112
1036=head1 EXAMPLE PROGRAM 1113=head1 EXAMPLE PROGRAM
1037 1114
1123 syswrite $txn->{fh}, $txn->{request} 1200 syswrite $txn->{fh}, $txn->{request}
1124 or die "connection or write error"; 1201 or die "connection or write error";
1125 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r }); 1202 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
1126 1203
1127Again, C<fh_ready_r> waits till all data has arrived, and then stores the 1204Again, C<fh_ready_r> waits till all data has arrived, and then stores the
1128result and signals any possible waiters that the request ahs finished: 1205result and signals any possible waiters that the request has finished:
1129 1206
1130 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1207 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
1131 1208
1132 if (end-of-file or data complete) { 1209 if (end-of-file or data complete) {
1133 $txn->{result} = $txn->{buf}; 1210 $txn->{result} = $txn->{buf};
1141 1218
1142 $txn->{finished}->recv; 1219 $txn->{finished}->recv;
1143 return $txn->{result}; 1220 return $txn->{result};
1144 1221
1145The actual code goes further and collects all errors (C<die>s, exceptions) 1222The actual code goes further and collects all errors (C<die>s, exceptions)
1146that occured during request processing. The C<result> method detects 1223that occurred during request processing. The C<result> method detects
1147whether an exception as thrown (it is stored inside the $txn object) 1224whether an exception as thrown (it is stored inside the $txn object)
1148and just throws the exception, which means connection errors and other 1225and just throws the exception, which means connection errors and other
1149problems get reported tot he code that tries to use the result, not in a 1226problems get reported tot he code that tries to use the result, not in a
1150random callback. 1227random callback.
1151 1228
1197of various event loops I prepared some benchmarks. 1274of various event loops I prepared some benchmarks.
1198 1275
1199=head2 BENCHMARKING ANYEVENT OVERHEAD 1276=head2 BENCHMARKING ANYEVENT OVERHEAD
1200 1277
1201Here is a benchmark of various supported event models used natively and 1278Here is a benchmark of various supported event models used natively and
1202through anyevent. The benchmark creates a lot of timers (with a zero 1279through AnyEvent. The benchmark creates a lot of timers (with a zero
1203timeout) and I/O watchers (watching STDOUT, a pty, to become writable, 1280timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
1204which it is), lets them fire exactly once and destroys them again. 1281which it is), lets them fire exactly once and destroys them again.
1205 1282
1206Source code for this benchmark is found as F<eg/bench> in the AnyEvent 1283Source code for this benchmark is found as F<eg/bench> in the AnyEvent
1207distribution. 1284distribution.
1330 1407
1331=back 1408=back
1332 1409
1333=head2 BENCHMARKING THE LARGE SERVER CASE 1410=head2 BENCHMARKING THE LARGE SERVER CASE
1334 1411
1335This benchmark atcually benchmarks the event loop itself. It works by 1412This benchmark actually benchmarks the event loop itself. It works by
1336creating a number of "servers": each server consists of a socketpair, a 1413creating a number of "servers": each server consists of a socket pair, a
1337timeout watcher that gets reset on activity (but never fires), and an I/O 1414timeout watcher that gets reset on activity (but never fires), and an I/O
1338watcher waiting for input on one side of the socket. Each time the socket 1415watcher waiting for input on one side of the socket. Each time the socket
1339watcher reads a byte it will write that byte to a random other "server". 1416watcher reads a byte it will write that byte to a random other "server".
1340 1417
1341The effect is that there will be a lot of I/O watchers, only part of which 1418The effect is that there will be a lot of I/O watchers, only part of which
1342are active at any one point (so there is a constant number of active 1419are active at any one point (so there is a constant number of active
1343fds for each loop iterstaion, but which fds these are is random). The 1420fds for each loop iteration, but which fds these are is random). The
1344timeout is reset each time something is read because that reflects how 1421timeout is reset each time something is read because that reflects how
1345most timeouts work (and puts extra pressure on the event loops). 1422most timeouts work (and puts extra pressure on the event loops).
1346 1423
1347In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100 1424In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1348(1%) are active. This mirrors the activity of large servers with many 1425(1%) are active. This mirrors the activity of large servers with many
1349connections, most of which are idle at any one point in time. 1426connections, most of which are idle at any one point in time.
1350 1427
1351Source code for this benchmark is found as F<eg/bench2> in the AnyEvent 1428Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1352distribution. 1429distribution.
1354=head3 Explanation of the columns 1431=head3 Explanation of the columns
1355 1432
1356I<sockets> is the number of sockets, and twice the number of "servers" (as 1433I<sockets> is the number of sockets, and twice the number of "servers" (as
1357each server has a read and write socket end). 1434each server has a read and write socket end).
1358 1435
1359I<create> is the time it takes to create a socketpair (which is 1436I<create> is the time it takes to create a socket pair (which is
1360nontrivial) and two watchers: an I/O watcher and a timeout watcher. 1437nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1361 1438
1362I<request>, the most important value, is the time it takes to handle a 1439I<request>, the most important value, is the time it takes to handle a
1363single "request", that is, reading the token from the pipe and forwarding 1440single "request", that is, reading the token from the pipe and forwarding
1364it to another server. This includes deleting the old timeout and creating 1441it to another server. This includes deleting the old timeout and creating
1437speed most when you have lots of watchers, not when you only have a few of 1514speed most when you have lots of watchers, not when you only have a few of
1438them). 1515them).
1439 1516
1440EV is again fastest. 1517EV is again fastest.
1441 1518
1442Perl again comes second. It is noticably faster than the C-based event 1519Perl again comes second. It is noticeably faster than the C-based event
1443loops Event and Glib, although the difference is too small to really 1520loops Event and Glib, although the difference is too small to really
1444matter. 1521matter.
1445 1522
1446POE also performs much better in this case, but is is still far behind the 1523POE also performs much better in this case, but is is still far behind the
1447others. 1524others.
1487probably even less useful to an attacker than PERL_ANYEVENT_MODEL). 1564probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
1488 1565
1489 1566
1490=head1 SEE ALSO 1567=head1 SEE ALSO
1491 1568
1569Utility functions: L<AnyEvent::Util>.
1570
1492Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>, 1571Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1493L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>. 1572L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1494 1573
1495Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>, 1574Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1496L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, 1575L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1497L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>, 1576L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1498L<AnyEvent::Impl::POE>. 1577L<AnyEvent::Impl::POE>.
1499 1578
1579Non-blocking file handles, sockets, TCP clients and
1580servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1581
1582Asynchronous DNS: L<AnyEvent::DNS>.
1583
1500Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>, 1584Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1501 1585
1502Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1586Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1503 1587
1504 1588
1505=head1 AUTHOR 1589=head1 AUTHOR
1506 1590
1507 Marc Lehmann <schmorp@schmorp.de> 1591 Marc Lehmann <schmorp@schmorp.de>

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines