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

Comparing Coro/Coro.pm (file contents):
Revision 1.61 by pcg, Fri May 14 13:25:08 2004 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
35BEGIN { eval { require warnings } && warnings->unimport ("uninitialized") } 44use strict;
45no warnings "uninitialized";
36 46
37use Coro::State; 47use Coro::State;
38 48
39use vars qw($idle $main $current); 49use base qw(Coro::State Exporter);
40 50
41use base Exporter; 51our $idle; # idle handler
52our $main; # main coroutine
53our $current; # current coroutine
42 54
43$VERSION = 0.97; 55our $VERSION = '3.3';
44 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 (@_) {
89 104
90$main = new Coro; 105$main = new Coro;
91 106
92=item $current (or as function: current) 107=item $current (or as function: current)
93 108
94The 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.
95 115
96=cut 116=cut
97 117
98# maybe some other module used Coro::Specific before... 118# maybe some other module used Coro::Specific before...
99if ($current) {
100 $main->{specific} = $current->{specific}; 119$main->{specific} = $current->{specific}
101} 120 if $current;
102 121
103$current = $main; 122_set_current $main;
104 123
105sub current() { $current } 124sub current() { $current }
106 125
107=item $idle 126=item $idle
108 127
109The coroutine to switch to when no other coroutine is running. The default 128A callback that is called whenever the scheduler finds no ready coroutines
110implementation 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.
111 131
112=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.
113 135
114# should be done using priorities :( 136Please note that if your callback recursively invokes perl (e.g. for event
115$idle = new Coro sub { 137handlers), then it must be prepared to be called recursively.
116 print STDERR "FATAL: deadlock detected\n"; 138
117 exit(51); 139=cut
140
141$idle = sub {
142 require Carp;
143 Carp::croak ("FATAL: deadlock detected");
118}; 144};
119 145
120# this coroutine is necessary because a coroutine 146# this coroutine is necessary because a coroutine
121# cannot destroy itself. 147# cannot destroy itself.
122my @destroy; 148my @destroy;
123my $manager;
124$manager = new Coro sub { 149my $manager; $manager = new Coro sub {
125 while () { 150 while () {
126 # by overwriting the state object with the manager we destroy it 151 # by overwriting the state object with the manager we destroy it
127 # 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
128 # been readied multiple times. this is harmless since the manager 153 # been readied multiple times. this is harmless since the manager
129 # can be called as many times as neccessary and will always 154 # can be called as many times as neccessary and will always
130 # remove itself from the runqueue 155 # remove itself from the runqueue
131 while (@destroy) { 156 while (@destroy) {
132 my $coro = pop @destroy; 157 my $coro = pop @destroy;
158
133 $coro->{status} ||= []; 159 $coro->{status} ||= [];
160
134 $_->ready for @{delete $coro->{join} || []}; 161 $_->ready for @{(delete $coro->{join} ) || []};
162 $_->(@{$coro->{status}}) for @{(delete $coro->{destroy_cb}) || []};
135 163
136 # the next line destroys the _coro_state, but keeps the 164 # the next line destroys the coro state, but keeps the
137 # process itself intact (we basically make it a zombie 165 # coroutine itself intact (we basically make it a zombie
138 # process that always runs the manager thread, so it's possible 166 # coroutine that always runs the manager thread, so it's possible
139 # to transfer() to this process). 167 # to transfer() to this coroutine).
140 $coro->{_coro_state} = $manager->{_coro_state}; 168 $coro->_clone_state_from ($manager);
141 } 169 }
142 &schedule; 170 &schedule;
143 } 171 }
144}; 172};
145 173
147 175
148=back 176=back
149 177
150=head2 STATIC METHODS 178=head2 STATIC METHODS
151 179
152Static methods are actually functions that operate on the current process only. 180Static methods are actually functions that operate on the current coroutine only.
153 181
154=over 4 182=over 4
155 183
156=item async { ... } [@args...] 184=item async { ... } [@args...]
157 185
158Create a new asynchronous process and return it's process object 186Create a new asynchronous coroutine and return it's coroutine object
159(usually unused). When the sub returns the new process is automatically 187(usually unused). When the sub returns the new coroutine is automatically
160terminated. 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.
161 194
162 # create a new coroutine that just prints its arguments 195 # create a new coroutine that just prints its arguments
163 async { 196 async {
164 print "@_\n"; 197 print "@_\n";
165 } 1,2,3,4; 198 } 1,2,3,4;
166 199
167=cut 200=cut
168 201
169sub async(&@) { 202sub async(&@) {
170 my $pid = new Coro @_; 203 my $pid = new Coro @_;
171 $manager->ready; # this ensures that the stack is cloned from the manager
172 $pid->ready; 204 $pid->ready;
173 $pid; 205 $pid
174} 206}
175 207
176=item schedule 208=item schedule
177 209
178Calls 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
179into the ready queue, so calling this function usually means you will 211into the ready queue, so calling this function usually means you will
180never be called again. 212never be called again unless something else (e.g. an event handler) calls
213ready.
181 214
182=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 }
183 233
184=item cede 234=item cede
185 235
186"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
187ready 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
188current "timeslice" to other coroutines of the same or higher priority. 238current "timeslice" to other coroutines of the same or higher priority.
189 239
190=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.
191 244
192=item terminate [arg...] 245=item terminate [arg...]
193 246
194Terminates the current process with the given status values (see L<cancel>). 247Terminates the current coroutine with the given status values (see L<cancel>).
195 248
196=cut 249=cut
197 250
198sub terminate { 251sub terminate {
199 $current->cancel (@_); 252 $current->cancel (@_);
201 254
202=back 255=back
203 256
204# dynamic methods 257# dynamic methods
205 258
206=head2 PROCESS METHODS 259=head2 COROUTINE METHODS
207 260
208These are the methods you can call on process objects. 261These are the methods you can call on coroutine objects.
209 262
210=over 4 263=over 4
211 264
212=item new Coro \&sub [, @args...] 265=item new Coro \&sub [, @args...]
213 266
214Create 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
215automatically terminates as if C<terminate> with the returned values were 268automatically terminates as if C<terminate> with the returned values were
216called. 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
217by calling the ready method. 270by calling the ready method.
218 271
219=cut 272Calling C<exit> in a coroutine will not work correctly, so do not do that.
220 273
274=cut
275
221sub _newcoro { 276sub _run_coro {
222 terminate &{+shift}; 277 terminate &{+shift};
223} 278}
224 279
225sub new { 280sub new {
226 my $class = shift; 281 my $class = shift;
227 bless {
228 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
229 }, $class;
230}
231 282
232=item $process->ready 283 $class->SUPER::new (\&_run_coro, @_)
284}
233 285
234Put the given process into the ready queue. 286=item $success = $coroutine->ready
235 287
236=cut 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.
237 291
292=item $is_ready = $coroutine->is_ready
293
294Return wether the coroutine is currently the ready queue or not,
295
238=item $process->cancel (arg...) 296=item $coroutine->cancel (arg...)
239 297
240Temrinates the given process and makes it return the given arguments as 298Terminates the given coroutine and makes it return the given arguments as
241status (default: the empty list). 299status (default: the empty list).
242 300
243=cut 301=cut
244 302
245sub cancel { 303sub cancel {
248 push @destroy, $self; 306 push @destroy, $self;
249 $manager->ready; 307 $manager->ready;
250 &schedule if $current == $self; 308 &schedule if $current == $self;
251} 309}
252 310
253=item $process->join 311=item $coroutine->join
254 312
255Wait until the coroutine terminates and return any values given to the 313Wait until the coroutine terminates and return any values given to the
256C<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
257from multiple processes. 315from multiple coroutine.
258 316
259=cut 317=cut
260 318
261sub join { 319sub join {
262 my $self = shift; 320 my $self = shift;
265 &schedule; 323 &schedule;
266 } 324 }
267 wantarray ? @{$self->{status}} : $self->{status}[0]; 325 wantarray ? @{$self->{status}} : $self->{status}[0];
268} 326}
269 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
270=item $oldprio = $process->prio($newprio) 342=item $oldprio = $coroutine->prio ($newprio)
271 343
272Sets (or gets, if the argument is missing) the priority of the 344Sets (or gets, if the argument is missing) the priority of the
273process. Higher priority processes get run before lower priority 345coroutine. Higher priority coroutines get run before lower priority
274processes. Priorities are small signed integers (currently -4 .. +3), 346coroutines. Priorities are small signed integers (currently -4 .. +3),
275that 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
276to get then): 348to get then):
277 349
278 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
279 3 > 1 > 0 > -1 > -3 > -4 351 3 > 1 > 0 > -1 > -3 > -4
282 current->prio(PRIO_HIGH); 354 current->prio(PRIO_HIGH);
283 355
284The idle coroutine ($Coro::idle) always has a lower priority than any 356The idle coroutine ($Coro::idle) always has a lower priority than any
285existing coroutine. 357existing coroutine.
286 358
287Changing the priority of the current process will take effect immediately, 359Changing the priority of the current coroutine will take effect immediately,
288but changing the priority of processes in the ready queue (but not 360but changing the priority of coroutines in the ready queue (but not
289running) will only take effect after the next schedule (of that 361running) will only take effect after the next schedule (of that
290process). 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.
291 363
292=cut
293
294sub prio {
295 my $old = $_[0]{prio};
296 $_[0]{prio} = $_[1] if @_ > 1;
297 $old;
298}
299
300=item $newprio = $process->nice($change) 364=item $newprio = $coroutine->nice ($change)
301 365
302Similar 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.
303higher values mean lower priority, just as in unix). 367higher values mean lower priority, just as in unix).
304 368
305=cut
306
307sub nice {
308 $_[0]{prio} -= $_[1];
309}
310
311=item $olddesc = $process->desc($newdesc) 369=item $olddesc = $coroutine->desc ($newdesc)
312 370
313Sets (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
314process. 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.
315 373
316=cut 374=cut
317 375
318sub desc { 376sub desc {
319 my $old = $_[0]{desc}; 377 my $old = $_[0]{desc};
321 $old; 379 $old;
322} 380}
323 381
324=back 382=back
325 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
326=cut 457=cut
327 458
3281; 4591;
329 460
330=head1 BUGS/LIMITATIONS 461=head1 BUGS/LIMITATIONS
337 to allow per-thread schedulers, but Coro::State does not yet allow 468 to allow per-thread schedulers, but Coro::State does not yet allow
338 this). 469 this).
339 470
340=head1 SEE ALSO 471=head1 SEE ALSO
341 472
342L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 473Support/Utility: L<Coro::Cont>, L<Coro::Specific>, L<Coro::State>, L<Coro::Util>.
343L<Coro::Signal>, L<Coro::State>, L<Coro::Timer>, L<Coro::Event>, 474
344L<Coro::L<Coro::RWLock>, Handle>, L<Coro::Socket>. 475Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
476
477Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::Select>.
478
479Embedding: L<Coro:MakeMaker>
345 480
346=head1 AUTHOR 481=head1 AUTHOR
347 482
348 Marc Lehmann <pcg@goof.com> 483 Marc Lehmann <schmorp@schmorp.de>
349 http://www.goof.com/pcg/marc/ 484 http://home.schmorp.de/
350 485
351=cut 486=cut
352 487

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines