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

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.38 by root, Wed Oct 3 01:09:56 2001 UTC vs. Revision 1.114 by root, Wed Jan 24 16:22:08 2007 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.38 by root, Wed Oct 3 01:09:56 2001 UTC vs.
Revision 1.114 by root, Wed Jan 24 16:22:08 2007 UTC