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

Comparing Coro/Coro.pm (file contents):
Revision 1.180 by root, Fri Apr 25 04:28:50 2008 UTC vs.
Revision 1.210 by root, Sat Nov 8 16:46:32 2008 UTC

16 cede; # yield to coroutine 16 cede; # yield to coroutine
17 print "3\n"; 17 print "3\n";
18 cede; # and again 18 cede; # and again
19 19
20 # use locking 20 # use locking
21 use Coro::Semaphore;
21 my $lock = new Coro::Semaphore; 22 my $lock = new Coro::Semaphore;
22 my $locked; 23 my $locked;
23 24
24 $lock->down; 25 $lock->down;
25 $locked = 1; 26 $locked = 1;
26 $lock->up; 27 $lock->up;
27 28
28=head1 DESCRIPTION 29=head1 DESCRIPTION
29 30
30This module collection manages coroutines. Coroutines are similar 31This module collection manages coroutines. Coroutines are similar to
31to threads but don't run in parallel at the same time even on SMP 32threads but don't (in general) run in parallel at the same time even
32machines. The specific flavor of coroutine used in this module also 33on SMP machines. The specific flavor of coroutine used in this module
33guarantees you that it will not switch between coroutines unless 34also guarantees you that it will not switch between coroutines unless
34necessary, at easily-identified points in your program, so locking and 35necessary, at easily-identified points in your program, so locking and
35parallel access are rarely an issue, making coroutine programming much 36parallel access are rarely an issue, making coroutine programming much
36safer than threads programming. 37safer and easier than threads programming.
37 38
38(Perl, however, does not natively support real threads but instead does a 39Unlike a normal perl program, however, coroutines allow you to have
39very slow and memory-intensive emulation of processes using threads. This 40multiple running interpreters that share data, which is especially useful
40is a performance win on Windows machines, and a loss everywhere else). 41to code pseudo-parallel processes and for event-based programming, such as
42multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to
43learn more.
44
45Coroutines are also useful because Perl has no support for threads (the so
46called "threads" that perl offers are nothing more than the (bad) process
47emulation coming from the Windows platform: On standard operating systems
48they serve no purpose whatsoever, except by making your programs slow and
49making them use a lot of memory. Best disable them when building perl, or
50aks your software vendor/distributor to do it for you).
41 51
42In this module, coroutines are defined as "callchain + lexical variables + 52In this module, coroutines are defined as "callchain + lexical variables +
43@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, 53@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
44its own set of lexicals and its own set of perls most important global 54its own set of lexicals and its own set of perls most important global
45variables (see L<Coro::State> for more configuration). 55variables (see L<Coro::State> for more configuration).
57 67
58our $idle; # idle handler 68our $idle; # idle handler
59our $main; # main coroutine 69our $main; # main coroutine
60our $current; # current coroutine 70our $current; # current coroutine
61 71
62our $VERSION = 4.6; 72our $VERSION = 4.9;
63 73
64our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 74our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
65our %EXPORT_TAGS = ( 75our %EXPORT_TAGS = (
66 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 76 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
67); 77);
68our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 78our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
69 79
70=over 4 80=over 4
71 81
72=item $main 82=item $Coro::main
73 83
74This coroutine represents the main program. 84This variable stores the coroutine object that represents the main
85program. While you cna C<ready> it and do most other things you can do to
86coroutines, it is mainly useful to compare again C<$Coro::current>, to see
87whether you are running in the main program or not.
75 88
76=cut 89=cut
77 90
78$main = new Coro; 91$main = new Coro;
79 92
80=item $current (or as function: current) 93=item $Coro::current
81 94
82The current coroutine (the last coroutine switched to). The initial value 95The coroutine object representing the current coroutine (the last
96coroutine that the Coro scheduler switched to). The initial value is
83is C<$main> (of course). 97C<$main> (of course).
84 98
85This variable is B<strictly> I<read-only>. It is provided for performance 99This variable is B<strictly> I<read-only>. You can take copies of the
86reasons. If performance is not essential you are encouraged to use the 100value stored in it and use it as any other coroutine object, but you must
87C<Coro::current> function instead. 101not otherwise modify the variable itself.
88 102
89=cut 103=cut
90 104
91$main->{desc} = "[main::]"; 105$main->{desc} = "[main::]";
92 106
94$main->{_specific} = $current->{_specific} 108$main->{_specific} = $current->{_specific}
95 if $current; 109 if $current;
96 110
97_set_current $main; 111_set_current $main;
98 112
99sub current() { $current } 113sub current() { $current } # [DEPRECATED]
100 114
101=item $idle 115=item $Coro::idle
102 116
103A callback that is called whenever the scheduler finds no ready coroutines 117This variable is mainly useful to integrate Coro into event loops. It is
104to run. The default implementation prints "FATAL: deadlock detected" and 118usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
105exits, because the program has no other way to continue. 119pretty low-level functionality.
120
121This variable stores a callback that is called whenever the scheduler
122finds no ready coroutines to run. The default implementation prints
123"FATAL: deadlock detected" and exits, because the program has no other way
124to continue.
106 125
107This hook is overwritten by modules such as C<Coro::Timer> and 126This hook is overwritten by modules such as C<Coro::Timer> and
108C<Coro::Event> to wait on an external event that hopefully wake up a 127C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
109coroutine so the scheduler can run it. 128coroutine so the scheduler can run it.
129
130Note that the callback I<must not>, under any circumstances, block
131the current coroutine. Normally, this is achieved by having an "idle
132coroutine" that calls the event loop and then blocks again, and then
133readying that coroutine in the idle handler.
134
135See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this
136technique.
110 137
111Please note that if your callback recursively invokes perl (e.g. for event 138Please note that if your callback recursively invokes perl (e.g. for event
112handlers), then it must be prepared to be called recursively itself. 139handlers), then it must be prepared to be called recursively itself.
113 140
114=cut 141=cut
141 while @destroy; 168 while @destroy;
142 169
143 &schedule; 170 &schedule;
144 } 171 }
145}; 172};
146$manager->desc ("[coro manager]"); 173$manager->{desc} = "[coro manager]";
147$manager->prio (PRIO_MAX); 174$manager->prio (PRIO_MAX);
148 175
149=back 176=back
150 177
151=head2 STATIC METHODS 178=head2 SIMPLE COROUTINE CREATION
152
153Static methods are actually functions that operate on the current coroutine only.
154 179
155=over 4 180=over 4
156 181
157=item async { ... } [@args...] 182=item async { ... } [@args...]
158 183
159Create a new asynchronous coroutine and return it's coroutine object 184Create a new coroutine and return it's coroutine object (usually
160(usually unused). When the sub returns the new coroutine is automatically 185unused). The coroutine will be put into the ready queue, so
186it will start running automatically on the next scheduler run.
187
188The first argument is a codeblock/closure that should be executed in the
189coroutine. When it returns argument returns the coroutine is automatically
161terminated. 190terminated.
162 191
192The remaining arguments are passed as arguments to the closure.
193
163See the C<Coro::State::new> constructor for info about the coroutine 194See the C<Coro::State::new> constructor for info about the coroutine
164environment in which coroutines run. 195environment in which coroutines are executed.
165 196
166Calling C<exit> in a coroutine will do the same as calling exit outside 197Calling C<exit> in a coroutine will do the same as calling exit outside
167the coroutine. Likewise, when the coroutine dies, the program will exit, 198the coroutine. Likewise, when the coroutine dies, the program will exit,
168just as it would in the main program. 199just as it would in the main program.
169 200
201If you do not want that, you can provide a default C<die> handler, or
202simply avoid dieing (by use of C<eval>).
203
170 # create a new coroutine that just prints its arguments 204Example: Create a new coroutine that just prints its arguments.
205
171 async { 206 async {
172 print "@_\n"; 207 print "@_\n";
173 } 1,2,3,4; 208 } 1,2,3,4;
174 209
175=cut 210=cut
181} 216}
182 217
183=item async_pool { ... } [@args...] 218=item async_pool { ... } [@args...]
184 219
185Similar to C<async>, but uses a coroutine pool, so you should not call 220Similar to C<async>, but uses a coroutine pool, so you should not call
186terminate or join (although you are allowed to), and you get a coroutine 221terminate or join on it (although you are allowed to), and you get a
187that might have executed other code already (which can be good or bad :). 222coroutine that might have executed other code already (which can be good
223or bad :).
188 224
225On the plus side, this function is faster than creating (and destroying)
226a completly new coroutine, so if you need a lot of generic coroutines in
227quick successsion, use C<async_pool>, not C<async>.
228
189Also, the block is executed in an C<eval> context and a warning will be 229The code block is executed in an C<eval> context and a warning will be
190issued in case of an exception instead of terminating the program, as 230issued in case of an exception instead of terminating the program, as
191C<async> does. As the coroutine is being reused, stuff like C<on_destroy> 231C<async> does. As the coroutine is being reused, stuff like C<on_destroy>
192will not work in the expected way, unless you call terminate or cancel, 232will not work in the expected way, unless you call terminate or cancel,
193which somehow defeats the purpose of pooling. 233which somehow defeats the purpose of pooling (but is fine in the
234exceptional case).
194 235
195The priority will be reset to C<0> after each job, tracing will be 236The priority will be reset to C<0> after each run, tracing will be
196disabled, the description will be reset and the default output filehandle 237disabled, the description will be reset and the default output filehandle
197gets restored, so you can change alkl these. Otherwise the coroutine will 238gets restored, so you can change all these. Otherwise the coroutine will
198be re-used "as-is": most notably if you change other per-coroutine global 239be re-used "as-is": most notably if you change other per-coroutine global
199stuff such as C<$/> you need to revert that change, which is most simply 240stuff such as C<$/> you I<must needs> revert that change, which is most
200done by using local as in C< local $/ >. 241simply done by using local as in: C<< local $/ >>.
201 242
202The pool size is limited to 8 idle coroutines (this can be adjusted by 243The idle pool size is limited to C<8> idle coroutines (this can be
203changing $Coro::POOL_SIZE), and there can be as many non-idle coros as 244adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
204required. 245coros as required.
205 246
206If you are concerned about pooled coroutines growing a lot because a 247If you are concerned about pooled coroutines growing a lot because a
207single C<async_pool> used a lot of stackspace you can e.g. C<async_pool 248single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
208{ terminate }> once per second or so to slowly replenish the pool. In 249{ terminate }> once per second or so to slowly replenish the pool. In
209addition to that, when the stacks used by a handler grows larger than 16kb 250addition to that, when the stacks used by a handler grows larger than 16kb
210(adjustable with $Coro::POOL_RSS) it will also exit. 251(adjustable via $Coro::POOL_RSS) it will also be destroyed.
211 252
212=cut 253=cut
213 254
214our $POOL_SIZE = 8; 255our $POOL_SIZE = 8;
215our $POOL_RSS = 16 * 1024; 256our $POOL_RSS = 16 * 1024;
226 _pool_2 $cb; 267 _pool_2 $cb;
227 &schedule; 268 &schedule;
228 } 269 }
229 }; 270 };
230 271
272 if ($@) {
231 last if $@ eq "\3async_pool terminate\2\n"; 273 last if $@ eq "\3async_pool terminate\2\n";
232 warn $@ if $@; 274 warn $@;
275 }
233 } 276 }
234} 277}
235 278
236sub async_pool(&@) { 279sub async_pool(&@) {
237 # this is also inlined into the unlock_scheduler 280 # this is also inlined into the unlock_scheduler
241 $coro->ready; 284 $coro->ready;
242 285
243 $coro 286 $coro
244} 287}
245 288
289=back
290
291=head2 STATIC METHODS
292
293Static methods are actually functions that operate on the current coroutine.
294
295=over 4
296
246=item schedule 297=item schedule
247 298
248Calls the scheduler. Please note that the current coroutine will not be put 299Calls the scheduler. The scheduler will find the next coroutine that is
300to be run from the ready queue and switches to it. The next coroutine
301to be run is simply the one with the highest priority that is longest
302in its ready queue. If there is no coroutine ready, it will clal the
303C<$Coro::idle> hook.
304
305Please note that the current coroutine will I<not> be put into the ready
249into the ready queue, so calling this function usually means you will 306queue, so calling this function usually means you will never be called
250never be called again unless something else (e.g. an event handler) calls 307again unless something else (e.g. an event handler) calls C<< ->ready >>,
251ready. 308thus waking you up.
309
310This makes C<schedule> I<the> generic method to use to block the current
311coroutine and wait for events: first you remember the current coroutine in
312a variable, then arrange for some callback of yours to call C<< ->ready
313>> on that once some event happens, and last you call C<schedule> to put
314yourself to sleep. Note that a lot of things can wake your coroutine up,
315so you need to check whether the event indeed happened, e.g. by storing the
316status in a variable.
252 317
253The canonical way to wait on external events is this: 318The canonical way to wait on external events is this:
254 319
255 { 320 {
256 # remember current coroutine 321 # remember current coroutine
269 Coro::schedule while $current; 334 Coro::schedule while $current;
270 } 335 }
271 336
272=item cede 337=item cede
273 338
274"Cede" to other coroutines. This function puts the current coroutine into the 339"Cede" to other coroutines. This function puts the current coroutine into
275ready queue and calls C<schedule>, which has the effect of giving up the 340the ready queue and calls C<schedule>, which has the effect of giving
276current "timeslice" to other coroutines of the same or higher priority. 341up the current "timeslice" to other coroutines of the same or higher
342priority. Once your coroutine gets its turn again it will automatically be
343resumed.
344
345This function is often called C<yield> in other languages.
277 346
278=item Coro::cede_notself 347=item Coro::cede_notself
279 348
280Works like cede, but is not exported by default and will cede to any 349Works like cede, but is not exported by default and will cede to I<any>
281coroutine, regardless of priority, once. 350coroutine, regardless of priority. This is useful sometimes to ensure
351progress is made.
282 352
283=item terminate [arg...] 353=item terminate [arg...]
284 354
285Terminates the current coroutine with the given status values (see L<cancel>). 355Terminates the current coroutine with the given status values (see L<cancel>).
286 356
287=item killall 357=item killall
288 358
289Kills/terminates/cancels all coroutines except the currently running 359Kills/terminates/cancels all coroutines except the currently running
290one. This is useful after a fork, either in the child or the parent, as 360one. This is useful after a fork, either in the child or the parent, as
291usually only one of them should inherit the running coroutines. 361usually only one of them should inherit the running coroutines.
362
363Note that while this will try to free some of the main programs resources,
364you cannot free all of them, so if a coroutine that is not the main
365program calls this function, there will be some one-time resource leak.
292 366
293=cut 367=cut
294 368
295sub terminate { 369sub terminate {
296 $current->cancel (@_); 370 $current->cancel (@_);
305 379
306=back 380=back
307 381
308=head2 COROUTINE METHODS 382=head2 COROUTINE METHODS
309 383
310These are the methods you can call on coroutine objects. 384These are the methods you can call on coroutine objects (or to create
385them).
311 386
312=over 4 387=over 4
313 388
314=item new Coro \&sub [, @args...] 389=item new Coro \&sub [, @args...]
315 390
316Create a new coroutine and return it. When the sub returns the coroutine 391Create a new coroutine and return it. When the sub returns, the coroutine
317automatically terminates as if C<terminate> with the returned values were 392automatically terminates as if C<terminate> with the returned values were
318called. To make the coroutine run you must first put it into the ready queue 393called. To make the coroutine run you must first put it into the ready
319by calling the ready method. 394queue by calling the ready method.
320 395
321See C<async> and C<Coro::State::new> for additional info about the 396See C<async> and C<Coro::State::new> for additional info about the
322coroutine environment. 397coroutine environment.
323 398
324=cut 399=cut
333 $class->SUPER::new (\&_run_coro, @_) 408 $class->SUPER::new (\&_run_coro, @_)
334} 409}
335 410
336=item $success = $coroutine->ready 411=item $success = $coroutine->ready
337 412
338Put the given coroutine into the ready queue (according to it's priority) 413Put the given coroutine into the end of its ready queue (there is one
339and return true. If the coroutine is already in the ready queue, do nothing 414queue for each priority) and return true. If the coroutine is already in
340and return false. 415the ready queue, do nothing and return false.
416
417This ensures that the scheduler will resume this coroutine automatically
418once all the coroutines of higher priority and all coroutines of the same
419priority that were put into the ready queue earlier have been resumed.
341 420
342=item $is_ready = $coroutine->is_ready 421=item $is_ready = $coroutine->is_ready
343 422
344Return wether the coroutine is currently the ready queue or not, 423Return whether the coroutine is currently the ready queue or not,
345 424
346=item $coroutine->cancel (arg...) 425=item $coroutine->cancel (arg...)
347 426
348Terminates the given coroutine and makes it return the given arguments as 427Terminates the given coroutine and makes it return the given arguments as
349status (default: the empty list). Never returns if the coroutine is the 428status (default: the empty list). Never returns if the coroutine is the
362 } else { 441 } else {
363 $self->_cancel; 442 $self->_cancel;
364 } 443 }
365} 444}
366 445
446=item $coroutine->throw ([$scalar])
447
448If C<$throw> is specified and defined, it will be thrown as an exception
449inside the coroutine at the next convenient point in time (usually after
450it gains control at the next schedule/transfer/cede). Otherwise clears the
451exception object.
452
453The exception object will be thrown "as is" with the specified scalar in
454C<$@>, i.e. if it is a string, no line number or newline will be appended
455(unlike with C<die>).
456
457This can be used as a softer means than C<cancel> to ask a coroutine to
458end itself, although there is no guarantee that the exception will lead to
459termination, and if the exception isn't caught it might well end the whole
460program.
461
462You might also think of C<throw> as being the moral equivalent of
463C<kill>ing a coroutine with a signal (in this case, a scalar).
464
367=item $coroutine->join 465=item $coroutine->join
368 466
369Wait until the coroutine terminates and return any values given to the 467Wait until the coroutine terminates and return any values given to the
370C<terminate> or C<cancel> functions. C<join> can be called concurrently 468C<terminate> or C<cancel> functions. C<join> can be called concurrently
371from multiple coroutines. 469from multiple coroutines, and all will be resumed and given the status
470return once the C<$coroutine> terminates.
372 471
373=cut 472=cut
374 473
375sub join { 474sub join {
376 my $self = shift; 475 my $self = shift;
391 490
392=item $coroutine->on_destroy (\&cb) 491=item $coroutine->on_destroy (\&cb)
393 492
394Registers a callback that is called when this coroutine gets destroyed, 493Registers a callback that is called when this coroutine gets destroyed,
395but before it is joined. The callback gets passed the terminate arguments, 494but before it is joined. The callback gets passed the terminate arguments,
396if any. 495if any, and I<must not> die, under any circumstances.
397 496
398=cut 497=cut
399 498
400sub on_destroy { 499sub on_destroy {
401 my ($self, $cb) = @_; 500 my ($self, $cb) = @_;
431higher values mean lower priority, just as in unix). 530higher values mean lower priority, just as in unix).
432 531
433=item $olddesc = $coroutine->desc ($newdesc) 532=item $olddesc = $coroutine->desc ($newdesc)
434 533
435Sets (or gets in case the argument is missing) the description for this 534Sets (or gets in case the argument is missing) the description for this
436coroutine. This is just a free-form string you can associate with a coroutine. 535coroutine. This is just a free-form string you can associate with a
536coroutine.
437 537
438This method simply sets the C<< $coroutine->{desc} >> member to the given string. You 538This method simply sets the C<< $coroutine->{desc} >> member to the given
439can modify this member directly if you wish. 539string. You can modify this member directly if you wish.
440
441=item $coroutine->throw ([$scalar])
442
443If C<$throw> is specified and defined, it will be thrown as an exception
444inside the coroutine at the next convinient point in time (usually after
445it gains control at the next schedule/transfer/cede). Otherwise clears the
446exception object.
447
448The exception object will be thrown "as is" with the specified scalar in
449C<$@>, i.e. if it is a string, no line number or newline will be appended
450(unlike with C<die>).
451
452This can be used as a softer means than C<cancel> to ask a coroutine to
453end itself, although there is no guarentee that the exception will lead to
454termination, and if the exception isn't caught it might well end the whole
455program.
456 540
457=cut 541=cut
458 542
459sub desc { 543sub desc {
460 my $old = $_[0]{desc}; 544 my $old = $_[0]{desc};
469=over 4 553=over 4
470 554
471=item Coro::nready 555=item Coro::nready
472 556
473Returns the number of coroutines that are currently in the ready state, 557Returns the number of coroutines that are currently in the ready state,
474i.e. that can be switched to. The value C<0> means that the only runnable 558i.e. that can be switched to by calling C<schedule> directory or
559indirectly. The value C<0> means that the only runnable coroutine is the
475coroutine is the currently running one, so C<cede> would have no effect, 560currently running one, so C<cede> would have no effect, and C<schedule>
476and C<schedule> would cause a deadlock unless there is an idle handler 561would cause a deadlock unless there is an idle handler that wakes up some
477that wakes up some coroutines. 562coroutines.
478 563
479=item my $guard = Coro::guard { ... } 564=item my $guard = Coro::guard { ... }
480 565
481This creates and returns a guard object. Nothing happens until the object 566This creates and returns a guard object. Nothing happens until the object
482gets destroyed, in which case the codeblock given as argument will be 567gets destroyed, in which case the codeblock given as argument will be
511 596
512 597
513=item unblock_sub { ... } 598=item unblock_sub { ... }
514 599
515This utility function takes a BLOCK or code reference and "unblocks" it, 600This utility function takes a BLOCK or code reference and "unblocks" it,
516returning the new coderef. This means that the new coderef will return 601returning a new coderef. Unblocking means that calling the new coderef
517immediately without blocking, returning nothing, while the original code 602will return immediately without blocking, returning nothing, while the
518ref will be called (with parameters) from within its own coroutine. 603original code ref will be called (with parameters) from within another
604coroutine.
519 605
520The reason this function exists is that many event libraries (such as the 606The reason this function exists is that many event libraries (such as the
521venerable L<Event|Event> module) are not coroutine-safe (a weaker form 607venerable L<Event|Event> module) are not coroutine-safe (a weaker form
522of thread-safety). This means you must not block within event callbacks, 608of thread-safety). This means you must not block within event callbacks,
523otherwise you might suffer from crashes or worse. 609otherwise you might suffer from crashes or worse. The only event library
610currently known that is safe to use without C<unblock_sub> is L<EV>.
524 611
525This function allows your callbacks to block by executing them in another 612This function allows your callbacks to block by executing them in another
526coroutine where it is safe to block. One example where blocking is handy 613coroutine where it is safe to block. One example where blocking is handy
527is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 614is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
528disk. 615disk, for example.
529 616
530In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 617In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
531creating event callbacks that want to block. 618creating event callbacks that want to block.
619
620If your handler does not plan to block (e.g. simply sends a message to
621another coroutine, or puts some other coroutine into the ready queue),
622there is no reason to use C<unblock_sub>.
623
624Note that you also need to use C<unblock_sub> for any other callbacks that
625are indirectly executed by any C-based event loop. For example, when you
626use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
627provides callbacks that are the result of some event callback, then you
628must not block either, or use C<unblock_sub>.
532 629
533=cut 630=cut
534 631
535our @unblock_queue; 632our @unblock_queue;
536 633
549 cede; # for short-lived callbacks, this reduces pressure on the coro pool 646 cede; # for short-lived callbacks, this reduces pressure on the coro pool
550 } 647 }
551 schedule; # sleep well 648 schedule; # sleep well
552 } 649 }
553}; 650};
554$unblock_scheduler->desc ("[unblock_sub scheduler]"); 651$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
555 652
556sub unblock_sub(&) { 653sub unblock_sub(&) {
557 my $cb = shift; 654 my $cb = shift;
558 655
559 sub { 656 sub {
568 665
5691; 6661;
570 667
571=head1 BUGS/LIMITATIONS 668=head1 BUGS/LIMITATIONS
572 669
573 - you must make very sure that no coro is still active on global
574 destruction. very bad things might happen otherwise (usually segfaults).
575
576 - this module is not thread-safe. You should only ever use this module 670This module is not perl-pseudo-thread-safe. You should only ever use this
577 from the same thread (this requirement might be loosened in the future 671module from the same thread (this requirement might be removed in the
578 to allow per-thread schedulers, but Coro::State does not yet allow 672future to allow per-thread schedulers, but Coro::State does not yet allow
579 this). 673this). I recommend disabling thread support and using processes, as this
674is much faster and uses less memory.
580 675
581=head1 SEE ALSO 676=head1 SEE ALSO
582 677
583Lower level Configuration, Coroutine Environment: L<Coro::State>. 678Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
584 679
585Debugging: L<Coro::Debug>. 680Debugging: L<Coro::Debug>.
586 681
587Support/Utility: L<Coro::Specific>, L<Coro::Util>. 682Support/Utility: L<Coro::Specific>, L<Coro::Util>.
588 683
589Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 684Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
590 685
591Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>. 686IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
592 687
593Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>. 688Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
594 689
595Embedding: L<Coro::MakeMaker>. 690XS API: L<Coro::MakeMaker>.
691
692Low level Configuration, Coroutine Environment: L<Coro::State>.
596 693
597=head1 AUTHOR 694=head1 AUTHOR
598 695
599 Marc Lehmann <schmorp@schmorp.de> 696 Marc Lehmann <schmorp@schmorp.de>
600 http://home.schmorp.de/ 697 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines