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

Comparing cvsroot/Coro/Coro.pm (file contents):
Revision 1.237 by root, Sat Nov 22 16:37:11 2008 UTC vs.
Revision 1.283 by root, Sat Feb 5 21:20:47 2011 UTC

1=head1 NAME 1=head1 NAME
2 2
3Coro - real threads in perl 3Coro - the only real threads in perl
4 4
5=head1 SYNOPSIS 5=head1 SYNOPSIS
6 6
7 use Coro; 7 use Coro;
8 8
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 coro
17 print "3\n"; 17 print "3\n";
18 cede; # and again 18 cede; # and again
19 19
20 # use locking 20 # use locking
21 use Coro::Semaphore; 21 use Coro::Semaphore;
29=head1 DESCRIPTION 29=head1 DESCRIPTION
30 30
31For a tutorial-style introduction, please read the L<Coro::Intro> 31For a tutorial-style introduction, please read the L<Coro::Intro>
32manpage. This manpage mainly contains reference information. 32manpage. This manpage mainly contains reference information.
33 33
34This module collection manages coroutines, that is, cooperative 34This module collection manages continuations in general, most often in
35threads. Coroutines are similar to kernel threads but don't (in general) 35the form of cooperative threads (also called coros, or simply "coro"
36in the documentation). They are similar to kernel threads but don't (in
36run in parallel at the same time even on SMP machines. The specific flavor 37general) run in parallel at the same time even on SMP machines. The
37of coroutine used in this module also guarantees you that it will not 38specific flavor of thread offered by this module also guarantees you that
38switch between coroutines unless necessary, at easily-identified points 39it will not switch between threads unless necessary, at easily-identified
39in your program, so locking and parallel access are rarely an issue, 40points in your program, so locking and parallel access are rarely an
40making coroutine programming much safer and easier than using other thread 41issue, making thread programming much safer and easier than using other
41models. 42thread models.
42 43
43Unlike the so-called "Perl threads" (which are not actually real threads 44Unlike the so-called "Perl threads" (which are not actually real threads
44but only the windows process emulation ported to unix), Coro provides a 45but only the windows process emulation (see section of same name for more
46details) ported to unix, and as such act as processes), Coro provides
45full shared address space, which makes communication between coroutines 47a full shared address space, which makes communication between threads
46very easy. And coroutines are fast, too: disabling the Windows process 48very easy. And Coro's threads are fast, too: disabling the Windows
47emulation code in your perl and using Coro can easily result in a two to 49process emulation code in your perl and using Coro can easily result in
48four times speed increase for your programs. 50a two to four times speed increase for your programs. A parallel matrix
51multiplication benchmark runs over 300 times faster on a single core than
52perl's pseudo-threads on a quad core using all four cores.
49 53
50Coro achieves that by supporting multiple running interpreters that share 54Coro achieves that by supporting multiple running interpreters that share
51data, which is especially useful to code pseudo-parallel processes and 55data, which is especially useful to code pseudo-parallel processes and
52for event-based programming, such as multiple HTTP-GET requests running 56for event-based programming, such as multiple HTTP-GET requests running
53concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro 57concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
54into an event-based environment. 58into an event-based environment.
55 59
56In this module, a coroutines is defined as "callchain + lexical variables 60In this module, a thread is defined as "callchain + lexical variables +
57+ @_ + $_ + $@ + $/ + C stack), that is, a coroutine has its own 61some package variables + C stack), that is, a thread has its own callchain,
58callchain, its own set of lexicals and its own set of perls most important 62its own set of lexicals and its own set of perls most important global
59global variables (see L<Coro::State> for more configuration and background 63variables (see L<Coro::State> for more configuration and background info).
60info).
61 64
62See also the C<SEE ALSO> section at the end of this document - the Coro 65See also the C<SEE ALSO> section at the end of this document - the Coro
63module family is quite large. 66module family is quite large.
64 67
65=cut 68=cut
66 69
67package Coro; 70package Coro;
68 71
69use strict qw(vars subs); 72use common::sense;
70no warnings "uninitialized"; 73
74use Carp ();
75
76use Guard ();
71 77
72use Coro::State; 78use Coro::State;
73 79
74use base qw(Coro::State Exporter); 80use base qw(Coro::State Exporter);
75 81
76our $idle; # idle handler 82our $idle; # idle handler
77our $main; # main coroutine 83our $main; # main coro
78our $current; # current coroutine 84our $current; # current coro
79 85
80our $VERSION = "5.0"; 86our $VERSION = 5.25;
81 87
82our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 88our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub rouse_cb rouse_wait);
83our %EXPORT_TAGS = ( 89our %EXPORT_TAGS = (
84 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 90 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
85); 91);
86our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 92our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
87 93
89 95
90=over 4 96=over 4
91 97
92=item $Coro::main 98=item $Coro::main
93 99
94This variable stores the coroutine object that represents the main 100This variable stores the Coro object that represents the main
95program. While you cna C<ready> it and do most other things you can do to 101program. While you cna C<ready> it and do most other things you can do to
96coroutines, it is mainly useful to compare again C<$Coro::current>, to see 102coro, it is mainly useful to compare again C<$Coro::current>, to see
97whether you are running in the main program or not. 103whether you are running in the main program or not.
98 104
99=cut 105=cut
100 106
101# $main is now being initialised by Coro::State 107# $main is now being initialised by Coro::State
102 108
103=item $Coro::current 109=item $Coro::current
104 110
105The coroutine object representing the current coroutine (the last 111The Coro object representing the current coro (the last
106coroutine that the Coro scheduler switched to). The initial value is 112coro that the Coro scheduler switched to). The initial value is
107C<$Coro::main> (of course). 113C<$Coro::main> (of course).
108 114
109This variable is B<strictly> I<read-only>. You can take copies of the 115This variable is B<strictly> I<read-only>. You can take copies of the
110value stored in it and use it as any other coroutine object, but you must 116value stored in it and use it as any other Coro object, but you must
111not otherwise modify the variable itself. 117not otherwise modify the variable itself.
112 118
113=cut 119=cut
114 120
115sub current() { $current } # [DEPRECATED] 121sub current() { $current } # [DEPRECATED]
116 122
117=item $Coro::idle 123=item $Coro::idle
118 124
119This variable is mainly useful to integrate Coro into event loops. It is 125This variable is mainly useful to integrate Coro into event loops. It is
120usually better to rely on L<Coro::AnyEvent> or LC<Coro::EV>, as this is 126usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
121pretty low-level functionality. 127pretty low-level functionality.
122 128
123This variable stores a callback that is called whenever the scheduler 129This variable stores a Coro object that is put into the ready queue when
124finds no ready coroutines to run. The default implementation prints 130there are no other ready threads (without invoking any ready hooks).
125"FATAL: deadlock detected" and exits, because the program has no other way
126to continue.
127 131
132The default implementation dies with "FATAL: deadlock detected.", followed
133by a thread listing, because the program has no other way to continue.
134
128This hook is overwritten by modules such as C<Coro::Timer> and 135This hook is overwritten by modules such as C<Coro::EV> and
129C<Coro::AnyEvent> to wait on an external event that hopefully wake up a 136C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
130coroutine so the scheduler can run it. 137coro so the scheduler can run it.
131 138
132Note that the callback I<must not>, under any circumstances, block
133the current coroutine. Normally, this is achieved by having an "idle
134coroutine" that calls the event loop and then blocks again, and then
135readying that coroutine in the idle handler.
136
137See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this 139See L<Coro::EV> or L<Coro::AnyEvent> for examples of using this technique.
138technique.
139 140
140Please note that if your callback recursively invokes perl (e.g. for event
141handlers), then it must be prepared to be called recursively itself.
142
143=cut 141=cut
144 142
145$idle = sub { 143# ||= because other modules could have provided their own by now
146 require Carp; 144$idle ||= new Coro sub {
147 Carp::croak ("FATAL: deadlock detected"); 145 require Coro::Debug;
146 die "FATAL: deadlock detected.\n"
147 . Coro::Debug::ps_listing ();
148}; 148};
149 149
150# this coroutine is necessary because a coroutine 150# this coro is necessary because a coro
151# cannot destroy itself. 151# cannot destroy itself.
152our @destroy; 152our @destroy;
153our $manager; 153our $manager;
154 154
155$manager = new Coro sub { 155$manager = new Coro sub {
156 while () { 156 while () {
157 Coro::_cancel shift @destroy 157 Coro::State::cancel shift @destroy
158 while @destroy; 158 while @destroy;
159 159
160 &schedule; 160 &schedule;
161 } 161 }
162}; 162};
163$manager->{desc} = "[coro manager]"; 163$manager->{desc} = "[coro manager]";
164$manager->prio (PRIO_MAX); 164$manager->prio (PRIO_MAX);
165 165
166=back 166=back
167 167
168=head1 SIMPLE COROUTINE CREATION 168=head1 SIMPLE CORO CREATION
169 169
170=over 4 170=over 4
171 171
172=item async { ... } [@args...] 172=item async { ... } [@args...]
173 173
174Create a new coroutine and return it's coroutine object (usually 174Create a new coro and return its Coro object (usually
175unused). The coroutine will be put into the ready queue, so 175unused). The coro will be put into the ready queue, so
176it will start running automatically on the next scheduler run. 176it will start running automatically on the next scheduler run.
177 177
178The first argument is a codeblock/closure that should be executed in the 178The first argument is a codeblock/closure that should be executed in the
179coroutine. When it returns argument returns the coroutine is automatically 179coro. When it returns argument returns the coro is automatically
180terminated. 180terminated.
181 181
182The remaining arguments are passed as arguments to the closure. 182The remaining arguments are passed as arguments to the closure.
183 183
184See the C<Coro::State::new> constructor for info about the coroutine 184See the C<Coro::State::new> constructor for info about the coro
185environment in which coroutines are executed. 185environment in which coro are executed.
186 186
187Calling C<exit> in a coroutine will do the same as calling exit outside 187Calling C<exit> in a coro will do the same as calling exit outside
188the coroutine. Likewise, when the coroutine dies, the program will exit, 188the coro. Likewise, when the coro dies, the program will exit,
189just as it would in the main program. 189just as it would in the main program.
190 190
191If you do not want that, you can provide a default C<die> handler, or 191If you do not want that, you can provide a default C<die> handler, or
192simply avoid dieing (by use of C<eval>). 192simply avoid dieing (by use of C<eval>).
193 193
194Example: Create a new coroutine that just prints its arguments. 194Example: Create a new coro that just prints its arguments.
195 195
196 async { 196 async {
197 print "@_\n"; 197 print "@_\n";
198 } 1,2,3,4; 198 } 1,2,3,4;
199 199
200=cut
201
202sub async(&@) {
203 my $coro = new Coro @_;
204 $coro->ready;
205 $coro
206}
207
208=item async_pool { ... } [@args...] 200=item async_pool { ... } [@args...]
209 201
210Similar to C<async>, but uses a coroutine pool, so you should not call 202Similar to C<async>, but uses a coro pool, so you should not call
211terminate or join on it (although you are allowed to), and you get a 203terminate or join on it (although you are allowed to), and you get a
212coroutine that might have executed other code already (which can be good 204coro that might have executed other code already (which can be good
213or bad :). 205or bad :).
214 206
215On the plus side, this function is about twice as fast as creating (and 207On the plus side, this function is about twice as fast as creating (and
216destroying) a completely new coroutine, so if you need a lot of generic 208destroying) a completely new coro, so if you need a lot of generic
217coroutines in quick successsion, use C<async_pool>, not C<async>. 209coros in quick successsion, use C<async_pool>, not C<async>.
218 210
219The code block is executed in an C<eval> context and a warning will be 211The code block is executed in an C<eval> context and a warning will be
220issued in case of an exception instead of terminating the program, as 212issued in case of an exception instead of terminating the program, as
221C<async> does. As the coroutine is being reused, stuff like C<on_destroy> 213C<async> does. As the coro is being reused, stuff like C<on_destroy>
222will not work in the expected way, unless you call terminate or cancel, 214will not work in the expected way, unless you call terminate or cancel,
223which somehow defeats the purpose of pooling (but is fine in the 215which somehow defeats the purpose of pooling (but is fine in the
224exceptional case). 216exceptional case).
225 217
226The priority will be reset to C<0> after each run, tracing will be 218The priority will be reset to C<0> after each run, tracing will be
227disabled, the description will be reset and the default output filehandle 219disabled, the description will be reset and the default output filehandle
228gets restored, so you can change all these. Otherwise the coroutine will 220gets restored, so you can change all these. Otherwise the coro will
229be re-used "as-is": most notably if you change other per-coroutine global 221be re-used "as-is": most notably if you change other per-coro global
230stuff such as C<$/> you I<must needs> revert that change, which is most 222stuff such as C<$/> you I<must needs> revert that change, which is most
231simply done by using local as in: C<< local $/ >>. 223simply done by using local as in: C<< local $/ >>.
232 224
233The idle pool size is limited to C<8> idle coroutines (this can be 225The idle pool size is limited to C<8> idle coros (this can be
234adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle 226adjusted by changing $Coro::POOL_SIZE), but there can be as many non-idle
235coros as required. 227coros as required.
236 228
237If you are concerned about pooled coroutines growing a lot because a 229If you are concerned about pooled coros growing a lot because a
238single C<async_pool> used a lot of stackspace you can e.g. C<async_pool 230single C<async_pool> used a lot of stackspace you can e.g. C<async_pool
239{ terminate }> once per second or so to slowly replenish the pool. In 231{ terminate }> once per second or so to slowly replenish the pool. In
240addition to that, when the stacks used by a handler grows larger than 32kb 232addition to that, when the stacks used by a handler grows larger than 32kb
241(adjustable via $Coro::POOL_RSS) it will also be destroyed. 233(adjustable via $Coro::POOL_RSS) it will also be destroyed.
242 234
259=back 251=back
260 252
261=head1 STATIC METHODS 253=head1 STATIC METHODS
262 254
263Static methods are actually functions that implicitly operate on the 255Static methods are actually functions that implicitly operate on the
264current coroutine. 256current coro.
265 257
266=over 4 258=over 4
267 259
268=item schedule 260=item schedule
269 261
270Calls the scheduler. The scheduler will find the next coroutine that is 262Calls the scheduler. The scheduler will find the next coro that is
271to be run from the ready queue and switches to it. The next coroutine 263to be run from the ready queue and switches to it. The next coro
272to be run is simply the one with the highest priority that is longest 264to be run is simply the one with the highest priority that is longest
273in its ready queue. If there is no coroutine ready, it will clal the 265in its ready queue. If there is no coro ready, it will call the
274C<$Coro::idle> hook. 266C<$Coro::idle> hook.
275 267
276Please note that the current coroutine will I<not> be put into the ready 268Please note that the current coro will I<not> be put into the ready
277queue, so calling this function usually means you will never be called 269queue, so calling this function usually means you will never be called
278again unless something else (e.g. an event handler) calls C<< ->ready >>, 270again unless something else (e.g. an event handler) calls C<< ->ready >>,
279thus waking you up. 271thus waking you up.
280 272
281This makes C<schedule> I<the> generic method to use to block the current 273This makes C<schedule> I<the> generic method to use to block the current
282coroutine and wait for events: first you remember the current coroutine in 274coro and wait for events: first you remember the current coro in
283a variable, then arrange for some callback of yours to call C<< ->ready 275a variable, then arrange for some callback of yours to call C<< ->ready
284>> on that once some event happens, and last you call C<schedule> to put 276>> on that once some event happens, and last you call C<schedule> to put
285yourself to sleep. Note that a lot of things can wake your coroutine up, 277yourself to sleep. Note that a lot of things can wake your coro up,
286so you need to check whether the event indeed happened, e.g. by storing the 278so you need to check whether the event indeed happened, e.g. by storing the
287status in a variable. 279status in a variable.
288 280
289See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks. 281See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
290 282
291=item cede 283=item cede
292 284
293"Cede" to other coroutines. This function puts the current coroutine into 285"Cede" to other coros. This function puts the current coro into
294the ready queue and calls C<schedule>, which has the effect of giving 286the ready queue and calls C<schedule>, which has the effect of giving
295up the current "timeslice" to other coroutines of the same or higher 287up the current "timeslice" to other coros of the same or higher
296priority. Once your coroutine gets its turn again it will automatically be 288priority. Once your coro gets its turn again it will automatically be
297resumed. 289resumed.
298 290
299This function is often called C<yield> in other languages. 291This function is often called C<yield> in other languages.
300 292
301=item Coro::cede_notself 293=item Coro::cede_notself
302 294
303Works like cede, but is not exported by default and will cede to I<any> 295Works like cede, but is not exported by default and will cede to I<any>
304coroutine, regardless of priority. This is useful sometimes to ensure 296coro, regardless of priority. This is useful sometimes to ensure
305progress is made. 297progress is made.
306 298
307=item terminate [arg...] 299=item terminate [arg...]
308 300
309Terminates the current coroutine with the given status values (see L<cancel>). 301Terminates the current coro with the given status values (see L<cancel>).
302
303=item Coro::on_enter BLOCK, Coro::on_leave BLOCK
304
305These function install enter and leave winders in the current scope. The
306enter block will be executed when on_enter is called and whenever the
307current coro is re-entered by the scheduler, while the leave block is
308executed whenever the current coro is blocked by the scheduler, and
309also when the containing scope is exited (by whatever means, be it exit,
310die, last etc.).
311
312I<Neither invoking the scheduler, nor exceptions, are allowed within those
313BLOCKs>. That means: do not even think about calling C<die> without an
314eval, and do not even think of entering the scheduler in any way.
315
316Since both BLOCKs are tied to the current scope, they will automatically
317be removed when the current scope exits.
318
319These functions implement the same concept as C<dynamic-wind> in scheme
320does, and are useful when you want to localise some resource to a specific
321coro.
322
323They slow down thread switching considerably for coros that use them
324(about 40% for a BLOCK with a single assignment, so thread switching is
325still reasonably fast if the handlers are fast).
326
327These functions are best understood by an example: The following function
328will change the current timezone to "Antarctica/South_Pole", which
329requires a call to C<tzset>, but by using C<on_enter> and C<on_leave>,
330which remember/change the current timezone and restore the previous
331value, respectively, the timezone is only changed for the coro that
332installed those handlers.
333
334 use POSIX qw(tzset);
335
336 async {
337 my $old_tz; # store outside TZ value here
338
339 Coro::on_enter {
340 $old_tz = $ENV{TZ}; # remember the old value
341
342 $ENV{TZ} = "Antarctica/South_Pole";
343 tzset; # enable new value
344 };
345
346 Coro::on_leave {
347 $ENV{TZ} = $old_tz;
348 tzset; # restore old value
349 };
350
351 # at this place, the timezone is Antarctica/South_Pole,
352 # without disturbing the TZ of any other coro.
353 };
354
355This can be used to localise about any resource (locale, uid, current
356working directory etc.) to a block, despite the existance of other
357coros.
358
359Another interesting example implements time-sliced multitasking using
360interval timers (this could obviously be optimised, but does the job):
361
362 # "timeslice" the given block
363 sub timeslice(&) {
364 use Time::HiRes ();
365
366 Coro::on_enter {
367 # on entering the thread, we set an VTALRM handler to cede
368 $SIG{VTALRM} = sub { cede };
369 # and then start the interval timer
370 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0.01, 0.01;
371 };
372 Coro::on_leave {
373 # on leaving the thread, we stop the interval timer again
374 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0, 0;
375 };
376
377 &{+shift};
378 }
379
380 # use like this:
381 timeslice {
382 # The following is an endless loop that would normally
383 # monopolise the process. Since it runs in a timesliced
384 # environment, it will regularly cede to other threads.
385 while () { }
386 };
387
310 388
311=item killall 389=item killall
312 390
313Kills/terminates/cancels all coroutines except the currently running 391Kills/terminates/cancels all coros except the currently running one.
314one. This is useful after a fork, either in the child or the parent, as
315usually only one of them should inherit the running coroutines.
316 392
317Note that while this will try to free some of the main programs resources, 393Note that while this will try to free some of the main interpreter
394resources if the calling coro isn't the main coro, but one
318you cannot free all of them, so if a coroutine that is not the main 395cannot free all of them, so if a coro that is not the main coro
319program calls this function, there will be some one-time resource leak. 396calls this function, there will be some one-time resource leak.
320 397
321=cut 398=cut
322 399
323sub killall { 400sub killall {
324 for (Coro::State::list) { 401 for (Coro::State::list) {
327 } 404 }
328} 405}
329 406
330=back 407=back
331 408
332=head1 COROUTINE OBJECT METHODS 409=head1 CORO OBJECT METHODS
333 410
334These are the methods you can call on coroutine objects (or to create 411These are the methods you can call on coro objects (or to create
335them). 412them).
336 413
337=over 4 414=over 4
338 415
339=item new Coro \&sub [, @args...] 416=item new Coro \&sub [, @args...]
340 417
341Create a new coroutine and return it. When the sub returns, the coroutine 418Create a new coro and return it. When the sub returns, the coro
342automatically terminates as if C<terminate> with the returned values were 419automatically terminates as if C<terminate> with the returned values were
343called. To make the coroutine run you must first put it into the ready 420called. To make the coro run you must first put it into the ready
344queue by calling the ready method. 421queue by calling the ready method.
345 422
346See C<async> and C<Coro::State::new> for additional info about the 423See C<async> and C<Coro::State::new> for additional info about the
347coroutine environment. 424coro environment.
348 425
349=cut 426=cut
350 427
351sub _terminate { 428sub _coro_run {
352 terminate &{+shift}; 429 terminate &{+shift};
353} 430}
354 431
355=item $success = $coroutine->ready 432=item $success = $coro->ready
356 433
357Put the given coroutine into the end of its ready queue (there is one 434Put the given coro into the end of its ready queue (there is one
358queue for each priority) and return true. If the coroutine is already in 435queue for each priority) and return true. If the coro is already in
359the ready queue, do nothing and return false. 436the ready queue, do nothing and return false.
360 437
361This ensures that the scheduler will resume this coroutine automatically 438This ensures that the scheduler will resume this coro automatically
362once all the coroutines of higher priority and all coroutines of the same 439once all the coro of higher priority and all coro of the same
363priority that were put into the ready queue earlier have been resumed. 440priority that were put into the ready queue earlier have been resumed.
364 441
442=item $coro->suspend
443
444Suspends the specified coro. A suspended coro works just like any other
445coro, except that the scheduler will not select a suspended coro for
446execution.
447
448Suspending a coro can be useful when you want to keep the coro from
449running, but you don't want to destroy it, or when you want to temporarily
450freeze a coro (e.g. for debugging) to resume it later.
451
452A scenario for the former would be to suspend all (other) coros after a
453fork and keep them alive, so their destructors aren't called, but new
454coros can be created.
455
456=item $coro->resume
457
458If the specified coro was suspended, it will be resumed. Note that when
459the coro was in the ready queue when it was suspended, it might have been
460unreadied by the scheduler, so an activation might have been lost.
461
462To avoid this, it is best to put a suspended coro into the ready queue
463unconditionally, as every synchronisation mechanism must protect itself
464against spurious wakeups, and the one in the Coro family certainly do
465that.
466
365=item $is_ready = $coroutine->is_ready 467=item $is_ready = $coro->is_ready
366 468
367Return whether the coroutine is currently the ready queue or not, 469Returns true iff the Coro object is in the ready queue. Unless the Coro
470object gets destroyed, it will eventually be scheduled by the scheduler.
368 471
472=item $is_running = $coro->is_running
473
474Returns true iff the Coro object is currently running. Only one Coro object
475can ever be in the running state (but it currently is possible to have
476multiple running Coro::States).
477
478=item $is_suspended = $coro->is_suspended
479
480Returns true iff this Coro object has been suspended. Suspended Coros will
481not ever be scheduled.
482
369=item $coroutine->cancel (arg...) 483=item $coro->cancel (arg...)
370 484
371Terminates the given coroutine and makes it return the given arguments as 485Terminates the given Coro and makes it return the given arguments as
372status (default: the empty list). Never returns if the coroutine is the 486status (default: the empty list). Never returns if the Coro is the
373current coroutine. 487current Coro.
374 488
375=cut 489=cut
376 490
377sub cancel { 491sub cancel {
378 my $self = shift; 492 my $self = shift;
379 493
380 if ($current == $self) { 494 if ($current == $self) {
381 terminate @_; 495 terminate @_;
382 } else { 496 } else {
383 $self->{_status} = [@_]; 497 $self->{_status} = [@_];
384 $self->_cancel; 498 Coro::State::cancel $self;
385 } 499 }
386} 500}
387 501
388=item $coroutine->schedule_to 502=item $coro->schedule_to
389 503
390Puts the current coroutine to sleep (like C<Coro::schedule>), but instead 504Puts the current coro to sleep (like C<Coro::schedule>), but instead
391of continuing with the next coro from the ready queue, always switch to 505of continuing with the next coro from the ready queue, always switch to
392the given coroutine object (regardless of priority etc.). The readyness 506the given coro object (regardless of priority etc.). The readyness
393state of that coroutine isn't changed. 507state of that coro isn't changed.
394 508
395This is an advanced method for special cases - I'd love to hear about any 509This is an advanced method for special cases - I'd love to hear about any
396uses for this one. 510uses for this one.
397 511
398=item $coroutine->cede_to 512=item $coro->cede_to
399 513
400Like C<schedule_to>, but puts the current coroutine into the ready 514Like C<schedule_to>, but puts the current coro into the ready
401queue. This has the effect of temporarily switching to the given 515queue. This has the effect of temporarily switching to the given
402coroutine, and continuing some time later. 516coro, and continuing some time later.
403 517
404This is an advanced method for special cases - I'd love to hear about any 518This is an advanced method for special cases - I'd love to hear about any
405uses for this one. 519uses for this one.
406 520
407=item $coroutine->throw ([$scalar]) 521=item $coro->throw ([$scalar])
408 522
409If C<$throw> is specified and defined, it will be thrown as an exception 523If C<$throw> is specified and defined, it will be thrown as an exception
410inside the coroutine at the next convenient point in time. Otherwise 524inside the coro at the next convenient point in time. Otherwise
411clears the exception object. 525clears the exception object.
412 526
413Coro will check for the exception each time a schedule-like-function 527Coro will check for the exception each time a schedule-like-function
414returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down 528returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
415>>, C<< Coro::Handle->readable >> and so on. Most of these functions 529>>, C<< Coro::Handle->readable >> and so on. Most of these functions
417 531
418The exception object will be thrown "as is" with the specified scalar in 532The exception object will be thrown "as is" with the specified scalar in
419C<$@>, i.e. if it is a string, no line number or newline will be appended 533C<$@>, i.e. if it is a string, no line number or newline will be appended
420(unlike with C<die>). 534(unlike with C<die>).
421 535
422This can be used as a softer means than C<cancel> to ask a coroutine to 536This can be used as a softer means than C<cancel> to ask a coro to
423end itself, although there is no guarantee that the exception will lead to 537end itself, although there is no guarantee that the exception will lead to
424termination, and if the exception isn't caught it might well end the whole 538termination, and if the exception isn't caught it might well end the whole
425program. 539program.
426 540
427You might also think of C<throw> as being the moral equivalent of 541You might also think of C<throw> as being the moral equivalent of
428C<kill>ing a coroutine with a signal (in this case, a scalar). 542C<kill>ing a coro with a signal (in this case, a scalar).
429 543
430=item $coroutine->join 544=item $coro->join
431 545
432Wait until the coroutine terminates and return any values given to the 546Wait until the coro terminates and return any values given to the
433C<terminate> or C<cancel> functions. C<join> can be called concurrently 547C<terminate> or C<cancel> functions. C<join> can be called concurrently
434from multiple coroutines, and all will be resumed and given the status 548from multiple coro, and all will be resumed and given the status
435return once the C<$coroutine> terminates. 549return once the C<$coro> terminates.
436 550
437=cut 551=cut
438 552
439sub join { 553sub join {
440 my $self = shift; 554 my $self = shift;
451 } 565 }
452 566
453 wantarray ? @{$self->{_status}} : $self->{_status}[0]; 567 wantarray ? @{$self->{_status}} : $self->{_status}[0];
454} 568}
455 569
456=item $coroutine->on_destroy (\&cb) 570=item $coro->on_destroy (\&cb)
457 571
458Registers a callback that is called when this coroutine gets destroyed, 572Registers a callback that is called when this coro gets destroyed,
459but before it is joined. The callback gets passed the terminate arguments, 573but before it is joined. The callback gets passed the terminate arguments,
460if any, and I<must not> die, under any circumstances. 574if any, and I<must not> die, under any circumstances.
461 575
462=cut 576=cut
463 577
465 my ($self, $cb) = @_; 579 my ($self, $cb) = @_;
466 580
467 push @{ $self->{_on_destroy} }, $cb; 581 push @{ $self->{_on_destroy} }, $cb;
468} 582}
469 583
470=item $oldprio = $coroutine->prio ($newprio) 584=item $oldprio = $coro->prio ($newprio)
471 585
472Sets (or gets, if the argument is missing) the priority of the 586Sets (or gets, if the argument is missing) the priority of the
473coroutine. Higher priority coroutines get run before lower priority 587coro. Higher priority coro get run before lower priority
474coroutines. Priorities are small signed integers (currently -4 .. +3), 588coro. Priorities are small signed integers (currently -4 .. +3),
475that you can refer to using PRIO_xxx constants (use the import tag :prio 589that you can refer to using PRIO_xxx constants (use the import tag :prio
476to get then): 590to get then):
477 591
478 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 592 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
479 3 > 1 > 0 > -1 > -3 > -4 593 3 > 1 > 0 > -1 > -3 > -4
480 594
481 # set priority to HIGH 595 # set priority to HIGH
482 current->prio(PRIO_HIGH); 596 current->prio (PRIO_HIGH);
483 597
484The idle coroutine ($Coro::idle) always has a lower priority than any 598The idle coro ($Coro::idle) always has a lower priority than any
485existing coroutine. 599existing coro.
486 600
487Changing the priority of the current coroutine will take effect immediately, 601Changing the priority of the current coro will take effect immediately,
488but changing the priority of coroutines in the ready queue (but not 602but changing the priority of coro in the ready queue (but not
489running) will only take effect after the next schedule (of that 603running) will only take effect after the next schedule (of that
490coroutine). This is a bug that will be fixed in some future version. 604coro). This is a bug that will be fixed in some future version.
491 605
492=item $newprio = $coroutine->nice ($change) 606=item $newprio = $coro->nice ($change)
493 607
494Similar to C<prio>, but subtract the given value from the priority (i.e. 608Similar to C<prio>, but subtract the given value from the priority (i.e.
495higher values mean lower priority, just as in unix). 609higher values mean lower priority, just as in unix).
496 610
497=item $olddesc = $coroutine->desc ($newdesc) 611=item $olddesc = $coro->desc ($newdesc)
498 612
499Sets (or gets in case the argument is missing) the description for this 613Sets (or gets in case the argument is missing) the description for this
500coroutine. This is just a free-form string you can associate with a 614coro. This is just a free-form string you can associate with a
501coroutine. 615coro.
502 616
503This method simply sets the C<< $coroutine->{desc} >> member to the given 617This method simply sets the C<< $coro->{desc} >> member to the given
504string. You can modify this member directly if you wish. 618string. You can modify this member directly if you wish, and in fact, this
619is often preferred to indicate major processing states that cna then be
620seen for example in a L<Coro::Debug> session:
621
622 sub my_long_function {
623 local $Coro::current->{desc} = "now in my_long_function";
624 ...
625 $Coro::current->{desc} = "my_long_function: phase 1";
626 ...
627 $Coro::current->{desc} = "my_long_function: phase 2";
628 ...
629 }
505 630
506=cut 631=cut
507 632
508sub desc { 633sub desc {
509 my $old = $_[0]{desc}; 634 my $old = $_[0]{desc};
522 647
523=over 4 648=over 4
524 649
525=item Coro::nready 650=item Coro::nready
526 651
527Returns the number of coroutines that are currently in the ready state, 652Returns the number of coro that are currently in the ready state,
528i.e. that can be switched to by calling C<schedule> directory or 653i.e. that can be switched to by calling C<schedule> directory or
529indirectly. The value C<0> means that the only runnable coroutine is the 654indirectly. The value C<0> means that the only runnable coro is the
530currently running one, so C<cede> would have no effect, and C<schedule> 655currently running one, so C<cede> would have no effect, and C<schedule>
531would cause a deadlock unless there is an idle handler that wakes up some 656would cause a deadlock unless there is an idle handler that wakes up some
532coroutines. 657coro.
533 658
534=item my $guard = Coro::guard { ... } 659=item my $guard = Coro::guard { ... }
535 660
536This creates and returns a guard object. Nothing happens until the object 661This function still exists, but is deprecated. Please use the
537gets destroyed, in which case the codeblock given as argument will be 662C<Guard::guard> function instead.
538executed. This is useful to free locks or other resources in case of a
539runtime error or when the coroutine gets canceled, as in both cases the
540guard block will be executed. The guard object supports only one method,
541C<< ->cancel >>, which will keep the codeblock from being executed.
542 663
543Example: set some flag and clear it again when the coroutine gets canceled
544or the function returns:
545
546 sub do_something {
547 my $guard = Coro::guard { $busy = 0 };
548 $busy = 1;
549
550 # do something that requires $busy to be true
551 }
552
553=cut 664=cut
554 665
555sub guard(&) { 666BEGIN { *guard = \&Guard::guard }
556 bless \(my $cb = $_[0]), "Coro::guard"
557}
558
559sub Coro::guard::cancel {
560 ${$_[0]} = sub { };
561}
562
563sub Coro::guard::DESTROY {
564 ${$_[0]}->();
565}
566
567 667
568=item unblock_sub { ... } 668=item unblock_sub { ... }
569 669
570This utility function takes a BLOCK or code reference and "unblocks" it, 670This utility function takes a BLOCK or code reference and "unblocks" it,
571returning a new coderef. Unblocking means that calling the new coderef 671returning a new coderef. Unblocking means that calling the new coderef
572will return immediately without blocking, returning nothing, while the 672will return immediately without blocking, returning nothing, while the
573original code ref will be called (with parameters) from within another 673original code ref will be called (with parameters) from within another
574coroutine. 674coro.
575 675
576The reason this function exists is that many event libraries (such as the 676The reason this function exists is that many event libraries (such as
577venerable L<Event|Event> module) are not coroutine-safe (a weaker form 677the venerable L<Event|Event> module) are not thread-safe (a weaker form
578of thread-safety). This means you must not block within event callbacks, 678of reentrancy). This means you must not block within event callbacks,
579otherwise you might suffer from crashes or worse. The only event library 679otherwise you might suffer from crashes or worse. The only event library
580currently known that is safe to use without C<unblock_sub> is L<EV>. 680currently known that is safe to use without C<unblock_sub> is L<EV> (but
681you might still run into deadlocks if all event loops are blocked).
682
683Coro will try to catch you when you block in the event loop
684("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
685only works when you do not run your own event loop.
581 686
582This function allows your callbacks to block by executing them in another 687This function allows your callbacks to block by executing them in another
583coroutine where it is safe to block. One example where blocking is handy 688coro where it is safe to block. One example where blocking is handy
584is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 689is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
585disk, for example. 690disk, for example.
586 691
587In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 692In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
588creating event callbacks that want to block. 693creating event callbacks that want to block.
589 694
590If your handler does not plan to block (e.g. simply sends a message to 695If your handler does not plan to block (e.g. simply sends a message to
591another coroutine, or puts some other coroutine into the ready queue), 696another coro, or puts some other coro into the ready queue), there is
592there is no reason to use C<unblock_sub>. 697no reason to use C<unblock_sub>.
593 698
594Note that you also need to use C<unblock_sub> for any other callbacks that 699Note that you also need to use C<unblock_sub> for any other callbacks that
595are indirectly executed by any C-based event loop. For example, when you 700are indirectly executed by any C-based event loop. For example, when you
596use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it 701use a module that uses L<AnyEvent> (and you use L<Coro::AnyEvent>) and it
597provides callbacks that are the result of some event callback, then you 702provides callbacks that are the result of some event callback, then you
627 unshift @unblock_queue, [$cb, @_]; 732 unshift @unblock_queue, [$cb, @_];
628 $unblock_scheduler->ready; 733 $unblock_scheduler->ready;
629 } 734 }
630} 735}
631 736
632=item $cb = Coro::rouse_cb 737=item $cb = rouse_cb
633 738
634Create and return a "rouse callback". That's a code reference that, when 739Create and return a "rouse callback". That's a code reference that,
635called, will save its arguments and notify the owner coroutine of the 740when called, will remember a copy of its arguments and notify the owner
636callback. 741coro of the callback.
637 742
638See the next function. 743See the next function.
639 744
640=item @args = Coro::rouse_wait [$cb] 745=item @args = rouse_wait [$cb]
641 746
642Wait for the specified rouse callback (or the last one tht was created in 747Wait for the specified rouse callback (or the last one that was created in
643this coroutine). 748this coro).
644 749
645As soon as the callback is invoked (or when the calback was invoked before 750As soon as the callback is invoked (or when the callback was invoked
646C<rouse_wait>), it will return a copy of the arguments originally passed 751before C<rouse_wait>), it will return the arguments originally passed to
647to the rouse callback. 752the rouse callback. In scalar context, that means you get the I<last>
753argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
754statement at the end.
648 755
649See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. 756See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
650 757
651=back 758=back
652 759
653=cut 760=cut
654 761
762for my $module (qw(Channel RWLock Semaphore SemaphoreSet Signal Specific)) {
763 my $old = defined &{"Coro::$module\::new"} && \&{"Coro::$module\::new"};
764
765 *{"Coro::$module\::new"} = sub {
766 require "Coro/$module.pm";
767
768 # some modules have their new predefined in State.xs, some don't
769 *{"Coro::$module\::new"} = $old
770 if $old;
771
772 goto &{"Coro::$module\::new"};
773 };
774}
775
6551; 7761;
656 777
657=head1 HOW TO WAIT FOR A CALLBACK 778=head1 HOW TO WAIT FOR A CALLBACK
658 779
659It is very common for a coroutine to wait for some callback to be 780It is very common for a coro to wait for some callback to be
660called. This occurs naturally when you use coroutines in an otherwise 781called. This occurs naturally when you use coro in an otherwise
661event-based program, or when you use event-based libraries. 782event-based program, or when you use event-based libraries.
662 783
663These typically register a callback for some event, and call that callback 784These typically register a callback for some event, and call that callback
664when the event occured. In a coroutine, however, you typically want to 785when the event occured. In a coro, however, you typically want to
665just wait for the event, simplyifying things. 786just wait for the event, simplyifying things.
666 787
667For example C<< AnyEvent->child >> registers a callback to be called when 788For example C<< AnyEvent->child >> registers a callback to be called when
668a specific child has exited: 789a specific child has exited:
669 790
670 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... }); 791 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
671 792
672But from withina coroutine, you often just want to write this: 793But from within a coro, you often just want to write this:
673 794
674 my $status = wait_for_child $pid; 795 my $status = wait_for_child $pid;
675 796
676Coro offers two functions specifically designed to make this easy, 797Coro offers two functions specifically designed to make this easy,
677C<Coro::rouse_cb> and C<Coro::rouse_wait>. 798C<Coro::rouse_cb> and C<Coro::rouse_wait>.
678 799
679The first function, C<rouse_cb>, generates and returns a callback that, 800The first function, C<rouse_cb>, generates and returns a callback that,
680when invoked, will save it's arguments and notify the coroutine that 801when invoked, will save its arguments and notify the coro that
681created the callback. 802created the callback.
682 803
683The second function, C<rouse_wait>, waits for the callback to be called 804The second function, C<rouse_wait>, waits for the callback to be called
684(by calling C<schedule> to go to sleep) and returns the arguments 805(by calling C<schedule> to go to sleep) and returns the arguments
685originally passed to the callback. 806originally passed to the callback.
700you can roll your own, using C<schedule>: 821you can roll your own, using C<schedule>:
701 822
702 sub wait_for_child($) { 823 sub wait_for_child($) {
703 my ($pid) = @_; 824 my ($pid) = @_;
704 825
705 # store the current coroutine in $current, 826 # store the current coro in $current,
706 # and provide result variables for the closure passed to ->child 827 # and provide result variables for the closure passed to ->child
707 my $current = $Coro::current; 828 my $current = $Coro::current;
708 my ($done, $rstatus); 829 my ($done, $rstatus);
709 830
710 # pass a closure to ->child 831 # pass a closure to ->child
726 847
727=item fork with pthread backend 848=item fork with pthread backend
728 849
729When Coro is compiled using the pthread backend (which isn't recommended 850When Coro is compiled using the pthread backend (which isn't recommended
730but required on many BSDs as their libcs are completely broken), then 851but required on many BSDs as their libcs are completely broken), then
731coroutines will not survive a fork. There is no known workaround except to 852coro will not survive a fork. There is no known workaround except to
732fix your libc and use a saner backend. 853fix your libc and use a saner backend.
733 854
734=item perl process emulation ("threads") 855=item perl process emulation ("threads")
735 856
736This module is not perl-pseudo-thread-safe. You should only ever use this 857This module is not perl-pseudo-thread-safe. You should only ever use this
737module from the same thread (this requirement might be removed in the 858module from the first thread (this requirement might be removed in the
738future to allow per-thread schedulers, but Coro::State does not yet allow 859future to allow per-thread schedulers, but Coro::State does not yet allow
739this). I recommend disabling thread support and using processes, as having 860this). I recommend disabling thread support and using processes, as having
740the windows process emulation enabled under unix roughly halves perl 861the windows process emulation enabled under unix roughly halves perl
741performance, even when not used. 862performance, even when not used.
742 863
743=item coroutine switching not signal safe 864=item coro switching is not signal safe
744 865
745You must not switch to another coroutine from within a signal handler 866You must not switch to another coro from within a signal handler (only
746(only relevant with %SIG - most event libraries provide safe signals). 867relevant with %SIG - most event libraries provide safe signals), I<unless>
868you are sure you are not interrupting a Coro function.
747 869
748That means you I<MUST NOT> call any function that might "block" the 870That means you I<MUST NOT> call any function that might "block" the
749current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 871current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
750anything that calls those. Everything else, including calling C<ready>, 872anything that calls those. Everything else, including calling C<ready>,
751works. 873works.
752 874
753=back 875=back
754 876
755 877
878=head1 WINDOWS PROCESS EMULATION
879
880A great many people seem to be confused about ithreads (for example, Chip
881Salzenberg called me unintelligent, incapable, stupid and gullible,
882while in the same mail making rather confused statements about perl
883ithreads (for example, that memory or files would be shared), showing his
884lack of understanding of this area - if it is hard to understand for Chip,
885it is probably not obvious to everybody).
886
887What follows is an ultra-condensed version of my talk about threads in
888scripting languages given on the perl workshop 2009:
889
890The so-called "ithreads" were originally implemented for two reasons:
891first, to (badly) emulate unix processes on native win32 perls, and
892secondly, to replace the older, real thread model ("5.005-threads").
893
894It does that by using threads instead of OS processes. The difference
895between processes and threads is that threads share memory (and other
896state, such as files) between threads within a single process, while
897processes do not share anything (at least not semantically). That
898means that modifications done by one thread are seen by others, while
899modifications by one process are not seen by other processes.
900
901The "ithreads" work exactly like that: when creating a new ithreads
902process, all state is copied (memory is copied physically, files and code
903is copied logically). Afterwards, it isolates all modifications. On UNIX,
904the same behaviour can be achieved by using operating system processes,
905except that UNIX typically uses hardware built into the system to do this
906efficiently, while the windows process emulation emulates this hardware in
907software (rather efficiently, but of course it is still much slower than
908dedicated hardware).
909
910As mentioned before, loading code, modifying code, modifying data
911structures and so on is only visible in the ithreads process doing the
912modification, not in other ithread processes within the same OS process.
913
914This is why "ithreads" do not implement threads for perl at all, only
915processes. What makes it so bad is that on non-windows platforms, you can
916actually take advantage of custom hardware for this purpose (as evidenced
917by the forks module, which gives you the (i-) threads API, just much
918faster).
919
920Sharing data is in the i-threads model is done by transfering data
921structures between threads using copying semantics, which is very slow -
922shared data simply does not exist. Benchmarks using i-threads which are
923communication-intensive show extremely bad behaviour with i-threads (in
924fact, so bad that Coro, which cannot take direct advantage of multiple
925CPUs, is often orders of magnitude faster because it shares data using
926real threads, refer to my talk for details).
927
928As summary, i-threads *use* threads to implement processes, while
929the compatible forks module *uses* processes to emulate, uhm,
930processes. I-threads slow down every perl program when enabled, and
931outside of windows, serve no (or little) practical purpose, but
932disadvantages every single-threaded Perl program.
933
934This is the reason that I try to avoid the name "ithreads", as it is
935misleading as it implies that it implements some kind of thread model for
936perl, and prefer the name "windows process emulation", which describes the
937actual use and behaviour of it much better.
938
756=head1 SEE ALSO 939=head1 SEE ALSO
757 940
758Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 941Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
759 942
760Debugging: L<Coro::Debug>. 943Debugging: L<Coro::Debug>.
761 944
762Support/Utility: L<Coro::Specific>, L<Coro::Util>. 945Support/Utility: L<Coro::Specific>, L<Coro::Util>.
763 946
764Locking/IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>, 947Locking and IPC: L<Coro::Signal>, L<Coro::Channel>, L<Coro::Semaphore>,
765L<Coro::SemaphoreSet>, L<Coro::RWLock>. 948L<Coro::SemaphoreSet>, L<Coro::RWLock>.
766 949
767IO/Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>. 950I/O and Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
768 951
769Compatibility: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for 952Compatibility with other modules: L<Coro::LWP> (but see also L<AnyEvent::HTTP> for
770a better-working alternative), L<Coro::BDB>, L<Coro::Storable>, 953a better-working alternative), L<Coro::BDB>, L<Coro::Storable>,
771L<Coro::Select>. 954L<Coro::Select>.
772 955
773XS API: L<Coro::MakeMaker>. 956XS API: L<Coro::MakeMaker>.
774 957
775Low level Configuration, Coroutine Environment: L<Coro::State>. 958Low level Configuration, Thread Environment, Continuations: L<Coro::State>.
776 959
777=head1 AUTHOR 960=head1 AUTHOR
778 961
779 Marc Lehmann <schmorp@schmorp.de> 962 Marc Lehmann <schmorp@schmorp.de>
780 http://home.schmorp.de/ 963 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines