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

Comparing Coro/Coro.pm (file contents):
Revision 1.13 by root, Tue Jul 17 00:24:14 2001 UTC vs.
Revision 1.51 by root, Thu May 8 00:55:28 2003 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
24threads but don't run in parallel.
25
26In this module, coroutines are defined as "callchain + lexical variables
27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own
28callchain, it's own set of lexicals and it's own set of perl's most
29important global variables.
30
23=cut 31=cut
24 32
25package Coro; 33package Coro;
26 34
35no warnings qw(uninitialized);
36
27use Coro::State; 37use Coro::State;
28 38
29use base Exporter; 39use base Exporter;
30 40
31$VERSION = 0.05; 41$VERSION = 0.652;
32 42
33@EXPORT = qw(async yield schedule terminate); 43@EXPORT = qw(async cede schedule terminate current);
34@EXPORT_OK = qw($current); 44%EXPORT_TAGS = (
45 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
46);
47@EXPORT_OK = @{$EXPORT_TAGS{prio}};
35 48
36{ 49{
37 use subs 'async';
38
39 my @async; 50 my @async;
51 my $init;
40 52
41 # this way of handling attributes simply is NOT scalable ;() 53 # this way of handling attributes simply is NOT scalable ;()
42 sub import { 54 sub import {
43 Coro->export_to_level(1, @_); 55 Coro->export_to_level(1, @_);
44 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 56 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
… …
46 my ($package, $ref) = (shift, shift); 58 my ($package, $ref) = (shift, shift);
47 my @attrs; 59 my @attrs;
48 for (@_) { 60 for (@_) {
49 if ($_ eq "Coro") { 61 if ($_ eq "Coro") {
50 push @async, $ref; 62 push @async, $ref;
63 unless ($init++) {
64 eval q{
65 sub INIT {
66 &async(pop @async) while @async;
67 }
68 };
69 }
51 } else { 70 } else {
52 push @attrs, @_; 71 push @attrs, $_;
53 } 72 }
54 } 73 }
55 return $old ? $old->($package, $name, @attrs) : @attrs; 74 return $old ? $old->($package, $ref, @attrs) : @attrs;
56 }; 75 };
57 } 76 }
58 77
59 sub INIT {
60 async pop @async while @async;
61 }
62} 78}
79
80=over 4
63 81
64=item $main 82=item $main
65 83
66This coroutine represents the main program. 84This coroutine represents the main program.
67 85
68=cut 86=cut
69 87
70our $main = new Coro; 88our $main = new Coro;
71 89
72=item $current 90=item $current (or as function: current)
73 91
74The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). 92The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course).
75 93
76=cut 94=cut
77 95
… …
79if ($current) { 97if ($current) {
80 $main->{specific} = $current->{specific}; 98 $main->{specific} = $current->{specific};
81} 99}
82 100
83our $current = $main; 101our $current = $main;
102
103sub current() { $current }
84 104
85=item $idle 105=item $idle
86 106
87The coroutine to switch to when no other coroutine is running. The default 107The coroutine to switch to when no other coroutine is running. The default
88implementation prints "FATAL: deadlock detected" and exits. 108implementation prints "FATAL: deadlock detected" and exits.
… …
93our $idle = new Coro sub { 113our $idle = new Coro sub {
94 print STDERR "FATAL: deadlock detected\n"; 114 print STDERR "FATAL: deadlock detected\n";
95 exit(51); 115 exit(51);
96}; 116};
97 117
98# we really need priorities... 118# this coroutine is necessary because a coroutine
99## my @ready; #d# 119# cannot destroy itself.
100our @ready = (); # the ready queue. hehe, rather broken ;) 120my @destroy;
121my $manager;
122$manager = new Coro sub {
123 while() {
124 # by overwriting the state object with the manager we destroy it
125 # while still being able to schedule this coroutine (in case it has
126 # been readied multiple times. this is harmless since the manager
127 # can be called as many times as neccessary and will always
128 # remove itself from the runqueue
129 while (@destroy) {
130 my $coro = pop @destroy;
131 $coro->{status} ||= [];
132 $_->ready for @{delete $coro->{join} || []};
133 $coro->{_coro_state} = $manager->{_coro_state};
134 }
135 &schedule;
136 }
137};
101 138
102# static methods. not really. 139# static methods. not really.
140
141=back
103 142
104=head2 STATIC METHODS 143=head2 STATIC METHODS
105 144
106Static methods are actually functions that operate on the current process only. 145Static methods are actually functions that operate on the current process only.
107 146
… …
123 162
124=cut 163=cut
125 164
126sub async(&@) { 165sub async(&@) {
127 my $pid = new Coro @_; 166 my $pid = new Coro @_;
167 $manager->ready; # this ensures that the stack is cloned from the manager
128 $pid->ready; 168 $pid->ready;
129 $pid; 169 $pid;
130} 170}
131 171
132=item schedule 172=item schedule
… …
135into the ready queue, so calling this function usually means you will 175into the ready queue, so calling this function usually means you will
136never be called again. 176never be called again.
137 177
138=cut 178=cut
139 179
140my $prev;
141
142sub schedule {
143 # should be done using priorities :(
144 ($prev, $current) = ($current, shift @ready || $idle);
145 Coro::State::transfer($prev, $current);
146}
147
148=item yield 180=item cede
149 181
150Yield to other processes. This function puts the current process into the 182"Cede" to other processes. This function puts the current process into the
151ready queue and calls C<schedule>. 183ready queue and calls C<schedule>, which has the effect of giving up the
184current "timeslice" to other coroutines of the same or higher priority.
152 185
153=cut 186=cut
154 187
155sub yield { 188=item terminate [arg...]
189
190Terminates the current process.
191
192Future versions of this function will allow result arguments.
193
194=cut
195
196sub terminate {
197 $current->{status} = [@_];
156 $current->ready; 198 $current->cancel;
157 &schedule; 199 &schedule;
158} 200 die; # NORETURN
159
160=item terminate
161
162Terminates the current process.
163
164Future versions of this function will allow result arguments.
165
166=cut
167
168sub terminate {
169 $current->{_results} = [@_];
170 &schedule;
171} 201}
172 202
173=back 203=back
174 204
175# dynamic methods 205# dynamic methods
… …
181=over 4 211=over 4
182 212
183=item new Coro \&sub [, @args...] 213=item new Coro \&sub [, @args...]
184 214
185Create a new process and return it. When the sub returns the process 215Create a new process and return it. When the sub returns the process
186automatically terminates. To start the process you must first put it into 216automatically terminates as if C<terminate> with the returned values were
217called. To make the process run you must first put it into the ready queue
187the ready queue by calling the ready method. 218by calling the ready method.
188
189The coderef you submit MUST NOT be a closure that refers to variables
190in an outer scope. This does NOT work. Pass arguments into it instead.
191 219
192=cut 220=cut
193 221
194sub _newcoro { 222sub _newcoro {
195 terminate &{+shift}; 223 terminate &{+shift};
… …
202 }, $class; 230 }, $class;
203} 231}
204 232
205=item $process->ready 233=item $process->ready
206 234
207Put the current process into the ready queue. 235Put the given process into the ready queue.
208 236
209=cut 237=cut
210 238
211sub ready { 239=item $process->cancel
240
241Like C<terminate>, but terminates the specified process instead.
242
243=cut
244
245sub cancel {
212 push @ready, $_[0]; 246 push @destroy, $_[0];
247 $manager->ready;
248 &schedule if $current == $_[0];
249}
250
251=item $process->join
252
253Wait until the coroutine terminates and return any values given to the
254C<terminate> function. C<join> can be called multiple times from multiple
255processes.
256
257=cut
258
259sub join {
260 my $self = shift;
261 unless ($self->{status}) {
262 push @{$self->{join}}, $current;
263 &schedule;
264 }
265 wantarray ? @{$self->{status}} : $self->{status}[0];
266}
267
268=item $oldprio = $process->prio($newprio)
269
270Sets (or gets, if the argument is missing) the priority of the
271process. Higher priority processes get run before lower priority
272processes. Priorities are smalled signed integer (currently -4 .. +3),
273that you can refer to using PRIO_xxx constants (use the import tag :prio
274to get then):
275
276 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
277 3 > 1 > 0 > -1 > -3 > -4
278
279 # set priority to HIGH
280 current->prio(PRIO_HIGH);
281
282The idle coroutine ($Coro::idle) always has a lower priority than any
283existing coroutine.
284
285Changing the priority of the current process will take effect immediately,
286but changing the priority of processes in the ready queue (but not
287running) will only take effect after the next schedule (of that
288process). This is a bug that will be fixed in some future version.
289
290=cut
291
292sub prio {
293 my $old = $_[0]{prio};
294 $_[0]{prio} = $_[1] if @_ > 1;
295 $old;
296}
297
298=item $newprio = $process->nice($change)
299
300Similar to C<prio>, but subtract the given value from the priority (i.e.
301higher values mean lower priority, just as in unix).
302
303=cut
304
305sub nice {
306 $_[0]{prio} -= $_[1];
307}
308
309=item $olddesc = $process->desc($newdesc)
310
311Sets (or gets in case the argument is missing) the description for this
312process. This is just a free-form string you can associate with a process.
313
314=cut
315
316sub desc {
317 my $old = $_[0]{desc};
318 $_[0]{desc} = $_[1] if @_ > 1;
319 $old;
213} 320}
214 321
215=back 322=back
216 323
217=cut 324=cut
218 325
2191; 3261;
220 327
328=head1 BUGS/LIMITATIONS
329
330 - you must make very sure that no coro is still active on global destruction.
331 very bad things might happen otherwise (usually segfaults).
332 - this module is not thread-safe. You should only ever use this module from
333 the same thread (this requirement might be loosened in the future to
334 allow per-thread schedulers, but Coro::State does not yet allow this).
335
221=head1 SEE ALSO 336=head1 SEE ALSO
222 337
223L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 338L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>,
224L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 339L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>,
340L<Coro::Handle>, L<Coro::Socket>.
225 341
226=head1 AUTHOR 342=head1 AUTHOR
227 343
228 Marc Lehmann <pcg@goof.com> 344 Marc Lehmann <pcg@goof.com>
229 http://www.goof.com/pcg/marc/ 345 http://www.goof.com/pcg/marc/

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines