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.230 by root, Thu Nov 20 07:02:43 2008 UTC

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;
35parallel access are rarely an issue, making coroutine programming much 36parallel access are rarely an issue, making coroutine programming much
36safer and easier than threads programming. 37safer and easier than threads programming.
37 38
38Unlike a normal perl program, however, coroutines allow you to have 39Unlike a normal perl program, however, coroutines allow you to have
39multiple running interpreters that share data, which is especially useful 40multiple running interpreters that share data, which is especially useful
40to code pseudo-parallel processes, such as multiple HTTP-GET requests 41to code pseudo-parallel processes and for event-based programming, such as
41running concurrently. 42multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to
43learn more.
42 44
43Coroutines are also useful because Perl has no support for threads (the so 45Coroutines are also useful because Perl has no support for threads (the so
44called "threads" that perl offers are nothing more than the (bad) process 46called "threads" that perl offers are nothing more than the (bad) process
45emulation coming from the Windows platform: On standard operating systems 47emulation coming from the Windows platform: On standard operating systems
46they serve no purpose whatsoever, except by making your programs slow and 48they serve no purpose whatsoever, except by making your programs slow and
54 56
55=cut 57=cut
56 58
57package Coro; 59package Coro;
58 60
59use strict; 61use strict qw(vars subs);
60no warnings "uninitialized"; 62no warnings "uninitialized";
61 63
62use Coro::State; 64use Coro::State;
63 65
64use base qw(Coro::State Exporter); 66use base qw(Coro::State Exporter);
65 67
66our $idle; # idle handler 68our $idle; # idle handler
67our $main; # main coroutine 69our $main; # main coroutine
68our $current; # current coroutine 70our $current; # current coroutine
69 71
70our $VERSION = 4.6; 72our $VERSION = 5.0;
71 73
72our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
73our %EXPORT_TAGS = ( 75our %EXPORT_TAGS = (
74 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)],
75); 77);
80=item $Coro::main 82=item $Coro::main
81 83
82This variable stores the coroutine object that represents the main 84This 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 85program. 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 86coroutines, it is mainly useful to compare again C<$Coro::current>, to see
85wether you are running in the main program or not. 87whether you are running in the main program or not.
86 88
87=cut 89=cut
88 90
89$main = new Coro; 91# $main is now being initialised by Coro::State
90 92
91=item $Coro::current 93=item $Coro::current
92 94
93The coroutine object representing the current coroutine (the last 95The coroutine object representing the current coroutine (the last
94coroutine that the Coro scheduler switched to). The initial value is 96coroutine that the Coro scheduler switched to). The initial value is
95C<$main> (of course). 97C<$Coro::main> (of course).
96 98
97This 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
98value 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
99not otherwise modify the variable itself. 101not otherwise modify the variable itself.
100 102
101=cut 103=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 104
111sub current() { $current } # [DEPRECATED] 105sub current() { $current } # [DEPRECATED]
112 106
113=item $Coro::idle 107=item $Coro::idle
114 108
141$idle = sub { 135$idle = sub {
142 require Carp; 136 require Carp;
143 Carp::croak ("FATAL: deadlock detected"); 137 Carp::croak ("FATAL: deadlock detected");
144}; 138};
145 139
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 140# this coroutine is necessary because a coroutine
159# cannot destroy itself. 141# cannot destroy itself.
160my @destroy; 142our @destroy;
161my $manager; 143our $manager;
162 144
163$manager = new Coro sub { 145$manager = new Coro sub {
164 while () { 146 while () {
165 (shift @destroy)->_cancel 147 Coro::_cancel shift @destroy
166 while @destroy; 148 while @destroy;
167 149
168 &schedule; 150 &schedule;
169 } 151 }
170}; 152};
171$manager->desc ("[coro manager]"); 153$manager->{desc} = "[coro manager]";
172$manager->prio (PRIO_MAX); 154$manager->prio (PRIO_MAX);
173 155
174=back 156=back
175 157
176=head2 SIMPLE COROUTINE CREATION 158=head2 SIMPLE COROUTINE CREATION
218Similar 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
219terminate 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
220coroutine that might have executed other code already (which can be good 202coroutine that might have executed other code already (which can be good
221or bad :). 203or bad :).
222 204
223On 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
224a completely 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
225quick successsion, use C<async_pool>, not C<async>. 207coroutines in quick successsion, use C<async_pool>, not C<async>.
226 208
227The 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
228issued in case of an exception instead of terminating the program, as 210issued 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> 211C<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, 212will not work in the expected way, unless you call terminate or cancel,
233 215
234The priority will be reset to C<0> after each run, tracing will be 216The priority will be reset to C<0> after each run, tracing will be
235disabled, the description will be reset and the default output filehandle 217disabled, the description will be reset and the default output filehandle
236gets restored, so you can change all these. Otherwise the coroutine will 218gets 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 219be 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 220stuff such as C<$/> you I<must needs> revert that change, which is most
239simply done by using local as in: C< local $/ >. 221simply done by using local as in: C<< local $/ >>.
240 222
241The pool size is limited to C<8> idle coroutines (this can be adjusted by 223The 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 224adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
243required. 225coros as required.
244 226
245If you are concerned about pooled coroutines growing a lot because a 227If 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 228single 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 229{ 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 230addition to that, when the stacks used by a handler grows larger than 16kb
253our $POOL_SIZE = 8; 235our $POOL_SIZE = 8;
254our $POOL_RSS = 16 * 1024; 236our $POOL_RSS = 16 * 1024;
255our @async_pool; 237our @async_pool;
256 238
257sub pool_handler { 239sub pool_handler {
258 my $cb;
259
260 while () { 240 while () {
261 eval { 241 eval {
262 while () { 242 &{&_pool_handler} while 1;
263 _pool_1 $cb;
264 &$cb;
265 _pool_2 $cb;
266 &schedule;
267 }
268 }; 243 };
269 244
270 last if $@ eq "\3async_pool terminate\2\n";
271 warn $@ if $@; 245 warn $@ if $@;
272 } 246 }
273}
274
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} 247}
284 248
285=back 249=back
286 250
287=head2 STATIC METHODS 251=head2 STATIC METHODS
306This makes C<schedule> I<the> generic method to use to block the current 270This 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 271coroutine and wait for events: first you remember the current coroutine in
308a variable, then arrange for some callback of yours to call C<< ->ready 272a 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 273>> 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, 274yourself 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 275so you need to check whether the event indeed happened, e.g. by storing the
312status in a variable. 276status in a variable.
313 277
314The 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.
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 279
333=item cede 280=item cede
334 281
335"Cede" to other coroutines. This function puts the current coroutine into 282"Cede" to other coroutines. This function puts the current coroutine into
336the 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
355Kills/terminates/cancels all coroutines except the currently running 302Kills/terminates/cancels all coroutines except the currently running
356one. This is useful after a fork, either in the child or the parent, as 303one. This is useful after a fork, either in the child or the parent, as
357usually only one of them should inherit the running coroutines. 304usually only one of them should inherit the running coroutines.
358 305
359Note that while this will try to free some of the main programs resources, 306Note 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 307you 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. 308program calls this function, there will be some one-time resource leak.
362 309
363=cut 310=cut
364
365sub terminate {
366 $current->cancel (@_);
367}
368 311
369sub killall { 312sub killall {
370 for (Coro::State::list) { 313 for (Coro::State::list) {
371 $_->cancel 314 $_->cancel
372 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 315 if $_ != $current && UNIVERSAL::isa $_, "Coro";
392See 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
393coroutine environment. 336coroutine environment.
394 337
395=cut 338=cut
396 339
397sub _run_coro { 340sub _terminate {
398 terminate &{+shift}; 341 terminate &{+shift};
399}
400
401sub new {
402 my $class = shift;
403
404 $class->SUPER::new (\&_run_coro, @_)
405} 342}
406 343
407=item $success = $coroutine->ready 344=item $success = $coroutine->ready
408 345
409Put 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
414once all the coroutines of higher priority and all coroutines of the same 351once all the coroutines of higher priority and all coroutines of the same
415priority that were put into the ready queue earlier have been resumed. 352priority that were put into the ready queue earlier have been resumed.
416 353
417=item $is_ready = $coroutine->is_ready 354=item $is_ready = $coroutine->is_ready
418 355
419Return wether the coroutine is currently the ready queue or not, 356Return whether the coroutine is currently the ready queue or not,
420 357
421=item $coroutine->cancel (arg...) 358=item $coroutine->cancel (arg...)
422 359
423Terminates the given coroutine and makes it return the given arguments as 360Terminates the given coroutine and makes it return the given arguments as
424status (default: the empty list). Never returns if the coroutine is the 361status (default: the empty list). Never returns if the coroutine is the
426 363
427=cut 364=cut
428 365
429sub cancel { 366sub cancel {
430 my $self = shift; 367 my $self = shift;
431 $self->{_status} = [@_];
432 368
433 if ($current == $self) { 369 if ($current == $self) {
434 push @destroy, $self; 370 terminate @_;
435 $manager->ready;
436 &schedule while 1;
437 } else { 371 } else {
372 $self->{_status} = [@_];
438 $self->_cancel; 373 $self->_cancel;
439 } 374 }
440} 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).
441 418
442=item $coroutine->join 419=item $coroutine->join
443 420
444Wait until the coroutine terminates and return any values given to the 421Wait until the coroutine terminates and return any values given to the
445C<terminate> or C<cancel> functions. C<join> can be called concurrently 422C<terminate> or C<cancel> functions. C<join> can be called concurrently
507higher values mean lower priority, just as in unix). 484higher values mean lower priority, just as in unix).
508 485
509=item $olddesc = $coroutine->desc ($newdesc) 486=item $olddesc = $coroutine->desc ($newdesc)
510 487
511Sets (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
512coroutine. 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.
513 491
514This 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
515can modify this member directly if you wish. 493string. 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 494
533=cut 495=cut
534 496
535sub desc { 497sub desc {
536 my $old = $_[0]{desc}; 498 my $old = $_[0]{desc};
610creating event callbacks that want to block. 572creating event callbacks that want to block.
611 573
612If your handler does not plan to block (e.g. simply sends a message to 574If 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), 575another coroutine, or puts some other coroutine into the ready queue),
614there is no reason to use C<unblock_sub>. 576there is no reason to use C<unblock_sub>.
577
578Note that you also need to use C<unblock_sub> for any other callbacks that
579are indirectly executed by any C-based event loop. For example, when you
580use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
581provides callbacks that are the result of some event callback, then you
582must not block either, or use C<unblock_sub>.
615 583
616=cut 584=cut
617 585
618our @unblock_queue; 586our @unblock_queue;
619 587
622# return immediately and can be reused) and because we cannot cede 590# return immediately and can be reused) and because we cannot cede
623# inside an event callback. 591# inside an event callback.
624our $unblock_scheduler = new Coro sub { 592our $unblock_scheduler = new Coro sub {
625 while () { 593 while () {
626 while (my $cb = pop @unblock_queue) { 594 while (my $cb = pop @unblock_queue) {
627 # this is an inlined copy of async_pool 595 &async_pool (@$cb);
628 my $coro = (pop @async_pool) || new Coro \&pool_handler;
629 596
630 $coro->{_invoke} = $cb;
631 $coro->ready;
632 cede; # for short-lived callbacks, this reduces pressure on the coro pool 597 # for short-lived callbacks, this reduces pressure on the coro pool
598 # as the chance is very high that the async_poll coro will be back
599 # in the idle state when cede returns
600 cede;
633 } 601 }
634 schedule; # sleep well 602 schedule; # sleep well
635 } 603 }
636}; 604};
637$unblock_scheduler->desc ("[unblock_sub scheduler]"); 605$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
638 606
639sub unblock_sub(&) { 607sub unblock_sub(&) {
640 my $cb = shift; 608 my $cb = shift;
641 609
642 sub { 610 sub {
643 unshift @unblock_queue, [$cb, @_]; 611 unshift @unblock_queue, [$cb, @_];
644 $unblock_scheduler->ready; 612 $unblock_scheduler->ready;
645 } 613 }
646} 614}
647 615
616=item $cb = Coro::rouse_cb
617
618Create and return a "rouse callback". That's a code reference that, when
619called, will save its arguments and notify the owner coroutine of the
620callback.
621
622See the next function.
623
624=item @args = Coro::rouse_wait [$cb]
625
626Wait for the specified rouse callback (or the last one tht was created in
627this coroutine).
628
629As soon as the callback is invoked (or when the calback was invoked before
630C<rouse_wait>), it will return a copy of the arguments originally passed
631to the rouse callback.
632
633See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
634
648=back 635=back
649 636
650=cut 637=cut
651 638
6521; 6391;
653 640
641=head1 HOW TO WAIT FOR A CALLBACK
642
643It is very common for a coroutine to wait for some callback to be
644called. This occurs naturally when you use coroutines in an otherwise
645event-based program, or when you use event-based libraries.
646
647These typically register a callback for some event, and call that callback
648when the event occured. In a coroutine, however, you typically want to
649just wait for the event, simplyifying things.
650
651For example C<< AnyEvent->child >> registers a callback to be called when
652a specific child has exited:
653
654 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
655
656But from withina coroutine, you often just want to write this:
657
658 my $status = wait_for_child $pid;
659
660Coro offers two functions specifically designed to make this easy,
661C<Coro::rouse_cb> and C<Coro::rouse_wait>.
662
663The first function, C<rouse_cb>, generates and returns a callback that,
664when invoked, will save it's arguments and notify the coroutine that
665created the callback.
666
667The second function, C<rouse_wait>, waits for the callback to be called
668(by calling C<schedule> to go to sleep) and returns the arguments
669originally passed to the callback.
670
671Using these functions, it becomes easy to write the C<wait_for_child>
672function mentioned above:
673
674 sub wait_for_child($) {
675 my ($pid) = @_;
676
677 my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
678
679 my ($rpid, $rstatus) = Coro::rouse_wait;
680 $rstatus
681 }
682
683In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
684you can roll your own, using C<schedule>:
685
686 sub wait_for_child($) {
687 my ($pid) = @_;
688
689 # store the current coroutine in $current,
690 # and provide result variables for the closure passed to ->child
691 my $current = $Coro::current;
692 my ($done, $rstatus);
693
694 # pass a closure to ->child
695 my $watcher = AnyEvent->child (pid => $pid, cb => sub {
696 $rstatus = $_[1]; # remember rstatus
697 $done = 1; # mark $rstatus as valud
698 });
699
700 # wait until the closure has been called
701 schedule while !$done;
702
703 $rstatus
704 }
705
706
654=head1 BUGS/LIMITATIONS 707=head1 BUGS/LIMITATIONS
708
709=over 4
710
711=item fork with pthread backend
712
713When Coro is compiled using the pthread backend (which isn't recommended
714but required on many BSDs as their libcs are completely broken), then
715coroutines will not survive a fork. There is no known workaround except to
716fix your libc and use a saner backend.
717
718=item perl process emulation ("threads")
655 719
656This module is not perl-pseudo-thread-safe. You should only ever use this 720This 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 721module from the same thread (this requirement might be removed in the
658future to allow per-thread schedulers, but Coro::State does not yet allow 722future to allow per-thread schedulers, but Coro::State does not yet allow
659this). I recommend disabling thread support and using processes, as this 723this). I recommend disabling thread support and using processes, as having
660is much faster and uses less memory. 724the windows process emulation enabled under unix roughly halves perl
725performance, even when not used.
726
727=item coroutine switching not signal safe
728
729You must not switch to another coroutine from within a signal handler
730(only relevant with %SIG - most event libraries provide safe signals).
731
732That means you I<MUST NOT> call any function that might "block" the
733current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
734anything that calls those. Everything else, including calling C<ready>,
735works.
736
737=back
738
661 739
662=head1 SEE ALSO 740=head1 SEE ALSO
663 741
664Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 742Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
665 743

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines