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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines