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.95 by root, Sat Apr 26 11:06:45 2008 UTC vs.
Revision 1.179 by root, Thu Sep 4 10:58:58 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<AnyEvent::Impl::Perl>, L<Tk>, 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 Tk, 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
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 I/O 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 167C<fh> the Perl I<file handle> (I<not> file descriptor) to watch for events
147for events. C<poll> must be a string that is either C<r> or C<w>, 168(AnyEvent might or might not keep a reference to this file handle). C<poll>
148which creates a watcher waiting for "r"eadable or "w"ritable events, 169must be a string that is either C<r> or C<w>, which creates a watcher
149respectively. C<cb> is the callback to invoke each time the file handle 170waiting for "r"eadable or "w"ritable events, respectively. C<cb> is the
150becomes ready. 171callback to invoke each time the file handle becomes ready.
151 172
152Although the callback might get passed parameters, their value and 173Although the callback might get passed parameters, their value and
153presence is undefined and you cannot rely on them. Portable AnyEvent 174presence is undefined and you cannot rely on them. Portable AnyEvent
154callbacks cannot use arguments passed to I/O watcher callbacks. 175callbacks cannot use arguments passed to I/O watcher callbacks.
155 176
159 180
160Some event loops issue spurious readyness notifications, so you should 181Some event loops issue spurious readyness notifications, so you should
161always use non-blocking calls when reading/writing from/to your file 182always use non-blocking calls when reading/writing from/to your file
162handles. 183handles.
163 184
164Example:
165
166 # 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
167 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub { 188 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
168 chomp (my $input = <STDIN>); 189 chomp (my $input = <STDIN>);
169 warn "read: $input\n"; 190 warn "read: $input\n";
170 undef $w; 191 undef $w;
171 }); 192 });
181 202
182Although the callback might get passed parameters, their value and 203Although the callback might get passed parameters, their value and
183presence is undefined and you cannot rely on them. Portable AnyEvent 204presence is undefined and you cannot rely on them. Portable AnyEvent
184callbacks cannot use arguments passed to time watcher callbacks. 205callbacks cannot use arguments passed to time watcher callbacks.
185 206
186The timer callback will be invoked at most once: if you want a repeating 207The callback will normally be invoked once only. If you specify another
187timer you have to create a new watcher (this is a limitation by both Tk 208parameter, C<interval>, as a strictly positive number (> 0), then the
188and Glib). 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.
189 212
190Example: 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.
191 216
192 # fire an event after 7.7 seconds 217Example: fire an event after 7.7 seconds.
218
193 my $w = AnyEvent->timer (after => 7.7, cb => sub { 219 my $w = AnyEvent->timer (after => 7.7, cb => sub {
194 warn "timeout\n"; 220 warn "timeout\n";
195 }); 221 });
196 222
197 # to cancel the timer: 223 # to cancel the timer:
198 undef $w; 224 undef $w;
199 225
200Example 2:
201
202 # fire an event after 0.5 seconds, then roughly every second 226Example 2: fire an event after 0.5 seconds, then roughly every second.
203 my $w;
204 227
205 my $cb = sub {
206 # cancel the old timer while creating a new one
207 $w = AnyEvent->timer (after => 1, cb => $cb); 228 my $w = AnyEvent->timer (after => 0.5, interval => 1, cb => sub {
229 warn "timeout\n";
208 }; 230 };
209
210 # start the "loop" by creating the first watcher
211 $w = AnyEvent->timer (after => 0.5, cb => $cb);
212 231
213=head3 TIMING ISSUES 232=head3 TIMING ISSUES
214 233
215There 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
216in 10 seconds") and based on wallclock time (absolute, "fire at 12 235in 10 seconds") and based on wallclock time (absolute, "fire at 12
228timers. 247timers.
229 248
230AnyEvent always prefers relative timers, if available, matching the 249AnyEvent always prefers relative timers, if available, matching the
231AnyEvent API. 250AnyEvent API.
232 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
233=head2 SIGNAL WATCHERS 315=head2 SIGNAL WATCHERS
234 316
235You 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
236I<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
237be invoked whenever a signal occurs. 319callback to be invoked whenever a signal occurs.
238 320
239Although the callback might get passed parameters, their value and 321Although the callback might get passed parameters, their value and
240presence is undefined and you cannot rely on them. Portable AnyEvent 322presence is undefined and you cannot rely on them. Portable AnyEvent
241callbacks cannot use arguments passed to signal watcher callbacks. 323callbacks cannot use arguments passed to signal watcher callbacks.
242 324
243Multiple signal occurances can be clumped together into one callback 325Multiple signal occurrences can be clumped together into one callback
244invocation, and callback invocation will be synchronous. synchronous means 326invocation, and callback invocation will be synchronous. Synchronous means
245that 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,
246but it is guarenteed not to interrupt any other callbacks. 328but it is guaranteed not to interrupt any other callbacks.
247 329
248The 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
249between multiple watchers. 331between multiple watchers.
250 332
251This watcher might use C<%SIG>, so programs overwriting those signals 333This watcher might use C<%SIG>, so programs overwriting those signals
278AnyEvent program, you I<have> to create at least one watcher before you 360AnyEvent program, you I<have> to create at least one watcher before you
279C<fork> the child (alternatively, you can call C<AnyEvent::detect>). 361C<fork> the child (alternatively, you can call C<AnyEvent::detect>).
280 362
281Example: fork a process and wait for it 363Example: fork a process and wait for it
282 364
283 my $done = AnyEvent->condvar; 365 my $done = AnyEvent->condvar;
284 366
285 AnyEvent::detect; # force event module to be initialised
286
287 my $pid = fork or exit 5; 367 my $pid = fork or exit 5;
288 368
289 my $w = AnyEvent->child ( 369 my $w = AnyEvent->child (
290 pid => $pid, 370 pid => $pid,
291 cb => sub { 371 cb => sub {
292 my ($pid, $status) = @_; 372 my ($pid, $status) = @_;
293 warn "pid $pid exited with status $status"; 373 warn "pid $pid exited with status $status";
294 $done->broadcast; 374 $done->send;
295 }, 375 },
296 ); 376 );
297 377
298 # do something else, then wait for process exit 378 # do something else, then wait for process exit
299 $done->wait; 379 $done->recv;
300 380
301=head2 CONDITION VARIABLES 381=head2 CONDITION VARIABLES
302 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
303Condition variables can be created by calling the C<< AnyEvent->condvar >> 393Condition variables can be created by calling the C<< AnyEvent->condvar
304method without any arguments. 394>> method, usually without arguments. The only argument pair allowed is
305 395
306A condition variable waits for a condition - precisely that the C<< 396C<cb>, which specifies a callback to be called when the condition variable
307->broadcast >> method has been called. 397becomes true, with the condition variable as the first argument (but not
398the results).
308 399
309They are very useful to signal that a condition has been fulfilled, for 400After creation, the condition variable is "false" until it becomes "true"
401by calling the C<send> method (or calling the condition variable as if it
402were a callback, read about the caveats in the description for the C<<
403->send >> method).
404
405Condition variables are similar to callbacks, except that you can
406optionally wait for them. They can also be called merge points - points
407in time where multiple outstanding events have been processed. And yet
408another way to call them is transactions - each condition variable can be
409used to represent a transaction, which finishes at some point and delivers
410a result.
411
412Condition variables are very useful to signal that something has finished,
310example, if you write a module that does asynchronous http requests, 413for example, if you write a module that does asynchronous http requests,
311then a condition variable would be the ideal candidate to signal the 414then a condition variable would be the ideal candidate to signal the
312availability of results. 415availability of results. The user can either act when the callback is
416called or can synchronously C<< ->recv >> for the results.
313 417
314You can also use condition variables to block your main program until 418You can also use them to simulate traditional event loops - for example,
315an event occurs - for example, you could C<< ->wait >> in your main 419you can block your main program until an event occurs - for example, you
316program until the user clicks the Quit button in your app, which would C<< 420could C<< ->recv >> in your main program until the user clicks the Quit
317->broadcast >> the "quit" event. 421button of your app, which would C<< ->send >> the "quit" event.
318 422
319Note that condition variables recurse into the event loop - if you have 423Note that condition variables recurse into the event loop - if you have
320two pirces of code that call C<< ->wait >> in a round-robbin fashion, you 424two pieces of code that call C<< ->recv >> in a round-robin fashion, you
321lose. Therefore, condition variables are good to export to your caller, but 425lose. Therefore, condition variables are good to export to your caller, but
322you should avoid making a blocking wait yourself, at least in callbacks, 426you should avoid making a blocking wait yourself, at least in callbacks,
323as this asks for trouble. 427as this asks for trouble.
324 428
325This object has two methods: 429Condition variables are represented by hash refs in perl, and the keys
430used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
431easy (it is often useful to build your own transaction class on top of
432AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
433it's C<new> method in your own C<new> method.
434
435There are two "sides" to a condition variable - the "producer side" which
436eventually calls C<< -> send >>, and the "consumer side", which waits
437for the send to occur.
438
439Example: wait for a timer.
440
441 # wait till the result is ready
442 my $result_ready = AnyEvent->condvar;
443
444 # do something such as adding a timer
445 # or socket watcher the calls $result_ready->send
446 # when the "result" is ready.
447 # in this case, we simply use a timer:
448 my $w = AnyEvent->timer (
449 after => 1,
450 cb => sub { $result_ready->send },
451 );
452
453 # this "blocks" (while handling events) till the callback
454 # calls send
455 $result_ready->recv;
456
457Example: wait for a timer, but take advantage of the fact that
458condition variables are also code references.
459
460 my $done = AnyEvent->condvar;
461 my $delay = AnyEvent->timer (after => 5, cb => $done);
462 $done->recv;
463
464Example: Imagine an API that returns a condvar and doesn't support
465callbacks. This is how you make a synchronous call, for example from
466the main program:
467
468 use AnyEvent::CouchDB;
469
470 ...
471
472 my @info = $couchdb->info->recv;
473
474And this is how you would just ste a callback to be called whenever the
475results are available:
476
477 $couchdb->info->cb (sub {
478 my @info = $_[0]->recv;
479 });
480
481=head3 METHODS FOR PRODUCERS
482
483These methods should only be used by the producing side, i.e. the
484code/module that eventually sends the signal. Note that it is also
485the producer side which creates the condvar in most cases, but it isn't
486uncommon for the consumer to create it as well.
326 487
327=over 4 488=over 4
328 489
490=item $cv->send (...)
491
492Flag the condition as ready - a running C<< ->recv >> and all further
493calls to C<recv> will (eventually) return after this method has been
494called. If nobody is waiting the send will be remembered.
495
496If a callback has been set on the condition variable, it is called
497immediately from within send.
498
499Any arguments passed to the C<send> call will be returned by all
500future C<< ->recv >> calls.
501
502Condition variables are overloaded so one can call them directly
503(as a code reference). Calling them directly is the same as calling
504C<send>. Note, however, that many C-based event loops do not handle
505overloading, so as tempting as it may be, passing a condition variable
506instead of a callback does not work. Both the pure perl and EV loops
507support overloading, however, as well as all functions that use perl to
508invoke a callback (as in L<AnyEvent::Socket> and L<AnyEvent::DNS> for
509example).
510
511=item $cv->croak ($error)
512
513Similar to send, but causes all call's to C<< ->recv >> to invoke
514C<Carp::croak> with the given error message/object/scalar.
515
516This can be used to signal any errors to the condition variable
517user/consumer.
518
519=item $cv->begin ([group callback])
520
329=item $cv->wait 521=item $cv->end
330 522
331Wait (blocking if necessary) until the C<< ->broadcast >> method has been 523These two methods are EXPERIMENTAL and MIGHT CHANGE.
524
525These two methods can be used to combine many transactions/events into
526one. For example, a function that pings many hosts in parallel might want
527to use a condition variable for the whole process.
528
529Every call to C<< ->begin >> will increment a counter, and every call to
530C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
531>>, the (last) callback passed to C<begin> will be executed. That callback
532is I<supposed> to call C<< ->send >>, but that is not required. If no
533callback was set, C<send> will be called without any arguments.
534
535Let's clarify this with the ping example:
536
537 my $cv = AnyEvent->condvar;
538
539 my %result;
540 $cv->begin (sub { $cv->send (\%result) });
541
542 for my $host (@list_of_hosts) {
543 $cv->begin;
544 ping_host_then_call_callback $host, sub {
545 $result{$host} = ...;
546 $cv->end;
547 };
548 }
549
550 $cv->end;
551
552This code fragment supposedly pings a number of hosts and calls
553C<send> after results for all then have have been gathered - in any
554order. To achieve this, the code issues a call to C<begin> when it starts
555each ping request and calls C<end> when it has received some result for
556it. Since C<begin> and C<end> only maintain a counter, the order in which
557results arrive is not relevant.
558
559There is an additional bracketing call to C<begin> and C<end> outside the
560loop, which serves two important purposes: first, it sets the callback
561to be called once the counter reaches C<0>, and second, it ensures that
562C<send> is called even when C<no> hosts are being pinged (the loop
563doesn't execute once).
564
565This is the general pattern when you "fan out" into multiple subrequests:
566use an outer C<begin>/C<end> pair to set the callback and ensure C<end>
567is called at least once, and then, for each subrequest you start, call
568C<begin> and for each subrequest you finish, call C<end>.
569
570=back
571
572=head3 METHODS FOR CONSUMERS
573
574These methods should only be used by the consuming side, i.e. the
575code awaits the condition.
576
577=over 4
578
579=item $cv->recv
580
581Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
332called on c<$cv>, while servicing other watchers normally. 582>> methods have been called on c<$cv>, while servicing other watchers
583normally.
333 584
334You can only wait once on a condition - additional calls will return 585You can only wait once on a condition - additional calls are valid but
335immediately. 586will return immediately.
587
588If an error condition has been set by calling C<< ->croak >>, then this
589function will call C<croak>.
590
591In list context, all parameters passed to C<send> will be returned,
592in scalar context only the first one will be returned.
336 593
337Not all event models support a blocking wait - some die in that case 594Not all event models support a blocking wait - some die in that case
338(programs might want to do that to stay interactive), so I<if you are 595(programs might want to do that to stay interactive), so I<if you are
339using this from a module, never require a blocking wait>, but let the 596using this from a module, never require a blocking wait>, but let the
340caller decide whether the call will block or not (for example, by coupling 597caller decide whether the call will block or not (for example, by coupling
341condition variables with some kind of request results and supporting 598condition variables with some kind of request results and supporting
342callbacks so the caller knows that getting the result will not block, 599callbacks so the caller knows that getting the result will not block,
343while still suppporting blocking waits if the caller so desires). 600while still supporting blocking waits if the caller so desires).
344 601
345Another reason I<never> to C<< ->wait >> in a module is that you cannot 602Another reason I<never> to C<< ->recv >> in a module is that you cannot
346sensibly have two C<< ->wait >>'s in parallel, as that would require 603sensibly have two C<< ->recv >>'s in parallel, as that would require
347multiple interpreters or coroutines/threads, none of which C<AnyEvent> 604multiple interpreters or coroutines/threads, none of which C<AnyEvent>
348can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and 605can supply.
349L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
350from different coroutines, however).
351 606
352=item $cv->broadcast 607The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
608fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
609versions and also integrates coroutines into AnyEvent, making blocking
610C<< ->recv >> calls perfectly safe as long as they are done from another
611coroutine (one that doesn't run the event loop).
353 612
354Flag the condition as ready - a running C<< ->wait >> and all further 613You can ensure that C<< -recv >> never blocks by setting a callback and
355calls to C<wait> will (eventually) return after this method has been 614only calling C<< ->recv >> from within that callback (or at a later
356called. If nobody is waiting the broadcast will be remembered.. 615time). This will work even when the event loop does not support blocking
616waits otherwise.
617
618=item $bool = $cv->ready
619
620Returns true when the condition is "true", i.e. whether C<send> or
621C<croak> have been called.
622
623=item $cb = $cv->cb ($cb->($cv))
624
625This is a mutator function that returns the callback set and optionally
626replaces it before doing so.
627
628The callback will be called when the condition becomes "true", i.e. when
629C<send> or C<croak> are called, with the only argument being the condition
630variable itself. Calling C<recv> inside the callback or at any later time
631is guaranteed not to block.
357 632
358=back 633=back
359
360Example:
361
362 # wait till the result is ready
363 my $result_ready = AnyEvent->condvar;
364
365 # do something such as adding a timer
366 # or socket watcher the calls $result_ready->broadcast
367 # when the "result" is ready.
368 # in this case, we simply use a timer:
369 my $w = AnyEvent->timer (
370 after => 1,
371 cb => sub { $result_ready->broadcast },
372 );
373
374 # this "blocks" (while handling events) till the watcher
375 # calls broadcast
376 $result_ready->wait;
377 634
378=head1 GLOBAL VARIABLES AND FUNCTIONS 635=head1 GLOBAL VARIABLES AND FUNCTIONS
379 636
380=over 4 637=over 4
381 638
387C<AnyEvent::Impl:xxx> modules, but can be any other class in the case 644C<AnyEvent::Impl:xxx> modules, but can be any other class in the case
388AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>). 645AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
389 646
390The known classes so far are: 647The known classes so far are:
391 648
392 AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
393 AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
394 AnyEvent::Impl::EV based on EV (an interface to libev, best choice). 649 AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
395 AnyEvent::Impl::Event based on Event, second best choice. 650 AnyEvent::Impl::Event based on Event, second best choice.
651 AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
396 AnyEvent::Impl::Glib based on Glib, third-best choice. 652 AnyEvent::Impl::Glib based on Glib, third-best choice.
397 AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
398 AnyEvent::Impl::Tk based on Tk, very bad choice. 653 AnyEvent::Impl::Tk based on Tk, very bad choice.
399 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs). 654 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
400 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse. 655 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
401 AnyEvent::Impl::POE based on POE, not generic enough for full support. 656 AnyEvent::Impl::POE based on POE, not generic enough for full support.
402 657
415Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model 670Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
416if necessary. You should only call this function right before you would 671if necessary. You should only call this function right before you would
417have created an AnyEvent watcher anyway, that is, as late as possible at 672have created an AnyEvent watcher anyway, that is, as late as possible at
418runtime. 673runtime.
419 674
675=item $guard = AnyEvent::post_detect { BLOCK }
676
677Arranges for the code block to be executed as soon as the event model is
678autodetected (or immediately if this has already happened).
679
680If called in scalar or list context, then it creates and returns an object
681that automatically removes the callback again when it is destroyed. See
682L<Coro::BDB> for a case where this is useful.
683
684=item @AnyEvent::post_detect
685
686If there are any code references in this array (you can C<push> to it
687before or after loading AnyEvent), then they will called directly after
688the event loop has been chosen.
689
690You should check C<$AnyEvent::MODEL> before adding to this array, though:
691if it contains a true value then the event loop has already been detected,
692and the array will be ignored.
693
694Best use C<AnyEvent::post_detect { BLOCK }> instead.
695
420=back 696=back
421 697
422=head1 WHAT TO DO IN A MODULE 698=head1 WHAT TO DO IN A MODULE
423 699
424As a module author, you should C<use AnyEvent> and call AnyEvent methods 700As a module author, you should C<use AnyEvent> and call AnyEvent methods
427Be careful when you create watchers in the module body - AnyEvent will 703Be careful when you create watchers in the module body - AnyEvent will
428decide which event module to use as soon as the first method is called, so 704decide which event module to use as soon as the first method is called, so
429by calling AnyEvent in your module body you force the user of your module 705by calling AnyEvent in your module body you force the user of your module
430to load the event module first. 706to load the event module first.
431 707
432Never call C<< ->wait >> on a condition variable unless you I<know> that 708Never call C<< ->recv >> on a condition variable unless you I<know> that
433the C<< ->broadcast >> method has been called on it already. This is 709the C<< ->send >> method has been called on it already. This is
434because it will stall the whole program, and the whole point of using 710because it will stall the whole program, and the whole point of using
435events is to stay interactive. 711events is to stay interactive.
436 712
437It is fine, however, to call C<< ->wait >> when the user of your module 713It is fine, however, to call C<< ->recv >> when the user of your module
438requests it (i.e. if you create a http request object ad have a method 714requests it (i.e. if you create a http request object ad have a method
439called C<results> that returns the results, it should call C<< ->wait >> 715called C<results> that returns the results, it should call C<< ->recv >>
440freely, as the user of your module knows what she is doing. always). 716freely, as the user of your module knows what she is doing. always).
441 717
442=head1 WHAT TO DO IN THE MAIN PROGRAM 718=head1 WHAT TO DO IN THE MAIN PROGRAM
443 719
444There will always be a single main program - the only place that should 720There will always be a single main program - the only place that should
446 722
447If it doesn't care, it can just "use AnyEvent" and use it itself, or not 723If it doesn't care, it can just "use AnyEvent" and use it itself, or not
448do anything special (it does not need to be event-based) and let AnyEvent 724do anything special (it does not need to be event-based) and let AnyEvent
449decide which implementation to chose if some module relies on it. 725decide which implementation to chose if some module relies on it.
450 726
451If the main program relies on a specific event model. For example, in 727If the main program relies on a specific event model - for example, in
452Gtk2 programs you have to rely on the Glib module. You should load the 728Gtk2 programs you have to rely on the Glib module - you should load the
453event module before loading AnyEvent or any module that uses it: generally 729event module before loading AnyEvent or any module that uses it: generally
454speaking, you should load it as early as possible. The reason is that 730speaking, you should load it as early as possible. The reason is that
455modules might create watchers when they are loaded, and AnyEvent will 731modules might create watchers when they are loaded, and AnyEvent will
456decide on the event model to use as soon as it creates watchers, and it 732decide on the event model to use as soon as it creates watchers, and it
457might chose the wrong one unless you load the correct one yourself. 733might chose the wrong one unless you load the correct one yourself.
458 734
459You can chose to use a rather inefficient pure-perl implementation by 735You can chose to use a pure-perl implementation by loading the
460loading the C<AnyEvent::Impl::Perl> module, which gives you similar 736C<AnyEvent::Impl::Perl> module, which gives you similar behaviour
461behaviour everywhere, but letting AnyEvent chose is generally better. 737everywhere, but letting AnyEvent chose the model is generally better.
738
739=head2 MAINLOOP EMULATION
740
741Sometimes (often for short test scripts, or even standalone programs who
742only want to use AnyEvent), you do not want to run a specific event loop.
743
744In that case, you can use a condition variable like this:
745
746 AnyEvent->condvar->recv;
747
748This has the effect of entering the event loop and looping forever.
749
750Note that usually your program has some exit condition, in which case
751it is better to use the "traditional" approach of storing a condition
752variable somewhere, waiting for it, and sending it when the program should
753exit cleanly.
754
755
756=head1 OTHER MODULES
757
758The following is a non-exhaustive list of additional modules that use
759AnyEvent and can therefore be mixed easily with other AnyEvent modules
760in the same program. Some of the modules come with AnyEvent, some are
761available via CPAN.
762
763=over 4
764
765=item L<AnyEvent::Util>
766
767Contains various utility functions that replace often-used but blocking
768functions such as C<inet_aton> by event-/callback-based versions.
769
770=item L<AnyEvent::Socket>
771
772Provides various utility functions for (internet protocol) sockets,
773addresses and name resolution. Also functions to create non-blocking tcp
774connections or tcp servers, with IPv6 and SRV record support and more.
775
776=item L<AnyEvent::Handle>
777
778Provide read and write buffers, manages watchers for reads and writes,
779supports raw and formatted I/O, I/O queued and fully transparent and
780non-blocking SSL/TLS.
781
782=item L<AnyEvent::DNS>
783
784Provides rich asynchronous DNS resolver capabilities.
785
786=item L<AnyEvent::HTTP>
787
788A simple-to-use HTTP library that is capable of making a lot of concurrent
789HTTP requests.
790
791=item L<AnyEvent::HTTPD>
792
793Provides a simple web application server framework.
794
795=item L<AnyEvent::FastPing>
796
797The fastest ping in the west.
798
799=item L<AnyEvent::DBI>
800
801Executes L<DBI> requests asynchronously in a proxy process.
802
803=item L<AnyEvent::AIO>
804
805Truly asynchronous I/O, should be in the toolbox of every event
806programmer. AnyEvent::AIO transparently fuses L<IO::AIO> and AnyEvent
807together.
808
809=item L<AnyEvent::BDB>
810
811Truly asynchronous Berkeley DB access. AnyEvent::BDB transparently fuses
812L<BDB> and AnyEvent together.
813
814=item L<AnyEvent::GPSD>
815
816A non-blocking interface to gpsd, a daemon delivering GPS information.
817
818=item L<AnyEvent::IGS>
819
820A non-blocking interface to the Internet Go Server protocol (used by
821L<App::IGS>).
822
823=item L<Net::IRC3>
824
825AnyEvent based IRC client module family.
826
827=item L<Net::XMPP2>
828
829AnyEvent based XMPP (Jabber protocol) module family.
830
831=item L<Net::FCP>
832
833AnyEvent-based implementation of the Freenet Client Protocol, birthplace
834of AnyEvent.
835
836=item L<Event::ExecFlow>
837
838High level API for event-based execution flow control.
839
840=item L<Coro>
841
842Has special support for AnyEvent via L<Coro::AnyEvent>.
843
844=item L<IO::Lambda>
845
846The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
847
848=back
462 849
463=cut 850=cut
464 851
465package AnyEvent; 852package AnyEvent;
466 853
467no warnings; 854no warnings;
468use strict; 855use strict;
469 856
470use Carp; 857use Carp;
471 858
472our $VERSION = '3.3'; 859our $VERSION = 4.233;
473our $MODEL; 860our $MODEL;
474 861
475our $AUTOLOAD; 862our $AUTOLOAD;
476our @ISA; 863our @ISA;
477 864
865our @REGISTRY;
866
867our $WIN32;
868
869BEGIN {
870 my $win32 = ! ! ($^O =~ /mswin32/i);
871 eval "sub WIN32(){ $win32 }";
872}
873
478our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 874our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
479 875
480our @REGISTRY; 876our %PROTOCOL; # (ipv4|ipv6) => (1|2), higher numbers are preferred
877
878{
879 my $idx;
880 $PROTOCOL{$_} = ++$idx
881 for reverse split /\s*,\s*/,
882 $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
883}
481 884
482my @models = ( 885my @models = (
483 [Coro::EV:: => AnyEvent::Impl::CoroEV::],
484 [Coro::Event:: => AnyEvent::Impl::CoroEvent::],
485 [EV:: => AnyEvent::Impl::EV::], 886 [EV:: => AnyEvent::Impl::EV::],
486 [Event:: => AnyEvent::Impl::Event::], 887 [Event:: => AnyEvent::Impl::Event::],
487 [Glib:: => AnyEvent::Impl::Glib::],
488 [Tk:: => AnyEvent::Impl::Tk::],
489 [Wx:: => AnyEvent::Impl::POE::],
490 [Prima:: => AnyEvent::Impl::POE::],
491 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::], 888 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
492 # everything below here will not be autoprobed as the pureperl backend should work everywhere 889 # everything below here will not be autoprobed
890 # as the pureperl backend should work everywhere
891 # and is usually faster
892 [Tk:: => AnyEvent::Impl::Tk::], # crashes with many handles
893 [Glib:: => AnyEvent::Impl::Glib::], # becomes extremely slow with many watchers
493 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy 894 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
494 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program 895 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
495 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza 896 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
897 [Wx:: => AnyEvent::Impl::POE::],
898 [Prima:: => AnyEvent::Impl::POE::],
496); 899);
497 900
498our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY); 901our %method = map +($_ => 1), qw(io timer time now signal child condvar one_event DESTROY);
902
903our @post_detect;
904
905sub post_detect(&) {
906 my ($cb) = @_;
907
908 if ($MODEL) {
909 $cb->();
910
911 1
912 } else {
913 push @post_detect, $cb;
914
915 defined wantarray
916 ? bless \$cb, "AnyEvent::Util::PostDetect"
917 : ()
918 }
919}
920
921sub AnyEvent::Util::PostDetect::DESTROY {
922 @post_detect = grep $_ != ${$_[0]}, @post_detect;
923}
499 924
500sub detect() { 925sub detect() {
501 unless ($MODEL) { 926 unless ($MODEL) {
502 no strict 'refs'; 927 no strict 'refs';
928 local $SIG{__DIE__};
503 929
504 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) { 930 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) {
505 my $model = "AnyEvent::Impl::$1"; 931 my $model = "AnyEvent::Impl::$1";
506 if (eval "require $model") { 932 if (eval "require $model") {
507 $MODEL = $model; 933 $MODEL = $model;
537 last; 963 last;
538 } 964 }
539 } 965 }
540 966
541 $MODEL 967 $MODEL
542 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."; 968 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.";
543 } 969 }
544 } 970 }
545 971
972 push @{"$MODEL\::ISA"}, "AnyEvent::Base";
973
546 unshift @ISA, $MODEL; 974 unshift @ISA, $MODEL;
547 push @{"$MODEL\::ISA"}, "AnyEvent::Base"; 975
976 require AnyEvent::Strict if $ENV{PERL_ANYEVENT_STRICT};
977
978 (shift @post_detect)->() while @post_detect;
548 } 979 }
549 980
550 $MODEL 981 $MODEL
551} 982}
552 983
560 991
561 my $class = shift; 992 my $class = shift;
562 $class->$func (@_); 993 $class->$func (@_);
563} 994}
564 995
996# utility function to dup a filehandle. this is used by many backends
997# to support binding more than one watcher per filehandle (they usually
998# allow only one watcher per fd, so we dup it to get a different one).
999sub _dupfh($$$$) {
1000 my ($poll, $fh, $r, $w) = @_;
1001
1002 require Fcntl;
1003
1004 # cygwin requires the fh mode to be matching, unix doesn't
1005 my ($rw, $mode) = $poll eq "r" ? ($r, "<")
1006 : $poll eq "w" ? ($w, ">")
1007 : Carp::croak "AnyEvent->io requires poll set to either 'r' or 'w'";
1008
1009 open my $fh2, "$mode&" . fileno $fh
1010 or die "cannot dup() filehandle: $!";
1011
1012 # we assume CLOEXEC is already set by perl in all important cases
1013
1014 ($fh2, $rw)
1015}
1016
565package AnyEvent::Base; 1017package AnyEvent::Base;
566 1018
1019# default implementation for now and time
1020
1021BEGIN {
1022 if (eval "use Time::HiRes (); time (); 1") {
1023 *_time = \&Time::HiRes::time;
1024 # if (eval "use POSIX (); (POSIX::times())...
1025 } else {
1026 *_time = \&CORE::time; # epic fail
1027 }
1028}
1029
1030sub time { _time }
1031sub now { _time }
1032
567# default implementation for ->condvar, ->wait, ->broadcast 1033# default implementation for ->condvar
568 1034
569sub condvar { 1035sub condvar {
570 bless \my $flag, "AnyEvent::Base::CondVar" 1036 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
571}
572
573sub AnyEvent::Base::CondVar::broadcast {
574 ${$_[0]}++;
575}
576
577sub AnyEvent::Base::CondVar::wait {
578 AnyEvent->one_event while !${$_[0]};
579} 1037}
580 1038
581# default implementation for ->signal 1039# default implementation for ->signal
582 1040
583our %SIG_CB; 1041our %SIG_CB;
599sub AnyEvent::Base::Signal::DESTROY { 1057sub AnyEvent::Base::Signal::DESTROY {
600 my ($signal, $cb) = @{$_[0]}; 1058 my ($signal, $cb) = @{$_[0]};
601 1059
602 delete $SIG_CB{$signal}{$cb}; 1060 delete $SIG_CB{$signal}{$cb};
603 1061
604 $SIG{$signal} = 'DEFAULT' unless keys %{ $SIG_CB{$signal} }; 1062 delete $SIG{$signal} unless keys %{ $SIG_CB{$signal} };
605} 1063}
606 1064
607# default implementation for ->child 1065# default implementation for ->child
608 1066
609our %PID_CB; 1067our %PID_CB;
636 or Carp::croak "required option 'pid' is missing"; 1094 or Carp::croak "required option 'pid' is missing";
637 1095
638 $PID_CB{$pid}{$arg{cb}} = $arg{cb}; 1096 $PID_CB{$pid}{$arg{cb}} = $arg{cb};
639 1097
640 unless ($WNOHANG) { 1098 unless ($WNOHANG) {
641 $WNOHANG = eval { require POSIX; &POSIX::WNOHANG } || 1; 1099 $WNOHANG = eval { local $SIG{__DIE__}; require POSIX; &POSIX::WNOHANG } || 1;
642 } 1100 }
643 1101
644 unless ($CHLD_W) { 1102 unless ($CHLD_W) {
645 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld); 1103 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld);
646 # child could be a zombie already, so make at least one round 1104 # child could be a zombie already, so make at least one round
656 delete $PID_CB{$pid}{$cb}; 1114 delete $PID_CB{$pid}{$cb};
657 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 1115 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
658 1116
659 undef $CHLD_W unless keys %PID_CB; 1117 undef $CHLD_W unless keys %PID_CB;
660} 1118}
1119
1120package AnyEvent::CondVar;
1121
1122our @ISA = AnyEvent::CondVar::Base::;
1123
1124package AnyEvent::CondVar::Base;
1125
1126use overload
1127 '&{}' => sub { my $self = shift; sub { $self->send (@_) } },
1128 fallback => 1;
1129
1130sub _send {
1131 # nop
1132}
1133
1134sub send {
1135 my $cv = shift;
1136 $cv->{_ae_sent} = [@_];
1137 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
1138 $cv->_send;
1139}
1140
1141sub croak {
1142 $_[0]{_ae_croak} = $_[1];
1143 $_[0]->send;
1144}
1145
1146sub ready {
1147 $_[0]{_ae_sent}
1148}
1149
1150sub _wait {
1151 AnyEvent->one_event while !$_[0]{_ae_sent};
1152}
1153
1154sub recv {
1155 $_[0]->_wait;
1156
1157 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
1158 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
1159}
1160
1161sub cb {
1162 $_[0]{_ae_cb} = $_[1] if @_ > 1;
1163 $_[0]{_ae_cb}
1164}
1165
1166sub begin {
1167 ++$_[0]{_ae_counter};
1168 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
1169}
1170
1171sub end {
1172 return if --$_[0]{_ae_counter};
1173 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
1174}
1175
1176# undocumented/compatibility with pre-3.4
1177*broadcast = \&send;
1178*wait = \&_wait;
661 1179
662=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 1180=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
663 1181
664This is an advanced topic that you do not normally need to use AnyEvent in 1182This is an advanced topic that you do not normally need to use AnyEvent in
665a module. This section is only of use to event loop authors who want to 1183a module. This section is only of use to event loop authors who want to
719C<PERL_ANYEVENT_MODEL>. 1237C<PERL_ANYEVENT_MODEL>.
720 1238
721When set to C<2> or higher, cause AnyEvent to report to STDERR which event 1239When set to C<2> or higher, cause AnyEvent to report to STDERR which event
722model it chooses. 1240model it chooses.
723 1241
1242=item C<PERL_ANYEVENT_STRICT>
1243
1244AnyEvent does not do much argument checking by default, as thorough
1245argument checking is very costly. Setting this variable to a true value
1246will cause AnyEvent to load C<AnyEvent::Strict> and then to thoroughly
1247check the arguments passed to most method calls. If it finds any problems
1248it will croak.
1249
1250In other words, enables "strict" mode.
1251
1252Unlike C<use strict> it is definitely recommended ot keep it off in
1253production.
1254
724=item C<PERL_ANYEVENT_MODEL> 1255=item C<PERL_ANYEVENT_MODEL>
725 1256
726This can be used to specify the event model to be used by AnyEvent, before 1257This can be used to specify the event model to be used by AnyEvent, before
727autodetection and -probing kicks in. It must be a string consisting 1258auto detection and -probing kicks in. It must be a string consisting
728entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended 1259entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
729and the resulting module name is loaded and if the load was successful, 1260and the resulting module name is loaded and if the load was successful,
730used as event model. If it fails to load AnyEvent will proceed with 1261used as event model. If it fails to load AnyEvent will proceed with
731autodetection and -probing. 1262auto detection and -probing.
732 1263
733This functionality might change in future versions. 1264This functionality might change in future versions.
734 1265
735For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you 1266For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
736could start your program like this: 1267could start your program like this:
737 1268
738 PERL_ANYEVENT_MODEL=Perl perl ... 1269 PERL_ANYEVENT_MODEL=Perl perl ...
1270
1271=item C<PERL_ANYEVENT_PROTOCOLS>
1272
1273Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1274for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1275of auto probing).
1276
1277Must be set to a comma-separated list of protocols or address families,
1278current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1279used, and preference will be given to protocols mentioned earlier in the
1280list.
1281
1282This variable can effectively be used for denial-of-service attacks
1283against local programs (e.g. when setuid), although the impact is likely
1284small, as the program has to handle connection errors already-
1285
1286Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1287but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1288- only support IPv4, never try to resolve or contact IPv6
1289addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1290IPv6, but prefer IPv6 over IPv4.
1291
1292=item C<PERL_ANYEVENT_EDNS0>
1293
1294Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1295for DNS. This extension is generally useful to reduce DNS traffic, but
1296some (broken) firewalls drop such DNS packets, which is why it is off by
1297default.
1298
1299Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1300EDNS0 in its DNS requests.
1301
1302=item C<PERL_ANYEVENT_MAX_FORKS>
1303
1304The maximum number of child processes that C<AnyEvent::Util::fork_call>
1305will create in parallel.
739 1306
740=back 1307=back
741 1308
742=head1 EXAMPLE PROGRAM 1309=head1 EXAMPLE PROGRAM
743 1310
754 poll => 'r', 1321 poll => 'r',
755 cb => sub { 1322 cb => sub {
756 warn "io event <$_[0]>\n"; # will always output <r> 1323 warn "io event <$_[0]>\n"; # will always output <r>
757 chomp (my $input = <STDIN>); # read a line 1324 chomp (my $input = <STDIN>); # read a line
758 warn "read: $input\n"; # output what has been read 1325 warn "read: $input\n"; # output what has been read
759 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1326 $cv->send if $input =~ /^q/i; # quit program if /^q/i
760 }, 1327 },
761 ); 1328 );
762 1329
763 my $time_watcher; # can only be used once 1330 my $time_watcher; # can only be used once
764 1331
769 }); 1336 });
770 } 1337 }
771 1338
772 new_timer; # create first timer 1339 new_timer; # create first timer
773 1340
774 $cv->wait; # wait until user enters /^q/i 1341 $cv->recv; # wait until user enters /^q/i
775 1342
776=head1 REAL-WORLD EXAMPLE 1343=head1 REAL-WORLD EXAMPLE
777 1344
778Consider the L<Net::FCP> module. It features (among others) the following 1345Consider the L<Net::FCP> module. It features (among others) the following
779API calls, which are to freenet what HTTP GET requests are to http: 1346API calls, which are to freenet what HTTP GET requests are to http:
829 syswrite $txn->{fh}, $txn->{request} 1396 syswrite $txn->{fh}, $txn->{request}
830 or die "connection or write error"; 1397 or die "connection or write error";
831 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r }); 1398 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
832 1399
833Again, C<fh_ready_r> waits till all data has arrived, and then stores the 1400Again, C<fh_ready_r> waits till all data has arrived, and then stores the
834result and signals any possible waiters that the request ahs finished: 1401result and signals any possible waiters that the request has finished:
835 1402
836 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1403 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
837 1404
838 if (end-of-file or data complete) { 1405 if (end-of-file or data complete) {
839 $txn->{result} = $txn->{buf}; 1406 $txn->{result} = $txn->{buf};
840 $txn->{finished}->broadcast; 1407 $txn->{finished}->send;
841 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1408 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
842 } 1409 }
843 1410
844The C<result> method, finally, just waits for the finished signal (if the 1411The C<result> method, finally, just waits for the finished signal (if the
845request was already finished, it doesn't wait, of course, and returns the 1412request was already finished, it doesn't wait, of course, and returns the
846data: 1413data:
847 1414
848 $txn->{finished}->wait; 1415 $txn->{finished}->recv;
849 return $txn->{result}; 1416 return $txn->{result};
850 1417
851The actual code goes further and collects all errors (C<die>s, exceptions) 1418The actual code goes further and collects all errors (C<die>s, exceptions)
852that occured during request processing. The C<result> method detects 1419that occurred during request processing. The C<result> method detects
853whether an exception as thrown (it is stored inside the $txn object) 1420whether an exception as thrown (it is stored inside the $txn object)
854and just throws the exception, which means connection errors and other 1421and just throws the exception, which means connection errors and other
855problems get reported tot he code that tries to use the result, not in a 1422problems get reported tot he code that tries to use the result, not in a
856random callback. 1423random callback.
857 1424
888 1455
889 my $quit = AnyEvent->condvar; 1456 my $quit = AnyEvent->condvar;
890 1457
891 $fcp->txn_client_get ($url)->cb (sub { 1458 $fcp->txn_client_get ($url)->cb (sub {
892 ... 1459 ...
893 $quit->broadcast; 1460 $quit->send;
894 }); 1461 });
895 1462
896 $quit->wait; 1463 $quit->recv;
897 1464
898 1465
899=head1 BENCHMARKS 1466=head1 BENCHMARKS
900 1467
901To give you an idea of the performance and overheads that AnyEvent adds 1468To give you an idea of the performance and overheads that AnyEvent adds
903of various event loops I prepared some benchmarks. 1470of various event loops I prepared some benchmarks.
904 1471
905=head2 BENCHMARKING ANYEVENT OVERHEAD 1472=head2 BENCHMARKING ANYEVENT OVERHEAD
906 1473
907Here is a benchmark of various supported event models used natively and 1474Here is a benchmark of various supported event models used natively and
908through anyevent. The benchmark creates a lot of timers (with a zero 1475through AnyEvent. The benchmark creates a lot of timers (with a zero
909timeout) and I/O watchers (watching STDOUT, a pty, to become writable, 1476timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
910which it is), lets them fire exactly once and destroys them again. 1477which it is), lets them fire exactly once and destroys them again.
911 1478
912Source code for this benchmark is found as F<eg/bench> in the AnyEvent 1479Source code for this benchmark is found as F<eg/bench> in the AnyEvent
913distribution. 1480distribution.
930all watchers, to avoid adding memory overhead. That means closure creation 1497all watchers, to avoid adding memory overhead. That means closure creation
931and memory usage is not included in the figures. 1498and memory usage is not included in the figures.
932 1499
933I<invoke> is the time, in microseconds, used to invoke a simple 1500I<invoke> is the time, in microseconds, used to invoke a simple
934callback. The callback simply counts down a Perl variable and after it was 1501callback. The callback simply counts down a Perl variable and after it was
935invoked "watcher" times, it would C<< ->broadcast >> a condvar once to 1502invoked "watcher" times, it would C<< ->send >> a condvar once to
936signal the end of this phase. 1503signal the end of this phase.
937 1504
938I<destroy> is the time, in microseconds, that it takes to destroy a single 1505I<destroy> is the time, in microseconds, that it takes to destroy a single
939watcher. 1506watcher.
940 1507
944 EV/EV 400000 244 0.56 0.46 0.31 EV native interface 1511 EV/EV 400000 244 0.56 0.46 0.31 EV native interface
945 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers 1512 EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
946 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal 1513 CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
947 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation 1514 Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
948 Event/Event 16000 516 31.88 31.30 0.85 Event native interface 1515 Event/Event 16000 516 31.88 31.30 0.85 Event native interface
949 Event/Any 16000 936 39.17 33.63 1.43 Event + AnyEvent watchers 1516 Event/Any 16000 590 35.75 31.42 1.08 Event + AnyEvent watchers
950 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour 1517 Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
951 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers 1518 Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
952 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event 1519 POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
953 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select 1520 POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
954 1521
963 1530
964Also, note that the number of watchers usually has a nonlinear effect on 1531Also, note that the number of watchers usually has a nonlinear effect on
965overall speed, that is, creating twice as many watchers doesn't take twice 1532overall speed, that is, creating twice as many watchers doesn't take twice
966the time - usually it takes longer. This puts event loops tested with a 1533the time - usually it takes longer. This puts event loops tested with a
967higher number of watchers at a disadvantage. 1534higher number of watchers at a disadvantage.
1535
1536To put the range of results into perspective, consider that on the
1537benchmark machine, handling an event takes roughly 1600 CPU cycles with
1538EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1539cycles with POE.
968 1540
969C<EV> is the sole leader regarding speed and memory use, which are both 1541C<EV> is the sole leader regarding speed and memory use, which are both
970maximal/minimal, respectively. Even when going through AnyEvent, it uses 1542maximal/minimal, respectively. Even when going through AnyEvent, it uses
971far less memory than any other event loop and is still faster than Event 1543far less memory than any other event loop and is still faster than Event
972natively. 1544natively.
995file descriptor is dup()ed for each watcher. This shows that the dup() 1567file descriptor is dup()ed for each watcher. This shows that the dup()
996employed by some adaptors is not a big performance issue (it does incur a 1568employed by some adaptors is not a big performance issue (it does incur a
997hidden memory cost inside the kernel which is not reflected in the figures 1569hidden memory cost inside the kernel which is not reflected in the figures
998above). 1570above).
999 1571
1000C<POE>, regardless of underlying event loop (whether using its pure 1572C<POE>, regardless of underlying event loop (whether using its pure perl
1001perl select-based backend or the Event module, the POE-EV backend 1573select-based backend or the Event module, the POE-EV backend couldn't
1002couldn't be tested because it wasn't working) shows abysmal performance 1574be tested because it wasn't working) shows abysmal performance and
1003and memory usage: Watchers use almost 30 times as much memory as 1575memory usage with AnyEvent: Watchers use almost 30 times as much memory
1004EV watchers, and 10 times as much memory as Event (the high memory 1576as EV watchers, and 10 times as much memory as Event (the high memory
1005requirements are caused by requiring a session for each watcher). Watcher 1577requirements are caused by requiring a session for each watcher). Watcher
1006invocation speed is almost 900 times slower than with AnyEvent's pure perl 1578invocation speed is almost 900 times slower than with AnyEvent's pure perl
1579implementation.
1580
1007implementation. The design of the POE adaptor class in AnyEvent can not 1581The design of the POE adaptor class in AnyEvent can not really account
1008really account for this, as session creation overhead is small compared 1582for the performance issues, though, as session creation overhead is
1009to execution of the state machine, which is coded pretty optimally within 1583small compared to execution of the state machine, which is coded pretty
1010L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow. 1584optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
1585using multiple sessions is not a good approach, especially regarding
1586memory usage, even the author of POE could not come up with a faster
1587design).
1011 1588
1012=head3 Summary 1589=head3 Summary
1013 1590
1014=over 4 1591=over 4
1015 1592
1026 1603
1027=back 1604=back
1028 1605
1029=head2 BENCHMARKING THE LARGE SERVER CASE 1606=head2 BENCHMARKING THE LARGE SERVER CASE
1030 1607
1031This benchmark atcually benchmarks the event loop itself. It works by 1608This benchmark actually benchmarks the event loop itself. It works by
1032creating a number of "servers": each server consists of a socketpair, a 1609creating a number of "servers": each server consists of a socket pair, a
1033timeout watcher that gets reset on activity (but never fires), and an I/O 1610timeout watcher that gets reset on activity (but never fires), and an I/O
1034watcher waiting for input on one side of the socket. Each time the socket 1611watcher waiting for input on one side of the socket. Each time the socket
1035watcher reads a byte it will write that byte to a random other "server". 1612watcher reads a byte it will write that byte to a random other "server".
1036 1613
1037The effect is that there will be a lot of I/O watchers, only part of which 1614The effect is that there will be a lot of I/O watchers, only part of which
1038are active at any one point (so there is a constant number of active 1615are active at any one point (so there is a constant number of active
1039fds for each loop iterstaion, but which fds these are is random). The 1616fds for each loop iteration, but which fds these are is random). The
1040timeout is reset each time something is read because that reflects how 1617timeout is reset each time something is read because that reflects how
1041most timeouts work (and puts extra pressure on the event loops). 1618most timeouts work (and puts extra pressure on the event loops).
1042 1619
1043In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100 1620In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1044(1%) are active. This mirrors the activity of large servers with many 1621(1%) are active. This mirrors the activity of large servers with many
1045connections, most of which are idle at any one point in time. 1622connections, most of which are idle at any one point in time.
1046 1623
1047Source code for this benchmark is found as F<eg/bench2> in the AnyEvent 1624Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1048distribution. 1625distribution.
1050=head3 Explanation of the columns 1627=head3 Explanation of the columns
1051 1628
1052I<sockets> is the number of sockets, and twice the number of "servers" (as 1629I<sockets> is the number of sockets, and twice the number of "servers" (as
1053each server has a read and write socket end). 1630each server has a read and write socket end).
1054 1631
1055I<create> is the time it takes to create a socketpair (which is 1632I<create> is the time it takes to create a socket pair (which is
1056nontrivial) and two watchers: an I/O watcher and a timeout watcher. 1633nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1057 1634
1058I<request>, the most important value, is the time it takes to handle a 1635I<request>, the most important value, is the time it takes to handle a
1059single "request", that is, reading the token from the pipe and forwarding 1636single "request", that is, reading the token from the pipe and forwarding
1060it to another server. This includes deleting the old timeout and creating 1637it to another server. This includes deleting the old timeout and creating
1062 1639
1063=head3 Results 1640=head3 Results
1064 1641
1065 name sockets create request 1642 name sockets create request
1066 EV 20000 69.01 11.16 1643 EV 20000 69.01 11.16
1067 Perl 20000 75.28 112.76 1644 Perl 20000 73.32 35.87
1068 Event 20000 212.62 257.32 1645 Event 20000 212.62 257.32
1069 Glib 20000 651.16 1896.30 1646 Glib 20000 651.16 1896.30
1070 POE 20000 349.67 12317.24 uses POE::Loop::Event 1647 POE 20000 349.67 12317.24 uses POE::Loop::Event
1071 1648
1072=head3 Discussion 1649=head3 Discussion
1094 1671
1095=head3 Summary 1672=head3 Summary
1096 1673
1097=over 4 1674=over 4
1098 1675
1099=item * The pure perl implementation performs extremely well, considering 1676=item * The pure perl implementation performs extremely well.
1100that it uses select.
1101 1677
1102=item * Avoid Glib or POE in large projects where performance matters. 1678=item * Avoid Glib or POE in large projects where performance matters.
1103 1679
1104=back 1680=back
1105 1681
1118 1694
1119=head3 Results 1695=head3 Results
1120 1696
1121 name sockets create request 1697 name sockets create request
1122 EV 16 20.00 6.54 1698 EV 16 20.00 6.54
1699 Perl 16 25.75 12.62
1123 Event 16 81.27 35.86 1700 Event 16 81.27 35.86
1124 Glib 16 32.63 15.48 1701 Glib 16 32.63 15.48
1125 Perl 16 24.62 162.37
1126 POE 16 261.87 276.28 uses POE::Loop::Event 1702 POE 16 261.87 276.28 uses POE::Loop::Event
1127 1703
1128=head3 Discussion 1704=head3 Discussion
1129 1705
1130The benchmark tries to test the performance of a typical small 1706The benchmark tries to test the performance of a typical small
1131server. While knowing how various event loops perform is interesting, keep 1707server. While knowing how various event loops perform is interesting, keep
1132in mind that their overhead in this case is usually not as important, due 1708in mind that their overhead in this case is usually not as important, due
1133to the small absolute number of watchers. 1709to the small absolute number of watchers (that is, you need efficiency and
1710speed most when you have lots of watchers, not when you only have a few of
1711them).
1134 1712
1135EV is again fastest. 1713EV is again fastest.
1136 1714
1137The C-based event loops Event and Glib come in second this time, as the 1715Perl again comes second. It is noticeably faster than the C-based event
1138overhead of running an iteration is much smaller in C than in Perl (little 1716loops Event and Glib, although the difference is too small to really
1139code to execute in the inner loop, and perl's function calling overhead is 1717matter.
1140high, and updating all the data structures is costly).
1141 1718
1142The pure perl event loop is much slower, but still competitive.
1143
1144POE also performs much better in this case, but is is stillf ar behind the 1719POE also performs much better in this case, but is is still far behind the
1145others. 1720others.
1146 1721
1147=head3 Summary 1722=head3 Summary
1148 1723
1149=over 4 1724=over 4
1155 1730
1156 1731
1157=head1 FORK 1732=head1 FORK
1158 1733
1159Most event libraries are not fork-safe. The ones who are usually are 1734Most event libraries are not fork-safe. The ones who are usually are
1160because they are so inefficient. Only L<EV> is fully fork-aware. 1735because they rely on inefficient but fork-safe C<select> or C<poll>
1736calls. Only L<EV> is fully fork-aware.
1161 1737
1162If you have to fork, you must either do so I<before> creating your first 1738If you have to fork, you must either do so I<before> creating your first
1163watcher OR you must not use AnyEvent at all in the child. 1739watcher OR you must not use AnyEvent at all in the child.
1164 1740
1165 1741
1173specified in the variable. 1749specified in the variable.
1174 1750
1175You can make AnyEvent completely ignore this variable by deleting it 1751You can make AnyEvent completely ignore this variable by deleting it
1176before the first watcher gets created, e.g. with a C<BEGIN> block: 1752before the first watcher gets created, e.g. with a C<BEGIN> block:
1177 1753
1178 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} } 1754 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
1179 1755
1180 use AnyEvent; 1756 use AnyEvent;
1757
1758Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
1759be used to probe what backend is used and gain other information (which is
1760probably even less useful to an attacker than PERL_ANYEVENT_MODEL), and
1761$ENV{PERL_ANYEGENT_STRICT}.
1762
1763
1764=head1 BUGS
1765
1766Perl 5.8 has numerous memleaks that sometimes hit this module and are hard
1767to work around. If you suffer from memleaks, first upgrade to Perl 5.10
1768and check wether the leaks still show up. (Perl 5.10.0 has other annoying
1769mamleaks, such as leaking on C<map> and C<grep> but it is usually not as
1770pronounced).
1181 1771
1182 1772
1183=head1 SEE ALSO 1773=head1 SEE ALSO
1184 1774
1185Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>, 1775Utility functions: L<AnyEvent::Util>.
1186L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>, 1776
1777Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1187L<Event::Lib>, L<Qt>, L<POE>. 1778L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1188 1779
1189Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>, 1780Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1190L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>, 1781L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1191L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>, 1782L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1192L<AnyEvent::Impl::Qt>, L<AnyEvent::Impl::POE>. 1783L<AnyEvent::Impl::POE>.
1193 1784
1785Non-blocking file handles, sockets, TCP clients and
1786servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
1787
1788Asynchronous DNS: L<AnyEvent::DNS>.
1789
1790Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1791
1194Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 1792Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1195 1793
1196 1794
1197=head1 AUTHOR 1795=head1 AUTHOR
1198 1796
1199 Marc Lehmann <schmorp@schmorp.de> 1797 Marc Lehmann <schmorp@schmorp.de>
1200 http://home.schmorp.de/ 1798 http://home.schmorp.de/
1201 1799
1202=cut 1800=cut
1203 1801
12041 18021
1205 1803

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines