| … | |
… | |
| 30 | |
30 | |
| 31 | =cut |
31 | =cut |
| 32 | |
32 | |
| 33 | package Coro; |
33 | package Coro; |
| 34 | |
34 | |
| 35 | BEGIN { eval { require warnings } && warnings->unimport ("uninitialized") } |
35 | use strict; |
|
|
36 | no warnings "uninitialized"; |
| 36 | |
37 | |
| 37 | use Coro::State; |
38 | use Coro::State; |
| 38 | |
39 | |
| 39 | use vars qw($idle $main $current); |
40 | use base qw(Coro::State Exporter); |
| 40 | |
41 | |
| 41 | use base Exporter; |
42 | our $idle; # idle handler |
|
|
43 | our $main; # main coroutine |
|
|
44 | our $current; # current coroutine |
| 42 | |
45 | |
| 43 | $VERSION = '1.4'; |
46 | our $VERSION = '3.0'; |
| 44 | |
47 | |
| 45 | @EXPORT = qw(async cede schedule terminate current); |
48 | our @EXPORT = qw(async cede schedule terminate current); |
| 46 | %EXPORT_TAGS = ( |
49 | our %EXPORT_TAGS = ( |
| 47 | prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], |
50 | prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], |
| 48 | ); |
51 | ); |
| 49 | @EXPORT_OK = @{$EXPORT_TAGS{prio}}; |
52 | our @EXPORT_OK = @{$EXPORT_TAGS{prio}}; |
| 50 | |
53 | |
| 51 | { |
54 | { |
| 52 | my @async; |
55 | my @async; |
| 53 | my $init; |
56 | my $init; |
| 54 | |
57 | |
| 55 | # this way of handling attributes simply is NOT scalable ;() |
58 | # this way of handling attributes simply is NOT scalable ;() |
| 56 | sub import { |
59 | sub import { |
|
|
60 | no strict 'refs'; |
|
|
61 | |
| 57 | Coro->export_to_level(1, @_); |
62 | Coro->export_to_level(1, @_); |
|
|
63 | |
| 58 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
64 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
| 59 | *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { |
65 | *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { |
| 60 | my ($package, $ref) = (shift, shift); |
66 | my ($package, $ref) = (shift, shift); |
| 61 | my @attrs; |
67 | my @attrs; |
| 62 | for (@_) { |
68 | for (@_) { |
| … | |
… | |
| 89 | |
95 | |
| 90 | $main = new Coro; |
96 | $main = new Coro; |
| 91 | |
97 | |
| 92 | =item $current (or as function: current) |
98 | =item $current (or as function: current) |
| 93 | |
99 | |
| 94 | The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). |
100 | The current coroutine (the last coroutine switched to). The initial value |
|
|
101 | is C<$main> (of course). |
|
|
102 | |
|
|
103 | This variable is B<strictly> I<read-only>. It is provided for performance |
|
|
104 | reasons. If performance is not essentiel you are encouraged to use the |
|
|
105 | C<Coro::current> function instead. |
| 95 | |
106 | |
| 96 | =cut |
107 | =cut |
| 97 | |
108 | |
| 98 | # maybe some other module used Coro::Specific before... |
109 | # maybe some other module used Coro::Specific before... |
| 99 | if ($current) { |
110 | if ($current) { |
| … | |
… | |
| 104 | |
115 | |
| 105 | sub current() { $current } |
116 | sub current() { $current } |
| 106 | |
117 | |
| 107 | =item $idle |
118 | =item $idle |
| 108 | |
119 | |
| 109 | The coroutine to switch to when no other coroutine is running. The default |
120 | A callback that is called whenever the scheduler finds no ready coroutines |
| 110 | implementation prints "FATAL: deadlock detected" and exits. |
121 | to run. The default implementation prints "FATAL: deadlock detected" and |
|
|
122 | exits. |
| 111 | |
123 | |
| 112 | =cut |
124 | This hook is overwritten by modules such as C<Coro::Timer> and |
|
|
125 | C<Coro::Event> to wait on an external event that hopefully wakes up some |
|
|
126 | coroutine. |
| 113 | |
127 | |
| 114 | # should be done using priorities :( |
128 | =cut |
| 115 | $idle = new Coro sub { |
129 | |
|
|
130 | $idle = sub { |
| 116 | print STDERR "FATAL: deadlock detected\n"; |
131 | print STDERR "FATAL: deadlock detected\n"; |
| 117 | exit(51); |
132 | exit (51); |
| 118 | }; |
133 | }; |
| 119 | |
134 | |
| 120 | # this coroutine is necessary because a coroutine |
135 | # this coroutine is necessary because a coroutine |
| 121 | # cannot destroy itself. |
136 | # cannot destroy itself. |
| 122 | my @destroy; |
137 | my @destroy; |
| 123 | my $manager; |
|
|
| 124 | $manager = new Coro sub { |
138 | my $manager; $manager = new Coro sub { |
| 125 | while () { |
139 | while () { |
| 126 | # by overwriting the state object with the manager we destroy it |
140 | # by overwriting the state object with the manager we destroy it |
| 127 | # while still being able to schedule this coroutine (in case it has |
141 | # while still being able to schedule this coroutine (in case it has |
| 128 | # been readied multiple times. this is harmless since the manager |
142 | # been readied multiple times. this is harmless since the manager |
| 129 | # can be called as many times as neccessary and will always |
143 | # can be called as many times as neccessary and will always |
| … | |
… | |
| 131 | while (@destroy) { |
145 | while (@destroy) { |
| 132 | my $coro = pop @destroy; |
146 | my $coro = pop @destroy; |
| 133 | $coro->{status} ||= []; |
147 | $coro->{status} ||= []; |
| 134 | $_->ready for @{delete $coro->{join} || []}; |
148 | $_->ready for @{delete $coro->{join} || []}; |
| 135 | |
149 | |
| 136 | # the next line destroys the _coro_state, but keeps the |
150 | # the next line destroys the coro state, but keeps the |
| 137 | # process itself intact (we basically make it a zombie |
151 | # process itself intact (we basically make it a zombie |
| 138 | # process that always runs the manager thread, so it's possible |
152 | # process that always runs the manager thread, so it's possible |
| 139 | # to transfer() to this process). |
153 | # to transfer() to this process). |
| 140 | $coro->{_coro_state} = $manager->{_coro_state}; |
154 | $coro->_clone_state_from ($manager); |
| 141 | } |
155 | } |
| 142 | &schedule; |
156 | &schedule; |
| 143 | } |
157 | } |
| 144 | }; |
158 | }; |
| 145 | |
159 | |
| … | |
… | |
| 157 | |
171 | |
| 158 | Create a new asynchronous process and return it's process object |
172 | Create a new asynchronous process and return it's process object |
| 159 | (usually unused). When the sub returns the new process is automatically |
173 | (usually unused). When the sub returns the new process is automatically |
| 160 | terminated. |
174 | terminated. |
| 161 | |
175 | |
|
|
176 | When the coroutine dies, the program will exit, just as in the main |
|
|
177 | program. |
|
|
178 | |
| 162 | # create a new coroutine that just prints its arguments |
179 | # create a new coroutine that just prints its arguments |
| 163 | async { |
180 | async { |
| 164 | print "@_\n"; |
181 | print "@_\n"; |
| 165 | } 1,2,3,4; |
182 | } 1,2,3,4; |
| 166 | |
183 | |
| 167 | =cut |
184 | =cut |
| 168 | |
185 | |
| 169 | sub async(&@) { |
186 | sub async(&@) { |
| 170 | my $pid = new Coro @_; |
187 | my $pid = new Coro @_; |
| 171 | $manager->ready; # this ensures that the stack is cloned from the manager |
|
|
| 172 | $pid->ready; |
188 | $pid->ready; |
| 173 | $pid; |
189 | $pid |
| 174 | } |
190 | } |
| 175 | |
191 | |
| 176 | =item schedule |
192 | =item schedule |
| 177 | |
193 | |
| 178 | Calls the scheduler. Please note that the current process will not be put |
194 | Calls the scheduler. Please note that the current process will not be put |
| … | |
… | |
| 216 | called. To make the process run you must first put it into the ready queue |
232 | called. To make the process run you must first put it into the ready queue |
| 217 | by calling the ready method. |
233 | by calling the ready method. |
| 218 | |
234 | |
| 219 | =cut |
235 | =cut |
| 220 | |
236 | |
| 221 | sub _newcoro { |
237 | sub _new_coro { |
| 222 | terminate &{+shift}; |
238 | terminate &{+shift}; |
| 223 | } |
239 | } |
| 224 | |
240 | |
| 225 | sub new { |
241 | sub new { |
| 226 | my $class = shift; |
242 | my $class = shift; |
| 227 | bless { |
243 | |
| 228 | _coro_state => (new Coro::State $_[0] && \&_newcoro, @_), |
244 | $class->SUPER::new (\&_new_coro, @_) |
| 229 | }, $class; |
|
|
| 230 | } |
245 | } |
| 231 | |
246 | |
| 232 | =item $process->ready |
247 | =item $process->ready |
| 233 | |
248 | |
| 234 | Put the given process into the ready queue. |
249 | Put the given process into the ready queue. |
| 235 | |
250 | |
| 236 | =cut |
251 | =cut |
| 237 | |
252 | |
| 238 | =item $process->cancel (arg...) |
253 | =item $process->cancel (arg...) |
| 239 | |
254 | |
| 240 | Temrinates the given process and makes it return the given arguments as |
255 | Terminates the given process and makes it return the given arguments as |
| 241 | status (default: the empty list). |
256 | status (default: the empty list). |
| 242 | |
257 | |
| 243 | =cut |
258 | =cut |
| 244 | |
259 | |
| 245 | sub cancel { |
260 | sub cancel { |
| … | |
… | |
| 265 | &schedule; |
280 | &schedule; |
| 266 | } |
281 | } |
| 267 | wantarray ? @{$self->{status}} : $self->{status}[0]; |
282 | wantarray ? @{$self->{status}} : $self->{status}[0]; |
| 268 | } |
283 | } |
| 269 | |
284 | |
| 270 | =item $oldprio = $process->prio($newprio) |
285 | =item $oldprio = $process->prio ($newprio) |
| 271 | |
286 | |
| 272 | Sets (or gets, if the argument is missing) the priority of the |
287 | Sets (or gets, if the argument is missing) the priority of the |
| 273 | process. Higher priority processes get run before lower priority |
288 | process. Higher priority processes get run before lower priority |
| 274 | processes. Priorities are small signed integers (currently -4 .. +3), |
289 | processes. Priorities are small signed integers (currently -4 .. +3), |
| 275 | that you can refer to using PRIO_xxx constants (use the import tag :prio |
290 | that you can refer to using PRIO_xxx constants (use the import tag :prio |
| … | |
… | |
| 287 | Changing the priority of the current process will take effect immediately, |
302 | Changing the priority of the current process will take effect immediately, |
| 288 | but changing the priority of processes in the ready queue (but not |
303 | but changing the priority of processes in the ready queue (but not |
| 289 | running) will only take effect after the next schedule (of that |
304 | running) will only take effect after the next schedule (of that |
| 290 | process). This is a bug that will be fixed in some future version. |
305 | process). This is a bug that will be fixed in some future version. |
| 291 | |
306 | |
| 292 | =cut |
|
|
| 293 | |
|
|
| 294 | sub prio { |
|
|
| 295 | my $old = $_[0]{prio}; |
|
|
| 296 | $_[0]{prio} = $_[1] if @_ > 1; |
|
|
| 297 | $old; |
|
|
| 298 | } |
|
|
| 299 | |
|
|
| 300 | =item $newprio = $process->nice($change) |
307 | =item $newprio = $process->nice ($change) |
| 301 | |
308 | |
| 302 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
309 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
| 303 | higher values mean lower priority, just as in unix). |
310 | higher values mean lower priority, just as in unix). |
| 304 | |
311 | |
| 305 | =cut |
|
|
| 306 | |
|
|
| 307 | sub nice { |
|
|
| 308 | $_[0]{prio} -= $_[1]; |
|
|
| 309 | } |
|
|
| 310 | |
|
|
| 311 | =item $olddesc = $process->desc($newdesc) |
312 | =item $olddesc = $process->desc ($newdesc) |
| 312 | |
313 | |
| 313 | Sets (or gets in case the argument is missing) the description for this |
314 | Sets (or gets in case the argument is missing) the description for this |
| 314 | process. This is just a free-form string you can associate with a process. |
315 | process. This is just a free-form string you can associate with a process. |
| 315 | |
316 | |
| 316 | =cut |
317 | =cut |
