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

Comparing Coro/Coro.pm (file contents):
Revision 1.16 by root, Tue Jul 17 15:42:28 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.07; 43$VERSION = 0.51;
37 44
38@EXPORT = qw(async yield schedule terminate); 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, $name, @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.
72 85
73=cut 86=cut
74 87
75our $main = new Coro; 88our $main = new Coro;
76 89
77=item $current 90=item $current (or as function: current)
78 91
79The 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).
80 93
81=cut 94=cut
82 95
84if ($current) { 97if ($current) {
85 $main->{specific} = $current->{specific}; 98 $main->{specific} = $current->{specific};
86} 99}
87 100
88our $current = $main; 101our $current = $main;
102
103sub current() { $current }
89 104
90=item $idle 105=item $idle
91 106
92The 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
93implementation prints "FATAL: deadlock detected" and exits. 108implementation prints "FATAL: deadlock detected" and exits.
98our $idle = new Coro sub { 113our $idle = new Coro sub {
99 print STDERR "FATAL: deadlock detected\n"; 114 print STDERR "FATAL: deadlock detected\n";
100 exit(51); 115 exit(51);
101}; 116};
102 117
103# we really need priorities... 118# this coroutine is necessary because a coroutine
104my @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};
105 133
106# static methods. not really. 134# static methods. not really.
107 135
108=head2 STATIC METHODS 136=head2 STATIC METHODS
109 137
127 155
128=cut 156=cut
129 157
130sub async(&@) { 158sub async(&@) {
131 my $pid = new Coro @_; 159 my $pid = new Coro @_;
160 $manager->ready; # this ensures that the stack is cloned from the manager
132 $pid->ready; 161 $pid->ready;
133 $pid; 162 $pid;
134} 163}
135 164
136=item schedule 165=item schedule
139into the ready queue, so calling this function usually means you will 168into the ready queue, so calling this function usually means you will
140never be called again. 169never be called again.
141 170
142=cut 171=cut
143 172
144my $prev;
145
146sub schedule {
147 # should be done using priorities :(
148 ($prev, $current) = ($current, shift @ready || $idle);
149 Coro::State::transfer($prev, $current);
150}
151
152=item yield 173=item cede
153 174
154Yield to other processes. This function puts the current process into the 175"Cede" to other processes. This function puts the current process into the
155ready 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.
156 178
157=cut 179=cut
158 180
159sub 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 {
160 $current->ready; 190 $current->cancel;
161 &schedule; 191 &schedule;
162} 192 die; # NORETURN
163
164=item terminate
165
166Terminates the current process.
167
168Future versions of this function will allow result arguments.
169
170=cut
171
172sub terminate {
173 $current->{_results} = [@_];
174 &schedule;
175} 193}
176 194
177=back 195=back
178 196
179# dynamic methods 197# dynamic methods
206 }, $class; 224 }, $class;
207} 225}
208 226
209=item $process->ready 227=item $process->ready
210 228
211Put the current process into the ready queue. 229Put the given process into the ready queue.
212 230
213=cut 231=cut
214 232
215sub ready { 233=item $process->cancel
234
235Like C<terminate>, but terminates the specified process instead.
236
237=cut
238
239sub cancel {
216 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];
217} 283}
218 284
219=back 285=back
220 286
221=cut 287=cut
222 288
2231; 2891;
224 290
225=head1 BUGS 291=head1 BUGS/LIMITATIONS
226 292
227 - 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.
228 support for coroutines (like it does for threads). 294 very bad things might happen otherwise (usually segfaults).
229 - there is still a memleak on coroutine termination that I could not 295 - this module is not thread-safe. You must only ever use this module from
230 identify. Could be as small as a single SV. 296 the same thread (this requirement might be loosened in the future to
231 - this module is not well-tested. 297 allow per-thread schedulers, but Coro::State does not yet allow this).
232 298
233=head1 SEE ALSO 299=head1 SEE ALSO
234 300
235L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 301L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>,
236L<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>.
237 304
238=head1 AUTHOR 305=head1 AUTHOR
239 306
240 Marc Lehmann <pcg@goof.com> 307 Marc Lehmann <pcg@goof.com>
241 http://www.goof.com/pcg/marc/ 308 http://www.goof.com/pcg/marc/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines