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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines