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

Comparing Coro/Coro.pm (file contents):
Revision 1.90 by root, Thu Nov 30 18:21:14 2006 UTC vs.
Revision 1.152 by root, Sun Oct 7 13:53:37 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines