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.58 by root, Thu Apr 24 03:24:07 2008 UTC vs.
Revision 1.228 by root, Wed Jul 8 01:11:12 2009 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 - various supported event loops 5EV, Event, Glib, Tk, Perl, Event::Lib, Qt and POE are various supported
6event loops.
6 7
7=head1 SYNOPSIS 8=head1 SYNOPSIS
8 9
9 use AnyEvent; 10 use AnyEvent;
10 11
12 # file descriptor readable
11 my $w = AnyEvent->io (fh => $fh, poll => "r|w", cb => sub { 13 my $w = AnyEvent->io (fh => $fh, poll => "r", cb => sub { ... });
14
15 # one-shot or repeating timers
16 my $w = AnyEvent->timer (after => $seconds, cb => sub { ... });
17 my $w = AnyEvent->timer (after => $seconds, interval => $seconds, cb => ...
18
19 print AnyEvent->now; # prints current event loop time
20 print AnyEvent->time; # think Time::HiRes::time or simply CORE::time.
21
22 # POSIX signal
23 my $w = AnyEvent->signal (signal => "TERM", cb => sub { ... });
24
25 # child process exit
26 my $w = AnyEvent->child (pid => $pid, cb => sub {
27 my ($pid, $status) = @_;
12 ... 28 ...
13 }); 29 });
14 30
15 my $w = AnyEvent->timer (after => $seconds, cb => sub { 31 # called when event loop idle (if applicable)
16 ... 32 my $w = AnyEvent->idle (cb => sub { ... });
17 });
18 33
19 my $w = AnyEvent->condvar; # stores whether a condition was flagged 34 my $w = AnyEvent->condvar; # stores whether a condition was flagged
35 $w->send; # wake up current and all future recv's
20 $w->wait; # enters "main loop" till $condvar gets ->broadcast 36 $w->recv; # enters "main loop" till $condvar gets ->send
21 $w->broadcast; # wake up current and all future wait's 37 # use a condvar in callback mode:
38 $w->cb (sub { $_[0]->recv });
39
40=head1 INTRODUCTION/TUTORIAL
41
42This manpage is mainly a reference manual. If you are interested
43in a tutorial or some gentle introduction, have a look at the
44L<AnyEvent::Intro> manpage.
22 45
23=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT) 46=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT)
24 47
25Glib, POE, IO::Async, Event... CPAN offers event models by the dozen 48Glib, POE, IO::Async, Event... CPAN offers event models by the dozen
26nowadays. So what is different about AnyEvent? 49nowadays. So what is different about AnyEvent?
27 50
28Executive Summary: AnyEvent is I<compatible>, AnyEvent is I<free of 51Executive Summary: AnyEvent is I<compatible>, AnyEvent is I<free of
29policy> and AnyEvent is I<small and efficient>. 52policy> and AnyEvent is I<small and efficient>.
30 53
31First and foremost, I<AnyEvent is not an event model> itself, it only 54First 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 55interfaces to whatever event model the main program happens to use, in a
33pragmatic way. For event models and certain classes of immortals alike, 56pragmatic way. For event models and certain classes of immortals alike,
34the statement "there can only be one" is a bitter reality: In general, 57the 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 58only one event loop can be active at the same time in a process. AnyEvent
36helps hiding the differences between those event loops. 59cannot change this, but it can hide the differences between those event
60loops.
37 61
38The goal of AnyEvent is to offer module authors the ability to do event 62The 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 63programming (waiting for I/O or timer events) without subscribing to a
40religion, a way of living, and most importantly: without forcing your 64religion, a way of living, and most importantly: without forcing your
41module users into the same thing by forcing them to use the same event 65module users into the same thing by forcing them to use the same event
42model you use. 66model you use.
43 67
44For modules like POE or IO::Async (which is a total misnomer as it is 68For 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 69actually 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 70like 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 71cannot use anything else, as they are simply incompatible to everything
48isn't itself. What's worse, all the potential users of your module are 72that isn't them. What's worse, all the potential users of your
49I<also> forced to use the same event loop you use. 73module are I<also> forced to use the same event loop you use.
50 74
51AnyEvent is different: AnyEvent + POE works fine. AnyEvent + Glib works 75AnyEvent is different: AnyEvent + POE works fine. AnyEvent + Glib works
52fine. AnyEvent + Tk works fine etc. etc. but none of these work together 76fine. 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 77with 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, 78your 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 79too. But if your module uses AnyEvent, it works transparently with all
56event models it supports (including stuff like POE and IO::Async, as long 80event 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 81use one of the supported event loops. It is trivial to add new event loops
58event loops to AnyEvent, too, so it is future-proof). 82to AnyEvent, too, so it is future-proof).
59 83
60In addition to being free of having to use I<the one and only true event 84In 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 85model>, 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 86modules, 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 87follow. 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 88offering the functionality that is necessary, in as thin as a wrapper as
65technically possible. 89technically possible.
66 90
91Of course, AnyEvent comes with a big (and fully optional!) toolbox
92of useful functionality, such as an asynchronous DNS resolver, 100%
93non-blocking connects (even with TLS/SSL, IPv6 and on broken platforms
94such as Windows) and lots of real-world knowledge and workarounds for
95platform bugs and differences.
96
67Of course, if you want lots of policy (this can arguably be somewhat 97Now, 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 98useful) and you want to force your users to use the one and only event
69model, you should I<not> use this module. 99model, you should I<not> use this module.
70
71 100
72=head1 DESCRIPTION 101=head1 DESCRIPTION
73 102
74L<AnyEvent> provides an identical interface to multiple event loops. This 103L<AnyEvent> provides an identical interface to multiple event loops. This
75allows module authors to utilise an event loop without forcing module 104allows module authors to utilise an event loop without forcing module
78 107
79The interface itself is vaguely similar, but not identical to the L<Event> 108The interface itself is vaguely similar, but not identical to the L<Event>
80module. 109module.
81 110
82During the first call of any watcher-creation method, the module tries 111During the first call of any watcher-creation method, the module tries
83to detect the currently loaded event loop by probing whether one of 112to detect the currently loaded event loop by probing whether one of the
84the following modules is already loaded: L<Coro::EV>, L<Coro::Event>, 113following modules is already loaded: L<EV>,
85L<EV>, L<Event>, L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>. The first one 114L<Event>, L<Glib>, L<AnyEvent::Impl::Perl>, L<Tk>, L<Event::Lib>, L<Qt>,
86found is used. If none are found, the module tries to load these modules 115L<POE>. The first one found is used. If none are found, the module tries
87(excluding Event::Lib and Qt) in the order given. The first one that can 116to load these modules (excluding Tk, Event::Lib, Qt and POE as the pure perl
117adaptor should always succeed) in the order given. The first one that can
88be successfully loaded will be used. If, after this, still none could be 118be successfully loaded will be used. If, after this, still none could be
89found, AnyEvent will fall back to a pure-perl event loop, which is not 119found, AnyEvent will fall back to a pure-perl event loop, which is not
90very efficient, but should work everywhere. 120very efficient, but should work everywhere.
91 121
92Because AnyEvent first checks for modules that are already loaded, loading 122Because AnyEvent first checks for modules that are already loaded, loading
102starts using it, all bets are off. Maybe you should tell their authors to 132starts using it, all bets are off. Maybe you should tell their authors to
103use AnyEvent so their modules work together with others seamlessly... 133use AnyEvent so their modules work together with others seamlessly...
104 134
105The pure-perl implementation of AnyEvent is called 135The pure-perl implementation of AnyEvent is called
106C<AnyEvent::Impl::Perl>. Like other event modules you can load it 136C<AnyEvent::Impl::Perl>. Like other event modules you can load it
107explicitly. 137explicitly and enjoy the high availability of that event loop :)
108 138
109=head1 WATCHERS 139=head1 WATCHERS
110 140
111AnyEvent has the central concept of a I<watcher>, which is an object that 141AnyEvent has the central concept of a I<watcher>, which is an object that
112stores relevant data for each kind of event you are waiting for, such as 142stores relevant data for each kind of event you are waiting for, such as
113the callback to call, the filehandle to watch, etc. 143the callback to call, the file handle to watch, etc.
114 144
115These watchers are normal Perl objects with normal Perl lifetime. After 145These watchers are normal Perl objects with normal Perl lifetime. After
116creating a watcher it will immediately "watch" for events and invoke the 146creating a watcher it will immediately "watch" for events and invoke the
117callback when the event occurs (of course, only when the event model 147callback when the event occurs (of course, only when the event model
118is in control). 148is in control).
119 149
150Note that B<callbacks must not permanently change global variables>
151potentially in use by the event loop (such as C<$_> or C<$[>) and that B<<
152callbacks must not C<die> >>. The former is good programming practise in
153Perl and the latter stems from the fact that exception handling differs
154widely between event loops.
155
120To disable the watcher you have to destroy it (e.g. by setting the 156To disable the watcher you have to destroy it (e.g. by setting the
121variable you store it in to C<undef> or otherwise deleting all references 157variable you store it in to C<undef> or otherwise deleting all references
122to it). 158to it).
123 159
124All watchers are created by calling a method on the C<AnyEvent> class. 160All watchers are created by calling a method on the C<AnyEvent> class.
126Many watchers either are used with "recursion" (repeating timers for 162Many watchers either are used with "recursion" (repeating timers for
127example), or need to refer to their watcher object in other ways. 163example), or need to refer to their watcher object in other ways.
128 164
129An any way to achieve that is this pattern: 165An any way to achieve that is this pattern:
130 166
131 my $w; $w = AnyEvent->type (arg => value ..., cb => sub { 167 my $w; $w = AnyEvent->type (arg => value ..., cb => sub {
132 # you can use $w here, for example to undef it 168 # you can use $w here, for example to undef it
133 undef $w; 169 undef $w;
134 }); 170 });
135 171
136Note that C<my $w; $w => combination. This is necessary because in Perl, 172Note that C<my $w; $w => combination. This is necessary because in Perl,
137my variables are only visible after the statement in which they are 173my variables are only visible after the statement in which they are
138declared. 174declared.
139 175
140=head2 IO WATCHERS 176=head2 I/O WATCHERS
141 177
142You can create an I/O watcher by calling the C<< AnyEvent->io >> method 178You can create an I/O watcher by calling the C<< AnyEvent->io >> method
143with the following mandatory key-value pairs as arguments: 179with the following mandatory key-value pairs as arguments:
144 180
145C<fh> the Perl I<file handle> (I<not> file descriptor) to watch for 181C<fh> is the Perl I<file handle> (I<not> file descriptor, see below) to
182watch for events (AnyEvent might or might not keep a reference to this
183file handle). Note that only file handles pointing to things for which
184non-blocking operation makes sense are allowed. This includes sockets,
185most character devices, pipes, fifos and so on, but not for example files
186or block devices.
187
146events. C<poll> must be a string that is either C<r> or C<w>, which 188C<poll> must be a string that is either C<r> or C<w>, which creates a
147creates a watcher waiting for "r"eadable or "w"ritable events, 189watcher waiting for "r"eadable or "w"ritable events, respectively.
190
148respectively. C<cb> is the callback to invoke each time the file handle 191C<cb> is the callback to invoke each time the file handle becomes ready.
149becomes ready.
150 192
151As long as the I/O watcher exists it will keep the file descriptor or a 193Although the callback might get passed parameters, their value and
152copy of it alive/open. 194presence is undefined and you cannot rely on them. Portable AnyEvent
195callbacks cannot use arguments passed to I/O watcher callbacks.
153 196
197The I/O watcher might use the underlying file descriptor or a copy of it.
154It is not allowed to close a file handle as long as any watcher is active 198You must not close a file handle as long as any watcher is active on the
155on the underlying file descriptor. 199underlying file descriptor.
156 200
157Some event loops issue spurious readyness notifications, so you should 201Some event loops issue spurious readyness notifications, so you should
158always use non-blocking calls when reading/writing from/to your file 202always use non-blocking calls when reading/writing from/to your file
159handles. 203handles.
160 204
161Example:
162
163 # wait for readability of STDIN, then read a line and disable the watcher 205Example: wait for readability of STDIN, then read a line and disable the
206watcher.
207
164 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub { 208 my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
165 chomp (my $input = <STDIN>); 209 chomp (my $input = <STDIN>);
166 warn "read: $input\n"; 210 warn "read: $input\n";
167 undef $w; 211 undef $w;
168 }); 212 });
169 213
214=head3 GETTING A FILE HANDLE FROM A FILE DESCRIPTOR
215
216It is not uncommon to only have a file descriptor, while AnyEvent requires
217a Perl file handle.
218
219There are basically two methods to convert a file descriptor into a file handle. If you own
220the file descriptor, you can open it with C<&=>, as in:
221
222 open my $fh, "<&=$fileno" or die "xxx: ยง!";
223
224This will "own" the file descriptor, meaning that when C<$fh> is
225destroyed, it will automatically close the C<$fileno>. Also, note that
226the open mode (read, write, read/write) must correspond with how the
227underlying file descriptor was opened.
228
229In many cases, taking over the file descriptor is now what you want, in
230which case the only alternative is to dup the file descriptor:
231
232 open my $fh, "<&$fileno" or die "xxx: $!";
233
234This has the advantage of not closing the file descriptor and the
235disadvantage of making a slow copy.
236
170=head2 TIME WATCHERS 237=head2 TIME WATCHERS
171 238
172You can create a time watcher by calling the C<< AnyEvent->timer >> 239You can create a time watcher by calling the C<< AnyEvent->timer >>
173method with the following mandatory arguments: 240method with the following mandatory arguments:
174 241
175C<after> specifies after how many seconds (fractional values are 242C<after> specifies after how many seconds (fractional values are
176supported) should the timer activate. C<cb> the callback to invoke in that 243supported) the callback should be invoked. C<cb> is the callback to invoke
177case. 244in that case.
178 245
179The timer callback will be invoked at most once: if you want a repeating 246Although the callback might get passed parameters, their value and
180timer you have to create a new watcher (this is a limitation by both Tk 247presence is undefined and you cannot rely on them. Portable AnyEvent
181and Glib). 248callbacks cannot use arguments passed to time watcher callbacks.
182 249
183Example: 250The callback will normally be invoked once only. If you specify another
251parameter, C<interval>, as a strictly positive number (> 0), then the
252callback will be invoked regularly at that interval (in fractional
253seconds) after the first invocation. If C<interval> is specified with a
254false value, then it is treated as if it were missing.
184 255
256The callback will be rescheduled before invoking the callback, but no
257attempt is done to avoid timer drift in most backends, so the interval is
258only approximate.
259
185 # fire an event after 7.7 seconds 260Example: fire an event after 7.7 seconds.
261
186 my $w = AnyEvent->timer (after => 7.7, cb => sub { 262 my $w = AnyEvent->timer (after => 7.7, cb => sub {
187 warn "timeout\n"; 263 warn "timeout\n";
188 }); 264 });
189 265
190 # to cancel the timer: 266 # to cancel the timer:
191 undef $w; 267 undef $w;
192 268
193Example 2:
194
195 # fire an event after 0.5 seconds, then roughly every second 269Example 2: fire an event after 0.5 seconds, then roughly every second.
196 my $w;
197 270
198 my $cb = sub {
199 # cancel the old timer while creating a new one
200 $w = AnyEvent->timer (after => 1, cb => $cb); 271 my $w = AnyEvent->timer (after => 0.5, interval => 1, cb => sub {
272 warn "timeout\n";
201 }; 273 };
202
203 # start the "loop" by creating the first watcher
204 $w = AnyEvent->timer (after => 0.5, cb => $cb);
205 274
206=head3 TIMING ISSUES 275=head3 TIMING ISSUES
207 276
208There are two ways to handle timers: based on real time (relative, "fire 277There are two ways to handle timers: based on real time (relative, "fire
209in 10 seconds") and based on wallclock time (absolute, "fire at 12 278in 10 seconds") and based on wallclock time (absolute, "fire at 12
221timers. 290timers.
222 291
223AnyEvent always prefers relative timers, if available, matching the 292AnyEvent always prefers relative timers, if available, matching the
224AnyEvent API. 293AnyEvent API.
225 294
295AnyEvent has two additional methods that return the "current time":
296
297=over 4
298
299=item AnyEvent->time
300
301This returns the "current wallclock time" as a fractional number of
302seconds since the Epoch (the same thing as C<time> or C<Time::HiRes::time>
303return, and the result is guaranteed to be compatible with those).
304
305It progresses independently of any event loop processing, i.e. each call
306will check the system clock, which usually gets updated frequently.
307
308=item AnyEvent->now
309
310This also returns the "current wallclock time", but unlike C<time>, above,
311this value might change only once per event loop iteration, depending on
312the event loop (most return the same time as C<time>, above). This is the
313time that AnyEvent's timers get scheduled against.
314
315I<In almost all cases (in all cases if you don't care), this is the
316function to call when you want to know the current time.>
317
318This function is also often faster then C<< AnyEvent->time >>, and
319thus the preferred method if you want some timestamp (for example,
320L<AnyEvent::Handle> uses this to update it's activity timeouts).
321
322The rest of this section is only of relevance if you try to be very exact
323with your timing, you can skip it without bad conscience.
324
325For a practical example of when these times differ, consider L<Event::Lib>
326and L<EV> and the following set-up:
327
328The event loop is running and has just invoked one of your callback at
329time=500 (assume no other callbacks delay processing). In your callback,
330you wait a second by executing C<sleep 1> (blocking the process for a
331second) and then (at time=501) you create a relative timer that fires
332after three seconds.
333
334With L<Event::Lib>, C<< AnyEvent->time >> and C<< AnyEvent->now >> will
335both return C<501>, because that is the current time, and the timer will
336be scheduled to fire at time=504 (C<501> + C<3>).
337
338With L<EV>, C<< AnyEvent->time >> returns C<501> (as that is the current
339time), but C<< AnyEvent->now >> returns C<500>, as that is the time the
340last event processing phase started. With L<EV>, your timer gets scheduled
341to run at time=503 (C<500> + C<3>).
342
343In one sense, L<Event::Lib> is more exact, as it uses the current time
344regardless of any delays introduced by event processing. However, most
345callbacks do not expect large delays in processing, so this causes a
346higher drift (and a lot more system calls to get the current time).
347
348In another sense, L<EV> is more exact, as your timer will be scheduled at
349the same time, regardless of how long event processing actually took.
350
351In either case, if you care (and in most cases, you don't), then you
352can get whatever behaviour you want with any event loop, by taking the
353difference between C<< AnyEvent->time >> and C<< AnyEvent->now >> into
354account.
355
356=item AnyEvent->now_update
357
358Some event loops (such as L<EV> or L<AnyEvent::Impl::Perl>) cache
359the current time for each loop iteration (see the discussion of L<<
360AnyEvent->now >>, above).
361
362When a callback runs for a long time (or when the process sleeps), then
363this "current" time will differ substantially from the real time, which
364might affect timers and time-outs.
365
366When this is the case, you can call this method, which will update the
367event loop's idea of "current time".
368
369Note that updating the time I<might> cause some events to be handled.
370
371=back
372
226=head2 SIGNAL WATCHERS 373=head2 SIGNAL WATCHERS
227 374
228You can watch for signals using a signal watcher, C<signal> is the signal 375You can watch for signals using a signal watcher, C<signal> is the signal
229I<name> without any C<SIG> prefix, C<cb> is the Perl callback to 376I<name> in uppercase and without any C<SIG> prefix, C<cb> is the Perl
230be invoked whenever a signal occurs. 377callback to be invoked whenever a signal occurs.
231 378
379Although the callback might get passed parameters, their value and
380presence is undefined and you cannot rely on them. Portable AnyEvent
381callbacks cannot use arguments passed to signal watcher callbacks.
382
232Multiple signal occurances can be clumped together into one callback 383Multiple signal occurrences can be clumped together into one callback
233invocation, and callback invocation will be synchronous. synchronous means 384invocation, and callback invocation will be synchronous. Synchronous means
234that it might take a while until the signal gets handled by the process, 385that it might take a while until the signal gets handled by the process,
235but it is guarenteed not to interrupt any other callbacks. 386but it is guaranteed not to interrupt any other callbacks.
236 387
237The main advantage of using these watchers is that you can share a signal 388The main advantage of using these watchers is that you can share a signal
238between multiple watchers. 389between multiple watchers.
239 390
240This watcher might use C<%SIG>, so programs overwriting those signals 391This watcher might use C<%SIG>, so programs overwriting those signals
247=head2 CHILD PROCESS WATCHERS 398=head2 CHILD PROCESS WATCHERS
248 399
249You can also watch on a child process exit and catch its exit status. 400You can also watch on a child process exit and catch its exit status.
250 401
251The child process is specified by the C<pid> argument (if set to C<0>, it 402The child process is specified by the C<pid> argument (if set to C<0>, it
252watches for any child process exit). The watcher will trigger as often 403watches for any child process exit). The watcher will triggered only when
253as status change for the child are received. This works by installing a 404the child process has finished and an exit status is available, not on
254signal handler for C<SIGCHLD>. The callback will be called with the pid 405any trace events (stopped/continued).
255and exit status (as returned by waitpid).
256 406
257Example: wait for pid 1333 407The callback will be called with the pid and exit status (as returned by
408waitpid), so unlike other watcher types, you I<can> rely on child watcher
409callback arguments.
258 410
411This watcher type works by installing a signal handler for C<SIGCHLD>,
412and since it cannot be shared, nothing else should use SIGCHLD or reap
413random child processes (waiting for specific child processes, e.g. inside
414C<system>, is just fine).
415
416There is a slight catch to child watchers, however: you usually start them
417I<after> the child process was created, and this means the process could
418have exited already (and no SIGCHLD will be sent anymore).
419
420Not all event models handle this correctly (neither POE nor IO::Async do,
421see their AnyEvent::Impl manpages for details), but even for event models
422that I<do> handle this correctly, they usually need to be loaded before
423the process exits (i.e. before you fork in the first place). AnyEvent's
424pure perl event loop handles all cases correctly regardless of when you
425start the watcher.
426
427This means you cannot create a child watcher as the very first
428thing in an AnyEvent program, you I<have> to create at least one
429watcher before you C<fork> the child (alternatively, you can call
430C<AnyEvent::detect>).
431
432Example: fork a process and wait for it
433
434 my $done = AnyEvent->condvar;
435
436 my $pid = fork or exit 5;
437
259 my $w = AnyEvent->child ( 438 my $w = AnyEvent->child (
260 pid => 1333, 439 pid => $pid,
261 cb => sub { 440 cb => sub {
262 my ($pid, $status) = @_; 441 my ($pid, $status) = @_;
263 warn "pid $pid exited with status $status"; 442 warn "pid $pid exited with status $status";
443 $done->send;
264 }, 444 },
265 ); 445 );
446
447 # do something else, then wait for process exit
448 $done->recv;
449
450=head2 IDLE WATCHERS
451
452Sometimes there is a need to do something, but it is not so important
453to do it instantly, but only when there is nothing better to do. This
454"nothing better to do" is usually defined to be "no other events need
455attention by the event loop".
456
457Idle watchers ideally get invoked when the event loop has nothing
458better to do, just before it would block the process to wait for new
459events. Instead of blocking, the idle watcher is invoked.
460
461Most event loops unfortunately do not really support idle watchers (only
462EV, Event and Glib do it in a usable fashion) - for the rest, AnyEvent
463will simply call the callback "from time to time".
464
465Example: read lines from STDIN, but only process them when the
466program is otherwise idle:
467
468 my @lines; # read data
469 my $idle_w;
470 my $io_w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
471 push @lines, scalar <STDIN>;
472
473 # start an idle watcher, if not already done
474 $idle_w ||= AnyEvent->idle (cb => sub {
475 # handle only one line, when there are lines left
476 if (my $line = shift @lines) {
477 print "handled when idle: $line";
478 } else {
479 # otherwise disable the idle watcher again
480 undef $idle_w;
481 }
482 });
483 });
266 484
267=head2 CONDITION VARIABLES 485=head2 CONDITION VARIABLES
268 486
487If you are familiar with some event loops you will know that all of them
488require you to run some blocking "loop", "run" or similar function that
489will actively watch for new events and call your callbacks.
490
491AnyEvent is different, it expects somebody else to run the event loop and
492will only block when necessary (usually when told by the user).
493
494The instrument to do that is called a "condition variable", so called
495because they represent a condition that must become true.
496
269Condition variables can be created by calling the C<< AnyEvent->condvar >> 497Condition variables can be created by calling the C<< AnyEvent->condvar
270method without any arguments. 498>> method, usually without arguments. The only argument pair allowed is
271 499
272A condition variable waits for a condition - precisely that the C<< 500C<cb>, which specifies a callback to be called when the condition variable
273->broadcast >> method has been called. 501becomes true, with the condition variable as the first argument (but not
502the results).
274 503
275They are very useful to signal that a condition has been fulfilled, for 504After creation, the condition variable is "false" until it becomes "true"
505by calling the C<send> method (or calling the condition variable as if it
506were a callback, read about the caveats in the description for the C<<
507->send >> method).
508
509Condition variables are similar to callbacks, except that you can
510optionally wait for them. They can also be called merge points - points
511in time where multiple outstanding events have been processed. And yet
512another way to call them is transactions - each condition variable can be
513used to represent a transaction, which finishes at some point and delivers
514a result.
515
516Condition variables are very useful to signal that something has finished,
276example, if you write a module that does asynchronous http requests, 517for example, if you write a module that does asynchronous http requests,
277then a condition variable would be the ideal candidate to signal the 518then a condition variable would be the ideal candidate to signal the
278availability of results. 519availability of results. The user can either act when the callback is
520called or can synchronously C<< ->recv >> for the results.
279 521
280You can also use condition variables to block your main program until 522You can also use them to simulate traditional event loops - for example,
281an event occurs - for example, you could C<< ->wait >> in your main 523you can block your main program until an event occurs - for example, you
282program until the user clicks the Quit button in your app, which would C<< 524could C<< ->recv >> in your main program until the user clicks the Quit
283->broadcast >> the "quit" event. 525button of your app, which would C<< ->send >> the "quit" event.
284 526
285Note that condition variables recurse into the event loop - if you have 527Note that condition variables recurse into the event loop - if you have
286two pirces of code that call C<< ->wait >> in a round-robbin fashion, you 528two pieces of code that call C<< ->recv >> in a round-robin fashion, you
287lose. Therefore, condition variables are good to export to your caller, but 529lose. Therefore, condition variables are good to export to your caller, but
288you should avoid making a blocking wait yourself, at least in callbacks, 530you should avoid making a blocking wait yourself, at least in callbacks,
289as this asks for trouble. 531as this asks for trouble.
290 532
291This object has two methods: 533Condition variables are represented by hash refs in perl, and the keys
534used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
535easy (it is often useful to build your own transaction class on top of
536AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
537it's C<new> method in your own C<new> method.
538
539There are two "sides" to a condition variable - the "producer side" which
540eventually calls C<< -> send >>, and the "consumer side", which waits
541for the send to occur.
542
543Example: wait for a timer.
544
545 # wait till the result is ready
546 my $result_ready = AnyEvent->condvar;
547
548 # do something such as adding a timer
549 # or socket watcher the calls $result_ready->send
550 # when the "result" is ready.
551 # in this case, we simply use a timer:
552 my $w = AnyEvent->timer (
553 after => 1,
554 cb => sub { $result_ready->send },
555 );
556
557 # this "blocks" (while handling events) till the callback
558 # calls send
559 $result_ready->recv;
560
561Example: wait for a timer, but take advantage of the fact that
562condition variables are also code references.
563
564 my $done = AnyEvent->condvar;
565 my $delay = AnyEvent->timer (after => 5, cb => $done);
566 $done->recv;
567
568Example: Imagine an API that returns a condvar and doesn't support
569callbacks. This is how you make a synchronous call, for example from
570the main program:
571
572 use AnyEvent::CouchDB;
573
574 ...
575
576 my @info = $couchdb->info->recv;
577
578And this is how you would just ste a callback to be called whenever the
579results are available:
580
581 $couchdb->info->cb (sub {
582 my @info = $_[0]->recv;
583 });
584
585=head3 METHODS FOR PRODUCERS
586
587These methods should only be used by the producing side, i.e. the
588code/module that eventually sends the signal. Note that it is also
589the producer side which creates the condvar in most cases, but it isn't
590uncommon for the consumer to create it as well.
292 591
293=over 4 592=over 4
294 593
594=item $cv->send (...)
595
596Flag the condition as ready - a running C<< ->recv >> and all further
597calls to C<recv> will (eventually) return after this method has been
598called. If nobody is waiting the send will be remembered.
599
600If a callback has been set on the condition variable, it is called
601immediately from within send.
602
603Any arguments passed to the C<send> call will be returned by all
604future C<< ->recv >> calls.
605
606Condition variables are overloaded so one can call them directly
607(as a code reference). Calling them directly is the same as calling
608C<send>. Note, however, that many C-based event loops do not handle
609overloading, so as tempting as it may be, passing a condition variable
610instead of a callback does not work. Both the pure perl and EV loops
611support overloading, however, as well as all functions that use perl to
612invoke a callback (as in L<AnyEvent::Socket> and L<AnyEvent::DNS> for
613example).
614
615=item $cv->croak ($error)
616
617Similar to send, but causes all call's to C<< ->recv >> to invoke
618C<Carp::croak> with the given error message/object/scalar.
619
620This can be used to signal any errors to the condition variable
621user/consumer.
622
623=item $cv->begin ([group callback])
624
295=item $cv->wait 625=item $cv->end
296 626
297Wait (blocking if necessary) until the C<< ->broadcast >> method has been 627These two methods can be used to combine many transactions/events into
628one. For example, a function that pings many hosts in parallel might want
629to use a condition variable for the whole process.
630
631Every call to C<< ->begin >> will increment a counter, and every call to
632C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
633>>, the (last) callback passed to C<begin> will be executed. That callback
634is I<supposed> to call C<< ->send >>, but that is not required. If no
635callback was set, C<send> will be called without any arguments.
636
637You can think of C<< $cv->send >> giving you an OR condition (one call
638sends), while C<< $cv->begin >> and C<< $cv->end >> giving you an AND
639condition (all C<begin> calls must be C<end>'ed before the condvar sends).
640
641Let's start with a simple example: you have two I/O watchers (for example,
642STDOUT and STDERR for a program), and you want to wait for both streams to
643close before activating a condvar:
644
645 my $cv = AnyEvent->condvar;
646
647 $cv->begin; # first watcher
648 my $w1 = AnyEvent->io (fh => $fh1, cb => sub {
649 defined sysread $fh1, my $buf, 4096
650 or $cv->end;
651 });
652
653 $cv->begin; # second watcher
654 my $w2 = AnyEvent->io (fh => $fh2, cb => sub {
655 defined sysread $fh2, my $buf, 4096
656 or $cv->end;
657 });
658
659 $cv->recv;
660
661This works because for every event source (EOF on file handle), there is
662one call to C<begin>, so the condvar waits for all calls to C<end> before
663sending.
664
665The ping example mentioned above is slightly more complicated, as the
666there are results to be passwd back, and the number of tasks that are
667begung can potentially be zero:
668
669 my $cv = AnyEvent->condvar;
670
671 my %result;
672 $cv->begin (sub { $cv->send (\%result) });
673
674 for my $host (@list_of_hosts) {
675 $cv->begin;
676 ping_host_then_call_callback $host, sub {
677 $result{$host} = ...;
678 $cv->end;
679 };
680 }
681
682 $cv->end;
683
684This code fragment supposedly pings a number of hosts and calls
685C<send> after results for all then have have been gathered - in any
686order. To achieve this, the code issues a call to C<begin> when it starts
687each ping request and calls C<end> when it has received some result for
688it. Since C<begin> and C<end> only maintain a counter, the order in which
689results arrive is not relevant.
690
691There is an additional bracketing call to C<begin> and C<end> outside the
692loop, which serves two important purposes: first, it sets the callback
693to be called once the counter reaches C<0>, and second, it ensures that
694C<send> is called even when C<no> hosts are being pinged (the loop
695doesn't execute once).
696
697This is the general pattern when you "fan out" into multiple (but
698potentially none) subrequests: use an outer C<begin>/C<end> pair to set
699the callback and ensure C<end> is called at least once, and then, for each
700subrequest you start, call C<begin> and for each subrequest you finish,
701call C<end>.
702
703=back
704
705=head3 METHODS FOR CONSUMERS
706
707These methods should only be used by the consuming side, i.e. the
708code awaits the condition.
709
710=over 4
711
712=item $cv->recv
713
714Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
298called on c<$cv>, while servicing other watchers normally. 715>> methods have been called on c<$cv>, while servicing other watchers
716normally.
299 717
300You can only wait once on a condition - additional calls will return 718You can only wait once on a condition - additional calls are valid but
301immediately. 719will return immediately.
720
721If an error condition has been set by calling C<< ->croak >>, then this
722function will call C<croak>.
723
724In list context, all parameters passed to C<send> will be returned,
725in scalar context only the first one will be returned.
302 726
303Not all event models support a blocking wait - some die in that case 727Not all event models support a blocking wait - some die in that case
304(programs might want to do that to stay interactive), so I<if you are 728(programs might want to do that to stay interactive), so I<if you are
305using this from a module, never require a blocking wait>, but let the 729using this from a module, never require a blocking wait>, but let the
306caller decide whether the call will block or not (for example, by coupling 730caller decide whether the call will block or not (for example, by coupling
307condition variables with some kind of request results and supporting 731condition variables with some kind of request results and supporting
308callbacks so the caller knows that getting the result will not block, 732callbacks so the caller knows that getting the result will not block,
309while still suppporting blocking waits if the caller so desires). 733while still supporting blocking waits if the caller so desires).
310 734
311Another reason I<never> to C<< ->wait >> in a module is that you cannot 735Another reason I<never> to C<< ->recv >> in a module is that you cannot
312sensibly have two C<< ->wait >>'s in parallel, as that would require 736sensibly have two C<< ->recv >>'s in parallel, as that would require
313multiple interpreters or coroutines/threads, none of which C<AnyEvent> 737multiple interpreters or coroutines/threads, none of which C<AnyEvent>
314can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and 738can supply.
315L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
316from different coroutines, however).
317 739
318=item $cv->broadcast 740The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
741fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
742versions and also integrates coroutines into AnyEvent, making blocking
743C<< ->recv >> calls perfectly safe as long as they are done from another
744coroutine (one that doesn't run the event loop).
319 745
320Flag the condition as ready - a running C<< ->wait >> and all further 746You can ensure that C<< -recv >> never blocks by setting a callback and
321calls to C<wait> will (eventually) return after this method has been 747only calling C<< ->recv >> from within that callback (or at a later
322called. If nobody is waiting the broadcast will be remembered.. 748time). This will work even when the event loop does not support blocking
749waits otherwise.
750
751=item $bool = $cv->ready
752
753Returns true when the condition is "true", i.e. whether C<send> or
754C<croak> have been called.
755
756=item $cb = $cv->cb ($cb->($cv))
757
758This is a mutator function that returns the callback set and optionally
759replaces it before doing so.
760
761The callback will be called when the condition becomes "true", i.e. when
762C<send> or C<croak> are called, with the only argument being the condition
763variable itself. Calling C<recv> inside the callback or at any later time
764is guaranteed not to block.
323 765
324=back 766=back
325
326Example:
327
328 # wait till the result is ready
329 my $result_ready = AnyEvent->condvar;
330
331 # do something such as adding a timer
332 # or socket watcher the calls $result_ready->broadcast
333 # when the "result" is ready.
334 # in this case, we simply use a timer:
335 my $w = AnyEvent->timer (
336 after => 1,
337 cb => sub { $result_ready->broadcast },
338 );
339
340 # this "blocks" (while handling events) till the watcher
341 # calls broadcast
342 $result_ready->wait;
343 767
344=head1 GLOBAL VARIABLES AND FUNCTIONS 768=head1 GLOBAL VARIABLES AND FUNCTIONS
345 769
346=over 4 770=over 4
347 771
353C<AnyEvent::Impl:xxx> modules, but can be any other class in the case 777C<AnyEvent::Impl:xxx> modules, but can be any other class in the case
354AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>). 778AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
355 779
356The known classes so far are: 780The known classes so far are:
357 781
358 AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
359 AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
360 AnyEvent::Impl::EV based on EV (an interface to libev, best choice). 782 AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
361 AnyEvent::Impl::Event based on Event, second best choice. 783 AnyEvent::Impl::Event based on Event, second best choice.
784 AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
362 AnyEvent::Impl::Glib based on Glib, third-best choice. 785 AnyEvent::Impl::Glib based on Glib, third-best choice.
363 AnyEvent::Impl::Tk based on Tk, very bad choice. 786 AnyEvent::Impl::Tk based on Tk, very bad choice.
364 AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
365 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs). 787 AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
366 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse. 788 AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
789 AnyEvent::Impl::POE based on POE, not generic enough for full support.
790
791 # warning, support for IO::Async is only partial, as it is too broken
792 # and limited toe ven support the AnyEvent API. See AnyEvent::Impl::Async.
793 AnyEvent::Impl::IOAsync based on IO::Async, cannot be autoprobed (see its docs).
794
795There is no support for WxWidgets, as WxWidgets has no support for
796watching file handles. However, you can use WxWidgets through the
797POE Adaptor, as POE has a Wx backend that simply polls 20 times per
798second, which was considered to be too horrible to even consider for
799AnyEvent. Likewise, other POE backends can be used by AnyEvent by using
800it's adaptor.
801
802AnyEvent knows about L<Prima> and L<Wx> and will try to use L<POE> when
803autodetecting them.
367 804
368=item AnyEvent::detect 805=item AnyEvent::detect
369 806
370Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model 807Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
371if necessary. You should only call this function right before you would 808if necessary. You should only call this function right before you would
372have created an AnyEvent watcher anyway, that is, as late as possible at 809have created an AnyEvent watcher anyway, that is, as late as possible at
373runtime. 810runtime.
374 811
812=item $guard = AnyEvent::post_detect { BLOCK }
813
814Arranges for the code block to be executed as soon as the event model is
815autodetected (or immediately if this has already happened).
816
817If called in scalar or list context, then it creates and returns an object
818that automatically removes the callback again when it is destroyed. See
819L<Coro::BDB> for a case where this is useful.
820
821=item @AnyEvent::post_detect
822
823If there are any code references in this array (you can C<push> to it
824before or after loading AnyEvent), then they will called directly after
825the event loop has been chosen.
826
827You should check C<$AnyEvent::MODEL> before adding to this array, though:
828if it contains a true value then the event loop has already been detected,
829and the array will be ignored.
830
831Best use C<AnyEvent::post_detect { BLOCK }> instead.
832
375=back 833=back
376 834
377=head1 WHAT TO DO IN A MODULE 835=head1 WHAT TO DO IN A MODULE
378 836
379As a module author, you should C<use AnyEvent> and call AnyEvent methods 837As a module author, you should C<use AnyEvent> and call AnyEvent methods
382Be careful when you create watchers in the module body - AnyEvent will 840Be careful when you create watchers in the module body - AnyEvent will
383decide which event module to use as soon as the first method is called, so 841decide which event module to use as soon as the first method is called, so
384by calling AnyEvent in your module body you force the user of your module 842by calling AnyEvent in your module body you force the user of your module
385to load the event module first. 843to load the event module first.
386 844
387Never call C<< ->wait >> on a condition variable unless you I<know> that 845Never call C<< ->recv >> on a condition variable unless you I<know> that
388the C<< ->broadcast >> method has been called on it already. This is 846the C<< ->send >> method has been called on it already. This is
389because it will stall the whole program, and the whole point of using 847because it will stall the whole program, and the whole point of using
390events is to stay interactive. 848events is to stay interactive.
391 849
392It is fine, however, to call C<< ->wait >> when the user of your module 850It is fine, however, to call C<< ->recv >> when the user of your module
393requests it (i.e. if you create a http request object ad have a method 851requests it (i.e. if you create a http request object ad have a method
394called C<results> that returns the results, it should call C<< ->wait >> 852called C<results> that returns the results, it should call C<< ->recv >>
395freely, as the user of your module knows what she is doing. always). 853freely, as the user of your module knows what she is doing. always).
396 854
397=head1 WHAT TO DO IN THE MAIN PROGRAM 855=head1 WHAT TO DO IN THE MAIN PROGRAM
398 856
399There will always be a single main program - the only place that should 857There will always be a single main program - the only place that should
401 859
402If it doesn't care, it can just "use AnyEvent" and use it itself, or not 860If it doesn't care, it can just "use AnyEvent" and use it itself, or not
403do anything special (it does not need to be event-based) and let AnyEvent 861do anything special (it does not need to be event-based) and let AnyEvent
404decide which implementation to chose if some module relies on it. 862decide which implementation to chose if some module relies on it.
405 863
406If the main program relies on a specific event model. For example, in 864If the main program relies on a specific event model - for example, in
407Gtk2 programs you have to rely on the Glib module. You should load the 865Gtk2 programs you have to rely on the Glib module - you should load the
408event module before loading AnyEvent or any module that uses it: generally 866event module before loading AnyEvent or any module that uses it: generally
409speaking, you should load it as early as possible. The reason is that 867speaking, you should load it as early as possible. The reason is that
410modules might create watchers when they are loaded, and AnyEvent will 868modules might create watchers when they are loaded, and AnyEvent will
411decide on the event model to use as soon as it creates watchers, and it 869decide on the event model to use as soon as it creates watchers, and it
412might chose the wrong one unless you load the correct one yourself. 870might chose the wrong one unless you load the correct one yourself.
413 871
414You can chose to use a rather inefficient pure-perl implementation by 872You can chose to use a pure-perl implementation by loading the
415loading the C<AnyEvent::Impl::Perl> module, which gives you similar 873C<AnyEvent::Impl::Perl> module, which gives you similar behaviour
416behaviour everywhere, but letting AnyEvent chose is generally better. 874everywhere, but letting AnyEvent chose the model is generally better.
875
876=head2 MAINLOOP EMULATION
877
878Sometimes (often for short test scripts, or even standalone programs who
879only want to use AnyEvent), you do not want to run a specific event loop.
880
881In that case, you can use a condition variable like this:
882
883 AnyEvent->condvar->recv;
884
885This has the effect of entering the event loop and looping forever.
886
887Note that usually your program has some exit condition, in which case
888it is better to use the "traditional" approach of storing a condition
889variable somewhere, waiting for it, and sending it when the program should
890exit cleanly.
891
892
893=head1 OTHER MODULES
894
895The following is a non-exhaustive list of additional modules that use
896AnyEvent and can therefore be mixed easily with other AnyEvent modules
897in the same program. Some of the modules come with AnyEvent, some are
898available via CPAN.
899
900=over 4
901
902=item L<AnyEvent::Util>
903
904Contains various utility functions that replace often-used but blocking
905functions such as C<inet_aton> by event-/callback-based versions.
906
907=item L<AnyEvent::Socket>
908
909Provides various utility functions for (internet protocol) sockets,
910addresses and name resolution. Also functions to create non-blocking tcp
911connections or tcp servers, with IPv6 and SRV record support and more.
912
913=item L<AnyEvent::Handle>
914
915Provide read and write buffers, manages watchers for reads and writes,
916supports raw and formatted I/O, I/O queued and fully transparent and
917non-blocking SSL/TLS.
918
919=item L<AnyEvent::DNS>
920
921Provides rich asynchronous DNS resolver capabilities.
922
923=item L<AnyEvent::HTTP>
924
925A simple-to-use HTTP library that is capable of making a lot of concurrent
926HTTP requests.
927
928=item L<AnyEvent::HTTPD>
929
930Provides a simple web application server framework.
931
932=item L<AnyEvent::FastPing>
933
934The fastest ping in the west.
935
936=item L<AnyEvent::DBI>
937
938Executes L<DBI> requests asynchronously in a proxy process.
939
940=item L<AnyEvent::AIO>
941
942Truly asynchronous I/O, should be in the toolbox of every event
943programmer. AnyEvent::AIO transparently fuses L<IO::AIO> and AnyEvent
944together.
945
946=item L<AnyEvent::BDB>
947
948Truly asynchronous Berkeley DB access. AnyEvent::BDB transparently fuses
949L<BDB> and AnyEvent together.
950
951=item L<AnyEvent::GPSD>
952
953A non-blocking interface to gpsd, a daemon delivering GPS information.
954
955=item L<AnyEvent::IGS>
956
957A non-blocking interface to the Internet Go Server protocol (used by
958L<App::IGS>).
959
960=item L<AnyEvent::IRC>
961
962AnyEvent based IRC client module family (replacing the older Net::IRC3).
963
964=item L<Net::XMPP2>
965
966AnyEvent based XMPP (Jabber protocol) module family.
967
968=item L<Net::FCP>
969
970AnyEvent-based implementation of the Freenet Client Protocol, birthplace
971of AnyEvent.
972
973=item L<Event::ExecFlow>
974
975High level API for event-based execution flow control.
976
977=item L<Coro>
978
979Has special support for AnyEvent via L<Coro::AnyEvent>.
980
981=item L<IO::Lambda>
982
983The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
984
985=back
417 986
418=cut 987=cut
419 988
420package AnyEvent; 989package AnyEvent;
421 990
422no warnings; 991no warnings;
423use strict; 992use strict qw(vars subs);
424 993
425use Carp; 994use Carp;
426 995
427our $VERSION = '3.12'; 996our $VERSION = 4.8;
428our $MODEL; 997our $MODEL;
429 998
430our $AUTOLOAD; 999our $AUTOLOAD;
431our @ISA; 1000our @ISA;
432 1001
1002our @REGISTRY;
1003
1004our $WIN32;
1005
1006BEGIN {
1007 eval "sub WIN32(){ " . (($^O =~ /mswin32/i)*1) ." }";
1008 eval "sub TAINT(){ " . (${^TAINT}*1) . " }";
1009
1010 delete @ENV{grep /^PERL_ANYEVENT_/, keys %ENV}
1011 if ${^TAINT};
1012}
1013
433our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1; 1014our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
434 1015
435our @REGISTRY; 1016our %PROTOCOL; # (ipv4|ipv6) => (1|2), higher numbers are preferred
1017
1018{
1019 my $idx;
1020 $PROTOCOL{$_} = ++$idx
1021 for reverse split /\s*,\s*/,
1022 $ENV{PERL_ANYEVENT_PROTOCOLS} || "ipv4,ipv6";
1023}
436 1024
437my @models = ( 1025my @models = (
438 [Coro::EV:: => AnyEvent::Impl::CoroEV::],
439 [Coro::Event:: => AnyEvent::Impl::CoroEvent::],
440 [EV:: => AnyEvent::Impl::EV::], 1026 [EV:: => AnyEvent::Impl::EV::],
441 [Event:: => AnyEvent::Impl::Event::], 1027 [Event:: => AnyEvent::Impl::Event::],
442 [Glib:: => AnyEvent::Impl::Glib::],
443 [Tk:: => AnyEvent::Impl::Tk::],
444 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::], 1028 [AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
1029 # everything below here will not be autoprobed
1030 # as the pureperl backend should work everywhere
1031 # and is usually faster
1032 [Tk:: => AnyEvent::Impl::Tk::], # crashes with many handles
1033 [Glib:: => AnyEvent::Impl::Glib::], # becomes extremely slow with many watchers
1034 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
1035 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
1036 [POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
1037 [Wx:: => AnyEvent::Impl::POE::],
1038 [Prima:: => AnyEvent::Impl::POE::],
1039 # IO::Async is just too broken - we would need workaorunds for its
1040 # byzantine signal and broken child handling, among others.
1041 # IO::Async is rather hard to detect, as it doesn't have any
1042 # obvious default class.
1043# [IO::Async:: => AnyEvent::Impl::IOAsync::], # requires special main program
1044# [IO::Async::Loop:: => AnyEvent::Impl::IOAsync::], # requires special main program
1045# [IO::Async::Notifier:: => AnyEvent::Impl::IOAsync::], # requires special main program
445); 1046);
446my @models_detect = (
447 [Qt:: => AnyEvent::Impl::Qt::], # requires special main program
448 [Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
449);
450 1047
451our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY); 1048our %method = map +($_ => 1),
1049 qw(io timer time now now_update signal child idle condvar one_event DESTROY);
1050
1051our @post_detect;
1052
1053sub post_detect(&) {
1054 my ($cb) = @_;
1055
1056 if ($MODEL) {
1057 $cb->();
1058
1059 1
1060 } else {
1061 push @post_detect, $cb;
1062
1063 defined wantarray
1064 ? bless \$cb, "AnyEvent::Util::postdetect"
1065 : ()
1066 }
1067}
1068
1069sub AnyEvent::Util::postdetect::DESTROY {
1070 @post_detect = grep $_ != ${$_[0]}, @post_detect;
1071}
452 1072
453sub detect() { 1073sub detect() {
454 unless ($MODEL) { 1074 unless ($MODEL) {
455 no strict 'refs'; 1075 no strict 'refs';
1076 local $SIG{__DIE__};
456 1077
457 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) { 1078 if ($ENV{PERL_ANYEVENT_MODEL} =~ /^([a-zA-Z]+)$/) {
458 my $model = "AnyEvent::Impl::$1"; 1079 my $model = "AnyEvent::Impl::$1";
459 if (eval "require $model") { 1080 if (eval "require $model") {
460 $MODEL = $model; 1081 $MODEL = $model;
461 warn "AnyEvent: loaded model '$model' (forced by \$PERL_ANYEVENT_MODEL), using it.\n" if $verbose > 1; 1082 warn "AnyEvent: loaded model '$model' (forced by \$PERL_ANYEVENT_MODEL), using it.\n" if $verbose > 1;
1083 } else {
1084 warn "AnyEvent: unable to load model '$model' (from \$PERL_ANYEVENT_MODEL):\n$@" if $verbose;
462 } 1085 }
463 } 1086 }
464 1087
465 # check for already loaded models 1088 # check for already loaded models
466 unless ($MODEL) { 1089 unless ($MODEL) {
467 for (@REGISTRY, @models, @models_detect) { 1090 for (@REGISTRY, @models) {
468 my ($package, $model) = @$_; 1091 my ($package, $model) = @$_;
469 if (${"$package\::VERSION"} > 0) { 1092 if (${"$package\::VERSION"} > 0) {
470 if (eval "require $model") { 1093 if (eval "require $model") {
471 $MODEL = $model; 1094 $MODEL = $model;
472 warn "AnyEvent: autodetected model '$model', using it.\n" if $verbose > 1; 1095 warn "AnyEvent: autodetected model '$model', using it.\n" if $verbose > 1;
488 last; 1111 last;
489 } 1112 }
490 } 1113 }
491 1114
492 $MODEL 1115 $MODEL
493 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."; 1116 or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.\n";
494 } 1117 }
495 } 1118 }
496 1119
1120 push @{"$MODEL\::ISA"}, "AnyEvent::Base";
1121
497 unshift @ISA, $MODEL; 1122 unshift @ISA, $MODEL;
498 push @{"$MODEL\::ISA"}, "AnyEvent::Base"; 1123
1124 require AnyEvent::Strict if $ENV{PERL_ANYEVENT_STRICT};
1125
1126 (shift @post_detect)->() while @post_detect;
499 } 1127 }
500 1128
501 $MODEL 1129 $MODEL
502} 1130}
503 1131
511 1139
512 my $class = shift; 1140 my $class = shift;
513 $class->$func (@_); 1141 $class->$func (@_);
514} 1142}
515 1143
1144# utility function to dup a filehandle. this is used by many backends
1145# to support binding more than one watcher per filehandle (they usually
1146# allow only one watcher per fd, so we dup it to get a different one).
1147sub _dupfh($$;$$) {
1148 my ($poll, $fh, $r, $w) = @_;
1149
1150 # cygwin requires the fh mode to be matching, unix doesn't
1151 my ($rw, $mode) = $poll eq "r" ? ($r, "<")
1152 : $poll eq "w" ? ($w, ">")
1153 : Carp::croak "AnyEvent->io requires poll set to either 'r' or 'w'";
1154
1155 open my $fh2, "$mode&" . fileno $fh
1156 or die "cannot dup() filehandle: $!,";
1157
1158 # we assume CLOEXEC is already set by perl in all important cases
1159
1160 ($fh2, $rw)
1161}
1162
516package AnyEvent::Base; 1163package AnyEvent::Base;
517 1164
1165# default implementations for many methods
1166
1167BEGIN {
1168 if (eval "use Time::HiRes (); Time::HiRes::time (); 1") {
1169 *_time = \&Time::HiRes::time;
1170 # if (eval "use POSIX (); (POSIX::times())...
1171 } else {
1172 *_time = sub { time }; # epic fail
1173 }
1174}
1175
1176sub time { _time }
1177sub now { _time }
1178sub now_update { }
1179
518# default implementation for ->condvar, ->wait, ->broadcast 1180# default implementation for ->condvar
519 1181
520sub condvar { 1182sub condvar {
521 bless \my $flag, "AnyEvent::Base::CondVar" 1183 bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, "AnyEvent::CondVar"
522}
523
524sub AnyEvent::Base::CondVar::broadcast {
525 ${$_[0]}++;
526}
527
528sub AnyEvent::Base::CondVar::wait {
529 AnyEvent->one_event while !${$_[0]};
530} 1184}
531 1185
532# default implementation for ->signal 1186# default implementation for ->signal
533 1187
534our %SIG_CB; 1188our ($SIGPIPE_R, $SIGPIPE_W, %SIG_CB, %SIG_EV, $SIG_IO);
1189
1190sub _signal_exec {
1191 sysread $SIGPIPE_R, my $dummy, 4;
1192
1193 while (%SIG_EV) {
1194 for (keys %SIG_EV) {
1195 delete $SIG_EV{$_};
1196 $_->() for values %{ $SIG_CB{$_} || {} };
1197 }
1198 }
1199}
535 1200
536sub signal { 1201sub signal {
537 my (undef, %arg) = @_; 1202 my (undef, %arg) = @_;
538 1203
1204 unless ($SIGPIPE_R) {
1205 require Fcntl;
1206
1207 if (AnyEvent::WIN32) {
1208 require AnyEvent::Util;
1209
1210 ($SIGPIPE_R, $SIGPIPE_W) = AnyEvent::Util::portable_pipe ();
1211 AnyEvent::Util::fh_nonblocking ($SIGPIPE_R) if $SIGPIPE_R;
1212 AnyEvent::Util::fh_nonblocking ($SIGPIPE_W) if $SIGPIPE_W; # just in case
1213 } else {
1214 pipe $SIGPIPE_R, $SIGPIPE_W;
1215 fcntl $SIGPIPE_R, &Fcntl::F_SETFL, &Fcntl::O_NONBLOCK if $SIGPIPE_R;
1216 fcntl $SIGPIPE_W, &Fcntl::F_SETFL, &Fcntl::O_NONBLOCK if $SIGPIPE_W; # just in case
1217
1218 # not strictly required, as $^F is normally 2, but let's make sure...
1219 fcntl $SIGPIPE_R, &Fcntl::F_SETFD, &Fcntl::FD_CLOEXEC;
1220 fcntl $SIGPIPE_W, &Fcntl::F_SETFD, &Fcntl::FD_CLOEXEC;
1221 }
1222
1223 $SIGPIPE_R
1224 or Carp::croak "AnyEvent: unable to create a signal reporting pipe: $!\n";
1225
1226 $SIG_IO = AnyEvent->io (fh => $SIGPIPE_R, poll => "r", cb => \&_signal_exec);
1227 }
1228
539 my $signal = uc $arg{signal} 1229 my $signal = uc $arg{signal}
540 or Carp::croak "required option 'signal' is missing"; 1230 or Carp::croak "required option 'signal' is missing";
541 1231
542 $SIG_CB{$signal}{$arg{cb}} = $arg{cb}; 1232 $SIG_CB{$signal}{$arg{cb}} = $arg{cb};
543 $SIG{$signal} ||= sub { 1233 $SIG{$signal} ||= sub {
544 $_->() for values %{ $SIG_CB{$signal} || {} }; 1234 local $!;
1235 syswrite $SIGPIPE_W, "\x00", 1 unless %SIG_EV;
1236 undef $SIG_EV{$signal};
545 }; 1237 };
546 1238
547 bless [$signal, $arg{cb}], "AnyEvent::Base::Signal" 1239 bless [$signal, $arg{cb}], "AnyEvent::Base::signal"
548} 1240}
549 1241
550sub AnyEvent::Base::Signal::DESTROY { 1242sub AnyEvent::Base::signal::DESTROY {
551 my ($signal, $cb) = @{$_[0]}; 1243 my ($signal, $cb) = @{$_[0]};
552 1244
553 delete $SIG_CB{$signal}{$cb}; 1245 delete $SIG_CB{$signal}{$cb};
554 1246
1247 # delete doesn't work with older perls - they then
1248 # print weird messages, or just unconditionally exit
1249 # instead of getting the default action.
555 $SIG{$signal} = 'DEFAULT' unless keys %{ $SIG_CB{$signal} }; 1250 undef $SIG{$signal} unless keys %{ $SIG_CB{$signal} };
556} 1251}
557 1252
558# default implementation for ->child 1253# default implementation for ->child
559 1254
560our %PID_CB; 1255our %PID_CB;
561our $CHLD_W; 1256our $CHLD_W;
562our $CHLD_DELAY_W; 1257our $CHLD_DELAY_W;
563our $PID_IDLE;
564our $WNOHANG; 1258our $WNOHANG;
565 1259
566sub _child_wait { 1260sub _sigchld {
567 while (0 < (my $pid = waitpid -1, $WNOHANG)) { 1261 while (0 < (my $pid = waitpid -1, $WNOHANG)) {
568 $_->($pid, $?) for (values %{ $PID_CB{$pid} || {} }), 1262 $_->($pid, $?) for (values %{ $PID_CB{$pid} || {} }),
569 (values %{ $PID_CB{0} || {} }); 1263 (values %{ $PID_CB{0} || {} });
570 } 1264 }
571
572 undef $PID_IDLE;
573}
574
575sub _sigchld {
576 # make sure we deliver these changes "synchronous" with the event loop.
577 $CHLD_DELAY_W ||= AnyEvent->timer (after => 0, cb => sub {
578 undef $CHLD_DELAY_W;
579 &_child_wait;
580 });
581} 1265}
582 1266
583sub child { 1267sub child {
584 my (undef, %arg) = @_; 1268 my (undef, %arg) = @_;
585 1269
586 defined (my $pid = $arg{pid} + 0) 1270 defined (my $pid = $arg{pid} + 0)
587 or Carp::croak "required option 'pid' is missing"; 1271 or Carp::croak "required option 'pid' is missing";
588 1272
589 $PID_CB{$pid}{$arg{cb}} = $arg{cb}; 1273 $PID_CB{$pid}{$arg{cb}} = $arg{cb};
590 1274
591 unless ($WNOHANG) {
592 $WNOHANG = eval { require POSIX; &POSIX::WNOHANG } || 1; 1275 $WNOHANG ||= eval { local $SIG{__DIE__}; require POSIX; &POSIX::WNOHANG } || 1;
593 }
594 1276
595 unless ($CHLD_W) { 1277 unless ($CHLD_W) {
596 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld); 1278 $CHLD_W = AnyEvent->signal (signal => 'CHLD', cb => \&_sigchld);
597 # child could be a zombie already, so make at least one round 1279 # child could be a zombie already, so make at least one round
598 &_sigchld; 1280 &_sigchld;
599 } 1281 }
600 1282
601 bless [$pid, $arg{cb}], "AnyEvent::Base::Child" 1283 bless [$pid, $arg{cb}], "AnyEvent::Base::child"
602} 1284}
603 1285
604sub AnyEvent::Base::Child::DESTROY { 1286sub AnyEvent::Base::child::DESTROY {
605 my ($pid, $cb) = @{$_[0]}; 1287 my ($pid, $cb) = @{$_[0]};
606 1288
607 delete $PID_CB{$pid}{$cb}; 1289 delete $PID_CB{$pid}{$cb};
608 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} }; 1290 delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
609 1291
610 undef $CHLD_W unless keys %PID_CB; 1292 undef $CHLD_W unless keys %PID_CB;
611} 1293}
1294
1295# idle emulation is done by simply using a timer, regardless
1296# of whether the process is idle or not, and not letting
1297# the callback use more than 50% of the time.
1298sub idle {
1299 my (undef, %arg) = @_;
1300
1301 my ($cb, $w, $rcb) = $arg{cb};
1302
1303 $rcb = sub {
1304 if ($cb) {
1305 $w = _time;
1306 &$cb;
1307 $w = _time - $w;
1308
1309 # never use more then 50% of the time for the idle watcher,
1310 # within some limits
1311 $w = 0.0001 if $w < 0.0001;
1312 $w = 5 if $w > 5;
1313
1314 $w = AnyEvent->timer (after => $w, cb => $rcb);
1315 } else {
1316 # clean up...
1317 undef $w;
1318 undef $rcb;
1319 }
1320 };
1321
1322 $w = AnyEvent->timer (after => 0.05, cb => $rcb);
1323
1324 bless \\$cb, "AnyEvent::Base::idle"
1325}
1326
1327sub AnyEvent::Base::idle::DESTROY {
1328 undef $${$_[0]};
1329}
1330
1331package AnyEvent::CondVar;
1332
1333our @ISA = AnyEvent::CondVar::Base::;
1334
1335package AnyEvent::CondVar::Base;
1336
1337use overload
1338 '&{}' => sub { my $self = shift; sub { $self->send (@_) } },
1339 fallback => 1;
1340
1341sub _send {
1342 # nop
1343}
1344
1345sub send {
1346 my $cv = shift;
1347 $cv->{_ae_sent} = [@_];
1348 (delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
1349 $cv->_send;
1350}
1351
1352sub croak {
1353 $_[0]{_ae_croak} = $_[1];
1354 $_[0]->send;
1355}
1356
1357sub ready {
1358 $_[0]{_ae_sent}
1359}
1360
1361sub _wait {
1362 AnyEvent->one_event while !$_[0]{_ae_sent};
1363}
1364
1365sub recv {
1366 $_[0]->_wait;
1367
1368 Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
1369 wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
1370}
1371
1372sub cb {
1373 $_[0]{_ae_cb} = $_[1] if @_ > 1;
1374 $_[0]{_ae_cb}
1375}
1376
1377sub begin {
1378 ++$_[0]{_ae_counter};
1379 $_[0]{_ae_end_cb} = $_[1] if @_ > 1;
1380}
1381
1382sub end {
1383 return if --$_[0]{_ae_counter};
1384 &{ $_[0]{_ae_end_cb} || sub { $_[0]->send } };
1385}
1386
1387# undocumented/compatibility with pre-3.4
1388*broadcast = \&send;
1389*wait = \&_wait;
1390
1391=head1 ERROR AND EXCEPTION HANDLING
1392
1393In general, AnyEvent does not do any error handling - it relies on the
1394caller to do that if required. The L<AnyEvent::Strict> module (see also
1395the C<PERL_ANYEVENT_STRICT> environment variable, below) provides strict
1396checking of all AnyEvent methods, however, which is highly useful during
1397development.
1398
1399As for exception handling (i.e. runtime errors and exceptions thrown while
1400executing a callback), this is not only highly event-loop specific, but
1401also not in any way wrapped by this module, as this is the job of the main
1402program.
1403
1404The pure perl event loop simply re-throws the exception (usually
1405within C<< condvar->recv >>), the L<Event> and L<EV> modules call C<<
1406$Event/EV::DIED->() >>, L<Glib> uses C<< install_exception_handler >> and
1407so on.
1408
1409=head1 ENVIRONMENT VARIABLES
1410
1411The following environment variables are used by this module or its
1412submodules.
1413
1414Note that AnyEvent will remove I<all> environment variables starting with
1415C<PERL_ANYEVENT_> from C<%ENV> when it is loaded while taint mode is
1416enabled.
1417
1418=over 4
1419
1420=item C<PERL_ANYEVENT_VERBOSE>
1421
1422By default, AnyEvent will be completely silent except in fatal
1423conditions. You can set this environment variable to make AnyEvent more
1424talkative.
1425
1426When set to C<1> or higher, causes AnyEvent to warn about unexpected
1427conditions, such as not being able to load the event model specified by
1428C<PERL_ANYEVENT_MODEL>.
1429
1430When set to C<2> or higher, cause AnyEvent to report to STDERR which event
1431model it chooses.
1432
1433=item C<PERL_ANYEVENT_STRICT>
1434
1435AnyEvent does not do much argument checking by default, as thorough
1436argument checking is very costly. Setting this variable to a true value
1437will cause AnyEvent to load C<AnyEvent::Strict> and then to thoroughly
1438check the arguments passed to most method calls. If it finds any problems,
1439it will croak.
1440
1441In other words, enables "strict" mode.
1442
1443Unlike C<use strict>, it is definitely recommended to keep it off in
1444production. Keeping C<PERL_ANYEVENT_STRICT=1> in your environment while
1445developing programs can be very useful, however.
1446
1447=item C<PERL_ANYEVENT_MODEL>
1448
1449This can be used to specify the event model to be used by AnyEvent, before
1450auto detection and -probing kicks in. It must be a string consisting
1451entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
1452and the resulting module name is loaded and if the load was successful,
1453used as event model. If it fails to load AnyEvent will proceed with
1454auto detection and -probing.
1455
1456This functionality might change in future versions.
1457
1458For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
1459could start your program like this:
1460
1461 PERL_ANYEVENT_MODEL=Perl perl ...
1462
1463=item C<PERL_ANYEVENT_PROTOCOLS>
1464
1465Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
1466for IPv4 or IPv6. The default is unspecified (and might change, or be the result
1467of auto probing).
1468
1469Must be set to a comma-separated list of protocols or address families,
1470current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
1471used, and preference will be given to protocols mentioned earlier in the
1472list.
1473
1474This variable can effectively be used for denial-of-service attacks
1475against local programs (e.g. when setuid), although the impact is likely
1476small, as the program has to handle conenction and other failures anyways.
1477
1478Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
1479but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
1480- only support IPv4, never try to resolve or contact IPv6
1481addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
1482IPv6, but prefer IPv6 over IPv4.
1483
1484=item C<PERL_ANYEVENT_EDNS0>
1485
1486Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
1487for DNS. This extension is generally useful to reduce DNS traffic, but
1488some (broken) firewalls drop such DNS packets, which is why it is off by
1489default.
1490
1491Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
1492EDNS0 in its DNS requests.
1493
1494=item C<PERL_ANYEVENT_MAX_FORKS>
1495
1496The maximum number of child processes that C<AnyEvent::Util::fork_call>
1497will create in parallel.
1498
1499=item C<PERL_ANYEVENT_MAX_OUTSTANDING_DNS>
1500
1501The default value for the C<max_outstanding> parameter for the default DNS
1502resolver - this is the maximum number of parallel DNS requests that are
1503sent to the DNS server.
1504
1505=item C<PERL_ANYEVENT_RESOLV_CONF>
1506
1507The file to use instead of F</etc/resolv.conf> (or OS-specific
1508configuration) in the default resolver. When set to the empty string, no
1509default config will be used.
1510
1511=item C<PERL_ANYEVENT_CA_FILE>, C<PERL_ANYEVENT_CA_PATH>.
1512
1513When neither C<ca_file> nor C<ca_path> was specified during
1514L<AnyEvent::TLS> context creation, and either of these environment
1515variables exist, they will be used to specify CA certificate locations
1516instead of a system-dependent default.
1517
1518=back
612 1519
613=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE 1520=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
614 1521
615This is an advanced topic that you do not normally need to use AnyEvent in 1522This is an advanced topic that you do not normally need to use AnyEvent in
616a module. This section is only of use to event loop authors who want to 1523a module. This section is only of use to event loop authors who want to
651I<rxvt-unicode> also cheats a bit by not providing blocking access to 1558I<rxvt-unicode> also cheats a bit by not providing blocking access to
652condition variables: code blocking while waiting for a condition will 1559condition variables: code blocking while waiting for a condition will
653C<die>. This still works with most modules/usages, and blocking calls must 1560C<die>. This still works with most modules/usages, and blocking calls must
654not be done in an interactive application, so it makes sense. 1561not be done in an interactive application, so it makes sense.
655 1562
656=head1 ENVIRONMENT VARIABLES
657
658The following environment variables are used by this module:
659
660=over 4
661
662=item C<PERL_ANYEVENT_VERBOSE>
663
664When set to C<2> or higher, cause AnyEvent to report to STDERR which event
665model it chooses.
666
667=item C<PERL_ANYEVENT_MODEL>
668
669This can be used to specify the event model to be used by AnyEvent, before
670autodetection and -probing kicks in. It must be a string consisting
671entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
672and the resulting module name is loaded and if the load was successful,
673used as event model. If it fails to load AnyEvent will proceed with
674autodetection and -probing.
675
676This functionality might change in future versions.
677
678For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
679could start your program like this:
680
681 PERL_ANYEVENT_MODEL=Perl perl ...
682
683=back
684
685=head1 EXAMPLE PROGRAM 1563=head1 EXAMPLE PROGRAM
686 1564
687The following program uses an IO watcher to read data from STDIN, a timer 1565The following program uses an I/O watcher to read data from STDIN, a timer
688to display a message once per second, and a condition variable to quit the 1566to display a message once per second, and a condition variable to quit the
689program when the user enters quit: 1567program when the user enters quit:
690 1568
691 use AnyEvent; 1569 use AnyEvent;
692 1570
697 poll => 'r', 1575 poll => 'r',
698 cb => sub { 1576 cb => sub {
699 warn "io event <$_[0]>\n"; # will always output <r> 1577 warn "io event <$_[0]>\n"; # will always output <r>
700 chomp (my $input = <STDIN>); # read a line 1578 chomp (my $input = <STDIN>); # read a line
701 warn "read: $input\n"; # output what has been read 1579 warn "read: $input\n"; # output what has been read
702 $cv->broadcast if $input =~ /^q/i; # quit program if /^q/i 1580 $cv->send if $input =~ /^q/i; # quit program if /^q/i
703 }, 1581 },
704 ); 1582 );
705 1583
706 my $time_watcher; # can only be used once 1584 my $time_watcher; # can only be used once
707 1585
712 }); 1590 });
713 } 1591 }
714 1592
715 new_timer; # create first timer 1593 new_timer; # create first timer
716 1594
717 $cv->wait; # wait until user enters /^q/i 1595 $cv->recv; # wait until user enters /^q/i
718 1596
719=head1 REAL-WORLD EXAMPLE 1597=head1 REAL-WORLD EXAMPLE
720 1598
721Consider the L<Net::FCP> module. It features (among others) the following 1599Consider the L<Net::FCP> module. It features (among others) the following
722API calls, which are to freenet what HTTP GET requests are to http: 1600API calls, which are to freenet what HTTP GET requests are to http:
772 syswrite $txn->{fh}, $txn->{request} 1650 syswrite $txn->{fh}, $txn->{request}
773 or die "connection or write error"; 1651 or die "connection or write error";
774 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r }); 1652 $txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
775 1653
776Again, C<fh_ready_r> waits till all data has arrived, and then stores the 1654Again, C<fh_ready_r> waits till all data has arrived, and then stores the
777result and signals any possible waiters that the request ahs finished: 1655result and signals any possible waiters that the request has finished:
778 1656
779 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf}; 1657 sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
780 1658
781 if (end-of-file or data complete) { 1659 if (end-of-file or data complete) {
782 $txn->{result} = $txn->{buf}; 1660 $txn->{result} = $txn->{buf};
783 $txn->{finished}->broadcast; 1661 $txn->{finished}->send;
784 $txb->{cb}->($txn) of $txn->{cb}; # also call callback 1662 $txb->{cb}->($txn) of $txn->{cb}; # also call callback
785 } 1663 }
786 1664
787The C<result> method, finally, just waits for the finished signal (if the 1665The C<result> method, finally, just waits for the finished signal (if the
788request was already finished, it doesn't wait, of course, and returns the 1666request was already finished, it doesn't wait, of course, and returns the
789data: 1667data:
790 1668
791 $txn->{finished}->wait; 1669 $txn->{finished}->recv;
792 return $txn->{result}; 1670 return $txn->{result};
793 1671
794The actual code goes further and collects all errors (C<die>s, exceptions) 1672The actual code goes further and collects all errors (C<die>s, exceptions)
795that occured during request processing. The C<result> method detects 1673that occurred during request processing. The C<result> method detects
796whether an exception as thrown (it is stored inside the $txn object) 1674whether an exception as thrown (it is stored inside the $txn object)
797and just throws the exception, which means connection errors and other 1675and just throws the exception, which means connection errors and other
798problems get reported tot he code that tries to use the result, not in a 1676problems get reported tot he code that tries to use the result, not in a
799random callback. 1677random callback.
800 1678
831 1709
832 my $quit = AnyEvent->condvar; 1710 my $quit = AnyEvent->condvar;
833 1711
834 $fcp->txn_client_get ($url)->cb (sub { 1712 $fcp->txn_client_get ($url)->cb (sub {
835 ... 1713 ...
836 $quit->broadcast; 1714 $quit->send;
837 }); 1715 });
838 1716
839 $quit->wait; 1717 $quit->recv;
1718
1719
1720=head1 BENCHMARKS
1721
1722To give you an idea of the performance and overheads that AnyEvent adds
1723over the event loops themselves and to give you an impression of the speed
1724of various event loops I prepared some benchmarks.
1725
1726=head2 BENCHMARKING ANYEVENT OVERHEAD
1727
1728Here is a benchmark of various supported event models used natively and
1729through AnyEvent. The benchmark creates a lot of timers (with a zero
1730timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
1731which it is), lets them fire exactly once and destroys them again.
1732
1733Source code for this benchmark is found as F<eg/bench> in the AnyEvent
1734distribution.
1735
1736=head3 Explanation of the columns
1737
1738I<watcher> is the number of event watchers created/destroyed. Since
1739different event models feature vastly different performances, each event
1740loop was given a number of watchers so that overall runtime is acceptable
1741and similar between tested event loop (and keep them from crashing): Glib
1742would probably take thousands of years if asked to process the same number
1743of watchers as EV in this benchmark.
1744
1745I<bytes> is the number of bytes (as measured by the resident set size,
1746RSS) consumed by each watcher. This method of measuring captures both C
1747and Perl-based overheads.
1748
1749I<create> is the time, in microseconds (millionths of seconds), that it
1750takes to create a single watcher. The callback is a closure shared between
1751all watchers, to avoid adding memory overhead. That means closure creation
1752and memory usage is not included in the figures.
1753
1754I<invoke> is the time, in microseconds, used to invoke a simple
1755callback. The callback simply counts down a Perl variable and after it was
1756invoked "watcher" times, it would C<< ->send >> a condvar once to
1757signal the end of this phase.
1758
1759I<destroy> is the time, in microseconds, that it takes to destroy a single
1760watcher.
1761
1762=head3 Results
1763
1764 name watchers bytes create invoke destroy comment
1765 EV/EV 400000 224 0.47 0.35 0.27 EV native interface
1766 EV/Any 100000 224 2.88 0.34 0.27 EV + AnyEvent watchers
1767 CoroEV/Any 100000 224 2.85 0.35 0.28 coroutines + Coro::Signal
1768 Perl/Any 100000 452 4.13 0.73 0.95 pure perl implementation
1769 Event/Event 16000 517 32.20 31.80 0.81 Event native interface
1770 Event/Any 16000 590 35.85 31.55 1.06 Event + AnyEvent watchers
1771 IOAsync/Any 16000 989 38.10 32.77 11.13 via IO::Async::Loop::IO_Poll
1772 IOAsync/Any 16000 990 37.59 29.50 10.61 via IO::Async::Loop::Epoll
1773 Glib/Any 16000 1357 102.33 12.31 51.00 quadratic behaviour
1774 Tk/Any 2000 1860 27.20 66.31 14.00 SEGV with >> 2000 watchers
1775 POE/Event 2000 6328 109.99 751.67 14.02 via POE::Loop::Event
1776 POE/Select 2000 6027 94.54 809.13 579.80 via POE::Loop::Select
1777
1778=head3 Discussion
1779
1780The benchmark does I<not> measure scalability of the event loop very
1781well. For example, a select-based event loop (such as the pure perl one)
1782can never compete with an event loop that uses epoll when the number of
1783file descriptors grows high. In this benchmark, all events become ready at
1784the same time, so select/poll-based implementations get an unnatural speed
1785boost.
1786
1787Also, note that the number of watchers usually has a nonlinear effect on
1788overall speed, that is, creating twice as many watchers doesn't take twice
1789the time - usually it takes longer. This puts event loops tested with a
1790higher number of watchers at a disadvantage.
1791
1792To put the range of results into perspective, consider that on the
1793benchmark machine, handling an event takes roughly 1600 CPU cycles with
1794EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
1795cycles with POE.
1796
1797C<EV> is the sole leader regarding speed and memory use, which are both
1798maximal/minimal, respectively. Even when going through AnyEvent, it uses
1799far less memory than any other event loop and is still faster than Event
1800natively.
1801
1802The pure perl implementation is hit in a few sweet spots (both the
1803constant timeout and the use of a single fd hit optimisations in the perl
1804interpreter and the backend itself). Nevertheless this shows that it
1805adds very little overhead in itself. Like any select-based backend its
1806performance becomes really bad with lots of file descriptors (and few of
1807them active), of course, but this was not subject of this benchmark.
1808
1809The C<Event> module has a relatively high setup and callback invocation
1810cost, but overall scores in on the third place.
1811
1812C<IO::Async> performs admirably well, about on par with C<Event>, even
1813when using its pure perl backend.
1814
1815C<Glib>'s memory usage is quite a bit higher, but it features a
1816faster callback invocation and overall ends up in the same class as
1817C<Event>. However, Glib scales extremely badly, doubling the number of
1818watchers increases the processing time by more than a factor of four,
1819making it completely unusable when using larger numbers of watchers
1820(note that only a single file descriptor was used in the benchmark, so
1821inefficiencies of C<poll> do not account for this).
1822
1823The C<Tk> adaptor works relatively well. The fact that it crashes with
1824more than 2000 watchers is a big setback, however, as correctness takes
1825precedence over speed. Nevertheless, its performance is surprising, as the
1826file descriptor is dup()ed for each watcher. This shows that the dup()
1827employed by some adaptors is not a big performance issue (it does incur a
1828hidden memory cost inside the kernel which is not reflected in the figures
1829above).
1830
1831C<POE>, regardless of underlying event loop (whether using its pure perl
1832select-based backend or the Event module, the POE-EV backend couldn't
1833be tested because it wasn't working) shows abysmal performance and
1834memory usage with AnyEvent: Watchers use almost 30 times as much memory
1835as EV watchers, and 10 times as much memory as Event (the high memory
1836requirements are caused by requiring a session for each watcher). Watcher
1837invocation speed is almost 900 times slower than with AnyEvent's pure perl
1838implementation.
1839
1840The design of the POE adaptor class in AnyEvent can not really account
1841for the performance issues, though, as session creation overhead is
1842small compared to execution of the state machine, which is coded pretty
1843optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
1844using multiple sessions is not a good approach, especially regarding
1845memory usage, even the author of POE could not come up with a faster
1846design).
1847
1848=head3 Summary
1849
1850=over 4
1851
1852=item * Using EV through AnyEvent is faster than any other event loop
1853(even when used without AnyEvent), but most event loops have acceptable
1854performance with or without AnyEvent.
1855
1856=item * The overhead AnyEvent adds is usually much smaller than the overhead of
1857the actual event loop, only with extremely fast event loops such as EV
1858adds AnyEvent significant overhead.
1859
1860=item * You should avoid POE like the plague if you want performance or
1861reasonable memory usage.
1862
1863=back
1864
1865=head2 BENCHMARKING THE LARGE SERVER CASE
1866
1867This benchmark actually benchmarks the event loop itself. It works by
1868creating a number of "servers": each server consists of a socket pair, a
1869timeout watcher that gets reset on activity (but never fires), and an I/O
1870watcher waiting for input on one side of the socket. Each time the socket
1871watcher reads a byte it will write that byte to a random other "server".
1872
1873The effect is that there will be a lot of I/O watchers, only part of which
1874are active at any one point (so there is a constant number of active
1875fds for each loop iteration, but which fds these are is random). The
1876timeout is reset each time something is read because that reflects how
1877most timeouts work (and puts extra pressure on the event loops).
1878
1879In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
1880(1%) are active. This mirrors the activity of large servers with many
1881connections, most of which are idle at any one point in time.
1882
1883Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
1884distribution.
1885
1886=head3 Explanation of the columns
1887
1888I<sockets> is the number of sockets, and twice the number of "servers" (as
1889each server has a read and write socket end).
1890
1891I<create> is the time it takes to create a socket pair (which is
1892nontrivial) and two watchers: an I/O watcher and a timeout watcher.
1893
1894I<request>, the most important value, is the time it takes to handle a
1895single "request", that is, reading the token from the pipe and forwarding
1896it to another server. This includes deleting the old timeout and creating
1897a new one that moves the timeout into the future.
1898
1899=head3 Results
1900
1901 name sockets create request
1902 EV 20000 69.01 11.16
1903 Perl 20000 73.32 35.87
1904 IOAsync 20000 157.00 98.14 epoll
1905 IOAsync 20000 159.31 616.06 poll
1906 Event 20000 212.62 257.32
1907 Glib 20000 651.16 1896.30
1908 POE 20000 349.67 12317.24 uses POE::Loop::Event
1909
1910=head3 Discussion
1911
1912This benchmark I<does> measure scalability and overall performance of the
1913particular event loop.
1914
1915EV is again fastest. Since it is using epoll on my system, the setup time
1916is relatively high, though.
1917
1918Perl surprisingly comes second. It is much faster than the C-based event
1919loops Event and Glib.
1920
1921IO::Async performs very well when using its epoll backend, and still quite
1922good compared to Glib when using its pure perl backend.
1923
1924Event suffers from high setup time as well (look at its code and you will
1925understand why). Callback invocation also has a high overhead compared to
1926the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
1927uses select or poll in basically all documented configurations.
1928
1929Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
1930clearly fails to perform with many filehandles or in busy servers.
1931
1932POE is still completely out of the picture, taking over 1000 times as long
1933as EV, and over 100 times as long as the Perl implementation, even though
1934it uses a C-based event loop in this case.
1935
1936=head3 Summary
1937
1938=over 4
1939
1940=item * The pure perl implementation performs extremely well.
1941
1942=item * Avoid Glib or POE in large projects where performance matters.
1943
1944=back
1945
1946=head2 BENCHMARKING SMALL SERVERS
1947
1948While event loops should scale (and select-based ones do not...) even to
1949large servers, most programs we (or I :) actually write have only a few
1950I/O watchers.
1951
1952In this benchmark, I use the same benchmark program as in the large server
1953case, but it uses only eight "servers", of which three are active at any
1954one time. This should reflect performance for a small server relatively
1955well.
1956
1957The columns are identical to the previous table.
1958
1959=head3 Results
1960
1961 name sockets create request
1962 EV 16 20.00 6.54
1963 Perl 16 25.75 12.62
1964 Event 16 81.27 35.86
1965 Glib 16 32.63 15.48
1966 POE 16 261.87 276.28 uses POE::Loop::Event
1967
1968=head3 Discussion
1969
1970The benchmark tries to test the performance of a typical small
1971server. While knowing how various event loops perform is interesting, keep
1972in mind that their overhead in this case is usually not as important, due
1973to the small absolute number of watchers (that is, you need efficiency and
1974speed most when you have lots of watchers, not when you only have a few of
1975them).
1976
1977EV is again fastest.
1978
1979Perl again comes second. It is noticeably faster than the C-based event
1980loops Event and Glib, although the difference is too small to really
1981matter.
1982
1983POE also performs much better in this case, but is is still far behind the
1984others.
1985
1986=head3 Summary
1987
1988=over 4
1989
1990=item * C-based event loops perform very well with small number of
1991watchers, as the management overhead dominates.
1992
1993=back
1994
1995=head2 THE IO::Lambda BENCHMARK
1996
1997Recently I was told about the benchmark in the IO::Lambda manpage, which
1998could be misinterpreted to make AnyEvent look bad. In fact, the benchmark
1999simply compares IO::Lambda with POE, and IO::Lambda looks better (which
2000shouldn't come as a surprise to anybody). As such, the benchmark is
2001fine, and mostly shows that the AnyEvent backend from IO::Lambda isn't
2002very optimal. But how would AnyEvent compare when used without the extra
2003baggage? To explore this, I wrote the equivalent benchmark for AnyEvent.
2004
2005The benchmark itself creates an echo-server, and then, for 500 times,
2006connects to the echo server, sends a line, waits for the reply, and then
2007creates the next connection. This is a rather bad benchmark, as it doesn't
2008test the efficiency of the framework or much non-blocking I/O, but it is a
2009benchmark nevertheless.
2010
2011 name runtime
2012 Lambda/select 0.330 sec
2013 + optimized 0.122 sec
2014 Lambda/AnyEvent 0.327 sec
2015 + optimized 0.138 sec
2016 Raw sockets/select 0.077 sec
2017 POE/select, components 0.662 sec
2018 POE/select, raw sockets 0.226 sec
2019 POE/select, optimized 0.404 sec
2020
2021 AnyEvent/select/nb 0.085 sec
2022 AnyEvent/EV/nb 0.068 sec
2023 +state machine 0.134 sec
2024
2025The benchmark is also a bit unfair (my fault): the IO::Lambda/POE
2026benchmarks actually make blocking connects and use 100% blocking I/O,
2027defeating the purpose of an event-based solution. All of the newly
2028written AnyEvent benchmarks use 100% non-blocking connects (using
2029AnyEvent::Socket::tcp_connect and the asynchronous pure perl DNS
2030resolver), so AnyEvent is at a disadvantage here, as non-blocking connects
2031generally require a lot more bookkeeping and event handling than blocking
2032connects (which involve a single syscall only).
2033
2034The last AnyEvent benchmark additionally uses L<AnyEvent::Handle>, which
2035offers similar expressive power as POE and IO::Lambda, using conventional
2036Perl syntax. This means that both the echo server and the client are 100%
2037non-blocking, further placing it at a disadvantage.
2038
2039As you can see, the AnyEvent + EV combination even beats the
2040hand-optimised "raw sockets benchmark", while AnyEvent + its pure perl
2041backend easily beats IO::Lambda and POE.
2042
2043And even the 100% non-blocking version written using the high-level (and
2044slow :) L<AnyEvent::Handle> abstraction beats both POE and IO::Lambda by a
2045large margin, even though it does all of DNS, tcp-connect and socket I/O
2046in a non-blocking way.
2047
2048The two AnyEvent benchmarks programs can be found as F<eg/ae0.pl> and
2049F<eg/ae2.pl> in the AnyEvent distribution, the remaining benchmarks are
2050part of the IO::lambda distribution and were used without any changes.
2051
2052
2053=head1 SIGNALS
2054
2055AnyEvent currently installs handlers for these signals:
2056
2057=over 4
2058
2059=item SIGCHLD
2060
2061A handler for C<SIGCHLD> is installed by AnyEvent's child watcher
2062emulation for event loops that do not support them natively. Also, some
2063event loops install a similar handler.
2064
2065If, when AnyEvent is loaded, SIGCHLD is set to IGNORE, then AnyEvent will
2066reset it to default, to avoid losing child exit statuses.
2067
2068=item SIGPIPE
2069
2070A no-op handler is installed for C<SIGPIPE> when C<$SIG{PIPE}> is C<undef>
2071when AnyEvent gets loaded.
2072
2073The rationale for this is that AnyEvent users usually do not really depend
2074on SIGPIPE delivery (which is purely an optimisation for shell use, or
2075badly-written programs), but C<SIGPIPE> can cause spurious and rare
2076program exits as a lot of people do not expect C<SIGPIPE> when writing to
2077some random socket.
2078
2079The rationale for installing a no-op handler as opposed to ignoring it is
2080that this way, the handler will be restored to defaults on exec.
2081
2082Feel free to install your own handler, or reset it to defaults.
2083
2084=back
2085
2086=cut
2087
2088undef $SIG{CHLD}
2089 if $SIG{CHLD} eq 'IGNORE';
2090
2091$SIG{PIPE} = sub { }
2092 unless defined $SIG{PIPE};
840 2093
841=head1 FORK 2094=head1 FORK
842 2095
843Most event libraries are not fork-safe. The ones who are usually are 2096Most event libraries are not fork-safe. The ones who are usually are
844because they are so inefficient. Only L<EV> is fully fork-aware. 2097because they rely on inefficient but fork-safe C<select> or C<poll>
2098calls. Only L<EV> is fully fork-aware.
845 2099
846If you have to fork, you must either do so I<before> creating your first 2100If you have to fork, you must either do so I<before> creating your first
847watcher OR you must not use AnyEvent at all in the child. 2101watcher OR you must not use AnyEvent at all in the child.
2102
848 2103
849=head1 SECURITY CONSIDERATIONS 2104=head1 SECURITY CONSIDERATIONS
850 2105
851AnyEvent can be forced to load any event model via 2106AnyEvent can be forced to load any event model via
852$ENV{PERL_ANYEVENT_MODEL}. While this cannot (to my knowledge) be used to 2107$ENV{PERL_ANYEVENT_MODEL}. While this cannot (to my knowledge) be used to
856specified in the variable. 2111specified in the variable.
857 2112
858You can make AnyEvent completely ignore this variable by deleting it 2113You can make AnyEvent completely ignore this variable by deleting it
859before the first watcher gets created, e.g. with a C<BEGIN> block: 2114before the first watcher gets created, e.g. with a C<BEGIN> block:
860 2115
861 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} } 2116 BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
862 2117
863 use AnyEvent; 2118 use AnyEvent;
2119
2120Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
2121be used to probe what backend is used and gain other information (which is
2122probably even less useful to an attacker than PERL_ANYEVENT_MODEL), and
2123$ENV{PERL_ANYEVENT_STRICT}.
2124
2125Note that AnyEvent will remove I<all> environment variables starting with
2126C<PERL_ANYEVENT_> from C<%ENV> when it is loaded while taint mode is
2127enabled.
2128
2129
2130=head1 BUGS
2131
2132Perl 5.8 has numerous memleaks that sometimes hit this module and are hard
2133to work around. If you suffer from memleaks, first upgrade to Perl 5.10
2134and check wether the leaks still show up. (Perl 5.10.0 has other annoying
2135memleaks, such as leaking on C<map> and C<grep> but it is usually not as
2136pronounced).
2137
864 2138
865=head1 SEE ALSO 2139=head1 SEE ALSO
866 2140
867Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>, 2141Utility functions: L<AnyEvent::Util>.
868L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>,
869L<Event::Lib>, L<Qt>.
870 2142
871Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>, 2143Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
872L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>, 2144L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
873L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>, 2145
2146Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
2147L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
2148L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
874L<AnyEvent::Impl::Qt>. 2149L<AnyEvent::Impl::POE>.
875 2150
2151Non-blocking file handles, sockets, TCP clients and
2152servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
2153
2154Asynchronous DNS: L<AnyEvent::DNS>.
2155
2156Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
2157
876Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>. 2158Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
2159
877 2160
878=head1 AUTHOR 2161=head1 AUTHOR
879 2162
880 Marc Lehmann <schmorp@schmorp.de> 2163 Marc Lehmann <schmorp@schmorp.de>
881 http://home.schmorp.de/ 2164 http://home.schmorp.de/
882 2165
883=cut 2166=cut
884 2167
8851 21681
886 2169

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines