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

Comparing Coro/Coro.pm (file contents):
Revision 1.7 by root, Fri Jul 13 13:05:38 2001 UTC vs.
Revision 1.107 by root, Fri Jan 5 18:25:51 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines