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

Comparing Coro/Coro.pm (file contents):
Revision 1.20 by root, Sat Jul 21 18:21:45 2001 UTC vs.
Revision 1.92 by root, Fri Dec 1 03:47:55 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 yield; 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), that is, a coroutine has it's own callchain, it's 27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own
30own set of lexicals and it's own set of perl's most important global 28callchain, it's own set of lexicals and it's own set of perl's most
31variables. 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 yield 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) { 110if ($current) {
88 $main->{specific} = $current->{specific}; 111 $main->{specific} = $current->{specific};
89} 112}
90 113
91our $current = $main; 114$current = $main;
92 115
93sub current() { $current } 116sub current() { $current }
94 117
95=item $idle 118=item $idle
96 119
97The coroutine to switch to when no other coroutine is running. The default 120A callback that is called whenever the scheduler finds no ready coroutines
98implementation prints "FATAL: deadlock detected" and exits. 121to run. The default implementation prints "FATAL: deadlock detected" and
122exits, because the program has no other way to continue.
99 123
100=cut 124This hook is overwritten by modules such as C<Coro::Timer> and
125C<Coro::Event> to wait on an external event that hopefully wake up a
126coroutine so the scheduler can run it.
101 127
102# should be done using priorities :( 128Please note that if your callback recursively invokes perl (e.g. for event
103our $idle = new Coro sub { 129handlers), then it must be prepared to be called recursively.
130
131=cut
132
133$idle = sub {
104 print STDERR "FATAL: deadlock detected\n"; 134 print STDERR "FATAL: deadlock detected\n";
105 exit(51); 135 exit (51);
106}; 136};
107 137
108# we really need priorities... 138# this coroutine is necessary because a coroutine
109my @ready; # the ready queue. hehe, rather broken ;) 139# cannot destroy itself.
140my @destroy;
141my $manager; $manager = new Coro sub {
142 while () {
143 # by overwriting the state object with the manager we destroy it
144 # while still being able to schedule this coroutine (in case it has
145 # been readied multiple times. this is harmless since the manager
146 # can be called as many times as neccessary and will always
147 # remove itself from the runqueue
148 while (@destroy) {
149 my $coro = pop @destroy;
150 $coro->{status} ||= [];
151 $_->ready for @{delete $coro->{join} || []};
152
153 # the next line destroys the coro state, but keeps the
154 # coroutine itself intact (we basically make it a zombie
155 # coroutine that always runs the manager thread, so it's possible
156 # to transfer() to this coroutine).
157 $coro->_clone_state_from ($manager);
158 }
159 &schedule;
160 }
161};
110 162
111# static methods. not really. 163# static methods. not really.
112 164
165=back
166
113=head2 STATIC METHODS 167=head2 STATIC METHODS
114 168
115Static methods are actually functions that operate on the current process only. 169Static methods are actually functions that operate on the current coroutine only.
116 170
117=over 4 171=over 4
118 172
119=item async { ... } [@args...] 173=item async { ... } [@args...]
120 174
121Create a new asynchronous process and return it's process object 175Create a new asynchronous coroutine and return it's coroutine object
122(usually unused). When the sub returns the new process is automatically 176(usually unused). When the sub returns the new coroutine is automatically
123terminated. 177terminated.
178
179Calling C<exit> in a coroutine will not work correctly, so do not do that.
180
181When the coroutine dies, the program will exit, just as in the main
182program.
124 183
125 # create a new coroutine that just prints its arguments 184 # create a new coroutine that just prints its arguments
126 async { 185 async {
127 print "@_\n"; 186 print "@_\n";
128 } 1,2,3,4; 187 } 1,2,3,4;
129 188
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 189=cut
134 190
135sub async(&@) { 191sub async(&@) {
136 my $pid = new Coro @_; 192 my $pid = new Coro @_;
137 $pid->ready; 193 $pid->ready;
138 $pid; 194 $pid
139} 195}
140 196
141=item schedule 197=item schedule
142 198
143Calls the scheduler. Please note that the current process will not be put 199Calls the scheduler. Please note that the current coroutine will not be put
144into the ready queue, so calling this function usually means you will 200into the ready queue, so calling this function usually means you will
145never be called again. 201never be called again unless something else (e.g. an event handler) calls
202ready.
146 203
147=cut 204The canonical way to wait on external events is this:
148 205
149my $prev; 206 {
207 # remember current coroutine
208 my $current = $Coro::current;
150 209
151sub schedule { 210 # register a hypothetical event handler
152 # should be done using priorities :( 211 on_event_invoke sub {
153 ($prev, $current) = ($current, shift @ready || $idle); 212 # wake up sleeping coroutine
154 Coro::State::transfer($prev, $current);
155}
156
157=item yield
158
159Yield to other processes. This function puts the current process into the
160ready queue and calls C<schedule>.
161
162=cut
163
164sub yield {
165 $current->ready; 213 $current->ready;
166 &schedule; 214 undef $current;
167} 215 };
168 216
217 # call schedule until event occured.
218 # in case we are woken up for other reasons
219 # (current still defined), loop.
220 Coro::schedule while $current;
221 }
222
223=item cede
224
225"Cede" to other coroutines. This function puts the current coroutine into the
226ready queue and calls C<schedule>, which has the effect of giving up the
227current "timeslice" to other coroutines of the same or higher priority.
228
169=item terminate 229=item terminate [arg...]
170 230
171Terminates the current process. 231Terminates the current coroutine with the given status values (see L<cancel>).
172
173Future versions of this function will allow result arguments.
174 232
175=cut 233=cut
176 234
177sub terminate { 235sub terminate {
178 $current->{_results} = [@_]; 236 $current->cancel (@_);
179 &schedule;
180} 237}
181 238
182=back 239=back
183 240
184# dynamic methods 241# dynamic methods
185 242
186=head2 PROCESS METHODS 243=head2 COROUTINE METHODS
187 244
188These are the methods you can call on process objects. 245These are the methods you can call on coroutine objects.
189 246
190=over 4 247=over 4
191 248
192=item new Coro \&sub [, @args...] 249=item new Coro \&sub [, @args...]
193 250
194Create a new process and return it. When the sub returns the process 251Create a new coroutine and return it. When the sub returns the coroutine
195automatically terminates. To start the process you must first put it into 252automatically terminates as if C<terminate> with the returned values were
253called. To make the coroutine run you must first put it into the ready queue
196the ready queue by calling the ready method. 254by calling the ready method.
197 255
198The coderef you submit MUST NOT be a closure that refers to variables 256Calling C<exit> in a coroutine will not work correctly, so do not do that.
199in an outer scope. This does NOT work. Pass arguments into it instead.
200 257
201=cut 258=cut
202 259
203sub _newcoro { 260sub _new_coro {
204 terminate &{+shift}; 261 terminate &{+shift};
205} 262}
206 263
207sub new { 264sub new {
208 my $class = shift; 265 my $class = shift;
209 bless {
210 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
211 }, $class;
212}
213 266
214=item $process->ready 267 $class->SUPER::new (\&_new_coro, @_)
268}
215 269
216Put the current process into the ready queue. 270=item $success = $coroutine->ready
217 271
218=cut 272Put the given coroutine into the ready queue (according to it's priority)
273and return true. If the coroutine is already in the ready queue, do nothing
274and return false.
219 275
220sub ready { 276=item $is_ready = $coroutine->is_ready
221 push @ready, $_[0]; 277
278Return wether the coroutine is currently the ready queue or not,
279
280=item $coroutine->cancel (arg...)
281
282Terminates the given coroutine and makes it return the given arguments as
283status (default: the empty list).
284
285=cut
286
287sub cancel {
288 my $self = shift;
289 $self->{status} = [@_];
290 push @destroy, $self;
291 $manager->ready;
292 &schedule if $current == $self;
293}
294
295=item $coroutine->join
296
297Wait until the coroutine terminates and return any values given to the
298C<terminate> or C<cancel> functions. C<join> can be called multiple times
299from multiple coroutine.
300
301=cut
302
303sub join {
304 my $self = shift;
305 unless ($self->{status}) {
306 push @{$self->{join}}, $current;
307 &schedule;
308 }
309 wantarray ? @{$self->{status}} : $self->{status}[0];
310}
311
312=item $oldprio = $coroutine->prio ($newprio)
313
314Sets (or gets, if the argument is missing) the priority of the
315coroutine. Higher priority coroutines get run before lower priority
316coroutines. Priorities are small signed integers (currently -4 .. +3),
317that you can refer to using PRIO_xxx constants (use the import tag :prio
318to get then):
319
320 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
321 3 > 1 > 0 > -1 > -3 > -4
322
323 # set priority to HIGH
324 current->prio(PRIO_HIGH);
325
326The idle coroutine ($Coro::idle) always has a lower priority than any
327existing coroutine.
328
329Changing the priority of the current coroutine will take effect immediately,
330but changing the priority of coroutines in the ready queue (but not
331running) will only take effect after the next schedule (of that
332coroutine). This is a bug that will be fixed in some future version.
333
334=item $newprio = $coroutine->nice ($change)
335
336Similar to C<prio>, but subtract the given value from the priority (i.e.
337higher values mean lower priority, just as in unix).
338
339=item $olddesc = $coroutine->desc ($newdesc)
340
341Sets (or gets in case the argument is missing) the description for this
342coroutine. This is just a free-form string you can associate with a coroutine.
343
344=cut
345
346sub desc {
347 my $old = $_[0]{desc};
348 $_[0]{desc} = $_[1] if @_ > 1;
349 $old;
222} 350}
223 351
224=back 352=back
225 353
354=head2 UTILITY FUNCTIONS
355
356=over 4
357
358=item unblock_sub { ... }
359
360This utility function takes a BLOCK or code reference and "unblocks" it,
361returning the new coderef. This means that the new coderef will return
362immediately without blocking, returning nothing, while the original code
363ref will be called (with parameters) from within its own coroutine.
364
365The reason this fucntion exists is that many event libraries (such as the
366venerable L<Event|Event> module) are not coroutine-safe (a weaker form
367of thread-safety). This means you must not block within event callbacks,
368otherwise you might suffer from crashes or worse.
369
370This function allows your callbacks to block by executing them in another
371coroutine where it is safe to block. One example where blocking is handy
372is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
373disk.
374
375In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
376creating event callbacks that want to block.
377
378=cut
379
380our @unblock_pool;
381our @unblock_queue;
382our $UNBLOCK_POOL_SIZE = 2;
383
384sub unblock_handler_ {
385 while () {
386 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
387 $cb->(@arg);
388
389 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
390 push @unblock_pool, $Coro::current;
391 schedule;
392 }
393}
394
395our $unblock_scheduler = async {
396 while () {
397 while (my $cb = pop @unblock_queue) {
398 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
399 $handler->{arg} = $cb;
400 $handler->ready;
401 cede;
402 }
403
404 schedule;
405 }
406};
407
408sub unblock_sub(&) {
409 my $cb = shift;
410
411 sub {
412 push @unblock_queue, [$cb, @_];
413 $unblock_scheduler->ready;
414 }
415}
416
417=back
418
226=cut 419=cut
227 420
2281; 4211;
229 422
230=head1 BUGS/LIMITATIONS 423=head1 BUGS/LIMITATIONS
231 424
232 - could be faster, especially when the core would introduce special 425 - you must make very sure that no coro is still active on global
233 support for coroutines (like it does for threads). 426 destruction. very bad things might happen otherwise (usually segfaults).
234 - there is still a memleak on coroutine termination that I could not 427
235 identify. Could be as small as a single SV.
236 - this module is not well-tested.
237 - if variables or arguments "disappear" (become undef) or become
238 corrupted please contact the author so he cen iron out the
239 remaining bugs.
240 - this module is not thread-safe. You must only ever use this module from 428 - this module is not thread-safe. You should only ever use this module
241 the same thread (this requirement might be loosened in the future to 429 from the same thread (this requirement might be losened in the future
242 allow per-thread schedulers, but Coro::State does not yet allow this). 430 to allow per-thread schedulers, but Coro::State does not yet allow
431 this).
243 432
244=head1 SEE ALSO 433=head1 SEE ALSO
245 434
246L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 435Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
247L<Coro::Signal>, L<Coro::State>, L<Coro::Event>. 436
437Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
438
439Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
440
441Embedding: L<Coro:MakeMaker>
248 442
249=head1 AUTHOR 443=head1 AUTHOR
250 444
251 Marc Lehmann <pcg@goof.com> 445 Marc Lehmann <schmorp@schmorp.de>
252 http://www.goof.com/pcg/marc/ 446 http://home.schmorp.de/
253 447
254=cut 448=cut
255 449

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines