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

Comparing Coro/Coro.pm (file contents):
Revision 1.21 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.132 by root, Thu Sep 20 22:53:23 2007 UTC

8 8
9 async { 9 async {
10 # some asynchronous thread of execution 10 # some asynchronous thread of execution
11 }; 11 };
12 12
13 # alternatively create an async process like this: 13 # alternatively create an async coroutine like this:
14 14
15 sub some_func : Coro { 15 sub some_func : Coro {
16 # some more async code 16 # some more async code
17 } 17 }
18 18
19 yield; 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
26This module is still experimental, see the BUGS section below. 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).
27 34
28In this module, coroutines are defined as "callchain + lexical variables 35In this module, coroutines are defined as "callchain + lexical variables +
29+ @_ + $_ + $@ + $^W), that is, a coroutine has it's own callchain, it's 36@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
30own set of lexicals and it's own set of perl's most important global 37its own set of lexicals and its own set of perls most important global
31variables. 38variables.
32 39
33WARNING: When using this module, make sure that, at program end, no
34coroutines are still running OR just call exit before falling off the
35end. The reason for this is that some coroutine of yours might have called
36into a C function, and falling off the end of main:: results in returning
37to that C function instead if to the main C interpreter.
38
39=cut 40=cut
40 41
41package Coro; 42package Coro;
42 43
44use strict;
45no warnings "uninitialized";
46
43use Coro::State; 47use Coro::State;
44 48
45use base Exporter; 49use base qw(Coro::State Exporter);
46 50
47$VERSION = 0.10; 51our $idle; # idle handler
52our $main; # main coroutine
53our $current; # current coroutine
48 54
55our $VERSION = '3.7';
56
49@EXPORT = qw(async yield schedule terminate current); 57our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
50@EXPORT_OK = qw($current); 58our %EXPORT_TAGS = (
59 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60);
61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
51 62
52{ 63{
53 my @async; 64 my @async;
65 my $init;
54 66
55 # this way of handling attributes simply is NOT scalable ;() 67 # this way of handling attributes simply is NOT scalable ;()
56 sub import { 68 sub import {
69 no strict 'refs';
70
57 Coro->export_to_level(1, @_); 71 Coro->export_to_level (1, @_);
72
58 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 73 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
59 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 74 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
60 my ($package, $ref) = (shift, shift); 75 my ($package, $ref) = (shift, shift);
61 my @attrs; 76 my @attrs;
62 for (@_) { 77 for (@_) {
63 if ($_ eq "Coro") { 78 if ($_ eq "Coro") {
64 push @async, $ref; 79 push @async, $ref;
80 unless ($init++) {
81 eval q{
82 sub INIT {
83 &async(pop @async) while @async;
84 }
85 };
86 }
65 } else { 87 } else {
66 push @attrs, $_; 88 push @attrs, $_;
67 } 89 }
68 } 90 }
69 return $old ? $old->($package, $ref, @attrs) : @attrs; 91 return $old ? $old->($package, $ref, @attrs) : @attrs;
70 }; 92 };
71 } 93 }
72 94
73 sub INIT {
74 &async(pop @async) while @async;
75 }
76} 95}
96
97=over 4
77 98
78=item $main 99=item $main
79 100
80This coroutine represents the main program. 101This coroutine represents the main program.
81 102
82=cut 103=cut
83 104
84our $main = new Coro; 105$main = new Coro;
85 106
86=item $current (or as function: current) 107=item $current (or as function: current)
87 108
88The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). 109The current coroutine (the last coroutine switched to). The initial value
110is C<$main> (of course).
89 111
112This variable is B<strictly> I<read-only>. It is provided for performance
113reasons. If performance is not essential you are encouraged to use the
114C<Coro::current> function instead.
115
90=cut 116=cut
117
118$main->{desc} = "[main::]";
91 119
92# maybe some other module used Coro::Specific before... 120# maybe some other module used Coro::Specific before...
93if ($current) {
94 $main->{specific} = $current->{specific}; 121$main->{specific} = $current->{specific}
95} 122 if $current;
96 123
97our $current = $main; 124_set_current $main;
98 125
99sub current() { $current } 126sub current() { $current }
100 127
101=item $idle 128=item $idle
102 129
103The coroutine to switch to when no other coroutine is running. The default 130A callback that is called whenever the scheduler finds no ready coroutines
104implementation prints "FATAL: deadlock detected" and exits. 131to run. The default implementation prints "FATAL: deadlock detected" and
132exits, because the program has no other way to continue.
105 133
106=cut 134This 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
136coroutine so the scheduler can run it.
107 137
108# should be done using priorities :( 138Please note that if your callback recursively invokes perl (e.g. for event
109our $idle = new Coro sub { 139handlers), then it must be prepared to be called recursively.
110 print STDERR "FATAL: deadlock detected\n"; 140
111 exit(51); 141=cut
142
143$idle = sub {
144 require Carp;
145 Carp::croak ("FATAL: deadlock detected");
112}; 146};
113 147
114# we really need priorities... 148sub _cancel {
115my @ready; # the ready queue. hehe, rather broken ;) 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
160# this coroutine is necessary because a coroutine
161# cannot destroy itself.
162my @destroy;
163my $manager;
164
165$manager = new Coro sub {
166 while () {
167 (shift @destroy)->_cancel
168 while @destroy;
169
170 &schedule;
171 }
172};
173$manager->desc ("[coro manager]");
174$manager->prio (PRIO_MAX);
116 175
117# static methods. not really. 176# static methods. not really.
118 177
178=back
179
119=head2 STATIC METHODS 180=head2 STATIC METHODS
120 181
121Static methods are actually functions that operate on the current process only. 182Static methods are actually functions that operate on the current coroutine only.
122 183
123=over 4 184=over 4
124 185
125=item async { ... } [@args...] 186=item async { ... } [@args...]
126 187
127Create a new asynchronous process and return it's process object 188Create a new asynchronous coroutine and return it's coroutine object
128(usually unused). When the sub returns the new process is automatically 189(usually unused). When the sub returns the new coroutine is automatically
129terminated. 190terminated.
191
192Calling C<exit> in a coroutine will do the same as calling exit outside
193the coroutine. Likewise, when the coroutine dies, the program will exit,
194just as it would in the main program.
130 195
131 # create a new coroutine that just prints its arguments 196 # create a new coroutine that just prints its arguments
132 async { 197 async {
133 print "@_\n"; 198 print "@_\n";
134 } 1,2,3,4; 199 } 1,2,3,4;
135 200
136The coderef you submit MUST NOT be a closure that refers to variables
137in an outer scope. This does NOT work. Pass arguments into it instead.
138
139=cut 201=cut
140 202
141sub async(&@) { 203sub async(&@) {
142 my $pid = new Coro @_; 204 my $coro = new Coro @_;
143 $pid->ready; 205 $coro->ready;
144 $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 {
230terminate }> once per second or so to slowly replenish the pool.
231
232=cut
233
234our $POOL_SIZE = 8;
235our $MAX_POOL_RSS = 64 * 1024;
236our @pool;
237
238sub pool_handler {
239 while () {
240 $current->{desc} = "[async_pool]";
241
242 eval {
243 my ($cb, @arg) = @{ delete $current->{_invoke} or return };
244 $cb->(@arg);
245 };
246 warn $@ if $@;
247
248 last if @pool >= $POOL_SIZE || $current->rss >= $MAX_POOL_RSS;
249
250 push @pool, $current;
251 $current->{desc} = "[async_pool idle]";
252 $current->save (Coro::State::SAVE_DEF);
253 $current->prio (0);
254 schedule;
255 }
256}
257
258sub async_pool(&@) {
259 # this is also inlined into the unlock_scheduler
260 my $coro = (pop @pool) || new Coro \&pool_handler;;
261
262 $coro->{_invoke} = [@_];
263 $coro->ready;
264
265 $coro
145} 266}
146 267
147=item schedule 268=item schedule
148 269
149Calls the scheduler. Please note that the current process will not be put 270Calls the scheduler. Please note that the current coroutine will not be put
150into the ready queue, so calling this function usually means you will 271into the ready queue, so calling this function usually means you will
151never be called again. 272never be called again unless something else (e.g. an event handler) calls
273ready.
152 274
153=cut 275The canonical way to wait on external events is this:
154 276
155my $prev; 277 {
278 # remember current coroutine
279 my $current = $Coro::current;
156 280
157sub schedule { 281 # register a hypothetical event handler
158 # should be done using priorities :( 282 on_event_invoke sub {
159 ($prev, $current) = ($current, shift @ready || $idle); 283 # wake up sleeping coroutine
160 Coro::State::transfer($prev, $current);
161}
162
163=item yield
164
165Yield to other processes. This function puts the current process into the
166ready queue and calls C<schedule>.
167
168=cut
169
170sub yield {
171 $current->ready; 284 $current->ready;
172 &schedule; 285 undef $current;
173} 286 };
174 287
288 # call schedule until event occurred.
289 # in case we are woken up for other reasons
290 # (current still defined), loop.
291 Coro::schedule while $current;
292 }
293
294=item cede
295
296"Cede" to other coroutines. This function puts the current coroutine into the
297ready queue and calls C<schedule>, which has the effect of giving up the
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.
308
175=item terminate 309=item terminate [arg...]
176 310
177Terminates the current process. 311Terminates the current coroutine with the given status values (see L<cancel>).
178
179Future versions of this function will allow result arguments.
180 312
181=cut 313=cut
182 314
183sub terminate { 315sub terminate {
184 $current->{_results} = [@_]; 316 $current->cancel (@_);
185 delete $current->{_coro_state};
186 &schedule;
187} 317}
188 318
189=back 319=back
190 320
191# dynamic methods 321# dynamic methods
192 322
193=head2 PROCESS METHODS 323=head2 COROUTINE METHODS
194 324
195These are the methods you can call on process objects. 325These are the methods you can call on coroutine objects.
196 326
197=over 4 327=over 4
198 328
199=item new Coro \&sub [, @args...] 329=item new Coro \&sub [, @args...]
200 330
201Create a new process and return it. When the sub returns the process 331Create a new coroutine and return it. When the sub returns the coroutine
202automatically terminates. To start the process you must first put it into 332automatically terminates as if C<terminate> with the returned values were
333called. To make the coroutine run you must first put it into the ready queue
203the ready queue by calling the ready method. 334by calling the ready method.
204 335
205The coderef you submit MUST NOT be a closure that refers to variables 336See C<async> for additional discussion.
206in an outer scope. This does NOT work. Pass arguments into it instead.
207 337
208=cut 338=cut
209 339
210sub _newcoro { 340sub _run_coro {
211 terminate &{+shift}; 341 terminate &{+shift};
212} 342}
213 343
214sub new { 344sub new {
215 my $class = shift; 345 my $class = shift;
216 bless {
217 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
218 }, $class;
219}
220 346
221=item $process->ready 347 $class->SUPER::new (\&_run_coro, @_)
348}
222 349
223Put the current process into the ready queue. 350=item $success = $coroutine->ready
224 351
225=cut 352Put the given coroutine into the ready queue (according to it's priority)
353and return true. If the coroutine is already in the ready queue, do nothing
354and return false.
226 355
227sub ready { 356=item $is_ready = $coroutine->is_ready
228 push @ready, $_[0]; 357
358Return wether the coroutine is currently the ready queue or not,
359
360=item $coroutine->cancel (arg...)
361
362Terminates the given coroutine and makes it return the given arguments as
363status (default: the empty list). Never returns if the coroutine is the
364current coroutine.
365
366=cut
367
368sub cancel {
369 my $self = shift;
370 $self->{status} = [@_];
371
372 if ($current == $self) {
373 push @destroy, $self;
374 $manager->ready;
375 &schedule while 1;
376 } else {
377 $self->_cancel;
378 }
379}
380
381=item $coroutine->join
382
383Wait until the coroutine terminates and return any values given to the
384C<terminate> or C<cancel> functions. C<join> can be called multiple times
385from multiple coroutine.
386
387=cut
388
389sub join {
390 my $self = shift;
391
392 unless ($self->{status}) {
393 my $current = $current;
394
395 push @{$self->{destroy_cb}}, sub {
396 $current->ready;
397 undef $current;
398 };
399
400 &schedule while $current;
401 }
402
403 wantarray ? @{$self->{status}} : $self->{status}[0];
404}
405
406=item $coroutine->on_destroy (\&cb)
407
408Registers a callback that is called when this coroutine gets destroyed,
409but before it is joined. The callback gets passed the terminate arguments,
410if any.
411
412=cut
413
414sub on_destroy {
415 my ($self, $cb) = @_;
416
417 push @{ $self->{destroy_cb} }, $cb;
418}
419
420=item $oldprio = $coroutine->prio ($newprio)
421
422Sets (or gets, if the argument is missing) the priority of the
423coroutine. Higher priority coroutines get run before lower priority
424coroutines. Priorities are small signed integers (currently -4 .. +3),
425that you can refer to using PRIO_xxx constants (use the import tag :prio
426to get then):
427
428 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
429 3 > 1 > 0 > -1 > -3 > -4
430
431 # set priority to HIGH
432 current->prio(PRIO_HIGH);
433
434The idle coroutine ($Coro::idle) always has a lower priority than any
435existing coroutine.
436
437Changing the priority of the current coroutine will take effect immediately,
438but changing the priority of coroutines in the ready queue (but not
439running) will only take effect after the next schedule (of that
440coroutine). This is a bug that will be fixed in some future version.
441
442=item $newprio = $coroutine->nice ($change)
443
444Similar to C<prio>, but subtract the given value from the priority (i.e.
445higher values mean lower priority, just as in unix).
446
447=item $olddesc = $coroutine->desc ($newdesc)
448
449Sets (or gets in case the argument is missing) the description for this
450coroutine. This is just a free-form string you can associate with a coroutine.
451
452=cut
453
454sub desc {
455 my $old = $_[0]{desc};
456 $_[0]{desc} = $_[1] if @_ > 1;
457 $old;
229} 458}
230 459
231=back 460=back
232 461
462=head2 GLOBAL FUNCTIONS
463
464=over 4
465
466=item Coro::nready
467
468Returns the number of coroutines that are currently in the ready state,
469i.e. that can be switched to. The value C<0> means that the only runnable
470coroutine is the currently running one, so C<cede> would have no effect,
471and C<schedule> would cause a deadlock unless there is an idle handler
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
507
508=item unblock_sub { ... }
509
510This utility function takes a BLOCK or code reference and "unblocks" it,
511returning the new coderef. This means that the new coderef will return
512immediately without blocking, returning nothing, while the original code
513ref will be called (with parameters) from within its own coroutine.
514
515The reason this function exists is that many event libraries (such as the
516venerable L<Event|Event> module) are not coroutine-safe (a weaker form
517of thread-safety). This means you must not block within event callbacks,
518otherwise you might suffer from crashes or worse.
519
520This function allows your callbacks to block by executing them in another
521coroutine where it is safe to block. One example where blocking is handy
522is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
523disk.
524
525In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
526creating event callbacks that want to block.
527
528=cut
529
530our @unblock_queue;
531
532# we create a special coro because we want to cede,
533# to reduce pressure on the coro pool (because most callbacks
534# return immediately and can be reused) and because we cannot cede
535# inside an event callback.
536our $unblock_scheduler = new Coro sub {
537 while () {
538 while (my $cb = pop @unblock_queue) {
539 # this is an inlined copy of async_pool
540 my $coro = (pop @pool or new Coro \&pool_handler);
541
542 $coro->{_invoke} = $cb;
543 $coro->ready;
544 cede; # for short-lived callbacks, this reduces pressure on the coro pool
545 }
546 schedule; # sleep well
547 }
548};
549$unblock_scheduler->desc ("[unblock_sub scheduler]");
550
551sub unblock_sub(&) {
552 my $cb = shift;
553
554 sub {
555 unshift @unblock_queue, [$cb, @_];
556 $unblock_scheduler->ready;
557 }
558}
559
560=back
561
233=cut 562=cut
234 563
2351; 5641;
236 565
237=head1 BUGS/LIMITATIONS 566=head1 BUGS/LIMITATIONS
238 567
239 - could be faster, especially when the core would introduce special 568 - you must make very sure that no coro is still active on global
240 support for coroutines (like it does for threads). 569 destruction. very bad things might happen otherwise (usually segfaults).
241 - there is still a memleak on coroutine termination that I could not 570
242 identify. Could be as small as a single SV.
243 - this module is not well-tested.
244 - if variables or arguments "disappear" (become undef) or become
245 corrupted please contact the author so he cen iron out the
246 remaining bugs.
247 - this module is not thread-safe. You must only ever use this module from 571 - this module is not thread-safe. You should only ever use this module
248 the same thread (this requirement might be loosened in the future to 572 from the same thread (this requirement might be loosened in the future
249 allow per-thread schedulers, but Coro::State does not yet allow this). 573 to allow per-thread schedulers, but Coro::State does not yet allow
574 this).
250 575
251=head1 SEE ALSO 576=head1 SEE ALSO
252 577
253L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 578Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
254L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 579
580Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
581
582Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
583
584Embedding: L<Coro:MakeMaker>
255 585
256=head1 AUTHOR 586=head1 AUTHOR
257 587
258 Marc Lehmann <pcg@goof.com> 588 Marc Lehmann <schmorp@schmorp.de>
259 http://www.goof.com/pcg/marc/ 589 http://home.schmorp.de/
260 590
261=cut 591=cut
262 592

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines