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

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.145 by root, Wed Oct 3 16:03:17 2007 UTC vs.
Revision 1.181 by root, Fri May 9 22:04:37 2008 UTC

…		…
2		2
3	Coro - coroutine process abstraction	3	Coro - coroutine process abstraction
4		4
5	=head1 SYNOPSIS	5	=head1 SYNOPSIS
6		6
7	use Coro;	7	use Coro;
8		8
9	async {	9	async {
10	# some asynchronous thread of execution	10	# some asynchronous thread of execution
		11	print "2\n";
		12	cede; # yield back to main
		13	print "4\n";
11	};	14	};
12		15	print "1\n";
13	# alternatively create an async coroutine like this:	16	cede; # yield to coroutine
14		17	print "3\n";
15	sub some_func : Coro {	18	cede; # and again
16	# some more async code	19
17	}	20	# use locking
18		21	my $lock = new Coro::Semaphore;
19	cede;	22	my $locked;
		23
		24	$lock->down;
		25	$locked = 1;
		26	$lock->up;
20		27
21	=head1 DESCRIPTION	28	=head1 DESCRIPTION
22		29
23	This module collection manages coroutines. Coroutines are similar	30	This module collection manages coroutines. Coroutines are similar to
24	to threads but don't run in parallel at the same time even on SMP	31	threads but don't (in general) run in parallel at the same time even
25	machines. The specific flavor of coroutine used in this module also	32	on SMP machines. The specific flavor of coroutine used in this module
26	guarantees you that it will not switch between coroutines unless	33	also guarantees you that it will not switch between coroutines unless
27	necessary, at easily-identified points in your program, so locking and	34	necessary, at easily-identified points in your program, so locking and
28	parallel access are rarely an issue, making coroutine programming much	35	parallel access are rarely an issue, making coroutine programming much
29	safer than threads programming.	36	safer and easier than threads programming.
30		37
31	(Perl, however, does not natively support real threads but instead does a	38	Unlike a normal perl program, however, coroutines allow you to have
32	very slow and memory-intensive emulation of processes using threads. This	39	multiple running interpreters that share data, which is especially useful
33	is a performance win on Windows machines, and a loss everywhere else).	40	to code pseudo-parallel processes, such as multiple HTTP-GET requests
		41	running concurrently.
		42
		43	Coroutines are also useful because Perl has no support for threads (the so
		44	called "threads" that perl offers are nothing more than the (bad) process
		45	emulation coming from the Windows platform: On standard operating systems
		46	they serve no purpose whatsoever, except by making your programs slow and
		47	making them use a lot of memory. Best disable them when building perl, or
		48	aks your software vendor/distributor to do it for you).
34		49
35	In this module, coroutines are defined as "callchain + lexical variables +	50	In this module, coroutines are defined as "callchain + lexical variables +
36	@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,	51	@_ + $_ + $@ + $/ + 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	52	its own set of lexicals and its own set of perls most important global
38	variables.	53	variables (see L<Coro::State> for more configuration).
39		54
40	=cut	55	=cut
41		56
42	package Coro;	57	package Coro;
43		58
…		…
50		65
51	our $idle; # idle handler	66	our $idle; # idle handler
52	our $main; # main coroutine	67	our $main; # main coroutine
53	our $current; # current coroutine	68	our $current; # current coroutine
54		69
55	our $VERSION = '4.0';	70	our $VERSION = 4.6;
56		71
57	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);	72	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58	our %EXPORT_TAGS = (	73	our %EXPORT_TAGS = (
59	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	74	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60	);	75	);
61	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));	76	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
62		77
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	78	=over 4
98		79
99	=item $main	80	=item $Coro::main
100		81
101	This coroutine represents the main program.	82	This variable stores the coroutine object that represents the main
		83	program. While you cna C<ready> it and do most other things you can do to
		84	coroutines, it is mainly useful to compare again C<$Coro::current>, to see
		85	wether you are running in the main program or not.
102		86
103	=cut	87	=cut
104		88
105	$main = new Coro;	89	$main = new Coro;
106		90
107	=item $current (or as function: current)	91	=item $Coro::current
108		92
109	The current coroutine (the last coroutine switched to). The initial value	93	The coroutine object representing the current coroutine (the last
		94	coroutine that the Coro scheduler switched to). The initial value is
110	is C<$main> (of course).	95	C<$main> (of course).
111		96
112	This variable is B<strictly> I<read-only>. It is provided for performance	97	This variable is B<strictly> I<read-only>. You can take copies of the
113	reasons. If performance is not essential you are encouraged to use the	98	value stored in it and use it as any other coroutine object, but you must
114	C<Coro::current> function instead.	99	not otherwise modify the variable itself.
115		100
116	=cut	101	=cut
117		102
118	$main->{desc} = "[main::]";	103	$main->{desc} = "[main::]";
119		104
…		…
121	$main->{_specific} = $current->{_specific}	106	$main->{_specific} = $current->{_specific}
122	if $current;	107	if $current;
123		108
124	_set_current $main;	109	_set_current $main;
125		110
126	sub current() { $current }	111	sub current() { $current } # [DEPRECATED]
127		112
128	=item $idle	113	=item $Coro::idle
129		114
130	A callback that is called whenever the scheduler finds no ready coroutines	115	This variable is mainly useful to integrate Coro into event loops. It is
131	to run. The default implementation prints "FATAL: deadlock detected" and	116	usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
132	exits, because the program has no other way to continue.	117	pretty low-level functionality.
		118
		119	This variable stores a callback that is called whenever the scheduler
		120	finds no ready coroutines to run. The default implementation prints
		121	"FATAL: deadlock detected" and exits, because the program has no other way
		122	to continue.
133		123
134	This hook is overwritten by modules such as C<Coro::Timer> and	124	This hook is overwritten by modules such as C<Coro::Timer> and
135	C<Coro::Event> to wait on an external event that hopefully wake up a	125	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
136	coroutine so the scheduler can run it.	126	coroutine so the scheduler can run it.
137		127
		128	Note that the callback I<must not>, under any circumstances, block
		129	the current coroutine. Normally, this is achieved by having an "idle
		130	coroutine" that calls the event loop and then blocks again, and then
		131	readying that coroutine in the idle handler.
		132
		133	See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
		134	technique.
		135
138	Please note that if your callback recursively invokes perl (e.g. for event	136	Please note that if your callback recursively invokes perl (e.g. for event
139	handlers), then it must be prepared to be called recursively.	137	handlers), then it must be prepared to be called recursively itself.
140		138
141	=cut	139	=cut
142		140
143	$idle = sub {	141	$idle = sub {
144	require Carp;	142	require Carp;
…		…
171	}	169	}
172	};	170	};
173	$manager->desc ("[coro manager]");	171	$manager->desc ("[coro manager]");
174	$manager->prio (PRIO_MAX);	172	$manager->prio (PRIO_MAX);
175		173
176	# static methods. not really.
177
178	=back	174	=back
179		175
180	=head2 STATIC METHODS	176	=head2 SIMPLE COROUTINE CREATION
181
182	Static methods are actually functions that operate on the current coroutine only.
183		177
184	=over 4	178	=over 4
185		179
186	=item async { ... } [@args...]	180	=item async { ... } [@args...]
187		181
188	Create a new asynchronous coroutine and return it's coroutine object	182	Create a new coroutine and return it's coroutine object (usually
189	(usually unused). When the sub returns the new coroutine is automatically	183	unused). The coroutine will be put into the ready queue, so
		184	it will start running automatically on the next scheduler run.
		185
		186	The first argument is a codeblock/closure that should be executed in the
		187	coroutine. When it returns argument returns the coroutine is automatically
190	terminated.	188	terminated.
191		189
		190	The remaining arguments are passed as arguments to the closure.
		191
192	See the C<Coro::State::new> constructor for info about the coroutine	192	See the C<Coro::State::new> constructor for info about the coroutine
193	environment.	193	environment in which coroutines are executed.
194		194
195	Calling C<exit> in a coroutine will do the same as calling exit outside	195	Calling C<exit> in a coroutine will do the same as calling exit outside
196	the coroutine. Likewise, when the coroutine dies, the program will exit,	196	the coroutine. Likewise, when the coroutine dies, the program will exit,
197	just as it would in the main program.	197	just as it would in the main program.
198		198
		199	If you do not want that, you can provide a default C<die> handler, or
		200	simply avoid dieing (by use of C<eval>).
		201
199	# create a new coroutine that just prints its arguments	202	Example: Create a new coroutine that just prints its arguments.
		203
200	async {	204	async {
201	print "@_\n";	205	print "@_\n";
202	} 1,2,3,4;	206	} 1,2,3,4;
203		207
204	=cut	208	=cut
…		…
210	}	214	}
211		215
212	=item async_pool { ... } [@args...]	216	=item async_pool { ... } [@args...]
213		217
214	Similar to C<async>, but uses a coroutine pool, so you should not call	218	Similar to C<async>, but uses a coroutine pool, so you should not call
215	terminate or join (although you are allowed to), and you get a coroutine	219	terminate or join on it (although you are allowed to), and you get a
216	that might have executed other code already (which can be good or bad :).	220	coroutine that might have executed other code already (which can be good
		221	or bad :).
217		222
		223	On the plus side, this function is faster than creating (and destroying)
		224	a completely new coroutine, so if you need a lot of generic coroutines in
		225	quick successsion, use C<async_pool>, not C<async>.
		226
218	Also, the block is executed in an C<eval> context and a warning will be	227	The code block is executed in an C<eval> context and a warning will be
219	issued in case of an exception instead of terminating the program, as	228	issued in case of an exception instead of terminating the program, as
220	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>	229	C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
221	will not work in the expected way, unless you call terminate or cancel,	230	will not work in the expected way, unless you call terminate or cancel,
222	which somehow defeats the purpose of pooling.	231	which somehow defeats the purpose of pooling (but is fine in the
		232	exceptional case).
223		233
224	The priority will be reset to C<0> after each job, otherwise the coroutine	234	The priority will be reset to C<0> after each run, tracing will be
225	will be re-used "as-is".	235	disabled, the description will be reset and the default output filehandle
		236	gets restored, so you can change all these. Otherwise the coroutine will
		237	be re-used "as-is": most notably if you change other per-coroutine global
		238	stuff such as C<$/> you I<must needs> to revert that change, which is most
		239	simply done by using local as in: C< local $/ >.
226		240
227	The pool size is limited to 8 idle coroutines (this can be adjusted by	241	The pool size is limited to C<8> idle coroutines (this can be adjusted by
228	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as	242	changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
229	required.	243	required.
230		244
231	If you are concerned about pooled coroutines growing a lot because a	245	If you are concerned about pooled coroutines growing a lot because a
232	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool	246	single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
233	{ terminate }> once per second or so to slowly replenish the pool. In	247	{ terminate }> once per second or so to slowly replenish the pool. In
234	addition to that, when the stacks used by a handler grows larger than 16kb	248	addition to that, when the stacks used by a handler grows larger than 16kb
235	(adjustable with $Coro::POOL_RSS) it will also exit.	249	(adjustable via $Coro::POOL_RSS) it will also be destroyed.
236		250
237	=cut	251	=cut
238		252
239	our $POOL_SIZE = 8;	253	our $POOL_SIZE = 8;
240	our $POOL_RSS = 16 * 1024;	254	our $POOL_RSS = 16 * 1024;
…		…
251	_pool_2 $cb;	265	_pool_2 $cb;
252	&schedule;	266	&schedule;
253	}	267	}
254	};	268	};
255		269
256	last if $@ eq "\3terminate\2\n";	270	last if $@ eq "\3async_pool terminate\2\n";
257	warn $@ if $@;	271	warn $@ if $@;
258	}	272	}
259	}	273	}
260		274
261	sub async_pool(&@) {	275	sub async_pool(&@) {
…		…
266	$coro->ready;	280	$coro->ready;
267		281
268	$coro	282	$coro
269	}	283	}
270		284
		285	=back
		286
		287	=head2 STATIC METHODS
		288
		289	Static methods are actually functions that operate on the current coroutine.
		290
		291	=over 4
		292
271	=item schedule	293	=item schedule
272		294
273	Calls the scheduler. Please note that the current coroutine will not be put	295	Calls the scheduler. The scheduler will find the next coroutine that is
		296	to be run from the ready queue and switches to it. The next coroutine
		297	to be run is simply the one with the highest priority that is longest
		298	in its ready queue. If there is no coroutine ready, it will clal the
		299	C<$Coro::idle> hook.
		300
		301	Please note that the current coroutine will I<not> be put into the ready
274	into the ready queue, so calling this function usually means you will	302	queue, so calling this function usually means you will never be called
275	never be called again unless something else (e.g. an event handler) calls	303	again unless something else (e.g. an event handler) calls C<< ->ready >>,
276	ready.	304	thus waking you up.
		305
		306	This makes C<schedule> I<the> generic method to use to block the current
		307	coroutine and wait for events: first you remember the current coroutine in
		308	a variable, then arrange for some callback of yours to call C<< ->ready
		309	>> on that once some event happens, and last you call C<schedule> to put
		310	yourself to sleep. Note that a lot of things can wake your coroutine up,
		311	so you need to check wether the event indeed happened, e.g. by storing the
		312	status in a variable.
277		313
278	The canonical way to wait on external events is this:	314	The canonical way to wait on external events is this:
279		315
280	{	316	{
281	# remember current coroutine	317	# remember current coroutine
…		…
294	Coro::schedule while $current;	330	Coro::schedule while $current;
295	}	331	}
296		332
297	=item cede	333	=item cede
298		334
299	"Cede" to other coroutines. This function puts the current coroutine into the	335	"Cede" to other coroutines. This function puts the current coroutine into
300	ready queue and calls C<schedule>, which has the effect of giving up the	336	the ready queue and calls C<schedule>, which has the effect of giving
301	current "timeslice" to other coroutines of the same or higher priority.	337	up the current "timeslice" to other coroutines of the same or higher
		338	priority. Once your coroutine gets its turn again it will automatically be
		339	resumed.
302		340
303	Returns true if at least one coroutine switch has happened.	341	This function is often called C<yield> in other languages.
304		342
305	=item Coro::cede_notself	343	=item Coro::cede_notself
306		344
307	Works like cede, but is not exported by default and will cede to any	345	Works like cede, but is not exported by default and will cede to I<any>
308	coroutine, regardless of priority, once.	346	coroutine, regardless of priority. This is useful sometimes to ensure
309		347	progress is made.
310	Returns true if at least one coroutine switch has happened.
311		348
312	=item terminate [arg...]	349	=item terminate [arg...]
313		350
314	Terminates the current coroutine with the given status values (see L<cancel>).	351	Terminates the current coroutine with the given status values (see L<cancel>).
315		352
316	=item killall	353	=item killall
317		354
318	Kills/terminates/cancels all coroutines except the currently running	355	Kills/terminates/cancels all coroutines except the currently running
319	one. This is useful after a fork, either in the child or the parent, as	356	one. This is useful after a fork, either in the child or the parent, as
320	usually only one of them should inherit the running coroutines.	357	usually only one of them should inherit the running coroutines.
		358
		359	Note that while this will try to free some of the main programs resources,
		360	you cnanot free all of them, so if a coroutine that is not the main
		361	program calls this function, there will be some one-time resource leak.
321		362
322	=cut	363	=cut
323		364
324	sub terminate {	365	sub terminate {
325	$current->cancel (@_);	366	$current->cancel (@_);
…		…
332	}	373	}
333	}	374	}
334		375
335	=back	376	=back
336		377
337	# dynamic methods
338
339	=head2 COROUTINE METHODS	378	=head2 COROUTINE METHODS
340		379
341	These are the methods you can call on coroutine objects.	380	These are the methods you can call on coroutine objects (or to create
		381	them).
342		382
343	=over 4	383	=over 4
344		384
345	=item new Coro \&sub [, @args...]	385	=item new Coro \&sub [, @args...]
346		386
347	Create a new coroutine and return it. When the sub returns the coroutine	387	Create a new coroutine and return it. When the sub returns, the coroutine
348	automatically terminates as if C<terminate> with the returned values were	388	automatically terminates as if C<terminate> with the returned values were
349	called. To make the coroutine run you must first put it into the ready queue	389	called. To make the coroutine run you must first put it into the ready
350	by calling the ready method.	390	queue by calling the ready method.
351		391
352	See C<async> and C<Coro::State::new> for additional info about the	392	See C<async> and C<Coro::State::new> for additional info about the
353	coroutine environment.	393	coroutine environment.
354		394
355	=cut	395	=cut
…		…
364	$class->SUPER::new (\&_run_coro, @_)	404	$class->SUPER::new (\&_run_coro, @_)
365	}	405	}
366		406
367	=item $success = $coroutine->ready	407	=item $success = $coroutine->ready
368		408
369	Put the given coroutine into the ready queue (according to it's priority)	409	Put the given coroutine into the end of its ready queue (there is one
370	and return true. If the coroutine is already in the ready queue, do nothing	410	queue for each priority) and return true. If the coroutine is already in
371	and return false.	411	the ready queue, do nothing and return false.
		412
		413	This ensures that the scheduler will resume this coroutine automatically
		414	once all the coroutines of higher priority and all coroutines of the same
		415	priority that were put into the ready queue earlier have been resumed.
372		416
373	=item $is_ready = $coroutine->is_ready	417	=item $is_ready = $coroutine->is_ready
374		418
375	Return wether the coroutine is currently the ready queue or not,	419	Return wether the coroutine is currently the ready queue or not,
376		420
…		…
397		441
398	=item $coroutine->join	442	=item $coroutine->join
399		443
400	Wait until the coroutine terminates and return any values given to the	444	Wait until the coroutine terminates and return any values given to the
401	C<terminate> or C<cancel> functions. C<join> can be called concurrently	445	C<terminate> or C<cancel> functions. C<join> can be called concurrently
402	from multiple coroutines.	446	from multiple coroutines, and all will be resumed and given the status
		447	return once the C<$coroutine> terminates.
403		448
404	=cut	449	=cut
405		450
406	sub join {	451	sub join {
407	my $self = shift;	452	my $self = shift;
…		…
422		467
423	=item $coroutine->on_destroy (\&cb)	468	=item $coroutine->on_destroy (\&cb)
424		469
425	Registers a callback that is called when this coroutine gets destroyed,	470	Registers a callback that is called when this coroutine gets destroyed,
426	but before it is joined. The callback gets passed the terminate arguments,	471	but before it is joined. The callback gets passed the terminate arguments,
427	if any.	472	if any, and I<must not> die, under any circumstances.
428		473
429	=cut	474	=cut
430		475
431	sub on_destroy {	476	sub on_destroy {
432	my ($self, $cb) = @_;	477	my ($self, $cb) = @_;
…		…
467	coroutine. This is just a free-form string you can associate with a coroutine.	512	coroutine. This is just a free-form string you can associate with a coroutine.
468		513
469	This method simply sets the C<< $coroutine->{desc} >> member to the given string. You	514	This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
470	can modify this member directly if you wish.	515	can modify this member directly if you wish.
471		516
		517	=item $coroutine->throw ([$scalar])
		518
		519	If C<$throw> is specified and defined, it will be thrown as an exception
		520	inside the coroutine at the next convinient point in time (usually after
		521	it gains control at the next schedule/transfer/cede). Otherwise clears the
		522	exception object.
		523
		524	The exception object will be thrown "as is" with the specified scalar in
		525	C<$@>, i.e. if it is a string, no line number or newline will be appended
		526	(unlike with C<die>).
		527
		528	This can be used as a softer means than C<cancel> to ask a coroutine to
		529	end itself, although there is no guarentee that the exception will lead to
		530	termination, and if the exception isn't caught it might well end the whole
		531	program.
		532
472	=cut	533	=cut
473		534
474	sub desc {	535	sub desc {
475	my $old = $_[0]{desc};	536	my $old = $_[0]{desc};
476	$_[0]{desc} = $_[1] if @_ > 1;	537	$_[0]{desc} = $_[1] if @_ > 1;
…		…
484	=over 4	545	=over 4
485		546
486	=item Coro::nready	547	=item Coro::nready
487		548
488	Returns the number of coroutines that are currently in the ready state,	549	Returns the number of coroutines that are currently in the ready state,
489	i.e. that can be switched to. The value C<0> means that the only runnable	550	i.e. that can be switched to by calling C<schedule> directory or
		551	indirectly. The value C<0> means that the only runnable coroutine is the
490	coroutine is the currently running one, so C<cede> would have no effect,	552	currently running one, so C<cede> would have no effect, and C<schedule>
491	and C<schedule> would cause a deadlock unless there is an idle handler	553	would cause a deadlock unless there is an idle handler that wakes up some
492	that wakes up some coroutines.	554	coroutines.
493		555
494	=item my $guard = Coro::guard { ... }	556	=item my $guard = Coro::guard { ... }
495		557
496	This creates and returns a guard object. Nothing happens until the object	558	This creates and returns a guard object. Nothing happens until the object
497	gets destroyed, in which case the codeblock given as argument will be	559	gets destroyed, in which case the codeblock given as argument will be
…		…
526		588
527		589
528	=item unblock_sub { ... }	590	=item unblock_sub { ... }
529		591
530	This utility function takes a BLOCK or code reference and "unblocks" it,	592	This utility function takes a BLOCK or code reference and "unblocks" it,
531	returning the new coderef. This means that the new coderef will return	593	returning a new coderef. Unblocking means that calling the new coderef
532	immediately without blocking, returning nothing, while the original code	594	will return immediately without blocking, returning nothing, while the
533	ref will be called (with parameters) from within its own coroutine.	595	original code ref will be called (with parameters) from within another
		596	coroutine.
534		597
535	The reason this function exists is that many event libraries (such as the	598	The reason this function exists is that many event libraries (such as the
536	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form	599	venerable L<Event\|Event> module) are not coroutine-safe (a weaker form
537	of thread-safety). This means you must not block within event callbacks,	600	of thread-safety). This means you must not block within event callbacks,
538	otherwise you might suffer from crashes or worse.	601	otherwise you might suffer from crashes or worse. The only event library
		602	currently known that is safe to use without C<unblock_sub> is L<EV>.
539		603
540	This function allows your callbacks to block by executing them in another	604	This function allows your callbacks to block by executing them in another
541	coroutine where it is safe to block. One example where blocking is handy	605	coroutine where it is safe to block. One example where blocking is handy
542	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to	606	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to
543	disk.	607	disk, for example.
544		608
545	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when	609	In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
546	creating event callbacks that want to block.	610	creating event callbacks that want to block.
		611
		612	If your handler does not plan to block (e.g. simply sends a message to
		613	another coroutine, or puts some other coroutine into the ready queue),
		614	there is no reason to use C<unblock_sub>.
547		615
548	=cut	616	=cut
549		617
550	our @unblock_queue;	618	our @unblock_queue;
551		619
…		…
583		651
584	1;	652	1;
585		653
586	=head1 BUGS/LIMITATIONS	654	=head1 BUGS/LIMITATIONS
587		655
588	- you must make very sure that no coro is still active on global
589	destruction. very bad things might happen otherwise (usually segfaults).
590
591	- this module is not thread-safe. You should only ever use this module	656	This module is not perl-pseudo-thread-safe. You should only ever use this
592	from the same thread (this requirement might be loosened in the future	657	module from the same thread (this requirement might be removed in the
593	to allow per-thread schedulers, but Coro::State does not yet allow	658	future to allow per-thread schedulers, but Coro::State does not yet allow
594	this).	659	this). I recommend disabling thread support and using processes, as this
		660	is much faster and uses less memory.
595		661
596	=head1 SEE ALSO	662	=head1 SEE ALSO
597		663
		664	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
		665
		666	Debugging: L<Coro::Debug>.
		667
598	Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.	668	Support/Utility: L<Coro::Specific>, L<Coro::Util>.
599		669
600	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.	670	Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
601		671
602	Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.	672	IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
603		673
604	Embedding: L<Coro:MakeMaker>	674	Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
		675
		676	XS API: L<Coro::MakeMaker>.
		677
		678	Low level Configuration, Coroutine Environment: L<Coro::State>.
605		679
606	=head1 AUTHOR	680	=head1 AUTHOR
607		681
608	Marc Lehmann <schmorp@schmorp.de>	682	Marc Lehmann <schmorp@schmorp.de>
609	http://home.schmorp.de/	683	http://home.schmorp.de/

Diff Legend

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

Comparing cvsroot/Coro/Coro.pm (file contents): Revision 1.145 by root, Wed Oct 3 16:03:17 2007 UTC vs. Revision 1.181 by root, Fri May 9 22:04:37 2008 UTC

Diff Legend

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.145 by root, Wed Oct 3 16:03:17 2007 UTC vs.
Revision 1.181 by root, Fri May 9 22:04:37 2008 UTC