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

Comparing Coro/Coro.pm (file contents):
Revision 1.19 by root, Sat Jul 21 03:44:06 2001 UTC vs.
Revision 1.39 by root, Tue Oct 9 00:39:08 2001 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 25
26This module is still experimental, see the BUGS section below. 26This module is still experimental, see the BUGS section below.
27 27
28In this module, coroutines are defined as "callchain + lexical variables
29+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own
30callchain, it's own set of lexicals and it's own set of perl's most
31important global variables.
32
28=cut 33=cut
29 34
30package Coro; 35package Coro;
31 36
37no warnings qw(uninitialized);
38
32use Coro::State; 39use Coro::State;
33 40
34use base Exporter; 41use base Exporter;
35 42
36$VERSION = 0.09; 43$VERSION = 0.51;
37 44
38@EXPORT = qw(async yield schedule terminate current); 45@EXPORT = qw(async cede schedule terminate current);
39@EXPORT_OK = qw($current); 46%EXPORT_TAGS = (
47 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
48);
49@EXPORT_OK = @{$EXPORT_TAGS{prio}};
40 50
41{ 51{
42 use subs 'async';
43
44 my @async; 52 my @async;
53 my $init;
45 54
46 # this way of handling attributes simply is NOT scalable ;() 55 # this way of handling attributes simply is NOT scalable ;()
47 sub import { 56 sub import {
48 Coro->export_to_level(1, @_); 57 Coro->export_to_level(1, @_);
49 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 58 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
… …
51 my ($package, $ref) = (shift, shift); 60 my ($package, $ref) = (shift, shift);
52 my @attrs; 61 my @attrs;
53 for (@_) { 62 for (@_) {
54 if ($_ eq "Coro") { 63 if ($_ eq "Coro") {
55 push @async, $ref; 64 push @async, $ref;
65 unless ($init++) {
66 eval q{
67 sub INIT {
68 &async(pop @async) while @async;
69 }
70 };
71 }
56 } else { 72 } else {
57 push @attrs, $_; 73 push @attrs, $_;
58 } 74 }
59 } 75 }
60 return $old ? $old->($package, $ref, @attrs) : @attrs; 76 return $old ? $old->($package, $ref, @attrs) : @attrs;
61 }; 77 };
62 } 78 }
63 79
64 sub INIT {
65 async pop @async while @async;
66 }
67} 80}
68 81
69=item $main 82=item $main
70 83
71This coroutine represents the main program. 84This coroutine represents the main program.
… …
100our $idle = new Coro sub { 113our $idle = new Coro sub {
101 print STDERR "FATAL: deadlock detected\n"; 114 print STDERR "FATAL: deadlock detected\n";
102 exit(51); 115 exit(51);
103}; 116};
104 117
105# we really need priorities... 118# this coroutine is necessary because a coroutine
106my @ready; # the ready queue. hehe, rather broken ;) 119# cannot destroy itself.
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 (pop @destroy)->{_coro_state} = $manager->{_coro_state} while @destroy;
130 &schedule;
131 }
132};
107 133
108# static methods. not really. 134# static methods. not really.
109 135
110=head2 STATIC METHODS 136=head2 STATIC METHODS
111 137
… …
129 155
130=cut 156=cut
131 157
132sub async(&@) { 158sub async(&@) {
133 my $pid = new Coro @_; 159 my $pid = new Coro @_;
160 $manager->ready; # this ensures that the stack is cloned from the manager
134 $pid->ready; 161 $pid->ready;
135 $pid; 162 $pid;
136} 163}
137 164
138=item schedule 165=item schedule
… …
141into the ready queue, so calling this function usually means you will 168into the ready queue, so calling this function usually means you will
142never be called again. 169never be called again.
143 170
144=cut 171=cut
145 172
146my $prev;
147
148sub schedule {
149 # should be done using priorities :(
150 ($prev, $current) = ($current, shift @ready || $idle);
151 Coro::State::transfer($prev, $current);
152}
153
154=item yield 173=item cede
155 174
156Yield to other processes. This function puts the current process into the 175"Cede" to other processes. This function puts the current process into the
157ready queue and calls C<schedule>. 176ready queue and calls C<schedule>, which has the effect of giving up the
177current "timeslice" to other coroutines of the same or higher priority.
158 178
159=cut 179=cut
160 180
161sub yield { 181=item terminate
182
183Terminates the current process.
184
185Future versions of this function will allow result arguments.
186
187=cut
188
189sub terminate {
162 $current->ready; 190 $current->cancel;
163 &schedule; 191 &schedule;
164} 192 die; # NORETURN
165
166=item terminate
167
168Terminates the current process.
169
170Future versions of this function will allow result arguments.
171
172=cut
173
174sub terminate {
175 $current->{_results} = [@_];
176 &schedule;
177} 193}
178 194
179=back 195=back
180 196
181# dynamic methods 197# dynamic methods
… …
208 }, $class; 224 }, $class;
209} 225}
210 226
211=item $process->ready 227=item $process->ready
212 228
213Put the current process into the ready queue. 229Put the given process into the ready queue.
214 230
215=cut 231=cut
216 232
217sub ready { 233=item $process->cancel
234
235Like C<terminate>, but terminates the specified process instead.
236
237=cut
238
239sub cancel {
218 push @ready, $_[0]; 240 push @destroy, $_[0];
241 $manager->ready;
242 &schedule if $current == $_[0];
243}
244
245=item $oldprio = $process->prio($newprio)
246
247Sets the priority of the process. Higher priority processes get run before
248lower priority processes. Priorities are smalled signed integer (currently
249-4 .. +3), that you can refer to using PRIO_xxx constants (use the import
250tag :prio to get then):
251
252 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
253 3 > 1 > 0 > -1 > -3 > -4
254
255 # set priority to HIGH
256 current->prio(PRIO_HIGH);
257
258The idle coroutine ($Coro::idle) always has a lower priority than any
259existing coroutine.
260
261Changing the priority of the current process will take effect immediately,
262but changing the priority of processes in the ready queue (but not
263running) will only take effect after the next schedule (of that
264process). This is a bug that will be fixed in some future version.
265
266=cut
267
268sub prio {
269 my $old = $_[0]{prio};
270 $_[0]{prio} = $_[1] if @_ > 1;
271 $old;
272}
273
274=item $newprio = $process->nice($change)
275
276Similar to C<prio>, but subtract the given value from the priority (i.e.
277higher values mean lower priority, just as in unix).
278
279=cut
280
281sub nice {
282 $_[0]{prio} -= $_[1];
219} 283}
220 284
221=back 285=back
222 286
223=cut 287=cut
224 288
2251; 2891;
226 290
227=head1 BUGS/LIMITATIONS 291=head1 BUGS/LIMITATIONS
228 292
229 - could be faster, especially when the core would introduce special 293 - you must make very sure that no coro is still active on global destruction.
230 support for coroutines (like it does for threads). 294 very bad things might happen otherwise (usually segfaults).
231 - there is still a memleak on coroutine termination that I could not
232 identify. Could be as small as a single SV.
233 - this module is not well-tested.
234 - if variables or arguments "disappear" (become undef) or become
235 corrupted please contact the author so he cen iron out the
236 remaining bugs.
237 - this module is not thread-safe. You must only ever use this module from 295 - this module is not thread-safe. You must only ever use this module from
238 the same thread (this requirement might be loosened in the future to 296 the same thread (this requirement might be loosened in the future to
239 allow per-thread schedulers, but Coro::Satte does not yet allow this). 297 allow per-thread schedulers, but Coro::State does not yet allow this).
240 298
241=head1 SEE ALSO 299=head1 SEE ALSO
242 300
243L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 301L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>,
244L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 302L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>,
303L<Coro::Handle>, L<Coro::Socket>.
245 304
246=head1 AUTHOR 305=head1 AUTHOR
247 306
248 Marc Lehmann <pcg@goof.com> 307 Marc Lehmann <pcg@goof.com>
249 http://www.goof.com/pcg/marc/ 308 http://www.goof.com/pcg/marc/

Diff Legend

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