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

Comparing Coro/Coro.pm (file contents):
Revision 1.23 by root, Mon Jul 23 04:23:32 2001 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
19 cede; 19 cede;
20 20
21=head1 DESCRIPTION 21=head1 DESCRIPTION
22 22
23This module collection manages coroutines. Coroutines are similar to 23This module collection manages coroutines. Coroutines are similar to
24Threads but don't run in parallel. 24threads but don't run in parallel.
25
26This module is still experimental, see the BUGS section below.
27 25
28In this module, coroutines are defined as "callchain + lexical variables 26In this module, coroutines are defined as "callchain + lexical variables
29+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own 27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own
30callchain, it's own set of lexicals and it's own set of perl's most 28callchain, it's own set of lexicals and it's own set of perl's most
31important global variables. 29important global variables.
32 30
33=cut 31=cut
34 32
35package Coro; 33package Coro;
36 34
35use strict;
36no warnings "uninitialized";
37
37use Coro::State; 38use Coro::State;
38 39
39use base Exporter; 40use base qw(Coro::State Exporter);
40 41
41$VERSION = 0.10; 42our $idle; # idle handler
43our $main; # main coroutine
44our $current; # current coroutine
42 45
46our $VERSION = '3.0';
47
43@EXPORT = qw(async cede schedule terminate current); 48our @EXPORT = qw(async cede schedule terminate current unblock_sub);
44@EXPORT_OK = qw($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}};
45 53
46{ 54{
47 my @async; 55 my @async;
56 my $init;
48 57
49 # this way of handling attributes simply is NOT scalable ;() 58 # this way of handling attributes simply is NOT scalable ;()
50 sub import { 59 sub import {
60 no strict 'refs';
61
51 Coro->export_to_level(1, @_); 62 Coro->export_to_level (1, @_);
63
52 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
53 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
54 my ($package, $ref) = (shift, shift); 66 my ($package, $ref) = (shift, shift);
55 my @attrs; 67 my @attrs;
56 for (@_) { 68 for (@_) {
57 if ($_ eq "Coro") { 69 if ($_ eq "Coro") {
58 push @async, $ref; 70 push @async, $ref;
71 unless ($init++) {
72 eval q{
73 sub INIT {
74 &async(pop @async) while @async;
75 }
76 };
77 }
59 } else { 78 } else {
60 push @attrs, $_; 79 push @attrs, $_;
61 } 80 }
62 } 81 }
63 return $old ? $old->($package, $ref, @attrs) : @attrs; 82 return $old ? $old->($package, $ref, @attrs) : @attrs;
64 }; 83 };
65 } 84 }
66 85
67 sub INIT {
68 &async(pop @async) while @async;
69 }
70} 86}
87
88=over 4
71 89
72=item $main 90=item $main
73 91
74This coroutine represents the main program. 92This coroutine represents the main program.
75 93
76=cut 94=cut
77 95
78our $main = new Coro; 96$main = new Coro;
79 97
80=item $current (or as function: current) 98=item $current (or as function: current)
81 99
82The 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.
83 106
84=cut 107=cut
85 108
86# maybe some other module used Coro::Specific before... 109# maybe some other module used Coro::Specific before...
87if ($current) {
88 $main->{specific} = $current->{specific}; 110$main->{specific} = $current->{specific}
89} 111 if $current;
90 112
91our $current = $main; 113_set_current $main;
92 114
93sub current() { $current } 115sub current() { $current }
94 116
95=item $idle 117=item $idle
96 118
97The coroutine to switch to when no other coroutine is running. The default 119A callback that is called whenever the scheduler finds no ready coroutines
98implementation 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.
99 122
100=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.
101 126
102# should be done using priorities :( 127Please note that if your callback recursively invokes perl (e.g. for event
103our $idle = new Coro sub { 128handlers), then it must be prepared to be called recursively.
129
130=cut
131
132$idle = sub {
104 print STDERR "FATAL: deadlock detected\n"; 133 print STDERR "FATAL: deadlock detected\n";
105 exit(51); 134 exit (51);
106}; 135};
107 136
108# we really need priorities... 137# this coroutine is necessary because a coroutine
109my @ready; # the ready queue. hehe, rather broken ;) 138# cannot destroy itself.
139my @destroy;
140my $manager; $manager = new Coro sub {
141 while () {
142 # by overwriting the state object with the manager we destroy it
143 # while still being able to schedule this coroutine (in case it has
144 # been readied multiple times. this is harmless since the manager
145 # can be called as many times as neccessary and will always
146 # remove itself from the runqueue
147 while (@destroy) {
148 my $coro = pop @destroy;
149 $coro->{status} ||= [];
150 $_->ready for @{delete $coro->{join} || []};
151
152 # the next line destroys the coro state, but keeps the
153 # coroutine itself intact (we basically make it a zombie
154 # coroutine that always runs the manager thread, so it's possible
155 # to transfer() to this coroutine).
156 $coro->_clone_state_from ($manager);
157 }
158 &schedule;
159 }
160};
110 161
111# static methods. not really. 162# static methods. not really.
112 163
164=back
165
113=head2 STATIC METHODS 166=head2 STATIC METHODS
114 167
115Static methods are actually functions that operate on the current process only. 168Static methods are actually functions that operate on the current coroutine only.
116 169
117=over 4 170=over 4
118 171
119=item async { ... } [@args...] 172=item async { ... } [@args...]
120 173
121Create a new asynchronous process and return it's process object 174Create a new asynchronous coroutine and return it's coroutine object
122(usually unused). When the sub returns the new process is automatically 175(usually unused). When the sub returns the new coroutine is automatically
123terminated. 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.
124 182
125 # create a new coroutine that just prints its arguments 183 # create a new coroutine that just prints its arguments
126 async { 184 async {
127 print "@_\n"; 185 print "@_\n";
128 } 1,2,3,4; 186 } 1,2,3,4;
129 187
130The coderef you submit MUST NOT be a closure that refers to variables
131in an outer scope. This does NOT work. Pass arguments into it instead.
132
133=cut 188=cut
134 189
135sub async(&@) { 190sub async(&@) {
136 my $pid = new Coro @_; 191 my $pid = new Coro @_;
137 $pid->ready; 192 $pid->ready;
138 $pid; 193 $pid
139} 194}
140 195
141=item schedule 196=item schedule
142 197
143Calls 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
144into the ready queue, so calling this function usually means you will 199into the ready queue, so calling this function usually means you will
145never be called again. 200never be called again unless something else (e.g. an event handler) calls
201ready.
146 202
147=cut 203The canonical way to wait on external events is this:
148 204
149my $prev; 205 {
206 # remember current coroutine
207 my $current = $Coro::current;
150 208
151sub schedule { 209 # register a hypothetical event handler
152 # should be done using priorities :( 210 on_event_invoke sub {
153 ($prev, $current) = ($current, shift @ready || $idle); 211 # wake up sleeping coroutine
154 Coro::State::transfer($prev, $current); 212 $current->ready;
155} 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 }
156 221
157=item cede 222=item cede
158 223
159"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
160ready 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
161current "timeslice" to other coroutines of the same or higher priority. 226current "timeslice" to other coroutines of the same or higher priority.
162 227
163=cut
164
165sub cede {
166 $current->ready;
167 &schedule;
168}
169
170=item terminate 228=item terminate [arg...]
171 229
172Terminates the current process. 230Terminates the current coroutine with the given status values (see L<cancel>).
173 231
174Future versions of this function will allow result arguments.
175
176=cut 232=cut
177
178# this coroutine is necessary because a coroutine
179# cannot destroy itself.
180my @destroy;
181my $terminate = new Coro sub {
182 while() {
183 delete ((pop @destroy)->{_coro_state}) while @destroy;
184 &schedule;
185 }
186};
187 233
188sub terminate { 234sub terminate {
189 push @destroy, $current; 235 $current->cancel (@_);
190 $terminate->ready;
191 &schedule;
192 # NORETURN
193} 236}
194 237
195=back 238=back
196 239
197# dynamic methods 240# dynamic methods
198 241
199=head2 PROCESS METHODS 242=head2 COROUTINE METHODS
200 243
201These are the methods you can call on process objects. 244These are the methods you can call on coroutine objects.
202 245
203=over 4 246=over 4
204 247
205=item new Coro \&sub [, @args...] 248=item new Coro \&sub [, @args...]
206 249
207Create 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
208automatically terminates. To start the process you must first put it into 251automatically terminates as if C<terminate> with the returned values were
252called. To make the coroutine run you must first put it into the ready queue
209the ready queue by calling the ready method. 253by calling the ready method.
210 254
211The coderef you submit MUST NOT be a closure that refers to variables 255Calling C<exit> in a coroutine will not work correctly, so do not do that.
212in an outer scope. This does NOT work. Pass arguments into it instead.
213 256
214=cut 257=cut
215 258
216sub _newcoro { 259sub _run_coro {
217 terminate &{+shift}; 260 terminate &{+shift};
218} 261}
219 262
220sub new { 263sub new {
221 my $class = shift; 264 my $class = shift;
222 bless {
223 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
224 }, $class;
225}
226 265
227=item $process->ready 266 $class->SUPER::new (\&_run_coro, @_)
267}
228 268
229Put the current process into the ready queue. 269=item $success = $coroutine->ready
230 270
231=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.
232 274
233sub ready { 275=item $is_ready = $coroutine->is_ready
234 push @ready, $_[0]; 276
277Return wether the coroutine is currently the ready queue or not,
278
279=item $coroutine->cancel (arg...)
280
281Terminates the given coroutine and makes it return the given arguments as
282status (default: the empty list).
283
284=cut
285
286sub cancel {
287 my $self = shift;
288 $self->{status} = [@_];
289 push @destroy, $self;
290 $manager->ready;
291 &schedule if $current == $self;
292}
293
294=item $coroutine->join
295
296Wait until the coroutine terminates and return any values given to the
297C<terminate> or C<cancel> functions. C<join> can be called multiple times
298from multiple coroutine.
299
300=cut
301
302sub join {
303 my $self = shift;
304 unless ($self->{status}) {
305 push @{$self->{join}}, $current;
306 &schedule;
307 }
308 wantarray ? @{$self->{status}} : $self->{status}[0];
309}
310
311=item $oldprio = $coroutine->prio ($newprio)
312
313Sets (or gets, if the argument is missing) the priority of the
314coroutine. Higher priority coroutines get run before lower priority
315coroutines. Priorities are small signed integers (currently -4 .. +3),
316that you can refer to using PRIO_xxx constants (use the import tag :prio
317to get then):
318
319 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
320 3 > 1 > 0 > -1 > -3 > -4
321
322 # set priority to HIGH
323 current->prio(PRIO_HIGH);
324
325The idle coroutine ($Coro::idle) always has a lower priority than any
326existing coroutine.
327
328Changing the priority of the current coroutine will take effect immediately,
329but changing the priority of coroutines in the ready queue (but not
330running) will only take effect after the next schedule (of that
331coroutine). This is a bug that will be fixed in some future version.
332
333=item $newprio = $coroutine->nice ($change)
334
335Similar to C<prio>, but subtract the given value from the priority (i.e.
336higher values mean lower priority, just as in unix).
337
338=item $olddesc = $coroutine->desc ($newdesc)
339
340Sets (or gets in case the argument is missing) the description for this
341coroutine. This is just a free-form string you can associate with a coroutine.
342
343=cut
344
345sub desc {
346 my $old = $_[0]{desc};
347 $_[0]{desc} = $_[1] if @_ > 1;
348 $old;
235} 349}
236 350
237=back 351=back
238 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
239=cut 418=cut
240 419
2411; 4201;
242 421
243=head1 BUGS/LIMITATIONS 422=head1 BUGS/LIMITATIONS
244 423
245 - could be faster, especially when the core would introduce special 424 - you must make very sure that no coro is still active on global
246 support for coroutines (like it does for threads). 425 destruction. very bad things might happen otherwise (usually segfaults).
247 - there is still a memleak on coroutine termination that I could not 426
248 identify. Could be as small as a single SV.
249 - this module is not well-tested.
250 - if variables or arguments "disappear" (become undef) or become
251 corrupted please contact the author so he cen iron out the
252 remaining bugs.
253 - this module is not thread-safe. You must only ever use this module from 427 - this module is not thread-safe. You should only ever use this module
254 the same thread (this requirement might be loosened in the future to 428 from the same thread (this requirement might be losened in the future
255 allow per-thread schedulers, but Coro::State does not yet allow this). 429 to allow per-thread schedulers, but Coro::State does not yet allow
430 this).
256 431
257=head1 SEE ALSO 432=head1 SEE ALSO
258 433
259L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 434Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
260L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 435
436Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
437
438Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
439
440Embedding: L<Coro:MakeMaker>
261 441
262=head1 AUTHOR 442=head1 AUTHOR
263 443
264 Marc Lehmann <pcg@goof.com> 444 Marc Lehmann <schmorp@schmorp.de>
265 http://www.goof.com/pcg/marc/ 445 http://home.schmorp.de/
266 446
267=cut 447=cut
268 448

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines