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

Comparing Coro/Coro.pm (file contents):
Revision 1.178 by root, Thu Apr 17 22:33:10 2008 UTC vs.
Revision 1.256 by root, Wed Jun 17 21:38:23 2009 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines