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

Comparing Coro/Coro.pm (file contents):
Revision 1.53 by root, Tue May 27 01:15:26 2003 UTC vs.
Revision 1.180 by root, Fri Apr 25 04:28:50 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";
12 cede; # yield back to main
13 print "4\n";
11 }; 14 };
12 15 print "1\n";
13 # alternatively create an async process like this: 16 cede; # yield to coroutine
14 17 print "3\n";
15 sub some_func : Coro { 18 cede; # and again
16 # some more async code 19
17 } 20 # use locking
18 21 my $lock = new Coro::Semaphore;
19 cede; 22 my $locked;
23
24 $lock->down;
25 $locked = 1;
26 $lock->up;
20 27
21=head1 DESCRIPTION 28=head1 DESCRIPTION
22 29
23This module collection manages coroutines. Coroutines are similar to 30This module collection manages coroutines. Coroutines are similar
24threads but don't run in parallel. 31to threads but don't run in parallel at the same time even on SMP
32machines. The specific flavor of coroutine used in this module also
33guarantees you that it will not switch between coroutines unless
34necessary, at easily-identified points in your program, so locking and
35parallel access are rarely an issue, making coroutine programming much
36safer than threads programming.
25 37
38(Perl, however, does not natively support real threads but instead does a
39very slow and memory-intensive emulation of processes using threads. This
40is a performance win on Windows machines, and a loss everywhere else).
41
26In this module, coroutines are defined as "callchain + lexical variables 42In this module, coroutines are defined as "callchain + lexical variables +
27+ @_ + $_ + $@ + $^W + C stack), that is, a coroutine has it's own 43@_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own callchain,
28callchain, it's own set of lexicals and it's own set of perl's most 44its own set of lexicals and its own set of perls most important global
29important global variables. 45variables (see L<Coro::State> for more configuration).
30 46
31=cut 47=cut
32 48
33package Coro; 49package Coro;
34 50
51use strict;
35no warnings qw(uninitialized); 52no warnings "uninitialized";
36 53
37use Coro::State; 54use Coro::State;
38 55
39use base Exporter; 56use base qw(Coro::State Exporter);
40 57
58our $idle; # idle handler
59our $main; # main coroutine
60our $current; # current coroutine
61
41$VERSION = 0.7; 62our $VERSION = 4.6;
42 63
43@EXPORT = qw(async cede schedule terminate current); 64our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
44%EXPORT_TAGS = ( 65our %EXPORT_TAGS = (
45 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 66 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
46); 67);
47@EXPORT_OK = @{$EXPORT_TAGS{prio}}; 68our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
48
49{
50 my @async;
51 my $init;
52
53 # this way of handling attributes simply is NOT scalable ;()
54 sub import {
55 Coro->export_to_level(1, @_);
56 my $old = *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"}{CODE};
57 *{(caller)[0]."::MODIFY_CODE_ATTRIBUTES"} = sub {
58 my ($package, $ref) = (shift, shift);
59 my @attrs;
60 for (@_) {
61 if ($_ eq "Coro") {
62 push @async, $ref;
63 unless ($init++) {
64 eval q{
65 sub INIT {
66 &async(pop @async) while @async;
67 }
68 };
69 }
70 } else {
71 push @attrs, $_;
72 }
73 }
74 return $old ? $old->($package, $ref, @attrs) : @attrs;
75 };
76 }
77
78}
79 69
80=over 4 70=over 4
81 71
82=item $main 72=item $main
83 73
84This coroutine represents the main program. 74This coroutine represents the main program.
85 75
86=cut 76=cut
87 77
88our $main = new Coro; 78$main = new Coro;
89 79
90=item $current (or as function: current) 80=item $current (or as function: current)
91 81
92The current coroutine (the last coroutine switched to). The initial value is C<$main> (of course). 82The current coroutine (the last coroutine switched to). The initial value
83is C<$main> (of course).
93 84
85This variable is B<strictly> I<read-only>. It is provided for performance
86reasons. If performance is not essential you are encouraged to use the
87C<Coro::current> function instead.
88
94=cut 89=cut
90
91$main->{desc} = "[main::]";
95 92
96# maybe some other module used Coro::Specific before... 93# maybe some other module used Coro::Specific before...
97if ($current) {
98 $main->{specific} = $current->{specific}; 94$main->{_specific} = $current->{_specific}
99} 95 if $current;
100 96
101our $current = $main; 97_set_current $main;
102 98
103sub current() { $current } 99sub current() { $current }
104 100
105=item $idle 101=item $idle
106 102
107The coroutine to switch to when no other coroutine is running. The default 103A callback that is called whenever the scheduler finds no ready coroutines
108implementation prints "FATAL: deadlock detected" and exits. 104to run. The default implementation prints "FATAL: deadlock detected" and
105exits, because the program has no other way to continue.
109 106
110=cut 107This 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
109coroutine so the scheduler can run it.
111 110
112# should be done using priorities :( 111Please note that if your callback recursively invokes perl (e.g. for event
113our $idle = new Coro sub { 112handlers), then it must be prepared to be called recursively itself.
114 print STDERR "FATAL: deadlock detected\n"; 113
115 exit(51); 114=cut
115
116$idle = sub {
117 require Carp;
118 Carp::croak ("FATAL: deadlock detected");
116}; 119};
120
121sub _cancel {
122 my ($self) = @_;
123
124 # free coroutine data and mark as destructed
125 $self->_destroy
126 or return;
127
128 # call all destruction callbacks
129 $_->(@{$self->{_status}})
130 for @{(delete $self->{_on_destroy}) || []};
131}
117 132
118# this coroutine is necessary because a coroutine 133# this coroutine is necessary because a coroutine
119# cannot destroy itself. 134# cannot destroy itself.
120my @destroy; 135my @destroy;
121my $manager; 136my $manager;
137
122$manager = new Coro sub { 138$manager = new Coro sub {
123 while() { 139 while () {
124 # by overwriting the state object with the manager we destroy it 140 (shift @destroy)->_cancel
125 # while still being able to schedule this coroutine (in case it has
126 # been readied multiple times. this is harmless since the manager
127 # can be called as many times as neccessary and will always
128 # remove itself from the runqueue
129 while (@destroy) { 141 while @destroy;
130 my $coro = pop @destroy; 142
131 $coro->{status} ||= [];
132 $_->ready for @{delete $coro->{join} || []};
133 $coro->{_coro_state} = $manager->{_coro_state};
134 }
135 &schedule; 143 &schedule;
136 } 144 }
137}; 145};
138 146$manager->desc ("[coro manager]");
139# static methods. not really. 147$manager->prio (PRIO_MAX);
140 148
141=back 149=back
142 150
143=head2 STATIC METHODS 151=head2 STATIC METHODS
144 152
145Static methods are actually functions that operate on the current process only. 153Static methods are actually functions that operate on the current coroutine only.
146 154
147=over 4 155=over 4
148 156
149=item async { ... } [@args...] 157=item async { ... } [@args...]
150 158
151Create a new asynchronous process and return it's process object 159Create a new asynchronous coroutine and return it's coroutine object
152(usually unused). When the sub returns the new process is automatically 160(usually unused). When the sub returns the new coroutine is automatically
153terminated. 161terminated.
162
163See the C<Coro::State::new> constructor for info about the coroutine
164environment in which coroutines run.
165
166Calling C<exit> in a coroutine will do the same as calling exit outside
167the coroutine. Likewise, when the coroutine dies, the program will exit,
168just as it would in the main program.
154 169
155 # create a new coroutine that just prints its arguments 170 # create a new coroutine that just prints its arguments
156 async { 171 async {
157 print "@_\n"; 172 print "@_\n";
158 } 1,2,3,4; 173 } 1,2,3,4;
159 174
160The coderef you submit MUST NOT be a closure that refers to variables
161in an outer scope. This does NOT work. Pass arguments into it instead.
162
163=cut 175=cut
164 176
165sub async(&@) { 177sub async(&@) {
166 my $pid = new Coro @_; 178 my $coro = new Coro @_;
167 $manager->ready; # this ensures that the stack is cloned from the manager
168 $pid->ready; 179 $coro->ready;
169 $pid; 180 $coro
181}
182
183=item async_pool { ... } [@args...]
184
185Similar 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
187that might have executed other code already (which can be good or bad :).
188
189Also, the 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
191C<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,
193which somehow defeats the purpose of pooling.
194
195The priority will be reset to C<0> after each job, tracing will be
196disabled, the description will be reset and the default output filehandle
197gets restored, so you can change alkl these. Otherwise the coroutine will
198be 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
200done by using local as in C< local $/ >.
201
202The pool size is limited to 8 idle coroutines (this can be adjusted by
203changing $Coro::POOL_SIZE), and there can be as many non-idle coros as
204required.
205
206If 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
208{ 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
210(adjustable with $Coro::POOL_RSS) it will also exit.
211
212=cut
213
214our $POOL_SIZE = 8;
215our $POOL_RSS = 16 * 1024;
216our @async_pool;
217
218sub pool_handler {
219 my $cb;
220
221 while () {
222 eval {
223 while () {
224 _pool_1 $cb;
225 &$cb;
226 _pool_2 $cb;
227 &schedule;
228 }
229 };
230
231 last if $@ eq "\3async_pool terminate\2\n";
232 warn $@ if $@;
233 }
234}
235
236sub async_pool(&@) {
237 # this is also inlined into the unlock_scheduler
238 my $coro = (pop @async_pool) || new Coro \&pool_handler;
239
240 $coro->{_invoke} = [@_];
241 $coro->ready;
242
243 $coro
170} 244}
171 245
172=item schedule 246=item schedule
173 247
174Calls the scheduler. Please note that the current process will not be put 248Calls the scheduler. Please note that the current coroutine will not be put
175into the ready queue, so calling this function usually means you will 249into the ready queue, so calling this function usually means you will
176never be called again. 250never be called again unless something else (e.g. an event handler) calls
251ready.
177 252
178=cut 253The canonical way to wait on external events is this:
254
255 {
256 # remember current coroutine
257 my $current = $Coro::current;
258
259 # register a hypothetical event handler
260 on_event_invoke sub {
261 # wake up sleeping coroutine
262 $current->ready;
263 undef $current;
264 };
265
266 # call schedule until event occurred.
267 # in case we are woken up for other reasons
268 # (current still defined), loop.
269 Coro::schedule while $current;
270 }
179 271
180=item cede 272=item cede
181 273
182"Cede" to other processes. This function puts the current process into the 274"Cede" to other coroutines. This function puts the current coroutine into the
183ready queue and calls C<schedule>, which has the effect of giving up the 275ready queue and calls C<schedule>, which has the effect of giving up the
184current "timeslice" to other coroutines of the same or higher priority. 276current "timeslice" to other coroutines of the same or higher priority.
185 277
186=cut 278=item Coro::cede_notself
279
280Works like cede, but is not exported by default and will cede to any
281coroutine, regardless of priority, once.
187 282
188=item terminate [arg...] 283=item terminate [arg...]
189 284
190Terminates the current process. 285Terminates the current coroutine with the given status values (see L<cancel>).
191 286
192Future versions of this function will allow result arguments. 287=item killall
288
289Kills/terminates/cancels all coroutines except the currently running
290one. This is useful after a fork, either in the child or the parent, as
291usually only one of them should inherit the running coroutines.
193 292
194=cut 293=cut
195 294
196sub terminate { 295sub terminate {
197 $current->{status} = [@_];
198 $current->cancel; 296 $current->cancel (@_);
199 &schedule; 297}
200 die; # NORETURN 298
299sub killall {
300 for (Coro::State::list) {
301 $_->cancel
302 if $_ != $current && UNIVERSAL::isa $_, "Coro";
303 }
201} 304}
202 305
203=back 306=back
204 307
205# dynamic methods
206
207=head2 PROCESS METHODS 308=head2 COROUTINE METHODS
208 309
209These are the methods you can call on process objects. 310These are the methods you can call on coroutine objects.
210 311
211=over 4 312=over 4
212 313
213=item new Coro \&sub [, @args...] 314=item new Coro \&sub [, @args...]
214 315
215Create a new process and return it. When the sub returns the process 316Create a new coroutine and return it. When the sub returns the coroutine
216automatically terminates as if C<terminate> with the returned values were 317automatically terminates as if C<terminate> with the returned values were
217called. To make the process run you must first put it into the ready queue 318called. To make the coroutine run you must first put it into the ready queue
218by calling the ready method. 319by calling the ready method.
219 320
220=cut 321See C<async> and C<Coro::State::new> for additional info about the
322coroutine environment.
221 323
324=cut
325
222sub _newcoro { 326sub _run_coro {
223 terminate &{+shift}; 327 terminate &{+shift};
224} 328}
225 329
226sub new { 330sub new {
227 my $class = shift; 331 my $class = shift;
228 bless {
229 _coro_state => (new Coro::State $_[0] && \&_newcoro, @_),
230 }, $class;
231}
232 332
233=item $process->ready 333 $class->SUPER::new (\&_run_coro, @_)
334}
234 335
235Put the given process into the ready queue. 336=item $success = $coroutine->ready
236 337
237=cut 338Put the given coroutine into the ready queue (according to it's priority)
339and return true. If the coroutine is already in the ready queue, do nothing
340and return false.
238 341
239=item $process->cancel 342=item $is_ready = $coroutine->is_ready
240 343
241Like C<terminate>, but terminates the specified process instead. 344Return wether the coroutine is currently the ready queue or not,
345
346=item $coroutine->cancel (arg...)
347
348Terminates the given coroutine and makes it return the given arguments as
349status (default: the empty list). Never returns if the coroutine is the
350current coroutine.
242 351
243=cut 352=cut
244 353
245sub cancel { 354sub cancel {
355 my $self = shift;
356 $self->{_status} = [@_];
357
358 if ($current == $self) {
246 push @destroy, $_[0]; 359 push @destroy, $self;
247 $manager->ready; 360 $manager->ready;
248 &schedule if $current == $_[0]; 361 &schedule while 1;
362 } else {
363 $self->_cancel;
364 }
249} 365}
250 366
251=item $process->join 367=item $coroutine->join
252 368
253Wait until the coroutine terminates and return any values given to the 369Wait until the coroutine terminates and return any values given to the
254C<terminate> function. C<join> can be called multiple times from multiple 370C<terminate> or C<cancel> functions. C<join> can be called concurrently
255processes. 371from multiple coroutines.
256 372
257=cut 373=cut
258 374
259sub join { 375sub join {
260 my $self = shift; 376 my $self = shift;
377
261 unless ($self->{status}) { 378 unless ($self->{_status}) {
262 push @{$self->{join}}, $current; 379 my $current = $current;
263 &schedule; 380
381 push @{$self->{_on_destroy}}, sub {
382 $current->ready;
383 undef $current;
384 };
385
386 &schedule while $current;
264 } 387 }
388
265 wantarray ? @{$self->{status}} : $self->{status}[0]; 389 wantarray ? @{$self->{_status}} : $self->{_status}[0];
266} 390}
267 391
392=item $coroutine->on_destroy (\&cb)
393
394Registers a callback that is called when this coroutine gets destroyed,
395but before it is joined. The callback gets passed the terminate arguments,
396if any.
397
398=cut
399
400sub on_destroy {
401 my ($self, $cb) = @_;
402
403 push @{ $self->{_on_destroy} }, $cb;
404}
405
268=item $oldprio = $process->prio($newprio) 406=item $oldprio = $coroutine->prio ($newprio)
269 407
270Sets (or gets, if the argument is missing) the priority of the 408Sets (or gets, if the argument is missing) the priority of the
271process. Higher priority processes get run before lower priority 409coroutine. Higher priority coroutines get run before lower priority
272processes. Priorities are small signed integers (currently -4 .. +3), 410coroutines. Priorities are small signed integers (currently -4 .. +3),
273that you can refer to using PRIO_xxx constants (use the import tag :prio 411that you can refer to using PRIO_xxx constants (use the import tag :prio
274to get then): 412to get then):
275 413
276 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 414 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
277 3 > 1 > 0 > -1 > -3 > -4 415 3 > 1 > 0 > -1 > -3 > -4
280 current->prio(PRIO_HIGH); 418 current->prio(PRIO_HIGH);
281 419
282The idle coroutine ($Coro::idle) always has a lower priority than any 420The idle coroutine ($Coro::idle) always has a lower priority than any
283existing coroutine. 421existing coroutine.
284 422
285Changing the priority of the current process will take effect immediately, 423Changing the priority of the current coroutine will take effect immediately,
286but changing the priority of processes in the ready queue (but not 424but changing the priority of coroutines in the ready queue (but not
287running) will only take effect after the next schedule (of that 425running) will only take effect after the next schedule (of that
288process). This is a bug that will be fixed in some future version. 426coroutine). This is a bug that will be fixed in some future version.
289 427
290=cut
291
292sub prio {
293 my $old = $_[0]{prio};
294 $_[0]{prio} = $_[1] if @_ > 1;
295 $old;
296}
297
298=item $newprio = $process->nice($change) 428=item $newprio = $coroutine->nice ($change)
299 429
300Similar to C<prio>, but subtract the given value from the priority (i.e. 430Similar to C<prio>, but subtract the given value from the priority (i.e.
301higher values mean lower priority, just as in unix). 431higher values mean lower priority, just as in unix).
302 432
303=cut
304
305sub nice {
306 $_[0]{prio} -= $_[1];
307}
308
309=item $olddesc = $process->desc($newdesc) 433=item $olddesc = $coroutine->desc ($newdesc)
310 434
311Sets (or gets in case the argument is missing) the description for this 435Sets (or gets in case the argument is missing) the description for this
312process. This is just a free-form string you can associate with a process. 436coroutine. This is just a free-form string you can associate with a coroutine.
437
438This method simply sets the C<< $coroutine->{desc} >> member to the given string. You
439can 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.
313 456
314=cut 457=cut
315 458
316sub desc { 459sub desc {
317 my $old = $_[0]{desc}; 460 my $old = $_[0]{desc};
319 $old; 462 $old;
320} 463}
321 464
322=back 465=back
323 466
467=head2 GLOBAL FUNCTIONS
468
469=over 4
470
471=item Coro::nready
472
473Returns 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
475coroutine is the currently running one, so C<cede> would have no effect,
476and C<schedule> would cause a deadlock unless there is an idle handler
477that wakes up some coroutines.
478
479=item my $guard = Coro::guard { ... }
480
481This creates and returns a guard object. Nothing happens until the object
482gets destroyed, in which case the codeblock given as argument will be
483executed. This is useful to free locks or other resources in case of a
484runtime error or when the coroutine gets canceled, as in both cases the
485guard block will be executed. The guard object supports only one method,
486C<< ->cancel >>, which will keep the codeblock from being executed.
487
488Example: set some flag and clear it again when the coroutine gets canceled
489or the function returns:
490
491 sub do_something {
492 my $guard = Coro::guard { $busy = 0 };
493 $busy = 1;
494
495 # do something that requires $busy to be true
496 }
497
498=cut
499
500sub guard(&) {
501 bless \(my $cb = $_[0]), "Coro::guard"
502}
503
504sub Coro::guard::cancel {
505 ${$_[0]} = sub { };
506}
507
508sub Coro::guard::DESTROY {
509 ${$_[0]}->();
510}
511
512
513=item unblock_sub { ... }
514
515This utility function takes a BLOCK or code reference and "unblocks" it,
516returning the new coderef. This means that the new coderef will return
517immediately without blocking, returning nothing, while the original code
518ref will be called (with parameters) from within its own coroutine.
519
520The reason this function exists is that many event libraries (such as the
521venerable L<Event|Event> module) are not coroutine-safe (a weaker form
522of thread-safety). This means you must not block within event callbacks,
523otherwise you might suffer from crashes or worse.
524
525This function allows your callbacks to block by executing them in another
526coroutine 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
528disk.
529
530In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
531creating event callbacks that want to block.
532
533=cut
534
535our @unblock_queue;
536
537# we create a special coro because we want to cede,
538# to reduce pressure on the coro pool (because most callbacks
539# return immediately and can be reused) and because we cannot cede
540# inside an event callback.
541our $unblock_scheduler = new Coro sub {
542 while () {
543 while (my $cb = pop @unblock_queue) {
544 # this is an inlined copy of async_pool
545 my $coro = (pop @async_pool) || new Coro \&pool_handler;
546
547 $coro->{_invoke} = $cb;
548 $coro->ready;
549 cede; # for short-lived callbacks, this reduces pressure on the coro pool
550 }
551 schedule; # sleep well
552 }
553};
554$unblock_scheduler->desc ("[unblock_sub scheduler]");
555
556sub unblock_sub(&) {
557 my $cb = shift;
558
559 sub {
560 unshift @unblock_queue, [$cb, @_];
561 $unblock_scheduler->ready;
562 }
563}
564
565=back
566
324=cut 567=cut
325 568
3261; 5691;
327 570
328=head1 BUGS/LIMITATIONS 571=head1 BUGS/LIMITATIONS
329 572
330 - you must make very sure that no coro is still active on global 573 - you must make very sure that no coro is still active on global
331 destruction. very bad things might happen otherwise (usually segfaults). 574 destruction. very bad things might happen otherwise (usually segfaults).
332 575
333 - this module is not thread-safe. You should only ever use this module 576 - this module is not thread-safe. You should only ever use this module
334 from the same thread (this requirement might be losened in the future 577 from the same thread (this requirement might be loosened in the future
335 to allow per-thread schedulers, but Coro::State does not yet allow 578 to allow per-thread schedulers, but Coro::State does not yet allow
336 this). 579 this).
337 580
338=head1 SEE ALSO 581=head1 SEE ALSO
339 582
340L<Coro::Channel>, L<Coro::Cont>, L<Coro::Specific>, L<Coro::Semaphore>, 583Lower level Configuration, Coroutine Environment: L<Coro::State>.
341L<Coro::Signal>, L<Coro::State>, L<Coro::Event>, L<Coro::RWLock>, 584
342L<Coro::Handle>, L<Coro::Socket>. 585Debugging: L<Coro::Debug>.
586
587Support/Utility: L<Coro::Specific>, L<Coro::Util>.
588
589Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, L<Coro::SemaphoreSet>, L<Coro::RWLock>.
590
591Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>.
592
593Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>.
594
595Embedding: L<Coro::MakeMaker>.
343 596
344=head1 AUTHOR 597=head1 AUTHOR
345 598
346 Marc Lehmann <pcg@goof.com> 599 Marc Lehmann <schmorp@schmorp.de>
347 http://www.goof.com/pcg/marc/ 600 http://home.schmorp.de/
348 601
349=cut 602=cut
350 603

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines