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

Comparing Coro/Coro.pm (file contents):
Revision 1.162 by root, Wed Dec 12 19:09:33 2007 UTC vs.
Revision 1.254 by root, Tue Jun 16 17:19:08 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.31'; 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# static methods. not really.
184
185=back 178=back
186 179
187=head2 STATIC METHODS 180=head1 SIMPLE CORO CREATION
188
189Static methods are actually functions that operate on the current coroutine only.
190 181
191=over 4 182=over 4
192 183
193=item async { ... } [@args...] 184=item async { ... } [@args...]
194 185
195Create a new asynchronous coroutine and return it's coroutine object 186Create a new coro and return its Coro object (usually
196(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
197terminated. 192terminated.
198 193
194The remaining arguments are passed as arguments to the closure.
195
199See the C<Coro::State::new> constructor for info about the coroutine 196See the C<Coro::State::new> constructor for info about the coro
200environment in which coroutines run. 197environment in which coro are executed.
201 198
202Calling 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
203the coroutine. Likewise, when the coroutine dies, the program will exit, 200the coro. Likewise, when the coro dies, the program will exit,
204just as it would in the main program. 201just as it would in the main program.
205 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
206 # create a new coroutine that just prints its arguments 206Example: Create a new coro that just prints its arguments.
207
207 async { 208 async {
208 print "@_\n"; 209 print "@_\n";
209 } 1,2,3,4; 210 } 1,2,3,4;
210 211
211=cut 212=cut
216 $coro 217 $coro
217} 218}
218 219
219=item async_pool { ... } [@args...] 220=item async_pool { ... } [@args...]
220 221
221Similar 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
222terminate 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
223that 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 :).
224 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
225Also, 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
226issued in case of an exception instead of terminating the program, as 232issued in case of an exception instead of terminating the program, as
227C<async> does. As the coroutine is being reused, stuff like C<on_destroy> 233C<async> does. As the coro is being reused, stuff like C<on_destroy>
228will not work in the expected way, unless you call terminate or cancel, 234will not work in the expected way, unless you call terminate or cancel,
229which somehow defeats the purpose of pooling. 235which somehow defeats the purpose of pooling (but is fine in the
236exceptional case).
230 237
231The 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
232disabled, the description will be reset and the default output filehandle 239disabled, the description will be reset and the default output filehandle
233gets restored, so you can change alkl these. Otherwise the coroutine will 240gets restored, so you can change all these. Otherwise the coro will
234be 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
235stuff 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
236done by using local as in C< local $/ >. 243simply done by using local as in: C<< local $/ >>.
237 244
238The 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
239changing $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
240required. 247coros as required.
241 248
242If you are concerned about pooled coroutines growing a lot because a 249If you are concerned about pooled coros growing a lot because a
243single 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
244{ 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
245addition 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
246(adjustable with $Coro::POOL_RSS) it will also exit. 253(adjustable via $Coro::POOL_RSS) it will also be destroyed.
247 254
248=cut 255=cut
249 256
250our $POOL_SIZE = 8; 257our $POOL_SIZE = 8;
251our $POOL_RSS = 16 * 1024; 258our $POOL_RSS = 32 * 1024;
252our @async_pool; 259our @async_pool;
253 260
254sub pool_handler { 261sub pool_handler {
255 my $cb;
256
257 while () { 262 while () {
258 eval { 263 eval {
259 while () { 264 &{&_pool_handler} while 1;
260 _pool_1 $cb;
261 &$cb;
262 _pool_2 $cb;
263 &schedule;
264 }
265 }; 265 };
266 266
267 last if $@ eq "\3async_pool terminate\2\n";
268 warn $@ if $@; 267 warn $@ if $@;
269 } 268 }
270} 269}
271 270
272sub async_pool(&@) { 271=back
273 # this is also inlined into the unlock_scheduler
274 my $coro = (pop @async_pool) || new Coro \&pool_handler;
275 272
276 $coro->{_invoke} = [@_]; 273=head1 STATIC METHODS
277 $coro->ready;
278 274
279 $coro 275Static methods are actually functions that implicitly operate on the
280} 276current coro.
277
278=over 4
281 279
282=item schedule 280=item schedule
283 281
284Calls 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
285into the ready queue, so calling this function usually means you will 289queue, so calling this function usually means you will never be called
286never be called again unless something else (e.g. an event handler) calls 290again unless something else (e.g. an event handler) calls C<< ->ready >>,
287ready. 291thus waking you up.
288 292
289The 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.
290 300
291 { 301See B<HOW TO WAIT FOR A CALLBACK>, below, for some ways to wait for callbacks.
292 # remember current coroutine
293 my $current = $Coro::current;
294 302
295 # register a hypothetical event handler 303=item cede
296 on_event_invoke sub { 304
297 # wake up sleeping coroutine 305"Cede" to other coros. This function puts the current coro into
298 $current->ready; 306the ready queue and calls C<schedule>, which has the effect of giving
299 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
300 }; 364 };
301 365
302 # call schedule until event occurred. 366 Coro::on_leave {
303 # in case we are woken up for other reasons 367 $ENV{TZ} = $old_tz;
304 # (current still defined), loop. 368 tzset; # restore old value
305 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.
306 } 373 };
307 374
308=item cede 375This can be used to localise about any resource (locale, uid, current
309 376working directory etc.) to a block, despite the existance of other
310"Cede" to other coroutines. This function puts the current coroutine into the 377coros.
311ready queue and calls C<schedule>, which has the effect of giving up the
312current "timeslice" to other coroutines of the same or higher priority.
313
314=item Coro::cede_notself
315
316Works like cede, but is not exported by default and will cede to any
317coroutine, regardless of priority, once.
318
319=item terminate [arg...]
320
321Terminates the current coroutine with the given status values (see L<cancel>).
322 378
323=item killall 379=item killall
324 380
325Kills/terminates/cancels all coroutines except the currently running 381Kills/terminates/cancels all coros except the currently running one.
326one. This is useful after a fork, either in the child or the parent, as
327usually only one of them should inherit the running coroutines.
328 382
329=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.
330 387
331sub terminate { 388=cut
332 $current->cancel (@_);
333}
334 389
335sub killall { 390sub killall {
336 for (Coro::State::list) { 391 for (Coro::State::list) {
337 $_->cancel 392 $_->cancel
338 if $_ != $current && UNIVERSAL::isa $_, "Coro"; 393 if $_ != $current && UNIVERSAL::isa $_, "Coro";
339 } 394 }
340} 395}
341 396
342=back 397=back
343 398
344# dynamic methods
345
346=head2 COROUTINE METHODS 399=head1 CORO OBJECT METHODS
347 400
348These are the methods you can call on coroutine objects. 401These are the methods you can call on coro objects (or to create
402them).
349 403
350=over 4 404=over 4
351 405
352=item new Coro \&sub [, @args...] 406=item new Coro \&sub [, @args...]
353 407
354Create 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
355automatically terminates as if C<terminate> with the returned values were 409automatically terminates as if C<terminate> with the returned values were
356called. 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
357by calling the ready method. 411queue by calling the ready method.
358 412
359See C<async> and C<Coro::State::new> for additional info about the 413See C<async> and C<Coro::State::new> for additional info about the
360coroutine environment. 414coro environment.
361 415
362=cut 416=cut
363 417
364sub _run_coro { 418sub _coro_run {
365 terminate &{+shift}; 419 terminate &{+shift};
366} 420}
367 421
368sub new {
369 my $class = shift;
370
371 $class->SUPER::new (\&_run_coro, @_)
372}
373
374=item $success = $coroutine->ready 422=item $success = $coro->ready
375 423
376Put 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
377and 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
378and return false. 426the ready queue, do nothing and return false.
379 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
380=item $is_ready = $coroutine->is_ready 457=item $is_ready = $coro->is_ready
381 458
382Return 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.
383 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
384=item $coroutine->cancel (arg...) 473=item $coro->cancel (arg...)
385 474
386Terminates the given coroutine and makes it return the given arguments as 475Terminates the given Coro and makes it return the given arguments as
387status (default: the empty list). Never returns if the coroutine is the 476status (default: the empty list). Never returns if the Coro is the
388current coroutine. 477current Coro.
389 478
390=cut 479=cut
391 480
392sub cancel { 481sub cancel {
393 my $self = shift; 482 my $self = shift;
394 $self->{_status} = [@_];
395 483
396 if ($current == $self) { 484 if ($current == $self) {
397 push @destroy, $self; 485 terminate @_;
398 $manager->ready;
399 &schedule while 1;
400 } else { 486 } else {
401 $self->_cancel; 487 $self->{_status} = [@_];
488 Coro::State::cancel $self;
402 } 489 }
403} 490}
404 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
405=item $coroutine->join 534=item $coro->join
406 535
407Wait until the coroutine terminates and return any values given to the 536Wait until the coro terminates and return any values given to the
408C<terminate> or C<cancel> functions. C<join> can be called concurrently 537C<terminate> or C<cancel> functions. C<join> can be called concurrently
409from multiple coroutines. 538from multiple coro, and all will be resumed and given the status
539return once the C<$coro> terminates.
410 540
411=cut 541=cut
412 542
413sub join { 543sub join {
414 my $self = shift; 544 my $self = shift;
425 } 555 }
426 556
427 wantarray ? @{$self->{_status}} : $self->{_status}[0]; 557 wantarray ? @{$self->{_status}} : $self->{_status}[0];
428} 558}
429 559
430=item $coroutine->on_destroy (\&cb) 560=item $coro->on_destroy (\&cb)
431 561
432Registers a callback that is called when this coroutine gets destroyed, 562Registers a callback that is called when this coro gets destroyed,
433but before it is joined. The callback gets passed the terminate arguments, 563but before it is joined. The callback gets passed the terminate arguments,
434if any. 564if any, and I<must not> die, under any circumstances.
435 565
436=cut 566=cut
437 567
438sub on_destroy { 568sub on_destroy {
439 my ($self, $cb) = @_; 569 my ($self, $cb) = @_;
440 570
441 push @{ $self->{_on_destroy} }, $cb; 571 push @{ $self->{_on_destroy} }, $cb;
442} 572}
443 573
444=item $oldprio = $coroutine->prio ($newprio) 574=item $oldprio = $coro->prio ($newprio)
445 575
446Sets (or gets, if the argument is missing) the priority of the 576Sets (or gets, if the argument is missing) the priority of the
447coroutine. Higher priority coroutines get run before lower priority 577coro. Higher priority coro get run before lower priority
448coroutines. Priorities are small signed integers (currently -4 .. +3), 578coro. Priorities are small signed integers (currently -4 .. +3),
449that 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
450to get then): 580to get then):
451 581
452 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
453 3 > 1 > 0 > -1 > -3 > -4 583 3 > 1 > 0 > -1 > -3 > -4
454 584
455 # set priority to HIGH 585 # set priority to HIGH
456 current->prio(PRIO_HIGH); 586 current->prio (PRIO_HIGH);
457 587
458The idle coroutine ($Coro::idle) always has a lower priority than any 588The idle coro ($Coro::idle) always has a lower priority than any
459existing coroutine. 589existing coro.
460 590
461Changing the priority of the current coroutine will take effect immediately, 591Changing the priority of the current coro will take effect immediately,
462but changing the priority of coroutines in the ready queue (but not 592but changing the priority of coro in the ready queue (but not
463running) will only take effect after the next schedule (of that 593running) will only take effect after the next schedule (of that
464coroutine). 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.
465 595
466=item $newprio = $coroutine->nice ($change) 596=item $newprio = $coro->nice ($change)
467 597
468Similar 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.
469higher values mean lower priority, just as in unix). 599higher values mean lower priority, just as in unix).
470 600
471=item $olddesc = $coroutine->desc ($newdesc) 601=item $olddesc = $coro->desc ($newdesc)
472 602
473Sets (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
474coroutine. 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.
475 606
476This 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
477can modify this member directly if you wish. 608string. You can modify this member directly if you wish.
478
479=item $coroutine->throw ([$scalar])
480
481If C<$throw> is specified and defined, it will be thrown as an exception
482inside the coroutine at the next convinient point in time (usually after
483it gains control at the next schedule/transfer/cede). Otherwise clears the
484exception object.
485
486The exception object will be thrown "as is" with the specified scalar in
487C<$@>, i.e. if it is a string, no line number or newline will be appended
488(unlike with C<die>).
489
490This can be used as a softer means than C<cancel> to ask a coroutine to
491end itself, although there is no guarentee that the exception will lead to
492termination, and if the exception isn't caught it might well end the whole
493program.
494 609
495=cut 610=cut
496 611
497sub desc { 612sub desc {
498 my $old = $_[0]{desc}; 613 my $old = $_[0]{desc};
499 $_[0]{desc} = $_[1] if @_ > 1; 614 $_[0]{desc} = $_[1] if @_ > 1;
500 $old; 615 $old;
501} 616}
502 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
503=back 623=back
504 624
505=head2 GLOBAL FUNCTIONS 625=head1 GLOBAL FUNCTIONS
506 626
507=over 4 627=over 4
508 628
509=item Coro::nready 629=item Coro::nready
510 630
511Returns the number of coroutines that are currently in the ready state, 631Returns the number of coro that are currently in the ready state,
512i.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
513coroutine 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>
514and 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
515that wakes up some coroutines. 636coro.
516 637
517=item my $guard = Coro::guard { ... } 638=item my $guard = Coro::guard { ... }
518 639
519This creates and returns a guard object. Nothing happens until the object 640This function still exists, but is deprecated. Please use the
520gets destroyed, in which case the codeblock given as argument will be 641C<Guard::guard> function instead.
521executed. This is useful to free locks or other resources in case of a
522runtime error or when the coroutine gets canceled, as in both cases the
523guard block will be executed. The guard object supports only one method,
524C<< ->cancel >>, which will keep the codeblock from being executed.
525 642
526Example: set some flag and clear it again when the coroutine gets canceled
527or the function returns:
528
529 sub do_something {
530 my $guard = Coro::guard { $busy = 0 };
531 $busy = 1;
532
533 # do something that requires $busy to be true
534 }
535
536=cut 643=cut
537 644
538sub guard(&) { 645BEGIN { *guard = \&Guard::guard }
539 bless \(my $cb = $_[0]), "Coro::guard"
540}
541
542sub Coro::guard::cancel {
543 ${$_[0]} = sub { };
544}
545
546sub Coro::guard::DESTROY {
547 ${$_[0]}->();
548}
549
550 646
551=item unblock_sub { ... } 647=item unblock_sub { ... }
552 648
553This utility function takes a BLOCK or code reference and "unblocks" it, 649This utility function takes a BLOCK or code reference and "unblocks" it,
554returning the new coderef. This means that the new coderef will return 650returning a new coderef. Unblocking means that calling the new coderef
555immediately without blocking, returning nothing, while the original code 651will return immediately without blocking, returning nothing, while the
556ref will be called (with parameters) from within its own coroutine. 652original code ref will be called (with parameters) from within another
653coro.
557 654
558The 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
559venerable L<Event|Event> module) are not coroutine-safe (a weaker form 656venerable L<Event|Event> module) are not thread-safe (a weaker form
560of thread-safety). This means you must not block within event callbacks, 657of reentrancy). This means you must not block within event callbacks,
561otherwise 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>.
562 660
563This function allows your callbacks to block by executing them in another 661This function allows your callbacks to block by executing them in another
564coroutine 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
565is 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
566disk. 664disk, for example.
567 665
568In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when 666In short: simply use C<unblock_sub { ... }> instead of C<sub { ... }> when
569creating 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>.
570 678
571=cut 679=cut
572 680
573our @unblock_queue; 681our @unblock_queue;
574 682
577# return immediately and can be reused) and because we cannot cede 685# return immediately and can be reused) and because we cannot cede
578# inside an event callback. 686# inside an event callback.
579our $unblock_scheduler = new Coro sub { 687our $unblock_scheduler = new Coro sub {
580 while () { 688 while () {
581 while (my $cb = pop @unblock_queue) { 689 while (my $cb = pop @unblock_queue) {
582 # this is an inlined copy of async_pool 690 &async_pool (@$cb);
583 my $coro = (pop @async_pool) || new Coro \&pool_handler;
584 691
585 $coro->{_invoke} = $cb;
586 $coro->ready;
587 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;
588 } 696 }
589 schedule; # sleep well 697 schedule; # sleep well
590 } 698 }
591}; 699};
592$unblock_scheduler->desc ("[unblock_sub scheduler]"); 700$unblock_scheduler->{desc} = "[unblock_sub scheduler]";
593 701
594sub unblock_sub(&) { 702sub unblock_sub(&) {
595 my $cb = shift; 703 my $cb = shift;
596 704
597 sub { 705 sub {
598 unshift @unblock_queue, [$cb, @_]; 706 unshift @unblock_queue, [$cb, @_];
599 $unblock_scheduler->ready; 707 $unblock_scheduler->ready;
600 } 708 }
601} 709}
602 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
603=back 730=back
604 731
605=cut 732=cut
606 733
6071; 7341;
608 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
609=head1 BUGS/LIMITATIONS 802=head1 BUGS/LIMITATIONS
610 803
611 - you must make very sure that no coro is still active on global 804=over 4
612 destruction. very bad things might happen otherwise (usually segfaults).
613 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
614 - 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
615 from the same thread (this requirement might be loosened in the future 816module from the first thread (this requirement might be removed in the
616 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
617 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
618 834
619=head1 SEE ALSO 835=head1 SEE ALSO
620 836
621Lower level Configuration, Coroutine Environment: L<Coro::State>. 837Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
622 838
623Debugging: L<Coro::Debug>. 839Debugging: L<Coro::Debug>.
624 840
625Support/Utility: L<Coro::Specific>, L<Coro::Util>. 841Support/Utility: L<Coro::Specific>, L<Coro::Util>.
626 842
627Locking/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>.
628 845
629Event/IO: L<Coro::Timer>, L<Coro::Event>, L<Coro::Handle>, L<Coro::Socket>. 846I/O and Timers: L<Coro::Timer>, L<Coro::Handle>, L<Coro::Socket>, L<Coro::AIO>.
630 847
631Compatibility: L<Coro::LWP>, L<Coro::Storable>, L<Coro::Select>. 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>.
632 851
633Embedding: L<Coro::MakeMaker>. 852XS API: L<Coro::MakeMaker>.
853
854Low level Configuration, Thread Environment, Continuations: L<Coro::State>.
634 855
635=head1 AUTHOR 856=head1 AUTHOR
636 857
637 Marc Lehmann <schmorp@schmorp.de> 858 Marc Lehmann <schmorp@schmorp.de>
638 http://home.schmorp.de/ 859 http://home.schmorp.de/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines