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

Comparing Coro/Coro.pm (file contents):
Revision 1.114 by root, Wed Jan 24 16:22:08 2007 UTC vs.
Revision 1.231 by root, Thu Nov 20 09:37:21 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	use Coro::Semaphore;
19	cede;	22	my $lock = new Coro::Semaphore;
		23	my $locked;
		24
		25	$lock->down;
		26	$locked = 1;
		27	$lock->up;
20		28
21	=head1 DESCRIPTION	29	=head1 DESCRIPTION
22		30
23	This module collection manages coroutines. Coroutines are similar	31	This module collection manages coroutines. Coroutines are similar to
24	to threads but don't run in parallel at the same time even on SMP	32	threads but don't (in general) run in parallel at the same time even
25	machines. The specific flavor of coroutine use din this module also	33	on SMP machines. The specific flavor of coroutine used in this module
26	guarentees you that it will not switch between coroutines unless	34	also guarantees you that it will not switch between coroutines unless
27	necessary, at easily-identified points in your program, so locking and	35	necessary, at easily-identified points in your program, so locking and
28	parallel access are rarely an issue, making coroutine programming much	36	parallel access are rarely an issue, making coroutine programming much
29	safer than threads programming.	37	safer and easier than threads programming.
30		38
31	(Perl, however, does not natively support real threads but instead does a	39	Unlike a normal perl program, however, coroutines allow you to have
32	very slow and memory-intensive emulation of processes using threads. This	40	multiple running interpreters that share data, which is especially useful
33	is a performance win on Windows machines, and a loss everywhere else).	41	to code pseudo-parallel processes and for event-based programming, such as
		42	multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to
		43	learn more.
		44
		45	Coroutines are also useful because Perl has no support for threads (the so
		46	called "threads" that perl offers are nothing more than the (bad) process
		47	emulation coming from the Windows platform: On standard operating systems
		48	they serve no purpose whatsoever, except by making your programs slow and
		49	making them use a lot of memory. Best disable them when building perl, or
		50	aks your software vendor/distributor to do it for you).
34		51
35	In this module, coroutines are defined as "callchain + lexical variables +	52	In this module, coroutines are defined as "callchain + lexical variables +
36	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,	53	@_ + $_ + $@ + $/ + 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	54	its own set of lexicals and its own set of perls most important global
38	variables.	55	variables (see L<Coro::State> for more configuration).
39		56
40	=cut	57	=cut
41		58
42	package Coro;	59	package Coro;
43		60
44	use strict;	61	use strict qw(vars subs);
45	no warnings "uninitialized";	62	no warnings "uninitialized";
46		63
47	use Coro::State;	64	use Coro::State;
48		65
49	use base qw(Coro::State Exporter);	66	use base qw(Coro::State Exporter);
50		67
51	our $idle; # idle handler	68	our $idle; # idle handler
52	our $main; # main coroutine	69	our $main; # main coroutine
53	our $current; # current coroutine	70	our $current; # current coroutine
54		71
55	our $VERSION = '3.5';	72	our $VERSION = "5.0";
56		73
57	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);	74	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58	our %EXPORT_TAGS = (	75	our %EXPORT_TAGS = (
59	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	76	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60	);	77	);
61	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));	78	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
62		79
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	80	=over 4
98		81
99	=item $main	82	=item $Coro::main
100		83
101	This coroutine represents the main program.	84	This variable stores the coroutine object that represents the main
		85	program. While you cna C<ready> it and do most other things you can do to
		86	coroutines, it is mainly useful to compare again C<$Coro::current>, to see
		87	whether you are running in the main program or not.
102		88
103	=cut	89	=cut
104		90
105	$main = new Coro;	91	# $main is now being initialised by Coro::State
106		92
107	=item $current (or as function: current)	93	=item $Coro::current
108		94
109	The current coroutine (the last coroutine switched to). The initial value	95	The coroutine object representing the current coroutine (the last
		96	coroutine that the Coro scheduler switched to). The initial value is
110	is C<$main> (of course).	97	C<$Coro::main> (of course).
111		98
112	This variable is B<strictly> I<read-only>. It is provided for performance	99	This variable is B<strictly> I<read-only>. You can take copies of the
113	reasons. If performance is not essentiel you are encouraged to use the	100	value stored in it and use it as any other coroutine object, but you must
114	C<Coro::current> function instead.	101	not otherwise modify the variable itself.
115		102
116	=cut	103	=cut
117		104
118	# maybe some other module used Coro::Specific before...
119	$main->{specific} = $current->{specific}
120	if $current;
121
122	_set_current $main;
123
124	sub current() { $current }	105	sub current() { $current } # [DEPRECATED]
125		106
126	=item $idle	107	=item $Coro::idle
127		108
128	A callback that is called whenever the scheduler finds no ready coroutines	109	This variable is mainly useful to integrate Coro into event loops. It is
129	to run. The default implementation prints "FATAL: deadlock detected" and	110	usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
130	exits, because the program has no other way to continue.	111	pretty low-level functionality.
		112
		113	This variable stores a callback that is called whenever the scheduler
		114	finds no ready coroutines to run. The default implementation prints
		115	"FATAL: deadlock detected" and exits, because the program has no other way
		116	to continue.
131		117
132	This hook is overwritten by modules such as C<Coro::Timer> and	118	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	119	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
134	coroutine so the scheduler can run it.	120	coroutine so the scheduler can run it.
135		121
		122	Note that the callback I<must not>, under any circumstances, block
		123	the current coroutine. Normally, this is achieved by having an "idle
		124	coroutine" that calls the event loop and then blocks again, and then
		125	readying that coroutine in the idle handler.
		126
		127	See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
		128	technique.
		129
136	Please note that if your callback recursively invokes perl (e.g. for event	130	Please note that if your callback recursively invokes perl (e.g. for event
137	handlers), then it must be prepared to be called recursively.	131	handlers), then it must be prepared to be called recursively itself.
138		132
139	=cut	133	=cut
140		134
141	$idle = sub {	135	$idle = sub {
142	require Carp;	136	require Carp;
143	Carp::croak ("FATAL: deadlock detected");	137	Carp::croak ("FATAL: deadlock detected");
144	};	138	};
145		139
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	}
157
158	# this coroutine is necessary because a coroutine	140	# this coroutine is necessary because a coroutine
159	# cannot destroy itself.	141	# cannot destroy itself.
160	my @destroy;	142	our @destroy;
161	my $manager;	143	our $manager;
162		144
163	$manager = new Coro sub {	145	$manager = new Coro sub {
164	while () {	146	while () {
165	(shift @destroy)->_cancel	147	Coro::_cancel shift @destroy
166	while @destroy;	148	while @destroy;
167		149
168	&schedule;	150	&schedule;
169	}	151	}
170	};	152	};
171		153	$manager->{desc} = "[coro manager]";
172	$manager->prio (PRIO_MAX);	154	$manager->prio (PRIO_MAX);
173		155
174	# static methods. not really.
175
176	=back	156	=back
177		157
178	=head2 STATIC METHODS	158	=head2 SIMPLE COROUTINE CREATION
179
180	Static methods are actually functions that operate on the current coroutine only.
181		159
182	=over 4	160	=over 4
183		161
184	=item async { ... } [@args...]	162	=item async { ... } [@args...]
185		163
186	Create a new asynchronous coroutine and return it's coroutine object	164	Create a new coroutine and return it's coroutine object (usually
187	(usually unused). When the sub returns the new coroutine is automatically	165	unused). The coroutine will be put into the ready queue, so
		166	it will start running automatically on the next scheduler run.
		167
		168	The first argument is a codeblock/closure that should be executed in the
		169	coroutine. When it returns argument returns the coroutine is automatically
188	terminated.	170	terminated.
189		171
190	Calling C<exit> in a coroutine will not work correctly, so do not do that.	172	The remaining arguments are passed as arguments to the closure.
191		173
192	When the coroutine dies, the program will exit, just as in the main	174	See the C<Coro::State::new> constructor for info about the coroutine
193	program.	175	environment in which coroutines are executed.
194		176
		177	Calling C<exit> in a coroutine will do the same as calling exit outside
		178	the coroutine. Likewise, when the coroutine dies, the program will exit,
		179	just as it would in the main program.
		180
		181	If you do not want that, you can provide a default C<die> handler, or
		182	simply avoid dieing (by use of C<eval>).
		183
195	# create a new coroutine that just prints its arguments	184	Example: Create a new coroutine that just prints its arguments.
		185
196	async {	186	async {
197	print "@_\n";	187	print "@_\n";
198	} 1,2,3,4;	188	} 1,2,3,4;
199		189
200	=cut	190	=cut
…		…
206	}	196	}
207		197
208	=item async_pool { ... } [@args...]	198	=item async_pool { ... } [@args...]
209		199
210	Similar to C<async>, but uses a coroutine pool, so you should not call	200	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	201	terminate or join on it (although you are allowed to), and you get a
212	that might have executed other code already (which can be good or bad :).	202	coroutine that might have executed other code already (which can be good
		203	or bad :).
213		204
		205	On the plus side, this function is about twice as fast as creating (and
		206	destroying) a completely new coroutine, so if you need a lot of generic
		207	coroutines in quick successsion, use C<async_pool>, not C<async>.
		208
214	Also, the block is executed in an C<eval> context and a warning will be	209	The code 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	210	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>	211	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,	212	will not work in the expected way, unless you call terminate or cancel,
218	which somehow defeats the purpose of pooling.	213	which somehow defeats the purpose of pooling (but is fine in the
		214	exceptional case).
219		215
220	The priority will be reset to C<0> after each job, otherwise the coroutine	216	The priority will be reset to C<0> after each run, tracing will be
221	will be re-used "as-is".	217	disabled, the description will be reset and the default output filehandle
		218	gets restored, so you can change all these. Otherwise the coroutine will
		219	be re-used "as-is": most notably if you change other per-coroutine global
		220	stuff such as C<$/> you I<must needs> revert that change, which is most
		221	simply done by using local as in: C<< local $/ >>.
222		222
223	The pool size is limited to 8 idle coroutines (this can be adjusted by	223	The idle pool size is limited to C<8> idle coroutines (this can be
224	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as	224	adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
225	required.	225	coros as required.
226		226
227	If you are concerned about pooled coroutines growing a lot because a	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 {	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.	229	{ terminate }> once per second or so to slowly replenish the pool. In
		230	addition to that, when the stacks used by a handler grows larger than 16kb
		231	(adjustable via $Coro::POOL_RSS) it will also be destroyed.
230		232
231	=cut	233	=cut
232		234
233	our $POOL_SIZE = 8;	235	our $POOL_SIZE = 8;
		236	our $POOL_RSS = 16 * 1024;
234	our @pool;	237	our @async_pool;
235		238
236	sub pool_handler {	239	sub pool_handler {
237	while () {	240	while () {
238	eval {	241	eval {
239	my ($cb, @arg) = @{ delete $current->{_invoke} or return };	242	&{&_pool_handler} while 1;
240	$cb->(@arg);
241	};	243	};
		244
242	warn $@ if $@;	245	warn $@ if $@;
243
244	last if @pool >= $POOL_SIZE;
245	push @pool, $current;
246
247	$current->prio (0);
248	schedule;
249	}	246	}
250	}	247	}
251		248
252	sub async_pool(&@) {	249	=back
253	# this is also inlined into the unlock_scheduler
254	my $coro = (pop @pool or new Coro \&pool_handler);
255		250
256	$coro->{_invoke} = [@_];	251	=head2 STATIC METHODS
257	$coro->ready;
258		252
259	$coro	253	Static methods are actually functions that operate on the current coroutine.
260	}	254
		255	=over 4
261		256
262	=item schedule	257	=item schedule
263		258
264	Calls the scheduler. Please note that the current coroutine will not be put	259	Calls the scheduler. The scheduler will find the next coroutine that is
		260	to be run from the ready queue and switches to it. The next coroutine
		261	to be run is simply the one with the highest priority that is longest
		262	in its ready queue. If there is no coroutine ready, it will clal the
		263	C<$Coro::idle> hook.
		264
		265	Please note that the current coroutine will I<not> be put into the ready
265	into the ready queue, so calling this function usually means you will	266	queue, so calling this function usually means you will never be called
266	never be called again unless something else (e.g. an event handler) calls	267	again unless something else (e.g. an event handler) calls C<< ->ready >>,
267	ready.	268	thus waking you up.
268		269
269	The canonical way to wait on external events is this:	270	This makes C<schedule> I<the> generic method to use to block the current
		271	coroutine and wait for events: first you remember the current coroutine in
		272	a variable, then arrange for some callback of yours to call C<< ->ready
		273	>> on that once some event happens, and last you call C<schedule> to put
		274	yourself to sleep. Note that a lot of things can wake your coroutine up,
		275	so you need to check whether the event indeed happened, e.g. by storing the
		276	status in a variable.
270		277
		278	See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
		279
		280	=item cede
		281
		282	"Cede" to other coroutines. This function puts the current coroutine into
		283	the ready queue and calls C<schedule>, which has the effect of giving
		284	up the current "timeslice" to other coroutines of the same or higher
		285	priority. Once your coroutine gets its turn again it will automatically be
		286	resumed.
		287
		288	This function is often called C<yield> in other languages.
		289
		290	=item Coro::cede_notself
		291
		292	Works like cede, but is not exported by default and will cede to I<any>
		293	coroutine, regardless of priority. This is useful sometimes to ensure
		294	progress is made.
		295
		296	=item terminate [arg...]
		297
		298	Terminates the current coroutine with the given status values (see L<cancel>).
		299
		300	=item killall
		301
		302	Kills/terminates/cancels all coroutines except the currently running
		303	one. This is useful after a fork, either in the child or the parent, as
		304	usually only one of them should inherit the running coroutines.
		305
		306	Note that while this will try to free some of the main programs resources,
		307	you cannot free all of them, so if a coroutine that is not the main
		308	program calls this function, there will be some one-time resource leak.
		309
		310	=cut
		311
		312	sub killall {
		313	for (Coro::State::list) {
		314	$_->cancel
		315	if $_ != $current && UNIVERSAL::isa $_, "Coro";
271	{	316	}
272	# remember current coroutine	317	}
		318
		319	=back
		320
		321	=head2 COROUTINE METHODS
		322
		323	These are the methods you can call on coroutine objects (or to create
		324	them).
		325
		326	=over 4
		327
		328	=item new Coro \&sub [, @args...]
		329
		330	Create a new coroutine and return it. When the sub returns, the coroutine
		331	automatically terminates as if C<terminate> with the returned values were
		332	called. To make the coroutine run you must first put it into the ready
		333	queue by calling the ready method.
		334
		335	See C<async> and C<Coro::State::new> for additional info about the
		336	coroutine environment.
		337
		338	=cut
		339
		340	sub _terminate {
		341	terminate &{+shift};
		342	}
		343
		344	=item $success = $coroutine->ready
		345
		346	Put the given coroutine into the end of its ready queue (there is one
		347	queue for each priority) and return true. If the coroutine is already in
		348	the ready queue, do nothing and return false.
		349
		350	This ensures that the scheduler will resume this coroutine automatically
		351	once all the coroutines of higher priority and all coroutines of the same
		352	priority that were put into the ready queue earlier have been resumed.
		353
		354	=item $is_ready = $coroutine->is_ready
		355
		356	Return whether the coroutine is currently the ready queue or not,
		357
		358	=item $coroutine->cancel (arg...)
		359
		360	Terminates the given coroutine and makes it return the given arguments as
		361	status (default: the empty list). Never returns if the coroutine is the
		362	current coroutine.
		363
		364	=cut
		365
		366	sub cancel {
		367	my $self = shift;
		368
		369	if ($current == $self) {
		370	terminate @_;
		371	} else {
		372	$self->{_status} = [@_];
		373	$self->_cancel;
		374	}
		375	}
		376
		377	=item $coroutine->schedule_to
		378
		379	Puts the current coroutine to sleep (like C<Coro::schedule>), but instead
		380	of continuing with the next coro from the ready queue, always switch to
		381	the given coroutine object (regardless of priority etc.). The readyness
		382	state of that coroutine isn't changed.
		383
		384	This is an advanced method for special cases - I'd love to hear about any
		385	uses for this one.
		386
		387	=item $coroutine->cede_to
		388
		389	Like C<schedule_to>, but puts the current coroutine into the ready
		390	queue. This has the effect of temporarily switching to the given
		391	coroutine, and continuing some time later.
		392
		393	This is an advanced method for special cases - I'd love to hear about any
		394	uses for this one.
		395
		396	=item $coroutine->throw ([$scalar])
		397
		398	If C<$throw> is specified and defined, it will be thrown as an exception
		399	inside the coroutine at the next convenient point in time. Otherwise
		400	clears the exception object.
		401
		402	Coro will check for the exception each time a schedule-like-function
		403	returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
		404	>>, C<< Coro::Handle->readable >> and so on. Most of these functions
		405	detect this case and return early in case an exception is pending.
		406
		407	The exception object will be thrown "as is" with the specified scalar in
		408	C<$@>, i.e. if it is a string, no line number or newline will be appended
		409	(unlike with C<die>).
		410
		411	This can be used as a softer means than C<cancel> to ask a coroutine to
		412	end itself, although there is no guarantee that the exception will lead to
		413	termination, and if the exception isn't caught it might well end the whole
		414	program.
		415
		416	You might also think of C<throw> as being the moral equivalent of
		417	C<kill>ing a coroutine with a signal (in this case, a scalar).
		418
		419	=item $coroutine->join
		420
		421	Wait until the coroutine terminates and return any values given to the
		422	C<terminate> or C<cancel> functions. C<join> can be called concurrently
		423	from multiple coroutines, and all will be resumed and given the status
		424	return once the C<$coroutine> terminates.
		425
		426	=cut
		427
		428	sub join {
		429	my $self = shift;
		430
		431	unless ($self->{_status}) {
273	my $current = $Coro::current;	432	my $current = $current;
274		433
275	# register a hypothetical event handler	434	push @{$self->{_on_destroy}}, sub {
276	on_event_invoke sub {
277	# wake up sleeping coroutine
278	$current->ready;	435	$current->ready;
279	undef $current;	436	undef $current;
280	};	437	};
281		438
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	}
287
288	=item cede
289
290	"Cede" to other coroutines. This function puts the current coroutine into the
291	ready queue and calls C<schedule>, which has the effect of giving up the
292	current "timeslice" to other coroutines of the same or higher priority.
293
294	Returns true if at least one coroutine switch has happened.
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
303	=item terminate [arg...]
304
305	Terminates the current coroutine with the given status values (see L<cancel>).
306
307	=cut
308
309	sub terminate {
310	$current->cancel (@_);
311	}
312
313	=back
314
315	# dynamic methods
316
317	=head2 COROUTINE METHODS
318
319	These are the methods you can call on coroutine objects.
320
321	=over 4
322
323	=item new Coro \&sub [, @args...]
324
325	Create a new coroutine and return it. When the sub returns the coroutine
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
328	by calling the ready method.
329
330	Calling C<exit> in a coroutine will not work correctly, so do not do that.
331
332	=cut
333
334	sub _run_coro {
335	terminate &{+shift};
336	}
337
338	sub new {
339	my $class = shift;
340
341	$class->SUPER::new (\&_run_coro, @_)
342	}
343
344	=item $success = $coroutine->ready
345
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.
349
350	=item $is_ready = $coroutine->is_ready
351
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.
359
360	=cut
361
362	sub cancel {
363	my $self = shift;
364	$self->{status} = [@_];
365
366	if ($current == $self) {
367	push @destroy, $self;
368	$manager->ready;
369	&schedule while 1;
370	} else {
371	$self->_cancel;
372	}
373	}
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;	439	&schedule while $current;
395	}	440	}
396		441
397	wantarray ? @{$self->{status}} : $self->{status}[0];	442	wantarray ? @{$self->{_status}} : $self->{_status}[0];
398	}	443	}
399		444
400	=item $coroutine->on_destroy (\&cb)	445	=item $coroutine->on_destroy (\&cb)
401		446
402	Registers a callback that is called when this coroutine gets destroyed,	447	Registers a callback that is called when this coroutine gets destroyed,
403	but before it is joined. The callback gets passed the terminate arguments,	448	but before it is joined. The callback gets passed the terminate arguments,
404	if any.	449	if any, and I<must not> die, under any circumstances.
405		450
406	=cut	451	=cut
407		452
408	sub on_destroy {	453	sub on_destroy {
409	my ($self, $cb) = @_;	454	my ($self, $cb) = @_;
410		455
411	push @{ $self->{destroy_cb} }, $cb;	456	push @{ $self->{_on_destroy} }, $cb;
412	}	457	}
413		458
414	=item $oldprio = $coroutine->prio ($newprio)	459	=item $oldprio = $coroutine->prio ($newprio)
415		460
416	Sets (or gets, if the argument is missing) the priority of the	461	Sets (or gets, if the argument is missing) the priority of the
…		…
439	higher values mean lower priority, just as in unix).	484	higher values mean lower priority, just as in unix).
440		485
441	=item $olddesc = $coroutine->desc ($newdesc)	486	=item $olddesc = $coroutine->desc ($newdesc)
442		487
443	Sets (or gets in case the argument is missing) the description for this	488	Sets (or gets in case the argument is missing) the description for this
444	coroutine. This is just a free-form string you can associate with a coroutine.	489	coroutine. This is just a free-form string you can associate with a
		490	coroutine.
		491
		492	This method simply sets the C<< $coroutine->{desc} >> member to the given
		493	string. You can modify this member directly if you wish.
445		494
446	=cut	495	=cut
447		496
448	sub desc {	497	sub desc {
449	my $old = $_[0]{desc};	498	my $old = $_[0]{desc};
…		…
458	=over 4	507	=over 4
459		508
460	=item Coro::nready	509	=item Coro::nready
461		510
462	Returns the number of coroutines that are currently in the ready state,	511	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	512	i.e. that can be switched to by calling C<schedule> directory or
		513	indirectly. The value C<0> means that the only runnable coroutine is the
464	coroutine is the currently running one, so C<cede> would have no effect,	514	currently running one, so C<cede> would have no effect, and C<schedule>
465	and C<schedule> would cause a deadlock unless there is an idle handler	515	would cause a deadlock unless there is an idle handler that wakes up some
466	that wakes up some coroutines.	516	coroutines.
467		517
468	=item my $guard = Coro::guard { ... }	518	=item my $guard = Coro::guard { ... }
469		519
470	This creates and returns a guard object. Nothing happens until the objetc	520	This creates and returns a guard object. Nothing happens until the object
471	gets destroyed, in which case the codeblock given as argument will be	521	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	522	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	523	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,	524	guard block will be executed. The guard object supports only one method,
475	C<< ->cancel >>, which will keep the codeblock from being executed.	525	C<< ->cancel >>, which will keep the codeblock from being executed.
…		…
500		550
501		551
502	=item unblock_sub { ... }	552	=item unblock_sub { ... }
503		553
504	This utility function takes a BLOCK or code reference and "unblocks" it,	554	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	555	returning a new coderef. Unblocking means that calling the new coderef
506	immediately without blocking, returning nothing, while the original code	556	will return immediately without blocking, returning nothing, while the
507	ref will be called (with parameters) from within its own coroutine.	557	original code ref will be called (with parameters) from within another
		558	coroutine.
508		559
509	The reason this fucntion exists is that many event libraries (such as the	560	The reason this function exists is that many event libraries (such as the
510	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form	561	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,	562	of thread-safety). This means you must not block within event callbacks,
512	otherwise you might suffer from crashes or worse.	563	otherwise you might suffer from crashes or worse. The only event library
		564	currently known that is safe to use without C<unblock_sub> is L<EV>.
513		565
514	This function allows your callbacks to block by executing them in another	566	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	567	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	568	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to
517	disk.	569	disk, for example.
518		570
519	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when	571	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
520	creating event callbacks that want to block.	572	creating event callbacks that want to block.
		573
		574	If your handler does not plan to block (e.g. simply sends a message to
		575	another coroutine, or puts some other coroutine into the ready queue),
		576	there is no reason to use C<unblock_sub>.
		577
		578	Note that you also need to use C<unblock_sub> for any other callbacks that
		579	are indirectly executed by any C-based event loop. For example, when you
		580	use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
		581	provides callbacks that are the result of some event callback, then you
		582	must not block either, or use C<unblock_sub>.
521		583
522	=cut	584	=cut
523		585
524	our @unblock_queue;	586	our @unblock_queue;
525		587
526	# we create a special coro because we want to cede,	588	# we create a special coro because we want to cede,
527	# to reduce pressure on the coro pool (because most callbacks	589	# to reduce pressure on the coro pool (because most callbacks
528	# return immediately and can be reused) and because we cannot cede	590	# return immediately and can be reused) and because we cannot cede
529	# inside an event callback.	591	# inside an event callback.
530	our $unblock_scheduler = async {	592	our $unblock_scheduler = new Coro sub {
531	while () {	593	while () {
532	while (my $cb = pop @unblock_queue) {	594	while (my $cb = pop @unblock_queue) {
533	# this is an inlined copy of async_pool	595	&async_pool (@$cb);
534	my $coro = (pop @pool or new Coro \&pool_handler);
535		596
536	$coro->{_invoke} = $cb;
537	$coro->ready;
538	cede; # for short-lived callbacks, this reduces pressure on the coro pool	597	# for short-lived callbacks, this reduces pressure on the coro pool
		598	# as the chance is very high that the async_poll coro will be back
		599	# in the idle state when cede returns
		600	cede;
539	}	601	}
540	schedule; # sleep well	602	schedule; # sleep well
541	}	603	}
542	};	604	};
		605	$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
543		606
544	sub unblock_sub(&) {	607	sub unblock_sub(&) {
545	my $cb = shift;	608	my $cb = shift;
546		609
547	sub {	610	sub {
548	unshift @unblock_queue, [$cb, @_];	611	unshift @unblock_queue, [$cb, @_];
549	$unblock_scheduler->ready;	612	$unblock_scheduler->ready;
550	}	613	}
551	}	614	}
552		615
		616	=item $cb = Coro::rouse_cb
		617
		618	Create and return a "rouse callback". That's a code reference that, when
		619	called, will save its arguments and notify the owner coroutine of the
		620	callback.
		621
		622	See the next function.
		623
		624	=item @args = Coro::rouse_wait [$cb]
		625
		626	Wait for the specified rouse callback (or the last one tht was created in
		627	this coroutine).
		628
		629	As soon as the callback is invoked (or when the calback was invoked before
		630	C<rouse_wait>), it will return a copy of the arguments originally passed
		631	to the rouse callback.
		632
		633	See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
		634
553	=back	635	=back
554		636
555	=cut	637	=cut
556		638
557	1;	639	1;
558		640
		641	=head1 HOW TO WAIT FOR A CALLBACK
		642
		643	It is very common for a coroutine to wait for some callback to be
		644	called. This occurs naturally when you use coroutines in an otherwise
		645	event-based program, or when you use event-based libraries.
		646
		647	These typically register a callback for some event, and call that callback
		648	when the event occured. In a coroutine, however, you typically want to
		649	just wait for the event, simplyifying things.
		650
		651	For example C<< AnyEvent->child >> registers a callback to be called when
		652	a specific child has exited:
		653
		654	my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
		655
		656	But from withina coroutine, you often just want to write this:
		657
		658	my $status = wait_for_child $pid;
		659
		660	Coro offers two functions specifically designed to make this easy,
		661	C<Coro::rouse_cb> and C<Coro::rouse_wait>.
		662
		663	The first function, C<rouse_cb>, generates and returns a callback that,
		664	when invoked, will save it's arguments and notify the coroutine that
		665	created the callback.
		666
		667	The second function, C<rouse_wait>, waits for the callback to be called
		668	(by calling C<schedule> to go to sleep) and returns the arguments
		669	originally passed to the callback.
		670
		671	Using these functions, it becomes easy to write the C<wait_for_child>
		672	function mentioned above:
		673
		674	sub wait_for_child($) {
		675	my ($pid) = @_;
		676
		677	my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
		678
		679	my ($rpid, $rstatus) = Coro::rouse_wait;
		680	$rstatus
		681	}
		682
		683	In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
		684	you can roll your own, using C<schedule>:
		685
		686	sub wait_for_child($) {
		687	my ($pid) = @_;
		688
		689	# store the current coroutine in $current,
		690	# and provide result variables for the closure passed to ->child
		691	my $current = $Coro::current;
		692	my ($done, $rstatus);
		693
		694	# pass a closure to ->child
		695	my $watcher = AnyEvent->child (pid => $pid, cb => sub {
		696	$rstatus = $_[1]; # remember rstatus
		697	$done = 1; # mark $rstatus as valud
		698	});
		699
		700	# wait until the closure has been called
		701	schedule while !$done;
		702
		703	$rstatus
		704	}
		705
		706
559	=head1 BUGS/LIMITATIONS	707	=head1 BUGS/LIMITATIONS
560		708
561	- you must make very sure that no coro is still active on global	709	=over 4
562	destruction. very bad things might happen otherwise (usually segfaults).
563		710
		711	=item fork with pthread backend
		712
		713	When Coro is compiled using the pthread backend (which isn't recommended
		714	but required on many BSDs as their libcs are completely broken), then
		715	coroutines will not survive a fork. There is no known workaround except to
		716	fix your libc and use a saner backend.
		717
		718	=item perl process emulation ("threads")
		719
564	- this module is not thread-safe. You should only ever use this module	720	This module is not perl-pseudo-thread-safe. You should only ever use this
565	from the same thread (this requirement might be losened in the future	721	module from the same thread (this requirement might be removed in the
566	to allow per-thread schedulers, but Coro::State does not yet allow	722	future to allow per-thread schedulers, but Coro::State does not yet allow
567	this).	723	this). I recommend disabling thread support and using processes, as having
		724	the windows process emulation enabled under unix roughly halves perl
		725	performance, even when not used.
		726
		727	=item coroutine switching not signal safe
		728
		729	You must not switch to another coroutine from within a signal handler
		730	(only relevant with %SIG - most event libraries provide safe signals).
		731
		732	That means you I<MUST NOT> call any function that might "block" the
		733	current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
		734	anything that calls those. Everything else, including calling C<ready>,
		735	works.
		736
		737	=back
		738
568		739
569	=head1 SEE ALSO	740	=head1 SEE ALSO
570		741
		742	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
		743
		744	Debugging: L<Coro::Debug>.
		745
571	Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.	746	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
572		747
573	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.	748	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
574		749
575	Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.	750	IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
576		751
577	Embedding: L<Coro:MakeMaker>	752	Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
		753
		754	XS API: L<Coro::MakeMaker>.
		755
		756	Low level Configuration, Coroutine Environment: L<Coro::State>.
578		757
579	=head1 AUTHOR	758	=head1 AUTHOR
580		759
581	Marc Lehmann <schmorp@schmorp.de>	760	Marc Lehmann <schmorp@schmorp.de>
582	http://home.schmorp.de/	761	http://home.schmorp.de/

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.114 by root, Wed Jan 24 16:22:08 2007 UTC vs. Revision 1.231 by root, Thu Nov 20 09:37:21 2008 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.114 by root, Wed Jan 24 16:22:08 2007 UTC vs.
Revision 1.231 by root, Thu Nov 20 09:37:21 2008 UTC