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.91 by root, Fri Dec 1 02:17:37 2006 UTC

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 to
24Threads but don't run in parallel. 24threads but don't run in parallel.
25
26This module is still experimental, see the BUGS section below.
27 25
28In this module, coroutines are defined as "callchain + lexical variables 26In this module, coroutines are defined as "callchain + lexical variables
29+ @_ + $_ + $@ + $^W), that is, a coroutine has it's own callchain, it's 27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own
30own set of lexicals and it's own set of perl's most important global 28callchain, it's own set of lexicals and it's own set of perl's most
31variables. 29important global variables.
32
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 30
39=cut 31=cut
40 32
41package Coro; 33package Coro;
42 34
35use strict;
36no warnings "uninitialized";
37
43use Coro::State; 38use Coro::State;
44 39
45use base Exporter; 40use base qw(Coro::State Exporter);
46 41
47$VERSION = 0.10; 42our $idle; # idle handler
43our $main; # main coroutine
44our $current; # current coroutine
48 45
46our $VERSION = '3.0';
47
49@EXPORT = qw(async yield schedule terminate current); 48our @EXPORT = qw(async cede schedule terminate current);
50@EXPORT_OK = qw($current); 49our %EXPORT_TAGS = (
50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
51);
52our @EXPORT_OK = @{$EXPORT_TAGS{prio}};
51 53
52{ 54{
53 my @async; 55 my @async;
56 my $init;
54 57
55 # this way of handling attributes simply is NOT scalable ;() 58 # this way of handling attributes simply is NOT scalable ;()
56 sub import { 59 sub import {
60 no strict 'refs';
61
57 Coro->export_to_level(1, @_); 62 Coro->export_to_level(1, @_);
63
58 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
59 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
60 my ($package, $ref) = (shift, shift); 66 my ($package, $ref) = (shift, shift);
61 my @attrs; 67 my @attrs;
62 for (@_) { 68 for (@_) {
63 if ($_ eq "Coro") { 69 if ($_ eq "Coro") {
64 push @async, $ref; 70 push @async, $ref;
71 unless ($init++) {
72 eval q{
73 sub INIT {
74 &async(pop @async) while @async;
75 }
76 };
77 }
65 } else { 78 } else {
66 push @attrs, $_; 79 push @attrs, $_;
67 } 80 }
68 } 81 }
69 return $old ? $old->($package, $ref, @attrs) : @attrs; 82 return $old ? $old->($package, $ref, @attrs) : @attrs;
70 }; 83 };
71 } 84 }
72 85
73 sub INIT {
74 &async(pop @async) while @async;
75 }
76} 86}
87
88=over 4
77 89
78=item $main 90=item $main
79 91
80This coroutine represents the main program. 92This coroutine represents the main program.
81 93
82=cut 94=cut
83 95
84our $main = new Coro; 96$main = new Coro;
85 97
86=item $current (or as function: current) 98=item $current (or as function: current)
87 99
88The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). 100The current coroutine (the last coroutine switched to). The initial value
101is C<$main> (of course).
102
103This variable is B<strictly> I<read-only>. It is provided for performance
104reasons. If performance is not essentiel you are encouraged to use the
105C<Coro::current> function instead.
89 106
90=cut 107=cut
91 108
92# maybe some other module used Coro::Specific before... 109# maybe some other module used Coro::Specific before...
93if ($current) { 110if ($current) {
94 $main->{specific} = $current->{specific}; 111 $main->{specific} = $current->{specific};
95} 112}
96 113
97our $current = $main; 114$current = $main;
98 115
99sub current() { $current } 116sub current() { $current }
100 117
101=item $idle 118=item $idle
102 119
103The coroutine to switch to when no other coroutine is running. The default 120A callback that is called whenever the scheduler finds no ready coroutines
104implementation prints "FATAL: deadlock detected" and exits. 121to run. The default implementation prints "FATAL: deadlock detected" and
122exits, because the program has no other way to continue.
105 123
106=cut 124This hook is overwritten by modules such as C<Coro::Timer> and
125C<Coro::Event> to wait on an external event that hopefully wake up a
126coroutine so the scheduler can run it.
107 127
108# should be done using priorities :( 128Please note that if your callback recursively invokes perl (e.g. for event
109our $idle = new Coro sub { 129handlers), then it must be prepared to be called recursively.
130
131=cut
132
133$idle = sub {
110 print STDERR "FATAL: deadlock detected\n"; 134 print STDERR "FATAL: deadlock detected\n";
111 exit(51); 135 exit (51);
112}; 136};
113 137
114# we really need priorities... 138# this coroutine is necessary because a coroutine
115my @ready; # the ready queue. hehe, rather broken ;) 139# cannot destroy itself.
140my @destroy;
141my $manager; $manager = new Coro sub {
142 while () {
143 # by overwriting the state object with the manager we destroy it
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) {
149 my $coro = pop @destroy;
150 $coro->{status} ||= [];
151 $_->ready for @{delete $coro->{join} || []};
152
153 # the next line destroys the coro state, but keeps the
154 # process itself intact (we basically make it a zombie
155 # process that always runs the manager thread, so it's possible
156 # to transfer() to this process).
157 $coro->_clone_state_from ($manager);
158 }
159 &schedule;
160 }
161};
116 162
117# static methods. not really. 163# static methods. not really.
164
165=back
118 166
119=head2 STATIC METHODS 167=head2 STATIC METHODS
120 168
121Static methods are actually functions that operate on the current process only. 169Static methods are actually functions that operate on the current process only.
122 170
125=item async { ... } [@args...] 173=item async { ... } [@args...]
126 174
127Create a new asynchronous process and return it's process object 175Create a new asynchronous process and return it's process object
128(usually unused). When the sub returns the new process is automatically 176(usually unused). When the sub returns the new process is automatically
129terminated. 177terminated.
178
179Calling C<exit> in a coroutine will not work correctly, so do not do that.
180
181When the coroutine dies, the program will exit, just as in the main
182program.
130 183
131 # create a new coroutine that just prints its arguments 184 # create a new coroutine that just prints its arguments
132 async { 185 async {
133 print "@_\n"; 186 print "@_\n";
134 } 1,2,3,4; 187 } 1,2,3,4;
135 188
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 189=cut
140 190
141sub async(&@) { 191sub async(&@) {
142 my $pid = new Coro @_; 192 my $pid = new Coro @_;
143 $pid->ready; 193 $pid->ready;
144 $pid; 194 $pid
145} 195}
146 196
147=item schedule 197=item schedule
148 198
149Calls the scheduler. Please note that the current process will not be put 199Calls the scheduler. Please note that the current process will not be put
150into the ready queue, so calling this function usually means you will 200into the ready queue, so calling this function usually means you will
151never be called again. 201never be called again unless something else (e.g. an event handler) calls
202ready.
152 203
153=cut 204The canonical way to wait on external events is this:
154 205
155my $prev; 206 {
207 # remember current process
208 my $current = $Coro::current;
156 209
157sub schedule { 210 # register a hypothetical event handler
158 # should be done using priorities :( 211 on_event_invoke sub {
159 ($prev, $current) = ($current, shift @ready || $idle); 212 # wake up sleeping coroutine
160 Coro::State::transfer($prev, $current); 213 $current->ready;
161} 214 undef $current;
215 };
162 216
217 # call schedule until event occured.
218 # in case we are woken up for other reasons
219 # (current still defined), loop.
220 Coro::schedule while $current;
221 }
222
223=cut
224
163=item yield 225=item cede
164 226
165Yield to other processes. This function puts the current process into the 227"Cede" to other processes. This function puts the current process into the
166ready queue and calls C<schedule>. 228ready queue and calls C<schedule>, which has the effect of giving up the
229current "timeslice" to other coroutines of the same or higher priority.
167 230
168=cut 231=cut
169 232
170sub yield {
171 $current->ready;
172 &schedule;
173}
174
175=item terminate 233=item terminate [arg...]
176 234
177Terminates the current process. 235Terminates the current process with the given status values (see L<cancel>).
178
179Future versions of this function will allow result arguments.
180 236
181=cut 237=cut
182 238
183sub terminate { 239sub terminate {
184 $current->{_results} = [@_]; 240 $current->cancel (@_);
185 delete $current->{_coro_state};
186 &schedule;
187} 241}
188 242
189=back 243=back
190 244
191# dynamic methods 245# dynamic methods
197=over 4 251=over 4
198 252
199=item new Coro \&sub [, @args...] 253=item new Coro \&sub [, @args...]
200 254
201Create a new process and return it. When the sub returns the process 255Create a new process and return it. When the sub returns the process
202automatically terminates. To start the process you must first put it into 256automatically terminates as if C<terminate> with the returned values were
257called. To make the process run you must first put it into the ready queue
203the ready queue by calling the ready method. 258by calling the ready method.
204 259
205The coderef you submit MUST NOT be a closure that refers to variables 260Calling 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 261
208=cut 262=cut
209 263
210sub _newcoro { 264sub _new_coro {
211 terminate &{+shift}; 265 terminate &{+shift};
212} 266}
213 267
214sub new { 268sub new {
215 my $class = shift; 269 my $class = shift;
216 bless {
217 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
218 }, $class;
219}
220 270
271 $class->SUPER::new (\&_new_coro, @_)
272}
273
221=item $process->ready 274=item $success = $process->ready
222 275
223Put the current process into the ready queue. 276Put the given process into the ready queue (according to it's priority)
277and return true. If the process is already in the ready queue, do nothing
278and return false.
224 279
225=cut 280=item $is_ready = $process->is_ready
226 281
227sub ready { 282Return wether the process is currently the ready queue or not,
228 push @ready, $_[0]; 283
284=item $process->cancel (arg...)
285
286Terminates the given process and makes it return the given arguments as
287status (default: the empty list).
288
289=cut
290
291sub cancel {
292 my $self = shift;
293 $self->{status} = [@_];
294 push @destroy, $self;
295 $manager->ready;
296 &schedule if $current == $self;
297}
298
299=item $process->join
300
301Wait until the coroutine terminates and return any values given to the
302C<terminate> or C<cancel> functions. C<join> can be called multiple times
303from multiple processes.
304
305=cut
306
307sub join {
308 my $self = shift;
309 unless ($self->{status}) {
310 push @{$self->{join}}, $current;
311 &schedule;
312 }
313 wantarray ? @{$self->{status}} : $self->{status}[0];
314}
315
316=item $oldprio = $process->prio ($newprio)
317
318Sets (or gets, if the argument is missing) the priority of the
319process. Higher priority processes get run before lower priority
320processes. Priorities are small signed integers (currently -4 .. +3),
321that you can refer to using PRIO_xxx constants (use the import tag :prio
322to get then):
323
324 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
325 3 > 1 > 0 > -1 > -3 > -4
326
327 # set priority to HIGH
328 current->prio(PRIO_HIGH);
329
330The idle coroutine ($Coro::idle) always has a lower priority than any
331existing coroutine.
332
333Changing the priority of the current process will take effect immediately,
334but changing the priority of processes in the ready queue (but not
335running) will only take effect after the next schedule (of that
336process). This is a bug that will be fixed in some future version.
337
338=item $newprio = $process->nice ($change)
339
340Similar to C<prio>, but subtract the given value from the priority (i.e.
341higher values mean lower priority, just as in unix).
342
343=item $olddesc = $process->desc ($newdesc)
344
345Sets (or gets in case the argument is missing) the description for this
346process. This is just a free-form string you can associate with a process.
347
348=cut
349
350sub desc {
351 my $old = $_[0]{desc};
352 $_[0]{desc} = $_[1] if @_ > 1;
353 $old;
229} 354}
230 355
231=back 356=back
232 357
233=cut 358=cut
234 359
2351; 3601;
236 361
237=head1 BUGS/LIMITATIONS 362=head1 BUGS/LIMITATIONS
238 363
239 - could be faster, especially when the core would introduce special 364 - you must make very sure that no coro is still active on global
240 support for coroutines (like it does for threads). 365 destruction. very bad things might happen otherwise (usually segfaults).
241 - there is still a memleak on coroutine termination that I could not 366
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 367 - 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 368 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). 369 to allow per-thread schedulers, but Coro::State does not yet allow
370 this).
250 371
251=head1 SEE ALSO 372=head1 SEE ALSO
252 373
253L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 374Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
254L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 375
376Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
377
378Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
379
380Embedding: L<Coro:MakeMaker>
255 381
256=head1 AUTHOR 382=head1 AUTHOR
257 383
258 Marc Lehmann <pcg@goof.com> 384 Marc Lehmann <schmorp@schmorp.de>
259 http://www.goof.com/pcg/marc/ 385 http://home.schmorp.de/
260 386
261=cut 387=cut
262 388

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines