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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines