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

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.65 by root, Tue Feb 22 19:51:58 2005 UTC vs. Revision 1.136 by root, Sat Sep 22 22:59:31 2007 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.65 by root, Tue Feb 22 19:51:58 2005 UTC vs.
Revision 1.136 by root, Sat Sep 22 22:59:31 2007 UTC