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.94 by root, Sat Dec 2 18:01:30 2006 UTC vs.
Revision 1.258 by root, Fri Jun 26 14:25:45 2009 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines