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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines