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.226 by root, Wed Nov 19 16:01:32 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
150 $self->_destroy 144 $self->_destroy
151 or return; 145 or return;
152 146
153 # call all destruction callbacks 147 # call all destruction callbacks
154 $_->(@{$self->{_status}}) 148 $_->(@{$self->{_status}})
155 for @{(delete $self->{_on_destroy}) || []}; 149 for @{ delete $self->{_on_destroy} || [] };
156} 150}
157 151
158# this coroutine is necessary because a coroutine 152# this coroutine is necessary because a coroutine
159# cannot destroy itself. 153# cannot destroy itself.
160my @destroy; 154our @destroy;
161my $manager; 155our $manager;
162 156
163$manager = new Coro sub { 157$manager = new Coro sub {
164 while () { 158 while () {
165 (shift @destroy)->_cancel 159 (shift @destroy)->_cancel
166 while @destroy; 160 while @destroy;
167 161
168 &schedule; 162 &schedule;
169 } 163 }
170}; 164};
171$manager->desc ("[coro manager]"); 165$manager->{desc} = "[coro manager]";
172$manager->prio (PRIO_MAX); 166$manager->prio (PRIO_MAX);
173 167
174=back 168=back
175 169
176=head2 SIMPLE COROUTINE CREATION 170=head2 SIMPLE COROUTINE CREATION
219terminate or join on it (although you are allowed to), and you get a 213terminate 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 214coroutine that might have executed other code already (which can be good
221or bad :). 215or bad :).
222 216
223On the plus side, this function is faster than creating (and destroying) 217On the plus side, this function is faster than creating (and destroying)
224a completely new coroutine, so if you need a lot of generic coroutines in 218a completly new coroutine, so if you need a lot of generic coroutines in
225quick successsion, use C<async_pool>, not C<async>. 219quick successsion, use C<async_pool>, not C<async>.
226 220
227The code block is executed in an C<eval> context and a warning will be 221The 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 222issued 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> 223C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
233 227
234The priority will be reset to C<0> after each run, tracing will be 228The priority will be reset to C<0> after each run, tracing will be
235disabled, the description will be reset and the default output filehandle 229disabled, the description will be reset and the default output filehandle
236gets restored, so you can change all these. Otherwise the coroutine will 230gets 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 231be 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 232stuff such as C<$/> you I<must needs> revert that change, which is most
239simply done by using local as in: C< local $/ >. 233simply done by using local as in: C<< local $/ >>.
240 234
241The pool size is limited to C<8> idle coroutines (this can be adjusted by 235The 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 236adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
243required. 237coros as required.
244 238
245If you are concerned about pooled coroutines growing a lot because a 239If 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 240single 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 241{ 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 242addition to that, when the stacks used by a handler grows larger than 16kb
265 _pool_2 $cb; 259 _pool_2 $cb;
266 &schedule; 260 &schedule;
267 } 261 }
268 }; 262 };
269 263
264 if ($@) {
270 last if $@ eq "\3async_pool terminate\2\n"; 265 last if $@ eq "\3async_pool terminate\2\n";
271 warn $@ if $@; 266 warn $@;
267 }
272 } 268 }
273} 269}
274 270
275sub async_pool(&@) { 271sub async_pool(&@) {
276 # this is also inlined into the unlock_scheduler 272 # this is also inlined into the unblock_scheduler
277 my $coro = (pop @async_pool) || new Coro \&pool_handler; 273 my $coro = (pop @async_pool) || new Coro \&pool_handler;
278 274
279 $coro->{_invoke} = [@_]; 275 $coro->{_invoke} = [@_];
280 $coro->ready; 276 $coro->ready;
281 277
306This makes C<schedule> I<the> generic method to use to block the current 302This 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 303coroutine and wait for events: first you remember the current coroutine in
308a variable, then arrange for some callback of yours to call C<< ->ready 304a 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 305>> 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, 306yourself 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 307so you need to check whether the event indeed happened, e.g. by storing the
312status in a variable. 308status in a variable.
313 309
314The canonical way to wait on external events is this: 310See 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 311
333=item cede 312=item cede
334 313
335"Cede" to other coroutines. This function puts the current coroutine into 314"Cede" to other coroutines. This function puts the current coroutine into
336the ready queue and calls C<schedule>, which has the effect of giving 315the ready queue and calls C<schedule>, which has the effect of giving
355Kills/terminates/cancels all coroutines except the currently running 334Kills/terminates/cancels all coroutines except the currently running
356one. This is useful after a fork, either in the child or the parent, as 335one. This is useful after a fork, either in the child or the parent, as
357usually only one of them should inherit the running coroutines. 336usually only one of them should inherit the running coroutines.
358 337
359Note that while this will try to free some of the main programs resources, 338Note 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 339you 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. 340program calls this function, there will be some one-time resource leak.
362 341
363=cut 342=cut
364 343
365sub terminate { 344sub terminate {
366 $current->cancel (@_); 345 $current->{_status} = [@_];
346 push @destroy, $current;
347 $manager->ready;
348 do { &schedule } while 1;
367} 349}
368 350
369sub killall { 351sub killall {
370 for (Coro::State::list) { 352 for (Coro::State::list) {
371 $_->cancel 353 $_->cancel
392See C<async> and C<Coro::State::new> for additional info about the 374See C<async> and C<Coro::State::new> for additional info about the
393coroutine environment. 375coroutine environment.
394 376
395=cut 377=cut
396 378
397sub _run_coro { 379sub _terminate {
398 terminate &{+shift}; 380 terminate &{+shift};
399}
400
401sub new {
402 my $class = shift;
403
404 $class->SUPER::new (\&_run_coro, @_)
405} 381}
406 382
407=item $success = $coroutine->ready 383=item $success = $coroutine->ready
408 384
409Put the given coroutine into the end of its ready queue (there is one 385Put 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 390once all the coroutines of higher priority and all coroutines of the same
415priority that were put into the ready queue earlier have been resumed. 391priority that were put into the ready queue earlier have been resumed.
416 392
417=item $is_ready = $coroutine->is_ready 393=item $is_ready = $coroutine->is_ready
418 394
419Return wether the coroutine is currently the ready queue or not, 395Return whether the coroutine is currently the ready queue or not,
420 396
421=item $coroutine->cancel (arg...) 397=item $coroutine->cancel (arg...)
422 398
423Terminates the given coroutine and makes it return the given arguments as 399Terminates the given coroutine and makes it return the given arguments as
424status (default: the empty list). Never returns if the coroutine is the 400status (default: the empty list). Never returns if the coroutine is the
426 402
427=cut 403=cut
428 404
429sub cancel { 405sub cancel {
430 my $self = shift; 406 my $self = shift;
431 $self->{_status} = [@_];
432 407
433 if ($current == $self) { 408 if ($current == $self) {
434 push @destroy, $self; 409 terminate @_;
435 $manager->ready;
436 &schedule while 1;
437 } else { 410 } else {
411 $self->{_status} = [@_];
438 $self->_cancel; 412 $self->_cancel;
439 } 413 }
440} 414}
415
416=item $coroutine->throw ([$scalar])
417
418If C<$throw> is specified and defined, it will be thrown as an exception
419inside the coroutine at the next convenient point in time. Otherwise
420clears the exception object.
421
422Coro will check for the exception each time a schedule-like-function
423returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
424>>, C<< Coro::Handle->readable >> and so on. Most of these functions
425detect this case and return early in case an exception is pending.
426
427The exception object will be thrown "as is" with the specified scalar in
428C<$@>, i.e. if it is a string, no line number or newline will be appended
429(unlike with C<die>).
430
431This can be used as a softer means than C<cancel> to ask a coroutine to
432end itself, although there is no guarantee that the exception will lead to
433termination, and if the exception isn't caught it might well end the whole
434program.
435
436You might also think of C<throw> as being the moral equivalent of
437C<kill>ing a coroutine with a signal (in this case, a scalar).
441 438
442=item $coroutine->join 439=item $coroutine->join
443 440
444Wait until the coroutine terminates and return any values given to the 441Wait until the coroutine terminates and return any values given to the
445C<terminate> or C<cancel> functions. C<join> can be called concurrently 442C<terminate> or C<cancel> functions. C<join> can be called concurrently
507higher values mean lower priority, just as in unix). 504higher values mean lower priority, just as in unix).
508 505
509=item $olddesc = $coroutine->desc ($newdesc) 506=item $olddesc = $coroutine->desc ($newdesc)
510 507
511Sets (or gets in case the argument is missing) the description for this 508Sets (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. 509coroutine. This is just a free-form string you can associate with a
510coroutine.
513 511
514This method simply sets the C<< $coroutine->{desc} >> member to the given string. You 512This method simply sets the C<< $coroutine->{desc} >> member to the given
515can modify this member directly if you wish. 513string. 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 514
533=cut 515=cut
534 516
535sub desc { 517sub desc {
536 my $old = $_[0]{desc}; 518 my $old = $_[0]{desc};
610creating event callbacks that want to block. 592creating event callbacks that want to block.
611 593
612If your handler does not plan to block (e.g. simply sends a message to 594If 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), 595another coroutine, or puts some other coroutine into the ready queue),
614there is no reason to use C<unblock_sub>. 596there is no reason to use C<unblock_sub>.
597
598Note that you also need to use C<unblock_sub> for any other callbacks that
599are indirectly executed by any C-based event loop. For example, when you
600use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
601provides callbacks that are the result of some event callback, then you
602must not block either, or use C<unblock_sub>.
615 603
616=cut 604=cut
617 605
618our @unblock_queue; 606our @unblock_queue;
619 607
632 cede; # for short-lived callbacks, this reduces pressure on the coro pool 620 cede; # for short-lived callbacks, this reduces pressure on the coro pool
633 } 621 }
634 schedule; # sleep well 622 schedule; # sleep well
635 } 623 }
636}; 624};
637$unblock_scheduler->desc ("[unblock_sub scheduler]"); 625$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
638 626
639sub unblock_sub(&) { 627sub unblock_sub(&) {
640 my $cb = shift; 628 my $cb = shift;
641 629
642 sub { 630 sub {
643 unshift @unblock_queue, [$cb, @_]; 631 unshift @unblock_queue, [$cb, @_];
644 $unblock_scheduler->ready; 632 $unblock_scheduler->ready;
645 } 633 }
646} 634}
647 635
636=item $cb = Coro::rouse_cb
637
638Create and return a "rouse callback". That's a code reference that, when
639called, will save its arguments and notify the owner coroutine of the
640callback.
641
642See the next function.
643
644=item @args = Coro::rouse_wait [$cb]
645
646Wait for the specified rouse callback (or the last one tht was created in
647this coroutine).
648
649As soon as the callback is invoked (or when the calback was invoked before
650C<rouse_wait>), it will return a copy of the arguments originally passed
651to the rouse callback.
652
653See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
654
648=back 655=back
649 656
650=cut 657=cut
651 658
6521; 6591;
653 660
661=head1 HOW TO WAIT FOR A CALLBACK
662
663It is very common for a coroutine to wait for some callback to be
664called. This occurs naturally when you use coroutines in an otherwise
665event-based program, or when you use event-based libraries.
666
667These typically register a callback for some event, and call that callback
668when the event occured. In a coroutine, however, you typically want to
669just wait for the event, simplyifying things.
670
671For example C<< AnyEvent->child >> registers a callback to be called when
672a specific child has exited:
673
674 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
675
676But from withina coroutine, you often just want to write this:
677
678 my $status = wait_for_child $pid;
679
680Coro offers two functions specifically designed to make this easy,
681C<Coro::rouse_cb> and C<Coro::rouse_wait>.
682
683The first function, C<rouse_cb>, generates and returns a callback that,
684when invoked, will save it's arguments and notify the coroutine that
685created the callback.
686
687The second function, C<rouse_wait>, waits for the callback to be called
688(by calling C<schedule> to go to sleep) and returns the arguments
689originally passed to the callback.
690
691Using these functions, it becomes easy to write the C<wait_for_child>
692function mentioned above:
693
694 sub wait_for_child($) {
695 my ($pid) = @_;
696
697 my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
698
699 my ($rpid, $rstatus) = Coro::rouse_wait;
700 $rstatus
701 }
702
703In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
704you can roll your own, using C<schedule>:
705
706 sub wait_for_child($) {
707 my ($pid) = @_;
708
709 # store the current coroutine in $current,
710 # and provide result variables for the closure passed to ->child
711 my $current = $Coro::current;
712 my ($done, $rstatus);
713
714 # pass a closure to ->child
715 my $watcher = AnyEvent->child (pid => $pid, cb => sub {
716 $rstatus = $_[1]; # remember rstatus
717 $done = 1; # mark $rstatus as valud
718 });
719
720 # wait until the closure has been called
721 schedule while !$done;
722
723 $rstatus
724 }
725
726
654=head1 BUGS/LIMITATIONS 727=head1 BUGS/LIMITATIONS
728
729=over 4
730
731=item fork with pthread backend
732
733When Coro is compiled using the pthread backend (which isn't recommended
734but required on many BSDs as their libcs are completely broken), then
735coroutines will not survive a fork. There is no known workaround except to
736fix your libc and use a saner backend.
737
738=item perl process emulation ("threads")
655 739
656This module is not perl-pseudo-thread-safe. You should only ever use this 740This 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 741module from the same thread (this requirement might be removed in the
658future to allow per-thread schedulers, but Coro::State does not yet allow 742future to allow per-thread schedulers, but Coro::State does not yet allow
659this). I recommend disabling thread support and using processes, as this 743this). I recommend disabling thread support and using processes, as having
660is much faster and uses less memory. 744the windows process emulation enabled under unix roughly halves perl
745performance, even when not used.
746
747=item coroutine switching not signal safe
748
749You must not switch to another coroutine from within a signal handler
750(only relevant with %SIG - most event libraries provide safe signals).
751
752That means you I<MUST NOT> call any function that might "block" the
753current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
754anything that calls those. Everything else, including calling C<ready>,
755works.
756
757=back
758
661 759
662=head1 SEE ALSO 760=head1 SEE ALSO
663 761
664Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 762Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
665 763

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines