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

Comparing Coro/Coro.pm (file contents):
Revision 1.42 by root, Tue Nov 6 20:37:20 2001 UTC vs.
Revision 1.145 by root, Wed Oct 3 16:03:17 2007 UTC

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.42 by root, Tue Nov 6 20:37:20 2001 UTC vs. Revision 1.145 by root, Wed Oct 3 16:03:17 2007 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.42 by root, Tue Nov 6 20:37:20 2001 UTC vs.
Revision 1.145 by root, Wed Oct 3 16:03:17 2007 UTC