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

Comparing Coro/Coro.pm (file contents):
Revision 1.92 by root, Fri Dec 1 03:47:55 2006 UTC vs.
Revision 1.135 by root, Sat Sep 22 22:39:15 2007 UTC

…		…
18		18
19	cede;	19	cede;
20		20
21	=head1 DESCRIPTION	21	=head1 DESCRIPTION
22		22
23	This module collection manages coroutines. Coroutines are similar to	23	This module collection manages coroutines. Coroutines are similar
24	threads but don't run in parallel.	24	to threads but don't run in parallel at the same time even on SMP
		25	machines. The specific flavor of coroutine used in this module also
		26	guarantees you that it will not switch between coroutines unless
		27	necessary, at easily-identified points in your program, so locking and
		28	parallel access are rarely an issue, making coroutine programming much
		29	safer than threads programming.
25		30
		31	(Perl, however, does not natively support real threads but instead does a
		32	very slow and memory-intensive emulation of processes using threads. This
		33	is a performance win on Windows machines, and a loss everywhere else).
		34
26	In this module, coroutines are defined as "callchain + lexical variables	35	In this module, coroutines are defined as "callchain + lexical variables +
27	+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own	36	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
28	callchain, it's own set of lexicals and it's own set of perl's most	37	its own set of lexicals and its own set of perls most important global
29	important global variables.	38	variables.
30		39
31	=cut	40	=cut
32		41
33	package Coro;	42	package Coro;
34		43
…		…
41		50
42	our $idle; # idle handler	51	our $idle; # idle handler
43	our $main; # main coroutine	52	our $main; # main coroutine
44	our $current; # current coroutine	53	our $current; # current coroutine
45		54
46	our $VERSION = '3.0';	55	our $VERSION = '3.7';
47		56
48	our @EXPORT = qw(async cede schedule terminate current unblock_sub);	57	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
49	our %EXPORT_TAGS = (	58	our %EXPORT_TAGS = (
50	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)],
51	);	60	);
52	our @EXPORT_OK = @{$EXPORT_TAGS{prio}};	61	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
53		62
54	{	63	{
55	my @async;	64	my @async;
56	my $init;	65	my $init;
57		66
58	# this way of handling attributes simply is NOT scalable ;()	67	# this way of handling attributes simply is NOT scalable ;()
59	sub import {	68	sub import {
60	no strict 'refs';	69	no strict 'refs';
61		70
62	Coro->export_to_level(1, @_);	71	Coro->export_to_level (1, @_);
63		72
64	my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};	73	my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
65	*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {	74	*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
66	my ($package, $ref) = (shift, shift);	75	my ($package, $ref) = (shift, shift);
67	my @attrs;	76	my @attrs;
…		…
99		108
100	The current coroutine (the last coroutine switched to). The initial value	109	The current coroutine (the last coroutine switched to). The initial value
101	is C<$main> (of course).	110	is C<$main> (of course).
102		111
103	This variable is B<strictly> I<read-only>. It is provided for performance	112	This variable is B<strictly> I<read-only>. It is provided for performance
104	reasons. If performance is not essentiel you are encouraged to use the	113	reasons. If performance is not essential you are encouraged to use the
105	C<Coro::current> function instead.	114	C<Coro::current> function instead.
106		115
107	=cut	116	=cut
108		117
		118	$main->{desc} = "[main::]";
		119
109	# maybe some other module used Coro::Specific before...	120	# maybe some other module used Coro::Specific before...
110	if ($current) {
111	$main->{specific} = $current->{specific};	121	$main->{specific} = $current->{specific}
112	}	122	if $current;
113		123
114	$current = $main;	124	_set_current $main;
115		125
116	sub current() { $current }	126	sub current() { $current }
117		127
118	=item $idle	128	=item $idle
119		129
…		…
129	handlers), then it must be prepared to be called recursively.	139	handlers), then it must be prepared to be called recursively.
130		140
131	=cut	141	=cut
132		142
133	$idle = sub {	143	$idle = sub {
134	print STDERR "FATAL: deadlock detected\n";	144	require Carp;
135	exit (51);	145	Carp::croak ("FATAL: deadlock detected");
136	};	146	};
		147
		148	sub _cancel {
		149	my ($self) = @_;
		150
		151	# free coroutine data and mark as destructed
		152	$self->_destroy
		153	or return;
		154
		155	# call all destruction callbacks
		156	$_->(@{$self->{status}})
		157	for @{(delete $self->{destroy_cb}) \|\| []};
		158	}
137		159
138	# this coroutine is necessary because a coroutine	160	# this coroutine is necessary because a coroutine
139	# cannot destroy itself.	161	# cannot destroy itself.
140	my @destroy;	162	my @destroy;
		163	my $manager;
		164
141	my $manager; $manager = new Coro sub {	165	$manager = new Coro sub {
142	while () {	166	while () {
143	# by overwriting the state object with the manager we destroy it	167	(shift @destroy)->_cancel
144	# while still being able to schedule this coroutine (in case it has
145	# been readied multiple times. this is harmless since the manager
146	# can be called as many times as neccessary and will always
147	# remove itself from the runqueue
148	while (@destroy) {	168	while @destroy;
149	my $coro = pop @destroy;
150	$coro->{status} \|\|= [];
151	$_->ready for @{delete $coro->{join} \|\| []};
152		169
153	# the next line destroys the coro state, but keeps the
154	# coroutine itself intact (we basically make it a zombie
155	# coroutine that always runs the manager thread, so it's possible
156	# to transfer() to this coroutine).
157	$coro->_clone_state_from ($manager);
158	}
159	&schedule;	170	&schedule;
160	}	171	}
161	};	172	};
		173	$manager->desc ("[coro manager]");
		174	$manager->prio (PRIO_MAX);
162		175
163	# static methods. not really.	176	# static methods. not really.
164		177
165	=back	178	=back
166		179
…		…
174		187
175	Create a new asynchronous coroutine and return it's coroutine object	188	Create a new asynchronous coroutine and return it's coroutine object
176	(usually unused). When the sub returns the new coroutine is automatically	189	(usually unused). When the sub returns the new coroutine is automatically
177	terminated.	190	terminated.
178		191
179	Calling C<exit> in a coroutine will not work correctly, so do not do that.	192	Calling C<exit> in a coroutine will do the same as calling exit outside
180		193	the coroutine. Likewise, when the coroutine dies, the program will exit,
181	When the coroutine dies, the program will exit, just as in the main	194	just as it would in the main program.
182	program.
183		195
184	# create a new coroutine that just prints its arguments	196	# create a new coroutine that just prints its arguments
185	async {	197	async {
186	print "@_\n";	198	print "@_\n";
187	} 1,2,3,4;	199	} 1,2,3,4;
188		200
189	=cut	201	=cut
190		202
191	sub async(&@) {	203	sub async(&@) {
192	my $pid = new Coro @_;	204	my $coro = new Coro @_;
193	$pid->ready;	205	$coro->ready;
194	$pid	206	$coro
		207	}
		208
		209	=item async_pool { ... } [@args...]
		210
		211	Similar to C<async>, but uses a coroutine pool, so you should not call
		212	terminate or join (although you are allowed to), and you get a coroutine
		213	that might have executed other code already (which can be good or bad :).
		214
		215	Also, the block is executed in an C<eval> context and a warning will be
		216	issued in case of an exception instead of terminating the program, as
		217	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
		218	will not work in the expected way, unless you call terminate or cancel,
		219	which somehow defeats the purpose of pooling.
		220
		221	The priority will be reset to C<0> after each job, otherwise the coroutine
		222	will be re-used "as-is".
		223
		224	The pool size is limited to 8 idle coroutines (this can be adjusted by
		225	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
		226	required.
		227
		228	If you are concerned about pooled coroutines growing a lot because a
		229	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
		230	{ terminate }> once per second or so to slowly replenish the pool. In
		231	addition to that, when the stacks used by a handler grows larger than 16kb
		232	(adjustable with $Coro::POOL_RSS) it will also exit.
		233
		234	=cut
		235
		236	our $POOL_SIZE = 8;
		237	our $POOL_RSS = 16 * 1024;
		238	our @async_pool;
		239
		240	sub pool_handler {
		241	my $cb;
		242
		243	while () {
		244	eval {
		245	while () {
		246	# &{&_pool_1 or &terminate}; # crashes, would be ~5% faster
		247	$cb = &_pool_1
		248	or &terminate;
		249	&$cb;
		250	undef $cb;
		251	&terminate if &_pool_2;
		252	&schedule;
		253	}
		254	};
		255
		256	warn $@ if $@;
		257	}
		258	}
		259
		260	sub async_pool(&@) {
		261	# this is also inlined into the unlock_scheduler
		262	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
		263
		264	$coro->{_invoke} = [@_];
		265	$coro->ready;
		266
		267	$coro
195	}	268	}
196		269
197	=item schedule	270	=item schedule
198		271
199	Calls the scheduler. Please note that the current coroutine will not be put	272	Calls the scheduler. Please note that the current coroutine will not be put
…		…
212	# wake up sleeping coroutine	285	# wake up sleeping coroutine
213	$current->ready;	286	$current->ready;
214	undef $current;	287	undef $current;
215	};	288	};
216		289
217	# call schedule until event occured.	290	# call schedule until event occurred.
218	# in case we are woken up for other reasons	291	# in case we are woken up for other reasons
219	# (current still defined), loop.	292	# (current still defined), loop.
220	Coro::schedule while $current;	293	Coro::schedule while $current;
221	}	294	}
222		295
223	=item cede	296	=item cede
224		297
225	"Cede" to other coroutines. This function puts the current coroutine into the	298	"Cede" to other coroutines. This function puts the current coroutine into the
226	ready queue and calls C<schedule>, which has the effect of giving up the	299	ready queue and calls C<schedule>, which has the effect of giving up the
227	current "timeslice" to other coroutines of the same or higher priority.	300	current "timeslice" to other coroutines of the same or higher priority.
		301
		302	Returns true if at least one coroutine switch has happened.
		303
		304	=item Coro::cede_notself
		305
		306	Works like cede, but is not exported by default and will cede to any
		307	coroutine, regardless of priority, once.
		308
		309	Returns true if at least one coroutine switch has happened.
228		310
229	=item terminate [arg...]	311	=item terminate [arg...]
230		312
231	Terminates the current coroutine with the given status values (see L<cancel>).	313	Terminates the current coroutine with the given status values (see L<cancel>).
232		314
…		…
251	Create a new coroutine and return it. When the sub returns the coroutine	333	Create a new coroutine and return it. When the sub returns the coroutine
252	automatically terminates as if C<terminate> with the returned values were	334	automatically terminates as if C<terminate> with the returned values were
253	called. To make the coroutine run you must first put it into the ready queue	335	called. To make the coroutine run you must first put it into the ready queue
254	by calling the ready method.	336	by calling the ready method.
255		337
256	Calling C<exit> in a coroutine will not work correctly, so do not do that.	338	See C<async> for additional discussion.
257		339
258	=cut	340	=cut
259		341
260	sub _new_coro {	342	sub _run_coro {
261	terminate &{+shift};	343	terminate &{+shift};
262	}	344	}
263		345
264	sub new {	346	sub new {
265	my $class = shift;	347	my $class = shift;
266		348
267	$class->SUPER::new (\&_new_coro, @_)	349	$class->SUPER::new (\&_run_coro, @_)
268	}	350	}
269		351
270	=item $success = $coroutine->ready	352	=item $success = $coroutine->ready
271		353
272	Put the given coroutine into the ready queue (according to it's priority)	354	Put the given coroutine into the ready queue (according to it's priority)
…		…
278	Return wether the coroutine is currently the ready queue or not,	360	Return wether the coroutine is currently the ready queue or not,
279		361
280	=item $coroutine->cancel (arg...)	362	=item $coroutine->cancel (arg...)
281		363
282	Terminates the given coroutine and makes it return the given arguments as	364	Terminates the given coroutine and makes it return the given arguments as
283	status (default: the empty list).	365	status (default: the empty list). Never returns if the coroutine is the
		366	current coroutine.
284		367
285	=cut	368	=cut
286		369
287	sub cancel {	370	sub cancel {
288	my $self = shift;	371	my $self = shift;
289	$self->{status} = [@_];	372	$self->{status} = [@_];
		373
		374	if ($current == $self) {
290	push @destroy, $self;	375	push @destroy, $self;
291	$manager->ready;	376	$manager->ready;
292	&schedule if $current == $self;	377	&schedule while 1;
		378	} else {
		379	$self->_cancel;
		380	}
293	}	381	}
294		382
295	=item $coroutine->join	383	=item $coroutine->join
296		384
297	Wait until the coroutine terminates and return any values given to the	385	Wait until the coroutine terminates and return any values given to the
…		…
300		388
301	=cut	389	=cut
302		390
303	sub join {	391	sub join {
304	my $self = shift;	392	my $self = shift;
		393
305	unless ($self->{status}) {	394	unless ($self->{status}) {
306	push @{$self->{join}}, $current;	395	my $current = $current;
307	&schedule;	396
		397	push @{$self->{destroy_cb}}, sub {
		398	$current->ready;
		399	undef $current;
		400	};
		401
		402	&schedule while $current;
308	}	403	}
		404
309	wantarray ? @{$self->{status}} : $self->{status}[0];	405	wantarray ? @{$self->{status}} : $self->{status}[0];
		406	}
		407
		408	=item $coroutine->on_destroy (\&cb)
		409
		410	Registers a callback that is called when this coroutine gets destroyed,
		411	but before it is joined. The callback gets passed the terminate arguments,
		412	if any.
		413
		414	=cut
		415
		416	sub on_destroy {
		417	my ($self, $cb) = @_;
		418
		419	push @{ $self->{destroy_cb} }, $cb;
310	}	420	}
311		421
312	=item $oldprio = $coroutine->prio ($newprio)	422	=item $oldprio = $coroutine->prio ($newprio)
313		423
314	Sets (or gets, if the argument is missing) the priority of the	424	Sets (or gets, if the argument is missing) the priority of the
…		…
349	$old;	459	$old;
350	}	460	}
351		461
352	=back	462	=back
353		463
354	=head2 UTILITY FUNCTIONS	464	=head2 GLOBAL FUNCTIONS
355		465
356	=over 4	466	=over 4
		467
		468	=item Coro::nready
		469
		470	Returns the number of coroutines that are currently in the ready state,
		471	i.e. that can be switched to. The value C<0> means that the only runnable
		472	coroutine is the currently running one, so C<cede> would have no effect,
		473	and C<schedule> would cause a deadlock unless there is an idle handler
		474	that wakes up some coroutines.
		475
		476	=item my $guard = Coro::guard { ... }
		477
		478	This creates and returns a guard object. Nothing happens until the object
		479	gets destroyed, in which case the codeblock given as argument will be
		480	executed. This is useful to free locks or other resources in case of a
		481	runtime error or when the coroutine gets canceled, as in both cases the
		482	guard block will be executed. The guard object supports only one method,
		483	C<< ->cancel >>, which will keep the codeblock from being executed.
		484
		485	Example: set some flag and clear it again when the coroutine gets canceled
		486	or the function returns:
		487
		488	sub do_something {
		489	my $guard = Coro::guard { $busy = 0 };
		490	$busy = 1;
		491
		492	# do something that requires $busy to be true
		493	}
		494
		495	=cut
		496
		497	sub guard(&) {
		498	bless \(my $cb = $_[0]), "Coro::guard"
		499	}
		500
		501	sub Coro::guard::cancel {
		502	${$_[0]} = sub { };
		503	}
		504
		505	sub Coro::guard::DESTROY {
		506	${$_[0]}->();
		507	}
		508
357		509
358	=item unblock_sub { ... }	510	=item unblock_sub { ... }
359		511
360	This utility function takes a BLOCK or code reference and "unblocks" it,	512	This utility function takes a BLOCK or code reference and "unblocks" it,
361	returning the new coderef. This means that the new coderef will return	513	returning the new coderef. This means that the new coderef will return
362	immediately without blocking, returning nothing, while the original code	514	immediately without blocking, returning nothing, while the original code
363	ref will be called (with parameters) from within its own coroutine.	515	ref will be called (with parameters) from within its own coroutine.
364		516
365	The reason this fucntion exists is that many event libraries (such as the	517	The reason this function exists is that many event libraries (such as the
366	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form	518	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form
367	of thread-safety). This means you must not block within event callbacks,	519	of thread-safety). This means you must not block within event callbacks,
368	otherwise you might suffer from crashes or worse.	520	otherwise you might suffer from crashes or worse.
369		521
370	This function allows your callbacks to block by executing them in another	522	This function allows your callbacks to block by executing them in another
…		…
375	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when	527	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
376	creating event callbacks that want to block.	528	creating event callbacks that want to block.
377		529
378	=cut	530	=cut
379		531
380	our @unblock_pool;
381	our @unblock_queue;	532	our @unblock_queue;
382	our $UNBLOCK_POOL_SIZE = 2;
383		533
384	sub unblock_handler_ {	534	# we create a special coro because we want to cede,
385	while () {	535	# to reduce pressure on the coro pool (because most callbacks
386	my ($cb, @arg) = @{ delete $Coro::current->{arg} };	536	# return immediately and can be reused) and because we cannot cede
387	$cb->(@arg);	537	# inside an event callback.
388
389	last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
390	push @unblock_pool, $Coro::current;
391	schedule;
392	}
393	}
394
395	our $unblock_scheduler = async {	538	our $unblock_scheduler = new Coro sub {
396	while () {	539	while () {
397	while (my $cb = pop @unblock_queue) {	540	while (my $cb = pop @unblock_queue) {
398	my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);	541	# this is an inlined copy of async_pool
399	$handler->{arg} = $cb;	542	my $coro = (pop @async_pool) \|\| new Coro \&pool_handler;
		543
		544	$coro->{_invoke} = $cb;
400	$handler->ready;	545	$coro->ready;
401	cede;	546	cede; # for short-lived callbacks, this reduces pressure on the coro pool
402	}	547	}
403		548	schedule; # sleep well
404	schedule;
405	}	549	}
406	};	550	};
		551	$unblock_scheduler->desc ("[unblock_sub scheduler]");
407		552
408	sub unblock_sub(&) {	553	sub unblock_sub(&) {
409	my $cb = shift;	554	my $cb = shift;
410		555
411	sub {	556	sub {
412	push @unblock_queue, [$cb, @_];	557	unshift @unblock_queue, [$cb, @_];
413	$unblock_scheduler->ready;	558	$unblock_scheduler->ready;
414	}	559	}
415	}	560	}
416		561
417	=back	562	=back
…		…
424		569
425	- you must make very sure that no coro is still active on global	570	- you must make very sure that no coro is still active on global
426	destruction. very bad things might happen otherwise (usually segfaults).	571	destruction. very bad things might happen otherwise (usually segfaults).
427		572
428	- this module is not thread-safe. You should only ever use this module	573	- this module is not thread-safe. You should only ever use this module
429	from the same thread (this requirement might be losened in the future	574	from the same thread (this requirement might be loosened in the future
430	to allow per-thread schedulers, but Coro::State does not yet allow	575	to allow per-thread schedulers, but Coro::State does not yet allow
431	this).	576	this).
432		577
433	=head1 SEE ALSO	578	=head1 SEE ALSO
434		579

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.92 by root, Fri Dec 1 03:47:55 2006 UTC vs. Revision 1.135 by root, Sat Sep 22 22:39:15 2007 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.92 by root, Fri Dec 1 03:47:55 2006 UTC vs.
Revision 1.135 by root, Sat Sep 22 22:39:15 2007 UTC