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

Comparing Coro/Coro.pm (file contents):
Revision 1.37 by root, Mon Sep 24 02:25:44 2001 UTC vs.
Revision 1.100 by root, Tue Dec 12 13:56:45 2006 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 use din this module also
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.
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;
37no warnings qw(uninitialized); 45no warnings "uninitialized";
38 46
39use Coro::State; 47use Coro::State;
40 48
41use base Exporter; 49use base qw(Coro::State Exporter);
42 50
43$VERSION = 0.5; 51our $idle; # idle handler
52our $main; # main coroutine
53our $current; # current coroutine
44 54
55our $VERSION = '3.2';
56
45@EXPORT = qw(async cede schedule terminate current); 57our @EXPORT = qw(async cede schedule terminate current unblock_sub);
46%EXPORT_TAGS = ( 58our %EXPORT_TAGS = (
47 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)],
48); 60);
49@EXPORT_OK = @{$EXPORT_TAGS{prio}}; 61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
50 62
51{ 63{
52 my @async; 64 my @async;
53 my $init; 65 my $init;
54 66
55 # this way of handling attributes simply is NOT scalable ;() 67 # this way of handling attributes simply is NOT scalable ;()
56 sub import { 68 sub import {
69 no strict 'refs';
70
57 Coro->export_to_level(1, @_); 71 Coro->export_to_level (1, @_);
72
58 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 73 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
59 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 74 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
60 my ($package, $ref) = (shift, shift); 75 my ($package, $ref) = (shift, shift);
61 my @attrs; 76 my @attrs;
62 for (@_) { 77 for (@_) {
77 }; 92 };
78 } 93 }
79 94
80} 95}
81 96
97=over 4
98
82=item $main 99=item $main
83 100
84This coroutine represents the main program. 101This coroutine represents the main program.
85 102
86=cut 103=cut
87 104
88our $main = new Coro; 105$main = new Coro;
89 106
90=item $current (or as function: current) 107=item $current (or as function: current)
91 108
92The 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).
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.
93 115
94=cut 116=cut
95 117
96# maybe some other module used Coro::Specific before... 118# maybe some other module used Coro::Specific before...
97if ($current) {
98 $main->{specific} = $current->{specific}; 119$main->{specific} = $current->{specific}
99} 120 if $current;
100 121
101our $current = $main; 122_set_current $main;
102 123
103sub current() { $current } 124sub current() { $current }
104 125
105=item $idle 126=item $idle
106 127
107The coroutine to switch to when no other coroutine is running. The default 128A callback that is called whenever the scheduler finds no ready coroutines
108implementation prints "FATAL: deadlock detected" and exits. 129to run. The default implementation prints "FATAL: deadlock detected" and
130exits, because the program has no other way to continue.
109 131
110=cut 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.
111 135
112# should be done using priorities :( 136Please note that if your callback recursively invokes perl (e.g. for event
113our $idle = new Coro sub { 137handlers), then it must be prepared to be called recursively.
114 print STDERR "FATAL: deadlock detected\n"; 138
115 exit(51); 139=cut
140
141$idle = sub {
142 require Carp;
143 Carp::croak ("FATAL: deadlock detected");
116}; 144};
117 145
118# this coroutine is necessary because a coroutine 146# this coroutine is necessary because a coroutine
119# cannot destroy itself. 147# cannot destroy itself.
120my @destroy; 148my @destroy;
121my $manager = new Coro sub { 149my $manager; $manager = new Coro sub {
122 while() { 150 while () {
123 # by overwriting the state object with the manager we destroy it 151 # by overwriting the state object with the manager we destroy it
124 # while still being able to schedule this coroutine (in case it has 152 # while still being able to schedule this coroutine (in case it has
125 # been readied multiple times. this is harmless since the manager 153 # been readied multiple times. this is harmless since the manager
126 # can be called as many times as neccessary and will always 154 # can be called as many times as neccessary and will always
127 # remove itself from the runqueue 155 # remove itself from the runqueue
128 (pop @destroy)->{_coro_state} = $manager->{_coro_state} while @destroy; 156 while (@destroy) {
157 my $coro = pop @destroy;
158 $coro->{status} ||= [];
159 $_->ready for @{delete $coro->{join} || []};
160
161 # the next line destroys the coro state, but keeps the
162 # coroutine itself intact (we basically make it a zombie
163 # coroutine that always runs the manager thread, so it's possible
164 # to transfer() to this coroutine).
165 $coro->_clone_state_from ($manager);
166 }
129 &schedule; 167 &schedule;
130 } 168 }
131}; 169};
132 170
133# static methods. not really. 171# static methods. not really.
134 172
173=back
174
135=head2 STATIC METHODS 175=head2 STATIC METHODS
136 176
137Static methods are actually functions that operate on the current process only. 177Static methods are actually functions that operate on the current coroutine only.
138 178
139=over 4 179=over 4
140 180
141=item async { ... } [@args...] 181=item async { ... } [@args...]
142 182
143Create a new asynchronous process and return it's process object 183Create a new asynchronous coroutine and return it's coroutine object
144(usually unused). When the sub returns the new process is automatically 184(usually unused). When the sub returns the new coroutine is automatically
145terminated. 185terminated.
186
187Calling C<exit> in a coroutine will not work correctly, so do not do that.
188
189When the coroutine dies, the program will exit, just as in the main
190program.
146 191
147 # create a new coroutine that just prints its arguments 192 # create a new coroutine that just prints its arguments
148 async { 193 async {
149 print "@_\n"; 194 print "@_\n";
150 } 1,2,3,4; 195 } 1,2,3,4;
151 196
152The coderef you submit MUST NOT be a closure that refers to variables
153in an outer scope. This does NOT work. Pass arguments into it instead.
154
155=cut 197=cut
156 198
157sub async(&@) { 199sub async(&@) {
158 my $pid = new Coro @_; 200 my $pid = new Coro @_;
159 $manager->ready; # this ensures that the stack is cloned from the manager
160 $pid->ready; 201 $pid->ready;
161 $pid; 202 $pid
162} 203}
163 204
164=item schedule 205=item schedule
165 206
166Calls the scheduler. Please note that the current process will not be put 207Calls the scheduler. Please note that the current coroutine will not be put
167into the ready queue, so calling this function usually means you will 208into the ready queue, so calling this function usually means you will
168never be called again. 209never be called again unless something else (e.g. an event handler) calls
210ready.
169 211
170=cut 212The canonical way to wait on external events is this:
213
214 {
215 # remember current coroutine
216 my $current = $Coro::current;
217
218 # register a hypothetical event handler
219 on_event_invoke sub {
220 # wake up sleeping coroutine
221 $current->ready;
222 undef $current;
223 };
224
225 # call schedule until event occured.
226 # in case we are woken up for other reasons
227 # (current still defined), loop.
228 Coro::schedule while $current;
229 }
171 230
172=item cede 231=item cede
173 232
174"Cede" to other processes. This function puts the current process into the 233"Cede" to other coroutines. This function puts the current coroutine into the
175ready queue and calls C<schedule>, which has the effect of giving up the 234ready queue and calls C<schedule>, which has the effect of giving up the
176current "timeslice" to other coroutines of the same or higher priority. 235current "timeslice" to other coroutines of the same or higher priority.
177 236
178=cut
179
180=item terminate 237=item terminate [arg...]
181 238
182Terminates the current process. 239Terminates the current coroutine with the given status values (see L<cancel>).
183
184Future versions of this function will allow result arguments.
185 240
186=cut 241=cut
187 242
188sub terminate { 243sub terminate {
189 $current->cancel; 244 $current->cancel (@_);
190 &schedule;
191 die; # NORETURN
192} 245}
193 246
194=back 247=back
195 248
196# dynamic methods 249# dynamic methods
197 250
198=head2 PROCESS METHODS 251=head2 COROUTINE METHODS
199 252
200These are the methods you can call on process objects. 253These are the methods you can call on coroutine objects.
201 254
202=over 4 255=over 4
203 256
204=item new Coro \&sub [, @args...] 257=item new Coro \&sub [, @args...]
205 258
206Create a new process and return it. When the sub returns the process 259Create a new coroutine and return it. When the sub returns the coroutine
207automatically terminates. To start the process you must first put it into 260automatically terminates as if C<terminate> with the returned values were
261called. To make the coroutine run you must first put it into the ready queue
208the ready queue by calling the ready method. 262by calling the ready method.
209 263
210The coderef you submit MUST NOT be a closure that refers to variables 264Calling C<exit> in a coroutine will not work correctly, so do not do that.
211in an outer scope. This does NOT work. Pass arguments into it instead.
212 265
213=cut 266=cut
214 267
215sub _newcoro { 268sub _run_coro {
216 terminate &{+shift}; 269 terminate &{+shift};
217} 270}
218 271
219sub new { 272sub new {
220 my $class = shift; 273 my $class = shift;
221 bless {
222 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
223 }, $class;
224}
225 274
226=item $process->ready 275 $class->SUPER::new (\&_run_coro, @_)
276}
227 277
228Put the current process into the ready queue. 278=item $success = $coroutine->ready
229 279
230=cut 280Put the given coroutine into the ready queue (according to it's priority)
281and return true. If the coroutine is already in the ready queue, do nothing
282and return false.
231 283
232=item $process->cancel 284=item $is_ready = $coroutine->is_ready
233 285
234Like C<terminate>, but terminates the specified process instead. 286Return wether the coroutine is currently the ready queue or not,
287
288=item $coroutine->cancel (arg...)
289
290Terminates the given coroutine and makes it return the given arguments as
291status (default: the empty list).
235 292
236=cut 293=cut
237 294
238sub cancel { 295sub cancel {
296 my $self = shift;
297 $self->{status} = [@_];
239 push @destroy, $_[0]; 298 push @destroy, $self;
240 $manager->ready; 299 $manager->ready;
241 &schedule if $current == $_[0]; 300 &schedule if $current == $self;
242} 301}
243 302
303=item $coroutine->join
304
305Wait until the coroutine terminates and return any values given to the
306C<terminate> or C<cancel> functions. C<join> can be called multiple times
307from multiple coroutine.
308
309=cut
310
311sub join {
312 my $self = shift;
313 unless ($self->{status}) {
314 push @{$self->{join}}, $current;
315 &schedule;
316 }
317 wantarray ? @{$self->{status}} : $self->{status}[0];
318}
319
244=item $oldprio = $process->prio($newprio) 320=item $oldprio = $coroutine->prio ($newprio)
245 321
246Sets the priority of the process. Higher priority processes get run before 322Sets (or gets, if the argument is missing) the priority of the
247lower priority processes. Priorities are smalled signed integer (currently 323coroutine. Higher priority coroutines get run before lower priority
324coroutines. Priorities are small signed integers (currently -4 .. +3),
248-4 .. +3), that you can refer to using PRIO_xxx constants (use the import 325that you can refer to using PRIO_xxx constants (use the import tag :prio
249tag :prio to get then): 326to get then):
250 327
251 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 328 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
252 3 > 1 > 0 > -1 > -3 > -4 329 3 > 1 > 0 > -1 > -3 > -4
253 330
254 # set priority to HIGH 331 # set priority to HIGH
255 current->prio(PRIO_HIGH); 332 current->prio(PRIO_HIGH);
256 333
257The idle coroutine ($Coro::idle) always has a lower priority than any 334The idle coroutine ($Coro::idle) always has a lower priority than any
258existing coroutine. 335existing coroutine.
259 336
260Changing the priority of the current process will take effect immediately, 337Changing the priority of the current coroutine will take effect immediately,
261but changing the priority of processes in the ready queue (but not 338but changing the priority of coroutines in the ready queue (but not
262running) will only take effect after the next schedule (of that 339running) will only take effect after the next schedule (of that
263process). This is a bug that will be fixed in some future version. 340coroutine). This is a bug that will be fixed in some future version.
264 341
265=cut
266
267sub prio {
268 my $old = $_[0]{prio};
269 $_[0]{prio} = $_[1] if @_ > 1;
270 $old;
271}
272
273=item $newprio = $process->nice($change) 342=item $newprio = $coroutine->nice ($change)
274 343
275Similar to C<prio>, but subtract the given value from the priority (i.e. 344Similar to C<prio>, but subtract the given value from the priority (i.e.
276higher values mean lower priority, just as in unix). 345higher values mean lower priority, just as in unix).
277 346
278=cut 347=item $olddesc = $coroutine->desc ($newdesc)
279 348
280sub nice { 349Sets (or gets in case the argument is missing) the description for this
281 $_[0]{prio} -= $_[1]; 350coroutine. This is just a free-form string you can associate with a coroutine.
351
352=cut
353
354sub desc {
355 my $old = $_[0]{desc};
356 $_[0]{desc} = $_[1] if @_ > 1;
357 $old;
282} 358}
283 359
284=back 360=back
285 361
362=head2 GLOBAL FUNCTIONS
363
364=over 4
365
366=item Coro::nready
367
368Returns the number of coroutines that are currently in the ready state,
369i.e. that can be swicthed to. The value C<0> means that the only runnable
370coroutine is the currently running one, so C<cede> would have no effect,
371and C<schedule> would cause a deadlock unless there is an idle handler
372that wakes up some coroutines.
373
374=item unblock_sub { ... }
375
376This utility function takes a BLOCK or code reference and "unblocks" it,
377returning the new coderef. This means that the new coderef will return
378immediately without blocking, returning nothing, while the original code
379ref will be called (with parameters) from within its own coroutine.
380
381The reason this fucntion exists is that many event libraries (such as the
382venerable L<Event|Event> module) are not coroutine-safe (a weaker form
383of thread-safety). This means you must not block within event callbacks,
384otherwise you might suffer from crashes or worse.
385
386This function allows your callbacks to block by executing them in another
387coroutine where it is safe to block. One example where blocking is handy
388is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
389disk.
390
391In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
392creating event callbacks that want to block.
393
394=cut
395
396our @unblock_pool;
397our @unblock_queue;
398our $UNBLOCK_POOL_SIZE = 2;
399
400sub unblock_handler_ {
401 while () {
402 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
403 $cb->(@arg);
404
405 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
406 push @unblock_pool, $Coro::current;
407 schedule;
408 }
409}
410
411our $unblock_scheduler = async {
412 while () {
413 while (my $cb = pop @unblock_queue) {
414 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
415 $handler->{arg} = $cb;
416 $handler->ready;
417 cede;
418 }
419
420 schedule;
421 }
422};
423
424sub unblock_sub(&) {
425 my $cb = shift;
426
427 sub {
428 push @unblock_queue, [$cb, @_];
429 $unblock_scheduler->ready;
430 }
431}
432
433=back
434
286=cut 435=cut
287 436
2881; 4371;
289 438
290=head1 BUGS/LIMITATIONS 439=head1 BUGS/LIMITATIONS
291 440
292 - you must make very sure that no coro is still active on global destruction. 441 - you must make very sure that no coro is still active on global
293 very bad things might happen otherwise (usually segfaults). 442 destruction. very bad things might happen otherwise (usually segfaults).
443
294 - this module is not thread-safe. You must only ever use this module from 444 - this module is not thread-safe. You should only ever use this module
295 the same thread (this requirement might be loosened in the future to 445 from the same thread (this requirement might be losened in the future
296 allow per-thread schedulers, but Coro::State does not yet allow this). 446 to allow per-thread schedulers, but Coro::State does not yet allow
447 this).
297 448
298=head1 SEE ALSO 449=head1 SEE ALSO
299 450
300L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 451Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
301L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>, 452
302L<Coro::Handle>, L<Coro::Socket>. 453Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
454
455Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
456
457Embedding: L<Coro:MakeMaker>
303 458
304=head1 AUTHOR 459=head1 AUTHOR
305 460
306 Marc Lehmann <pcg@goof.com> 461 Marc Lehmann <schmorp@schmorp.de>
307 http://www.goof.com/pcg/marc/ 462 http://home.schmorp.de/
308 463
309=cut 464=cut
310 465

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines