[ViewVC] Diff of: cvs/Coro/Coro.pm

Comparing Coro/Coro.pm (file contents):
Revision 1.237 by root, Sat Nov 22 16:37:11 2008 UTC vs.
Revision 1.268 by root, Thu Oct 1 23:16:27 2009 UTC

…		…
1	=head1 NAME	1	=head1 NAME
2		2
3	Coro - real threads in perl	3	Coro - the only real threads in perl
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
7	use Coro;	7	use Coro;
8		8
11	print "2\n";	11	print "2\n";
12	cede; # yield back to main	12	cede; # yield back to main
13	print "4\n";	13	print "4\n";
14	};	14	};
15	print "1\n";	15	print "1\n";
16	cede; # yield to coroutine	16	cede; # yield to coro
17	print "3\n";	17	print "3\n";
18	cede; # and again	18	cede; # and again
19		19
20	# use locking	20	# use locking
21	use Coro::Semaphore;	21	use Coro::Semaphore;
…		…
29	=head1 DESCRIPTION	29	=head1 DESCRIPTION
30		30
31	For a tutorial-style introduction, please read the L<Coro::Intro>	31	For a tutorial-style introduction, please read the L<Coro::Intro>
32	manpage. This manpage mainly contains reference information.	32	manpage. This manpage mainly contains reference information.
33		33
34	This module collection manages coroutines, that is, cooperative	34	This module collection manages continuations in general, most often in
35	threads. Coroutines are similar to kernel threads but don't (in general)	35	the form of cooperative threads (also called coros, or simply "coro"
		36	in the documentation). They are similar to kernel threads but don't (in
36	run in parallel at the same time even on SMP machines. The specific flavor	37	general) run in parallel at the same time even on SMP machines. The
37	of coroutine used in this module also guarantees you that it will not	38	specific flavor of thread offered by this module also guarantees you that
38	switch between coroutines unless necessary, at easily-identified points	39	it will not switch between threads unless necessary, at easily-identified
39	in your program, so locking and parallel access are rarely an issue,	40	points in your program, so locking and parallel access are rarely an
40	making coroutine programming much safer and easier than using other thread	41	issue, making thread programming much safer and easier than using other
41	models.	42	thread models.
42		43
43	Unlike the so-called "Perl threads" (which are not actually real threads	44	Unlike the so-called "Perl threads" (which are not actually real threads
44	but only the windows process emulation ported to unix), Coro provides a	45	but only the windows process emulation (see section of same name for more
		46	details) ported to unix, and as such act as processes), Coro provides
45	full shared address space, which makes communication between coroutines	47	a full shared address space, which makes communication between threads
46	very easy. And coroutines are fast, too: disabling the Windows process	48	very easy. And Coro's threads are fast, too: disabling the Windows
47	emulation code in your perl and using Coro can easily result in a two to	49	process emulation code in your perl and using Coro can easily result in
48	four times speed increase for your programs.	50	a two to four times speed increase for your programs. A parallel matrix
		51	multiplication benchmark runs over 300 times faster on a single core than
		52	perl's pseudo-threads on a quad core using all four cores.
49		53
50	Coro achieves that by supporting multiple running interpreters that share	54	Coro achieves that by supporting multiple running interpreters that share
51	data, which is especially useful to code pseudo-parallel processes and	55	data, which is especially useful to code pseudo-parallel processes and
52	for event-based programming, such as multiple HTTP-GET requests running	56	for event-based programming, such as multiple HTTP-GET requests running
53	concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro	57	concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
54	into an event-based environment.	58	into an event-based environment.
55		59
56	In this module, a coroutines is defined as "callchain + lexical variables	60	In this module, a thread is defined as "callchain + lexical variables +
57	+ @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own	61	some package variables + C stack), that is, a thread has its own callchain,
58	callchain, its own set of lexicals and its own set of perls most important	62	its own set of lexicals and its own set of perls most important global
59	global variables (see L<Coro::State> for more configuration and background	63	variables (see L<Coro::State> for more configuration and background info).
60	info).
61		64
62	See also the C<SEE ALSO> section at the end of this document - the Coro	65	See also the C<SEE ALSO> section at the end of this document - the Coro
63	module family is quite large.	66	module family is quite large.
64		67
65	=cut	68	=cut
66		69
67	package Coro;	70	package Coro;
68		71
69	use strict qw(vars subs);	72	use common::sense;
70	no warnings "uninitialized";	73
		74	use Carp ();
		75
		76	use Guard ();
71		77
72	use Coro::State;	78	use Coro::State;
73		79
74	use base qw(Coro::State Exporter);	80	use base qw(Coro::State Exporter);
75		81
76	our $idle; # idle handler	82	our $idle; # idle handler
77	our $main; # main coroutine	83	our $main; # main coro
78	our $current; # current coroutine	84	our $current; # current coro
79		85
80	our $VERSION = "5.0";	86	our $VERSION = 5.17;
81		87
82	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);	88	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
83	our %EXPORT_TAGS = (	89	our %EXPORT_TAGS = (
84	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	90	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
85	);	91	);
…		…
89		95
90	=over 4	96	=over 4
91		97
92	=item $Coro::main	98	=item $Coro::main
93		99
94	This variable stores the coroutine object that represents the main	100	This variable stores the Coro object that represents the main
95	program. While you cna C<ready> it and do most other things you can do to	101	program. While you cna C<ready> it and do most other things you can do to
96	coroutines, it is mainly useful to compare again C<$Coro::current>, to see	102	coro, it is mainly useful to compare again C<$Coro::current>, to see
97	whether you are running in the main program or not.	103	whether you are running in the main program or not.
98		104
99	=cut	105	=cut
100		106
101	# $main is now being initialised by Coro::State	107	# $main is now being initialised by Coro::State
102		108
103	=item $Coro::current	109	=item $Coro::current
104		110
105	The coroutine object representing the current coroutine (the last	111	The Coro object representing the current coro (the last
106	coroutine that the Coro scheduler switched to). The initial value is	112	coro that the Coro scheduler switched to). The initial value is
107	C<$Coro::main> (of course).	113	C<$Coro::main> (of course).
108		114
109	This variable is B<strictly> I<read-only>. You can take copies of the	115	This variable is B<strictly> I<read-only>. You can take copies of the
110	value stored in it and use it as any other coroutine object, but you must	116	value stored in it and use it as any other Coro object, but you must
111	not otherwise modify the variable itself.	117	not otherwise modify the variable itself.
112		118
113	=cut	119	=cut
114		120
115	sub current() { $current } # [DEPRECATED]	121	sub current() { $current } # [DEPRECATED]
116		122
117	=item $Coro::idle	123	=item $Coro::idle
118		124
119	This variable is mainly useful to integrate Coro into event loops. It is	125	This variable is mainly useful to integrate Coro into event loops. It is
120	usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is	126	usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
121	pretty low-level functionality.	127	pretty low-level functionality.
122		128
123	This variable stores a callback that is called whenever the scheduler	129	This variable stores either a Coro object or a callback.
		130
		131	If it is a callback, the it is called whenever the scheduler finds no
124	finds no ready coroutines to run. The default implementation prints	132	ready coros to run. The default implementation prints "FATAL:
125	"FATAL: deadlock detected" and exits, because the program has no other way	133	deadlock detected" and exits, because the program has no other way to
126	to continue.	134	continue.
127		135
		136	If it is a coro object, then this object will be readied (without
		137	invoking any ready hooks, however) when the scheduler finds no other ready
		138	coros to run.
		139
128	This hook is overwritten by modules such as C<Coro::Timer> and	140	This hook is overwritten by modules such as C<Coro::EV> and
129	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a	141	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
130	coroutine so the scheduler can run it.	142	coro so the scheduler can run it.
131		143
132	Note that the callback I<must not>, under any circumstances, block	144	Note that the callback I<must not>, under any circumstances, block
133	the current coroutine. Normally, this is achieved by having an "idle	145	the current coro. Normally, this is achieved by having an "idle
134	coroutine" that calls the event loop and then blocks again, and then	146	coro" that calls the event loop and then blocks again, and then
135	readying that coroutine in the idle handler.	147	readying that coro in the idle handler, or by simply placing the idle
		148	coro in this variable.
136		149
137	See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this	150	See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
138	technique.	151	technique.
139		152
140	Please note that if your callback recursively invokes perl (e.g. for event	153	Please note that if your callback recursively invokes perl (e.g. for event
141	handlers), then it must be prepared to be called recursively itself.	154	handlers), then it must be prepared to be called recursively itself.
142		155
143	=cut	156	=cut
144		157
145	$idle = sub {	158	$idle = sub {
146	require Carp;	159	warn "oi\n";#d#
147	Carp::croak ("FATAL: deadlock detected");	160	Carp::confess ("FATAL: deadlock detected");
148	};	161	};
149		162
150	# this coroutine is necessary because a coroutine	163	# this coro is necessary because a coro
151	# cannot destroy itself.	164	# cannot destroy itself.
152	our @destroy;	165	our @destroy;
153	our $manager;	166	our $manager;
154		167
155	$manager = new Coro sub {	168	$manager = new Coro sub {
156	while () {	169	while () {
157	Coro::_cancel shift @destroy	170	Coro::State::cancel shift @destroy
158	while @destroy;	171	while @destroy;
159		172
160	&schedule;	173	&schedule;
161	}	174	}
162	};	175	};
163	$manager->{desc} = "[coro manager]";	176	$manager->{desc} = "[coro manager]";
164	$manager->prio (PRIO_MAX);	177	$manager->prio (PRIO_MAX);
165		178
166	=back	179	=back
167		180
168	=head1 SIMPLE COROUTINE CREATION	181	=head1 SIMPLE CORO CREATION
169		182
170	=over 4	183	=over 4
171		184
172	=item async { ... } [@args...]	185	=item async { ... } [@args...]
173		186
174	Create a new coroutine and return it's coroutine object (usually	187	Create a new coro and return its Coro object (usually
175	unused). The coroutine will be put into the ready queue, so	188	unused). The coro will be put into the ready queue, so
176	it will start running automatically on the next scheduler run.	189	it will start running automatically on the next scheduler run.
177		190
178	The first argument is a codeblock/closure that should be executed in the	191	The first argument is a codeblock/closure that should be executed in the
179	coroutine. When it returns argument returns the coroutine is automatically	192	coro. When it returns argument returns the coro is automatically
180	terminated.	193	terminated.
181		194
182	The remaining arguments are passed as arguments to the closure.	195	The remaining arguments are passed as arguments to the closure.
183		196
184	See the C<Coro::State::new> constructor for info about the coroutine	197	See the C<Coro::State::new> constructor for info about the coro
185	environment in which coroutines are executed.	198	environment in which coro are executed.
186		199
187	Calling C<exit> in a coroutine will do the same as calling exit outside	200	Calling C<exit> in a coro will do the same as calling exit outside
188	the coroutine. Likewise, when the coroutine dies, the program will exit,	201	the coro. Likewise, when the coro dies, the program will exit,
189	just as it would in the main program.	202	just as it would in the main program.
190		203
191	If you do not want that, you can provide a default C<die> handler, or	204	If you do not want that, you can provide a default C<die> handler, or
192	simply avoid dieing (by use of C<eval>).	205	simply avoid dieing (by use of C<eval>).
193		206
194	Example: Create a new coroutine that just prints its arguments.	207	Example: Create a new coro that just prints its arguments.
195		208
196	async {	209	async {
197	print "@_\n";	210	print "@_\n";
198	} 1,2,3,4;	211	} 1,2,3,4;
199		212
200	=cut
201
202	sub async(&@) {
203	my $coro = new Coro @_;
204	$coro->ready;
205	$coro
206	}
207
208	=item async_pool { ... } [@args...]	213	=item async_pool { ... } [@args...]
209		214
210	Similar to C<async>, but uses a coroutine pool, so you should not call	215	Similar to C<async>, but uses a coro pool, so you should not call
211	terminate or join on it (although you are allowed to), and you get a	216	terminate or join on it (although you are allowed to), and you get a
212	coroutine that might have executed other code already (which can be good	217	coro that might have executed other code already (which can be good
213	or bad :).	218	or bad :).
214		219
215	On the plus side, this function is about twice as fast as creating (and	220	On the plus side, this function is about twice as fast as creating (and
216	destroying) a completely new coroutine, so if you need a lot of generic	221	destroying) a completely new coro, so if you need a lot of generic
217	coroutines in quick successsion, use C<async_pool>, not C<async>.	222	coros in quick successsion, use C<async_pool>, not C<async>.
218		223
219	The code block is executed in an C<eval> context and a warning will be	224	The code block is executed in an C<eval> context and a warning will be
220	issued in case of an exception instead of terminating the program, as	225	issued in case of an exception instead of terminating the program, as
221	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>	226	C<async> does. As the coro is being reused, stuff like C<on_destroy>
222	will not work in the expected way, unless you call terminate or cancel,	227	will not work in the expected way, unless you call terminate or cancel,
223	which somehow defeats the purpose of pooling (but is fine in the	228	which somehow defeats the purpose of pooling (but is fine in the
224	exceptional case).	229	exceptional case).
225		230
226	The priority will be reset to C<0> after each run, tracing will be	231	The priority will be reset to C<0> after each run, tracing will be
227	disabled, the description will be reset and the default output filehandle	232	disabled, the description will be reset and the default output filehandle
228	gets restored, so you can change all these. Otherwise the coroutine will	233	gets restored, so you can change all these. Otherwise the coro will
229	be re-used "as-is": most notably if you change other per-coroutine global	234	be re-used "as-is": most notably if you change other per-coro global
230	stuff such as C<$/> you I<must needs> revert that change, which is most	235	stuff such as C<$/> you I<must needs> revert that change, which is most
231	simply done by using local as in: C<< local $/ >>.	236	simply done by using local as in: C<< local $/ >>.
232		237
233	The idle pool size is limited to C<8> idle coroutines (this can be	238	The idle pool size is limited to C<8> idle coros (this can be
234	adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle	239	adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
235	coros as required.	240	coros as required.
236		241
237	If you are concerned about pooled coroutines growing a lot because a	242	If you are concerned about pooled coros growing a lot because a
238	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool	243	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
239	{ terminate }> once per second or so to slowly replenish the pool. In	244	{ terminate }> once per second or so to slowly replenish the pool. In
240	addition to that, when the stacks used by a handler grows larger than 32kb	245	addition to that, when the stacks used by a handler grows larger than 32kb
241	(adjustable via $Coro::POOL_RSS) it will also be destroyed.	246	(adjustable via $Coro::POOL_RSS) it will also be destroyed.
242		247
…		…
259	=back	264	=back
260		265
261	=head1 STATIC METHODS	266	=head1 STATIC METHODS
262		267
263	Static methods are actually functions that implicitly operate on the	268	Static methods are actually functions that implicitly operate on the
264	current coroutine.	269	current coro.
265		270
266	=over 4	271	=over 4
267		272
268	=item schedule	273	=item schedule
269		274
270	Calls the scheduler. The scheduler will find the next coroutine that is	275	Calls the scheduler. The scheduler will find the next coro that is
271	to be run from the ready queue and switches to it. The next coroutine	276	to be run from the ready queue and switches to it. The next coro
272	to be run is simply the one with the highest priority that is longest	277	to be run is simply the one with the highest priority that is longest
273	in its ready queue. If there is no coroutine ready, it will clal the	278	in its ready queue. If there is no coro ready, it will clal the
274	C<$Coro::idle> hook.	279	C<$Coro::idle> hook.
275		280
276	Please note that the current coroutine will I<not> be put into the ready	281	Please note that the current coro will I<not> be put into the ready
277	queue, so calling this function usually means you will never be called	282	queue, so calling this function usually means you will never be called
278	again unless something else (e.g. an event handler) calls C<< ->ready >>,	283	again unless something else (e.g. an event handler) calls C<< ->ready >>,
279	thus waking you up.	284	thus waking you up.
280		285
281	This makes C<schedule> I<the> generic method to use to block the current	286	This makes C<schedule> I<the> generic method to use to block the current
282	coroutine and wait for events: first you remember the current coroutine in	287	coro and wait for events: first you remember the current coro in
283	a variable, then arrange for some callback of yours to call C<< ->ready	288	a variable, then arrange for some callback of yours to call C<< ->ready
284	>> on that once some event happens, and last you call C<schedule> to put	289	>> on that once some event happens, and last you call C<schedule> to put
285	yourself to sleep. Note that a lot of things can wake your coroutine up,	290	yourself to sleep. Note that a lot of things can wake your coro up,
286	so you need to check whether the event indeed happened, e.g. by storing the	291	so you need to check whether the event indeed happened, e.g. by storing the
287	status in a variable.	292	status in a variable.
288		293
289	See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.	294	See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
290		295
291	=item cede	296	=item cede
292		297
293	"Cede" to other coroutines. This function puts the current coroutine into	298	"Cede" to other coros. This function puts the current coro into
294	the ready queue and calls C<schedule>, which has the effect of giving	299	the ready queue and calls C<schedule>, which has the effect of giving
295	up the current "timeslice" to other coroutines of the same or higher	300	up the current "timeslice" to other coros of the same or higher
296	priority. Once your coroutine gets its turn again it will automatically be	301	priority. Once your coro gets its turn again it will automatically be
297	resumed.	302	resumed.
298		303
299	This function is often called C<yield> in other languages.	304	This function is often called C<yield> in other languages.
300		305
301	=item Coro::cede_notself	306	=item Coro::cede_notself
302		307
303	Works like cede, but is not exported by default and will cede to I<any>	308	Works like cede, but is not exported by default and will cede to I<any>
304	coroutine, regardless of priority. This is useful sometimes to ensure	309	coro, regardless of priority. This is useful sometimes to ensure
305	progress is made.	310	progress is made.
306		311
307	=item terminate [arg...]	312	=item terminate [arg...]
308		313
309	Terminates the current coroutine with the given status values (see L<cancel>).	314	Terminates the current coro with the given status values (see L<cancel>).
		315
		316	=item Coro::on_enter BLOCK, Coro::on_leave BLOCK
		317
		318	These function install enter and leave winders in the current scope. The
		319	enter block will be executed when on_enter is called and whenever the
		320	current coro is re-entered by the scheduler, while the leave block is
		321	executed whenever the current coro is blocked by the scheduler, and
		322	also when the containing scope is exited (by whatever means, be it exit,
		323	die, last etc.).
		324
		325	I<Neither invoking the scheduler, nor exceptions, are allowed within those
		326	BLOCKs>. That means: do not even think about calling C<die> without an
		327	eval, and do not even think of entering the scheduler in any way.
		328
		329	Since both BLOCKs are tied to the current scope, they will automatically
		330	be removed when the current scope exits.
		331
		332	These functions implement the same concept as C<dynamic-wind> in scheme
		333	does, and are useful when you want to localise some resource to a specific
		334	coro.
		335
		336	They slow down thread switching considerably for coros that use them
		337	(about 40% for a BLOCK with a single assignment, so thread switching is
		338	still reasonably fast if the handlers are fast).
		339
		340	These functions are best understood by an example: The following function
		341	will change the current timezone to "Antarctica/South_Pole", which
		342	requires a call to C<tzset>, but by using C<on_enter> and C<on_leave>,
		343	which remember/change the current timezone and restore the previous
		344	value, respectively, the timezone is only changed for the coro that
		345	installed those handlers.
		346
		347	use POSIX qw(tzset);
		348
		349	async {
		350	my $old_tz; # store outside TZ value here
		351
		352	Coro::on_enter {
		353	$old_tz = $ENV{TZ}; # remember the old value
		354
		355	$ENV{TZ} = "Antarctica/South_Pole";
		356	tzset; # enable new value
		357	};
		358
		359	Coro::on_leave {
		360	$ENV{TZ} = $old_tz;
		361	tzset; # restore old value
		362	};
		363
		364	# at this place, the timezone is Antarctica/South_Pole,
		365	# without disturbing the TZ of any other coro.
		366	};
		367
		368	This can be used to localise about any resource (locale, uid, current
		369	working directory etc.) to a block, despite the existance of other
		370	coros.
		371
		372	Another interesting example implements time-sliced multitasking using
		373	interval timers (this could obviously be optimised, but does the job):
		374
		375	# "timeslice" the given block
		376	sub timeslice(&) {
		377	use Time::HiRes ();
		378
		379	Coro::on_enter {
		380	# on entering the thread, we set an VTALRM handler to cede
		381	$SIG{VTALRM} = sub { cede };
		382	# and then start the interval timer
		383	Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0.01, 0.01;
		384	};
		385	Coro::on_leave {
		386	# on leaving the thread, we stop the interval timer again
		387	Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0, 0;
		388	};
		389
		390	&{+shift};
		391	}
		392
		393	# use like this:
		394	timeslice {
		395	# The following is an endless loop that would normally
		396	# monopolise the process. Since it runs in a timesliced
		397	# environment, it will regularly cede to other threads.
		398	while () { }
		399	};
		400
310		401
311	=item killall	402	=item killall
312		403
313	Kills/terminates/cancels all coroutines except the currently running	404	Kills/terminates/cancels all coros except the currently running one.
314	one. This is useful after a fork, either in the child or the parent, as
315	usually only one of them should inherit the running coroutines.
316		405
317	Note that while this will try to free some of the main programs resources,	406	Note that while this will try to free some of the main interpreter
		407	resources if the calling coro isn't the main coro, but one
318	you cannot free all of them, so if a coroutine that is not the main	408	cannot free all of them, so if a coro that is not the main coro
319	program calls this function, there will be some one-time resource leak.	409	calls this function, there will be some one-time resource leak.
320		410
321	=cut	411	=cut
322		412
323	sub killall {	413	sub killall {
324	for (Coro::State::list) {	414	for (Coro::State::list) {
…		…
327	}	417	}
328	}	418	}
329		419
330	=back	420	=back
331		421
332	=head1 COROUTINE OBJECT METHODS	422	=head1 CORO OBJECT METHODS
333		423
334	These are the methods you can call on coroutine objects (or to create	424	These are the methods you can call on coro objects (or to create
335	them).	425	them).
336		426
337	=over 4	427	=over 4
338		428
339	=item new Coro \&sub [, @args...]	429	=item new Coro \&sub [, @args...]
340		430
341	Create a new coroutine and return it. When the sub returns, the coroutine	431	Create a new coro and return it. When the sub returns, the coro
342	automatically terminates as if C<terminate> with the returned values were	432	automatically terminates as if C<terminate> with the returned values were
343	called. To make the coroutine run you must first put it into the ready	433	called. To make the coro run you must first put it into the ready
344	queue by calling the ready method.	434	queue by calling the ready method.
345		435
346	See C<async> and C<Coro::State::new> for additional info about the	436	See C<async> and C<Coro::State::new> for additional info about the
347	coroutine environment.	437	coro environment.
348		438
349	=cut	439	=cut
350		440
351	sub _terminate {	441	sub _coro_run {
352	terminate &{+shift};	442	terminate &{+shift};
353	}	443	}
354		444
355	=item $success = $coroutine->ready	445	=item $success = $coro->ready
356		446
357	Put the given coroutine into the end of its ready queue (there is one	447	Put the given coro into the end of its ready queue (there is one
358	queue for each priority) and return true. If the coroutine is already in	448	queue for each priority) and return true. If the coro is already in
359	the ready queue, do nothing and return false.	449	the ready queue, do nothing and return false.
360		450
361	This ensures that the scheduler will resume this coroutine automatically	451	This ensures that the scheduler will resume this coro automatically
362	once all the coroutines of higher priority and all coroutines of the same	452	once all the coro of higher priority and all coro of the same
363	priority that were put into the ready queue earlier have been resumed.	453	priority that were put into the ready queue earlier have been resumed.
364		454
		455	=item $coro->suspend
		456
		457	Suspends the specified coro. A suspended coro works just like any other
		458	coro, except that the scheduler will not select a suspended coro for
		459	execution.
		460
		461	Suspending a coro can be useful when you want to keep the coro from
		462	running, but you don't want to destroy it, or when you want to temporarily
		463	freeze a coro (e.g. for debugging) to resume it later.
		464
		465	A scenario for the former would be to suspend all (other) coros after a
		466	fork and keep them alive, so their destructors aren't called, but new
		467	coros can be created.
		468
		469	=item $coro->resume
		470
		471	If the specified coro was suspended, it will be resumed. Note that when
		472	the coro was in the ready queue when it was suspended, it might have been
		473	unreadied by the scheduler, so an activation might have been lost.
		474
		475	To avoid this, it is best to put a suspended coro into the ready queue
		476	unconditionally, as every synchronisation mechanism must protect itself
		477	against spurious wakeups, and the one in the Coro family certainly do
		478	that.
		479
365	=item $is_ready = $coroutine->is_ready	480	=item $is_ready = $coro->is_ready
366		481
367	Return whether the coroutine is currently the ready queue or not,	482	Returns true iff the Coro object is in the ready queue. Unless the Coro
		483	object gets destroyed, it will eventually be scheduled by the scheduler.
368		484
		485	=item $is_running = $coro->is_running
		486
		487	Returns true iff the Coro object is currently running. Only one Coro object
		488	can ever be in the running state (but it currently is possible to have
		489	multiple running Coro::States).
		490
		491	=item $is_suspended = $coro->is_suspended
		492
		493	Returns true iff this Coro object has been suspended. Suspended Coros will
		494	not ever be scheduled.
		495
369	=item $coroutine->cancel (arg...)	496	=item $coro->cancel (arg...)
370		497
371	Terminates the given coroutine and makes it return the given arguments as	498	Terminates the given Coro and makes it return the given arguments as
372	status (default: the empty list). Never returns if the coroutine is the	499	status (default: the empty list). Never returns if the Coro is the
373	current coroutine.	500	current Coro.
374		501
375	=cut	502	=cut
376		503
377	sub cancel {	504	sub cancel {
378	my $self = shift;	505	my $self = shift;
379		506
380	if ($current == $self) {	507	if ($current == $self) {
381	terminate @_;	508	terminate @_;
382	} else {	509	} else {
383	$self->{_status} = [@_];	510	$self->{_status} = [@_];
384	$self->_cancel;	511	Coro::State::cancel $self;
385	}	512	}
386	}	513	}
387		514
388	=item $coroutine->schedule_to	515	=item $coro->schedule_to
389		516
390	Puts the current coroutine to sleep (like C<Coro::schedule>), but instead	517	Puts the current coro to sleep (like C<Coro::schedule>), but instead
391	of continuing with the next coro from the ready queue, always switch to	518	of continuing with the next coro from the ready queue, always switch to
392	the given coroutine object (regardless of priority etc.). The readyness	519	the given coro object (regardless of priority etc.). The readyness
393	state of that coroutine isn't changed.	520	state of that coro isn't changed.
394		521
395	This is an advanced method for special cases - I'd love to hear about any	522	This is an advanced method for special cases - I'd love to hear about any
396	uses for this one.	523	uses for this one.
397		524
398	=item $coroutine->cede_to	525	=item $coro->cede_to
399		526
400	Like C<schedule_to>, but puts the current coroutine into the ready	527	Like C<schedule_to>, but puts the current coro into the ready
401	queue. This has the effect of temporarily switching to the given	528	queue. This has the effect of temporarily switching to the given
402	coroutine, and continuing some time later.	529	coro, and continuing some time later.
403		530
404	This is an advanced method for special cases - I'd love to hear about any	531	This is an advanced method for special cases - I'd love to hear about any
405	uses for this one.	532	uses for this one.
406		533
407	=item $coroutine->throw ([$scalar])	534	=item $coro->throw ([$scalar])
408		535
409	If C<$throw> is specified and defined, it will be thrown as an exception	536	If C<$throw> is specified and defined, it will be thrown as an exception
410	inside the coroutine at the next convenient point in time. Otherwise	537	inside the coro at the next convenient point in time. Otherwise
411	clears the exception object.	538	clears the exception object.
412		539
413	Coro will check for the exception each time a schedule-like-function	540	Coro will check for the exception each time a schedule-like-function
414	returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down	541	returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
415	>>, C<< Coro::Handle->readable >> and so on. Most of these functions	542	>>, C<< Coro::Handle->readable >> and so on. Most of these functions
…		…
417		544
418	The exception object will be thrown "as is" with the specified scalar in	545	The exception object will be thrown "as is" with the specified scalar in
419	C<$@>, i.e. if it is a string, no line number or newline will be appended	546	C<$@>, i.e. if it is a string, no line number or newline will be appended
420	(unlike with C<die>).	547	(unlike with C<die>).
421		548
422	This can be used as a softer means than C<cancel> to ask a coroutine to	549	This can be used as a softer means than C<cancel> to ask a coro to
423	end itself, although there is no guarantee that the exception will lead to	550	end itself, although there is no guarantee that the exception will lead to
424	termination, and if the exception isn't caught it might well end the whole	551	termination, and if the exception isn't caught it might well end the whole
425	program.	552	program.
426		553
427	You might also think of C<throw> as being the moral equivalent of	554	You might also think of C<throw> as being the moral equivalent of
428	C<kill>ing a coroutine with a signal (in this case, a scalar).	555	C<kill>ing a coro with a signal (in this case, a scalar).
429		556
430	=item $coroutine->join	557	=item $coro->join
431		558
432	Wait until the coroutine terminates and return any values given to the	559	Wait until the coro terminates and return any values given to the
433	C<terminate> or C<cancel> functions. C<join> can be called concurrently	560	C<terminate> or C<cancel> functions. C<join> can be called concurrently
434	from multiple coroutines, and all will be resumed and given the status	561	from multiple coro, and all will be resumed and given the status
435	return once the C<$coroutine> terminates.	562	return once the C<$coro> terminates.
436		563
437	=cut	564	=cut
438		565
439	sub join {	566	sub join {
440	my $self = shift;	567	my $self = shift;
…		…
451	}	578	}
452		579
453	wantarray ? @{$self->{_status}} : $self->{_status}[0];	580	wantarray ? @{$self->{_status}} : $self->{_status}[0];
454	}	581	}
455		582
456	=item $coroutine->on_destroy (\&cb)	583	=item $coro->on_destroy (\&cb)
457		584
458	Registers a callback that is called when this coroutine gets destroyed,	585	Registers a callback that is called when this coro gets destroyed,
459	but before it is joined. The callback gets passed the terminate arguments,	586	but before it is joined. The callback gets passed the terminate arguments,
460	if any, and I<must not> die, under any circumstances.	587	if any, and I<must not> die, under any circumstances.
461		588
462	=cut	589	=cut
463		590
…		…
465	my ($self, $cb) = @_;	592	my ($self, $cb) = @_;
466		593
467	push @{ $self->{_on_destroy} }, $cb;	594	push @{ $self->{_on_destroy} }, $cb;
468	}	595	}
469		596
470	=item $oldprio = $coroutine->prio ($newprio)	597	=item $oldprio = $coro->prio ($newprio)
471		598
472	Sets (or gets, if the argument is missing) the priority of the	599	Sets (or gets, if the argument is missing) the priority of the
473	coroutine. Higher priority coroutines get run before lower priority	600	coro. Higher priority coro get run before lower priority
474	coroutines. Priorities are small signed integers (currently -4 .. +3),	601	coro. Priorities are small signed integers (currently -4 .. +3),
475	that you can refer to using PRIO_xxx constants (use the import tag :prio	602	that you can refer to using PRIO_xxx constants (use the import tag :prio
476	to get then):	603	to get then):
477		604
478	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN	605	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
479	3 > 1 > 0 > -1 > -3 > -4	606	3 > 1 > 0 > -1 > -3 > -4
480		607
481	# set priority to HIGH	608	# set priority to HIGH
482	current->prio(PRIO_HIGH);	609	current->prio (PRIO_HIGH);
483		610
484	The idle coroutine ($Coro::idle) always has a lower priority than any	611	The idle coro ($Coro::idle) always has a lower priority than any
485	existing coroutine.	612	existing coro.
486		613
487	Changing the priority of the current coroutine will take effect immediately,	614	Changing the priority of the current coro will take effect immediately,
488	but changing the priority of coroutines in the ready queue (but not	615	but changing the priority of coro in the ready queue (but not
489	running) will only take effect after the next schedule (of that	616	running) will only take effect after the next schedule (of that
490	coroutine). This is a bug that will be fixed in some future version.	617	coro). This is a bug that will be fixed in some future version.
491		618
492	=item $newprio = $coroutine->nice ($change)	619	=item $newprio = $coro->nice ($change)
493		620
494	Similar to C<prio>, but subtract the given value from the priority (i.e.	621	Similar to C<prio>, but subtract the given value from the priority (i.e.
495	higher values mean lower priority, just as in unix).	622	higher values mean lower priority, just as in unix).
496		623
497	=item $olddesc = $coroutine->desc ($newdesc)	624	=item $olddesc = $coro->desc ($newdesc)
498		625
499	Sets (or gets in case the argument is missing) the description for this	626	Sets (or gets in case the argument is missing) the description for this
500	coroutine. This is just a free-form string you can associate with a	627	coro. This is just a free-form string you can associate with a
501	coroutine.	628	coro.
502		629
503	This method simply sets the C<< $coroutine->{desc} >> member to the given	630	This method simply sets the C<< $coro->{desc} >> member to the given
504	string. You can modify this member directly if you wish.	631	string. You can modify this member directly if you wish.
505		632
506	=cut	633	=cut
507		634
508	sub desc {	635	sub desc {
…		…
522		649
523	=over 4	650	=over 4
524		651
525	=item Coro::nready	652	=item Coro::nready
526		653
527	Returns the number of coroutines that are currently in the ready state,	654	Returns the number of coro that are currently in the ready state,
528	i.e. that can be switched to by calling C<schedule> directory or	655	i.e. that can be switched to by calling C<schedule> directory or
529	indirectly. The value C<0> means that the only runnable coroutine is the	656	indirectly. The value C<0> means that the only runnable coro is the
530	currently running one, so C<cede> would have no effect, and C<schedule>	657	currently running one, so C<cede> would have no effect, and C<schedule>
531	would cause a deadlock unless there is an idle handler that wakes up some	658	would cause a deadlock unless there is an idle handler that wakes up some
532	coroutines.	659	coro.
533		660
534	=item my $guard = Coro::guard { ... }	661	=item my $guard = Coro::guard { ... }
535		662
536	This creates and returns a guard object. Nothing happens until the object	663	This function still exists, but is deprecated. Please use the
537	gets destroyed, in which case the codeblock given as argument will be	664	C<Guard::guard> function instead.
538	executed. This is useful to free locks or other resources in case of a
539	runtime error or when the coroutine gets canceled, as in both cases the
540	guard block will be executed. The guard object supports only one method,
541	C<< ->cancel >>, which will keep the codeblock from being executed.
542		665
543	Example: set some flag and clear it again when the coroutine gets canceled
544	or the function returns:
545
546	sub do_something {
547	my $guard = Coro::guard { $busy = 0 };
548	$busy = 1;
549
550	# do something that requires $busy to be true
551	}
552
553	=cut	666	=cut
554		667
555	sub guard(&) {	668	BEGIN { *guard = \&Guard::guard }
556	bless \(my $cb = $_[0]), "Coro::guard"
557	}
558
559	sub Coro::guard::cancel {
560	${$_[0]} = sub { };
561	}
562
563	sub Coro::guard::DESTROY {
564	${$_[0]}->();
565	}
566
567		669
568	=item unblock_sub { ... }	670	=item unblock_sub { ... }
569		671
570	This utility function takes a BLOCK or code reference and "unblocks" it,	672	This utility function takes a BLOCK or code reference and "unblocks" it,
571	returning a new coderef. Unblocking means that calling the new coderef	673	returning a new coderef. Unblocking means that calling the new coderef
572	will return immediately without blocking, returning nothing, while the	674	will return immediately without blocking, returning nothing, while the
573	original code ref will be called (with parameters) from within another	675	original code ref will be called (with parameters) from within another
574	coroutine.	676	coro.
575		677
576	The reason this function exists is that many event libraries (such as the	678	The reason this function exists is that many event libraries (such as the
577	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form	679	venerable L<Event\|Event> module) are not thread-safe (a weaker form
578	of thread-safety). This means you must not block within event callbacks,	680	of reentrancy). This means you must not block within event callbacks,
579	otherwise you might suffer from crashes or worse. The only event library	681	otherwise you might suffer from crashes or worse. The only event library
580	currently known that is safe to use without C<unblock_sub> is L<EV>.	682	currently known that is safe to use without C<unblock_sub> is L<EV>.
581		683
582	This function allows your callbacks to block by executing them in another	684	This function allows your callbacks to block by executing them in another
583	coroutine where it is safe to block. One example where blocking is handy	685	coro where it is safe to block. One example where blocking is handy
584	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to	686	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to
585	disk, for example.	687	disk, for example.
586		688
587	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when	689	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
588	creating event callbacks that want to block.	690	creating event callbacks that want to block.
589		691
590	If your handler does not plan to block (e.g. simply sends a message to	692	If your handler does not plan to block (e.g. simply sends a message to
591	another coroutine, or puts some other coroutine into the ready queue),	693	another coro, or puts some other coro into the ready queue), there is
592	there is no reason to use C<unblock_sub>.	694	no reason to use C<unblock_sub>.
593		695
594	Note that you also need to use C<unblock_sub> for any other callbacks that	696	Note that you also need to use C<unblock_sub> for any other callbacks that
595	are indirectly executed by any C-based event loop. For example, when you	697	are indirectly executed by any C-based event loop. For example, when you
596	use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it	698	use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
597	provides callbacks that are the result of some event callback, then you	699	provides callbacks that are the result of some event callback, then you
…		…
629	}	731	}
630	}	732	}
631		733
632	=item $cb = Coro::rouse_cb	734	=item $cb = Coro::rouse_cb
633		735
634	Create and return a "rouse callback". That's a code reference that, when	736	Create and return a "rouse callback". That's a code reference that,
635	called, will save its arguments and notify the owner coroutine of the	737	when called, will remember a copy of its arguments and notify the owner
636	callback.	738	coro of the callback.
637		739
638	See the next function.	740	See the next function.
639		741
640	=item @args = Coro::rouse_wait [$cb]	742	=item @args = Coro::rouse_wait [$cb]
641		743
642	Wait for the specified rouse callback (or the last one tht was created in	744	Wait for the specified rouse callback (or the last one that was created in
643	this coroutine).	745	this coro).
644		746
645	As soon as the callback is invoked (or when the calback was invoked before	747	As soon as the callback is invoked (or when the callback was invoked
646	C<rouse_wait>), it will return a copy of the arguments originally passed	748	before C<rouse_wait>), it will return the arguments originally passed to
647	to the rouse callback.	749	the rouse callback. In scalar context, that means you get the I<last>
		750	argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
		751	statement at the end.
648		752
649	See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.	753	See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
650		754
651	=back	755	=back
652		756
…		…
654		758
655	1;	759	1;
656		760
657	=head1 HOW TO WAIT FOR A CALLBACK	761	=head1 HOW TO WAIT FOR A CALLBACK
658		762
659	It is very common for a coroutine to wait for some callback to be	763	It is very common for a coro to wait for some callback to be
660	called. This occurs naturally when you use coroutines in an otherwise	764	called. This occurs naturally when you use coro in an otherwise
661	event-based program, or when you use event-based libraries.	765	event-based program, or when you use event-based libraries.
662		766
663	These typically register a callback for some event, and call that callback	767	These typically register a callback for some event, and call that callback
664	when the event occured. In a coroutine, however, you typically want to	768	when the event occured. In a coro, however, you typically want to
665	just wait for the event, simplyifying things.	769	just wait for the event, simplyifying things.
666		770
667	For example C<< AnyEvent->child >> registers a callback to be called when	771	For example C<< AnyEvent->child >> registers a callback to be called when
668	a specific child has exited:	772	a specific child has exited:
669		773
670	my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });	774	my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
671		775
672	But from withina coroutine, you often just want to write this:	776	But from within a coro, you often just want to write this:
673		777
674	my $status = wait_for_child $pid;	778	my $status = wait_for_child $pid;
675		779
676	Coro offers two functions specifically designed to make this easy,	780	Coro offers two functions specifically designed to make this easy,
677	C<Coro::rouse_cb> and C<Coro::rouse_wait>.	781	C<Coro::rouse_cb> and C<Coro::rouse_wait>.
678		782
679	The first function, C<rouse_cb>, generates and returns a callback that,	783	The first function, C<rouse_cb>, generates and returns a callback that,
680	when invoked, will save it's arguments and notify the coroutine that	784	when invoked, will save its arguments and notify the coro that
681	created the callback.	785	created the callback.
682		786
683	The second function, C<rouse_wait>, waits for the callback to be called	787	The second function, C<rouse_wait>, waits for the callback to be called
684	(by calling C<schedule> to go to sleep) and returns the arguments	788	(by calling C<schedule> to go to sleep) and returns the arguments
685	originally passed to the callback.	789	originally passed to the callback.
…		…
700	you can roll your own, using C<schedule>:	804	you can roll your own, using C<schedule>:
701		805
702	sub wait_for_child($) {	806	sub wait_for_child($) {
703	my ($pid) = @_;	807	my ($pid) = @_;
704		808
705	# store the current coroutine in $current,	809	# store the current coro in $current,
706	# and provide result variables for the closure passed to ->child	810	# and provide result variables for the closure passed to ->child
707	my $current = $Coro::current;	811	my $current = $Coro::current;
708	my ($done, $rstatus);	812	my ($done, $rstatus);
709		813
710	# pass a closure to ->child	814	# pass a closure to ->child
…		…
726		830
727	=item fork with pthread backend	831	=item fork with pthread backend
728		832
729	When Coro is compiled using the pthread backend (which isn't recommended	833	When Coro is compiled using the pthread backend (which isn't recommended
730	but required on many BSDs as their libcs are completely broken), then	834	but required on many BSDs as their libcs are completely broken), then
731	coroutines will not survive a fork. There is no known workaround except to	835	coro will not survive a fork. There is no known workaround except to
732	fix your libc and use a saner backend.	836	fix your libc and use a saner backend.
733		837
734	=item perl process emulation ("threads")	838	=item perl process emulation ("threads")
735		839
736	This module is not perl-pseudo-thread-safe. You should only ever use this	840	This module is not perl-pseudo-thread-safe. You should only ever use this
737	module from the same thread (this requirement might be removed in the	841	module from the first thread (this requirement might be removed in the
738	future to allow per-thread schedulers, but Coro::State does not yet allow	842	future to allow per-thread schedulers, but Coro::State does not yet allow
739	this). I recommend disabling thread support and using processes, as having	843	this). I recommend disabling thread support and using processes, as having
740	the windows process emulation enabled under unix roughly halves perl	844	the windows process emulation enabled under unix roughly halves perl
741	performance, even when not used.	845	performance, even when not used.
742		846
743	=item coroutine switching not signal safe	847	=item coro switching is not signal safe
744		848
745	You must not switch to another coroutine from within a signal handler	849	You must not switch to another coro from within a signal handler
746	(only relevant with %SIG - most event libraries provide safe signals).	850	(only relevant with %SIG - most event libraries provide safe signals).
747		851
748	That means you I<MUST NOT> call any function that might "block" the	852	That means you I<MUST NOT> call any function that might "block" the
749	current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or	853	current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
750	anything that calls those. Everything else, including calling C<ready>,	854	anything that calls those. Everything else, including calling C<ready>,
751	works.	855	works.
752		856
753	=back	857	=back
754		858
755		859
		860	=head1 WINDOWS PROCESS EMULATION
		861
		862	A great many people seem to be confused about ithreads (for example, Chip
		863	Salzenberg called me unintelligent, incapable, stupid and gullible,
		864	while in the same mail making rather confused statements about perl
		865	ithreads (for example, that memory or files would be shared), showing his
		866	lack of understanding of this area - if it is hard to understand for Chip,
		867	it is probably not obvious to everybody).
		868
		869	What follows is an ultra-condensed version of my talk about threads in
		870	scripting languages given onthe perl workshop 2009:
		871
		872	The so-called "ithreads" were originally implemented for two reasons:
		873	first, to (badly) emulate unix processes on native win32 perls, and
		874	secondly, to replace the older, real thread model ("5.005-threads").
		875
		876	It does that by using threads instead of OS processes. The difference
		877	between processes and threads is that threads share memory (and other
		878	state, such as files) between threads within a single process, while
		879	processes do not share anything (at least not semantically). That
		880	means that modifications done by one thread are seen by others, while
		881	modifications by one process are not seen by other processes.
		882
		883	The "ithreads" work exactly like that: when creating a new ithreads
		884	process, all state is copied (memory is copied physically, files and code
		885	is copied logically). Afterwards, it isolates all modifications. On UNIX,
		886	the same behaviour can be achieved by using operating system processes,
		887	except that UNIX typically uses hardware built into the system to do this
		888	efficiently, while the windows process emulation emulates this hardware in
		889	software (rather efficiently, but of course it is still much slower than
		890	dedicated hardware).
		891
		892	As mentioned before, loading code, modifying code, modifying data
		893	structures and so on is only visible in the ithreads process doing the
		894	modification, not in other ithread processes within the same OS process.
		895
		896	This is why "ithreads" do not implement threads for perl at all, only
		897	processes. What makes it so bad is that on non-windows platforms, you can
		898	actually take advantage of custom hardware for this purpose (as evidenced
		899	by the forks module, which gives you the (i-) threads API, just much
		900	faster).
		901
		902	Sharing data is in the i-threads model is done by transfering data
		903	structures between threads using copying semantics, which is very slow -
		904	shared data simply does not exist. Benchmarks using i-threads which are
		905	communication-intensive show extremely bad behaviour with i-threads (in
		906	fact, so bad that Coro, which cannot take direct advantage of multiple
		907	CPUs, is often orders of magnitude faster because it shares data using
		908	real threads, refer to my talk for details).
		909
		910	As summary, i-threads use threads to implement processes, while
		911	the compatible forks module uses processes to emulate, uhm,
		912	processes. I-threads slow down every perl program when enabled, and
		913	outside of windows, serve no (or little) practical purpose, but
		914	disadvantages every single-threaded Perl program.
		915
		916	This is the reason that I try to avoid the name "ithreads", as it is
		917	misleading as it implies that it implements some kind of thread model for
		918	perl, and prefer the name "windows process emulation", which describes the
		919	actual use and behaviour of it much better.
		920
756	=head1 SEE ALSO	921	=head1 SEE ALSO
757		922
758	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.	923	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
759		924
760	Debugging: L<Coro::Debug>.	925	Debugging: L<Coro::Debug>.
761		926
762	Support/Utility: L<Coro::Specific>, L<Coro::Util>.	927	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
763		928
764	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>,	929	Locking and IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>,
765	L<Coro::SemaphoreSet>, L<Coro::RWLock>.	930	L<Coro::SemaphoreSet>, L<Coro::RWLock>.
766		931
767	IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.	932	I/O and Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
768		933
769	Compatibility: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for	934	Compatibility with other modules: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for
770	a better-working alternative), L<Coro::BDB>, L<Coro::Storable>,	935	a better-working alternative), L<Coro::BDB>, L<Coro::Storable>,
771	L<Coro::Select>.	936	L<Coro::Select>.
772		937
773	XS API: L<Coro::MakeMaker>.	938	XS API: L<Coro::MakeMaker>.
774		939
775	Low level Configuration, Coroutine Environment: L<Coro::State>.	940	Low level Configuration, Thread Environment, Continuations: L<Coro::State>.
776		941
777	=head1 AUTHOR	942	=head1 AUTHOR
778		943
779	Marc Lehmann <schmorp@schmorp.de>	944	Marc Lehmann <schmorp@schmorp.de>
780	http://home.schmorp.de/	945	http://home.schmorp.de/

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.237 by root, Sat Nov 22 16:37:11 2008 UTC vs. Revision 1.268 by root, Thu Oct 1 23:16:27 2009 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.237 by root, Sat Nov 22 16:37:11 2008 UTC vs.
Revision 1.268 by root, Thu Oct 1 23:16:27 2009 UTC