| … | |
… | |
| 36 | |
36 | |
| 37 | use Coro::State; |
37 | use Coro::State; |
| 38 | |
38 | |
| 39 | use base Exporter; |
39 | use base Exporter; |
| 40 | |
40 | |
| 41 | $VERSION = 0.45; |
41 | $VERSION = 0.5; |
| 42 | |
42 | |
| 43 | @EXPORT = qw(async cede schedule terminate current); |
43 | @EXPORT = qw(async cede schedule terminate current); |
| 44 | @EXPORT_OK = qw($current); |
44 | %EXPORT_TAGS = ( |
|
|
45 | prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], |
|
|
46 | ); |
|
|
47 | @EXPORT_OK = @{$EXPORT_TAGS{prio}}; |
| 45 | |
48 | |
| 46 | { |
49 | { |
| 47 | my @async; |
50 | my @async; |
| 48 | my $init; |
51 | my $init; |
| 49 | |
52 | |
| … | |
… | |
| 226 | =cut |
229 | =cut |
| 227 | |
230 | |
| 228 | sub cancel { |
231 | sub cancel { |
| 229 | push @destroy, $_[0]; |
232 | push @destroy, $_[0]; |
| 230 | $manager->ready; |
233 | $manager->ready; |
|
|
234 | &schedule if $current == $_[0]; |
|
|
235 | } |
|
|
236 | |
|
|
237 | =item $oldprio = $process->prio($newprio) |
|
|
238 | |
|
|
239 | Sets the priority of the process. Higher priority processes get run before |
|
|
240 | lower priority processes. Priorities are smalled signed integer (currently |
|
|
241 | -4 .. +3), that you can refer to using PRIO_xxx constants (use the import |
|
|
242 | tag :prio to get then): |
|
|
243 | |
|
|
244 | PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN |
|
|
245 | 3 > 1 > 0 > -1 > -3 > -4 |
|
|
246 | |
|
|
247 | # set priority to HIGH |
|
|
248 | current->prio(PRIO_HIGH); |
|
|
249 | |
|
|
250 | The idle coroutine ($Coro::idle) always has a lower priority than any |
|
|
251 | existing coroutine. |
|
|
252 | |
|
|
253 | Changing the priority of the current process will take effect immediately, |
|
|
254 | but changing the priority of processes in the ready queue (but not |
|
|
255 | running) will only take effect after the next schedule (of that |
|
|
256 | process). This is a bug that will be fixed in some future version. |
|
|
257 | |
|
|
258 | =cut |
|
|
259 | |
|
|
260 | sub prio { |
|
|
261 | my $old = $_[0]{prio}; |
|
|
262 | $_[0]{prio} = $_[1] if @_ > 1; |
|
|
263 | $old; |
|
|
264 | } |
|
|
265 | |
|
|
266 | =item $newprio = $process->nice($change) |
|
|
267 | |
|
|
268 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
|
|
269 | higher values mean lower priority, just as in unix). |
|
|
270 | |
|
|
271 | =cut |
|
|
272 | |
|
|
273 | sub nice { |
|
|
274 | $_[0]{prio} -= $_[1]; |
| 231 | } |
275 | } |
| 232 | |
276 | |
| 233 | =back |
277 | =back |
| 234 | |
278 | |
| 235 | =cut |
279 | =cut |
| 236 | |
280 | |
| 237 | 1; |
281 | 1; |
| 238 | |
282 | |
| 239 | =head1 BUGS/LIMITATIONS |
283 | =head1 BUGS/LIMITATIONS |
| 240 | |
284 | |
| 241 | - could be faster, especially when the core would introduce special |
285 | - you must make very sure that no coro is still active on global destruction. |
| 242 | support for coroutines (like it does for threads). |
286 | very bad things might happen otherwise (usually segfaults). |
| 243 | - there is still a memleak on coroutine termination that I could not |
|
|
| 244 | identify. Could be as small as a single SV. |
|
|
| 245 | - this module is not well-tested. |
|
|
| 246 | - if variables or arguments "disappear" (become undef) or become |
|
|
| 247 | corrupted please contact the author so he cen iron out the |
|
|
| 248 | remaining bugs. |
|
|
| 249 | - this module is not thread-safe. You must only ever use this module from |
287 | - this module is not thread-safe. You must only ever use this module from |
| 250 | the same thread (this requirement might be loosened in the future to |
288 | the same thread (this requirement might be loosened in the future to |
| 251 | allow per-thread schedulers, but Coro::State does not yet allow this). |
289 | allow per-thread schedulers, but Coro::State does not yet allow this). |
| 252 | |
290 | |
| 253 | =head1 SEE ALSO |
291 | =head1 SEE ALSO |
