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

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.121 by root, Fri Apr 13 12:56:55 2007 UTC vs.
Revision 1.179 by root, Sat Apr 19 19:06:02 2008 UTC

…		…
2		2
3	Coro - coroutine process abstraction	3	Coro - coroutine process abstraction
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
7	use Coro;	7	use Coro;
8		8
9	async {	9	async {
10	# some asynchronous thread of execution	10	# some asynchronous thread of execution
		11	print "2\n";
		12	cede; # yield back to main
		13	print "4\n";
11	};	14	};
12		15	print "1\n";
13	# alternatively create an async coroutine like this:	16	cede; # yield to coroutine
14		17	print "3\n";
15	sub some_func : Coro {	18	cede; # and again
16	# some more async code	19
17	}	20	# use locking
18		21	my $lock = new Coro::Semaphore;
19	cede;	22	my $locked;
		23
		24	$lock->down;
		25	$locked = 1;
		26	$lock->up;
20		27
21	=head1 DESCRIPTION	28	=head1 DESCRIPTION
22		29
23	This module collection manages coroutines. Coroutines are similar	30	This module collection manages coroutines. Coroutines are similar
24	to threads but don't run in parallel at the same time even on SMP	31	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	32	machines. The specific flavor of coroutine used in this module also
26	guarentees you that it will not switch between coroutines unless	33	guarantees you that it will not switch between coroutines unless
27	necessary, at easily-identified points in your program, so locking and	34	necessary, at easily-identified points in your program, so locking and
28	parallel access are rarely an issue, making coroutine programming much	35	parallel access are rarely an issue, making coroutine programming much
29	safer than threads programming.	36	safer than threads programming.
30		37
31	(Perl, however, does not natively support real threads but instead does a	38	(Perl, however, does not natively support real threads but instead does a
…		…
33	is a performance win on Windows machines, and a loss everywhere else).	40	is a performance win on Windows machines, and a loss everywhere else).
34		41
35	In this module, coroutines are defined as "callchain + lexical variables +	42	In this module, coroutines are defined as "callchain + lexical variables +
36	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,	43	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
37	its own set of lexicals and its own set of perls most important global	44	its own set of lexicals and its own set of perls most important global
38	variables.	45	variables (see L<Coro::State> for more configuration).
39		46
40	=cut	47	=cut
41		48
42	package Coro;	49	package Coro;
43		50
…		…
50		57
51	our $idle; # idle handler	58	our $idle; # idle handler
52	our $main; # main coroutine	59	our $main; # main coroutine
53	our $current; # current coroutine	60	our $current; # current coroutine
54		61
55	our $VERSION = '3.56';	62	our $VERSION = '4.51';
56		63
57	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);	64	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58	our %EXPORT_TAGS = (	65	our %EXPORT_TAGS = (
59	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	66	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60	);	67	);
61	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));	68	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
62		69
63	{
64	my @async;
65	my $init;
66
67	# this way of handling attributes simply is NOT scalable ;()
68	sub import {
69	no strict 'refs';
70
71	Coro->export_to_level (1, @_);
72
73	my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
74	*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
75	my ($package, $ref) = (shift, shift);
76	my @attrs;
77	for (@_) {
78	if ($_ eq "Coro") {
79	push @async, $ref;
80	unless ($init++) {
81	eval q{
82	sub INIT {
83	&async(pop @async) while @async;
84	}
85	};
86	}
87	} else {
88	push @attrs, $_;
89	}
90	}
91	return $old ? $old->($package, $ref, @attrs) : @attrs;
92	};
93	}
94
95	}
96
97	=over 4	70	=over 4
98		71
99	=item $main	72	=item $main
100		73
101	This coroutine represents the main program.	74	This coroutine represents the main program.
…		…
108		81
109	The current coroutine (the last coroutine switched to). The initial value	82	The current coroutine (the last coroutine switched to). The initial value
110	is C<$main> (of course).	83	is C<$main> (of course).
111		84
112	This variable is B<strictly> I<read-only>. It is provided for performance	85	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	86	reasons. If performance is not essential you are encouraged to use the
114	C<Coro::current> function instead.	87	C<Coro::current> function instead.
115		88
116	=cut	89	=cut
117		90
		91	$main->{desc} = "[main::]";
		92
118	# maybe some other module used Coro::Specific before...	93	# maybe some other module used Coro::Specific before...
119	$main->{specific} = $current->{specific}	94	$main->{_specific} = $current->{_specific}
120	if $current;	95	if $current;
121		96
122	_set_current $main;	97	_set_current $main;
123		98
124	sub current() { $current }	99	sub current() { $current }
…		…
132	This hook is overwritten by modules such as C<Coro::Timer> and	107	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	108	C<Coro::Event> to wait on an external event that hopefully wake up a
134	coroutine so the scheduler can run it.	109	coroutine so the scheduler can run it.
135		110
136	Please note that if your callback recursively invokes perl (e.g. for event	111	Please note that if your callback recursively invokes perl (e.g. for event
137	handlers), then it must be prepared to be called recursively.	112	handlers), then it must be prepared to be called recursively itself.
138		113
139	=cut	114	=cut
140		115
141	$idle = sub {	116	$idle = sub {
142	require Carp;	117	require Carp;
…		…
149	# free coroutine data and mark as destructed	124	# free coroutine data and mark as destructed
150	$self->_destroy	125	$self->_destroy
151	or return;	126	or return;
152		127
153	# call all destruction callbacks	128	# call all destruction callbacks
154	$_->(@{$self->{status}})	129	$_->(@{$self->{_status}})
155	for @{(delete $self->{destroy_cb}) \|\| []};	130	for @{(delete $self->{_on_destroy}) \|\| []};
156	}	131	}
157		132
158	# this coroutine is necessary because a coroutine	133	# this coroutine is necessary because a coroutine
159	# cannot destroy itself.	134	# cannot destroy itself.
160	my @destroy;	135	my @destroy;
…		…
166	while @destroy;	141	while @destroy;
167		142
168	&schedule;	143	&schedule;
169	}	144	}
170	};	145	};
171		146	$manager->desc ("[coro manager]");
172	$manager->prio (PRIO_MAX);	147	$manager->prio (PRIO_MAX);
173
174	# static methods. not really.
175		148
176	=back	149	=back
177		150
178	=head2 STATIC METHODS	151	=head2 STATIC METHODS
179		152
…		…
185		158
186	Create a new asynchronous coroutine and return it's coroutine object	159	Create a new asynchronous coroutine and return it's coroutine object
187	(usually unused). When the sub returns the new coroutine is automatically	160	(usually unused). When the sub returns the new coroutine is automatically
188	terminated.	161	terminated.
189		162
		163	See the C<Coro::State::new> constructor for info about the coroutine
		164	environment in which coroutines run.
		165
190	Calling C<exit> in a coroutine will try to do the same as calling exit	166	Calling C<exit> in a coroutine will do the same as calling exit outside
191	outside the coroutine, but this is experimental. It is best not to rely on	167	the coroutine. Likewise, when the coroutine dies, the program will exit,
192	exit doing any cleanups or even not crashing.	168	just as it would in the main program.
193
194	When the coroutine dies, the program will exit, just as in the main
195	program.
196		169
197	# create a new coroutine that just prints its arguments	170	# create a new coroutine that just prints its arguments
198	async {	171	async {
199	print "@_\n";	172	print "@_\n";
200	} 1,2,3,4;	173	} 1,2,3,4;
…		…
217	issued in case of an exception instead of terminating the program, as	190	issued in case of an exception instead of terminating the program, as
218	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>	191	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
219	will not work in the expected way, unless you call terminate or cancel,	192	will not work in the expected way, unless you call terminate or cancel,
220	which somehow defeats the purpose of pooling.	193	which somehow defeats the purpose of pooling.
221		194
222	The priority will be reset to C<0> after each job, otherwise the coroutine	195	The priority will be reset to C<0> after each job, tracing will be
223	will be re-used "as-is".	196	disabled, the description will be reset and the default output filehandle
		197	gets restored, so you can change alkl these. Otherwise the coroutine will
		198	be re-used "as-is": most notably if you change other per-coroutine global
		199	stuff such as C<$/> you need to revert that change, which is most simply
		200	done by using local as in C< local $/ >.
224		201
225	The pool size is limited to 8 idle coroutines (this can be adjusted by	202	The pool size is limited to 8 idle coroutines (this can be adjusted by
226	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as	203	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
227	required.	204	required.
228		205
229	If you are concerned about pooled coroutines growing a lot because a	206	If you are concerned about pooled coroutines growing a lot because a
230	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool {	207	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
231	terminate }> once per second or so to slowly replenish the pool.	208	{ terminate }> once per second or so to slowly replenish the pool. In
		209	addition to that, when the stacks used by a handler grows larger than 16kb
		210	(adjustable with $Coro::POOL_RSS) it will also exit.
232		211
233	=cut	212	=cut
234		213
235	our $POOL_SIZE = 8;	214	our $POOL_SIZE = 8;
		215	our $POOL_RSS = 16 * 1024;
236	our @pool;	216	our @async_pool;
237		217
238	sub pool_handler {	218	sub pool_handler {
		219	my $cb;
		220
239	while () {	221	while () {
240	eval {	222	eval {
241	my ($cb, @arg) = @{ delete $current->{_invoke} or return };	223	while () {
242	$cb->(@arg);	224	_pool_1 $cb;
		225	&$cb;
		226	_pool_2 $cb;
		227	&schedule;
		228	}
243	};	229	};
		230
		231	last if $@ eq "\3async_pool terminate\2\n";
244	warn $@ if $@;	232	warn $@ if $@;
245
246	last if @pool >= $POOL_SIZE;
247	push @pool, $current;
248
249	$current->save (Coro::State::SAVE_DEF);
250	$current->prio (0);
251	schedule;
252	}	233	}
253	}	234	}
254		235
255	sub async_pool(&@) {	236	sub async_pool(&@) {
256	# this is also inlined into the unlock_scheduler	237	# this is also inlined into the unlock_scheduler
257	my $coro = (pop @pool or new Coro \&pool_handler);	238	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
258		239
259	$coro->{_invoke} = [@_];	240	$coro->{_invoke} = [@_];
260	$coro->ready;	241	$coro->ready;
261		242
262	$coro	243	$coro
…		…
280	# wake up sleeping coroutine	261	# wake up sleeping coroutine
281	$current->ready;	262	$current->ready;
282	undef $current;	263	undef $current;
283	};	264	};
284		265
285	# call schedule until event occured.	266	# call schedule until event occurred.
286	# in case we are woken up for other reasons	267	# in case we are woken up for other reasons
287	# (current still defined), loop.	268	# (current still defined), loop.
288	Coro::schedule while $current;	269	Coro::schedule while $current;
289	}	270	}
290		271
…		…
292		273
293	"Cede" to other coroutines. This function puts the current coroutine into the	274	"Cede" to other coroutines. This function puts the current coroutine into the
294	ready queue and calls C<schedule>, which has the effect of giving up the	275	ready queue and calls C<schedule>, which has the effect of giving up the
295	current "timeslice" to other coroutines of the same or higher priority.	276	current "timeslice" to other coroutines of the same or higher priority.
296		277
297	Returns true if at least one coroutine switch has happened.
298
299	=item Coro::cede_notself	278	=item Coro::cede_notself
300		279
301	Works like cede, but is not exported by default and will cede to any	280	Works like cede, but is not exported by default and will cede to any
302	coroutine, regardless of priority, once.	281	coroutine, regardless of priority, once.
303		282
304	Returns true if at least one coroutine switch has happened.
305
306	=item terminate [arg...]	283	=item terminate [arg...]
307		284
308	Terminates the current coroutine with the given status values (see L<cancel>).	285	Terminates the current coroutine with the given status values (see L<cancel>).
		286
		287	=item killall
		288
		289	Kills/terminates/cancels all coroutines except the currently running
		290	one. This is useful after a fork, either in the child or the parent, as
		291	usually only one of them should inherit the running coroutines.
309		292
310	=cut	293	=cut
311		294
312	sub terminate {	295	sub terminate {
313	$current->cancel (@_);	296	$current->cancel (@_);
314	}	297	}
315		298
		299	sub killall {
		300	for (Coro::State::list) {
		301	$_->cancel
		302	if $_ != $current && UNIVERSAL::isa $_, "Coro";
		303	}
		304	}
		305
316	=back	306	=back
317
318	# dynamic methods
319		307
320	=head2 COROUTINE METHODS	308	=head2 COROUTINE METHODS
321		309
322	These are the methods you can call on coroutine objects.	310	These are the methods you can call on coroutine objects.
323		311
…		…
328	Create a new coroutine and return it. When the sub returns the coroutine	316	Create a new coroutine and return it. When the sub returns the coroutine
329	automatically terminates as if C<terminate> with the returned values were	317	automatically terminates as if C<terminate> with the returned values were
330	called. To make the coroutine run you must first put it into the ready queue	318	called. To make the coroutine run you must first put it into the ready queue
331	by calling the ready method.	319	by calling the ready method.
332		320
333	See C<async> for additional discussion.	321	See C<async> and C<Coro::State::new> for additional info about the
		322	coroutine environment.
334		323
335	=cut	324	=cut
336		325
337	sub _run_coro {	326	sub _run_coro {
338	terminate &{+shift};	327	terminate &{+shift};
…		…
362		351
363	=cut	352	=cut
364		353
365	sub cancel {	354	sub cancel {
366	my $self = shift;	355	my $self = shift;
367	$self->{status} = [@_];	356	$self->{_status} = [@_];
368		357
369	if ($current == $self) {	358	if ($current == $self) {
370	push @destroy, $self;	359	push @destroy, $self;
371	$manager->ready;	360	$manager->ready;
372	&schedule while 1;	361	&schedule while 1;
…		…
376	}	365	}
377		366
378	=item $coroutine->join	367	=item $coroutine->join
379		368
380	Wait until the coroutine terminates and return any values given to the	369	Wait until the coroutine terminates and return any values given to the
381	C<terminate> or C<cancel> functions. C<join> can be called multiple times	370	C<terminate> or C<cancel> functions. C<join> can be called concurrently
382	from multiple coroutine.	371	from multiple coroutines.
383		372
384	=cut	373	=cut
385		374
386	sub join {	375	sub join {
387	my $self = shift;	376	my $self = shift;
388		377
389	unless ($self->{status}) {	378	unless ($self->{_status}) {
390	my $current = $current;	379	my $current = $current;
391		380
392	push @{$self->{destroy_cb}}, sub {	381	push @{$self->{_on_destroy}}, sub {
393	$current->ready;	382	$current->ready;
394	undef $current;	383	undef $current;
395	};	384	};
396		385
397	&schedule while $current;	386	&schedule while $current;
398	}	387	}
399		388
400	wantarray ? @{$self->{status}} : $self->{status}[0];	389	wantarray ? @{$self->{_status}} : $self->{_status}[0];
401	}	390	}
402		391
403	=item $coroutine->on_destroy (\&cb)	392	=item $coroutine->on_destroy (\&cb)
404		393
405	Registers a callback that is called when this coroutine gets destroyed,	394	Registers a callback that is called when this coroutine gets destroyed,
…		…
409	=cut	398	=cut
410		399
411	sub on_destroy {	400	sub on_destroy {
412	my ($self, $cb) = @_;	401	my ($self, $cb) = @_;
413		402
414	push @{ $self->{destroy_cb} }, $cb;	403	push @{ $self->{_on_destroy} }, $cb;
415	}	404	}
416		405
417	=item $oldprio = $coroutine->prio ($newprio)	406	=item $oldprio = $coroutine->prio ($newprio)
418		407
419	Sets (or gets, if the argument is missing) the priority of the	408	Sets (or gets, if the argument is missing) the priority of the
…		…
444	=item $olddesc = $coroutine->desc ($newdesc)	433	=item $olddesc = $coroutine->desc ($newdesc)
445		434
446	Sets (or gets in case the argument is missing) the description for this	435	Sets (or gets in case the argument is missing) the description for this
447	coroutine. This is just a free-form string you can associate with a coroutine.	436	coroutine. This is just a free-form string you can associate with a coroutine.
448		437
		438	This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
		439	can modify this member directly if you wish.
		440
		441	=item $coroutine->throw ([$scalar])
		442
		443	If C<$throw> is specified and defined, it will be thrown as an exception
		444	inside the coroutine at the next convinient point in time (usually after
		445	it gains control at the next schedule/transfer/cede). Otherwise clears the
		446	exception object.
		447
		448	The exception object will be thrown "as is" with the specified scalar in
		449	C<$@>, i.e. if it is a string, no line number or newline will be appended
		450	(unlike with C<die>).
		451
		452	This can be used as a softer means than C<cancel> to ask a coroutine to
		453	end itself, although there is no guarentee that the exception will lead to
		454	termination, and if the exception isn't caught it might well end the whole
		455	program.
		456
449	=cut	457	=cut
450		458
451	sub desc {	459	sub desc {
452	my $old = $_[0]{desc};	460	my $old = $_[0]{desc};
453	$_[0]{desc} = $_[1] if @_ > 1;	461	$_[0]{desc} = $_[1] if @_ > 1;
…		…
461	=over 4	469	=over 4
462		470
463	=item Coro::nready	471	=item Coro::nready
464		472
465	Returns the number of coroutines that are currently in the ready state,	473	Returns the number of coroutines that are currently in the ready state,
466	i.e. that can be swicthed to. The value C<0> means that the only runnable	474	i.e. that can be switched to. The value C<0> means that the only runnable
467	coroutine is the currently running one, so C<cede> would have no effect,	475	coroutine is the currently running one, so C<cede> would have no effect,
468	and C<schedule> would cause a deadlock unless there is an idle handler	476	and C<schedule> would cause a deadlock unless there is an idle handler
469	that wakes up some coroutines.	477	that wakes up some coroutines.
470		478
471	=item my $guard = Coro::guard { ... }	479	=item my $guard = Coro::guard { ... }
…		…
507	This utility function takes a BLOCK or code reference and "unblocks" it,	515	This utility function takes a BLOCK or code reference and "unblocks" it,
508	returning the new coderef. This means that the new coderef will return	516	returning the new coderef. This means that the new coderef will return
509	immediately without blocking, returning nothing, while the original code	517	immediately without blocking, returning nothing, while the original code
510	ref will be called (with parameters) from within its own coroutine.	518	ref will be called (with parameters) from within its own coroutine.
511		519
512	The reason this fucntion exists is that many event libraries (such as the	520	The reason this function exists is that many event libraries (such as the
513	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form	521	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form
514	of thread-safety). This means you must not block within event callbacks,	522	of thread-safety). This means you must not block within event callbacks,
515	otherwise you might suffer from crashes or worse.	523	otherwise you might suffer from crashes or worse.
516		524
517	This function allows your callbacks to block by executing them in another	525	This function allows your callbacks to block by executing them in another
…		…
528		536
529	# we create a special coro because we want to cede,	537	# we create a special coro because we want to cede,
530	# to reduce pressure on the coro pool (because most callbacks	538	# to reduce pressure on the coro pool (because most callbacks
531	# return immediately and can be reused) and because we cannot cede	539	# return immediately and can be reused) and because we cannot cede
532	# inside an event callback.	540	# inside an event callback.
533	our $unblock_scheduler = async {	541	our $unblock_scheduler = new Coro sub {
534	while () {	542	while () {
535	while (my $cb = pop @unblock_queue) {	543	while (my $cb = pop @unblock_queue) {
536	# this is an inlined copy of async_pool	544	# this is an inlined copy of async_pool
537	my $coro = (pop @pool or new Coro \&pool_handler);	545	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
538		546
539	$coro->{_invoke} = $cb;	547	$coro->{_invoke} = $cb;
540	$coro->ready;	548	$coro->ready;
541	cede; # for short-lived callbacks, this reduces pressure on the coro pool	549	cede; # for short-lived callbacks, this reduces pressure on the coro pool
542	}	550	}
543	schedule; # sleep well	551	schedule; # sleep well
544	}	552	}
545	};	553	};
		554	$unblock_scheduler->desc ("[unblock_sub scheduler]");
546		555
547	sub unblock_sub(&) {	556	sub unblock_sub(&) {
548	my $cb = shift;	557	my $cb = shift;
549		558
550	sub {	559	sub {
…		…
563		572
564	- you must make very sure that no coro is still active on global	573	- you must make very sure that no coro is still active on global
565	destruction. very bad things might happen otherwise (usually segfaults).	574	destruction. very bad things might happen otherwise (usually segfaults).
566		575
567	- this module is not thread-safe. You should only ever use this module	576	- this module is not thread-safe. You should only ever use this module
568	from the same thread (this requirement might be losened in the future	577	from the same thread (this requirement might be loosened in the future
569	to allow per-thread schedulers, but Coro::State does not yet allow	578	to allow per-thread schedulers, but Coro::State does not yet allow
570	this).	579	this).
571		580
572	=head1 SEE ALSO	581	=head1 SEE ALSO
573		582
		583	Lower level Configuration, Coroutine Environment: L<Coro::State>.
		584
		585	Debugging: L<Coro::Debug>.
		586
574	Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.	587	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
575		588
576	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.	589	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
577		590
578	Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.	591	Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>.
579		592
		593	Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>.
		594
580	Embedding: L<Coro:MakeMaker>	595	Embedding: L<Coro::MakeMaker>.
581		596
582	=head1 AUTHOR	597	=head1 AUTHOR
583		598
584	Marc Lehmann <schmorp@schmorp.de>	599	Marc Lehmann <schmorp@schmorp.de>
585	http://home.schmorp.de/	600	http://home.schmorp.de/

Diff Legend

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

Comparing cvsroot/Coro/Coro.pm (file contents): Revision 1.121 by root, Fri Apr 13 12:56:55 2007 UTC vs. Revision 1.179 by root, Sat Apr 19 19:06:02 2008 UTC

Diff Legend

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.121 by root, Fri Apr 13 12:56:55 2007 UTC vs.
Revision 1.179 by root, Sat Apr 19 19:06:02 2008 UTC