Section: User Contributed Perl Documentation (3)
Updated: 2008-05-01
Index Return to Main Contents


AnyEvent::Impl::Perl - Pure-Perl event loop and AnyEvent adaptor for itself  


  use AnyEvent;
  # use AnyEvent::Impl::Perl;

  # this module gets loaded automatically as required



This module provides transparent support for AnyEvent in case no other event loop could be found or loaded. You don't have to do anything to make it work with AnyEvent except by possibly loading it before creating the first AnyEvent watcher.

If you want to use this module instead of autoloading another event loop you can simply load it before creating the first watcher.

As for performance, this module is on par with (and usually faster than) most select/poll-based C event modules such as Event or Glib (it does not come close to EV, though), with respect to I/O watchers. Timers are handled less optimally.

This event loop has been optimised for the following cases:

monotonic clock is available
This module will use the POSIX monotonic clock option if it can be detected at runtime, in which case it will not suffer adversely from time jumps.

If no monotonic clock is available, this module will not attempt to correct for time jumps in any way.

The clock chosen will be reported if the environment variable $PERL_ANYEVENT_VERBOSE is set to 8 or higher.

lots of watchers on one fd
This is purely a dirty benchmark optimisation not relevant in practise. The more common case of having one watcher per fd/poll combo is special-cased and still fast.
relatively few active fds per select call
This module expects that only a tiny amount of fds is active at any one time. This is relatively typical of larger servers (but not the case where select traditionally is fast), at the expense of the ``dense activity case'' where most of fds are active (which suits select and poll). The optimal implementation of the ``dense'' case is not much faster, though, so the module should behave very well in most cases.
lots of timer changes/iteration, or none at all
This module sorts the timer list again on each iteration, if timers have been created. If you add lots of timers, this is pretty efficient, but the common case of only adding a few timers is not handled very efficiently.

This should not have much of an impact unless you have hundreds of timers, though.





 Marc Lehmann <>



AUTHOR manual pages