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

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

Diff Legend

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