[ViewVC] Diff of: cvs/AnyEvent/lib/AnyEvent.pm

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.82 by root, Fri Apr 25 13:32:39 2008 UTC vs.
Revision 1.113 by root, Sat May 10 20:30:35 2008 UTC

…		…
1	=head1 NAME	1	=head1 NAME
2		2
3	AnyEvent - provide framework for multiple event loops	3	AnyEvent - provide framework for multiple event loops
4		4
5	EV, Event, Coro::EV, Coro::Event, Glib, Tk, Perl, Event::Lib, Qt, POE - various supported event loops	5	EV, Event, Glib, Tk, Perl, Event::Lib, Qt, POE - various supported event loops
6		6
7	=head1 SYNOPSIS	7	=head1 SYNOPSIS
8		8
9	use AnyEvent;	9	use AnyEvent;
10		10
15	my $w = AnyEvent->timer (after => $seconds, cb => sub {	15	my $w = AnyEvent->timer (after => $seconds, cb => sub {
16	...	16	...
17	});	17	});
18		18
19	my $w = AnyEvent->condvar; # stores whether a condition was flagged	19	my $w = AnyEvent->condvar; # stores whether a condition was flagged
20	$w->wait; # enters "main loop" till $condvar gets ->broadcast	20	$w->wait; # enters "main loop" till $condvar gets ->send
21	$w->broadcast; # wake up current and all future wait's	21	$w->send; # wake up current and all future wait's
22		22
23	=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT)	23	=head1 WHY YOU SHOULD USE THIS MODULE (OR NOT)
24		24
25	Glib, POE, IO::Async, Event... CPAN offers event models by the dozen	25	Glib, POE, IO::Async, Event... CPAN offers event models by the dozen
26	nowadays. So what is different about AnyEvent?	26	nowadays. So what is different about AnyEvent?
…		…
66		66
67	Of course, if you want lots of policy (this can arguably be somewhat	67	Of course, if you want lots of policy (this can arguably be somewhat
68	useful) and you want to force your users to use the one and only event	68	useful) and you want to force your users to use the one and only event
69	model, you should I<not> use this module.	69	model, you should I<not> use this module.
70		70
71
72	=head1 DESCRIPTION	71	=head1 DESCRIPTION
73		72
74	L<AnyEvent> provides an identical interface to multiple event loops. This	73	L<AnyEvent> provides an identical interface to multiple event loops. This
75	allows module authors to utilise an event loop without forcing module	74	allows module authors to utilise an event loop without forcing module
76	users to use the same event loop (as only a single event loop can coexist	75	users to use the same event loop (as only a single event loop can coexist
…		…
79	The interface itself is vaguely similar, but not identical to the L<Event>	78	The interface itself is vaguely similar, but not identical to the L<Event>
80	module.	79	module.
81		80
82	During the first call of any watcher-creation method, the module tries	81	During the first call of any watcher-creation method, the module tries
83	to detect the currently loaded event loop by probing whether one of the	82	to detect the currently loaded event loop by probing whether one of the
84	following modules is already loaded: L<Coro::EV>, L<Coro::Event>, L<EV>,	83	following modules is already loaded: L<EV>,
85	L<Event>, L<Glib>, L<AnyEvent::Impl::Perl>, L<Tk>, L<Event::Lib>, L<Qt>,	84	L<Event>, L<Glib>, L<AnyEvent::Impl::Perl>, L<Tk>, L<Event::Lib>, L<Qt>,
86	L<POE>. The first one found is used. If none are found, the module tries	85	L<POE>. The first one found is used. If none are found, the module tries
87	to load these modules (excluding Tk, Event::Lib, Qt and POE as the pure perl	86	to load these modules (excluding Tk, Event::Lib, Qt and POE as the pure perl
88	adaptor should always succeed) in the order given. The first one that can	87	adaptor should always succeed) in the order given. The first one that can
89	be successfully loaded will be used. If, after this, still none could be	88	be successfully loaded will be used. If, after this, still none could be
…		…
141	=head2 I/O WATCHERS	140	=head2 I/O WATCHERS
142		141
143	You can create an I/O watcher by calling the C<< AnyEvent->io >> method	142	You can create an I/O watcher by calling the C<< AnyEvent->io >> method
144	with the following mandatory key-value pairs as arguments:	143	with the following mandatory key-value pairs as arguments:
145		144
146	C<fh> the Perl I<file handle> (I<not> file descriptor) to watch for	145	C<fh> the Perl I<file handle> (I<not> file descriptor) to watch
147	events. C<poll> must be a string that is either C<r> or C<w>, which	146	for events. C<poll> must be a string that is either C<r> or C<w>,
148	creates a watcher waiting for "r"eadable or "w"ritable events,	147	which creates a watcher waiting for "r"eadable or "w"ritable events,
149	respectively. C<cb> is the callback to invoke each time the file handle	148	respectively. C<cb> is the callback to invoke each time the file handle
150	becomes ready.	149	becomes ready.
151		150
		151	Although the callback might get passed parameters, their value and
		152	presence is undefined and you cannot rely on them. Portable AnyEvent
		153	callbacks cannot use arguments passed to I/O watcher callbacks.
		154
152	The I/O watcher might use the underlying file descriptor or a copy of it.	155	The I/O watcher might use the underlying file descriptor or a copy of it.
153	It is not allowed to close a file handle as long as any watcher is active	156	You must not close a file handle as long as any watcher is active on the
154	on the underlying file descriptor.	157	underlying file descriptor.
155		158
156	Some event loops issue spurious readyness notifications, so you should	159	Some event loops issue spurious readyness notifications, so you should
157	always use non-blocking calls when reading/writing from/to your file	160	always use non-blocking calls when reading/writing from/to your file
158	handles.	161	handles.
159		162
…		…
170		173
171	You can create a time watcher by calling the C<< AnyEvent->timer >>	174	You can create a time watcher by calling the C<< AnyEvent->timer >>
172	method with the following mandatory arguments:	175	method with the following mandatory arguments:
173		176
174	C<after> specifies after how many seconds (fractional values are	177	C<after> specifies after how many seconds (fractional values are
175	supported) should the timer activate. C<cb> the callback to invoke in that	178	supported) the callback should be invoked. C<cb> is the callback to invoke
176	case.	179	in that case.
		180
		181	Although the callback might get passed parameters, their value and
		182	presence is undefined and you cannot rely on them. Portable AnyEvent
		183	callbacks cannot use arguments passed to time watcher callbacks.
177		184
178	The timer callback will be invoked at most once: if you want a repeating	185	The timer callback will be invoked at most once: if you want a repeating
179	timer you have to create a new watcher (this is a limitation by both Tk	186	timer you have to create a new watcher (this is a limitation by both Tk
180	and Glib).	187	and Glib).
181		188
…		…
226		233
227	You can watch for signals using a signal watcher, C<signal> is the signal	234	You can watch for signals using a signal watcher, C<signal> is the signal
228	I<name> without any C<SIG> prefix, C<cb> is the Perl callback to	235	I<name> without any C<SIG> prefix, C<cb> is the Perl callback to
229	be invoked whenever a signal occurs.	236	be invoked whenever a signal occurs.
230		237
		238	Although the callback might get passed parameters, their value and
		239	presence is undefined and you cannot rely on them. Portable AnyEvent
		240	callbacks cannot use arguments passed to signal watcher callbacks.
		241
231	Multiple signal occurances can be clumped together into one callback	242	Multiple signal occurances can be clumped together into one callback
232	invocation, and callback invocation will be synchronous. synchronous means	243	invocation, and callback invocation will be synchronous. synchronous means
233	that it might take a while until the signal gets handled by the process,	244	that it might take a while until the signal gets handled by the process,
234	but it is guarenteed not to interrupt any other callbacks.	245	but it is guarenteed not to interrupt any other callbacks.
235		246
…		…
249		260
250	The child process is specified by the C<pid> argument (if set to C<0>, it	261	The child process is specified by the C<pid> argument (if set to C<0>, it
251	watches for any child process exit). The watcher will trigger as often	262	watches for any child process exit). The watcher will trigger as often
252	as status change for the child are received. This works by installing a	263	as status change for the child are received. This works by installing a
253	signal handler for C<SIGCHLD>. The callback will be called with the pid	264	signal handler for C<SIGCHLD>. The callback will be called with the pid
254	and exit status (as returned by waitpid).	265	and exit status (as returned by waitpid), so unlike other watcher types,
		266	you I<can> rely on child watcher callback arguments.
255		267
256	There is a slight catch to child watchers, however: you usually start them	268	There is a slight catch to child watchers, however: you usually start them
257	I<after> the child process was created, and this means the process could	269	I<after> the child process was created, and this means the process could
258	have exited already (and no SIGCHLD will be sent anymore).	270	have exited already (and no SIGCHLD will be sent anymore).
259		271
…		…
276	my $w = AnyEvent->child (	288	my $w = AnyEvent->child (
277	pid => $pid,	289	pid => $pid,
278	cb => sub {	290	cb => sub {
279	my ($pid, $status) = @_;	291	my ($pid, $status) = @_;
280	warn "pid $pid exited with status $status";	292	warn "pid $pid exited with status $status";
281	$done->broadcast;	293	$done->send;
282	},	294	},
283	);	295	);
284		296
285	# do something else, then wait for process exit	297	# do something else, then wait for process exit
286	$done->wait;	298	$done->wait;
287		299
288	=head2 CONDITION VARIABLES	300	=head2 CONDITION VARIABLES
289		301
		302	If you are familiar with some event loops you will know that all of them
		303	require you to run some blocking "loop", "run" or similar function that
		304	will actively watch for new events and call your callbacks.
		305
		306	AnyEvent is different, it expects somebody else to run the event loop and
		307	will only block when necessary (usually when told by the user).
		308
		309	The instrument to do that is called a "condition variable", so called
		310	because they represent a condition that must become true.
		311
290	Condition variables can be created by calling the C<< AnyEvent->condvar >>	312	Condition variables can be created by calling the C<< AnyEvent->condvar
291	method without any arguments.	313	>> method, usually without arguments. The only argument pair allowed is
		314	C<cb>, which specifies a callback to be called when the condition variable
		315	becomes true.
292		316
293	A condition variable waits for a condition - precisely that the C<<	317	After creation, the conditon variable is "false" until it becomes "true"
294	->broadcast >> method has been called.	318	by calling the C<send> method.
295		319
296	They are very useful to signal that a condition has been fulfilled, for	320	Condition variables are similar to callbacks, except that you can
		321	optionally wait for them. They can also be called merge points - points
		322	in time where multiple outstandign events have been processed. And yet
		323	another way to call them is transations - each condition variable can be
		324	used to represent a transaction, which finishes at some point and delivers
		325	a result.
		326
		327	Condition variables are very useful to signal that something has finished,
297	example, if you write a module that does asynchronous http requests,	328	for example, if you write a module that does asynchronous http requests,
298	then a condition variable would be the ideal candidate to signal the	329	then a condition variable would be the ideal candidate to signal the
299	availability of results.	330	availability of results. The user can either act when the callback is
		331	called or can synchronously C<< ->wait >> for the results.
300		332
301	You can also use condition variables to block your main program until	333	You can also use them to simulate traditional event loops - for example,
302	an event occurs - for example, you could C<< ->wait >> in your main	334	you can block your main program until an event occurs - for example, you
303	program until the user clicks the Quit button in your app, which would C<<	335	could C<< ->wait >> in your main program until the user clicks the Quit
304	->broadcast >> the "quit" event.	336	button of your app, which would C<< ->send >> the "quit" event.
305		337
306	Note that condition variables recurse into the event loop - if you have	338	Note that condition variables recurse into the event loop - if you have
307	two pirces of code that call C<< ->wait >> in a round-robbin fashion, you	339	two pieces of code that call C<< ->wait >> in a round-robbin fashion, you
308	lose. Therefore, condition variables are good to export to your caller, but	340	lose. Therefore, condition variables are good to export to your caller, but
309	you should avoid making a blocking wait yourself, at least in callbacks,	341	you should avoid making a blocking wait yourself, at least in callbacks,
310	as this asks for trouble.	342	as this asks for trouble.
311		343
312	This object has two methods:	344	Condition variables are represented by hash refs in perl, and the keys
		345	used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
		346	easy (it is often useful to build your own transaction class on top of
		347	AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
		348	it's C<new> method in your own C<new> method.
		349
		350	There are two "sides" to a condition variable - the "producer side" which
		351	eventually calls C<< -> send >>, and the "consumer side", which waits
		352	for the send to occur.
		353
		354	Example:
		355
		356	# wait till the result is ready
		357	my $result_ready = AnyEvent->condvar;
		358
		359	# do something such as adding a timer
		360	# or socket watcher the calls $result_ready->send
		361	# when the "result" is ready.
		362	# in this case, we simply use a timer:
		363	my $w = AnyEvent->timer (
		364	after => 1,
		365	cb => sub { $result_ready->send },
		366	);
		367
		368	# this "blocks" (while handling events) till the callback
		369	# calls send
		370	$result_ready->wait;
		371
		372	=head3 METHODS FOR PRODUCERS
		373
		374	These methods should only be used by the producing side, i.e. the
		375	code/module that eventually sends the signal. Note that it is also
		376	the producer side which creates the condvar in most cases, but it isn't
		377	uncommon for the consumer to create it as well.
313		378
314	=over 4	379	=over 4
315		380
		381	=item $cv->send (...)
		382
		383	Flag the condition as ready - a running C<< ->wait >> and all further
		384	calls to C<wait> will (eventually) return after this method has been
		385	called. If nobody is waiting the send will be remembered.
		386
		387	If a callback has been set on the condition variable, it is called
		388	immediately from within send.
		389
		390	Any arguments passed to the C<send> call will be returned by all
		391	future C<< ->wait >> calls.
		392
		393	=item $cv->croak ($error)
		394
		395	Similar to send, but causes all call's wait C<< ->wait >> to invoke
		396	C<Carp::croak> with the given error message/object/scalar.
		397
		398	This can be used to signal any errors to the condition variable
		399	user/consumer.
		400
		401	=item $cv->begin ([group callback])
		402
		403	=item $cv->end
		404
		405	These two methods can be used to combine many transactions/events into
		406	one. For example, a function that pings many hosts in parallel might want
		407	to use a condition variable for the whole process.
		408
		409	Every call to C<< ->begin >> will increment a counter, and every call to
		410	C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
		411	>>, the (last) callback passed to C<begin> will be executed. That callback
		412	is I<supposed> to call C<< ->send >>, but that is not required. If no
		413	callback was set, C<send> will be called without any arguments.
		414
		415	Let's clarify this with the ping example:
		416
		417	my $cv = AnyEvent->condvar;
		418
		419	my %result;
		420	$cv->begin (sub { $cv->send (\%result) });
		421
		422	for my $host (@list_of_hosts) {
		423	$cv->begin;
		424	ping_host_then_call_callback $host, sub {
		425	$result{$host} = ...;
		426	$cv->end;
		427	};
		428	}
		429
		430	$cv->end;
		431
		432	This code fragment supposedly pings a number of hosts and calls
		433	C<send> after results for all then have have been gathered - in any
		434	order. To achieve this, the code issues a call to C<begin> when it starts
		435	each ping request and calls C<end> when it has received some result for
		436	it. Since C<begin> and C<end> only maintain a counter, the order in which
		437	results arrive is not relevant.
		438
		439	There is an additional bracketing call to C<begin> and C<end> outside the
		440	loop, which serves two important purposes: first, it sets the callback
		441	to be called once the counter reaches C<0>, and second, it ensures that
		442	C<send> is called even when C<no> hosts are being pinged (the loop
		443	doesn't execute once).
		444
		445	This is the general pattern when you "fan out" into multiple subrequests:
		446	use an outer C<begin>/C<end> pair to set the callback and ensure C<end>
		447	is called at least once, and then, for each subrequest you start, call
		448	C<begin> and for eahc subrequest you finish, call C<end>.
		449
		450	=back
		451
		452	=head3 METHODS FOR CONSUMERS
		453
		454	These methods should only be used by the consuming side, i.e. the
		455	code awaits the condition.
		456
		457	=over 4
		458
316	=item $cv->wait	459	=item $cv->wait
317		460
318	Wait (blocking if necessary) until the C<< ->broadcast >> method has been	461	Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
319	called on c<$cv>, while servicing other watchers normally.	462	>> methods have been called on c<$cv>, while servicing other watchers
		463	normally.
320		464
321	You can only wait once on a condition - additional calls will return	465	You can only wait once on a condition - additional calls are valid but
322	immediately.	466	will return immediately.
		467
		468	If an error condition has been set by calling C<< ->croak >>, then this
		469	function will call C<croak>.
		470
		471	In list context, all parameters passed to C<send> will be returned,
		472	in scalar context only the first one will be returned.
323		473
324	Not all event models support a blocking wait - some die in that case	474	Not all event models support a blocking wait - some die in that case
325	(programs might want to do that to stay interactive), so I<if you are	475	(programs might want to do that to stay interactive), so I<if you are
326	using this from a module, never require a blocking wait>, but let the	476	using this from a module, never require a blocking wait>, but let the
327	caller decide whether the call will block or not (for example, by coupling	477	caller decide whether the call will block or not (for example, by coupling
…		…
330	while still suppporting blocking waits if the caller so desires).	480	while still suppporting blocking waits if the caller so desires).
331		481
332	Another reason I<never> to C<< ->wait >> in a module is that you cannot	482	Another reason I<never> to C<< ->wait >> in a module is that you cannot
333	sensibly have two C<< ->wait >>'s in parallel, as that would require	483	sensibly have two C<< ->wait >>'s in parallel, as that would require
334	multiple interpreters or coroutines/threads, none of which C<AnyEvent>	484	multiple interpreters or coroutines/threads, none of which C<AnyEvent>
335	can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and	485	can supply.
336	L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
337	from different coroutines, however).
338		486
339	=item $cv->broadcast	487	The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
		488	fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
		489	versions and also integrates coroutines into AnyEvent, making blocking
		490	C<< ->wait >> calls perfectly safe as long as they are done from another
		491	coroutine (one that doesn't run the event loop).
340		492
341	Flag the condition as ready - a running C<< ->wait >> and all further	493	You can ensure that C<< -wait >> never blocks by setting a callback and
342	calls to C<wait> will (eventually) return after this method has been	494	only calling C<< ->wait >> from within that callback (or at a later
343	called. If nobody is waiting the broadcast will be remembered..	495	time). This will work even when the event loop does not support blocking
		496	waits otherwise.
		497
		498	=item $bool = $cv->ready
		499
		500	Returns true when the condition is "true", i.e. whether C<send> or
		501	C<croak> have been called.
		502
		503	=item $cb = $cv->cb ([new callback])
		504
		505	This is a mutator function that returns the callback set and optionally
		506	replaces it before doing so.
		507
		508	The callback will be called when the condition becomes "true", i.e. when
		509	C<send> or C<croak> are called. Calling C<wait> inside the callback
		510	or at any later time is guaranteed not to block.
344		511
345	=back	512	=back
346
347	Example:
348
349	# wait till the result is ready
350	my $result_ready = AnyEvent->condvar;
351
352	# do something such as adding a timer
353	# or socket watcher the calls $result_ready->broadcast
354	# when the "result" is ready.
355	# in this case, we simply use a timer:
356	my $w = AnyEvent->timer (
357	after => 1,
358	cb => sub { $result_ready->broadcast },
359	);
360
361	# this "blocks" (while handling events) till the watcher
362	# calls broadcast
363	$result_ready->wait;
364		513
365	=head1 GLOBAL VARIABLES AND FUNCTIONS	514	=head1 GLOBAL VARIABLES AND FUNCTIONS
366		515
367	=over 4	516	=over 4
368		517
…		…
374	C<AnyEvent::Impl:xxx> modules, but can be any other class in the case	523	C<AnyEvent::Impl:xxx> modules, but can be any other class in the case
375	AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).	524	AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
376		525
377	The known classes so far are:	526	The known classes so far are:
378		527
379	AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
380	AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
381	AnyEvent::Impl::EV based on EV (an interface to libev, best choice).	528	AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
382	AnyEvent::Impl::Event based on Event, second best choice.	529	AnyEvent::Impl::Event based on Event, second best choice.
		530	AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
383	AnyEvent::Impl::Glib based on Glib, third-best choice.	531	AnyEvent::Impl::Glib based on Glib, third-best choice.
384	AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
385	AnyEvent::Impl::Tk based on Tk, very bad choice.	532	AnyEvent::Impl::Tk based on Tk, very bad choice.
386	AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).	533	AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
387	AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.	534	AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
388	AnyEvent::Impl::POE based on POE, not generic enough for full support.	535	AnyEvent::Impl::POE based on POE, not generic enough for full support.
389		536
…		…
402	Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model	549	Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
403	if necessary. You should only call this function right before you would	550	if necessary. You should only call this function right before you would
404	have created an AnyEvent watcher anyway, that is, as late as possible at	551	have created an AnyEvent watcher anyway, that is, as late as possible at
405	runtime.	552	runtime.
406		553
		554	=item $guard = AnyEvent::post_detect { BLOCK }
		555
		556	Arranges for the code block to be executed as soon as the event model is
		557	autodetected (or immediately if this has already happened).
		558
		559	If called in scalar or list context, then it creates and returns an object
		560	that automatically removes the callback again when it is destroyed. See
		561	L<Coro::BDB> for a case where this is useful.
		562
		563	=item @AnyEvent::post_detect
		564
		565	If there are any code references in this array (you can C<push> to it
		566	before or after loading AnyEvent), then they will called directly after
		567	the event loop has been chosen.
		568
		569	You should check C<$AnyEvent::MODEL> before adding to this array, though:
		570	if it contains a true value then the event loop has already been detected,
		571	and the array will be ignored.
		572
		573	Best use C<AnyEvent::post_detect { BLOCK }> instead.
		574
407	=back	575	=back
408		576
409	=head1 WHAT TO DO IN A MODULE	577	=head1 WHAT TO DO IN A MODULE
410		578
411	As a module author, you should C<use AnyEvent> and call AnyEvent methods	579	As a module author, you should C<use AnyEvent> and call AnyEvent methods
…		…
415	decide which event module to use as soon as the first method is called, so	583	decide which event module to use as soon as the first method is called, so
416	by calling AnyEvent in your module body you force the user of your module	584	by calling AnyEvent in your module body you force the user of your module
417	to load the event module first.	585	to load the event module first.
418		586
419	Never call C<< ->wait >> on a condition variable unless you I<know> that	587	Never call C<< ->wait >> on a condition variable unless you I<know> that
420	the C<< ->broadcast >> method has been called on it already. This is	588	the C<< ->send >> method has been called on it already. This is
421	because it will stall the whole program, and the whole point of using	589	because it will stall the whole program, and the whole point of using
422	events is to stay interactive.	590	events is to stay interactive.
423		591
424	It is fine, however, to call C<< ->wait >> when the user of your module	592	It is fine, however, to call C<< ->wait >> when the user of your module
425	requests it (i.e. if you create a http request object ad have a method	593	requests it (i.e. if you create a http request object ad have a method
…		…
445		613
446	You can chose to use a rather inefficient pure-perl implementation by	614	You can chose to use a rather inefficient pure-perl implementation by
447	loading the C<AnyEvent::Impl::Perl> module, which gives you similar	615	loading the C<AnyEvent::Impl::Perl> module, which gives you similar
448	behaviour everywhere, but letting AnyEvent chose is generally better.	616	behaviour everywhere, but letting AnyEvent chose is generally better.
449		617
		618	=head1 OTHER MODULES
		619
		620	The following is a non-exhaustive list of additional modules that use
		621	AnyEvent and can therefore be mixed easily with other AnyEvent modules
		622	in the same program. Some of the modules come with AnyEvent, some are
		623	available via CPAN.
		624
		625	=over 4
		626
		627	=item L<AnyEvent::Util>
		628
		629	Contains various utility functions that replace often-used but blocking
		630	functions such as C<inet_aton> by event-/callback-based versions.
		631
		632	=item L<AnyEvent::Handle>
		633
		634	Provide read and write buffers and manages watchers for reads and writes.
		635
		636	=item L<AnyEvent::HTTPD>
		637
		638	Provides a simple web application server framework.
		639
		640	=item L<AnyEvent::DNS>
		641
		642	Provides asynchronous DNS resolver capabilities, beyond what
		643	L<AnyEvent::Util> offers.
		644
		645	=item L<AnyEvent::FastPing>
		646
		647	The fastest ping in the west.
		648
		649	=item L<Net::IRC3>
		650
		651	AnyEvent based IRC client module family.
		652
		653	=item L<Net::XMPP2>
		654
		655	AnyEvent based XMPP (Jabber protocol) module family.
		656
		657	=item L<Net::FCP>
		658
		659	AnyEvent-based implementation of the Freenet Client Protocol, birthplace
		660	of AnyEvent.
		661
		662	=item L<Event::ExecFlow>
		663
		664	High level API for event-based execution flow control.
		665
		666	=item L<Coro>
		667
		668	Has special support for AnyEvent via L<Coro::AnyEvent>.
		669
		670	=item L<AnyEvent::AIO>, L<IO::AIO>
		671
		672	Truly asynchronous I/O, should be in the toolbox of every event
		673	programmer. AnyEvent::AIO transparently fuses IO::AIO and AnyEvent
		674	together.
		675
		676	=item L<AnyEvent::BDB>, L<BDB>
		677
		678	Truly asynchronous Berkeley DB access. AnyEvent::AIO transparently fuses
		679	IO::AIO and AnyEvent together.
		680
		681	=item L<IO::Lambda>
		682
		683	The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
		684
		685	=back
		686
450	=cut	687	=cut
451		688
452	package AnyEvent;	689	package AnyEvent;
453		690
454	no warnings;	691	no warnings;
455	use strict;	692	use strict;
456		693
457	use Carp;	694	use Carp;
458		695
459	our $VERSION = '3.3';	696	our $VERSION = '3.4';
460	our $MODEL;	697	our $MODEL;
461		698
462	our $AUTOLOAD;	699	our $AUTOLOAD;
463	our @ISA;	700	our @ISA;
464		701
465	our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;	702	our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
466		703
467	our @REGISTRY;	704	our @REGISTRY;
468		705
469	my @models = (	706	my @models = (
470	[Coro::EV:: => AnyEvent::Impl::CoroEV::],
471	[Coro::Event:: => AnyEvent::Impl::CoroEvent::],
472	[EV:: => AnyEvent::Impl::EV::],	707	[EV:: => AnyEvent::Impl::EV::],
473	[Event:: => AnyEvent::Impl::Event::],	708	[Event:: => AnyEvent::Impl::Event::],
474	[Glib:: => AnyEvent::Impl::Glib::],
475	[Tk:: => AnyEvent::Impl::Tk::],	709	[Tk:: => AnyEvent::Impl::Tk::],
476	[Wx:: => AnyEvent::Impl::POE::],	710	[Wx:: => AnyEvent::Impl::POE::],
477	[Prima:: => AnyEvent::Impl::POE::],	711	[Prima:: => AnyEvent::Impl::POE::],
478	[AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],	712	[AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
479	# everything below here will not be autoprobed as the pureperl backend should work everywhere	713	# everything below here will not be autoprobed as the pureperl backend should work everywhere
		714	[Glib:: => AnyEvent::Impl::Glib::],
480	[Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy	715	[Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
481	[Qt:: => AnyEvent::Impl::Qt::], # requires special main program	716	[Qt:: => AnyEvent::Impl::Qt::], # requires special main program
482	[POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza	717	[POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
483	);	718	);
484		719
485	our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY);	720	our %method = map +($_ => 1), qw(io timer signal child condvar one_event DESTROY);
		721
		722	our @post_detect;
		723
		724	sub post_detect(&) {
		725	my ($cb) = @_;
		726
		727	if ($MODEL) {
		728	$cb->();
		729
		730	1
		731	} else {
		732	push @post_detect, $cb;
		733
		734	defined wantarray
		735	? bless \$cb, "AnyEvent::Util::Guard"
		736	: ()
		737	}
		738	}
		739
		740	sub AnyEvent::Util::Guard::DESTROY {
		741	@post_detect = grep $_ != ${$_[0]}, @post_detect;
		742	}
486		743
487	sub detect() {	744	sub detect() {
488	unless ($MODEL) {	745	unless ($MODEL) {
489	no strict 'refs';	746	no strict 'refs';
490		747
…		…
524	last;	781	last;
525	}	782	}
526	}	783	}
527		784
528	$MODEL	785	$MODEL
529	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.";	786	or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.";
530	}	787	}
531	}	788	}
532		789
533	unshift @ISA, $MODEL;	790	unshift @ISA, $MODEL;
534	push @{"$MODEL\::ISA"}, "AnyEvent::Base";	791	push @{"$MODEL\::ISA"}, "AnyEvent::Base";
		792
		793	(shift @post_detect)->() while @post_detect;
535	}	794	}
536		795
537	$MODEL	796	$MODEL
538	}	797	}
539		798
…		…
881	});	1140	});
882		1141
883	$quit->wait;	1142	$quit->wait;
884		1143
885		1144
886	=head1 BENCHMARK	1145	=head1 BENCHMARKS
887		1146
888	To give you an idea of the performance and overheads that AnyEvent adds	1147	To give you an idea of the performance and overheads that AnyEvent adds
889	over the event loops themselves (and to give you an impression of the	1148	over the event loops themselves and to give you an impression of the speed
890	speed of various event loops), here is a benchmark of various supported	1149	of various event loops I prepared some benchmarks.
891	event models natively and with anyevent. The benchmark creates a lot of	1150
892	timers (with a zero timeout) and I/O watchers (watching STDOUT, a pty, to	1151	=head2 BENCHMARKING ANYEVENT OVERHEAD
		1152
		1153	Here is a benchmark of various supported event models used natively and
		1154	through anyevent. The benchmark creates a lot of timers (with a zero
		1155	timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
893	become writable, which it is), lets them fire exactly once and destroys	1156	which it is), lets them fire exactly once and destroys them again.
894	them again.
895		1157
896	Rewriting the benchmark to use many different sockets instead of using	1158	Source code for this benchmark is found as F<eg/bench> in the AnyEvent
897	the same filehandle for all I/O watchers results in a much longer runtime	1159	distribution.
898	(socket creation is expensive), but qualitatively the same figures, so it
899	was not used.
900		1160
901	=head2 Explanation of the columns	1161	=head3 Explanation of the columns
902		1162
903	I<watcher> is the number of event watchers created/destroyed. Since	1163	I<watcher> is the number of event watchers created/destroyed. Since
904	different event models feature vastly different performances, each event	1164	different event models feature vastly different performances, each event
905	loop was given a number of watchers so that overall runtime is acceptable	1165	loop was given a number of watchers so that overall runtime is acceptable
906	and similar between tested event loop (and keep them from crashing): Glib	1166	and similar between tested event loop (and keep them from crashing): Glib
…		…
922	signal the end of this phase.	1182	signal the end of this phase.
923		1183
924	I<destroy> is the time, in microseconds, that it takes to destroy a single	1184	I<destroy> is the time, in microseconds, that it takes to destroy a single
925	watcher.	1185	watcher.
926		1186
927	=head2 Results	1187	=head3 Results
928		1188
929	name watchers bytes create invoke destroy comment	1189	name watchers bytes create invoke destroy comment
930	EV/EV 400000 244 0.56 0.46 0.31 EV native interface	1190	EV/EV 400000 244 0.56 0.46 0.31 EV native interface
931	EV/Any 100000 610 3.52 0.91 0.75 EV + AnyEvent watchers	1191	EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
932	CoroEV/Any 100000 610 3.49 0.92 0.75 coroutines + Coro::Signal	1192	CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
933	Perl/Any 100000 513 4.91 0.92 1.15 pure perl implementation	1193	Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
934	Event/Event 16000 523 28.05 21.38 0.86 Event native interface	1194	Event/Event 16000 516 31.88 31.30 0.85 Event native interface
935	Event/Any 16000 943 34.43 20.48 1.39 Event + AnyEvent watchers	1195	Event/Any 16000 590 35.75 31.42 1.08 Event + AnyEvent watchers
936	Glib/Any 16000 1357 96.99 12.55 55.51 quadratic behaviour	1196	Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
937	Tk/Any 2000 1855 27.01 66.61 14.03 SEGV with >> 2000 watchers	1197	Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
938	POE/Event 2000 6644 108.15 768.19 14.33 via POE::Loop::Event	1198	POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
939	POE/Select 2000 6343 94.69 807.65 562.69 via POE::Loop::Select	1199	POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
940		1200
941	=head2 Discussion	1201	=head3 Discussion
942		1202
943	The benchmark does I<not> measure scalability of the event loop very	1203	The benchmark does I<not> measure scalability of the event loop very
944	well. For example, a select-based event loop (such as the pure perl one)	1204	well. For example, a select-based event loop (such as the pure perl one)
945	can never compete with an event loop that uses epoll when the number of	1205	can never compete with an event loop that uses epoll when the number of
946	file descriptors grows high. In this benchmark, all events become ready at	1206	file descriptors grows high. In this benchmark, all events become ready at
947	the same time, so select/poll-based implementations get an unnatural speed	1207	the same time, so select/poll-based implementations get an unnatural speed
948	boost.	1208	boost.
949		1209
		1210	Also, note that the number of watchers usually has a nonlinear effect on
		1211	overall speed, that is, creating twice as many watchers doesn't take twice
		1212	the time - usually it takes longer. This puts event loops tested with a
		1213	higher number of watchers at a disadvantage.
		1214
		1215	To put the range of results into perspective, consider that on the
		1216	benchmark machine, handling an event takes roughly 1600 CPU cycles with
		1217	EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
		1218	cycles with POE.
		1219
950	C<EV> is the sole leader regarding speed and memory use, which are both	1220	C<EV> is the sole leader regarding speed and memory use, which are both
951	maximal/minimal, respectively. Even when going through AnyEvent, there are	1221	maximal/minimal, respectively. Even when going through AnyEvent, it uses
952	only two event loops that use slightly less memory (the C<Event> module	1222	far less memory than any other event loop and is still faster than Event
953	natively and the pure perl backend), and no faster event models, not even	1223	natively.
954	C<Event> natively.
955		1224
956	The pure perl implementation is hit in a few sweet spots (both the	1225	The pure perl implementation is hit in a few sweet spots (both the
957	zero timeout and the use of a single fd hit optimisations in the perl	1226	constant timeout and the use of a single fd hit optimisations in the perl
958	interpreter and the backend itself, and all watchers become ready at the	1227	interpreter and the backend itself). Nevertheless this shows that it
959	same time). Nevertheless this shows that it adds very little overhead in	1228	adds very little overhead in itself. Like any select-based backend its
960	itself. Like any select-based backend its performance becomes really bad	1229	performance becomes really bad with lots of file descriptors (and few of
961	with lots of file descriptors (and few of them active), of course, but	1230	them active), of course, but this was not subject of this benchmark.
962	this was not subject of this benchmark.
963		1231
964	The C<Event> module has a relatively high setup and callback invocation cost,	1232	The C<Event> module has a relatively high setup and callback invocation
965	but overall scores on the third place.	1233	cost, but overall scores in on the third place.
966		1234
967	C<Glib>'s memory usage is quite a bit bit higher, but it features a	1235	C<Glib>'s memory usage is quite a bit higher, but it features a
968	faster callback invocation and overall ends up in the same class as	1236	faster callback invocation and overall ends up in the same class as
969	C<Event>. However, Glib scales extremely badly, doubling the number of	1237	C<Event>. However, Glib scales extremely badly, doubling the number of
970	watchers increases the processing time by more than a factor of four,	1238	watchers increases the processing time by more than a factor of four,
971	making it completely unusable when using larger numbers of watchers	1239	making it completely unusable when using larger numbers of watchers
972	(note that only a single file descriptor was used in the benchmark, so	1240	(note that only a single file descriptor was used in the benchmark, so
…		…
975	The C<Tk> adaptor works relatively well. The fact that it crashes with	1243	The C<Tk> adaptor works relatively well. The fact that it crashes with
976	more than 2000 watchers is a big setback, however, as correctness takes	1244	more than 2000 watchers is a big setback, however, as correctness takes
977	precedence over speed. Nevertheless, its performance is surprising, as the	1245	precedence over speed. Nevertheless, its performance is surprising, as the
978	file descriptor is dup()ed for each watcher. This shows that the dup()	1246	file descriptor is dup()ed for each watcher. This shows that the dup()
979	employed by some adaptors is not a big performance issue (it does incur a	1247	employed by some adaptors is not a big performance issue (it does incur a
980	hidden memory cost inside the kernel, though, that is not reflected in the	1248	hidden memory cost inside the kernel which is not reflected in the figures
981	figures above).	1249	above).
982		1250
983	C<POE>, regardless of underlying event loop (wether using its pure perl	1251	C<POE>, regardless of underlying event loop (whether using its pure perl
984	select-based backend or the Event module) shows abysmal performance and	1252	select-based backend or the Event module, the POE-EV backend couldn't
		1253	be tested because it wasn't working) shows abysmal performance and
985	memory usage: Watchers use almost 30 times as much memory as EV watchers,	1254	memory usage with AnyEvent: Watchers use almost 30 times as much memory
986	and 10 times as much memory as both Event or EV via AnyEvent. Watcher	1255	as EV watchers, and 10 times as much memory as Event (the high memory
		1256	requirements are caused by requiring a session for each watcher). Watcher
987	invocation is almost 900 times slower than with AnyEvent's pure perl	1257	invocation speed is almost 900 times slower than with AnyEvent's pure perl
		1258	implementation.
		1259
988	implementation. The design of the POE adaptor class in AnyEvent can not	1260	The design of the POE adaptor class in AnyEvent can not really account
989	really account for this, as session creation overhead is small compared	1261	for the performance issues, though, as session creation overhead is
990	to execution of the state machine, which is coded pretty optimally within	1262	small compared to execution of the state machine, which is coded pretty
991	L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow.	1263	optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
		1264	using multiple sessions is not a good approach, especially regarding
		1265	memory usage, even the author of POE could not come up with a faster
		1266	design).
992		1267
993	=head2 Summary	1268	=head3 Summary
994		1269
		1270	=over 4
		1271
995	Using EV through AnyEvent is faster than any other event loop, but most	1272	=item * Using EV through AnyEvent is faster than any other event loop
996	event loops have acceptable performance with or without AnyEvent.	1273	(even when used without AnyEvent), but most event loops have acceptable
		1274	performance with or without AnyEvent.
997		1275
998	The overhead AnyEvent adds is usually much smaller than the overhead of	1276	=item * The overhead AnyEvent adds is usually much smaller than the overhead of
999	the actual event loop, only with extremely fast event loops such as the EV	1277	the actual event loop, only with extremely fast event loops such as EV
1000	adds AnyEvent significant overhead.	1278	adds AnyEvent significant overhead.
1001		1279
1002	And you should simply avoid POE like the plague if you want performance or	1280	=item * You should avoid POE like the plague if you want performance or
1003	reasonable memory usage.	1281	reasonable memory usage.
1004		1282
		1283	=back
		1284
		1285	=head2 BENCHMARKING THE LARGE SERVER CASE
		1286
		1287	This benchmark atcually benchmarks the event loop itself. It works by
		1288	creating a number of "servers": each server consists of a socketpair, a
		1289	timeout watcher that gets reset on activity (but never fires), and an I/O
		1290	watcher waiting for input on one side of the socket. Each time the socket
		1291	watcher reads a byte it will write that byte to a random other "server".
		1292
		1293	The effect is that there will be a lot of I/O watchers, only part of which
		1294	are active at any one point (so there is a constant number of active
		1295	fds for each loop iterstaion, but which fds these are is random). The
		1296	timeout is reset each time something is read because that reflects how
		1297	most timeouts work (and puts extra pressure on the event loops).
		1298
		1299	In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100
		1300	(1%) are active. This mirrors the activity of large servers with many
		1301	connections, most of which are idle at any one point in time.
		1302
		1303	Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
		1304	distribution.
		1305
		1306	=head3 Explanation of the columns
		1307
		1308	I<sockets> is the number of sockets, and twice the number of "servers" (as
		1309	each server has a read and write socket end).
		1310
		1311	I<create> is the time it takes to create a socketpair (which is
		1312	nontrivial) and two watchers: an I/O watcher and a timeout watcher.
		1313
		1314	I<request>, the most important value, is the time it takes to handle a
		1315	single "request", that is, reading the token from the pipe and forwarding
		1316	it to another server. This includes deleting the old timeout and creating
		1317	a new one that moves the timeout into the future.
		1318
		1319	=head3 Results
		1320
		1321	name sockets create request
		1322	EV 20000 69.01 11.16
		1323	Perl 20000 73.32 35.87
		1324	Event 20000 212.62 257.32
		1325	Glib 20000 651.16 1896.30
		1326	POE 20000 349.67 12317.24 uses POE::Loop::Event
		1327
		1328	=head3 Discussion
		1329
		1330	This benchmark I<does> measure scalability and overall performance of the
		1331	particular event loop.
		1332
		1333	EV is again fastest. Since it is using epoll on my system, the setup time
		1334	is relatively high, though.
		1335
		1336	Perl surprisingly comes second. It is much faster than the C-based event
		1337	loops Event and Glib.
		1338
		1339	Event suffers from high setup time as well (look at its code and you will
		1340	understand why). Callback invocation also has a high overhead compared to
		1341	the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
		1342	uses select or poll in basically all documented configurations.
		1343
		1344	Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
		1345	clearly fails to perform with many filehandles or in busy servers.
		1346
		1347	POE is still completely out of the picture, taking over 1000 times as long
		1348	as EV, and over 100 times as long as the Perl implementation, even though
		1349	it uses a C-based event loop in this case.
		1350
		1351	=head3 Summary
		1352
		1353	=over 4
		1354
		1355	=item * The pure perl implementation performs extremely well.
		1356
		1357	=item * Avoid Glib or POE in large projects where performance matters.
		1358
		1359	=back
		1360
		1361	=head2 BENCHMARKING SMALL SERVERS
		1362
		1363	While event loops should scale (and select-based ones do not...) even to
		1364	large servers, most programs we (or I :) actually write have only a few
		1365	I/O watchers.
		1366
		1367	In this benchmark, I use the same benchmark program as in the large server
		1368	case, but it uses only eight "servers", of which three are active at any
		1369	one time. This should reflect performance for a small server relatively
		1370	well.
		1371
		1372	The columns are identical to the previous table.
		1373
		1374	=head3 Results
		1375
		1376	name sockets create request
		1377	EV 16 20.00 6.54
		1378	Perl 16 25.75 12.62
		1379	Event 16 81.27 35.86
		1380	Glib 16 32.63 15.48
		1381	POE 16 261.87 276.28 uses POE::Loop::Event
		1382
		1383	=head3 Discussion
		1384
		1385	The benchmark tries to test the performance of a typical small
		1386	server. While knowing how various event loops perform is interesting, keep
		1387	in mind that their overhead in this case is usually not as important, due
		1388	to the small absolute number of watchers (that is, you need efficiency and
		1389	speed most when you have lots of watchers, not when you only have a few of
		1390	them).
		1391
		1392	EV is again fastest.
		1393
		1394	Perl again comes second. It is noticably faster than the C-based event
		1395	loops Event and Glib, although the difference is too small to really
		1396	matter.
		1397
		1398	POE also performs much better in this case, but is is still far behind the
		1399	others.
		1400
		1401	=head3 Summary
		1402
		1403	=over 4
		1404
		1405	=item * C-based event loops perform very well with small number of
		1406	watchers, as the management overhead dominates.
		1407
		1408	=back
		1409
1005		1410
1006	=head1 FORK	1411	=head1 FORK
1007		1412
1008	Most event libraries are not fork-safe. The ones who are usually are	1413	Most event libraries are not fork-safe. The ones who are usually are
1009	because they are so inefficient. Only L<EV> is fully fork-aware.	1414	because they rely on inefficient but fork-safe C<select> or C<poll>
		1415	calls. Only L<EV> is fully fork-aware.
1010		1416
1011	If you have to fork, you must either do so I<before> creating your first	1417	If you have to fork, you must either do so I<before> creating your first
1012	watcher OR you must not use AnyEvent at all in the child.	1418	watcher OR you must not use AnyEvent at all in the child.
1013		1419
1014		1420
…		…
1026		1432
1027	BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }	1433	BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
1028		1434
1029	use AnyEvent;	1435	use AnyEvent;
1030		1436
		1437	Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
		1438	be used to probe what backend is used and gain other information (which is
		1439	probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
		1440
1031		1441
1032	=head1 SEE ALSO	1442	=head1 SEE ALSO
1033		1443
1034	Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>,	1444	Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1035	L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>,
1036	L<Event::Lib>, L<Qt>, L<POE>.	1445	L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1037		1446
1038	Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>,	1447	Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1039	L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>,	1448	L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1040	L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>,	1449	L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1041	L<AnyEvent::Impl::Qt>, L<AnyEvent::Impl::POE>.	1450	L<AnyEvent::Impl::POE>.
		1451
		1452	Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
1042		1453
1043	Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>.	1454	Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>.
1044		1455
1045		1456
1046	=head1 AUTHOR	1457	=head1 AUTHOR

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing AnyEvent/lib/AnyEvent.pm (file contents): Revision 1.82 by root, Fri Apr 25 13:32:39 2008 UTC vs. Revision 1.113 by root, Sat May 10 20:30:35 2008 UTC

Diff Legend

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.82 by root, Fri Apr 25 13:32:39 2008 UTC vs.
Revision 1.113 by root, Sat May 10 20:30:35 2008 UTC