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

Comparing Coro/Coro.pm (file contents):
Revision 1.3 by root, Tue Jul 3 04:02:31 2001 UTC vs.
Revision 1.139 by root, Thu Sep 27 15:52:30 2007 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 used in this module also
27greatly reduced. 26guarantees 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.8';
56
57our @EXPORT = qw(async async_pool 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 essential 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$main->{desc} = "[main::]";
119
120# maybe some other module used Coro::Specific before...
121$main->{specific} = $current->{specific}
122 if $current;
123
124_set_current $main;
125
126sub current() { $current }
127
128=item $idle
129
130A callback that is called whenever the scheduler finds no ready coroutines
131to run. The default implementation prints "FATAL: deadlock detected" and
132exits, because the program has no other way to continue.
133
134This hook is overwritten by modules such as C<Coro::Timer> and
135C<Coro::Event> to wait on an external event that hopefully wake up a
136coroutine so the scheduler can run it.
137
138Please note that if your callback recursively invokes perl (e.g. for event
139handlers), then it must be prepared to be called recursively.
140
141=cut
142
143$idle = sub {
144 require Carp;
145 Carp::croak ("FATAL: deadlock detected");
58}; 146};
59 147
60=item $error, $error_msg, $error_coro 148sub _cancel {
149 my ($self) = @_;
61 150
62This coroutine will be called on fatal errors. C<$error_msg> and 151 # free coroutine data and mark as destructed
63C<$error_coro> return the error message and the error-causing coroutine, 152 $self->_destroy
64respectively. 153 or return;
65 154
66=cut 155 # call all destruction callbacks
156 $_->(@{$self->{status}})
157 for @{(delete $self->{destroy_cb}) || []};
158}
67 159
68$error_msg = 160sub _do_trace_sub {
69$error_coro = undef; 161 &{$current->{_trace_sub_cb}}
162}
70 163
71$error = _newprocess { 164sub _do_trace_line {
72 print STDERR "FATAL: $error_msg\nprogram aborted\n"; 165 &{$current->{_trace_line_cb}}
73 exit 250; 166}
167
168# this coroutine is necessary because a coroutine
169# cannot destroy itself.
170my @destroy;
171my $manager;
172
173$manager = new Coro sub {
174 while () {
175 (shift @destroy)->_cancel
176 while @destroy;
177
178 &schedule;
179 }
74}; 180};
181$manager->desc ("[coro manager]");
182$manager->prio (PRIO_MAX);
75 183
76=item $coro = new $coderef [, @args] 184# static methods. not really.
77 185
78Create a new coroutine and return it. The first C<resume> call to this 186=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 187
188=head2 STATIC METHODS
189
190Static methods are actually functions that operate on the current coroutine only.
191
192=over 4
193
194=item async { ... } [@args...]
195
196Create a new asynchronous coroutine and return it's coroutine object
197(usually unused). When the sub returns the new coroutine is automatically
198terminated.
199
200Calling C<exit> in a coroutine will do the same as calling exit outside
201the coroutine. Likewise, when the coroutine dies, the program will exit,
202just as it would in the main program.
203
204 # create a new coroutine that just prints its arguments
205 async {
206 print "@_\n";
207 } 1,2,3,4;
208
83=cut 209=cut
210
211sub async(&@) {
212 my $coro = new Coro @_;
213 $coro->ready;
214 $coro
215}
216
217=item async_pool { ... } [@args...]
218
219Similar to C<async>, but uses a coroutine pool, so you should not call
220terminate or join (although you are allowed to), and you get a coroutine
221that might have executed other code already (which can be good or bad :).
222
223Also, the block is executed in an C<eval> context and a warning will be
224issued in case of an exception instead of terminating the program, as
225C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
226will not work in the expected way, unless you call terminate or cancel,
227which somehow defeats the purpose of pooling.
228
229The priority will be reset to C<0> after each job, otherwise the coroutine
230will be re-used "as-is".
231
232The pool size is limited to 8 idle coroutines (this can be adjusted by
233changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
234required.
235
236If you are concerned about pooled coroutines growing a lot because a
237single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
238{ terminate }> once per second or so to slowly replenish the pool. In
239addition to that, when the stacks used by a handler grows larger than 16kb
240(adjustable with $Coro::POOL_RSS) it will also exit.
241
242=cut
243
244our $POOL_SIZE = 8;
245our $POOL_RSS = 16 * 1024;
246our @async_pool;
247
248sub pool_handler {
249 my $cb;
250
251 while () {
252 eval {
253 while () {
254 _pool_1 $cb;
255 &$cb;
256 _pool_2 $cb;
257 &schedule;
258 }
259 };
260
261 last if $@ eq "\3terminate\2\n";
262 warn $@ if $@;
263 }
264}
265
266sub async_pool(&@) {
267 # this is also inlined into the unlock_scheduler
268 my $coro = (pop @async_pool) || new Coro \&pool_handler;
269
270 $coro->{_invoke} = [@_];
271 $coro->ready;
272
273 $coro
274}
275
276=item schedule
277
278Calls the scheduler. Please note that the current coroutine will not be put
279into the ready queue, so calling this function usually means you will
280never be called again unless something else (e.g. an event handler) calls
281ready.
282
283The canonical way to wait on external events is this:
284
285 {
286 # remember current coroutine
287 my $current = $Coro::current;
288
289 # register a hypothetical event handler
290 on_event_invoke sub {
291 # wake up sleeping coroutine
292 $current->ready;
293 undef $current;
294 };
295
296 # call schedule until event occurred.
297 # in case we are woken up for other reasons
298 # (current still defined), loop.
299 Coro::schedule while $current;
300 }
301
302=item cede
303
304"Cede" to other coroutines. This function puts the current coroutine into the
305ready queue and calls C<schedule>, which has the effect of giving up the
306current "timeslice" to other coroutines of the same or higher priority.
307
308Returns true if at least one coroutine switch has happened.
309
310=item Coro::cede_notself
311
312Works like cede, but is not exported by default and will cede to any
313coroutine, regardless of priority, once.
314
315Returns true if at least one coroutine switch has happened.
316
317=item terminate [arg...]
318
319Terminates the current coroutine with the given status values (see L<cancel>).
320
321=cut
322
323sub terminate {
324 $current->cancel (@_);
325}
326
327=back
328
329# dynamic methods
330
331=head2 COROUTINE METHODS
332
333These are the methods you can call on coroutine objects.
334
335=over 4
336
337=item new Coro \&sub [, @args...]
338
339Create a new coroutine and return it. When the sub returns the coroutine
340automatically terminates as if C<terminate> with the returned values were
341called. To make the coroutine run you must first put it into the ready queue
342by calling the ready method.
343
344See C<async> for additional discussion.
345
346=cut
347
348sub _run_coro {
349 terminate &{+shift};
350}
84 351
85sub new { 352sub new {
86 my $class = $_[0]; 353 my $class = shift;
87 my $proc = $_[1]; 354
88 bless _newprocess { 355 $class->SUPER::new (\&_run_coro, @_)
89 do { 356}
90 eval { &$proc->resume }; 357
91 if ($@) { 358=item $success = $coroutine->ready
92 ($error_msg, $error_coro) = ($@, $current); 359
93 $error->resume; 360Put the given coroutine into the ready queue (according to it's priority)
361and return true. If the coroutine is already in the ready queue, do nothing
362and return false.
363
364=item $is_ready = $coroutine->is_ready
365
366Return wether the coroutine is currently the ready queue or not,
367
368=item $coroutine->cancel (arg...)
369
370Terminates the given coroutine and makes it return the given arguments as
371status (default: the empty list). Never returns if the coroutine is the
372current coroutine.
373
374=cut
375
376sub cancel {
377 my $self = shift;
378 $self->{status} = [@_];
379
380 if ($current == $self) {
381 push @destroy, $self;
382 $manager->ready;
383 &schedule while 1;
384 } else {
385 $self->_cancel;
386 }
387}
388
389=item $coroutine->join
390
391Wait until the coroutine terminates and return any values given to the
392C<terminate> or C<cancel> functions. C<join> can be called multiple times
393from multiple coroutine.
394
395=cut
396
397sub join {
398 my $self = shift;
399
400 unless ($self->{status}) {
401 my $current = $current;
402
403 push @{$self->{destroy_cb}}, sub {
404 $current->ready;
405 undef $current;
406 };
407
408 &schedule while $current;
409 }
410
411 wantarray ? @{$self->{status}} : $self->{status}[0];
412}
413
414=item $coroutine->on_destroy (\&cb)
415
416Registers a callback that is called when this coroutine gets destroyed,
417but before it is joined. The callback gets passed the terminate arguments,
418if any.
419
420=cut
421
422sub on_destroy {
423 my ($self, $cb) = @_;
424
425 push @{ $self->{destroy_cb} }, $cb;
426}
427
428=item $oldprio = $coroutine->prio ($newprio)
429
430Sets (or gets, if the argument is missing) the priority of the
431coroutine. Higher priority coroutines get run before lower priority
432coroutines. Priorities are small signed integers (currently -4 .. +3),
433that you can refer to using PRIO_xxx constants (use the import tag :prio
434to get then):
435
436 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
437 3 > 1 > 0 > -1 > -3 > -4
438
439 # set priority to HIGH
440 current->prio(PRIO_HIGH);
441
442The idle coroutine ($Coro::idle) always has a lower priority than any
443existing coroutine.
444
445Changing the priority of the current coroutine will take effect immediately,
446but changing the priority of coroutines in the ready queue (but not
447running) will only take effect after the next schedule (of that
448coroutine). This is a bug that will be fixed in some future version.
449
450=item $newprio = $coroutine->nice ($change)
451
452Similar to C<prio>, but subtract the given value from the priority (i.e.
453higher values mean lower priority, just as in unix).
454
455=item $olddesc = $coroutine->desc ($newdesc)
456
457Sets (or gets in case the argument is missing) the description for this
458coroutine. This is just a free-form string you can associate with a coroutine.
459
460=cut
461
462sub desc {
463 my $old = $_[0]{desc};
464 $_[0]{desc} = $_[1] if @_ > 1;
465 $old;
466}
467
468=back
469
470=head2 GLOBAL FUNCTIONS
471
472=over 4
473
474=item Coro::nready
475
476Returns the number of coroutines that are currently in the ready state,
477i.e. that can be switched to. The value C<0> means that the only runnable
478coroutine is the currently running one, so C<cede> would have no effect,
479and C<schedule> would cause a deadlock unless there is an idle handler
480that wakes up some coroutines.
481
482=item my $guard = Coro::guard { ... }
483
484This creates and returns a guard object. Nothing happens until the object
485gets destroyed, in which case the codeblock given as argument will be
486executed. This is useful to free locks or other resources in case of a
487runtime error or when the coroutine gets canceled, as in both cases the
488guard block will be executed. The guard object supports only one method,
489C<< ->cancel >>, which will keep the codeblock from being executed.
490
491Example: set some flag and clear it again when the coroutine gets canceled
492or the function returns:
493
494 sub do_something {
495 my $guard = Coro::guard { $busy = 0 };
496 $busy = 1;
497
498 # do something that requires $busy to be true
499 }
500
501=cut
502
503sub guard(&) {
504 bless \(my $cb = $_[0]), "Coro::guard"
505}
506
507sub Coro::guard::cancel {
508 ${$_[0]} = sub { };
509}
510
511sub Coro::guard::DESTROY {
512 ${$_[0]}->();
513}
514
515
516=item unblock_sub { ... }
517
518This utility function takes a BLOCK or code reference and "unblocks" it,
519returning the new coderef. This means that the new coderef will return
520immediately without blocking, returning nothing, while the original code
521ref will be called (with parameters) from within its own coroutine.
522
523The reason this function exists is that many event libraries (such as the
524venerable L<Event|Event> module) are not coroutine-safe (a weaker form
525of thread-safety). This means you must not block within event callbacks,
526otherwise you might suffer from crashes or worse.
527
528This function allows your callbacks to block by executing them in another
529coroutine where it is safe to block. One example where blocking is handy
530is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
531disk.
532
533In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
534creating event callbacks that want to block.
535
536=cut
537
538our @unblock_queue;
539
540# we create a special coro because we want to cede,
541# to reduce pressure on the coro pool (because most callbacks
542# return immediately and can be reused) and because we cannot cede
543# inside an event callback.
544our $unblock_scheduler = new Coro sub {
545 while () {
546 while (my $cb = pop @unblock_queue) {
547 # this is an inlined copy of async_pool
548 my $coro = (pop @async_pool) || new Coro \&pool_handler;
549
550 $coro->{_invoke} = $cb;
551 $coro->ready;
552 cede; # for short-lived callbacks, this reduces pressure on the coro pool
94 } 553 }
95 } while (); 554 schedule; # sleep well
96 }, $class; 555 }
97} 556};
557$unblock_scheduler->desc ("[unblock_sub scheduler]");
98 558
99=item $coro->resume 559sub unblock_sub(&) {
560 my $cb = shift;
100 561
101Resume execution at the given coroutine. 562 sub {
102 563 unshift @unblock_queue, [$cb, @_];
103=cut 564 $unblock_scheduler->ready;
104 565 }
105my $prev;
106
107sub resume {
108 $prev = $current; $current = $_[0];
109 _transfer($prev, $current);
110} 566}
567
568=back
569
570=cut
111 571
1121; 5721;
113 573
114=back 574=head1 BUGS/LIMITATIONS
115 575
116=head1 BUGS 576 - you must make very sure that no coro is still active on global
577 destruction. very bad things might happen otherwise (usually segfaults).
117 578
118This module has not yet been extensively tested. 579 - this module is not thread-safe. You should only ever use this module
580 from the same thread (this requirement might be loosened in the future
581 to allow per-thread schedulers, but Coro::State does not yet allow
582 this).
119 583
120=head1 SEE ALSO 584=head1 SEE ALSO
121 585
122L<Coro::Process>, L<Coro::Signal>. 586Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
587
588Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
589
590Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
591
592Embedding: L<Coro:MakeMaker>
123 593
124=head1 AUTHOR 594=head1 AUTHOR
125 595
126 Marc Lehmann <pcg@goof.com> 596 Marc Lehmann <schmorp@schmorp.de>
127 http://www.goof.com/pcg/marc/ 597 http://home.schmorp.de/
128 598
129=cut 599=cut
130 600

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines