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

Comparing Coro/Coro.pm (file contents):
Revision 1.104 by root, Thu Jan 4 23:49:27 2007 UTC vs.
Revision 1.145 by root, Wed Oct 3 16:03:17 2007 UTC

20 20
21=head1 DESCRIPTION 21=head1 DESCRIPTION
22 22
23This module collection manages coroutines. Coroutines are similar 23This module collection manages coroutines. Coroutines are similar
24to threads but don't run in parallel at the same time even on SMP 24to 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 25machines. The specific flavor of coroutine used in this module also
26guarentees you that it will not switch between coroutines unless 26guarantees you that it will not switch between coroutines unless
27necessary, at easily-identified points in your program, so locking and 27necessary, at easily-identified points in your program, so locking and
28parallel access are rarely an issue, making coroutine programming much 28parallel access are rarely an issue, making coroutine programming much
29safer than threads programming. 29safer than threads programming.
30 30
31(Perl, however, does not natively support real threads but instead does a 31(Perl, however, does not natively support real threads but instead does a
50 50
51our $idle; # idle handler 51our $idle; # idle handler
52our $main; # main coroutine 52our $main; # main coroutine
53our $current; # current coroutine 53our $current; # current coroutine
54 54
55our $VERSION = '3.3'; 55our $VERSION = '4.0';
56 56
57our @EXPORT = qw(async cede schedule terminate current unblock_sub); 57our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58our %EXPORT_TAGS = ( 58our %EXPORT_TAGS = (
59 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 59 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60); 60);
61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
62 62
108 108
109The current coroutine (the last coroutine switched to). The initial value 109The current coroutine (the last coroutine switched to). The initial value
110is C<$main> (of course). 110is C<$main> (of course).
111 111
112This variable is B<strictly> I<read-only>. It is provided for performance 112This variable is B<strictly> I<read-only>. It is provided for performance
113reasons. If performance is not essentiel you are encouraged to use the 113reasons. If performance is not essential you are encouraged to use the
114C<Coro::current> function instead. 114C<Coro::current> function instead.
115 115
116=cut 116=cut
117 117
118$main->{desc} = "[main::]";
119
118# maybe some other module used Coro::Specific before... 120# maybe some other module used Coro::Specific before...
119$main->{specific} = $current->{specific} 121$main->{_specific} = $current->{_specific}
120 if $current; 122 if $current;
121 123
122_set_current $main; 124_set_current $main;
123 125
124sub current() { $current } 126sub current() { $current }
149 # free coroutine data and mark as destructed 151 # free coroutine data and mark as destructed
150 $self->_destroy 152 $self->_destroy
151 or return; 153 or return;
152 154
153 # call all destruction callbacks 155 # call all destruction callbacks
154 $_->(@{$self->{status}}) 156 $_->(@{$self->{_status}})
155 for @{(delete $self->{destroy_cb}) || []}; 157 for @{(delete $self->{_on_destroy}) || []};
156} 158}
157 159
158# this coroutine is necessary because a coroutine 160# this coroutine is necessary because a coroutine
159# cannot destroy itself. 161# cannot destroy itself.
160my @destroy; 162my @destroy;
166 while @destroy; 168 while @destroy;
167 169
168 &schedule; 170 &schedule;
169 } 171 }
170}; 172};
171 173$manager->desc ("[coro manager]");
172$manager->prio (PRIO_MAX); 174$manager->prio (PRIO_MAX);
173 175
174# static methods. not really. 176# static methods. not really.
175 177
176=back 178=back
185 187
186Create a new asynchronous coroutine and return it's coroutine object 188Create a new asynchronous coroutine and return it's coroutine object
187(usually unused). When the sub returns the new coroutine is automatically 189(usually unused). When the sub returns the new coroutine is automatically
188terminated. 190terminated.
189 191
190Calling C<exit> in a coroutine will not work correctly, so do not do that. 192See the C<Coro::State::new> constructor for info about the coroutine
193environment.
191 194
192When the coroutine dies, the program will exit, just as in the main 195Calling C<exit> in a coroutine will do the same as calling exit outside
193program. 196the coroutine. Likewise, when the coroutine dies, the program will exit,
197just as it would in the main program.
194 198
195 # create a new coroutine that just prints its arguments 199 # create a new coroutine that just prints its arguments
196 async { 200 async {
197 print "@_\n"; 201 print "@_\n";
198 } 1,2,3,4; 202 } 1,2,3,4;
200=cut 204=cut
201 205
202sub async(&@) { 206sub async(&@) {
203 my $coro = new Coro @_; 207 my $coro = new Coro @_;
204 $coro->ready; 208 $coro->ready;
209 $coro
210}
211
212=item async_pool { ... } [@args...]
213
214Similar to C<async>, but uses a coroutine pool, so you should not call
215terminate or join (although you are allowed to), and you get a coroutine
216that might have executed other code already (which can be good or bad :).
217
218Also, the block is executed in an C<eval> context and a warning will be
219issued in case of an exception instead of terminating the program, as
220C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
221will not work in the expected way, unless you call terminate or cancel,
222which somehow defeats the purpose of pooling.
223
224The priority will be reset to C<0> after each job, otherwise the coroutine
225will be re-used "as-is".
226
227The pool size is limited to 8 idle coroutines (this can be adjusted by
228changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
229required.
230
231If you are concerned about pooled coroutines growing a lot because a
232single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
233{ terminate }> once per second or so to slowly replenish the pool. In
234addition to that, when the stacks used by a handler grows larger than 16kb
235(adjustable with $Coro::POOL_RSS) it will also exit.
236
237=cut
238
239our $POOL_SIZE = 8;
240our $POOL_RSS = 16 * 1024;
241our @async_pool;
242
243sub pool_handler {
244 my $cb;
245
246 while () {
247 eval {
248 while () {
249 _pool_1 $cb;
250 &$cb;
251 _pool_2 $cb;
252 &schedule;
253 }
254 };
255
256 last if $@ eq "\3terminate\2\n";
257 warn $@ if $@;
258 }
259}
260
261sub async_pool(&@) {
262 # this is also inlined into the unlock_scheduler
263 my $coro = (pop @async_pool) || new Coro \&pool_handler;
264
265 $coro->{_invoke} = [@_];
266 $coro->ready;
267
205 $coro 268 $coro
206} 269}
207 270
208=item schedule 271=item schedule
209 272
223 # wake up sleeping coroutine 286 # wake up sleeping coroutine
224 $current->ready; 287 $current->ready;
225 undef $current; 288 undef $current;
226 }; 289 };
227 290
228 # call schedule until event occured. 291 # call schedule until event occurred.
229 # in case we are woken up for other reasons 292 # in case we are woken up for other reasons
230 # (current still defined), loop. 293 # (current still defined), loop.
231 Coro::schedule while $current; 294 Coro::schedule while $current;
232 } 295 }
233 296
235 298
236"Cede" to other coroutines. This function puts the current coroutine into the 299"Cede" to other coroutines. This function puts the current coroutine into the
237ready queue and calls C<schedule>, which has the effect of giving up the 300ready queue and calls C<schedule>, which has the effect of giving up the
238current "timeslice" to other coroutines of the same or higher priority. 301current "timeslice" to other coroutines of the same or higher priority.
239 302
303Returns true if at least one coroutine switch has happened.
304
240=item Coro::cede_notself 305=item Coro::cede_notself
241 306
242Works like cede, but is not exported by default and will cede to any 307Works like cede, but is not exported by default and will cede to any
243coroutine, regardless of priority, once. 308coroutine, regardless of priority, once.
244 309
310Returns true if at least one coroutine switch has happened.
311
245=item terminate [arg...] 312=item terminate [arg...]
246 313
247Terminates the current coroutine with the given status values (see L<cancel>). 314Terminates the current coroutine with the given status values (see L<cancel>).
315
316=item killall
317
318Kills/terminates/cancels all coroutines except the currently running
319one. This is useful after a fork, either in the child or the parent, as
320usually only one of them should inherit the running coroutines.
248 321
249=cut 322=cut
250 323
251sub terminate { 324sub terminate {
252 $current->cancel (@_); 325 $current->cancel (@_);
326}
327
328sub killall {
329 for (Coro::State::list) {
330 $_->cancel
331 if $_ != $current && UNIVERSAL::isa $_, "Coro";
332 }
253} 333}
254 334
255=back 335=back
256 336
257# dynamic methods 337# dynamic methods
267Create a new coroutine and return it. When the sub returns the coroutine 347Create a new coroutine and return it. When the sub returns the coroutine
268automatically terminates as if C<terminate> with the returned values were 348automatically terminates as if C<terminate> with the returned values were
269called. To make the coroutine run you must first put it into the ready queue 349called. To make the coroutine run you must first put it into the ready queue
270by calling the ready method. 350by calling the ready method.
271 351
272Calling C<exit> in a coroutine will not work correctly, so do not do that. 352See C<async> and C<Coro::State::new> for additional info about the
353coroutine environment.
273 354
274=cut 355=cut
275 356
276sub _run_coro { 357sub _run_coro {
277 terminate &{+shift}; 358 terminate &{+shift};
301 382
302=cut 383=cut
303 384
304sub cancel { 385sub cancel {
305 my $self = shift; 386 my $self = shift;
306 $self->{status} = [@_]; 387 $self->{_status} = [@_];
307 388
308 if ($current == $self) { 389 if ($current == $self) {
309 push @destroy, $self; 390 push @destroy, $self;
310 $manager->ready; 391 $manager->ready;
311 &schedule while 1; 392 &schedule while 1;
315} 396}
316 397
317=item $coroutine->join 398=item $coroutine->join
318 399
319Wait until the coroutine terminates and return any values given to the 400Wait until the coroutine terminates and return any values given to the
320C<terminate> or C<cancel> functions. C<join> can be called multiple times 401C<terminate> or C<cancel> functions. C<join> can be called concurrently
321from multiple coroutine. 402from multiple coroutines.
322 403
323=cut 404=cut
324 405
325sub join { 406sub join {
326 my $self = shift; 407 my $self = shift;
327 408
328 unless ($self->{status}) { 409 unless ($self->{_status}) {
329 my $current = $current; 410 my $current = $current;
330 411
331 push @{$self->{destroy_cb}}, sub { 412 push @{$self->{_on_destroy}}, sub {
332 $current->ready; 413 $current->ready;
333 undef $current; 414 undef $current;
334 }; 415 };
335 416
336 &schedule while $current; 417 &schedule while $current;
337 } 418 }
338 419
339 wantarray ? @{$self->{status}} : $self->{status}[0]; 420 wantarray ? @{$self->{_status}} : $self->{_status}[0];
340} 421}
341 422
342=item $coroutine->on_destroy (\&cb) 423=item $coroutine->on_destroy (\&cb)
343 424
344Registers a callback that is called when this coroutine gets destroyed, 425Registers a callback that is called when this coroutine gets destroyed,
348=cut 429=cut
349 430
350sub on_destroy { 431sub on_destroy {
351 my ($self, $cb) = @_; 432 my ($self, $cb) = @_;
352 433
353 push @{ $self->{destroy_cb} }, $cb; 434 push @{ $self->{_on_destroy} }, $cb;
354} 435}
355 436
356=item $oldprio = $coroutine->prio ($newprio) 437=item $oldprio = $coroutine->prio ($newprio)
357 438
358Sets (or gets, if the argument is missing) the priority of the 439Sets (or gets, if the argument is missing) the priority of the
383=item $olddesc = $coroutine->desc ($newdesc) 464=item $olddesc = $coroutine->desc ($newdesc)
384 465
385Sets (or gets in case the argument is missing) the description for this 466Sets (or gets in case the argument is missing) the description for this
386coroutine. This is just a free-form string you can associate with a coroutine. 467coroutine. This is just a free-form string you can associate with a coroutine.
387 468
469This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
470can modify this member directly if you wish.
471
388=cut 472=cut
389 473
390sub desc { 474sub desc {
391 my $old = $_[0]{desc}; 475 my $old = $_[0]{desc};
392 $_[0]{desc} = $_[1] if @_ > 1; 476 $_[0]{desc} = $_[1] if @_ > 1;
400=over 4 484=over 4
401 485
402=item Coro::nready 486=item Coro::nready
403 487
404Returns the number of coroutines that are currently in the ready state, 488Returns the number of coroutines that are currently in the ready state,
405i.e. that can be swicthed to. The value C<0> means that the only runnable 489i.e. that can be switched to. The value C<0> means that the only runnable
406coroutine is the currently running one, so C<cede> would have no effect, 490coroutine is the currently running one, so C<cede> would have no effect,
407and C<schedule> would cause a deadlock unless there is an idle handler 491and C<schedule> would cause a deadlock unless there is an idle handler
408that wakes up some coroutines. 492that wakes up some coroutines.
409 493
410=item my $guard = Coro::guard { ... } 494=item my $guard = Coro::guard { ... }
411 495
412This creates and returns a guard object. Nothing happens until the objetc 496This creates and returns a guard object. Nothing happens until the object
413gets destroyed, in which case the codeblock given as argument will be 497gets destroyed, in which case the codeblock given as argument will be
414executed. This is useful to free locks or other resources in case of a 498executed. This is useful to free locks or other resources in case of a
415runtime error or when the coroutine gets canceled, as in both cases the 499runtime error or when the coroutine gets canceled, as in both cases the
416guard block will be executed. The guard object supports only one method, 500guard block will be executed. The guard object supports only one method,
417C<< ->cancel >>, which will keep the codeblock from being executed. 501C<< ->cancel >>, which will keep the codeblock from being executed.
446This utility function takes a BLOCK or code reference and "unblocks" it, 530This utility function takes a BLOCK or code reference and "unblocks" it,
447returning the new coderef. This means that the new coderef will return 531returning the new coderef. This means that the new coderef will return
448immediately without blocking, returning nothing, while the original code 532immediately without blocking, returning nothing, while the original code
449ref will be called (with parameters) from within its own coroutine. 533ref will be called (with parameters) from within its own coroutine.
450 534
451The reason this fucntion exists is that many event libraries (such as the 535The reason this function exists is that many event libraries (such as the
452venerable L<Event|Event> module) are not coroutine-safe (a weaker form 536venerable L<Event|Event> module) are not coroutine-safe (a weaker form
453of thread-safety). This means you must not block within event callbacks, 537of thread-safety). This means you must not block within event callbacks,
454otherwise you might suffer from crashes or worse. 538otherwise you might suffer from crashes or worse.
455 539
456This function allows your callbacks to block by executing them in another 540This function allows your callbacks to block by executing them in another
461In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 545In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
462creating event callbacks that want to block. 546creating event callbacks that want to block.
463 547
464=cut 548=cut
465 549
466our @unblock_pool;
467our @unblock_queue; 550our @unblock_queue;
468our $UNBLOCK_POOL_SIZE = 2;
469 551
470sub unblock_handler_ { 552# we create a special coro because we want to cede,
471 while () { 553# to reduce pressure on the coro pool (because most callbacks
472 my ($cb, @arg) = @{ delete $Coro::current->{arg} }; 554# return immediately and can be reused) and because we cannot cede
473 $cb->(@arg); 555# inside an event callback.
474
475 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
476 push @unblock_pool, $Coro::current;
477 schedule;
478 }
479}
480
481our $unblock_scheduler = async { 556our $unblock_scheduler = new Coro sub {
482 while () { 557 while () {
483 while (my $cb = pop @unblock_queue) { 558 while (my $cb = pop @unblock_queue) {
484 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_); 559 # this is an inlined copy of async_pool
485 $handler->{arg} = $cb; 560 my $coro = (pop @async_pool) || new Coro \&pool_handler;
561
562 $coro->{_invoke} = $cb;
486 $handler->ready; 563 $coro->ready;
487 cede; 564 cede; # for short-lived callbacks, this reduces pressure on the coro pool
488 } 565 }
489 566 schedule; # sleep well
490 schedule;
491 } 567 }
492}; 568};
569$unblock_scheduler->desc ("[unblock_sub scheduler]");
493 570
494sub unblock_sub(&) { 571sub unblock_sub(&) {
495 my $cb = shift; 572 my $cb = shift;
496 573
497 sub { 574 sub {
498 push @unblock_queue, [$cb, @_]; 575 unshift @unblock_queue, [$cb, @_];
499 $unblock_scheduler->ready; 576 $unblock_scheduler->ready;
500 } 577 }
501} 578}
502 579
503=back 580=back
510 587
511 - you must make very sure that no coro is still active on global 588 - you must make very sure that no coro is still active on global
512 destruction. very bad things might happen otherwise (usually segfaults). 589 destruction. very bad things might happen otherwise (usually segfaults).
513 590
514 - this module is not thread-safe. You should only ever use this module 591 - this module is not thread-safe. You should only ever use this module
515 from the same thread (this requirement might be losened in the future 592 from the same thread (this requirement might be loosened in the future
516 to allow per-thread schedulers, but Coro::State does not yet allow 593 to allow per-thread schedulers, but Coro::State does not yet allow
517 this). 594 this).
518 595
519=head1 SEE ALSO 596=head1 SEE ALSO
520 597

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines