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

Comparing Coro/Coro.pm (file contents):
Revision 1.229 by root, Thu Nov 20 06:32:55 2008 UTC vs.
Revision 1.297 by root, Thu May 12 23:55:39 2011 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines