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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines