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

Comparing Coro/Coro.pm (file contents):
Revision 1.220 by root, Sun Nov 16 11:12:57 2008 UTC vs.
Revision 1.234 by root, Fri Nov 21 06:52:10 2008 UTC

1=head1 NAME 1=head1 NAME
2 2
3Coro - coroutine process abstraction 3Coro - the real perl threads
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 31This module collection manages coroutines, that is, cooperative
32threads but don't (in general) run in parallel at the same time even 32threads. Coroutines are similar to kernel threads but don't (in general)
33on SMP machines. The specific flavor of coroutine used in this module 33run in parallel at the same time even on SMP machines. The specific flavor
34also guarantees you that it will not switch between coroutines unless 34of coroutine used in this module also guarantees you that it will not
35necessary, at easily-identified points in your program, so locking and 35switch between coroutines unless necessary, at easily-identified points
36parallel access are rarely an issue, making coroutine programming much 36in your program, so locking and parallel access are rarely an issue,
37safer and easier than threads programming. 37making coroutine programming much safer and easier than using other thread
38models.
38 39
39Unlike a normal perl program, however, coroutines allow you to have 40Unlike the so-called "Perl threads" (which are not actually real threads
40multiple running interpreters that share data, which is especially useful 41but only the windows process emulation ported to unix), Coro provides a
41to code pseudo-parallel processes and for event-based programming, such as 42full shared address space, which makes communication between coroutines
42multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to 43very easy. And coroutines are fast, too: disabling the Windows process
43learn more. 44emulation code in your perl and using Coro can easily result in a two to
45four times speed increase for your programs.
44 46
45Coroutines are also useful because Perl has no support for threads (the so 47Coro achieves that by supporting multiple running interpreters that share
46called "threads" that perl offers are nothing more than the (bad) process 48data, which is especially useful to code pseudo-parallel processes and
47emulation coming from the Windows platform: On standard operating systems 49for event-based programming, such as multiple HTTP-GET requests running
48they serve no purpose whatsoever, except by making your programs slow and 50concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
49making them use a lot of memory. Best disable them when building perl, or 51into an event-based environment.
50aks your software vendor/distributor to do it for you).
51 52
52In this module, coroutines are defined as "callchain + lexical variables + 53In this module, a coroutines is defined as "callchain + lexical variables
53@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 54+ @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own
54its own set of lexicals and its own set of perls most important global 55callchain, its own set of lexicals and its own set of perls most important
55variables (see L<Coro::State> for more configuration). 56global variables (see L<Coro::State> for more configuration and background
57info).
58
59See also the C<SEE ALSO> section at the end of this document - the Coro
60module family is quite large.
56 61
57=cut 62=cut
58 63
59package Coro; 64package Coro;
60 65
67 72
68our $idle; # idle handler 73our $idle; # idle handler
69our $main; # main coroutine 74our $main; # main coroutine
70our $current; # current coroutine 75our $current; # current coroutine
71 76
72our $VERSION = 5.0; 77our $VERSION = "5.0";
73 78
74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 79our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
75our %EXPORT_TAGS = ( 80our %EXPORT_TAGS = (
76 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 81 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
77); 82);
78our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 83our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
79 84
85=head1 GLOBAL VARIABLES
86
80=over 4 87=over 4
81 88
82=item $Coro::main 89=item $Coro::main
83 90
84This variable stores the coroutine object that represents the main 91This variable stores the coroutine object that represents the main
135$idle = sub { 142$idle = sub {
136 require Carp; 143 require Carp;
137 Carp::croak ("FATAL: deadlock detected"); 144 Carp::croak ("FATAL: deadlock detected");
138}; 145};
139 146
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 147# this coroutine is necessary because a coroutine
153# cannot destroy itself. 148# cannot destroy itself.
154my @destroy; 149our @destroy;
155my $manager; 150our $manager;
156 151
157$manager = new Coro sub { 152$manager = new Coro sub {
158 while () { 153 while () {
159 (shift @destroy)->_cancel 154 Coro::_cancel shift @destroy
160 while @destroy; 155 while @destroy;
161 156
162 &schedule; 157 &schedule;
163 } 158 }
164}; 159};
165$manager->{desc} = "[coro manager]"; 160$manager->{desc} = "[coro manager]";
166$manager->prio (PRIO_MAX); 161$manager->prio (PRIO_MAX);
167 162
168=back 163=back
169 164
170=head2 SIMPLE COROUTINE CREATION 165=head1 SIMPLE COROUTINE CREATION
171 166
172=over 4 167=over 4
173 168
174=item async { ... } [@args...] 169=item async { ... } [@args...]
175 170
212Similar to C<async>, but uses a coroutine pool, so you should not call 207Similar 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 208terminate 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 209coroutine that might have executed other code already (which can be good
215or bad :). 210or bad :).
216 211
217On the plus side, this function is faster than creating (and destroying) 212On 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 213destroying) a completely new coroutine, so if you need a lot of generic
219quick successsion, use C<async_pool>, not C<async>. 214coroutines in quick successsion, use C<async_pool>, not C<async>.
220 215
221The code block is executed in an C<eval> context and a warning will be 216The 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 217issued 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> 218C<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, 219will not work in the expected way, unless you call terminate or cancel,
237coros as required. 232coros as required.
238 233
239If you are concerned about pooled coroutines growing a lot because a 234If 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 235single 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 236{ 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 237addition to that, when the stacks used by a handler grows larger than 32kb
243(adjustable via $Coro::POOL_RSS) it will also be destroyed. 238(adjustable via $Coro::POOL_RSS) it will also be destroyed.
244 239
245=cut 240=cut
246 241
247our $POOL_SIZE = 8; 242our $POOL_SIZE = 8;
248our $POOL_RSS = 16 * 1024; 243our $POOL_RSS = 32 * 1024;
249our @async_pool; 244our @async_pool;
250 245
251sub pool_handler { 246sub pool_handler {
252 my $cb;
253
254 while () { 247 while () {
255 eval { 248 eval {
256 while () { 249 &{&_pool_handler} while 1;
257 _pool_1 $cb;
258 &$cb;
259 _pool_2 $cb;
260 &schedule;
261 }
262 }; 250 };
263 251
264 if ($@) {
265 last if $@ eq "\3async_pool terminate\2\n";
266 warn $@; 252 warn $@ if $@;
267 }
268 } 253 }
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} 254}
280 255
281=back 256=back
282 257
283=head2 STATIC METHODS 258=head1 STATIC METHODS
284 259
285Static methods are actually functions that operate on the current coroutine. 260Static methods are actually functions that implicitly operate on the
261current coroutine.
286 262
287=over 4 263=over 4
288 264
289=item schedule 265=item schedule
290 266
305>> on that once some event happens, and last you call C<schedule> to put 281>> 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, 282yourself 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 283so you need to check whether the event indeed happened, e.g. by storing the
308status in a variable. 284status in a variable.
309 285
310The canonical way to wait on external events is this: 286See 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 287
329=item cede 288=item cede
330 289
331"Cede" to other coroutines. This function puts the current coroutine into 290"Cede" to other coroutines. This function puts the current coroutine into
332the ready queue and calls C<schedule>, which has the effect of giving 291the 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 315you 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. 316program calls this function, there will be some one-time resource leak.
358 317
359=cut 318=cut
360 319
361sub terminate {
362 $current->cancel (@_);
363}
364
365sub killall { 320sub killall {
366 for (Coro::State::list) { 321 for (Coro::State::list) {
367 $_->cancel 322 $_->cancel
368 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 323 if $_ != $current && UNIVERSAL::isa $_, "Coro";
369 } 324 }
370} 325}
371 326
372=back 327=back
373 328
374=head2 COROUTINE METHODS 329=head1 COROUTINE OBJECT METHODS
375 330
376These are the methods you can call on coroutine objects (or to create 331These are the methods you can call on coroutine objects (or to create
377them). 332them).
378 333
379=over 4 334=over 4
388See C<async> and C<Coro::State::new> for additional info about the 343See C<async> and C<Coro::State::new> for additional info about the
389coroutine environment. 344coroutine environment.
390 345
391=cut 346=cut
392 347
393sub _run_coro { 348sub _terminate {
394 terminate &{+shift}; 349 terminate &{+shift};
395}
396
397sub new {
398 my $class = shift;
399
400 $class->SUPER::new (\&_run_coro, @_)
401} 350}
402 351
403=item $success = $coroutine->ready 352=item $success = $coroutine->ready
404 353
405Put the given coroutine into the end of its ready queue (there is one 354Put the given coroutine into the end of its ready queue (there is one
422 371
423=cut 372=cut
424 373
425sub cancel { 374sub cancel {
426 my $self = shift; 375 my $self = shift;
427 $self->{_status} = [@_];
428 376
429 if ($current == $self) { 377 if ($current == $self) {
430 push @destroy, $self; 378 terminate @_;
431 $manager->ready;
432 &schedule while 1;
433 } else { 379 } else {
380 $self->{_status} = [@_];
434 $self->_cancel; 381 $self->_cancel;
435 } 382 }
436} 383}
437 384
385=item $coroutine->schedule_to
386
387Puts the current coroutine to sleep (like C<Coro::schedule>), but instead
388of continuing with the next coro from the ready queue, always switch to
389the given coroutine object (regardless of priority etc.). The readyness
390state of that coroutine isn't changed.
391
392This is an advanced method for special cases - I'd love to hear about any
393uses for this one.
394
395=item $coroutine->cede_to
396
397Like C<schedule_to>, but puts the current coroutine into the ready
398queue. This has the effect of temporarily switching to the given
399coroutine, and continuing some time later.
400
401This is an advanced method for special cases - I'd love to hear about any
402uses for this one.
403
438=item $coroutine->throw ([$scalar]) 404=item $coroutine->throw ([$scalar])
439 405
440If C<$throw> is specified and defined, it will be thrown as an exception 406If 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 407inside the coroutine at the next convenient point in time. Otherwise
442it gains control at the next schedule/transfer/cede). Otherwise clears the
443exception object. 408clears the exception object.
409
410Coro will check for the exception each time a schedule-like-function
411returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
412>>, C<< Coro::Handle->readable >> and so on. Most of these functions
413detect this case and return early in case an exception is pending.
444 414
445The exception object will be thrown "as is" with the specified scalar in 415The 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 416C<$@>, i.e. if it is a string, no line number or newline will be appended
447(unlike with C<die>). 417(unlike with C<die>).
448 418
536 my $old = $_[0]{desc}; 506 my $old = $_[0]{desc};
537 $_[0]{desc} = $_[1] if @_ > 1; 507 $_[0]{desc} = $_[1] if @_ > 1;
538 $old; 508 $old;
539} 509}
540 510
511sub transfer {
512 require Carp;
513 Carp::croak ("You must not call ->transfer on Coro objects. Use Coro::State objects or the ->schedule_to method. Caught");
514}
515
541=back 516=back
542 517
543=head2 GLOBAL FUNCTIONS 518=head1 GLOBAL FUNCTIONS
544 519
545=over 4 520=over 4
546 521
547=item Coro::nready 522=item Coro::nready
548 523
628# return immediately and can be reused) and because we cannot cede 603# return immediately and can be reused) and because we cannot cede
629# inside an event callback. 604# inside an event callback.
630our $unblock_scheduler = new Coro sub { 605our $unblock_scheduler = new Coro sub {
631 while () { 606 while () {
632 while (my $cb = pop @unblock_queue) { 607 while (my $cb = pop @unblock_queue) {
633 # this is an inlined copy of async_pool 608 &async_pool (@$cb);
634 my $coro = (pop @async_pool) || new Coro \&pool_handler;
635 609
636 $coro->{_invoke} = $cb;
637 $coro->ready;
638 cede; # for short-lived callbacks, this reduces pressure on the coro pool 610 # for short-lived callbacks, this reduces pressure on the coro pool
611 # as the chance is very high that the async_poll coro will be back
612 # in the idle state when cede returns
613 cede;
639 } 614 }
640 schedule; # sleep well 615 schedule; # sleep well
641 } 616 }
642}; 617};
643$unblock_scheduler->{desc} = "[unblock_sub scheduler]"; 618$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
649 unshift @unblock_queue, [$cb, @_]; 624 unshift @unblock_queue, [$cb, @_];
650 $unblock_scheduler->ready; 625 $unblock_scheduler->ready;
651 } 626 }
652} 627}
653 628
629=item $cb = Coro::rouse_cb
630
631Create and return a "rouse callback". That's a code reference that, when
632called, will save its arguments and notify the owner coroutine of the
633callback.
634
635See the next function.
636
637=item @args = Coro::rouse_wait [$cb]
638
639Wait for the specified rouse callback (or the last one tht was created in
640this coroutine).
641
642As soon as the callback is invoked (or when the calback was invoked before
643C<rouse_wait>), it will return a copy of the arguments originally passed
644to the rouse callback.
645
646See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
647
654=back 648=back
655 649
656=cut 650=cut
657 651
6581; 6521;
653
654=head1 HOW TO WAIT FOR A CALLBACK
655
656It is very common for a coroutine to wait for some callback to be
657called. This occurs naturally when you use coroutines in an otherwise
658event-based program, or when you use event-based libraries.
659
660These typically register a callback for some event, and call that callback
661when the event occured. In a coroutine, however, you typically want to
662just wait for the event, simplyifying things.
663
664For example C<< AnyEvent->child >> registers a callback to be called when
665a specific child has exited:
666
667 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
668
669But from withina coroutine, you often just want to write this:
670
671 my $status = wait_for_child $pid;
672
673Coro offers two functions specifically designed to make this easy,
674C<Coro::rouse_cb> and C<Coro::rouse_wait>.
675
676The first function, C<rouse_cb>, generates and returns a callback that,
677when invoked, will save it's arguments and notify the coroutine that
678created the callback.
679
680The second function, C<rouse_wait>, waits for the callback to be called
681(by calling C<schedule> to go to sleep) and returns the arguments
682originally passed to the callback.
683
684Using these functions, it becomes easy to write the C<wait_for_child>
685function mentioned above:
686
687 sub wait_for_child($) {
688 my ($pid) = @_;
689
690 my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb);
691
692 my ($rpid, $rstatus) = Coro::rouse_wait;
693 $rstatus
694 }
695
696In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough,
697you can roll your own, using C<schedule>:
698
699 sub wait_for_child($) {
700 my ($pid) = @_;
701
702 # store the current coroutine in $current,
703 # and provide result variables for the closure passed to ->child
704 my $current = $Coro::current;
705 my ($done, $rstatus);
706
707 # pass a closure to ->child
708 my $watcher = AnyEvent->child (pid => $pid, cb => sub {
709 $rstatus = $_[1]; # remember rstatus
710 $done = 1; # mark $rstatus as valud
711 });
712
713 # wait until the closure has been called
714 schedule while !$done;
715
716 $rstatus
717 }
718
659 719
660=head1 BUGS/LIMITATIONS 720=head1 BUGS/LIMITATIONS
661 721
662=over 4 722=over 4
663 723
680=item coroutine switching not signal safe 740=item coroutine switching not signal safe
681 741
682You must not switch to another coroutine from within a signal handler 742You must not switch to another coroutine from within a signal handler
683(only relevant with %SIG - most event libraries provide safe signals). 743(only relevant with %SIG - most event libraries provide safe signals).
684 744
685That means you I<MUST NOT> call any fucntion that might "block" the 745That means you I<MUST NOT> call any function that might "block" the
686current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 746current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
687anything that calls those. Everything else, including calling C<ready>, 747anything that calls those. Everything else, including calling C<ready>,
688works. 748works.
689 749
690=back 750=back

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines