1 |
=head1 NAME |
2 |
|
3 |
Coro - coroutine process abstraction |
4 |
|
5 |
=head1 SYNOPSIS |
6 |
|
7 |
use Coro; |
8 |
|
9 |
async { |
10 |
# some asynchronous thread of execution |
11 |
}; |
12 |
|
13 |
# alternatively create an async process like this: |
14 |
|
15 |
sub some_func : Coro { |
16 |
# some more async code |
17 |
} |
18 |
|
19 |
cede; |
20 |
|
21 |
=head1 DESCRIPTION |
22 |
|
23 |
This module collection manages coroutines. Coroutines are similar to |
24 |
threads but don't run in parallel. |
25 |
|
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. |
30 |
|
31 |
=cut |
32 |
|
33 |
package Coro; |
34 |
|
35 |
no warnings qw(uninitialized); |
36 |
|
37 |
use Coro::State; |
38 |
|
39 |
use base Exporter; |
40 |
|
41 |
$VERSION = 0.651; |
42 |
|
43 |
@EXPORT = qw(async cede schedule terminate 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}}; |
48 |
|
49 |
{ |
50 |
my @async; |
51 |
my $init; |
52 |
|
53 |
# this way of handling attributes simply is NOT scalable ;() |
54 |
sub import { |
55 |
Coro->export_to_level(1, @_); |
56 |
my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; |
57 |
*{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { |
58 |
my ($package, $ref) = (shift, shift); |
59 |
my @attrs; |
60 |
for (@_) { |
61 |
if ($_ eq "Coro") { |
62 |
push @async, $ref; |
63 |
unless ($init++) { |
64 |
eval q{ |
65 |
sub INIT { |
66 |
&async(pop @async) while @async; |
67 |
} |
68 |
}; |
69 |
} |
70 |
} else { |
71 |
push @attrs, $_; |
72 |
} |
73 |
} |
74 |
return $old ? $old->($package, $ref, @attrs) : @attrs; |
75 |
}; |
76 |
} |
77 |
|
78 |
} |
79 |
|
80 |
=over 4 |
81 |
|
82 |
=item $main |
83 |
|
84 |
This coroutine represents the main program. |
85 |
|
86 |
=cut |
87 |
|
88 |
our $main = new Coro; |
89 |
|
90 |
=item $current (or as function: current) |
91 |
|
92 |
The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). |
93 |
|
94 |
=cut |
95 |
|
96 |
# maybe some other module used Coro::Specific before... |
97 |
if ($current) { |
98 |
$main->{specific} = $current->{specific}; |
99 |
} |
100 |
|
101 |
our $current = $main; |
102 |
|
103 |
sub current() { $current } |
104 |
|
105 |
=item $idle |
106 |
|
107 |
The coroutine to switch to when no other coroutine is running. The default |
108 |
implementation prints "FATAL: deadlock detected" and exits. |
109 |
|
110 |
=cut |
111 |
|
112 |
# should be done using priorities :( |
113 |
our $idle = new Coro sub { |
114 |
print STDERR "FATAL: deadlock detected\n"; |
115 |
exit(51); |
116 |
}; |
117 |
|
118 |
# this coroutine is necessary because a coroutine |
119 |
# cannot destroy itself. |
120 |
my @destroy; |
121 |
my $manager; |
122 |
$manager = new Coro sub { |
123 |
while() { |
124 |
# by overwriting the state object with the manager we destroy it |
125 |
# while still being able to schedule this coroutine (in case it has |
126 |
# been readied multiple times. this is harmless since the manager |
127 |
# can be called as many times as neccessary and will always |
128 |
# remove itself from the runqueue |
129 |
while (@destroy) { |
130 |
my $coro = pop @destroy; |
131 |
$coro->{status} ||= []; |
132 |
$_->ready for @{delete $coro->{join} || []}; |
133 |
$coro->{_coro_state} = $manager->{_coro_state}; |
134 |
} |
135 |
&schedule; |
136 |
} |
137 |
}; |
138 |
|
139 |
# static methods. not really. |
140 |
|
141 |
=back |
142 |
|
143 |
=head2 STATIC METHODS |
144 |
|
145 |
Static methods are actually functions that operate on the current process only. |
146 |
|
147 |
=over 4 |
148 |
|
149 |
=item async { ... } [@args...] |
150 |
|
151 |
Create a new asynchronous process and return it's process object |
152 |
(usually unused). When the sub returns the new process is automatically |
153 |
terminated. |
154 |
|
155 |
# create a new coroutine that just prints its arguments |
156 |
async { |
157 |
print "@_\n"; |
158 |
} 1,2,3,4; |
159 |
|
160 |
The coderef you submit MUST NOT be a closure that refers to variables |
161 |
in an outer scope. This does NOT work. Pass arguments into it instead. |
162 |
|
163 |
=cut |
164 |
|
165 |
sub async(&@) { |
166 |
my $pid = new Coro @_; |
167 |
$manager->ready; # this ensures that the stack is cloned from the manager |
168 |
$pid->ready; |
169 |
$pid; |
170 |
} |
171 |
|
172 |
=item schedule |
173 |
|
174 |
Calls the scheduler. Please note that the current process will not be put |
175 |
into the ready queue, so calling this function usually means you will |
176 |
never be called again. |
177 |
|
178 |
=cut |
179 |
|
180 |
=item cede |
181 |
|
182 |
"Cede" to other processes. This function puts the current process into the |
183 |
ready queue and calls C<schedule>, which has the effect of giving up the |
184 |
current "timeslice" to other coroutines of the same or higher priority. |
185 |
|
186 |
=cut |
187 |
|
188 |
=item terminate [arg...] |
189 |
|
190 |
Terminates the current process. |
191 |
|
192 |
Future versions of this function will allow result arguments. |
193 |
|
194 |
=cut |
195 |
|
196 |
sub terminate { |
197 |
$current->{status} = [@_]; |
198 |
$current->cancel; |
199 |
&schedule; |
200 |
die; # NORETURN |
201 |
} |
202 |
|
203 |
=back |
204 |
|
205 |
# dynamic methods |
206 |
|
207 |
=head2 PROCESS METHODS |
208 |
|
209 |
These are the methods you can call on process objects. |
210 |
|
211 |
=over 4 |
212 |
|
213 |
=item new Coro \&sub [, @args...] |
214 |
|
215 |
Create a new process and return it. When the sub returns the process |
216 |
automatically terminates as if C<terminate> with the returned values were |
217 |
called. To make the process run you must first put it into the ready queue |
218 |
by calling the ready method. |
219 |
|
220 |
=cut |
221 |
|
222 |
sub _newcoro { |
223 |
terminate &{+shift}; |
224 |
} |
225 |
|
226 |
sub new { |
227 |
my $class = shift; |
228 |
bless { |
229 |
_coro_state => (new Coro::State $_[0] && \&_newcoro, @_), |
230 |
}, $class; |
231 |
} |
232 |
|
233 |
=item $process->ready |
234 |
|
235 |
Put the given process into the ready queue. |
236 |
|
237 |
=cut |
238 |
|
239 |
=item $process->cancel |
240 |
|
241 |
Like C<terminate>, but terminates the specified process instead. |
242 |
|
243 |
=cut |
244 |
|
245 |
sub cancel { |
246 |
push @destroy, $_[0]; |
247 |
$manager->ready; |
248 |
&schedule if $current == $_[0]; |
249 |
} |
250 |
|
251 |
=item $process->join |
252 |
|
253 |
Wait until the coroutine terminates and return any values given to the |
254 |
C<terminate> function. C<join> can be called multiple times from multiple |
255 |
processes. |
256 |
|
257 |
=cut |
258 |
|
259 |
sub join { |
260 |
my $self = shift; |
261 |
unless ($self->{status}) { |
262 |
push @{$self->{join}}, $current; |
263 |
&schedule; |
264 |
} |
265 |
wantarray ? @{$self->{status}} : $self->{status}[0]; |
266 |
} |
267 |
|
268 |
=item $oldprio = $process->prio($newprio) |
269 |
|
270 |
Sets (or gets, if the argument is missing) the priority of the |
271 |
process. Higher priority processes get run before lower priority |
272 |
processes. Priorities are smalled signed integer (currently -4 .. +3), |
273 |
that you can refer to using PRIO_xxx constants (use the import tag :prio |
274 |
to get then): |
275 |
|
276 |
PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN |
277 |
3 > 1 > 0 > -1 > -3 > -4 |
278 |
|
279 |
# set priority to HIGH |
280 |
current->prio(PRIO_HIGH); |
281 |
|
282 |
The idle coroutine ($Coro::idle) always has a lower priority than any |
283 |
existing coroutine. |
284 |
|
285 |
Changing the priority of the current process will take effect immediately, |
286 |
but changing the priority of processes in the ready queue (but not |
287 |
running) will only take effect after the next schedule (of that |
288 |
process). This is a bug that will be fixed in some future version. |
289 |
|
290 |
=cut |
291 |
|
292 |
sub prio { |
293 |
my $old = $_[0]{prio}; |
294 |
$_[0]{prio} = $_[1] if @_ > 1; |
295 |
$old; |
296 |
} |
297 |
|
298 |
=item $newprio = $process->nice($change) |
299 |
|
300 |
Similar to C<prio>, but subtract the given value from the priority (i.e. |
301 |
higher values mean lower priority, just as in unix). |
302 |
|
303 |
=cut |
304 |
|
305 |
sub nice { |
306 |
$_[0]{prio} -= $_[1]; |
307 |
} |
308 |
|
309 |
=item $olddesc = $process->desc($newdesc) |
310 |
|
311 |
Sets (or gets in case the argument is missing) the description for this |
312 |
process. This is just a free-form string you can associate with a process. |
313 |
|
314 |
=cut |
315 |
|
316 |
sub desc { |
317 |
my $old = $_[0]{desc}; |
318 |
$_[0]{desc} = $_[1] if @_ > 1; |
319 |
$old; |
320 |
} |
321 |
|
322 |
=back |
323 |
|
324 |
=cut |
325 |
|
326 |
1; |
327 |
|
328 |
=head1 BUGS/LIMITATIONS |
329 |
|
330 |
- you must make very sure that no coro is still active on global destruction. |
331 |
very bad things might happen otherwise (usually segfaults). |
332 |
- this module is not thread-safe. You should only ever use this module from |
333 |
the same thread (this requirement might be loosened in the future to |
334 |
allow per-thread schedulers, but Coro::State does not yet allow this). |
335 |
|
336 |
=head1 SEE ALSO |
337 |
|
338 |
L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, |
339 |
L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>, |
340 |
L<Coro::Handle>, L<Coro::Socket>. |
341 |
|
342 |
=head1 AUTHOR |
343 |
|
344 |
Marc Lehmann <pcg@goof.com> |
345 |
http://www.goof.com/pcg/marc/ |
346 |
|
347 |
=cut |
348 |
|