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.107 by root, Fri Jan 5 18:25:51 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 use din this module also
26guarentees 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.3';
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).
111
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
114C<Coro::current> function instead.
89 115
90=cut 116=cut
91 117
92# maybe some other module used Coro::Specific before... 118# maybe some other module used Coro::Specific before...
93if ($current) {
94 $main->{specific} = $current->{specific}; 119$main->{specific} = $current->{specific}
95} 120 if $current;
96 121
97our $current = $main; 122_set_current $main;
98 123
99sub current() { $current } 124sub current() { $current }
100 125
101=item $idle 126=item $idle
102 127
103The coroutine to switch to when no other coroutine is running. The default 128A callback that is called whenever the scheduler finds no ready coroutines
104implementation prints "FATAL: deadlock detected" and exits. 129to run. The default implementation prints "FATAL: deadlock detected" and
130exits, because the program has no other way to continue.
105 131
106=cut 132This 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
134coroutine so the scheduler can run it.
107 135
108# should be done using priorities :( 136Please note that if your callback recursively invokes perl (e.g. for event
109our $idle = new Coro sub { 137handlers), then it must be prepared to be called recursively.
110 print STDERR "FATAL: deadlock detected\n"; 138
111 exit(51); 139=cut
140
141$idle = sub {
142 require Carp;
143 Carp::croak ("FATAL: deadlock detected");
112}; 144};
113 145
114# we really need priorities... 146sub _cancel {
115my @ready; # the ready queue. hehe, rather broken ;) 147 my ($self) = @_;
148
149 # free coroutine data and mark as destructed
150 $self->_destroy
151 or return;
152
153 # call all destruction callbacks
154 $_->(@{$self->{status}})
155 for @{(delete $self->{destroy_cb}) || []};
156}
157
158# this coroutine is necessary because a coroutine
159# cannot destroy itself.
160my @destroy;
161my $manager;
162
163$manager = new Coro sub {
164 while () {
165 (shift @destroy)->_cancel
166 while @destroy;
167
168 &schedule;
169 }
170};
171
172$manager->prio (PRIO_MAX);
116 173
117# static methods. not really. 174# static methods. not really.
118 175
176=back
177
119=head2 STATIC METHODS 178=head2 STATIC METHODS
120 179
121Static methods are actually functions that operate on the current process only. 180Static methods are actually functions that operate on the current coroutine only.
122 181
123=over 4 182=over 4
124 183
125=item async { ... } [@args...] 184=item async { ... } [@args...]
126 185
127Create a new asynchronous process and return it's process object 186Create a new asynchronous coroutine and return it's coroutine object
128(usually unused). When the sub returns the new process is automatically 187(usually unused). When the sub returns the new coroutine is automatically
129terminated. 188terminated.
189
190Calling C<exit> in a coroutine will not work correctly, so do not do that.
191
192When the coroutine dies, the program will exit, just as in the main
193program.
130 194
131 # create a new coroutine that just prints its arguments 195 # create a new coroutine that just prints its arguments
132 async { 196 async {
133 print "@_\n"; 197 print "@_\n";
134 } 1,2,3,4; 198 } 1,2,3,4;
135 199
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 200=cut
140 201
141sub async(&@) { 202sub async(&@) {
142 my $pid = new Coro @_; 203 my $coro = new Coro @_;
143 $pid->ready; 204 $coro->ready;
144 $pid; 205 $coro
206}
207
208=item async_pool { ... } [@args...]
209
210Similar to C<async>, but uses a coroutine pool, so you should not call
211terminate or join (although you are allowed to), and you get a coroutine
212that might have executed other code already (which can be good or bad :).
213
214Also, the block is executed in an C<eval> context and a warning will be
215issued in case of an exception instead of terminating the program, as C<async> does.
216
217The priority will be reset to C<0> after each job, otherwise the coroutine
218will be re-used "as-is".
219
220The pool size is limited to 8 idle coroutines (this can be adjusted by
221changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
222required.
223
224If you are concerned about pooled coroutines growing a lot because a
225single C<async_pool> used a lot of stackspace you can e.g. C<async_pool {
226terminate }> once per second or so to slowly replenish the pool.
227
228=cut
229
230our $POOL_SIZE = 8;
231our @pool;
232
233sub pool_handler {
234 while () {
235 my ($cb, @arg) = @{ delete $current->{_invoke} };
236
237 eval {
238 $cb->(@arg);
239 };
240 warn $@ if $@;
241
242 last if @pool >= $POOL_SIZE;
243 push @pool, $current;
244
245 $current->prio (0);
246 schedule;
247 }
248}
249
250sub async_pool(&@) {
251 # this is also inlined into the unlock_scheduler
252 my $coro = (pop @pool or new Coro \&pool_handler);
253
254 $coro->{_invoke} = [@_];
255 $coro->ready;
256
257 $coro
145} 258}
146 259
147=item schedule 260=item schedule
148 261
149Calls the scheduler. Please note that the current process will not be put 262Calls the scheduler. Please note that the current coroutine will not be put
150into the ready queue, so calling this function usually means you will 263into the ready queue, so calling this function usually means you will
151never be called again. 264never be called again unless something else (e.g. an event handler) calls
265ready.
152 266
153=cut 267The canonical way to wait on external events is this:
154 268
155my $prev; 269 {
270 # remember current coroutine
271 my $current = $Coro::current;
156 272
157sub schedule { 273 # register a hypothetical event handler
158 # should be done using priorities :( 274 on_event_invoke sub {
159 ($prev, $current) = ($current, shift @ready || $idle); 275 # 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; 276 $current->ready;
172 &schedule; 277 undef $current;
173} 278 };
174 279
280 # call schedule until event occured.
281 # in case we are woken up for other reasons
282 # (current still defined), loop.
283 Coro::schedule while $current;
284 }
285
286=item cede
287
288"Cede" to other coroutines. This function puts the current coroutine into the
289ready queue and calls C<schedule>, which has the effect of giving up the
290current "timeslice" to other coroutines of the same or higher priority.
291
292Returns true if at least one coroutine switch has happened.
293
294=item Coro::cede_notself
295
296Works like cede, but is not exported by default and will cede to any
297coroutine, regardless of priority, once.
298
299Returns true if at least one coroutine switch has happened.
300
175=item terminate 301=item terminate [arg...]
176 302
177Terminates the current process. 303Terminates the current coroutine with the given status values (see L<cancel>).
178
179Future versions of this function will allow result arguments.
180 304
181=cut 305=cut
182 306
183sub terminate { 307sub terminate {
184 $current->{_results} = [@_]; 308 $current->cancel (@_);
185 delete $current->{_coro_state};
186 &schedule;
187} 309}
188 310
189=back 311=back
190 312
191# dynamic methods 313# dynamic methods
192 314
193=head2 PROCESS METHODS 315=head2 COROUTINE METHODS
194 316
195These are the methods you can call on process objects. 317These are the methods you can call on coroutine objects.
196 318
197=over 4 319=over 4
198 320
199=item new Coro \&sub [, @args...] 321=item new Coro \&sub [, @args...]
200 322
201Create a new process and return it. When the sub returns the process 323Create a new coroutine and return it. When the sub returns the coroutine
202automatically terminates. To start the process you must first put it into 324automatically terminates as if C<terminate> with the returned values were
325called. To make the coroutine run you must first put it into the ready queue
203the ready queue by calling the ready method. 326by calling the ready method.
204 327
205The coderef you submit MUST NOT be a closure that refers to variables 328Calling C<exit> in a coroutine will not work correctly, so do not do that.
206in an outer scope. This does NOT work. Pass arguments into it instead.
207 329
208=cut 330=cut
209 331
210sub _newcoro { 332sub _run_coro {
211 terminate &{+shift}; 333 terminate &{+shift};
212} 334}
213 335
214sub new { 336sub new {
215 my $class = shift; 337 my $class = shift;
216 bless {
217 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
218 }, $class;
219}
220 338
221=item $process->ready 339 $class->SUPER::new (\&_run_coro, @_)
340}
222 341
223Put the current process into the ready queue. 342=item $success = $coroutine->ready
224 343
225=cut 344Put the given coroutine into the ready queue (according to it's priority)
345and return true. If the coroutine is already in the ready queue, do nothing
346and return false.
226 347
227sub ready { 348=item $is_ready = $coroutine->is_ready
228 push @ready, $_[0]; 349
350Return wether the coroutine is currently the ready queue or not,
351
352=item $coroutine->cancel (arg...)
353
354Terminates the given coroutine and makes it return the given arguments as
355status (default: the empty list). Never returns if the coroutine is the
356current coroutine.
357
358=cut
359
360sub cancel {
361 my $self = shift;
362 $self->{status} = [@_];
363
364 if ($current == $self) {
365 push @destroy, $self;
366 $manager->ready;
367 &schedule while 1;
368 } else {
369 $self->_cancel;
370 }
371}
372
373=item $coroutine->join
374
375Wait until the coroutine terminates and return any values given to the
376C<terminate> or C<cancel> functions. C<join> can be called multiple times
377from multiple coroutine.
378
379=cut
380
381sub join {
382 my $self = shift;
383
384 unless ($self->{status}) {
385 my $current = $current;
386
387 push @{$self->{destroy_cb}}, sub {
388 $current->ready;
389 undef $current;
390 };
391
392 &schedule while $current;
393 }
394
395 wantarray ? @{$self->{status}} : $self->{status}[0];
396}
397
398=item $coroutine->on_destroy (\&cb)
399
400Registers a callback that is called when this coroutine gets destroyed,
401but before it is joined. The callback gets passed the terminate arguments,
402if any.
403
404=cut
405
406sub on_destroy {
407 my ($self, $cb) = @_;
408
409 push @{ $self->{destroy_cb} }, $cb;
410}
411
412=item $oldprio = $coroutine->prio ($newprio)
413
414Sets (or gets, if the argument is missing) the priority of the
415coroutine. Higher priority coroutines get run before lower priority
416coroutines. Priorities are small signed integers (currently -4 .. +3),
417that you can refer to using PRIO_xxx constants (use the import tag :prio
418to get then):
419
420 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
421 3 > 1 > 0 > -1 > -3 > -4
422
423 # set priority to HIGH
424 current->prio(PRIO_HIGH);
425
426The idle coroutine ($Coro::idle) always has a lower priority than any
427existing coroutine.
428
429Changing the priority of the current coroutine will take effect immediately,
430but changing the priority of coroutines in the ready queue (but not
431running) will only take effect after the next schedule (of that
432coroutine). This is a bug that will be fixed in some future version.
433
434=item $newprio = $coroutine->nice ($change)
435
436Similar to C<prio>, but subtract the given value from the priority (i.e.
437higher values mean lower priority, just as in unix).
438
439=item $olddesc = $coroutine->desc ($newdesc)
440
441Sets (or gets in case the argument is missing) the description for this
442coroutine. This is just a free-form string you can associate with a coroutine.
443
444=cut
445
446sub desc {
447 my $old = $_[0]{desc};
448 $_[0]{desc} = $_[1] if @_ > 1;
449 $old;
229} 450}
230 451
231=back 452=back
232 453
454=head2 GLOBAL FUNCTIONS
455
456=over 4
457
458=item Coro::nready
459
460Returns the number of coroutines that are currently in the ready state,
461i.e. that can be swicthed to. The value C<0> means that the only runnable
462coroutine is the currently running one, so C<cede> would have no effect,
463and C<schedule> would cause a deadlock unless there is an idle handler
464that wakes up some coroutines.
465
466=item my $guard = Coro::guard { ... }
467
468This creates and returns a guard object. Nothing happens until the objetc
469gets destroyed, in which case the codeblock given as argument will be
470executed. This is useful to free locks or other resources in case of a
471runtime error or when the coroutine gets canceled, as in both cases the
472guard block will be executed. The guard object supports only one method,
473C<< ->cancel >>, which will keep the codeblock from being executed.
474
475Example: set some flag and clear it again when the coroutine gets canceled
476or the function returns:
477
478 sub do_something {
479 my $guard = Coro::guard { $busy = 0 };
480 $busy = 1;
481
482 # do something that requires $busy to be true
483 }
484
485=cut
486
487sub guard(&) {
488 bless \(my $cb = $_[0]), "Coro::guard"
489}
490
491sub Coro::guard::cancel {
492 ${$_[0]} = sub { };
493}
494
495sub Coro::guard::DESTROY {
496 ${$_[0]}->();
497}
498
499
500=item unblock_sub { ... }
501
502This utility function takes a BLOCK or code reference and "unblocks" it,
503returning the new coderef. This means that the new coderef will return
504immediately without blocking, returning nothing, while the original code
505ref will be called (with parameters) from within its own coroutine.
506
507The reason this fucntion exists is that many event libraries (such as the
508venerable L<Event|Event> module) are not coroutine-safe (a weaker form
509of thread-safety). This means you must not block within event callbacks,
510otherwise you might suffer from crashes or worse.
511
512This function allows your callbacks to block by executing them in another
513coroutine where it is safe to block. One example where blocking is handy
514is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
515disk.
516
517In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
518creating event callbacks that want to block.
519
520=cut
521
522our @unblock_queue;
523
524# we create a special coro because we want to cede,
525# to reduce pressure on the coro pool (because most callbacks
526# return immediately and can be reused) and because we cannot cede
527# inside an event callback.
528our $unblock_scheduler = async {
529 while () {
530 while (my $cb = pop @unblock_queue) {
531 # this is an inlined copy of async_pool
532 my $coro = (pop @pool or new Coro \&pool_handler);
533
534 $coro->{_invoke} = $cb;
535 $coro->ready;
536 cede; # for short-lived callbacks, this reduces pressure on the coro pool
537 }
538 schedule; # sleep well
539 }
540};
541
542sub unblock_sub(&) {
543 my $cb = shift;
544
545 sub {
546 unshift @unblock_queue, [$cb, @_];
547 $unblock_scheduler->ready;
548 }
549}
550
551=back
552
233=cut 553=cut
234 554
2351; 5551;
236 556
237=head1 BUGS/LIMITATIONS 557=head1 BUGS/LIMITATIONS
238 558
239 - could be faster, especially when the core would introduce special 559 - you must make very sure that no coro is still active on global
240 support for coroutines (like it does for threads). 560 destruction. very bad things might happen otherwise (usually segfaults).
241 - there is still a memleak on coroutine termination that I could not 561
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 562 - 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 563 from the same thread (this requirement might be losened in the future
249 allow per-thread schedulers, but Coro::State does not yet allow this). 564 to allow per-thread schedulers, but Coro::State does not yet allow
565 this).
250 566
251=head1 SEE ALSO 567=head1 SEE ALSO
252 568
253L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 569Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
254L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 570
571Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
572
573Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
574
575Embedding: L<Coro:MakeMaker>
255 576
256=head1 AUTHOR 577=head1 AUTHOR
257 578
258 Marc Lehmann <pcg@goof.com> 579 Marc Lehmann <schmorp@schmorp.de>
259 http://www.goof.com/pcg/marc/ 580 http://home.schmorp.de/
260 581
261=cut 582=cut
262 583

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines