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

Comparing Coro/Coro.pm (file contents):
Revision 1.202 by root, Tue Sep 30 17:12:34 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
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 coroutines, that is, cooperative
40multiple running interpreters that share data, which is especially useful 35threads. Coroutines are similar to kernel threads but don't (in general)
41to 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
42multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to 37of coroutine used in this module also guarantees you that it will not
43learn 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.
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 coroutines
48they serve no purpose whatsoever, except by making your programs slow and 46very easy. And coroutines 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 coroutines is defined as "callchain + lexical variables
53@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 57+ @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own
54its 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
55variables (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.
56 64
57=cut 65=cut
58 66
59package Coro; 67package Coro;
60 68
61use strict; 69use strict qw(vars subs);
62no warnings "uninitialized"; 70no warnings "uninitialized";
63 71
64use Coro::State; 72use Coro::State;
65 73
66use base qw(Coro::State Exporter); 74use base qw(Coro::State Exporter);
67 75
68our $idle; # idle handler 76our $idle; # idle handler
69our $main; # main coroutine 77our $main; # main coroutine
70our $current; # current coroutine 78our $current; # current coroutine
71 79
72our $VERSION = 4.8; 80our $VERSION = "5.0";
73 81
74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 82our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
75our %EXPORT_TAGS = ( 83our %EXPORT_TAGS = (
76 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)],
77); 85);
78our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 86our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
79 87
88=head1 GLOBAL VARIABLES
89
80=over 4 90=over 4
81 91
82=item $Coro::main 92=item $Coro::main
83 93
84This variable stores the coroutine object that represents the main 94This variable stores the coroutine object that represents the main
86coroutines, 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
87whether you are running in the main program or not. 97whether you are running in the main program or not.
88 98
89=cut 99=cut
90 100
91$main = new Coro; 101# $main is now being initialised by Coro::State
92 102
93=item $Coro::current 103=item $Coro::current
94 104
95The coroutine object representing the current coroutine (the last 105The coroutine object representing the current coroutine (the last
96coroutine that the Coro scheduler switched to). The initial value is 106coroutine that the Coro scheduler switched to). The initial value is
97C<$main> (of course). 107C<$Coro::main> (of course).
98 108
99This 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
100value 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
101not otherwise modify the variable itself. 111not otherwise modify the variable itself.
102 112
103=cut 113=cut
104
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 114
113sub current() { $current } # [DEPRECATED] 115sub current() { $current } # [DEPRECATED]
114 116
115=item $Coro::idle 117=item $Coro::idle
116 118
143$idle = sub { 145$idle = sub {
144 require Carp; 146 require Carp;
145 Carp::croak ("FATAL: deadlock detected"); 147 Carp::croak ("FATAL: deadlock detected");
146}; 148};
147 149
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 150# this coroutine is necessary because a coroutine
161# cannot destroy itself. 151# cannot destroy itself.
162my @destroy; 152our @destroy;
163my $manager; 153our $manager;
164 154
165$manager = new Coro sub { 155$manager = new Coro sub {
166 while () { 156 while () {
167 (shift @destroy)->_cancel 157 Coro::_cancel shift @destroy
168 while @destroy; 158 while @destroy;
169 159
170 &schedule; 160 &schedule;
171 } 161 }
172}; 162};
173$manager->desc ("[coro manager]"); 163$manager->{desc} = "[coro manager]";
174$manager->prio (PRIO_MAX); 164$manager->prio (PRIO_MAX);
175 165
176=back 166=back
177 167
178=head2 SIMPLE COROUTINE CREATION 168=head1 SIMPLE COROUTINE CREATION
179 169
180=over 4 170=over 4
181 171
182=item async { ... } [@args...] 172=item async { ... } [@args...]
183 173
220Similar 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
221terminate 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
222coroutine that might have executed other code already (which can be good 212coroutine that might have executed other code already (which can be good
223or bad :). 213or bad :).
224 214
225On 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
226a 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
227quick successsion, use C<async_pool>, not C<async>. 217coroutines in quick successsion, use C<async_pool>, not C<async>.
228 218
229The 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
230issued in case of an exception instead of terminating the program, as 220issued 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> 221C<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, 222will not work in the expected way, unless you call terminate or cancel,
235 225
236The 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
237disabled, the description will be reset and the default output filehandle 227disabled, the description will be reset and the default output filehandle
238gets restored, so you can change all these. Otherwise the coroutine will 228gets 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 229be 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 230stuff such as C<$/> you I<must needs> revert that change, which is most
241simply done by using local as in: C< local $/ >. 231simply done by using local as in: C<< local $/ >>.
242 232
243The 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
244changing $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
245required. 235coros as required.
246 236
247If you are concerned about pooled coroutines growing a lot because a 237If 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 238single 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 239{ 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 240addition to that, when the stacks used by a handler grows larger than 32kb
251(adjustable via $Coro::POOL_RSS) it will also be destroyed. 241(adjustable via $Coro::POOL_RSS) it will also be destroyed.
252 242
253=cut 243=cut
254 244
255our $POOL_SIZE = 8; 245our $POOL_SIZE = 8;
256our $POOL_RSS = 16 * 1024; 246our $POOL_RSS = 32 * 1024;
257our @async_pool; 247our @async_pool;
258 248
259sub pool_handler { 249sub pool_handler {
260 my $cb;
261
262 while () { 250 while () {
263 eval { 251 eval {
264 while () { 252 &{&_pool_handler} while 1;
265 _pool_1 $cb;
266 &$cb;
267 _pool_2 $cb;
268 &schedule;
269 }
270 }; 253 };
271 254
272 if ($@) {
273 last if $@ eq "\3async_pool terminate\2\n";
274 warn $@; 255 warn $@ if $@;
275 }
276 } 256 }
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} 257}
288 258
289=back 259=back
290 260
291=head2 STATIC METHODS 261=head1 STATIC METHODS
292 262
293Static methods are actually functions that operate on the current coroutine. 263Static methods are actually functions that implicitly operate on the
264current coroutine.
294 265
295=over 4 266=over 4
296 267
297=item schedule 268=item schedule
298 269
313>> 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
314yourself 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,
315so you need to check whether the event indeed happened, e.g. by storing the 286so you need to check whether the event indeed happened, e.g. by storing the
316status in a variable. 287status in a variable.
317 288
318The 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.
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 290
337=item cede 291=item cede
338 292
339"Cede" to other coroutines. This function puts the current coroutine into 293"Cede" to other coroutines. This function puts the current coroutine into
340the 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
364you cannot 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
365program calls this function, there will be some one-time resource leak. 319program calls this function, there will be some one-time resource leak.
366 320
367=cut 321=cut
368 322
369sub terminate {
370 $current->cancel (@_);
371}
372
373sub killall { 323sub killall {
374 for (Coro::State::list) { 324 for (Coro::State::list) {
375 $_->cancel 325 $_->cancel
376 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 326 if $_ != $current && UNIVERSAL::isa $_, "Coro";
377 } 327 }
378} 328}
379 329
380=back 330=back
381 331
382=head2 COROUTINE METHODS 332=head1 COROUTINE OBJECT METHODS
383 333
384These 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
385them). 335them).
386 336
387=over 4 337=over 4
396See 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
397coroutine environment. 347coroutine environment.
398 348
399=cut 349=cut
400 350
401sub _run_coro { 351sub _terminate {
402 terminate &{+shift}; 352 terminate &{+shift};
403}
404
405sub new {
406 my $class = shift;
407
408 $class->SUPER::new (\&_run_coro, @_)
409} 353}
410 354
411=item $success = $coroutine->ready 355=item $success = $coroutine->ready
412 356
413Put 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
430 374
431=cut 375=cut
432 376
433sub cancel { 377sub cancel {
434 my $self = shift; 378 my $self = shift;
435 $self->{_status} = [@_];
436 379
437 if ($current == $self) { 380 if ($current == $self) {
438 push @destroy, $self; 381 terminate @_;
439 $manager->ready;
440 &schedule while 1;
441 } else { 382 } else {
383 $self->{_status} = [@_];
442 $self->_cancel; 384 $self->_cancel;
443 } 385 }
444} 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).
445 429
446=item $coroutine->join 430=item $coroutine->join
447 431
448Wait until the coroutine terminates and return any values given to the 432Wait until the coroutine terminates and return any values given to the
449C<terminate> or C<cancel> functions. C<join> can be called concurrently 433C<terminate> or C<cancel> functions. C<join> can be called concurrently
511higher values mean lower priority, just as in unix). 495higher values mean lower priority, just as in unix).
512 496
513=item $olddesc = $coroutine->desc ($newdesc) 497=item $olddesc = $coroutine->desc ($newdesc)
514 498
515Sets (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
516coroutine. 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.
517 502
518This 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
519can modify this member directly if you wish. 504string. 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 505
537=cut 506=cut
538 507
539sub desc { 508sub desc {
540 my $old = $_[0]{desc}; 509 my $old = $_[0]{desc};
541 $_[0]{desc} = $_[1] if @_ > 1; 510 $_[0]{desc} = $_[1] if @_ > 1;
542 $old; 511 $old;
543} 512}
544 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
545=back 519=back
546 520
547=head2 GLOBAL FUNCTIONS 521=head1 GLOBAL FUNCTIONS
548 522
549=over 4 523=over 4
550 524
551=item Coro::nready 525=item Coro::nready
552 526
632# return immediately and can be reused) and because we cannot cede 606# return immediately and can be reused) and because we cannot cede
633# inside an event callback. 607# inside an event callback.
634our $unblock_scheduler = new Coro sub { 608our $unblock_scheduler = new Coro sub {
635 while () { 609 while () {
636 while (my $cb = pop @unblock_queue) { 610 while (my $cb = pop @unblock_queue) {
637 # this is an inlined copy of async_pool 611 &async_pool (@$cb);
638 my $coro = (pop @async_pool) || new Coro \&pool_handler;
639 612
640 $coro->{_invoke} = $cb;
641 $coro->ready;
642 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;
643 } 617 }
644 schedule; # sleep well 618 schedule; # sleep well
645 } 619 }
646}; 620};
647$unblock_scheduler->desc ("[unblock_sub scheduler]"); 621$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
648 622
649sub unblock_sub(&) { 623sub unblock_sub(&) {
650 my $cb = shift; 624 my $cb = shift;
651 625
652 sub { 626 sub {
653 unshift @unblock_queue, [$cb, @_]; 627 unshift @unblock_queue, [$cb, @_];
654 $unblock_scheduler->ready; 628 $unblock_scheduler->ready;
655 } 629 }
656} 630}
657 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
658=back 651=back
659 652
660=cut 653=cut
661 654
6621; 6551;
663 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
664=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")
665 735
666This 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
667module from the same thread (this requirement might be removed in the 737module from the same thread (this requirement might be removed in the
668future 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
669this). I recommend disabling thread support and using processes, as this 739this). I recommend disabling thread support and using processes, as having
670is 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
671 755
672=head1 SEE ALSO 756=head1 SEE ALSO
673 757
674Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 758Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
675 759
676Debugging: L<Coro::Debug>. 760Debugging: L<Coro::Debug>.
677 761
678Support/Utility: L<Coro::Specific>, L<Coro::Util>. 762Support/Utility: L<Coro::Specific>, L<Coro::Util>.
679 763
680Locking/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>.
681 766
682IO/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>.
683 768
684Compatibility: 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>.
685 772
686XS API: L<Coro::MakeMaker>. 773XS API: L<Coro::MakeMaker>.
687 774
688Low level Configuration, Coroutine Environment: L<Coro::State>. 775Low level Configuration, Coroutine Environment: L<Coro::State>.
689 776

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines