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

Comparing Coro/Coro.pm (file contents):
Revision 1.5 by root, Tue Jul 10 01:43:21 2001 UTC vs.
Revision 1.129 by root, Wed Sep 19 22:33:08 2007 UTC

1=head1 NAME 1=head1 NAME
2 2
3Coro - create and manage coroutines 3Coro - coroutine process abstraction
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use Coro; 7 use Coro;
8 8
9 $new = new Coro sub { 9 async {
10 print "in coroutine, switching back\n"; 10 # some asynchronous thread of execution
11 $Coro::main->resume;
12 print "in coroutine again, switching back\n";
13 $Coro::main->resume;
14 }; 11 };
15 12
16 print "in main, switching to coroutine\n"; 13 # alternatively create an async coroutine like this:
17 $new->resume; 14
18 print "back in main, switch to coroutine again\n"; 15 sub some_func : Coro {
19 $new->resume; 16 # some more async code
20 print "back in main\n"; 17 }
18
19 cede;
21 20
22=head1 DESCRIPTION 21=head1 DESCRIPTION
23 22
24This module implements coroutines. Coroutines, similar to continuations, 23This module collection manages coroutines. Coroutines are similar
25allow you to run more than one "thread of execution" in parallel. Unlike 24to threads but don't run in parallel at the same time even on SMP
26threads this, only voluntary switching is used so locking problems are 25machines. The specific flavor of coroutine used in this module also
27greatly reduced. 26guarantees you that it will not switch between coroutines unless
27necessary, at easily-identified points in your program, so locking and
28parallel access are rarely an issue, making coroutine programming much
29safer than threads programming.
28 30
29Although this is the "main" module of the Coro family it provides only 31(Perl, however, does not natively support real threads but instead does a
30low-level functionality. See L<Coro::Process> and related modules for a 32very slow and memory-intensive emulation of processes using threads. This
31more useful process abstraction including scheduling. 33is a performance win on Windows machines, and a loss everywhere else).
34
35In this module, coroutines are defined as "callchain + lexical variables +
36@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
37its own set of lexicals and its own set of perls most important global
38variables.
39
40=cut
41
42package Coro;
43
44use strict;
45no warnings "uninitialized";
46
47use Coro::State;
48
49use base qw(Coro::State Exporter);
50
51our $idle; # idle handler
52our $main; # main coroutine
53our $current; # current coroutine
54
55our $VERSION = '3.7';
56
57our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
58our %EXPORT_TAGS = (
59 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
60);
61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
62
63{
64 my @async;
65 my $init;
66
67 # this way of handling attributes simply is NOT scalable ;()
68 sub import {
69 no strict 'refs';
70
71 Coro->export_to_level (1, @_);
72
73 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
74 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
75 my ($package, $ref) = (shift, shift);
76 my @attrs;
77 for (@_) {
78 if ($_ eq "Coro") {
79 push @async, $ref;
80 unless ($init++) {
81 eval q{
82 sub INIT {
83 &async(pop @async) while @async;
84 }
85 };
86 }
87 } else {
88 push @attrs, $_;
89 }
90 }
91 return $old ? $old->($package, $ref, @attrs) : @attrs;
92 };
93 }
94
95}
32 96
33=over 4 97=over 4
34 98
35=cut
36
37package Coro;
38
39BEGIN {
40 $VERSION = 0.03;
41
42 require XSLoader;
43 XSLoader::load Coro, $VERSION;
44}
45
46=item $main 99=item $main
47 100
48This coroutine represents the main program. 101This coroutine represents the main program.
49 102
50=item $current 103=cut
51 104
105$main = new Coro;
106
107=item $current (or as function: current)
108
52The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). 109The current coroutine (the last coroutine switched to). The initial value
110is C<$main> (of course).
53 111
54=cut 112This variable is B<strictly> I<read-only>. It is provided for performance
113reasons. If performance is not essential you are encouraged to use the
114C<Coro::current> function instead.
55 115
56$main = $current = _newprocess { 116=cut
57 # never being called 117
118# maybe some other module used Coro::Specific before...
119$main->{specific} = $current->{specific}
120 if $current;
121
122_set_current $main;
123
124sub current() { $current }
125
126=item $idle
127
128A callback that is called whenever the scheduler finds no ready coroutines
129to run. The default implementation prints "FATAL: deadlock detected" and
130exits, because the program has no other way to continue.
131
132This hook is overwritten by modules such as C<Coro::Timer> and
133C<Coro::Event> to wait on an external event that hopefully wake up a
134coroutine so the scheduler can run it.
135
136Please note that if your callback recursively invokes perl (e.g. for event
137handlers), then it must be prepared to be called recursively.
138
139=cut
140
141$idle = sub {
142 require Carp;
143 Carp::croak ("FATAL: deadlock detected");
58}; 144};
59 145
60=item $error, $error_msg, $error_coro 146sub _cancel {
147 my ($self) = @_;
61 148
62This coroutine will be called on fatal errors. C<$error_msg> and 149 # free coroutine data and mark as destructed
63C<$error_coro> return the error message and the error-causing coroutine, 150 $self->_destroy
64respectively. 151 or return;
65 152
66=cut 153 # call all destruction callbacks
154 $_->(@{$self->{status}})
155 for @{(delete $self->{destroy_cb}) || []};
156}
67 157
68$error_msg = 158# this coroutine is necessary because a coroutine
69$error_coro = undef; 159# cannot destroy itself.
160my @destroy;
161my $manager;
70 162
71$error = _newprocess { 163$manager = new Coro sub {
72 print STDERR "FATAL: $error_msg\nprogram aborted\n"; 164 $current->desc ("[coro manager]");
73 exit 250; 165
166 while () {
167 (shift @destroy)->_cancel
168 while @destroy;
169
170 &schedule;
171 }
74}; 172};
75 173
76=item $coro = new $coderef [, @args] 174$manager->prio (PRIO_MAX);
77 175
78Create a new coroutine and return it. The first C<resume> call to this 176# static methods. not really.
79coroutine will start execution at the given coderef. If it returns it
80should return a coroutine to switch to. If, after returning, the coroutine
81is C<resume>d again it starts execution again at the givne coderef.
82 177
178=back
179
180=head2 STATIC METHODS
181
182Static methods are actually functions that operate on the current coroutine only.
183
184=over 4
185
186=item async { ... } [@args...]
187
188Create a new asynchronous coroutine and return it's coroutine object
189(usually unused). When the sub returns the new coroutine is automatically
190terminated.
191
192Calling C<exit> in a coroutine will do the same as calling exit outside
193the coroutine. Likewise, when the coroutine dies, the program will exit,
194just as it would in the main program.
195
196 # create a new coroutine that just prints its arguments
197 async {
198 print "@_\n";
199 } 1,2,3,4;
200
83=cut 201=cut
202
203sub async(&@) {
204 my $coro = new Coro @_;
205 $coro->ready;
206 $coro
207}
208
209=item async_pool { ... } [@args...]
210
211Similar to C<async>, but uses a coroutine pool, so you should not call
212terminate or join (although you are allowed to), and you get a coroutine
213that might have executed other code already (which can be good or bad :).
214
215Also, the block is executed in an C<eval> context and a warning will be
216issued in case of an exception instead of terminating the program, as
217C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
218will not work in the expected way, unless you call terminate or cancel,
219which somehow defeats the purpose of pooling.
220
221The priority will be reset to C<0> after each job, otherwise the coroutine
222will be re-used "as-is".
223
224The pool size is limited to 8 idle coroutines (this can be adjusted by
225changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
226required.
227
228If you are concerned about pooled coroutines growing a lot because a
229single C<async_pool> used a lot of stackspace you can e.g. C<async_pool {
230terminate }> once per second or so to slowly replenish the pool.
231
232=cut
233
234our $POOL_SIZE = 8;
235our @pool;
236
237sub pool_handler {
238 while () {
239 $current->{desc} = "[async_pool]";
240
241 eval {
242 my ($cb, @arg) = @{ delete $current->{_invoke} or return };
243 $cb->(@arg);
244 };
245 warn $@ if $@;
246
247 last if @pool >= $POOL_SIZE;
248
249 push @pool, $current;
250 $current->{desc} = "[async_pool idle]";
251 $current->save (Coro::State::SAVE_DEF);
252 $current->prio (0);
253 schedule;
254 }
255}
256
257sub async_pool(&@) {
258 # this is also inlined into the unlock_scheduler
259 my $coro = (pop @pool) || new Coro \&pool_handler;;
260
261 $coro->{_invoke} = [@_];
262 $coro->ready;
263
264 $coro
265}
266
267=item schedule
268
269Calls the scheduler. Please note that the current coroutine will not be put
270into the ready queue, so calling this function usually means you will
271never be called again unless something else (e.g. an event handler) calls
272ready.
273
274The canonical way to wait on external events is this:
275
276 {
277 # remember current coroutine
278 my $current = $Coro::current;
279
280 # register a hypothetical event handler
281 on_event_invoke sub {
282 # wake up sleeping coroutine
283 $current->ready;
284 undef $current;
285 };
286
287 # call schedule until event occurred.
288 # in case we are woken up for other reasons
289 # (current still defined), loop.
290 Coro::schedule while $current;
291 }
292
293=item cede
294
295"Cede" to other coroutines. This function puts the current coroutine into the
296ready queue and calls C<schedule>, which has the effect of giving up the
297current "timeslice" to other coroutines of the same or higher priority.
298
299Returns true if at least one coroutine switch has happened.
300
301=item Coro::cede_notself
302
303Works like cede, but is not exported by default and will cede to any
304coroutine, regardless of priority, once.
305
306Returns true if at least one coroutine switch has happened.
307
308=item terminate [arg...]
309
310Terminates the current coroutine with the given status values (see L<cancel>).
311
312=cut
313
314sub terminate {
315 $current->cancel (@_);
316}
317
318=back
319
320# dynamic methods
321
322=head2 COROUTINE METHODS
323
324These are the methods you can call on coroutine objects.
325
326=over 4
327
328=item new Coro \&sub [, @args...]
329
330Create a new coroutine and return it. When the sub returns the coroutine
331automatically terminates as if C<terminate> with the returned values were
332called. To make the coroutine run you must first put it into the ready queue
333by calling the ready method.
334
335See C<async> for additional discussion.
336
337=cut
338
339sub _run_coro {
340 terminate &{+shift};
341}
84 342
85sub new { 343sub new {
86 my $class = $_[0]; 344 my $class = shift;
87 my $proc = $_[1]; 345
88 bless _newprocess { 346 $class->SUPER::new (\&_run_coro, @_)
89 do { 347}
90 eval { &$proc->resume }; 348
91 if ($@) { 349=item $success = $coroutine->ready
92 ($error_msg, $error_coro) = ($@, $current); 350
93 $error->resume; 351Put the given coroutine into the ready queue (according to it's priority)
352and return true. If the coroutine is already in the ready queue, do nothing
353and return false.
354
355=item $is_ready = $coroutine->is_ready
356
357Return wether the coroutine is currently the ready queue or not,
358
359=item $coroutine->cancel (arg...)
360
361Terminates the given coroutine and makes it return the given arguments as
362status (default: the empty list). Never returns if the coroutine is the
363current coroutine.
364
365=cut
366
367sub cancel {
368 my $self = shift;
369 $self->{status} = [@_];
370
371 if ($current == $self) {
372 push @destroy, $self;
373 $manager->ready;
374 &schedule while 1;
375 } else {
376 $self->_cancel;
377 }
378}
379
380=item $coroutine->join
381
382Wait until the coroutine terminates and return any values given to the
383C<terminate> or C<cancel> functions. C<join> can be called multiple times
384from multiple coroutine.
385
386=cut
387
388sub join {
389 my $self = shift;
390
391 unless ($self->{status}) {
392 my $current = $current;
393
394 push @{$self->{destroy_cb}}, sub {
395 $current->ready;
396 undef $current;
397 };
398
399 &schedule while $current;
400 }
401
402 wantarray ? @{$self->{status}} : $self->{status}[0];
403}
404
405=item $coroutine->on_destroy (\&cb)
406
407Registers a callback that is called when this coroutine gets destroyed,
408but before it is joined. The callback gets passed the terminate arguments,
409if any.
410
411=cut
412
413sub on_destroy {
414 my ($self, $cb) = @_;
415
416 push @{ $self->{destroy_cb} }, $cb;
417}
418
419=item $oldprio = $coroutine->prio ($newprio)
420
421Sets (or gets, if the argument is missing) the priority of the
422coroutine. Higher priority coroutines get run before lower priority
423coroutines. Priorities are small signed integers (currently -4 .. +3),
424that you can refer to using PRIO_xxx constants (use the import tag :prio
425to get then):
426
427 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
428 3 > 1 > 0 > -1 > -3 > -4
429
430 # set priority to HIGH
431 current->prio(PRIO_HIGH);
432
433The idle coroutine ($Coro::idle) always has a lower priority than any
434existing coroutine.
435
436Changing the priority of the current coroutine will take effect immediately,
437but changing the priority of coroutines in the ready queue (but not
438running) will only take effect after the next schedule (of that
439coroutine). This is a bug that will be fixed in some future version.
440
441=item $newprio = $coroutine->nice ($change)
442
443Similar to C<prio>, but subtract the given value from the priority (i.e.
444higher values mean lower priority, just as in unix).
445
446=item $olddesc = $coroutine->desc ($newdesc)
447
448Sets (or gets in case the argument is missing) the description for this
449coroutine. This is just a free-form string you can associate with a coroutine.
450
451=cut
452
453sub desc {
454 my $old = $_[0]{desc};
455 $_[0]{desc} = $_[1] if @_ > 1;
456 $old;
457}
458
459=back
460
461=head2 GLOBAL FUNCTIONS
462
463=over 4
464
465=item Coro::nready
466
467Returns the number of coroutines that are currently in the ready state,
468i.e. that can be switched to. The value C<0> means that the only runnable
469coroutine is the currently running one, so C<cede> would have no effect,
470and C<schedule> would cause a deadlock unless there is an idle handler
471that wakes up some coroutines.
472
473=item my $guard = Coro::guard { ... }
474
475This creates and returns a guard object. Nothing happens until the object
476gets destroyed, in which case the codeblock given as argument will be
477executed. This is useful to free locks or other resources in case of a
478runtime error or when the coroutine gets canceled, as in both cases the
479guard block will be executed. The guard object supports only one method,
480C<< ->cancel >>, which will keep the codeblock from being executed.
481
482Example: set some flag and clear it again when the coroutine gets canceled
483or the function returns:
484
485 sub do_something {
486 my $guard = Coro::guard { $busy = 0 };
487 $busy = 1;
488
489 # do something that requires $busy to be true
490 }
491
492=cut
493
494sub guard(&) {
495 bless \(my $cb = $_[0]), "Coro::guard"
496}
497
498sub Coro::guard::cancel {
499 ${$_[0]} = sub { };
500}
501
502sub Coro::guard::DESTROY {
503 ${$_[0]}->();
504}
505
506
507=item unblock_sub { ... }
508
509This utility function takes a BLOCK or code reference and "unblocks" it,
510returning the new coderef. This means that the new coderef will return
511immediately without blocking, returning nothing, while the original code
512ref will be called (with parameters) from within its own coroutine.
513
514The reason this function exists is that many event libraries (such as the
515venerable L<Event|Event> module) are not coroutine-safe (a weaker form
516of thread-safety). This means you must not block within event callbacks,
517otherwise you might suffer from crashes or worse.
518
519This function allows your callbacks to block by executing them in another
520coroutine where it is safe to block. One example where blocking is handy
521is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
522disk.
523
524In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
525creating event callbacks that want to block.
526
527=cut
528
529our @unblock_queue;
530
531# we create a special coro because we want to cede,
532# to reduce pressure on the coro pool (because most callbacks
533# return immediately and can be reused) and because we cannot cede
534# inside an event callback.
535our $unblock_scheduler = async {
536 $current->desc ("[unblock_sub scheduler]");
537 while () {
538 while (my $cb = pop @unblock_queue) {
539 # this is an inlined copy of async_pool
540 my $coro = (pop @pool or new Coro \&pool_handler);
541
542 $coro->{_invoke} = $cb;
543 $coro->ready;
544 cede; # for short-lived callbacks, this reduces pressure on the coro pool
94 } 545 }
95 } while (1); 546 schedule; # sleep well
96 }, $class; 547 }
97} 548};
98 549
99=item $coro->resume 550sub unblock_sub(&) {
551 my $cb = shift;
100 552
101Resume execution at the given coroutine. 553 sub {
102 554 unshift @unblock_queue, [$cb, @_];
103=cut 555 $unblock_scheduler->ready;
104 556 }
105my $prev;
106
107# I call the _transfer function from a pelr function
108# because that way perl saves all important things on
109# the stack.
110sub resume {
111 $prev = $current; $current = $_[0];
112 _transfer($prev, $current);
113} 557}
558
559=back
560
561=cut
114 562
1151; 5631;
116 564
117=back 565=head1 BUGS/LIMITATIONS
118 566
119=head1 BUGS 567 - you must make very sure that no coro is still active on global
568 destruction. very bad things might happen otherwise (usually segfaults).
120 569
121This module has not yet been extensively tested. 570 - this module is not thread-safe. You should only ever use this module
571 from the same thread (this requirement might be loosened in the future
572 to allow per-thread schedulers, but Coro::State does not yet allow
573 this).
122 574
123=head1 SEE ALSO 575=head1 SEE ALSO
124 576
125L<Coro::Process>, L<Coro::Signal>. 577Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
578
579Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
580
581Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
582
583Embedding: L<Coro:MakeMaker>
126 584
127=head1 AUTHOR 585=head1 AUTHOR
128 586
129 Marc Lehmann <pcg@goof.com> 587 Marc Lehmann <schmorp@schmorp.de>
130 http://www.goof.com/pcg/marc/ 588 http://home.schmorp.de/
131 589
132=cut 590=cut
133 591

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines