… | |
… | |
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 | |
|
|
26 | This module is still experimental, see the BUGS section below. |
|
|
27 | |
25 | |
28 | In this module, coroutines are defined as "callchain + lexical variables |
26 | In this module, coroutines are defined as "callchain + lexical variables |
29 | + @_ + $_ + $@ + $^W), that is, a coroutine has it's own callchain, it's |
27 | + @_ + $_ + $@ + $^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 |
28 | callchain, it's own set of lexicals and it's own set of perl's most |
31 | variables. |
29 | important global variables. |
32 | |
|
|
33 | WARNING: When using this module, make sure that, at program end, no |
|
|
34 | coroutines are still running OR just call exit before falling off the |
|
|
35 | end. The reason for this is that some coroutine of yours might have called |
|
|
36 | into a C function, and falling off the end of main:: results in returning |
|
|
37 | to that C function instead if to the main C interpreter. |
|
|
38 | |
30 | |
39 | =cut |
31 | =cut |
40 | |
32 | |
41 | package Coro; |
33 | package Coro; |
42 | |
34 | |
|
|
35 | BEGIN { eval { require warnings } && warnings->unimport ("uninitialized") } |
|
|
36 | |
43 | use Coro::State; |
37 | use Coro::State; |
44 | |
38 | |
|
|
39 | use vars qw($idle $main $current); |
|
|
40 | |
45 | use base Exporter; |
41 | use base Exporter; |
46 | |
42 | |
47 | $VERSION = 0.10; |
43 | $VERSION = "0.9"; |
48 | |
44 | |
49 | @EXPORT = qw(async yield schedule terminate current); |
45 | @EXPORT = qw(async cede schedule terminate current); |
50 | @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}}; |
51 | |
50 | |
52 | { |
51 | { |
53 | my @async; |
52 | my @async; |
|
|
53 | my $init; |
54 | |
54 | |
55 | # this way of handling attributes simply is NOT scalable ;() |
55 | # this way of handling attributes simply is NOT scalable ;() |
56 | sub import { |
56 | sub import { |
57 | Coro->export_to_level(1, @_); |
57 | Coro->export_to_level(1, @_); |
58 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
58 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
… | |
… | |
60 | my ($package, $ref) = (shift, shift); |
60 | my ($package, $ref) = (shift, shift); |
61 | my @attrs; |
61 | my @attrs; |
62 | for (@_) { |
62 | for (@_) { |
63 | if ($_ eq "Coro") { |
63 | if ($_ eq "Coro") { |
64 | push @async, $ref; |
64 | push @async, $ref; |
|
|
65 | unless ($init++) { |
|
|
66 | eval q{ |
|
|
67 | sub INIT { |
|
|
68 | &async(pop @async) while @async; |
|
|
69 | } |
|
|
70 | }; |
|
|
71 | } |
65 | } else { |
72 | } else { |
66 | push @attrs, $_; |
73 | push @attrs, $_; |
67 | } |
74 | } |
68 | } |
75 | } |
69 | return $old ? $old->($package, $ref, @attrs) : @attrs; |
76 | return $old ? $old->($package, $ref, @attrs) : @attrs; |
70 | }; |
77 | }; |
71 | } |
78 | } |
72 | |
79 | |
73 | sub INIT { |
|
|
74 | &async(pop @async) while @async; |
|
|
75 | } |
|
|
76 | } |
80 | } |
|
|
81 | |
|
|
82 | =over 4 |
77 | |
83 | |
78 | =item $main |
84 | =item $main |
79 | |
85 | |
80 | This coroutine represents the main program. |
86 | This coroutine represents the main program. |
81 | |
87 | |
82 | =cut |
88 | =cut |
83 | |
89 | |
84 | our $main = new Coro; |
90 | $main = new Coro; |
85 | |
91 | |
86 | =item $current (or as function: current) |
92 | =item $current (or as function: current) |
87 | |
93 | |
88 | The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). |
94 | The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). |
89 | |
95 | |
… | |
… | |
92 | # maybe some other module used Coro::Specific before... |
98 | # maybe some other module used Coro::Specific before... |
93 | if ($current) { |
99 | if ($current) { |
94 | $main->{specific} = $current->{specific}; |
100 | $main->{specific} = $current->{specific}; |
95 | } |
101 | } |
96 | |
102 | |
97 | our $current = $main; |
103 | $current = $main; |
98 | |
104 | |
99 | sub current() { $current } |
105 | sub current() { $current } |
100 | |
106 | |
101 | =item $idle |
107 | =item $idle |
102 | |
108 | |
… | |
… | |
104 | implementation prints "FATAL: deadlock detected" and exits. |
110 | implementation prints "FATAL: deadlock detected" and exits. |
105 | |
111 | |
106 | =cut |
112 | =cut |
107 | |
113 | |
108 | # should be done using priorities :( |
114 | # should be done using priorities :( |
109 | our $idle = new Coro sub { |
115 | $idle = new Coro sub { |
110 | print STDERR "FATAL: deadlock detected\n"; |
116 | print STDERR "FATAL: deadlock detected\n"; |
111 | exit(51); |
117 | exit(51); |
112 | }; |
118 | }; |
113 | |
119 | |
114 | # we really need priorities... |
120 | # this coroutine is necessary because a coroutine |
115 | my @ready; # the ready queue. hehe, rather broken ;) |
121 | # cannot destroy itself. |
|
|
122 | my @destroy; |
|
|
123 | my $manager; |
|
|
124 | $manager = new Coro sub { |
|
|
125 | while() { |
|
|
126 | # by overwriting the state object with the manager we destroy it |
|
|
127 | # while still being able to schedule this coroutine (in case it has |
|
|
128 | # been readied multiple times. this is harmless since the manager |
|
|
129 | # can be called as many times as neccessary and will always |
|
|
130 | # remove itself from the runqueue |
|
|
131 | while (@destroy) { |
|
|
132 | my $coro = pop @destroy; |
|
|
133 | $coro->{status} ||= []; |
|
|
134 | $_->ready for @{delete $coro->{join} || []}; |
|
|
135 | $coro->{_coro_state} = $manager->{_coro_state}; |
|
|
136 | } |
|
|
137 | &schedule; |
|
|
138 | } |
|
|
139 | }; |
116 | |
140 | |
117 | # static methods. not really. |
141 | # static methods. not really. |
|
|
142 | |
|
|
143 | =back |
118 | |
144 | |
119 | =head2 STATIC METHODS |
145 | =head2 STATIC METHODS |
120 | |
146 | |
121 | Static methods are actually functions that operate on the current process only. |
147 | Static methods are actually functions that operate on the current process only. |
122 | |
148 | |
… | |
… | |
138 | |
164 | |
139 | =cut |
165 | =cut |
140 | |
166 | |
141 | sub async(&@) { |
167 | sub async(&@) { |
142 | my $pid = new Coro @_; |
168 | my $pid = new Coro @_; |
|
|
169 | $manager->ready; # this ensures that the stack is cloned from the manager |
143 | $pid->ready; |
170 | $pid->ready; |
144 | $pid; |
171 | $pid; |
145 | } |
172 | } |
146 | |
173 | |
147 | =item schedule |
174 | =item schedule |
… | |
… | |
150 | into the ready queue, so calling this function usually means you will |
177 | into the ready queue, so calling this function usually means you will |
151 | never be called again. |
178 | never be called again. |
152 | |
179 | |
153 | =cut |
180 | =cut |
154 | |
181 | |
155 | my $prev; |
|
|
156 | |
|
|
157 | sub schedule { |
|
|
158 | # should be done using priorities :( |
|
|
159 | ($prev, $current) = ($current, shift @ready || $idle); |
|
|
160 | Coro::State::transfer($prev, $current); |
|
|
161 | } |
|
|
162 | |
|
|
163 | =item yield |
182 | =item cede |
164 | |
183 | |
165 | Yield to other processes. This function puts the current process into the |
184 | "Cede" to other processes. This function puts the current process into the |
166 | ready queue and calls C<schedule>. |
185 | ready queue and calls C<schedule>, which has the effect of giving up the |
|
|
186 | current "timeslice" to other coroutines of the same or higher priority. |
167 | |
187 | |
168 | =cut |
188 | =cut |
169 | |
189 | |
170 | sub yield { |
190 | =item terminate [arg...] |
|
|
191 | |
|
|
192 | Terminates the current process. |
|
|
193 | |
|
|
194 | Future versions of this function will allow result arguments. |
|
|
195 | |
|
|
196 | =cut |
|
|
197 | |
|
|
198 | sub terminate { |
|
|
199 | $current->{status} = [@_]; |
171 | $current->ready; |
200 | $current->cancel; |
172 | &schedule; |
201 | &schedule; |
173 | } |
202 | die; # NORETURN |
174 | |
|
|
175 | =item terminate |
|
|
176 | |
|
|
177 | Terminates the current process. |
|
|
178 | |
|
|
179 | Future versions of this function will allow result arguments. |
|
|
180 | |
|
|
181 | =cut |
|
|
182 | |
|
|
183 | sub terminate { |
|
|
184 | $current->{_results} = [@_]; |
|
|
185 | delete $current->{_coro_state}; |
|
|
186 | &schedule; |
|
|
187 | } |
203 | } |
188 | |
204 | |
189 | =back |
205 | =back |
190 | |
206 | |
191 | # dynamic methods |
207 | # dynamic methods |
… | |
… | |
197 | =over 4 |
213 | =over 4 |
198 | |
214 | |
199 | =item new Coro \&sub [, @args...] |
215 | =item new Coro \&sub [, @args...] |
200 | |
216 | |
201 | Create a new process and return it. When the sub returns the process |
217 | Create a new process and return it. When the sub returns the process |
202 | automatically terminates. To start the process you must first put it into |
218 | automatically terminates as if C<terminate> with the returned values were |
|
|
219 | called. To make the process run you must first put it into the ready queue |
203 | the ready queue by calling the ready method. |
220 | by calling the ready method. |
204 | |
|
|
205 | The coderef you submit MUST NOT be a closure that refers to variables |
|
|
206 | in an outer scope. This does NOT work. Pass arguments into it instead. |
|
|
207 | |
221 | |
208 | =cut |
222 | =cut |
209 | |
223 | |
210 | sub _newcoro { |
224 | sub _newcoro { |
211 | terminate &{+shift}; |
225 | terminate &{+shift}; |
… | |
… | |
218 | }, $class; |
232 | }, $class; |
219 | } |
233 | } |
220 | |
234 | |
221 | =item $process->ready |
235 | =item $process->ready |
222 | |
236 | |
223 | Put the current process into the ready queue. |
237 | Put the given process into the ready queue. |
224 | |
238 | |
225 | =cut |
239 | =cut |
226 | |
240 | |
227 | sub ready { |
241 | =item $process->cancel |
|
|
242 | |
|
|
243 | Like C<terminate>, but terminates the specified process instead. |
|
|
244 | |
|
|
245 | =cut |
|
|
246 | |
|
|
247 | sub cancel { |
228 | push @ready, $_[0]; |
248 | push @destroy, $_[0]; |
|
|
249 | $manager->ready; |
|
|
250 | &schedule if $current == $_[0]; |
|
|
251 | } |
|
|
252 | |
|
|
253 | =item $process->join |
|
|
254 | |
|
|
255 | Wait until the coroutine terminates and return any values given to the |
|
|
256 | C<terminate> function. C<join> can be called multiple times from multiple |
|
|
257 | processes. |
|
|
258 | |
|
|
259 | =cut |
|
|
260 | |
|
|
261 | sub join { |
|
|
262 | my $self = shift; |
|
|
263 | unless ($self->{status}) { |
|
|
264 | push @{$self->{join}}, $current; |
|
|
265 | &schedule; |
|
|
266 | } |
|
|
267 | wantarray ? @{$self->{status}} : $self->{status}[0]; |
|
|
268 | } |
|
|
269 | |
|
|
270 | =item $oldprio = $process->prio($newprio) |
|
|
271 | |
|
|
272 | Sets (or gets, if the argument is missing) the priority of the |
|
|
273 | process. Higher priority processes get run before lower priority |
|
|
274 | processes. Priorities are small signed integers (currently -4 .. +3), |
|
|
275 | that you can refer to using PRIO_xxx constants (use the import tag :prio |
|
|
276 | to get then): |
|
|
277 | |
|
|
278 | PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN |
|
|
279 | 3 > 1 > 0 > -1 > -3 > -4 |
|
|
280 | |
|
|
281 | # set priority to HIGH |
|
|
282 | current->prio(PRIO_HIGH); |
|
|
283 | |
|
|
284 | The idle coroutine ($Coro::idle) always has a lower priority than any |
|
|
285 | existing coroutine. |
|
|
286 | |
|
|
287 | Changing the priority of the current process will take effect immediately, |
|
|
288 | but changing the priority of processes in the ready queue (but not |
|
|
289 | 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. |
|
|
291 | |
|
|
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) |
|
|
301 | |
|
|
302 | Similar to C<prio>, but subtract the given value from the priority (i.e. |
|
|
303 | higher values mean lower priority, just as in unix). |
|
|
304 | |
|
|
305 | =cut |
|
|
306 | |
|
|
307 | sub nice { |
|
|
308 | $_[0]{prio} -= $_[1]; |
|
|
309 | } |
|
|
310 | |
|
|
311 | =item $olddesc = $process->desc($newdesc) |
|
|
312 | |
|
|
313 | 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 | |
|
|
316 | =cut |
|
|
317 | |
|
|
318 | sub desc { |
|
|
319 | my $old = $_[0]{desc}; |
|
|
320 | $_[0]{desc} = $_[1] if @_ > 1; |
|
|
321 | $old; |
229 | } |
322 | } |
230 | |
323 | |
231 | =back |
324 | =back |
232 | |
325 | |
233 | =cut |
326 | =cut |
234 | |
327 | |
235 | 1; |
328 | 1; |
236 | |
329 | |
237 | =head1 BUGS/LIMITATIONS |
330 | =head1 BUGS/LIMITATIONS |
238 | |
331 | |
239 | - could be faster, especially when the core would introduce special |
332 | - you must make very sure that no coro is still active on global |
240 | support for coroutines (like it does for threads). |
333 | destruction. very bad things might happen otherwise (usually segfaults). |
241 | - there is still a memleak on coroutine termination that I could not |
334 | |
242 | identify. Could be as small as a single SV. |
|
|
243 | - this module is not well-tested. |
|
|
244 | - if variables or arguments "disappear" (become undef) or become |
|
|
245 | corrupted please contact the author so he cen iron out the |
|
|
246 | remaining bugs. |
|
|
247 | - this module is not thread-safe. You must only ever use this module from |
335 | - this module is not thread-safe. You should only ever use this module |
248 | the same thread (this requirement might be loosened in the future to |
336 | from the same thread (this requirement might be losened in the future |
249 | allow per-thread schedulers, but Coro::State does not yet allow this). |
337 | to allow per-thread schedulers, but Coro::State does not yet allow |
|
|
338 | this). |
250 | |
339 | |
251 | =head1 SEE ALSO |
340 | =head1 SEE ALSO |
252 | |
341 | |
253 | L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, |
342 | L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, |
254 | L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. |
343 | L<Coro::Signal>, L<Coro::State>, L<Coro::Timer>, L<Coro::Event>, |
|
|
344 | L<Coro::L<Coro::RWLock>, Handle>, L<Coro::Socket>. |
255 | |
345 | |
256 | =head1 AUTHOR |
346 | =head1 AUTHOR |
257 | |
347 | |
258 | Marc Lehmann <pcg@goof.com> |
348 | Marc Lehmann <pcg@goof.com> |
259 | http://www.goof.com/pcg/marc/ |
349 | http://www.goof.com/pcg/marc/ |