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

Comparing Coro/Coro.pm (file contents):
Revision 1.119 by root, Wed Mar 28 14:24:17 2007 UTC vs.
Revision 1.181 by root, Fri May 9 22:04:37 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 coroutine 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	my $lock = new Coro::Semaphore;
19	cede;	22	my $locked;
		23
		24	$lock->down;
		25	$locked = 1;
		26	$lock->up;
20		27
21	=head1 DESCRIPTION	28	=head1 DESCRIPTION
22		29
23	This module collection manages coroutines. Coroutines are similar	30	This module collection manages coroutines. Coroutines are similar to
24	to threads but don't run in parallel at the same time even on SMP	31	threads but don't (in general) run in parallel at the same time even
25	machines. The specific flavor of coroutine use din this module also	32	on SMP machines. The specific flavor of coroutine used in this module
26	guarentees you that it will not switch between coroutines unless	33	also guarantees you that it will not switch between coroutines unless
27	necessary, at easily-identified points in your program, so locking and	34	necessary, at easily-identified points in your program, so locking and
28	parallel access are rarely an issue, making coroutine programming much	35	parallel access are rarely an issue, making coroutine programming much
29	safer than threads programming.	36	safer and easier than threads programming.
30		37
31	(Perl, however, does not natively support real threads but instead does a	38	Unlike a normal perl program, however, coroutines allow you to have
32	very slow and memory-intensive emulation of processes using threads. This	39	multiple running interpreters that share data, which is especially useful
33	is a performance win on Windows machines, and a loss everywhere else).	40	to code pseudo-parallel processes, such as multiple HTTP-GET requests
		41	running concurrently.
		42
		43	Coroutines are also useful because Perl has no support for threads (the so
		44	called "threads" that perl offers are nothing more than the (bad) process
		45	emulation coming from the Windows platform: On standard operating systems
		46	they serve no purpose whatsoever, except by making your programs slow and
		47	making them use a lot of memory. Best disable them when building perl, or
		48	aks your software vendor/distributor to do it for you).
34		49
35	In this module, coroutines are defined as "callchain + lexical variables +	50	In this module, coroutines are defined as "callchain + lexical variables +
36	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,	51	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
37	its own set of lexicals and its own set of perls most important global	52	its own set of lexicals and its own set of perls most important global
38	variables.	53	variables (see L<Coro::State> for more configuration).
39		54
40	=cut	55	=cut
41		56
42	package Coro;	57	package Coro;
43		58
…		…
50		65
51	our $idle; # idle handler	66	our $idle; # idle handler
52	our $main; # main coroutine	67	our $main; # main coroutine
53	our $current; # current coroutine	68	our $current; # current coroutine
54		69
55	our $VERSION = '3.55';	70	our $VERSION = 4.6;
56		71
57	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);	72	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58	our %EXPORT_TAGS = (	73	our %EXPORT_TAGS = (
59	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	74	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60	);	75	);
61	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));	76	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
62		77
63	{
64	my @async;
65	my $init;
66
67	# this way of handling attributes simply is NOT scalable ;()
68	sub import {
69	no strict 'refs';
70
71	Coro->export_to_level (1, @_);
72
73	my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
74	*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
75	my ($package, $ref) = (shift, shift);
76	my @attrs;
77	for (@_) {
78	if ($_ eq "Coro") {
79	push @async, $ref;
80	unless ($init++) {
81	eval q{
82	sub INIT {
83	&async(pop @async) while @async;
84	}
85	};
86	}
87	} else {
88	push @attrs, $_;
89	}
90	}
91	return $old ? $old->($package, $ref, @attrs) : @attrs;
92	};
93	}
94
95	}
96
97	=over 4	78	=over 4
98		79
99	=item $main	80	=item $Coro::main
100		81
101	This coroutine represents the main program.	82	This variable stores the coroutine object that represents the main
		83	program. While you cna C<ready> it and do most other things you can do to
		84	coroutines, it is mainly useful to compare again C<$Coro::current>, to see
		85	wether you are running in the main program or not.
102		86
103	=cut	87	=cut
104		88
105	$main = new Coro;	89	$main = new Coro;
106		90
107	=item $current (or as function: current)	91	=item $Coro::current
108		92
109	The current coroutine (the last coroutine switched to). The initial value	93	The coroutine object representing the current coroutine (the last
		94	coroutine that the Coro scheduler switched to). The initial value is
110	is C<$main> (of course).	95	C<$main> (of course).
111		96
112	This variable is B<strictly> I<read-only>. It is provided for performance	97	This variable is B<strictly> I<read-only>. You can take copies of the
113	reasons. If performance is not essentiel you are encouraged to use the	98	value stored in it and use it as any other coroutine object, but you must
114	C<Coro::current> function instead.	99	not otherwise modify the variable itself.
115		100
116	=cut	101	=cut
		102
		103	$main->{desc} = "[main::]";
117		104
118	# maybe some other module used Coro::Specific before...	105	# maybe some other module used Coro::Specific before...
119	$main->{specific} = $current->{specific}	106	$main->{_specific} = $current->{_specific}
120	if $current;	107	if $current;
121		108
122	_set_current $main;	109	_set_current $main;
123		110
124	sub current() { $current }	111	sub current() { $current } # [DEPRECATED]
125		112
126	=item $idle	113	=item $Coro::idle
127		114
128	A callback that is called whenever the scheduler finds no ready coroutines	115	This variable is mainly useful to integrate Coro into event loops. It is
129	to run. The default implementation prints "FATAL: deadlock detected" and	116	usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
130	exits, because the program has no other way to continue.	117	pretty low-level functionality.
		118
		119	This variable stores a callback that is called whenever the scheduler
		120	finds no ready coroutines to run. The default implementation prints
		121	"FATAL: deadlock detected" and exits, because the program has no other way
		122	to continue.
131		123
132	This hook is overwritten by modules such as C<Coro::Timer> and	124	This hook is overwritten by modules such as C<Coro::Timer> and
133	C<Coro::Event> to wait on an external event that hopefully wake up a	125	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
134	coroutine so the scheduler can run it.	126	coroutine so the scheduler can run it.
135		127
		128	Note that the callback I<must not>, under any circumstances, block
		129	the current coroutine. Normally, this is achieved by having an "idle
		130	coroutine" that calls the event loop and then blocks again, and then
		131	readying that coroutine in the idle handler.
		132
		133	See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
		134	technique.
		135
136	Please note that if your callback recursively invokes perl (e.g. for event	136	Please note that if your callback recursively invokes perl (e.g. for event
137	handlers), then it must be prepared to be called recursively.	137	handlers), then it must be prepared to be called recursively itself.
138		138
139	=cut	139	=cut
140		140
141	$idle = sub {	141	$idle = sub {
142	require Carp;	142	require Carp;
…		…
149	# free coroutine data and mark as destructed	149	# free coroutine data and mark as destructed
150	$self->_destroy	150	$self->_destroy
151	or return;	151	or return;
152		152
153	# call all destruction callbacks	153	# call all destruction callbacks
154	$_->(@{$self->{status}})	154	$_->(@{$self->{_status}})
155	for @{(delete $self->{destroy_cb}) \|\| []};	155	for @{(delete $self->{_on_destroy}) \|\| []};
156	}	156	}
157		157
158	# this coroutine is necessary because a coroutine	158	# this coroutine is necessary because a coroutine
159	# cannot destroy itself.	159	# cannot destroy itself.
160	my @destroy;	160	my @destroy;
…		…
166	while @destroy;	166	while @destroy;
167		167
168	&schedule;	168	&schedule;
169	}	169	}
170	};	170	};
171		171	$manager->desc ("[coro manager]");
172	$manager->prio (PRIO_MAX);	172	$manager->prio (PRIO_MAX);
173		173
174	# static methods. not really.
175
176	=back	174	=back
177		175
178	=head2 STATIC METHODS	176	=head2 SIMPLE COROUTINE CREATION
179
180	Static methods are actually functions that operate on the current coroutine only.
181		177
182	=over 4	178	=over 4
183		179
184	=item async { ... } [@args...]	180	=item async { ... } [@args...]
185		181
186	Create a new asynchronous coroutine and return it's coroutine object	182	Create a new coroutine and return it's coroutine object (usually
187	(usually unused). When the sub returns the new coroutine is automatically	183	unused). The coroutine will be put into the ready queue, so
		184	it will start running automatically on the next scheduler run.
		185
		186	The first argument is a codeblock/closure that should be executed in the
		187	coroutine. When it returns argument returns the coroutine is automatically
188	terminated.	188	terminated.
189		189
190	Calling C<exit> in a coroutine will not work correctly, so do not do that.	190	The remaining arguments are passed as arguments to the closure.
191		191
192	When the coroutine dies, the program will exit, just as in the main	192	See the C<Coro::State::new> constructor for info about the coroutine
193	program.	193	environment in which coroutines are executed.
194		194
		195	Calling C<exit> in a coroutine will do the same as calling exit outside
		196	the coroutine. Likewise, when the coroutine dies, the program will exit,
		197	just as it would in the main program.
		198
		199	If you do not want that, you can provide a default C<die> handler, or
		200	simply avoid dieing (by use of C<eval>).
		201
195	# create a new coroutine that just prints its arguments	202	Example: Create a new coroutine that just prints its arguments.
		203
196	async {	204	async {
197	print "@_\n";	205	print "@_\n";
198	} 1,2,3,4;	206	} 1,2,3,4;
199		207
200	=cut	208	=cut
…		…
206	}	214	}
207		215
208	=item async_pool { ... } [@args...]	216	=item async_pool { ... } [@args...]
209		217
210	Similar to C<async>, but uses a coroutine pool, so you should not call	218	Similar to C<async>, but uses a coroutine pool, so you should not call
211	terminate or join (although you are allowed to), and you get a coroutine	219	terminate or join on it (although you are allowed to), and you get a
212	that might have executed other code already (which can be good or bad :).	220	coroutine that might have executed other code already (which can be good
		221	or bad :).
213		222
		223	On the plus side, this function is faster than creating (and destroying)
		224	a completely new coroutine, so if you need a lot of generic coroutines in
		225	quick successsion, use C<async_pool>, not C<async>.
		226
214	Also, the block is executed in an C<eval> context and a warning will be	227	The code block is executed in an C<eval> context and a warning will be
215	issued in case of an exception instead of terminating the program, as	228	issued in case of an exception instead of terminating the program, as
216	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>	229	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
217	will not work in the expected way, unless you call terminate or cancel,	230	will not work in the expected way, unless you call terminate or cancel,
218	which somehow defeats the purpose of pooling.	231	which somehow defeats the purpose of pooling (but is fine in the
		232	exceptional case).
219		233
220	The priority will be reset to C<0> after each job, otherwise the coroutine	234	The priority will be reset to C<0> after each run, tracing will be
221	will be re-used "as-is".	235	disabled, the description will be reset and the default output filehandle
		236	gets restored, so you can change all these. Otherwise the coroutine will
		237	be re-used "as-is": most notably if you change other per-coroutine global
		238	stuff such as C<$/> you I<must needs> to revert that change, which is most
		239	simply done by using local as in: C< local $/ >.
222		240
223	The pool size is limited to 8 idle coroutines (this can be adjusted by	241	The pool size is limited to C<8> idle coroutines (this can be adjusted by
224	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as	242	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
225	required.	243	required.
226		244
227	If you are concerned about pooled coroutines growing a lot because a	245	If you are concerned about pooled coroutines growing a lot because a
228	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool {	246	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
229	terminate }> once per second or so to slowly replenish the pool.	247	{ terminate }> once per second or so to slowly replenish the pool. In
		248	addition to that, when the stacks used by a handler grows larger than 16kb
		249	(adjustable via $Coro::POOL_RSS) it will also be destroyed.
230		250
231	=cut	251	=cut
232		252
233	our $POOL_SIZE = 8;	253	our $POOL_SIZE = 8;
		254	our $POOL_RSS = 16 * 1024;
234	our @pool;	255	our @async_pool;
235		256
236	sub pool_handler {	257	sub pool_handler {
		258	my $cb;
		259
237	while () {	260	while () {
238	eval {	261	eval {
239	my ($cb, @arg) = @{ delete $current->{_invoke} or return };	262	while () {
240	$cb->(@arg);	263	_pool_1 $cb;
		264	&$cb;
		265	_pool_2 $cb;
		266	&schedule;
		267	}
241	};	268	};
		269
		270	last if $@ eq "\3async_pool terminate\2\n";
242	warn $@ if $@;	271	warn $@ if $@;
243
244	last if @pool >= $POOL_SIZE;
245	push @pool, $current;
246
247	$current->save (Coro::State::SAVE_DEF);
248	$current->prio (0);
249	schedule;
250	}	272	}
251	}	273	}
252		274
253	sub async_pool(&@) {	275	sub async_pool(&@) {
254	# this is also inlined into the unlock_scheduler	276	# this is also inlined into the unlock_scheduler
255	my $coro = (pop @pool or new Coro \&pool_handler);	277	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
256		278
257	$coro->{_invoke} = [@_];	279	$coro->{_invoke} = [@_];
258	$coro->ready;	280	$coro->ready;
259		281
260	$coro	282	$coro
261	}	283	}
262		284
		285	=back
		286
		287	=head2 STATIC METHODS
		288
		289	Static methods are actually functions that operate on the current coroutine.
		290
		291	=over 4
		292
263	=item schedule	293	=item schedule
264		294
265	Calls the scheduler. Please note that the current coroutine will not be put	295	Calls the scheduler. The scheduler will find the next coroutine that is
		296	to be run from the ready queue and switches to it. The next coroutine
		297	to be run is simply the one with the highest priority that is longest
		298	in its ready queue. If there is no coroutine ready, it will clal the
		299	C<$Coro::idle> hook.
		300
		301	Please note that the current coroutine will I<not> be put into the ready
266	into the ready queue, so calling this function usually means you will	302	queue, so calling this function usually means you will never be called
267	never be called again unless something else (e.g. an event handler) calls	303	again unless something else (e.g. an event handler) calls C<< ->ready >>,
268	ready.	304	thus waking you up.
		305
		306	This makes C<schedule> I<the> generic method to use to block the current
		307	coroutine and wait for events: first you remember the current coroutine in
		308	a variable, then arrange for some callback of yours to call C<< ->ready
		309	>> on that once some event happens, and last you call C<schedule> to put
		310	yourself to sleep. Note that a lot of things can wake your coroutine up,
		311	so you need to check wether the event indeed happened, e.g. by storing the
		312	status in a variable.
269		313
270	The canonical way to wait on external events is this:	314	The canonical way to wait on external events is this:
271		315
272	{	316	{
273	# remember current coroutine	317	# remember current coroutine
…		…
278	# wake up sleeping coroutine	322	# wake up sleeping coroutine
279	$current->ready;	323	$current->ready;
280	undef $current;	324	undef $current;
281	};	325	};
282		326
283	# call schedule until event occured.	327	# call schedule until event occurred.
284	# in case we are woken up for other reasons	328	# in case we are woken up for other reasons
285	# (current still defined), loop.	329	# (current still defined), loop.
286	Coro::schedule while $current;	330	Coro::schedule while $current;
287	}	331	}
288		332
289	=item cede	333	=item cede
290		334
291	"Cede" to other coroutines. This function puts the current coroutine into the	335	"Cede" to other coroutines. This function puts the current coroutine into
292	ready queue and calls C<schedule>, which has the effect of giving up the	336	the ready queue and calls C<schedule>, which has the effect of giving
293	current "timeslice" to other coroutines of the same or higher priority.	337	up the current "timeslice" to other coroutines of the same or higher
		338	priority. Once your coroutine gets its turn again it will automatically be
		339	resumed.
294		340
295	Returns true if at least one coroutine switch has happened.	341	This function is often called C<yield> in other languages.
296		342
297	=item Coro::cede_notself	343	=item Coro::cede_notself
298		344
299	Works like cede, but is not exported by default and will cede to any	345	Works like cede, but is not exported by default and will cede to I<any>
300	coroutine, regardless of priority, once.	346	coroutine, regardless of priority. This is useful sometimes to ensure
301		347	progress is made.
302	Returns true if at least one coroutine switch has happened.
303		348
304	=item terminate [arg...]	349	=item terminate [arg...]
305		350
306	Terminates the current coroutine with the given status values (see L<cancel>).	351	Terminates the current coroutine with the given status values (see L<cancel>).
		352
		353	=item killall
		354
		355	Kills/terminates/cancels all coroutines except the currently running
		356	one. This is useful after a fork, either in the child or the parent, as
		357	usually only one of them should inherit the running coroutines.
		358
		359	Note that while this will try to free some of the main programs resources,
		360	you cnanot free all of them, so if a coroutine that is not the main
		361	program calls this function, there will be some one-time resource leak.
307		362
308	=cut	363	=cut
309		364
310	sub terminate {	365	sub terminate {
311	$current->cancel (@_);	366	$current->cancel (@_);
312	}	367	}
313		368
		369	sub killall {
		370	for (Coro::State::list) {
		371	$_->cancel
		372	if $_ != $current && UNIVERSAL::isa $_, "Coro";
		373	}
		374	}
		375
314	=back	376	=back
315		377
316	# dynamic methods
317
318	=head2 COROUTINE METHODS	378	=head2 COROUTINE METHODS
319		379
320	These are the methods you can call on coroutine objects.	380	These are the methods you can call on coroutine objects (or to create
		381	them).
321		382
322	=over 4	383	=over 4
323		384
324	=item new Coro \&sub [, @args...]	385	=item new Coro \&sub [, @args...]
325		386
326	Create a new coroutine and return it. When the sub returns the coroutine	387	Create a new coroutine and return it. When the sub returns, the coroutine
327	automatically terminates as if C<terminate> with the returned values were	388	automatically terminates as if C<terminate> with the returned values were
328	called. To make the coroutine run you must first put it into the ready queue	389	called. To make the coroutine run you must first put it into the ready
329	by calling the ready method.	390	queue by calling the ready method.
330		391
331	Calling C<exit> in a coroutine will not work correctly, so do not do that.	392	See C<async> and C<Coro::State::new> for additional info about the
		393	coroutine environment.
332		394
333	=cut	395	=cut
334		396
335	sub _run_coro {	397	sub _run_coro {
336	terminate &{+shift};	398	terminate &{+shift};
…		…
342	$class->SUPER::new (\&_run_coro, @_)	404	$class->SUPER::new (\&_run_coro, @_)
343	}	405	}
344		406
345	=item $success = $coroutine->ready	407	=item $success = $coroutine->ready
346		408
347	Put the given coroutine into the ready queue (according to it's priority)	409	Put the given coroutine into the end of its ready queue (there is one
348	and return true. If the coroutine is already in the ready queue, do nothing	410	queue for each priority) and return true. If the coroutine is already in
349	and return false.	411	the ready queue, do nothing and return false.
		412
		413	This ensures that the scheduler will resume this coroutine automatically
		414	once all the coroutines of higher priority and all coroutines of the same
		415	priority that were put into the ready queue earlier have been resumed.
350		416
351	=item $is_ready = $coroutine->is_ready	417	=item $is_ready = $coroutine->is_ready
352		418
353	Return wether the coroutine is currently the ready queue or not,	419	Return wether the coroutine is currently the ready queue or not,
354		420
…		…
360		426
361	=cut	427	=cut
362		428
363	sub cancel {	429	sub cancel {
364	my $self = shift;	430	my $self = shift;
365	$self->{status} = [@_];	431	$self->{_status} = [@_];
366		432
367	if ($current == $self) {	433	if ($current == $self) {
368	push @destroy, $self;	434	push @destroy, $self;
369	$manager->ready;	435	$manager->ready;
370	&schedule while 1;	436	&schedule while 1;
…		…
374	}	440	}
375		441
376	=item $coroutine->join	442	=item $coroutine->join
377		443
378	Wait until the coroutine terminates and return any values given to the	444	Wait until the coroutine terminates and return any values given to the
379	C<terminate> or C<cancel> functions. C<join> can be called multiple times	445	C<terminate> or C<cancel> functions. C<join> can be called concurrently
380	from multiple coroutine.	446	from multiple coroutines, and all will be resumed and given the status
		447	return once the C<$coroutine> terminates.
381		448
382	=cut	449	=cut
383		450
384	sub join {	451	sub join {
385	my $self = shift;	452	my $self = shift;
386		453
387	unless ($self->{status}) {	454	unless ($self->{_status}) {
388	my $current = $current;	455	my $current = $current;
389		456
390	push @{$self->{destroy_cb}}, sub {	457	push @{$self->{_on_destroy}}, sub {
391	$current->ready;	458	$current->ready;
392	undef $current;	459	undef $current;
393	};	460	};
394		461
395	&schedule while $current;	462	&schedule while $current;
396	}	463	}
397		464
398	wantarray ? @{$self->{status}} : $self->{status}[0];	465	wantarray ? @{$self->{_status}} : $self->{_status}[0];
399	}	466	}
400		467
401	=item $coroutine->on_destroy (\&cb)	468	=item $coroutine->on_destroy (\&cb)
402		469
403	Registers a callback that is called when this coroutine gets destroyed,	470	Registers a callback that is called when this coroutine gets destroyed,
404	but before it is joined. The callback gets passed the terminate arguments,	471	but before it is joined. The callback gets passed the terminate arguments,
405	if any.	472	if any, and I<must not> die, under any circumstances.
406		473
407	=cut	474	=cut
408		475
409	sub on_destroy {	476	sub on_destroy {
410	my ($self, $cb) = @_;	477	my ($self, $cb) = @_;
411		478
412	push @{ $self->{destroy_cb} }, $cb;	479	push @{ $self->{_on_destroy} }, $cb;
413	}	480	}
414		481
415	=item $oldprio = $coroutine->prio ($newprio)	482	=item $oldprio = $coroutine->prio ($newprio)
416		483
417	Sets (or gets, if the argument is missing) the priority of the	484	Sets (or gets, if the argument is missing) the priority of the
…		…
442	=item $olddesc = $coroutine->desc ($newdesc)	509	=item $olddesc = $coroutine->desc ($newdesc)
443		510
444	Sets (or gets in case the argument is missing) the description for this	511	Sets (or gets in case the argument is missing) the description for this
445	coroutine. This is just a free-form string you can associate with a coroutine.	512	coroutine. This is just a free-form string you can associate with a coroutine.
446		513
		514	This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
		515	can modify this member directly if you wish.
		516
		517	=item $coroutine->throw ([$scalar])
		518
		519	If C<$throw> is specified and defined, it will be thrown as an exception
		520	inside the coroutine at the next convinient point in time (usually after
		521	it gains control at the next schedule/transfer/cede). Otherwise clears the
		522	exception object.
		523
		524	The exception object will be thrown "as is" with the specified scalar in
		525	C<$@>, i.e. if it is a string, no line number or newline will be appended
		526	(unlike with C<die>).
		527
		528	This can be used as a softer means than C<cancel> to ask a coroutine to
		529	end itself, although there is no guarentee that the exception will lead to
		530	termination, and if the exception isn't caught it might well end the whole
		531	program.
		532
447	=cut	533	=cut
448		534
449	sub desc {	535	sub desc {
450	my $old = $_[0]{desc};	536	my $old = $_[0]{desc};
451	$_[0]{desc} = $_[1] if @_ > 1;	537	$_[0]{desc} = $_[1] if @_ > 1;
…		…
459	=over 4	545	=over 4
460		546
461	=item Coro::nready	547	=item Coro::nready
462		548
463	Returns the number of coroutines that are currently in the ready state,	549	Returns the number of coroutines that are currently in the ready state,
464	i.e. that can be swicthed to. The value C<0> means that the only runnable	550	i.e. that can be switched to by calling C<schedule> directory or
		551	indirectly. The value C<0> means that the only runnable coroutine is the
465	coroutine is the currently running one, so C<cede> would have no effect,	552	currently running one, so C<cede> would have no effect, and C<schedule>
466	and C<schedule> would cause a deadlock unless there is an idle handler	553	would cause a deadlock unless there is an idle handler that wakes up some
467	that wakes up some coroutines.	554	coroutines.
468		555
469	=item my $guard = Coro::guard { ... }	556	=item my $guard = Coro::guard { ... }
470		557
471	This creates and returns a guard object. Nothing happens until the object	558	This creates and returns a guard object. Nothing happens until the object
472	gets destroyed, in which case the codeblock given as argument will be	559	gets destroyed, in which case the codeblock given as argument will be
…		…
501		588
502		589
503	=item unblock_sub { ... }	590	=item unblock_sub { ... }
504		591
505	This utility function takes a BLOCK or code reference and "unblocks" it,	592	This utility function takes a BLOCK or code reference and "unblocks" it,
506	returning the new coderef. This means that the new coderef will return	593	returning a new coderef. Unblocking means that calling the new coderef
507	immediately without blocking, returning nothing, while the original code	594	will return immediately without blocking, returning nothing, while the
508	ref will be called (with parameters) from within its own coroutine.	595	original code ref will be called (with parameters) from within another
		596	coroutine.
509		597
510	The reason this fucntion exists is that many event libraries (such as the	598	The reason this function exists is that many event libraries (such as the
511	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form	599	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form
512	of thread-safety). This means you must not block within event callbacks,	600	of thread-safety). This means you must not block within event callbacks,
513	otherwise you might suffer from crashes or worse.	601	otherwise you might suffer from crashes or worse. The only event library
		602	currently known that is safe to use without C<unblock_sub> is L<EV>.
514		603
515	This function allows your callbacks to block by executing them in another	604	This function allows your callbacks to block by executing them in another
516	coroutine where it is safe to block. One example where blocking is handy	605	coroutine where it is safe to block. One example where blocking is handy
517	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to	606	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to
518	disk.	607	disk, for example.
519		608
520	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when	609	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
521	creating event callbacks that want to block.	610	creating event callbacks that want to block.
		611
		612	If your handler does not plan to block (e.g. simply sends a message to
		613	another coroutine, or puts some other coroutine into the ready queue),
		614	there is no reason to use C<unblock_sub>.
522		615
523	=cut	616	=cut
524		617
525	our @unblock_queue;	618	our @unblock_queue;
526		619
527	# we create a special coro because we want to cede,	620	# we create a special coro because we want to cede,
528	# to reduce pressure on the coro pool (because most callbacks	621	# to reduce pressure on the coro pool (because most callbacks
529	# return immediately and can be reused) and because we cannot cede	622	# return immediately and can be reused) and because we cannot cede
530	# inside an event callback.	623	# inside an event callback.
531	our $unblock_scheduler = async {	624	our $unblock_scheduler = new Coro sub {
532	while () {	625	while () {
533	while (my $cb = pop @unblock_queue) {	626	while (my $cb = pop @unblock_queue) {
534	# this is an inlined copy of async_pool	627	# this is an inlined copy of async_pool
535	my $coro = (pop @pool or new Coro \&pool_handler);	628	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
536		629
537	$coro->{_invoke} = $cb;	630	$coro->{_invoke} = $cb;
538	$coro->ready;	631	$coro->ready;
539	cede; # for short-lived callbacks, this reduces pressure on the coro pool	632	cede; # for short-lived callbacks, this reduces pressure on the coro pool
540	}	633	}
541	schedule; # sleep well	634	schedule; # sleep well
542	}	635	}
543	};	636	};
		637	$unblock_scheduler->desc ("[unblock_sub scheduler]");
544		638
545	sub unblock_sub(&) {	639	sub unblock_sub(&) {
546	my $cb = shift;	640	my $cb = shift;
547		641
548	sub {	642	sub {
…		…
557		651
558	1;	652	1;
559		653
560	=head1 BUGS/LIMITATIONS	654	=head1 BUGS/LIMITATIONS
561		655
562	- you must make very sure that no coro is still active on global
563	destruction. very bad things might happen otherwise (usually segfaults).
564
565	- this module is not thread-safe. You should only ever use this module	656	This module is not perl-pseudo-thread-safe. You should only ever use this
566	from the same thread (this requirement might be losened in the future	657	module from the same thread (this requirement might be removed in the
567	to allow per-thread schedulers, but Coro::State does not yet allow	658	future to allow per-thread schedulers, but Coro::State does not yet allow
568	this).	659	this). I recommend disabling thread support and using processes, as this
		660	is much faster and uses less memory.
569		661
570	=head1 SEE ALSO	662	=head1 SEE ALSO
571		663
		664	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
		665
		666	Debugging: L<Coro::Debug>.
		667
572	Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.	668	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
573		669
574	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.	670	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
575		671
576	Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.	672	IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
577		673
578	Embedding: L<Coro:MakeMaker>	674	Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
		675
		676	XS API: L<Coro::MakeMaker>.
		677
		678	Low level Configuration, Coroutine Environment: L<Coro::State>.
579		679
580	=head1 AUTHOR	680	=head1 AUTHOR
581		681
582	Marc Lehmann <schmorp@schmorp.de>	682	Marc Lehmann <schmorp@schmorp.de>
583	http://home.schmorp.de/	683	http://home.schmorp.de/

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.119 by root, Wed Mar 28 14:24:17 2007 UTC vs. Revision 1.181 by root, Fri May 9 22:04:37 2008 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.119 by root, Wed Mar 28 14:24:17 2007 UTC vs.
Revision 1.181 by root, Fri May 9 22:04:37 2008 UTC