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

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.61 by pcg, Fri May 14 13:25:08 2004 UTC vs. Revision 1.139 by root, Thu Sep 27 15:52:30 2007 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.61 by pcg, Fri May 14 13:25:08 2004 UTC vs.
Revision 1.139 by root, Thu Sep 27 15:52:30 2007 UTC