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

Comparing Coro/Coro.pm (file contents):
Revision 1.193 by root, Sun Jun 29 00:28:17 2008 UTC vs.
Revision 1.282 by root, Sun Dec 26 16:23:51 2010 UTC

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.193 by root, Sun Jun 29 00:28:17 2008 UTC vs. Revision 1.282 by root, Sun Dec 26 16:23:51 2010 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.193 by root, Sun Jun 29 00:28:17 2008 UTC vs.
Revision 1.282 by root, Sun Dec 26 16:23:51 2010 UTC