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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines