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

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.70 by root, Fri Apr 25 07:25:44 2008 UTC vs.
Revision 1.97 by root, Sun Apr 27 03:31:53 2008 UTC

…		…
80	module.	80	module.
81		81
82	During the first call of any watcher-creation method, the module tries	82	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	83	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>,	84	following modules is already loaded: L<Coro::EV>, L<Coro::Event>, L<EV>,
85	L<Event>, L<Glib>, L<Tk>, L<AnyEvent::Impl::Perl>, L<Event::Lib>, L<Qt>,	85	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	86	L<POE>. The first one found is used. If none are found, the module tries
87	to load these modules (excluding Event::Lib, Qt and POE as the pure perl	87	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	88	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	89	be successfully loaded will be used. If, after this, still none could be
90	found, AnyEvent will fall back to a pure-perl event loop, which is not	90	found, AnyEvent will fall back to a pure-perl event loop, which is not
91	very efficient, but should work everywhere.	91	very efficient, but should work everywhere.
92		92
…		…
136		136
137	Note that C<my $w; $w => combination. This is necessary because in Perl,	137	Note that C<my $w; $w => combination. This is necessary because in Perl,
138	my variables are only visible after the statement in which they are	138	my variables are only visible after the statement in which they are
139	declared.	139	declared.
140		140
141	=head2 IO WATCHERS	141	=head2 I/O WATCHERS
142		142
143	You can create an I/O watcher by calling the C<< AnyEvent->io >> method	143	You can create an I/O watcher by calling the C<< AnyEvent->io >> method
144	with the following mandatory key-value pairs as arguments:	144	with the following mandatory key-value pairs as arguments:
145		145
146	C<fh> the Perl I<file handle> (I<not> file descriptor) to watch for	146	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	147	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,	148	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	149	respectively. C<cb> is the callback to invoke each time the file handle
150	becomes ready.	150	becomes ready.
151		151
152	As long as the I/O watcher exists it will keep the file descriptor or a	152	Although the callback might get passed parameters, their value and
153	copy of it alive/open.	153	presence is undefined and you cannot rely on them. Portable AnyEvent
		154	callbacks cannot use arguments passed to I/O watcher callbacks.
154		155
		156	The I/O watcher might use the underlying file descriptor or a copy of it.
155	It is not allowed to close a file handle as long as any watcher is active	157	You must not close a file handle as long as any watcher is active on the
156	on the underlying file descriptor.	158	underlying file descriptor.
157		159
158	Some event loops issue spurious readyness notifications, so you should	160	Some event loops issue spurious readyness notifications, so you should
159	always use non-blocking calls when reading/writing from/to your file	161	always use non-blocking calls when reading/writing from/to your file
160	handles.	162	handles.
161		163
…		…
172		174
173	You can create a time watcher by calling the C<< AnyEvent->timer >>	175	You can create a time watcher by calling the C<< AnyEvent->timer >>
174	method with the following mandatory arguments:	176	method with the following mandatory arguments:
175		177
176	C<after> specifies after how many seconds (fractional values are	178	C<after> specifies after how many seconds (fractional values are
177	supported) should the timer activate. C<cb> the callback to invoke in that	179	supported) the callback should be invoked. C<cb> is the callback to invoke
178	case.	180	in that case.
		181
		182	Although the callback might get passed parameters, their value and
		183	presence is undefined and you cannot rely on them. Portable AnyEvent
		184	callbacks cannot use arguments passed to time watcher callbacks.
179		185
180	The timer callback will be invoked at most once: if you want a repeating	186	The timer callback will be invoked at most once: if you want a repeating
181	timer you have to create a new watcher (this is a limitation by both Tk	187	timer you have to create a new watcher (this is a limitation by both Tk
182	and Glib).	188	and Glib).
183		189
…		…
228		234
229	You can watch for signals using a signal watcher, C<signal> is the signal	235	You can watch for signals using a signal watcher, C<signal> is the signal
230	I<name> without any C<SIG> prefix, C<cb> is the Perl callback to	236	I<name> without any C<SIG> prefix, C<cb> is the Perl callback to
231	be invoked whenever a signal occurs.	237	be invoked whenever a signal occurs.
232		238
		239	Although the callback might get passed parameters, their value and
		240	presence is undefined and you cannot rely on them. Portable AnyEvent
		241	callbacks cannot use arguments passed to signal watcher callbacks.
		242
233	Multiple signal occurances can be clumped together into one callback	243	Multiple signal occurances can be clumped together into one callback
234	invocation, and callback invocation will be synchronous. synchronous means	244	invocation, and callback invocation will be synchronous. synchronous means
235	that it might take a while until the signal gets handled by the process,	245	that it might take a while until the signal gets handled by the process,
236	but it is guarenteed not to interrupt any other callbacks.	246	but it is guarenteed not to interrupt any other callbacks.
237		247
…		…
251		261
252	The child process is specified by the C<pid> argument (if set to C<0>, it	262	The child process is specified by the C<pid> argument (if set to C<0>, it
253	watches for any child process exit). The watcher will trigger as often	263	watches for any child process exit). The watcher will trigger as often
254	as status change for the child are received. This works by installing a	264	as status change for the child are received. This works by installing a
255	signal handler for C<SIGCHLD>. The callback will be called with the pid	265	signal handler for C<SIGCHLD>. The callback will be called with the pid
256	and exit status (as returned by waitpid).	266	and exit status (as returned by waitpid), so unlike other watcher types,
		267	you I<can> rely on child watcher callback arguments.
257		268
258	Example: wait for pid 1333	269	There is a slight catch to child watchers, however: you usually start them
		270	I<after> the child process was created, and this means the process could
		271	have exited already (and no SIGCHLD will be sent anymore).
		272
		273	Not all event models handle this correctly (POE doesn't), but even for
		274	event models that I<do> handle this correctly, they usually need to be
		275	loaded before the process exits (i.e. before you fork in the first place).
		276
		277	This means you cannot create a child watcher as the very first thing in an
		278	AnyEvent program, you I<have> to create at least one watcher before you
		279	C<fork> the child (alternatively, you can call C<AnyEvent::detect>).
		280
		281	Example: fork a process and wait for it
		282
		283	my $done = AnyEvent->condvar;
		284
		285	AnyEvent::detect; # force event module to be initialised
		286
		287	my $pid = fork or exit 5;
259		288
260	my $w = AnyEvent->child (	289	my $w = AnyEvent->child (
261	pid => 1333,	290	pid => $pid,
262	cb => sub {	291	cb => sub {
263	my ($pid, $status) = @_;	292	my ($pid, $status) = @_;
264	warn "pid $pid exited with status $status";	293	warn "pid $pid exited with status $status";
		294	$done->broadcast;
265	},	295	},
266	);	296	);
		297
		298	# do something else, then wait for process exit
		299	$done->wait;
267		300
268	=head2 CONDITION VARIABLES	301	=head2 CONDITION VARIABLES
269		302
270	Condition variables can be created by calling the C<< AnyEvent->condvar >>	303	Condition variables can be created by calling the C<< AnyEvent->condvar >>
271	method without any arguments.	304	method without any arguments.
…		…
359	AnyEvent::Impl::CoroEV based on Coro::EV, best choice.	392	AnyEvent::Impl::CoroEV based on Coro::EV, best choice.
360	AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.	393	AnyEvent::Impl::CoroEvent based on Coro::Event, second best choice.
361	AnyEvent::Impl::EV based on EV (an interface to libev, best choice).	394	AnyEvent::Impl::EV based on EV (an interface to libev, best choice).
362	AnyEvent::Impl::Event based on Event, second best choice.	395	AnyEvent::Impl::Event based on Event, second best choice.
363	AnyEvent::Impl::Glib based on Glib, third-best choice.	396	AnyEvent::Impl::Glib based on Glib, third-best choice.
		397	AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
364	AnyEvent::Impl::Tk based on Tk, very bad choice.	398	AnyEvent::Impl::Tk based on Tk, very bad choice.
365	AnyEvent::Impl::Perl pure-perl implementation, inefficient but portable.
366	AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).	399	AnyEvent::Impl::Qt based on Qt, cannot be autoprobed (see its docs).
367	AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.	400	AnyEvent::Impl::EventLib based on Event::Lib, leaks memory and worse.
368	AnyEvent::Impl::POE based on POE, not generic enough for full support.	401	AnyEvent::Impl::POE based on POE, not generic enough for full support.
369		402
370	There is no support for WxWidgets, as WxWidgets has no support for	403	There is no support for WxWidgets, as WxWidgets has no support for
…		…
706		739
707	=back	740	=back
708		741
709	=head1 EXAMPLE PROGRAM	742	=head1 EXAMPLE PROGRAM
710		743
711	The following program uses an IO watcher to read data from STDIN, a timer	744	The following program uses an I/O watcher to read data from STDIN, a timer
712	to display a message once per second, and a condition variable to quit the	745	to display a message once per second, and a condition variable to quit the
713	program when the user enters quit:	746	program when the user enters quit:
714		747
715	use AnyEvent;	748	use AnyEvent;
716		749
…		…
861	});	894	});
862		895
863	$quit->wait;	896	$quit->wait;
864		897
865		898
866	=head1 BENCHMARK	899	=head1 BENCHMARKS
867		900
868	To give you an idea of the performance and overheads that AnyEvent adds	901	To give you an idea of the performance and overheads that AnyEvent adds
869	over the event loops directly, here is a benchmark of various supported	902	over the event loops themselves and to give you an impression of the speed
870	event models natively and with anyevent. The benchmark creates a lot of	903	of various event loops I prepared some benchmarks.
871	timers (with a zero timeout) and io watchers (watching STDOUT, a pty, to	904
		905	=head2 BENCHMARKING ANYEVENT OVERHEAD
		906
		907	Here is a benchmark of various supported event models used natively and
		908	through anyevent. The benchmark creates a lot of timers (with a zero
		909	timeout) and I/O watchers (watching STDOUT, a pty, to become writable,
872	become writable, which it is), lets them fire exactly once and destroys	910	which it is), lets them fire exactly once and destroys them again.
873	them again.
874		911
		912	Source code for this benchmark is found as F<eg/bench> in the AnyEvent
		913	distribution.
		914
875	=head2 Explanation of the columns	915	=head3 Explanation of the columns
876		916
877	I<watcher> is the number of event watchers created/destroyed. Since	917	I<watcher> is the number of event watchers created/destroyed. Since
878	different event models feature vastly different performances, each event	918	different event models feature vastly different performances, each event
879	loop was given a number of watchers so that overall runtime is acceptable	919	loop was given a number of watchers so that overall runtime is acceptable
880	and similar between tested event loop (and keep them from crashing): Glib	920	and similar between tested event loop (and keep them from crashing): Glib
…		…
893	I<invoke> is the time, in microseconds, used to invoke a simple	933	I<invoke> is the time, in microseconds, used to invoke a simple
894	callback. The callback simply counts down a Perl variable and after it was	934	callback. The callback simply counts down a Perl variable and after it was
895	invoked "watcher" times, it would C<< ->broadcast >> a condvar once to	935	invoked "watcher" times, it would C<< ->broadcast >> a condvar once to
896	signal the end of this phase.	936	signal the end of this phase.
897		937
898	I<destroy> is the time, in microseconds, that it takes destroy a single	938	I<destroy> is the time, in microseconds, that it takes to destroy a single
899	watcher.	939	watcher.
900		940
901	=head2 Results	941	=head3 Results
902		942
903	name watcher bytes create invoke destroy comment	943	name watchers bytes create invoke destroy comment
904	EV/EV 400000 244 0.56 0.46 0.31 EV native interface	944	EV/EV 400000 244 0.56 0.46 0.31 EV native interface
905	EV/Any 100000 610 3.52 0.91 0.75 EV + AnyEvent watchers	945	EV/Any 100000 244 2.50 0.46 0.29 EV + AnyEvent watchers
906	CoroEV/Any 100000 610 3.49 0.92 0.75 coroutines + Coro::Signal	946	CoroEV/Any 100000 244 2.49 0.44 0.29 coroutines + Coro::Signal
907	Perl/Any 16000 654 4.64 1.22 0.77 pure perl implementation	947	Perl/Any 100000 513 4.92 0.87 1.12 pure perl implementation
908	Event/Event 16000 523 28.05 21.38 0.86 Event native interface	948	Event/Event 16000 516 31.88 31.30 0.85 Event native interface
909	Event/Any 16000 943 34.43 20.48 1.39 Event + AnyEvent watchers	949	Event/Any 16000 936 39.17 33.63 1.43 Event + AnyEvent watchers
910	Glib/Any 16000 1357 96.99 12.55 55.51 quadratic behaviour	950	Glib/Any 16000 1357 98.22 12.41 54.00 quadratic behaviour
911	Tk/Any 2000 1855 27.01 66.61 14.03 SEGV with >> 2000 watchers	951	Tk/Any 2000 1860 26.97 67.98 14.00 SEGV with >> 2000 watchers
912	POE/Event 2000 6644 108.15 768.19 14.33 via POE::Loop::Event	952	POE/Event 2000 6644 108.64 736.02 14.73 via POE::Loop::Event
913	POE/Select 2000 6343 94.69 807.65 562.69 via POE::Loop::Select	953	POE/Select 2000 6343 94.13 809.12 565.96 via POE::Loop::Select
914		954
915	=head2 Discussion	955	=head3 Discussion
916		956
917	The benchmark does I<not> measure scalability of the event loop very	957	The benchmark does I<not> measure scalability of the event loop very
918	well. For example, a select-based event loop (such as the pure perl one)	958	well. For example, a select-based event loop (such as the pure perl one)
919	can never compete with an event loop that uses epoll when the number of	959	can never compete with an event loop that uses epoll when the number of
920	file descriptors grows high. In this benchmark, only a single filehandle	960	file descriptors grows high. In this benchmark, all events become ready at
921	is used (although some of the AnyEvent adaptors dup() its file descriptor	961	the same time, so select/poll-based implementations get an unnatural speed
922	to worka round bugs).	962	boost.
		963
		964	Also, note that the number of watchers usually has a nonlinear effect on
		965	overall speed, that is, creating twice as many watchers doesn't take twice
		966	the time - usually it takes longer. This puts event loops tested with a
		967	higher number of watchers at a disadvantage.
		968
		969	To put the range of results into perspective, consider that on the
		970	benchmark machine, handling an event takes roughly 1600 CPU cycles with
		971	EV, 3100 CPU cycles with AnyEvent's pure perl loop and almost 3000000 CPU
		972	cycles with POE.
923		973
924	C<EV> is the sole leader regarding speed and memory use, which are both	974	C<EV> is the sole leader regarding speed and memory use, which are both
925	maximal/minimal, respectively. Even when going through AnyEvent, there is	975	maximal/minimal, respectively. Even when going through AnyEvent, it uses
926	only one event loop that uses less memory (the C<Event> module natively), and	976	far less memory than any other event loop and is still faster than Event
927	no faster event model, not event C<Event> natively.	977	natively.
928		978
929	The pure perl implementation is hit in a few sweet spots (both the	979	The pure perl implementation is hit in a few sweet spots (both the
930	zero timeout and the use of a single fd hit optimisations in the perl	980	constant timeout and the use of a single fd hit optimisations in the perl
931	interpreter and the backend itself). Nevertheless tis shows that it	981	interpreter and the backend itself). Nevertheless this shows that it
932	adds very little overhead in itself. Like any select-based backend its	982	adds very little overhead in itself. Like any select-based backend its
933	performance becomes really bad with lots of file descriptors, of course,	983	performance becomes really bad with lots of file descriptors (and few of
934	but this was not subjetc of this benchmark.	984	them active), of course, but this was not subject of this benchmark.
935		985
936	The C<Event> module has a relatively high setup and callback invocation cost,	986	The C<Event> module has a relatively high setup and callback invocation
937	but overall scores on the third place.	987	cost, but overall scores in on the third place.
938		988
939	C<Glib>'s memory usage is quite a bit bit higher, features a faster	989	C<Glib>'s memory usage is quite a bit higher, but it features a
940	callback invocation and overall lands in the same class as C<Event>.	990	faster callback invocation and overall ends up in the same class as
		991	C<Event>. However, Glib scales extremely badly, doubling the number of
		992	watchers increases the processing time by more than a factor of four,
		993	making it completely unusable when using larger numbers of watchers
		994	(note that only a single file descriptor was used in the benchmark, so
		995	inefficiencies of C<poll> do not account for this).
941		996
942	The C<Tk> adaptor works relatively well, the fact that it crashes with	997	The C<Tk> adaptor works relatively well. The fact that it crashes with
943	more than 2000 watchers is a big setback, however, as correctness takes	998	more than 2000 watchers is a big setback, however, as correctness takes
944	precedence over speed. Nevertheless, its performance is surprising, as the	999	precedence over speed. Nevertheless, its performance is surprising, as the
945	file descriptor is dup()ed for each watcher. This shows that the dup()	1000	file descriptor is dup()ed for each watcher. This shows that the dup()
946	employed by some adaptors is not a big performance issue (it does incur a	1001	employed by some adaptors is not a big performance issue (it does incur a
947	hidden memory cost inside the kernel, though).	1002	hidden memory cost inside the kernel which is not reflected in the figures
		1003	above).
948		1004
949	C<POE>, regardless of backend (wether using its pure perl select-based	1005	C<POE>, regardless of underlying event loop (whether using its pure
950	backend or the Event backend) shows abysmal performance and memory	1006	perl select-based backend or the Event module, the POE-EV backend
		1007	couldn't be tested because it wasn't working) shows abysmal performance
951	usage: Watchers use almost 30 times as much memory as EV watchers, and 10	1008	and memory usage: Watchers use almost 30 times as much memory as
952	times as much memory as both Event or EV via AnyEvent. Watcher invocation	1009	EV watchers, and 10 times as much memory as Event (the high memory
953	is almost 700 times slower as with AnyEvent's pure perl implementation.	1010	requirements are caused by requiring a session for each watcher). Watcher
		1011	invocation speed is almost 900 times slower than with AnyEvent's pure perl
		1012	implementation. The design of the POE adaptor class in AnyEvent can not
		1013	really account for this, as session creation overhead is small compared
		1014	to execution of the state machine, which is coded pretty optimally within
		1015	L<AnyEvent::Impl::POE>. POE simply seems to be abysmally slow.
954		1016
		1017	=head3 Summary
		1018
		1019	=over 4
		1020
955	Summary: using EV through AnyEvent is faster than any other event	1021	=item * Using EV through AnyEvent is faster than any other event loop
956	loop. The overhead AnyEvent adds can be very small, and you should avoid	1022	(even when used without AnyEvent), but most event loops have acceptable
957	POE like the plague if you want performance or reasonable memory usage.	1023	performance with or without AnyEvent.
		1024
		1025	=item * The overhead AnyEvent adds is usually much smaller than the overhead of
		1026	the actual event loop, only with extremely fast event loops such as EV
		1027	adds AnyEvent significant overhead.
		1028
		1029	=item * You should avoid POE like the plague if you want performance or
		1030	reasonable memory usage.
		1031
		1032	=back
		1033
		1034	=head2 BENCHMARKING THE LARGE SERVER CASE
		1035
		1036	This benchmark atcually benchmarks the event loop itself. It works by
		1037	creating a number of "servers": each server consists of a socketpair, a
		1038	timeout watcher that gets reset on activity (but never fires), and an I/O
		1039	watcher waiting for input on one side of the socket. Each time the socket
		1040	watcher reads a byte it will write that byte to a random other "server".
		1041
		1042	The effect is that there will be a lot of I/O watchers, only part of which
		1043	are active at any one point (so there is a constant number of active
		1044	fds for each loop iterstaion, but which fds these are is random). The
		1045	timeout is reset each time something is read because that reflects how
		1046	most timeouts work (and puts extra pressure on the event loops).
		1047
		1048	In this benchmark, we use 10000 socketpairs (20000 sockets), of which 100
		1049	(1%) are active. This mirrors the activity of large servers with many
		1050	connections, most of which are idle at any one point in time.
		1051
		1052	Source code for this benchmark is found as F<eg/bench2> in the AnyEvent
		1053	distribution.
		1054
		1055	=head3 Explanation of the columns
		1056
		1057	I<sockets> is the number of sockets, and twice the number of "servers" (as
		1058	each server has a read and write socket end).
		1059
		1060	I<create> is the time it takes to create a socketpair (which is
		1061	nontrivial) and two watchers: an I/O watcher and a timeout watcher.
		1062
		1063	I<request>, the most important value, is the time it takes to handle a
		1064	single "request", that is, reading the token from the pipe and forwarding
		1065	it to another server. This includes deleting the old timeout and creating
		1066	a new one that moves the timeout into the future.
		1067
		1068	=head3 Results
		1069
		1070	name sockets create request
		1071	EV 20000 69.01 11.16
		1072	Perl 20000 75.28 112.76
		1073	Event 20000 212.62 257.32
		1074	Glib 20000 651.16 1896.30
		1075	POE 20000 349.67 12317.24 uses POE::Loop::Event
		1076
		1077	=head3 Discussion
		1078
		1079	This benchmark I<does> measure scalability and overall performance of the
		1080	particular event loop.
		1081
		1082	EV is again fastest. Since it is using epoll on my system, the setup time
		1083	is relatively high, though.
		1084
		1085	Perl surprisingly comes second. It is much faster than the C-based event
		1086	loops Event and Glib.
		1087
		1088	Event suffers from high setup time as well (look at its code and you will
		1089	understand why). Callback invocation also has a high overhead compared to
		1090	the C<< $_->() for .. >>-style loop that the Perl event loop uses. Event
		1091	uses select or poll in basically all documented configurations.
		1092
		1093	Glib is hit hard by its quadratic behaviour w.r.t. many watchers. It
		1094	clearly fails to perform with many filehandles or in busy servers.
		1095
		1096	POE is still completely out of the picture, taking over 1000 times as long
		1097	as EV, and over 100 times as long as the Perl implementation, even though
		1098	it uses a C-based event loop in this case.
		1099
		1100	=head3 Summary
		1101
		1102	=over 4
		1103
		1104	=item * The pure perl implementation performs extremely well, considering
		1105	that it uses select.
		1106
		1107	=item * Avoid Glib or POE in large projects where performance matters.
		1108
		1109	=back
		1110
		1111	=head2 BENCHMARKING SMALL SERVERS
		1112
		1113	While event loops should scale (and select-based ones do not...) even to
		1114	large servers, most programs we (or I :) actually write have only a few
		1115	I/O watchers.
		1116
		1117	In this benchmark, I use the same benchmark program as in the large server
		1118	case, but it uses only eight "servers", of which three are active at any
		1119	one time. This should reflect performance for a small server relatively
		1120	well.
		1121
		1122	The columns are identical to the previous table.
		1123
		1124	=head3 Results
		1125
		1126	name sockets create request
		1127	EV 16 20.00 6.54
		1128	Event 16 81.27 35.86
		1129	Glib 16 32.63 15.48
		1130	Perl 16 24.62 162.37
		1131	POE 16 261.87 276.28 uses POE::Loop::Event
		1132
		1133	=head3 Discussion
		1134
		1135	The benchmark tries to test the performance of a typical small
		1136	server. While knowing how various event loops perform is interesting, keep
		1137	in mind that their overhead in this case is usually not as important, due
		1138	to the small absolute number of watchers (that is, you need efficiency and
		1139	speed most when you have lots of watchers, not when you only have a few of
		1140	them).
		1141
		1142	EV is again fastest.
		1143
		1144	The C-based event loops Event and Glib come in second this time, as the
		1145	overhead of running an iteration is much smaller in C than in Perl (little
		1146	code to execute in the inner loop, and perl's function calling overhead is
		1147	high, and updating all the data structures is costly).
		1148
		1149	The pure perl event loop is much slower, but still competitive.
		1150
		1151	POE also performs much better in this case, but is is still far behind the
		1152	others.
		1153
		1154	=head3 Summary
		1155
		1156	=over 4
		1157
		1158	=item * C-based event loops perform very well with small number of
		1159	watchers, as the management overhead dominates.
		1160
		1161	=back
958		1162
959		1163
960	=head1 FORK	1164	=head1 FORK
961		1165
962	Most event libraries are not fork-safe. The ones who are usually are	1166	Most event libraries are not fork-safe. The ones who are usually are

Diff Legend

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

Comparing AnyEvent/lib/AnyEvent.pm (file contents): Revision 1.70 by root, Fri Apr 25 07:25:44 2008 UTC vs. Revision 1.97 by root, Sun Apr 27 03:31:53 2008 UTC

Diff Legend

Comparing AnyEvent/lib/AnyEvent.pm (file contents):
Revision 1.70 by root, Fri Apr 25 07:25:44 2008 UTC vs.
Revision 1.97 by root, Sun Apr 27 03:31:53 2008 UTC