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

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.78 by root, Wed Nov 1 01:21:21 2006 UTC vs. Revision 1.180 by root, Fri Apr 25 04:28:50 2008 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.78 by root, Wed Nov 1 01:21:21 2006 UTC vs.
Revision 1.180 by root, Fri Apr 25 04:28:50 2008 UTC