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 | |
… | |
… | |
15 | my $w = AnyEvent->timer (after => $seconds, cb => sub { |
15 | my $w = AnyEvent->timer (after => $seconds, cb => sub { |
16 | ... |
16 | ... |
17 | }); |
17 | }); |
18 | |
18 | |
19 | my $w = AnyEvent->condvar; # stores whether a condition was flagged |
19 | my $w = AnyEvent->condvar; # stores whether a condition was flagged |
|
|
20 | $w->send; # wake up current and all future recv's |
20 | $w->wait; # enters "main loop" till $condvar gets ->send |
21 | $w->recv; # enters "main loop" till $condvar gets ->send |
21 | $w->send; # wake up current and all future wait's |
|
|
22 | |
22 | |
23 | =head1 WHY YOU SHOULD USE THIS MODULE (OR NOT) |
23 | =head1 WHY YOU SHOULD USE THIS MODULE (OR NOT) |
24 | |
24 | |
25 | Glib, POE, IO::Async, Event... CPAN offers event models by the dozen |
25 | Glib, POE, IO::Async, Event... CPAN offers event models by the dozen |
26 | nowadays. So what is different about AnyEvent? |
26 | nowadays. So what is different about AnyEvent? |
… | |
… | |
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 |
… | |
… | |
278 | C<fork> the child (alternatively, you can call C<AnyEvent::detect>). |
278 | C<fork> the child (alternatively, you can call C<AnyEvent::detect>). |
279 | |
279 | |
280 | Example: fork a process and wait for it |
280 | Example: fork a process and wait for it |
281 | |
281 | |
282 | my $done = AnyEvent->condvar; |
282 | my $done = AnyEvent->condvar; |
283 | |
|
|
284 | AnyEvent::detect; # force event module to be initialised |
|
|
285 | |
283 | |
286 | my $pid = fork or exit 5; |
284 | my $pid = fork or exit 5; |
287 | |
285 | |
288 | my $w = AnyEvent->child ( |
286 | my $w = AnyEvent->child ( |
289 | pid => $pid, |
287 | pid => $pid, |
… | |
… | |
293 | $done->send; |
291 | $done->send; |
294 | }, |
292 | }, |
295 | ); |
293 | ); |
296 | |
294 | |
297 | # do something else, then wait for process exit |
295 | # do something else, then wait for process exit |
298 | $done->wait; |
296 | $done->recv; |
299 | |
297 | |
300 | =head2 CONDITION VARIABLES |
298 | =head2 CONDITION VARIABLES |
301 | |
299 | |
302 | If you are familiar with some event loops you will know that all of them |
300 | If you are familiar with some event loops you will know that all of them |
303 | require you to run some blocking "loop", "run" or similar function that |
301 | require you to run some blocking "loop", "run" or similar function that |
… | |
… | |
312 | Condition variables can be created by calling the C<< AnyEvent->condvar |
310 | Condition variables can be created by calling the C<< AnyEvent->condvar |
313 | >> method, usually without arguments. The only argument pair allowed is |
311 | >> method, usually without arguments. The only argument pair allowed is |
314 | 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 |
315 | becomes true. |
313 | becomes true. |
316 | |
314 | |
317 | After creation, the conditon variable is "false" until it becomes "true" |
315 | After creation, the condition variable is "false" until it becomes "true" |
318 | 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). |
319 | |
318 | |
320 | Condition variables are similar to callbacks, except that you can |
319 | Condition variables are similar to callbacks, except that you can |
321 | 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 |
322 | in time where multiple outstandign events have been processed. And yet |
321 | in time where multiple outstanding events have been processed. And yet |
323 | 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 |
324 | 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 |
325 | a result. |
324 | a result. |
326 | |
325 | |
327 | Condition variables are very useful to signal that something has finished, |
326 | Condition variables are very useful to signal that something has finished, |
328 | 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, |
329 | then a condition variable would be the ideal candidate to signal the |
328 | then a condition variable would be the ideal candidate to signal the |
330 | availability of results. The user can either act when the callback is |
329 | availability of results. The user can either act when the callback is |
331 | called or can synchronously C<< ->wait >> for the results. |
330 | called or can synchronously C<< ->recv >> for the results. |
332 | |
331 | |
333 | You can also use them to simulate traditional event loops - for example, |
332 | You can also use them to simulate traditional event loops - for example, |
334 | 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 |
335 | could C<< ->wait >> in your main program until the user clicks the Quit |
334 | could C<< ->recv >> in your main program until the user clicks the Quit |
336 | button of your app, which would C<< ->send >> the "quit" event. |
335 | button of your app, which would C<< ->send >> the "quit" event. |
337 | |
336 | |
338 | 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 |
339 | two pieces of code that call C<< ->wait >> in a round-robbin fashion, you |
338 | two pieces of code that call C<< ->recv >> in a round-robin fashion, you |
340 | 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 |
341 | 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, |
342 | as this asks for trouble. |
341 | as this asks for trouble. |
343 | |
342 | |
344 | 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 |
… | |
… | |
349 | |
348 | |
350 | 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 |
351 | eventually calls C<< -> send >>, and the "consumer side", which waits |
350 | eventually calls C<< -> send >>, and the "consumer side", which waits |
352 | for the send to occur. |
351 | for the send to occur. |
353 | |
352 | |
354 | Example: |
353 | Example: wait for a timer. |
355 | |
354 | |
356 | # wait till the result is ready |
355 | # wait till the result is ready |
357 | my $result_ready = AnyEvent->condvar; |
356 | my $result_ready = AnyEvent->condvar; |
358 | |
357 | |
359 | # do something such as adding a timer |
358 | # do something such as adding a timer |
… | |
… | |
365 | cb => sub { $result_ready->send }, |
364 | cb => sub { $result_ready->send }, |
366 | ); |
365 | ); |
367 | |
366 | |
368 | # this "blocks" (while handling events) till the callback |
367 | # this "blocks" (while handling events) till the callback |
369 | # calls send |
368 | # calls send |
370 | $result_ready->wait; |
369 | $result_ready->recv; |
|
|
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; |
371 | |
377 | |
372 | =head3 METHODS FOR PRODUCERS |
378 | =head3 METHODS FOR PRODUCERS |
373 | |
379 | |
374 | 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 |
375 | 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 |
… | |
… | |
378 | |
384 | |
379 | =over 4 |
385 | =over 4 |
380 | |
386 | |
381 | =item $cv->send (...) |
387 | =item $cv->send (...) |
382 | |
388 | |
383 | Flag the condition as ready - a running C<< ->wait >> and all further |
389 | Flag the condition as ready - a running C<< ->recv >> and all further |
384 | calls to C<wait> will (eventually) return after this method has been |
390 | calls to C<recv> will (eventually) return after this method has been |
385 | called. If nobody is waiting the send will be remembered. |
391 | called. If nobody is waiting the send will be remembered. |
386 | |
392 | |
387 | 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 |
388 | immediately from within send. |
394 | immediately from within send. |
389 | |
395 | |
390 | 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 |
391 | future C<< ->wait >> 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>. |
392 | |
401 | |
393 | =item $cv->croak ($error) |
402 | =item $cv->croak ($error) |
394 | |
403 | |
395 | Similar to send, but causes all call's wait C<< ->wait >> to invoke |
404 | Similar to send, but causes all call's to C<< ->recv >> to invoke |
396 | C<Carp::croak> with the given error message/object/scalar. |
405 | C<Carp::croak> with the given error message/object/scalar. |
397 | |
406 | |
398 | This can be used to signal any errors to the condition variable |
407 | This can be used to signal any errors to the condition variable |
399 | user/consumer. |
408 | user/consumer. |
400 | |
409 | |
401 | =item $cv->begin ([group callback]) |
410 | =item $cv->begin ([group callback]) |
402 | |
411 | |
403 | =item $cv->end |
412 | =item $cv->end |
|
|
413 | |
|
|
414 | These two methods are EXPERIMENTAL and MIGHT CHANGE. |
404 | |
415 | |
405 | These two methods can be used to combine many transactions/events into |
416 | These two methods can be used to combine many transactions/events into |
406 | one. For example, a function that pings many hosts in parallel might want |
417 | one. For example, a function that pings many hosts in parallel might want |
407 | to use a condition variable for the whole process. |
418 | to use a condition variable for the whole process. |
408 | |
419 | |
… | |
… | |
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 | |
454 | These methods should only be used by the consuming side, i.e. the |
465 | These methods should only be used by the consuming side, i.e. the |
455 | code awaits the condition. |
466 | code awaits the condition. |
456 | |
467 | |
457 | =over 4 |
468 | =over 4 |
458 | |
469 | |
459 | =item $cv->wait |
470 | =item $cv->recv |
460 | |
471 | |
461 | Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak |
472 | Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak |
462 | >> methods have been called on c<$cv>, while servicing other watchers |
473 | >> methods have been called on c<$cv>, while servicing other watchers |
463 | normally. |
474 | normally. |
464 | |
475 | |
… | |
… | |
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<< ->wait >> 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<< ->wait >>'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. |
486 | |
497 | |
487 | The L<Coro> module, however, I<can> and I<does> supply coroutines and, in |
498 | The L<Coro> module, however, I<can> and I<does> supply coroutines and, in |
488 | fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe |
499 | fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe |
489 | versions and also integrates coroutines into AnyEvent, making blocking |
500 | versions and also integrates coroutines into AnyEvent, making blocking |
490 | C<< ->wait >> calls perfectly safe as long as they are done from another |
501 | C<< ->recv >> calls perfectly safe as long as they are done from another |
491 | coroutine (one that doesn't run the event loop). |
502 | coroutine (one that doesn't run the event loop). |
492 | |
503 | |
493 | You can ensure that C<< -wait >> never blocks by setting a callback and |
504 | You can ensure that C<< -recv >> never blocks by setting a callback and |
494 | only calling C<< ->wait >> from within that callback (or at a later |
505 | only calling C<< ->recv >> from within that callback (or at a later |
495 | time). This will work even when the event loop does not support blocking |
506 | time). This will work even when the event loop does not support blocking |
496 | waits otherwise. |
507 | waits otherwise. |
497 | |
508 | |
498 | =item $bool = $cv->ready |
509 | =item $bool = $cv->ready |
499 | |
510 | |
… | |
… | |
504 | |
515 | |
505 | This is a mutator function that returns the callback set and optionally |
516 | This is a mutator function that returns the callback set and optionally |
506 | replaces it before doing so. |
517 | replaces it before doing so. |
507 | |
518 | |
508 | The callback will be called when the condition becomes "true", i.e. when |
519 | The callback will be called when the condition becomes "true", i.e. when |
509 | C<send> or C<croak> are called. Calling C<wait> inside the callback |
520 | C<send> or C<croak> are called. Calling C<recv> inside the callback |
510 | or at any later time is guaranteed not to block. |
521 | or at any later time is guaranteed not to block. |
511 | |
522 | |
512 | =back |
523 | =back |
513 | |
524 | |
514 | =head1 GLOBAL VARIABLES AND FUNCTIONS |
525 | =head1 GLOBAL VARIABLES AND FUNCTIONS |
… | |
… | |
582 | Be careful when you create watchers in the module body - AnyEvent will |
593 | Be careful when you create watchers in the module body - AnyEvent will |
583 | decide which event module to use as soon as the first method is called, so |
594 | decide which event module to use as soon as the first method is called, so |
584 | by calling AnyEvent in your module body you force the user of your module |
595 | by calling AnyEvent in your module body you force the user of your module |
585 | to load the event module first. |
596 | to load the event module first. |
586 | |
597 | |
587 | Never call C<< ->wait >> on a condition variable unless you I<know> that |
598 | Never call C<< ->recv >> on a condition variable unless you I<know> that |
588 | the C<< ->send >> method has been called on it already. This is |
599 | the C<< ->send >> method has been called on it already. This is |
589 | because it will stall the whole program, and the whole point of using |
600 | because it will stall the whole program, and the whole point of using |
590 | events is to stay interactive. |
601 | events is to stay interactive. |
591 | |
602 | |
592 | It is fine, however, to call C<< ->wait >> when the user of your module |
603 | It is fine, however, to call C<< ->recv >> when the user of your module |
593 | requests it (i.e. if you create a http request object ad have a method |
604 | requests it (i.e. if you create a http request object ad have a method |
594 | called C<results> that returns the results, it should call C<< ->wait >> |
605 | called C<results> that returns the results, it should call C<< ->recv >> |
595 | freely, as the user of your module knows what she is doing. always). |
606 | freely, as the user of your module knows what she is doing. always). |
596 | |
607 | |
597 | =head1 WHAT TO DO IN THE MAIN PROGRAM |
608 | =head1 WHAT TO DO IN THE MAIN PROGRAM |
598 | |
609 | |
599 | There will always be a single main program - the only place that should |
610 | There will always be a single main program - the only place that should |
… | |
… | |
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 | |
636 | =item L<AnyEvent::Socket> |
647 | =item L<AnyEvent::Socket> |
637 | |
648 | |
638 | Provides a means to do non-blocking connects, accepts etc. |
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. |
639 | |
652 | |
640 | =item L<AnyEvent::HTTPD> |
653 | =item L<AnyEvent::HTTPD> |
641 | |
654 | |
642 | Provides a simple web application server framework. |
655 | Provides a simple web application server framework. |
643 | |
656 | |
644 | =item L<AnyEvent::DNS> |
657 | =item L<AnyEvent::DNS> |
645 | |
658 | |
646 | Provides asynchronous DNS resolver capabilities, beyond what |
659 | Provides rich asynchronous DNS resolver capabilities. |
647 | L<AnyEvent::Util> offers. |
|
|
648 | |
660 | |
649 | =item L<AnyEvent::FastPing> |
661 | =item L<AnyEvent::FastPing> |
650 | |
662 | |
651 | The fastest ping in the west. |
663 | The fastest ping in the west. |
652 | |
664 | |
… | |
… | |
669 | |
681 | |
670 | =item L<Coro> |
682 | =item L<Coro> |
671 | |
683 | |
672 | Has special support for AnyEvent via L<Coro::AnyEvent>. |
684 | Has special support for AnyEvent via L<Coro::AnyEvent>. |
673 | |
685 | |
|
|
686 | =item L<AnyEvent::AIO>, L<IO::AIO> |
|
|
687 | |
|
|
688 | Truly asynchronous I/O, should be in the toolbox of every event |
|
|
689 | programmer. AnyEvent::AIO transparently fuses IO::AIO and AnyEvent |
|
|
690 | together. |
|
|
691 | |
|
|
692 | =item L<AnyEvent::BDB>, L<BDB> |
|
|
693 | |
|
|
694 | Truly asynchronous Berkeley DB access. AnyEvent::AIO transparently fuses |
|
|
695 | IO::AIO and AnyEvent together. |
|
|
696 | |
674 | =item L<IO::Lambda> |
697 | =item L<IO::Lambda> |
675 | |
698 | |
676 | The lambda approach to I/O - don't ask, look there. Can use AnyEvent. |
699 | The lambda approach to I/O - don't ask, look there. Can use AnyEvent. |
677 | |
|
|
678 | =item L<IO::AIO> |
|
|
679 | |
|
|
680 | Truly asynchronous I/O, should be in the toolbox of every event |
|
|
681 | programmer. Can be trivially made to use AnyEvent. |
|
|
682 | |
|
|
683 | =item L<BDB> |
|
|
684 | |
|
|
685 | Truly asynchronous Berkeley DB access. Can be trivially made to use |
|
|
686 | AnyEvent. |
|
|
687 | |
700 | |
688 | =back |
701 | =back |
689 | |
702 | |
690 | =cut |
703 | =cut |
691 | |
704 | |
… | |
… | |
694 | no warnings; |
707 | no warnings; |
695 | use strict; |
708 | use strict; |
696 | |
709 | |
697 | use Carp; |
710 | use Carp; |
698 | |
711 | |
699 | our $VERSION = '3.4'; |
712 | our $VERSION = '4.0'; |
700 | our $MODEL; |
713 | our $MODEL; |
701 | |
714 | |
702 | our $AUTOLOAD; |
715 | our $AUTOLOAD; |
703 | our @ISA; |
716 | our @ISA; |
704 | |
717 | |
705 | our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; |
718 | our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; |
706 | |
719 | |
707 | 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 | } |
708 | |
729 | |
709 | my @models = ( |
730 | my @models = ( |
710 | [EV:: => AnyEvent::Impl::EV::], |
731 | [EV:: => AnyEvent::Impl::EV::], |
711 | [Event:: => AnyEvent::Impl::Event::], |
732 | [Event:: => AnyEvent::Impl::Event::], |
712 | [Tk:: => AnyEvent::Impl::Tk::], |
733 | [Tk:: => AnyEvent::Impl::Tk::], |
… | |
… | |
733 | 1 |
754 | 1 |
734 | } else { |
755 | } else { |
735 | push @post_detect, $cb; |
756 | push @post_detect, $cb; |
736 | |
757 | |
737 | defined wantarray |
758 | defined wantarray |
738 | ? bless \$cb, "AnyEvent::Util::Guard" |
759 | ? bless \$cb, "AnyEvent::Util::PostDetect" |
739 | : () |
760 | : () |
740 | } |
761 | } |
741 | } |
762 | } |
742 | |
763 | |
743 | sub AnyEvent::Util::Guard::DESTROY { |
764 | sub AnyEvent::Util::PostDetect::DESTROY { |
744 | @post_detect = grep $_ != ${$_[0]}, @post_detect; |
765 | @post_detect = grep $_ != ${$_[0]}, @post_detect; |
745 | } |
766 | } |
746 | |
767 | |
747 | sub detect() { |
768 | sub detect() { |
748 | unless ($MODEL) { |
769 | unless ($MODEL) { |
… | |
… | |
811 | $class->$func (@_); |
832 | $class->$func (@_); |
812 | } |
833 | } |
813 | |
834 | |
814 | package AnyEvent::Base; |
835 | package AnyEvent::Base; |
815 | |
836 | |
816 | # default implementation for ->condvar, ->wait, ->broadcast |
837 | # default implementation for ->condvar |
817 | |
838 | |
818 | sub condvar { |
839 | sub condvar { |
819 | bless \my $flag, "AnyEvent::Base::CondVar" |
840 | bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar:: |
820 | } |
|
|
821 | |
|
|
822 | sub AnyEvent::Base::CondVar::broadcast { |
|
|
823 | ${$_[0]}++; |
|
|
824 | } |
|
|
825 | |
|
|
826 | sub AnyEvent::Base::CondVar::wait { |
|
|
827 | AnyEvent->one_event while !${$_[0]}; |
|
|
828 | } |
841 | } |
829 | |
842 | |
830 | # default implementation for ->signal |
843 | # default implementation for ->signal |
831 | |
844 | |
832 | our %SIG_CB; |
845 | our %SIG_CB; |
… | |
… | |
906 | delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; |
919 | delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; |
907 | |
920 | |
908 | undef $CHLD_W unless keys %PID_CB; |
921 | undef $CHLD_W unless keys %PID_CB; |
909 | } |
922 | } |
910 | |
923 | |
|
|
924 | package AnyEvent::CondVar; |
|
|
925 | |
|
|
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 | |
|
|
934 | sub _send { |
|
|
935 | # nop |
|
|
936 | } |
|
|
937 | |
|
|
938 | sub send { |
|
|
939 | my $cv = shift; |
|
|
940 | $cv->{_ae_sent} = [@_]; |
|
|
941 | (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb}; |
|
|
942 | $cv->_send; |
|
|
943 | } |
|
|
944 | |
|
|
945 | sub croak { |
|
|
946 | $_[0]{_ae_croak} = $_[1]; |
|
|
947 | $_[0]->send; |
|
|
948 | } |
|
|
949 | |
|
|
950 | sub ready { |
|
|
951 | $_[0]{_ae_sent} |
|
|
952 | } |
|
|
953 | |
|
|
954 | sub _wait { |
|
|
955 | AnyEvent->one_event while !$_[0]{_ae_sent}; |
|
|
956 | } |
|
|
957 | |
|
|
958 | sub recv { |
|
|
959 | $_[0]->_wait; |
|
|
960 | |
|
|
961 | Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak}; |
|
|
962 | wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0] |
|
|
963 | } |
|
|
964 | |
|
|
965 | sub cb { |
|
|
966 | $_[0]{_ae_cb} = $_[1] if @_ > 1; |
|
|
967 | $_[0]{_ae_cb} |
|
|
968 | } |
|
|
969 | |
|
|
970 | sub begin { |
|
|
971 | ++$_[0]{_ae_counter}; |
|
|
972 | $_[0]{_ae_end_cb} = $_[1] if @_ > 1; |
|
|
973 | } |
|
|
974 | |
|
|
975 | sub end { |
|
|
976 | return if --$_[0]{_ae_counter}; |
|
|
977 | &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } }; |
|
|
978 | } |
|
|
979 | |
|
|
980 | # undocumented/compatibility with pre-3.4 |
|
|
981 | *broadcast = \&send; |
|
|
982 | *wait = \&_wait; |
|
|
983 | |
911 | =head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE |
984 | =head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE |
912 | |
985 | |
913 | 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 |
914 | 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 |
915 | provide AnyEvent compatibility. |
988 | provide AnyEvent compatibility. |
… | |
… | |
971 | model it chooses. |
1044 | model it chooses. |
972 | |
1045 | |
973 | =item C<PERL_ANYEVENT_MODEL> |
1046 | =item C<PERL_ANYEVENT_MODEL> |
974 | |
1047 | |
975 | 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 |
976 | autodetection and -probing kicks in. It must be a string consisting |
1049 | auto detection and -probing kicks in. It must be a string consisting |
977 | entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended |
1050 | entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended |
978 | 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, |
979 | 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 |
980 | autodetection and -probing. |
1053 | auto detection and -probing. |
981 | |
1054 | |
982 | This functionality might change in future versions. |
1055 | This functionality might change in future versions. |
983 | |
1056 | |
984 | 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 |
985 | could start your program like this: |
1058 | could start your program like this: |
986 | |
1059 | |
987 | 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. |
988 | |
1092 | |
989 | =back |
1093 | =back |
990 | |
1094 | |
991 | =head1 EXAMPLE PROGRAM |
1095 | =head1 EXAMPLE PROGRAM |
992 | |
1096 | |
… | |
… | |
1003 | poll => 'r', |
1107 | poll => 'r', |
1004 | cb => sub { |
1108 | cb => sub { |
1005 | warn "io event <$_[0]>\n"; # will always output <r> |
1109 | warn "io event <$_[0]>\n"; # will always output <r> |
1006 | chomp (my $input = <STDIN>); # read a line |
1110 | chomp (my $input = <STDIN>); # read a line |
1007 | warn "read: $input\n"; # output what has been read |
1111 | warn "read: $input\n"; # output what has been read |
1008 | $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i |
1112 | $cv->send if $input =~ /^q/i; # quit program if /^q/i |
1009 | }, |
1113 | }, |
1010 | ); |
1114 | ); |
1011 | |
1115 | |
1012 | my $time_watcher; # can only be used once |
1116 | my $time_watcher; # can only be used once |
1013 | |
1117 | |
… | |
… | |
1018 | }); |
1122 | }); |
1019 | } |
1123 | } |
1020 | |
1124 | |
1021 | new_timer; # create first timer |
1125 | new_timer; # create first timer |
1022 | |
1126 | |
1023 | $cv->wait; # wait until user enters /^q/i |
1127 | $cv->recv; # wait until user enters /^q/i |
1024 | |
1128 | |
1025 | =head1 REAL-WORLD EXAMPLE |
1129 | =head1 REAL-WORLD EXAMPLE |
1026 | |
1130 | |
1027 | 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 |
1028 | 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: |
… | |
… | |
1078 | syswrite $txn->{fh}, $txn->{request} |
1182 | syswrite $txn->{fh}, $txn->{request} |
1079 | or die "connection or write error"; |
1183 | or die "connection or write error"; |
1080 | $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 }); |
1081 | |
1185 | |
1082 | 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 |
1083 | result and signals any possible waiters that the request ahs finished: |
1187 | result and signals any possible waiters that the request has finished: |
1084 | |
1188 | |
1085 | sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; |
1189 | sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; |
1086 | |
1190 | |
1087 | if (end-of-file or data complete) { |
1191 | if (end-of-file or data complete) { |
1088 | $txn->{result} = $txn->{buf}; |
1192 | $txn->{result} = $txn->{buf}; |
1089 | $txn->{finished}->broadcast; |
1193 | $txn->{finished}->send; |
1090 | $txb->{cb}->($txn) of $txn->{cb}; # also call callback |
1194 | $txb->{cb}->($txn) of $txn->{cb}; # also call callback |
1091 | } |
1195 | } |
1092 | |
1196 | |
1093 | 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 |
1094 | 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 |
1095 | data: |
1199 | data: |
1096 | |
1200 | |
1097 | $txn->{finished}->wait; |
1201 | $txn->{finished}->recv; |
1098 | return $txn->{result}; |
1202 | return $txn->{result}; |
1099 | |
1203 | |
1100 | 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) |
1101 | that occured during request processing. The C<result> method detects |
1205 | that occurred during request processing. The C<result> method detects |
1102 | 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) |
1103 | and just throws the exception, which means connection errors and other |
1207 | and just throws the exception, which means connection errors and other |
1104 | 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 |
1105 | random callback. |
1209 | random callback. |
1106 | |
1210 | |
… | |
… | |
1137 | |
1241 | |
1138 | my $quit = AnyEvent->condvar; |
1242 | my $quit = AnyEvent->condvar; |
1139 | |
1243 | |
1140 | $fcp->txn_client_get ($url)->cb (sub { |
1244 | $fcp->txn_client_get ($url)->cb (sub { |
1141 | ... |
1245 | ... |
1142 | $quit->broadcast; |
1246 | $quit->send; |
1143 | }); |
1247 | }); |
1144 | |
1248 | |
1145 | $quit->wait; |
1249 | $quit->recv; |
1146 | |
1250 | |
1147 | |
1251 | |
1148 | =head1 BENCHMARKS |
1252 | =head1 BENCHMARKS |
1149 | |
1253 | |
1150 | 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 |
… | |
… | |
1152 | of various event loops I prepared some benchmarks. |
1256 | of various event loops I prepared some benchmarks. |
1153 | |
1257 | |
1154 | =head2 BENCHMARKING ANYEVENT OVERHEAD |
1258 | =head2 BENCHMARKING ANYEVENT OVERHEAD |
1155 | |
1259 | |
1156 | 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 |
1157 | 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 |
1158 | 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, |
1159 | 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. |
1160 | |
1264 | |
1161 | 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 |
1162 | distribution. |
1266 | distribution. |
… | |
… | |
1179 | all watchers, to avoid adding memory overhead. That means closure creation |
1283 | all watchers, to avoid adding memory overhead. That means closure creation |
1180 | and memory usage is not included in the figures. |
1284 | and memory usage is not included in the figures. |
1181 | |
1285 | |
1182 | 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 |
1183 | 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 |
1184 | invoked "watcher" times, it would C<< ->broadcast >> a condvar once to |
1288 | invoked "watcher" times, it would C<< ->send >> a condvar once to |
1185 | signal the end of this phase. |
1289 | signal the end of this phase. |
1186 | |
1290 | |
1187 | 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 |
1188 | watcher. |
1292 | watcher. |
1189 | |
1293 | |
… | |
… | |
1285 | |
1389 | |
1286 | =back |
1390 | =back |
1287 | |
1391 | |
1288 | =head2 BENCHMARKING THE LARGE SERVER CASE |
1392 | =head2 BENCHMARKING THE LARGE SERVER CASE |
1289 | |
1393 | |
1290 | This benchmark atcually benchmarks the event loop itself. It works by |
1394 | This benchmark actually benchmarks the event loop itself. It works by |
1291 | 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 |
1292 | 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 |
1293 | 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 |
1294 | 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". |
1295 | |
1399 | |
1296 | 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 |
1297 | 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 |
1298 | 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 |
1299 | 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 |
1300 | most timeouts work (and puts extra pressure on the event loops). |
1404 | most timeouts work (and puts extra pressure on the event loops). |
1301 | |
1405 | |
1302 | 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 |
1303 | (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 |
1304 | 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. |
1305 | |
1409 | |
1306 | 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 |
1307 | distribution. |
1411 | distribution. |
… | |
… | |
1309 | =head3 Explanation of the columns |
1413 | =head3 Explanation of the columns |
1310 | |
1414 | |
1311 | 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 |
1312 | each server has a read and write socket end). |
1416 | each server has a read and write socket end). |
1313 | |
1417 | |
1314 | 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 |
1315 | 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. |
1316 | |
1420 | |
1317 | 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 |
1318 | 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 |
1319 | 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 |
… | |
… | |
1392 | 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 |
1393 | them). |
1497 | them). |
1394 | |
1498 | |
1395 | EV is again fastest. |
1499 | EV is again fastest. |
1396 | |
1500 | |
1397 | 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 |
1398 | 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 |
1399 | matter. |
1503 | matter. |
1400 | |
1504 | |
1401 | 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 |
1402 | others. |
1506 | others. |
… | |
… | |
1442 | probably even less useful to an attacker than PERL_ANYEVENT_MODEL). |
1546 | probably even less useful to an attacker than PERL_ANYEVENT_MODEL). |
1443 | |
1547 | |
1444 | |
1548 | |
1445 | =head1 SEE ALSO |
1549 | =head1 SEE ALSO |
1446 | |
1550 | |
|
|
1551 | Utility functions: L<AnyEvent::Util>. |
|
|
1552 | |
1447 | 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>, |
1448 | L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>. |
1554 | L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>. |
1449 | |
1555 | |
1450 | Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>, |
1556 | Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>, |
1451 | 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>, |
1452 | L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>, |
1558 | L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>, |
1453 | L<AnyEvent::Impl::POE>. |
1559 | L<AnyEvent::Impl::POE>. |
1454 | |
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 | |
1455 | 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>, |
1456 | |
1567 | |
1457 | Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. |
1568 | Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>. |
1458 | |
1569 | |
1459 | |
1570 | |
1460 | =head1 AUTHOR |
1571 | =head1 AUTHOR |
1461 | |
1572 | |
1462 | Marc Lehmann <schmorp@schmorp.de> |
1573 | Marc Lehmann <schmorp@schmorp.de> |