ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro.pm
Revision: 1.222
Committed: Tue Nov 18 08:59:46 2008 UTC (15 years, 6 months ago) by root
Branch: MAIN
Changes since 1.221: +8 -3 lines
Log Message:
*** empty log message ***

File Contents

# User Rev Content
1 root 1.1 =head1 NAME
2    
3 root 1.8 Coro - coroutine process abstraction
4 root 1.1
5     =head1 SYNOPSIS
6    
7 root 1.179 use Coro;
8    
9     async {
10     # some asynchronous thread of execution
11     print "2\n";
12     cede; # yield back to main
13     print "4\n";
14     };
15     print "1\n";
16     cede; # yield to coroutine
17     print "3\n";
18     cede; # and again
19    
20     # use locking
21 root 1.197 use Coro::Semaphore;
22 root 1.179 my $lock = new Coro::Semaphore;
23     my $locked;
24    
25     $lock->down;
26     $locked = 1;
27     $lock->up;
28 root 1.2
29 root 1.1 =head1 DESCRIPTION
30    
31 root 1.181 This module collection manages coroutines. Coroutines are similar to
32     threads but don't (in general) run in parallel at the same time even
33     on SMP machines. The specific flavor of coroutine used in this module
34     also guarantees you that it will not switch between coroutines unless
35 root 1.98 necessary, at easily-identified points in your program, so locking and
36     parallel access are rarely an issue, making coroutine programming much
37 root 1.181 safer and easier than threads programming.
38 root 1.98
39 root 1.181 Unlike a normal perl program, however, coroutines allow you to have
40     multiple running interpreters that share data, which is especially useful
41 root 1.182 to code pseudo-parallel processes and for event-based programming, such as
42     multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to
43     learn more.
44 root 1.181
45     Coroutines are also useful because Perl has no support for threads (the so
46     called "threads" that perl offers are nothing more than the (bad) process
47     emulation coming from the Windows platform: On standard operating systems
48     they serve no purpose whatsoever, except by making your programs slow and
49     making them use a lot of memory. Best disable them when building perl, or
50     aks your software vendor/distributor to do it for you).
51 root 1.98
52     In this module, coroutines are defined as "callchain + lexical variables +
53     @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
54     its own set of lexicals and its own set of perls most important global
55 root 1.152 variables (see L<Coro::State> for more configuration).
56 root 1.22
57 root 1.8 =cut
58    
59     package Coro;
60    
61 root 1.211 use strict qw(vars subs);
62 root 1.71 no warnings "uninitialized";
63 root 1.36
64 root 1.8 use Coro::State;
65    
66 root 1.83 use base qw(Coro::State Exporter);
67 pcg 1.55
68 root 1.83 our $idle; # idle handler
69 root 1.71 our $main; # main coroutine
70     our $current; # current coroutine
71 root 1.8
72 root 1.216 our $VERSION = 5.0;
73 root 1.8
74 root 1.105 our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
75 root 1.71 our %EXPORT_TAGS = (
76 root 1.31 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
77     );
78 root 1.97 our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
79 root 1.8
80 root 1.43 =over 4
81    
82 root 1.181 =item $Coro::main
83 root 1.2
84 root 1.181 This variable stores the coroutine object that represents the main
85     program. While you cna C<ready> it and do most other things you can do to
86     coroutines, it is mainly useful to compare again C<$Coro::current>, to see
87 root 1.196 whether you are running in the main program or not.
88 root 1.1
89     =cut
90    
91 root 1.220 # $main is now being initialised by Coro::State
92 root 1.8
93 root 1.181 =item $Coro::current
94 root 1.1
95 root 1.181 The coroutine object representing the current coroutine (the last
96     coroutine that the Coro scheduler switched to). The initial value is
97 root 1.220 C<$Coro::main> (of course).
98 root 1.181
99     This variable is B<strictly> I<read-only>. You can take copies of the
100     value stored in it and use it as any other coroutine object, but you must
101     not otherwise modify the variable itself.
102 root 1.1
103 root 1.8 =cut
104    
105 root 1.181 sub current() { $current } # [DEPRECATED]
106 root 1.9
107 root 1.181 =item $Coro::idle
108 root 1.9
109 root 1.181 This variable is mainly useful to integrate Coro into event loops. It is
110     usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
111     pretty low-level functionality.
112    
113     This variable stores a callback that is called whenever the scheduler
114     finds no ready coroutines to run. The default implementation prints
115     "FATAL: deadlock detected" and exits, because the program has no other way
116     to continue.
117 root 1.83
118     This hook is overwritten by modules such as C<Coro::Timer> and
119 root 1.181 C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
120 root 1.91 coroutine so the scheduler can run it.
121    
122 root 1.181 Note that the callback I<must not>, under any circumstances, block
123     the current coroutine. Normally, this is achieved by having an "idle
124     coroutine" that calls the event loop and then blocks again, and then
125     readying that coroutine in the idle handler.
126    
127     See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
128     technique.
129    
130 root 1.91 Please note that if your callback recursively invokes perl (e.g. for event
131 root 1.152 handlers), then it must be prepared to be called recursively itself.
132 root 1.9
133     =cut
134    
135 root 1.83 $idle = sub {
136 root 1.96 require Carp;
137     Carp::croak ("FATAL: deadlock detected");
138 root 1.9 };
139 root 1.8
140 root 1.103 sub _cancel {
141     my ($self) = @_;
142    
143     # free coroutine data and mark as destructed
144     $self->_destroy
145     or return;
146    
147     # call all destruction callbacks
148 root 1.142 $_->(@{$self->{_status}})
149 root 1.211 for @{ delete $self->{_on_destroy} || [] };
150 root 1.103 }
151    
152 root 1.24 # this coroutine is necessary because a coroutine
153     # cannot destroy itself.
154     my @destroy;
155 root 1.103 my $manager;
156    
157     $manager = new Coro sub {
158 pcg 1.57 while () {
159 root 1.103 (shift @destroy)->_cancel
160     while @destroy;
161    
162 root 1.24 &schedule;
163     }
164     };
165 root 1.208 $manager->{desc} = "[coro manager]";
166 root 1.103 $manager->prio (PRIO_MAX);
167    
168 root 1.43 =back
169 root 1.8
170 root 1.181 =head2 SIMPLE COROUTINE CREATION
171 root 1.8
172     =over 4
173    
174 root 1.13 =item async { ... } [@args...]
175 root 1.8
176 root 1.181 Create a new coroutine and return it's coroutine object (usually
177     unused). The coroutine will be put into the ready queue, so
178     it will start running automatically on the next scheduler run.
179    
180     The first argument is a codeblock/closure that should be executed in the
181     coroutine. When it returns argument returns the coroutine is automatically
182 root 1.8 terminated.
183    
184 root 1.181 The remaining arguments are passed as arguments to the closure.
185    
186 root 1.145 See the C<Coro::State::new> constructor for info about the coroutine
187 root 1.181 environment in which coroutines are executed.
188 root 1.145
189 root 1.122 Calling C<exit> in a coroutine will do the same as calling exit outside
190     the coroutine. Likewise, when the coroutine dies, the program will exit,
191     just as it would in the main program.
192 root 1.79
193 root 1.181 If you do not want that, you can provide a default C<die> handler, or
194     simply avoid dieing (by use of C<eval>).
195    
196     Example: Create a new coroutine that just prints its arguments.
197    
198 root 1.13 async {
199     print "@_\n";
200     } 1,2,3,4;
201    
202 root 1.8 =cut
203    
204 root 1.13 sub async(&@) {
205 root 1.104 my $coro = new Coro @_;
206     $coro->ready;
207     $coro
208 root 1.8 }
209 root 1.1
210 root 1.105 =item async_pool { ... } [@args...]
211    
212     Similar to C<async>, but uses a coroutine pool, so you should not call
213 root 1.181 terminate or join on it (although you are allowed to), and you get a
214     coroutine that might have executed other code already (which can be good
215     or bad :).
216    
217     On the plus side, this function is faster than creating (and destroying)
218 root 1.203 a completly new coroutine, so if you need a lot of generic coroutines in
219 root 1.181 quick successsion, use C<async_pool>, not C<async>.
220 root 1.105
221 root 1.181 The code block is executed in an C<eval> context and a warning will be
222 root 1.108 issued in case of an exception instead of terminating the program, as
223     C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
224     will not work in the expected way, unless you call terminate or cancel,
225 root 1.181 which somehow defeats the purpose of pooling (but is fine in the
226     exceptional case).
227 root 1.105
228 root 1.181 The priority will be reset to C<0> after each run, tracing will be
229 root 1.146 disabled, the description will be reset and the default output filehandle
230 root 1.181 gets restored, so you can change all these. Otherwise the coroutine will
231 root 1.146 be re-used "as-is": most notably if you change other per-coroutine global
232 root 1.204 stuff such as C<$/> you I<must needs> revert that change, which is most
233     simply done by using local as in: C<< local $/ >>.
234 root 1.105
235 root 1.204 The idle pool size is limited to C<8> idle coroutines (this can be
236     adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
237     coros as required.
238 root 1.105
239     If you are concerned about pooled coroutines growing a lot because a
240 root 1.133 single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
241     { terminate }> once per second or so to slowly replenish the pool. In
242     addition to that, when the stacks used by a handler grows larger than 16kb
243 root 1.181 (adjustable via $Coro::POOL_RSS) it will also be destroyed.
244 root 1.105
245     =cut
246    
247     our $POOL_SIZE = 8;
248 root 1.134 our $POOL_RSS = 16 * 1024;
249     our @async_pool;
250 root 1.105
251     sub pool_handler {
252 root 1.134 my $cb;
253    
254 root 1.105 while () {
255 root 1.134 eval {
256     while () {
257 root 1.136 _pool_1 $cb;
258 root 1.134 &$cb;
259 root 1.136 _pool_2 $cb;
260 root 1.135 &schedule;
261 root 1.134 }
262 root 1.105 };
263 root 1.134
264 root 1.193 if ($@) {
265     last if $@ eq "\3async_pool terminate\2\n";
266     warn $@;
267     }
268 root 1.106 }
269     }
270 root 1.105
271     sub async_pool(&@) {
272 root 1.218 # this is also inlined into the unblock_scheduler
273 root 1.135 my $coro = (pop @async_pool) || new Coro \&pool_handler;
274 root 1.105
275     $coro->{_invoke} = [@_];
276     $coro->ready;
277    
278     $coro
279     }
280    
281 root 1.181 =back
282    
283     =head2 STATIC METHODS
284    
285     Static methods are actually functions that operate on the current coroutine.
286    
287     =over 4
288    
289 root 1.8 =item schedule
290 root 1.6
291 root 1.181 Calls the scheduler. The scheduler will find the next coroutine that is
292     to be run from the ready queue and switches to it. The next coroutine
293     to be run is simply the one with the highest priority that is longest
294     in its ready queue. If there is no coroutine ready, it will clal the
295     C<$Coro::idle> hook.
296    
297     Please note that the current coroutine will I<not> be put into the ready
298     queue, so calling this function usually means you will never be called
299     again unless something else (e.g. an event handler) calls C<< ->ready >>,
300     thus waking you up.
301    
302     This makes C<schedule> I<the> generic method to use to block the current
303     coroutine and wait for events: first you remember the current coroutine in
304     a variable, then arrange for some callback of yours to call C<< ->ready
305     >> on that once some event happens, and last you call C<schedule> to put
306     yourself to sleep. Note that a lot of things can wake your coroutine up,
307 root 1.196 so you need to check whether the event indeed happened, e.g. by storing the
308 root 1.181 status in a variable.
309 root 1.91
310     The canonical way to wait on external events is this:
311    
312     {
313 root 1.92 # remember current coroutine
314 root 1.91 my $current = $Coro::current;
315    
316     # register a hypothetical event handler
317     on_event_invoke sub {
318     # wake up sleeping coroutine
319     $current->ready;
320     undef $current;
321     };
322    
323 root 1.124 # call schedule until event occurred.
324 root 1.91 # in case we are woken up for other reasons
325     # (current still defined), loop.
326     Coro::schedule while $current;
327     }
328 root 1.1
329 root 1.22 =item cede
330 root 1.1
331 root 1.181 "Cede" to other coroutines. This function puts the current coroutine into
332     the ready queue and calls C<schedule>, which has the effect of giving
333     up the current "timeslice" to other coroutines of the same or higher
334     priority. Once your coroutine gets its turn again it will automatically be
335     resumed.
336    
337     This function is often called C<yield> in other languages.
338 root 1.7
339 root 1.102 =item Coro::cede_notself
340    
341 root 1.181 Works like cede, but is not exported by default and will cede to I<any>
342     coroutine, regardless of priority. This is useful sometimes to ensure
343     progress is made.
344 root 1.102
345 root 1.40 =item terminate [arg...]
346 root 1.7
347 root 1.92 Terminates the current coroutine with the given status values (see L<cancel>).
348 root 1.13
349 root 1.141 =item killall
350    
351     Kills/terminates/cancels all coroutines except the currently running
352     one. This is useful after a fork, either in the child or the parent, as
353     usually only one of them should inherit the running coroutines.
354    
355 root 1.181 Note that while this will try to free some of the main programs resources,
356 root 1.196 you cannot free all of them, so if a coroutine that is not the main
357 root 1.181 program calls this function, there will be some one-time resource leak.
358    
359 root 1.1 =cut
360    
361 root 1.8 sub terminate {
362 pcg 1.59 $current->cancel (@_);
363 root 1.1 }
364 root 1.6
365 root 1.141 sub killall {
366     for (Coro::State::list) {
367     $_->cancel
368     if $_ != $current && UNIVERSAL::isa $_, "Coro";
369     }
370     }
371    
372 root 1.8 =back
373    
374 root 1.92 =head2 COROUTINE METHODS
375 root 1.8
376 root 1.181 These are the methods you can call on coroutine objects (or to create
377     them).
378 root 1.6
379 root 1.8 =over 4
380    
381 root 1.13 =item new Coro \&sub [, @args...]
382 root 1.8
383 root 1.181 Create a new coroutine and return it. When the sub returns, the coroutine
384 root 1.40 automatically terminates as if C<terminate> with the returned values were
385 root 1.181 called. To make the coroutine run you must first put it into the ready
386     queue by calling the ready method.
387 root 1.13
388 root 1.145 See C<async> and C<Coro::State::new> for additional info about the
389     coroutine environment.
390 root 1.89
391 root 1.6 =cut
392    
393 root 1.94 sub _run_coro {
394 root 1.13 terminate &{+shift};
395     }
396    
397 root 1.8 sub new {
398     my $class = shift;
399 root 1.83
400 root 1.94 $class->SUPER::new (\&_run_coro, @_)
401 root 1.8 }
402 root 1.6
403 root 1.92 =item $success = $coroutine->ready
404 root 1.1
405 root 1.181 Put the given coroutine into the end of its ready queue (there is one
406     queue for each priority) and return true. If the coroutine is already in
407     the ready queue, do nothing and return false.
408    
409     This ensures that the scheduler will resume this coroutine automatically
410     once all the coroutines of higher priority and all coroutines of the same
411     priority that were put into the ready queue earlier have been resumed.
412 root 1.1
413 root 1.92 =item $is_ready = $coroutine->is_ready
414 root 1.90
415 root 1.196 Return whether the coroutine is currently the ready queue or not,
416 root 1.28
417 root 1.92 =item $coroutine->cancel (arg...)
418 root 1.28
419 root 1.92 Terminates the given coroutine and makes it return the given arguments as
420 root 1.103 status (default: the empty list). Never returns if the coroutine is the
421     current coroutine.
422 root 1.28
423     =cut
424    
425     sub cancel {
426 pcg 1.59 my $self = shift;
427 root 1.142 $self->{_status} = [@_];
428 root 1.103
429     if ($current == $self) {
430     push @destroy, $self;
431     $manager->ready;
432     &schedule while 1;
433     } else {
434     $self->_cancel;
435     }
436 root 1.40 }
437    
438 root 1.208 =item $coroutine->throw ([$scalar])
439    
440     If C<$throw> is specified and defined, it will be thrown as an exception
441 root 1.222 inside the coroutine at the next convenient point in time. Otherwise
442     clears the exception object.
443    
444     Coro will check for the exception each time a schedule-like-function
445     returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
446     >>, C<< Coro::Handle->readable >> and so on. Note that this means that
447     when a coroutine is acquiring a lock, it might only throw after it has
448     sucessfully acquired it.
449 root 1.208
450     The exception object will be thrown "as is" with the specified scalar in
451     C<$@>, i.e. if it is a string, no line number or newline will be appended
452     (unlike with C<die>).
453    
454     This can be used as a softer means than C<cancel> to ask a coroutine to
455     end itself, although there is no guarantee that the exception will lead to
456     termination, and if the exception isn't caught it might well end the whole
457     program.
458    
459     You might also think of C<throw> as being the moral equivalent of
460     C<kill>ing a coroutine with a signal (in this case, a scalar).
461    
462 root 1.92 =item $coroutine->join
463 root 1.40
464     Wait until the coroutine terminates and return any values given to the
465 root 1.143 C<terminate> or C<cancel> functions. C<join> can be called concurrently
466 root 1.181 from multiple coroutines, and all will be resumed and given the status
467     return once the C<$coroutine> terminates.
468 root 1.40
469     =cut
470    
471     sub join {
472     my $self = shift;
473 root 1.103
474 root 1.142 unless ($self->{_status}) {
475 root 1.103 my $current = $current;
476    
477 root 1.142 push @{$self->{_on_destroy}}, sub {
478 root 1.103 $current->ready;
479     undef $current;
480     };
481    
482     &schedule while $current;
483 root 1.40 }
484 root 1.103
485 root 1.142 wantarray ? @{$self->{_status}} : $self->{_status}[0];
486 root 1.31 }
487    
488 root 1.101 =item $coroutine->on_destroy (\&cb)
489    
490     Registers a callback that is called when this coroutine gets destroyed,
491     but before it is joined. The callback gets passed the terminate arguments,
492 root 1.181 if any, and I<must not> die, under any circumstances.
493 root 1.101
494     =cut
495    
496     sub on_destroy {
497     my ($self, $cb) = @_;
498    
499 root 1.142 push @{ $self->{_on_destroy} }, $cb;
500 root 1.101 }
501    
502 root 1.92 =item $oldprio = $coroutine->prio ($newprio)
503 root 1.31
504 root 1.41 Sets (or gets, if the argument is missing) the priority of the
505 root 1.92 coroutine. Higher priority coroutines get run before lower priority
506     coroutines. Priorities are small signed integers (currently -4 .. +3),
507 root 1.41 that you can refer to using PRIO_xxx constants (use the import tag :prio
508     to get then):
509 root 1.31
510     PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
511     3 > 1 > 0 > -1 > -3 > -4
512    
513     # set priority to HIGH
514     current->prio(PRIO_HIGH);
515    
516     The idle coroutine ($Coro::idle) always has a lower priority than any
517     existing coroutine.
518    
519 root 1.92 Changing the priority of the current coroutine will take effect immediately,
520     but changing the priority of coroutines in the ready queue (but not
521 root 1.31 running) will only take effect after the next schedule (of that
522 root 1.92 coroutine). This is a bug that will be fixed in some future version.
523 root 1.31
524 root 1.92 =item $newprio = $coroutine->nice ($change)
525 root 1.31
526     Similar to C<prio>, but subtract the given value from the priority (i.e.
527     higher values mean lower priority, just as in unix).
528    
529 root 1.92 =item $olddesc = $coroutine->desc ($newdesc)
530 root 1.41
531     Sets (or gets in case the argument is missing) the description for this
532 root 1.208 coroutine. This is just a free-form string you can associate with a
533     coroutine.
534 root 1.150
535 root 1.208 This method simply sets the C<< $coroutine->{desc} >> member to the given
536     string. You can modify this member directly if you wish.
537 root 1.150
538 root 1.41 =cut
539    
540     sub desc {
541     my $old = $_[0]{desc};
542     $_[0]{desc} = $_[1] if @_ > 1;
543     $old;
544 root 1.8 }
545 root 1.1
546 root 1.8 =back
547 root 1.2
548 root 1.97 =head2 GLOBAL FUNCTIONS
549 root 1.92
550     =over 4
551    
552 root 1.97 =item Coro::nready
553    
554     Returns the number of coroutines that are currently in the ready state,
555 root 1.181 i.e. that can be switched to by calling C<schedule> directory or
556     indirectly. The value C<0> means that the only runnable coroutine is the
557     currently running one, so C<cede> would have no effect, and C<schedule>
558     would cause a deadlock unless there is an idle handler that wakes up some
559     coroutines.
560 root 1.97
561 root 1.103 =item my $guard = Coro::guard { ... }
562    
563 root 1.119 This creates and returns a guard object. Nothing happens until the object
564 root 1.103 gets destroyed, in which case the codeblock given as argument will be
565     executed. This is useful to free locks or other resources in case of a
566     runtime error or when the coroutine gets canceled, as in both cases the
567     guard block will be executed. The guard object supports only one method,
568     C<< ->cancel >>, which will keep the codeblock from being executed.
569    
570     Example: set some flag and clear it again when the coroutine gets canceled
571     or the function returns:
572    
573     sub do_something {
574     my $guard = Coro::guard { $busy = 0 };
575     $busy = 1;
576    
577     # do something that requires $busy to be true
578     }
579    
580     =cut
581    
582     sub guard(&) {
583     bless \(my $cb = $_[0]), "Coro::guard"
584     }
585    
586     sub Coro::guard::cancel {
587     ${$_[0]} = sub { };
588     }
589    
590     sub Coro::guard::DESTROY {
591     ${$_[0]}->();
592     }
593    
594    
595 root 1.92 =item unblock_sub { ... }
596    
597     This utility function takes a BLOCK or code reference and "unblocks" it,
598 root 1.181 returning a new coderef. Unblocking means that calling the new coderef
599     will return immediately without blocking, returning nothing, while the
600     original code ref will be called (with parameters) from within another
601     coroutine.
602 root 1.92
603 root 1.124 The reason this function exists is that many event libraries (such as the
604 root 1.92 venerable L<Event|Event> module) are not coroutine-safe (a weaker form
605     of thread-safety). This means you must not block within event callbacks,
606 root 1.181 otherwise you might suffer from crashes or worse. The only event library
607     currently known that is safe to use without C<unblock_sub> is L<EV>.
608 root 1.92
609     This function allows your callbacks to block by executing them in another
610     coroutine where it is safe to block. One example where blocking is handy
611     is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
612 root 1.181 disk, for example.
613 root 1.92
614     In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
615     creating event callbacks that want to block.
616    
617 root 1.181 If your handler does not plan to block (e.g. simply sends a message to
618     another coroutine, or puts some other coroutine into the ready queue),
619     there is no reason to use C<unblock_sub>.
620    
621 root 1.183 Note that you also need to use C<unblock_sub> for any other callbacks that
622     are indirectly executed by any C-based event loop. For example, when you
623     use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
624     provides callbacks that are the result of some event callback, then you
625     must not block either, or use C<unblock_sub>.
626    
627 root 1.92 =cut
628    
629     our @unblock_queue;
630    
631 root 1.105 # we create a special coro because we want to cede,
632     # to reduce pressure on the coro pool (because most callbacks
633     # return immediately and can be reused) and because we cannot cede
634     # inside an event callback.
635 root 1.132 our $unblock_scheduler = new Coro sub {
636 root 1.92 while () {
637     while (my $cb = pop @unblock_queue) {
638 root 1.105 # this is an inlined copy of async_pool
639 root 1.134 my $coro = (pop @async_pool) || new Coro \&pool_handler;
640 root 1.105
641     $coro->{_invoke} = $cb;
642     $coro->ready;
643     cede; # for short-lived callbacks, this reduces pressure on the coro pool
644 root 1.92 }
645 root 1.105 schedule; # sleep well
646 root 1.92 }
647     };
648 root 1.208 $unblock_scheduler->{desc} = "[unblock_sub scheduler]";
649 root 1.92
650     sub unblock_sub(&) {
651     my $cb = shift;
652    
653     sub {
654 root 1.105 unshift @unblock_queue, [$cb, @_];
655 root 1.92 $unblock_scheduler->ready;
656     }
657     }
658    
659     =back
660    
661 root 1.8 =cut
662 root 1.2
663 root 1.8 1;
664 root 1.14
665 root 1.17 =head1 BUGS/LIMITATIONS
666 root 1.14
667 root 1.217 =over 4
668    
669 root 1.219 =item fork with pthread backend
670    
671     When Coro is compiled using the pthread backend (which isn't recommended
672     but required on many BSDs as their libcs are completely broken), then
673     coroutines will not survive a fork. There is no known workaround except to
674     fix your libc and use a saner backend.
675    
676 root 1.217 =item perl process emulation ("threads")
677    
678 root 1.181 This module is not perl-pseudo-thread-safe. You should only ever use this
679     module from the same thread (this requirement might be removed in the
680     future to allow per-thread schedulers, but Coro::State does not yet allow
681 root 1.217 this). I recommend disabling thread support and using processes, as having
682     the windows process emulation enabled under unix roughly halves perl
683     performance, even when not used.
684    
685     =item coroutine switching not signal safe
686    
687     You must not switch to another coroutine from within a signal handler
688     (only relevant with %SIG - most event libraries provide safe signals).
689    
690 root 1.221 That means you I<MUST NOT> call any function that might "block" the
691 root 1.217 current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
692     anything that calls those. Everything else, including calling C<ready>,
693     works.
694    
695     =back
696    
697 root 1.9
698     =head1 SEE ALSO
699    
700 root 1.181 Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
701 root 1.152
702     Debugging: L<Coro::Debug>.
703    
704     Support/Utility: L<Coro::Specific>, L<Coro::Util>.
705 root 1.67
706     Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
707    
708 root 1.181 IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
709    
710     Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
711 root 1.152
712 root 1.181 XS API: L<Coro::MakeMaker>.
713 root 1.67
714 root 1.181 Low level Configuration, Coroutine Environment: L<Coro::State>.
715 root 1.1
716     =head1 AUTHOR
717    
718 root 1.66 Marc Lehmann <schmorp@schmorp.de>
719 root 1.64 http://home.schmorp.de/
720 root 1.1
721     =cut
722