ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro.pm

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

Diff Legend

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