… | |
… | |
35 | use strict; |
35 | use strict; |
36 | no warnings "uninitialized"; |
36 | no warnings "uninitialized"; |
37 | |
37 | |
38 | use Coro::State; |
38 | use Coro::State; |
39 | |
39 | |
40 | use base Exporter::; |
40 | use base qw(Coro::State Exporter); |
41 | |
41 | |
42 | our $idle; # idle coroutine |
42 | our $idle; # idle handler |
43 | our $main; # main coroutine |
43 | our $main; # main coroutine |
44 | our $current; # current coroutine |
44 | our $current; # current coroutine |
45 | |
45 | |
46 | our $VERSION = '2.5'; |
46 | our $VERSION = '2.5'; |
47 | |
47 | |
… | |
… | |
95 | |
95 | |
96 | $main = new Coro; |
96 | $main = new Coro; |
97 | |
97 | |
98 | =item $current (or as function: current) |
98 | =item $current (or as function: current) |
99 | |
99 | |
100 | 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. |
101 | |
106 | |
102 | =cut |
107 | =cut |
103 | |
108 | |
104 | # maybe some other module used Coro::Specific before... |
109 | # maybe some other module used Coro::Specific before... |
105 | if ($current) { |
110 | if ($current) { |
… | |
… | |
110 | |
115 | |
111 | sub current() { $current } |
116 | sub current() { $current } |
112 | |
117 | |
113 | =item $idle |
118 | =item $idle |
114 | |
119 | |
115 | 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 |
116 | implementation prints "FATAL: deadlock detected" and exits. |
121 | to run. The default implementation prints "FATAL: deadlock detected" and |
|
|
122 | exits. |
117 | |
123 | |
118 | =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. |
119 | |
127 | |
120 | # should be done using priorities :( |
128 | =cut |
121 | $idle = new Coro sub { |
129 | |
|
|
130 | $idle = sub { |
122 | print STDERR "FATAL: deadlock detected\n"; |
131 | print STDERR "FATAL: deadlock detected\n"; |
123 | exit(51); |
132 | exit (51); |
124 | }; |
133 | }; |
125 | |
134 | |
126 | # this coroutine is necessary because a coroutine |
135 | # this coroutine is necessary because a coroutine |
127 | # cannot destroy itself. |
136 | # cannot destroy itself. |
128 | my @destroy; |
137 | my @destroy; |
129 | my $manager; |
|
|
130 | $manager = new Coro sub { |
138 | my $manager; $manager = new Coro sub { |
131 | while () { |
139 | while () { |
132 | # by overwriting the state object with the manager we destroy it |
140 | # by overwriting the state object with the manager we destroy it |
133 | # 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 |
134 | # been readied multiple times. this is harmless since the manager |
142 | # been readied multiple times. this is harmless since the manager |
135 | # can be called as many times as neccessary and will always |
143 | # can be called as many times as neccessary and will always |
… | |
… | |
137 | while (@destroy) { |
145 | while (@destroy) { |
138 | my $coro = pop @destroy; |
146 | my $coro = pop @destroy; |
139 | $coro->{status} ||= []; |
147 | $coro->{status} ||= []; |
140 | $_->ready for @{delete $coro->{join} || []}; |
148 | $_->ready for @{delete $coro->{join} || []}; |
141 | |
149 | |
142 | # the next line destroys the _coro_state, but keeps the |
150 | # the next line destroys the coro state, but keeps the |
143 | # process itself intact (we basically make it a zombie |
151 | # process itself intact (we basically make it a zombie |
144 | # process that always runs the manager thread, so it's possible |
152 | # process that always runs the manager thread, so it's possible |
145 | # to transfer() to this process). |
153 | # to transfer() to this process). |
146 | $coro->{_coro_state} = $manager->{_coro_state}; |
154 | $coro->_clone_state_from ($manager); |
147 | } |
155 | } |
148 | &schedule; |
156 | &schedule; |
149 | } |
157 | } |
150 | }; |
158 | }; |
151 | |
159 | |
… | |
… | |
175 | |
183 | |
176 | =cut |
184 | =cut |
177 | |
185 | |
178 | sub async(&@) { |
186 | sub async(&@) { |
179 | my $pid = new Coro @_; |
187 | my $pid = new Coro @_; |
180 | $manager->ready; # this ensures that the stack is cloned from the manager |
|
|
181 | $pid->ready; |
188 | $pid->ready; |
182 | $pid; |
189 | $pid |
183 | } |
190 | } |
184 | |
191 | |
185 | =item schedule |
192 | =item schedule |
186 | |
193 | |
187 | 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 |
… | |
… | |
225 | 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 |
226 | by calling the ready method. |
233 | by calling the ready method. |
227 | |
234 | |
228 | =cut |
235 | =cut |
229 | |
236 | |
230 | sub _newcoro { |
237 | sub _new_coro { |
|
|
238 | $current->_clear_idle_sp; # (re-)set the idle sp on the following cede |
|
|
239 | _set_cede_self; # ensures that cede cede's us first |
|
|
240 | cede; |
231 | terminate &{+shift}; |
241 | terminate &{+shift}; |
232 | } |
242 | } |
233 | |
243 | |
234 | sub new { |
244 | sub new { |
235 | my $class = shift; |
245 | my $class = shift; |
236 | bless { |
246 | |
237 | _coro_state => (new Coro::State $_[0] && \&_newcoro, @_), |
247 | $class->SUPER::new (\&_new_coro, @_) |
238 | }, $class; |
|
|
239 | } |
248 | } |
240 | |
249 | |
241 | =item $process->ready |
250 | =item $process->ready |
242 | |
251 | |
243 | Put the given process into the ready queue. |
252 | Put the given process into the ready queue. |
… | |
… | |
274 | &schedule; |
283 | &schedule; |
275 | } |
284 | } |
276 | wantarray ? @{$self->{status}} : $self->{status}[0]; |
285 | wantarray ? @{$self->{status}} : $self->{status}[0]; |
277 | } |
286 | } |
278 | |
287 | |
279 | =item $oldprio = $process->prio($newprio) |
288 | =item $oldprio = $process->prio ($newprio) |
280 | |
289 | |
281 | Sets (or gets, if the argument is missing) the priority of the |
290 | Sets (or gets, if the argument is missing) the priority of the |
282 | process. Higher priority processes get run before lower priority |
291 | process. Higher priority processes get run before lower priority |
283 | processes. Priorities are small signed integers (currently -4 .. +3), |
292 | processes. Priorities are small signed integers (currently -4 .. +3), |
284 | that you can refer to using PRIO_xxx constants (use the import tag :prio |
293 | that you can refer to using PRIO_xxx constants (use the import tag :prio |
… | |
… | |
296 | Changing the priority of the current process will take effect immediately, |
305 | Changing the priority of the current process will take effect immediately, |
297 | but changing the priority of processes in the ready queue (but not |
306 | but changing the priority of processes in the ready queue (but not |
298 | running) will only take effect after the next schedule (of that |
307 | running) will only take effect after the next schedule (of that |
299 | process). This is a bug that will be fixed in some future version. |
308 | process). This is a bug that will be fixed in some future version. |
300 | |
309 | |
301 | =cut |
|
|
302 | |
|
|
303 | sub prio { |
|
|
304 | my $old = $_[0]{prio}; |
|
|
305 | $_[0]{prio} = $_[1] if @_ > 1; |
|
|
306 | $old; |
|
|
307 | } |
|
|
308 | |
|
|
309 | =item $newprio = $process->nice($change) |
310 | =item $newprio = $process->nice ($change) |
310 | |
311 | |
311 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
312 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
312 | higher values mean lower priority, just as in unix). |
313 | higher values mean lower priority, just as in unix). |
313 | |
314 | |
314 | =cut |
|
|
315 | |
|
|
316 | sub nice { |
|
|
317 | $_[0]{prio} -= $_[1]; |
|
|
318 | } |
|
|
319 | |
|
|
320 | =item $olddesc = $process->desc($newdesc) |
315 | =item $olddesc = $process->desc ($newdesc) |
321 | |
316 | |
322 | Sets (or gets in case the argument is missing) the description for this |
317 | Sets (or gets in case the argument is missing) the description for this |
323 | process. This is just a free-form string you can associate with a process. |
318 | process. This is just a free-form string you can associate with a process. |
324 | |
319 | |
325 | =cut |
320 | =cut |