| … | |
… | |
| 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 | In this module, coroutines are defined as "callchain + lexical variables |
|
|
27 | + @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own |
|
|
28 | callchain, it's own set of lexicals and it's own set of perl's most |
|
|
29 | important global variables. |
| 27 | |
30 | |
| 28 | =cut |
31 | =cut |
| 29 | |
32 | |
| 30 | package Coro; |
33 | package Coro; |
| 31 | |
34 | |
|
|
35 | BEGIN { eval { require warnings } && warnings->unimport ("uninitialized") } |
|
|
36 | |
| 32 | use Coro::State; |
37 | use Coro::State; |
| 33 | |
38 | |
|
|
39 | use vars qw($idle $main $current); |
|
|
40 | |
| 34 | use base Exporter; |
41 | use base Exporter; |
| 35 | |
42 | |
| 36 | $VERSION = 0.08; |
43 | $VERSION = 1.11; |
| 37 | |
44 | |
| 38 | @EXPORT = qw(async yield schedule terminate); |
45 | @EXPORT = qw(async cede schedule terminate current); |
| 39 | @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}}; |
| 40 | |
50 | |
| 41 | { |
51 | { |
| 42 | use subs 'async'; |
|
|
| 43 | |
|
|
| 44 | my @async; |
52 | my @async; |
|
|
53 | my $init; |
| 45 | |
54 | |
| 46 | # this way of handling attributes simply is NOT scalable ;() |
55 | # this way of handling attributes simply is NOT scalable ;() |
| 47 | sub import { |
56 | sub import { |
| 48 | Coro->export_to_level(1, @_); |
57 | Coro->export_to_level(1, @_); |
| 49 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
58 | my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
| … | |
… | |
| 51 | my ($package, $ref) = (shift, shift); |
60 | my ($package, $ref) = (shift, shift); |
| 52 | my @attrs; |
61 | my @attrs; |
| 53 | for (@_) { |
62 | for (@_) { |
| 54 | if ($_ eq "Coro") { |
63 | if ($_ eq "Coro") { |
| 55 | 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 | } |
| 56 | } else { |
72 | } else { |
| 57 | push @attrs, $_; |
73 | push @attrs, $_; |
| 58 | } |
74 | } |
| 59 | } |
75 | } |
| 60 | return $old ? $old->($package, $ref, @attrs) : @attrs; |
76 | return $old ? $old->($package, $ref, @attrs) : @attrs; |
| 61 | }; |
77 | }; |
| 62 | } |
78 | } |
| 63 | |
79 | |
| 64 | sub INIT { |
|
|
| 65 | async pop @async while @async; |
|
|
| 66 | } |
|
|
| 67 | } |
80 | } |
|
|
81 | |
|
|
82 | =over 4 |
| 68 | |
83 | |
| 69 | =item $main |
84 | =item $main |
| 70 | |
85 | |
| 71 | This coroutine represents the main program. |
86 | This coroutine represents the main program. |
| 72 | |
87 | |
| 73 | =cut |
88 | =cut |
| 74 | |
89 | |
| 75 | our $main = new Coro; |
90 | $main = new Coro; |
| 76 | |
91 | |
| 77 | =item $current |
92 | =item $current (or as function: current) |
| 78 | |
93 | |
| 79 | 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). |
| 80 | |
95 | |
| 81 | =cut |
96 | =cut |
| 82 | |
97 | |
| 83 | # maybe some other module used Coro::Specific before... |
98 | # maybe some other module used Coro::Specific before... |
| 84 | if ($current) { |
99 | if ($current) { |
| 85 | $main->{specific} = $current->{specific}; |
100 | $main->{specific} = $current->{specific}; |
| 86 | } |
101 | } |
| 87 | |
102 | |
| 88 | our $current = $main; |
103 | $current = $main; |
|
|
104 | |
|
|
105 | sub current() { $current } |
| 89 | |
106 | |
| 90 | =item $idle |
107 | =item $idle |
| 91 | |
108 | |
| 92 | The coroutine to switch to when no other coroutine is running. The default |
109 | The coroutine to switch to when no other coroutine is running. The default |
| 93 | implementation prints "FATAL: deadlock detected" and exits. |
110 | implementation prints "FATAL: deadlock detected" and exits. |
| 94 | |
111 | |
| 95 | =cut |
112 | =cut |
| 96 | |
113 | |
| 97 | # should be done using priorities :( |
114 | # should be done using priorities :( |
| 98 | our $idle = new Coro sub { |
115 | $idle = new Coro sub { |
| 99 | print STDERR "FATAL: deadlock detected\n"; |
116 | print STDERR "FATAL: deadlock detected\n"; |
| 100 | exit(51); |
117 | exit(51); |
| 101 | }; |
118 | }; |
| 102 | |
119 | |
| 103 | # we really need priorities... |
120 | # this coroutine is necessary because a coroutine |
| 104 | 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 | |
|
|
136 | # the next line destroys the _coro_state, but keeps the |
|
|
137 | # process itself intact (we basically make it a zombie |
|
|
138 | # process that always runs the manager thread, so it's possible |
|
|
139 | # to transfer() to this process). |
|
|
140 | $coro->{_coro_state} = $manager->{_coro_state}; |
|
|
141 | } |
|
|
142 | &schedule; |
|
|
143 | } |
|
|
144 | }; |
| 105 | |
145 | |
| 106 | # static methods. not really. |
146 | # static methods. not really. |
|
|
147 | |
|
|
148 | =back |
| 107 | |
149 | |
| 108 | =head2 STATIC METHODS |
150 | =head2 STATIC METHODS |
| 109 | |
151 | |
| 110 | Static methods are actually functions that operate on the current process only. |
152 | Static methods are actually functions that operate on the current process only. |
| 111 | |
153 | |
| … | |
… | |
| 120 | # create a new coroutine that just prints its arguments |
162 | # create a new coroutine that just prints its arguments |
| 121 | async { |
163 | async { |
| 122 | print "@_\n"; |
164 | print "@_\n"; |
| 123 | } 1,2,3,4; |
165 | } 1,2,3,4; |
| 124 | |
166 | |
| 125 | The coderef you submit MUST NOT be a closure that refers to variables |
|
|
| 126 | in an outer scope. This does NOT work. Pass arguments into it instead. |
|
|
| 127 | |
|
|
| 128 | =cut |
167 | =cut |
| 129 | |
168 | |
| 130 | sub async(&@) { |
169 | sub async(&@) { |
| 131 | my $pid = new Coro @_; |
170 | my $pid = new Coro @_; |
|
|
171 | $manager->ready; # this ensures that the stack is cloned from the manager |
| 132 | $pid->ready; |
172 | $pid->ready; |
| 133 | $pid; |
173 | $pid; |
| 134 | } |
174 | } |
| 135 | |
175 | |
| 136 | =item schedule |
176 | =item schedule |
| … | |
… | |
| 139 | into the ready queue, so calling this function usually means you will |
179 | into the ready queue, so calling this function usually means you will |
| 140 | never be called again. |
180 | never be called again. |
| 141 | |
181 | |
| 142 | =cut |
182 | =cut |
| 143 | |
183 | |
| 144 | my $prev; |
|
|
| 145 | |
|
|
| 146 | sub schedule { |
|
|
| 147 | # should be done using priorities :( |
|
|
| 148 | ($prev, $current) = ($current, shift @ready || $idle); |
|
|
| 149 | Coro::State::transfer($prev, $current); |
|
|
| 150 | } |
|
|
| 151 | |
|
|
| 152 | =item yield |
184 | =item cede |
| 153 | |
185 | |
| 154 | Yield to other processes. This function puts the current process into the |
186 | "Cede" to other processes. This function puts the current process into the |
| 155 | ready queue and calls C<schedule>. |
187 | ready queue and calls C<schedule>, which has the effect of giving up the |
|
|
188 | current "timeslice" to other coroutines of the same or higher priority. |
| 156 | |
189 | |
| 157 | =cut |
190 | =cut |
| 158 | |
191 | |
| 159 | sub yield { |
|
|
| 160 | $current->ready; |
|
|
| 161 | &schedule; |
|
|
| 162 | } |
|
|
| 163 | |
|
|
| 164 | =item terminate |
192 | =item terminate [arg...] |
| 165 | |
193 | |
| 166 | Terminates the current process. |
194 | Terminates the current process with the given status values (see L<cancel>). |
| 167 | |
|
|
| 168 | Future versions of this function will allow result arguments. |
|
|
| 169 | |
195 | |
| 170 | =cut |
196 | =cut |
| 171 | |
197 | |
| 172 | sub terminate { |
198 | sub terminate { |
| 173 | $current->{_results} = [@_]; |
199 | $current->cancel (@_); |
| 174 | &schedule; |
|
|
| 175 | } |
200 | } |
| 176 | |
201 | |
| 177 | =back |
202 | =back |
| 178 | |
203 | |
| 179 | # dynamic methods |
204 | # dynamic methods |
| … | |
… | |
| 185 | =over 4 |
210 | =over 4 |
| 186 | |
211 | |
| 187 | =item new Coro \&sub [, @args...] |
212 | =item new Coro \&sub [, @args...] |
| 188 | |
213 | |
| 189 | Create a new process and return it. When the sub returns the process |
214 | Create a new process and return it. When the sub returns the process |
| 190 | automatically terminates. To start the process you must first put it into |
215 | automatically terminates as if C<terminate> with the returned values were |
|
|
216 | called. To make the process run you must first put it into the ready queue |
| 191 | the ready queue by calling the ready method. |
217 | by calling the ready method. |
| 192 | |
|
|
| 193 | The coderef you submit MUST NOT be a closure that refers to variables |
|
|
| 194 | in an outer scope. This does NOT work. Pass arguments into it instead. |
|
|
| 195 | |
218 | |
| 196 | =cut |
219 | =cut |
| 197 | |
220 | |
| 198 | sub _newcoro { |
221 | sub _newcoro { |
| 199 | terminate &{+shift}; |
222 | terminate &{+shift}; |
| … | |
… | |
| 206 | }, $class; |
229 | }, $class; |
| 207 | } |
230 | } |
| 208 | |
231 | |
| 209 | =item $process->ready |
232 | =item $process->ready |
| 210 | |
233 | |
| 211 | Put the current process into the ready queue. |
234 | Put the given process into the ready queue. |
| 212 | |
235 | |
| 213 | =cut |
236 | =cut |
| 214 | |
237 | |
| 215 | sub ready { |
238 | =item $process->cancel (arg...) |
| 216 | push @ready, $_[0]; |
239 | |
|
|
240 | Temrinates the given process and makes it return the given arguments as |
|
|
241 | status (default: the empty list). |
|
|
242 | |
|
|
243 | =cut |
|
|
244 | |
|
|
245 | sub cancel { |
|
|
246 | my $self = shift; |
|
|
247 | $self->{status} = [@_]; |
|
|
248 | push @destroy, $self; |
|
|
249 | $manager->ready; |
|
|
250 | &schedule if $current == $self; |
|
|
251 | } |
|
|
252 | |
|
|
253 | =item $process->join |
|
|
254 | |
|
|
255 | Wait until the coroutine terminates and return any values given to the |
|
|
256 | C<terminate> or C<cancel> functions. C<join> can be called multiple times |
|
|
257 | from multiple 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; |
| 217 | } |
322 | } |
| 218 | |
323 | |
| 219 | =back |
324 | =back |
| 220 | |
325 | |
| 221 | =cut |
326 | =cut |
| 222 | |
327 | |
| 223 | 1; |
328 | 1; |
| 224 | |
329 | |
| 225 | =head1 BUGS/LIMITATIONS |
330 | =head1 BUGS/LIMITATIONS |
| 226 | |
331 | |
| 227 | - could be faster, especially when the core would introduce special |
332 | - you must make very sure that no coro is still active on global |
| 228 | support for coroutines (like it does for threads). |
333 | destruction. very bad things might happen otherwise (usually segfaults). |
| 229 | - there is still a memleak on coroutine termination that I could not |
334 | |
| 230 | identify. Could be as small as a single SV. |
|
|
| 231 | - this module is not well-tested. |
|
|
| 232 | - if variables or arguments "disappear" (become undef) or become |
|
|
| 233 | corrupted please contact the author so he cen iron out the |
|
|
| 234 | remaining bugs. |
|
|
| 235 | - 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 |
| 236 | 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 |
| 237 | allow per-thread schedulers, but Coro::Satte does not yet allow this). |
337 | to allow per-thread schedulers, but Coro::State does not yet allow |
|
|
338 | this). |
| 238 | |
339 | |
| 239 | =head1 SEE ALSO |
340 | =head1 SEE ALSO |
| 240 | |
341 | |
| 241 | 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>, |
| 242 | 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::Handle>, L<Coro::RWLock>, L<Coro::Socket>. |
| 243 | |
345 | |
| 244 | =head1 AUTHOR |
346 | =head1 AUTHOR |
| 245 | |
347 | |
| 246 | Marc Lehmann <pcg@goof.com> |
348 | Marc Lehmann <schmorp@schmorp.de> |
| 247 | http://www.goof.com/pcg/marc/ |
349 | http://home.schmorp.de/ |
| 248 | |
350 | |
| 249 | =cut |
351 | =cut |
| 250 | |
352 | |
