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

Comparing Coro/Coro.pm (file contents):
Revision 1.87 by root, Sun Nov 26 02:16:19 2006 UTC vs.
Revision 1.98 by root, Mon Dec 4 21:56:00 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
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).
34
26In this module, coroutines are defined as "callchain + lexical variables 35In this module, coroutines are defined as "callchain + lexical variables +
27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own 36@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
28callchain, 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
29important global variables. 38variables.
30 39
31=cut 40=cut
32 41
33package Coro; 42package Coro;
34 43
41 50
42our $idle; # idle handler 51our $idle; # idle handler
43our $main; # main coroutine 52our $main; # main coroutine
44our $current; # current coroutine 53our $current; # current coroutine
45 54
46our $VERSION = '2.5'; 55our $VERSION = '3.1';
47 56
48our @EXPORT = qw(async cede schedule terminate current); 57our @EXPORT = qw(async cede schedule terminate current unblock_sub);
49our %EXPORT_TAGS = ( 58our %EXPORT_TAGS = (
50 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)],
51); 60);
52our @EXPORT_OK = @{$EXPORT_TAGS{prio}}; 61our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
53 62
54{ 63{
55 my @async; 64 my @async;
56 my $init; 65 my $init;
57 66
58 # this way of handling attributes simply is NOT scalable ;() 67 # this way of handling attributes simply is NOT scalable ;()
59 sub import { 68 sub import {
60 no strict 'refs'; 69 no strict 'refs';
61 70
62 Coro->export_to_level(1, @_); 71 Coro->export_to_level (1, @_);
63 72
64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 73 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 74 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
66 my ($package, $ref) = (shift, shift); 75 my ($package, $ref) = (shift, shift);
67 my @attrs; 76 my @attrs;
105C<Coro::current> function instead. 114C<Coro::current> function instead.
106 115
107=cut 116=cut
108 117
109# maybe some other module used Coro::Specific before... 118# maybe some other module used Coro::Specific before...
110if ($current) {
111 $main->{specific} = $current->{specific}; 119$main->{specific} = $current->{specific}
112} 120 if $current;
113 121
114$current = $main; 122_set_current $main;
115 123
116sub current() { $current } 124sub current() { $current }
117 125
118=item $idle 126=item $idle
119 127
120A callback that is called whenever the scheduler finds no ready coroutines 128A callback that is called whenever the scheduler finds no ready coroutines
121to run. The default implementation prints "FATAL: deadlock detected" and 129to run. The default implementation prints "FATAL: deadlock detected" and
122exits. 130exits, because the program has no other way to continue.
123 131
124This hook is overwritten by modules such as C<Coro::Timer> and 132This hook is overwritten by modules such as C<Coro::Timer> and
125C<Coro::Event> to wait on an external event that hopefully wakes up some 133C<Coro::Event> to wait on an external event that hopefully wake up a
126coroutine. 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.
127 138
128=cut 139=cut
129 140
130$idle = sub { 141$idle = sub {
131 print STDERR "FATAL: deadlock detected\n"; 142 require Carp;
132 exit (51); 143 Carp::croak ("FATAL: deadlock detected");
133}; 144};
134 145
135# this coroutine is necessary because a coroutine 146# this coroutine is necessary because a coroutine
136# cannot destroy itself. 147# cannot destroy itself.
137my @destroy; 148my @destroy;
146 my $coro = pop @destroy; 157 my $coro = pop @destroy;
147 $coro->{status} ||= []; 158 $coro->{status} ||= [];
148 $_->ready for @{delete $coro->{join} || []}; 159 $_->ready for @{delete $coro->{join} || []};
149 160
150 # the next line destroys the coro state, but keeps the 161 # the next line destroys the coro state, but keeps the
151 # process itself intact (we basically make it a zombie 162 # coroutine itself intact (we basically make it a zombie
152 # process that always runs the manager thread, so it's possible 163 # coroutine that always runs the manager thread, so it's possible
153 # to transfer() to this process). 164 # to transfer() to this coroutine).
154 $coro->_clone_state_from ($manager); 165 $coro->_clone_state_from ($manager);
155 } 166 }
156 &schedule; 167 &schedule;
157 } 168 }
158}; 169};
161 172
162=back 173=back
163 174
164=head2 STATIC METHODS 175=head2 STATIC METHODS
165 176
166Static methods are actually functions that operate on the current process only. 177Static methods are actually functions that operate on the current coroutine only.
167 178
168=over 4 179=over 4
169 180
170=item async { ... } [@args...] 181=item async { ... } [@args...]
171 182
172Create a new asynchronous process and return it's process object 183Create a new asynchronous coroutine and return it's coroutine object
173(usually unused). When the sub returns the new process is automatically 184(usually unused). When the sub returns the new coroutine is automatically
174terminated. 185terminated.
186
187Calling C<exit> in a coroutine will not work correctly, so do not do that.
175 188
176When the coroutine dies, the program will exit, just as in the main 189When the coroutine dies, the program will exit, just as in the main
177program. 190program.
178 191
179 # create a new coroutine that just prints its arguments 192 # create a new coroutine that just prints its arguments
189 $pid 202 $pid
190} 203}
191 204
192=item schedule 205=item schedule
193 206
194Calls 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
195into the ready queue, so calling this function usually means you will 208into the ready queue, so calling this function usually means you will
196never be called again. 209never be called again unless something else (e.g. an event handler) calls
210ready.
197 211
198=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 }
199 230
200=item cede 231=item cede
201 232
202"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
203ready 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
204current "timeslice" to other coroutines of the same or higher priority. 235current "timeslice" to other coroutines of the same or higher priority.
205 236
206=cut
207
208=item terminate [arg...] 237=item terminate [arg...]
209 238
210Terminates the current process with the given status values (see L<cancel>). 239Terminates the current coroutine with the given status values (see L<cancel>).
211 240
212=cut 241=cut
213 242
214sub terminate { 243sub terminate {
215 $current->cancel (@_); 244 $current->cancel (@_);
217 246
218=back 247=back
219 248
220# dynamic methods 249# dynamic methods
221 250
222=head2 PROCESS METHODS 251=head2 COROUTINE METHODS
223 252
224These are the methods you can call on process objects. 253These are the methods you can call on coroutine objects.
225 254
226=over 4 255=over 4
227 256
228=item new Coro \&sub [, @args...] 257=item new Coro \&sub [, @args...]
229 258
230Create 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
231automatically terminates as if C<terminate> with the returned values were 260automatically terminates as if C<terminate> with the returned values were
232called. To make the process run you must first put it into the ready queue 261called. To make the coroutine run you must first put it into the ready queue
233by calling the ready method. 262by calling the ready method.
234 263
235=cut 264Calling C<exit> in a coroutine will not work correctly, so do not do that.
236 265
266=cut
267
237sub _new_coro { 268sub _run_coro {
238 terminate &{+shift}; 269 terminate &{+shift};
239} 270}
240 271
241sub new { 272sub new {
242 my $class = shift; 273 my $class = shift;
243 274
244 $class->SUPER::new (\&_new_coro, @_) 275 $class->SUPER::new (\&_run_coro, @_)
245} 276}
246 277
247=item $process->ready 278=item $success = $coroutine->ready
248 279
249Put the given process into the ready queue. 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.
250 283
251=cut 284=item $is_ready = $coroutine->is_ready
252 285
286Return wether the coroutine is currently the ready queue or not,
287
253=item $process->cancel (arg...) 288=item $coroutine->cancel (arg...)
254 289
255Terminates the given process and makes it return the given arguments as 290Terminates the given coroutine and makes it return the given arguments as
256status (default: the empty list). 291status (default: the empty list).
257 292
258=cut 293=cut
259 294
260sub cancel { 295sub cancel {
263 push @destroy, $self; 298 push @destroy, $self;
264 $manager->ready; 299 $manager->ready;
265 &schedule if $current == $self; 300 &schedule if $current == $self;
266} 301}
267 302
268=item $process->join 303=item $coroutine->join
269 304
270Wait until the coroutine terminates and return any values given to the 305Wait until the coroutine terminates and return any values given to the
271C<terminate> or C<cancel> functions. C<join> can be called multiple times 306C<terminate> or C<cancel> functions. C<join> can be called multiple times
272from multiple processes. 307from multiple coroutine.
273 308
274=cut 309=cut
275 310
276sub join { 311sub join {
277 my $self = shift; 312 my $self = shift;
280 &schedule; 315 &schedule;
281 } 316 }
282 wantarray ? @{$self->{status}} : $self->{status}[0]; 317 wantarray ? @{$self->{status}} : $self->{status}[0];
283} 318}
284 319
285=item $oldprio = $process->prio ($newprio) 320=item $oldprio = $coroutine->prio ($newprio)
286 321
287Sets (or gets, if the argument is missing) the priority of the 322Sets (or gets, if the argument is missing) the priority of the
288process. Higher priority processes get run before lower priority 323coroutine. Higher priority coroutines get run before lower priority
289processes. Priorities are small signed integers (currently -4 .. +3), 324coroutines. Priorities are small signed integers (currently -4 .. +3),
290that you can refer to using PRIO_xxx constants (use the import tag :prio 325that you can refer to using PRIO_xxx constants (use the import tag :prio
291to get then): 326to get then):
292 327
293 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
294 3 > 1 > 0 > -1 > -3 > -4 329 3 > 1 > 0 > -1 > -3 > -4
297 current->prio(PRIO_HIGH); 332 current->prio(PRIO_HIGH);
298 333
299The idle coroutine ($Coro::idle) always has a lower priority than any 334The idle coroutine ($Coro::idle) always has a lower priority than any
300existing coroutine. 335existing coroutine.
301 336
302Changing the priority of the current process will take effect immediately, 337Changing the priority of the current coroutine will take effect immediately,
303but changing the priority of processes in the ready queue (but not 338but changing the priority of coroutines in the ready queue (but not
304running) will only take effect after the next schedule (of that 339running) will only take effect after the next schedule (of that
305process). 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.
306 341
307=item $newprio = $process->nice ($change) 342=item $newprio = $coroutine->nice ($change)
308 343
309Similar 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.
310higher values mean lower priority, just as in unix). 345higher values mean lower priority, just as in unix).
311 346
312=item $olddesc = $process->desc ($newdesc) 347=item $olddesc = $coroutine->desc ($newdesc)
313 348
314Sets (or gets in case the argument is missing) the description for this 349Sets (or gets in case the argument is missing) the description for this
315process. This is just a free-form string you can associate with a process. 350coroutine. This is just a free-form string you can associate with a coroutine.
316 351
317=cut 352=cut
318 353
319sub desc { 354sub desc {
320 my $old = $_[0]{desc}; 355 my $old = $_[0]{desc};
322 $old; 357 $old;
323} 358}
324 359
325=back 360=back
326 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
327=cut 435=cut
328 436
3291; 4371;
330 438
331=head1 BUGS/LIMITATIONS 439=head1 BUGS/LIMITATIONS

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines