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

Comparing Coro/Coro.pm (file contents):
Revision 1.29 by root, Sat Aug 11 00:37:31 2001 UTC vs.
Revision 1.103 by root, Thu Jan 4 20:14:19 2007 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
24Threads but don't run in parallel. 24to threads but don't run in parallel at the same time even on SMP
25machines. The specific flavor of coroutine use din this module also
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.
25 30
26This module is still experimental, see the BUGS section below. 31(Perl, however, does not natively support real threads but instead does a
32very slow and memory-intensive emulation of processes using threads. This
33is a performance win on Windows machines, and a loss everywhere else).
27 34
28In this module, coroutines are defined as "callchain + lexical variables 35In this module, coroutines are defined as "callchain + lexical variables +
29+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own 36@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
30callchain, it's own set of lexicals and it's own set of perl's most 37its own set of lexicals and its own set of perls most important global
31important global variables. 38variables.
32 39
33=cut 40=cut
34 41
35package Coro; 42package Coro;
36 43
44use strict;
45no warnings "uninitialized";
46
37use Coro::State; 47use Coro::State;
38 48
39use base Exporter; 49use base qw(Coro::State Exporter);
40 50
41$VERSION = 0.45; 51our $idle; # idle handler
52our $main; # main coroutine
53our $current; # current coroutine
42 54
55our $VERSION = '3.3';
56
43@EXPORT = qw(async cede schedule terminate current); 57our @EXPORT = qw(async cede schedule terminate current unblock_sub);
44@EXPORT_OK = qw($current); 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));
45 62
46{ 63{
47 my @async; 64 my @async;
48 my $init; 65 my $init;
49 66
50 # this way of handling attributes simply is NOT scalable ;() 67 # this way of handling attributes simply is NOT scalable ;()
51 sub import { 68 sub import {
69 no strict 'refs';
70
52 Coro->export_to_level(1, @_); 71 Coro->export_to_level (1, @_);
72
53 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 73 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
54 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 74 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
55 my ($package, $ref) = (shift, shift); 75 my ($package, $ref) = (shift, shift);
56 my @attrs; 76 my @attrs;
57 for (@_) { 77 for (@_) {
72 }; 92 };
73 } 93 }
74 94
75} 95}
76 96
97=over 4
98
77=item $main 99=item $main
78 100
79This coroutine represents the main program. 101This coroutine represents the main program.
80 102
81=cut 103=cut
82 104
83our $main = new Coro; 105$main = new Coro;
84 106
85=item $current (or as function: current) 107=item $current (or as function: current)
86 108
87The 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).
111
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.
88 115
89=cut 116=cut
90 117
91# maybe some other module used Coro::Specific before... 118# maybe some other module used Coro::Specific before...
92if ($current) {
93 $main->{specific} = $current->{specific}; 119$main->{specific} = $current->{specific}
94} 120 if $current;
95 121
96our $current = $main; 122_set_current $main;
97 123
98sub current() { $current } 124sub current() { $current }
99 125
100=item $idle 126=item $idle
101 127
102The coroutine to switch to when no other coroutine is running. The default 128A callback that is called whenever the scheduler finds no ready coroutines
103implementation prints "FATAL: deadlock detected" and exits. 129to run. The default implementation prints "FATAL: deadlock detected" and
130exits, because the program has no other way to continue.
104 131
105=cut 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.
106 135
107# should be done using priorities :( 136Please note that if your callback recursively invokes perl (e.g. for event
108our $idle = new Coro sub { 137handlers), then it must be prepared to be called recursively.
109 print STDERR "FATAL: deadlock detected\n"; 138
110 exit(51); 139=cut
140
141$idle = sub {
142 require Carp;
143 Carp::croak ("FATAL: deadlock detected");
111}; 144};
145
146sub _cancel {
147 my ($self) = @_;
148
149 # free coroutine data and mark as destructed
150 $self->_destroy
151 or return;
152
153 # call all destruction callbacks
154 $_->(@{$self->{status}})
155 for @{(delete $self->{destroy_cb}) || []};
156}
112 157
113# this coroutine is necessary because a coroutine 158# this coroutine is necessary because a coroutine
114# cannot destroy itself. 159# cannot destroy itself.
115my @destroy; 160my @destroy;
161my $manager;
162
116my $manager = new Coro sub { 163$manager = new Coro sub {
117 while() { 164 while () {
118 delete ((pop @destroy)->{_coro_state}) while @destroy; 165 (shift @destroy)->_cancel
166 while @destroy;
167
119 &schedule; 168 &schedule;
120 } 169 }
121}; 170};
122 171
123# we really need priorities... 172$manager->prio (PRIO_MAX);
124my @ready; # the ready queue. hehe, rather broken ;)
125 173
126# static methods. not really. 174# static methods. not really.
127 175
176=back
177
128=head2 STATIC METHODS 178=head2 STATIC METHODS
129 179
130Static methods are actually functions that operate on the current process only. 180Static methods are actually functions that operate on the current coroutine only.
131 181
132=over 4 182=over 4
133 183
134=item async { ... } [@args...] 184=item async { ... } [@args...]
135 185
136Create a new asynchronous process and return it's process object 186Create a new asynchronous coroutine and return it's coroutine object
137(usually unused). When the sub returns the new process is automatically 187(usually unused). When the sub returns the new coroutine is automatically
138terminated. 188terminated.
189
190Calling C<exit> in a coroutine will not work correctly, so do not do that.
191
192When the coroutine dies, the program will exit, just as in the main
193program.
139 194
140 # create a new coroutine that just prints its arguments 195 # create a new coroutine that just prints its arguments
141 async { 196 async {
142 print "@_\n"; 197 print "@_\n";
143 } 1,2,3,4; 198 } 1,2,3,4;
144 199
145The coderef you submit MUST NOT be a closure that refers to variables
146in an outer scope. This does NOT work. Pass arguments into it instead.
147
148=cut 200=cut
149 201
150sub async(&@) { 202sub async(&@) {
151 my $pid = new Coro @_; 203 my $pid = new Coro @_;
152 $manager->ready; # this ensures that the stack is cloned from the manager
153 $pid->ready; 204 $pid->ready;
154 $pid; 205 $pid
155} 206}
156 207
157=item schedule 208=item schedule
158 209
159Calls the scheduler. Please note that the current process will not be put 210Calls the scheduler. Please note that the current coroutine will not be put
160into the ready queue, so calling this function usually means you will 211into the ready queue, so calling this function usually means you will
161never be called again. 212never be called again unless something else (e.g. an event handler) calls
213ready.
162 214
163=cut 215The canonical way to wait on external events is this:
164 216
165my $prev; 217 {
218 # remember current coroutine
219 my $current = $Coro::current;
166 220
167sub schedule { 221 # register a hypothetical event handler
168 # should be done using priorities :( 222 on_event_invoke sub {
169 ($prev, $current) = ($current, shift @ready || $idle); 223 # wake up sleeping coroutine
170 Coro::State::transfer($prev, $current); 224 $current->ready;
171} 225 undef $current;
226 };
227
228 # call schedule until event occured.
229 # in case we are woken up for other reasons
230 # (current still defined), loop.
231 Coro::schedule while $current;
232 }
172 233
173=item cede 234=item cede
174 235
175"Cede" to other processes. This function puts the current process into the 236"Cede" to other coroutines. This function puts the current coroutine into the
176ready queue and calls C<schedule>, which has the effect of giving up the 237ready queue and calls C<schedule>, which has the effect of giving up the
177current "timeslice" to other coroutines of the same or higher priority. 238current "timeslice" to other coroutines of the same or higher priority.
178 239
179=cut 240=item Coro::cede_notself
180 241
181sub cede { 242Works like cede, but is not exported by default and will cede to any
182 $current->ready; 243coroutine, regardless of priority, once.
183 &schedule;
184}
185 244
186=item terminate 245=item terminate [arg...]
187 246
188Terminates the current process. 247Terminates the current coroutine with the given status values (see L<cancel>).
189
190Future versions of this function will allow result arguments.
191 248
192=cut 249=cut
193 250
194sub terminate { 251sub terminate {
195 $current->cancel; 252 $current->cancel (@_);
196 &schedule;
197 die; # NORETURN
198} 253}
199 254
200=back 255=back
201 256
202# dynamic methods 257# dynamic methods
203 258
204=head2 PROCESS METHODS 259=head2 COROUTINE METHODS
205 260
206These are the methods you can call on process objects. 261These are the methods you can call on coroutine objects.
207 262
208=over 4 263=over 4
209 264
210=item new Coro \&sub [, @args...] 265=item new Coro \&sub [, @args...]
211 266
212Create a new process and return it. When the sub returns the process 267Create a new coroutine and return it. When the sub returns the coroutine
213automatically terminates. To start the process you must first put it into 268automatically terminates as if C<terminate> with the returned values were
269called. To make the coroutine run you must first put it into the ready queue
214the ready queue by calling the ready method. 270by calling the ready method.
215 271
216The coderef you submit MUST NOT be a closure that refers to variables 272Calling C<exit> in a coroutine will not work correctly, so do not do that.
217in an outer scope. This does NOT work. Pass arguments into it instead.
218 273
219=cut 274=cut
220 275
221sub _newcoro { 276sub _run_coro {
222 terminate &{+shift}; 277 terminate &{+shift};
223} 278}
224 279
225sub new { 280sub new {
226 my $class = shift; 281 my $class = shift;
227 bless {
228 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
229 }, $class;
230}
231 282
232=item $process->ready 283 $class->SUPER::new (\&_run_coro, @_)
233
234Put the current process into the ready queue.
235
236=cut
237
238sub ready {
239 push @ready, $_[0];
240} 284}
241 285
242=item $process->cancel 286=item $success = $coroutine->ready
243 287
244Like C<terminate>, but terminates the specified process instead. 288Put the given coroutine into the ready queue (according to it's priority)
289and return true. If the coroutine is already in the ready queue, do nothing
290and return false.
291
292=item $is_ready = $coroutine->is_ready
293
294Return wether the coroutine is currently the ready queue or not,
295
296=item $coroutine->cancel (arg...)
297
298Terminates the given coroutine and makes it return the given arguments as
299status (default: the empty list). Never returns if the coroutine is the
300current coroutine.
245 301
246=cut 302=cut
247 303
248sub cancel { 304sub cancel {
305 my $self = shift;
306 $self->{status} = [@_];
307
308 if ($current == $self) {
249 push @destroy, $_[0]; 309 push @destroy, $self;
250 $manager->ready; 310 $manager->ready;
311 &schedule while 1;
312 } else {
313 $self->_cancel;
314 }
315}
316
317=item $coroutine->join
318
319Wait until the coroutine terminates and return any values given to the
320C<terminate> or C<cancel> functions. C<join> can be called multiple times
321from multiple coroutine.
322
323=cut
324
325sub join {
326 my $self = shift;
327
328 unless ($self->{status}) {
329 my $current = $current;
330
331 push @{$self->{destroy_cb}}, sub {
332 $current->ready;
333 undef $current;
334 };
335
336 &schedule while $current;
337 }
338
339 wantarray ? @{$self->{status}} : $self->{status}[0];
340}
341
342=item $coroutine->on_destroy (\&cb)
343
344Registers a callback that is called when this coroutine gets destroyed,
345but before it is joined. The callback gets passed the terminate arguments,
346if any.
347
348=cut
349
350sub on_destroy {
351 my ($self, $cb) = @_;
352
353 push @{ $self->{destroy_cb} }, $cb;
354}
355
356=item $oldprio = $coroutine->prio ($newprio)
357
358Sets (or gets, if the argument is missing) the priority of the
359coroutine. Higher priority coroutines get run before lower priority
360coroutines. Priorities are small signed integers (currently -4 .. +3),
361that you can refer to using PRIO_xxx constants (use the import tag :prio
362to get then):
363
364 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
365 3 > 1 > 0 > -1 > -3 > -4
366
367 # set priority to HIGH
368 current->prio(PRIO_HIGH);
369
370The idle coroutine ($Coro::idle) always has a lower priority than any
371existing coroutine.
372
373Changing the priority of the current coroutine will take effect immediately,
374but changing the priority of coroutines in the ready queue (but not
375running) will only take effect after the next schedule (of that
376coroutine). This is a bug that will be fixed in some future version.
377
378=item $newprio = $coroutine->nice ($change)
379
380Similar to C<prio>, but subtract the given value from the priority (i.e.
381higher values mean lower priority, just as in unix).
382
383=item $olddesc = $coroutine->desc ($newdesc)
384
385Sets (or gets in case the argument is missing) the description for this
386coroutine. This is just a free-form string you can associate with a coroutine.
387
388=cut
389
390sub desc {
391 my $old = $_[0]{desc};
392 $_[0]{desc} = $_[1] if @_ > 1;
393 $old;
251} 394}
252 395
253=back 396=back
254 397
398=head2 GLOBAL FUNCTIONS
399
400=over 4
401
402=item Coro::nready
403
404Returns the number of coroutines that are currently in the ready state,
405i.e. that can be swicthed to. The value C<0> means that the only runnable
406coroutine is the currently running one, so C<cede> would have no effect,
407and C<schedule> would cause a deadlock unless there is an idle handler
408that wakes up some coroutines.
409
410=item my $guard = Coro::guard { ... }
411
412This creates and returns a guard object. Nothing happens until the objetc
413gets destroyed, in which case the codeblock given as argument will be
414executed. This is useful to free locks or other resources in case of a
415runtime error or when the coroutine gets canceled, as in both cases the
416guard block will be executed. The guard object supports only one method,
417C<< ->cancel >>, which will keep the codeblock from being executed.
418
419Example: set some flag and clear it again when the coroutine gets canceled
420or the function returns:
421
422 sub do_something {
423 my $guard = Coro::guard { $busy = 0 };
424 $busy = 1;
425
426 # do something that requires $busy to be true
427 }
428
429=cut
430
431sub guard(&) {
432 bless \(my $cb = $_[0]), "Coro::guard"
433}
434
435sub Coro::guard::cancel {
436 ${$_[0]} = sub { };
437}
438
439sub Coro::guard::DESTROY {
440 ${$_[0]}->();
441}
442
443
444=item unblock_sub { ... }
445
446This utility function takes a BLOCK or code reference and "unblocks" it,
447returning the new coderef. This means that the new coderef will return
448immediately without blocking, returning nothing, while the original code
449ref will be called (with parameters) from within its own coroutine.
450
451The reason this fucntion exists is that many event libraries (such as the
452venerable L<Event|Event> module) are not coroutine-safe (a weaker form
453of thread-safety). This means you must not block within event callbacks,
454otherwise you might suffer from crashes or worse.
455
456This function allows your callbacks to block by executing them in another
457coroutine where it is safe to block. One example where blocking is handy
458is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
459disk.
460
461In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
462creating event callbacks that want to block.
463
464=cut
465
466our @unblock_pool;
467our @unblock_queue;
468our $UNBLOCK_POOL_SIZE = 2;
469
470sub unblock_handler_ {
471 while () {
472 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
473 $cb->(@arg);
474
475 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
476 push @unblock_pool, $Coro::current;
477 schedule;
478 }
479}
480
481our $unblock_scheduler = async {
482 while () {
483 while (my $cb = pop @unblock_queue) {
484 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
485 $handler->{arg} = $cb;
486 $handler->ready;
487 cede;
488 }
489
490 schedule;
491 }
492};
493
494sub unblock_sub(&) {
495 my $cb = shift;
496
497 sub {
498 push @unblock_queue, [$cb, @_];
499 $unblock_scheduler->ready;
500 }
501}
502
503=back
504
255=cut 505=cut
256 506
2571; 5071;
258 508
259=head1 BUGS/LIMITATIONS 509=head1 BUGS/LIMITATIONS
260 510
261 - could be faster, especially when the core would introduce special 511 - you must make very sure that no coro is still active on global
262 support for coroutines (like it does for threads). 512 destruction. very bad things might happen otherwise (usually segfaults).
263 - there is still a memleak on coroutine termination that I could not 513
264 identify. Could be as small as a single SV.
265 - this module is not well-tested.
266 - if variables or arguments "disappear" (become undef) or become
267 corrupted please contact the author so he cen iron out the
268 remaining bugs.
269 - this module is not thread-safe. You must only ever use this module from 514 - this module is not thread-safe. You should only ever use this module
270 the same thread (this requirement might be loosened in the future to 515 from the same thread (this requirement might be losened in the future
271 allow per-thread schedulers, but Coro::State does not yet allow this). 516 to allow per-thread schedulers, but Coro::State does not yet allow
517 this).
272 518
273=head1 SEE ALSO 519=head1 SEE ALSO
274 520
275L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 521Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
276L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>, 522
277L<Coro::Handle>, L<Coro::Socket>. 523Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
524
525Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
526
527Embedding: L<Coro:MakeMaker>
278 528
279=head1 AUTHOR 529=head1 AUTHOR
280 530
281 Marc Lehmann <pcg@goof.com> 531 Marc Lehmann <schmorp@schmorp.de>
282 http://www.goof.com/pcg/marc/ 532 http://home.schmorp.de/
283 533
284=cut 534=cut
285 535

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines