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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines