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

Comparing Coro/Coro.pm (file contents):
Revision 1.186 by root, Sun May 25 01:32:36 2008 UTC vs.
Revision 1.240 by root, Tue Nov 25 20:48:41 2008 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines