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.88 by root, Sun Nov 26 02:54:55 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 = '3.0';
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; $manager = new Coro sub {
139 while () {
140 # by overwriting the state object with the manager we destroy it
141 # while still being able to schedule this coroutine (in case it has
142 # been readied multiple times. this is harmless since the manager
143 # can be called as many times as neccessary and will always
144 # remove itself from the runqueue
145 while (@destroy) {
146 my $coro = pop @destroy;
147 $coro->{status} ||= [];
148 $_->ready for @{delete $coro->{join} || []};
149
150 # the next line destroys the coro state, but keeps the
151 # process itself intact (we basically make it a zombie
152 # process that always runs the manager thread, so it's possible
153 # to transfer() to this process).
154 $coro->_clone_state_from ($manager);
155 }
156 &schedule;
157 }
158};
110 159
111# static methods. not really. 160# static methods. not really.
161
162=back
112 163
113=head2 STATIC METHODS 164=head2 STATIC METHODS
114 165
115Static methods are actually functions that operate on the current process only. 166Static methods are actually functions that operate on the current process only.
116 167
119=item async { ... } [@args...] 170=item async { ... } [@args...]
120 171
121Create a new asynchronous process and return it's process object 172Create a new asynchronous process and return it's process object
122(usually unused). When the sub returns the new process is automatically 173(usually unused). When the sub returns the new process is automatically
123terminated. 174terminated.
175
176When the coroutine dies, the program will exit, just as in the main
177program.
124 178
125 # create a new coroutine that just prints its arguments 179 # create a new coroutine that just prints its arguments
126 async { 180 async {
127 print "@_\n"; 181 print "@_\n";
128 } 1,2,3,4; 182 } 1,2,3,4;
129 183
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 184=cut
134 185
135sub async(&@) { 186sub async(&@) {
136 my $pid = new Coro @_; 187 my $pid = new Coro @_;
137 $pid->ready; 188 $pid->ready;
138 $pid; 189 $pid
139} 190}
140 191
141=item schedule 192=item schedule
142 193
143Calls the scheduler. Please note that the current process will not be put 194Calls the scheduler. Please note that the current process will not be put
144into the ready queue, so calling this function usually means you will 195into the ready queue, so calling this function usually means you will
145never be called again. 196never be called again.
146 197
147=cut 198=cut
148 199
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 200=item cede
158 201
159Yield to other processes. This function puts the current process into the 202"Cede" to other processes. This function puts the current process into the
160ready queue and calls C<schedule>. 203ready queue and calls C<schedule>, which has the effect of giving up the
204current "timeslice" to other coroutines of the same or higher priority.
161 205
162=cut 206=cut
163 207
164sub yield {
165 $current->ready;
166 &schedule;
167}
168
169=item terminate 208=item terminate [arg...]
170 209
171Terminates the current process. 210Terminates the current process with the given status values (see L<cancel>).
172
173Future versions of this function will allow result arguments.
174 211
175=cut 212=cut
176 213
177sub terminate { 214sub terminate {
178 $current->{_results} = [@_]; 215 $current->cancel (@_);
179 &schedule;
180} 216}
181 217
182=back 218=back
183 219
184# dynamic methods 220# dynamic methods
190=over 4 226=over 4
191 227
192=item new Coro \&sub [, @args...] 228=item new Coro \&sub [, @args...]
193 229
194Create a new process and return it. When the sub returns the process 230Create a new process and return it. When the sub returns the process
195automatically terminates. To start the process you must first put it into 231automatically terminates as if C<terminate> with the returned values were
232called. To make the process run you must first put it into the ready queue
196the ready queue by calling the ready method. 233by calling the ready method.
197 234
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
201=cut 235=cut
202 236
203sub _newcoro { 237sub _new_coro {
204 terminate &{+shift}; 238 terminate &{+shift};
205} 239}
206 240
207sub new { 241sub new {
208 my $class = shift; 242 my $class = shift;
209 bless { 243
210 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_), 244 $class->SUPER::new (\&_new_coro, @_)
211 }, $class;
212} 245}
213 246
214=item $process->ready 247=item $process->ready
215 248
216Put the current process into the ready queue. 249Put the given process into the ready queue.
217 250
218=cut 251=cut
219 252
220sub ready { 253=item $process->cancel (arg...)
221 push @ready, $_[0]; 254
255Terminates the given process and makes it return the given arguments as
256status (default: the empty list).
257
258=cut
259
260sub cancel {
261 my $self = shift;
262 $self->{status} = [@_];
263 push @destroy, $self;
264 $manager->ready;
265 &schedule if $current == $self;
266}
267
268=item $process->join
269
270Wait until the coroutine terminates and return any values given to the
271C<terminate> or C<cancel> functions. C<join> can be called multiple times
272from multiple processes.
273
274=cut
275
276sub join {
277 my $self = shift;
278 unless ($self->{status}) {
279 push @{$self->{join}}, $current;
280 &schedule;
281 }
282 wantarray ? @{$self->{status}} : $self->{status}[0];
283}
284
285=item $oldprio = $process->prio ($newprio)
286
287Sets (or gets, if the argument is missing) the priority of the
288process. Higher priority processes get run before lower priority
289processes. Priorities are small signed integers (currently -4 .. +3),
290that you can refer to using PRIO_xxx constants (use the import tag :prio
291to get then):
292
293 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
294 3 > 1 > 0 > -1 > -3 > -4
295
296 # set priority to HIGH
297 current->prio(PRIO_HIGH);
298
299The idle coroutine ($Coro::idle) always has a lower priority than any
300existing coroutine.
301
302Changing the priority of the current process will take effect immediately,
303but changing the priority of processes in the ready queue (but not
304running) will only take effect after the next schedule (of that
305process). This is a bug that will be fixed in some future version.
306
307=item $newprio = $process->nice ($change)
308
309Similar to C<prio>, but subtract the given value from the priority (i.e.
310higher values mean lower priority, just as in unix).
311
312=item $olddesc = $process->desc ($newdesc)
313
314Sets (or gets in case the argument is missing) the description for this
315process. This is just a free-form string you can associate with a process.
316
317=cut
318
319sub desc {
320 my $old = $_[0]{desc};
321 $_[0]{desc} = $_[1] if @_ > 1;
322 $old;
222} 323}
223 324
224=back 325=back
225 326
226=cut 327=cut
227 328
2281; 3291;
229 330
230=head1 BUGS/LIMITATIONS 331=head1 BUGS/LIMITATIONS
231 332
232 - could be faster, especially when the core would introduce special 333 - you must make very sure that no coro is still active on global
233 support for coroutines (like it does for threads). 334 destruction. very bad things might happen otherwise (usually segfaults).
234 - there is still a memleak on coroutine termination that I could not 335
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 336 - 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 337 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). 338 to allow per-thread schedulers, but Coro::State does not yet allow
339 this).
243 340
244=head1 SEE ALSO 341=head1 SEE ALSO
245 342
246L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 343Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
247L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 344
345Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
346
347Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
348
349Embedding: L<Coro:MakeMaker>
248 350
249=head1 AUTHOR 351=head1 AUTHOR
250 352
251 Marc Lehmann <pcg@goof.com> 353 Marc Lehmann <schmorp@schmorp.de>
252 http://www.goof.com/pcg/marc/ 354 http://home.schmorp.de/
253 355
254=cut 356=cut
255 357

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines