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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines