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

Comparing Coro/Coro.pm (file contents):
Revision 1.108 by root, Fri Jan 5 20:00:49 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
25machines. The specific flavor of coroutine use din this module also 32machines. The specific flavor of coroutine used in this module also
26guarentees you that it will not switch between coroutines unless 33guarantees you that it will not switch between coroutines unless
27necessary, at easily-identified points in your program, so locking and 34necessary, at easily-identified points in your program, so locking and
28parallel access are rarely an issue, making coroutine programming much 35parallel access are rarely an issue, making coroutine programming much
29safer than threads programming. 36safer than threads programming.
30 37
31(Perl, however, does not natively support real threads but instead does a 38(Perl, however, does not natively support real threads but instead does a
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.3'; 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);
108 115
109The current coroutine (the last coroutine switched to). The initial value 116The current coroutine (the last coroutine switched to). The initial value
110is C<$main> (of course). 117is C<$main> (of course).
111 118
112This variable is B<strictly> I<read-only>. It is provided for performance 119This variable is B<strictly> I<read-only>. It is provided for performance
113reasons. If performance is not essentiel you are encouraged to use the 120reasons. If performance is not essential you are encouraged to use the
114C<Coro::current> function instead. 121C<Coro::current> function instead.
115 122
116=cut 123=cut
117 124
125$main->{desc} = "[main::]";
126
118# maybe some other module used Coro::Specific before... 127# maybe some other module used Coro::Specific before...
119$main->{specific} = $current->{specific} 128$main->{_specific} = $current->{_specific}
120 if $current; 129 if $current;
121 130
122_set_current $main; 131_set_current $main;
123 132
124sub current() { $current } 133sub current() { $current }
132This hook is overwritten by modules such as C<Coro::Timer> and 141This hook is overwritten by modules such as C<Coro::Timer> and
133C<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
134coroutine so the scheduler can run it. 143coroutine so the scheduler can run it.
135 144
136Please 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
137handlers), then it must be prepared to be called recursively. 146handlers), then it must be prepared to be called recursively itself.
138 147
139=cut 148=cut
140 149
141$idle = sub { 150$idle = sub {
142 require Carp; 151 require Carp;
149 # free coroutine data and mark as destructed 158 # free coroutine data and mark as destructed
150 $self->_destroy 159 $self->_destroy
151 or return; 160 or return;
152 161
153 # call all destruction callbacks 162 # call all destruction callbacks
154 $_->(@{$self->{status}}) 163 $_->(@{$self->{_status}})
155 for @{(delete $self->{destroy_cb}) || []}; 164 for @{(delete $self->{_on_destroy}) || []};
156} 165}
157 166
158# this coroutine is necessary because a coroutine 167# this coroutine is necessary because a coroutine
159# cannot destroy itself. 168# cannot destroy itself.
160my @destroy; 169my @destroy;
166 while @destroy; 175 while @destroy;
167 176
168 &schedule; 177 &schedule;
169 } 178 }
170}; 179};
171 180$manager->desc ("[coro manager]");
172$manager->prio (PRIO_MAX); 181$manager->prio (PRIO_MAX);
173 182
174# static methods. not really. 183# static methods. not really.
175 184
176=back 185=back
185 194
186Create a new asynchronous coroutine and return it's coroutine object 195Create a new asynchronous coroutine and return it's coroutine object
187(usually unused). When the sub returns the new coroutine is automatically 196(usually unused). When the sub returns the new coroutine is automatically
188terminated. 197terminated.
189 198
190Calling C<exit> in a coroutine will not work correctly, so do not do that. 199See the C<Coro::State::new> constructor for info about the coroutine
200environment in which coroutines run.
191 201
192When the coroutine dies, the program will exit, just as in the main 202Calling C<exit> in a coroutine will do the same as calling exit outside
193program. 203the coroutine. Likewise, when the coroutine dies, the program will exit,
204just as it would in the main program.
194 205
195 # create a new coroutine that just prints its arguments 206 # create a new coroutine that just prints its arguments
196 async { 207 async {
197 print "@_\n"; 208 print "@_\n";
198 } 1,2,3,4; 209 } 1,2,3,4;
215issued in case of an exception instead of terminating the program, as 226issued in case of an exception instead of terminating the program, as
216C<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>
217will 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,
218which somehow defeats the purpose of pooling. 229which somehow defeats the purpose of pooling.
219 230
220The 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
221will 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 $/ >.
222 237
223The 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
224changing $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
225required. 240required.
226 241
227If you are concerned about pooled coroutines growing a lot because a 242If you are concerned about pooled coroutines growing a lot because a
228single 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
229terminate }> once per second or so to slowly replenish the pool. 244{ terminate }> once per second or so to slowly replenish the pool. In
245addition to that, when the stacks used by a handler grows larger than 16kb
246(adjustable with $Coro::POOL_RSS) it will also exit.
230 247
231=cut 248=cut
232 249
233our $POOL_SIZE = 8; 250our $POOL_SIZE = 8;
251our $POOL_RSS = 16 * 1024;
234our @pool; 252our @async_pool;
235 253
236sub pool_handler { 254sub pool_handler {
255 my $cb;
256
237 while () { 257 while () {
238 my ($cb, @arg) = @{ delete $current->{_invoke} };
239
240 eval { 258 eval {
241 $cb->(@arg); 259 while () {
260 _pool_1 $cb;
261 &$cb;
262 _pool_2 $cb;
263 &schedule;
264 }
242 }; 265 };
266
267 last if $@ eq "\3async_pool terminate\2\n";
243 warn $@ if $@; 268 warn $@ if $@;
244
245 last if @pool >= $POOL_SIZE;
246 push @pool, $current;
247
248 $current->prio (0);
249 schedule;
250 } 269 }
251} 270}
252 271
253sub async_pool(&@) { 272sub async_pool(&@) {
254 # this is also inlined into the unlock_scheduler 273 # this is also inlined into the unlock_scheduler
255 my $coro = (pop @pool or new Coro \&pool_handler); 274 my $coro = (pop @async_pool) || new Coro \&pool_handler;
256 275
257 $coro->{_invoke} = [@_]; 276 $coro->{_invoke} = [@_];
258 $coro->ready; 277 $coro->ready;
259 278
260 $coro 279 $coro
278 # wake up sleeping coroutine 297 # wake up sleeping coroutine
279 $current->ready; 298 $current->ready;
280 undef $current; 299 undef $current;
281 }; 300 };
282 301
283 # call schedule until event occured. 302 # call schedule until event occurred.
284 # in case we are woken up for other reasons 303 # in case we are woken up for other reasons
285 # (current still defined), loop. 304 # (current still defined), loop.
286 Coro::schedule while $current; 305 Coro::schedule while $current;
287 } 306 }
288 307
303 322
304=item terminate [arg...] 323=item terminate [arg...]
305 324
306Terminates the current coroutine with the given status values (see L<cancel>). 325Terminates the current coroutine with the given status values (see L<cancel>).
307 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
308=cut 333=cut
309 334
310sub terminate { 335sub terminate {
311 $current->cancel (@_); 336 $current->cancel (@_);
337}
338
339sub killall {
340 for (Coro::State::list) {
341 $_->cancel
342 if $_ != $current && UNIVERSAL::isa $_, "Coro";
343 }
312} 344}
313 345
314=back 346=back
315 347
316# dynamic methods 348# dynamic methods
326Create 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
327automatically terminates as if C<terminate> with the returned values were 359automatically terminates as if C<terminate> with the returned values were
328called. 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
329by calling the ready method. 361by calling the ready method.
330 362
331Calling C<exit> in a coroutine will not work correctly, so do not do that. 363See C<async> and C<Coro::State::new> for additional info about the
364coroutine environment.
332 365
333=cut 366=cut
334 367
335sub _run_coro { 368sub _run_coro {
336 terminate &{+shift}; 369 terminate &{+shift};
360 393
361=cut 394=cut
362 395
363sub cancel { 396sub cancel {
364 my $self = shift; 397 my $self = shift;
365 $self->{status} = [@_]; 398 $self->{_status} = [@_];
366 399
367 if ($current == $self) { 400 if ($current == $self) {
368 push @destroy, $self; 401 push @destroy, $self;
369 $manager->ready; 402 $manager->ready;
370 &schedule while 1; 403 &schedule while 1;
374} 407}
375 408
376=item $coroutine->join 409=item $coroutine->join
377 410
378Wait until the coroutine terminates and return any values given to the 411Wait until the coroutine terminates and return any values given to the
379C<terminate> or C<cancel> functions. C<join> can be called multiple times 412C<terminate> or C<cancel> functions. C<join> can be called concurrently
380from multiple coroutine. 413from multiple coroutines.
381 414
382=cut 415=cut
383 416
384sub join { 417sub join {
385 my $self = shift; 418 my $self = shift;
386 419
387 unless ($self->{status}) { 420 unless ($self->{_status}) {
388 my $current = $current; 421 my $current = $current;
389 422
390 push @{$self->{destroy_cb}}, sub { 423 push @{$self->{_on_destroy}}, sub {
391 $current->ready; 424 $current->ready;
392 undef $current; 425 undef $current;
393 }; 426 };
394 427
395 &schedule while $current; 428 &schedule while $current;
396 } 429 }
397 430
398 wantarray ? @{$self->{status}} : $self->{status}[0]; 431 wantarray ? @{$self->{_status}} : $self->{_status}[0];
399} 432}
400 433
401=item $coroutine->on_destroy (\&cb) 434=item $coroutine->on_destroy (\&cb)
402 435
403Registers a callback that is called when this coroutine gets destroyed, 436Registers a callback that is called when this coroutine gets destroyed,
407=cut 440=cut
408 441
409sub on_destroy { 442sub on_destroy {
410 my ($self, $cb) = @_; 443 my ($self, $cb) = @_;
411 444
412 push @{ $self->{destroy_cb} }, $cb; 445 push @{ $self->{_on_destroy} }, $cb;
413} 446}
414 447
415=item $oldprio = $coroutine->prio ($newprio) 448=item $oldprio = $coroutine->prio ($newprio)
416 449
417Sets (or gets, if the argument is missing) the priority of the 450Sets (or gets, if the argument is missing) the priority of the
442=item $olddesc = $coroutine->desc ($newdesc) 475=item $olddesc = $coroutine->desc ($newdesc)
443 476
444Sets (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
445coroutine. 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.
446 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.
498
447=cut 499=cut
448 500
449sub desc { 501sub desc {
450 my $old = $_[0]{desc}; 502 my $old = $_[0]{desc};
451 $_[0]{desc} = $_[1] if @_ > 1; 503 $_[0]{desc} = $_[1] if @_ > 1;
459=over 4 511=over 4
460 512
461=item Coro::nready 513=item Coro::nready
462 514
463Returns the number of coroutines that are currently in the ready state, 515Returns the number of coroutines that are currently in the ready state,
464i.e. that can be swicthed to. The value C<0> means that the only runnable 516i.e. that can be switched to. The value C<0> means that the only runnable
465coroutine is the currently running one, so C<cede> would have no effect, 517coroutine is the currently running one, so C<cede> would have no effect,
466and C<schedule> would cause a deadlock unless there is an idle handler 518and C<schedule> would cause a deadlock unless there is an idle handler
467that wakes up some coroutines. 519that wakes up some coroutines.
468 520
469=item my $guard = Coro::guard { ... } 521=item my $guard = Coro::guard { ... }
470 522
471This creates and returns a guard object. Nothing happens until the objetc 523This creates and returns a guard object. Nothing happens until the object
472gets destroyed, in which case the codeblock given as argument will be 524gets destroyed, in which case the codeblock given as argument will be
473executed. This is useful to free locks or other resources in case of a 525executed. This is useful to free locks or other resources in case of a
474runtime error or when the coroutine gets canceled, as in both cases the 526runtime error or when the coroutine gets canceled, as in both cases the
475guard block will be executed. The guard object supports only one method, 527guard block will be executed. The guard object supports only one method,
476C<< ->cancel >>, which will keep the codeblock from being executed. 528C<< ->cancel >>, which will keep the codeblock from being executed.
505This utility function takes a BLOCK or code reference and "unblocks" it, 557This utility function takes a BLOCK or code reference and "unblocks" it,
506returning the new coderef. This means that the new coderef will return 558returning the new coderef. This means that the new coderef will return
507immediately without blocking, returning nothing, while the original code 559immediately without blocking, returning nothing, while the original code
508ref will be called (with parameters) from within its own coroutine. 560ref will be called (with parameters) from within its own coroutine.
509 561
510The reason this fucntion exists is that many event libraries (such as the 562The reason this function exists is that many event libraries (such as the
511venerable L<Event|Event> module) are not coroutine-safe (a weaker form 563venerable L<Event|Event> module) are not coroutine-safe (a weaker form
512of thread-safety). This means you must not block within event callbacks, 564of thread-safety). This means you must not block within event callbacks,
513otherwise you might suffer from crashes or worse. 565otherwise you might suffer from crashes or worse.
514 566
515This function allows your callbacks to block by executing them in another 567This function allows your callbacks to block by executing them in another
526 578
527# we create a special coro because we want to cede, 579# we create a special coro because we want to cede,
528# to reduce pressure on the coro pool (because most callbacks 580# to reduce pressure on the coro pool (because most callbacks
529# return immediately and can be reused) and because we cannot cede 581# return immediately and can be reused) and because we cannot cede
530# inside an event callback. 582# inside an event callback.
531our $unblock_scheduler = async { 583our $unblock_scheduler = new Coro sub {
532 while () { 584 while () {
533 while (my $cb = pop @unblock_queue) { 585 while (my $cb = pop @unblock_queue) {
534 # this is an inlined copy of async_pool 586 # this is an inlined copy of async_pool
535 my $coro = (pop @pool or new Coro \&pool_handler); 587 my $coro = (pop @async_pool) || new Coro \&pool_handler;
536 588
537 $coro->{_invoke} = $cb; 589 $coro->{_invoke} = $cb;
538 $coro->ready; 590 $coro->ready;
539 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
540 } 592 }
541 schedule; # sleep well 593 schedule; # sleep well
542 } 594 }
543}; 595};
596$unblock_scheduler->desc ("[unblock_sub scheduler]");
544 597
545sub unblock_sub(&) { 598sub unblock_sub(&) {
546 my $cb = shift; 599 my $cb = shift;
547 600
548 sub { 601 sub {
561 614
562 - you must make very sure that no coro is still active on global 615 - you must make very sure that no coro is still active on global
563 destruction. very bad things might happen otherwise (usually segfaults). 616 destruction. very bad things might happen otherwise (usually segfaults).
564 617
565 - this module is not thread-safe. You should only ever use this module 618 - this module is not thread-safe. You should only ever use this module
566 from the same thread (this requirement might be losened in the future 619 from the same thread (this requirement might be loosened in the future
567 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
568 this). 621 this).
569 622
570=head1 SEE ALSO 623=head1 SEE ALSO
571 624
625Lower level Configuration, Coroutine Environment: L<Coro::State>.
626
627Debugging: L<Coro::Debug>.
628
572Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>. 629Support/Utility: L<Coro::Specific>, L<Coro::Util>.
573 630
574Locking/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>.
575 632
576Event/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>.
577 634
635Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>.
636
578Embedding: L<Coro:MakeMaker> 637Embedding: L<Coro:MakeMaker>.
579 638
580=head1 AUTHOR 639=head1 AUTHOR
581 640
582 Marc Lehmann <schmorp@schmorp.de> 641 Marc Lehmann <schmorp@schmorp.de>
583 http://home.schmorp.de/ 642 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines