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

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.84 by root, Fri Apr 25 13:48:42 2008 UTC vs.
Revision 1.133 by root, Sun May 25 03:44:03 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->send; # wake up current and all future recv's
20	$w->wait; # enters "main loop" till $condvar gets ->broadcast	21	$w->recv; # enters "main loop" till $condvar gets ->send
21	$w->broadcast; # wake up current and all future wait's
22		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?
…		…
57	as those use one of the supported event loops. It is trivial to add new	57	as those use one of the supported event loops. It is trivial to add new
58	event loops to AnyEvent, too, so it is future-proof).	58	event loops to AnyEvent, too, so it is future-proof).
59		59
60	In addition to being free of having to use I<the one and only true event	60	In addition to being free of having to use I<the one and only true event
61	model>, AnyEvent also is free of bloat and policy: with POE or similar	61	model>, AnyEvent also is free of bloat and policy: with POE or similar
62	modules, you get an enourmous amount of code and strict rules you have to	62	modules, you get an enormous amount of code and strict rules you have to
63	follow. AnyEvent, on the other hand, is lean and up to the point, by only	63	follow. AnyEvent, on the other hand, is lean and up to the point, by only
64	offering the functionality that is necessary, in as thin as a wrapper as	64	offering the functionality that is necessary, in as thin as a wrapper as
65	technically possible.	65	technically possible.
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
71		70
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
…		…
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
…		…
109		108
110	=head1 WATCHERS	109	=head1 WATCHERS
111		110
112	AnyEvent has the central concept of a I<watcher>, which is an object that	111	AnyEvent has the central concept of a I<watcher>, which is an object that
113	stores relevant data for each kind of event you are waiting for, such as	112	stores relevant data for each kind of event you are waiting for, such as
114	the callback to call, the filehandle to watch, etc.	113	the callback to call, the file handle to watch, etc.
115		114
116	These watchers are normal Perl objects with normal Perl lifetime. After	115	These watchers are normal Perl objects with normal Perl lifetime. After
117	creating a watcher it will immediately "watch" for events and invoke the	116	creating a watcher it will immediately "watch" for events and invoke the
118	callback when the event occurs (of course, only when the event model	117	callback when the event occurs (of course, only when the event model
119	is in control).	118	is in control).
…		…
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.
		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.
151		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	You must not close a file handle as long as any watcher is active on the	156	You must not close a file handle as long as any watcher is active on the
154	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
160	Although the callback might get passed parameters, their value and
161	presence is undefined and you cannot rely on them. Portable AnyEvent
162	callbacks cannot use arguments passed to I/O watcher callbacks.
163		162
164	Example:	163	Example:
165		164
166	# wait for readability of STDIN, then read a line and disable the watcher	165	# wait for readability of STDIN, then read a line and disable the watcher
167	my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {	166	my $w; $w = AnyEvent->io (fh => \*STDIN, poll => 'r', cb => sub {
…		…
174		173
175	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 >>
176	method with the following mandatory arguments:	175	method with the following mandatory arguments:
177		176
178	C<after> specifies after how many seconds (fractional values are	177	C<after> specifies after how many seconds (fractional values are
179	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
180	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.
181		184
182	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
183	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
184	and Glib).	187	and Glib).
185
186	Although the callback might get passed parameters, their value and
187	presence is undefined and you cannot rely on them. Portable AnyEvent
188	callbacks cannot use arguments passed to time watcher callbacks.
189		188
190	Example:	189	Example:
191		190
192	# fire an event after 7.7 seconds	191	# fire an event after 7.7 seconds
193	my $w = AnyEvent->timer (after => 7.7, cb => sub {	192	my $w = AnyEvent->timer (after => 7.7, cb => sub {
…		…
234		233
235	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
236	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
237	be invoked whenever a signal occurs.	236	be invoked whenever a signal occurs.
238		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
239	Multiple signal occurances can be clumped together into one callback	242	Multiple signal occurrences can be clumped together into one callback
240	invocation, and callback invocation will be synchronous. synchronous means	243	invocation, and callback invocation will be synchronous. Synchronous means
241	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,
242	but it is guarenteed not to interrupt any other callbacks.	245	but it is guaranteed not to interrupt any other callbacks.
243		246
244	The main advantage of using these watchers is that you can share a signal	247	The main advantage of using these watchers is that you can share a signal
245	between multiple watchers.	248	between multiple watchers.
246		249
247	This watcher might use C<%SIG>, so programs overwriting those signals	250	This watcher might use C<%SIG>, so programs overwriting those signals
…		…
257		260
258	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
259	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
260	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
261	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
262	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.
263		267
264	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
265	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
266	have exited already (and no SIGCHLD will be sent anymore).	270	have exited already (and no SIGCHLD will be sent anymore).
267		271
…		…
274	C<fork> the child (alternatively, you can call C<AnyEvent::detect>).	278	C<fork> the child (alternatively, you can call C<AnyEvent::detect>).
275		279
276	Example: fork a process and wait for it	280	Example: fork a process and wait for it
277		281
278	my $done = AnyEvent->condvar;	282	my $done = AnyEvent->condvar;
279
280	AnyEvent::detect; # force event module to be initialised
281		283
282	my $pid = fork or exit 5;	284	my $pid = fork or exit 5;
283		285
284	my $w = AnyEvent->child (	286	my $w = AnyEvent->child (
285	pid => $pid,	287	pid => $pid,
286	cb => sub {	288	cb => sub {
287	my ($pid, $status) = @_;	289	my ($pid, $status) = @_;
288	warn "pid $pid exited with status $status";	290	warn "pid $pid exited with status $status";
289	$done->broadcast;	291	$done->send;
290	},	292	},
291	);	293	);
292		294
293	# do something else, then wait for process exit	295	# do something else, then wait for process exit
294	$done->wait;	296	$done->recv;
295		297
296	=head2 CONDITION VARIABLES	298	=head2 CONDITION VARIABLES
297		299
		300	If you are familiar with some event loops you will know that all of them
		301	require you to run some blocking "loop", "run" or similar function that
		302	will actively watch for new events and call your callbacks.
		303
		304	AnyEvent is different, it expects somebody else to run the event loop and
		305	will only block when necessary (usually when told by the user).
		306
		307	The instrument to do that is called a "condition variable", so called
		308	because they represent a condition that must become true.
		309
298	Condition variables can be created by calling the C<< AnyEvent->condvar >>	310	Condition variables can be created by calling the C<< AnyEvent->condvar
299	method without any arguments.	311	>> method, usually without arguments. The only argument pair allowed is
		312	C<cb>, which specifies a callback to be called when the condition variable
		313	becomes true.
300		314
301	A condition variable waits for a condition - precisely that the C<<	315	After creation, the condition variable is "false" until it becomes "true"
302	->broadcast >> method has been called.	316	by calling the C<send> method (or calling the condition variable as if it
		317	were a callback).
303		318
304	They are very useful to signal that a condition has been fulfilled, for	319	Condition variables are similar to callbacks, except that you can
		320	optionally wait for them. They can also be called merge points - points
		321	in time where multiple outstanding events have been processed. And yet
		322	another way to call them is transactions - each condition variable can be
		323	used to represent a transaction, which finishes at some point and delivers
		324	a result.
		325
		326	Condition variables are very useful to signal that something has finished,
305	example, if you write a module that does asynchronous http requests,	327	for example, if you write a module that does asynchronous http requests,
306	then a condition variable would be the ideal candidate to signal the	328	then a condition variable would be the ideal candidate to signal the
307	availability of results.	329	availability of results. The user can either act when the callback is
		330	called or can synchronously C<< ->recv >> for the results.
308		331
309	You can also use condition variables to block your main program until	332	You can also use them to simulate traditional event loops - for example,
310	an event occurs - for example, you could C<< ->wait >> in your main	333	you can block your main program until an event occurs - for example, you
311	program until the user clicks the Quit button in your app, which would C<<	334	could C<< ->recv >> in your main program until the user clicks the Quit
312	->broadcast >> the "quit" event.	335	button of your app, which would C<< ->send >> the "quit" event.
313		336
314	Note that condition variables recurse into the event loop - if you have	337	Note that condition variables recurse into the event loop - if you have
315	two pirces of code that call C<< ->wait >> in a round-robbin fashion, you	338	two pieces of code that call C<< ->recv >> in a round-robin fashion, you
316	lose. Therefore, condition variables are good to export to your caller, but	339	lose. Therefore, condition variables are good to export to your caller, but
317	you should avoid making a blocking wait yourself, at least in callbacks,	340	you should avoid making a blocking wait yourself, at least in callbacks,
318	as this asks for trouble.	341	as this asks for trouble.
319		342
320	This object has two methods:	343	Condition variables are represented by hash refs in perl, and the keys
		344	used by AnyEvent itself are all named C<_ae_XXX> to make subclassing
		345	easy (it is often useful to build your own transaction class on top of
		346	AnyEvent). To subclass, use C<AnyEvent::CondVar> as base class and call
		347	it's C<new> method in your own C<new> method.
		348
		349	There are two "sides" to a condition variable - the "producer side" which
		350	eventually calls C<< -> send >>, and the "consumer side", which waits
		351	for the send to occur.
		352
		353	Example: wait for a timer.
		354
		355	# wait till the result is ready
		356	my $result_ready = AnyEvent->condvar;
		357
		358	# do something such as adding a timer
		359	# or socket watcher the calls $result_ready->send
		360	# when the "result" is ready.
		361	# in this case, we simply use a timer:
		362	my $w = AnyEvent->timer (
		363	after => 1,
		364	cb => sub { $result_ready->send },
		365	);
		366
		367	# this "blocks" (while handling events) till the callback
		368	# calls send
		369	$result_ready->recv;
		370
		371	Example: wait for a timer, but take advantage of the fact that
		372	condition variables are also code references.
		373
		374	my $done = AnyEvent->condvar;
		375	my $delay = AnyEvent->timer (after => 5, cb => $done);
		376	$done->recv;
		377
		378	=head3 METHODS FOR PRODUCERS
		379
		380	These methods should only be used by the producing side, i.e. the
		381	code/module that eventually sends the signal. Note that it is also
		382	the producer side which creates the condvar in most cases, but it isn't
		383	uncommon for the consumer to create it as well.
321		384
322	=over 4	385	=over 4
323		386
		387	=item $cv->send (...)
		388
		389	Flag the condition as ready - a running C<< ->recv >> and all further
		390	calls to C<recv> will (eventually) return after this method has been
		391	called. If nobody is waiting the send will be remembered.
		392
		393	If a callback has been set on the condition variable, it is called
		394	immediately from within send.
		395
		396	Any arguments passed to the C<send> call will be returned by all
		397	future C<< ->recv >> calls.
		398
		399	Condition variables are overloaded so one can call them directly (as a
		400	code reference). Calling them directly is the same as calling C<send>.
		401
		402	=item $cv->croak ($error)
		403
		404	Similar to send, but causes all call's to C<< ->recv >> to invoke
		405	C<Carp::croak> with the given error message/object/scalar.
		406
		407	This can be used to signal any errors to the condition variable
		408	user/consumer.
		409
		410	=item $cv->begin ([group callback])
		411
324	=item $cv->wait	412	=item $cv->end
325		413
326	Wait (blocking if necessary) until the C<< ->broadcast >> method has been	414	These two methods are EXPERIMENTAL and MIGHT CHANGE.
		415
		416	These two methods can be used to combine many transactions/events into
		417	one. For example, a function that pings many hosts in parallel might want
		418	to use a condition variable for the whole process.
		419
		420	Every call to C<< ->begin >> will increment a counter, and every call to
		421	C<< ->end >> will decrement it. If the counter reaches C<0> in C<< ->end
		422	>>, the (last) callback passed to C<begin> will be executed. That callback
		423	is I<supposed> to call C<< ->send >>, but that is not required. If no
		424	callback was set, C<send> will be called without any arguments.
		425
		426	Let's clarify this with the ping example:
		427
		428	my $cv = AnyEvent->condvar;
		429
		430	my %result;
		431	$cv->begin (sub { $cv->send (\%result) });
		432
		433	for my $host (@list_of_hosts) {
		434	$cv->begin;
		435	ping_host_then_call_callback $host, sub {
		436	$result{$host} = ...;
		437	$cv->end;
		438	};
		439	}
		440
		441	$cv->end;
		442
		443	This code fragment supposedly pings a number of hosts and calls
		444	C<send> after results for all then have have been gathered - in any
		445	order. To achieve this, the code issues a call to C<begin> when it starts
		446	each ping request and calls C<end> when it has received some result for
		447	it. Since C<begin> and C<end> only maintain a counter, the order in which
		448	results arrive is not relevant.
		449
		450	There is an additional bracketing call to C<begin> and C<end> outside the
		451	loop, which serves two important purposes: first, it sets the callback
		452	to be called once the counter reaches C<0>, and second, it ensures that
		453	C<send> is called even when C<no> hosts are being pinged (the loop
		454	doesn't execute once).
		455
		456	This is the general pattern when you "fan out" into multiple subrequests:
		457	use an outer C<begin>/C<end> pair to set the callback and ensure C<end>
		458	is called at least once, and then, for each subrequest you start, call
		459	C<begin> and for each subrequest you finish, call C<end>.
		460
		461	=back
		462
		463	=head3 METHODS FOR CONSUMERS
		464
		465	These methods should only be used by the consuming side, i.e. the
		466	code awaits the condition.
		467
		468	=over 4
		469
		470	=item $cv->recv
		471
		472	Wait (blocking if necessary) until the C<< ->send >> or C<< ->croak
327	called on c<$cv>, while servicing other watchers normally.	473	>> methods have been called on c<$cv>, while servicing other watchers
		474	normally.
328		475
329	You can only wait once on a condition - additional calls will return	476	You can only wait once on a condition - additional calls are valid but
330	immediately.	477	will return immediately.
		478
		479	If an error condition has been set by calling C<< ->croak >>, then this
		480	function will call C<croak>.
		481
		482	In list context, all parameters passed to C<send> will be returned,
		483	in scalar context only the first one will be returned.
331		484
332	Not all event models support a blocking wait - some die in that case	485	Not all event models support a blocking wait - some die in that case
333	(programs might want to do that to stay interactive), so I<if you are	486	(programs might want to do that to stay interactive), so I<if you are
334	using this from a module, never require a blocking wait>, but let the	487	using this from a module, never require a blocking wait>, but let the
335	caller decide whether the call will block or not (for example, by coupling	488	caller decide whether the call will block or not (for example, by coupling
336	condition variables with some kind of request results and supporting	489	condition variables with some kind of request results and supporting
337	callbacks so the caller knows that getting the result will not block,	490	callbacks so the caller knows that getting the result will not block,
338	while still suppporting blocking waits if the caller so desires).	491	while still supporting blocking waits if the caller so desires).
339		492
340	Another reason I<never> to C<< ->wait >> in a module is that you cannot	493	Another reason I<never> to C<< ->recv >> in a module is that you cannot
341	sensibly have two C<< ->wait >>'s in parallel, as that would require	494	sensibly have two C<< ->recv >>'s in parallel, as that would require
342	multiple interpreters or coroutines/threads, none of which C<AnyEvent>	495	multiple interpreters or coroutines/threads, none of which C<AnyEvent>
343	can supply (the coroutine-aware backends L<AnyEvent::Impl::CoroEV> and	496	can supply.
344	L<AnyEvent::Impl::CoroEvent> explicitly support concurrent C<< ->wait >>'s
345	from different coroutines, however).
346		497
347	=item $cv->broadcast	498	The L<Coro> module, however, I<can> and I<does> supply coroutines and, in
		499	fact, L<Coro::AnyEvent> replaces AnyEvent's condvars by coroutine-safe
		500	versions and also integrates coroutines into AnyEvent, making blocking
		501	C<< ->recv >> calls perfectly safe as long as they are done from another
		502	coroutine (one that doesn't run the event loop).
348		503
349	Flag the condition as ready - a running C<< ->wait >> and all further	504	You can ensure that C<< -recv >> never blocks by setting a callback and
350	calls to C<wait> will (eventually) return after this method has been	505	only calling C<< ->recv >> from within that callback (or at a later
351	called. If nobody is waiting the broadcast will be remembered..	506	time). This will work even when the event loop does not support blocking
		507	waits otherwise.
		508
		509	=item $bool = $cv->ready
		510
		511	Returns true when the condition is "true", i.e. whether C<send> or
		512	C<croak> have been called.
		513
		514	=item $cb = $cv->cb ([new callback])
		515
		516	This is a mutator function that returns the callback set and optionally
		517	replaces it before doing so.
		518
		519	The callback will be called when the condition becomes "true", i.e. when
		520	C<send> or C<croak> are called. Calling C<recv> inside the callback
		521	or at any later time is guaranteed not to block.
352		522
353	=back	523	=back
354		524
355	Example:	525	=head3 MAINLOOP EMULATION
356		526
357	# wait till the result is ready	527	Sometimes (often for short test scripts, or even standalone programs
358	my $result_ready = AnyEvent->condvar;	528	who only want to use AnyEvent), you I<do> want your program to block
		529	indefinitely in some event loop.
359		530
360	# do something such as adding a timer	531	In that case, you cna use a condition variable like this:
361	# or socket watcher the calls $result_ready->broadcast
362	# when the "result" is ready.
363	# in this case, we simply use a timer:
364	my $w = AnyEvent->timer (
365	after => 1,
366	cb => sub { $result_ready->broadcast },
367	);
368		532
369	# this "blocks" (while handling events) till the watcher	533	AnyEvent->condvar->recv;
370	# calls broadcast	534
371	$result_ready->wait;	535	This has the effect of entering the event loop and looping forever.
		536
		537	Note that usually your program has some exit condition, in which case
		538	it is better to use the "traditional" approach of storing a condition
		539	variable, waiting for it, and sending it when the program should exit
		540	cleanly.
		541
372		542
373	=head1 GLOBAL VARIABLES AND FUNCTIONS	543	=head1 GLOBAL VARIABLES AND FUNCTIONS
374		544
375	=over 4	545	=over 4
376		546
…		…
382	C<AnyEvent::Impl:xxx> modules, but can be any other class in the case	552	C<AnyEvent::Impl:xxx> modules, but can be any other class in the case
383	AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).	553	AnyEvent has been extended at runtime (e.g. in I<rxvt-unicode>).
384		554
385	The known classes so far are:	555	The known classes so far are:
386		556
387	AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
388	AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
389	AnyEvent::Impl::EV based on EV (an interface to libev, best choice).	557	AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
390	AnyEvent::Impl::Event based on Event, second best choice.	558	AnyEvent::Impl::Event based on Event, second best choice.
		559	AnyEvent::Impl::Perl pure-perl implementation, fast and portable.
391	AnyEvent::Impl::Glib based on Glib, third-best choice.	560	AnyEvent::Impl::Glib based on Glib, third-best choice.
392	AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
393	AnyEvent::Impl::Tk based on Tk, very bad choice.	561	AnyEvent::Impl::Tk based on Tk, very bad choice.
394	AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).	562	AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
395	AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.	563	AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
396	AnyEvent::Impl::POE based on POE, not generic enough for full support.	564	AnyEvent::Impl::POE based on POE, not generic enough for full support.
397		565
…		…
410	Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model	578	Returns C<$AnyEvent::MODEL>, forcing autodetection of the event model
411	if necessary. You should only call this function right before you would	579	if necessary. You should only call this function right before you would
412	have created an AnyEvent watcher anyway, that is, as late as possible at	580	have created an AnyEvent watcher anyway, that is, as late as possible at
413	runtime.	581	runtime.
414		582
		583	=item $guard = AnyEvent::post_detect { BLOCK }
		584
		585	Arranges for the code block to be executed as soon as the event model is
		586	autodetected (or immediately if this has already happened).
		587
		588	If called in scalar or list context, then it creates and returns an object
		589	that automatically removes the callback again when it is destroyed. See
		590	L<Coro::BDB> for a case where this is useful.
		591
		592	=item @AnyEvent::post_detect
		593
		594	If there are any code references in this array (you can C<push> to it
		595	before or after loading AnyEvent), then they will called directly after
		596	the event loop has been chosen.
		597
		598	You should check C<$AnyEvent::MODEL> before adding to this array, though:
		599	if it contains a true value then the event loop has already been detected,
		600	and the array will be ignored.
		601
		602	Best use C<AnyEvent::post_detect { BLOCK }> instead.
		603
415	=back	604	=back
416		605
417	=head1 WHAT TO DO IN A MODULE	606	=head1 WHAT TO DO IN A MODULE
418		607
419	As a module author, you should C<use AnyEvent> and call AnyEvent methods	608	As a module author, you should C<use AnyEvent> and call AnyEvent methods
…		…
422	Be careful when you create watchers in the module body - AnyEvent will	611	Be careful when you create watchers in the module body - AnyEvent will
423	decide which event module to use as soon as the first method is called, so	612	decide which event module to use as soon as the first method is called, so
424	by calling AnyEvent in your module body you force the user of your module	613	by calling AnyEvent in your module body you force the user of your module
425	to load the event module first.	614	to load the event module first.
426		615
427	Never call C<< ->wait >> on a condition variable unless you I<know> that	616	Never call C<< ->recv >> on a condition variable unless you I<know> that
428	the C<< ->broadcast >> method has been called on it already. This is	617	the C<< ->send >> method has been called on it already. This is
429	because it will stall the whole program, and the whole point of using	618	because it will stall the whole program, and the whole point of using
430	events is to stay interactive.	619	events is to stay interactive.
431		620
432	It is fine, however, to call C<< ->wait >> when the user of your module	621	It is fine, however, to call C<< ->recv >> when the user of your module
433	requests it (i.e. if you create a http request object ad have a method	622	requests it (i.e. if you create a http request object ad have a method
434	called C<results> that returns the results, it should call C<< ->wait >>	623	called C<results> that returns the results, it should call C<< ->recv >>
435	freely, as the user of your module knows what she is doing. always).	624	freely, as the user of your module knows what she is doing. always).
436		625
437	=head1 WHAT TO DO IN THE MAIN PROGRAM	626	=head1 WHAT TO DO IN THE MAIN PROGRAM
438		627
439	There will always be a single main program - the only place that should	628	There will always be a single main program - the only place that should
…		…
453		642
454	You can chose to use a rather inefficient pure-perl implementation by	643	You can chose to use a rather inefficient pure-perl implementation by
455	loading the C<AnyEvent::Impl::Perl> module, which gives you similar	644	loading the C<AnyEvent::Impl::Perl> module, which gives you similar
456	behaviour everywhere, but letting AnyEvent chose is generally better.	645	behaviour everywhere, but letting AnyEvent chose is generally better.
457		646
		647	=head1 OTHER MODULES
		648
		649	The following is a non-exhaustive list of additional modules that use
		650	AnyEvent and can therefore be mixed easily with other AnyEvent modules
		651	in the same program. Some of the modules come with AnyEvent, some are
		652	available via CPAN.
		653
		654	=over 4
		655
		656	=item L<AnyEvent::Util>
		657
		658	Contains various utility functions that replace often-used but blocking
		659	functions such as C<inet_aton> by event-/callback-based versions.
		660
		661	=item L<AnyEvent::Handle>
		662
		663	Provide read and write buffers and manages watchers for reads and writes.
		664
		665	=item L<AnyEvent::Socket>
		666
		667	Provides various utility functions for (internet protocol) sockets,
		668	addresses and name resolution. Also functions to create non-blocking tcp
		669	connections or tcp servers, with IPv6 and SRV record support and more.
		670
		671	=item L<AnyEvent::HTTPD>
		672
		673	Provides a simple web application server framework.
		674
		675	=item L<AnyEvent::DNS>
		676
		677	Provides rich asynchronous DNS resolver capabilities.
		678
		679	=item L<AnyEvent::FastPing>
		680
		681	The fastest ping in the west.
		682
		683	=item L<Net::IRC3>
		684
		685	AnyEvent based IRC client module family.
		686
		687	=item L<Net::XMPP2>
		688
		689	AnyEvent based XMPP (Jabber protocol) module family.
		690
		691	=item L<Net::FCP>
		692
		693	AnyEvent-based implementation of the Freenet Client Protocol, birthplace
		694	of AnyEvent.
		695
		696	=item L<Event::ExecFlow>
		697
		698	High level API for event-based execution flow control.
		699
		700	=item L<Coro>
		701
		702	Has special support for AnyEvent via L<Coro::AnyEvent>.
		703
		704	=item L<AnyEvent::AIO>, L<IO::AIO>
		705
		706	Truly asynchronous I/O, should be in the toolbox of every event
		707	programmer. AnyEvent::AIO transparently fuses IO::AIO and AnyEvent
		708	together.
		709
		710	=item L<AnyEvent::BDB>, L<BDB>
		711
		712	Truly asynchronous Berkeley DB access. AnyEvent::AIO transparently fuses
		713	IO::AIO and AnyEvent together.
		714
		715	=item L<IO::Lambda>
		716
		717	The lambda approach to I/O - don't ask, look there. Can use AnyEvent.
		718
		719	=back
		720
458	=cut	721	=cut
459		722
460	package AnyEvent;	723	package AnyEvent;
461		724
462	no warnings;	725	no warnings;
463	use strict;	726	use strict;
464		727
465	use Carp;	728	use Carp;
466		729
467	our $VERSION = '3.3';	730	our $VERSION = '4.03';
468	our $MODEL;	731	our $MODEL;
469		732
470	our $AUTOLOAD;	733	our $AUTOLOAD;
471	our @ISA;	734	our @ISA;
472		735
473	our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;	736	our $verbose = $ENV{PERL_ANYEVENT_VERBOSE}*1;
474		737
475	our @REGISTRY;	738	our @REGISTRY;
476		739
		740	our %PROTOCOL; # (ipv4\|ipv6) => (1\|2)
		741
		742	{
		743	my $idx;
		744	$PROTOCOL{$_} = ++$idx
		745	for split /\s,\s/, $ENV{PERL_ANYEVENT_PROTOCOLS} \|\| "ipv4,ipv6";
		746	}
		747
477	my @models = (	748	my @models = (
478	[Coro::EV:: => AnyEvent::Impl::CoroEV::],
479	[Coro::Event:: => AnyEvent::Impl::CoroEvent::],
480	[EV:: => AnyEvent::Impl::EV::],	749	[EV:: => AnyEvent::Impl::EV::],
481	[Event:: => AnyEvent::Impl::Event::],	750	[Event:: => AnyEvent::Impl::Event::],
482	[Glib:: => AnyEvent::Impl::Glib::],
483	[Tk:: => AnyEvent::Impl::Tk::],	751	[Tk:: => AnyEvent::Impl::Tk::],
484	[Wx:: => AnyEvent::Impl::POE::],	752	[Wx:: => AnyEvent::Impl::POE::],
485	[Prima:: => AnyEvent::Impl::POE::],	753	[Prima:: => AnyEvent::Impl::POE::],
486	[AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],	754	[AnyEvent::Impl::Perl:: => AnyEvent::Impl::Perl::],
487	# everything below here will not be autoprobed as the pureperl backend should work everywhere	755	# everything below here will not be autoprobed as the pureperl backend should work everywhere
		756	[Glib:: => AnyEvent::Impl::Glib::],
488	[Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy	757	[Event::Lib:: => AnyEvent::Impl::EventLib::], # too buggy
489	[Qt:: => AnyEvent::Impl::Qt::], # requires special main program	758	[Qt:: => AnyEvent::Impl::Qt::], # requires special main program
490	[POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza	759	[POE::Kernel:: => AnyEvent::Impl::POE::], # lasciate ogni speranza
491	);	760	);
492		761
493	our %method = map +($_ => 1), qw(io timer signal child condvar broadcast wait one_event DESTROY);	762	our %method = map +($_ => 1), qw(io timer signal child condvar one_event DESTROY);
		763
		764	our @post_detect;
		765
		766	sub post_detect(&) {
		767	my ($cb) = @_;
		768
		769	if ($MODEL) {
		770	$cb->();
		771
		772	1
		773	} else {
		774	push @post_detect, $cb;
		775
		776	defined wantarray
		777	? bless \$cb, "AnyEvent::Util::PostDetect"
		778	: ()
		779	}
		780	}
		781
		782	sub AnyEvent::Util::PostDetect::DESTROY {
		783	@post_detect = grep $_ != ${$_[0]}, @post_detect;
		784	}
494		785
495	sub detect() {	786	sub detect() {
496	unless ($MODEL) {	787	unless ($MODEL) {
497	no strict 'refs';	788	no strict 'refs';
498		789
…		…
532	last;	823	last;
533	}	824	}
534	}	825	}
535		826
536	$MODEL	827	$MODEL
537	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.";	828	or die "No event module selected for AnyEvent and autodetect failed. Install any one of these modules: EV, Event or Glib.";
538	}	829	}
539	}	830	}
540		831
541	unshift @ISA, $MODEL;	832	unshift @ISA, $MODEL;
542	push @{"$MODEL\::ISA"}, "AnyEvent::Base";	833	push @{"$MODEL\::ISA"}, "AnyEvent::Base";
		834
		835	(shift @post_detect)->() while @post_detect;
543	}	836	}
544		837
545	$MODEL	838	$MODEL
546	}	839	}
547		840
…		…
557	$class->$func (@_);	850	$class->$func (@_);
558	}	851	}
559		852
560	package AnyEvent::Base;	853	package AnyEvent::Base;
561		854
562	# default implementation for ->condvar, ->wait, ->broadcast	855	# default implementation for ->condvar
563		856
564	sub condvar {	857	sub condvar {
565	bless \my $flag, "AnyEvent::Base::CondVar"	858	bless { @_ == 3 ? (_ae_cb => $_[2]) : () }, AnyEvent::CondVar::
566	}
567
568	sub AnyEvent::Base::CondVar::broadcast {
569	${$_[0]}++;
570	}
571
572	sub AnyEvent::Base::CondVar::wait {
573	AnyEvent->one_event while !${$_[0]};
574	}	859	}
575		860
576	# default implementation for ->signal	861	# default implementation for ->signal
577		862
578	our %SIG_CB;	863	our %SIG_CB;
…		…
652	delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };	937	delete $PID_CB{$pid} unless keys %{ $PID_CB{$pid} };
653		938
654	undef $CHLD_W unless keys %PID_CB;	939	undef $CHLD_W unless keys %PID_CB;
655	}	940	}
656		941
		942	package AnyEvent::CondVar;
		943
		944	our @ISA = AnyEvent::CondVar::Base::;
		945
		946	package AnyEvent::CondVar::Base;
		947
		948	use overload
		949	'&{}' => sub { my $self = shift; sub { $self->send (@_) } },
		950	fallback => 1;
		951
		952	sub _send {
		953	# nop
		954	}
		955
		956	sub send {
		957	my $cv = shift;
		958	$cv->{_ae_sent} = [@_];
		959	(delete $cv->{_ae_cb})->($cv) if $cv->{_ae_cb};
		960	$cv->_send;
		961	}
		962
		963	sub croak {
		964	$_[0]{_ae_croak} = $_[1];
		965	$_[0]->send;
		966	}
		967
		968	sub ready {
		969	$_[0]{_ae_sent}
		970	}
		971
		972	sub _wait {
		973	AnyEvent->one_event while !$_[0]{_ae_sent};
		974	}
		975
		976	sub recv {
		977	$_[0]->_wait;
		978
		979	Carp::croak $_[0]{_ae_croak} if $_[0]{_ae_croak};
		980	wantarray ? @{ $_[0]{_ae_sent} } : $_[0]{_ae_sent}[0]
		981	}
		982
		983	sub cb {
		984	$_[0]{_ae_cb} = $_[1] if @_ > 1;
		985	$_[0]{_ae_cb}
		986	}
		987
		988	sub begin {
		989	++$_[0]{_ae_counter};
		990	$_[0]{_ae_end_cb} = $_[1] if @_ > 1;
		991	}
		992
		993	sub end {
		994	return if --$_[0]{_ae_counter};
		995	&{ $_[0]{_ae_end_cb} \|\| sub { $_[0]->send } };
		996	}
		997
		998	# undocumented/compatibility with pre-3.4
		999	*broadcast = \&send;
		1000	*wait = \&_wait;
		1001
657	=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE	1002	=head1 SUPPLYING YOUR OWN EVENT MODEL INTERFACE
658		1003
659	This is an advanced topic that you do not normally need to use AnyEvent in	1004	This is an advanced topic that you do not normally need to use AnyEvent in
660	a module. This section is only of use to event loop authors who want to	1005	a module. This section is only of use to event loop authors who want to
661	provide AnyEvent compatibility.	1006	provide AnyEvent compatibility.
…		…
717	model it chooses.	1062	model it chooses.
718		1063
719	=item C<PERL_ANYEVENT_MODEL>	1064	=item C<PERL_ANYEVENT_MODEL>
720		1065
721	This can be used to specify the event model to be used by AnyEvent, before	1066	This can be used to specify the event model to be used by AnyEvent, before
722	autodetection and -probing kicks in. It must be a string consisting	1067	auto detection and -probing kicks in. It must be a string consisting
723	entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended	1068	entirely of ASCII letters. The string C<AnyEvent::Impl::> gets prepended
724	and the resulting module name is loaded and if the load was successful,	1069	and the resulting module name is loaded and if the load was successful,
725	used as event model. If it fails to load AnyEvent will proceed with	1070	used as event model. If it fails to load AnyEvent will proceed with
726	autodetection and -probing.	1071	auto detection and -probing.
727		1072
728	This functionality might change in future versions.	1073	This functionality might change in future versions.
729		1074
730	For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you	1075	For example, to force the pure perl model (L<AnyEvent::Impl::Perl>) you
731	could start your program like this:	1076	could start your program like this:
732		1077
733	PERL_ANYEVENT_MODEL=Perl perl ...	1078	PERL_ANYEVENT_MODEL=Perl perl ...
		1079
		1080	=item C<PERL_ANYEVENT_PROTOCOLS>
		1081
		1082	Used by both L<AnyEvent::DNS> and L<AnyEvent::Socket> to determine preferences
		1083	for IPv4 or IPv6. The default is unspecified (and might change, or be the result
		1084	of auto probing).
		1085
		1086	Must be set to a comma-separated list of protocols or address families,
		1087	current supported: C<ipv4> and C<ipv6>. Only protocols mentioned will be
		1088	used, and preference will be given to protocols mentioned earlier in the
		1089	list.
		1090
		1091	This variable can effectively be used for denial-of-service attacks
		1092	against local programs (e.g. when setuid), although the impact is likely
		1093	small, as the program has to handle connection errors already-
		1094
		1095	Examples: C<PERL_ANYEVENT_PROTOCOLS=ipv4,ipv6> - prefer IPv4 over IPv6,
		1096	but support both and try to use both. C<PERL_ANYEVENT_PROTOCOLS=ipv4>
		1097	- only support IPv4, never try to resolve or contact IPv6
		1098	addresses. C<PERL_ANYEVENT_PROTOCOLS=ipv6,ipv4> support either IPv4 or
		1099	IPv6, but prefer IPv6 over IPv4.
		1100
		1101	=item C<PERL_ANYEVENT_EDNS0>
		1102
		1103	Used by L<AnyEvent::DNS> to decide whether to use the EDNS0 extension
		1104	for DNS. This extension is generally useful to reduce DNS traffic, but
		1105	some (broken) firewalls drop such DNS packets, which is why it is off by
		1106	default.
		1107
		1108	Setting this variable to C<1> will cause L<AnyEvent::DNS> to announce
		1109	EDNS0 in its DNS requests.
734		1110
735	=back	1111	=back
736		1112
737	=head1 EXAMPLE PROGRAM	1113	=head1 EXAMPLE PROGRAM
738		1114
…		…
749	poll => 'r',	1125	poll => 'r',
750	cb => sub {	1126	cb => sub {
751	warn "io event <$_[0]>\n"; # will always output <r>	1127	warn "io event <$_[0]>\n"; # will always output <r>
752	chomp (my $input = <STDIN>); # read a line	1128	chomp (my $input = <STDIN>); # read a line
753	warn "read: $input\n"; # output what has been read	1129	warn "read: $input\n"; # output what has been read
754	$cv->broadcast if $input =~ /^q/i; # quit program if /^q/i	1130	$cv->send if $input =~ /^q/i; # quit program if /^q/i
755	},	1131	},
756	);	1132	);
757		1133
758	my $time_watcher; # can only be used once	1134	my $time_watcher; # can only be used once
759		1135
…		…
764	});	1140	});
765	}	1141	}
766		1142
767	new_timer; # create first timer	1143	new_timer; # create first timer
768		1144
769	$cv->wait; # wait until user enters /^q/i	1145	$cv->recv; # wait until user enters /^q/i
770		1146
771	=head1 REAL-WORLD EXAMPLE	1147	=head1 REAL-WORLD EXAMPLE
772		1148
773	Consider the L<Net::FCP> module. It features (among others) the following	1149	Consider the L<Net::FCP> module. It features (among others) the following
774	API calls, which are to freenet what HTTP GET requests are to http:	1150	API calls, which are to freenet what HTTP GET requests are to http:
…		…
824	syswrite $txn->{fh}, $txn->{request}	1200	syswrite $txn->{fh}, $txn->{request}
825	or die "connection or write error";	1201	or die "connection or write error";
826	$txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });	1202	$txn->{w} = AnyEvent->io (fh => $txn->{fh}, poll => 'r', cb => sub { $txn->fh_ready_r });
827		1203
828	Again, C<fh_ready_r> waits till all data has arrived, and then stores the	1204	Again, C<fh_ready_r> waits till all data has arrived, and then stores the
829	result and signals any possible waiters that the request ahs finished:	1205	result and signals any possible waiters that the request has finished:
830		1206
831	sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};	1207	sysread $txn->{fh}, $txn->{buf}, length $txn->{$buf};
832		1208
833	if (end-of-file or data complete) {	1209	if (end-of-file or data complete) {
834	$txn->{result} = $txn->{buf};	1210	$txn->{result} = $txn->{buf};
835	$txn->{finished}->broadcast;	1211	$txn->{finished}->send;
836	$txb->{cb}->($txn) of $txn->{cb}; # also call callback	1212	$txb->{cb}->($txn) of $txn->{cb}; # also call callback
837	}	1213	}
838		1214
839	The C<result> method, finally, just waits for the finished signal (if the	1215	The C<result> method, finally, just waits for the finished signal (if the
840	request was already finished, it doesn't wait, of course, and returns the	1216	request was already finished, it doesn't wait, of course, and returns the
841	data:	1217	data:
842		1218
843	$txn->{finished}->wait;	1219	$txn->{finished}->recv;
844	return $txn->{result};	1220	return $txn->{result};
845		1221
846	The actual code goes further and collects all errors (C<die>s, exceptions)	1222	The actual code goes further and collects all errors (C<die>s, exceptions)
847	that occured during request processing. The C<result> method detects	1223	that occurred during request processing. The C<result> method detects
848	whether an exception as thrown (it is stored inside the $txn object)	1224	whether an exception as thrown (it is stored inside the $txn object)
849	and just throws the exception, which means connection errors and other	1225	and just throws the exception, which means connection errors and other
850	problems get reported tot he code that tries to use the result, not in a	1226	problems get reported tot he code that tries to use the result, not in a
851	random callback.	1227	random callback.
852		1228
…		…
883		1259
884	my $quit = AnyEvent->condvar;	1260	my $quit = AnyEvent->condvar;
885		1261
886	$fcp->txn_client_get ($url)->cb (sub {	1262	$fcp->txn_client_get ($url)->cb (sub {
887	...	1263	...
888	$quit->broadcast;	1264	$quit->send;
889	});	1265	});
890		1266
891	$quit->wait;	1267	$quit->recv;
892		1268
893		1269
894	=head1 BENCHMARK	1270	=head1 BENCHMARKS
895		1271
896	To give you an idea of the performance and overheads that AnyEvent adds	1272	To give you an idea of the performance and overheads that AnyEvent adds
897	over the event loops themselves (and to give you an impression of the	1273	over the event loops themselves and to give you an impression of the speed
898	speed of various event loops), here is a benchmark of various supported	1274	of various event loops I prepared some benchmarks.
899	event models natively and with anyevent. The benchmark creates a lot of	1275
900	timers (with a zero timeout) and I/O watchers (watching STDOUT, a pty, to	1276	=head2 BENCHMARKING ANYEVENT OVERHEAD
		1277
		1278	Here is a benchmark of various supported event models used natively and
		1279	through AnyEvent. The benchmark creates a lot of timers (with a zero
		1280	timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
901	become writable, which it is), lets them fire exactly once and destroys	1281	which it is), lets them fire exactly once and destroys them again.
902	them again.
903		1282
904	Rewriting the benchmark to use many different sockets instead of using	1283	Source code for this benchmark is found as F<eg/bench> in the AnyEvent
905	the same filehandle for all I/O watchers results in a much longer runtime	1284	distribution.
906	(socket creation is expensive), but qualitatively the same figures, so it
907	was not used.
908		1285
909	=head2 Explanation of the columns	1286	=head3 Explanation of the columns
910		1287
911	I<watcher> is the number of event watchers created/destroyed. Since	1288	I<watcher> is the number of event watchers created/destroyed. Since
912	different event models feature vastly different performances, each event	1289	different event models feature vastly different performances, each event
913	loop was given a number of watchers so that overall runtime is acceptable	1290	loop was given a number of watchers so that overall runtime is acceptable
914	and similar between tested event loop (and keep them from crashing): Glib	1291	and similar between tested event loop (and keep them from crashing): Glib
…		…
924	all watchers, to avoid adding memory overhead. That means closure creation	1301	all watchers, to avoid adding memory overhead. That means closure creation
925	and memory usage is not included in the figures.	1302	and memory usage is not included in the figures.
926		1303
927	I<invoke> is the time, in microseconds, used to invoke a simple	1304	I<invoke> is the time, in microseconds, used to invoke a simple
928	callback. The callback simply counts down a Perl variable and after it was	1305	callback. The callback simply counts down a Perl variable and after it was
929	invoked "watcher" times, it would C<< ->broadcast >> a condvar once to	1306	invoked "watcher" times, it would C<< ->send >> a condvar once to
930	signal the end of this phase.	1307	signal the end of this phase.
931		1308
932	I<destroy> is the time, in microseconds, that it takes to destroy a single	1309	I<destroy> is the time, in microseconds, that it takes to destroy a single
933	watcher.	1310	watcher.
934		1311
935	=head2 Results	1312	=head3 Results
936		1313
937	name watchers bytes create invoke destroy comment	1314	name watchers bytes create invoke destroy comment
938	EV/EV 400000 244 0.56 0.46 0.31 EV native interface	1315	EV/EV 400000 244 0.56 0.46 0.31 EV native interface
939	EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers	1316	EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
940	CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal	1317	CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
941	Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation	1318	Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
942	Event/Event 16000 516 31.88 31.30 0.85 Event native interface	1319	Event/Event 16000 516 31.88 31.30 0.85 Event native interface
943	Event/Any 16000 936 39.17 33.63 1.43 Event + AnyEvent watchers	1320	Event/Any 16000 590 35.75 31.42 1.08 Event + AnyEvent watchers
944	Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour	1321	Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
945	Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers	1322	Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
946	POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event	1323	POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
947	POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select	1324	POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
948		1325
949	=head2 Discussion	1326	=head3 Discussion
950		1327
951	The benchmark does I<not> measure scalability of the event loop very	1328	The benchmark does I<not> measure scalability of the event loop very
952	well. For example, a select-based event loop (such as the pure perl one)	1329	well. For example, a select-based event loop (such as the pure perl one)
953	can never compete with an event loop that uses epoll when the number of	1330	can never compete with an event loop that uses epoll when the number of
954	file descriptors grows high. In this benchmark, all events become ready at	1331	file descriptors grows high. In this benchmark, all events become ready at
955	the same time, so select/poll-based implementations get an unnatural speed	1332	the same time, so select/poll-based implementations get an unnatural speed
956	boost.	1333	boost.
957		1334
		1335	Also, note that the number of watchers usually has a nonlinear effect on
		1336	overall speed, that is, creating twice as many watchers doesn't take twice
		1337	the time - usually it takes longer. This puts event loops tested with a
		1338	higher number of watchers at a disadvantage.
		1339
		1340	To put the range of results into perspective, consider that on the
		1341	benchmark machine, handling an event takes roughly 1600 CPU cycles with
		1342	EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
		1343	cycles with POE.
		1344
958	C<EV> is the sole leader regarding speed and memory use, which are both	1345	C<EV> is the sole leader regarding speed and memory use, which are both
959	maximal/minimal, respectively. Even when going through AnyEvent, it uses	1346	maximal/minimal, respectively. Even when going through AnyEvent, it uses
960	far less memory than any other event loop and is still faster than Event	1347	far less memory than any other event loop and is still faster than Event
961	natively.	1348	natively.
962		1349
963	The pure perl implementation is hit in a few sweet spots (both the	1350	The pure perl implementation is hit in a few sweet spots (both the
964	zero timeout and the use of a single fd hit optimisations in the perl	1351	constant timeout and the use of a single fd hit optimisations in the perl
965	interpreter and the backend itself, and all watchers become ready at the	1352	interpreter and the backend itself). Nevertheless this shows that it
966	same time). Nevertheless this shows that it adds very little overhead in	1353	adds very little overhead in itself. Like any select-based backend its
967	itself. Like any select-based backend its performance becomes really bad	1354	performance becomes really bad with lots of file descriptors (and few of
968	with lots of file descriptors (and few of them active), of course, but	1355	them active), of course, but this was not subject of this benchmark.
969	this was not subject of this benchmark.
970		1356
971	The C<Event> module has a relatively high setup and callback invocation cost,	1357	The C<Event> module has a relatively high setup and callback invocation
972	but overall scores on the third place.	1358	cost, but overall scores in on the third place.
973		1359
974	C<Glib>'s memory usage is quite a bit bit higher, but it features a	1360	C<Glib>'s memory usage is quite a bit higher, but it features a
975	faster callback invocation and overall ends up in the same class as	1361	faster callback invocation and overall ends up in the same class as
976	C<Event>. However, Glib scales extremely badly, doubling the number of	1362	C<Event>. However, Glib scales extremely badly, doubling the number of
977	watchers increases the processing time by more than a factor of four,	1363	watchers increases the processing time by more than a factor of four,
978	making it completely unusable when using larger numbers of watchers	1364	making it completely unusable when using larger numbers of watchers
979	(note that only a single file descriptor was used in the benchmark, so	1365	(note that only a single file descriptor was used in the benchmark, so
…		…
982	The C<Tk> adaptor works relatively well. The fact that it crashes with	1368	The C<Tk> adaptor works relatively well. The fact that it crashes with
983	more than 2000 watchers is a big setback, however, as correctness takes	1369	more than 2000 watchers is a big setback, however, as correctness takes
984	precedence over speed. Nevertheless, its performance is surprising, as the	1370	precedence over speed. Nevertheless, its performance is surprising, as the
985	file descriptor is dup()ed for each watcher. This shows that the dup()	1371	file descriptor is dup()ed for each watcher. This shows that the dup()
986	employed by some adaptors is not a big performance issue (it does incur a	1372	employed by some adaptors is not a big performance issue (it does incur a
987	hidden memory cost inside the kernel, though, that is not reflected in the	1373	hidden memory cost inside the kernel which is not reflected in the figures
988	figures above).	1374	above).
989		1375
990	C<POE>, regardless of underlying event loop (wether using its pure perl	1376	C<POE>, regardless of underlying event loop (whether using its pure perl
991	select-based backend or the Event module) shows abysmal performance and	1377	select-based backend or the Event module, the POE-EV backend couldn't
		1378	be tested because it wasn't working) shows abysmal performance and
992	memory usage: Watchers use almost 30 times as much memory as EV watchers,	1379	memory usage with AnyEvent: Watchers use almost 30 times as much memory
993	and 10 times as much memory as both Event or EV via AnyEvent. Watcher	1380	as EV watchers, and 10 times as much memory as Event (the high memory
		1381	requirements are caused by requiring a session for each watcher). Watcher
994	invocation is almost 900 times slower than with AnyEvent's pure perl	1382	invocation speed is almost 900 times slower than with AnyEvent's pure perl
		1383	implementation.
		1384
995	implementation. The design of the POE adaptor class in AnyEvent can not	1385	The design of the POE adaptor class in AnyEvent can not really account
996	really account for this, as session creation overhead is small compared	1386	for the performance issues, though, as session creation overhead is
997	to execution of the state machine, which is coded pretty optimally within	1387	small compared to execution of the state machine, which is coded pretty
998	L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow.	1388	optimally within L<AnyEvent::Impl::POE> (and while everybody agrees that
		1389	using multiple sessions is not a good approach, especially regarding
		1390	memory usage, even the author of POE could not come up with a faster
		1391	design).
999		1392
1000	=head2 Summary	1393	=head3 Summary
1001		1394
		1395	=over 4
		1396
1002	Using EV through AnyEvent is faster than any other event loop, but most	1397	=item * Using EV through AnyEvent is faster than any other event loop
1003	event loops have acceptable performance with or without AnyEvent.	1398	(even when used without AnyEvent), but most event loops have acceptable
		1399	performance with or without AnyEvent.
1004		1400
1005	The overhead AnyEvent adds is usually much smaller than the overhead of	1401	=item * The overhead AnyEvent adds is usually much smaller than the overhead of
1006	the actual event loop, only with extremely fast event loops such as the EV	1402	the actual event loop, only with extremely fast event loops such as EV
1007	adds AnyEvent significant overhead.	1403	adds AnyEvent significant overhead.
1008		1404
1009	And you should simply avoid POE like the plague if you want performance or	1405	=item * You should avoid POE like the plague if you want performance or
1010	reasonable memory usage.	1406	reasonable memory usage.
1011		1407
		1408	=back
		1409
		1410	=head2 BENCHMARKING THE LARGE SERVER CASE
		1411
		1412	This benchmark actually benchmarks the event loop itself. It works by
		1413	creating a number of "servers": each server consists of a socket pair, a
		1414	timeout watcher that gets reset on activity (but never fires), and an I/O
		1415	watcher waiting for input on one side of the socket. Each time the socket
		1416	watcher reads a byte it will write that byte to a random other "server".
		1417
		1418	The effect is that there will be a lot of I/O watchers, only part of which
		1419	are active at any one point (so there is a constant number of active
		1420	fds for each loop iteration, but which fds these are is random). The
		1421	timeout is reset each time something is read because that reflects how
		1422	most timeouts work (and puts extra pressure on the event loops).
		1423
		1424	In this benchmark, we use 10000 socket pairs (20000 sockets), of which 100
		1425	(1%) are active. This mirrors the activity of large servers with many
		1426	connections, most of which are idle at any one point in time.
		1427
		1428	Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
		1429	distribution.
		1430
		1431	=head3 Explanation of the columns
		1432
		1433	I<sockets> is the number of sockets, and twice the number of "servers" (as
		1434	each server has a read and write socket end).
		1435
		1436	I<create> is the time it takes to create a socket pair (which is
		1437	nontrivial) and two watchers: an I/O watcher and a timeout watcher.
		1438
		1439	I<request>, the most important value, is the time it takes to handle a
		1440	single "request", that is, reading the token from the pipe and forwarding
		1441	it to another server. This includes deleting the old timeout and creating
		1442	a new one that moves the timeout into the future.
		1443
		1444	=head3 Results
		1445
		1446	name sockets create request
		1447	EV 20000 69.01 11.16
		1448	Perl 20000 73.32 35.87
		1449	Event 20000 212.62 257.32
		1450	Glib 20000 651.16 1896.30
		1451	POE 20000 349.67 12317.24 uses POE::Loop::Event
		1452
		1453	=head3 Discussion
		1454
		1455	This benchmark I<does> measure scalability and overall performance of the
		1456	particular event loop.
		1457
		1458	EV is again fastest. Since it is using epoll on my system, the setup time
		1459	is relatively high, though.
		1460
		1461	Perl surprisingly comes second. It is much faster than the C-based event
		1462	loops Event and Glib.
		1463
		1464	Event suffers from high setup time as well (look at its code and you will
		1465	understand why). Callback invocation also has a high overhead compared to
		1466	the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
		1467	uses select or poll in basically all documented configurations.
		1468
		1469	Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
		1470	clearly fails to perform with many filehandles or in busy servers.
		1471
		1472	POE is still completely out of the picture, taking over 1000 times as long
		1473	as EV, and over 100 times as long as the Perl implementation, even though
		1474	it uses a C-based event loop in this case.
		1475
		1476	=head3 Summary
		1477
		1478	=over 4
		1479
		1480	=item * The pure perl implementation performs extremely well.
		1481
		1482	=item * Avoid Glib or POE in large projects where performance matters.
		1483
		1484	=back
		1485
		1486	=head2 BENCHMARKING SMALL SERVERS
		1487
		1488	While event loops should scale (and select-based ones do not...) even to
		1489	large servers, most programs we (or I :) actually write have only a few
		1490	I/O watchers.
		1491
		1492	In this benchmark, I use the same benchmark program as in the large server
		1493	case, but it uses only eight "servers", of which three are active at any
		1494	one time. This should reflect performance for a small server relatively
		1495	well.
		1496
		1497	The columns are identical to the previous table.
		1498
		1499	=head3 Results
		1500
		1501	name sockets create request
		1502	EV 16 20.00 6.54
		1503	Perl 16 25.75 12.62
		1504	Event 16 81.27 35.86
		1505	Glib 16 32.63 15.48
		1506	POE 16 261.87 276.28 uses POE::Loop::Event
		1507
		1508	=head3 Discussion
		1509
		1510	The benchmark tries to test the performance of a typical small
		1511	server. While knowing how various event loops perform is interesting, keep
		1512	in mind that their overhead in this case is usually not as important, due
		1513	to the small absolute number of watchers (that is, you need efficiency and
		1514	speed most when you have lots of watchers, not when you only have a few of
		1515	them).
		1516
		1517	EV is again fastest.
		1518
		1519	Perl again comes second. It is noticeably faster than the C-based event
		1520	loops Event and Glib, although the difference is too small to really
		1521	matter.
		1522
		1523	POE also performs much better in this case, but is is still far behind the
		1524	others.
		1525
		1526	=head3 Summary
		1527
		1528	=over 4
		1529
		1530	=item * C-based event loops perform very well with small number of
		1531	watchers, as the management overhead dominates.
		1532
		1533	=back
		1534
1012		1535
1013	=head1 FORK	1536	=head1 FORK
1014		1537
1015	Most event libraries are not fork-safe. The ones who are usually are	1538	Most event libraries are not fork-safe. The ones who are usually are
1016	because they are so inefficient. Only L<EV> is fully fork-aware.	1539	because they rely on inefficient but fork-safe C<select> or C<poll>
		1540	calls. Only L<EV> is fully fork-aware.
1017		1541
1018	If you have to fork, you must either do so I<before> creating your first	1542	If you have to fork, you must either do so I<before> creating your first
1019	watcher OR you must not use AnyEvent at all in the child.	1543	watcher OR you must not use AnyEvent at all in the child.
1020		1544
1021		1545
…		…
1033		1557
1034	BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }	1558	BEGIN { delete $ENV{PERL_ANYEVENT_MODEL} }
1035		1559
1036	use AnyEvent;	1560	use AnyEvent;
1037		1561
		1562	Similar considerations apply to $ENV{PERL_ANYEVENT_VERBOSE}, as that can
		1563	be used to probe what backend is used and gain other information (which is
		1564	probably even less useful to an attacker than PERL_ANYEVENT_MODEL).
		1565
1038		1566
1039	=head1 SEE ALSO	1567	=head1 SEE ALSO
1040		1568
1041	Event modules: L<Coro::EV>, L<EV>, L<EV::Glib>, L<Glib::EV>,	1569	Utility functions: L<AnyEvent::Util>.
1042	L<Coro::Event>, L<Event>, L<Glib::Event>, L<Glib>, L<Coro>, L<Tk>,	1570
		1571	Event modules: L<EV>, L<EV::Glib>, L<Glib::EV>, L<Event>, L<Glib::Event>,
1043	L<Event::Lib>, L<Qt>, L<POE>.	1572	L<Glib>, L<Tk>, L<Event::Lib>, L<Qt>, L<POE>.
1044		1573
1045	Implementations: L<AnyEvent::Impl::CoroEV>, L<AnyEvent::Impl::EV>,	1574	Implementations: L<AnyEvent::Impl::EV>, L<AnyEvent::Impl::Event>,
1046	L<AnyEvent::Impl::CoroEvent>, L<AnyEvent::Impl::Event>, L<AnyEvent::Impl::Glib>,	1575	L<AnyEvent::Impl::Glib>, L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>,
1047	L<AnyEvent::Impl::Tk>, L<AnyEvent::Impl::Perl>, L<AnyEvent::Impl::EventLib>,	1576	L<AnyEvent::Impl::EventLib>, L<AnyEvent::Impl::Qt>,
1048	L<AnyEvent::Impl::Qt>, L<AnyEvent::Impl::POE>.	1577	L<AnyEvent::Impl::POE>.
1049		1578
		1579	Non-blocking file handles, sockets, TCP clients and
		1580	servers: L<AnyEvent::Handle>, L<AnyEvent::Socket>.
		1581
		1582	Asynchronous DNS: L<AnyEvent::DNS>.
		1583
		1584	Coroutine support: L<Coro>, L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>,
		1585
1050	Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>.	1586	Nontrivial usage examples: L<Net::FCP>, L<Net::XMPP2>, L<AnyEvent::DNS>.
1051		1587
1052		1588
1053	=head1 AUTHOR	1589	=head1 AUTHOR
1054		1590
1055	Marc Lehmann <schmorp@schmorp.de>	1591	Marc Lehmann <schmorp@schmorp.de>

Diff Legend

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

Comparing AnyEvent/lib/AnyEvent.pm (file contents): Revision 1.84 by root, Fri Apr 25 13:48:42 2008 UTC vs. Revision 1.133 by root, Sun May 25 03:44:03 2008 UTC

Diff Legend

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.84 by root, Fri Apr 25 13:48:42 2008 UTC vs.
Revision 1.133 by root, Sun May 25 03:44:03 2008 UTC