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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines