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

Comparing Coro/Coro.pm (file contents):
Revision 1.133 by root, Fri Sep 21 01:23:58 2007 UTC vs.
Revision 1.152 by root, Sun Oct 7 13:53:37 2007 UTC

6 6
7 use Coro; 7 use Coro;
8 8
9 async { 9 async {
10 # some asynchronous thread of execution 10 # some asynchronous thread of execution
11 print "2\n";
12 cede; # yield back to main
13 print "4\n";
11 }; 14 };
15 print "1\n";
16 cede; # yield to coroutine
17 print "3\n";
18 cede; # and again
12 19
13 # alternatively create an async coroutine like this: 20 # use locking
21 my $lock = new Coro::Semaphore;
22 my $locked;
14 23
15 sub some_func : Coro { 24 $lock->down;
16 # some more async code 25 $locked = 1;
17 } 26 $lock->up;
18
19 cede;
20 27
21=head1 DESCRIPTION 28=head1 DESCRIPTION
22 29
23This module collection manages coroutines. Coroutines are similar 30This module collection manages coroutines. Coroutines are similar
24to threads but don't run in parallel at the same time even on SMP 31to threads but don't run in parallel at the same time even on SMP
33is a performance win on Windows machines, and a loss everywhere else). 40is a performance win on Windows machines, and a loss everywhere else).
34 41
35In this module, coroutines are defined as "callchain + lexical variables + 42In this module, coroutines are defined as "callchain + lexical variables +
36@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 43@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
37its own set of lexicals and its own set of perls most important global 44its own set of lexicals and its own set of perls most important global
38variables. 45variables (see L<Coro::State> for more configuration).
39 46
40=cut 47=cut
41 48
42package Coro; 49package Coro;
43 50
50 57
51our $idle; # idle handler 58our $idle; # idle handler
52our $main; # main coroutine 59our $main; # main coroutine
53our $current; # current coroutine 60our $current; # current coroutine
54 61
55our $VERSION = '3.7'; 62our $VERSION = '4.1';
56 63
57our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 64our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58our %EXPORT_TAGS = ( 65our %EXPORT_TAGS = (
59 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 66 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60); 67);
116=cut 123=cut
117 124
118$main->{desc} = "[main::]"; 125$main->{desc} = "[main::]";
119 126
120# maybe some other module used Coro::Specific before... 127# maybe some other module used Coro::Specific before...
121$main->{specific} = $current->{specific} 128$main->{_specific} = $current->{_specific}
122 if $current; 129 if $current;
123 130
124_set_current $main; 131_set_current $main;
125 132
126sub current() { $current } 133sub current() { $current }
134This hook is overwritten by modules such as C<Coro::Timer> and 141This hook is overwritten by modules such as C<Coro::Timer> and
135C<Coro::Event> to wait on an external event that hopefully wake up a 142C<Coro::Event> to wait on an external event that hopefully wake up a
136coroutine so the scheduler can run it. 143coroutine so the scheduler can run it.
137 144
138Please note that if your callback recursively invokes perl (e.g. for event 145Please note that if your callback recursively invokes perl (e.g. for event
139handlers), then it must be prepared to be called recursively. 146handlers), then it must be prepared to be called recursively itself.
140 147
141=cut 148=cut
142 149
143$idle = sub { 150$idle = sub {
144 require Carp; 151 require Carp;
151 # free coroutine data and mark as destructed 158 # free coroutine data and mark as destructed
152 $self->_destroy 159 $self->_destroy
153 or return; 160 or return;
154 161
155 # call all destruction callbacks 162 # call all destruction callbacks
156 $_->(@{$self->{status}}) 163 $_->(@{$self->{_status}})
157 for @{(delete $self->{destroy_cb}) || []}; 164 for @{(delete $self->{_on_destroy}) || []};
158} 165}
159 166
160# this coroutine is necessary because a coroutine 167# this coroutine is necessary because a coroutine
161# cannot destroy itself. 168# cannot destroy itself.
162my @destroy; 169my @destroy;
186=item async { ... } [@args...] 193=item async { ... } [@args...]
187 194
188Create a new asynchronous coroutine and return it's coroutine object 195Create a new asynchronous coroutine and return it's coroutine object
189(usually unused). When the sub returns the new coroutine is automatically 196(usually unused). When the sub returns the new coroutine is automatically
190terminated. 197terminated.
198
199See the C<Coro::State::new> constructor for info about the coroutine
200environment in which coroutines run.
191 201
192Calling C<exit> in a coroutine will do the same as calling exit outside 202Calling C<exit> in a coroutine will do the same as calling exit outside
193the coroutine. Likewise, when the coroutine dies, the program will exit, 203the coroutine. Likewise, when the coroutine dies, the program will exit,
194just as it would in the main program. 204just as it would in the main program.
195 205
216issued in case of an exception instead of terminating the program, as 226issued in case of an exception instead of terminating the program, as
217C<async> does. As the coroutine is being reused, stuff like C<on_destroy> 227C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
218will not work in the expected way, unless you call terminate or cancel, 228will not work in the expected way, unless you call terminate or cancel,
219which somehow defeats the purpose of pooling. 229which somehow defeats the purpose of pooling.
220 230
221The priority will be reset to C<0> after each job, otherwise the coroutine 231The priority will be reset to C<0> after each job, tracing will be
222will be re-used "as-is". 232disabled, the description will be reset and the default output filehandle
233gets restored, so you can change alkl these. Otherwise the coroutine will
234be re-used "as-is": most notably if you change other per-coroutine global
235stuff such as C<$/> you need to revert that change, which is most simply
236done by using local as in C< local $/ >.
223 237
224The pool size is limited to 8 idle coroutines (this can be adjusted by 238The pool size is limited to 8 idle coroutines (this can be adjusted by
225changing $Coro::POOL_SIZE), and there can be as many non-idle coros as 239changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
226required. 240required.
227 241
228If you are concerned about pooled coroutines growing a lot because a 242If you are concerned about pooled coroutines growing a lot because a
229single C<async_pool> used a lot of stackspace you can e.g. C<async_pool 243single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
230{ terminate }> once per second or so to slowly replenish the pool. In 244{ terminate }> once per second or so to slowly replenish the pool. In
231addition to that, when the stacks used by a handler grows larger than 16kb 245addition to that, when the stacks used by a handler grows larger than 16kb
232(adjustable with $Coro::MAX_POOL_RSS) it will also exit. 246(adjustable with $Coro::POOL_RSS) it will also exit.
233 247
234=cut 248=cut
235 249
236our $POOL_SIZE = 8; 250our $POOL_SIZE = 8;
237our $MAX_POOL_RSS = 16 * 1024; 251our $POOL_RSS = 16 * 1024;
238our @pool; 252our @async_pool;
239 253
240sub pool_handler { 254sub pool_handler {
255 my $cb;
256
241 while () { 257 while () {
242 $current->{desc} = "[async_pool]";
243
244 eval { 258 eval {
245 my ($cb, @arg) = @{ delete $current->{_invoke} or return }; 259 while () {
246 $cb->(@arg); 260 _pool_1 $cb;
261 &$cb;
262 _pool_2 $cb;
263 &schedule;
264 }
247 }; 265 };
266
267 last if $@ eq "\3async_pool terminate\2\n";
248 warn $@ if $@; 268 warn $@ if $@;
249
250 last if @pool >= $POOL_SIZE || $current->rss >= $MAX_POOL_RSS;
251
252 push @pool, $current;
253 $current->{desc} = "[async_pool idle]";
254 $current->save (Coro::State::SAVE_DEF);
255 $current->prio (0);
256 schedule;
257 } 269 }
258} 270}
259 271
260sub async_pool(&@) { 272sub async_pool(&@) {
261 # this is also inlined into the unlock_scheduler 273 # this is also inlined into the unlock_scheduler
262 my $coro = (pop @pool) || new Coro \&pool_handler;; 274 my $coro = (pop @async_pool) || new Coro \&pool_handler;
263 275
264 $coro->{_invoke} = [@_]; 276 $coro->{_invoke} = [@_];
265 $coro->ready; 277 $coro->ready;
266 278
267 $coro 279 $coro
310 322
311=item terminate [arg...] 323=item terminate [arg...]
312 324
313Terminates the current coroutine with the given status values (see L<cancel>). 325Terminates the current coroutine with the given status values (see L<cancel>).
314 326
327=item killall
328
329Kills/terminates/cancels all coroutines except the currently running
330one. This is useful after a fork, either in the child or the parent, as
331usually only one of them should inherit the running coroutines.
332
315=cut 333=cut
316 334
317sub terminate { 335sub terminate {
318 $current->cancel (@_); 336 $current->cancel (@_);
337}
338
339sub killall {
340 for (Coro::State::list) {
341 $_->cancel
342 if $_ != $current && UNIVERSAL::isa $_, "Coro";
343 }
319} 344}
320 345
321=back 346=back
322 347
323# dynamic methods 348# dynamic methods
333Create a new coroutine and return it. When the sub returns the coroutine 358Create a new coroutine and return it. When the sub returns the coroutine
334automatically terminates as if C<terminate> with the returned values were 359automatically terminates as if C<terminate> with the returned values were
335called. To make the coroutine run you must first put it into the ready queue 360called. To make the coroutine run you must first put it into the ready queue
336by calling the ready method. 361by calling the ready method.
337 362
338See C<async> for additional discussion. 363See C<async> and C<Coro::State::new> for additional info about the
364coroutine environment.
339 365
340=cut 366=cut
341 367
342sub _run_coro { 368sub _run_coro {
343 terminate &{+shift}; 369 terminate &{+shift};
367 393
368=cut 394=cut
369 395
370sub cancel { 396sub cancel {
371 my $self = shift; 397 my $self = shift;
372 $self->{status} = [@_]; 398 $self->{_status} = [@_];
373 399
374 if ($current == $self) { 400 if ($current == $self) {
375 push @destroy, $self; 401 push @destroy, $self;
376 $manager->ready; 402 $manager->ready;
377 &schedule while 1; 403 &schedule while 1;
381} 407}
382 408
383=item $coroutine->join 409=item $coroutine->join
384 410
385Wait until the coroutine terminates and return any values given to the 411Wait until the coroutine terminates and return any values given to the
386C<terminate> or C<cancel> functions. C<join> can be called multiple times 412C<terminate> or C<cancel> functions. C<join> can be called concurrently
387from multiple coroutine. 413from multiple coroutines.
388 414
389=cut 415=cut
390 416
391sub join { 417sub join {
392 my $self = shift; 418 my $self = shift;
393 419
394 unless ($self->{status}) { 420 unless ($self->{_status}) {
395 my $current = $current; 421 my $current = $current;
396 422
397 push @{$self->{destroy_cb}}, sub { 423 push @{$self->{_on_destroy}}, sub {
398 $current->ready; 424 $current->ready;
399 undef $current; 425 undef $current;
400 }; 426 };
401 427
402 &schedule while $current; 428 &schedule while $current;
403 } 429 }
404 430
405 wantarray ? @{$self->{status}} : $self->{status}[0]; 431 wantarray ? @{$self->{_status}} : $self->{_status}[0];
406} 432}
407 433
408=item $coroutine->on_destroy (\&cb) 434=item $coroutine->on_destroy (\&cb)
409 435
410Registers a callback that is called when this coroutine gets destroyed, 436Registers a callback that is called when this coroutine gets destroyed,
414=cut 440=cut
415 441
416sub on_destroy { 442sub on_destroy {
417 my ($self, $cb) = @_; 443 my ($self, $cb) = @_;
418 444
419 push @{ $self->{destroy_cb} }, $cb; 445 push @{ $self->{_on_destroy} }, $cb;
420} 446}
421 447
422=item $oldprio = $coroutine->prio ($newprio) 448=item $oldprio = $coroutine->prio ($newprio)
423 449
424Sets (or gets, if the argument is missing) the priority of the 450Sets (or gets, if the argument is missing) the priority of the
448 474
449=item $olddesc = $coroutine->desc ($newdesc) 475=item $olddesc = $coroutine->desc ($newdesc)
450 476
451Sets (or gets in case the argument is missing) the description for this 477Sets (or gets in case the argument is missing) the description for this
452coroutine. This is just a free-form string you can associate with a coroutine. 478coroutine. This is just a free-form string you can associate with a coroutine.
479
480This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
481can modify this member directly if you wish.
482
483=item $coroutine->throw ([$scalar])
484
485If C<$throw> is specified and defined, it will be thrown as an exception
486inside the coroutine at the next convinient point in time (usually after
487it gains control at the next schedule/transfer/cede). Otherwise clears the
488exception object.
489
490The exception object will be thrown "as is" with the specified scalar in
491C<$@>, i.e. if it is a string, no line number or newline will be appended
492(unlike with C<die>).
493
494This can be used as a softer means than C<cancel> to ask a coroutine to
495end itself, although there is no guarentee that the exception will lead to
496termination, and if the exception isn't caught it might well end the whole
497program.
453 498
454=cut 499=cut
455 500
456sub desc { 501sub desc {
457 my $old = $_[0]{desc}; 502 my $old = $_[0]{desc};
537# inside an event callback. 582# inside an event callback.
538our $unblock_scheduler = new Coro sub { 583our $unblock_scheduler = new Coro sub {
539 while () { 584 while () {
540 while (my $cb = pop @unblock_queue) { 585 while (my $cb = pop @unblock_queue) {
541 # this is an inlined copy of async_pool 586 # this is an inlined copy of async_pool
542 my $coro = (pop @pool or new Coro \&pool_handler); 587 my $coro = (pop @async_pool) || new Coro \&pool_handler;
543 588
544 $coro->{_invoke} = $cb; 589 $coro->{_invoke} = $cb;
545 $coro->ready; 590 $coro->ready;
546 cede; # for short-lived callbacks, this reduces pressure on the coro pool 591 cede; # for short-lived callbacks, this reduces pressure on the coro pool
547 } 592 }
575 to allow per-thread schedulers, but Coro::State does not yet allow 620 to allow per-thread schedulers, but Coro::State does not yet allow
576 this). 621 this).
577 622
578=head1 SEE ALSO 623=head1 SEE ALSO
579 624
625Lower level Configuration, Coroutine Environment: L<Coro::State>.
626
627Debugging: L<Coro::Debug>.
628
580Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>. 629Support/Utility: L<Coro::Specific>, L<Coro::Util>.
581 630
582Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 631Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
583 632
584Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>. 633Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>.
585 634
635Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>.
636
586Embedding: L<Coro:MakeMaker> 637Embedding: L<Coro:MakeMaker>.
587 638
588=head1 AUTHOR 639=head1 AUTHOR
589 640
590 Marc Lehmann <schmorp@schmorp.de> 641 Marc Lehmann <schmorp@schmorp.de>
591 http://home.schmorp.de/ 642 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines