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

Comparing Coro/Coro.pm (file contents):
Revision 1.88 by root, Sun Nov 26 02:54:55 2006 UTC vs.
Revision 1.102 by root, Fri Dec 29 11:37:49 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 = '3.0'; 55our $VERSION = '3.3';
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;
142 # been readied multiple times. this is harmless since the manager 153 # been readied multiple times. this is harmless since the manager
143 # can be called as many times as neccessary and will always 154 # can be called as many times as neccessary and will always
144 # remove itself from the runqueue 155 # remove itself from the runqueue
145 while (@destroy) { 156 while (@destroy) {
146 my $coro = pop @destroy; 157 my $coro = pop @destroy;
158
147 $coro->{status} ||= []; 159 $coro->{status} ||= [];
160
148 $_->ready for @{delete $coro->{join} || []}; 161 $_->ready for @{(delete $coro->{join} ) || []};
162 $_->(@{$coro->{status}}) for @{(delete $coro->{destroy_cb}) || []};
149 163
150 # the next line destroys the coro state, but keeps the 164 # the next line destroys the coro state, but keeps the
151 # process itself intact (we basically make it a zombie 165 # coroutine itself intact (we basically make it a zombie
152 # process that always runs the manager thread, so it's possible 166 # coroutine that always runs the manager thread, so it's possible
153 # to transfer() to this process). 167 # to transfer() to this coroutine).
154 $coro->_clone_state_from ($manager); 168 $coro->_clone_state_from ($manager);
155 } 169 }
156 &schedule; 170 &schedule;
157 } 171 }
158}; 172};
161 175
162=back 176=back
163 177
164=head2 STATIC METHODS 178=head2 STATIC METHODS
165 179
166Static methods are actually functions that operate on the current process only. 180Static methods are actually functions that operate on the current coroutine only.
167 181
168=over 4 182=over 4
169 183
170=item async { ... } [@args...] 184=item async { ... } [@args...]
171 185
172Create a new asynchronous process and return it's process object 186Create a new asynchronous coroutine and return it's coroutine object
173(usually unused). When the sub returns the new process is automatically 187(usually unused). When the sub returns the new coroutine is automatically
174terminated. 188terminated.
189
190Calling C<exit> in a coroutine will not work correctly, so do not do that.
175 191
176When the coroutine dies, the program will exit, just as in the main 192When the coroutine dies, the program will exit, just as in the main
177program. 193program.
178 194
179 # create a new coroutine that just prints its arguments 195 # create a new coroutine that just prints its arguments
189 $pid 205 $pid
190} 206}
191 207
192=item schedule 208=item schedule
193 209
194Calls the scheduler. Please note that the current process will not be put 210Calls the scheduler. Please note that the current coroutine will not be put
195into the ready queue, so calling this function usually means you will 211into the ready queue, so calling this function usually means you will
196never be called again. 212never be called again unless something else (e.g. an event handler) calls
213ready.
197 214
198=cut 215The canonical way to wait on external events is this:
216
217 {
218 # remember current coroutine
219 my $current = $Coro::current;
220
221 # register a hypothetical event handler
222 on_event_invoke sub {
223 # wake up sleeping coroutine
224 $current->ready;
225 undef $current;
226 };
227
228 # call schedule until event occured.
229 # in case we are woken up for other reasons
230 # (current still defined), loop.
231 Coro::schedule while $current;
232 }
199 233
200=item cede 234=item cede
201 235
202"Cede" to other processes. This function puts the current process into the 236"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 237ready queue and calls C<schedule>, which has the effect of giving up the
204current "timeslice" to other coroutines of the same or higher priority. 238current "timeslice" to other coroutines of the same or higher priority.
205 239
206=cut 240=item Coro::cede_notself
241
242Works like cede, but is not exported by default and will cede to any
243coroutine, regardless of priority, once.
207 244
208=item terminate [arg...] 245=item terminate [arg...]
209 246
210Terminates the current process with the given status values (see L<cancel>). 247Terminates the current coroutine with the given status values (see L<cancel>).
211 248
212=cut 249=cut
213 250
214sub terminate { 251sub terminate {
215 $current->cancel (@_); 252 $current->cancel (@_);
217 254
218=back 255=back
219 256
220# dynamic methods 257# dynamic methods
221 258
222=head2 PROCESS METHODS 259=head2 COROUTINE METHODS
223 260
224These are the methods you can call on process objects. 261These are the methods you can call on coroutine objects.
225 262
226=over 4 263=over 4
227 264
228=item new Coro \&sub [, @args...] 265=item new Coro \&sub [, @args...]
229 266
230Create a new process and return it. When the sub returns the process 267Create a new coroutine and return it. When the sub returns the coroutine
231automatically terminates as if C<terminate> with the returned values were 268automatically 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 269called. To make the coroutine run you must first put it into the ready queue
233by calling the ready method. 270by calling the ready method.
234 271
235=cut 272Calling C<exit> in a coroutine will not work correctly, so do not do that.
236 273
274=cut
275
237sub _new_coro { 276sub _run_coro {
238 terminate &{+shift}; 277 terminate &{+shift};
239} 278}
240 279
241sub new { 280sub new {
242 my $class = shift; 281 my $class = shift;
243 282
244 $class->SUPER::new (\&_new_coro, @_) 283 $class->SUPER::new (\&_run_coro, @_)
245} 284}
246 285
247=item $process->ready 286=item $success = $coroutine->ready
248 287
249Put the given process into the ready queue. 288Put the given coroutine into the ready queue (according to it's priority)
289and return true. If the coroutine is already in the ready queue, do nothing
290and return false.
250 291
251=cut 292=item $is_ready = $coroutine->is_ready
252 293
294Return wether the coroutine is currently the ready queue or not,
295
253=item $process->cancel (arg...) 296=item $coroutine->cancel (arg...)
254 297
255Terminates the given process and makes it return the given arguments as 298Terminates the given coroutine and makes it return the given arguments as
256status (default: the empty list). 299status (default: the empty list).
257 300
258=cut 301=cut
259 302
260sub cancel { 303sub cancel {
263 push @destroy, $self; 306 push @destroy, $self;
264 $manager->ready; 307 $manager->ready;
265 &schedule if $current == $self; 308 &schedule if $current == $self;
266} 309}
267 310
268=item $process->join 311=item $coroutine->join
269 312
270Wait until the coroutine terminates and return any values given to the 313Wait until the coroutine terminates and return any values given to the
271C<terminate> or C<cancel> functions. C<join> can be called multiple times 314C<terminate> or C<cancel> functions. C<join> can be called multiple times
272from multiple processes. 315from multiple coroutine.
273 316
274=cut 317=cut
275 318
276sub join { 319sub join {
277 my $self = shift; 320 my $self = shift;
280 &schedule; 323 &schedule;
281 } 324 }
282 wantarray ? @{$self->{status}} : $self->{status}[0]; 325 wantarray ? @{$self->{status}} : $self->{status}[0];
283} 326}
284 327
328=item $coroutine->on_destroy (\&cb)
329
330Registers a callback that is called when this coroutine gets destroyed,
331but before it is joined. The callback gets passed the terminate arguments,
332if any.
333
334=cut
335
336sub on_destroy {
337 my ($self, $cb) = @_;
338
339 push @{ $self->{destroy_cb} }, $cb;
340}
341
285=item $oldprio = $process->prio ($newprio) 342=item $oldprio = $coroutine->prio ($newprio)
286 343
287Sets (or gets, if the argument is missing) the priority of the 344Sets (or gets, if the argument is missing) the priority of the
288process. Higher priority processes get run before lower priority 345coroutine. Higher priority coroutines get run before lower priority
289processes. Priorities are small signed integers (currently -4 .. +3), 346coroutines. Priorities are small signed integers (currently -4 .. +3),
290that you can refer to using PRIO_xxx constants (use the import tag :prio 347that you can refer to using PRIO_xxx constants (use the import tag :prio
291to get then): 348to get then):
292 349
293 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 350 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
294 3 > 1 > 0 > -1 > -3 > -4 351 3 > 1 > 0 > -1 > -3 > -4
297 current->prio(PRIO_HIGH); 354 current->prio(PRIO_HIGH);
298 355
299The idle coroutine ($Coro::idle) always has a lower priority than any 356The idle coroutine ($Coro::idle) always has a lower priority than any
300existing coroutine. 357existing coroutine.
301 358
302Changing the priority of the current process will take effect immediately, 359Changing the priority of the current coroutine will take effect immediately,
303but changing the priority of processes in the ready queue (but not 360but changing the priority of coroutines in the ready queue (but not
304running) will only take effect after the next schedule (of that 361running) will only take effect after the next schedule (of that
305process). This is a bug that will be fixed in some future version. 362coroutine). This is a bug that will be fixed in some future version.
306 363
307=item $newprio = $process->nice ($change) 364=item $newprio = $coroutine->nice ($change)
308 365
309Similar to C<prio>, but subtract the given value from the priority (i.e. 366Similar to C<prio>, but subtract the given value from the priority (i.e.
310higher values mean lower priority, just as in unix). 367higher values mean lower priority, just as in unix).
311 368
312=item $olddesc = $process->desc ($newdesc) 369=item $olddesc = $coroutine->desc ($newdesc)
313 370
314Sets (or gets in case the argument is missing) the description for this 371Sets (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. 372coroutine. This is just a free-form string you can associate with a coroutine.
316 373
317=cut 374=cut
318 375
319sub desc { 376sub desc {
320 my $old = $_[0]{desc}; 377 my $old = $_[0]{desc};
322 $old; 379 $old;
323} 380}
324 381
325=back 382=back
326 383
384=head2 GLOBAL FUNCTIONS
385
386=over 4
387
388=item Coro::nready
389
390Returns the number of coroutines that are currently in the ready state,
391i.e. that can be swicthed to. The value C<0> means that the only runnable
392coroutine is the currently running one, so C<cede> would have no effect,
393and C<schedule> would cause a deadlock unless there is an idle handler
394that wakes up some coroutines.
395
396=item unblock_sub { ... }
397
398This utility function takes a BLOCK or code reference and "unblocks" it,
399returning the new coderef. This means that the new coderef will return
400immediately without blocking, returning nothing, while the original code
401ref will be called (with parameters) from within its own coroutine.
402
403The reason this fucntion exists is that many event libraries (such as the
404venerable L<Event|Event> module) are not coroutine-safe (a weaker form
405of thread-safety). This means you must not block within event callbacks,
406otherwise you might suffer from crashes or worse.
407
408This function allows your callbacks to block by executing them in another
409coroutine where it is safe to block. One example where blocking is handy
410is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
411disk.
412
413In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
414creating event callbacks that want to block.
415
416=cut
417
418our @unblock_pool;
419our @unblock_queue;
420our $UNBLOCK_POOL_SIZE = 2;
421
422sub unblock_handler_ {
423 while () {
424 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
425 $cb->(@arg);
426
427 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
428 push @unblock_pool, $Coro::current;
429 schedule;
430 }
431}
432
433our $unblock_scheduler = async {
434 while () {
435 while (my $cb = pop @unblock_queue) {
436 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
437 $handler->{arg} = $cb;
438 $handler->ready;
439 cede;
440 }
441
442 schedule;
443 }
444};
445
446sub unblock_sub(&) {
447 my $cb = shift;
448
449 sub {
450 push @unblock_queue, [$cb, @_];
451 $unblock_scheduler->ready;
452 }
453}
454
455=back
456
327=cut 457=cut
328 458
3291; 4591;
330 460
331=head1 BUGS/LIMITATIONS 461=head1 BUGS/LIMITATIONS

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines