1 | =head1 NAME |
1 | =head1 NAME |
2 | |
2 | |
3 | Coro - coroutine process abstraction |
3 | Coro - real threads in perl |
4 | |
4 | |
5 | =head1 SYNOPSIS |
5 | =head1 SYNOPSIS |
6 | |
6 | |
7 | use Coro; |
7 | use Coro; |
8 | |
8 | |
… | |
… | |
26 | $locked = 1; |
26 | $locked = 1; |
27 | $lock->up; |
27 | $lock->up; |
28 | |
28 | |
29 | =head1 DESCRIPTION |
29 | =head1 DESCRIPTION |
30 | |
30 | |
31 | This module collection manages coroutines. Coroutines are similar to |
31 | This module collection manages coroutines, that is, cooperative |
32 | threads but don't (in general) run in parallel at the same time even |
32 | threads. Coroutines are similar to kernel threads but don't (in general) |
33 | on SMP machines. The specific flavor of coroutine used in this module |
33 | run in parallel at the same time even on SMP machines. The specific flavor |
34 | also guarantees you that it will not switch between coroutines unless |
34 | of coroutine used in this module also guarantees you that it will not |
35 | necessary, at easily-identified points in your program, so locking and |
35 | switch between coroutines unless necessary, at easily-identified points |
36 | parallel access are rarely an issue, making coroutine programming much |
36 | in your program, so locking and parallel access are rarely an issue, |
37 | safer and easier than threads programming. |
37 | making coroutine programming much safer and easier than using other thread |
|
|
38 | models. |
38 | |
39 | |
39 | Unlike a normal perl program, however, coroutines allow you to have |
40 | Unlike the so-called "Perl threads" (which are not actually real threads |
40 | multiple running interpreters that share data, which is especially useful |
41 | but only the windows process emulation ported to unix), Coro provides a |
41 | to code pseudo-parallel processes and for event-based programming, such as |
42 | full shared address space, which makes communication between coroutines |
42 | multiple HTTP-GET requests running concurrently. See L<Coro::AnyEvent> to |
43 | very easy. And coroutines are fast, too: disabling the Windows process |
43 | learn more. |
44 | emulation code in your perl and using Coro can easily result in a two to |
|
|
45 | four times speed increase for your programs. |
44 | |
46 | |
45 | Coroutines are also useful because Perl has no support for threads (the so |
47 | Coro achieves that by supporting multiple running interpreters that share |
46 | called "threads" that perl offers are nothing more than the (bad) process |
48 | data, which is especially useful to code pseudo-parallel processes and |
47 | emulation coming from the Windows platform: On standard operating systems |
49 | for event-based programming, such as multiple HTTP-GET requests running |
48 | they serve no purpose whatsoever, except by making your programs slow and |
50 | concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro |
49 | making them use a lot of memory. Best disable them when building perl, or |
51 | into an event-based environment. |
50 | aks your software vendor/distributor to do it for you). |
|
|
51 | |
52 | |
52 | In this module, coroutines are defined as "callchain + lexical variables + |
53 | In this module, a coroutines is defined as "callchain + lexical variables |
53 | @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain, |
54 | + @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own |
54 | its own set of lexicals and its own set of perls most important global |
55 | callchain, its own set of lexicals and its own set of perls most important |
55 | variables (see L<Coro::State> for more configuration). |
56 | global variables (see L<Coro::State> for more configuration and background |
|
|
57 | info). |
|
|
58 | |
|
|
59 | See also the C<SEE ALSO> section at the end of this document - the Coro |
|
|
60 | module family is quite large. |
56 | |
61 | |
57 | =cut |
62 | =cut |
58 | |
63 | |
59 | package Coro; |
64 | package Coro; |
60 | |
65 | |
… | |
… | |
67 | |
72 | |
68 | our $idle; # idle handler |
73 | our $idle; # idle handler |
69 | our $main; # main coroutine |
74 | our $main; # main coroutine |
70 | our $current; # current coroutine |
75 | our $current; # current coroutine |
71 | |
76 | |
72 | our $VERSION = 5.0; |
77 | our $VERSION = "5.0"; |
73 | |
78 | |
74 | our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); |
79 | our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); |
75 | our %EXPORT_TAGS = ( |
80 | our %EXPORT_TAGS = ( |
76 | prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], |
81 | prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], |
77 | ); |
82 | ); |
78 | our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); |
83 | our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); |
79 | |
84 | |
|
|
85 | =head1 GLOBAL VARIABLES |
|
|
86 | |
80 | =over 4 |
87 | =over 4 |
81 | |
88 | |
82 | =item $Coro::main |
89 | =item $Coro::main |
83 | |
90 | |
84 | This variable stores the coroutine object that represents the main |
91 | This variable stores the coroutine object that represents the main |
… | |
… | |
135 | $idle = sub { |
142 | $idle = sub { |
136 | require Carp; |
143 | require Carp; |
137 | Carp::croak ("FATAL: deadlock detected"); |
144 | Carp::croak ("FATAL: deadlock detected"); |
138 | }; |
145 | }; |
139 | |
146 | |
140 | 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 | $_->(@{$self->{_status}}) |
|
|
149 | for @{ delete $self->{_on_destroy} || [] }; |
|
|
150 | } |
|
|
151 | |
|
|
152 | # this coroutine is necessary because a coroutine |
147 | # this coroutine is necessary because a coroutine |
153 | # cannot destroy itself. |
148 | # cannot destroy itself. |
154 | my @destroy; |
149 | our @destroy; |
155 | my $manager; |
150 | our $manager; |
156 | |
151 | |
157 | $manager = new Coro sub { |
152 | $manager = new Coro sub { |
158 | while () { |
153 | while () { |
159 | (shift @destroy)->_cancel |
154 | Coro::_cancel shift @destroy |
160 | while @destroy; |
155 | while @destroy; |
161 | |
156 | |
162 | &schedule; |
157 | &schedule; |
163 | } |
158 | } |
164 | }; |
159 | }; |
165 | $manager->{desc} = "[coro manager]"; |
160 | $manager->{desc} = "[coro manager]"; |
166 | $manager->prio (PRIO_MAX); |
161 | $manager->prio (PRIO_MAX); |
167 | |
162 | |
168 | =back |
163 | =back |
169 | |
164 | |
170 | =head2 SIMPLE COROUTINE CREATION |
165 | =head1 SIMPLE COROUTINE CREATION |
171 | |
166 | |
172 | =over 4 |
167 | =over 4 |
173 | |
168 | |
174 | =item async { ... } [@args...] |
169 | =item async { ... } [@args...] |
175 | |
170 | |
… | |
… | |
212 | Similar to C<async>, but uses a coroutine pool, so you should not call |
207 | Similar to C<async>, but uses a coroutine pool, so you should not call |
213 | terminate or join on it (although you are allowed to), and you get a |
208 | 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 |
209 | coroutine that might have executed other code already (which can be good |
215 | or bad :). |
210 | or bad :). |
216 | |
211 | |
217 | On the plus side, this function is faster than creating (and destroying) |
212 | On the plus side, this function is about twice as fast as creating (and |
218 | a completly new coroutine, so if you need a lot of generic coroutines in |
213 | destroying) a completely new coroutine, so if you need a lot of generic |
219 | quick successsion, use C<async_pool>, not C<async>. |
214 | coroutines in quick successsion, use C<async_pool>, not C<async>. |
220 | |
215 | |
221 | The code block is executed in an C<eval> context and a warning will be |
216 | The code block is executed in an C<eval> context and a warning will be |
222 | issued in case of an exception instead of terminating the program, as |
217 | 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> |
218 | 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, |
219 | will not work in the expected way, unless you call terminate or cancel, |
… | |
… | |
237 | coros as required. |
232 | coros as required. |
238 | |
233 | |
239 | If you are concerned about pooled coroutines growing a lot because a |
234 | If you are concerned about pooled coroutines growing a lot because a |
240 | single C<async_pool> used a lot of stackspace you can e.g. C<async_pool |
235 | 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 |
236 | { 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 |
237 | addition to that, when the stacks used by a handler grows larger than 32kb |
243 | (adjustable via $Coro::POOL_RSS) it will also be destroyed. |
238 | (adjustable via $Coro::POOL_RSS) it will also be destroyed. |
244 | |
239 | |
245 | =cut |
240 | =cut |
246 | |
241 | |
247 | our $POOL_SIZE = 8; |
242 | our $POOL_SIZE = 8; |
248 | our $POOL_RSS = 16 * 1024; |
243 | our $POOL_RSS = 32 * 1024; |
249 | our @async_pool; |
244 | our @async_pool; |
250 | |
245 | |
251 | sub pool_handler { |
246 | sub pool_handler { |
252 | my $cb; |
|
|
253 | |
|
|
254 | while () { |
247 | while () { |
255 | eval { |
248 | eval { |
256 | while () { |
249 | &{&_pool_handler} while 1; |
257 | _pool_1 $cb; |
|
|
258 | &$cb; |
|
|
259 | _pool_2 $cb; |
|
|
260 | &schedule; |
|
|
261 | } |
|
|
262 | }; |
250 | }; |
263 | |
251 | |
264 | if ($@) { |
|
|
265 | last if $@ eq "\3async_pool terminate\2\n"; |
|
|
266 | warn $@; |
252 | warn $@ if $@; |
267 | } |
|
|
268 | } |
253 | } |
269 | } |
|
|
270 | |
|
|
271 | sub async_pool(&@) { |
|
|
272 | # this is also inlined into the unblock_scheduler |
|
|
273 | my $coro = (pop @async_pool) || new Coro \&pool_handler; |
|
|
274 | |
|
|
275 | $coro->{_invoke} = [@_]; |
|
|
276 | $coro->ready; |
|
|
277 | |
|
|
278 | $coro |
|
|
279 | } |
254 | } |
280 | |
255 | |
281 | =back |
256 | =back |
282 | |
257 | |
283 | =head2 STATIC METHODS |
258 | =head1 STATIC METHODS |
284 | |
259 | |
285 | Static methods are actually functions that operate on the current coroutine. |
260 | Static methods are actually functions that implicitly operate on the |
|
|
261 | current coroutine. |
286 | |
262 | |
287 | =over 4 |
263 | =over 4 |
288 | |
264 | |
289 | =item schedule |
265 | =item schedule |
290 | |
266 | |
… | |
… | |
305 | >> on that once some event happens, and last you call C<schedule> to put |
281 | >> 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, |
282 | yourself to sleep. Note that a lot of things can wake your coroutine up, |
307 | so you need to check whether the event indeed happened, e.g. by storing the |
283 | so you need to check whether the event indeed happened, e.g. by storing the |
308 | status in a variable. |
284 | status in a variable. |
309 | |
285 | |
310 | The canonical way to wait on external events is this: |
286 | See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks. |
311 | |
|
|
312 | { |
|
|
313 | # remember current coroutine |
|
|
314 | 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 | # call schedule until event occurred. |
|
|
324 | # in case we are woken up for other reasons |
|
|
325 | # (current still defined), loop. |
|
|
326 | Coro::schedule while $current; |
|
|
327 | } |
|
|
328 | |
287 | |
329 | =item cede |
288 | =item cede |
330 | |
289 | |
331 | "Cede" to other coroutines. This function puts the current coroutine into |
290 | "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 |
291 | the ready queue and calls C<schedule>, which has the effect of giving |
… | |
… | |
356 | you cannot free all of them, so if a coroutine that is not the main |
315 | you cannot free all of them, so if a coroutine that is not the main |
357 | program calls this function, there will be some one-time resource leak. |
316 | program calls this function, there will be some one-time resource leak. |
358 | |
317 | |
359 | =cut |
318 | =cut |
360 | |
319 | |
361 | sub terminate { |
|
|
362 | $current->cancel (@_); |
|
|
363 | } |
|
|
364 | |
|
|
365 | sub killall { |
320 | sub killall { |
366 | for (Coro::State::list) { |
321 | for (Coro::State::list) { |
367 | $_->cancel |
322 | $_->cancel |
368 | if $_ != $current && UNIVERSAL::isa $_, "Coro"; |
323 | if $_ != $current && UNIVERSAL::isa $_, "Coro"; |
369 | } |
324 | } |
370 | } |
325 | } |
371 | |
326 | |
372 | =back |
327 | =back |
373 | |
328 | |
374 | =head2 COROUTINE METHODS |
329 | =head1 COROUTINE OBJECT METHODS |
375 | |
330 | |
376 | These are the methods you can call on coroutine objects (or to create |
331 | These are the methods you can call on coroutine objects (or to create |
377 | them). |
332 | them). |
378 | |
333 | |
379 | =over 4 |
334 | =over 4 |
… | |
… | |
388 | See C<async> and C<Coro::State::new> for additional info about the |
343 | See C<async> and C<Coro::State::new> for additional info about the |
389 | coroutine environment. |
344 | coroutine environment. |
390 | |
345 | |
391 | =cut |
346 | =cut |
392 | |
347 | |
393 | sub _run_coro { |
348 | sub _terminate { |
394 | terminate &{+shift}; |
349 | terminate &{+shift}; |
395 | } |
|
|
396 | |
|
|
397 | sub new { |
|
|
398 | my $class = shift; |
|
|
399 | |
|
|
400 | $class->SUPER::new (\&_run_coro, @_) |
|
|
401 | } |
350 | } |
402 | |
351 | |
403 | =item $success = $coroutine->ready |
352 | =item $success = $coroutine->ready |
404 | |
353 | |
405 | Put the given coroutine into the end of its ready queue (there is one |
354 | Put the given coroutine into the end of its ready queue (there is one |
… | |
… | |
422 | |
371 | |
423 | =cut |
372 | =cut |
424 | |
373 | |
425 | sub cancel { |
374 | sub cancel { |
426 | my $self = shift; |
375 | my $self = shift; |
427 | $self->{_status} = [@_]; |
|
|
428 | |
376 | |
429 | if ($current == $self) { |
377 | if ($current == $self) { |
430 | push @destroy, $self; |
378 | terminate @_; |
431 | $manager->ready; |
|
|
432 | &schedule while 1; |
|
|
433 | } else { |
379 | } else { |
|
|
380 | $self->{_status} = [@_]; |
434 | $self->_cancel; |
381 | $self->_cancel; |
435 | } |
382 | } |
436 | } |
383 | } |
|
|
384 | |
|
|
385 | =item $coroutine->schedule_to |
|
|
386 | |
|
|
387 | Puts the current coroutine to sleep (like C<Coro::schedule>), but instead |
|
|
388 | of continuing with the next coro from the ready queue, always switch to |
|
|
389 | the given coroutine object (regardless of priority etc.). The readyness |
|
|
390 | state of that coroutine isn't changed. |
|
|
391 | |
|
|
392 | This is an advanced method for special cases - I'd love to hear about any |
|
|
393 | uses for this one. |
|
|
394 | |
|
|
395 | =item $coroutine->cede_to |
|
|
396 | |
|
|
397 | Like C<schedule_to>, but puts the current coroutine into the ready |
|
|
398 | queue. This has the effect of temporarily switching to the given |
|
|
399 | coroutine, and continuing some time later. |
|
|
400 | |
|
|
401 | This is an advanced method for special cases - I'd love to hear about any |
|
|
402 | uses for this one. |
437 | |
403 | |
438 | =item $coroutine->throw ([$scalar]) |
404 | =item $coroutine->throw ([$scalar]) |
439 | |
405 | |
440 | If C<$throw> is specified and defined, it will be thrown as an exception |
406 | If C<$throw> is specified and defined, it will be thrown as an exception |
441 | inside the coroutine at the next convenient point in time. Otherwise |
407 | inside the coroutine at the next convenient point in time. Otherwise |
… | |
… | |
540 | my $old = $_[0]{desc}; |
506 | my $old = $_[0]{desc}; |
541 | $_[0]{desc} = $_[1] if @_ > 1; |
507 | $_[0]{desc} = $_[1] if @_ > 1; |
542 | $old; |
508 | $old; |
543 | } |
509 | } |
544 | |
510 | |
|
|
511 | sub transfer { |
|
|
512 | require Carp; |
|
|
513 | Carp::croak ("You must not call ->transfer on Coro objects. Use Coro::State objects or the ->schedule_to method. Caught"); |
|
|
514 | } |
|
|
515 | |
545 | =back |
516 | =back |
546 | |
517 | |
547 | =head2 GLOBAL FUNCTIONS |
518 | =head1 GLOBAL FUNCTIONS |
548 | |
519 | |
549 | =over 4 |
520 | =over 4 |
550 | |
521 | |
551 | =item Coro::nready |
522 | =item Coro::nready |
552 | |
523 | |
… | |
… | |
632 | # return immediately and can be reused) and because we cannot cede |
603 | # return immediately and can be reused) and because we cannot cede |
633 | # inside an event callback. |
604 | # inside an event callback. |
634 | our $unblock_scheduler = new Coro sub { |
605 | our $unblock_scheduler = new Coro sub { |
635 | while () { |
606 | while () { |
636 | while (my $cb = pop @unblock_queue) { |
607 | while (my $cb = pop @unblock_queue) { |
637 | # this is an inlined copy of async_pool |
608 | &async_pool (@$cb); |
638 | my $coro = (pop @async_pool) || new Coro \&pool_handler; |
|
|
639 | |
609 | |
640 | $coro->{_invoke} = $cb; |
|
|
641 | $coro->ready; |
|
|
642 | cede; # for short-lived callbacks, this reduces pressure on the coro pool |
610 | # for short-lived callbacks, this reduces pressure on the coro pool |
|
|
611 | # as the chance is very high that the async_poll coro will be back |
|
|
612 | # in the idle state when cede returns |
|
|
613 | cede; |
643 | } |
614 | } |
644 | schedule; # sleep well |
615 | schedule; # sleep well |
645 | } |
616 | } |
646 | }; |
617 | }; |
647 | $unblock_scheduler->{desc} = "[unblock_sub scheduler]"; |
618 | $unblock_scheduler->{desc} = "[unblock_sub scheduler]"; |
… | |
… | |
653 | unshift @unblock_queue, [$cb, @_]; |
624 | unshift @unblock_queue, [$cb, @_]; |
654 | $unblock_scheduler->ready; |
625 | $unblock_scheduler->ready; |
655 | } |
626 | } |
656 | } |
627 | } |
657 | |
628 | |
|
|
629 | =item $cb = Coro::rouse_cb |
|
|
630 | |
|
|
631 | Create and return a "rouse callback". That's a code reference that, when |
|
|
632 | called, will save its arguments and notify the owner coroutine of the |
|
|
633 | callback. |
|
|
634 | |
|
|
635 | See the next function. |
|
|
636 | |
|
|
637 | =item @args = Coro::rouse_wait [$cb] |
|
|
638 | |
|
|
639 | Wait for the specified rouse callback (or the last one tht was created in |
|
|
640 | this coroutine). |
|
|
641 | |
|
|
642 | As soon as the callback is invoked (or when the calback was invoked before |
|
|
643 | C<rouse_wait>), it will return a copy of the arguments originally passed |
|
|
644 | to the rouse callback. |
|
|
645 | |
|
|
646 | See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. |
|
|
647 | |
658 | =back |
648 | =back |
659 | |
649 | |
660 | =cut |
650 | =cut |
661 | |
651 | |
662 | 1; |
652 | 1; |
|
|
653 | |
|
|
654 | =head1 HOW TO WAIT FOR A CALLBACK |
|
|
655 | |
|
|
656 | It is very common for a coroutine to wait for some callback to be |
|
|
657 | called. This occurs naturally when you use coroutines in an otherwise |
|
|
658 | event-based program, or when you use event-based libraries. |
|
|
659 | |
|
|
660 | These typically register a callback for some event, and call that callback |
|
|
661 | when the event occured. In a coroutine, however, you typically want to |
|
|
662 | just wait for the event, simplyifying things. |
|
|
663 | |
|
|
664 | For example C<< AnyEvent->child >> registers a callback to be called when |
|
|
665 | a specific child has exited: |
|
|
666 | |
|
|
667 | my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... }); |
|
|
668 | |
|
|
669 | But from withina coroutine, you often just want to write this: |
|
|
670 | |
|
|
671 | my $status = wait_for_child $pid; |
|
|
672 | |
|
|
673 | Coro offers two functions specifically designed to make this easy, |
|
|
674 | C<Coro::rouse_cb> and C<Coro::rouse_wait>. |
|
|
675 | |
|
|
676 | The first function, C<rouse_cb>, generates and returns a callback that, |
|
|
677 | when invoked, will save it's arguments and notify the coroutine that |
|
|
678 | created the callback. |
|
|
679 | |
|
|
680 | The second function, C<rouse_wait>, waits for the callback to be called |
|
|
681 | (by calling C<schedule> to go to sleep) and returns the arguments |
|
|
682 | originally passed to the callback. |
|
|
683 | |
|
|
684 | Using these functions, it becomes easy to write the C<wait_for_child> |
|
|
685 | function mentioned above: |
|
|
686 | |
|
|
687 | sub wait_for_child($) { |
|
|
688 | my ($pid) = @_; |
|
|
689 | |
|
|
690 | my $watcher = AnyEvent->child (pid => $pid, cb => Coro::rouse_cb); |
|
|
691 | |
|
|
692 | my ($rpid, $rstatus) = Coro::rouse_wait; |
|
|
693 | $rstatus |
|
|
694 | } |
|
|
695 | |
|
|
696 | In the case where C<rouse_cb> and C<rouse_wait> are not flexible enough, |
|
|
697 | you can roll your own, using C<schedule>: |
|
|
698 | |
|
|
699 | sub wait_for_child($) { |
|
|
700 | my ($pid) = @_; |
|
|
701 | |
|
|
702 | # store the current coroutine in $current, |
|
|
703 | # and provide result variables for the closure passed to ->child |
|
|
704 | my $current = $Coro::current; |
|
|
705 | my ($done, $rstatus); |
|
|
706 | |
|
|
707 | # pass a closure to ->child |
|
|
708 | my $watcher = AnyEvent->child (pid => $pid, cb => sub { |
|
|
709 | $rstatus = $_[1]; # remember rstatus |
|
|
710 | $done = 1; # mark $rstatus as valud |
|
|
711 | }); |
|
|
712 | |
|
|
713 | # wait until the closure has been called |
|
|
714 | schedule while !$done; |
|
|
715 | |
|
|
716 | $rstatus |
|
|
717 | } |
|
|
718 | |
663 | |
719 | |
664 | =head1 BUGS/LIMITATIONS |
720 | =head1 BUGS/LIMITATIONS |
665 | |
721 | |
666 | =over 4 |
722 | =over 4 |
667 | |
723 | |
… | |
… | |
700 | |
756 | |
701 | Debugging: L<Coro::Debug>. |
757 | Debugging: L<Coro::Debug>. |
702 | |
758 | |
703 | Support/Utility: L<Coro::Specific>, L<Coro::Util>. |
759 | Support/Utility: L<Coro::Specific>, L<Coro::Util>. |
704 | |
760 | |
705 | Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. |
761 | Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, |
|
|
762 | L<Coro::SemaphoreSet>, L<Coro::RWLock>. |
706 | |
763 | |
707 | IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>. |
764 | IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>. |
708 | |
765 | |
709 | Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>. |
766 | Compatibility: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for |
|
|
767 | a better-working alternative), L<Coro::BDB>, L<Coro::Storable>, |
|
|
768 | L<Coro::Select>. |
710 | |
769 | |
711 | XS API: L<Coro::MakeMaker>. |
770 | XS API: L<Coro::MakeMaker>. |
712 | |
771 | |
713 | Low level Configuration, Coroutine Environment: L<Coro::State>. |
772 | Low level Configuration, Coroutine Environment: L<Coro::State>. |
714 | |
773 | |