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

Comparing Coro/Coro.pm (file contents):
Revision 1.80 by root, Mon Nov 6 19:56:26 2006 UTC vs.
Revision 1.178 by root, Thu Apr 17 22:33:10 2008 UTC

…		…
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	};
		15	print "1\n";
		16	cede; # yield to coroutine
		17	print "3\n";
		18	cede; # and again
12		19
13	# alternatively create an async process like this:	20	# use locking
		21	my $lock = new Coro::Semaphore;
		22	my $locked;
14		23
15	sub some_func : Coro {	24	$lock->down;
16	# some more async code	25	$locked = 1;
17	}	26	$lock->up;
18
19	cede;
20		27
21	=head1 DESCRIPTION	28	=head1 DESCRIPTION
22		29
23	This module collection manages coroutines. Coroutines are similar to	30	This module collection manages coroutines. Coroutines are similar
24	threads but don't run in parallel.	31	to threads but don't run in parallel at the same time even on SMP
		32	machines. The specific flavor of coroutine used in this module also
		33	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 than threads programming.
25		37
		38	(Perl, however, does not natively support real threads but instead does a
		39	very slow and memory-intensive emulation of processes using threads. This
		40	is a performance win on Windows machines, and a loss everywhere else).
		41
26	In this module, coroutines are defined as "callchain + lexical variables	42	In this module, coroutines are defined as "callchain + lexical variables +
27	+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own	43	@_ + $_ + $@ + $/ + 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	44	its own set of lexicals and its own set of perls most important global
29	important global variables.	45	variables (see L<Coro::State> for more configuration).
30		46
31	=cut	47	=cut
32		48
33	package Coro;	49	package Coro;
34		50
35	use strict;	51	use strict;
36	no warnings "uninitialized";	52	no warnings "uninitialized";
37		53
38	use Coro::State;	54	use Coro::State;
39		55
40	use base Exporter::;	56	use base qw(Coro::State Exporter);
41		57
42	our $idle; # idle coroutine	58	our $idle; # idle handler
43	our $main; # main coroutine	59	our $main; # main coroutine
44	our $current; # current coroutine	60	our $current; # current coroutine
45		61
46	our $VERSION = '2.5';	62	our $VERSION = '4.51';
47		63
48	our @EXPORT = qw(async cede schedule terminate current);	64	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
49	our %EXPORT_TAGS = (	65	our %EXPORT_TAGS = (
50	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	66	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
51	);	67	);
52	our @EXPORT_OK = @{$EXPORT_TAGS{prio}};	68	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
53		69
54	{	70	{
55	my @async;	71	my @async;
56	my $init;	72	my $init;
57		73
58	# this way of handling attributes simply is NOT scalable ;()	74	# this way of handling attributes simply is NOT scalable ;()
59	sub import {	75	sub import {
60	no strict 'refs';	76	no strict 'refs';
61		77
62	Coro->export_to_level(1, @_);	78	Coro->export_to_level (1, @_);
63		79
64	my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};	80	my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
65	*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {	81	*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
66	my ($package, $ref) = (shift, shift);	82	my ($package, $ref) = (shift, shift);
67	my @attrs;	83	my @attrs;
…		…
95		111
96	$main = new Coro;	112	$main = new Coro;
97		113
98	=item $current (or as function: current)	114	=item $current (or as function: current)
99		115
100	The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course).	116	The current coroutine (the last coroutine switched to). The initial value
		117	is C<$main> (of course).
101		118
		119	This variable is B<strictly> I<read-only>. It is provided for performance
		120	reasons. If performance is not essential you are encouraged to use the
		121	C<Coro::current> function instead.
		122
102	=cut	123	=cut
		124
		125	$main->{desc} = "[main::]";
103		126
104	# maybe some other module used Coro::Specific before...	127	# maybe some other module used Coro::Specific before...
105	if ($current) {
106	$main->{specific} = $current->{specific};	128	$main->{_specific} = $current->{_specific}
107	}	129	if $current;
108		130
109	$current = $main;	131	_set_current $main;
110		132
111	sub current() { $current }	133	sub current() { $current }
112		134
113	=item $idle	135	=item $idle
114		136
115	The coroutine to switch to when no other coroutine is running. The default	137	A callback that is called whenever the scheduler finds no ready coroutines
116	implementation prints "FATAL: deadlock detected" and exits.	138	to run. The default implementation prints "FATAL: deadlock detected" and
		139	exits, because the program has no other way to continue.
117		140
118	=cut	141	This hook is overwritten by modules such as C<Coro::Timer> and
		142	C<Coro::Event> to wait on an external event that hopefully wake up a
		143	coroutine so the scheduler can run it.
119		144
120	# should be done using priorities :(	145	Please note that if your callback recursively invokes perl (e.g. for event
121	$idle = new Coro sub {	146	handlers), then it must be prepared to be called recursively itself.
122	print STDERR "FATAL: deadlock detected\n";	147
123	exit(51);	148	=cut
		149
		150	$idle = sub {
		151	require Carp;
		152	Carp::croak ("FATAL: deadlock detected");
124	};	153	};
		154
		155	sub _cancel {
		156	my ($self) = @_;
		157
		158	# free coroutine data and mark as destructed
		159	$self->_destroy
		160	or return;
		161
		162	# call all destruction callbacks
		163	$_->(@{$self->{_status}})
		164	for @{(delete $self->{_on_destroy}) \|\| []};
		165	}
125		166
126	# this coroutine is necessary because a coroutine	167	# this coroutine is necessary because a coroutine
127	# cannot destroy itself.	168	# cannot destroy itself.
128	my @destroy;	169	my @destroy;
129	my $manager;	170	my $manager;
		171
130	$manager = new Coro sub {	172	$manager = new Coro sub {
131	while () {	173	while () {
132	# by overwriting the state object with the manager we destroy it	174	(shift @destroy)->_cancel
133	# while still being able to schedule this coroutine (in case it has
134	# been readied multiple times. this is harmless since the manager
135	# can be called as many times as neccessary and will always
136	# remove itself from the runqueue
137	while (@destroy) {	175	while @destroy;
138	my $coro = pop @destroy;
139	$coro->{status} \|\|= [];
140	$_->ready for @{delete $coro->{join} \|\| []};
141		176
142	# the next line destroys the _coro_state, but keeps the
143	# process itself intact (we basically make it a zombie
144	# process that always runs the manager thread, so it's possible
145	# to transfer() to this process).
146	$coro->{_coro_state} = $manager->{_coro_state};
147	}
148	&schedule;	177	&schedule;
149	}	178	}
150	};	179	};
151		180	$manager->desc ("[coro manager]");
152	# static methods. not really.	181	$manager->prio (PRIO_MAX);
153		182
154	=back	183	=back
155		184
156	=head2 STATIC METHODS	185	=head2 STATIC METHODS
157		186
158	Static methods are actually functions that operate on the current process only.	187	Static methods are actually functions that operate on the current coroutine only.
159		188
160	=over 4	189	=over 4
161		190
162	=item async { ... } [@args...]	191	=item async { ... } [@args...]
163		192
164	Create a new asynchronous process and return it's process object	193	Create a new asynchronous coroutine and return it's coroutine object
165	(usually unused). When the sub returns the new process is automatically	194	(usually unused). When the sub returns the new coroutine is automatically
166	terminated.	195	terminated.
167		196
168	When the coroutine dies, the program will exit, just as in the main	197	See the C<Coro::State::new> constructor for info about the coroutine
169	program.	198	environment in which coroutines run.
		199
		200	Calling C<exit> in a coroutine will do the same as calling exit outside
		201	the coroutine. Likewise, when the coroutine dies, the program will exit,
		202	just as it would in the main program.
170		203
171	# create a new coroutine that just prints its arguments	204	# create a new coroutine that just prints its arguments
172	async {	205	async {
173	print "@_\n";	206	print "@_\n";
174	} 1,2,3,4;	207	} 1,2,3,4;
175		208
176	=cut	209	=cut
177		210
178	sub async(&@) {	211	sub async(&@) {
179	my $pid = new Coro @_;	212	my $coro = new Coro @_;
180	$manager->ready; # this ensures that the stack is cloned from the manager
181	$pid->ready;	213	$coro->ready;
182	$pid;	214	$coro
		215	}
		216
		217	=item async_pool { ... } [@args...]
		218
		219	Similar to C<async>, but uses a coroutine pool, so you should not call
		220	terminate or join (although you are allowed to), and you get a coroutine
		221	that might have executed other code already (which can be good or bad :).
		222
		223	Also, the block is executed in an C<eval> context and a warning will be
		224	issued in case of an exception instead of terminating the program, as
		225	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
		226	will not work in the expected way, unless you call terminate or cancel,
		227	which somehow defeats the purpose of pooling.
		228
		229	The priority will be reset to C<0> after each job, tracing will be
		230	disabled, the description will be reset and the default output filehandle
		231	gets restored, so you can change alkl these. Otherwise the coroutine will
		232	be re-used "as-is": most notably if you change other per-coroutine global
		233	stuff such as C<$/> you need to revert that change, which is most simply
		234	done by using local as in C< local $/ >.
		235
		236	The pool size is limited to 8 idle coroutines (this can be adjusted by
		237	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
		238	required.
		239
		240	If you are concerned about pooled coroutines growing a lot because a
		241	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
		242	{ terminate }> once per second or so to slowly replenish the pool. In
		243	addition to that, when the stacks used by a handler grows larger than 16kb
		244	(adjustable with $Coro::POOL_RSS) it will also exit.
		245
		246	=cut
		247
		248	our $POOL_SIZE = 8;
		249	our $POOL_RSS = 16 * 1024;
		250	our @async_pool;
		251
		252	sub pool_handler {
		253	my $cb;
		254
		255	while () {
		256	eval {
		257	while () {
		258	_pool_1 $cb;
		259	&$cb;
		260	_pool_2 $cb;
		261	&schedule;
		262	}
		263	};
		264
		265	last if $@ eq "\3async_pool terminate\2\n";
		266	warn $@ if $@;
		267	}
		268	}
		269
		270	sub async_pool(&@) {
		271	# this is also inlined into the unlock_scheduler
		272	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
		273
		274	$coro->{_invoke} = [@_];
		275	$coro->ready;
		276
		277	$coro
183	}	278	}
184		279
185	=item schedule	280	=item schedule
186		281
187	Calls the scheduler. Please note that the current process will not be put	282	Calls the scheduler. Please note that the current coroutine will not be put
188	into the ready queue, so calling this function usually means you will	283	into the ready queue, so calling this function usually means you will
189	never be called again.	284	never be called again unless something else (e.g. an event handler) calls
		285	ready.
190		286
191	=cut	287	The canonical way to wait on external events is this:
		288
		289	{
		290	# remember current coroutine
		291	my $current = $Coro::current;
		292
		293	# register a hypothetical event handler
		294	on_event_invoke sub {
		295	# wake up sleeping coroutine
		296	$current->ready;
		297	undef $current;
		298	};
		299
		300	# call schedule until event occurred.
		301	# in case we are woken up for other reasons
		302	# (current still defined), loop.
		303	Coro::schedule while $current;
		304	}
192		305
193	=item cede	306	=item cede
194		307
195	"Cede" to other processes. This function puts the current process into the	308	"Cede" to other coroutines. This function puts the current coroutine into the
196	ready queue and calls C<schedule>, which has the effect of giving up the	309	ready queue and calls C<schedule>, which has the effect of giving up the
197	current "timeslice" to other coroutines of the same or higher priority.	310	current "timeslice" to other coroutines of the same or higher priority.
198		311
199	=cut	312	=item Coro::cede_notself
		313
		314	Works like cede, but is not exported by default and will cede to any
		315	coroutine, regardless of priority, once.
200		316
201	=item terminate [arg...]	317	=item terminate [arg...]
202		318
203	Terminates the current process with the given status values (see L<cancel>).	319	Terminates the current coroutine with the given status values (see L<cancel>).
		320
		321	=item killall
		322
		323	Kills/terminates/cancels all coroutines except the currently running
		324	one. This is useful after a fork, either in the child or the parent, as
		325	usually only one of them should inherit the running coroutines.
204		326
205	=cut	327	=cut
206		328
207	sub terminate {	329	sub terminate {
208	$current->cancel (@_);	330	$current->cancel (@_);
209	}	331	}
210		332
		333	sub killall {
		334	for (Coro::State::list) {
		335	$_->cancel
		336	if $_ != $current && UNIVERSAL::isa $_, "Coro";
		337	}
		338	}
		339
211	=back	340	=back
212		341
213	# dynamic methods
214
215	=head2 PROCESS METHODS	342	=head2 COROUTINE METHODS
216		343
217	These are the methods you can call on process objects.	344	These are the methods you can call on coroutine objects.
218		345
219	=over 4	346	=over 4
220		347
221	=item new Coro \&sub [, @args...]	348	=item new Coro \&sub [, @args...]
222		349
223	Create a new process and return it. When the sub returns the process	350	Create a new coroutine and return it. When the sub returns the coroutine
224	automatically terminates as if C<terminate> with the returned values were	351	automatically terminates as if C<terminate> with the returned values were
225	called. To make the process run you must first put it into the ready queue	352	called. To make the coroutine run you must first put it into the ready queue
226	by calling the ready method.	353	by calling the ready method.
227		354
228	=cut	355	See C<async> and C<Coro::State::new> for additional info about the
		356	coroutine environment.
229		357
		358	=cut
		359
230	sub _newcoro {	360	sub _run_coro {
231	terminate &{+shift};	361	terminate &{+shift};
232	}	362	}
233		363
234	sub new {	364	sub new {
235	my $class = shift;	365	my $class = shift;
236	bless {
237	_coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
238	}, $class;
239	}
240		366
241	=item $process->ready	367	$class->SUPER::new (\&_run_coro, @_)
		368	}
242		369
243	Put the given process into the ready queue.	370	=item $success = $coroutine->ready
244		371
245	=cut	372	Put the given coroutine into the ready queue (according to it's priority)
		373	and return true. If the coroutine is already in the ready queue, do nothing
		374	and return false.
246		375
		376	=item $is_ready = $coroutine->is_ready
		377
		378	Return wether the coroutine is currently the ready queue or not,
		379
247	=item $process->cancel (arg...)	380	=item $coroutine->cancel (arg...)
248		381
249	Terminates the given process and makes it return the given arguments as	382	Terminates the given coroutine and makes it return the given arguments as
250	status (default: the empty list).	383	status (default: the empty list). Never returns if the coroutine is the
		384	current coroutine.
251		385
252	=cut	386	=cut
253		387
254	sub cancel {	388	sub cancel {
255	my $self = shift;	389	my $self = shift;
256	$self->{status} = [@_];	390	$self->{_status} = [@_];
		391
		392	if ($current == $self) {
257	push @destroy, $self;	393	push @destroy, $self;
258	$manager->ready;	394	$manager->ready;
259	&schedule if $current == $self;	395	&schedule while 1;
		396	} else {
		397	$self->_cancel;
		398	}
260	}	399	}
261		400
262	=item $process->join	401	=item $coroutine->join
263		402
264	Wait until the coroutine terminates and return any values given to the	403	Wait until the coroutine terminates and return any values given to the
265	C<terminate> or C<cancel> functions. C<join> can be called multiple times	404	C<terminate> or C<cancel> functions. C<join> can be called concurrently
266	from multiple processes.	405	from multiple coroutines.
267		406
268	=cut	407	=cut
269		408
270	sub join {	409	sub join {
271	my $self = shift;	410	my $self = shift;
		411
272	unless ($self->{status}) {	412	unless ($self->{_status}) {
273	push @{$self->{join}}, $current;	413	my $current = $current;
274	&schedule;	414
		415	push @{$self->{_on_destroy}}, sub {
		416	$current->ready;
		417	undef $current;
		418	};
		419
		420	&schedule while $current;
275	}	421	}
		422
276	wantarray ? @{$self->{status}} : $self->{status}[0];	423	wantarray ? @{$self->{_status}} : $self->{_status}[0];
277	}	424	}
278		425
		426	=item $coroutine->on_destroy (\&cb)
		427
		428	Registers a callback that is called when this coroutine gets destroyed,
		429	but before it is joined. The callback gets passed the terminate arguments,
		430	if any.
		431
		432	=cut
		433
		434	sub on_destroy {
		435	my ($self, $cb) = @_;
		436
		437	push @{ $self->{_on_destroy} }, $cb;
		438	}
		439
279	=item $oldprio = $process->prio($newprio)	440	=item $oldprio = $coroutine->prio ($newprio)
280		441
281	Sets (or gets, if the argument is missing) the priority of the	442	Sets (or gets, if the argument is missing) the priority of the
282	process. Higher priority processes get run before lower priority	443	coroutine. Higher priority coroutines get run before lower priority
283	processes. Priorities are small signed integers (currently -4 .. +3),	444	coroutines. Priorities are small signed integers (currently -4 .. +3),
284	that you can refer to using PRIO_xxx constants (use the import tag :prio	445	that you can refer to using PRIO_xxx constants (use the import tag :prio
285	to get then):	446	to get then):
286		447
287	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN	448	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
288	3 > 1 > 0 > -1 > -3 > -4	449	3 > 1 > 0 > -1 > -3 > -4
…		…
291	current->prio(PRIO_HIGH);	452	current->prio(PRIO_HIGH);
292		453
293	The idle coroutine ($Coro::idle) always has a lower priority than any	454	The idle coroutine ($Coro::idle) always has a lower priority than any
294	existing coroutine.	455	existing coroutine.
295		456
296	Changing the priority of the current process will take effect immediately,	457	Changing the priority of the current coroutine will take effect immediately,
297	but changing the priority of processes in the ready queue (but not	458	but changing the priority of coroutines in the ready queue (but not
298	running) will only take effect after the next schedule (of that	459	running) will only take effect after the next schedule (of that
299	process). This is a bug that will be fixed in some future version.	460	coroutine). This is a bug that will be fixed in some future version.
300		461
301	=cut
302
303	sub prio {
304	my $old = $_[0]{prio};
305	$_[0]{prio} = $_[1] if @_ > 1;
306	$old;
307	}
308
309	=item $newprio = $process->nice($change)	462	=item $newprio = $coroutine->nice ($change)
310		463
311	Similar to C<prio>, but subtract the given value from the priority (i.e.	464	Similar to C<prio>, but subtract the given value from the priority (i.e.
312	higher values mean lower priority, just as in unix).	465	higher values mean lower priority, just as in unix).
313		466
314	=cut
315
316	sub nice {
317	$_[0]{prio} -= $_[1];
318	}
319
320	=item $olddesc = $process->desc($newdesc)	467	=item $olddesc = $coroutine->desc ($newdesc)
321		468
322	Sets (or gets in case the argument is missing) the description for this	469	Sets (or gets in case the argument is missing) the description for this
323	process. This is just a free-form string you can associate with a process.	470	coroutine. This is just a free-form string you can associate with a coroutine.
		471
		472	This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
		473	can modify this member directly if you wish.
		474
		475	=item $coroutine->throw ([$scalar])
		476
		477	If C<$throw> is specified and defined, it will be thrown as an exception
		478	inside the coroutine at the next convinient point in time (usually after
		479	it gains control at the next schedule/transfer/cede). Otherwise clears the
		480	exception object.
		481
		482	The exception object will be thrown "as is" with the specified scalar in
		483	C<$@>, i.e. if it is a string, no line number or newline will be appended
		484	(unlike with C<die>).
		485
		486	This can be used as a softer means than C<cancel> to ask a coroutine to
		487	end itself, although there is no guarentee that the exception will lead to
		488	termination, and if the exception isn't caught it might well end the whole
		489	program.
324		490
325	=cut	491	=cut
326		492
327	sub desc {	493	sub desc {
328	my $old = $_[0]{desc};	494	my $old = $_[0]{desc};
…		…
330	$old;	496	$old;
331	}	497	}
332		498
333	=back	499	=back
334		500
		501	=head2 GLOBAL FUNCTIONS
		502
		503	=over 4
		504
		505	=item Coro::nready
		506
		507	Returns the number of coroutines that are currently in the ready state,
		508	i.e. that can be switched to. The value C<0> means that the only runnable
		509	coroutine is the currently running one, so C<cede> would have no effect,
		510	and C<schedule> would cause a deadlock unless there is an idle handler
		511	that wakes up some coroutines.
		512
		513	=item my $guard = Coro::guard { ... }
		514
		515	This creates and returns a guard object. Nothing happens until the object
		516	gets destroyed, in which case the codeblock given as argument will be
		517	executed. This is useful to free locks or other resources in case of a
		518	runtime error or when the coroutine gets canceled, as in both cases the
		519	guard block will be executed. The guard object supports only one method,
		520	C<< ->cancel >>, which will keep the codeblock from being executed.
		521
		522	Example: set some flag and clear it again when the coroutine gets canceled
		523	or the function returns:
		524
		525	sub do_something {
		526	my $guard = Coro::guard { $busy = 0 };
		527	$busy = 1;
		528
		529	# do something that requires $busy to be true
		530	}
		531
		532	=cut
		533
		534	sub guard(&) {
		535	bless \(my $cb = $_[0]), "Coro::guard"
		536	}
		537
		538	sub Coro::guard::cancel {
		539	${$_[0]} = sub { };
		540	}
		541
		542	sub Coro::guard::DESTROY {
		543	${$_[0]}->();
		544	}
		545
		546
		547	=item unblock_sub { ... }
		548
		549	This utility function takes a BLOCK or code reference and "unblocks" it,
		550	returning the new coderef. This means that the new coderef will return
		551	immediately without blocking, returning nothing, while the original code
		552	ref will be called (with parameters) from within its own coroutine.
		553
		554	The reason this function exists is that many event libraries (such as the
		555	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form
		556	of thread-safety). This means you must not block within event callbacks,
		557	otherwise you might suffer from crashes or worse.
		558
		559	This function allows your callbacks to block by executing them in another
		560	coroutine where it is safe to block. One example where blocking is handy
		561	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to
		562	disk.
		563
		564	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
		565	creating event callbacks that want to block.
		566
		567	=cut
		568
		569	our @unblock_queue;
		570
		571	# we create a special coro because we want to cede,
		572	# to reduce pressure on the coro pool (because most callbacks
		573	# return immediately and can be reused) and because we cannot cede
		574	# inside an event callback.
		575	our $unblock_scheduler = new Coro sub {
		576	while () {
		577	while (my $cb = pop @unblock_queue) {
		578	# this is an inlined copy of async_pool
		579	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
		580
		581	$coro->{_invoke} = $cb;
		582	$coro->ready;
		583	cede; # for short-lived callbacks, this reduces pressure on the coro pool
		584	}
		585	schedule; # sleep well
		586	}
		587	};
		588	$unblock_scheduler->desc ("[unblock_sub scheduler]");
		589
		590	sub unblock_sub(&) {
		591	my $cb = shift;
		592
		593	sub {
		594	unshift @unblock_queue, [$cb, @_];
		595	$unblock_scheduler->ready;
		596	}
		597	}
		598
		599	=back
		600
335	=cut	601	=cut
336		602
337	1;	603	1;
338		604
339	=head1 BUGS/LIMITATIONS	605	=head1 BUGS/LIMITATIONS
340		606
341	- you must make very sure that no coro is still active on global	607	- you must make very sure that no coro is still active on global
342	destruction. very bad things might happen otherwise (usually segfaults).	608	destruction. very bad things might happen otherwise (usually segfaults).
343		609
344	- this module is not thread-safe. You should only ever use this module	610	- this module is not thread-safe. You should only ever use this module
345	from the same thread (this requirement might be losened in the future	611	from the same thread (this requirement might be loosened in the future
346	to allow per-thread schedulers, but Coro::State does not yet allow	612	to allow per-thread schedulers, but Coro::State does not yet allow
347	this).	613	this).
348		614
349	=head1 SEE ALSO	615	=head1 SEE ALSO
350		616
		617	Lower level Configuration, Coroutine Environment: L<Coro::State>.
		618
		619	Debugging: L<Coro::Debug>.
		620
351	Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.	621	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
352		622
353	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.	623	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
354		624
355	Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.	625	Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>.
356		626
		627	Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>.
		628
357	Embedding: L<Coro:MakeMaker>	629	Embedding: L<Coro::MakeMaker>.
358		630
359	=head1 AUTHOR	631	=head1 AUTHOR
360		632
361	Marc Lehmann <schmorp@schmorp.de>	633	Marc Lehmann <schmorp@schmorp.de>
362	http://home.schmorp.de/	634	http://home.schmorp.de/

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.80 by root, Mon Nov 6 19:56:26 2006 UTC vs. Revision 1.178 by root, Thu Apr 17 22:33:10 2008 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.80 by root, Mon Nov 6 19:56:26 2006 UTC vs.
Revision 1.178 by root, Thu Apr 17 22:33:10 2008 UTC