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

Comparing Coro/Coro.pm (file contents):
Revision 1.244 by root, Sat Dec 13 22:08:13 2008 UTC vs.
Revision 1.266 by root, Wed Aug 26 07:41:07 2009 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines