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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines