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

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

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.13 by root, Tue Jul 17 00:24:14 2001 UTC vs. Revision 1.107 by root, Fri Jan 5 18:25:51 2007 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.13 by root, Tue Jul 17 00:24:14 2001 UTC vs.
Revision 1.107 by root, Fri Jan 5 18:25:51 2007 UTC