ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/cvsroot/Coro/Coro.pm

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.221 by root, Tue Nov 18 05:51:38 2008 UTC vs.
Revision 1.295 by root, Tue May 10 19:55:48 2011 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	use Coro::Semaphore;
…		…
26	$locked = 1;	26	$locked = 1;
27	$lock->up;	27	$lock->up;
28		28
29	=head1 DESCRIPTION	29	=head1 DESCRIPTION
30		30
31	This module collection manages coroutines. Coroutines are similar to	31	For a tutorial-style introduction, please read the L<Coro::Intro>
32	threads but don't (in general) run in parallel at the same time even	32	manpage. This manpage mainly contains reference information.
33	on SMP machines. The specific flavor of coroutine used in this module
34	also guarantees you that it will not switch between coroutines unless
35	necessary, at easily-identified points in your program, so locking and
36	parallel access are rarely an issue, making coroutine programming much
37	safer and easier than threads programming.
38		33
39	Unlike a normal perl program, however, coroutines allow you to have	34	This module collection manages continuations in general, most often in
40	multiple running interpreters that share data, which is especially useful	35	the form of cooperative threads (also called coros, or simply "coro"
41	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
42	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
43	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.
44		43
45	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
46	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
47	emulation coming from the Windows platform: On standard operating systems	46	more details) ported to UNIX, and as such act as processes), Coro
48	they serve no purpose whatsoever, except by making your programs slow and	47	provides a full shared address space, which makes communication between
49	making them use a lot of memory. Best disable them when building perl, or	48	threads very easy. And coro threads are fast, too: disabling the Windows
50	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 (very communication-intensive) runs over 300
		52	times faster on a single core than perls pseudo-threads on a quad core
		53	using all four cores.
51		54
		55	Coro achieves that by supporting multiple running interpreters that share
		56	data, which is especially useful to code pseudo-parallel processes and
		57	for event-based programming, such as multiple HTTP-GET requests running
		58	concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
		59	into an event-based environment.
		60
52	In this module, coroutines are defined as "callchain + lexical variables +	61	In this module, a thread is defined as "callchain + lexical variables +
53	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,	62	some package variables + C stack), that is, a thread has its own callchain,
54	its own set of lexicals and its own set of perls most important global	63	its own set of lexicals and its own set of perls most important global
55	variables (see L<Coro::State> for more configuration).	64	variables (see L<Coro::State> for more configuration and background info).
		65
		66	See also the C<SEE ALSO> section at the end of this document - the Coro
		67	module family is quite large.
		68
		69	=head1 CORO THREAD LIFE CYCLE
		70
		71	During the long and exciting (or not) life of a coro thread, it goes
		72	through a number of states:
		73
		74	=over 4
		75
		76	=item 1. Creation
		77
		78	The first thing in the life of a coro thread is it's creation -
		79	obviously. The typical way to create a thread is to call the C<async
		80	BLOCK> function:
		81
		82	async {
		83	# thread code goes here
		84	};
		85
		86	You can also pass arguments, which are put in C<@_>:
		87
		88	async {
		89	print $_[1]; # prints 2
		90	} 1, 2, 3;
		91
		92	This creates a new coro thread and puts it into the ready queue, meaning
		93	it will run as soon as the CPU is free for it.
		94
		95	C<async> will return a coro object - you can store this for future
		96	reference or ignore it, the thread itself will keep a reference to it's
		97	thread object - threads are alive on their own.
		98
		99	Another way to create a thread is to call the C<new> constructor with a
		100	code-reference:
		101
		102	new Coro sub {
		103	# thread code goes here
		104	}, @optional_arguments;
		105
		106	This is quite similar to calling C<async>, but the important difference is
		107	that the new thread is not put into the ready queue, so the thread will
		108	not run until somebody puts it there. C<async> is, therefore, identical to
		109	this sequence:
		110
		111	my $coro = new Coro sub {
		112	# thread code goes here
		113	};
		114	$coro->ready;
		115	return $coro;
		116
		117	=item 2. Startup
		118
		119	When a new coro thread is created, only a copy of the code reference
		120	and the arguments are stored, no extra memory for stacks and so on is
		121	allocated, keeping the coro thread in a low-memory state.
		122
		123	Only when it actually starts executing will all the resources be finally
		124	allocated.
		125
		126	The optional arguments specified at coro creation are available in C<@_>,
		127	similar to function calls.
		128
		129	=item 3. Running / Blocking
		130
		131	A lot can happen after the coro thread has started running. Quite usually,
		132	it will not run to the end in one go (because you could use a function
		133	instead), but it will give up the CPU regularly because it waits for
		134	external events.
		135
		136	As long as a coro thread runs, it's coro object is available in the global
		137	variable C<$Coro::current>.
		138
		139	The low-level way to give up the CPU is to call the scheduler, which
		140	selects a new coro thread to run:
		141
		142	Coro::schedule;
		143
		144	Since running threads are not in the ready queue, calling the scheduler
		145	without doing anything else will block the coro thread forever - you need
		146	to arrange either for the coro to put woken up (readied) by some other
		147	event or some other thread, or you can put it into the ready queue before
		148	scheduling:
		149
		150	# this is exactly what Coro::cede does
		151	$Coro::current->ready;
		152	Coro::schedule;
		153
		154	All the higher-level synchronisation methods (Coro::Semaphore,
		155	Coro::rouse_*...) are actually implemented via C<< ->ready >> and C<<
		156	Coro::schedule >>.
		157
		158	While the coro thread is running it also might get assigned a C-level
		159	thread, or the C-level thread might be unassigned from it, as the Coro
		160	runtime wishes. A C-level thread needs to be assigned when your perl
		161	thread calls into some C-level function and that function in turn calls
		162	perl and perl then wants to switch coroutines. This happens most often
		163	when you run an event loop and block in the callback, or when perl
		164	itself calls some function such as C<AUTOLOAD> or methods via the C<tie>
		165	mechanism.
		166
		167	=item 4. Termination
		168
		169	Many threads actually terminate after some time. There are a number of
		170	ways to terminate a coro thread, the simplest is returning from the
		171	top-level code reference:
		172
		173	async {
		174	# after returning from here, the coro thread is terminated
		175	};
		176
		177	async {
		178	return if 0.5 < rand; # terminate a little earlier, maybe
		179	print "got a chance to print this\n";
		180	# or here
		181	};
		182
		183	Any values returned from the coroutine can be recovered using C<< ->join
		184	>>:
		185
		186	my $coro = async {
		187	"hello, world\n" # return a string
		188	};
		189
		190	my $hello_world = $coro->join;
		191
		192	print $hello_world;
		193
		194	Another way to terminate is to call C<< Coro::terminate >>, which at any
		195	subroutine call nesting level:
		196
		197	async {
		198	Coro::terminate "return value 1", "return value 2";
		199	};
		200
		201	And yet another way is to C<< ->cancel >> (or C<< ->safe_cancel >>) the
		202	coro thread from another thread:
		203
		204	my $coro = async {
		205	exit 1;
		206	};
		207
		208	$coro->cancel; # also accepts values for ->join to retrieve
		209
		210	Cancellation I<can> be dangerous - it's a bit like calling C<exit> without
		211	actually exiting, and might leave C libraries and XS modules in a weird
		212	state. Unlike other thread implementations, however, Coro is exceptionally
		213	safe with regards to cancellation, as perl will always be in a consistent
		214	state, and for those cases where you want to do truly marvellous things
		215	with your coro while it is being cancelled - that is, make sure all
		216	cleanup code is executed from the thread being cancelled - there is even a
		217	C<< ->safe_cancel >> method.
		218
		219	So, cancelling a thread that runs in an XS event loop might not be the
		220	best idea, but any other combination that deals with perl only (cancelling
		221	when a thread is in a C<tie> method or an C<AUTOLOAD> for example) is
		222	safe.
		223
		224	=item 5. Cleanup
		225
		226	Threads will allocate various resources. Most but not all will be returned
		227	when a thread terminates, during clean-up.
		228
		229	Cleanup is quite similar to throwing an uncaught exception: perl will
		230	work it's way up through all subroutine calls and blocks. On it's way, it
		231	will release all C<my> variables, undo all C<local>'s and free any other
		232	resources truly local to the thread.
		233
		234	So, a common way to free resources is to keep them referenced only by my
		235	variables:
		236
		237	async {
		238	my $big_cache = new Cache ...;
		239	};
		240
		241	If there are no other references, then the C<$big_cache> object will be
		242	freed when the thread terminates, regardless of how it does so.
		243
		244	What it does C<NOT> do is unlock any Coro::Semaphores or similar
		245	resources, but that's where the C<guard> methods come in handy:
		246
		247	my $sem = new Coro::Semaphore;
		248
		249	async {
		250	my $lock_guard = $sem->guard;
		251	# if we reutrn, or die or get cancelled, here,
		252	# then the semaphore will be "up"ed.
		253	};
		254
		255	The C<Guard::guard> function comes in handy for any custom cleanup you
		256	might want to do:
		257
		258	async {
		259	my $window = new Gtk2::Window "toplevel";
		260	# The window will not be cleaned up automatically, even when $window
		261	# gets freed, so use a guard to ensure it's destruction
		262	# in case of an error:
		263	my $window_guard = Guard::guard { $window->destroy };
		264
		265	# we are safe here
		266	};
		267
		268	Last not least, C<local> can often be handy, too, e.g. when temporarily
		269	replacing the coro thread description:
		270
		271	sub myfunction {
		272	local $Coro::current->{desc} = "inside myfunction(@_)";
		273
		274	# if we return or die here, the description will be restored
		275	}
		276
		277	=item 6. Viva La Zombie Muerte
		278
		279	Even after a thread has terminated and cleaned up it's resources, the coro
		280	object still is there and stores the return values of the thread. Only in
		281	this state will the coro object be "reference counted" in the normal perl
		282	sense: the thread code keeps a reference to it when it is active, but not
		283	after it has terminated.
		284
		285	The means the coro object gets freed automatically when the thread has
		286	terminated and cleaned up and there arenot other references.
		287
		288	If there are, the coro object will stay around, and you can call C<<
		289	->join >> as many times as you wish to retrieve the result values:
		290
		291	async {
		292	print "hi\n";
		293	1
		294	};
		295
		296	# run the async above, and free everything before returning
		297	# from Coro::cede:
		298	Coro::cede;
		299
		300	{
		301	my $coro = async {
		302	print "hi\n";
		303	1
		304	};
		305
		306	# run the async above, and clean up, but do not free the coro
		307	# object:
		308	Coro::cede;
		309
		310	# optionally retrieve the result values
		311	my @results = $coro->join;
		312
		313	# now $coro goes out of scope, and presumably gets freed
		314	};
		315
		316	=back
56		317
57	=cut	318	=cut
58		319
59	package Coro;	320	package Coro;
60		321
61	use strict qw(vars subs);	322	use common::sense;
62	no warnings "uninitialized";	323
		324	use Carp ();
		325
		326	use Guard ();
63		327
64	use Coro::State;	328	use Coro::State;
65		329
66	use base qw(Coro::State Exporter);	330	use base qw(Coro::State Exporter);
67		331
68	our $idle; # idle handler	332	our $idle; # idle handler
69	our $main; # main coroutine	333	our $main; # main coro
70	our $current; # current coroutine	334	our $current; # current coro
71		335
72	our $VERSION = 5.0;	336	our $VERSION = 5.372;
73		337
74	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);	338	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub rouse_cb rouse_wait);
75	our %EXPORT_TAGS = (	339	our %EXPORT_TAGS = (
76	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	340	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
77	);	341	);
78	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));	342	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
79		343
		344	=head1 GLOBAL VARIABLES
		345
80	=over 4	346	=over 4
81		347
82	=item $Coro::main	348	=item $Coro::main
83		349
84	This variable stores the coroutine object that represents the main	350	This variable stores the Coro object that represents the main
85	program. While you cna C<ready> it and do most other things you can do to	351	program. While you cna C<ready> it and do most other things you can do to
86	coroutines, it is mainly useful to compare again C<$Coro::current>, to see	352	coro, it is mainly useful to compare again C<$Coro::current>, to see
87	whether you are running in the main program or not.	353	whether you are running in the main program or not.
88		354
89	=cut	355	=cut
90		356
91	# $main is now being initialised by Coro::State	357	# $main is now being initialised by Coro::State
92		358
93	=item $Coro::current	359	=item $Coro::current
94		360
95	The coroutine object representing the current coroutine (the last	361	The Coro object representing the current coro (the last
96	coroutine that the Coro scheduler switched to). The initial value is	362	coro that the Coro scheduler switched to). The initial value is
97	C<$Coro::main> (of course).	363	C<$Coro::main> (of course).
98		364
99	This variable is B<strictly> I<read-only>. You can take copies of the	365	This variable is B<strictly> I<read-only>. You can take copies of the
100	value stored in it and use it as any other coroutine object, but you must	366	value stored in it and use it as any other Coro object, but you must
101	not otherwise modify the variable itself.	367	not otherwise modify the variable itself.
102		368
103	=cut	369	=cut
104		370
105	sub current() { $current } # [DEPRECATED]	371	sub current() { $current } # [DEPRECATED]
106		372
107	=item $Coro::idle	373	=item $Coro::idle
108		374
109	This variable is mainly useful to integrate Coro into event loops. It is	375	This variable is mainly useful to integrate Coro into event loops. It is
110	usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is	376	usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
111	pretty low-level functionality.	377	pretty low-level functionality.
112		378
113	This variable stores a callback that is called whenever the scheduler	379	This variable stores a Coro object that is put into the ready queue when
114	finds no ready coroutines to run. The default implementation prints	380	there are no other ready threads (without invoking any ready hooks).
115	"FATAL: deadlock detected" and exits, because the program has no other way
116	to continue.
117		381
		382	The default implementation dies with "FATAL: deadlock detected.", followed
		383	by a thread listing, because the program has no other way to continue.
		384
118	This hook is overwritten by modules such as C<Coro::Timer> and	385	This hook is overwritten by modules such as C<Coro::EV> and
119	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a	386	C<Coro::AnyEvent> to wait on an external event that hopefully wakes up a
120	coroutine so the scheduler can run it.	387	coro so the scheduler can run it.
121		388
122	Note that the callback I<must not>, under any circumstances, block
123	the current coroutine. Normally, this is achieved by having an "idle
124	coroutine" that calls the event loop and then blocks again, and then
125	readying that coroutine in the idle handler.
126
127	See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this	389	See L<Coro::EV> or L<Coro::AnyEvent> for examples of using this technique.
128	technique.
129		390
130	Please note that if your callback recursively invokes perl (e.g. for event
131	handlers), then it must be prepared to be called recursively itself.
132
133	=cut	391	=cut
134		392
135	$idle = sub {	393	# ||= because other modules could have provided their own by now
136	require Carp;	394	$idle ||= new Coro sub {
137	Carp::croak ("FATAL: deadlock detected");	395	require Coro::Debug;
		396	die "FATAL: deadlock detected.\n"
		397	. Coro::Debug::ps_listing ();
138	};	398	};
139		399
140	sub _cancel {
141	my ($self) = @_;
142
143	# free coroutine data and mark as destructed
144	$self->_destroy
145	or return;
146
147	# call all destruction callbacks
148	$_->(@{$self->{_status}})
149	for @{ delete $self->{_on_destroy} || [] };
150	}
151
152	# this coroutine is necessary because a coroutine	400	# this coro is necessary because a coro
153	# cannot destroy itself.	401	# cannot destroy itself.
154	my @destroy;	402	our @destroy;
155	my $manager;	403	our $manager;
156		404
157	$manager = new Coro sub {	405	$manager = new Coro sub {
158	while () {	406	while () {
159	(shift @destroy)->_cancel	407	_destroy shift @destroy
160	while @destroy;	408	while @destroy;
161		409
162	&schedule;	410	&schedule;
163	}	411	}
164	};	412	};
165	$manager->{desc} = "[coro manager]";	413	$manager->{desc} = "[coro manager]";
166	$manager->prio (PRIO_MAX);	414	$manager->prio (PRIO_MAX);
167		415
168	=back	416	=back
169		417
170	=head2 SIMPLE COROUTINE CREATION	418	=head1 SIMPLE CORO CREATION
171		419
172	=over 4	420	=over 4
173		421
174	=item async { ... } [@args...]	422	=item async { ... } [@args...]
175		423
176	Create a new coroutine and return it's coroutine object (usually	424	Create a new coro and return its Coro object (usually
177	unused). The coroutine will be put into the ready queue, so	425	unused). The coro will be put into the ready queue, so
178	it will start running automatically on the next scheduler run.	426	it will start running automatically on the next scheduler run.
179		427
180	The first argument is a codeblock/closure that should be executed in the	428	The first argument is a codeblock/closure that should be executed in the
181	coroutine. When it returns argument returns the coroutine is automatically	429	coro. When it returns argument returns the coro is automatically
182	terminated.	430	terminated.
183		431
184	The remaining arguments are passed as arguments to the closure.	432	The remaining arguments are passed as arguments to the closure.
185		433
186	See the C<Coro::State::new> constructor for info about the coroutine	434	See the C<Coro::State::new> constructor for info about the coro
187	environment in which coroutines are executed.	435	environment in which coro are executed.
188		436
189	Calling C<exit> in a coroutine will do the same as calling exit outside	437	Calling C<exit> in a coro will do the same as calling exit outside
190	the coroutine. Likewise, when the coroutine dies, the program will exit,	438	the coro. Likewise, when the coro dies, the program will exit,
191	just as it would in the main program.	439	just as it would in the main program.
192		440
193	If you do not want that, you can provide a default C<die> handler, or	441	If you do not want that, you can provide a default C<die> handler, or
194	simply avoid dieing (by use of C<eval>).	442	simply avoid dieing (by use of C<eval>).
195		443
196	Example: Create a new coroutine that just prints its arguments.	444	Example: Create a new coro that just prints its arguments.
197		445
198	async {	446	async {
199	print "@_\n";	447	print "@_\n";
200	} 1,2,3,4;	448	} 1,2,3,4;
201		449
202	=cut
203
204	sub async(&@) {
205	my $coro = new Coro @_;
206	$coro->ready;
207	$coro
208	}
209
210	=item async_pool { ... } [@args...]	450	=item async_pool { ... } [@args...]
211		451
212	Similar to C<async>, but uses a coroutine pool, so you should not call	452	Similar to C<async>, but uses a coro pool, so you should not call
213	terminate or join on it (although you are allowed to), and you get a	453	terminate or join on it (although you are allowed to), and you get a
214	coroutine that might have executed other code already (which can be good	454	coro that might have executed other code already (which can be good
215	or bad :).	455	or bad :).
216		456
217	On the plus side, this function is faster than creating (and destroying)	457	On the plus side, this function is about twice as fast as creating (and
218	a completly new coroutine, so if you need a lot of generic coroutines in	458	destroying) a completely new coro, so if you need a lot of generic
219	quick successsion, use C<async_pool>, not C<async>.	459	coros in quick successsion, use C<async_pool>, not C<async>.
220		460
221	The code block is executed in an C<eval> context and a warning will be	461	The code block is executed in an C<eval> context and a warning will be
222	issued in case of an exception instead of terminating the program, as	462	issued in case of an exception instead of terminating the program, as
223	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>	463	C<async> does. As the coro is being reused, stuff like C<on_destroy>
224	will not work in the expected way, unless you call terminate or cancel,	464	will not work in the expected way, unless you call terminate or cancel,
225	which somehow defeats the purpose of pooling (but is fine in the	465	which somehow defeats the purpose of pooling (but is fine in the
226	exceptional case).	466	exceptional case).
227		467
228	The priority will be reset to C<0> after each run, tracing will be	468	The priority will be reset to C<0> after each run, tracing will be
229	disabled, the description will be reset and the default output filehandle	469	disabled, the description will be reset and the default output filehandle
230	gets restored, so you can change all these. Otherwise the coroutine will	470	gets restored, so you can change all these. Otherwise the coro will
231	be re-used "as-is": most notably if you change other per-coroutine global	471	be re-used "as-is": most notably if you change other per-coro global
232	stuff such as C<$/> you I<must needs> revert that change, which is most	472	stuff such as C<$/> you I<must needs> revert that change, which is most
233	simply done by using local as in: C<< local $/ >>.	473	simply done by using local as in: C<< local $/ >>.
234		474
235	The idle pool size is limited to C<8> idle coroutines (this can be	475	The idle pool size is limited to C<8> idle coros (this can be
236	adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle	476	adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
237	coros as required.	477	coros as required.
238		478
239	If you are concerned about pooled coroutines growing a lot because a	479	If you are concerned about pooled coros growing a lot because a
240	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool	480	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
241	{ terminate }> once per second or so to slowly replenish the pool. In	481	{ terminate }> once per second or so to slowly replenish the pool. In
242	addition to that, when the stacks used by a handler grows larger than 16kb	482	addition to that, when the stacks used by a handler grows larger than 32kb
243	(adjustable via $Coro::POOL_RSS) it will also be destroyed.	483	(adjustable via $Coro::POOL_RSS) it will also be destroyed.
244		484
245	=cut	485	=cut
246		486
247	our $POOL_SIZE = 8;	487	our $POOL_SIZE = 8;
248	our $POOL_RSS = 16 * 1024;	488	our $POOL_RSS = 32 * 1024;
249	our @async_pool;	489	our @async_pool;
250		490
251	sub pool_handler {	491	sub pool_handler {
252	my $cb;
253
254	while () {	492	while () {
255	eval {	493	eval {
256	while () {	494	&{&_pool_handler} while 1;
257	_pool_1 $cb;
258	&$cb;
259	_pool_2 $cb;
260	&schedule;
261	}
262	};	495	};
263		496
264	if ($@) {
265	last if $@ eq "\3async_pool terminate\2\n";
266	warn $@;	497	warn $@ if $@;
267	}
268	}	498	}
269	}	499	}
270		500
271	sub async_pool(&@) {
272	# this is also inlined into the unblock_scheduler
273	my $coro = (pop @async_pool) || new Coro \&pool_handler;
274
275	$coro->{_invoke} = [@_];
276	$coro->ready;
277
278	$coro
279	}
280
281	=back	501	=back
282		502
283	=head2 STATIC METHODS	503	=head1 STATIC METHODS
284		504
285	Static methods are actually functions that operate on the current coroutine.	505	Static methods are actually functions that implicitly operate on the
		506	current coro.
286		507
287	=over 4	508	=over 4
288		509
289	=item schedule	510	=item schedule
290		511
291	Calls the scheduler. The scheduler will find the next coroutine that is	512	Calls the scheduler. The scheduler will find the next coro that is
292	to be run from the ready queue and switches to it. The next coroutine	513	to be run from the ready queue and switches to it. The next coro
293	to be run is simply the one with the highest priority that is longest	514	to be run is simply the one with the highest priority that is longest
294	in its ready queue. If there is no coroutine ready, it will clal the	515	in its ready queue. If there is no coro ready, it will call the
295	C<$Coro::idle> hook.	516	C<$Coro::idle> hook.
296		517
297	Please note that the current coroutine will I<not> be put into the ready	518	Please note that the current coro will I<not> be put into the ready
298	queue, so calling this function usually means you will never be called	519	queue, so calling this function usually means you will never be called
299	again unless something else (e.g. an event handler) calls C<< ->ready >>,	520	again unless something else (e.g. an event handler) calls C<< ->ready >>,
300	thus waking you up.	521	thus waking you up.
301		522
302	This makes C<schedule> I<the> generic method to use to block the current	523	This makes C<schedule> I<the> generic method to use to block the current
303	coroutine and wait for events: first you remember the current coroutine in	524	coro and wait for events: first you remember the current coro in
304	a variable, then arrange for some callback of yours to call C<< ->ready	525	a variable, then arrange for some callback of yours to call C<< ->ready
305	>> on that once some event happens, and last you call C<schedule> to put	526	>> on that once some event happens, and last you call C<schedule> to put
306	yourself to sleep. Note that a lot of things can wake your coroutine up,	527	yourself to sleep. Note that a lot of things can wake your coro up,
307	so you need to check whether the event indeed happened, e.g. by storing the	528	so you need to check whether the event indeed happened, e.g. by storing the
308	status in a variable.	529	status in a variable.
309		530
310	The canonical way to wait on external events is this:	531	See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
311		532
312	{	533	=item cede
313	# remember current coroutine
314	my $current = $Coro::current;
315		534
316	# register a hypothetical event handler	535	"Cede" to other coros. This function puts the current coro into
317	on_event_invoke sub {	536	the ready queue and calls C<schedule>, which has the effect of giving
318	# wake up sleeping coroutine	537	up the current "timeslice" to other coros of the same or higher
319	$current->ready;	538	priority. Once your coro gets its turn again it will automatically be
320	undef $current;	539	resumed.
		540
		541	This function is often called C<yield> in other languages.
		542
		543	=item Coro::cede_notself
		544
		545	Works like cede, but is not exported by default and will cede to I<any>
		546	coro, regardless of priority. This is useful sometimes to ensure
		547	progress is made.
		548
		549	=item terminate [arg...]
		550
		551	Terminates the current coro with the given status values (see
		552	L<cancel>). The values will not be copied, but referenced directly.
		553
		554	=item Coro::on_enter BLOCK, Coro::on_leave BLOCK
		555
		556	These function install enter and leave winders in the current scope. The
		557	enter block will be executed when on_enter is called and whenever the
		558	current coro is re-entered by the scheduler, while the leave block is
		559	executed whenever the current coro is blocked by the scheduler, and
		560	also when the containing scope is exited (by whatever means, be it exit,
		561	die, last etc.).
		562
		563	I<Neither invoking the scheduler, nor exceptions, are allowed within those
		564	BLOCKs>. That means: do not even think about calling C<die> without an
		565	eval, and do not even think of entering the scheduler in any way.
		566
		567	Since both BLOCKs are tied to the current scope, they will automatically
		568	be removed when the current scope exits.
		569
		570	These functions implement the same concept as C<dynamic-wind> in scheme
		571	does, and are useful when you want to localise some resource to a specific
		572	coro.
		573
		574	They slow down thread switching considerably for coros that use them
		575	(about 40% for a BLOCK with a single assignment, so thread switching is
		576	still reasonably fast if the handlers are fast).
		577
		578	These functions are best understood by an example: The following function
		579	will change the current timezone to "Antarctica/South_Pole", which
		580	requires a call to C<tzset>, but by using C<on_enter> and C<on_leave>,
		581	which remember/change the current timezone and restore the previous
		582	value, respectively, the timezone is only changed for the coro that
		583	installed those handlers.
		584
		585	use POSIX qw(tzset);
		586
		587	async {
		588	my $old_tz; # store outside TZ value here
		589
		590	Coro::on_enter {
		591	$old_tz = $ENV{TZ}; # remember the old value
		592
		593	$ENV{TZ} = "Antarctica/South_Pole";
		594	tzset; # enable new value
321	};	595	};
322		596
323	# call schedule until event occurred.	597	Coro::on_leave {
324	# in case we are woken up for other reasons	598	$ENV{TZ} = $old_tz;
325	# (current still defined), loop.	599	tzset; # restore old value
326	Coro::schedule while $current;	600	};
		601
		602	# at this place, the timezone is Antarctica/South_Pole,
		603	# without disturbing the TZ of any other coro.
327	}	604	};
328		605
329	=item cede	606	This can be used to localise about any resource (locale, uid, current
		607	working directory etc.) to a block, despite the existance of other
		608	coros.
330		609
331	"Cede" to other coroutines. This function puts the current coroutine into	610	Another interesting example implements time-sliced multitasking using
332	the ready queue and calls C<schedule>, which has the effect of giving	611	interval timers (this could obviously be optimised, but does the job):
333	up the current "timeslice" to other coroutines of the same or higher
334	priority. Once your coroutine gets its turn again it will automatically be
335	resumed.
336		612
337	This function is often called C<yield> in other languages.	613	# "timeslice" the given block
		614	sub timeslice(&) {
		615	use Time::HiRes ();
338		616
339	=item Coro::cede_notself	617	Coro::on_enter {
		618	# on entering the thread, we set an VTALRM handler to cede
		619	$SIG{VTALRM} = sub { cede };
		620	# and then start the interval timer
		621	Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0.01, 0.01;
		622	};
		623	Coro::on_leave {
		624	# on leaving the thread, we stop the interval timer again
		625	Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0, 0;
		626	};
340		627
341	Works like cede, but is not exported by default and will cede to I<any>	628	&{+shift};
342	coroutine, regardless of priority. This is useful sometimes to ensure	629	}
343	progress is made.
344		630
345	=item terminate [arg...]	631	# use like this:
		632	timeslice {
		633	# The following is an endless loop that would normally
		634	# monopolise the process. Since it runs in a timesliced
		635	# environment, it will regularly cede to other threads.
		636	while () { }
		637	};
346		638
347	Terminates the current coroutine with the given status values (see L<cancel>).
348		639
349	=item killall	640	=item killall
350		641
351	Kills/terminates/cancels all coroutines except the currently running	642	Kills/terminates/cancels all coros except the currently running one.
352	one. This is useful after a fork, either in the child or the parent, as
353	usually only one of them should inherit the running coroutines.
354		643
355	Note that while this will try to free some of the main programs resources,	644	Note that while this will try to free some of the main interpreter
		645	resources if the calling coro isn't the main coro, but one
356	you cannot free all of them, so if a coroutine that is not the main	646	cannot free all of them, so if a coro that is not the main coro
357	program calls this function, there will be some one-time resource leak.	647	calls this function, there will be some one-time resource leak.
358		648
359	=cut	649	=cut
360
361	sub terminate {
362	$current->cancel (@_);
363	}
364		650
365	sub killall {	651	sub killall {
366	for (Coro::State::list) {	652	for (Coro::State::list) {
367	$_->cancel	653	$_->cancel
368	if $_ != $current && UNIVERSAL::isa $_, "Coro";	654	if $_ != $current && UNIVERSAL::isa $_, "Coro";
369	}	655	}
370	}	656	}
371		657
372	=back	658	=back
373		659
374	=head2 COROUTINE METHODS	660	=head1 CORO OBJECT METHODS
375		661
376	These are the methods you can call on coroutine objects (or to create	662	These are the methods you can call on coro objects (or to create
377	them).	663	them).
378		664
379	=over 4	665	=over 4
380		666
381	=item new Coro \&sub [, @args...]	667	=item new Coro \&sub [, @args...]
382		668
383	Create a new coroutine and return it. When the sub returns, the coroutine	669	Create a new coro and return it. When the sub returns, the coro
384	automatically terminates as if C<terminate> with the returned values were	670	automatically terminates as if C<terminate> with the returned values were
385	called. To make the coroutine run you must first put it into the ready	671	called. To make the coro run you must first put it into the ready
386	queue by calling the ready method.	672	queue by calling the ready method.
387		673
388	See C<async> and C<Coro::State::new> for additional info about the	674	See C<async> and C<Coro::State::new> for additional info about the
389	coroutine environment.	675	coro environment.
390		676
391	=cut	677	=cut
392		678
393	sub _run_coro {	679	sub _coro_run {
394	terminate &{+shift};	680	terminate &{+shift};
395	}	681	}
396		682
397	sub new {
398	my $class = shift;
399
400	$class->SUPER::new (\&_run_coro, @_)
401	}
402
403	=item $success = $coroutine->ready	683	=item $success = $coro->ready
404		684
405	Put the given coroutine into the end of its ready queue (there is one	685	Put the given coro into the end of its ready queue (there is one
406	queue for each priority) and return true. If the coroutine is already in	686	queue for each priority) and return true. If the coro is already in
407	the ready queue, do nothing and return false.	687	the ready queue, do nothing and return false.
408		688
409	This ensures that the scheduler will resume this coroutine automatically	689	This ensures that the scheduler will resume this coro automatically
410	once all the coroutines of higher priority and all coroutines of the same	690	once all the coro of higher priority and all coro of the same
411	priority that were put into the ready queue earlier have been resumed.	691	priority that were put into the ready queue earlier have been resumed.
412		692
		693	=item $coro->suspend
		694
		695	Suspends the specified coro. A suspended coro works just like any other
		696	coro, except that the scheduler will not select a suspended coro for
		697	execution.
		698
		699	Suspending a coro can be useful when you want to keep the coro from
		700	running, but you don't want to destroy it, or when you want to temporarily
		701	freeze a coro (e.g. for debugging) to resume it later.
		702
		703	A scenario for the former would be to suspend all (other) coros after a
		704	fork and keep them alive, so their destructors aren't called, but new
		705	coros can be created.
		706
		707	=item $coro->resume
		708
		709	If the specified coro was suspended, it will be resumed. Note that when
		710	the coro was in the ready queue when it was suspended, it might have been
		711	unreadied by the scheduler, so an activation might have been lost.
		712
		713	To avoid this, it is best to put a suspended coro into the ready queue
		714	unconditionally, as every synchronisation mechanism must protect itself
		715	against spurious wakeups, and the one in the Coro family certainly do
		716	that.
		717
413	=item $is_ready = $coroutine->is_ready	718	=item $is_ready = $coro->is_ready
414		719
415	Return whether the coroutine is currently the ready queue or not,	720	Returns true iff the Coro object is in the ready queue. Unless the Coro
		721	object gets destroyed, it will eventually be scheduled by the scheduler.
416		722
		723	=item $is_running = $coro->is_running
		724
		725	Returns true iff the Coro object is currently running. Only one Coro object
		726	can ever be in the running state (but it currently is possible to have
		727	multiple running Coro::States).
		728
		729	=item $is_suspended = $coro->is_suspended
		730
		731	Returns true iff this Coro object has been suspended. Suspended Coros will
		732	not ever be scheduled.
		733
417	=item $coroutine->cancel (arg...)	734	=item $coro->cancel (arg...)
418		735
419	Terminates the given coroutine and makes it return the given arguments as	736	Terminates the given Coro thread and makes it return the given arguments as
420	status (default: the empty list). Never returns if the coroutine is the	737	status (default: an empty list). Never returns if the Coro is the
421	current coroutine.	738	current Coro.
422		739
423	=cut	740	This is a rather brutal way to free a coro, with some limitations - if
		741	the thread is inside a C callback that doesn't expect to be canceled,
		742	bad things can happen, or if the cancelled thread insists on running
		743	complicated cleanup handlers that rely on it'S thread context, things will
		744	not work.
424		745
425	sub cancel {	746	Any cleanup code being run (e.g. from C<guard> blocks) will be run without
426	my $self = shift;	747	a thread context, and is not allowed to switch to other threads. On the
427	$self->{_status} = [@_];	748	plus side, C<< ->cancel >> will always clean up the thread, no matter
		749	what. If your cleanup code is complex or you want to avoid cancelling a
		750	C-thread that doesn't know how to clean up itself, it can be better to C<<
		751	->throw >> an exception, or use C<< ->safe_cancel >>.
428		752
429	if ($current == $self) {	753	The arguments to C<< ->cancel >> are not copied, but instead will
430	push @destroy, $self;	754	be referenced directly (e.g. if you pass C<$var> and after the call
431	$manager->ready;	755	change that variable, then you might change the return values passed to
432	&schedule while 1;	756	e.g. C<join>, so don't do that).
433	} else {	757
434	$self->_cancel;	758	The resources of the Coro are usually freed (or destructed) before this
		759	call returns, but this can be delayed for an indefinite amount of time, as
		760	in some cases the manager thread has to run first to actually destruct the
		761	Coro object.
		762
		763	=item $coro->safe_cancel ($arg...)
		764
		765	Works mostly like C<< ->cancel >>, but is inherently "safer", and
		766	consequently, can fail with an exception in cases the thread is not in a
		767	cancellable state.
		768
		769	This method works a bit like throwing an exception that cannot be caught
		770	- specifically, it will clean up the thread from within itself, so
		771	all cleanup handlers (e.g. C<guard> blocks) are run with full thread
		772	context and can block if they wish. The downside is that there is no
		773	guarantee that the thread can be cancelled when you call this method, and
		774	therefore, it might fail. It is also considerably slower than C<cancel> or
		775	C<terminate>.
		776
		777	A thread is in a safe-cancellable state if it either hasn't been run yet,
		778	or it has no C context attached and is inside an SLF function.
		779
		780	The latter two basically mean that the thread isn't currently inside a
		781	perl callback called from some C function (usually via some XS modules)
		782	and isn't currently executing inside some C function itself (via Coro's XS
		783	API).
		784
		785	This call returns true when it could cancel the thread, or croaks with an
		786	error otherwise (i.e. it either returns true or doesn't return at all).
		787
		788	Why the weird interface? Well, there are two common models on how and
		789	when to cancel things. In the first, you have the expectation that your
		790	coro thread can be cancelled when you want to cancel it - if the thread
		791	isn't cancellable, this would be a bug somewhere, so C<< ->safe_cancel >>
		792	croaks to notify of the bug.
		793
		794	In the second model you sometimes want to ask nicely to cancel a thread,
		795	but if it's not a good time, well, then don't cancel. This can be done
		796	relatively easy like this:
		797
		798	if (! eval { $coro->safe_cancel }) {
		799	warn "unable to cancel thread: $@";
435	}	800	}
436	}
437		801
		802	However, what you never should do is first try to cancel "safely" and
		803	if that fails, cancel the "hard" way with C<< ->cancel >>. That makes
		804	no sense: either you rely on being able to execute cleanup code in your
		805	thread context, or you don't. If you do, then C<< ->safe_cancel >> is the
		806	only way, and if you don't, then C<< ->cancel >> is always faster and more
		807	direct.
		808
		809	=item $coro->schedule_to
		810
		811	Puts the current coro to sleep (like C<Coro::schedule>), but instead
		812	of continuing with the next coro from the ready queue, always switch to
		813	the given coro object (regardless of priority etc.). The readyness
		814	state of that coro isn't changed.
		815
		816	This is an advanced method for special cases - I'd love to hear about any
		817	uses for this one.
		818
		819	=item $coro->cede_to
		820
		821	Like C<schedule_to>, but puts the current coro into the ready
		822	queue. This has the effect of temporarily switching to the given
		823	coro, and continuing some time later.
		824
		825	This is an advanced method for special cases - I'd love to hear about any
		826	uses for this one.
		827
438	=item $coroutine->throw ([$scalar])	828	=item $coro->throw ([$scalar])
439		829
440	If C<$throw> is specified and defined, it will be thrown as an exception	830	If C<$throw> is specified and defined, it will be thrown as an exception
441	inside the coroutine at the next convenient point in time (usually after	831	inside the coro at the next convenient point in time. Otherwise
442	it gains control at the next schedule/transfer/cede). Otherwise clears the
443	exception object.	832	clears the exception object.
		833
		834	Coro will check for the exception each time a schedule-like-function
		835	returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
		836	>>, C<< Coro::Handle->readable >> and so on. Most of those functions (all
		837	that are part of Coro itself) detect this case and return early in case an
		838	exception is pending.
444		839
445	The exception object will be thrown "as is" with the specified scalar in	840	The exception object will be thrown "as is" with the specified scalar in
446	C<$@>, i.e. if it is a string, no line number or newline will be appended	841	C<$@>, i.e. if it is a string, no line number or newline will be appended
447	(unlike with C<die>).	842	(unlike with C<die>).
448		843
449	This can be used as a softer means than C<cancel> to ask a coroutine to	844	This can be used as a softer means than either C<cancel> or C<safe_cancel
450	end itself, although there is no guarantee that the exception will lead to	845	>to ask a coro to end itself, although there is no guarantee that the
451	termination, and if the exception isn't caught it might well end the whole	846	exception will lead to termination, and if the exception isn't caught it
452	program.	847	might well end the whole program.
453		848
454	You might also think of C<throw> as being the moral equivalent of	849	You might also think of C<throw> as being the moral equivalent of
455	C<kill>ing a coroutine with a signal (in this case, a scalar).	850	C<kill>ing a coro with a signal (in this case, a scalar).
456		851
457	=item $coroutine->join	852	=item $coro->join
458		853
459	Wait until the coroutine terminates and return any values given to the	854	Wait until the coro terminates and return any values given to the
460	C<terminate> or C<cancel> functions. C<join> can be called concurrently	855	C<terminate> or C<cancel> functions. C<join> can be called concurrently
461	from multiple coroutines, and all will be resumed and given the status	856	from multiple threads, and all will be resumed and given the status
462	return once the C<$coroutine> terminates.	857	return once the C<$coro> terminates.
463		858
464	=cut	859	=cut
465		860
466	sub join {	861	sub join {
467	my $self = shift;	862	my $self = shift;
…		…
475	};	870	};
476		871
477	&schedule while $current;	872	&schedule while $current;
478	}	873	}
479		874
480	wantarray ? @{$self->{_status}} : $self->{_status}[0];	875	wantarray ? @{$self->{_status}} : $self->{_status}[0]
481	}	876	}
482		877
483	=item $coroutine->on_destroy (\&cb)	878	=item $coro->on_destroy (\&cb)
484		879
485	Registers a callback that is called when this coroutine gets destroyed,	880	Registers a callback that is called when this coro thread gets destroyed,
486	but before it is joined. The callback gets passed the terminate arguments,	881	that is, after it's resources have been freed but before it is joined. The
		882	callback gets passed the terminate/cancel arguments, if any, and I<must
487	if any, and I<must not> die, under any circumstances.	883	not> die, under any circumstances.
		884
		885	There can be any number of C<on_destroy> callbacks per coro, and there is
		886	no way currently to remove a callback once added.
488		887
489	=cut	888	=cut
490		889
491	sub on_destroy {	890	sub on_destroy {
492	my ($self, $cb) = @_;	891	my ($self, $cb) = @_;
493		892
494	push @{ $self->{_on_destroy} }, $cb;	893	push @{ $self->{_on_destroy} }, $cb;
495	}	894	}
496		895
497	=item $oldprio = $coroutine->prio ($newprio)	896	=item $oldprio = $coro->prio ($newprio)
498		897
499	Sets (or gets, if the argument is missing) the priority of the	898	Sets (or gets, if the argument is missing) the priority of the
500	coroutine. Higher priority coroutines get run before lower priority	899	coro thread. Higher priority coro get run before lower priority
501	coroutines. Priorities are small signed integers (currently -4 .. +3),	900	coros. Priorities are small signed integers (currently -4 .. +3),
502	that you can refer to using PRIO_xxx constants (use the import tag :prio	901	that you can refer to using PRIO_xxx constants (use the import tag :prio
503	to get then):	902	to get then):
504		903
505	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN	904	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
506	3 > 1 > 0 > -1 > -3 > -4	905	3 > 1 > 0 > -1 > -3 > -4
507		906
508	# set priority to HIGH	907	# set priority to HIGH
509	current->prio(PRIO_HIGH);	908	current->prio (PRIO_HIGH);
510		909
511	The idle coroutine ($Coro::idle) always has a lower priority than any	910	The idle coro thread ($Coro::idle) always has a lower priority than any
512	existing coroutine.	911	existing coro.
513		912
514	Changing the priority of the current coroutine will take effect immediately,	913	Changing the priority of the current coro will take effect immediately,
515	but changing the priority of coroutines in the ready queue (but not	914	but changing the priority of a coro in the ready queue (but not running)
516	running) will only take effect after the next schedule (of that	915	will only take effect after the next schedule (of that coro). This is a
517	coroutine). This is a bug that will be fixed in some future version.	916	bug that will be fixed in some future version.
518		917
519	=item $newprio = $coroutine->nice ($change)	918	=item $newprio = $coro->nice ($change)
520		919
521	Similar to C<prio>, but subtract the given value from the priority (i.e.	920	Similar to C<prio>, but subtract the given value from the priority (i.e.
522	higher values mean lower priority, just as in unix).	921	higher values mean lower priority, just as in UNIX's nice command).
523		922
524	=item $olddesc = $coroutine->desc ($newdesc)	923	=item $olddesc = $coro->desc ($newdesc)
525		924
526	Sets (or gets in case the argument is missing) the description for this	925	Sets (or gets in case the argument is missing) the description for this
527	coroutine. This is just a free-form string you can associate with a	926	coro thread. This is just a free-form string you can associate with a
528	coroutine.	927	coro.
529		928
530	This method simply sets the C<< $coroutine->{desc} >> member to the given	929	This method simply sets the C<< $coro->{desc} >> member to the given
531	string. You can modify this member directly if you wish.	930	string. You can modify this member directly if you wish, and in fact, this
		931	is often preferred to indicate major processing states that cna then be
		932	seen for example in a L<Coro::Debug> session:
		933
		934	sub my_long_function {
		935	local $Coro::current->{desc} = "now in my_long_function";
		936	...
		937	$Coro::current->{desc} = "my_long_function: phase 1";
		938	...
		939	$Coro::current->{desc} = "my_long_function: phase 2";
		940	...
		941	}
532		942
533	=cut	943	=cut
534		944
535	sub desc {	945	sub desc {
536	my $old = $_[0]{desc};	946	my $old = $_[0]{desc};
537	$_[0]{desc} = $_[1] if @_ > 1;	947	$_[0]{desc} = $_[1] if @_ > 1;
538	$old;	948	$old;
539	}	949	}
540		950
		951	sub transfer {
		952	require Carp;
		953	Carp::croak ("You must not call ->transfer on Coro objects. Use Coro::State objects or the ->schedule_to method. Caught");
		954	}
		955
541	=back	956	=back
542		957
543	=head2 GLOBAL FUNCTIONS	958	=head1 GLOBAL FUNCTIONS
544		959
545	=over 4	960	=over 4
546		961
547	=item Coro::nready	962	=item Coro::nready
548		963
549	Returns the number of coroutines that are currently in the ready state,	964	Returns the number of coro that are currently in the ready state,
550	i.e. that can be switched to by calling C<schedule> directory or	965	i.e. that can be switched to by calling C<schedule> directory or
551	indirectly. The value C<0> means that the only runnable coroutine is the	966	indirectly. The value C<0> means that the only runnable coro is the
552	currently running one, so C<cede> would have no effect, and C<schedule>	967	currently running one, so C<cede> would have no effect, and C<schedule>
553	would cause a deadlock unless there is an idle handler that wakes up some	968	would cause a deadlock unless there is an idle handler that wakes up some
554	coroutines.	969	coro.
555		970
556	=item my $guard = Coro::guard { ... }	971	=item my $guard = Coro::guard { ... }
557		972
558	This creates and returns a guard object. Nothing happens until the object	973	This function still exists, but is deprecated. Please use the
559	gets destroyed, in which case the codeblock given as argument will be	974	C<Guard::guard> function instead.
560	executed. This is useful to free locks or other resources in case of a
561	runtime error or when the coroutine gets canceled, as in both cases the
562	guard block will be executed. The guard object supports only one method,
563	C<< ->cancel >>, which will keep the codeblock from being executed.
564		975
565	Example: set some flag and clear it again when the coroutine gets canceled
566	or the function returns:
567
568	sub do_something {
569	my $guard = Coro::guard { $busy = 0 };
570	$busy = 1;
571
572	# do something that requires $busy to be true
573	}
574
575	=cut	976	=cut
576		977
577	sub guard(&) {	978	BEGIN { *guard = \&Guard::guard }
578	bless \(my $cb = $_[0]), "Coro::guard"
579	}
580
581	sub Coro::guard::cancel {
582	${$_[0]} = sub { };
583	}
584
585	sub Coro::guard::DESTROY {
586	${$_[0]}->();
587	}
588
589		979
590	=item unblock_sub { ... }	980	=item unblock_sub { ... }
591		981
592	This utility function takes a BLOCK or code reference and "unblocks" it,	982	This utility function takes a BLOCK or code reference and "unblocks" it,
593	returning a new coderef. Unblocking means that calling the new coderef	983	returning a new coderef. Unblocking means that calling the new coderef
594	will return immediately without blocking, returning nothing, while the	984	will return immediately without blocking, returning nothing, while the
595	original code ref will be called (with parameters) from within another	985	original code ref will be called (with parameters) from within another
596	coroutine.	986	coro.
597		987
598	The reason this function exists is that many event libraries (such as the	988	The reason this function exists is that many event libraries (such as
599	venerable L<Event|Event> module) are not coroutine-safe (a weaker form	989	the venerable L<Event|Event> module) are not thread-safe (a weaker form
600	of thread-safety). This means you must not block within event callbacks,	990	of reentrancy). This means you must not block within event callbacks,
601	otherwise you might suffer from crashes or worse. The only event library	991	otherwise you might suffer from crashes or worse. The only event library
602	currently known that is safe to use without C<unblock_sub> is L<EV>.	992	currently known that is safe to use without C<unblock_sub> is L<EV> (but
		993	you might still run into deadlocks if all event loops are blocked).
		994
		995	Coro will try to catch you when you block in the event loop
		996	("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
		997	only works when you do not run your own event loop.
603		998
604	This function allows your callbacks to block by executing them in another	999	This function allows your callbacks to block by executing them in another
605	coroutine where it is safe to block. One example where blocking is handy	1000	coro where it is safe to block. One example where blocking is handy
606	is when you use the L<Coro::AIO|Coro::AIO> functions to save results to	1001	is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
607	disk, for example.	1002	disk, for example.
608		1003
609	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when	1004	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
610	creating event callbacks that want to block.	1005	creating event callbacks that want to block.
611		1006
612	If your handler does not plan to block (e.g. simply sends a message to	1007	If your handler does not plan to block (e.g. simply sends a message to
613	another coroutine, or puts some other coroutine into the ready queue),	1008	another coro, or puts some other coro into the ready queue), there is
614	there is no reason to use C<unblock_sub>.	1009	no reason to use C<unblock_sub>.
615		1010
616	Note that you also need to use C<unblock_sub> for any other callbacks that	1011	Note that you also need to use C<unblock_sub> for any other callbacks that
617	are indirectly executed by any C-based event loop. For example, when you	1012	are indirectly executed by any C-based event loop. For example, when you
618	use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it	1013	use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
619	provides callbacks that are the result of some event callback, then you	1014	provides callbacks that are the result of some event callback, then you
…		…
628	# return immediately and can be reused) and because we cannot cede	1023	# return immediately and can be reused) and because we cannot cede
629	# inside an event callback.	1024	# inside an event callback.
630	our $unblock_scheduler = new Coro sub {	1025	our $unblock_scheduler = new Coro sub {
631	while () {	1026	while () {
632	while (my $cb = pop @unblock_queue) {	1027	while (my $cb = pop @unblock_queue) {
633	# this is an inlined copy of async_pool	1028	&async_pool (@$cb);
634	my $coro = (pop @async_pool) || new Coro \&pool_handler;
635		1029
636	$coro->{_invoke} = $cb;
637	$coro->ready;
638	cede; # for short-lived callbacks, this reduces pressure on the coro pool	1030	# for short-lived callbacks, this reduces pressure on the coro pool
		1031	# as the chance is very high that the async_poll coro will be back
		1032	# in the idle state when cede returns
		1033	cede;
639	}	1034	}
640	schedule; # sleep well	1035	schedule; # sleep well
641	}	1036	}
642	};	1037	};
643	$unblock_scheduler->{desc} = "[unblock_sub scheduler]";	1038	$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
…		…
649	unshift @unblock_queue, [$cb, @_];	1044	unshift @unblock_queue, [$cb, @_];
650	$unblock_scheduler->ready;	1045	$unblock_scheduler->ready;
651	}	1046	}
652	}	1047	}
653		1048
		1049	=item $cb = rouse_cb
		1050
		1051	Create and return a "rouse callback". That's a code reference that,
		1052	when called, will remember a copy of its arguments and notify the owner
		1053	coro of the callback.
		1054
		1055	See the next function.
		1056
		1057	=item @args = rouse_wait [$cb]
		1058
		1059	Wait for the specified rouse callback (or the last one that was created in
		1060	this coro).
		1061
		1062	As soon as the callback is invoked (or when the callback was invoked
		1063	before C<rouse_wait>), it will return the arguments originally passed to
		1064	the rouse callback. In scalar context, that means you get the I<last>
		1065	argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
		1066	statement at the end.
		1067
		1068	See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
		1069
654	=back	1070	=back
655		1071
656	=cut	1072	=cut
657		1073
		1074	for my $module (qw(Channel RWLock Semaphore SemaphoreSet Signal Specific)) {
		1075	my $old = defined &{"Coro::$module\::new"} && \&{"Coro::$module\::new"};
		1076
		1077	*{"Coro::$module\::new"} = sub {
		1078	require "Coro/$module.pm";
		1079
		1080	# some modules have their new predefined in State.xs, some don't
		1081	*{"Coro::$module\::new"} = $old
		1082	if $old;
		1083
		1084	goto &{"Coro::$module\::new"};
		1085	};
		1086	}
		1087
658	1;	1088	1;
		1089
		1090	=head1 HOW TO WAIT FOR A CALLBACK
		1091
		1092	It is very common for a coro to wait for some callback to be
		1093	called. This occurs naturally when you use coro in an otherwise
		1094	event-based program, or when you use event-based libraries.
		1095
		1096	These typically register a callback for some event, and call that callback
		1097	when the event occured. In a coro, however, you typically want to
		1098	just wait for the event, simplyifying things.
		1099
		1100	For example C<< AnyEvent->child >> registers a callback to be called when
		1101	a specific child has exited:
		1102
		1103	my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
		1104
		1105	But from within a coro, you often just want to write this:
		1106
		1107	my $status = wait_for_child $pid;
		1108
		1109	Coro offers two functions specifically designed to make this easy,
		1110	C<Coro::rouse_cb> and C<Coro::rouse_wait>.
		1111
		1112	The first function, C<rouse_cb>, generates and returns a callback that,
		1113	when invoked, will save its arguments and notify the coro that
		1114	created the callback.
		1115
		1116	The second function, C<rouse_wait>, waits for the callback to be called
		1117	(by calling C<schedule> to go to sleep) and returns the arguments
		1118	originally passed to the callback.
		1119
		1120	Using these functions, it becomes easy to write the C<wait_for_child>
		1121	function mentioned above:
		1122
		1123	sub wait_for_child($) {
		1124	my ($pid) = @_;
		1125
		1126	my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
		1127
		1128	my ($rpid, $rstatus) = Coro::rouse_wait;
		1129	$rstatus
		1130	}
		1131
		1132	In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
		1133	you can roll your own, using C<schedule>:
		1134
		1135	sub wait_for_child($) {
		1136	my ($pid) = @_;
		1137
		1138	# store the current coro in $current,
		1139	# and provide result variables for the closure passed to ->child
		1140	my $current = $Coro::current;
		1141	my ($done, $rstatus);
		1142
		1143	# pass a closure to ->child
		1144	my $watcher = AnyEvent->child (pid => $pid, cb => sub {
		1145	$rstatus = $_[1]; # remember rstatus
		1146	$done = 1; # mark $rstatus as valud
		1147	});
		1148
		1149	# wait until the closure has been called
		1150	schedule while !$done;
		1151
		1152	$rstatus
		1153	}
		1154
659		1155
660	=head1 BUGS/LIMITATIONS	1156	=head1 BUGS/LIMITATIONS
661		1157
662	=over 4	1158	=over 4
663		1159
664	=item fork with pthread backend	1160	=item fork with pthread backend
665		1161
666	When Coro is compiled using the pthread backend (which isn't recommended	1162	When Coro is compiled using the pthread backend (which isn't recommended
667	but required on many BSDs as their libcs are completely broken), then	1163	but required on many BSDs as their libcs are completely broken), then
668	coroutines will not survive a fork. There is no known workaround except to	1164	coro will not survive a fork. There is no known workaround except to
669	fix your libc and use a saner backend.	1165	fix your libc and use a saner backend.
670		1166
671	=item perl process emulation ("threads")	1167	=item perl process emulation ("threads")
672		1168
673	This module is not perl-pseudo-thread-safe. You should only ever use this	1169	This module is not perl-pseudo-thread-safe. You should only ever use this
674	module from the same thread (this requirement might be removed in the	1170	module from the first thread (this requirement might be removed in the
675	future to allow per-thread schedulers, but Coro::State does not yet allow	1171	future to allow per-thread schedulers, but Coro::State does not yet allow
676	this). I recommend disabling thread support and using processes, as having	1172	this). I recommend disabling thread support and using processes, as having
677	the windows process emulation enabled under unix roughly halves perl	1173	the windows process emulation enabled under unix roughly halves perl
678	performance, even when not used.	1174	performance, even when not used.
679		1175
680	=item coroutine switching not signal safe	1176	=item coro switching is not signal safe
681		1177
682	You must not switch to another coroutine from within a signal handler	1178	You must not switch to another coro from within a signal handler (only
683	(only relevant with %SIG - most event libraries provide safe signals).	1179	relevant with %SIG - most event libraries provide safe signals), I<unless>
		1180	you are sure you are not interrupting a Coro function.
684		1181
685	That means you I<MUST NOT> call any function that might "block" the	1182	That means you I<MUST NOT> call any function that might "block" the
686	current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or	1183	current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
687	anything that calls those. Everything else, including calling C<ready>,	1184	anything that calls those. Everything else, including calling C<ready>,
688	works.	1185	works.
689		1186
690	=back	1187	=back
691		1188
692		1189
		1190	=head1 WINDOWS PROCESS EMULATION
		1191
		1192	A great many people seem to be confused about ithreads (for example, Chip
		1193	Salzenberg called me unintelligent, incapable, stupid and gullible,
		1194	while in the same mail making rather confused statements about perl
		1195	ithreads (for example, that memory or files would be shared), showing his
		1196	lack of understanding of this area - if it is hard to understand for Chip,
		1197	it is probably not obvious to everybody).
		1198
		1199	What follows is an ultra-condensed version of my talk about threads in
		1200	scripting languages given on the perl workshop 2009:
		1201
		1202	The so-called "ithreads" were originally implemented for two reasons:
		1203	first, to (badly) emulate unix processes on native win32 perls, and
		1204	secondly, to replace the older, real thread model ("5.005-threads").
		1205
		1206	It does that by using threads instead of OS processes. The difference
		1207	between processes and threads is that threads share memory (and other
		1208	state, such as files) between threads within a single process, while
		1209	processes do not share anything (at least not semantically). That
		1210	means that modifications done by one thread are seen by others, while
		1211	modifications by one process are not seen by other processes.
		1212
		1213	The "ithreads" work exactly like that: when creating a new ithreads
		1214	process, all state is copied (memory is copied physically, files and code
		1215	is copied logically). Afterwards, it isolates all modifications. On UNIX,
		1216	the same behaviour can be achieved by using operating system processes,
		1217	except that UNIX typically uses hardware built into the system to do this
		1218	efficiently, while the windows process emulation emulates this hardware in
		1219	software (rather efficiently, but of course it is still much slower than
		1220	dedicated hardware).
		1221
		1222	As mentioned before, loading code, modifying code, modifying data
		1223	structures and so on is only visible in the ithreads process doing the
		1224	modification, not in other ithread processes within the same OS process.
		1225
		1226	This is why "ithreads" do not implement threads for perl at all, only
		1227	processes. What makes it so bad is that on non-windows platforms, you can
		1228	actually take advantage of custom hardware for this purpose (as evidenced
		1229	by the forks module, which gives you the (i-) threads API, just much
		1230	faster).
		1231
		1232	Sharing data is in the i-threads model is done by transfering data
		1233	structures between threads using copying semantics, which is very slow -
		1234	shared data simply does not exist. Benchmarks using i-threads which are
		1235	communication-intensive show extremely bad behaviour with i-threads (in
		1236	fact, so bad that Coro, which cannot take direct advantage of multiple
		1237	CPUs, is often orders of magnitude faster because it shares data using
		1238	real threads, refer to my talk for details).
		1239
		1240	As summary, i-threads *use* threads to implement processes, while
		1241	the compatible forks module *uses* processes to emulate, uhm,
		1242	processes. I-threads slow down every perl program when enabled, and
		1243	outside of windows, serve no (or little) practical purpose, but
		1244	disadvantages every single-threaded Perl program.
		1245
		1246	This is the reason that I try to avoid the name "ithreads", as it is
		1247	misleading as it implies that it implements some kind of thread model for
		1248	perl, and prefer the name "windows process emulation", which describes the
		1249	actual use and behaviour of it much better.
		1250
693	=head1 SEE ALSO	1251	=head1 SEE ALSO
694		1252
695	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.	1253	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
696		1254
697	Debugging: L<Coro::Debug>.	1255	Debugging: L<Coro::Debug>.
698		1256
699	Support/Utility: L<Coro::Specific>, L<Coro::Util>.	1257	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
700		1258
701	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.	1259	Locking and IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>,
		1260	L<Coro::SemaphoreSet>, L<Coro::RWLock>.
702		1261
703	IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.	1262	I/O and Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
704		1263
705	Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.	1264	Compatibility with other modules: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for
		1265	a better-working alternative), L<Coro::BDB>, L<Coro::Storable>,
		1266	L<Coro::Select>.
706		1267
707	XS API: L<Coro::MakeMaker>.	1268	XS API: L<Coro::MakeMaker>.
708		1269
709	Low level Configuration, Coroutine Environment: L<Coro::State>.	1270	Low level Configuration, Thread Environment, Continuations: L<Coro::State>.
710		1271
711	=head1 AUTHOR	1272	=head1 AUTHOR
712		1273
713	Marc Lehmann <schmorp@schmorp.de>	1274	Marc Lehmann <schmorp@schmorp.de>
714	http://home.schmorp.de/	1275	http://home.schmorp.de/

Diff Legend

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