… | |
… | |
14 | |
14 | |
15 | sub some_func : Coro { |
15 | sub some_func : Coro { |
16 | # some more async code |
16 | # some more async code |
17 | } |
17 | } |
18 | |
18 | |
19 | yield; |
19 | cede; |
20 | |
20 | |
21 | =head1 DESCRIPTION |
21 | =head1 DESCRIPTION |
22 | |
22 | |
23 | This module collection manages coroutines. Coroutines are similar to |
23 | This module collection manages coroutines. Coroutines are similar to |
24 | Threads but don't run in parallel. |
24 | Threads but don't run in parallel. |
25 | |
25 | |
26 | This module is still experimental, see the BUGS section below. |
26 | This module is still experimental, see the BUGS section below. |
27 | |
27 | |
28 | In this module, coroutines are defined as "callchain + lexical variables |
28 | In this module, coroutines are defined as "callchain + lexical variables |
29 | + @_ + $_ + $@ + $^W), that is, a coroutine has it's own callchain, it's |
29 | + @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own |
30 | own set of lexicals and it's own set of perl's most important global |
30 | callchain, it's own set of lexicals and it's own set of perl's most |
31 | variables. |
31 | important global variables. |
32 | |
32 | |
33 | =cut |
33 | =cut |
34 | |
34 | |
35 | package Coro; |
35 | package Coro; |
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.10; |
41 | $VERSION = 0.49; |
42 | |
42 | |
43 | @EXPORT = qw(async yield 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; |
|
|
51 | my $init; |
48 | |
52 | |
49 | # this way of handling attributes simply is NOT scalable ;() |
53 | # this way of handling attributes simply is NOT scalable ;() |
50 | sub import { |
54 | sub import { |
51 | Coro->export_to_level(1, @_); |
55 | Coro->export_to_level(1, @_); |
52 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
56 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
… | |
… | |
54 | my ($package, $ref) = (shift, shift); |
58 | my ($package, $ref) = (shift, shift); |
55 | my @attrs; |
59 | my @attrs; |
56 | for (@_) { |
60 | for (@_) { |
57 | if ($_ eq "Coro") { |
61 | if ($_ eq "Coro") { |
58 | push @async, $ref; |
62 | push @async, $ref; |
|
|
63 | unless ($init++) { |
|
|
64 | eval q{ |
|
|
65 | sub INIT { |
|
|
66 | &async(pop @async) while @async; |
|
|
67 | } |
|
|
68 | }; |
|
|
69 | } |
59 | } else { |
70 | } else { |
60 | push @attrs, $_; |
71 | push @attrs, $_; |
61 | } |
72 | } |
62 | } |
73 | } |
63 | return $old ? $old->($package, $ref, @attrs) : @attrs; |
74 | return $old ? $old->($package, $ref, @attrs) : @attrs; |
64 | }; |
75 | }; |
65 | } |
76 | } |
66 | |
77 | |
67 | sub INIT { |
|
|
68 | &async(pop @async) while @async; |
|
|
69 | } |
|
|
70 | } |
78 | } |
71 | |
79 | |
72 | =item $main |
80 | =item $main |
73 | |
81 | |
74 | This coroutine represents the main program. |
82 | This coroutine represents the main program. |
… | |
… | |
103 | our $idle = new Coro sub { |
111 | our $idle = new Coro sub { |
104 | print STDERR "FATAL: deadlock detected\n"; |
112 | print STDERR "FATAL: deadlock detected\n"; |
105 | exit(51); |
113 | exit(51); |
106 | }; |
114 | }; |
107 | |
115 | |
108 | # we really need priorities... |
116 | # this coroutine is necessary because a coroutine |
109 | my @ready; # the ready queue. hehe, rather broken ;) |
117 | # cannot destroy itself. |
|
|
118 | my @destroy; |
|
|
119 | my $manager = new Coro sub { |
|
|
120 | while() { |
|
|
121 | delete ((pop @destroy)->{_coro_state}) while @destroy; |
|
|
122 | &schedule; |
|
|
123 | } |
|
|
124 | }; |
110 | |
125 | |
111 | # static methods. not really. |
126 | # static methods. not really. |
112 | |
127 | |
113 | =head2 STATIC METHODS |
128 | =head2 STATIC METHODS |
114 | |
129 | |
… | |
… | |
132 | |
147 | |
133 | =cut |
148 | =cut |
134 | |
149 | |
135 | sub async(&@) { |
150 | sub async(&@) { |
136 | my $pid = new Coro @_; |
151 | my $pid = new Coro @_; |
|
|
152 | $manager->ready; # this ensures that the stack is cloned from the manager |
137 | $pid->ready; |
153 | $pid->ready; |
138 | $pid; |
154 | $pid; |
139 | } |
155 | } |
140 | |
156 | |
141 | =item schedule |
157 | =item schedule |
… | |
… | |
144 | into the ready queue, so calling this function usually means you will |
160 | into the ready queue, so calling this function usually means you will |
145 | never be called again. |
161 | never be called again. |
146 | |
162 | |
147 | =cut |
163 | =cut |
148 | |
164 | |
149 | my $prev; |
|
|
150 | |
|
|
151 | sub schedule { |
|
|
152 | # should be done using priorities :( |
|
|
153 | ($prev, $current) = ($current, shift @ready || $idle); |
|
|
154 | Coro::State::transfer($prev, $current); |
|
|
155 | } |
|
|
156 | |
|
|
157 | =item yield |
165 | =item cede |
158 | |
166 | |
159 | Yield to other processes. This function puts the current process into the |
167 | "Cede" to other processes. This function puts the current process into the |
160 | ready queue and calls C<schedule>. |
168 | ready queue and calls C<schedule>, which has the effect of giving up the |
|
|
169 | current "timeslice" to other coroutines of the same or higher priority. |
161 | |
170 | |
162 | =cut |
171 | =cut |
163 | |
172 | |
164 | sub yield { |
173 | =item terminate |
|
|
174 | |
|
|
175 | Terminates the current process. |
|
|
176 | |
|
|
177 | Future versions of this function will allow result arguments. |
|
|
178 | |
|
|
179 | =cut |
|
|
180 | |
|
|
181 | sub terminate { |
165 | $current->ready; |
182 | $current->cancel; |
166 | &schedule; |
183 | &schedule; |
167 | } |
184 | die; # NORETURN |
168 | |
|
|
169 | =item terminate |
|
|
170 | |
|
|
171 | Terminates the current process. |
|
|
172 | |
|
|
173 | Future versions of this function will allow result arguments. |
|
|
174 | |
|
|
175 | =cut |
|
|
176 | |
|
|
177 | sub terminate { |
|
|
178 | $current->{_results} = [@_]; |
|
|
179 | &schedule; |
|
|
180 | } |
185 | } |
181 | |
186 | |
182 | =back |
187 | =back |
183 | |
188 | |
184 | # dynamic methods |
189 | # dynamic methods |
… | |
… | |
215 | |
220 | |
216 | Put the current process into the ready queue. |
221 | Put the current process into the ready queue. |
217 | |
222 | |
218 | =cut |
223 | =cut |
219 | |
224 | |
220 | sub ready { |
225 | =item $process->cancel |
|
|
226 | |
|
|
227 | Like C<terminate>, but terminates the specified process instead. |
|
|
228 | |
|
|
229 | =cut |
|
|
230 | |
|
|
231 | sub cancel { |
221 | push @ready, $_[0]; |
232 | push @destroy, $_[0]; |
|
|
233 | $manager->ready; |
|
|
234 | } |
|
|
235 | |
|
|
236 | =item $oldprio = $process->prio($newprio) |
|
|
237 | |
|
|
238 | Sets the priority of the process. Higher priority processes get run before |
|
|
239 | lower priority processes. Priorities are smalled signed integer (currently |
|
|
240 | -4 .. +3), that you can refer to using PRIO_xxx constants (use the import |
|
|
241 | tag :prio to get then): |
|
|
242 | |
|
|
243 | PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN |
|
|
244 | 3 > 1 > 0 > -1 > -3 > -4 |
|
|
245 | |
|
|
246 | # set priority to HIGH |
|
|
247 | current->prio(PRIO_HIGH); |
|
|
248 | |
|
|
249 | The idle coroutine ($Coro::idle) always has a lower priority than any |
|
|
250 | existing coroutine. |
|
|
251 | |
|
|
252 | Changing the priority of the current process will take effect immediately, |
|
|
253 | but changing the priority of processes in the ready queue (but not |
|
|
254 | running) will only take effect after the next schedule (of that |
|
|
255 | process). This is a bug that will be fixed in some future version. |
|
|
256 | |
|
|
257 | =cut |
|
|
258 | |
|
|
259 | sub prio { |
|
|
260 | my $old = $_[0]{prio}; |
|
|
261 | $_[0]{prio} = $_[1] if @_ > 1; |
|
|
262 | $old; |
|
|
263 | } |
|
|
264 | |
|
|
265 | =item $newprio = $process->nice($change) |
|
|
266 | |
|
|
267 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
|
|
268 | higher values mean lower priority, just as in unix). |
|
|
269 | |
|
|
270 | =cut |
|
|
271 | |
|
|
272 | sub nice { |
|
|
273 | $_[0]{prio} -= $_[1]; |
222 | } |
274 | } |
223 | |
275 | |
224 | =back |
276 | =back |
225 | |
277 | |
226 | =cut |
278 | =cut |
… | |
… | |
242 | allow per-thread schedulers, but Coro::State does not yet allow this). |
294 | allow per-thread schedulers, but Coro::State does not yet allow this). |
243 | |
295 | |
244 | =head1 SEE ALSO |
296 | =head1 SEE ALSO |
245 | |
297 | |
246 | L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, |
298 | L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, |
247 | L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. |
299 | L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>, |
|
|
300 | L<Coro::Handle>, L<Coro::Socket>. |
248 | |
301 | |
249 | =head1 AUTHOR |
302 | =head1 AUTHOR |
250 | |
303 | |
251 | Marc Lehmann <pcg@goof.com> |
304 | Marc Lehmann <pcg@goof.com> |
252 | http://www.goof.com/pcg/marc/ |
305 | http://www.goof.com/pcg/marc/ |