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

Comparing Coro/Coro.pm (file contents):
Revision 1.246 by root, Mon Dec 15 00:30:40 2008 UTC vs.
Revision 1.305 by root, Thu Aug 4 19:37:58 2011 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines