ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro.pm
(Generate patch)

Comparing Coro/Coro.pm (file contents):
Revision 1.78 by root, Wed Nov 1 01:21:21 2006 UTC vs.
Revision 1.94 by root, Sat Dec 2 18:01:30 2006 UTC

8 8
9 async { 9 async {
10 # some asynchronous thread of execution 10 # some asynchronous thread of execution
11 }; 11 };
12 12
13 # alternatively create an async process like this: 13 # alternatively create an async coroutine like this:
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
35use strict; 35use strict;
36no warnings "uninitialized"; 36no warnings "uninitialized";
37 37
38use Coro::State; 38use Coro::State;
39 39
40use base Exporter::; 40use base qw(Coro::State Exporter);
41 41
42our $idle; # idle coroutine 42our $idle; # idle handler
43our $main; # main coroutine 43our $main; # main coroutine
44our $current; # current coroutine 44our $current; # current coroutine
45 45
46our $VERSION = '2.1'; 46our $VERSION = '3.0';
47 47
48our @EXPORT = qw(async cede schedule terminate current); 48our @EXPORT = qw(async cede schedule terminate current unblock_sub);
49our %EXPORT_TAGS = ( 49our %EXPORT_TAGS = (
50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
51); 51);
52our @EXPORT_OK = @{$EXPORT_TAGS{prio}}; 52our @EXPORT_OK = @{$EXPORT_TAGS{prio}};
53 53
57 57
58 # this way of handling attributes simply is NOT scalable ;() 58 # this way of handling attributes simply is NOT scalable ;()
59 sub import { 59 sub import {
60 no strict 'refs'; 60 no strict 'refs';
61 61
62 Coro->export_to_level(1, @_); 62 Coro->export_to_level (1, @_);
63 63
64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
66 my ($package, $ref) = (shift, shift); 66 my ($package, $ref) = (shift, shift);
67 my @attrs; 67 my @attrs;
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
100The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). 100The current coroutine (the last coroutine switched to). The initial value
101is C<$main> (of course).
102
103This variable is B<strictly> I<read-only>. It is provided for performance
104reasons. If performance is not essentiel you are encouraged to use the
105C<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...
105if ($current) {
106 $main->{specific} = $current->{specific}; 110$main->{specific} = $current->{specific}
107} 111 if $current;
108 112
109$current = $main; 113_set_current $main;
110 114
111sub current() { $current } 115sub current() { $current }
112 116
113=item $idle 117=item $idle
114 118
115The coroutine to switch to when no other coroutine is running. The default 119A callback that is called whenever the scheduler finds no ready coroutines
116implementation prints "FATAL: deadlock detected" and exits. 120to run. The default implementation prints "FATAL: deadlock detected" and
121exits, because the program has no other way to continue.
117 122
118=cut 123This hook is overwritten by modules such as C<Coro::Timer> and
124C<Coro::Event> to wait on an external event that hopefully wake up a
125coroutine so the scheduler can run it.
119 126
120# should be done using priorities :( 127Please note that if your callback recursively invokes perl (e.g. for event
121$idle = new Coro sub { 128handlers), then it must be prepared to be called recursively.
129
130=cut
131
132$idle = sub {
122 print STDERR "FATAL: deadlock detected\n"; 133 print STDERR "FATAL: deadlock detected\n";
123 exit(51); 134 exit (51);
124}; 135};
125 136
126# this coroutine is necessary because a coroutine 137# this coroutine is necessary because a coroutine
127# cannot destroy itself. 138# cannot destroy itself.
128my @destroy; 139my @destroy;
129my $manager;
130$manager = new Coro sub { 140my $manager; $manager = new Coro sub {
131 while () { 141 while () {
132 # by overwriting the state object with the manager we destroy it 142 # by overwriting the state object with the manager we destroy it
133 # while still being able to schedule this coroutine (in case it has 143 # while still being able to schedule this coroutine (in case it has
134 # been readied multiple times. this is harmless since the manager 144 # been readied multiple times. this is harmless since the manager
135 # can be called as many times as neccessary and will always 145 # can be called as many times as neccessary and will always
137 while (@destroy) { 147 while (@destroy) {
138 my $coro = pop @destroy; 148 my $coro = pop @destroy;
139 $coro->{status} ||= []; 149 $coro->{status} ||= [];
140 $_->ready for @{delete $coro->{join} || []}; 150 $_->ready for @{delete $coro->{join} || []};
141 151
142 # the next line destroys the _coro_state, but keeps the 152 # the next line destroys the coro state, but keeps the
143 # process itself intact (we basically make it a zombie 153 # coroutine itself intact (we basically make it a zombie
144 # process that always runs the manager thread, so it's possible 154 # coroutine that always runs the manager thread, so it's possible
145 # to transfer() to this process). 155 # to transfer() to this coroutine).
146 $coro->{_coro_state} = $manager->{_coro_state}; 156 $coro->_clone_state_from ($manager);
147 } 157 }
148 &schedule; 158 &schedule;
149 } 159 }
150}; 160};
151 161
153 163
154=back 164=back
155 165
156=head2 STATIC METHODS 166=head2 STATIC METHODS
157 167
158Static methods are actually functions that operate on the current process only. 168Static methods are actually functions that operate on the current coroutine only.
159 169
160=over 4 170=over 4
161 171
162=item async { ... } [@args...] 172=item async { ... } [@args...]
163 173
164Create a new asynchronous process and return it's process object 174Create a new asynchronous coroutine and return it's coroutine object
165(usually unused). When the sub returns the new process is automatically 175(usually unused). When the sub returns the new coroutine is automatically
166terminated. 176terminated.
177
178Calling C<exit> in a coroutine will not work correctly, so do not do that.
179
180When the coroutine dies, the program will exit, just as in the main
181program.
167 182
168 # create a new coroutine that just prints its arguments 183 # create a new coroutine that just prints its arguments
169 async { 184 async {
170 print "@_\n"; 185 print "@_\n";
171 } 1,2,3,4; 186 } 1,2,3,4;
172 187
173=cut 188=cut
174 189
175sub async(&@) { 190sub async(&@) {
176 my $pid = new Coro @_; 191 my $pid = new Coro @_;
177 $manager->ready; # this ensures that the stack is cloned from the manager
178 $pid->ready; 192 $pid->ready;
179 $pid; 193 $pid
180} 194}
181 195
182=item schedule 196=item schedule
183 197
184Calls the scheduler. Please note that the current process will not be put 198Calls the scheduler. Please note that the current coroutine will not be put
185into the ready queue, so calling this function usually means you will 199into the ready queue, so calling this function usually means you will
186never be called again. 200never be called again unless something else (e.g. an event handler) calls
201ready.
187 202
188=cut 203The canonical way to wait on external events is this:
204
205 {
206 # remember current coroutine
207 my $current = $Coro::current;
208
209 # register a hypothetical event handler
210 on_event_invoke sub {
211 # wake up sleeping coroutine
212 $current->ready;
213 undef $current;
214 };
215
216 # call schedule until event occured.
217 # in case we are woken up for other reasons
218 # (current still defined), loop.
219 Coro::schedule while $current;
220 }
189 221
190=item cede 222=item cede
191 223
192"Cede" to other processes. This function puts the current process into the 224"Cede" to other coroutines. This function puts the current coroutine into the
193ready queue and calls C<schedule>, which has the effect of giving up the 225ready queue and calls C<schedule>, which has the effect of giving up the
194current "timeslice" to other coroutines of the same or higher priority. 226current "timeslice" to other coroutines of the same or higher priority.
195 227
196=cut
197
198=item terminate [arg...] 228=item terminate [arg...]
199 229
200Terminates the current process with the given status values (see L<cancel>). 230Terminates the current coroutine with the given status values (see L<cancel>).
201 231
202=cut 232=cut
203 233
204sub terminate { 234sub terminate {
205 $current->cancel (@_); 235 $current->cancel (@_);
207 237
208=back 238=back
209 239
210# dynamic methods 240# dynamic methods
211 241
212=head2 PROCESS METHODS 242=head2 COROUTINE METHODS
213 243
214These are the methods you can call on process objects. 244These are the methods you can call on coroutine objects.
215 245
216=over 4 246=over 4
217 247
218=item new Coro \&sub [, @args...] 248=item new Coro \&sub [, @args...]
219 249
220Create a new process and return it. When the sub returns the process 250Create a new coroutine and return it. When the sub returns the coroutine
221automatically terminates as if C<terminate> with the returned values were 251automatically terminates as if C<terminate> with the returned values were
222called. To make the process run you must first put it into the ready queue 252called. To make the coroutine run you must first put it into the ready queue
223by calling the ready method. 253by calling the ready method.
224 254
225=cut 255Calling C<exit> in a coroutine will not work correctly, so do not do that.
226 256
257=cut
258
227sub _newcoro { 259sub _run_coro {
228 terminate &{+shift}; 260 terminate &{+shift};
229} 261}
230 262
231sub new { 263sub new {
232 my $class = shift; 264 my $class = shift;
233 bless {
234 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
235 }, $class;
236}
237 265
238=item $process->ready 266 $class->SUPER::new (\&_run_coro, @_)
267}
239 268
240Put the given process into the ready queue. 269=item $success = $coroutine->ready
241 270
242=cut 271Put the given coroutine into the ready queue (according to it's priority)
272and return true. If the coroutine is already in the ready queue, do nothing
273and return false.
243 274
275=item $is_ready = $coroutine->is_ready
276
277Return wether the coroutine is currently the ready queue or not,
278
244=item $process->cancel (arg...) 279=item $coroutine->cancel (arg...)
245 280
246Temrinates the given process and makes it return the given arguments as 281Terminates the given coroutine and makes it return the given arguments as
247status (default: the empty list). 282status (default: the empty list).
248 283
249=cut 284=cut
250 285
251sub cancel { 286sub cancel {
254 push @destroy, $self; 289 push @destroy, $self;
255 $manager->ready; 290 $manager->ready;
256 &schedule if $current == $self; 291 &schedule if $current == $self;
257} 292}
258 293
259=item $process->join 294=item $coroutine->join
260 295
261Wait until the coroutine terminates and return any values given to the 296Wait until the coroutine terminates and return any values given to the
262C<terminate> or C<cancel> functions. C<join> can be called multiple times 297C<terminate> or C<cancel> functions. C<join> can be called multiple times
263from multiple processes. 298from multiple coroutine.
264 299
265=cut 300=cut
266 301
267sub join { 302sub join {
268 my $self = shift; 303 my $self = shift;
271 &schedule; 306 &schedule;
272 } 307 }
273 wantarray ? @{$self->{status}} : $self->{status}[0]; 308 wantarray ? @{$self->{status}} : $self->{status}[0];
274} 309}
275 310
276=item $oldprio = $process->prio($newprio) 311=item $oldprio = $coroutine->prio ($newprio)
277 312
278Sets (or gets, if the argument is missing) the priority of the 313Sets (or gets, if the argument is missing) the priority of the
279process. Higher priority processes get run before lower priority 314coroutine. Higher priority coroutines get run before lower priority
280processes. Priorities are small signed integers (currently -4 .. +3), 315coroutines. Priorities are small signed integers (currently -4 .. +3),
281that you can refer to using PRIO_xxx constants (use the import tag :prio 316that you can refer to using PRIO_xxx constants (use the import tag :prio
282to get then): 317to get then):
283 318
284 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 319 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
285 3 > 1 > 0 > -1 > -3 > -4 320 3 > 1 > 0 > -1 > -3 > -4
288 current->prio(PRIO_HIGH); 323 current->prio(PRIO_HIGH);
289 324
290The idle coroutine ($Coro::idle) always has a lower priority than any 325The idle coroutine ($Coro::idle) always has a lower priority than any
291existing coroutine. 326existing coroutine.
292 327
293Changing the priority of the current process will take effect immediately, 328Changing the priority of the current coroutine will take effect immediately,
294but changing the priority of processes in the ready queue (but not 329but changing the priority of coroutines in the ready queue (but not
295running) will only take effect after the next schedule (of that 330running) will only take effect after the next schedule (of that
296process). This is a bug that will be fixed in some future version. 331coroutine). This is a bug that will be fixed in some future version.
297 332
298=cut
299
300sub prio {
301 my $old = $_[0]{prio};
302 $_[0]{prio} = $_[1] if @_ > 1;
303 $old;
304}
305
306=item $newprio = $process->nice($change) 333=item $newprio = $coroutine->nice ($change)
307 334
308Similar to C<prio>, but subtract the given value from the priority (i.e. 335Similar to C<prio>, but subtract the given value from the priority (i.e.
309higher values mean lower priority, just as in unix). 336higher values mean lower priority, just as in unix).
310 337
311=cut
312
313sub nice {
314 $_[0]{prio} -= $_[1];
315}
316
317=item $olddesc = $process->desc($newdesc) 338=item $olddesc = $coroutine->desc ($newdesc)
318 339
319Sets (or gets in case the argument is missing) the description for this 340Sets (or gets in case the argument is missing) the description for this
320process. This is just a free-form string you can associate with a process. 341coroutine. This is just a free-form string you can associate with a coroutine.
321 342
322=cut 343=cut
323 344
324sub desc { 345sub desc {
325 my $old = $_[0]{desc}; 346 my $old = $_[0]{desc};
327 $old; 348 $old;
328} 349}
329 350
330=back 351=back
331 352
353=head2 UTILITY FUNCTIONS
354
355=over 4
356
357=item unblock_sub { ... }
358
359This utility function takes a BLOCK or code reference and "unblocks" it,
360returning the new coderef. This means that the new coderef will return
361immediately without blocking, returning nothing, while the original code
362ref will be called (with parameters) from within its own coroutine.
363
364The reason this fucntion exists is that many event libraries (such as the
365venerable L<Event|Event> module) are not coroutine-safe (a weaker form
366of thread-safety). This means you must not block within event callbacks,
367otherwise you might suffer from crashes or worse.
368
369This function allows your callbacks to block by executing them in another
370coroutine where it is safe to block. One example where blocking is handy
371is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
372disk.
373
374In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
375creating event callbacks that want to block.
376
377=cut
378
379our @unblock_pool;
380our @unblock_queue;
381our $UNBLOCK_POOL_SIZE = 2;
382
383sub unblock_handler_ {
384 while () {
385 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
386 $cb->(@arg);
387
388 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
389 push @unblock_pool, $Coro::current;
390 schedule;
391 }
392}
393
394our $unblock_scheduler = async {
395 while () {
396 while (my $cb = pop @unblock_queue) {
397 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
398 $handler->{arg} = $cb;
399 $handler->ready;
400 cede;
401 }
402
403 schedule;
404 }
405};
406
407sub unblock_sub(&) {
408 my $cb = shift;
409
410 sub {
411 push @unblock_queue, [$cb, @_];
412 $unblock_scheduler->ready;
413 }
414}
415
416=back
417
332=cut 418=cut
333 419
3341; 4201;
335 421
336=head1 BUGS/LIMITATIONS 422=head1 BUGS/LIMITATIONS

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines