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

Comparing Coro/Coro.pm (file contents):
Revision 1.172 by root, Fri Apr 4 20:07:34 2008 UTC vs.
Revision 1.234 by root, Fri Nov 21 06:52:10 2008 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines