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

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.42 by root, Tue Nov 6 20:37:20 2001 UTC vs.
Revision 1.224 by root, Wed Nov 19 05:52:42 2008 UTC

…		…
2		2
3	Coro - coroutine process abstraction	3	Coro - coroutine process abstraction
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
7	use Coro;	7	use Coro;
8		8
9	async {	9	async {
10	# some asynchronous thread of execution	10	# some asynchronous thread of execution
		11	print "2\n";
		12	cede; # yield back to main
		13	print "4\n";
11	};	14	};
12		15	print "1\n";
13	# alternatively create an async process like this:	16	cede; # yield to coroutine
14		17	print "3\n";
15	sub some_func : Coro {	18	cede; # and again
16	# some more async code	19
17	}	20	# use locking
18		21	use Coro::Semaphore;
19	cede;	22	my $lock = new Coro::Semaphore;
		23	my $locked;
		24
		25	$lock->down;
		26	$locked = 1;
		27	$lock->up;
20		28
21	=head1 DESCRIPTION	29	=head1 DESCRIPTION
22		30
23	This module collection manages coroutines. Coroutines are similar to	31	This module collection manages coroutines. Coroutines are similar to
24	threads but don't run in parallel.	32	threads but don't (in general) run in parallel at the same time even
		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.
25		38
		39	Unlike a normal perl program, however, coroutines allow you to have
		40	multiple running interpreters that share data, which is especially useful
		41	to code pseudo-parallel processes and for event-based programming, such as
		42	multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to
		43	learn more.
		44
		45	Coroutines are also useful because Perl has no support for threads (the so
		46	called "threads" that perl offers are nothing more than the (bad) process
		47	emulation coming from the Windows platform: On standard operating systems
		48	they serve no purpose whatsoever, except by making your programs slow and
		49	making them use a lot of memory. Best disable them when building perl, or
		50	aks your software vendor/distributor to do it for you).
		51
26	In this module, coroutines are defined as "callchain + lexical variables	52	In this module, coroutines are defined as "callchain + lexical variables +
27	+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own	53	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
28	callchain, it's own set of lexicals and it's own set of perl's most	54	its own set of lexicals and its own set of perls most important global
29	important global variables.	55	variables (see L<Coro::State> for more configuration).
30		56
31	=cut	57	=cut
32		58
33	package Coro;	59	package Coro;
34		60
		61	use strict qw(vars subs);
35	no warnings qw(uninitialized);	62	no warnings "uninitialized";
36		63
37	use Coro::State;	64	use Coro::State;
38		65
39	use base Exporter;	66	use base qw(Coro::State Exporter);
40		67
41	$VERSION = 0.52;	68	our $idle; # idle handler
		69	our $main; # main coroutine
		70	our $current; # current coroutine
42		71
		72	our $VERSION = 5.0;
		73
43	@EXPORT = qw(async cede schedule terminate current);	74	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
44	%EXPORT_TAGS = (	75	our %EXPORT_TAGS = (
45	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	76	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
46	);	77	);
47	@EXPORT_OK = @{$EXPORT_TAGS{prio}};	78	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
48		79
49	{	80	=over 4
50	my @async;
51	my $init;
52		81
53	# this way of handling attributes simply is NOT scalable ;()
54	sub import {
55	Coro->export_to_level(1, @_);
56	my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
57	*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
58	my ($package, $ref) = (shift, shift);
59	my @attrs;
60	for (@_) {
61	if ($_ eq "Coro") {
62	push @async, $ref;
63	unless ($init++) {
64	eval q{
65	sub INIT {
66	&async(pop @async) while @async;
67	}
68	};
69	}
70	} else {
71	push @attrs, $_;
72	}
73	}
74	return $old ? $old->($package, $ref, @attrs) : @attrs;
75	};
76	}
77
78	}
79
80	=item $main	82	=item $Coro::main
81		83
82	This coroutine represents the main program.	84	This variable stores the coroutine object that represents the main
		85	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
		87	whether you are running in the main program or not.
83		88
84	=cut	89	=cut
85		90
86	our $main = new Coro;	91	# $main is now being initialised by Coro::State
87		92
88	=item $current (or as function: current)	93	=item $Coro::current
89		94
90	The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course).	95	The coroutine object representing the current coroutine (the last
		96	coroutine that the Coro scheduler switched to). The initial value is
		97	C<$Coro::main> (of course).
91		98
92	=cut	99	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
		101	not otherwise modify the variable itself.
93		102
94	# maybe some other module used Coro::Specific before...	103	=cut
95	if ($current) {
96	$main->{specific} = $current->{specific};
97	}
98		104
99	our $current = $main;
100
101	sub current() { $current }	105	sub current() { $current } # [DEPRECATED]
102		106
103	=item $idle	107	=item $Coro::idle
104		108
105	The coroutine to switch to when no other coroutine is running. The default	109	This variable is mainly useful to integrate Coro into event loops. It is
106	implementation prints "FATAL: deadlock detected" and exits.	110	usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
		111	pretty low-level functionality.
107		112
108	=cut	113	This variable stores a callback that is called whenever the scheduler
		114	finds no ready coroutines to run. The default implementation prints
		115	"FATAL: deadlock detected" and exits, because the program has no other way
		116	to continue.
109		117
110	# should be done using priorities :(	118	This hook is overwritten by modules such as C<Coro::Timer> and
111	our $idle = new Coro sub {	119	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
112	print STDERR "FATAL: deadlock detected\n";	120	coroutine so the scheduler can run it.
113	exit(51);	121
		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
		128	technique.
		129
		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
		134
		135	$idle = sub {
		136	require Carp;
		137	Carp::croak ("FATAL: deadlock detected");
114	};	138	};
		139
		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	}
115		151
116	# this coroutine is necessary because a coroutine	152	# this coroutine is necessary because a coroutine
117	# cannot destroy itself.	153	# cannot destroy itself.
118	my @destroy;	154	my @destroy;
119	my $manager;	155	my $manager;
		156
120	$manager = new Coro sub {	157	$manager = new Coro sub {
121	while() {	158	while () {
122	# by overwriting the state object with the manager we destroy it	159	(shift @destroy)->_cancel
123	# while still being able to schedule this coroutine (in case it has
124	# been readied multiple times. this is harmless since the manager
125	# can be called as many times as neccessary and will always
126	# remove itself from the runqueue
127	while (@destroy) {	160	while @destroy;
128	my $coro = pop @destroy;	161
129	$coro->{status} \|\|= [];
130	$_->ready for @{delete $coro->{join} \|\| []};
131	$coro->{_coro_state} = $manager->{_coro_state};
132	}
133	&schedule;	162	&schedule;
134	}	163	}
135	};	164	};
		165	$manager->{desc} = "[coro manager]";
		166	$manager->prio (PRIO_MAX);
136		167
137	# static methods. not really.	168	=back
138		169
139	=head2 STATIC METHODS	170	=head2 SIMPLE COROUTINE CREATION
140
141	Static methods are actually functions that operate on the current process only.
142		171
143	=over 4	172	=over 4
144		173
145	=item async { ... } [@args...]	174	=item async { ... } [@args...]
146		175
147	Create a new asynchronous process and return it's process object	176	Create a new coroutine and return it's coroutine object (usually
148	(usually unused). When the sub returns the new process is automatically	177	unused). The coroutine will be put into the ready queue, so
		178	it will start running automatically on the next scheduler run.
		179
		180	The first argument is a codeblock/closure that should be executed in the
		181	coroutine. When it returns argument returns the coroutine is automatically
149	terminated.	182	terminated.
150		183
		184	The remaining arguments are passed as arguments to the closure.
		185
		186	See the C<Coro::State::new> constructor for info about the coroutine
		187	environment in which coroutines are executed.
		188
		189	Calling C<exit> in a coroutine will do the same as calling exit outside
		190	the coroutine. Likewise, when the coroutine dies, the program will exit,
		191	just as it would in the main program.
		192
		193	If you do not want that, you can provide a default C<die> handler, or
		194	simply avoid dieing (by use of C<eval>).
		195
151	# create a new coroutine that just prints its arguments	196	Example: Create a new coroutine that just prints its arguments.
		197
152	async {	198	async {
153	print "@_\n";	199	print "@_\n";
154	} 1,2,3,4;	200	} 1,2,3,4;
155		201
156	The coderef you submit MUST NOT be a closure that refers to variables
157	in an outer scope. This does NOT work. Pass arguments into it instead.
158
159	=cut	202	=cut
160		203
161	sub async(&@) {	204	sub async(&@) {
162	my $pid = new Coro @_;	205	my $coro = new Coro @_;
163	$manager->ready; # this ensures that the stack is cloned from the manager
164	$pid->ready;	206	$coro->ready;
165	$pid;	207	$coro
166	}	208	}
		209
		210	=item async_pool { ... } [@args...]
		211
		212	Similar to C<async>, but uses a coroutine pool, so you should not call
		213	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
		215	or bad :).
		216
		217	On the plus side, this function is faster than creating (and destroying)
		218	a completly new coroutine, so if you need a lot of generic coroutines in
		219	quick successsion, use C<async_pool>, not C<async>.
		220
		221	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
		223	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
		224	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
		226	exceptional case).
		227
		228	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
		230	gets restored, so you can change all these. Otherwise the coroutine will
		231	be re-used "as-is": most notably if you change other per-coroutine global
		232	stuff such as C<$/> you I<must needs> revert that change, which is most
		233	simply done by using local as in: C<< local $/ >>.
		234
		235	The idle pool size is limited to C<8> idle coroutines (this can be
		236	adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
		237	coros as required.
		238
		239	If you are concerned about pooled coroutines growing a lot because a
		240	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
		242	addition to that, when the stacks used by a handler grows larger than 16kb
		243	(adjustable via $Coro::POOL_RSS) it will also be destroyed.
		244
		245	=cut
		246
		247	our $POOL_SIZE = 8;
		248	our $POOL_RSS = 16 * 1024;
		249	our @async_pool;
		250
		251	sub pool_handler {
		252	my $cb;
		253
		254	while () {
		255	eval {
		256	while () {
		257	_pool_1 $cb;
		258	&$cb;
		259	_pool_2 $cb;
		260	&schedule;
		261	}
		262	};
		263
		264	if ($@) {
		265	last if $@ eq "\3async_pool terminate\2\n";
		266	warn $@;
		267	}
		268	}
		269	}
		270
		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
		282
		283	=head2 STATIC METHODS
		284
		285	Static methods are actually functions that operate on the current coroutine.
		286
		287	=over 4
167		288
168	=item schedule	289	=item schedule
169		290
170	Calls the scheduler. Please note that the current process will not be put	291	Calls the scheduler. The scheduler will find the next coroutine that is
		292	to be run from the ready queue and switches to it. The next coroutine
		293	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
		295	C<$Coro::idle> hook.
		296
		297	Please note that the current coroutine will I<not> be put into the ready
171	into the ready queue, so calling this function usually means you will	298	queue, so calling this function usually means you will never be called
172	never be called again.	299	again unless something else (e.g. an event handler) calls C<< ->ready >>,
		300	thus waking you up.
173		301
174	=cut	302	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
		304	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
		306	yourself to sleep. Note that a lot of things can wake your coroutine up,
		307	so you need to check whether the event indeed happened, e.g. by storing the
		308	status in a variable.
		309
		310	See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
175		311
176	=item cede	312	=item cede
177		313
178	"Cede" to other processes. This function puts the current process into the	314	"Cede" to other coroutines. This function puts the current coroutine into
179	ready queue and calls C<schedule>, which has the effect of giving up the	315	the ready queue and calls C<schedule>, which has the effect of giving
180	current "timeslice" to other coroutines of the same or higher priority.	316	up the current "timeslice" to other coroutines of the same or higher
		317	priority. Once your coroutine gets its turn again it will automatically be
		318	resumed.
181		319
182	=cut	320	This function is often called C<yield> in other languages.
		321
		322	=item Coro::cede_notself
		323
		324	Works like cede, but is not exported by default and will cede to I<any>
		325	coroutine, regardless of priority. This is useful sometimes to ensure
		326	progress is made.
183		327
184	=item terminate [arg...]	328	=item terminate [arg...]
185		329
186	Terminates the current process.	330	Terminates the current coroutine with the given status values (see L<cancel>).
187		331
188	Future versions of this function will allow result arguments.	332	=item killall
		333
		334	Kills/terminates/cancels all coroutines except the currently running
		335	one. This is useful after a fork, either in the child or the parent, as
		336	usually only one of them should inherit the running coroutines.
		337
		338	Note that while this will try to free some of the main programs resources,
		339	you cannot free all of them, so if a coroutine that is not the main
		340	program calls this function, there will be some one-time resource leak.
189		341
190	=cut	342	=cut
191		343
192	sub terminate {	344	sub terminate {
193	$current->{status} = [@_];
194	$current->cancel;	345	$current->cancel (@_);
195	&schedule;	346	}
196	die; # NORETURN	347
		348	sub killall {
		349	for (Coro::State::list) {
		350	$_->cancel
		351	if $_ != $current && UNIVERSAL::isa $_, "Coro";
		352	}
197	}	353	}
198		354
199	=back	355	=back
200		356
201	# dynamic methods
202
203	=head2 PROCESS METHODS	357	=head2 COROUTINE METHODS
204		358
205	These are the methods you can call on process objects.	359	These are the methods you can call on coroutine objects (or to create
		360	them).
206		361
207	=over 4	362	=over 4
208		363
209	=item new Coro \&sub [, @args...]	364	=item new Coro \&sub [, @args...]
210		365
211	Create a new process and return it. When the sub returns the process	366	Create a new coroutine and return it. When the sub returns, the coroutine
212	automatically terminates as if C<terminate> with the returned values were	367	automatically terminates as if C<terminate> with the returned values were
213	called. To make the process run you must first put it into the ready queue	368	called. To make the coroutine run you must first put it into the ready
214	by calling the ready method.	369	queue by calling the ready method.
215		370
216	=cut	371	See C<async> and C<Coro::State::new> for additional info about the
		372	coroutine environment.
217		373
		374	=cut
		375
218	sub _newcoro {	376	sub _run_coro {
219	terminate &{+shift};	377	terminate &{+shift};
220	}	378	}
221		379
222	sub new {	380	sub new {
223	my $class = shift;	381	my $class = shift;
224	bless {
225	_coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
226	}, $class;
227	}
228		382
229	=item $process->ready	383	$class->SUPER::new (\&_run_coro, @_)
		384	}
230		385
231	Put the given process into the ready queue.	386	=item $success = $coroutine->ready
232		387
233	=cut	388	Put the given coroutine into the end of its ready queue (there is one
		389	queue for each priority) and return true. If the coroutine is already in
		390	the ready queue, do nothing and return false.
234		391
235	=item $process->cancel	392	This ensures that the scheduler will resume this coroutine automatically
		393	once all the coroutines of higher priority and all coroutines of the same
		394	priority that were put into the ready queue earlier have been resumed.
236		395
237	Like C<terminate>, but terminates the specified process instead.	396	=item $is_ready = $coroutine->is_ready
		397
		398	Return whether the coroutine is currently the ready queue or not,
		399
		400	=item $coroutine->cancel (arg...)
		401
		402	Terminates the given coroutine and makes it return the given arguments as
		403	status (default: the empty list). Never returns if the coroutine is the
		404	current coroutine.
238		405
239	=cut	406	=cut
240		407
241	sub cancel {	408	sub cancel {
		409	my $self = shift;
		410	$self->{_status} = [@_];
		411
		412	if ($current == $self) {
242	push @destroy, $_[0];	413	push @destroy, $self;
243	$manager->ready;	414	$manager->ready;
244	&schedule if $current == $_[0];	415	&schedule while 1;
		416	} else {
		417	$self->_cancel;
		418	}
245	}	419	}
246		420
		421	=item $coroutine->throw ([$scalar])
		422
		423	If C<$throw> is specified and defined, it will be thrown as an exception
		424	inside the coroutine at the next convenient point in time. Otherwise
		425	clears the exception object.
		426
		427	Coro will check for the exception each time a schedule-like-function
		428	returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
		429	>>, C<< Coro::Handle->readable >> and so on. Most of these functions
		430	detect this case and return early in case an exception is pending.
		431
		432	The exception object will be thrown "as is" with the specified scalar in
		433	C<$@>, i.e. if it is a string, no line number or newline will be appended
		434	(unlike with C<die>).
		435
		436	This can be used as a softer means than C<cancel> to ask a coroutine to
		437	end itself, although there is no guarantee that the exception will lead to
		438	termination, and if the exception isn't caught it might well end the whole
		439	program.
		440
		441	You might also think of C<throw> as being the moral equivalent of
		442	C<kill>ing a coroutine with a signal (in this case, a scalar).
		443
247	=item $process->join	444	=item $coroutine->join
248		445
249	Wait until the coroutine terminates and return any values given to the	446	Wait until the coroutine terminates and return any values given to the
250	C<terminate> function. C<join> can be called multiple times from multiple	447	C<terminate> or C<cancel> functions. C<join> can be called concurrently
251	processes.	448	from multiple coroutines, and all will be resumed and given the status
		449	return once the C<$coroutine> terminates.
252		450
253	=cut	451	=cut
254		452
255	sub join {	453	sub join {
256	my $self = shift;	454	my $self = shift;
		455
257	unless ($self->{status}) {	456	unless ($self->{_status}) {
258	push @{$self->{join}}, $current;	457	my $current = $current;
259	&schedule;	458
		459	push @{$self->{_on_destroy}}, sub {
		460	$current->ready;
		461	undef $current;
		462	};
		463
		464	&schedule while $current;
260	}	465	}
		466
261	wantarray ? @{$self->{status}} : $self->{status}[0];	467	wantarray ? @{$self->{_status}} : $self->{_status}[0];
262	}	468	}
263		469
		470	=item $coroutine->on_destroy (\&cb)
		471
		472	Registers a callback that is called when this coroutine gets destroyed,
		473	but before it is joined. The callback gets passed the terminate arguments,
		474	if any, and I<must not> die, under any circumstances.
		475
		476	=cut
		477
		478	sub on_destroy {
		479	my ($self, $cb) = @_;
		480
		481	push @{ $self->{_on_destroy} }, $cb;
		482	}
		483
264	=item $oldprio = $process->prio($newprio)	484	=item $oldprio = $coroutine->prio ($newprio)
265		485
266	Sets (or gets, if the argument is missing) the priority of the	486	Sets (or gets, if the argument is missing) the priority of the
267	process. Higher priority processes get run before lower priority	487	coroutine. Higher priority coroutines get run before lower priority
268	processes. Priorities are smalled signed integer (currently -4 .. +3),	488	coroutines. Priorities are small signed integers (currently -4 .. +3),
269	that you can refer to using PRIO_xxx constants (use the import tag :prio	489	that you can refer to using PRIO_xxx constants (use the import tag :prio
270	to get then):	490	to get then):
271		491
272	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN	492	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
273	3 > 1 > 0 > -1 > -3 > -4	493	3 > 1 > 0 > -1 > -3 > -4
…		…
276	current->prio(PRIO_HIGH);	496	current->prio(PRIO_HIGH);
277		497
278	The idle coroutine ($Coro::idle) always has a lower priority than any	498	The idle coroutine ($Coro::idle) always has a lower priority than any
279	existing coroutine.	499	existing coroutine.
280		500
281	Changing the priority of the current process will take effect immediately,	501	Changing the priority of the current coroutine will take effect immediately,
282	but changing the priority of processes in the ready queue (but not	502	but changing the priority of coroutines in the ready queue (but not
283	running) will only take effect after the next schedule (of that	503	running) will only take effect after the next schedule (of that
284	process). This is a bug that will be fixed in some future version.	504	coroutine). This is a bug that will be fixed in some future version.
285		505
286	=cut
287
288	sub prio {
289	my $old = $_[0]{prio};
290	$_[0]{prio} = $_[1] if @_ > 1;
291	$old;
292	}
293
294	=item $newprio = $process->nice($change)	506	=item $newprio = $coroutine->nice ($change)
295		507
296	Similar to C<prio>, but subtract the given value from the priority (i.e.	508	Similar to C<prio>, but subtract the given value from the priority (i.e.
297	higher values mean lower priority, just as in unix).	509	higher values mean lower priority, just as in unix).
298		510
299	=cut
300
301	sub nice {
302	$_[0]{prio} -= $_[1];
303	}
304
305	=item $olddesc = $process->desc($newdesc)	511	=item $olddesc = $coroutine->desc ($newdesc)
306		512
307	Sets (or gets in case the argument is missing) the description for this	513	Sets (or gets in case the argument is missing) the description for this
308	process. This is just a free-form string you can associate with a process.	514	coroutine. This is just a free-form string you can associate with a
		515	coroutine.
		516
		517	This method simply sets the C<< $coroutine->{desc} >> member to the given
		518	string. You can modify this member directly if you wish.
309		519
310	=cut	520	=cut
311		521
312	sub desc {	522	sub desc {
313	my $old = $_[0]{desc};	523	my $old = $_[0]{desc};
…		…
315	$old;	525	$old;
316	}	526	}
317		527
318	=back	528	=back
319		529
		530	=head2 GLOBAL FUNCTIONS
		531
		532	=over 4
		533
		534	=item Coro::nready
		535
		536	Returns the number of coroutines that are currently in the ready state,
		537	i.e. that can be switched to by calling C<schedule> directory or
		538	indirectly. The value C<0> means that the only runnable coroutine is the
		539	currently running one, so C<cede> would have no effect, and C<schedule>
		540	would cause a deadlock unless there is an idle handler that wakes up some
		541	coroutines.
		542
		543	=item my $guard = Coro::guard { ... }
		544
		545	This creates and returns a guard object. Nothing happens until the object
		546	gets destroyed, in which case the codeblock given as argument will be
		547	executed. This is useful to free locks or other resources in case of a
		548	runtime error or when the coroutine gets canceled, as in both cases the
		549	guard block will be executed. The guard object supports only one method,
		550	C<< ->cancel >>, which will keep the codeblock from being executed.
		551
		552	Example: set some flag and clear it again when the coroutine gets canceled
		553	or the function returns:
		554
		555	sub do_something {
		556	my $guard = Coro::guard { $busy = 0 };
		557	$busy = 1;
		558
		559	# do something that requires $busy to be true
		560	}
		561
		562	=cut
		563
		564	sub guard(&) {
		565	bless \(my $cb = $_[0]), "Coro::guard"
		566	}
		567
		568	sub Coro::guard::cancel {
		569	${$_[0]} = sub { };
		570	}
		571
		572	sub Coro::guard::DESTROY {
		573	${$_[0]}->();
		574	}
		575
		576
		577	=item unblock_sub { ... }
		578
		579	This utility function takes a BLOCK or code reference and "unblocks" it,
		580	returning a new coderef. Unblocking means that calling the new coderef
		581	will return immediately without blocking, returning nothing, while the
		582	original code ref will be called (with parameters) from within another
		583	coroutine.
		584
		585	The reason this function exists is that many event libraries (such as the
		586	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form
		587	of thread-safety). This means you must not block within event callbacks,
		588	otherwise you might suffer from crashes or worse. The only event library
		589	currently known that is safe to use without C<unblock_sub> is L<EV>.
		590
		591	This function allows your callbacks to block by executing them in another
		592	coroutine where it is safe to block. One example where blocking is handy
		593	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to
		594	disk, for example.
		595
		596	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
		597	creating event callbacks that want to block.
		598
		599	If your handler does not plan to block (e.g. simply sends a message to
		600	another coroutine, or puts some other coroutine into the ready queue),
		601	there is no reason to use C<unblock_sub>.
		602
		603	Note that you also need to use C<unblock_sub> for any other callbacks that
		604	are indirectly executed by any C-based event loop. For example, when you
		605	use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
		606	provides callbacks that are the result of some event callback, then you
		607	must not block either, or use C<unblock_sub>.
		608
		609	=cut
		610
		611	our @unblock_queue;
		612
		613	# we create a special coro because we want to cede,
		614	# to reduce pressure on the coro pool (because most callbacks
		615	# return immediately and can be reused) and because we cannot cede
		616	# inside an event callback.
		617	our $unblock_scheduler = new Coro sub {
		618	while () {
		619	while (my $cb = pop @unblock_queue) {
		620	# this is an inlined copy of async_pool
		621	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
		622
		623	$coro->{_invoke} = $cb;
		624	$coro->ready;
		625	cede; # for short-lived callbacks, this reduces pressure on the coro pool
		626	}
		627	schedule; # sleep well
		628	}
		629	};
		630	$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
		631
		632	sub unblock_sub(&) {
		633	my $cb = shift;
		634
		635	sub {
		636	unshift @unblock_queue, [$cb, @_];
		637	$unblock_scheduler->ready;
		638	}
		639	}
		640
		641	=item $cb = Coro::rouse_cb
		642
		643	Create and return a "rouse callback". That's a code reference that, when
		644	called, will save its arguments and notify the owner coroutine of the
		645	callback.
		646
		647	See the next function.
		648
		649	=item @args = Coro::rouse_wait [$cb]
		650
		651	Wait for the specified rouse callback (or the last one tht was created in
		652	this coroutine).
		653
		654	As soon as the callback is invoked (or when the calback was invoked before
		655	C<rouse_wait>), it will return a copy of the arguments originally passed
		656	to the rouse callback.
		657
		658	See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
		659
		660	=back
		661
320	=cut	662	=cut
321		663
322	1;	664	1;
323		665
		666	=head1 HOW TO WAIT FOR A CALLBACK
		667
		668	It is very common for a coroutine to wait for some callback to be
		669	called. This occurs naturally when you use coroutines in an otherwise
		670	event-based program, or when you use event-based libraries.
		671
		672	These typically register a callback for some event, and call that callback
		673	when the event occured. In a coroutine, however, you typically want to
		674	just wait for the event, simplyifying things.
		675
		676	For example C<< AnyEvent->child >> registers a callback to be called when
		677	a specific child has exited:
		678
		679	my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
		680
		681	But from withina coroutine, you often just want to write this:
		682
		683	my $status = wait_for_child $pid;
		684
		685	Coro offers two functions specifically designed to make this easy,
		686	C<Coro::rouse_cb> and C<Coro::rouse_wait>.
		687
		688	The first function, C<rouse_cb>, generates and returns a callback that,
		689	when invoked, will save it's arguments and notify the coroutine that
		690	created the callback.
		691
		692	The second function, C<rouse_wait>, waits for the callback to be called
		693	(by calling C<schedule> to go to sleep) and returns the arguments
		694	originally passed to the callback.
		695
		696	Using these functions, it becomes easy to write the C<wait_for_child>
		697	function mentioned above:
		698
		699	sub wait_for_child($) {
		700	my ($pid) = @_;
		701
		702	my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
		703
		704	my ($rpid, $rstatus) = Coro::rouse_wait;
		705	$rstatus
		706	}
		707
		708	In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
		709	you can roll your own, using C<schedule>:
		710
		711	sub wait_for_child($) {
		712	my ($pid) = @_;
		713
		714	# store the current coroutine in $current,
		715	# and provide result variables for the closure passed to ->child
		716	my $current = $Coro::current;
		717	my ($done, $rstatus);
		718
		719	# pass a closure to ->child
		720	my $watcher = AnyEvent->child (pid => $pid, cb => sub {
		721	$rstatus = $_[1]; # remember rstatus
		722	$done = 1; # mark $rstatus as valud
		723	});
		724
		725	# wait until the closure has been called
		726	schedule while !$done;
		727
		728	$rstatus
		729	}
		730
		731
324	=head1 BUGS/LIMITATIONS	732	=head1 BUGS/LIMITATIONS
325		733
326	- you must make very sure that no coro is still active on global destruction.	734	=over 4
327	very bad things might happen otherwise (usually segfaults).	735
		736	=item fork with pthread backend
		737
		738	When Coro is compiled using the pthread backend (which isn't recommended
		739	but required on many BSDs as their libcs are completely broken), then
		740	coroutines will not survive a fork. There is no known workaround except to
		741	fix your libc and use a saner backend.
		742
		743	=item perl process emulation ("threads")
		744
328	- this module is not thread-safe. You should only ever use this module from	745	This module is not perl-pseudo-thread-safe. You should only ever use this
329	the same thread (this requirement might be loosened in the future to	746	module from the same thread (this requirement might be removed in the
330	allow per-thread schedulers, but Coro::State does not yet allow this).	747	future to allow per-thread schedulers, but Coro::State does not yet allow
		748	this). I recommend disabling thread support and using processes, as having
		749	the windows process emulation enabled under unix roughly halves perl
		750	performance, even when not used.
		751
		752	=item coroutine switching not signal safe
		753
		754	You must not switch to another coroutine from within a signal handler
		755	(only relevant with %SIG - most event libraries provide safe signals).
		756
		757	That means you I<MUST NOT> call any function that might "block" the
		758	current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
		759	anything that calls those. Everything else, including calling C<ready>,
		760	works.
		761
		762	=back
		763
331		764
332	=head1 SEE ALSO	765	=head1 SEE ALSO
333		766
334	L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>,	767	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
335	L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>,	768
336	L<Coro::Handle>, L<Coro::Socket>.	769	Debugging: L<Coro::Debug>.
		770
		771	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
		772
		773	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
		774
		775	IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
		776
		777	Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
		778
		779	XS API: L<Coro::MakeMaker>.
		780
		781	Low level Configuration, Coroutine Environment: L<Coro::State>.
337		782
338	=head1 AUTHOR	783	=head1 AUTHOR
339		784
340	Marc Lehmann <pcg@goof.com>	785	Marc Lehmann <schmorp@schmorp.de>
341	http://www.goof.com/pcg/marc/	786	http://home.schmorp.de/
342		787
343	=cut	788	=cut
344		789

Diff Legend

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

Comparing cvsroot/Coro/Coro.pm (file contents): Revision 1.42 by root, Tue Nov 6 20:37:20 2001 UTC vs. Revision 1.224 by root, Wed Nov 19 05:52:42 2008 UTC

Diff Legend

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.42 by root, Tue Nov 6 20:37:20 2001 UTC vs.
Revision 1.224 by root, Wed Nov 19 05:52:42 2008 UTC