… | |
… | |
32 | |
32 | |
33 | =cut |
33 | =cut |
34 | |
34 | |
35 | package Coro; |
35 | package Coro; |
36 | |
36 | |
|
|
37 | no warnings qw(uninitialized); |
|
|
38 | |
37 | use Coro::State; |
39 | use Coro::State; |
38 | |
40 | |
39 | use base Exporter; |
41 | use 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 | |
… | |
… | |
113 | # this coroutine is necessary because a coroutine |
118 | # this coroutine is necessary because a coroutine |
114 | # cannot destroy itself. |
119 | # cannot destroy itself. |
115 | my @destroy; |
120 | my @destroy; |
116 | my $manager = new Coro sub { |
121 | my $manager = new Coro sub { |
117 | while() { |
122 | while() { |
118 | delete ((pop @destroy)->{_coro_state}) while @destroy; |
123 | # by overwriting the state object with the manager we destroy it |
|
|
124 | # while still being able to schedule this coroutine (in case it has |
|
|
125 | # been readied multiple times. this is harmless since the manager |
|
|
126 | # can be called as many times as neccessary and will always |
|
|
127 | # remove itself from the runqueue |
|
|
128 | (pop @destroy)->{_coro_state} = $manager->{_coro_state} while @destroy; |
119 | &schedule; |
129 | &schedule; |
120 | } |
130 | } |
121 | }; |
131 | }; |
122 | |
|
|
123 | # we really need priorities... |
|
|
124 | my @ready; # the ready queue. hehe, rather broken ;) |
|
|
125 | |
132 | |
126 | # static methods. not really. |
133 | # static methods. not really. |
127 | |
134 | |
128 | =head2 STATIC METHODS |
135 | =head2 STATIC METHODS |
129 | |
136 | |
… | |
… | |
160 | into the ready queue, so calling this function usually means you will |
167 | into the ready queue, so calling this function usually means you will |
161 | never be called again. |
168 | never be called again. |
162 | |
169 | |
163 | =cut |
170 | =cut |
164 | |
171 | |
165 | my $prev; |
|
|
166 | |
|
|
167 | sub 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 |
172 | =item cede |
174 | |
173 | |
175 | "Cede" to other processes. This function puts the current process into the |
174 | "Cede" to other processes. This function puts the current process into the |
176 | ready queue and calls C<schedule>, which has the effect of giving up the |
175 | ready queue and calls C<schedule>, which has the effect of giving up the |
177 | current "timeslice" to other coroutines of the same or higher priority. |
176 | current "timeslice" to other coroutines of the same or higher priority. |
178 | |
177 | |
179 | =cut |
178 | =cut |
180 | |
|
|
181 | sub cede { |
|
|
182 | $current->ready; |
|
|
183 | &schedule; |
|
|
184 | } |
|
|
185 | |
179 | |
186 | =item terminate |
180 | =item terminate |
187 | |
181 | |
188 | Terminates the current process. |
182 | Terminates the current process. |
189 | |
183 | |
… | |
… | |
233 | |
227 | |
234 | Put the current process into the ready queue. |
228 | Put the current process into the ready queue. |
235 | |
229 | |
236 | =cut |
230 | =cut |
237 | |
231 | |
238 | sub ready { |
|
|
239 | push @ready, $_[0]; |
|
|
240 | } |
|
|
241 | |
|
|
242 | =item $process->cancel |
232 | =item $process->cancel |
243 | |
233 | |
244 | Like C<terminate>, but terminates the specified process instead. |
234 | Like C<terminate>, but terminates the specified process instead. |
245 | |
235 | |
246 | =cut |
236 | =cut |
247 | |
237 | |
248 | sub cancel { |
238 | sub cancel { |
249 | push @destroy, $_[0]; |
239 | push @destroy, $_[0]; |
250 | $manager->ready; |
240 | $manager->ready; |
|
|
241 | &schedule if $current == $_[0]; |
|
|
242 | } |
|
|
243 | |
|
|
244 | =item $oldprio = $process->prio($newprio) |
|
|
245 | |
|
|
246 | Sets the priority of the process. Higher priority processes get run before |
|
|
247 | lower priority processes. Priorities are smalled signed integer (currently |
|
|
248 | -4 .. +3), that you can refer to using PRIO_xxx constants (use the import |
|
|
249 | tag :prio to get then): |
|
|
250 | |
|
|
251 | PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN |
|
|
252 | 3 > 1 > 0 > -1 > -3 > -4 |
|
|
253 | |
|
|
254 | # set priority to HIGH |
|
|
255 | current->prio(PRIO_HIGH); |
|
|
256 | |
|
|
257 | The idle coroutine ($Coro::idle) always has a lower priority than any |
|
|
258 | existing coroutine. |
|
|
259 | |
|
|
260 | Changing the priority of the current process will take effect immediately, |
|
|
261 | but changing the priority of processes in the ready queue (but not |
|
|
262 | running) will only take effect after the next schedule (of that |
|
|
263 | process). This is a bug that will be fixed in some future version. |
|
|
264 | |
|
|
265 | =cut |
|
|
266 | |
|
|
267 | sub prio { |
|
|
268 | my $old = $_[0]{prio}; |
|
|
269 | $_[0]{prio} = $_[1] if @_ > 1; |
|
|
270 | $old; |
|
|
271 | } |
|
|
272 | |
|
|
273 | =item $newprio = $process->nice($change) |
|
|
274 | |
|
|
275 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
|
|
276 | higher values mean lower priority, just as in unix). |
|
|
277 | |
|
|
278 | =cut |
|
|
279 | |
|
|
280 | sub nice { |
|
|
281 | $_[0]{prio} -= $_[1]; |
251 | } |
282 | } |
252 | |
283 | |
253 | =back |
284 | =back |
254 | |
285 | |
255 | =cut |
286 | =cut |
256 | |
287 | |
257 | 1; |
288 | 1; |
258 | |
289 | |
259 | =head1 BUGS/LIMITATIONS |
290 | =head1 BUGS/LIMITATIONS |
260 | |
291 | |
261 | - could be faster, especially when the core would introduce special |
292 | - you must make very sure that no coro is still active on global destruction. |
262 | support for coroutines (like it does for threads). |
293 | 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 |
294 | - 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 |
295 | 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). |
296 | allow per-thread schedulers, but Coro::State does not yet allow this). |
272 | |
297 | |
273 | =head1 SEE ALSO |
298 | =head1 SEE ALSO |