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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines