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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines