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.220 by root, Sun Nov 16 11:12:57 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
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 = 5.0; 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
135$idle = sub { 145$idle = sub {
136 require Carp; 146 require Carp;
137 Carp::croak ("FATAL: deadlock detected"); 147 Carp::croak ("FATAL: deadlock detected");
138}; 148};
139 149
140sub _cancel {
141 my ($self) = @_;
142
143 # free coroutine data and mark as destructed
144 $self->_destroy
145 or return;
146
147 # call all destruction callbacks
148 $_->(@{$self->{_status}})
149 for @{ delete $self->{_on_destroy} || [] };
150}
151
152# this coroutine is necessary because a coroutine 150# this coroutine is necessary because a coroutine
153# cannot destroy itself. 151# cannot destroy itself.
154my @destroy; 152our @destroy;
155my $manager; 153our $manager;
156 154
157$manager = new Coro sub { 155$manager = new Coro sub {
158 while () { 156 while () {
159 (shift @destroy)->_cancel 157 Coro::_cancel shift @destroy
160 while @destroy; 158 while @destroy;
161 159
162 &schedule; 160 &schedule;
163 } 161 }
164}; 162};
165$manager->{desc} = "[coro manager]"; 163$manager->{desc} = "[coro manager]";
166$manager->prio (PRIO_MAX); 164$manager->prio (PRIO_MAX);
167 165
168=back 166=back
169 167
170=head2 SIMPLE COROUTINE CREATION 168=head1 SIMPLE COROUTINE CREATION
171 169
172=over 4 170=over 4
173 171
174=item async { ... } [@args...] 172=item async { ... } [@args...]
175 173
212Similar 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
213terminate 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
214coroutine that might have executed other code already (which can be good 212coroutine that might have executed other code already (which can be good
215or bad :). 213or bad :).
216 214
217On 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
218a completly 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
219quick successsion, use C<async_pool>, not C<async>. 217coroutines in quick successsion, use C<async_pool>, not C<async>.
220 218
221The 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
222issued in case of an exception instead of terminating the program, as 220issued in case of an exception instead of terminating the program, as
223C<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>
224will 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,
237coros as required. 235coros as required.
238 236
239If you are concerned about pooled coroutines growing a lot because a 237If you are concerned about pooled coroutines growing a lot because a
240single 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
241{ 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
242addition 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
243(adjustable via $Coro::POOL_RSS) it will also be destroyed. 241(adjustable via $Coro::POOL_RSS) it will also be destroyed.
244 242
245=cut 243=cut
246 244
247our $POOL_SIZE = 8; 245our $POOL_SIZE = 8;
248our $POOL_RSS = 16 * 1024; 246our $POOL_RSS = 32 * 1024;
249our @async_pool; 247our @async_pool;
250 248
251sub pool_handler { 249sub pool_handler {
252 my $cb;
253
254 while () { 250 while () {
255 eval { 251 eval {
256 while () { 252 &{&_pool_handler} while 1;
257 _pool_1 $cb;
258 &$cb;
259 _pool_2 $cb;
260 &schedule;
261 }
262 }; 253 };
263 254
264 if ($@) {
265 last if $@ eq "\3async_pool terminate\2\n";
266 warn $@; 255 warn $@ if $@;
267 }
268 } 256 }
269}
270
271sub async_pool(&@) {
272 # this is also inlined into the unblock_scheduler
273 my $coro = (pop @async_pool) || new Coro \&pool_handler;
274
275 $coro->{_invoke} = [@_];
276 $coro->ready;
277
278 $coro
279} 257}
280 258
281=back 259=back
282 260
283=head2 STATIC METHODS 261=head1 STATIC METHODS
284 262
285Static methods are actually functions that operate on the current coroutine. 263Static methods are actually functions that implicitly operate on the
264current coroutine.
286 265
287=over 4 266=over 4
288 267
289=item schedule 268=item schedule
290 269
305>> 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
306yourself 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,
307so 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
308status in a variable. 287status in a variable.
309 288
310The 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.
311
312 {
313 # remember current coroutine
314 my $current = $Coro::current;
315
316 # register a hypothetical event handler
317 on_event_invoke sub {
318 # wake up sleeping coroutine
319 $current->ready;
320 undef $current;
321 };
322
323 # call schedule until event occurred.
324 # in case we are woken up for other reasons
325 # (current still defined), loop.
326 Coro::schedule while $current;
327 }
328 290
329=item cede 291=item cede
330 292
331"Cede" to other coroutines. This function puts the current coroutine into 293"Cede" to other coroutines. This function puts the current coroutine into
332the 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
356you 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
357program calls this function, there will be some one-time resource leak. 319program calls this function, there will be some one-time resource leak.
358 320
359=cut 321=cut
360 322
361sub terminate {
362 $current->cancel (@_);
363}
364
365sub killall { 323sub killall {
366 for (Coro::State::list) { 324 for (Coro::State::list) {
367 $_->cancel 325 $_->cancel
368 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 326 if $_ != $current && UNIVERSAL::isa $_, "Coro";
369 } 327 }
370} 328}
371 329
372=back 330=back
373 331
374=head2 COROUTINE METHODS 332=head1 COROUTINE OBJECT METHODS
375 333
376These 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
377them). 335them).
378 336
379=over 4 337=over 4
388See 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
389coroutine environment. 347coroutine environment.
390 348
391=cut 349=cut
392 350
393sub _run_coro { 351sub _terminate {
394 terminate &{+shift}; 352 terminate &{+shift};
395}
396
397sub new {
398 my $class = shift;
399
400 $class->SUPER::new (\&_run_coro, @_)
401} 353}
402 354
403=item $success = $coroutine->ready 355=item $success = $coroutine->ready
404 356
405Put 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
422 374
423=cut 375=cut
424 376
425sub cancel { 377sub cancel {
426 my $self = shift; 378 my $self = shift;
427 $self->{_status} = [@_];
428 379
429 if ($current == $self) { 380 if ($current == $self) {
430 push @destroy, $self; 381 terminate @_;
431 $manager->ready;
432 &schedule while 1;
433 } else { 382 } else {
383 $self->{_status} = [@_];
434 $self->_cancel; 384 $self->_cancel;
435 } 385 }
436} 386}
437 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
438=item $coroutine->throw ([$scalar]) 407=item $coroutine->throw ([$scalar])
439 408
440If C<$throw> is specified and defined, it will be thrown as an exception 409If C<$throw> is specified and defined, it will be thrown as an exception
441inside the coroutine at the next convenient point in time (usually after 410inside the coroutine at the next convenient point in time. Otherwise
442it gains control at the next schedule/transfer/cede). Otherwise clears the
443exception object. 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.
444 417
445The exception object will be thrown "as is" with the specified scalar in 418The exception object will be thrown "as is" with the specified scalar in
446C<$@>, i.e. if it is a string, no line number or newline will be appended 419C<$@>, i.e. if it is a string, no line number or newline will be appended
447(unlike with C<die>). 420(unlike with C<die>).
448 421
536 my $old = $_[0]{desc}; 509 my $old = $_[0]{desc};
537 $_[0]{desc} = $_[1] if @_ > 1; 510 $_[0]{desc} = $_[1] if @_ > 1;
538 $old; 511 $old;
539} 512}
540 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
541=back 519=back
542 520
543=head2 GLOBAL FUNCTIONS 521=head1 GLOBAL FUNCTIONS
544 522
545=over 4 523=over 4
546 524
547=item Coro::nready 525=item Coro::nready
548 526
628# return immediately and can be reused) and because we cannot cede 606# return immediately and can be reused) and because we cannot cede
629# inside an event callback. 607# inside an event callback.
630our $unblock_scheduler = new Coro sub { 608our $unblock_scheduler = new Coro sub {
631 while () { 609 while () {
632 while (my $cb = pop @unblock_queue) { 610 while (my $cb = pop @unblock_queue) {
633 # this is an inlined copy of async_pool 611 &async_pool (@$cb);
634 my $coro = (pop @async_pool) || new Coro \&pool_handler;
635 612
636 $coro->{_invoke} = $cb;
637 $coro->ready;
638 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;
639 } 617 }
640 schedule; # sleep well 618 schedule; # sleep well
641 } 619 }
642}; 620};
643$unblock_scheduler->{desc} = "[unblock_sub scheduler]"; 621$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
649 unshift @unblock_queue, [$cb, @_]; 627 unshift @unblock_queue, [$cb, @_];
650 $unblock_scheduler->ready; 628 $unblock_scheduler->ready;
651 } 629 }
652} 630}
653 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
654=back 651=back
655 652
656=cut 653=cut
657 654
6581; 6551;
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
659 722
660=head1 BUGS/LIMITATIONS 723=head1 BUGS/LIMITATIONS
661 724
662=over 4 725=over 4
663 726
680=item coroutine switching not signal safe 743=item coroutine switching not signal safe
681 744
682You must not switch to another coroutine from within a signal handler 745You must not switch to another coroutine from within a signal handler
683(only relevant with %SIG - most event libraries provide safe signals). 746(only relevant with %SIG - most event libraries provide safe signals).
684 747
685That means you I<MUST NOT> call any fucntion that might "block" the 748That means you I<MUST NOT> call any function that might "block" the
686current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 749current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
687anything that calls those. Everything else, including calling C<ready>, 750anything that calls those. Everything else, including calling C<ready>,
688works. 751works.
689 752
690=back 753=back
696 759
697Debugging: L<Coro::Debug>. 760Debugging: L<Coro::Debug>.
698 761
699Support/Utility: L<Coro::Specific>, L<Coro::Util>. 762Support/Utility: L<Coro::Specific>, L<Coro::Util>.
700 763
701Locking/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>.
702 766
703IO/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>.
704 768
705Compatibility: 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>.
706 772
707XS API: L<Coro::MakeMaker>. 773XS API: L<Coro::MakeMaker>.
708 774
709Low level Configuration, Coroutine Environment: L<Coro::State>. 775Low level Configuration, Coroutine Environment: L<Coro::State>.
710 776

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines