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

Comparing Coro/Coro.pm (file contents):
Revision 1.83 by root, Fri Nov 24 15:34:33 2006 UTC vs.
Revision 1.94 by root, Sat Dec 2 18:01:30 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
41 41
42our $idle; # idle handler 42our $idle; # idle handler
43our $main; # main coroutine 43our $main; # main coroutine
44our $current; # current coroutine 44our $current; # current coroutine
45 45
46our $VERSION = '2.5'; 46our $VERSION = '3.0';
47 47
48our @EXPORT = qw(async cede schedule terminate current); 48our @EXPORT = qw(async cede schedule terminate current unblock_sub);
49our %EXPORT_TAGS = ( 49our %EXPORT_TAGS = (
50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 50 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
51); 51);
52our @EXPORT_OK = @{$EXPORT_TAGS{prio}}; 52our @EXPORT_OK = @{$EXPORT_TAGS{prio}};
53 53
57 57
58 # this way of handling attributes simply is NOT scalable ;() 58 # this way of handling attributes simply is NOT scalable ;()
59 sub import { 59 sub import {
60 no strict 'refs'; 60 no strict 'refs';
61 61
62 Coro->export_to_level(1, @_); 62 Coro->export_to_level (1, @_);
63 63
64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE}; 64 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub { 65 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
66 my ($package, $ref) = (shift, shift); 66 my ($package, $ref) = (shift, shift);
67 my @attrs; 67 my @attrs;
105C<Coro::current> function instead. 105C<Coro::current> function instead.
106 106
107=cut 107=cut
108 108
109# maybe some other module used Coro::Specific before... 109# maybe some other module used Coro::Specific before...
110if ($current) {
111 $main->{specific} = $current->{specific}; 110$main->{specific} = $current->{specific}
112} 111 if $current;
113 112
114$current = $main; 113_set_current $main;
115 114
116sub current() { $current } 115sub current() { $current }
117 116
118=item $idle 117=item $idle
119 118
120A callback that is called whenever the scheduler finds no ready coroutines 119A callback that is called whenever the scheduler finds no ready coroutines
121to run. The default implementation prints "FATAL: deadlock detected" and 120to run. The default implementation prints "FATAL: deadlock detected" and
122exits. 121exits, because the program has no other way to continue.
123 122
124This hook is overwritten by modules such as C<Coro::Timer> and 123This 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 124C<Coro::Event> to wait on an external event that hopefully wake up a
126coroutine. 125coroutine so the scheduler can run it.
126
127Please note that if your callback recursively invokes perl (e.g. for event
128handlers), then it must be prepared to be called recursively.
127 129
128=cut 130=cut
129 131
130$idle = sub { 132$idle = sub {
131 print STDERR "FATAL: deadlock detected\n"; 133 print STDERR "FATAL: deadlock detected\n";
133}; 135};
134 136
135# this coroutine is necessary because a coroutine 137# this coroutine is necessary because a coroutine
136# cannot destroy itself. 138# cannot destroy itself.
137my @destroy; 139my @destroy;
138my $manager;
139$manager = new Coro sub { 140my $manager; $manager = new Coro sub {
140 while () { 141 while () {
141 # by overwriting the state object with the manager we destroy it 142 # by overwriting the state object with the manager we destroy it
142 # while still being able to schedule this coroutine (in case it has 143 # while still being able to schedule this coroutine (in case it has
143 # been readied multiple times. this is harmless since the manager 144 # been readied multiple times. this is harmless since the manager
144 # can be called as many times as neccessary and will always 145 # can be called as many times as neccessary and will always
147 my $coro = pop @destroy; 148 my $coro = pop @destroy;
148 $coro->{status} ||= []; 149 $coro->{status} ||= [];
149 $_->ready for @{delete $coro->{join} || []}; 150 $_->ready for @{delete $coro->{join} || []};
150 151
151 # the next line destroys the coro state, but keeps the 152 # the next line destroys the coro state, but keeps the
152 # process itself intact (we basically make it a zombie 153 # coroutine itself intact (we basically make it a zombie
153 # process that always runs the manager thread, so it's possible 154 # coroutine that always runs the manager thread, so it's possible
154 # to transfer() to this process). 155 # to transfer() to this coroutine).
155 $coro->_clone_state_from ($manager); 156 $coro->_clone_state_from ($manager);
156 } 157 }
157 &schedule; 158 &schedule;
158 } 159 }
159}; 160};
162 163
163=back 164=back
164 165
165=head2 STATIC METHODS 166=head2 STATIC METHODS
166 167
167Static methods are actually functions that operate on the current process only. 168Static methods are actually functions that operate on the current coroutine only.
168 169
169=over 4 170=over 4
170 171
171=item async { ... } [@args...] 172=item async { ... } [@args...]
172 173
173Create a new asynchronous process and return it's process object 174Create a new asynchronous coroutine and return it's coroutine object
174(usually unused). When the sub returns the new process is automatically 175(usually unused). When the sub returns the new coroutine is automatically
175terminated. 176terminated.
177
178Calling C<exit> in a coroutine will not work correctly, so do not do that.
176 179
177When the coroutine dies, the program will exit, just as in the main 180When the coroutine dies, the program will exit, just as in the main
178program. 181program.
179 182
180 # create a new coroutine that just prints its arguments 183 # create a new coroutine that just prints its arguments
184 187
185=cut 188=cut
186 189
187sub async(&@) { 190sub async(&@) {
188 my $pid = new Coro @_; 191 my $pid = new Coro @_;
189 $manager->ready; # this ensures that the stack is cloned from the manager
190 $pid->ready; 192 $pid->ready;
191 $pid; 193 $pid
192} 194}
193 195
194=item schedule 196=item schedule
195 197
196Calls the scheduler. Please note that the current process will not be put 198Calls the scheduler. Please note that the current coroutine will not be put
197into the ready queue, so calling this function usually means you will 199into the ready queue, so calling this function usually means you will
198never be called again. 200never be called again unless something else (e.g. an event handler) calls
201ready.
199 202
200=cut 203The canonical way to wait on external events is this:
204
205 {
206 # remember current coroutine
207 my $current = $Coro::current;
208
209 # register a hypothetical event handler
210 on_event_invoke sub {
211 # wake up sleeping coroutine
212 $current->ready;
213 undef $current;
214 };
215
216 # call schedule until event occured.
217 # in case we are woken up for other reasons
218 # (current still defined), loop.
219 Coro::schedule while $current;
220 }
201 221
202=item cede 222=item cede
203 223
204"Cede" to other processes. This function puts the current process into the 224"Cede" to other coroutines. This function puts the current coroutine into the
205ready queue and calls C<schedule>, which has the effect of giving up the 225ready queue and calls C<schedule>, which has the effect of giving up the
206current "timeslice" to other coroutines of the same or higher priority. 226current "timeslice" to other coroutines of the same or higher priority.
207 227
208=cut
209
210=item terminate [arg...] 228=item terminate [arg...]
211 229
212Terminates the current process with the given status values (see L<cancel>). 230Terminates the current coroutine with the given status values (see L<cancel>).
213 231
214=cut 232=cut
215 233
216sub terminate { 234sub terminate {
217 $current->cancel (@_); 235 $current->cancel (@_);
219 237
220=back 238=back
221 239
222# dynamic methods 240# dynamic methods
223 241
224=head2 PROCESS METHODS 242=head2 COROUTINE METHODS
225 243
226These are the methods you can call on process objects. 244These are the methods you can call on coroutine objects.
227 245
228=over 4 246=over 4
229 247
230=item new Coro \&sub [, @args...] 248=item new Coro \&sub [, @args...]
231 249
232Create a new process and return it. When the sub returns the process 250Create a new coroutine and return it. When the sub returns the coroutine
233automatically terminates as if C<terminate> with the returned values were 251automatically terminates as if C<terminate> with the returned values were
234called. To make the process run you must first put it into the ready queue 252called. To make the coroutine run you must first put it into the ready queue
235by calling the ready method. 253by calling the ready method.
236 254
237=cut 255Calling C<exit> in a coroutine will not work correctly, so do not do that.
238 256
257=cut
258
239sub _newcoro { 259sub _run_coro {
240 terminate &{+shift}; 260 terminate &{+shift};
241} 261}
242 262
243sub new { 263sub new {
244 my $class = shift; 264 my $class = shift;
245 265
246 $class->SUPER::new (\&_newcoro, @_) 266 $class->SUPER::new (\&_run_coro, @_)
247} 267}
248 268
249=item $process->ready 269=item $success = $coroutine->ready
250 270
251Put the given process into the ready queue. 271Put the given coroutine into the ready queue (according to it's priority)
272and return true. If the coroutine is already in the ready queue, do nothing
273and return false.
252 274
253=cut 275=item $is_ready = $coroutine->is_ready
254 276
277Return wether the coroutine is currently the ready queue or not,
278
255=item $process->cancel (arg...) 279=item $coroutine->cancel (arg...)
256 280
257Terminates the given process and makes it return the given arguments as 281Terminates the given coroutine and makes it return the given arguments as
258status (default: the empty list). 282status (default: the empty list).
259 283
260=cut 284=cut
261 285
262sub cancel { 286sub cancel {
265 push @destroy, $self; 289 push @destroy, $self;
266 $manager->ready; 290 $manager->ready;
267 &schedule if $current == $self; 291 &schedule if $current == $self;
268} 292}
269 293
270=item $process->join 294=item $coroutine->join
271 295
272Wait until the coroutine terminates and return any values given to the 296Wait until the coroutine terminates and return any values given to the
273C<terminate> or C<cancel> functions. C<join> can be called multiple times 297C<terminate> or C<cancel> functions. C<join> can be called multiple times
274from multiple processes. 298from multiple coroutine.
275 299
276=cut 300=cut
277 301
278sub join { 302sub join {
279 my $self = shift; 303 my $self = shift;
282 &schedule; 306 &schedule;
283 } 307 }
284 wantarray ? @{$self->{status}} : $self->{status}[0]; 308 wantarray ? @{$self->{status}} : $self->{status}[0];
285} 309}
286 310
287=item $oldprio = $process->prio ($newprio) 311=item $oldprio = $coroutine->prio ($newprio)
288 312
289Sets (or gets, if the argument is missing) the priority of the 313Sets (or gets, if the argument is missing) the priority of the
290process. Higher priority processes get run before lower priority 314coroutine. Higher priority coroutines get run before lower priority
291processes. Priorities are small signed integers (currently -4 .. +3), 315coroutines. Priorities are small signed integers (currently -4 .. +3),
292that you can refer to using PRIO_xxx constants (use the import tag :prio 316that you can refer to using PRIO_xxx constants (use the import tag :prio
293to get then): 317to get then):
294 318
295 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 319 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
296 3 > 1 > 0 > -1 > -3 > -4 320 3 > 1 > 0 > -1 > -3 > -4
299 current->prio(PRIO_HIGH); 323 current->prio(PRIO_HIGH);
300 324
301The idle coroutine ($Coro::idle) always has a lower priority than any 325The idle coroutine ($Coro::idle) always has a lower priority than any
302existing coroutine. 326existing coroutine.
303 327
304Changing the priority of the current process will take effect immediately, 328Changing the priority of the current coroutine will take effect immediately,
305but changing the priority of processes in the ready queue (but not 329but changing the priority of coroutines in the ready queue (but not
306running) will only take effect after the next schedule (of that 330running) will only take effect after the next schedule (of that
307process). This is a bug that will be fixed in some future version. 331coroutine). This is a bug that will be fixed in some future version.
308 332
309=item $newprio = $process->nice ($change) 333=item $newprio = $coroutine->nice ($change)
310 334
311Similar to C<prio>, but subtract the given value from the priority (i.e. 335Similar to C<prio>, but subtract the given value from the priority (i.e.
312higher values mean lower priority, just as in unix). 336higher values mean lower priority, just as in unix).
313 337
314=item $olddesc = $process->desc ($newdesc) 338=item $olddesc = $coroutine->desc ($newdesc)
315 339
316Sets (or gets in case the argument is missing) the description for this 340Sets (or gets in case the argument is missing) the description for this
317process. This is just a free-form string you can associate with a process. 341coroutine. This is just a free-form string you can associate with a coroutine.
318 342
319=cut 343=cut
320 344
321sub desc { 345sub desc {
322 my $old = $_[0]{desc}; 346 my $old = $_[0]{desc};
324 $old; 348 $old;
325} 349}
326 350
327=back 351=back
328 352
353=head2 UTILITY FUNCTIONS
354
355=over 4
356
357=item unblock_sub { ... }
358
359This utility function takes a BLOCK or code reference and "unblocks" it,
360returning the new coderef. This means that the new coderef will return
361immediately without blocking, returning nothing, while the original code
362ref will be called (with parameters) from within its own coroutine.
363
364The reason this fucntion exists is that many event libraries (such as the
365venerable L<Event|Event> module) are not coroutine-safe (a weaker form
366of thread-safety). This means you must not block within event callbacks,
367otherwise you might suffer from crashes or worse.
368
369This function allows your callbacks to block by executing them in another
370coroutine where it is safe to block. One example where blocking is handy
371is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
372disk.
373
374In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
375creating event callbacks that want to block.
376
377=cut
378
379our @unblock_pool;
380our @unblock_queue;
381our $UNBLOCK_POOL_SIZE = 2;
382
383sub unblock_handler_ {
384 while () {
385 my ($cb, @arg) = @{ delete $Coro::current->{arg} };
386 $cb->(@arg);
387
388 last if @unblock_pool >= $UNBLOCK_POOL_SIZE;
389 push @unblock_pool, $Coro::current;
390 schedule;
391 }
392}
393
394our $unblock_scheduler = async {
395 while () {
396 while (my $cb = pop @unblock_queue) {
397 my $handler = (pop @unblock_pool or new Coro \&unblock_handler_);
398 $handler->{arg} = $cb;
399 $handler->ready;
400 cede;
401 }
402
403 schedule;
404 }
405};
406
407sub unblock_sub(&) {
408 my $cb = shift;
409
410 sub {
411 push @unblock_queue, [$cb, @_];
412 $unblock_scheduler->ready;
413 }
414}
415
416=back
417
329=cut 418=cut
330 419
3311; 4201;
332 421
333=head1 BUGS/LIMITATIONS 422=head1 BUGS/LIMITATIONS

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines