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

Comparing Coro/Coro.pm (file contents):
Revision 1.29 by root, Sat Aug 11 00:37:31 2001 UTC vs.
Revision 1.36 by root, Mon Sep 24 01:36:20 2001 UTC

… …
32 32
33=cut 33=cut
34 34
35package Coro; 35package Coro;
36 36
37no warnings qw(uninitialized);
38
37use Coro::State; 39use Coro::State;
38 40
39use base Exporter; 41use base Exporter;
40 42
41$VERSION = 0.45; 43$VERSION = 0.5;
42 44
43@EXPORT = qw(async cede schedule terminate current); 45@EXPORT = qw(async cede schedule terminate current);
44@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}};
45 50
46{ 51{
47 my @async; 52 my @async;
48 my $init; 53 my $init;
49 54
… …
118 delete ((pop @destroy)->{_coro_state}) while @destroy; 123 delete ((pop @destroy)->{_coro_state}) while @destroy;
119 &schedule; 124 &schedule;
120 } 125 }
121}; 126};
122 127
123# we really need priorities...
124my @ready; # the ready queue. hehe, rather broken ;)
125
126# static methods. not really. 128# static methods. not really.
127 129
128=head2 STATIC METHODS 130=head2 STATIC METHODS
129 131
130Static methods are actually functions that operate on the current process only. 132Static methods are actually functions that operate on the current process only.
… …
160into the ready queue, so calling this function usually means you will 162into the ready queue, so calling this function usually means you will
161never be called again. 163never be called again.
162 164
163=cut 165=cut
164 166
165my $prev;
166
167sub schedule {
168 # should be done using priorities :(
169 ($prev, $current) = ($current, shift @ready || $idle);
170 Coro::State::transfer($prev, $current);
171}
172
173=item cede 167=item cede
174 168
175"Cede" to other processes. This function puts the current process into the 169"Cede" to other processes. This function puts the current process into the
176ready queue and calls C<schedule>, which has the effect of giving up the 170ready queue and calls C<schedule>, which has the effect of giving up the
177current "timeslice" to other coroutines of the same or higher priority. 171current "timeslice" to other coroutines of the same or higher priority.
178 172
179=cut 173=cut
180
181sub cede {
182 $current->ready;
183 &schedule;
184}
185 174
186=item terminate 175=item terminate
187 176
188Terminates the current process. 177Terminates the current process.
189 178
… …
233 222
234Put the current process into the ready queue. 223Put the current process into the ready queue.
235 224
236=cut 225=cut
237 226
238sub ready {
239 push @ready, $_[0];
240}
241
242=item $process->cancel 227=item $process->cancel
243 228
244Like C<terminate>, but terminates the specified process instead. 229Like C<terminate>, but terminates the specified process instead.
245 230
246=cut 231=cut
247 232
248sub cancel { 233sub cancel {
249 push @destroy, $_[0]; 234 push @destroy, $_[0];
250 $manager->ready; 235 $manager->ready;
236 &schedule if $current == $_[0];
237}
238
239=item $oldprio = $process->prio($newprio)
240
241Sets the priority of the process. Higher priority processes get run before
242lower priority processes. Priorities are smalled signed integer (currently
243-4 .. +3), that you can refer to using PRIO_xxx constants (use the import
244tag :prio to get then):
245
246 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
247 3 > 1 > 0 > -1 > -3 > -4
248
249 # set priority to HIGH
250 current->prio(PRIO_HIGH);
251
252The idle coroutine ($Coro::idle) always has a lower priority than any
253existing coroutine.
254
255Changing the priority of the current process will take effect immediately,
256but changing the priority of processes in the ready queue (but not
257running) will only take effect after the next schedule (of that
258process). This is a bug that will be fixed in some future version.
259
260=cut
261
262sub prio {
263 my $old = $_[0]{prio};
264 $_[0]{prio} = $_[1] if @_ > 1;
265 $old;
266}
267
268=item $newprio = $process->nice($change)
269
270Similar to C<prio>, but subtract the given value from the priority (i.e.
271higher values mean lower priority, just as in unix).
272
273=cut
274
275sub nice {
276 $_[0]{prio} -= $_[1];
251} 277}
252 278
253=back 279=back
254 280
255=cut 281=cut
256 282
2571; 2831;
258 284
259=head1 BUGS/LIMITATIONS 285=head1 BUGS/LIMITATIONS
260 286
261 - could be faster, especially when the core would introduce special 287 - you must make very sure that no coro is still active on global destruction.
262 support for coroutines (like it does for threads). 288 very bad things might happen otherwise (usually segfaults).
263 - there is still a memleak on coroutine termination that I could not
264 identify. Could be as small as a single SV.
265 - this module is not well-tested.
266 - if variables or arguments "disappear" (become undef) or become
267 corrupted please contact the author so he cen iron out the
268 remaining bugs.
269 - this module is not thread-safe. You must only ever use this module from 289 - this module is not thread-safe. You must only ever use this module from
270 the same thread (this requirement might be loosened in the future to 290 the same thread (this requirement might be loosened in the future to
271 allow per-thread schedulers, but Coro::State does not yet allow this). 291 allow per-thread schedulers, but Coro::State does not yet allow this).
272 292
273=head1 SEE ALSO 293=head1 SEE ALSO

Diff Legend

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