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

Comparing Coro/Coro.pm (file contents):
Revision 1.246 by root, Mon Dec 15 00:30:40 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.
73use Coro::State; 77use Coro::State;
74 78
75use base qw(Coro::State Exporter); 79use base qw(Coro::State Exporter);
76 80
77our $idle; # idle handler 81our $idle; # idle handler
78our $main; # main coroutine 82our $main; # main coro
79our $current; # current coroutine 83our $current; # current coro
80 84
81our $VERSION = 5.13; 85our $VERSION = 5.17;
82 86
83our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 87our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
84our %EXPORT_TAGS = ( 88our %EXPORT_TAGS = (
85 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)],
86); 90);
90 94
91=over 4 95=over 4
92 96
93=item $Coro::main 97=item $Coro::main
94 98
95This variable stores the coroutine object that represents the main 99This variable stores the Coro object that represents the main
96program. 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
97coroutines, 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
98whether you are running in the main program or not. 102whether you are running in the main program or not.
99 103
100=cut 104=cut
101 105
102# $main is now being initialised by Coro::State 106# $main is now being initialised by Coro::State
103 107
104=item $Coro::current 108=item $Coro::current
105 109
106The coroutine object representing the current coroutine (the last 110The Coro object representing the current coro (the last
107coroutine that the Coro scheduler switched to). The initial value is 111coro that the Coro scheduler switched to). The initial value is
108C<$Coro::main> (of course). 112C<$Coro::main> (of course).
109 113
110This 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
111value 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
112not otherwise modify the variable itself. 116not otherwise modify the variable itself.
113 117
114=cut 118=cut
115 119
116sub current() { $current } # [DEPRECATED] 120sub current() { $current } # [DEPRECATED]
119 123
120This 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
121usually 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
122pretty low-level functionality. 126pretty low-level functionality.
123 127
124This variable stores either a coroutine or a callback. 128This variable stores either a Coro object or a callback.
125 129
126If 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
127ready coroutines to run. The default implementation prints "FATAL: 131ready coros to run. The default implementation prints "FATAL:
128deadlock detected" and exits, because the program has no other way to 132deadlock detected" and exits, because the program has no other way to
129continue. 133continue.
130 134
131If 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
132invoking any ready hooks, however) when the scheduler finds no other ready 136invoking any ready hooks, however) when the scheduler finds no other ready
133coroutines to run. 137coros to run.
134 138
135This hook is overwritten by modules such as C<Coro::EV> and 139This hook is overwritten by modules such as C<Coro::EV> and
136C<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
137coroutine so the scheduler can run it. 141coro so the scheduler can run it.
138 142
139Note that the callback I<must not>, under any circumstances, block 143Note that the callback I<must not>, under any circumstances, block
140the current coroutine. Normally, this is achieved by having an "idle 144the current coro. Normally, this is achieved by having an "idle
141coroutine" that calls the event loop and then blocks again, and then 145coro" that calls the event loop and then blocks again, and then
142readying 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
143coroutine in this variable. 147coro in this variable.
144 148
145See 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
146technique. 150technique.
147 151
148Please 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
153$idle = sub { 157$idle = sub {
154 require Carp; 158 require Carp;
155 Carp::croak ("FATAL: deadlock detected"); 159 Carp::croak ("FATAL: deadlock detected");
156}; 160};
157 161
158# this coroutine is necessary because a coroutine 162# this coro is necessary because a coro
159# cannot destroy itself. 163# cannot destroy itself.
160our @destroy; 164our @destroy;
161our $manager; 165our $manager;
162 166
163$manager = new Coro sub { 167$manager = new Coro sub {
164 while () { 168 while () {
165 Coro::_cancel shift @destroy 169 Coro::State::cancel shift @destroy
166 while @destroy; 170 while @destroy;
167 171
168 &schedule; 172 &schedule;
169 } 173 }
170}; 174};
171$manager->{desc} = "[coro manager]"; 175$manager->{desc} = "[coro manager]";
172$manager->prio (PRIO_MAX); 176$manager->prio (PRIO_MAX);
173 177
174=back 178=back
175 179
176=head1 SIMPLE COROUTINE CREATION 180=head1 SIMPLE CORO CREATION
177 181
178=over 4 182=over 4
179 183
180=item async { ... } [@args...] 184=item async { ... } [@args...]
181 185
182Create a new coroutine and return its coroutine object (usually 186Create a new coro and return its Coro object (usually
183unused). The coroutine will be put into the ready queue, so 187unused). The coro will be put into the ready queue, so
184it will start running automatically on the next scheduler run. 188it will start running automatically on the next scheduler run.
185 189
186The 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
187coroutine. When it returns argument returns the coroutine is automatically 191coro. When it returns argument returns the coro is automatically
188terminated. 192terminated.
189 193
190The remaining arguments are passed as arguments to the closure. 194The remaining arguments are passed as arguments to the closure.
191 195
192See the C<Coro::State::new> constructor for info about the coroutine 196See the C<Coro::State::new> constructor for info about the coro
193environment in which coroutines are executed. 197environment in which coro are executed.
194 198
195Calling 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
196the coroutine. Likewise, when the coroutine dies, the program will exit, 200the coro. Likewise, when the coro dies, the program will exit,
197just as it would in the main program. 201just as it would in the main program.
198 202
199If 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
200simply avoid dieing (by use of C<eval>). 204simply avoid dieing (by use of C<eval>).
201 205
202Example: Create a new coroutine that just prints its arguments. 206Example: Create a new coro that just prints its arguments.
203 207
204 async { 208 async {
205 print "@_\n"; 209 print "@_\n";
206 } 1,2,3,4; 210 } 1,2,3,4;
207 211
208=cut
209
210sub async(&@) {
211 my $coro = new Coro @_;
212 $coro->ready;
213 $coro
214}
215
216=item async_pool { ... } [@args...] 212=item async_pool { ... } [@args...]
217 213
218Similar 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
219terminate 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
220coroutine that might have executed other code already (which can be good 216coro that might have executed other code already (which can be good
221or bad :). 217or bad :).
222 218
223On 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
224destroying) 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
225coroutines in quick successsion, use C<async_pool>, not C<async>. 221coros in quick successsion, use C<async_pool>, not C<async>.
226 222
227The 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
228issued in case of an exception instead of terminating the program, as 224issued in case of an exception instead of terminating the program, as
229C<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>
230will 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,
231which somehow defeats the purpose of pooling (but is fine in the 227which somehow defeats the purpose of pooling (but is fine in the
232exceptional case). 228exceptional case).
233 229
234The 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
235disabled, the description will be reset and the default output filehandle 231disabled, the description will be reset and the default output filehandle
236gets restored, so you can change all these. Otherwise the coroutine will 232gets restored, so you can change all these. Otherwise the coro will
237be 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
238stuff 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
239simply done by using local as in: C<< local $/ >>. 235simply done by using local as in: C<< local $/ >>.
240 236
241The 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
242adjusted 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
243coros as required. 239coros as required.
244 240
245If you are concerned about pooled coroutines growing a lot because a 241If you are concerned about pooled coros growing a lot because a
246single 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
247{ 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
248addition 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
249(adjustable via $Coro::POOL_RSS) it will also be destroyed. 245(adjustable via $Coro::POOL_RSS) it will also be destroyed.
250 246
267=back 263=back
268 264
269=head1 STATIC METHODS 265=head1 STATIC METHODS
270 266
271Static methods are actually functions that implicitly operate on the 267Static methods are actually functions that implicitly operate on the
272current coroutine. 268current coro.
273 269
274=over 4 270=over 4
275 271
276=item schedule 272=item schedule
277 273
278Calls the scheduler. The scheduler will find the next coroutine that is 274Calls the scheduler. The scheduler will find the next coro that is
279to 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
280to 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
281in 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
282C<$Coro::idle> hook. 278C<$Coro::idle> hook.
283 279
284Please 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
285queue, so calling this function usually means you will never be called 281queue, so calling this function usually means you will never be called
286again unless something else (e.g. an event handler) calls C<< ->ready >>, 282again unless something else (e.g. an event handler) calls C<< ->ready >>,
287thus waking you up. 283thus waking you up.
288 284
289This 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
290coroutine and wait for events: first you remember the current coroutine in 286coro and wait for events: first you remember the current coro in
291a 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
292>> 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
293yourself 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,
294so 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
295status in a variable. 291status in a variable.
296 292
297See 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.
298 294
299=item cede 295=item cede
300 296
301"Cede" to other coroutines. This function puts the current coroutine into 297"Cede" to other coros. This function puts the current coro into
302the 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
303up the current "timeslice" to other coroutines of the same or higher 299up the current "timeslice" to other coros of the same or higher
304priority. Once your coroutine gets its turn again it will automatically be 300priority. Once your coro gets its turn again it will automatically be
305resumed. 301resumed.
306 302
307This function is often called C<yield> in other languages. 303This function is often called C<yield> in other languages.
308 304
309=item Coro::cede_notself 305=item Coro::cede_notself
310 306
311Works 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>
312coroutine, regardless of priority. This is useful sometimes to ensure 308coro, regardless of priority. This is useful sometimes to ensure
313progress is made. 309progress is made.
314 310
315=item terminate [arg...] 311=item terminate [arg...]
316 312
317Terminates 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
318 400
319=item killall 401=item killall
320 402
321Kills/terminates/cancels all coroutines except the currently running 403Kills/terminates/cancels all coros except the currently running one.
322one. This can be useful after a fork, either in the child or the parent,
323as usually only one of them should inherit the running coroutines.
324 404
325Note that in the implementation, destructors run as normal, making this
326function not so useful after a fork. Future versions of this function
327might try to free resources without running any code.
328
329Note 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
330you 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
331program calls this function, there will be some one-time resource leak. 408calls this function, there will be some one-time resource leak.
332 409
333=cut 410=cut
334 411
335sub killall { 412sub killall {
336 for (Coro::State::list) { 413 for (Coro::State::list) {
339 } 416 }
340} 417}
341 418
342=back 419=back
343 420
344=head1 COROUTINE OBJECT METHODS 421=head1 CORO OBJECT METHODS
345 422
346These 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
347them). 424them).
348 425
349=over 4 426=over 4
350 427
351=item new Coro \&sub [, @args...] 428=item new Coro \&sub [, @args...]
352 429
353Create 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
354automatically terminates as if C<terminate> with the returned values were 431automatically terminates as if C<terminate> with the returned values were
355called. 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
356queue by calling the ready method. 433queue by calling the ready method.
357 434
358See 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
359coroutine environment. 436coro environment.
360 437
361=cut 438=cut
362 439
363sub _coro_run { 440sub _coro_run {
364 terminate &{+shift}; 441 terminate &{+shift};
365} 442}
366 443
367=item $success = $coroutine->ready 444=item $success = $coro->ready
368 445
369Put 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
370queue 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
371the ready queue, do nothing and return false. 448the ready queue, do nothing and return false.
372 449
373This ensures that the scheduler will resume this coroutine automatically 450This ensures that the scheduler will resume this coro automatically
374once 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
375priority that were put into the ready queue earlier have been resumed. 452priority that were put into the ready queue earlier have been resumed.
376 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
377=item $is_ready = $coroutine->is_ready 479=item $is_ready = $coro->is_ready
378 480
379Return 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.
380 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
381=item $coroutine->cancel (arg...) 495=item $coro->cancel (arg...)
382 496
383Terminates the given coroutine and makes it return the given arguments as 497Terminates the given Coro and makes it return the given arguments as
384status (default: the empty list). Never returns if the coroutine is the 498status (default: the empty list). Never returns if the Coro is the
385current coroutine. 499current Coro.
386 500
387=cut 501=cut
388 502
389sub cancel { 503sub cancel {
390 my $self = shift; 504 my $self = shift;
391 505
392 if ($current == $self) { 506 if ($current == $self) {
393 terminate @_; 507 terminate @_;
394 } else { 508 } else {
395 $self->{_status} = [@_]; 509 $self->{_status} = [@_];
396 $self->_cancel; 510 Coro::State::cancel $self;
397 } 511 }
398} 512}
399 513
400=item $coroutine->schedule_to 514=item $coro->schedule_to
401 515
402Puts the current coroutine to sleep (like C<Coro::schedule>), but instead 516Puts the current coro to sleep (like C<Coro::schedule>), but instead
403of 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
404the given coroutine object (regardless of priority etc.). The readyness 518the given coro object (regardless of priority etc.). The readyness
405state of that coroutine isn't changed. 519state of that coro isn't changed.
406 520
407This 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
408uses for this one. 522uses for this one.
409 523
410=item $coroutine->cede_to 524=item $coro->cede_to
411 525
412Like C<schedule_to>, but puts the current coroutine into the ready 526Like C<schedule_to>, but puts the current coro into the ready
413queue. This has the effect of temporarily switching to the given 527queue. This has the effect of temporarily switching to the given
414coroutine, and continuing some time later. 528coro, and continuing some time later.
415 529
416This 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
417uses for this one. 531uses for this one.
418 532
419=item $coroutine->throw ([$scalar]) 533=item $coro->throw ([$scalar])
420 534
421If 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
422inside the coroutine at the next convenient point in time. Otherwise 536inside the coro at the next convenient point in time. Otherwise
423clears the exception object. 537clears the exception object.
424 538
425Coro will check for the exception each time a schedule-like-function 539Coro will check for the exception each time a schedule-like-function
426returns, 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
427>>, C<< Coro::Handle->readable >> and so on. Most of these functions 541>>, C<< Coro::Handle->readable >> and so on. Most of these functions
429 543
430The 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
431C<$@>, 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
432(unlike with C<die>). 546(unlike with C<die>).
433 547
434This 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
435end 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
436termination, 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
437program. 551program.
438 552
439You 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
440C<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).
441 555
442=item $coroutine->join 556=item $coro->join
443 557
444Wait until the coroutine terminates and return any values given to the 558Wait until the coro terminates and return any values given to the
445C<terminate> or C<cancel> functions. C<join> can be called concurrently 559C<terminate> or C<cancel> functions. C<join> can be called concurrently
446from multiple coroutines, and all will be resumed and given the status 560from multiple coro, and all will be resumed and given the status
447return once the C<$coroutine> terminates. 561return once the C<$coro> terminates.
448 562
449=cut 563=cut
450 564
451sub join { 565sub join {
452 my $self = shift; 566 my $self = shift;
463 } 577 }
464 578
465 wantarray ? @{$self->{_status}} : $self->{_status}[0]; 579 wantarray ? @{$self->{_status}} : $self->{_status}[0];
466} 580}
467 581
468=item $coroutine->on_destroy (\&cb) 582=item $coro->on_destroy (\&cb)
469 583
470Registers a callback that is called when this coroutine gets destroyed, 584Registers a callback that is called when this coro gets destroyed,
471but before it is joined. The callback gets passed the terminate arguments, 585but before it is joined. The callback gets passed the terminate arguments,
472if any, and I<must not> die, under any circumstances. 586if any, and I<must not> die, under any circumstances.
473 587
474=cut 588=cut
475 589
477 my ($self, $cb) = @_; 591 my ($self, $cb) = @_;
478 592
479 push @{ $self->{_on_destroy} }, $cb; 593 push @{ $self->{_on_destroy} }, $cb;
480} 594}
481 595
482=item $oldprio = $coroutine->prio ($newprio) 596=item $oldprio = $coro->prio ($newprio)
483 597
484Sets (or gets, if the argument is missing) the priority of the 598Sets (or gets, if the argument is missing) the priority of the
485coroutine. Higher priority coroutines get run before lower priority 599coro. Higher priority coro get run before lower priority
486coroutines. Priorities are small signed integers (currently -4 .. +3), 600coro. Priorities are small signed integers (currently -4 .. +3),
487that 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
488to get then): 602to get then):
489 603
490 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
491 3 > 1 > 0 > -1 > -3 > -4 605 3 > 1 > 0 > -1 > -3 > -4
492 606
493 # set priority to HIGH 607 # set priority to HIGH
494 current->prio(PRIO_HIGH); 608 current->prio (PRIO_HIGH);
495 609
496The idle coroutine ($Coro::idle) always has a lower priority than any 610The idle coro ($Coro::idle) always has a lower priority than any
497existing coroutine. 611existing coro.
498 612
499Changing the priority of the current coroutine will take effect immediately, 613Changing the priority of the current coro will take effect immediately,
500but changing the priority of coroutines in the ready queue (but not 614but changing the priority of coro in the ready queue (but not
501running) will only take effect after the next schedule (of that 615running) will only take effect after the next schedule (of that
502coroutine). 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.
503 617
504=item $newprio = $coroutine->nice ($change) 618=item $newprio = $coro->nice ($change)
505 619
506Similar 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.
507higher values mean lower priority, just as in unix). 621higher values mean lower priority, just as in unix).
508 622
509=item $olddesc = $coroutine->desc ($newdesc) 623=item $olddesc = $coro->desc ($newdesc)
510 624
511Sets (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
512coroutine. 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
513coroutine. 627coro.
514 628
515This method simply sets the C<< $coroutine->{desc} >> member to the given 629This method simply sets the C<< $coro->{desc} >> member to the given
516string. You can modify this member directly if you wish. 630string. You can modify this member directly if you wish.
517 631
518=cut 632=cut
519 633
520sub desc { 634sub desc {
534 648
535=over 4 649=over 4
536 650
537=item Coro::nready 651=item Coro::nready
538 652
539Returns the number of coroutines that are currently in the ready state, 653Returns the number of coro that are currently in the ready state,
540i.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
541indirectly. 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
542currently 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>
543would 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
544coroutines. 658coro.
545 659
546=item my $guard = Coro::guard { ... } 660=item my $guard = Coro::guard { ... }
547 661
548This function still exists, but is deprecated. Please use the 662This function still exists, but is deprecated. Please use the
549C<Guard::guard> function instead. 663C<Guard::guard> function instead.
556 670
557This utility function takes a BLOCK or code reference and "unblocks" it, 671This utility function takes a BLOCK or code reference and "unblocks" it,
558returning a new coderef. Unblocking means that calling the new coderef 672returning a new coderef. Unblocking means that calling the new coderef
559will return immediately without blocking, returning nothing, while the 673will return immediately without blocking, returning nothing, while the
560original code ref will be called (with parameters) from within another 674original code ref will be called (with parameters) from within another
561coroutine. 675coro.
562 676
563The 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
564venerable L<Event|Event> module) are not coroutine-safe (a weaker form 678venerable L<Event|Event> module) are not thread-safe (a weaker form
565of reentrancy). This means you must not block within event callbacks, 679of reentrancy). This means you must not block within event callbacks,
566otherwise you might suffer from crashes or worse. The only event library 680otherwise you might suffer from crashes or worse. The only event library
567currently 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>.
568 682
569This function allows your callbacks to block by executing them in another 683This function allows your callbacks to block by executing them in another
570coroutine 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
571is 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
572disk, for example. 686disk, for example.
573 687
574In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 688In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
575creating event callbacks that want to block. 689creating event callbacks that want to block.
576 690
577If 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
578another coroutine, or puts some other coroutine into the ready queue), 692another coro, or puts some other coro into the ready queue), there is
579there is no reason to use C<unblock_sub>. 693no reason to use C<unblock_sub>.
580 694
581Note 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
582are 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
583use 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
584provides callbacks that are the result of some event callback, then you 698provides callbacks that are the result of some event callback, then you
618 732
619=item $cb = Coro::rouse_cb 733=item $cb = Coro::rouse_cb
620 734
621Create and return a "rouse callback". That's a code reference that, 735Create and return a "rouse callback". That's a code reference that,
622when 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
623coroutine of the callback. 737coro of the callback.
624 738
625See the next function. 739See the next function.
626 740
627=item @args = Coro::rouse_wait [$cb] 741=item @args = Coro::rouse_wait [$cb]
628 742
629Wait 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
630this coroutine). 744this coro).
631 745
632As 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
633before C<rouse_wait>), it will return the arguments originally passed to 747before C<rouse_wait>), it will return the arguments originally passed to
634the 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.
635 751
636See 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.
637 753
638=back 754=back
639 755
641 757
6421; 7581;
643 759
644=head1 HOW TO WAIT FOR A CALLBACK 760=head1 HOW TO WAIT FOR A CALLBACK
645 761
646It 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
647called. This occurs naturally when you use coroutines in an otherwise 763called. This occurs naturally when you use coro in an otherwise
648event-based program, or when you use event-based libraries. 764event-based program, or when you use event-based libraries.
649 765
650These typically register a callback for some event, and call that callback 766These typically register a callback for some event, and call that callback
651when the event occured. In a coroutine, however, you typically want to 767when the event occured. In a coro, however, you typically want to
652just wait for the event, simplyifying things. 768just wait for the event, simplyifying things.
653 769
654For example C<< AnyEvent->child >> registers a callback to be called when 770For example C<< AnyEvent->child >> registers a callback to be called when
655a specific child has exited: 771a specific child has exited:
656 772
657 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... }); 773 my $child_watcher = AnyEvent->child (pid => $pid, cb => sub { ... });
658 774
659But from withina coroutine, you often just want to write this: 775But from within a coro, you often just want to write this:
660 776
661 my $status = wait_for_child $pid; 777 my $status = wait_for_child $pid;
662 778
663Coro offers two functions specifically designed to make this easy, 779Coro offers two functions specifically designed to make this easy,
664C<Coro::rouse_cb> and C<Coro::rouse_wait>. 780C<Coro::rouse_cb> and C<Coro::rouse_wait>.
665 781
666The first function, C<rouse_cb>, generates and returns a callback that, 782The first function, C<rouse_cb>, generates and returns a callback that,
667when invoked, will save its arguments and notify the coroutine that 783when invoked, will save its arguments and notify the coro that
668created the callback. 784created the callback.
669 785
670The 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
671(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
672originally passed to the callback. 788originally passed to the callback.
687you can roll your own, using C<schedule>: 803you can roll your own, using C<schedule>:
688 804
689 sub wait_for_child($) { 805 sub wait_for_child($) {
690 my ($pid) = @_; 806 my ($pid) = @_;
691 807
692 # store the current coroutine in $current, 808 # store the current coro in $current,
693 # and provide result variables for the closure passed to ->child 809 # and provide result variables for the closure passed to ->child
694 my $current = $Coro::current; 810 my $current = $Coro::current;
695 my ($done, $rstatus); 811 my ($done, $rstatus);
696 812
697 # pass a closure to ->child 813 # pass a closure to ->child
713 829
714=item fork with pthread backend 830=item fork with pthread backend
715 831
716When Coro is compiled using the pthread backend (which isn't recommended 832When Coro is compiled using the pthread backend (which isn't recommended
717but required on many BSDs as their libcs are completely broken), then 833but required on many BSDs as their libcs are completely broken), then
718coroutines 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
719fix your libc and use a saner backend. 835fix your libc and use a saner backend.
720 836
721=item perl process emulation ("threads") 837=item perl process emulation ("threads")
722 838
723This 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
725future 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
726this). I recommend disabling thread support and using processes, as having 842this). I recommend disabling thread support and using processes, as having
727the windows process emulation enabled under unix roughly halves perl 843the windows process emulation enabled under unix roughly halves perl
728performance, even when not used. 844performance, even when not used.
729 845
730=item coroutine switching not signal safe 846=item coro switching is not signal safe
731 847
732You must not switch to another coroutine from within a signal handler 848You must not switch to another coro from within a signal handler
733(only relevant with %SIG - most event libraries provide safe signals). 849(only relevant with %SIG - most event libraries provide safe signals).
734 850
735That 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
736current coroutine - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 852current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
737anything that calls those. Everything else, including calling C<ready>, 853anything that calls those. Everything else, including calling C<ready>,
738works. 854works.
739 855
740=back 856=back
741 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.
742 919
743=head1 SEE ALSO 920=head1 SEE ALSO
744 921
745Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 922Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
746 923

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines