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

Comparing Coro/Coro.pm (file contents):
Revision 1.2 by root, Tue Jul 3 03:40:07 2001 UTC vs.
Revision 1.86 by root, Sat Nov 25 01:14:11 2006 UTC

1=head1 NAME 1=head1 NAME
2 2
3Coro - create an 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 process 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 to
25allow you to run more than one "thread of execution" in parallel. Unlike 24threads but don't run in parallel.
26threads this, only voluntary switching is used so locking problems are
27greatly reduced.
28 25
29Although this is the "main" module of the Coro family it provides only 26In this module, coroutines are defined as "callchain + lexical variables
30low-level functionality. See L<Coro::Process> and related modules for a 27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own
31more useful process abstraction including scheduling. 28callchain, it's own set of lexicals and it's own set of perl's most
29important global variables.
30
31=cut
32
33package Coro;
34
35use strict;
36no warnings "uninitialized";
37
38use Coro::State;
39
40use base qw(Coro::State Exporter);
41
42our $idle; # idle handler
43our $main; # main coroutine
44our $current; # current coroutine
45
46our $VERSION = '2.5';
47
48our @EXPORT = qw(async cede schedule terminate current);
49our %EXPORT_TAGS = (
50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
51);
52our @EXPORT_OK = @{$EXPORT_TAGS{prio}};
53
54{
55 my @async;
56 my $init;
57
58 # this way of handling attributes simply is NOT scalable ;()
59 sub import {
60 no strict 'refs';
61
62 Coro->export_to_level(1, @_);
63
64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
66 my ($package, $ref) = (shift, shift);
67 my @attrs;
68 for (@_) {
69 if ($_ eq "Coro") {
70 push @async, $ref;
71 unless ($init++) {
72 eval q{
73 sub INIT {
74 &async(pop @async) while @async;
75 }
76 };
77 }
78 } else {
79 push @attrs, $_;
80 }
81 }
82 return $old ? $old->($package, $ref, @attrs) : @attrs;
83 };
84 }
85
86}
32 87
33=over 4 88=over 4
34 89
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 90=item $main
47 91
48This coroutine represents the main program. 92This coroutine represents the main program.
49 93
50=item $current 94=cut
51 95
96$main = new Coro;
97
98=item $current (or as function: current)
99
52The 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).
53 102
54=cut 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.
55 106
56$main = $current = _newprocess { 107=cut
57 # never being called 108
109# maybe some other module used Coro::Specific before...
110if ($current) {
111 $main->{specific} = $current->{specific};
112}
113
114$current = $main;
115
116sub current() { $current }
117
118=item $idle
119
120A callback that is called whenever the scheduler finds no ready coroutines
121to run. The default implementation prints "FATAL: deadlock detected" and
122exits.
123
124This hook is overwritten by modules such as C<Coro::Timer> and
125C<Coro::Event> to wait on an external event that hopefully wakes up some
126coroutine.
127
128=cut
129
130$idle = sub {
131 print STDERR "FATAL: deadlock detected\n";
132 exit (51);
58}; 133};
59 134
60=item $error, $error_msg, $error_coro 135# this coroutine is necessary because a coroutine
136# cannot destroy itself.
137my @destroy;
138my $manager; $manager = new Coro sub {
139 while () {
140 # by overwriting the state object with the manager we destroy it
141 # while still being able to schedule this coroutine (in case it has
142 # been readied multiple times. this is harmless since the manager
143 # can be called as many times as neccessary and will always
144 # remove itself from the runqueue
145 while (@destroy) {
146 my $coro = pop @destroy;
147 $coro->{status} ||= [];
148 $_->ready for @{delete $coro->{join} || []};
61 149
62This coroutine will be called on fatal errors. C<$error_msg> and 150 # the next line destroys the coro state, but keeps the
63C<$error_coro> return the error message and the error-causing coroutine, 151 # process itself intact (we basically make it a zombie
64respectively. 152 # process that always runs the manager thread, so it's possible
65 153 # to transfer() to this process).
66=cut 154 $coro->_clone_state_from ($manager);
67 155 }
68$error_msg = 156 &schedule;
69$error_coro = undef; 157 }
70
71$error = _newprocess {
72 print STDERR "FATAL: $error_msg\nprogram aborted\n";
73 exit 250;
74}; 158};
75 159
76=item $coro = new $coderef [, @args] 160# static methods. not really.
77 161
78Create a new coroutine and return it. The first C<resume> call to this 162=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 163
164=head2 STATIC METHODS
165
166Static methods are actually functions that operate on the current process only.
167
168=over 4
169
170=item async { ... } [@args...]
171
172Create a new asynchronous process and return it's process object
173(usually unused). When the sub returns the new process is automatically
174terminated.
175
176When the coroutine dies, the program will exit, just as in the main
177program.
178
179 # create a new coroutine that just prints its arguments
180 async {
181 print "@_\n";
182 } 1,2,3,4;
183
83=cut 184=cut
185
186sub async(&@) {
187 my $pid = new Coro @_;
188 $pid->ready;
189 $pid
190}
191
192=item schedule
193
194Calls the scheduler. Please note that the current process will not be put
195into the ready queue, so calling this function usually means you will
196never be called again.
197
198=cut
199
200=item cede
201
202"Cede" to other processes. This function puts the current process into the
203ready queue and calls C<schedule>, which has the effect of giving up the
204current "timeslice" to other coroutines of the same or higher priority.
205
206=cut
207
208=item terminate [arg...]
209
210Terminates the current process with the given status values (see L<cancel>).
211
212=cut
213
214sub terminate {
215 $current->cancel (@_);
216}
217
218=back
219
220# dynamic methods
221
222=head2 PROCESS METHODS
223
224These are the methods you can call on process objects.
225
226=over 4
227
228=item new Coro \&sub [, @args...]
229
230Create a new process and return it. When the sub returns the process
231automatically terminates as if C<terminate> with the returned values were
232called. To make the process run you must first put it into the ready queue
233by calling the ready method.
234
235=cut
236
237sub _new_coro {
238 $current->_clear_idle_sp; # (re-)set the idle sp on the following cede
239 _set_cede_self; # ensures that cede cede's us first
240 cede;
241 terminate &{+shift};
242}
84 243
85sub new { 244sub new {
86 my $class = $_[0]; 245 my $class = shift;
87 my $proc = $_[1];
88 bless _newprocess {
89 do {
90 eval { &$proc->resume };
91 if ($@) {
92 ($error_msg, $error_coro) = ($@, $current);
93 $error->resume;
94 }
95 } while ();
96 }, $class;
97}
98 246
99=item $coro->resume 247 $class->SUPER::new (\&_new_coro, @_)
100
101Resume execution at the given coroutine.
102
103=cut
104
105my $prev;
106
107sub resume {
108 $prev = $current; $current = $_[0];
109 _transfer($prev, $current);
110} 248}
249
250=item $process->ready
251
252Put the given process into the ready queue.
253
254=cut
255
256=item $process->cancel (arg...)
257
258Terminates the given process and makes it return the given arguments as
259status (default: the empty list).
260
261=cut
262
263sub cancel {
264 my $self = shift;
265 $self->{status} = [@_];
266 push @destroy, $self;
267 $manager->ready;
268 &schedule if $current == $self;
269}
270
271=item $process->join
272
273Wait until the coroutine terminates and return any values given to the
274C<terminate> or C<cancel> functions. C<join> can be called multiple times
275from multiple processes.
276
277=cut
278
279sub join {
280 my $self = shift;
281 unless ($self->{status}) {
282 push @{$self->{join}}, $current;
283 &schedule;
284 }
285 wantarray ? @{$self->{status}} : $self->{status}[0];
286}
287
288=item $oldprio = $process->prio ($newprio)
289
290Sets (or gets, if the argument is missing) the priority of the
291process. Higher priority processes get run before lower priority
292processes. Priorities are small signed integers (currently -4 .. +3),
293that you can refer to using PRIO_xxx constants (use the import tag :prio
294to get then):
295
296 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
297 3 > 1 > 0 > -1 > -3 > -4
298
299 # set priority to HIGH
300 current->prio(PRIO_HIGH);
301
302The idle coroutine ($Coro::idle) always has a lower priority than any
303existing coroutine.
304
305Changing the priority of the current process will take effect immediately,
306but changing the priority of processes in the ready queue (but not
307running) will only take effect after the next schedule (of that
308process). This is a bug that will be fixed in some future version.
309
310=item $newprio = $process->nice ($change)
311
312Similar to C<prio>, but subtract the given value from the priority (i.e.
313higher values mean lower priority, just as in unix).
314
315=item $olddesc = $process->desc ($newdesc)
316
317Sets (or gets in case the argument is missing) the description for this
318process. This is just a free-form string you can associate with a process.
319
320=cut
321
322sub desc {
323 my $old = $_[0]{desc};
324 $_[0]{desc} = $_[1] if @_ > 1;
325 $old;
326}
327
328=back
329
330=cut
111 331
1121; 3321;
113 333
114=back 334=head1 BUGS/LIMITATIONS
115 335
116=head1 BUGS 336 - you must make very sure that no coro is still active on global
337 destruction. very bad things might happen otherwise (usually segfaults).
117 338
118This module has not yet been extensively tested. 339 - this module is not thread-safe. You should only ever use this module
340 from the same thread (this requirement might be losened in the future
341 to allow per-thread schedulers, but Coro::State does not yet allow
342 this).
119 343
120=head1 SEE ALSO 344=head1 SEE ALSO
121 345
122L<Coro::Process>, L<Coro::Signal>. 346Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
347
348Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
349
350Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
351
352Embedding: L<Coro:MakeMaker>
123 353
124=head1 AUTHOR 354=head1 AUTHOR
125 355
126 Marc Lehmann <pcg@goof.com> 356 Marc Lehmann <schmorp@schmorp.de>
127 http://www.goof.com/pcg/marc/ 357 http://home.schmorp.de/
128 358
129=cut 359=cut
130 360

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines