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.73 by root, Fri Apr 25 07:47:12 2008 UTC vs.
Revision 1.173 by root, Mon Jul 21 03:47:22 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, Coro::EV, Coro::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
7=head1 SYNOPSIS 7=head1 SYNOPSIS
8 8
9 use AnyEvent; 9 use AnyEvent;
10 10
11 my $w = AnyEvent->io (fh => $fh, poll => "r|w", cb => sub { 11 my $w = AnyEvent->io (fh => $fh, poll => "r|w", cb => sub { ... });
12
13 my $w = AnyEvent->timer (after => $seconds, cb => sub { ... });
14 my $w = AnyEvent->timer (after => $seconds, interval => $seconds, cb => ...
15
16 print AnyEvent->now; # prints current event loop time
17 print AnyEvent->time; # think Time::HiRes::time or simply CORE::time.
18
19 my $w = AnyEvent->signal (signal => "TERM", cb => sub { ... });
20
21 my $w = AnyEvent->child (pid => $pid, cb => sub {
22 my ($pid, $status) = @_;
12 ... 23 ...
13 }); 24 });
14 25
15 my $w = AnyEvent->timer (after => $seconds, cb => sub {
16 ...
17 });
18
19 my $w = AnyEvent->condvar; # stores whether a condition was flagged 26 my $w = AnyEvent->condvar; # stores whether a condition was flagged
27 $w->send; # wake up current and all future recv's
20 $w->wait; # enters "main loop" till $condvar gets ->broadcast 28 $w->recv; # enters "main loop" till $condvar gets ->send
21 $w->broadcast; # wake up current and all future wait's 29 # use a condvar in callback mode:
30 $w->cb (sub { $_[0]->recv });
31
32=head1 INTRODUCTION/TUTORIAL
33
34This manpage is mainly a reference manual. If you are interested
35in a tutorial or some gentle introduction, have a look at the
36L<AnyEvent::Intro> manpage.
22 37
23=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT) 38=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT)
24 39
25Glib, POE, IO::Async, Event... CPAN offers event models by the dozen 40Glib, POE, IO::Async, Event... CPAN offers event models by the dozen
26nowadays. So what is different about AnyEvent? 41nowadays. So what is different about AnyEvent?
27 42
28Executive Summary: AnyEvent is I<compatible>, AnyEvent is I<free of 43Executive Summary: AnyEvent is I<compatible>, AnyEvent is I<free of
29policy> and AnyEvent is I<small and efficient>. 44policy> and AnyEvent is I<small and efficient>.
30 45
31First and foremost, I<AnyEvent is not an event model> itself, it only 46First and foremost, I<AnyEvent is not an event model> itself, it only
32interfaces to whatever event model the main program happens to use in a 47interfaces to whatever event model the main program happens to use, in a
33pragmatic way. For event models and certain classes of immortals alike, 48pragmatic way. For event models and certain classes of immortals alike,
34the statement "there can only be one" is a bitter reality: In general, 49the statement "there can only be one" is a bitter reality: In general,
35only one event loop can be active at the same time in a process. AnyEvent 50only one event loop can be active at the same time in a process. AnyEvent
36helps hiding the differences between those event loops. 51cannot change this, but it can hide the differences between those event
52loops.
37 53
38The goal of AnyEvent is to offer module authors the ability to do event 54The goal of AnyEvent is to offer module authors the ability to do event
39programming (waiting for I/O or timer events) without subscribing to a 55programming (waiting for I/O or timer events) without subscribing to a
40religion, a way of living, and most importantly: without forcing your 56religion, a way of living, and most importantly: without forcing your
41module users into the same thing by forcing them to use the same event 57module users into the same thing by forcing them to use the same event
42model you use. 58model you use.
43 59
44For modules like POE or IO::Async (which is a total misnomer as it is 60For modules like POE or IO::Async (which is a total misnomer as it is
45actually doing all I/O I<synchronously>...), using them in your module is 61actually doing all I/O I<synchronously>...), using them in your module is
46like joining a cult: After you joined, you are dependent on them and you 62like joining a cult: After you joined, you are dependent on them and you
47cannot use anything else, as it is simply incompatible to everything that 63cannot use anything else, as they are simply incompatible to everything
48isn't itself. What's worse, all the potential users of your module are 64that isn't them. What's worse, all the potential users of your
49I<also> forced to use the same event loop you use. 65module are I<also> forced to use the same event loop you use.
50 66
51AnyEvent is different: AnyEvent + POE works fine. AnyEvent + Glib works 67AnyEvent is different: AnyEvent + POE works fine. AnyEvent + Glib works
52fine. AnyEvent + Tk works fine etc. etc. but none of these work together 68fine. AnyEvent + Tk works fine etc. etc. but none of these work together
53with the rest: POE + IO::Async? no go. Tk + Event? no go. Again: if 69with the rest: POE + IO::Async? No go. Tk + Event? No go. Again: if
54your module uses one of those, every user of your module has to use it, 70your module uses one of those, every user of your module has to use it,
55too. But if your module uses AnyEvent, it works transparently with all 71too. But if your module uses AnyEvent, it works transparently with all
56event models it supports (including stuff like POE and IO::Async, as long 72event models it supports (including stuff like IO::Async, as long as those
57as those use one of the supported event loops. It is trivial to add new 73use one of the supported event loops. It is trivial to add new event loops
58event loops to AnyEvent, too, so it is future-proof). 74to AnyEvent, too, so it is future-proof).
59 75
60In addition to being free of having to use I<the one and only true event 76In 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 77model>, 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 78modules, 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 79follow. 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 80offering the functionality that is necessary, in as thin as a wrapper as
65technically possible. 81technically possible.
66 82
83Of course, AnyEvent comes with a big (and fully optional!) toolbox
84of useful functionality, such as an asynchronous DNS resolver, 100%
85non-blocking connects (even with TLS/SSL, IPv6 and on broken platforms
86such as Windows) and lots of real-world knowledge and workarounds for
87platform bugs and differences.
88
67Of course, if you want lots of policy (this can arguably be somewhat 89Now, if you I<do want> lots of policy (this can arguably be somewhat
68useful) and you want to force your users to use the one and only event 90useful) and you want to force your users to use the one and only event
69model, you should I<not> use this module. 91model, you should I<not> use this module.
70
71 92
72=head1 DESCRIPTION 93=head1 DESCRIPTION
73 94
74L<AnyEvent> provides an identical interface to multiple event loops. This 95L<AnyEvent> provides an identical interface to multiple event loops. This
75allows module authors to utilise an event loop without forcing module 96allows module authors to utilise an event loop without forcing module
79The interface itself is vaguely similar, but not identical to the L<Event> 100The interface itself is vaguely similar, but not identical to the L<Event>
80module. 101module.
81 102
82During the first call of any watcher-creation method, the module tries 103During the first call of any watcher-creation method, the module tries
83to detect the currently loaded event loop by probing whether one of the 104to detect the currently loaded event loop by probing whether one of the
84following modules is already loaded: L<Coro::EV>, L<Coro::Event>, L<EV>, 105following modules is already loaded: L<EV>,
85L<Event>, L<Glib>, L<Tk>, L<AnyEvent::Impl::Perl>, L<Event::Lib>, L<Qt>, 106L<Event>, L<Glib>, L<AnyEvent::Impl::Perl>, L<Tk>, L<Event::Lib>, L<Qt>,
86L<POE>. The first one found is used. If none are found, the module tries 107L<POE>. The first one found is used. If none are found, the module tries
87to load these modules (excluding Event::Lib, Qt and POE as the pure perl 108to load these modules (excluding Tk, Event::Lib, Qt and POE as the pure perl
88adaptor should always succeed) in the order given. The first one that can 109adaptor should always succeed) in the order given. The first one that can
89be successfully loaded will be used. If, after this, still none could be 110be successfully loaded will be used. If, after this, still none could be
90found, AnyEvent will fall back to a pure-perl event loop, which is not 111found, AnyEvent will fall back to a pure-perl event loop, which is not
91very efficient, but should work everywhere. 112very efficient, but should work everywhere.
92 113
103starts using it, all bets are off. Maybe you should tell their authors to 124starts using it, all bets are off. Maybe you should tell their authors to
104use AnyEvent so their modules work together with others seamlessly... 125use AnyEvent so their modules work together with others seamlessly...
105 126
106The pure-perl implementation of AnyEvent is called 127The pure-perl implementation of AnyEvent is called
107C<AnyEvent::Impl::Perl>. Like other event modules you can load it 128C<AnyEvent::Impl::Perl>. Like other event modules you can load it
108explicitly. 129explicitly and enjoy the high availability of that event loop :)
109 130
110=head1 WATCHERS 131=head1 WATCHERS
111 132
112AnyEvent has the central concept of a I<watcher>, which is an object that 133AnyEvent has the central concept of a I<watcher>, which is an object that
113stores relevant data for each kind of event you are waiting for, such as 134stores relevant data for each kind of event you are waiting for, such as
114the callback to call, the filehandle to watch, etc. 135the callback to call, the file handle to watch, etc.
115 136
116These watchers are normal Perl objects with normal Perl lifetime. After 137These watchers are normal Perl objects with normal Perl lifetime. After
117creating a watcher it will immediately "watch" for events and invoke the 138creating a watcher it will immediately "watch" for events and invoke the
118callback when the event occurs (of course, only when the event model 139callback when the event occurs (of course, only when the event model
119is in control). 140is in control).
127Many watchers either are used with "recursion" (repeating timers for 148Many watchers either are used with "recursion" (repeating timers for
128example), or need to refer to their watcher object in other ways. 149example), or need to refer to their watcher object in other ways.
129 150
130An any way to achieve that is this pattern: 151An any way to achieve that is this pattern:
131 152
132 my $w; $w = AnyEvent->type (arg => value ..., cb => sub { 153 my $w; $w = AnyEvent->type (arg => value ..., cb => sub {
133 # you can use $w here, for example to undef it 154 # you can use $w here, for example to undef it
134 undef $w; 155 undef $w;
135 }); 156 });
136 157
137Note that C<my $w; $w => combination. This is necessary because in Perl, 158Note that C<my $w; $w => combination. This is necessary because in Perl,
138my variables are only visible after the statement in which they are 159my variables are only visible after the statement in which they are
139declared. 160declared.
140 161
141=head2 IO WATCHERS 162=head2 I/O WATCHERS
142 163
143You can create an I/O watcher by calling the C<< AnyEvent->io >> method 164You can create an I/O watcher by calling the C<< AnyEvent->io >> method
144with the following mandatory key-value pairs as arguments: 165with the following mandatory key-value pairs as arguments:
145 166
146C<fh> the Perl I<file handle> (I<not> file descriptor) to watch for 167C<fh> the Perl I<file handle> (I<not> file descriptor) to watch for events
168(AnyEvent might or might not keep a reference to this file handle). C<poll>
147events. C<poll> must be a string that is either C<r> or C<w>, which 169must be a string that is either C<r> or C<w>, which creates a watcher
148creates a watcher waiting for "r"eadable or "w"ritable events, 170waiting for "r"eadable or "w"ritable events, respectively. C<cb> is the
149respectively. C<cb> is the callback to invoke each time the file handle 171callback to invoke each time the file handle becomes ready.
150becomes ready.
151 172
152As long as the I/O watcher exists it will keep the file descriptor or a 173Although the callback might get passed parameters, their value and
153copy of it alive/open. 174presence is undefined and you cannot rely on them. Portable AnyEvent
175callbacks cannot use arguments passed to I/O watcher callbacks.
154 176
177The I/O watcher might use the underlying file descriptor or a copy of it.
155It is not allowed to close a file handle as long as any watcher is active 178You must not close a file handle as long as any watcher is active on the
156on the underlying file descriptor. 179underlying file descriptor.
157 180
158Some event loops issue spurious readyness notifications, so you should 181Some event loops issue spurious readyness notifications, so you should
159always use non-blocking calls when reading/writing from/to your file 182always use non-blocking calls when reading/writing from/to your file
160handles. 183handles.
161 184
162Example:
163
164 # wait for readability of STDIN, then read a line and disable the watcher 185Example: wait for readability of STDIN, then read a line and disable the
186watcher.
187
165 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub { 188 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
166 chomp (my $input = <STDIN>); 189 chomp (my $input = <STDIN>);
167 warn "read: $input\n"; 190 warn "read: $input\n";
168 undef $w; 191 undef $w;
169 }); 192 });
172 195
173You can create a time watcher by calling the C<< AnyEvent->timer >> 196You can create a time watcher by calling the C<< AnyEvent->timer >>
174method with the following mandatory arguments: 197method with the following mandatory arguments:
175 198
176C<after> specifies after how many seconds (fractional values are 199C<after> specifies after how many seconds (fractional values are
177supported) should the timer activate. C<cb> the callback to invoke in that 200supported) the callback should be invoked. C<cb> is the callback to invoke
178case. 201in that case.
179 202
180The timer callback will be invoked at most once: if you want a repeating 203Although the callback might get passed parameters, their value and
181timer you have to create a new watcher (this is a limitation by both Tk 204presence is undefined and you cannot rely on them. Portable AnyEvent
182and Glib). 205callbacks cannot use arguments passed to time watcher callbacks.
183 206
184Example: 207The callback will normally be invoked once only. If you specify another
208parameter, C<interval>, as a strictly positive number (> 0), then the
209callback will be invoked regularly at that interval (in fractional
210seconds) after the first invocation. If C<interval> is specified with a
211false value, then it is treated as if it were missing.
185 212
213The callback will be rescheduled before invoking the callback, but no
214attempt is done to avoid timer drift in most backends, so the interval is
215only approximate.
216
186 # fire an event after 7.7 seconds 217Example: fire an event after 7.7 seconds.
218
187 my $w = AnyEvent->timer (after => 7.7, cb => sub { 219 my $w = AnyEvent->timer (after => 7.7, cb => sub {
188 warn "timeout\n"; 220 warn "timeout\n";
189 }); 221 });
190 222
191 # to cancel the timer: 223 # to cancel the timer:
192 undef $w; 224 undef $w;
193 225
194Example 2:
195
196 # fire an event after 0.5 seconds, then roughly every second 226Example 2: fire an event after 0.5 seconds, then roughly every second.
197 my $w;
198 227
199 my $cb = sub {
200 # cancel the old timer while creating a new one
201 $w = AnyEvent->timer (after => 1, cb => $cb); 228 my $w = AnyEvent->timer (after => 0.5, interval => 1, cb => sub {
229 warn "timeout\n";
202 }; 230 };
203
204 # start the "loop" by creating the first watcher
205 $w = AnyEvent->timer (after => 0.5, cb => $cb);
206 231
207=head3 TIMING ISSUES 232=head3 TIMING ISSUES
208 233
209There are two ways to handle timers: based on real time (relative, "fire 234There are two ways to handle timers: based on real time (relative, "fire
210in 10 seconds") and based on wallclock time (absolute, "fire at 12 235in 10 seconds") and based on wallclock time (absolute, "fire at 12
222timers. 247timers.
223 248
224AnyEvent always prefers relative timers, if available, matching the 249AnyEvent always prefers relative timers, if available, matching the
225AnyEvent API. 250AnyEvent API.
226 251
252AnyEvent has two additional methods that return the "current time":
253
254=over 4
255
256=item AnyEvent->time
257
258This returns the "current wallclock time" as a fractional number of
259seconds since the Epoch (the same thing as C<time> or C<Time::HiRes::time>
260return, and the result is guaranteed to be compatible with those).
261
262It progresses independently of any event loop processing, i.e. each call
263will check the system clock, which usually gets updated frequently.
264
265=item AnyEvent->now
266
267This also returns the "current wallclock time", but unlike C<time>, above,
268this value might change only once per event loop iteration, depending on
269the event loop (most return the same time as C<time>, above). This is the
270time that AnyEvent's timers get scheduled against.
271
272I<In almost all cases (in all cases if you don't care), this is the
273function to call when you want to know the current time.>
274
275This function is also often faster then C<< AnyEvent->time >>, and
276thus the preferred method if you want some timestamp (for example,
277L<AnyEvent::Handle> uses this to update it's activity timeouts).
278
279The rest of this section is only of relevance if you try to be very exact
280with your timing, you can skip it without bad conscience.
281
282For a practical example of when these times differ, consider L<Event::Lib>
283and L<EV> and the following set-up:
284
285The event loop is running and has just invoked one of your callback at
286time=500 (assume no other callbacks delay processing). In your callback,
287you wait a second by executing C<sleep 1> (blocking the process for a
288second) and then (at time=501) you create a relative timer that fires
289after three seconds.
290
291With L<Event::Lib>, C<< AnyEvent->time >> and C<< AnyEvent->now >> will
292both return C<501>, because that is the current time, and the timer will
293be scheduled to fire at time=504 (C<501> + C<3>).
294
295With L<EV>, C<< AnyEvent->time >> returns C<501> (as that is the current
296time), but C<< AnyEvent->now >> returns C<500>, as that is the time the
297last event processing phase started. With L<EV>, your timer gets scheduled
298to run at time=503 (C<500> + C<3>).
299
300In one sense, L<Event::Lib> is more exact, as it uses the current time
301regardless of any delays introduced by event processing. However, most
302callbacks do not expect large delays in processing, so this causes a
303higher drift (and a lot more system calls to get the current time).
304
305In another sense, L<EV> is more exact, as your timer will be scheduled at
306the same time, regardless of how long event processing actually took.
307
308In either case, if you care (and in most cases, you don't), then you
309can get whatever behaviour you want with any event loop, by taking the
310difference between C<< AnyEvent->time >> and C<< AnyEvent->now >> into
311account.
312
313=back
314
227=head2 SIGNAL WATCHERS 315=head2 SIGNAL WATCHERS
228 316
229You can watch for signals using a signal watcher, C<signal> is the signal 317You can watch for signals using a signal watcher, C<signal> is the signal
230I<name> without any C<SIG> prefix, C<cb> is the Perl callback to 318I<name> in uppercase and without any C<SIG> prefix, C<cb> is the Perl
231be invoked whenever a signal occurs. 319callback to be invoked whenever a signal occurs.
232 320
321Although the callback might get passed parameters, their value and
322presence is undefined and you cannot rely on them. Portable AnyEvent
323callbacks cannot use arguments passed to signal watcher callbacks.
324
233Multiple signal occurances can be clumped together into one callback 325Multiple signal occurrences can be clumped together into one callback
234invocation, and callback invocation will be synchronous. synchronous means 326invocation, and callback invocation will be synchronous. Synchronous means
235that it might take a while until the signal gets handled by the process, 327that it might take a while until the signal gets handled by the process,
236but it is guarenteed not to interrupt any other callbacks. 328but it is guaranteed not to interrupt any other callbacks.
237 329
238The main advantage of using these watchers is that you can share a signal 330The main advantage of using these watchers is that you can share a signal
239between multiple watchers. 331between multiple watchers.
240 332
241This watcher might use C<%SIG>, so programs overwriting those signals 333This watcher might use C<%SIG>, so programs overwriting those signals
251 343
252The child process is specified by the C<pid> argument (if set to C<0>, it 344The child process is specified by the C<pid> argument (if set to C<0>, it
253watches for any child process exit). The watcher will trigger as often 345watches for any child process exit). The watcher will trigger as often
254as status change for the child are received. This works by installing a 346as status change for the child are received. This works by installing a
255signal handler for C<SIGCHLD>. The callback will be called with the pid 347signal handler for C<SIGCHLD>. The callback will be called with the pid
256and exit status (as returned by waitpid). 348and exit status (as returned by waitpid), so unlike other watcher types,
349you I<can> rely on child watcher callback arguments.
257 350
258Example: wait for pid 1333 351There is a slight catch to child watchers, however: you usually start them
352I<after> the child process was created, and this means the process could
353have exited already (and no SIGCHLD will be sent anymore).
259 354
355Not all event models handle this correctly (POE doesn't), but even for
356event models that I<do> handle this correctly, they usually need to be
357loaded before the process exits (i.e. before you fork in the first place).
358
359This means you cannot create a child watcher as the very first thing in an
360AnyEvent program, you I<have> to create at least one watcher before you
361C<fork> the child (alternatively, you can call C<AnyEvent::detect>).
362
363Example: fork a process and wait for it
364
365 my $done = AnyEvent->condvar;
366
367 my $pid = fork or exit 5;
368
260 my $w = AnyEvent->child ( 369 my $w = AnyEvent->child (
261 pid => 1333, 370 pid => $pid,
262 cb => sub { 371 cb => sub {
263 my ($pid, $status) = @_; 372 my ($pid, $status) = @_;
264 warn "pid $pid exited with status $status"; 373 warn "pid $pid exited with status $status";
374 $done->send;
265 }, 375 },
266 ); 376 );
377
378 # do something else, then wait for process exit
379 $done->recv;
267 380
268=head2 CONDITION VARIABLES 381=head2 CONDITION VARIABLES
269 382
383If you are familiar with some event loops you will know that all of them
384require you to run some blocking "loop", "run" or similar function that
385will actively watch for new events and call your callbacks.
386
387AnyEvent is different, it expects somebody else to run the event loop and
388will only block when necessary (usually when told by the user).
389
390The instrument to do that is called a "condition variable", so called
391because they represent a condition that must become true.
392
270Condition variables can be created by calling the C<< AnyEvent->condvar >> 393Condition variables can be created by calling the C<< AnyEvent->condvar
271method without any arguments.
272 394
273A condition variable waits for a condition - precisely that the C<< 395>> method, usually without arguments. The only argument pair allowed is
274->broadcast >> method has been called.
275 396
276They are very useful to signal that a condition has been fulfilled, for 397C<cb>, which specifies a callback to be called when the condition variable
398becomes true, with the condition variable as the first argument (but not
399the results).
400
401After creation, the condition variable is "false" until it becomes "true"
402by calling the C<send> method (or calling the condition variable as if it
403were a callback, read about the caveats in the description for the C<<
404->send >> method).
405
406Condition variables are similar to callbacks, except that you can
407optionally wait for them. They can also be called merge points - points
408in time where multiple outstanding events have been processed. And yet
409another way to call them is transactions - each condition variable can be
410used to represent a transaction, which finishes at some point and delivers
411a result.
412
413Condition variables are very useful to signal that something has finished,
277example, if you write a module that does asynchronous http requests, 414for example, if you write a module that does asynchronous http requests,
278then a condition variable would be the ideal candidate to signal the 415then a condition variable would be the ideal candidate to signal the
279availability of results. 416availability of results. The user can either act when the callback is
417called or can synchronously C<< ->recv >> for the results.
280 418
281You can also use condition variables to block your main program until 419You can also use them to simulate traditional event loops - for example,
282an event occurs - for example, you could C<< ->wait >> in your main 420you can block your main program until an event occurs - for example, you
283program until the user clicks the Quit button in your app, which would C<< 421could C<< ->recv >> in your main program until the user clicks the Quit
284->broadcast >> the "quit" event. 422button of your app, which would C<< ->send >> the "quit" event.
285 423
286Note that condition variables recurse into the event loop - if you have 424Note that condition variables recurse into the event loop - if you have
287two pirces of code that call C<< ->wait >> in a round-robbin fashion, you 425two pieces of code that call C<< ->recv >> in a round-robin fashion, you
288lose. Therefore, condition variables are good to export to your caller, but 426lose. Therefore, condition variables are good to export to your caller, but
289you should avoid making a blocking wait yourself, at least in callbacks, 427you should avoid making a blocking wait yourself, at least in callbacks,
290as this asks for trouble. 428as this asks for trouble.
291 429
292This object has two methods: 430Condition variables are represented by hash refs in perl, and the keys
431used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
432easy (it is often useful to build your own transaction class on top of
433AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
434it's C<new> method in your own C<new> method.
435
436There are two "sides" to a condition variable - the "producer side" which
437eventually calls C<< -> send >>, and the "consumer side", which waits
438for the send to occur.
439
440Example: wait for a timer.
441
442 # wait till the result is ready
443 my $result_ready = AnyEvent->condvar;
444
445 # do something such as adding a timer
446 # or socket watcher the calls $result_ready->send
447 # when the "result" is ready.
448 # in this case, we simply use a timer:
449 my $w = AnyEvent->timer (
450 after => 1,
451 cb => sub { $result_ready->send },
452 );
453
454 # this "blocks" (while handling events) till the callback
455 # calls send
456 $result_ready->recv;
457
458Example: wait for a timer, but take advantage of the fact that
459condition variables are also code references.
460
461 my $done = AnyEvent->condvar;
462 my $delay = AnyEvent->timer (after => 5, cb => $done);
463 $done->recv;
464
465Example: Imagine an API that returns a condvar and doesn't support
466callbacks. This is how you make a synchronous call, for example from
467the main program:
468
469 use AnyEvent::CouchDB;
470
471 ...
472
473 my @info = $couchdb->info->recv;
474
475And this is how you would just ste a callback to be called whenever the
476results are available:
477
478 $couchdb->info->cb (sub {
479 my @info = $_[0]->recv;
480 });
481
482=head3 METHODS FOR PRODUCERS
483
484These methods should only be used by the producing side, i.e. the
485code/module that eventually sends the signal. Note that it is also
486the producer side which creates the condvar in most cases, but it isn't
487uncommon for the consumer to create it as well.
293 488
294=over 4 489=over 4
295 490
491=item $cv->send (...)
492
493Flag the condition as ready - a running C<< ->recv >> and all further
494calls to C<recv> will (eventually) return after this method has been
495called. If nobody is waiting the send will be remembered.
496
497If a callback has been set on the condition variable, it is called
498immediately from within send.
499
500Any arguments passed to the C<send> call will be returned by all
501future C<< ->recv >> calls.
502
503Condition variables are overloaded so one can call them directly
504(as a code reference). Calling them directly is the same as calling
505C<send>. Note, however, that many C-based event loops do not handle
506overloading, so as tempting as it may be, passing a condition variable
507instead of a callback does not work. Both the pure perl and EV loops
508support overloading, however, as well as all functions that use perl to
509invoke a callback (as in L<AnyEvent::Socket> and L<AnyEvent::DNS> for
510example).
511
512=item $cv->croak ($error)
513
514Similar to send, but causes all call's to C<< ->recv >> to invoke
515C<Carp::croak> with the given error message/object/scalar.
516
517This can be used to signal any errors to the condition variable
518user/consumer.
519
520=item $cv->begin ([group callback])
521
296=item $cv->wait 522=item $cv->end
297 523
298Wait (blocking if necessary) until the C<< ->broadcast >> method has been 524These two methods are EXPERIMENTAL and MIGHT CHANGE.
525
526These two methods can be used to combine many transactions/events into
527one. For example, a function that pings many hosts in parallel might want
528to use a condition variable for the whole process.
529
530Every call to C<< ->begin >> will increment a counter, and every call to
531C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
532>>, the (last) callback passed to C<begin> will be executed. That callback
533is I<supposed> to call C<< ->send >>, but that is not required. If no
534callback was set, C<send> will be called without any arguments.
535
536Let's clarify this with the ping example:
537
538 my $cv = AnyEvent->condvar;
539
540 my %result;
541 $cv->begin (sub { $cv->send (\%result) });
542
543 for my $host (@list_of_hosts) {
544 $cv->begin;
545 ping_host_then_call_callback $host, sub {
546 $result{$host} = ...;
547 $cv->end;
548 };
549 }
550
551 $cv->end;
552
553This code fragment supposedly pings a number of hosts and calls
554C<send> after results for all then have have been gathered - in any
555order. To achieve this, the code issues a call to C<begin> when it starts
556each ping request and calls C<end> when it has received some result for
557it. Since C<begin> and C<end> only maintain a counter, the order in which
558results arrive is not relevant.
559
560There is an additional bracketing call to C<begin> and C<end> outside the
561loop, which serves two important purposes: first, it sets the callback
562to be called once the counter reaches C<0>, and second, it ensures that
563C<send> is called even when C<no> hosts are being pinged (the loop
564doesn't execute once).
565
566This is the general pattern when you "fan out" into multiple subrequests:
567use an outer C<begin>/C<end> pair to set the callback and ensure C<end>
568is called at least once, and then, for each subrequest you start, call
569C<begin> and for each subrequest you finish, call C<end>.
570
571=back
572
573=head3 METHODS FOR CONSUMERS
574
575These methods should only be used by the consuming side, i.e. the
576code awaits the condition.
577
578=over 4
579
580=item $cv->recv
581
582Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
299called on c<$cv>, while servicing other watchers normally. 583>> methods have been called on c<$cv>, while servicing other watchers
584normally.
300 585
301You can only wait once on a condition - additional calls will return 586You can only wait once on a condition - additional calls are valid but
302immediately. 587will return immediately.
588
589If an error condition has been set by calling C<< ->croak >>, then this
590function will call C<croak>.
591
592In list context, all parameters passed to C<send> will be returned,
593in scalar context only the first one will be returned.
303 594
304Not all event models support a blocking wait - some die in that case 595Not all event models support a blocking wait - some die in that case
305(programs might want to do that to stay interactive), so I<if you are 596(programs might want to do that to stay interactive), so I<if you are
306using this from a module, never require a blocking wait>, but let the 597using this from a module, never require a blocking wait>, but let the
307caller decide whether the call will block or not (for example, by coupling 598caller decide whether the call will block or not (for example, by coupling
308condition variables with some kind of request results and supporting 599condition variables with some kind of request results and supporting
309callbacks so the caller knows that getting the result will not block, 600callbacks so the caller knows that getting the result will not block,
310while still suppporting blocking waits if the caller so desires). 601while still supporting blocking waits if the caller so desires).
311 602
312Another reason I<never> to C<< ->wait >> in a module is that you cannot 603Another reason I<never> to C<< ->recv >> in a module is that you cannot
313sensibly have two C<< ->wait >>'s in parallel, as that would require 604sensibly have two C<< ->recv >>'s in parallel, as that would require
314multiple interpreters or coroutines/threads, none of which C<AnyEvent> 605multiple interpreters or coroutines/threads, none of which C<AnyEvent>
315can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and 606can supply.
316L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
317from different coroutines, however).
318 607
319=item $cv->broadcast 608The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
609fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
610versions and also integrates coroutines into AnyEvent, making blocking
611C<< ->recv >> calls perfectly safe as long as they are done from another
612coroutine (one that doesn't run the event loop).
320 613
321Flag the condition as ready - a running C<< ->wait >> and all further 614You can ensure that C<< -recv >> never blocks by setting a callback and
322calls to C<wait> will (eventually) return after this method has been 615only calling C<< ->recv >> from within that callback (or at a later
323called. If nobody is waiting the broadcast will be remembered.. 616time). This will work even when the event loop does not support blocking
617waits otherwise.
618
619=item $bool = $cv->ready
620
621Returns true when the condition is "true", i.e. whether C<send> or
622C<croak> have been called.
623
624=item $cb = $cv->cb ($cb->($cv))
625
626This is a mutator function that returns the callback set and optionally
627replaces it before doing so.
628
629The callback will be called when the condition becomes "true", i.e. when
630C<send> or C<croak> are called, with the only argument being the condition
631variable itself. Calling C<recv> inside the callback or at any later time
632is guaranteed not to block.
324 633
325=back 634=back
326
327Example:
328
329 # wait till the result is ready
330 my $result_ready = AnyEvent->condvar;
331
332 # do something such as adding a timer
333 # or socket watcher the calls $result_ready->broadcast
334 # when the "result" is ready.
335 # in this case, we simply use a timer:
336 my $w = AnyEvent->timer (
337 after => 1,
338 cb => sub { $result_ready->broadcast },
339 );
340
341 # this "blocks" (while handling events) till the watcher
342 # calls broadcast
343 $result_ready->wait;
344 635
345=head1 GLOBAL VARIABLES AND FUNCTIONS 636=head1 GLOBAL VARIABLES AND FUNCTIONS
346 637
347=over 4 638=over 4
348 639
354C<AnyEvent::Impl:xxx> modules, but can be any other class in the case 645C<AnyEvent::Impl:xxx> modules, but can be any other class in the case
355AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>). 646AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
356 647
357The known classes so far are: 648The known classes so far are:
358 649
359 AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
360 AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
361 AnyEvent::Impl::EV based on EV (an interface to libev, best choice). 650 AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
362 AnyEvent::Impl::Event based on Event, second best choice. 651 AnyEvent::Impl::Event based on Event, second best choice.
652 AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
363 AnyEvent::Impl::Glib based on Glib, third-best choice. 653 AnyEvent::Impl::Glib based on Glib, third-best choice.
364 AnyEvent::Impl::Tk based on Tk, very bad choice. 654 AnyEvent::Impl::Tk based on Tk, very bad choice.
365 AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
366 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs). 655 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
367 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse. 656 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
368 AnyEvent::Impl::POE based on POE, not generic enough for full support. 657 AnyEvent::Impl::POE based on POE, not generic enough for full support.
369 658
370There is no support for WxWidgets, as WxWidgets has no support for 659There is no support for WxWidgets, as WxWidgets has no support for
382Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model 671Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
383if necessary. You should only call this function right before you would 672if necessary. You should only call this function right before you would
384have created an AnyEvent watcher anyway, that is, as late as possible at 673have created an AnyEvent watcher anyway, that is, as late as possible at
385runtime. 674runtime.
386 675
676=item $guard = AnyEvent::post_detect { BLOCK }
677
678Arranges for the code block to be executed as soon as the event model is
679autodetected (or immediately if this has already happened).
680
681If called in scalar or list context, then it creates and returns an object
682that automatically removes the callback again when it is destroyed. See
683L<Coro::BDB> for a case where this is useful.
684
685=item @AnyEvent::post_detect
686
687If there are any code references in this array (you can C<push> to it
688before or after loading AnyEvent), then they will called directly after
689the event loop has been chosen.
690
691You should check C<$AnyEvent::MODEL> before adding to this array, though:
692if it contains a true value then the event loop has already been detected,
693and the array will be ignored.
694
695Best use C<AnyEvent::post_detect { BLOCK }> instead.
696
387=back 697=back
388 698
389=head1 WHAT TO DO IN A MODULE 699=head1 WHAT TO DO IN A MODULE
390 700
391As a module author, you should C<use AnyEvent> and call AnyEvent methods 701As a module author, you should C<use AnyEvent> and call AnyEvent methods
394Be careful when you create watchers in the module body - AnyEvent will 704Be careful when you create watchers in the module body - AnyEvent will
395decide which event module to use as soon as the first method is called, so 705decide which event module to use as soon as the first method is called, so
396by calling AnyEvent in your module body you force the user of your module 706by calling AnyEvent in your module body you force the user of your module
397to load the event module first. 707to load the event module first.
398 708
399Never call C<< ->wait >> on a condition variable unless you I<know> that 709Never call C<< ->recv >> on a condition variable unless you I<know> that
400the C<< ->broadcast >> method has been called on it already. This is 710the C<< ->send >> method has been called on it already. This is
401because it will stall the whole program, and the whole point of using 711because it will stall the whole program, and the whole point of using
402events is to stay interactive. 712events is to stay interactive.
403 713
404It is fine, however, to call C<< ->wait >> when the user of your module 714It is fine, however, to call C<< ->recv >> when the user of your module
405requests it (i.e. if you create a http request object ad have a method 715requests it (i.e. if you create a http request object ad have a method
406called C<results> that returns the results, it should call C<< ->wait >> 716called C<results> that returns the results, it should call C<< ->recv >>
407freely, as the user of your module knows what she is doing. always). 717freely, as the user of your module knows what she is doing. always).
408 718
409=head1 WHAT TO DO IN THE MAIN PROGRAM 719=head1 WHAT TO DO IN THE MAIN PROGRAM
410 720
411There will always be a single main program - the only place that should 721There will always be a single main program - the only place that should
413 723
414If it doesn't care, it can just "use AnyEvent" and use it itself, or not 724If it doesn't care, it can just "use AnyEvent" and use it itself, or not
415do anything special (it does not need to be event-based) and let AnyEvent 725do anything special (it does not need to be event-based) and let AnyEvent
416decide which implementation to chose if some module relies on it. 726decide which implementation to chose if some module relies on it.
417 727
418If the main program relies on a specific event model. For example, in 728If the main program relies on a specific event model - for example, in
419Gtk2 programs you have to rely on the Glib module. You should load the 729Gtk2 programs you have to rely on the Glib module - you should load the
420event module before loading AnyEvent or any module that uses it: generally 730event module before loading AnyEvent or any module that uses it: generally
421speaking, you should load it as early as possible. The reason is that 731speaking, you should load it as early as possible. The reason is that
422modules might create watchers when they are loaded, and AnyEvent will 732modules might create watchers when they are loaded, and AnyEvent will
423decide on the event model to use as soon as it creates watchers, and it 733decide on the event model to use as soon as it creates watchers, and it
424might chose the wrong one unless you load the correct one yourself. 734might chose the wrong one unless you load the correct one yourself.
425 735
426You can chose to use a rather inefficient pure-perl implementation by 736You can chose to use a pure-perl implementation by loading the
427loading the C<AnyEvent::Impl::Perl> module, which gives you similar 737C<AnyEvent::Impl::Perl> module, which gives you similar behaviour
428behaviour everywhere, but letting AnyEvent chose is generally better. 738everywhere, but letting AnyEvent chose the model is generally better.
739
740=head2 MAINLOOP EMULATION
741
742Sometimes (often for short test scripts, or even standalone programs who
743only want to use AnyEvent), you do not want to run a specific event loop.
744
745In that case, you can use a condition variable like this:
746
747 AnyEvent->condvar->recv;
748
749This has the effect of entering the event loop and looping forever.
750
751Note that usually your program has some exit condition, in which case
752it is better to use the "traditional" approach of storing a condition
753variable somewhere, waiting for it, and sending it when the program should
754exit cleanly.
755
756
757=head1 OTHER MODULES
758
759The following is a non-exhaustive list of additional modules that use
760AnyEvent and can therefore be mixed easily with other AnyEvent modules
761in the same program. Some of the modules come with AnyEvent, some are
762available via CPAN.
763
764=over 4
765
766=item L<AnyEvent::Util>
767
768Contains various utility functions that replace often-used but blocking
769functions such as C<inet_aton> by event-/callback-based versions.
770
771=item L<AnyEvent::Socket>
772
773Provides various utility functions for (internet protocol) sockets,
774addresses and name resolution. Also functions to create non-blocking tcp
775connections or tcp servers, with IPv6 and SRV record support and more.
776
777=item L<AnyEvent::Handle>
778
779Provide read and write buffers, manages watchers for reads and writes,
780supports raw and formatted I/O, I/O queued and fully transparent and
781non-blocking SSL/TLS.
782
783=item L<AnyEvent::DNS>
784
785Provides rich asynchronous DNS resolver capabilities.
786
787=item L<AnyEvent::HTTP>
788
789A simple-to-use HTTP library that is capable of making a lot of concurrent
790HTTP requests.
791
792=item L<AnyEvent::HTTPD>
793
794Provides a simple web application server framework.
795
796=item L<AnyEvent::FastPing>
797
798The fastest ping in the west.
799
800=item L<AnyEvent::DBI>
801
802Executes L<DBI> requests asynchronously in a proxy process.
803
804=item L<AnyEvent::AIO>
805
806Truly asynchronous I/O, should be in the toolbox of every event
807programmer. AnyEvent::AIO transparently fuses L<IO::AIO> and AnyEvent
808together.
809
810=item L<AnyEvent::BDB>
811
812Truly asynchronous Berkeley DB access. AnyEvent::BDB transparently fuses
813L<BDB> and AnyEvent together.
814
815=item L<AnyEvent::GPSD>
816
817A non-blocking interface to gpsd, a daemon delivering GPS information.
818
819=item L<AnyEvent::IGS>
820
821A non-blocking interface to the Internet Go Server protocol (used by
822L<App::IGS>).
823
824=item L<Net::IRC3>
825
826AnyEvent based IRC client module family.
827
828=item L<Net::XMPP2>
829
830AnyEvent based XMPP (Jabber protocol) module family.
831
832=item L<Net::FCP>
833
834AnyEvent-based implementation of the Freenet Client Protocol, birthplace
835of AnyEvent.
836
837=item L<Event::ExecFlow>
838
839High level API for event-based execution flow control.
840
841=item L<Coro>
842
843Has special support for AnyEvent via L<Coro::AnyEvent>.
844
845=item L<IO::Lambda>
846
847The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
848
849=back
429 850
430=cut 851=cut
431 852
432package AnyEvent; 853package AnyEvent;
433 854
434no warnings; 855no warnings;
435use strict; 856use strict;
436 857
437use Carp; 858use Carp;
438 859
439our $VERSION = '3.3'; 860our $VERSION = 4.22;
440our $MODEL; 861our $MODEL;
441 862
442our $AUTOLOAD; 863our $AUTOLOAD;
443our @ISA; 864our @ISA;
444 865
866our @REGISTRY;
867
868our $WIN32;
869
870BEGIN {
871 my $win32 = ! ! ($^O =~ /mswin32/i);
872 eval "sub WIN32(){ $win32 }";
873}
874
445our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 875our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
446 876
447our @REGISTRY; 877our %PROTOCOL; # (ipv4|ipv6) => (1|2), higher numbers are preferred
878
879{
880 my $idx;
881 $PROTOCOL{$_} = ++$idx
882 for reverse split /\s*,\s*/,
883 $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
884}
448 885
449my @models = ( 886my @models = (
450 [Coro::EV:: => AnyEvent::Impl::CoroEV::],
451 [Coro::Event:: => AnyEvent::Impl::CoroEvent::],
452 [EV:: => AnyEvent::Impl::EV::], 887 [EV:: => AnyEvent::Impl::EV::],
453 [Event:: => AnyEvent::Impl::Event::], 888 [Event:: => AnyEvent::Impl::Event::],
454 [Glib:: => AnyEvent::Impl::Glib::],
455 [Tk:: => AnyEvent::Impl::Tk::],
456 [Wx:: => AnyEvent::Impl::POE::],
457 [Prima:: => AnyEvent::Impl::POE::],
458 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::], 889 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
459 # everything below here will not be autoprobed as the pureperl backend should work everywhere 890 # everything below here will not be autoprobed
891 # as the pureperl backend should work everywhere
892 # and is usually faster
893 [Tk:: => AnyEvent::Impl::Tk::], # crashes with many handles
894 [Glib:: => AnyEvent::Impl::Glib::], # becomes extremely slow with many watchers
460 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy 895 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
461 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program 896 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
462 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza 897 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
898 [Wx:: => AnyEvent::Impl::POE::],
899 [Prima:: => AnyEvent::Impl::POE::],
463); 900);
464 901
465our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY); 902our %method = map +($_ => 1), qw(io timer time now signal child condvar one_event DESTROY);
903
904our @post_detect;
905
906sub post_detect(&) {
907 my ($cb) = @_;
908
909 if ($MODEL) {
910 $cb->();
911
912 1
913 } else {
914 push @post_detect, $cb;
915
916 defined wantarray
917 ? bless \$cb, "AnyEvent::Util::PostDetect"
918 : ()
919 }
920}
921
922sub AnyEvent::Util::PostDetect::DESTROY {
923 @post_detect = grep $_ != ${$_[0]}, @post_detect;
924}
466 925
467sub detect() { 926sub detect() {
468 unless ($MODEL) { 927 unless ($MODEL) {
469 no strict 'refs'; 928 no strict 'refs';
929 local $SIG{__DIE__};
470 930
471 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) { 931 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) {
472 my $model = "AnyEvent::Impl::$1"; 932 my $model = "AnyEvent::Impl::$1";
473 if (eval "require $model") { 933 if (eval "require $model") {
474 $MODEL = $model; 934 $MODEL = $model;
504 last; 964 last;
505 } 965 }
506 } 966 }
507 967
508 $MODEL 968 $MODEL
509 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV (or Coro+EV), Event (or Coro+Event) or Glib."; 969 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.";
510 } 970 }
511 } 971 }
512 972
973 push @{"$MODEL\::ISA"}, "AnyEvent::Base";
974
513 unshift @ISA, $MODEL; 975 unshift @ISA, $MODEL;
514 push @{"$MODEL\::ISA"}, "AnyEvent::Base"; 976
977 require AnyEvent::Strict if $ENV{PERL_ANYEVENT_STRICT};
978
979 (shift @post_detect)->() while @post_detect;
515 } 980 }
516 981
517 $MODEL 982 $MODEL
518} 983}
519 984
527 992
528 my $class = shift; 993 my $class = shift;
529 $class->$func (@_); 994 $class->$func (@_);
530} 995}
531 996
997# utility function to dup a filehandle. this is used by many backends
998# to support binding more than one watcher per filehandle (they usually
999# allow only one watcher per fd, so we dup it to get a different one).
1000sub _dupfh($$$$) {
1001 my ($poll, $fh, $r, $w) = @_;
1002
1003 require Fcntl;
1004
1005 # cygwin requires the fh mode to be matching, unix doesn't
1006 my ($rw, $mode) = $poll eq "r" ? ($r, "<")
1007 : $poll eq "w" ? ($w, ">")
1008 : Carp::croak "AnyEvent->io requires poll set to either 'r' or 'w'";
1009
1010 open my $fh2, "$mode&" . fileno $fh
1011 or die "cannot dup() filehandle: $!";
1012
1013 # we assume CLOEXEC is already set by perl in all important cases
1014
1015 ($fh2, $rw)
1016}
1017
532package AnyEvent::Base; 1018package AnyEvent::Base;
533 1019
1020# default implementation for now and time
1021
1022use Time::HiRes ();
1023
1024sub time { Time::HiRes::time }
1025sub now { Time::HiRes::time }
1026
534# default implementation for ->condvar, ->wait, ->broadcast 1027# default implementation for ->condvar
535 1028
536sub condvar { 1029sub condvar {
537 bless \my $flag, "AnyEvent::Base::CondVar" 1030 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
538}
539
540sub AnyEvent::Base::CondVar::broadcast {
541 ${$_[0]}++;
542}
543
544sub AnyEvent::Base::CondVar::wait {
545 AnyEvent->one_event while !${$_[0]};
546} 1031}
547 1032
548# default implementation for ->signal 1033# default implementation for ->signal
549 1034
550our %SIG_CB; 1035our %SIG_CB;
566sub AnyEvent::Base::Signal::DESTROY { 1051sub AnyEvent::Base::Signal::DESTROY {
567 my ($signal, $cb) = @{$_[0]}; 1052 my ($signal, $cb) = @{$_[0]};
568 1053
569 delete $SIG_CB{$signal}{$cb}; 1054 delete $SIG_CB{$signal}{$cb};
570 1055
571 $SIG{$signal} = 'DEFAULT' unless keys %{ $SIG_CB{$signal} }; 1056 delete $SIG{$signal} unless keys %{ $SIG_CB{$signal} };
572} 1057}
573 1058
574# default implementation for ->child 1059# default implementation for ->child
575 1060
576our %PID_CB; 1061our %PID_CB;
603 or Carp::croak "required option 'pid' is missing"; 1088 or Carp::croak "required option 'pid' is missing";
604 1089
605 $PID_CB{$pid}{$arg{cb}} = $arg{cb}; 1090 $PID_CB{$pid}{$arg{cb}} = $arg{cb};
606 1091
607 unless ($WNOHANG) { 1092 unless ($WNOHANG) {
608 $WNOHANG = eval { require POSIX; &POSIX::WNOHANG } || 1; 1093 $WNOHANG = eval { local $SIG{__DIE__}; require POSIX; &POSIX::WNOHANG } || 1;
609 } 1094 }
610 1095
611 unless ($CHLD_W) { 1096 unless ($CHLD_W) {
612 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld); 1097 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld);
613 # child could be a zombie already, so make at least one round 1098 # child could be a zombie already, so make at least one round
623 delete $PID_CB{$pid}{$cb}; 1108 delete $PID_CB{$pid}{$cb};
624 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 1109 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
625 1110
626 undef $CHLD_W unless keys %PID_CB; 1111 undef $CHLD_W unless keys %PID_CB;
627} 1112}
1113
1114package AnyEvent::CondVar;
1115
1116our @ISA = AnyEvent::CondVar::Base::;
1117
1118package AnyEvent::CondVar::Base;
1119
1120use overload
1121 '&{}' => sub { my $self = shift; sub { $self->send (@_) } },
1122 fallback => 1;
1123
1124sub _send {
1125 # nop
1126}
1127
1128sub send {
1129 my $cv = shift;
1130 $cv->{_ae_sent} = [@_];
1131 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
1132 $cv->_send;
1133}
1134
1135sub croak {
1136 $_[0]{_ae_croak} = $_[1];
1137 $_[0]->send;
1138}
1139
1140sub ready {
1141 $_[0]{_ae_sent}
1142}
1143
1144sub _wait {
1145 AnyEvent->one_event while !$_[0]{_ae_sent};
1146}
1147
1148sub recv {
1149 $_[0]->_wait;
1150
1151 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
1152 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
1153}
1154
1155sub cb {
1156 $_[0]{_ae_cb} = $_[1] if @_ > 1;
1157 $_[0]{_ae_cb}
1158}
1159
1160sub begin {
1161 ++$_[0]{_ae_counter};
1162 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
1163}
1164
1165sub end {
1166 return if --$_[0]{_ae_counter};
1167 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
1168}
1169
1170# undocumented/compatibility with pre-3.4
1171*broadcast = \&send;
1172*wait = \&_wait;
628 1173
629=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 1174=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
630 1175
631This is an advanced topic that you do not normally need to use AnyEvent in 1176This is an advanced topic that you do not normally need to use AnyEvent in
632a module. This section is only of use to event loop authors who want to 1177a module. This section is only of use to event loop authors who want to
686C<PERL_ANYEVENT_MODEL>. 1231C<PERL_ANYEVENT_MODEL>.
687 1232
688When set to C<2> or higher, cause AnyEvent to report to STDERR which event 1233When set to C<2> or higher, cause AnyEvent to report to STDERR which event
689model it chooses. 1234model it chooses.
690 1235
1236=item C<PERL_ANYEVENT_STRICT>
1237
1238AnyEvent does not do much argument checking by default, as thorough
1239argument checking is very costly. Setting this variable to a true value
1240will cause AnyEvent to load C<AnyEvent::Strict> and then to thoroughly
1241check the arguments passed to most method calls. If it finds any problems
1242it will croak.
1243
1244In other words, enables "strict" mode.
1245
1246Unlike C<use strict> it is definitely recommended ot keep it off in
1247production.
1248
691=item C<PERL_ANYEVENT_MODEL> 1249=item C<PERL_ANYEVENT_MODEL>
692 1250
693This can be used to specify the event model to be used by AnyEvent, before 1251This can be used to specify the event model to be used by AnyEvent, before
694autodetection and -probing kicks in. It must be a string consisting 1252auto detection and -probing kicks in. It must be a string consisting
695entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended 1253entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
696and the resulting module name is loaded and if the load was successful, 1254and the resulting module name is loaded and if the load was successful,
697used as event model. If it fails to load AnyEvent will proceed with 1255used as event model. If it fails to load AnyEvent will proceed with
698autodetection and -probing. 1256auto detection and -probing.
699 1257
700This functionality might change in future versions. 1258This functionality might change in future versions.
701 1259
702For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you 1260For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
703could start your program like this: 1261could start your program like this:
704 1262
705 PERL_ANYEVENT_MODEL=Perl perl ... 1263 PERL_ANYEVENT_MODEL=Perl perl ...
1264
1265=item C<PERL_ANYEVENT_PROTOCOLS>
1266
1267Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1268for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1269of auto probing).
1270
1271Must be set to a comma-separated list of protocols or address families,
1272current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1273used, and preference will be given to protocols mentioned earlier in the
1274list.
1275
1276This variable can effectively be used for denial-of-service attacks
1277against local programs (e.g. when setuid), although the impact is likely
1278small, as the program has to handle connection errors already-
1279
1280Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1281but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1282- only support IPv4, never try to resolve or contact IPv6
1283addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1284IPv6, but prefer IPv6 over IPv4.
1285
1286=item C<PERL_ANYEVENT_EDNS0>
1287
1288Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1289for DNS. This extension is generally useful to reduce DNS traffic, but
1290some (broken) firewalls drop such DNS packets, which is why it is off by
1291default.
1292
1293Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1294EDNS0 in its DNS requests.
1295
1296=item C<PERL_ANYEVENT_MAX_FORKS>
1297
1298The maximum number of child processes that C<AnyEvent::Util::fork_call>
1299will create in parallel.
706 1300
707=back 1301=back
708 1302
709=head1 EXAMPLE PROGRAM 1303=head1 EXAMPLE PROGRAM
710 1304
711The following program uses an IO watcher to read data from STDIN, a timer 1305The following program uses an I/O watcher to read data from STDIN, a timer
712to display a message once per second, and a condition variable to quit the 1306to display a message once per second, and a condition variable to quit the
713program when the user enters quit: 1307program when the user enters quit:
714 1308
715 use AnyEvent; 1309 use AnyEvent;
716 1310
721 poll => 'r', 1315 poll => 'r',
722 cb => sub { 1316 cb => sub {
723 warn "io event <$_[0]>\n"; # will always output <r> 1317 warn "io event <$_[0]>\n"; # will always output <r>
724 chomp (my $input = <STDIN>); # read a line 1318 chomp (my $input = <STDIN>); # read a line
725 warn "read: $input\n"; # output what has been read 1319 warn "read: $input\n"; # output what has been read
726 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1320 $cv->send if $input =~ /^q/i; # quit program if /^q/i
727 }, 1321 },
728 ); 1322 );
729 1323
730 my $time_watcher; # can only be used once 1324 my $time_watcher; # can only be used once
731 1325
736 }); 1330 });
737 } 1331 }
738 1332
739 new_timer; # create first timer 1333 new_timer; # create first timer
740 1334
741 $cv->wait; # wait until user enters /^q/i 1335 $cv->recv; # wait until user enters /^q/i
742 1336
743=head1 REAL-WORLD EXAMPLE 1337=head1 REAL-WORLD EXAMPLE
744 1338
745Consider the L<Net::FCP> module. It features (among others) the following 1339Consider the L<Net::FCP> module. It features (among others) the following
746API calls, which are to freenet what HTTP GET requests are to http: 1340API calls, which are to freenet what HTTP GET requests are to http:
796 syswrite $txn->{fh}, $txn->{request} 1390 syswrite $txn->{fh}, $txn->{request}
797 or die "connection or write error"; 1391 or die "connection or write error";
798 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r }); 1392 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
799 1393
800Again, C<fh_ready_r> waits till all data has arrived, and then stores the 1394Again, C<fh_ready_r> waits till all data has arrived, and then stores the
801result and signals any possible waiters that the request ahs finished: 1395result and signals any possible waiters that the request has finished:
802 1396
803 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1397 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
804 1398
805 if (end-of-file or data complete) { 1399 if (end-of-file or data complete) {
806 $txn->{result} = $txn->{buf}; 1400 $txn->{result} = $txn->{buf};
807 $txn->{finished}->broadcast; 1401 $txn->{finished}->send;
808 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1402 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
809 } 1403 }
810 1404
811The C<result> method, finally, just waits for the finished signal (if the 1405The C<result> method, finally, just waits for the finished signal (if the
812request was already finished, it doesn't wait, of course, and returns the 1406request was already finished, it doesn't wait, of course, and returns the
813data: 1407data:
814 1408
815 $txn->{finished}->wait; 1409 $txn->{finished}->recv;
816 return $txn->{result}; 1410 return $txn->{result};
817 1411
818The actual code goes further and collects all errors (C<die>s, exceptions) 1412The actual code goes further and collects all errors (C<die>s, exceptions)
819that occured during request processing. The C<result> method detects 1413that occurred during request processing. The C<result> method detects
820whether an exception as thrown (it is stored inside the $txn object) 1414whether an exception as thrown (it is stored inside the $txn object)
821and just throws the exception, which means connection errors and other 1415and just throws the exception, which means connection errors and other
822problems get reported tot he code that tries to use the result, not in a 1416problems get reported tot he code that tries to use the result, not in a
823random callback. 1417random callback.
824 1418
855 1449
856 my $quit = AnyEvent->condvar; 1450 my $quit = AnyEvent->condvar;
857 1451
858 $fcp->txn_client_get ($url)->cb (sub { 1452 $fcp->txn_client_get ($url)->cb (sub {
859 ... 1453 ...
860 $quit->broadcast; 1454 $quit->send;
861 }); 1455 });
862 1456
863 $quit->wait; 1457 $quit->recv;
864 1458
865 1459
866=head1 BENCHMARK 1460=head1 BENCHMARKS
867 1461
868To give you an idea of the performance and overheads that AnyEvent adds 1462To give you an idea of the performance and overheads that AnyEvent adds
869over the event loops themselves (and to give you an impression of the 1463over the event loops themselves and to give you an impression of the speed
870speed of various event loops), here is a benchmark of various supported 1464of various event loops I prepared some benchmarks.
871event models natively and with anyevent. The benchmark creates a lot of 1465
872timers (with a zero timeout) and io watchers (watching STDOUT, a pty, to 1466=head2 BENCHMARKING ANYEVENT OVERHEAD
1467
1468Here is a benchmark of various supported event models used natively and
1469through AnyEvent. The benchmark creates a lot of timers (with a zero
1470timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
873become writable, which it is), lets them fire exactly once and destroys 1471which it is), lets them fire exactly once and destroys them again.
874them again.
875 1472
1473Source code for this benchmark is found as F<eg/bench> in the AnyEvent
1474distribution.
1475
876=head2 Explanation of the columns 1476=head3 Explanation of the columns
877 1477
878I<watcher> is the number of event watchers created/destroyed. Since 1478I<watcher> is the number of event watchers created/destroyed. Since
879different event models feature vastly different performances, each event 1479different event models feature vastly different performances, each event
880loop was given a number of watchers so that overall runtime is acceptable 1480loop was given a number of watchers so that overall runtime is acceptable
881and similar between tested event loop (and keep them from crashing): Glib 1481and similar between tested event loop (and keep them from crashing): Glib
891all watchers, to avoid adding memory overhead. That means closure creation 1491all watchers, to avoid adding memory overhead. That means closure creation
892and memory usage is not included in the figures. 1492and memory usage is not included in the figures.
893 1493
894I<invoke> is the time, in microseconds, used to invoke a simple 1494I<invoke> is the time, in microseconds, used to invoke a simple
895callback. The callback simply counts down a Perl variable and after it was 1495callback. The callback simply counts down a Perl variable and after it was
896invoked "watcher" times, it would C<< ->broadcast >> a condvar once to 1496invoked "watcher" times, it would C<< ->send >> a condvar once to
897signal the end of this phase. 1497signal the end of this phase.
898 1498
899I<destroy> is the time, in microseconds, that it takes to destroy a single 1499I<destroy> is the time, in microseconds, that it takes to destroy a single
900watcher. 1500watcher.
901 1501
902=head2 Results 1502=head3 Results
903 1503
904 name watcher bytes create invoke destroy comment 1504 name watchers bytes create invoke destroy comment
905 EV/EV 400000 244 0.56 0.46 0.31 EV native interface 1505 EV/EV 400000 244 0.56 0.46 0.31 EV native interface
906 EV/Any 100000 610 3.52 0.91 0.75 EV + AnyEvent watchers 1506 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
907 CoroEV/Any 100000 610 3.49 0.92 0.75 coroutines + Coro::Signal 1507 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
908 Perl/Any 16000 654 4.64 1.22 0.77 pure perl implementation 1508 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
909 Event/Event 16000 523 28.05 21.38 0.86 Event native interface 1509 Event/Event 16000 516 31.88 31.30 0.85 Event native interface
910 Event/Any 16000 943 34.43 20.48 1.39 Event + AnyEvent watchers 1510 Event/Any 16000 590 35.75 31.42 1.08 Event + AnyEvent watchers
911 Glib/Any 16000 1357 96.99 12.55 55.51 quadratic behaviour 1511 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
912 Tk/Any 2000 1855 27.01 66.61 14.03 SEGV with >> 2000 watchers 1512 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
913 POE/Event 2000 6644 108.15 768.19 14.33 via POE::Loop::Event 1513 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
914 POE/Select 2000 6343 94.69 807.65 562.69 via POE::Loop::Select 1514 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
915 1515
916=head2 Discussion 1516=head3 Discussion
917 1517
918The benchmark does I<not> measure scalability of the event loop very 1518The benchmark does I<not> measure scalability of the event loop very
919well. For example, a select-based event loop (such as the pure perl one) 1519well. For example, a select-based event loop (such as the pure perl one)
920can never compete with an event loop that uses epoll when the number of 1520can never compete with an event loop that uses epoll when the number of
921file descriptors grows high. In this benchmark, only a single filehandle 1521file descriptors grows high. In this benchmark, all events become ready at
922is used (although some of the AnyEvent adaptors dup() its file descriptor 1522the same time, so select/poll-based implementations get an unnatural speed
923to worka round bugs). 1523boost.
1524
1525Also, note that the number of watchers usually has a nonlinear effect on
1526overall speed, that is, creating twice as many watchers doesn't take twice
1527the time - usually it takes longer. This puts event loops tested with a
1528higher number of watchers at a disadvantage.
1529
1530To put the range of results into perspective, consider that on the
1531benchmark machine, handling an event takes roughly 1600 CPU cycles with
1532EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1533cycles with POE.
924 1534
925C<EV> is the sole leader regarding speed and memory use, which are both 1535C<EV> is the sole leader regarding speed and memory use, which are both
926maximal/minimal, respectively. Even when going through AnyEvent, there is 1536maximal/minimal, respectively. Even when going through AnyEvent, it uses
927only one event loop that uses less memory (the C<Event> module natively), and 1537far less memory than any other event loop and is still faster than Event
928no faster event model, not event C<Event> natively. 1538natively.
929 1539
930The pure perl implementation is hit in a few sweet spots (both the 1540The pure perl implementation is hit in a few sweet spots (both the
931zero timeout and the use of a single fd hit optimisations in the perl 1541constant timeout and the use of a single fd hit optimisations in the perl
932interpreter and the backend itself). Nevertheless tis shows that it 1542interpreter and the backend itself). Nevertheless this shows that it
933adds very little overhead in itself. Like any select-based backend its 1543adds very little overhead in itself. Like any select-based backend its
934performance becomes really bad with lots of file descriptors, of course, 1544performance becomes really bad with lots of file descriptors (and few of
935but this was not subjetc of this benchmark. 1545them active), of course, but this was not subject of this benchmark.
936 1546
937The C<Event> module has a relatively high setup and callback invocation cost, 1547The C<Event> module has a relatively high setup and callback invocation
938but overall scores on the third place. 1548cost, but overall scores in on the third place.
939 1549
940C<Glib>'s memory usage is quite a bit bit higher, but it features a 1550C<Glib>'s memory usage is quite a bit higher, but it features a
941faster callback invocation and overall ends up in the same class as 1551faster callback invocation and overall ends up in the same class as
942C<Event>. However, Glib scales extremely badly, doubling the number of 1552C<Event>. However, Glib scales extremely badly, doubling the number of
943watchers increases the processing time by more than a factor of four, 1553watchers increases the processing time by more than a factor of four,
944making it completely unusable when using larger numbers of watchers 1554making it completely unusable when using larger numbers of watchers
945(note that only a single file descriptor was used in the benchmark, so 1555(note that only a single file descriptor was used in the benchmark, so
948The C<Tk> adaptor works relatively well. The fact that it crashes with 1558The C<Tk> adaptor works relatively well. The fact that it crashes with
949more than 2000 watchers is a big setback, however, as correctness takes 1559more than 2000 watchers is a big setback, however, as correctness takes
950precedence over speed. Nevertheless, its performance is surprising, as the 1560precedence over speed. Nevertheless, its performance is surprising, as the
951file descriptor is dup()ed for each watcher. This shows that the dup() 1561file descriptor is dup()ed for each watcher. This shows that the dup()
952employed by some adaptors is not a big performance issue (it does incur a 1562employed by some adaptors is not a big performance issue (it does incur a
953hidden memory cost inside the kernel, though). 1563hidden memory cost inside the kernel which is not reflected in the figures
1564above).
954 1565
955C<POE>, regardless of underlying event loop (wether using its pure perl 1566C<POE>, regardless of underlying event loop (whether using its pure perl
956select-based backend or the Event module) shows abysmal performance and 1567select-based backend or the Event module, the POE-EV backend couldn't
1568be tested because it wasn't working) shows abysmal performance and
957memory usage: Watchers use almost 30 times as much memory as EV watchers, 1569memory usage with AnyEvent: Watchers use almost 30 times as much memory
958and 10 times as much memory as both Event or EV via AnyEvent. Watcher 1570as EV watchers, and 10 times as much memory as Event (the high memory
1571requirements are caused by requiring a session for each watcher). Watcher
959invocation is almost 700 times slower than with AnyEvent's pure perl 1572invocation speed is almost 900 times slower than with AnyEvent's pure perl
1573implementation.
1574
960implementation. The design of the POE adaptor class in AnyEvent can not 1575The design of the POE adaptor class in AnyEvent can not really account
961really account for this, as session creation overhead is small compared 1576for the performance issues, though, as session creation overhead is
962to execution of the state machine, which is coded pretty optimally within 1577small compared to execution of the state machine, which is coded pretty
963L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow. 1578optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
1579using multiple sessions is not a good approach, especially regarding
1580memory usage, even the author of POE could not come up with a faster
1581design).
964 1582
965=head2 Summary 1583=head3 Summary
966 1584
1585=over 4
1586
967Using EV through AnyEvent is faster than any other event loop, but most 1587=item * Using EV through AnyEvent is faster than any other event loop
968event loops have acceptable performance with or without AnyEvent. 1588(even when used without AnyEvent), but most event loops have acceptable
1589performance with or without AnyEvent.
969 1590
970The overhead AnyEvent adds is usually much smaller than the overhead of 1591=item * The overhead AnyEvent adds is usually much smaller than the overhead of
971the actual event loop, only with extremely fast event loops such as the EV 1592the actual event loop, only with extremely fast event loops such as EV
972adds AnyEvent significant overhead. 1593adds AnyEvent significant overhead.
973 1594
974And you should simply avoid POE like the plague if you want performance or 1595=item * You should avoid POE like the plague if you want performance or
975reasonable memory usage. 1596reasonable memory usage.
976 1597
1598=back
1599
1600=head2 BENCHMARKING THE LARGE SERVER CASE
1601
1602This benchmark actually benchmarks the event loop itself. It works by
1603creating a number of "servers": each server consists of a socket pair, a
1604timeout watcher that gets reset on activity (but never fires), and an I/O
1605watcher waiting for input on one side of the socket. Each time the socket
1606watcher reads a byte it will write that byte to a random other "server".
1607
1608The effect is that there will be a lot of I/O watchers, only part of which
1609are active at any one point (so there is a constant number of active
1610fds for each loop iteration, but which fds these are is random). The
1611timeout is reset each time something is read because that reflects how
1612most timeouts work (and puts extra pressure on the event loops).
1613
1614In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1615(1%) are active. This mirrors the activity of large servers with many
1616connections, most of which are idle at any one point in time.
1617
1618Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1619distribution.
1620
1621=head3 Explanation of the columns
1622
1623I<sockets> is the number of sockets, and twice the number of "servers" (as
1624each server has a read and write socket end).
1625
1626I<create> is the time it takes to create a socket pair (which is
1627nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1628
1629I<request>, the most important value, is the time it takes to handle a
1630single "request", that is, reading the token from the pipe and forwarding
1631it to another server. This includes deleting the old timeout and creating
1632a new one that moves the timeout into the future.
1633
1634=head3 Results
1635
1636 name sockets create request
1637 EV 20000 69.01 11.16
1638 Perl 20000 73.32 35.87
1639 Event 20000 212.62 257.32
1640 Glib 20000 651.16 1896.30
1641 POE 20000 349.67 12317.24 uses POE::Loop::Event
1642
1643=head3 Discussion
1644
1645This benchmark I<does> measure scalability and overall performance of the
1646particular event loop.
1647
1648EV is again fastest. Since it is using epoll on my system, the setup time
1649is relatively high, though.
1650
1651Perl surprisingly comes second. It is much faster than the C-based event
1652loops Event and Glib.
1653
1654Event suffers from high setup time as well (look at its code and you will
1655understand why). Callback invocation also has a high overhead compared to
1656the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
1657uses select or poll in basically all documented configurations.
1658
1659Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
1660clearly fails to perform with many filehandles or in busy servers.
1661
1662POE is still completely out of the picture, taking over 1000 times as long
1663as EV, and over 100 times as long as the Perl implementation, even though
1664it uses a C-based event loop in this case.
1665
1666=head3 Summary
1667
1668=over 4
1669
1670=item * The pure perl implementation performs extremely well.
1671
1672=item * Avoid Glib or POE in large projects where performance matters.
1673
1674=back
1675
1676=head2 BENCHMARKING SMALL SERVERS
1677
1678While event loops should scale (and select-based ones do not...) even to
1679large servers, most programs we (or I :) actually write have only a few
1680I/O watchers.
1681
1682In this benchmark, I use the same benchmark program as in the large server
1683case, but it uses only eight "servers", of which three are active at any
1684one time. This should reflect performance for a small server relatively
1685well.
1686
1687The columns are identical to the previous table.
1688
1689=head3 Results
1690
1691 name sockets create request
1692 EV 16 20.00 6.54
1693 Perl 16 25.75 12.62
1694 Event 16 81.27 35.86
1695 Glib 16 32.63 15.48
1696 POE 16 261.87 276.28 uses POE::Loop::Event
1697
1698=head3 Discussion
1699
1700The benchmark tries to test the performance of a typical small
1701server. While knowing how various event loops perform is interesting, keep
1702in mind that their overhead in this case is usually not as important, due
1703to the small absolute number of watchers (that is, you need efficiency and
1704speed most when you have lots of watchers, not when you only have a few of
1705them).
1706
1707EV is again fastest.
1708
1709Perl again comes second. It is noticeably faster than the C-based event
1710loops Event and Glib, although the difference is too small to really
1711matter.
1712
1713POE also performs much better in this case, but is is still far behind the
1714others.
1715
1716=head3 Summary
1717
1718=over 4
1719
1720=item * C-based event loops perform very well with small number of
1721watchers, as the management overhead dominates.
1722
1723=back
1724
977 1725
978=head1 FORK 1726=head1 FORK
979 1727
980Most event libraries are not fork-safe. The ones who are usually are 1728Most event libraries are not fork-safe. The ones who are usually are
981because they are so inefficient. Only L<EV> is fully fork-aware. 1729because they rely on inefficient but fork-safe C<select> or C<poll>
1730calls. Only L<EV> is fully fork-aware.
982 1731
983If you have to fork, you must either do so I<before> creating your first 1732If you have to fork, you must either do so I<before> creating your first
984watcher OR you must not use AnyEvent at all in the child. 1733watcher OR you must not use AnyEvent at all in the child.
985 1734
986 1735
994specified in the variable. 1743specified in the variable.
995 1744
996You can make AnyEvent completely ignore this variable by deleting it 1745You can make AnyEvent completely ignore this variable by deleting it
997before the first watcher gets created, e.g. with a C<BEGIN> block: 1746before the first watcher gets created, e.g. with a C<BEGIN> block:
998 1747
999 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} } 1748 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
1000 1749
1001 use AnyEvent; 1750 use AnyEvent;
1751
1752Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
1753be used to probe what backend is used and gain other information (which is
1754probably even less useful to an attacker than PERL_ANYEVENT_MODEL), and
1755$ENV{PERL_ANYEGENT_STRICT}.
1756
1757
1758=head1 BUGS
1759
1760Perl 5.8 has numerous memleaks that sometimes hit this module and are hard
1761to work around. If you suffer from memleaks, first upgrade to Perl 5.10
1762and check wether the leaks still show up. (Perl 5.10.0 has other annoying
1763mamleaks, such as leaking on C<map> and C<grep> but it is usually not as
1764pronounced).
1002 1765
1003 1766
1004=head1 SEE ALSO 1767=head1 SEE ALSO
1005 1768
1006Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>, 1769Utility functions: L<AnyEvent::Util>.
1007L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>, 1770
1771Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1008L<Event::Lib>, L<Qt>, L<POE>. 1772L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1009 1773
1010Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>, 1774Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1011L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>, 1775L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1012L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>, 1776L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1013L<AnyEvent::Impl::Qt>, L<AnyEvent::Impl::POE>. 1777L<AnyEvent::Impl::POE>.
1014 1778
1779Non-blocking file handles, sockets, TCP clients and
1780servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1781
1782Asynchronous DNS: L<AnyEvent::DNS>.
1783
1784Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1785
1015Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1786Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1016 1787
1017 1788
1018=head1 AUTHOR 1789=head1 AUTHOR
1019 1790
1020 Marc Lehmann <schmorp@schmorp.de> 1791 Marc Lehmann <schmorp@schmorp.de>
1021 http://home.schmorp.de/ 1792 http://home.schmorp.de/
1022 1793
1023=cut 1794=cut
1024 1795
10251 17961
1026 1797

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines