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

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.181 by root, Fri May 9 22:04:37 2008 UTC vs.
Revision 1.237 by root, Sat Nov 22 16:37:11 2008 UTC

1=head1 NAME 1=head1 NAME
2 2
3Coro - coroutine process abstraction 3Coro - real threads in perl
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use Coro; 7 use Coro;
8 8
16 cede; # yield to coroutine 16 cede; # yield to coroutine
17 print "3\n"; 17 print "3\n";
18 cede; # and again 18 cede; # and again
19 19
20 # use locking 20 # use locking
21 use Coro::Semaphore;
21 my $lock = new Coro::Semaphore; 22 my $lock = new Coro::Semaphore;
22 my $locked; 23 my $locked;
23 24
24 $lock->down; 25 $lock->down;
25 $locked = 1; 26 $locked = 1;
26 $lock->up; 27 $lock->up;
27 28
28=head1 DESCRIPTION 29=head1 DESCRIPTION
29 30
30This module collection manages coroutines. Coroutines are similar to 31For a tutorial-style introduction, please read the L<Coro::Intro>
31threads but don't (in general) run in parallel at the same time even 32manpage. This manpage mainly contains reference information.
32on SMP machines. The specific flavor of coroutine used in this module
33also guarantees you that it will not switch between coroutines unless
34necessary, at easily-identified points in your program, so locking and
35parallel access are rarely an issue, making coroutine programming much
36safer and easier than threads programming.
37 33
38Unlike a normal perl program, however, coroutines allow you to have 34This module collection manages coroutines, that is, cooperative
39multiple running interpreters that share data, which is especially useful 35threads. Coroutines are similar to kernel threads but don't (in general)
40to code pseudo-parallel processes, such as multiple HTTP-GET requests 36run in parallel at the same time even on SMP machines. The specific flavor
41running concurrently. 37of coroutine used in this module also guarantees you that it will not
38switch between coroutines unless necessary, at easily-identified points
39in your program, so locking and parallel access are rarely an issue,
40making coroutine programming much safer and easier than using other thread
41models.
42 42
43Coroutines are also useful because Perl has no support for threads (the so 43Unlike the so-called "Perl threads" (which are not actually real threads
44called "threads" that perl offers are nothing more than the (bad) process 44but only the windows process emulation ported to unix), Coro provides a
45emulation coming from the Windows platform: On standard operating systems 45full shared address space, which makes communication between coroutines
46they serve no purpose whatsoever, except by making your programs slow and 46very easy. And coroutines are fast, too: disabling the Windows process
47making them use a lot of memory. Best disable them when building perl, or 47emulation code in your perl and using Coro can easily result in a two to
48aks your software vendor/distributor to do it for you). 48four times speed increase for your programs.
49 49
50Coro achieves that by supporting multiple running interpreters that share
51data, which is especially useful to code pseudo-parallel processes and
52for event-based programming, such as multiple HTTP-GET requests running
53concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
54into an event-based environment.
55
50In this module, coroutines are defined as "callchain + lexical variables + 56In this module, a coroutines is defined as "callchain + lexical variables
51@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 57+ @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own
52its own set of lexicals and its own set of perls most important global 58callchain, its own set of lexicals and its own set of perls most important
53variables (see L<Coro::State> for more configuration). 59global variables (see L<Coro::State> for more configuration and background
60info).
61
62See also the C<SEE ALSO> section at the end of this document - the Coro
63module family is quite large.
54 64
55=cut 65=cut
56 66
57package Coro; 67package Coro;
58 68
59use strict; 69use strict qw(vars subs);
60no warnings "uninitialized"; 70no warnings "uninitialized";
61 71
62use Coro::State; 72use Coro::State;
63 73
64use base qw(Coro::State Exporter); 74use base qw(Coro::State Exporter);
65 75
66our $idle; # idle handler 76our $idle; # idle handler
67our $main; # main coroutine 77our $main; # main coroutine
68our $current; # current coroutine 78our $current; # current coroutine
69 79
70our $VERSION = 4.6; 80our $VERSION = "5.0";
71 81
72our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 82our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
73our %EXPORT_TAGS = ( 83our %EXPORT_TAGS = (
74 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 84 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
75); 85);
76our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 86our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
77 87
88=head1 GLOBAL VARIABLES
89
78=over 4 90=over 4
79 91
80=item $Coro::main 92=item $Coro::main
81 93
82This variable stores the coroutine object that represents the main 94This variable stores the coroutine object that represents the main
83program. While you cna C<ready> it and do most other things you can do to 95program. While you cna C<ready> it and do most other things you can do to
84coroutines, it is mainly useful to compare again C<$Coro::current>, to see 96coroutines, it is mainly useful to compare again C<$Coro::current>, to see
85wether you are running in the main program or not. 97whether you are running in the main program or not.
86 98
87=cut 99=cut
88 100
89$main = new Coro; 101# $main is now being initialised by Coro::State
90 102
91=item $Coro::current 103=item $Coro::current
92 104
93The coroutine object representing the current coroutine (the last 105The coroutine object representing the current coroutine (the last
94coroutine that the Coro scheduler switched to). The initial value is 106coroutine that the Coro scheduler switched to). The initial value is
95C<$main> (of course). 107C<$Coro::main> (of course).
96 108
97This variable is B<strictly> I<read-only>. You can take copies of the 109This variable is B<strictly> I<read-only>. You can take copies of the
98value stored in it and use it as any other coroutine object, but you must 110value stored in it and use it as any other coroutine object, but you must
99not otherwise modify the variable itself. 111not otherwise modify the variable itself.
100 112
101=cut 113=cut
102
103$main->{desc} = "[main::]";
104
105# maybe some other module used Coro::Specific before...
106$main->{_specific} = $current->{_specific}
107 if $current;
108
109_set_current $main;
110 114
111sub current() { $current } # [DEPRECATED] 115sub current() { $current } # [DEPRECATED]
112 116
113=item $Coro::idle 117=item $Coro::idle
114 118
141$idle = sub { 145$idle = sub {
142 require Carp; 146 require Carp;
143 Carp::croak ("FATAL: deadlock detected"); 147 Carp::croak ("FATAL: deadlock detected");
144}; 148};
145 149
146sub _cancel {
147 my ($self) = @_;
148
149 # free coroutine data and mark as destructed
150 $self->_destroy
151 or return;
152
153 # call all destruction callbacks
154 $_->(@{$self->{_status}})
155 for @{(delete $self->{_on_destroy}) || []};
156}
157
158# this coroutine is necessary because a coroutine 150# this coroutine is necessary because a coroutine
159# cannot destroy itself. 151# cannot destroy itself.
160my @destroy; 152our @destroy;
161my $manager; 153our $manager;
162 154
163$manager = new Coro sub { 155$manager = new Coro sub {
164 while () { 156 while () {
165 (shift @destroy)->_cancel 157 Coro::_cancel shift @destroy
166 while @destroy; 158 while @destroy;
167 159
168 &schedule; 160 &schedule;
169 } 161 }
170}; 162};
171$manager->desc ("[coro manager]"); 163$manager->{desc} = "[coro manager]";
172$manager->prio (PRIO_MAX); 164$manager->prio (PRIO_MAX);
173 165
174=back 166=back
175 167
176=head2 SIMPLE COROUTINE CREATION 168=head1 SIMPLE COROUTINE CREATION
177 169
178=over 4 170=over 4
179 171
180=item async { ... } [@args...] 172=item async { ... } [@args...]
181 173
218Similar to C<async>, but uses a coroutine pool, so you should not call 210Similar to C<async>, but uses a coroutine pool, so you should not call
219terminate or join on it (although you are allowed to), and you get a 211terminate 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 212coroutine that might have executed other code already (which can be good
221or bad :). 213or bad :).
222 214
223On the plus side, this function is faster than creating (and destroying) 215On the plus side, this function is about twice as fast as creating (and
224a completely new coroutine, so if you need a lot of generic coroutines in 216destroying) a completely new coroutine, so if you need a lot of generic
225quick successsion, use C<async_pool>, not C<async>. 217coroutines in quick successsion, use C<async_pool>, not C<async>.
226 218
227The code block is executed in an C<eval> context and a warning will be 219The 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 220issued 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> 221C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
230will not work in the expected way, unless you call terminate or cancel, 222will not work in the expected way, unless you call terminate or cancel,
233 225
234The priority will be reset to C<0> after each run, tracing will be 226The priority will be reset to C<0> after each run, tracing will be
235disabled, the description will be reset and the default output filehandle 227disabled, the description will be reset and the default output filehandle
236gets restored, so you can change all these. Otherwise the coroutine will 228gets restored, so you can change all these. Otherwise the coroutine will
237be re-used "as-is": most notably if you change other per-coroutine global 229be re-used "as-is": most notably if you change other per-coroutine global
238stuff such as C<$/> you I<must needs> to revert that change, which is most 230stuff such as C<$/> you I<must needs> revert that change, which is most
239simply done by using local as in: C< local $/ >. 231simply done by using local as in: C<< local $/ >>.
240 232
241The pool size is limited to C<8> idle coroutines (this can be adjusted by 233The idle pool size is limited to C<8> idle coroutines (this can be
242changing $Coro::POOL_SIZE), and there can be as many non-idle coros as 234adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
243required. 235coros as required.
244 236
245If you are concerned about pooled coroutines growing a lot because a 237If you are concerned about pooled coroutines growing a lot because a
246single C<async_pool> used a lot of stackspace you can e.g. C<async_pool 238single 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 239{ 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 16kb 240addition to that, when the stacks used by a handler grows larger than 32kb
249(adjustable via $Coro::POOL_RSS) it will also be destroyed. 241(adjustable via $Coro::POOL_RSS) it will also be destroyed.
250 242
251=cut 243=cut
252 244
253our $POOL_SIZE = 8; 245our $POOL_SIZE = 8;
254our $POOL_RSS = 16 * 1024; 246our $POOL_RSS = 32 * 1024;
255our @async_pool; 247our @async_pool;
256 248
257sub pool_handler { 249sub pool_handler {
258 my $cb;
259
260 while () { 250 while () {
261 eval { 251 eval {
262 while () { 252 &{&_pool_handler} while 1;
263 _pool_1 $cb;
264 &$cb;
265 _pool_2 $cb;
266 &schedule;
267 }
268 }; 253 };
269 254
270 last if $@ eq "\3async_pool terminate\2\n";
271 warn $@ if $@; 255 warn $@ if $@;
272 } 256 }
273} 257}
274 258
275sub async_pool(&@) {
276 # this is also inlined into the unlock_scheduler
277 my $coro = (pop @async_pool) || new Coro \&pool_handler;
278
279 $coro->{_invoke} = [@_];
280 $coro->ready;
281
282 $coro
283}
284
285=back 259=back
286 260
287=head2 STATIC METHODS 261=head1 STATIC METHODS
288 262
289Static methods are actually functions that operate on the current coroutine. 263Static methods are actually functions that implicitly operate on the
264current coroutine.
290 265
291=over 4 266=over 4
292 267
293=item schedule 268=item schedule
294 269
306This makes C<schedule> I<the> generic method to use to block the current 281This makes C<schedule> I<the> generic method to use to block the current
307coroutine and wait for events: first you remember the current coroutine in 282coroutine and wait for events: first you remember the current coroutine in
308a variable, then arrange for some callback of yours to call C<< ->ready 283a variable, then arrange for some callback of yours to call C<< ->ready
309>> on that once some event happens, and last you call C<schedule> to put 284>> on that once some event happens, and last you call C<schedule> to put
310yourself to sleep. Note that a lot of things can wake your coroutine up, 285yourself to sleep. Note that a lot of things can wake your coroutine up,
311so you need to check wether the event indeed happened, e.g. by storing the 286so you need to check whether the event indeed happened, e.g. by storing the
312status in a variable. 287status in a variable.
313 288
314The canonical way to wait on external events is this: 289See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
315
316 {
317 # remember current coroutine
318 my $current = $Coro::current;
319
320 # register a hypothetical event handler
321 on_event_invoke sub {
322 # wake up sleeping coroutine
323 $current->ready;
324 undef $current;
325 };
326
327 # call schedule until event occurred.
328 # in case we are woken up for other reasons
329 # (current still defined), loop.
330 Coro::schedule while $current;
331 }
332 290
333=item cede 291=item cede
334 292
335"Cede" to other coroutines. This function puts the current coroutine into 293"Cede" to other coroutines. This function puts the current coroutine into
336the ready queue and calls C<schedule>, which has the effect of giving 294the ready queue and calls C<schedule>, which has the effect of giving
355Kills/terminates/cancels all coroutines except the currently running 313Kills/terminates/cancels all coroutines except the currently running
356one. This is useful after a fork, either in the child or the parent, as 314one. This is useful after a fork, either in the child or the parent, as
357usually only one of them should inherit the running coroutines. 315usually only one of them should inherit the running coroutines.
358 316
359Note that while this will try to free some of the main programs resources, 317Note that while this will try to free some of the main programs resources,
360you cnanot free all of them, so if a coroutine that is not the main 318you cannot free all of them, so if a coroutine that is not the main
361program calls this function, there will be some one-time resource leak. 319program calls this function, there will be some one-time resource leak.
362 320
363=cut 321=cut
364
365sub terminate {
366 $current->cancel (@_);
367}
368 322
369sub killall { 323sub killall {
370 for (Coro::State::list) { 324 for (Coro::State::list) {
371 $_->cancel 325 $_->cancel
372 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 326 if $_ != $current && UNIVERSAL::isa $_, "Coro";
373 } 327 }
374} 328}
375 329
376=back 330=back
377 331
378=head2 COROUTINE METHODS 332=head1 COROUTINE OBJECT METHODS
379 333
380These are the methods you can call on coroutine objects (or to create 334These are the methods you can call on coroutine objects (or to create
381them). 335them).
382 336
383=over 4 337=over 4
392See C<async> and C<Coro::State::new> for additional info about the 346See C<async> and C<Coro::State::new> for additional info about the
393coroutine environment. 347coroutine environment.
394 348
395=cut 349=cut
396 350
397sub _run_coro { 351sub _terminate {
398 terminate &{+shift}; 352 terminate &{+shift};
399}
400
401sub new {
402 my $class = shift;
403
404 $class->SUPER::new (\&_run_coro, @_)
405} 353}
406 354
407=item $success = $coroutine->ready 355=item $success = $coroutine->ready
408 356
409Put the given coroutine into the end of its ready queue (there is one 357Put the given coroutine into the end of its ready queue (there is one
414once all the coroutines of higher priority and all coroutines of the same 362once all the coroutines of higher priority and all coroutines of the same
415priority that were put into the ready queue earlier have been resumed. 363priority that were put into the ready queue earlier have been resumed.
416 364
417=item $is_ready = $coroutine->is_ready 365=item $is_ready = $coroutine->is_ready
418 366
419Return wether the coroutine is currently the ready queue or not, 367Return whether the coroutine is currently the ready queue or not,
420 368
421=item $coroutine->cancel (arg...) 369=item $coroutine->cancel (arg...)
422 370
423Terminates the given coroutine and makes it return the given arguments as 371Terminates the given coroutine and makes it return the given arguments as
424status (default: the empty list). Never returns if the coroutine is the 372status (default: the empty list). Never returns if the coroutine is the
426 374
427=cut 375=cut
428 376
429sub cancel { 377sub cancel {
430 my $self = shift; 378 my $self = shift;
431 $self->{_status} = [@_];
432 379
433 if ($current == $self) { 380 if ($current == $self) {
434 push @destroy, $self; 381 terminate @_;
435 $manager->ready;
436 &schedule while 1;
437 } else { 382 } else {
383 $self->{_status} = [@_];
438 $self->_cancel; 384 $self->_cancel;
439 } 385 }
440} 386}
387
388=item $coroutine->schedule_to
389
390Puts the current coroutine to sleep (like C<Coro::schedule>), but instead
391of continuing with the next coro from the ready queue, always switch to
392the given coroutine object (regardless of priority etc.). The readyness
393state of that coroutine isn't changed.
394
395This is an advanced method for special cases - I'd love to hear about any
396uses for this one.
397
398=item $coroutine->cede_to
399
400Like C<schedule_to>, but puts the current coroutine into the ready
401queue. This has the effect of temporarily switching to the given
402coroutine, and continuing some time later.
403
404This is an advanced method for special cases - I'd love to hear about any
405uses for this one.
406
407=item $coroutine->throw ([$scalar])
408
409If C<$throw> is specified and defined, it will be thrown as an exception
410inside the coroutine at the next convenient point in time. Otherwise
411clears the exception object.
412
413Coro will check for the exception each time a schedule-like-function
414returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
415>>, C<< Coro::Handle->readable >> and so on. Most of these functions
416detect this case and return early in case an exception is pending.
417
418The exception object will be thrown "as is" with the specified scalar in
419C<$@>, i.e. if it is a string, no line number or newline will be appended
420(unlike with C<die>).
421
422This can be used as a softer means than C<cancel> to ask a coroutine to
423end itself, although there is no guarantee that the exception will lead to
424termination, and if the exception isn't caught it might well end the whole
425program.
426
427You might also think of C<throw> as being the moral equivalent of
428C<kill>ing a coroutine with a signal (in this case, a scalar).
441 429
442=item $coroutine->join 430=item $coroutine->join
443 431
444Wait until the coroutine terminates and return any values given to the 432Wait until the coroutine terminates and return any values given to the
445C<terminate> or C<cancel> functions. C<join> can be called concurrently 433C<terminate> or C<cancel> functions. C<join> can be called concurrently
507higher values mean lower priority, just as in unix). 495higher values mean lower priority, just as in unix).
508 496
509=item $olddesc = $coroutine->desc ($newdesc) 497=item $olddesc = $coroutine->desc ($newdesc)
510 498
511Sets (or gets in case the argument is missing) the description for this 499Sets (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 coroutine. 500coroutine. This is just a free-form string you can associate with a
501coroutine.
513 502
514This method simply sets the C<< $coroutine->{desc} >> member to the given string. You 503This method simply sets the C<< $coroutine->{desc} >> member to the given
515can modify this member directly if you wish. 504string. You can modify this member directly if you wish.
516
517=item $coroutine->throw ([$scalar])
518
519If C<$throw> is specified and defined, it will be thrown as an exception
520inside the coroutine at the next convinient point in time (usually after
521it gains control at the next schedule/transfer/cede). Otherwise clears the
522exception object.
523
524The exception object will be thrown "as is" with the specified scalar in
525C<$@>, i.e. if it is a string, no line number or newline will be appended
526(unlike with C<die>).
527
528This can be used as a softer means than C<cancel> to ask a coroutine to
529end itself, although there is no guarentee that the exception will lead to
530termination, and if the exception isn't caught it might well end the whole
531program.
532 505
533=cut 506=cut
534 507
535sub desc { 508sub desc {
536 my $old = $_[0]{desc}; 509 my $old = $_[0]{desc};
537 $_[0]{desc} = $_[1] if @_ > 1; 510 $_[0]{desc} = $_[1] if @_ > 1;
538 $old; 511 $old;
539} 512}
540 513
514sub transfer {
515 require Carp;
516 Carp::croak ("You must not call ->transfer on Coro objects. Use Coro::State objects or the ->schedule_to method. Caught");
517}
518
541=back 519=back
542 520
543=head2 GLOBAL FUNCTIONS 521=head1 GLOBAL FUNCTIONS
544 522
545=over 4 523=over 4
546 524
547=item Coro::nready 525=item Coro::nready
548 526
610creating event callbacks that want to block. 588creating event callbacks that want to block.
611 589
612If your handler does not plan to block (e.g. simply sends a message to 590If your handler does not plan to block (e.g. simply sends a message to
613another coroutine, or puts some other coroutine into the ready queue), 591another coroutine, or puts some other coroutine into the ready queue),
614there is no reason to use C<unblock_sub>. 592there is no reason to use C<unblock_sub>.
593
594Note that you also need to use C<unblock_sub> for any other callbacks that
595are indirectly executed by any C-based event loop. For example, when you
596use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
597provides callbacks that are the result of some event callback, then you
598must not block either, or use C<unblock_sub>.
615 599
616=cut 600=cut
617 601
618our @unblock_queue; 602our @unblock_queue;
619 603
622# return immediately and can be reused) and because we cannot cede 606# return immediately and can be reused) and because we cannot cede
623# inside an event callback. 607# inside an event callback.
624our $unblock_scheduler = new Coro sub { 608our $unblock_scheduler = new Coro sub {
625 while () { 609 while () {
626 while (my $cb = pop @unblock_queue) { 610 while (my $cb = pop @unblock_queue) {
627 # this is an inlined copy of async_pool 611 &async_pool (@$cb);
628 my $coro = (pop @async_pool) || new Coro \&pool_handler;
629 612
630 $coro->{_invoke} = $cb;
631 $coro->ready;
632 cede; # for short-lived callbacks, this reduces pressure on the coro pool 613 # for short-lived callbacks, this reduces pressure on the coro pool
614 # as the chance is very high that the async_poll coro will be back
615 # in the idle state when cede returns
616 cede;
633 } 617 }
634 schedule; # sleep well 618 schedule; # sleep well
635 } 619 }
636}; 620};
637$unblock_scheduler->desc ("[unblock_sub scheduler]"); 621$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
638 622
639sub unblock_sub(&) { 623sub unblock_sub(&) {
640 my $cb = shift; 624 my $cb = shift;
641 625
642 sub { 626 sub {
643 unshift @unblock_queue, [$cb, @_]; 627 unshift @unblock_queue, [$cb, @_];
644 $unblock_scheduler->ready; 628 $unblock_scheduler->ready;
645 } 629 }
646} 630}
647 631
632=item $cb = Coro::rouse_cb
633
634Create and return a "rouse callback". That's a code reference that, when
635called, will save its arguments and notify the owner coroutine of the
636callback.
637
638See the next function.
639
640=item @args = Coro::rouse_wait [$cb]
641
642Wait for the specified rouse callback (or the last one tht was created in
643this coroutine).
644
645As soon as the callback is invoked (or when the calback was invoked before
646C<rouse_wait>), it will return a copy of the arguments originally passed
647to the rouse callback.
648
649See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
650
648=back 651=back
649 652
650=cut 653=cut
651 654
6521; 6551;
653 656
657=head1 HOW TO WAIT FOR A CALLBACK
658
659It is very common for a coroutine to wait for some callback to be
660called. This occurs naturally when you use coroutines in an otherwise
661event-based program, or when you use event-based libraries.
662
663These typically register a callback for some event, and call that callback
664when the event occured. In a coroutine, however, you typically want to
665just wait for the event, simplyifying things.
666
667For example C<< AnyEvent->child >> registers a callback to be called when
668a specific child has exited:
669
670 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
671
672But from withina coroutine, you often just want to write this:
673
674 my $status = wait_for_child $pid;
675
676Coro offers two functions specifically designed to make this easy,
677C<Coro::rouse_cb> and C<Coro::rouse_wait>.
678
679The first function, C<rouse_cb>, generates and returns a callback that,
680when invoked, will save it's arguments and notify the coroutine that
681created the callback.
682
683The second function, C<rouse_wait>, waits for the callback to be called
684(by calling C<schedule> to go to sleep) and returns the arguments
685originally passed to the callback.
686
687Using these functions, it becomes easy to write the C<wait_for_child>
688function mentioned above:
689
690 sub wait_for_child($) {
691 my ($pid) = @_;
692
693 my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
694
695 my ($rpid, $rstatus) = Coro::rouse_wait;
696 $rstatus
697 }
698
699In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
700you can roll your own, using C<schedule>:
701
702 sub wait_for_child($) {
703 my ($pid) = @_;
704
705 # store the current coroutine in $current,
706 # and provide result variables for the closure passed to ->child
707 my $current = $Coro::current;
708 my ($done, $rstatus);
709
710 # pass a closure to ->child
711 my $watcher = AnyEvent->child (pid => $pid, cb => sub {
712 $rstatus = $_[1]; # remember rstatus
713 $done = 1; # mark $rstatus as valud
714 });
715
716 # wait until the closure has been called
717 schedule while !$done;
718
719 $rstatus
720 }
721
722
654=head1 BUGS/LIMITATIONS 723=head1 BUGS/LIMITATIONS
724
725=over 4
726
727=item fork with pthread backend
728
729When Coro is compiled using the pthread backend (which isn't recommended
730but required on many BSDs as their libcs are completely broken), then
731coroutines will not survive a fork. There is no known workaround except to
732fix your libc and use a saner backend.
733
734=item perl process emulation ("threads")
655 735
656This module is not perl-pseudo-thread-safe. You should only ever use this 736This module is not perl-pseudo-thread-safe. You should only ever use this
657module from the same thread (this requirement might be removed in the 737module from the same thread (this requirement might be removed in the
658future to allow per-thread schedulers, but Coro::State does not yet allow 738future to allow per-thread schedulers, but Coro::State does not yet allow
659this). I recommend disabling thread support and using processes, as this 739this). I recommend disabling thread support and using processes, as having
660is much faster and uses less memory. 740the windows process emulation enabled under unix roughly halves perl
741performance, even when not used.
742
743=item coroutine switching not signal safe
744
745You must not switch to another coroutine from within a signal handler
746(only relevant with %SIG - most event libraries provide safe signals).
747
748That means you I<MUST NOT> call any function that might "block" the
749current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
750anything that calls those. Everything else, including calling C<ready>,
751works.
752
753=back
754
661 755
662=head1 SEE ALSO 756=head1 SEE ALSO
663 757
664Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 758Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
665 759
666Debugging: L<Coro::Debug>. 760Debugging: L<Coro::Debug>.
667 761
668Support/Utility: L<Coro::Specific>, L<Coro::Util>. 762Support/Utility: L<Coro::Specific>, L<Coro::Util>.
669 763
670Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 764Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>,
765L<Coro::SemaphoreSet>, L<Coro::RWLock>.
671 766
672IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>. 767IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
673 768
674Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>. 769Compatibility: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for
770a better-working alternative), L<Coro::BDB>, L<Coro::Storable>,
771L<Coro::Select>.
675 772
676XS API: L<Coro::MakeMaker>. 773XS API: L<Coro::MakeMaker>.
677 774
678Low level Configuration, Coroutine Environment: L<Coro::State>. 775Low level Configuration, Coroutine Environment: L<Coro::State>.
679 776

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines