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

Comparing Coro/Coro.pm (file contents):
Revision 1.101 by root, Fri Dec 29 08:36:34 2006 UTC vs.
Revision 1.140 by root, Thu Sep 27 16:25:10 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 = '3.8';
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
118$main->{desc} = "[main::]";
117 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
141$idle = sub { 143$idle = sub {
142 require Carp; 144 require Carp;
143 Carp::croak ("FATAL: deadlock detected"); 145 Carp::croak ("FATAL: deadlock detected");
144}; 146};
145 147
148sub _cancel {
149 my ($self) = @_;
150
151 # free coroutine data and mark as destructed
152 $self->_destroy
153 or return;
154
155 # call all destruction callbacks
156 $_->(@{$self->{status}})
157 for @{(delete $self->{destroy_cb}) || []};
158}
159
146# this coroutine is necessary because a coroutine 160# this coroutine is necessary because a coroutine
147# cannot destroy itself. 161# cannot destroy itself.
148my @destroy; 162my @destroy;
163my $manager;
164
149my $manager; $manager = new Coro sub { 165$manager = new Coro sub {
150 while () { 166 while () {
151 # by overwriting the state object with the manager we destroy it 167 (shift @destroy)->_cancel
152 # while still being able to schedule this coroutine (in case it has
153 # been readied multiple times. this is harmless since the manager
154 # can be called as many times as neccessary and will always
155 # remove itself from the runqueue
156 while (@destroy) { 168 while @destroy;
157 my $coro = pop @destroy;
158 169
159 $coro->{status} ||= [];
160
161 $_->ready for @{(delete $coro->{join} ) || []};
162 $_->(@{$coro->{status}}) for @{(delete $coro->{destroy_cb}) || []};
163
164 # the next line destroys the coro state, but keeps the
165 # coroutine itself intact (we basically make it a zombie
166 # coroutine that always runs the manager thread, so it's possible
167 # to transfer() to this coroutine).
168 $coro->_clone_state_from ($manager);
169 }
170 &schedule; 170 &schedule;
171 } 171 }
172}; 172};
173$manager->desc ("[coro manager]");
174$manager->prio (PRIO_MAX);
173 175
174# static methods. not really. 176# static methods. not really.
175 177
176=back 178=back
177 179
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. 192Calling C<exit> in a coroutine will do the same as calling exit outside
191 193the coroutine. Likewise, when the coroutine dies, the program will exit,
192When the coroutine dies, the program will exit, just as in the main 194just as it would in the main program.
193program.
194 195
195 # create a new coroutine that just prints its arguments 196 # create a new coroutine that just prints its arguments
196 async { 197 async {
197 print "@_\n"; 198 print "@_\n";
198 } 1,2,3,4; 199 } 1,2,3,4;
199 200
200=cut 201=cut
201 202
202sub async(&@) { 203sub async(&@) {
203 my $pid = new Coro @_; 204 my $coro = new Coro @_;
204 $pid->ready; 205 $coro->ready;
205 $pid 206 $coro
207}
208
209=item async_pool { ... } [@args...]
210
211Similar to C<async>, but uses a coroutine pool, so you should not call
212terminate or join (although you are allowed to), and you get a coroutine
213that might have executed other code already (which can be good or bad :).
214
215Also, the block is executed in an C<eval> context and a warning will be
216issued 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>
218will not work in the expected way, unless you call terminate or cancel,
219which somehow defeats the purpose of pooling.
220
221The priority will be reset to C<0> after each job, otherwise the coroutine
222will be re-used "as-is".
223
224The 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
226required.
227
228If 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
230{ 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
232(adjustable with $Coro::POOL_RSS) it will also exit.
233
234=cut
235
236our $POOL_SIZE = 8;
237our $POOL_RSS = 16 * 1024;
238our @async_pool;
239
240sub pool_handler {
241 my $cb;
242
243 while () {
244 eval {
245 while () {
246 _pool_1 $cb;
247 &$cb;
248 _pool_2 $cb;
249 &schedule;
250 }
251 };
252
253 last if $@ eq "\3terminate\2\n";
254 warn $@ if $@;
255 }
256}
257
258sub async_pool(&@) {
259 # this is also inlined into the unlock_scheduler
260 my $coro = (pop @async_pool) || new Coro \&pool_handler;
261
262 $coro->{_invoke} = [@_];
263 $coro->ready;
264
265 $coro
206} 266}
207 267
208=item schedule 268=item schedule
209 269
210Calls the scheduler. Please note that the current coroutine will not be put 270Calls the scheduler. Please note that the current coroutine will not be put
223 # wake up sleeping coroutine 283 # wake up sleeping coroutine
224 $current->ready; 284 $current->ready;
225 undef $current; 285 undef $current;
226 }; 286 };
227 287
228 # call schedule until event occured. 288 # call schedule until event occurred.
229 # in case we are woken up for other reasons 289 # in case we are woken up for other reasons
230 # (current still defined), loop. 290 # (current still defined), loop.
231 Coro::schedule while $current; 291 Coro::schedule while $current;
232 } 292 }
233 293
234=item cede 294=item cede
235 295
236"Cede" to other coroutines. This function puts the current coroutine into the 296"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 297ready queue and calls C<schedule>, which has the effect of giving up the
238current "timeslice" to other coroutines of the same or higher priority. 298current "timeslice" to other coroutines of the same or higher priority.
299
300Returns true if at least one coroutine switch has happened.
301
302=item Coro::cede_notself
303
304Works like cede, but is not exported by default and will cede to any
305coroutine, regardless of priority, once.
306
307Returns true if at least one coroutine switch has happened.
239 308
240=item terminate [arg...] 309=item terminate [arg...]
241 310
242Terminates the current coroutine with the given status values (see L<cancel>). 311Terminates the current coroutine with the given status values (see L<cancel>).
243 312
262Create a new coroutine and return it. When the sub returns the coroutine 331Create a new coroutine and return it. When the sub returns the coroutine
263automatically terminates as if C<terminate> with the returned values were 332automatically terminates as if C<terminate> with the returned values were
264called. To make the coroutine run you must first put it into the ready queue 333called. To make the coroutine run you must first put it into the ready queue
265by calling the ready method. 334by calling the ready method.
266 335
267Calling C<exit> in a coroutine will not work correctly, so do not do that. 336See C<async> for additional discussion.
268 337
269=cut 338=cut
270 339
271sub _run_coro { 340sub _run_coro {
272 terminate &{+shift}; 341 terminate &{+shift};
289Return wether the coroutine is currently the ready queue or not, 358Return wether the coroutine is currently the ready queue or not,
290 359
291=item $coroutine->cancel (arg...) 360=item $coroutine->cancel (arg...)
292 361
293Terminates the given coroutine and makes it return the given arguments as 362Terminates the given coroutine and makes it return the given arguments as
294status (default: the empty list). 363status (default: the empty list). Never returns if the coroutine is the
364current coroutine.
295 365
296=cut 366=cut
297 367
298sub cancel { 368sub cancel {
299 my $self = shift; 369 my $self = shift;
300 $self->{status} = [@_]; 370 $self->{status} = [@_];
371
372 if ($current == $self) {
301 push @destroy, $self; 373 push @destroy, $self;
302 $manager->ready; 374 $manager->ready;
303 &schedule if $current == $self; 375 &schedule while 1;
376 } else {
377 $self->_cancel;
378 }
304} 379}
305 380
306=item $coroutine->join 381=item $coroutine->join
307 382
308Wait until the coroutine terminates and return any values given to the 383Wait until the coroutine terminates and return any values given to the
311 386
312=cut 387=cut
313 388
314sub join { 389sub join {
315 my $self = shift; 390 my $self = shift;
391
316 unless ($self->{status}) { 392 unless ($self->{status}) {
317 push @{$self->{join}}, $current; 393 my $current = $current;
318 &schedule; 394
395 push @{$self->{destroy_cb}}, sub {
396 $current->ready;
397 undef $current;
398 };
399
400 &schedule while $current;
319 } 401 }
402
320 wantarray ? @{$self->{status}} : $self->{status}[0]; 403 wantarray ? @{$self->{status}} : $self->{status}[0];
321} 404}
322 405
323=item $coroutine->on_destroy (\&cb) 406=item $coroutine->on_destroy (\&cb)
324 407
381=over 4 464=over 4
382 465
383=item Coro::nready 466=item Coro::nready
384 467
385Returns the number of coroutines that are currently in the ready state, 468Returns the number of coroutines that are currently in the ready state,
386i.e. that can be swicthed to. The value C<0> means that the only runnable 469i.e. that can be switched to. The value C<0> means that the only runnable
387coroutine is the currently running one, so C<cede> would have no effect, 470coroutine is the currently running one, so C<cede> would have no effect,
388and C<schedule> would cause a deadlock unless there is an idle handler 471and C<schedule> would cause a deadlock unless there is an idle handler
389that wakes up some coroutines. 472that wakes up some coroutines.
473
474=item my $guard = Coro::guard { ... }
475
476This creates and returns a guard object. Nothing happens until the object
477gets destroyed, in which case the codeblock given as argument will be
478executed. This is useful to free locks or other resources in case of a
479runtime error or when the coroutine gets canceled, as in both cases the
480guard block will be executed. The guard object supports only one method,
481C<< ->cancel >>, which will keep the codeblock from being executed.
482
483Example: set some flag and clear it again when the coroutine gets canceled
484or the function returns:
485
486 sub do_something {
487 my $guard = Coro::guard { $busy = 0 };
488 $busy = 1;
489
490 # do something that requires $busy to be true
491 }
492
493=cut
494
495sub guard(&) {
496 bless \(my $cb = $_[0]), "Coro::guard"
497}
498
499sub Coro::guard::cancel {
500 ${$_[0]} = sub { };
501}
502
503sub Coro::guard::DESTROY {
504 ${$_[0]}->();
505}
506
390 507
391=item unblock_sub { ... } 508=item unblock_sub { ... }
392 509
393This utility function takes a BLOCK or code reference and "unblocks" it, 510This utility function takes a BLOCK or code reference and "unblocks" it,
394returning the new coderef. This means that the new coderef will return 511returning the new coderef. This means that the new coderef will return
395immediately without blocking, returning nothing, while the original code 512immediately without blocking, returning nothing, while the original code
396ref will be called (with parameters) from within its own coroutine. 513ref will be called (with parameters) from within its own coroutine.
397 514
398The reason this fucntion exists is that many event libraries (such as the 515The reason this function exists is that many event libraries (such as the
399venerable L<Event|Event> module) are not coroutine-safe (a weaker form 516venerable L<Event|Event> module) are not coroutine-safe (a weaker form
400of thread-safety). This means you must not block within event callbacks, 517of thread-safety). This means you must not block within event callbacks,
401otherwise you might suffer from crashes or worse. 518otherwise you might suffer from crashes or worse.
402 519
403This function allows your callbacks to block by executing them in another 520This function allows your callbacks to block by executing them in another
408In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 525In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
409creating event callbacks that want to block. 526creating event callbacks that want to block.
410 527
411=cut 528=cut
412 529
413our @unblock_pool;
414our @unblock_queue; 530our @unblock_queue;
415our $UNBLOCK_POOL_SIZE = 2;
416 531
417sub unblock_handler_ { 532# we create a special coro because we want to cede,
418 while () { 533# to reduce pressure on the coro pool (because most callbacks
419 my ($cb, @arg) = @{ delete $Coro::current->{arg} }; 534# return immediately and can be reused) and because we cannot cede
420 $cb->(@arg); 535# inside an event callback.
421
422 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
423 push @unblock_pool, $Coro::current;
424 schedule;
425 }
426}
427
428our $unblock_scheduler = async { 536our $unblock_scheduler = new Coro sub {
429 while () { 537 while () {
430 while (my $cb = pop @unblock_queue) { 538 while (my $cb = pop @unblock_queue) {
431 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_); 539 # this is an inlined copy of async_pool
432 $handler->{arg} = $cb; 540 my $coro = (pop @async_pool) || new Coro \&pool_handler;
541
542 $coro->{_invoke} = $cb;
433 $handler->ready; 543 $coro->ready;
434 cede; 544 cede; # for short-lived callbacks, this reduces pressure on the coro pool
435 } 545 }
436 546 schedule; # sleep well
437 schedule;
438 } 547 }
439}; 548};
549$unblock_scheduler->desc ("[unblock_sub scheduler]");
440 550
441sub unblock_sub(&) { 551sub unblock_sub(&) {
442 my $cb = shift; 552 my $cb = shift;
443 553
444 sub { 554 sub {
445 push @unblock_queue, [$cb, @_]; 555 unshift @unblock_queue, [$cb, @_];
446 $unblock_scheduler->ready; 556 $unblock_scheduler->ready;
447 } 557 }
448} 558}
449 559
450=back 560=back
457 567
458 - you must make very sure that no coro is still active on global 568 - you must make very sure that no coro is still active on global
459 destruction. very bad things might happen otherwise (usually segfaults). 569 destruction. very bad things might happen otherwise (usually segfaults).
460 570
461 - this module is not thread-safe. You should only ever use this module 571 - this module is not thread-safe. You should only ever use this module
462 from the same thread (this requirement might be losened in the future 572 from the same thread (this requirement might be loosened in the future
463 to allow per-thread schedulers, but Coro::State does not yet allow 573 to allow per-thread schedulers, but Coro::State does not yet allow
464 this). 574 this).
465 575
466=head1 SEE ALSO 576=head1 SEE ALSO
467 577

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines