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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines