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

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.9 by root, Sun Jul 15 02:35:52 2001 UTC vs. Revision 1.121 by root, Fri Apr 13 12:56:55 2007 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.9 by root, Sun Jul 15 02:35:52 2001 UTC vs.
Revision 1.121 by root, Fri Apr 13 12:56:55 2007 UTC