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

Comparing Coro/Coro.pm (file contents):
Revision 1.256 by root, Wed Jun 17 21:38:23 2009 UTC vs.
Revision 1.296 by root, Thu May 12 23:24:28 2011 UTC

…		…
40	points in your program, so locking and parallel access are rarely an	40	points in your program, so locking and parallel access are rarely an
41	issue, making thread programming much safer and easier than using other	41	issue, making thread programming much safer and easier than using other
42	thread models.	42	thread models.
43		43
44	Unlike the so-called "Perl threads" (which are not actually real threads	44	Unlike the so-called "Perl threads" (which are not actually real threads
45	but only the windows process emulation ported to unix, and as such act	45	but only the windows process emulation (see section of same name for
46	as processes), Coro provides a full shared address space, which makes	46	more details) ported to UNIX, and as such act as processes), Coro
47	communication between threads very easy. And Coro's threads are fast,	47	provides a full shared address space, which makes communication between
48	too: disabling the Windows process emulation code in your perl and using	48	threads very easy. And coro threads are fast, too: disabling the Windows
49	Coro can easily result in a two to four times speed increase for your	49	process emulation code in your perl and using Coro can easily result in
50	programs. A parallel matrix multiplication benchmark runs over 300 times	50	a two to four times speed increase for your programs. A parallel matrix
		51	multiplication benchmark (very communication-intensive) runs over 300
51	faster on a single core than perl's pseudo-threads on a quad core using	52	times faster on a single core than perls pseudo-threads on a quad core
52	all four cores.	53	using all four cores.
53		54
54	Coro achieves that by supporting multiple running interpreters that share	55	Coro achieves that by supporting multiple running interpreters that share
55	data, which is especially useful to code pseudo-parallel processes and	56	data, which is especially useful to code pseudo-parallel processes and
56	for event-based programming, such as multiple HTTP-GET requests running	57	for event-based programming, such as multiple HTTP-GET requests running
57	concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro	58	concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
…		…
63	variables (see L<Coro::State> for more configuration and background info).	64	variables (see L<Coro::State> for more configuration and background info).
64		65
65	See also the C<SEE ALSO> section at the end of this document - the Coro	66	See also the C<SEE ALSO> section at the end of this document - the Coro
66	module family is quite large.	67	module family is quite large.
67		68
		69	=head1 CORO THREAD LIFE CYCLE
		70
		71	During the long and exciting (or not) life of a coro thread, it goes
		72	through a number of states:
		73
		74	=over 4
		75
		76	=item 1. Creation
		77
		78	The first thing in the life of a coro thread is it's creation -
		79	obviously. The typical way to create a thread is to call the C<async
		80	BLOCK> function:
		81
		82	async {
		83	# thread code goes here
		84	};
		85
		86	You can also pass arguments, which are put in C<@_>:
		87
		88	async {
		89	print $_[1]; # prints 2
		90	} 1, 2, 3;
		91
		92	This creates a new coro thread and puts it into the ready queue, meaning
		93	it will run as soon as the CPU is free for it.
		94
		95	C<async> will return a coro object - you can store this for future
		96	reference or ignore it, the thread itself will keep a reference to it's
		97	thread object - threads are alive on their own.
		98
		99	Another way to create a thread is to call the C<new> constructor with a
		100	code-reference:
		101
		102	new Coro sub {
		103	# thread code goes here
		104	}, @optional_arguments;
		105
		106	This is quite similar to calling C<async>, but the important difference is
		107	that the new thread is not put into the ready queue, so the thread will
		108	not run until somebody puts it there. C<async> is, therefore, identical to
		109	this sequence:
		110
		111	my $coro = new Coro sub {
		112	# thread code goes here
		113	};
		114	$coro->ready;
		115	return $coro;
		116
		117	=item 2. Startup
		118
		119	When a new coro thread is created, only a copy of the code reference
		120	and the arguments are stored, no extra memory for stacks and so on is
		121	allocated, keeping the coro thread in a low-memory state.
		122
		123	Only when it actually starts executing will all the resources be finally
		124	allocated.
		125
		126	The optional arguments specified at coro creation are available in C<@_>,
		127	similar to function calls.
		128
		129	=item 3. Running / Blocking
		130
		131	A lot can happen after the coro thread has started running. Quite usually,
		132	it will not run to the end in one go (because you could use a function
		133	instead), but it will give up the CPU regularly because it waits for
		134	external events.
		135
		136	As long as a coro thread runs, it's coro object is available in the global
		137	variable C<$Coro::current>.
		138
		139	The low-level way to give up the CPU is to call the scheduler, which
		140	selects a new coro thread to run:
		141
		142	Coro::schedule;
		143
		144	Since running threads are not in the ready queue, calling the scheduler
		145	without doing anything else will block the coro thread forever - you need
		146	to arrange either for the coro to put woken up (readied) by some other
		147	event or some other thread, or you can put it into the ready queue before
		148	scheduling:
		149
		150	# this is exactly what Coro::cede does
		151	$Coro::current->ready;
		152	Coro::schedule;
		153
		154	All the higher-level synchronisation methods (Coro::Semaphore,
		155	Coro::rouse_*...) are actually implemented via C<< ->ready >> and C<<
		156	Coro::schedule >>.
		157
		158	While the coro thread is running it also might get assigned a C-level
		159	thread, or the C-level thread might be unassigned from it, as the Coro
		160	runtime wishes. A C-level thread needs to be assigned when your perl
		161	thread calls into some C-level function and that function in turn calls
		162	perl and perl then wants to switch coroutines. This happens most often
		163	when you run an event loop and block in the callback, or when perl
		164	itself calls some function such as C<AUTOLOAD> or methods via the C<tie>
		165	mechanism.
		166
		167	=item 4. Termination
		168
		169	Many threads actually terminate after some time. There are a number of
		170	ways to terminate a coro thread, the simplest is returning from the
		171	top-level code reference:
		172
		173	async {
		174	# after returning from here, the coro thread is terminated
		175	};
		176
		177	async {
		178	return if 0.5 < rand; # terminate a little earlier, maybe
		179	print "got a chance to print this\n";
		180	# or here
		181	};
		182
		183	Any values returned from the coroutine can be recovered using C<< ->join
		184	>>:
		185
		186	my $coro = async {
		187	"hello, world\n" # return a string
		188	};
		189
		190	my $hello_world = $coro->join;
		191
		192	print $hello_world;
		193
		194	Another way to terminate is to call C<< Coro::terminate >>, which at any
		195	subroutine call nesting level:
		196
		197	async {
		198	Coro::terminate "return value 1", "return value 2";
		199	};
		200
		201	And yet another way is to C<< ->cancel >> (or C<< ->safe_cancel >>) the
		202	coro thread from another thread:
		203
		204	my $coro = async {
		205	exit 1;
		206	};
		207
		208	$coro->cancel; # also accepts values for ->join to retrieve
		209
		210	Cancellation I<can> be dangerous - it's a bit like calling C<exit> without
		211	actually exiting, and might leave C libraries and XS modules in a weird
		212	state. Unlike other thread implementations, however, Coro is exceptionally
		213	safe with regards to cancellation, as perl will always be in a consistent
		214	state, and for those cases where you want to do truly marvellous things
		215	with your coro while it is being cancelled - that is, make sure all
		216	cleanup code is executed from the thread being cancelled - there is even a
		217	C<< ->safe_cancel >> method.
		218
		219	So, cancelling a thread that runs in an XS event loop might not be the
		220	best idea, but any other combination that deals with perl only (cancelling
		221	when a thread is in a C<tie> method or an C<AUTOLOAD> for example) is
		222	safe.
		223
		224	=item 5. Cleanup
		225
		226	Threads will allocate various resources. Most but not all will be returned
		227	when a thread terminates, during clean-up.
		228
		229	Cleanup is quite similar to throwing an uncaught exception: perl will
		230	work it's way up through all subroutine calls and blocks. On it's way, it
		231	will release all C<my> variables, undo all C<local>'s and free any other
		232	resources truly local to the thread.
		233
		234	So, a common way to free resources is to keep them referenced only by my
		235	variables:
		236
		237	async {
		238	my $big_cache = new Cache ...;
		239	};
		240
		241	If there are no other references, then the C<$big_cache> object will be
		242	freed when the thread terminates, regardless of how it does so.
		243
		244	What it does C<NOT> do is unlock any Coro::Semaphores or similar
		245	resources, but that's where the C<guard> methods come in handy:
		246
		247	my $sem = new Coro::Semaphore;
		248
		249	async {
		250	my $lock_guard = $sem->guard;
		251	# if we reutrn, or die or get cancelled, here,
		252	# then the semaphore will be "up"ed.
		253	};
		254
		255	The C<Guard::guard> function comes in handy for any custom cleanup you
		256	might want to do:
		257
		258	async {
		259	my $window = new Gtk2::Window "toplevel";
		260	# The window will not be cleaned up automatically, even when $window
		261	# gets freed, so use a guard to ensure it's destruction
		262	# in case of an error:
		263	my $window_guard = Guard::guard { $window->destroy };
		264
		265	# we are safe here
		266	};
		267
		268	Last not least, C<local> can often be handy, too, e.g. when temporarily
		269	replacing the coro thread description:
		270
		271	sub myfunction {
		272	local $Coro::current->{desc} = "inside myfunction(@_)";
		273
		274	# if we return or die here, the description will be restored
		275	}
		276
		277	=item 6. Viva La Zombie Muerte
		278
		279	Even after a thread has terminated and cleaned up it's resources, the coro
		280	object still is there and stores the return values of the thread. Only in
		281	this state will the coro object be "reference counted" in the normal perl
		282	sense: the thread code keeps a reference to it when it is active, but not
		283	after it has terminated.
		284
		285	The means the coro object gets freed automatically when the thread has
		286	terminated and cleaned up and there arenot other references.
		287
		288	If there are, the coro object will stay around, and you can call C<<
		289	->join >> as many times as you wish to retrieve the result values:
		290
		291	async {
		292	print "hi\n";
		293	1
		294	};
		295
		296	# run the async above, and free everything before returning
		297	# from Coro::cede:
		298	Coro::cede;
		299
		300	{
		301	my $coro = async {
		302	print "hi\n";
		303	1
		304	};
		305
		306	# run the async above, and clean up, but do not free the coro
		307	# object:
		308	Coro::cede;
		309
		310	# optionally retrieve the result values
		311	my @results = $coro->join;
		312
		313	# now $coro goes out of scope, and presumably gets freed
		314	};
		315
		316	=back
		317
68	=cut	318	=cut
69		319
70	package Coro;	320	package Coro;
71		321
72	use strict qw(vars subs);	322	use common::sense;
73	no warnings "uninitialized";	323
		324	use Carp ();
74		325
75	use Guard ();	326	use Guard ();
76		327
77	use Coro::State;	328	use Coro::State;
78		329
…		…
80		331
81	our $idle; # idle handler	332	our $idle; # idle handler
82	our $main; # main coro	333	our $main; # main coro
83	our $current; # current coro	334	our $current; # current coro
84		335
85	our $VERSION = 5.132;	336	our $VERSION = 5.372;
86		337
87	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);	338	our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub rouse_cb rouse_wait);
88	our %EXPORT_TAGS = (	339	our %EXPORT_TAGS = (
89	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],	340	prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
90	);	341	);
91	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));	342	our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
92		343
…		…
123		374
124	This variable is mainly useful to integrate Coro into event loops. It is	375	This variable is mainly useful to integrate Coro into event loops. It is
125	usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is	376	usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
126	pretty low-level functionality.	377	pretty low-level functionality.
127		378
128	This variable stores either a Coro object or a callback.	379	This variable stores a Coro object that is put into the ready queue when
		380	there are no other ready threads (without invoking any ready hooks).
129		381
130	If it is a callback, the it is called whenever the scheduler finds no	382	The default implementation dies with "FATAL: deadlock detected.", followed
131	ready coros to run. The default implementation prints "FATAL:	383	by a thread listing, because the program has no other way to continue.
132	deadlock detected" and exits, because the program has no other way to
133	continue.
134
135	If it is a coro object, then this object will be readied (without
136	invoking any ready hooks, however) when the scheduler finds no other ready
137	coros to run.
138		384
139	This hook is overwritten by modules such as C<Coro::EV> and	385	This hook is overwritten by modules such as C<Coro::EV> and
140	C<Coro::AnyEvent> to wait on an external event that hopefully wake up a	386	C<Coro::AnyEvent> to wait on an external event that hopefully wakes up a
141	coro so the scheduler can run it.	387	coro so the scheduler can run it.
142		388
143	Note that the callback I<must not>, under any circumstances, block
144	the current coro. Normally, this is achieved by having an "idle
145	coro" that calls the event loop and then blocks again, and then
146	readying that coro in the idle handler, or by simply placing the idle
147	coro in this variable.
148
149	See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this	389	See L<Coro::EV> or L<Coro::AnyEvent> for examples of using this technique.
150	technique.
151		390
152	Please note that if your callback recursively invokes perl (e.g. for event
153	handlers), then it must be prepared to be called recursively itself.
154
155	=cut	391	=cut
156		392
157	$idle = sub {	393	# \|\|= because other modules could have provided their own by now
158	require Carp;	394	$idle \|\|= new Coro sub {
159	Carp::croak ("FATAL: deadlock detected");	395	require Coro::Debug;
		396	die "FATAL: deadlock detected.\n"
		397	. Coro::Debug::ps_listing ();
160	};	398	};
161		399
162	# this coro is necessary because a coro	400	# this coro is necessary because a coro
163	# cannot destroy itself.	401	# cannot destroy itself.
164	our @destroy;	402	our @destroy;
165	our $manager;	403	our $manager;
166		404
167	$manager = new Coro sub {	405	$manager = new Coro sub {
168	while () {	406	while () {
169	Coro::State::cancel shift @destroy	407	_destroy shift @destroy
170	while @destroy;	408	while @destroy;
171		409
172	&schedule;	410	&schedule;
173	}	411	}
174	};	412	};
…		…
206	Example: Create a new coro that just prints its arguments.	444	Example: Create a new coro that just prints its arguments.
207		445
208	async {	446	async {
209	print "@_\n";	447	print "@_\n";
210	} 1,2,3,4;	448	} 1,2,3,4;
211
212	=cut
213
214	sub async(&@) {
215	my $coro = new Coro @_;
216	$coro->ready;
217	$coro
218	}
219		449
220	=item async_pool { ... } [@args...]	450	=item async_pool { ... } [@args...]
221		451
222	Similar to C<async>, but uses a coro pool, so you should not call	452	Similar to C<async>, but uses a coro pool, so you should not call
223	terminate or join on it (although you are allowed to), and you get a	453	terminate or join on it (although you are allowed to), and you get a
…		…
280	=item schedule	510	=item schedule
281		511
282	Calls the scheduler. The scheduler will find the next coro that is	512	Calls the scheduler. The scheduler will find the next coro that is
283	to be run from the ready queue and switches to it. The next coro	513	to be run from the ready queue and switches to it. The next coro
284	to be run is simply the one with the highest priority that is longest	514	to be run is simply the one with the highest priority that is longest
285	in its ready queue. If there is no coro ready, it will clal the	515	in its ready queue. If there is no coro ready, it will call the
286	C<$Coro::idle> hook.	516	C<$Coro::idle> hook.
287		517
288	Please note that the current coro will I<not> be put into the ready	518	Please note that the current coro will I<not> be put into the ready
289	queue, so calling this function usually means you will never be called	519	queue, so calling this function usually means you will never be called
290	again unless something else (e.g. an event handler) calls C<< ->ready >>,	520	again unless something else (e.g. an event handler) calls C<< ->ready >>,
…		…
316	coro, regardless of priority. This is useful sometimes to ensure	546	coro, regardless of priority. This is useful sometimes to ensure
317	progress is made.	547	progress is made.
318		548
319	=item terminate [arg...]	549	=item terminate [arg...]
320		550
321	Terminates the current coro with the given status values (see L<cancel>).	551	Terminates the current coro with the given status values (see
		552	L<cancel>). The values will not be copied, but referenced directly.
322		553
323	=item Coro::on_enter BLOCK, Coro::on_leave BLOCK	554	=item Coro::on_enter BLOCK, Coro::on_leave BLOCK
324		555
325	These function install enter and leave winders in the current scope. The	556	These function install enter and leave winders in the current scope. The
326	enter block will be executed when on_enter is called and whenever the	557	enter block will be executed when on_enter is called and whenever the
…		…
500	Returns true iff this Coro object has been suspended. Suspended Coros will	731	Returns true iff this Coro object has been suspended. Suspended Coros will
501	not ever be scheduled.	732	not ever be scheduled.
502		733
503	=item $coro->cancel (arg...)	734	=item $coro->cancel (arg...)
504		735
505	Terminates the given Coro and makes it return the given arguments as	736	Terminates the given Coro thread and makes it return the given arguments as
506	status (default: the empty list). Never returns if the Coro is the	737	status (default: an empty list). Never returns if the Coro is the
507	current Coro.	738	current Coro.
508		739
509	=cut	740	This is a rather brutal way to free a coro, with some limitations - if
		741	the thread is inside a C callback that doesn't expect to be canceled,
		742	bad things can happen, or if the cancelled thread insists on running
		743	complicated cleanup handlers that rely on it'S thread context, things will
		744	not work.
510		745
511	sub cancel {	746	Any cleanup code being run (e.g. from C<guard> blocks) will be run without
512	my $self = shift;	747	a thread context, and is not allowed to switch to other threads. On the
		748	plus side, C<< ->cancel >> will always clean up the thread, no matter
		749	what. If your cleanup code is complex or you want to avoid cancelling a
		750	C-thread that doesn't know how to clean up itself, it can be better to C<<
		751	->throw >> an exception, or use C<< ->safe_cancel >>.
513		752
514	if ($current == $self) {	753	The arguments to C<< ->cancel >> are not copied, but instead will
515	terminate @_;	754	be referenced directly (e.g. if you pass C<$var> and after the call
516	} else {	755	change that variable, then you might change the return values passed to
517	$self->{_status} = [@_];	756	e.g. C<join>, so don't do that).
518	Coro::State::cancel $self;	757
		758	The resources of the Coro are usually freed (or destructed) before this
		759	call returns, but this can be delayed for an indefinite amount of time, as
		760	in some cases the manager thread has to run first to actually destruct the
		761	Coro object.
		762
		763	=item $coro->safe_cancel ($arg...)
		764
		765	Works mostly like C<< ->cancel >>, but is inherently "safer", and
		766	consequently, can fail with an exception in cases the thread is not in a
		767	cancellable state.
		768
		769	This method works a bit like throwing an exception that cannot be caught
		770	- specifically, it will clean up the thread from within itself, so
		771	all cleanup handlers (e.g. C<guard> blocks) are run with full thread
		772	context and can block if they wish. The downside is that there is no
		773	guarantee that the thread can be cancelled when you call this method, and
		774	therefore, it might fail. It is also considerably slower than C<cancel> or
		775	C<terminate>.
		776
		777	A thread is in a safe-cancellable state if it either hasn't been run yet,
		778	or it has no C context attached and is inside an SLF function.
		779
		780	The latter two basically mean that the thread isn't currently inside a
		781	perl callback called from some C function (usually via some XS modules)
		782	and isn't currently executing inside some C function itself (via Coro's XS
		783	API).
		784
		785	This call returns true when it could cancel the thread, or croaks with an
		786	error otherwise (i.e. it either returns true or doesn't return at all).
		787
		788	Why the weird interface? Well, there are two common models on how and
		789	when to cancel things. In the first, you have the expectation that your
		790	coro thread can be cancelled when you want to cancel it - if the thread
		791	isn't cancellable, this would be a bug somewhere, so C<< ->safe_cancel >>
		792	croaks to notify of the bug.
		793
		794	In the second model you sometimes want to ask nicely to cancel a thread,
		795	but if it's not a good time, well, then don't cancel. This can be done
		796	relatively easy like this:
		797
		798	if (! eval { $coro->safe_cancel }) {
		799	warn "unable to cancel thread: $@";
519	}	800	}
520	}	801
		802	However, what you never should do is first try to cancel "safely" and
		803	if that fails, cancel the "hard" way with C<< ->cancel >>. That makes
		804	no sense: either you rely on being able to execute cleanup code in your
		805	thread context, or you don't. If you do, then C<< ->safe_cancel >> is the
		806	only way, and if you don't, then C<< ->cancel >> is always faster and more
		807	direct.
521		808
522	=item $coro->schedule_to	809	=item $coro->schedule_to
523		810
524	Puts the current coro to sleep (like C<Coro::schedule>), but instead	811	Puts the current coro to sleep (like C<Coro::schedule>), but instead
525	of continuing with the next coro from the ready queue, always switch to	812	of continuing with the next coro from the ready queue, always switch to
…		…
544	inside the coro at the next convenient point in time. Otherwise	831	inside the coro at the next convenient point in time. Otherwise
545	clears the exception object.	832	clears the exception object.
546		833
547	Coro will check for the exception each time a schedule-like-function	834	Coro will check for the exception each time a schedule-like-function
548	returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down	835	returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
549	>>, C<< Coro::Handle->readable >> and so on. Most of these functions	836	>>, C<< Coro::Handle->readable >> and so on. Most of those functions (all
550	detect this case and return early in case an exception is pending.	837	that are part of Coro itself) detect this case and return early in case an
		838	exception is pending.
551		839
552	The exception object will be thrown "as is" with the specified scalar in	840	The exception object will be thrown "as is" with the specified scalar in
553	C<$@>, i.e. if it is a string, no line number or newline will be appended	841	C<$@>, i.e. if it is a string, no line number or newline will be appended
554	(unlike with C<die>).	842	(unlike with C<die>).
555		843
556	This can be used as a softer means than C<cancel> to ask a coro to	844	This can be used as a softer means than either C<cancel> or C<safe_cancel
557	end itself, although there is no guarantee that the exception will lead to	845	>to ask a coro to end itself, although there is no guarantee that the
558	termination, and if the exception isn't caught it might well end the whole	846	exception will lead to termination, and if the exception isn't caught it
559	program.	847	might well end the whole program.
560		848
561	You might also think of C<throw> as being the moral equivalent of	849	You might also think of C<throw> as being the moral equivalent of
562	C<kill>ing a coro with a signal (in this case, a scalar).	850	C<kill>ing a coro with a signal (in this case, a scalar).
563		851
564	=item $coro->join	852	=item $coro->join
565		853
566	Wait until the coro terminates and return any values given to the	854	Wait until the coro terminates and return any values given to the
567	C<terminate> or C<cancel> functions. C<join> can be called concurrently	855	C<terminate> or C<cancel> functions. C<join> can be called concurrently
568	from multiple coro, and all will be resumed and given the status	856	from multiple threads, and all will be resumed and given the status
569	return once the C<$coro> terminates.	857	return once the C<$coro> terminates.
570		858
571	=cut	859	=cut
572		860
573	sub join {	861	sub xjoin {
574	my $self = shift;	862	my $self = shift;
575		863
576	unless ($self->{_status}) {	864	unless ($self->{_status}) {
577	my $current = $current;	865	my $current = $current;
578		866
…		…
582	};	870	};
583		871
584	&schedule while $current;	872	&schedule while $current;
585	}	873	}
586		874
587	wantarray ? @{$self->{_status}} : $self->{_status}[0];	875	wantarray ? @{$self->{_status}} : $self->{_status}[0]
588	}	876	}
589		877
590	=item $coro->on_destroy (\&cb)	878	=item $coro->on_destroy (\&cb)
591		879
592	Registers a callback that is called when this coro gets destroyed,	880	Registers a callback that is called when this coro thread gets destroyed,
593	but before it is joined. The callback gets passed the terminate arguments,	881	that is, after it's resources have been freed but before it is joined. The
		882	callback gets passed the terminate/cancel arguments, if any, and I<must
594	if any, and I<must not> die, under any circumstances.	883	not> die, under any circumstances.
595		884
596	=cut	885	There can be any number of C<on_destroy> callbacks per coro, and there is
		886	no way currently to remove a callback once added.
597		887
		888	=cut
		889
598	sub on_destroy {	890	sub xon_destroy {
599	my ($self, $cb) = @_;	891	my ($self, $cb) = @_;
600		892
601	push @{ $self->{_on_destroy} }, $cb;	893	push @{ $self->{_on_destroy} }, $cb;
602	}	894	}
603		895
604	=item $oldprio = $coro->prio ($newprio)	896	=item $oldprio = $coro->prio ($newprio)
605		897
606	Sets (or gets, if the argument is missing) the priority of the	898	Sets (or gets, if the argument is missing) the priority of the
607	coro. Higher priority coro get run before lower priority	899	coro thread. Higher priority coro get run before lower priority
608	coro. Priorities are small signed integers (currently -4 .. +3),	900	coros. Priorities are small signed integers (currently -4 .. +3),
609	that you can refer to using PRIO_xxx constants (use the import tag :prio	901	that you can refer to using PRIO_xxx constants (use the import tag :prio
610	to get then):	902	to get then):
611		903
612	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN	904	PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
613	3 > 1 > 0 > -1 > -3 > -4	905	3 > 1 > 0 > -1 > -3 > -4
614		906
615	# set priority to HIGH	907	# set priority to HIGH
616	current->prio (PRIO_HIGH);	908	current->prio (PRIO_HIGH);
617		909
618	The idle coro ($Coro::idle) always has a lower priority than any	910	The idle coro thread ($Coro::idle) always has a lower priority than any
619	existing coro.	911	existing coro.
620		912
621	Changing the priority of the current coro will take effect immediately,	913	Changing the priority of the current coro will take effect immediately,
622	but changing the priority of coro in the ready queue (but not	914	but changing the priority of a coro in the ready queue (but not running)
623	running) will only take effect after the next schedule (of that	915	will only take effect after the next schedule (of that coro). This is a
624	coro). This is a bug that will be fixed in some future version.	916	bug that will be fixed in some future version.
625		917
626	=item $newprio = $coro->nice ($change)	918	=item $newprio = $coro->nice ($change)
627		919
628	Similar to C<prio>, but subtract the given value from the priority (i.e.	920	Similar to C<prio>, but subtract the given value from the priority (i.e.
629	higher values mean lower priority, just as in unix).	921	higher values mean lower priority, just as in UNIX's nice command).
630		922
631	=item $olddesc = $coro->desc ($newdesc)	923	=item $olddesc = $coro->desc ($newdesc)
632		924
633	Sets (or gets in case the argument is missing) the description for this	925	Sets (or gets in case the argument is missing) the description for this
634	coro. This is just a free-form string you can associate with a	926	coro thread. This is just a free-form string you can associate with a
635	coro.	927	coro.
636		928
637	This method simply sets the C<< $coro->{desc} >> member to the given	929	This method simply sets the C<< $coro->{desc} >> member to the given
638	string. You can modify this member directly if you wish.	930	string. You can modify this member directly if you wish, and in fact, this
		931	is often preferred to indicate major processing states that cna then be
		932	seen for example in a L<Coro::Debug> session:
		933
		934	sub my_long_function {
		935	local $Coro::current->{desc} = "now in my_long_function";
		936	...
		937	$Coro::current->{desc} = "my_long_function: phase 1";
		938	...
		939	$Coro::current->{desc} = "my_long_function: phase 2";
		940	...
		941	}
639		942
640	=cut	943	=cut
641		944
642	sub desc {	945	sub desc {
643	my $old = $_[0]{desc};	946	my $old = $_[0]{desc};
…		…
680	returning a new coderef. Unblocking means that calling the new coderef	983	returning a new coderef. Unblocking means that calling the new coderef
681	will return immediately without blocking, returning nothing, while the	984	will return immediately without blocking, returning nothing, while the
682	original code ref will be called (with parameters) from within another	985	original code ref will be called (with parameters) from within another
683	coro.	986	coro.
684		987
685	The reason this function exists is that many event libraries (such as the	988	The reason this function exists is that many event libraries (such as
686	venerable L<Event\|Event> module) are not thread-safe (a weaker form	989	the venerable L<Event\|Event> module) are not thread-safe (a weaker form
687	of reentrancy). This means you must not block within event callbacks,	990	of reentrancy). This means you must not block within event callbacks,
688	otherwise you might suffer from crashes or worse. The only event library	991	otherwise you might suffer from crashes or worse. The only event library
689	currently known that is safe to use without C<unblock_sub> is L<EV>.	992	currently known that is safe to use without C<unblock_sub> is L<EV> (but
		993	you might still run into deadlocks if all event loops are blocked).
		994
		995	Coro will try to catch you when you block in the event loop
		996	("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
		997	only works when you do not run your own event loop.
690		998
691	This function allows your callbacks to block by executing them in another	999	This function allows your callbacks to block by executing them in another
692	coro where it is safe to block. One example where blocking is handy	1000	coro where it is safe to block. One example where blocking is handy
693	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to	1001	is when you use the L<Coro::AIO\|Coro::AIO> functions to save results to
694	disk, for example.	1002	disk, for example.
…		…
736	unshift @unblock_queue, [$cb, @_];	1044	unshift @unblock_queue, [$cb, @_];
737	$unblock_scheduler->ready;	1045	$unblock_scheduler->ready;
738	}	1046	}
739	}	1047	}
740		1048
741	=item $cb = Coro::rouse_cb	1049	=item $cb = rouse_cb
742		1050
743	Create and return a "rouse callback". That's a code reference that,	1051	Create and return a "rouse callback". That's a code reference that,
744	when called, will remember a copy of its arguments and notify the owner	1052	when called, will remember a copy of its arguments and notify the owner
745	coro of the callback.	1053	coro of the callback.
746		1054
747	See the next function.	1055	See the next function.
748		1056
749	=item @args = Coro::rouse_wait [$cb]	1057	=item @args = rouse_wait [$cb]
750		1058
751	Wait for the specified rouse callback (or the last one that was created in	1059	Wait for the specified rouse callback (or the last one that was created in
752	this coro).	1060	this coro).
753		1061
754	As soon as the callback is invoked (or when the callback was invoked	1062	As soon as the callback is invoked (or when the callback was invoked
755	before C<rouse_wait>), it will return the arguments originally passed to	1063	before C<rouse_wait>), it will return the arguments originally passed to
756	the rouse callback.	1064	the rouse callback. In scalar context, that means you get the I<last>
		1065	argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
		1066	statement at the end.
757		1067
758	See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.	1068	See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
759		1069
760	=back	1070	=back
761		1071
762	=cut	1072	=cut
		1073
		1074	for my $module (qw(Channel RWLock Semaphore SemaphoreSet Signal Specific)) {
		1075	my $old = defined &{"Coro::$module\::new"} && \&{"Coro::$module\::new"};
		1076
		1077	*{"Coro::$module\::new"} = sub {
		1078	require "Coro/$module.pm";
		1079
		1080	# some modules have their new predefined in State.xs, some don't
		1081	*{"Coro::$module\::new"} = $old
		1082	if $old;
		1083
		1084	goto &{"Coro::$module\::new"};
		1085	};
		1086	}
763		1087
764	1;	1088	1;
765		1089
766	=head1 HOW TO WAIT FOR A CALLBACK	1090	=head1 HOW TO WAIT FOR A CALLBACK
767		1091
…		…
847	future to allow per-thread schedulers, but Coro::State does not yet allow	1171	future to allow per-thread schedulers, but Coro::State does not yet allow
848	this). I recommend disabling thread support and using processes, as having	1172	this). I recommend disabling thread support and using processes, as having
849	the windows process emulation enabled under unix roughly halves perl	1173	the windows process emulation enabled under unix roughly halves perl
850	performance, even when not used.	1174	performance, even when not used.
851		1175
		1176	Attempts to use threads created in another emulated process will crash
		1177	("cleanly", with a null pointer exception).
		1178
852	=item coro switching is not signal safe	1179	=item coro switching is not signal safe
853		1180
854	You must not switch to another coro from within a signal handler	1181	You must not switch to another coro from within a signal handler (only
855	(only relevant with %SIG - most event libraries provide safe signals).	1182	relevant with %SIG - most event libraries provide safe signals), I<unless>
		1183	you are sure you are not interrupting a Coro function.
856		1184
857	That means you I<MUST NOT> call any function that might "block" the	1185	That means you I<MUST NOT> call any function that might "block" the
858	current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or	1186	current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
859	anything that calls those. Everything else, including calling C<ready>,	1187	anything that calls those. Everything else, including calling C<ready>,
860	works.	1188	works.
861		1189
862	=back	1190	=back
863		1191
864		1192
		1193	=head1 WINDOWS PROCESS EMULATION
		1194
		1195	A great many people seem to be confused about ithreads (for example, Chip
		1196	Salzenberg called me unintelligent, incapable, stupid and gullible,
		1197	while in the same mail making rather confused statements about perl
		1198	ithreads (for example, that memory or files would be shared), showing his
		1199	lack of understanding of this area - if it is hard to understand for Chip,
		1200	it is probably not obvious to everybody).
		1201
		1202	What follows is an ultra-condensed version of my talk about threads in
		1203	scripting languages given on the perl workshop 2009:
		1204
		1205	The so-called "ithreads" were originally implemented for two reasons:
		1206	first, to (badly) emulate unix processes on native win32 perls, and
		1207	secondly, to replace the older, real thread model ("5.005-threads").
		1208
		1209	It does that by using threads instead of OS processes. The difference
		1210	between processes and threads is that threads share memory (and other
		1211	state, such as files) between threads within a single process, while
		1212	processes do not share anything (at least not semantically). That
		1213	means that modifications done by one thread are seen by others, while
		1214	modifications by one process are not seen by other processes.
		1215
		1216	The "ithreads" work exactly like that: when creating a new ithreads
		1217	process, all state is copied (memory is copied physically, files and code
		1218	is copied logically). Afterwards, it isolates all modifications. On UNIX,
		1219	the same behaviour can be achieved by using operating system processes,
		1220	except that UNIX typically uses hardware built into the system to do this
		1221	efficiently, while the windows process emulation emulates this hardware in
		1222	software (rather efficiently, but of course it is still much slower than
		1223	dedicated hardware).
		1224
		1225	As mentioned before, loading code, modifying code, modifying data
		1226	structures and so on is only visible in the ithreads process doing the
		1227	modification, not in other ithread processes within the same OS process.
		1228
		1229	This is why "ithreads" do not implement threads for perl at all, only
		1230	processes. What makes it so bad is that on non-windows platforms, you can
		1231	actually take advantage of custom hardware for this purpose (as evidenced
		1232	by the forks module, which gives you the (i-) threads API, just much
		1233	faster).
		1234
		1235	Sharing data is in the i-threads model is done by transfering data
		1236	structures between threads using copying semantics, which is very slow -
		1237	shared data simply does not exist. Benchmarks using i-threads which are
		1238	communication-intensive show extremely bad behaviour with i-threads (in
		1239	fact, so bad that Coro, which cannot take direct advantage of multiple
		1240	CPUs, is often orders of magnitude faster because it shares data using
		1241	real threads, refer to my talk for details).
		1242
		1243	As summary, i-threads use threads to implement processes, while
		1244	the compatible forks module uses processes to emulate, uhm,
		1245	processes. I-threads slow down every perl program when enabled, and
		1246	outside of windows, serve no (or little) practical purpose, but
		1247	disadvantages every single-threaded Perl program.
		1248
		1249	This is the reason that I try to avoid the name "ithreads", as it is
		1250	misleading as it implies that it implements some kind of thread model for
		1251	perl, and prefer the name "windows process emulation", which describes the
		1252	actual use and behaviour of it much better.
		1253
865	=head1 SEE ALSO	1254	=head1 SEE ALSO
866		1255
867	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.	1256	Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
868		1257
869	Debugging: L<Coro::Debug>.	1258	Debugging: L<Coro::Debug>.

Diff Legend

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

Comparing Coro/Coro.pm (file contents): Revision 1.256 by root, Wed Jun 17 21:38:23 2009 UTC vs. Revision 1.296 by root, Thu May 12 23:24:28 2011 UTC

Diff Legend

Comparing Coro/Coro.pm (file contents):
Revision 1.256 by root, Wed Jun 17 21:38:23 2009 UTC vs.
Revision 1.296 by root, Thu May 12 23:24:28 2011 UTC