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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines