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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines