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

Comparing Coro/Coro.pm (file contents):
Revision 1.92 by root, Fri Dec 1 03:47:55 2006 UTC vs.
Revision 1.141 by root, Tue Oct 2 10:38:17 2007 UTC

18 18
19 cede; 19 cede;
20 20
21=head1 DESCRIPTION 21=head1 DESCRIPTION
22 22
23This module collection manages coroutines. Coroutines are similar to 23This module collection manages coroutines. Coroutines are similar
24threads but don't run in parallel. 24to threads but don't run in parallel at the same time even on SMP
25machines. The specific flavor of coroutine used in this module also
26guarantees you that it will not switch between coroutines unless
27necessary, at easily-identified points in your program, so locking and
28parallel access are rarely an issue, making coroutine programming much
29safer than threads programming.
25 30
31(Perl, however, does not natively support real threads but instead does a
32very slow and memory-intensive emulation of processes using threads. This
33is a performance win on Windows machines, and a loss everywhere else).
34
26In this module, coroutines are defined as "callchain + lexical variables 35In this module, coroutines are defined as "callchain + lexical variables +
27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own 36@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
28callchain, it's own set of lexicals and it's own set of perl's most 37its own set of lexicals and its own set of perls most important global
29important global variables. 38variables.
30 39
31=cut 40=cut
32 41
33package Coro; 42package Coro;
34 43
41 50
42our $idle; # idle handler 51our $idle; # idle handler
43our $main; # main coroutine 52our $main; # main coroutine
44our $current; # current coroutine 53our $current; # current coroutine
45 54
46our $VERSION = '3.0'; 55our $VERSION = '3.8';
47 56
48our @EXPORT = qw(async cede schedule terminate current unblock_sub); 57our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
49our %EXPORT_TAGS = ( 58our %EXPORT_TAGS = (
50 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)],
51); 60);
52our @EXPORT_OK = @{$EXPORT_TAGS{prio}}; 61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
53 62
54{ 63{
55 my @async; 64 my @async;
56 my $init; 65 my $init;
57 66
58 # this way of handling attributes simply is NOT scalable ;() 67 # this way of handling attributes simply is NOT scalable ;()
59 sub import { 68 sub import {
60 no strict 'refs'; 69 no strict 'refs';
61 70
62 Coro->export_to_level(1, @_); 71 Coro->export_to_level (1, @_);
63 72
64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 73 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 74 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
66 my ($package, $ref) = (shift, shift); 75 my ($package, $ref) = (shift, shift);
67 my @attrs; 76 my @attrs;
99 108
100The current coroutine (the last coroutine switched to). The initial value 109The current coroutine (the last coroutine switched to). The initial value
101is C<$main> (of course). 110is C<$main> (of course).
102 111
103This 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
104reasons. If performance is not essentiel you are encouraged to use the 113reasons. If performance is not essential you are encouraged to use the
105C<Coro::current> function instead. 114C<Coro::current> function instead.
106 115
107=cut 116=cut
108 117
118$main->{desc} = "[main::]";
119
109# maybe some other module used Coro::Specific before... 120# maybe some other module used Coro::Specific before...
110if ($current) {
111 $main->{specific} = $current->{specific}; 121$main->{specific} = $current->{specific}
112} 122 if $current;
113 123
114$current = $main; 124_set_current $main;
115 125
116sub current() { $current } 126sub current() { $current }
117 127
118=item $idle 128=item $idle
119 129
129handlers), then it must be prepared to be called recursively. 139handlers), then it must be prepared to be called recursively.
130 140
131=cut 141=cut
132 142
133$idle = sub { 143$idle = sub {
134 print STDERR "FATAL: deadlock detected\n"; 144 require Carp;
135 exit (51); 145 Carp::croak ("FATAL: deadlock detected");
136}; 146};
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}
137 159
138# this coroutine is necessary because a coroutine 160# this coroutine is necessary because a coroutine
139# cannot destroy itself. 161# cannot destroy itself.
140my @destroy; 162my @destroy;
163my $manager;
164
141my $manager; $manager = new Coro sub { 165$manager = new Coro sub {
142 while () { 166 while () {
143 # by overwriting the state object with the manager we destroy it 167 (shift @destroy)->_cancel
144 # while still being able to schedule this coroutine (in case it has
145 # been readied multiple times. this is harmless since the manager
146 # can be called as many times as neccessary and will always
147 # remove itself from the runqueue
148 while (@destroy) { 168 while @destroy;
149 my $coro = pop @destroy;
150 $coro->{status} ||= [];
151 $_->ready for @{delete $coro->{join} || []};
152 169
153 # the next line destroys the coro state, but keeps the
154 # coroutine itself intact (we basically make it a zombie
155 # coroutine that always runs the manager thread, so it's possible
156 # to transfer() to this coroutine).
157 $coro->_clone_state_from ($manager);
158 }
159 &schedule; 170 &schedule;
160 } 171 }
161}; 172};
173$manager->desc ("[coro manager]");
174$manager->prio (PRIO_MAX);
162 175
163# static methods. not really. 176# static methods. not really.
164 177
165=back 178=back
166 179
174 187
175Create a new asynchronous coroutine and return it's coroutine object 188Create a new asynchronous coroutine and return it's coroutine object
176(usually unused). When the sub returns the new coroutine is automatically 189(usually unused). When the sub returns the new coroutine is automatically
177terminated. 190terminated.
178 191
179Calling 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
180 193the coroutine. Likewise, when the coroutine dies, the program will exit,
181When the coroutine dies, the program will exit, just as in the main 194just as it would in the main program.
182program.
183 195
184 # create a new coroutine that just prints its arguments 196 # create a new coroutine that just prints its arguments
185 async { 197 async {
186 print "@_\n"; 198 print "@_\n";
187 } 1,2,3,4; 199 } 1,2,3,4;
188 200
189=cut 201=cut
190 202
191sub async(&@) { 203sub async(&@) {
192 my $pid = new Coro @_; 204 my $coro = new Coro @_;
193 $pid->ready; 205 $coro->ready;
194 $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
195} 266}
196 267
197=item schedule 268=item schedule
198 269
199Calls 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
212 # wake up sleeping coroutine 283 # wake up sleeping coroutine
213 $current->ready; 284 $current->ready;
214 undef $current; 285 undef $current;
215 }; 286 };
216 287
217 # call schedule until event occured. 288 # call schedule until event occurred.
218 # in case we are woken up for other reasons 289 # in case we are woken up for other reasons
219 # (current still defined), loop. 290 # (current still defined), loop.
220 Coro::schedule while $current; 291 Coro::schedule while $current;
221 } 292 }
222 293
224 295
225"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
226ready 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
227current "timeslice" to other coroutines of the same or higher priority. 298current "timeslice" to other coroutines of the same or higher priority.
228 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.
308
229=item terminate [arg...] 309=item terminate [arg...]
230 310
231Terminates the current coroutine with the given status values (see L<cancel>). 311Terminates the current coroutine with the given status values (see L<cancel>).
312
313=item killall
314
315Kills/terminates/cancels all coroutines except the currently running
316one. This is useful after a fork, either in the child or the parent, as
317usually only one of them should inherit the running coroutines.
232 318
233=cut 319=cut
234 320
235sub terminate { 321sub terminate {
236 $current->cancel (@_); 322 $current->cancel (@_);
323}
324
325sub killall {
326 for (Coro::State::list) {
327 $_->cancel
328 if $_ != $current && UNIVERSAL::isa $_, "Coro";
329 }
237} 330}
238 331
239=back 332=back
240 333
241# dynamic methods 334# dynamic methods
251Create a new coroutine and return it. When the sub returns the coroutine 344Create a new coroutine and return it. When the sub returns the coroutine
252automatically terminates as if C<terminate> with the returned values were 345automatically terminates as if C<terminate> with the returned values were
253called. To make the coroutine run you must first put it into the ready queue 346called. To make the coroutine run you must first put it into the ready queue
254by calling the ready method. 347by calling the ready method.
255 348
256Calling C<exit> in a coroutine will not work correctly, so do not do that. 349See C<async> for additional discussion.
257 350
258=cut 351=cut
259 352
260sub _new_coro { 353sub _run_coro {
261 terminate &{+shift}; 354 terminate &{+shift};
262} 355}
263 356
264sub new { 357sub new {
265 my $class = shift; 358 my $class = shift;
266 359
267 $class->SUPER::new (\&_new_coro, @_) 360 $class->SUPER::new (\&_run_coro, @_)
268} 361}
269 362
270=item $success = $coroutine->ready 363=item $success = $coroutine->ready
271 364
272Put the given coroutine into the ready queue (according to it's priority) 365Put the given coroutine into the ready queue (according to it's priority)
278Return wether the coroutine is currently the ready queue or not, 371Return wether the coroutine is currently the ready queue or not,
279 372
280=item $coroutine->cancel (arg...) 373=item $coroutine->cancel (arg...)
281 374
282Terminates the given coroutine and makes it return the given arguments as 375Terminates the given coroutine and makes it return the given arguments as
283status (default: the empty list). 376status (default: the empty list). Never returns if the coroutine is the
377current coroutine.
284 378
285=cut 379=cut
286 380
287sub cancel { 381sub cancel {
288 my $self = shift; 382 my $self = shift;
289 $self->{status} = [@_]; 383 $self->{status} = [@_];
384
385 if ($current == $self) {
290 push @destroy, $self; 386 push @destroy, $self;
291 $manager->ready; 387 $manager->ready;
292 &schedule if $current == $self; 388 &schedule while 1;
389 } else {
390 $self->_cancel;
391 }
293} 392}
294 393
295=item $coroutine->join 394=item $coroutine->join
296 395
297Wait until the coroutine terminates and return any values given to the 396Wait until the coroutine terminates and return any values given to the
300 399
301=cut 400=cut
302 401
303sub join { 402sub join {
304 my $self = shift; 403 my $self = shift;
404
305 unless ($self->{status}) { 405 unless ($self->{status}) {
306 push @{$self->{join}}, $current; 406 my $current = $current;
307 &schedule; 407
408 push @{$self->{destroy_cb}}, sub {
409 $current->ready;
410 undef $current;
411 };
412
413 &schedule while $current;
308 } 414 }
415
309 wantarray ? @{$self->{status}} : $self->{status}[0]; 416 wantarray ? @{$self->{status}} : $self->{status}[0];
417}
418
419=item $coroutine->on_destroy (\&cb)
420
421Registers a callback that is called when this coroutine gets destroyed,
422but before it is joined. The callback gets passed the terminate arguments,
423if any.
424
425=cut
426
427sub on_destroy {
428 my ($self, $cb) = @_;
429
430 push @{ $self->{destroy_cb} }, $cb;
310} 431}
311 432
312=item $oldprio = $coroutine->prio ($newprio) 433=item $oldprio = $coroutine->prio ($newprio)
313 434
314Sets (or gets, if the argument is missing) the priority of the 435Sets (or gets, if the argument is missing) the priority of the
349 $old; 470 $old;
350} 471}
351 472
352=back 473=back
353 474
354=head2 UTILITY FUNCTIONS 475=head2 GLOBAL FUNCTIONS
355 476
356=over 4 477=over 4
478
479=item Coro::nready
480
481Returns the number of coroutines that are currently in the ready state,
482i.e. that can be switched to. The value C<0> means that the only runnable
483coroutine is the currently running one, so C<cede> would have no effect,
484and C<schedule> would cause a deadlock unless there is an idle handler
485that wakes up some coroutines.
486
487=item my $guard = Coro::guard { ... }
488
489This creates and returns a guard object. Nothing happens until the object
490gets destroyed, in which case the codeblock given as argument will be
491executed. This is useful to free locks or other resources in case of a
492runtime error or when the coroutine gets canceled, as in both cases the
493guard block will be executed. The guard object supports only one method,
494C<< ->cancel >>, which will keep the codeblock from being executed.
495
496Example: set some flag and clear it again when the coroutine gets canceled
497or the function returns:
498
499 sub do_something {
500 my $guard = Coro::guard { $busy = 0 };
501 $busy = 1;
502
503 # do something that requires $busy to be true
504 }
505
506=cut
507
508sub guard(&) {
509 bless \(my $cb = $_[0]), "Coro::guard"
510}
511
512sub Coro::guard::cancel {
513 ${$_[0]} = sub { };
514}
515
516sub Coro::guard::DESTROY {
517 ${$_[0]}->();
518}
519
357 520
358=item unblock_sub { ... } 521=item unblock_sub { ... }
359 522
360This utility function takes a BLOCK or code reference and "unblocks" it, 523This utility function takes a BLOCK or code reference and "unblocks" it,
361returning the new coderef. This means that the new coderef will return 524returning the new coderef. This means that the new coderef will return
362immediately without blocking, returning nothing, while the original code 525immediately without blocking, returning nothing, while the original code
363ref will be called (with parameters) from within its own coroutine. 526ref will be called (with parameters) from within its own coroutine.
364 527
365The reason this fucntion exists is that many event libraries (such as the 528The reason this function exists is that many event libraries (such as the
366venerable L<Event|Event> module) are not coroutine-safe (a weaker form 529venerable L<Event|Event> module) are not coroutine-safe (a weaker form
367of thread-safety). This means you must not block within event callbacks, 530of thread-safety). This means you must not block within event callbacks,
368otherwise you might suffer from crashes or worse. 531otherwise you might suffer from crashes or worse.
369 532
370This function allows your callbacks to block by executing them in another 533This function allows your callbacks to block by executing them in another
375In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 538In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
376creating event callbacks that want to block. 539creating event callbacks that want to block.
377 540
378=cut 541=cut
379 542
380our @unblock_pool;
381our @unblock_queue; 543our @unblock_queue;
382our $UNBLOCK_POOL_SIZE = 2;
383 544
384sub unblock_handler_ { 545# we create a special coro because we want to cede,
385 while () { 546# to reduce pressure on the coro pool (because most callbacks
386 my ($cb, @arg) = @{ delete $Coro::current->{arg} }; 547# return immediately and can be reused) and because we cannot cede
387 $cb->(@arg); 548# inside an event callback.
388
389 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
390 push @unblock_pool, $Coro::current;
391 schedule;
392 }
393}
394
395our $unblock_scheduler = async { 549our $unblock_scheduler = new Coro sub {
396 while () { 550 while () {
397 while (my $cb = pop @unblock_queue) { 551 while (my $cb = pop @unblock_queue) {
398 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_); 552 # this is an inlined copy of async_pool
399 $handler->{arg} = $cb; 553 my $coro = (pop @async_pool) || new Coro \&pool_handler;
554
555 $coro->{_invoke} = $cb;
400 $handler->ready; 556 $coro->ready;
401 cede; 557 cede; # for short-lived callbacks, this reduces pressure on the coro pool
402 } 558 }
403 559 schedule; # sleep well
404 schedule;
405 } 560 }
406}; 561};
562$unblock_scheduler->desc ("[unblock_sub scheduler]");
407 563
408sub unblock_sub(&) { 564sub unblock_sub(&) {
409 my $cb = shift; 565 my $cb = shift;
410 566
411 sub { 567 sub {
412 push @unblock_queue, [$cb, @_]; 568 unshift @unblock_queue, [$cb, @_];
413 $unblock_scheduler->ready; 569 $unblock_scheduler->ready;
414 } 570 }
415} 571}
416 572
417=back 573=back
424 580
425 - you must make very sure that no coro is still active on global 581 - you must make very sure that no coro is still active on global
426 destruction. very bad things might happen otherwise (usually segfaults). 582 destruction. very bad things might happen otherwise (usually segfaults).
427 583
428 - this module is not thread-safe. You should only ever use this module 584 - this module is not thread-safe. You should only ever use this module
429 from the same thread (this requirement might be losened in the future 585 from the same thread (this requirement might be loosened in the future
430 to allow per-thread schedulers, but Coro::State does not yet allow 586 to allow per-thread schedulers, but Coro::State does not yet allow
431 this). 587 this).
432 588
433=head1 SEE ALSO 589=head1 SEE ALSO
434 590

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines