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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines