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

Comparing Coro/Coro.pm (file contents):
Revision 1.198 by root, Sun Sep 21 01:23:26 2008 UTC vs.
Revision 1.241 by root, Thu Dec 4 04:31:41 2008 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines