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

Comparing Coro/Coro.pm (file contents):
Revision 1.156 by root, Fri Nov 9 19:50:15 2007 UTC vs.
Revision 1.203 by root, Sat Oct 4 23:23:56 2008 UTC

… …
2 2
3Coro - coroutine process abstraction 3Coro - coroutine process abstraction
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use Coro; 7 use Coro;
8 8
9 async { 9 async {
10 # some asynchronous thread of execution 10 # some asynchronous thread of execution
11 print "2\n"; 11 print "2\n";
12 cede; # yield back to main 12 cede; # yield back to main
13 print "4\n"; 13 print "4\n";
14 }; 14 };
15 print "1\n"; 15 print "1\n";
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.2'; 72our $VERSION = 4.8;
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{
71 my @async;
72 my $init;
73
74 # this way of handling attributes simply is NOT scalable ;()
75 sub import {
76 no strict 'refs';
77
78 Coro->export_to_level (1, @_);
79
80 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
81 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
82 my ($package, $ref) = (shift, shift);
83 my @attrs;
84 for (@_) {
85 if ($_ eq "Coro") {
86 push @async, $ref;
87 unless ($init++) {
88 eval q{
89 sub INIT {
90 &async(pop @async) while @async;
91 }
92 };
93 }
94 } else {
95 push @attrs, $_;
96 }
97 }
98 return $old ? $old->($package, $ref, @attrs) : @attrs;
99 };
100 }
101
102}
103
104=over 4 80=over 4
105 81
106=item $main 82=item $Coro::main
107 83
108This 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.
109 88
110=cut 89=cut
111 90
112$main = new Coro; 91$main = new Coro;
113 92
114=item $current (or as function: current) 93=item $Coro::current
115 94
116The 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
117is C<$main> (of course). 97C<$main> (of course).
118 98
119This 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
120reasons. 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
121C<Coro::current> function instead. 101not otherwise modify the variable itself.
122 102
123=cut 103=cut
124 104
125$main->{desc} = "[main::]"; 105$main->{desc} = "[main::]";
126 106
… …
128$main->{_specific} = $current->{_specific} 108$main->{_specific} = $current->{_specific}
129 if $current; 109 if $current;
130 110
131_set_current $main; 111_set_current $main;
132 112
133sub current() { $current } 113sub current() { $current } # [DEPRECATED]
134 114
135=item $idle 115=item $Coro::idle
136 116
137A callback that is called whenever the scheduler finds no ready coroutines 117This variable is mainly useful to integrate Coro into event loops. It is
138to run. The default implementation prints "FATAL: deadlock detected" and 118usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is
139exits, 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.
140 125
141This hook is overwritten by modules such as C<Coro::Timer> and 126This hook is overwritten by modules such as C<Coro::Timer> and
142C<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
143coroutine 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.
144 137
145Please 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
146handlers), then it must be prepared to be called recursively itself. 139handlers), then it must be prepared to be called recursively itself.
147 140
148=cut 141=cut
… …
178 } 171 }
179}; 172};
180$manager->desc ("[coro manager]"); 173$manager->desc ("[coro manager]");
181$manager->prio (PRIO_MAX); 174$manager->prio (PRIO_MAX);
182 175
183# static methods. not really.
184
185=back 176=back
186 177
187=head2 STATIC METHODS 178=head2 SIMPLE COROUTINE CREATION
188
189Static methods are actually functions that operate on the current coroutine only.
190 179
191=over 4 180=over 4
192 181
193=item async { ... } [@args...] 182=item async { ... } [@args...]
194 183
195Create a new asynchronous coroutine and return it's coroutine object 184Create a new coroutine and return it's coroutine object (usually
196(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
197terminated. 190terminated.
198 191
192The remaining arguments are passed as arguments to the closure.
193
199See the C<Coro::State::new> constructor for info about the coroutine 194See the C<Coro::State::new> constructor for info about the coroutine
200environment in which coroutines run. 195environment in which coroutines are executed.
201 196
202Calling 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
203the coroutine. Likewise, when the coroutine dies, the program will exit, 198the coroutine. Likewise, when the coroutine dies, the program will exit,
204just as it would in the main program. 199just as it would in the main program.
205 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
206 # create a new coroutine that just prints its arguments 204Example: Create a new coroutine that just prints its arguments.
205
207 async { 206 async {
208 print "@_\n"; 207 print "@_\n";
209 } 1,2,3,4; 208 } 1,2,3,4;
210 209
211=cut 210=cut
… …
217} 216}
218 217
219=item async_pool { ... } [@args...] 218=item async_pool { ... } [@args...]
220 219
221Similar 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
222terminate 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
223that 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 :).
224 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
225Also, 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
226issued in case of an exception instead of terminating the program, as 230issued in case of an exception instead of terminating the program, as
227C<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>
228will 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,
229which somehow defeats the purpose of pooling. 233which somehow defeats the purpose of pooling (but is fine in the
234exceptional case).
230 235
231The 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
232disabled, the description will be reset and the default output filehandle 237disabled, the description will be reset and the default output filehandle
233gets restored, so you can change alkl these. Otherwise the coroutine will 238gets restored, so you can change all these. Otherwise the coroutine will
234be 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
235stuff such as C<$/> you need to revert that change, which is most simply 240stuff such as C<$/> you I<must needs> to revert that change, which is most
236done by using local as in C< local $/ >. 241simply done by using local as in: C< local $/ >.
237 242
238The pool size is limited to 8 idle coroutines (this can be adjusted by 243The pool size is limited to C<8> idle coroutines (this can be adjusted by
239changing $Coro::POOL_SIZE), and there can be as many non-idle coros as 244changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
240required. 245required.
241 246
242If you are concerned about pooled coroutines growing a lot because a 247If you are concerned about pooled coroutines growing a lot because a
243single 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
244{ 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
245addition 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
246(adjustable with $Coro::POOL_RSS) it will also exit. 251(adjustable via $Coro::POOL_RSS) it will also be destroyed.
247 252
248=cut 253=cut
249 254
250our $POOL_SIZE = 8; 255our $POOL_SIZE = 8;
251our $POOL_RSS = 16 * 1024; 256our $POOL_RSS = 16 * 1024;
… …
262 _pool_2 $cb; 267 _pool_2 $cb;
263 &schedule; 268 &schedule;
264 } 269 }
265 }; 270 };
266 271
272 if ($@) {
267 last if $@ eq "\3async_pool terminate\2\n"; 273 last if $@ eq "\3async_pool terminate\2\n";
268 warn $@ if $@; 274 warn $@;
275 }
269 } 276 }
270} 277}
271 278
272sub async_pool(&@) { 279sub async_pool(&@) {
273 # this is also inlined into the unlock_scheduler 280 # this is also inlined into the unlock_scheduler
… …
277 $coro->ready; 284 $coro->ready;
278 285
279 $coro 286 $coro
280} 287}
281 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
282=item schedule 297=item schedule
283 298
284Calls 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
285into the ready queue, so calling this function usually means you will 306queue, so calling this function usually means you will never be called
286never be called again unless something else (e.g. an event handler) calls 307again unless something else (e.g. an event handler) calls C<< ->ready >>,
287ready. 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.
288 317
289The canonical way to wait on external events is this: 318The canonical way to wait on external events is this:
290 319
291 { 320 {
292 # remember current coroutine 321 # remember current coroutine
… …
305 Coro::schedule while $current; 334 Coro::schedule while $current;
306 } 335 }
307 336
308=item cede 337=item cede
309 338
310"Cede" to other coroutines. This function puts the current coroutine into the 339"Cede" to other coroutines. This function puts the current coroutine into
311ready 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
312current "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.
313 346
314=item Coro::cede_notself 347=item Coro::cede_notself
315 348
316Works 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>
317coroutine, regardless of priority, once. 350coroutine, regardless of priority. This is useful sometimes to ensure
351progress is made.
318 352
319=item terminate [arg...] 353=item terminate [arg...]
320 354
321Terminates the current coroutine with the given status values (see L<cancel>). 355Terminates the current coroutine with the given status values (see L<cancel>).
322 356
323=item killall 357=item killall
324 358
325Kills/terminates/cancels all coroutines except the currently running 359Kills/terminates/cancels all coroutines except the currently running
326one. 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
327usually 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.
328 366
329=cut 367=cut
330 368
331sub terminate { 369sub terminate {
332 $current->cancel (@_); 370 $current->cancel (@_);
… …
339 } 377 }
340} 378}
341 379
342=back 380=back
343 381
344# dynamic methods
345
346=head2 COROUTINE METHODS 382=head2 COROUTINE METHODS
347 383
348These are the methods you can call on coroutine objects. 384These are the methods you can call on coroutine objects (or to create
385them).
349 386
350=over 4 387=over 4
351 388
352=item new Coro \&sub [, @args...] 389=item new Coro \&sub [, @args...]
353 390
354Create 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
355automatically terminates as if C<terminate> with the returned values were 392automatically terminates as if C<terminate> with the returned values were
356called. 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
357by calling the ready method. 394queue by calling the ready method.
358 395
359See 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
360coroutine environment. 397coroutine environment.
361 398
362=cut 399=cut
… …
371 $class->SUPER::new (\&_run_coro, @_) 408 $class->SUPER::new (\&_run_coro, @_)
372} 409}
373 410
374=item $success = $coroutine->ready 411=item $success = $coroutine->ready
375 412
376Put 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
377and 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
378and 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.
379 420
380=item $is_ready = $coroutine->is_ready 421=item $is_ready = $coroutine->is_ready
381 422
382Return wether the coroutine is currently the ready queue or not, 423Return whether the coroutine is currently the ready queue or not,
383 424
384=item $coroutine->cancel (arg...) 425=item $coroutine->cancel (arg...)
385 426
386Terminates the given coroutine and makes it return the given arguments as 427Terminates the given coroutine and makes it return the given arguments as
387status (default: the empty list). Never returns if the coroutine is the 428status (default: the empty list). Never returns if the coroutine is the
… …
404 445
405=item $coroutine->join 446=item $coroutine->join
406 447
407Wait until the coroutine terminates and return any values given to the 448Wait until the coroutine terminates and return any values given to the
408C<terminate> or C<cancel> functions. C<join> can be called concurrently 449C<terminate> or C<cancel> functions. C<join> can be called concurrently
409from multiple coroutines. 450from multiple coroutines, and all will be resumed and given the status
451return once the C<$coroutine> terminates.
410 452
411=cut 453=cut
412 454
413sub join { 455sub join {
414 my $self = shift; 456 my $self = shift;
… …
429 471
430=item $coroutine->on_destroy (\&cb) 472=item $coroutine->on_destroy (\&cb)
431 473
432Registers a callback that is called when this coroutine gets destroyed, 474Registers a callback that is called when this coroutine gets destroyed,
433but before it is joined. The callback gets passed the terminate arguments, 475but before it is joined. The callback gets passed the terminate arguments,
434if any. 476if any, and I<must not> die, under any circumstances.
435 477
436=cut 478=cut
437 479
438sub on_destroy { 480sub on_destroy {
439 my ($self, $cb) = @_; 481 my ($self, $cb) = @_;
… …
507=over 4 549=over 4
508 550
509=item Coro::nready 551=item Coro::nready
510 552
511Returns the number of coroutines that are currently in the ready state, 553Returns the number of coroutines that are currently in the ready state,
512i.e. that can be switched to. The value C<0> means that the only runnable 554i.e. that can be switched to by calling C<schedule> directory or
555indirectly. The value C<0> means that the only runnable coroutine is the
513coroutine is the currently running one, so C<cede> would have no effect, 556currently running one, so C<cede> would have no effect, and C<schedule>
514and C<schedule> would cause a deadlock unless there is an idle handler 557would cause a deadlock unless there is an idle handler that wakes up some
515that wakes up some coroutines. 558coroutines.
516 559
517=item my $guard = Coro::guard { ... } 560=item my $guard = Coro::guard { ... }
518 561
519This creates and returns a guard object. Nothing happens until the object 562This creates and returns a guard object. Nothing happens until the object
520gets destroyed, in which case the codeblock given as argument will be 563gets destroyed, in which case the codeblock given as argument will be
… …
549 592
550 593
551=item unblock_sub { ... } 594=item unblock_sub { ... }
552 595
553This utility function takes a BLOCK or code reference and "unblocks" it, 596This utility function takes a BLOCK or code reference and "unblocks" it,
554returning the new coderef. This means that the new coderef will return 597returning a new coderef. Unblocking means that calling the new coderef
555immediately without blocking, returning nothing, while the original code 598will return immediately without blocking, returning nothing, while the
556ref will be called (with parameters) from within its own coroutine. 599original code ref will be called (with parameters) from within another
600coroutine.
557 601
558The reason this function exists is that many event libraries (such as the 602The reason this function exists is that many event libraries (such as the
559venerable L<Event|Event> module) are not coroutine-safe (a weaker form 603venerable L<Event|Event> module) are not coroutine-safe (a weaker form
560of thread-safety). This means you must not block within event callbacks, 604of thread-safety). This means you must not block within event callbacks,
561otherwise you might suffer from crashes or worse. 605otherwise you might suffer from crashes or worse. The only event library
606currently known that is safe to use without C<unblock_sub> is L<EV>.
562 607
563This function allows your callbacks to block by executing them in another 608This function allows your callbacks to block by executing them in another
564coroutine where it is safe to block. One example where blocking is handy 609coroutine where it is safe to block. One example where blocking is handy
565is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 610is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
566disk. 611disk, for example.
567 612
568In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 613In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
569creating event callbacks that want to block. 614creating event callbacks that want to block.
615
616If your handler does not plan to block (e.g. simply sends a message to
617another coroutine, or puts some other coroutine into the ready queue),
618there is no reason to use C<unblock_sub>.
619
620Note that you also need to use C<unblock_sub> for any other callbacks that
621are indirectly executed by any C-based event loop. For example, when you
622use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
623provides callbacks that are the result of some event callback, then you
624must not block either, or use C<unblock_sub>.
570 625
571=cut 626=cut
572 627
573our @unblock_queue; 628our @unblock_queue;
574 629
… …
606 661
6071; 6621;
608 663
609=head1 BUGS/LIMITATIONS 664=head1 BUGS/LIMITATIONS
610 665
611 - you must make very sure that no coro is still active on global
612 destruction. very bad things might happen otherwise (usually segfaults).
613
614 - this module is not thread-safe. You should only ever use this module 666This module is not perl-pseudo-thread-safe. You should only ever use this
615 from the same thread (this requirement might be loosened in the future 667module from the same thread (this requirement might be removed in the
616 to allow per-thread schedulers, but Coro::State does not yet allow 668future to allow per-thread schedulers, but Coro::State does not yet allow
617 this). 669this). I recommend disabling thread support and using processes, as this
670is much faster and uses less memory.
618 671
619=head1 SEE ALSO 672=head1 SEE ALSO
620 673
621Lower level Configuration, Coroutine Environment: L<Coro::State>. 674Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
622 675
623Debugging: L<Coro::Debug>. 676Debugging: L<Coro::Debug>.
624 677
625Support/Utility: L<Coro::Specific>, L<Coro::Util>. 678Support/Utility: L<Coro::Specific>, L<Coro::Util>.
626 679
627Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>. 680Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
628 681
629Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>. 682IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
630 683
631Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>. 684Compatibility: L<Coro::LWP>, L<Coro::BDB>, L<Coro::Storable>, L<Coro::Select>.
632 685
633Embedding: L<Coro:MakeMaker>. 686XS API: L<Coro::MakeMaker>.
687
688Low level Configuration, Coroutine Environment: L<Coro::State>.
634 689
635=head1 AUTHOR 690=head1 AUTHOR
636 691
637 Marc Lehmann <schmorp@schmorp.de> 692 Marc Lehmann <schmorp@schmorp.de>
638 http://home.schmorp.de/ 693 http://home.schmorp.de/

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines