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.192 by root, Sun Jun 15 22:31:33 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 and for event-based programming, such as 36run in parallel at the same time even on SMP machines. The specific flavor
41multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to 37of coroutine used in this module also guarantees you that it will not
42learn more. 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.
43 42
44Coroutines are also useful because Perl has no support for threads (the so 43Unlike the so-called "Perl threads" (which are not actually real threads
45called "threads" that perl offers are nothing more than the (bad) process 44but only the windows process emulation ported to unix), Coro provides a
46emulation coming from the Windows platform: On standard operating systems 45full shared address space, which makes communication between coroutines
47they serve no purpose whatsoever, except by making your programs slow and 46very easy. And coroutines are fast, too: disabling the Windows process
48making 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
49aks your software vendor/distributor to do it for you). 48four times speed increase for your programs.
50 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
51In this module, coroutines are defined as "callchain + lexical variables + 56In this module, a coroutines is defined as "callchain + lexical variables
52@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 57+ @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own
53its 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
54variables (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.
55 64
56=cut 65=cut
57 66
58package Coro; 67package Coro;
59 68
60use strict; 69use strict qw(vars subs);
61no warnings "uninitialized"; 70no warnings "uninitialized";
62 71
63use Coro::State; 72use Coro::State;
64 73
65use base qw(Coro::State Exporter); 74use base qw(Coro::State Exporter);
66 75
67our $idle; # idle handler 76our $idle; # idle handler
68our $main; # main coroutine 77our $main; # main coroutine
69our $current; # current coroutine 78our $current; # current coroutine
70 79
71our $VERSION = 4.743; 80our $VERSION = "5.0";
72 81
73our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 82our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
74our %EXPORT_TAGS = ( 83our %EXPORT_TAGS = (
75 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)],
76); 85);
77our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 86our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
78 87
88=head1 GLOBAL VARIABLES
89
79=over 4 90=over 4
80 91
81=item $Coro::main 92=item $Coro::main
82 93
83This variable stores the coroutine object that represents the main 94This variable stores the coroutine object that represents the main
84program. 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
85coroutines, 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
86wether you are running in the main program or not. 97whether you are running in the main program or not.
87 98
88=cut 99=cut
89 100
90$main = new Coro; 101# $main is now being initialised by Coro::State
91 102
92=item $Coro::current 103=item $Coro::current
93 104
94The coroutine object representing the current coroutine (the last 105The coroutine object representing the current coroutine (the last
95coroutine that the Coro scheduler switched to). The initial value is 106coroutine that the Coro scheduler switched to). The initial value is
96C<$main> (of course). 107C<$Coro::main> (of course).
97 108
98This 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
99value 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
100not otherwise modify the variable itself. 111not otherwise modify the variable itself.
101 112
102=cut 113=cut
103
104$main->{desc} = "[main::]";
105
106# maybe some other module used Coro::Specific before...
107$main->{_specific} = $current->{_specific}
108 if $current;
109
110_set_current $main;
111 114
112sub current() { $current } # [DEPRECATED] 115sub current() { $current } # [DEPRECATED]
113 116
114=item $Coro::idle 117=item $Coro::idle
115 118
142$idle = sub { 145$idle = sub {
143 require Carp; 146 require Carp;
144 Carp::croak ("FATAL: deadlock detected"); 147 Carp::croak ("FATAL: deadlock detected");
145}; 148};
146 149
147sub _cancel {
148 my ($self) = @_;
149
150 # free coroutine data and mark as destructed
151 $self->_destroy
152 or return;
153
154 # call all destruction callbacks
155 $_->(@{$self->{_status}})
156 for @{(delete $self->{_on_destroy}) || []};
157}
158
159# this coroutine is necessary because a coroutine 150# this coroutine is necessary because a coroutine
160# cannot destroy itself. 151# cannot destroy itself.
161my @destroy; 152our @destroy;
162my $manager; 153our $manager;
163 154
164$manager = new Coro sub { 155$manager = new Coro sub {
165 while () { 156 while () {
166 (shift @destroy)->_cancel 157 Coro::_cancel shift @destroy
167 while @destroy; 158 while @destroy;
168 159
169 &schedule; 160 &schedule;
170 } 161 }
171}; 162};
172$manager->desc ("[coro manager]"); 163$manager->{desc} = "[coro manager]";
173$manager->prio (PRIO_MAX); 164$manager->prio (PRIO_MAX);
174 165
175=back 166=back
176 167
177=head2 SIMPLE COROUTINE CREATION 168=head1 SIMPLE COROUTINE CREATION
178 169
179=over 4 170=over 4
180 171
181=item async { ... } [@args...] 172=item async { ... } [@args...]
182 173
219Similar 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
220terminate 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
221coroutine that might have executed other code already (which can be good 212coroutine that might have executed other code already (which can be good
222or bad :). 213or bad :).
223 214
224On 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
225a 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
226quick successsion, use C<async_pool>, not C<async>. 217coroutines in quick successsion, use C<async_pool>, not C<async>.
227 218
228The 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
229issued in case of an exception instead of terminating the program, as 220issued in case of an exception instead of terminating the program, as
230C<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>
231will 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,
234 225
235The 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
236disabled, the description will be reset and the default output filehandle 227disabled, the description will be reset and the default output filehandle
237gets restored, so you can change all these. Otherwise the coroutine will 228gets restored, so you can change all these. Otherwise the coroutine will
238be 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
239stuff 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
240simply done by using local as in: C< local $/ >. 231simply done by using local as in: C<< local $/ >>.
241 232
242The 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
243changing $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
244required. 235coros as required.
245 236
246If you are concerned about pooled coroutines growing a lot because a 237If you are concerned about pooled coroutines growing a lot because a
247single 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
248{ 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
249addition 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
250(adjustable via $Coro::POOL_RSS) it will also be destroyed. 241(adjustable via $Coro::POOL_RSS) it will also be destroyed.
251 242
252=cut 243=cut
253 244
254our $POOL_SIZE = 8; 245our $POOL_SIZE = 8;
255our $POOL_RSS = 16 * 1024; 246our $POOL_RSS = 32 * 1024;
256our @async_pool; 247our @async_pool;
257 248
258sub pool_handler { 249sub pool_handler {
259 my $cb;
260
261 while () { 250 while () {
262 eval { 251 eval {
263 while () { 252 &{&_pool_handler} while 1;
264 _pool_1 $cb;
265 &$cb;
266 _pool_2 $cb;
267 &schedule;
268 }
269 }; 253 };
270 254
271 last if $@ eq "\3async_pool terminate\2\n";
272 warn $@ if $@; 255 warn $@ if $@;
273 } 256 }
274} 257}
275 258
276sub async_pool(&@) {
277 # this is also inlined into the unlock_scheduler
278 my $coro = (pop @async_pool) || new Coro \&pool_handler;
279
280 $coro->{_invoke} = [@_];
281 $coro->ready;
282
283 $coro
284}
285
286=back 259=back
287 260
288=head2 STATIC METHODS 261=head1 STATIC METHODS
289 262
290Static methods are actually functions that operate on the current coroutine. 263Static methods are actually functions that implicitly operate on the
264current coroutine.
291 265
292=over 4 266=over 4
293 267
294=item schedule 268=item schedule
295 269
307This 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
308coroutine and wait for events: first you remember the current coroutine in 282coroutine and wait for events: first you remember the current coroutine in
309a 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
310>> 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
311yourself 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,
312so 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
313status in a variable. 287status in a variable.
314 288
315The 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.
316
317 {
318 # remember current coroutine
319 my $current = $Coro::current;
320
321 # register a hypothetical event handler
322 on_event_invoke sub {
323 # wake up sleeping coroutine
324 $current->ready;
325 undef $current;
326 };
327
328 # call schedule until event occurred.
329 # in case we are woken up for other reasons
330 # (current still defined), loop.
331 Coro::schedule while $current;
332 }
333 290
334=item cede 291=item cede
335 292
336"Cede" to other coroutines. This function puts the current coroutine into 293"Cede" to other coroutines. This function puts the current coroutine into
337the 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
356Kills/terminates/cancels all coroutines except the currently running 313Kills/terminates/cancels all coroutines except the currently running
357one. 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
358usually only one of them should inherit the running coroutines. 315usually only one of them should inherit the running coroutines.
359 316
360Note 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,
361you 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
362program calls this function, there will be some one-time resource leak. 319program calls this function, there will be some one-time resource leak.
363 320
364=cut 321=cut
365
366sub terminate {
367 $current->cancel (@_);
368}
369 322
370sub killall { 323sub killall {
371 for (Coro::State::list) { 324 for (Coro::State::list) {
372 $_->cancel 325 $_->cancel
373 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 326 if $_ != $current && UNIVERSAL::isa $_, "Coro";
374 } 327 }
375} 328}
376 329
377=back 330=back
378 331
379=head2 COROUTINE METHODS 332=head1 COROUTINE OBJECT METHODS
380 333
381These 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
382them). 335them).
383 336
384=over 4 337=over 4
393See 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
394coroutine environment. 347coroutine environment.
395 348
396=cut 349=cut
397 350
398sub _run_coro { 351sub _terminate {
399 terminate &{+shift}; 352 terminate &{+shift};
400}
401
402sub new {
403 my $class = shift;
404
405 $class->SUPER::new (\&_run_coro, @_)
406} 353}
407 354
408=item $success = $coroutine->ready 355=item $success = $coroutine->ready
409 356
410Put 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
415once 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
416priority that were put into the ready queue earlier have been resumed. 363priority that were put into the ready queue earlier have been resumed.
417 364
418=item $is_ready = $coroutine->is_ready 365=item $is_ready = $coroutine->is_ready
419 366
420Return wether the coroutine is currently the ready queue or not, 367Return whether the coroutine is currently the ready queue or not,
421 368
422=item $coroutine->cancel (arg...) 369=item $coroutine->cancel (arg...)
423 370
424Terminates the given coroutine and makes it return the given arguments as 371Terminates the given coroutine and makes it return the given arguments as
425status (default: the empty list). Never returns if the coroutine is the 372status (default: the empty list). Never returns if the coroutine is the
427 374
428=cut 375=cut
429 376
430sub cancel { 377sub cancel {
431 my $self = shift; 378 my $self = shift;
432 $self->{_status} = [@_];
433 379
434 if ($current == $self) { 380 if ($current == $self) {
435 push @destroy, $self; 381 terminate @_;
436 $manager->ready;
437 &schedule while 1;
438 } else { 382 } else {
383 $self->{_status} = [@_];
439 $self->_cancel; 384 $self->_cancel;
440 } 385 }
441} 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).
442 429
443=item $coroutine->join 430=item $coroutine->join
444 431
445Wait until the coroutine terminates and return any values given to the 432Wait until the coroutine terminates and return any values given to the
446C<terminate> or C<cancel> functions. C<join> can be called concurrently 433C<terminate> or C<cancel> functions. C<join> can be called concurrently
508higher values mean lower priority, just as in unix). 495higher values mean lower priority, just as in unix).
509 496
510=item $olddesc = $coroutine->desc ($newdesc) 497=item $olddesc = $coroutine->desc ($newdesc)
511 498
512Sets (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
513coroutine. 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.
514 502
515This 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
516can modify this member directly if you wish. 504string. You can modify this member directly if you wish.
517
518=item $coroutine->throw ([$scalar])
519
520If C<$throw> is specified and defined, it will be thrown as an exception
521inside the coroutine at the next convinient point in time (usually after
522it gains control at the next schedule/transfer/cede). Otherwise clears the
523exception object.
524
525The exception object will be thrown "as is" with the specified scalar in
526C<$@>, i.e. if it is a string, no line number or newline will be appended
527(unlike with C<die>).
528
529This can be used as a softer means than C<cancel> to ask a coroutine to
530end itself, although there is no guarentee that the exception will lead to
531termination, and if the exception isn't caught it might well end the whole
532program.
533 505
534=cut 506=cut
535 507
536sub desc { 508sub desc {
537 my $old = $_[0]{desc}; 509 my $old = $_[0]{desc};
538 $_[0]{desc} = $_[1] if @_ > 1; 510 $_[0]{desc} = $_[1] if @_ > 1;
539 $old; 511 $old;
540} 512}
541 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
542=back 519=back
543 520
544=head2 GLOBAL FUNCTIONS 521=head1 GLOBAL FUNCTIONS
545 522
546=over 4 523=over 4
547 524
548=item Coro::nready 525=item Coro::nready
549 526
629# return immediately and can be reused) and because we cannot cede 606# return immediately and can be reused) and because we cannot cede
630# inside an event callback. 607# inside an event callback.
631our $unblock_scheduler = new Coro sub { 608our $unblock_scheduler = new Coro sub {
632 while () { 609 while () {
633 while (my $cb = pop @unblock_queue) { 610 while (my $cb = pop @unblock_queue) {
634 # this is an inlined copy of async_pool 611 &async_pool (@$cb);
635 my $coro = (pop @async_pool) || new Coro \&pool_handler;
636 612
637 $coro->{_invoke} = $cb;
638 $coro->ready;
639 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;
640 } 617 }
641 schedule; # sleep well 618 schedule; # sleep well
642 } 619 }
643}; 620};
644$unblock_scheduler->desc ("[unblock_sub scheduler]"); 621$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
645 622
646sub unblock_sub(&) { 623sub unblock_sub(&) {
647 my $cb = shift; 624 my $cb = shift;
648 625
649 sub { 626 sub {
650 unshift @unblock_queue, [$cb, @_]; 627 unshift @unblock_queue, [$cb, @_];
651 $unblock_scheduler->ready; 628 $unblock_scheduler->ready;
652 } 629 }
653} 630}
654 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
655=back 651=back
656 652
657=cut 653=cut
658 654
6591; 6551;
660 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
661=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")
662 735
663This 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
664module from the same thread (this requirement might be removed in the 737module from the same thread (this requirement might be removed in the
665future 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
666this). I recommend disabling thread support and using processes, as this 739this). I recommend disabling thread support and using processes, as having
667is 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
668 755
669=head1 SEE ALSO 756=head1 SEE ALSO
670 757
671Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 758Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
672 759
673Debugging: L<Coro::Debug>. 760Debugging: L<Coro::Debug>.
674 761
675Support/Utility: L<Coro::Specific>, L<Coro::Util>. 762Support/Utility: L<Coro::Specific>, L<Coro::Util>.
676 763
677Locking/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>.
678 766
679IO/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>.
680 768
681Compatibility: 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>.
682 772
683XS API: L<Coro::MakeMaker>. 773XS API: L<Coro::MakeMaker>.
684 774
685Low level Configuration, Coroutine Environment: L<Coro::State>. 775Low level Configuration, Coroutine Environment: L<Coro::State>.
686 776

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines