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

Comparing Coro/Coro.pm (file contents):
Revision 1.4 by root, Tue Jul 3 05:05:45 2001 UTC vs.
Revision 1.99 by root, Tue Dec 5 12:50:04 2006 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 use din this module also
27greatly reduced. 26guarentees 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.11';
56
57our @EXPORT = qw(async 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.01;
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 essentiel 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 146# this coroutine is necessary because a coroutine
147# cannot destroy itself.
148my @destroy;
149my $manager; $manager = new Coro sub {
150 while () {
151 # by overwriting the state object with the manager we destroy it
152 # while still being able to schedule this coroutine (in case it has
153 # been readied multiple times. this is harmless since the manager
154 # can be called as many times as neccessary and will always
155 # remove itself from the runqueue
156 while (@destroy) {
157 my $coro = pop @destroy;
158 $coro->{status} ||= [];
159 $_->ready for @{delete $coro->{join} || []};
61 160
62This coroutine will be called on fatal errors. C<$error_msg> and 161 # the next line destroys the coro state, but keeps the
63C<$error_coro> return the error message and the error-causing coroutine, 162 # coroutine itself intact (we basically make it a zombie
64respectively. 163 # coroutine that always runs the manager thread, so it's possible
65 164 # to transfer() to this coroutine).
66=cut 165 $coro->_clone_state_from ($manager);
67 166 }
68$error_msg = 167 &schedule;
69$error_coro = undef; 168 }
70
71$error = _newprocess {
72 print STDERR "FATAL: $error_msg\nprogram aborted\n";
73 exit 250;
74}; 169};
75 170
76=item $coro = new $coderef [, @args] 171# static methods. not really.
77 172
78Create a new coroutine and return it. The first C<resume> call to this 173=back
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 174
175=head2 STATIC METHODS
176
177Static methods are actually functions that operate on the current coroutine only.
178
179=over 4
180
181=item async { ... } [@args...]
182
183Create a new asynchronous coroutine and return it's coroutine object
184(usually unused). When the sub returns the new coroutine is automatically
185terminated.
186
187Calling C<exit> in a coroutine will not work correctly, so do not do that.
188
189When the coroutine dies, the program will exit, just as in the main
190program.
191
192 # create a new coroutine that just prints its arguments
193 async {
194 print "@_\n";
195 } 1,2,3,4;
196
83=cut 197=cut
198
199sub async(&@) {
200 my $pid = new Coro @_;
201 $pid->ready;
202 $pid
203}
204
205=item schedule
206
207Calls the scheduler. Please note that the current coroutine will not be put
208into the ready queue, so calling this function usually means you will
209never be called again unless something else (e.g. an event handler) calls
210ready.
211
212The canonical way to wait on external events is this:
213
214 {
215 # remember current coroutine
216 my $current = $Coro::current;
217
218 # register a hypothetical event handler
219 on_event_invoke sub {
220 # wake up sleeping coroutine
221 $current->ready;
222 undef $current;
223 };
224
225 # call schedule until event occured.
226 # in case we are woken up for other reasons
227 # (current still defined), loop.
228 Coro::schedule while $current;
229 }
230
231=item cede
232
233"Cede" to other coroutines. This function puts the current coroutine into the
234ready queue and calls C<schedule>, which has the effect of giving up the
235current "timeslice" to other coroutines of the same or higher priority.
236
237=item terminate [arg...]
238
239Terminates the current coroutine with the given status values (see L<cancel>).
240
241=cut
242
243sub terminate {
244 $current->cancel (@_);
245}
246
247=back
248
249# dynamic methods
250
251=head2 COROUTINE METHODS
252
253These are the methods you can call on coroutine objects.
254
255=over 4
256
257=item new Coro \&sub [, @args...]
258
259Create a new coroutine and return it. When the sub returns the coroutine
260automatically terminates as if C<terminate> with the returned values were
261called. To make the coroutine run you must first put it into the ready queue
262by calling the ready method.
263
264Calling C<exit> in a coroutine will not work correctly, so do not do that.
265
266=cut
267
268sub _run_coro {
269 terminate &{+shift};
270}
84 271
85sub new { 272sub new {
86 my $class = $_[0]; 273 my $class = shift;
87 my $proc = $_[1]; 274
88 bless _newprocess { 275 $class->SUPER::new (\&_run_coro, @_)
89 do { 276}
90 eval { &$proc->resume }; 277
91 if ($@) { 278=item $success = $coroutine->ready
92 ($error_msg, $error_coro) = ($@, $current); 279
93 $error->resume; 280Put the given coroutine into the ready queue (according to it's priority)
281and return true. If the coroutine is already in the ready queue, do nothing
282and return false.
283
284=item $is_ready = $coroutine->is_ready
285
286Return wether the coroutine is currently the ready queue or not,
287
288=item $coroutine->cancel (arg...)
289
290Terminates the given coroutine and makes it return the given arguments as
291status (default: the empty list).
292
293=cut
294
295sub cancel {
296 my $self = shift;
297 $self->{status} = [@_];
298 push @destroy, $self;
299 $manager->ready;
300 &schedule if $current == $self;
301}
302
303=item $coroutine->join
304
305Wait until the coroutine terminates and return any values given to the
306C<terminate> or C<cancel> functions. C<join> can be called multiple times
307from multiple coroutine.
308
309=cut
310
311sub join {
312 my $self = shift;
313 unless ($self->{status}) {
314 push @{$self->{join}}, $current;
315 &schedule;
316 }
317 wantarray ? @{$self->{status}} : $self->{status}[0];
318}
319
320=item $oldprio = $coroutine->prio ($newprio)
321
322Sets (or gets, if the argument is missing) the priority of the
323coroutine. Higher priority coroutines get run before lower priority
324coroutines. Priorities are small signed integers (currently -4 .. +3),
325that you can refer to using PRIO_xxx constants (use the import tag :prio
326to get then):
327
328 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
329 3 > 1 > 0 > -1 > -3 > -4
330
331 # set priority to HIGH
332 current->prio(PRIO_HIGH);
333
334The idle coroutine ($Coro::idle) always has a lower priority than any
335existing coroutine.
336
337Changing the priority of the current coroutine will take effect immediately,
338but changing the priority of coroutines in the ready queue (but not
339running) will only take effect after the next schedule (of that
340coroutine). This is a bug that will be fixed in some future version.
341
342=item $newprio = $coroutine->nice ($change)
343
344Similar to C<prio>, but subtract the given value from the priority (i.e.
345higher values mean lower priority, just as in unix).
346
347=item $olddesc = $coroutine->desc ($newdesc)
348
349Sets (or gets in case the argument is missing) the description for this
350coroutine. This is just a free-form string you can associate with a coroutine.
351
352=cut
353
354sub desc {
355 my $old = $_[0]{desc};
356 $_[0]{desc} = $_[1] if @_ > 1;
357 $old;
358}
359
360=back
361
362=head2 GLOBAL FUNCTIONS
363
364=over 4
365
366=item Coro::nready
367
368Returns the number of coroutines that are currently in the ready state,
369i.e. that can be swicthed to. The value C<0> means that the only runnable
370coroutine is the currently running one, so C<cede> would have no effect,
371and C<schedule> would cause a deadlock unless there is an idle handler
372that wakes up some coroutines.
373
374=item unblock_sub { ... }
375
376This utility function takes a BLOCK or code reference and "unblocks" it,
377returning the new coderef. This means that the new coderef will return
378immediately without blocking, returning nothing, while the original code
379ref will be called (with parameters) from within its own coroutine.
380
381The reason this fucntion exists is that many event libraries (such as the
382venerable L<Event|Event> module) are not coroutine-safe (a weaker form
383of thread-safety). This means you must not block within event callbacks,
384otherwise you might suffer from crashes or worse.
385
386This function allows your callbacks to block by executing them in another
387coroutine where it is safe to block. One example where blocking is handy
388is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
389disk.
390
391In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
392creating event callbacks that want to block.
393
394=cut
395
396our @unblock_pool;
397our @unblock_queue;
398our $UNBLOCK_POOL_SIZE = 2;
399
400sub unblock_handler_ {
401 while () {
402 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
403 $cb->(@arg);
404
405 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
406 push @unblock_pool, $Coro::current;
407 schedule;
408 }
409}
410
411our $unblock_scheduler = async {
412 while () {
413 while (my $cb = pop @unblock_queue) {
414 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
415 $handler->{arg} = $cb;
416 $handler->ready;
417 cede;
94 } 418 }
95 } while (1);
96 }, $class;
97}
98 419
99=item $coro->resume 420 schedule;
421 }
422};
100 423
101Resume execution at the given coroutine. 424sub unblock_sub(&) {
425 my $cb = shift;
102 426
103=cut 427 sub {
104 428 push @unblock_queue, [$cb, @_];
105my $prev; 429 $unblock_scheduler->ready;
106 430 }
107sub resume {
108 $prev = $current; $current = $_[0];
109 _transfer($prev, $current);
110} 431}
432
433=back
434
435=cut
111 436
1121; 4371;
113 438
114=back 439=head1 BUGS/LIMITATIONS
115 440
116=head1 BUGS 441 - you must make very sure that no coro is still active on global
442 destruction. very bad things might happen otherwise (usually segfaults).
117 443
118This module has not yet been extensively tested. 444 - this module is not thread-safe. You should only ever use this module
445 from the same thread (this requirement might be losened in the future
446 to allow per-thread schedulers, but Coro::State does not yet allow
447 this).
119 448
120=head1 SEE ALSO 449=head1 SEE ALSO
121 450
122L<Coro::Process>, L<Coro::Signal>. 451Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
452
453Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
454
455Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
456
457Embedding: L<Coro:MakeMaker>
123 458
124=head1 AUTHOR 459=head1 AUTHOR
125 460
126 Marc Lehmann <pcg@goof.com> 461 Marc Lehmann <schmorp@schmorp.de>
127 http://www.goof.com/pcg/marc/ 462 http://home.schmorp.de/
128 463
129=cut 464=cut
130 465

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines