ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro.pm
(Generate patch)

Comparing Coro/Coro.pm (file contents):
Revision 1.234 by root, Fri Nov 21 06:52:10 2008 UTC vs.
Revision 1.287 by root, Sat Feb 19 06:51:22 2011 UTC

1=head1 NAME 1=head1 NAME
2 2
3Coro - the real perl threads 3Coro - the only real threads in perl
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use Coro; 7 use Coro;
8 8
11 print "2\n"; 11 print "2\n";
12 cede; # yield back to main 12 cede; # yield back to main
13 print "4\n"; 13 print "4\n";
14 }; 14 };
15 print "1\n"; 15 print "1\n";
16 cede; # yield to coroutine 16 cede; # yield to coro
17 print "3\n"; 17 print "3\n";
18 cede; # and again 18 cede; # and again
19 19
20 # use locking 20 # use locking
21 use Coro::Semaphore; 21 use Coro::Semaphore;
26 $locked = 1; 26 $locked = 1;
27 $lock->up; 27 $lock->up;
28 28
29=head1 DESCRIPTION 29=head1 DESCRIPTION
30 30
31This module collection manages coroutines, that is, cooperative 31For a tutorial-style introduction, please read the L<Coro::Intro>
32threads. Coroutines are similar to kernel threads but don't (in general) 32manpage. This manpage mainly contains reference information.
33
34This module collection manages continuations in general, most often in
35the form of cooperative threads (also called coros, or simply "coro"
36in the documentation). They are similar to kernel threads but don't (in
33run in parallel at the same time even on SMP machines. The specific flavor 37general) run in parallel at the same time even on SMP machines. The
34of coroutine used in this module also guarantees you that it will not 38specific flavor of thread offered by this module also guarantees you that
35switch between coroutines unless necessary, at easily-identified points 39it will not switch between threads unless necessary, at easily-identified
36in your program, so locking and parallel access are rarely an issue, 40points in your program, so locking and parallel access are rarely an
37making coroutine programming much safer and easier than using other thread 41issue, making thread programming much safer and easier than using other
38models. 42thread models.
39 43
40Unlike the so-called "Perl threads" (which are not actually real threads 44Unlike the so-called "Perl threads" (which are not actually real threads
41but only the windows process emulation ported to unix), Coro provides a 45but only the windows process emulation (see section of same name for
46more details) ported to UNIX, and as such act as processes), Coro
42full shared address space, which makes communication between coroutines 47provides a full shared address space, which makes communication between
43very easy. And coroutines are fast, too: disabling the Windows process 48threads very easy. And coro threads are fast, too: disabling the Windows
44emulation code in your perl and using Coro can easily result in a two to 49process emulation code in your perl and using Coro can easily result in
45four times speed increase for your programs. 50a two to four times speed increase for your programs. A parallel matrix
51multiplication benchmark (very communication-intensive) runs over 300
52times faster on a single core than perls pseudo-threads on a quad core
53using all four cores.
46 54
47Coro achieves that by supporting multiple running interpreters that share 55Coro achieves that by supporting multiple running interpreters that share
48data, which is especially useful to code pseudo-parallel processes and 56data, which is especially useful to code pseudo-parallel processes and
49for event-based programming, such as multiple HTTP-GET requests running 57for event-based programming, such as multiple HTTP-GET requests running
50concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro 58concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
51into an event-based environment. 59into an event-based environment.
52 60
53In this module, a coroutines is defined as "callchain + lexical variables 61In this module, a thread is defined as "callchain + lexical variables +
54+ @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own 62some package variables + C stack), that is, a thread has its own callchain,
55callchain, its own set of lexicals and its own set of perls most important 63its own set of lexicals and its own set of perls most important global
56global variables (see L<Coro::State> for more configuration and background 64variables (see L<Coro::State> for more configuration and background info).
57info).
58 65
59See also the C<SEE ALSO> section at the end of this document - the Coro 66See also the C<SEE ALSO> section at the end of this document - the Coro
60module family is quite large. 67module family is quite large.
61 68
69=head1 CORO THREAD LIFE CYCLE
70
71During the long and exciting (or not) life of a coro thread, it goes
72through a number of states:
73
74=over 4
75
76=item 1. Creation
77
78The first thing in the life of a coro thread is it's creation -
79obviously. The typical way to create a thread is to call the C<async
80BLOCK> function:
81
82 async {
83 # thread code goes here
84 };
85
86You can also pass arguments, which are put in C<@_>:
87
88 async {
89 print $_[1]; # prints 2
90 } 1, 2, 3;
91
92This creates a new coro thread and puts it into the ready queue, meaning
93it will run as soon as the CPU is free for it.
94
95C<async> will return a coro object - you can store this for future
96reference or ignore it, the thread itself will keep a reference to it's
97thread object - threads are alive on their own.
98
99Another way to create a thread is to call the C<new> constructor with a
100code-reference:
101
102 new Coro sub {
103 # thread code goes here
104 }, @optional_arguments;
105
106This is quite similar to calling C<async>, but the important difference is
107that the new thread is not put into the ready queue, so the thread will
108not run until somebody puts it there. C<async> is, therefore, identical to
109this 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
119When a new coro thread is created, only a copy of the code reference
120and the arguments are stored, no extra memory for stacks and so on is
121allocated, keeping the coro thread in a low-memory state.
122
123Only when it actually starts executing will all the resources be finally
124allocated.
125
126The optional arguments specified at coro creation are available in C<@_>,
127similar to function calls.
128
129=item 3. Running / Blocking
130
131A lot can happen after the coro thread has started running. Quite usually,
132it will not run to the end in one go (because you could use a function
133instead), but it will give up the CPU regularly because it waits for
134external events.
135
136As long as a coro thread runs, it's coro object is available in the global
137variable C<$Coro::current>.
138
139The low-level way to give up the CPU is to call the scheduler, which
140selects a new coro thread to run:
141
142 Coro::schedule;
143
144Since running threads are not in the ready queue, calling the scheduler
145without doing anything else will block the coro thread forever - you need
146to arrange either for the coro to put woken up (readied) by some other
147event or some other thread, or you can put it into the ready queue before
148scheduling:
149
150 # this is exactly what Coro::cede does
151 $Coro::current->ready;
152 Coro::schedule;
153
154All the higher-level synchronisation methods (Coro::Semaphore,
155Coro::rouse_*...) are actually implemented via C<< ->ready >> and C<<
156Coro::schedule >>.
157
158While the coro thread is running it also might get assigned a C-level
159thread, or the C-level thread might be unassigned from it, as the Coro
160runtime wishes. A C-level thread needs to be assigned when your perl
161thread calls into some C-level function and that function in turn calls
162perl and perl then wants to switch coroutines. This happens most often
163when you run an event loop and block in the callback, or when perl
164itself calls some function such as C<AUTOLOAD> or methods via the C<tie>
165mechanism.
166
167=item 4. Termination
168
169Many threads actually terminate after some time. There are a number of
170ways to terminate a coro thread, the simplest is returning from the
171top-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
183Any 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
194Another way to terminate is to call C<< Coro::terminate >>, which at any
195subroutine call nesting level:
196
197 async {
198 Coro::terminate "return value 1", "return value 2";
199 };
200
201And yet another way is to C<< ->cancel >> the coro thread from another
202thread:
203
204 my $coro = async {
205 exit 1;
206 };
207
208 $coro->cancel; # an also accept values for ->join to retrieve
209
210Cancellation I<can> be dangerous - it's a bit like calling C<exit> without
211actually exiting, and might leave C libraries and XS modules in a weird
212state. Unlike other thread implementations, however, Coro is exceptionally
213safe with regards to cancellation, as perl will always be in a consistent
214state.
215
216So, cancelling a thread that runs in an XS event loop might not be the
217best idea, but any other combination that deals with perl only (cancelling
218when a thread is in a C<tie> method or an C<AUTOLOAD> for example) is
219safe.
220
221=item 5. Cleanup
222
223Threads will allocate various resources. Most but not all will be returned
224when a thread terminates, during clean-up.
225
226Cleanup is quite similar to throwing an uncaught exception: perl will
227work it's way up through all subroutine calls and blocks. On it's way, it
228will release all C<my> variables, undo all C<local>'s and free any other
229resources truly local to the thread.
230
231So, a common way to free resources is to keep them referenced only by my
232variables:
233
234 async {
235 my $big_cache = new Cache ...;
236 };
237
238If there are no other references, then the C<$big_cache> object will be
239freed when the thread terminates, regardless of how it does so.
240
241What it does C<NOT> do is unlock any Coro::Semaphores or similar
242resources, but that's where the C<guard> methods come in handy:
243
244 my $sem = new Coro::Semaphore;
245
246 async {
247 my $lock_guard = $sem->guard;
248 # if we reutrn, or die or get cancelled, here,
249 # then the semaphore will be "up"ed.
250 };
251
252The C<Guard::guard> function comes in handy for any custom cleanup you
253might want to do:
254
255 async {
256 my $window = new Gtk2::Window "toplevel";
257 # The window will not be cleaned up automatically, even when $window
258 # gets freed, so use a guard to ensure it's destruction
259 # in case of an error:
260 my $window_guard = Guard::guard { $window->destroy };
261
262 # we are safe here
263 };
264
265Last not least, C<local> can often be handy, too, e.g. when temporarily
266replacing the coro thread description:
267
268 sub myfunction {
269 local $Coro::current->{desc} = "inside myfunction(@_)";
270
271 # if we return or die here, the description will be restored
272 }
273
274=item 6. Viva La Zombie Muerte
275
276Even after a thread has terminated and cleaned up it's resources, the coro
277object still is there and stores the return values of the thread. Only in
278this state will the coro object be "reference counted" in the normal perl
279sense: the thread code keeps a reference to it when it is active, but not
280after it has terminated.
281
282The means the coro object gets freed automatically when the thread has
283terminated and cleaned up and there arenot other references.
284
285If there are, the coro object will stay around, and you can call C<<
286->join >> as many times as you wish to retrieve the result values:
287
288 async {
289 print "hi\n";
290 1
291 };
292
293 # run the async above, and free everything before returning
294 # from Coro::cede:
295 Coro::cede;
296
297 {
298 my $coro = async {
299 print "hi\n";
300 1
301 };
302
303 # run the async above, and clean up, but do not free the coro
304 # object:
305 Coro::cede;
306
307 # optionally retrieve the result values
308 my @results = $coro->join;
309
310 # now $coro goes out of scope, and presumably gets freed
311 };
312
313=back
314
62=cut 315=cut
63 316
64package Coro; 317package Coro;
65 318
66use strict qw(vars subs); 319use common::sense;
67no warnings "uninitialized"; 320
321use Carp ();
322
323use Guard ();
68 324
69use Coro::State; 325use Coro::State;
70 326
71use base qw(Coro::State Exporter); 327use base qw(Coro::State Exporter);
72 328
73our $idle; # idle handler 329our $idle; # idle handler
74our $main; # main coroutine 330our $main; # main coro
75our $current; # current coroutine 331our $current; # current coro
76 332
77our $VERSION = "5.0"; 333our $VERSION = 5.37;
78 334
79our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 335our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub rouse_cb rouse_wait);
80our %EXPORT_TAGS = ( 336our %EXPORT_TAGS = (
81 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 337 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
82); 338);
83our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 339our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
84 340
86 342
87=over 4 343=over 4
88 344
89=item $Coro::main 345=item $Coro::main
90 346
91This variable stores the coroutine object that represents the main 347This variable stores the Coro object that represents the main
92program. While you cna C<ready> it and do most other things you can do to 348program. While you cna C<ready> it and do most other things you can do to
93coroutines, it is mainly useful to compare again C<$Coro::current>, to see 349coro, it is mainly useful to compare again C<$Coro::current>, to see
94whether you are running in the main program or not. 350whether you are running in the main program or not.
95 351
96=cut 352=cut
97 353
98# $main is now being initialised by Coro::State 354# $main is now being initialised by Coro::State
99 355
100=item $Coro::current 356=item $Coro::current
101 357
102The coroutine object representing the current coroutine (the last 358The Coro object representing the current coro (the last
103coroutine that the Coro scheduler switched to). The initial value is 359coro that the Coro scheduler switched to). The initial value is
104C<$Coro::main> (of course). 360C<$Coro::main> (of course).
105 361
106This variable is B<strictly> I<read-only>. You can take copies of the 362This variable is B<strictly> I<read-only>. You can take copies of the
107value stored in it and use it as any other coroutine object, but you must 363value stored in it and use it as any other Coro object, but you must
108not otherwise modify the variable itself. 364not otherwise modify the variable itself.
109 365
110=cut 366=cut
111 367
112sub current() { $current } # [DEPRECATED] 368sub current() { $current } # [DEPRECATED]
113 369
114=item $Coro::idle 370=item $Coro::idle
115 371
116This variable is mainly useful to integrate Coro into event loops. It is 372This variable is mainly useful to integrate Coro into event loops. It is
117usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is 373usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
118pretty low-level functionality. 374pretty low-level functionality.
119 375
120This variable stores a callback that is called whenever the scheduler 376This variable stores a Coro object that is put into the ready queue when
121finds no ready coroutines to run. The default implementation prints 377there are no other ready threads (without invoking any ready hooks).
122"FATAL: deadlock detected" and exits, because the program has no other way
123to continue.
124 378
379The default implementation dies with "FATAL: deadlock detected.", followed
380by a thread listing, because the program has no other way to continue.
381
125This hook is overwritten by modules such as C<Coro::Timer> and 382This hook is overwritten by modules such as C<Coro::EV> and
126C<Coro::AnyEvent> to wait on an external event that hopefully wake up a 383C<Coro::AnyEvent> to wait on an external event that hopefully wakes up a
127coroutine so the scheduler can run it. 384coro so the scheduler can run it.
128 385
129Note that the callback I<must not>, under any circumstances, block
130the current coroutine. Normally, this is achieved by having an "idle
131coroutine" that calls the event loop and then blocks again, and then
132readying that coroutine in the idle handler.
133
134See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this 386See L<Coro::EV> or L<Coro::AnyEvent> for examples of using this technique.
135technique.
136 387
137Please note that if your callback recursively invokes perl (e.g. for event
138handlers), then it must be prepared to be called recursively itself.
139
140=cut 388=cut
141 389
142$idle = sub { 390# ||= because other modules could have provided their own by now
143 require Carp; 391$idle ||= new Coro sub {
144 Carp::croak ("FATAL: deadlock detected"); 392 require Coro::Debug;
393 die "FATAL: deadlock detected.\n"
394 . Coro::Debug::ps_listing ();
145}; 395};
146 396
147# this coroutine is necessary because a coroutine 397# this coro is necessary because a coro
148# cannot destroy itself. 398# cannot destroy itself.
149our @destroy; 399our @destroy;
150our $manager; 400our $manager;
151 401
152$manager = new Coro sub { 402$manager = new Coro sub {
153 while () { 403 while () {
154 Coro::_cancel shift @destroy 404 Coro::State::cancel shift @destroy
155 while @destroy; 405 while @destroy;
156 406
157 &schedule; 407 &schedule;
158 } 408 }
159}; 409};
160$manager->{desc} = "[coro manager]"; 410$manager->{desc} = "[coro manager]";
161$manager->prio (PRIO_MAX); 411$manager->prio (PRIO_MAX);
162 412
163=back 413=back
164 414
165=head1 SIMPLE COROUTINE CREATION 415=head1 SIMPLE CORO CREATION
166 416
167=over 4 417=over 4
168 418
169=item async { ... } [@args...] 419=item async { ... } [@args...]
170 420
171Create a new coroutine and return it's coroutine object (usually 421Create a new coro and return its Coro object (usually
172unused). The coroutine will be put into the ready queue, so 422unused). The coro will be put into the ready queue, so
173it will start running automatically on the next scheduler run. 423it will start running automatically on the next scheduler run.
174 424
175The first argument is a codeblock/closure that should be executed in the 425The first argument is a codeblock/closure that should be executed in the
176coroutine. When it returns argument returns the coroutine is automatically 426coro. When it returns argument returns the coro is automatically
177terminated. 427terminated.
178 428
179The remaining arguments are passed as arguments to the closure. 429The remaining arguments are passed as arguments to the closure.
180 430
181See the C<Coro::State::new> constructor for info about the coroutine 431See the C<Coro::State::new> constructor for info about the coro
182environment in which coroutines are executed. 432environment in which coro are executed.
183 433
184Calling C<exit> in a coroutine will do the same as calling exit outside 434Calling C<exit> in a coro will do the same as calling exit outside
185the coroutine. Likewise, when the coroutine dies, the program will exit, 435the coro. Likewise, when the coro dies, the program will exit,
186just as it would in the main program. 436just as it would in the main program.
187 437
188If you do not want that, you can provide a default C<die> handler, or 438If you do not want that, you can provide a default C<die> handler, or
189simply avoid dieing (by use of C<eval>). 439simply avoid dieing (by use of C<eval>).
190 440
191Example: Create a new coroutine that just prints its arguments. 441Example: Create a new coro that just prints its arguments.
192 442
193 async { 443 async {
194 print "@_\n"; 444 print "@_\n";
195 } 1,2,3,4; 445 } 1,2,3,4;
196 446
197=cut
198
199sub async(&@) {
200 my $coro = new Coro @_;
201 $coro->ready;
202 $coro
203}
204
205=item async_pool { ... } [@args...] 447=item async_pool { ... } [@args...]
206 448
207Similar to C<async>, but uses a coroutine pool, so you should not call 449Similar to C<async>, but uses a coro pool, so you should not call
208terminate or join on it (although you are allowed to), and you get a 450terminate or join on it (although you are allowed to), and you get a
209coroutine that might have executed other code already (which can be good 451coro that might have executed other code already (which can be good
210or bad :). 452or bad :).
211 453
212On the plus side, this function is about twice as fast as creating (and 454On the plus side, this function is about twice as fast as creating (and
213destroying) a completely new coroutine, so if you need a lot of generic 455destroying) a completely new coro, so if you need a lot of generic
214coroutines in quick successsion, use C<async_pool>, not C<async>. 456coros in quick successsion, use C<async_pool>, not C<async>.
215 457
216The code block is executed in an C<eval> context and a warning will be 458The code block is executed in an C<eval> context and a warning will be
217issued in case of an exception instead of terminating the program, as 459issued in case of an exception instead of terminating the program, as
218C<async> does. As the coroutine is being reused, stuff like C<on_destroy> 460C<async> does. As the coro is being reused, stuff like C<on_destroy>
219will not work in the expected way, unless you call terminate or cancel, 461will not work in the expected way, unless you call terminate or cancel,
220which somehow defeats the purpose of pooling (but is fine in the 462which somehow defeats the purpose of pooling (but is fine in the
221exceptional case). 463exceptional case).
222 464
223The priority will be reset to C<0> after each run, tracing will be 465The priority will be reset to C<0> after each run, tracing will be
224disabled, the description will be reset and the default output filehandle 466disabled, the description will be reset and the default output filehandle
225gets restored, so you can change all these. Otherwise the coroutine will 467gets restored, so you can change all these. Otherwise the coro will
226be re-used "as-is": most notably if you change other per-coroutine global 468be re-used "as-is": most notably if you change other per-coro global
227stuff such as C<$/> you I<must needs> revert that change, which is most 469stuff such as C<$/> you I<must needs> revert that change, which is most
228simply done by using local as in: C<< local $/ >>. 470simply done by using local as in: C<< local $/ >>.
229 471
230The idle pool size is limited to C<8> idle coroutines (this can be 472The idle pool size is limited to C<8> idle coros (this can be
231adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle 473adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
232coros as required. 474coros as required.
233 475
234If you are concerned about pooled coroutines growing a lot because a 476If you are concerned about pooled coros growing a lot because a
235single C<async_pool> used a lot of stackspace you can e.g. C<async_pool 477single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
236{ terminate }> once per second or so to slowly replenish the pool. In 478{ terminate }> once per second or so to slowly replenish the pool. In
237addition to that, when the stacks used by a handler grows larger than 32kb 479addition to that, when the stacks used by a handler grows larger than 32kb
238(adjustable via $Coro::POOL_RSS) it will also be destroyed. 480(adjustable via $Coro::POOL_RSS) it will also be destroyed.
239 481
256=back 498=back
257 499
258=head1 STATIC METHODS 500=head1 STATIC METHODS
259 501
260Static methods are actually functions that implicitly operate on the 502Static methods are actually functions that implicitly operate on the
261current coroutine. 503current coro.
262 504
263=over 4 505=over 4
264 506
265=item schedule 507=item schedule
266 508
267Calls the scheduler. The scheduler will find the next coroutine that is 509Calls the scheduler. The scheduler will find the next coro that is
268to be run from the ready queue and switches to it. The next coroutine 510to be run from the ready queue and switches to it. The next coro
269to be run is simply the one with the highest priority that is longest 511to be run is simply the one with the highest priority that is longest
270in its ready queue. If there is no coroutine ready, it will clal the 512in its ready queue. If there is no coro ready, it will call the
271C<$Coro::idle> hook. 513C<$Coro::idle> hook.
272 514
273Please note that the current coroutine will I<not> be put into the ready 515Please note that the current coro will I<not> be put into the ready
274queue, so calling this function usually means you will never be called 516queue, so calling this function usually means you will never be called
275again unless something else (e.g. an event handler) calls C<< ->ready >>, 517again unless something else (e.g. an event handler) calls C<< ->ready >>,
276thus waking you up. 518thus waking you up.
277 519
278This makes C<schedule> I<the> generic method to use to block the current 520This makes C<schedule> I<the> generic method to use to block the current
279coroutine and wait for events: first you remember the current coroutine in 521coro and wait for events: first you remember the current coro in
280a variable, then arrange for some callback of yours to call C<< ->ready 522a variable, then arrange for some callback of yours to call C<< ->ready
281>> on that once some event happens, and last you call C<schedule> to put 523>> on that once some event happens, and last you call C<schedule> to put
282yourself to sleep. Note that a lot of things can wake your coroutine up, 524yourself to sleep. Note that a lot of things can wake your coro up,
283so you need to check whether the event indeed happened, e.g. by storing the 525so you need to check whether the event indeed happened, e.g. by storing the
284status in a variable. 526status in a variable.
285 527
286See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks. 528See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
287 529
288=item cede 530=item cede
289 531
290"Cede" to other coroutines. This function puts the current coroutine into 532"Cede" to other coros. This function puts the current coro into
291the ready queue and calls C<schedule>, which has the effect of giving 533the ready queue and calls C<schedule>, which has the effect of giving
292up the current "timeslice" to other coroutines of the same or higher 534up the current "timeslice" to other coros of the same or higher
293priority. Once your coroutine gets its turn again it will automatically be 535priority. Once your coro gets its turn again it will automatically be
294resumed. 536resumed.
295 537
296This function is often called C<yield> in other languages. 538This function is often called C<yield> in other languages.
297 539
298=item Coro::cede_notself 540=item Coro::cede_notself
299 541
300Works like cede, but is not exported by default and will cede to I<any> 542Works like cede, but is not exported by default and will cede to I<any>
301coroutine, regardless of priority. This is useful sometimes to ensure 543coro, regardless of priority. This is useful sometimes to ensure
302progress is made. 544progress is made.
303 545
304=item terminate [arg...] 546=item terminate [arg...]
305 547
306Terminates the current coroutine with the given status values (see L<cancel>). 548Terminates the current coro with the given status values (see L<cancel>).
549
550=item Coro::on_enter BLOCK, Coro::on_leave BLOCK
551
552These function install enter and leave winders in the current scope. The
553enter block will be executed when on_enter is called and whenever the
554current coro is re-entered by the scheduler, while the leave block is
555executed whenever the current coro is blocked by the scheduler, and
556also when the containing scope is exited (by whatever means, be it exit,
557die, last etc.).
558
559I<Neither invoking the scheduler, nor exceptions, are allowed within those
560BLOCKs>. That means: do not even think about calling C<die> without an
561eval, and do not even think of entering the scheduler in any way.
562
563Since both BLOCKs are tied to the current scope, they will automatically
564be removed when the current scope exits.
565
566These functions implement the same concept as C<dynamic-wind> in scheme
567does, and are useful when you want to localise some resource to a specific
568coro.
569
570They slow down thread switching considerably for coros that use them
571(about 40% for a BLOCK with a single assignment, so thread switching is
572still reasonably fast if the handlers are fast).
573
574These functions are best understood by an example: The following function
575will change the current timezone to "Antarctica/South_Pole", which
576requires a call to C<tzset>, but by using C<on_enter> and C<on_leave>,
577which remember/change the current timezone and restore the previous
578value, respectively, the timezone is only changed for the coro that
579installed those handlers.
580
581 use POSIX qw(tzset);
582
583 async {
584 my $old_tz; # store outside TZ value here
585
586 Coro::on_enter {
587 $old_tz = $ENV{TZ}; # remember the old value
588
589 $ENV{TZ} = "Antarctica/South_Pole";
590 tzset; # enable new value
591 };
592
593 Coro::on_leave {
594 $ENV{TZ} = $old_tz;
595 tzset; # restore old value
596 };
597
598 # at this place, the timezone is Antarctica/South_Pole,
599 # without disturbing the TZ of any other coro.
600 };
601
602This can be used to localise about any resource (locale, uid, current
603working directory etc.) to a block, despite the existance of other
604coros.
605
606Another interesting example implements time-sliced multitasking using
607interval timers (this could obviously be optimised, but does the job):
608
609 # "timeslice" the given block
610 sub timeslice(&) {
611 use Time::HiRes ();
612
613 Coro::on_enter {
614 # on entering the thread, we set an VTALRM handler to cede
615 $SIG{VTALRM} = sub { cede };
616 # and then start the interval timer
617 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0.01, 0.01;
618 };
619 Coro::on_leave {
620 # on leaving the thread, we stop the interval timer again
621 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0, 0;
622 };
623
624 &{+shift};
625 }
626
627 # use like this:
628 timeslice {
629 # The following is an endless loop that would normally
630 # monopolise the process. Since it runs in a timesliced
631 # environment, it will regularly cede to other threads.
632 while () { }
633 };
634
307 635
308=item killall 636=item killall
309 637
310Kills/terminates/cancels all coroutines except the currently running 638Kills/terminates/cancels all coros except the currently running one.
311one. This is useful after a fork, either in the child or the parent, as
312usually only one of them should inherit the running coroutines.
313 639
314Note that while this will try to free some of the main programs resources, 640Note that while this will try to free some of the main interpreter
641resources if the calling coro isn't the main coro, but one
315you cannot free all of them, so if a coroutine that is not the main 642cannot free all of them, so if a coro that is not the main coro
316program calls this function, there will be some one-time resource leak. 643calls this function, there will be some one-time resource leak.
317 644
318=cut 645=cut
319 646
320sub killall { 647sub killall {
321 for (Coro::State::list) { 648 for (Coro::State::list) {
324 } 651 }
325} 652}
326 653
327=back 654=back
328 655
329=head1 COROUTINE OBJECT METHODS 656=head1 CORO OBJECT METHODS
330 657
331These are the methods you can call on coroutine objects (or to create 658These are the methods you can call on coro objects (or to create
332them). 659them).
333 660
334=over 4 661=over 4
335 662
336=item new Coro \&sub [, @args...] 663=item new Coro \&sub [, @args...]
337 664
338Create a new coroutine and return it. When the sub returns, the coroutine 665Create a new coro and return it. When the sub returns, the coro
339automatically terminates as if C<terminate> with the returned values were 666automatically terminates as if C<terminate> with the returned values were
340called. To make the coroutine run you must first put it into the ready 667called. To make the coro run you must first put it into the ready
341queue by calling the ready method. 668queue by calling the ready method.
342 669
343See C<async> and C<Coro::State::new> for additional info about the 670See C<async> and C<Coro::State::new> for additional info about the
344coroutine environment. 671coro environment.
345 672
346=cut 673=cut
347 674
348sub _terminate { 675sub _coro_run {
349 terminate &{+shift}; 676 terminate &{+shift};
350} 677}
351 678
352=item $success = $coroutine->ready 679=item $success = $coro->ready
353 680
354Put the given coroutine into the end of its ready queue (there is one 681Put the given coro into the end of its ready queue (there is one
355queue for each priority) and return true. If the coroutine is already in 682queue for each priority) and return true. If the coro is already in
356the ready queue, do nothing and return false. 683the ready queue, do nothing and return false.
357 684
358This ensures that the scheduler will resume this coroutine automatically 685This ensures that the scheduler will resume this coro automatically
359once all the coroutines of higher priority and all coroutines of the same 686once all the coro of higher priority and all coro of the same
360priority that were put into the ready queue earlier have been resumed. 687priority that were put into the ready queue earlier have been resumed.
361 688
689=item $coro->suspend
690
691Suspends the specified coro. A suspended coro works just like any other
692coro, except that the scheduler will not select a suspended coro for
693execution.
694
695Suspending a coro can be useful when you want to keep the coro from
696running, but you don't want to destroy it, or when you want to temporarily
697freeze a coro (e.g. for debugging) to resume it later.
698
699A scenario for the former would be to suspend all (other) coros after a
700fork and keep them alive, so their destructors aren't called, but new
701coros can be created.
702
703=item $coro->resume
704
705If the specified coro was suspended, it will be resumed. Note that when
706the coro was in the ready queue when it was suspended, it might have been
707unreadied by the scheduler, so an activation might have been lost.
708
709To avoid this, it is best to put a suspended coro into the ready queue
710unconditionally, as every synchronisation mechanism must protect itself
711against spurious wakeups, and the one in the Coro family certainly do
712that.
713
362=item $is_ready = $coroutine->is_ready 714=item $is_ready = $coro->is_ready
363 715
364Return whether the coroutine is currently the ready queue or not, 716Returns true iff the Coro object is in the ready queue. Unless the Coro
717object gets destroyed, it will eventually be scheduled by the scheduler.
365 718
719=item $is_running = $coro->is_running
720
721Returns true iff the Coro object is currently running. Only one Coro object
722can ever be in the running state (but it currently is possible to have
723multiple running Coro::States).
724
725=item $is_suspended = $coro->is_suspended
726
727Returns true iff this Coro object has been suspended. Suspended Coros will
728not ever be scheduled.
729
366=item $coroutine->cancel (arg...) 730=item $coro->cancel (arg...)
367 731
368Terminates the given coroutine and makes it return the given arguments as 732Terminates the given Coro and makes it return the given arguments as
369status (default: the empty list). Never returns if the coroutine is the 733status (default: the empty list). Never returns if the Coro is the
370current coroutine. 734current Coro.
371 735
372=cut 736=cut
373 737
374sub cancel { 738sub cancel {
375 my $self = shift; 739 my $self = shift;
376 740
377 if ($current == $self) { 741 if ($current == $self) {
378 terminate @_; 742 terminate @_;
379 } else { 743 } else {
380 $self->{_status} = [@_]; 744 $self->{_status} = [@_];
381 $self->_cancel; 745 Coro::State::cancel $self;
382 } 746 }
383} 747}
384 748
385=item $coroutine->schedule_to 749=item $coro->schedule_to
386 750
387Puts the current coroutine to sleep (like C<Coro::schedule>), but instead 751Puts the current coro to sleep (like C<Coro::schedule>), but instead
388of continuing with the next coro from the ready queue, always switch to 752of continuing with the next coro from the ready queue, always switch to
389the given coroutine object (regardless of priority etc.). The readyness 753the given coro object (regardless of priority etc.). The readyness
390state of that coroutine isn't changed. 754state of that coro isn't changed.
391 755
392This is an advanced method for special cases - I'd love to hear about any 756This is an advanced method for special cases - I'd love to hear about any
393uses for this one. 757uses for this one.
394 758
395=item $coroutine->cede_to 759=item $coro->cede_to
396 760
397Like C<schedule_to>, but puts the current coroutine into the ready 761Like C<schedule_to>, but puts the current coro into the ready
398queue. This has the effect of temporarily switching to the given 762queue. This has the effect of temporarily switching to the given
399coroutine, and continuing some time later. 763coro, and continuing some time later.
400 764
401This is an advanced method for special cases - I'd love to hear about any 765This is an advanced method for special cases - I'd love to hear about any
402uses for this one. 766uses for this one.
403 767
404=item $coroutine->throw ([$scalar]) 768=item $coro->throw ([$scalar])
405 769
406If C<$throw> is specified and defined, it will be thrown as an exception 770If C<$throw> is specified and defined, it will be thrown as an exception
407inside the coroutine at the next convenient point in time. Otherwise 771inside the coro at the next convenient point in time. Otherwise
408clears the exception object. 772clears the exception object.
409 773
410Coro will check for the exception each time a schedule-like-function 774Coro will check for the exception each time a schedule-like-function
411returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down 775returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
412>>, C<< Coro::Handle->readable >> and so on. Most of these functions 776>>, C<< Coro::Handle->readable >> and so on. Most of these functions
414 778
415The exception object will be thrown "as is" with the specified scalar in 779The exception object will be thrown "as is" with the specified scalar in
416C<$@>, i.e. if it is a string, no line number or newline will be appended 780C<$@>, i.e. if it is a string, no line number or newline will be appended
417(unlike with C<die>). 781(unlike with C<die>).
418 782
419This can be used as a softer means than C<cancel> to ask a coroutine to 783This can be used as a softer means than C<cancel> to ask a coro to
420end itself, although there is no guarantee that the exception will lead to 784end itself, although there is no guarantee that the exception will lead to
421termination, and if the exception isn't caught it might well end the whole 785termination, and if the exception isn't caught it might well end the whole
422program. 786program.
423 787
424You might also think of C<throw> as being the moral equivalent of 788You might also think of C<throw> as being the moral equivalent of
425C<kill>ing a coroutine with a signal (in this case, a scalar). 789C<kill>ing a coro with a signal (in this case, a scalar).
426 790
427=item $coroutine->join 791=item $coro->join
428 792
429Wait until the coroutine terminates and return any values given to the 793Wait until the coro terminates and return any values given to the
430C<terminate> or C<cancel> functions. C<join> can be called concurrently 794C<terminate> or C<cancel> functions. C<join> can be called concurrently
431from multiple coroutines, and all will be resumed and given the status 795from multiple coro, and all will be resumed and given the status
432return once the C<$coroutine> terminates. 796return once the C<$coro> terminates.
433 797
434=cut 798=cut
435 799
436sub join { 800sub join {
437 my $self = shift; 801 my $self = shift;
448 } 812 }
449 813
450 wantarray ? @{$self->{_status}} : $self->{_status}[0]; 814 wantarray ? @{$self->{_status}} : $self->{_status}[0];
451} 815}
452 816
453=item $coroutine->on_destroy (\&cb) 817=item $coro->on_destroy (\&cb)
454 818
455Registers a callback that is called when this coroutine gets destroyed, 819Registers a callback that is called when this coro thread gets destroyed,
456but before it is joined. The callback gets passed the terminate arguments, 820but before it is joined. The callback gets passed the terminate arguments,
457if any, and I<must not> die, under any circumstances. 821if any, and I<must not> die, under any circumstances.
458 822
823There can be any number of C<on_destroy> callbacks per coro.
824
459=cut 825=cut
460 826
461sub on_destroy { 827sub on_destroy {
462 my ($self, $cb) = @_; 828 my ($self, $cb) = @_;
463 829
464 push @{ $self->{_on_destroy} }, $cb; 830 push @{ $self->{_on_destroy} }, $cb;
465} 831}
466 832
467=item $oldprio = $coroutine->prio ($newprio) 833=item $oldprio = $coro->prio ($newprio)
468 834
469Sets (or gets, if the argument is missing) the priority of the 835Sets (or gets, if the argument is missing) the priority of the
470coroutine. Higher priority coroutines get run before lower priority 836coro thread. Higher priority coro get run before lower priority
471coroutines. Priorities are small signed integers (currently -4 .. +3), 837coros. Priorities are small signed integers (currently -4 .. +3),
472that you can refer to using PRIO_xxx constants (use the import tag :prio 838that you can refer to using PRIO_xxx constants (use the import tag :prio
473to get then): 839to get then):
474 840
475 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 841 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
476 3 > 1 > 0 > -1 > -3 > -4 842 3 > 1 > 0 > -1 > -3 > -4
477 843
478 # set priority to HIGH 844 # set priority to HIGH
479 current->prio(PRIO_HIGH); 845 current->prio (PRIO_HIGH);
480 846
481The idle coroutine ($Coro::idle) always has a lower priority than any 847The idle coro thread ($Coro::idle) always has a lower priority than any
482existing coroutine. 848existing coro.
483 849
484Changing the priority of the current coroutine will take effect immediately, 850Changing the priority of the current coro will take effect immediately,
485but changing the priority of coroutines in the ready queue (but not 851but changing the priority of a coro in the ready queue (but not running)
486running) will only take effect after the next schedule (of that 852will only take effect after the next schedule (of that coro). This is a
487coroutine). This is a bug that will be fixed in some future version. 853bug that will be fixed in some future version.
488 854
489=item $newprio = $coroutine->nice ($change) 855=item $newprio = $coro->nice ($change)
490 856
491Similar to C<prio>, but subtract the given value from the priority (i.e. 857Similar to C<prio>, but subtract the given value from the priority (i.e.
492higher values mean lower priority, just as in unix). 858higher values mean lower priority, just as in UNIX's nice command).
493 859
494=item $olddesc = $coroutine->desc ($newdesc) 860=item $olddesc = $coro->desc ($newdesc)
495 861
496Sets (or gets in case the argument is missing) the description for this 862Sets (or gets in case the argument is missing) the description for this
497coroutine. This is just a free-form string you can associate with a 863coro thread. This is just a free-form string you can associate with a
498coroutine. 864coro.
499 865
500This method simply sets the C<< $coroutine->{desc} >> member to the given 866This method simply sets the C<< $coro->{desc} >> member to the given
501string. You can modify this member directly if you wish. 867string. You can modify this member directly if you wish, and in fact, this
868is often preferred to indicate major processing states that cna then be
869seen for example in a L<Coro::Debug> session:
870
871 sub my_long_function {
872 local $Coro::current->{desc} = "now in my_long_function";
873 ...
874 $Coro::current->{desc} = "my_long_function: phase 1";
875 ...
876 $Coro::current->{desc} = "my_long_function: phase 2";
877 ...
878 }
502 879
503=cut 880=cut
504 881
505sub desc { 882sub desc {
506 my $old = $_[0]{desc}; 883 my $old = $_[0]{desc};
519 896
520=over 4 897=over 4
521 898
522=item Coro::nready 899=item Coro::nready
523 900
524Returns the number of coroutines that are currently in the ready state, 901Returns the number of coro that are currently in the ready state,
525i.e. that can be switched to by calling C<schedule> directory or 902i.e. that can be switched to by calling C<schedule> directory or
526indirectly. The value C<0> means that the only runnable coroutine is the 903indirectly. The value C<0> means that the only runnable coro is the
527currently running one, so C<cede> would have no effect, and C<schedule> 904currently running one, so C<cede> would have no effect, and C<schedule>
528would cause a deadlock unless there is an idle handler that wakes up some 905would cause a deadlock unless there is an idle handler that wakes up some
529coroutines. 906coro.
530 907
531=item my $guard = Coro::guard { ... } 908=item my $guard = Coro::guard { ... }
532 909
533This creates and returns a guard object. Nothing happens until the object 910This function still exists, but is deprecated. Please use the
534gets destroyed, in which case the codeblock given as argument will be 911C<Guard::guard> function instead.
535executed. This is useful to free locks or other resources in case of a
536runtime error or when the coroutine gets canceled, as in both cases the
537guard block will be executed. The guard object supports only one method,
538C<< ->cancel >>, which will keep the codeblock from being executed.
539 912
540Example: set some flag and clear it again when the coroutine gets canceled
541or the function returns:
542
543 sub do_something {
544 my $guard = Coro::guard { $busy = 0 };
545 $busy = 1;
546
547 # do something that requires $busy to be true
548 }
549
550=cut 913=cut
551 914
552sub guard(&) { 915BEGIN { *guard = \&Guard::guard }
553 bless \(my $cb = $_[0]), "Coro::guard"
554}
555
556sub Coro::guard::cancel {
557 ${$_[0]} = sub { };
558}
559
560sub Coro::guard::DESTROY {
561 ${$_[0]}->();
562}
563
564 916
565=item unblock_sub { ... } 917=item unblock_sub { ... }
566 918
567This utility function takes a BLOCK or code reference and "unblocks" it, 919This utility function takes a BLOCK or code reference and "unblocks" it,
568returning a new coderef. Unblocking means that calling the new coderef 920returning a new coderef. Unblocking means that calling the new coderef
569will return immediately without blocking, returning nothing, while the 921will return immediately without blocking, returning nothing, while the
570original code ref will be called (with parameters) from within another 922original code ref will be called (with parameters) from within another
571coroutine. 923coro.
572 924
573The reason this function exists is that many event libraries (such as the 925The reason this function exists is that many event libraries (such as
574venerable L<Event|Event> module) are not coroutine-safe (a weaker form 926the venerable L<Event|Event> module) are not thread-safe (a weaker form
575of thread-safety). This means you must not block within event callbacks, 927of reentrancy). This means you must not block within event callbacks,
576otherwise you might suffer from crashes or worse. The only event library 928otherwise you might suffer from crashes or worse. The only event library
577currently known that is safe to use without C<unblock_sub> is L<EV>. 929currently known that is safe to use without C<unblock_sub> is L<EV> (but
930you might still run into deadlocks if all event loops are blocked).
931
932Coro will try to catch you when you block in the event loop
933("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
934only works when you do not run your own event loop.
578 935
579This function allows your callbacks to block by executing them in another 936This function allows your callbacks to block by executing them in another
580coroutine where it is safe to block. One example where blocking is handy 937coro where it is safe to block. One example where blocking is handy
581is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 938is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
582disk, for example. 939disk, for example.
583 940
584In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 941In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
585creating event callbacks that want to block. 942creating event callbacks that want to block.
586 943
587If your handler does not plan to block (e.g. simply sends a message to 944If your handler does not plan to block (e.g. simply sends a message to
588another coroutine, or puts some other coroutine into the ready queue), 945another coro, or puts some other coro into the ready queue), there is
589there is no reason to use C<unblock_sub>. 946no reason to use C<unblock_sub>.
590 947
591Note that you also need to use C<unblock_sub> for any other callbacks that 948Note that you also need to use C<unblock_sub> for any other callbacks that
592are indirectly executed by any C-based event loop. For example, when you 949are indirectly executed by any C-based event loop. For example, when you
593use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it 950use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
594provides callbacks that are the result of some event callback, then you 951provides callbacks that are the result of some event callback, then you
624 unshift @unblock_queue, [$cb, @_]; 981 unshift @unblock_queue, [$cb, @_];
625 $unblock_scheduler->ready; 982 $unblock_scheduler->ready;
626 } 983 }
627} 984}
628 985
629=item $cb = Coro::rouse_cb 986=item $cb = rouse_cb
630 987
631Create and return a "rouse callback". That's a code reference that, when 988Create and return a "rouse callback". That's a code reference that,
632called, will save its arguments and notify the owner coroutine of the 989when called, will remember a copy of its arguments and notify the owner
633callback. 990coro of the callback.
634 991
635See the next function. 992See the next function.
636 993
637=item @args = Coro::rouse_wait [$cb] 994=item @args = rouse_wait [$cb]
638 995
639Wait for the specified rouse callback (or the last one tht was created in 996Wait for the specified rouse callback (or the last one that was created in
640this coroutine). 997this coro).
641 998
642As soon as the callback is invoked (or when the calback was invoked before 999As soon as the callback is invoked (or when the callback was invoked
643C<rouse_wait>), it will return a copy of the arguments originally passed 1000before C<rouse_wait>), it will return the arguments originally passed to
644to the rouse callback. 1001the rouse callback. In scalar context, that means you get the I<last>
1002argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
1003statement at the end.
645 1004
646See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. 1005See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
647 1006
648=back 1007=back
649 1008
650=cut 1009=cut
651 1010
1011for my $module (qw(Channel RWLock Semaphore SemaphoreSet Signal Specific)) {
1012 my $old = defined &{"Coro::$module\::new"} && \&{"Coro::$module\::new"};
1013
1014 *{"Coro::$module\::new"} = sub {
1015 require "Coro/$module.pm";
1016
1017 # some modules have their new predefined in State.xs, some don't
1018 *{"Coro::$module\::new"} = $old
1019 if $old;
1020
1021 goto &{"Coro::$module\::new"};
1022 };
1023}
1024
6521; 10251;
653 1026
654=head1 HOW TO WAIT FOR A CALLBACK 1027=head1 HOW TO WAIT FOR A CALLBACK
655 1028
656It is very common for a coroutine to wait for some callback to be 1029It is very common for a coro to wait for some callback to be
657called. This occurs naturally when you use coroutines in an otherwise 1030called. This occurs naturally when you use coro in an otherwise
658event-based program, or when you use event-based libraries. 1031event-based program, or when you use event-based libraries.
659 1032
660These typically register a callback for some event, and call that callback 1033These typically register a callback for some event, and call that callback
661when the event occured. In a coroutine, however, you typically want to 1034when the event occured. In a coro, however, you typically want to
662just wait for the event, simplyifying things. 1035just wait for the event, simplyifying things.
663 1036
664For example C<< AnyEvent->child >> registers a callback to be called when 1037For example C<< AnyEvent->child >> registers a callback to be called when
665a specific child has exited: 1038a specific child has exited:
666 1039
667 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... }); 1040 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
668 1041
669But from withina coroutine, you often just want to write this: 1042But from within a coro, you often just want to write this:
670 1043
671 my $status = wait_for_child $pid; 1044 my $status = wait_for_child $pid;
672 1045
673Coro offers two functions specifically designed to make this easy, 1046Coro offers two functions specifically designed to make this easy,
674C<Coro::rouse_cb> and C<Coro::rouse_wait>. 1047C<Coro::rouse_cb> and C<Coro::rouse_wait>.
675 1048
676The first function, C<rouse_cb>, generates and returns a callback that, 1049The first function, C<rouse_cb>, generates and returns a callback that,
677when invoked, will save it's arguments and notify the coroutine that 1050when invoked, will save its arguments and notify the coro that
678created the callback. 1051created the callback.
679 1052
680The second function, C<rouse_wait>, waits for the callback to be called 1053The second function, C<rouse_wait>, waits for the callback to be called
681(by calling C<schedule> to go to sleep) and returns the arguments 1054(by calling C<schedule> to go to sleep) and returns the arguments
682originally passed to the callback. 1055originally passed to the callback.
697you can roll your own, using C<schedule>: 1070you can roll your own, using C<schedule>:
698 1071
699 sub wait_for_child($) { 1072 sub wait_for_child($) {
700 my ($pid) = @_; 1073 my ($pid) = @_;
701 1074
702 # store the current coroutine in $current, 1075 # store the current coro in $current,
703 # and provide result variables for the closure passed to ->child 1076 # and provide result variables for the closure passed to ->child
704 my $current = $Coro::current; 1077 my $current = $Coro::current;
705 my ($done, $rstatus); 1078 my ($done, $rstatus);
706 1079
707 # pass a closure to ->child 1080 # pass a closure to ->child
723 1096
724=item fork with pthread backend 1097=item fork with pthread backend
725 1098
726When Coro is compiled using the pthread backend (which isn't recommended 1099When Coro is compiled using the pthread backend (which isn't recommended
727but required on many BSDs as their libcs are completely broken), then 1100but required on many BSDs as their libcs are completely broken), then
728coroutines will not survive a fork. There is no known workaround except to 1101coro will not survive a fork. There is no known workaround except to
729fix your libc and use a saner backend. 1102fix your libc and use a saner backend.
730 1103
731=item perl process emulation ("threads") 1104=item perl process emulation ("threads")
732 1105
733This module is not perl-pseudo-thread-safe. You should only ever use this 1106This module is not perl-pseudo-thread-safe. You should only ever use this
734module from the same thread (this requirement might be removed in the 1107module from the first thread (this requirement might be removed in the
735future to allow per-thread schedulers, but Coro::State does not yet allow 1108future to allow per-thread schedulers, but Coro::State does not yet allow
736this). I recommend disabling thread support and using processes, as having 1109this). I recommend disabling thread support and using processes, as having
737the windows process emulation enabled under unix roughly halves perl 1110the windows process emulation enabled under unix roughly halves perl
738performance, even when not used. 1111performance, even when not used.
739 1112
740=item coroutine switching not signal safe 1113=item coro switching is not signal safe
741 1114
742You must not switch to another coroutine from within a signal handler 1115You must not switch to another coro from within a signal handler (only
743(only relevant with %SIG - most event libraries provide safe signals). 1116relevant with %SIG - most event libraries provide safe signals), I<unless>
1117you are sure you are not interrupting a Coro function.
744 1118
745That means you I<MUST NOT> call any function that might "block" the 1119That means you I<MUST NOT> call any function that might "block" the
746current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 1120current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
747anything that calls those. Everything else, including calling C<ready>, 1121anything that calls those. Everything else, including calling C<ready>,
748works. 1122works.
749 1123
750=back 1124=back
751 1125
752 1126
1127=head1 WINDOWS PROCESS EMULATION
1128
1129A great many people seem to be confused about ithreads (for example, Chip
1130Salzenberg called me unintelligent, incapable, stupid and gullible,
1131while in the same mail making rather confused statements about perl
1132ithreads (for example, that memory or files would be shared), showing his
1133lack of understanding of this area - if it is hard to understand for Chip,
1134it is probably not obvious to everybody).
1135
1136What follows is an ultra-condensed version of my talk about threads in
1137scripting languages given on the perl workshop 2009:
1138
1139The so-called "ithreads" were originally implemented for two reasons:
1140first, to (badly) emulate unix processes on native win32 perls, and
1141secondly, to replace the older, real thread model ("5.005-threads").
1142
1143It does that by using threads instead of OS processes. The difference
1144between processes and threads is that threads share memory (and other
1145state, such as files) between threads within a single process, while
1146processes do not share anything (at least not semantically). That
1147means that modifications done by one thread are seen by others, while
1148modifications by one process are not seen by other processes.
1149
1150The "ithreads" work exactly like that: when creating a new ithreads
1151process, all state is copied (memory is copied physically, files and code
1152is copied logically). Afterwards, it isolates all modifications. On UNIX,
1153the same behaviour can be achieved by using operating system processes,
1154except that UNIX typically uses hardware built into the system to do this
1155efficiently, while the windows process emulation emulates this hardware in
1156software (rather efficiently, but of course it is still much slower than
1157dedicated hardware).
1158
1159As mentioned before, loading code, modifying code, modifying data
1160structures and so on is only visible in the ithreads process doing the
1161modification, not in other ithread processes within the same OS process.
1162
1163This is why "ithreads" do not implement threads for perl at all, only
1164processes. What makes it so bad is that on non-windows platforms, you can
1165actually take advantage of custom hardware for this purpose (as evidenced
1166by the forks module, which gives you the (i-) threads API, just much
1167faster).
1168
1169Sharing data is in the i-threads model is done by transfering data
1170structures between threads using copying semantics, which is very slow -
1171shared data simply does not exist. Benchmarks using i-threads which are
1172communication-intensive show extremely bad behaviour with i-threads (in
1173fact, so bad that Coro, which cannot take direct advantage of multiple
1174CPUs, is often orders of magnitude faster because it shares data using
1175real threads, refer to my talk for details).
1176
1177As summary, i-threads *use* threads to implement processes, while
1178the compatible forks module *uses* processes to emulate, uhm,
1179processes. I-threads slow down every perl program when enabled, and
1180outside of windows, serve no (or little) practical purpose, but
1181disadvantages every single-threaded Perl program.
1182
1183This is the reason that I try to avoid the name "ithreads", as it is
1184misleading as it implies that it implements some kind of thread model for
1185perl, and prefer the name "windows process emulation", which describes the
1186actual use and behaviour of it much better.
1187
753=head1 SEE ALSO 1188=head1 SEE ALSO
754 1189
755Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 1190Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
756 1191
757Debugging: L<Coro::Debug>. 1192Debugging: L<Coro::Debug>.
758 1193
759Support/Utility: L<Coro::Specific>, L<Coro::Util>. 1194Support/Utility: L<Coro::Specific>, L<Coro::Util>.
760 1195
761Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 1196Locking and IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>,
1197L<Coro::SemaphoreSet>, L<Coro::RWLock>.
762 1198
763IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>. 1199I/O and Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
764 1200
765Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>. 1201Compatibility with other modules: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for
1202a better-working alternative), L<Coro::BDB>, L<Coro::Storable>,
1203L<Coro::Select>.
766 1204
767XS API: L<Coro::MakeMaker>. 1205XS API: L<Coro::MakeMaker>.
768 1206
769Low level Configuration, Coroutine Environment: L<Coro::State>. 1207Low level Configuration, Thread Environment, Continuations: L<Coro::State>.
770 1208
771=head1 AUTHOR 1209=head1 AUTHOR
772 1210
773 Marc Lehmann <schmorp@schmorp.de> 1211 Marc Lehmann <schmorp@schmorp.de>
774 http://home.schmorp.de/ 1212 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines