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

Comparing Coro/Coro.pm (file contents):
Revision 1.204 by root, Sat Oct 4 23:26:30 2008 UTC vs.
Revision 1.233 by root, Fri Nov 21 06:02:07 2008 UTC

56 56
57=cut 57=cut
58 58
59package Coro; 59package Coro;
60 60
61use strict; 61use strict qw(vars subs);
62no warnings "uninitialized"; 62no warnings "uninitialized";
63 63
64use Coro::State; 64use Coro::State;
65 65
66use base qw(Coro::State Exporter); 66use base qw(Coro::State Exporter);
67 67
68our $idle; # idle handler 68our $idle; # idle handler
69our $main; # main coroutine 69our $main; # main coroutine
70our $current; # current coroutine 70our $current; # current coroutine
71 71
72our $VERSION = 4.8; 72our $VERSION = "5.0";
73 73
74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
75our %EXPORT_TAGS = ( 75our %EXPORT_TAGS = (
76 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 76 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
77); 77);
86coroutines, it is mainly useful to compare again C<$Coro::current>, to see 86coroutines, it is mainly useful to compare again C<$Coro::current>, to see
87whether you are running in the main program or not. 87whether you are running in the main program or not.
88 88
89=cut 89=cut
90 90
91$main = new Coro; 91# $main is now being initialised by Coro::State
92 92
93=item $Coro::current 93=item $Coro::current
94 94
95The coroutine object representing the current coroutine (the last 95The coroutine object representing the current coroutine (the last
96coroutine that the Coro scheduler switched to). The initial value is 96coroutine that the Coro scheduler switched to). The initial value is
97C<$main> (of course). 97C<$Coro::main> (of course).
98 98
99This variable is B<strictly> I<read-only>. You can take copies of the 99This 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 100value stored in it and use it as any other coroutine object, but you must
101not otherwise modify the variable itself. 101not otherwise modify the variable itself.
102 102
103=cut 103=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 104
113sub current() { $current } # [DEPRECATED] 105sub current() { $current } # [DEPRECATED]
114 106
115=item $Coro::idle 107=item $Coro::idle
116 108
143$idle = sub { 135$idle = sub {
144 require Carp; 136 require Carp;
145 Carp::croak ("FATAL: deadlock detected"); 137 Carp::croak ("FATAL: deadlock detected");
146}; 138};
147 139
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 140# this coroutine is necessary because a coroutine
161# cannot destroy itself. 141# cannot destroy itself.
162my @destroy; 142our @destroy;
163my $manager; 143our $manager;
164 144
165$manager = new Coro sub { 145$manager = new Coro sub {
166 while () { 146 while () {
167 (shift @destroy)->_cancel 147 Coro::_cancel shift @destroy
168 while @destroy; 148 while @destroy;
169 149
170 &schedule; 150 &schedule;
171 } 151 }
172}; 152};
173$manager->desc ("[coro manager]"); 153$manager->{desc} = "[coro manager]";
174$manager->prio (PRIO_MAX); 154$manager->prio (PRIO_MAX);
175 155
176=back 156=back
177 157
178=head2 SIMPLE COROUTINE CREATION 158=head2 SIMPLE COROUTINE CREATION
220Similar to C<async>, but uses a coroutine pool, so you should not call 200Similar 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 201terminate 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 202coroutine that might have executed other code already (which can be good
223or bad :). 203or bad :).
224 204
225On the plus side, this function is faster than creating (and destroying) 205On the plus side, this function is about twice as fast as creating (and
226a completly new coroutine, so if you need a lot of generic coroutines in 206destroying) a completely new coroutine, so if you need a lot of generic
227quick successsion, use C<async_pool>, not C<async>. 207coroutines in quick successsion, use C<async_pool>, not C<async>.
228 208
229The code block is executed in an C<eval> context and a warning will be 209The 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 210issued 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> 211C<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, 212will not work in the expected way, unless you call terminate or cancel,
245coros as required. 225coros as required.
246 226
247If you are concerned about pooled coroutines growing a lot because a 227If 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 228single 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 229{ 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 230addition to that, when the stacks used by a handler grows larger than 32kb
251(adjustable via $Coro::POOL_RSS) it will also be destroyed. 231(adjustable via $Coro::POOL_RSS) it will also be destroyed.
252 232
253=cut 233=cut
254 234
255our $POOL_SIZE = 8; 235our $POOL_SIZE = 8;
256our $POOL_RSS = 16 * 1024; 236our $POOL_RSS = 32 * 1024;
257our @async_pool; 237our @async_pool;
258 238
259sub pool_handler { 239sub pool_handler {
260 my $cb;
261
262 while () { 240 while () {
263 eval { 241 eval {
264 while () { 242 &{&_pool_handler} while 1;
265 _pool_1 $cb;
266 &$cb;
267 _pool_2 $cb;
268 &schedule;
269 }
270 }; 243 };
271 244
272 if ($@) {
273 last if $@ eq "\3async_pool terminate\2\n";
274 warn $@; 245 warn $@ if $@;
275 }
276 } 246 }
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} 247}
288 248
289=back 249=back
290 250
291=head2 STATIC METHODS 251=head2 STATIC METHODS
313>> on that once some event happens, and last you call C<schedule> to put 273>> 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, 274yourself 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 275so you need to check whether the event indeed happened, e.g. by storing the
316status in a variable. 276status in a variable.
317 277
318The canonical way to wait on external events is this: 278See 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 279
337=item cede 280=item cede
338 281
339"Cede" to other coroutines. This function puts the current coroutine into 282"Cede" to other coroutines. This function puts the current coroutine into
340the ready queue and calls C<schedule>, which has the effect of giving 283the 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 307you 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. 308program calls this function, there will be some one-time resource leak.
366 309
367=cut 310=cut
368 311
369sub terminate {
370 $current->cancel (@_);
371}
372
373sub killall { 312sub killall {
374 for (Coro::State::list) { 313 for (Coro::State::list) {
375 $_->cancel 314 $_->cancel
376 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 315 if $_ != $current && UNIVERSAL::isa $_, "Coro";
377 } 316 }
396See C<async> and C<Coro::State::new> for additional info about the 335See C<async> and C<Coro::State::new> for additional info about the
397coroutine environment. 336coroutine environment.
398 337
399=cut 338=cut
400 339
401sub _run_coro { 340sub _terminate {
402 terminate &{+shift}; 341 terminate &{+shift};
403}
404
405sub new {
406 my $class = shift;
407
408 $class->SUPER::new (\&_run_coro, @_)
409} 342}
410 343
411=item $success = $coroutine->ready 344=item $success = $coroutine->ready
412 345
413Put the given coroutine into the end of its ready queue (there is one 346Put the given coroutine into the end of its ready queue (there is one
430 363
431=cut 364=cut
432 365
433sub cancel { 366sub cancel {
434 my $self = shift; 367 my $self = shift;
435 $self->{_status} = [@_];
436 368
437 if ($current == $self) { 369 if ($current == $self) {
438 push @destroy, $self; 370 terminate @_;
439 $manager->ready;
440 &schedule while 1;
441 } else { 371 } else {
372 $self->{_status} = [@_];
442 $self->_cancel; 373 $self->_cancel;
443 } 374 }
444} 375}
376
377=item $coroutine->schedule_to
378
379Puts the current coroutine to sleep (like C<Coro::schedule>), but instead
380of continuing with the next coro from the ready queue, always switch to
381the given coroutine object (regardless of priority etc.). The readyness
382state of that coroutine isn't changed.
383
384This is an advanced method for special cases - I'd love to hear about any
385uses for this one.
386
387=item $coroutine->cede_to
388
389Like C<schedule_to>, but puts the current coroutine into the ready
390queue. This has the effect of temporarily switching to the given
391coroutine, and continuing some time later.
392
393This is an advanced method for special cases - I'd love to hear about any
394uses for this one.
395
396=item $coroutine->throw ([$scalar])
397
398If C<$throw> is specified and defined, it will be thrown as an exception
399inside the coroutine at the next convenient point in time. Otherwise
400clears the exception object.
401
402Coro will check for the exception each time a schedule-like-function
403returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
404>>, C<< Coro::Handle->readable >> and so on. Most of these functions
405detect this case and return early in case an exception is pending.
406
407The exception object will be thrown "as is" with the specified scalar in
408C<$@>, i.e. if it is a string, no line number or newline will be appended
409(unlike with C<die>).
410
411This can be used as a softer means than C<cancel> to ask a coroutine to
412end itself, although there is no guarantee that the exception will lead to
413termination, and if the exception isn't caught it might well end the whole
414program.
415
416You might also think of C<throw> as being the moral equivalent of
417C<kill>ing a coroutine with a signal (in this case, a scalar).
445 418
446=item $coroutine->join 419=item $coroutine->join
447 420
448Wait until the coroutine terminates and return any values given to the 421Wait until the coroutine terminates and return any values given to the
449C<terminate> or C<cancel> functions. C<join> can be called concurrently 422C<terminate> or C<cancel> functions. C<join> can be called concurrently
511higher values mean lower priority, just as in unix). 484higher values mean lower priority, just as in unix).
512 485
513=item $olddesc = $coroutine->desc ($newdesc) 486=item $olddesc = $coroutine->desc ($newdesc)
514 487
515Sets (or gets in case the argument is missing) the description for this 488Sets (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. 489coroutine. This is just a free-form string you can associate with a
490coroutine.
517 491
518This method simply sets the C<< $coroutine->{desc} >> member to the given string. You 492This method simply sets the C<< $coroutine->{desc} >> member to the given
519can modify this member directly if you wish. 493string. 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 494
537=cut 495=cut
538 496
539sub desc { 497sub desc {
540 my $old = $_[0]{desc}; 498 my $old = $_[0]{desc};
541 $_[0]{desc} = $_[1] if @_ > 1; 499 $_[0]{desc} = $_[1] if @_ > 1;
542 $old; 500 $old;
501}
502
503sub transfer {
504 require Carp;
505 Carp::croak ("You must not call ->transfer on Coro objects. Use Coro::State objects or the ->schedule_to method. Caught");
543} 506}
544 507
545=back 508=back
546 509
547=head2 GLOBAL FUNCTIONS 510=head2 GLOBAL FUNCTIONS
632# return immediately and can be reused) and because we cannot cede 595# return immediately and can be reused) and because we cannot cede
633# inside an event callback. 596# inside an event callback.
634our $unblock_scheduler = new Coro sub { 597our $unblock_scheduler = new Coro sub {
635 while () { 598 while () {
636 while (my $cb = pop @unblock_queue) { 599 while (my $cb = pop @unblock_queue) {
637 # this is an inlined copy of async_pool 600 &async_pool (@$cb);
638 my $coro = (pop @async_pool) || new Coro \&pool_handler;
639 601
640 $coro->{_invoke} = $cb;
641 $coro->ready;
642 cede; # for short-lived callbacks, this reduces pressure on the coro pool 602 # for short-lived callbacks, this reduces pressure on the coro pool
603 # as the chance is very high that the async_poll coro will be back
604 # in the idle state when cede returns
605 cede;
643 } 606 }
644 schedule; # sleep well 607 schedule; # sleep well
645 } 608 }
646}; 609};
647$unblock_scheduler->desc ("[unblock_sub scheduler]"); 610$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
648 611
649sub unblock_sub(&) { 612sub unblock_sub(&) {
650 my $cb = shift; 613 my $cb = shift;
651 614
652 sub { 615 sub {
653 unshift @unblock_queue, [$cb, @_]; 616 unshift @unblock_queue, [$cb, @_];
654 $unblock_scheduler->ready; 617 $unblock_scheduler->ready;
655 } 618 }
656} 619}
657 620
621=item $cb = Coro::rouse_cb
622
623Create and return a "rouse callback". That's a code reference that, when
624called, will save its arguments and notify the owner coroutine of the
625callback.
626
627See the next function.
628
629=item @args = Coro::rouse_wait [$cb]
630
631Wait for the specified rouse callback (or the last one tht was created in
632this coroutine).
633
634As soon as the callback is invoked (or when the calback was invoked before
635C<rouse_wait>), it will return a copy of the arguments originally passed
636to the rouse callback.
637
638See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
639
658=back 640=back
659 641
660=cut 642=cut
661 643
6621; 6441;
663 645
646=head1 HOW TO WAIT FOR A CALLBACK
647
648It is very common for a coroutine to wait for some callback to be
649called. This occurs naturally when you use coroutines in an otherwise
650event-based program, or when you use event-based libraries.
651
652These typically register a callback for some event, and call that callback
653when the event occured. In a coroutine, however, you typically want to
654just wait for the event, simplyifying things.
655
656For example C<< AnyEvent->child >> registers a callback to be called when
657a specific child has exited:
658
659 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
660
661But from withina coroutine, you often just want to write this:
662
663 my $status = wait_for_child $pid;
664
665Coro offers two functions specifically designed to make this easy,
666C<Coro::rouse_cb> and C<Coro::rouse_wait>.
667
668The first function, C<rouse_cb>, generates and returns a callback that,
669when invoked, will save it's arguments and notify the coroutine that
670created the callback.
671
672The second function, C<rouse_wait>, waits for the callback to be called
673(by calling C<schedule> to go to sleep) and returns the arguments
674originally passed to the callback.
675
676Using these functions, it becomes easy to write the C<wait_for_child>
677function mentioned above:
678
679 sub wait_for_child($) {
680 my ($pid) = @_;
681
682 my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
683
684 my ($rpid, $rstatus) = Coro::rouse_wait;
685 $rstatus
686 }
687
688In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
689you can roll your own, using C<schedule>:
690
691 sub wait_for_child($) {
692 my ($pid) = @_;
693
694 # store the current coroutine in $current,
695 # and provide result variables for the closure passed to ->child
696 my $current = $Coro::current;
697 my ($done, $rstatus);
698
699 # pass a closure to ->child
700 my $watcher = AnyEvent->child (pid => $pid, cb => sub {
701 $rstatus = $_[1]; # remember rstatus
702 $done = 1; # mark $rstatus as valud
703 });
704
705 # wait until the closure has been called
706 schedule while !$done;
707
708 $rstatus
709 }
710
711
664=head1 BUGS/LIMITATIONS 712=head1 BUGS/LIMITATIONS
713
714=over 4
715
716=item fork with pthread backend
717
718When Coro is compiled using the pthread backend (which isn't recommended
719but required on many BSDs as their libcs are completely broken), then
720coroutines will not survive a fork. There is no known workaround except to
721fix your libc and use a saner backend.
722
723=item perl process emulation ("threads")
665 724
666This module is not perl-pseudo-thread-safe. You should only ever use this 725This 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 726module from the same thread (this requirement might be removed in the
668future to allow per-thread schedulers, but Coro::State does not yet allow 727future to allow per-thread schedulers, but Coro::State does not yet allow
669this). I recommend disabling thread support and using processes, as this 728this). I recommend disabling thread support and using processes, as having
670is much faster and uses less memory. 729the windows process emulation enabled under unix roughly halves perl
730performance, even when not used.
731
732=item coroutine switching not signal safe
733
734You must not switch to another coroutine from within a signal handler
735(only relevant with %SIG - most event libraries provide safe signals).
736
737That means you I<MUST NOT> call any function that might "block" the
738current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
739anything that calls those. Everything else, including calling C<ready>,
740works.
741
742=back
743
671 744
672=head1 SEE ALSO 745=head1 SEE ALSO
673 746
674Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 747Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
675 748

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines