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

Comparing Coro/Coro.pm (file contents):
Revision 1.268 by root, Thu Oct 1 23:16:27 2009 UTC vs.
Revision 1.309 by root, Sat Oct 6 21:25:24 2012 UTC

16 cede; # yield to coro 16 cede; # yield to coro
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;
22 my $lock = new Coro::Semaphore; 21 my $lock = new Coro::Semaphore;
23 my $locked; 22 my $locked;
24 23
25 $lock->down; 24 $lock->down;
26 $locked = 1; 25 $locked = 1;
40points in your program, so locking and parallel access are rarely an 39points in your program, so locking and parallel access are rarely an
41issue, making thread programming much safer and easier than using other 40issue, making thread programming much safer and easier than using other
42thread models. 41thread models.
43 42
44Unlike the so-called "Perl threads" (which are not actually real threads 43Unlike the so-called "Perl threads" (which are not actually real threads
45but only the windows process emulation (see section of same name for more 44but only the windows process emulation (see section of same name for
46details) ported to unix, and as such act as processes), Coro provides 45more details) ported to UNIX, and as such act as processes), Coro
47a full shared address space, which makes communication between threads 46provides a full shared address space, which makes communication between
48very easy. And Coro's threads are fast, too: disabling the Windows 47threads very easy. And coro threads are fast, too: disabling the Windows
49process emulation code in your perl and using Coro can easily result in 48process emulation code in your perl and using Coro can easily result in
50a two to four times speed increase for your programs. A parallel matrix 49a two to four times speed increase for your programs. A parallel matrix
51multiplication benchmark runs over 300 times faster on a single core than 50multiplication benchmark (very communication-intensive) runs over 300
52perl's pseudo-threads on a quad core using all four cores. 51times faster on a single core than perls pseudo-threads on a quad core
52using all four cores.
53 53
54Coro achieves that by supporting multiple running interpreters that share 54Coro achieves that by supporting multiple running interpreters that share
55data, which is especially useful to code pseudo-parallel processes and 55data, which is especially useful to code pseudo-parallel processes and
56for event-based programming, such as multiple HTTP-GET requests running 56for event-based programming, such as multiple HTTP-GET requests running
57concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro 57concurrently. See L<Coro::AnyEvent> to learn more on how to integrate Coro
63variables (see L<Coro::State> for more configuration and background info). 63variables (see L<Coro::State> for more configuration and background info).
64 64
65See also the C<SEE ALSO> section at the end of this document - the Coro 65See also the C<SEE ALSO> section at the end of this document - the Coro
66module family is quite large. 66module family is quite large.
67 67
68=head1 CORO THREAD LIFE CYCLE
69
70During the long and exciting (or not) life of a coro thread, it goes
71through a number of states:
72
73=over 4
74
75=item 1. Creation
76
77The first thing in the life of a coro thread is it's creation -
78obviously. The typical way to create a thread is to call the C<async
79BLOCK> function:
80
81 async {
82 # thread code goes here
83 };
84
85You can also pass arguments, which are put in C<@_>:
86
87 async {
88 print $_[1]; # prints 2
89 } 1, 2, 3;
90
91This creates a new coro thread and puts it into the ready queue, meaning
92it will run as soon as the CPU is free for it.
93
94C<async> will return a Coro object - you can store this for future
95reference or ignore it - a thread that is running, ready to run or waiting
96for some event is alive on it's own.
97
98Another way to create a thread is to call the C<new> constructor with a
99code-reference:
100
101 new Coro sub {
102 # thread code goes here
103 }, @optional_arguments;
104
105This is quite similar to calling C<async>, but the important difference is
106that the new thread is not put into the ready queue, so the thread will
107not run until somebody puts it there. C<async> is, therefore, identical to
108this sequence:
109
110 my $coro = new Coro sub {
111 # thread code goes here
112 };
113 $coro->ready;
114 return $coro;
115
116=item 2. Startup
117
118When a new coro thread is created, only a copy of the code reference
119and the arguments are stored, no extra memory for stacks and so on is
120allocated, keeping the coro thread in a low-memory state.
121
122Only when it actually starts executing will all the resources be finally
123allocated.
124
125The optional arguments specified at coro creation are available in C<@_>,
126similar to function calls.
127
128=item 3. Running / Blocking
129
130A lot can happen after the coro thread has started running. Quite usually,
131it will not run to the end in one go (because you could use a function
132instead), but it will give up the CPU regularly because it waits for
133external events.
134
135As long as a coro thread runs, its Coro object is available in the global
136variable C<$Coro::current>.
137
138The low-level way to give up the CPU is to call the scheduler, which
139selects a new coro thread to run:
140
141 Coro::schedule;
142
143Since running threads are not in the ready queue, calling the scheduler
144without doing anything else will block the coro thread forever - you need
145to arrange either for the coro to put woken up (readied) by some other
146event or some other thread, or you can put it into the ready queue before
147scheduling:
148
149 # this is exactly what Coro::cede does
150 $Coro::current->ready;
151 Coro::schedule;
152
153All the higher-level synchronisation methods (Coro::Semaphore,
154Coro::rouse_*...) are actually implemented via C<< ->ready >> and C<<
155Coro::schedule >>.
156
157While the coro thread is running it also might get assigned a C-level
158thread, or the C-level thread might be unassigned from it, as the Coro
159runtime wishes. A C-level thread needs to be assigned when your perl
160thread calls into some C-level function and that function in turn calls
161perl and perl then wants to switch coroutines. This happens most often
162when you run an event loop and block in the callback, or when perl
163itself calls some function such as C<AUTOLOAD> or methods via the C<tie>
164mechanism.
165
166=item 4. Termination
167
168Many threads actually terminate after some time. There are a number of
169ways to terminate a coro thread, the simplest is returning from the
170top-level code reference:
171
172 async {
173 # after returning from here, the coro thread is terminated
174 };
175
176 async {
177 return if 0.5 < rand; # terminate a little earlier, maybe
178 print "got a chance to print this\n";
179 # or here
180 };
181
182Any values returned from the coroutine can be recovered using C<< ->join
183>>:
184
185 my $coro = async {
186 "hello, world\n" # return a string
187 };
188
189 my $hello_world = $coro->join;
190
191 print $hello_world;
192
193Another way to terminate is to call C<< Coro::terminate >>, which at any
194subroutine call nesting level:
195
196 async {
197 Coro::terminate "return value 1", "return value 2";
198 };
199
200And yet another way is to C<< ->cancel >> (or C<< ->safe_cancel >>) the
201coro thread from another thread:
202
203 my $coro = async {
204 exit 1;
205 };
206
207 $coro->cancel; # also accepts values for ->join to retrieve
208
209Cancellation I<can> be dangerous - it's a bit like calling C<exit> without
210actually exiting, and might leave C libraries and XS modules in a weird
211state. Unlike other thread implementations, however, Coro is exceptionally
212safe with regards to cancellation, as perl will always be in a consistent
213state, and for those cases where you want to do truly marvellous things
214with your coro while it is being cancelled - that is, make sure all
215cleanup code is executed from the thread being cancelled - there is even a
216C<< ->safe_cancel >> method.
217
218So, cancelling a thread that runs in an XS event loop might not be the
219best idea, but any other combination that deals with perl only (cancelling
220when a thread is in a C<tie> method or an C<AUTOLOAD> for example) is
221safe.
222
223Lastly, a coro thread object that isn't referenced is C<< ->cancel >>'ed
224automatically - just like other objects in Perl. This is not such a common
225case, however - a running thread is referencedy b C<$Coro::current>, a
226thread ready to run is referenced by the ready queue, a thread waiting
227on a lock or semaphore is referenced by being in some wait list and so
228on. But a thread that isn't in any of those queues gets cancelled:
229
230 async {
231 schedule; # cede to other coros, don't go into the ready queue
232 };
233
234 cede;
235 # now the async above is destroyed, as it is not referenced by anything.
236
237=item 5. Cleanup
238
239Threads will allocate various resources. Most but not all will be returned
240when a thread terminates, during clean-up.
241
242Cleanup is quite similar to throwing an uncaught exception: perl will
243work it's way up through all subroutine calls and blocks. On it's way, it
244will release all C<my> variables, undo all C<local>'s and free any other
245resources truly local to the thread.
246
247So, a common way to free resources is to keep them referenced only by my
248variables:
249
250 async {
251 my $big_cache = new Cache ...;
252 };
253
254If there are no other references, then the C<$big_cache> object will be
255freed when the thread terminates, regardless of how it does so.
256
257What it does C<NOT> do is unlock any Coro::Semaphores or similar
258resources, but that's where the C<guard> methods come in handy:
259
260 my $sem = new Coro::Semaphore;
261
262 async {
263 my $lock_guard = $sem->guard;
264 # if we reutrn, or die or get cancelled, here,
265 # then the semaphore will be "up"ed.
266 };
267
268The C<Guard::guard> function comes in handy for any custom cleanup you
269might want to do (but you cannot switch to other coroutines form those
270code blocks):
271
272 async {
273 my $window = new Gtk2::Window "toplevel";
274 # The window will not be cleaned up automatically, even when $window
275 # gets freed, so use a guard to ensure it's destruction
276 # in case of an error:
277 my $window_guard = Guard::guard { $window->destroy };
278
279 # we are safe here
280 };
281
282Last not least, C<local> can often be handy, too, e.g. when temporarily
283replacing the coro thread description:
284
285 sub myfunction {
286 local $Coro::current->{desc} = "inside myfunction(@_)";
287
288 # if we return or die here, the description will be restored
289 }
290
291=item 6. Viva La Zombie Muerte
292
293Even after a thread has terminated and cleaned up its resources, the Coro
294object still is there and stores the return values of the thread.
295
296The means the Coro object gets freed automatically when the thread has
297terminated and cleaned up and there arenot other references.
298
299If there are, the Coro object will stay around, and you can call C<<
300->join >> as many times as you wish to retrieve the result values:
301
302 async {
303 print "hi\n";
304 1
305 };
306
307 # run the async above, and free everything before returning
308 # from Coro::cede:
309 Coro::cede;
310
311 {
312 my $coro = async {
313 print "hi\n";
314 1
315 };
316
317 # run the async above, and clean up, but do not free the coro
318 # object:
319 Coro::cede;
320
321 # optionally retrieve the result values
322 my @results = $coro->join;
323
324 # now $coro goes out of scope, and presumably gets freed
325 };
326
327=back
328
68=cut 329=cut
69 330
70package Coro; 331package Coro;
71 332
72use common::sense; 333use common::sense;
81 342
82our $idle; # idle handler 343our $idle; # idle handler
83our $main; # main coro 344our $main; # main coro
84our $current; # current coro 345our $current; # current coro
85 346
86our $VERSION = 5.17; 347our $VERSION = 6.09;
87 348
88our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 349our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub rouse_cb rouse_wait);
89our %EXPORT_TAGS = ( 350our %EXPORT_TAGS = (
90 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 351 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
91); 352);
92our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 353our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
93 354
124 385
125This variable is mainly useful to integrate Coro into event loops. It is 386This variable is mainly useful to integrate Coro into event loops. It is
126usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is 387usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
127pretty low-level functionality. 388pretty low-level functionality.
128 389
129This variable stores either a Coro object or a callback. 390This variable stores a Coro object that is put into the ready queue when
391there are no other ready threads (without invoking any ready hooks).
130 392
131If it is a callback, the it is called whenever the scheduler finds no 393The default implementation dies with "FATAL: deadlock detected.", followed
132ready coros to run. The default implementation prints "FATAL: 394by a thread listing, because the program has no other way to continue.
133deadlock detected" and exits, because the program has no other way to
134continue.
135
136If it is a coro object, then this object will be readied (without
137invoking any ready hooks, however) when the scheduler finds no other ready
138coros to run.
139 395
140This hook is overwritten by modules such as C<Coro::EV> and 396This hook is overwritten by modules such as C<Coro::EV> and
141C<Coro::AnyEvent> to wait on an external event that hopefully wake up a 397C<Coro::AnyEvent> to wait on an external event that hopefully wakes up a
142coro so the scheduler can run it. 398coro so the scheduler can run it.
143 399
144Note that the callback I<must not>, under any circumstances, block
145the current coro. Normally, this is achieved by having an "idle
146coro" that calls the event loop and then blocks again, and then
147readying that coro in the idle handler, or by simply placing the idle
148coro in this variable.
149
150See L<Coro::Event> or L<Coro::AnyEvent> for examples of using this 400See L<Coro::EV> or L<Coro::AnyEvent> for examples of using this technique.
151technique.
152
153Please note that if your callback recursively invokes perl (e.g. for event
154handlers), then it must be prepared to be called recursively itself.
155 401
156=cut 402=cut
157 403
158$idle = sub { 404# ||= because other modules could have provided their own by now
159 warn "oi\n";#d# 405$idle ||= new Coro sub {
160 Carp::confess ("FATAL: deadlock detected"); 406 require Coro::Debug;
407 die "FATAL: deadlock detected.\n"
408 . Coro::Debug::ps_listing ();
161}; 409};
162 410
163# this coro is necessary because a coro 411# this coro is necessary because a coro
164# cannot destroy itself. 412# cannot destroy itself.
165our @destroy; 413our @destroy;
166our $manager; 414our $manager;
167 415
168$manager = new Coro sub { 416$manager = new Coro sub {
169 while () { 417 while () {
170 Coro::State::cancel shift @destroy 418 _destroy shift @destroy
171 while @destroy; 419 while @destroy;
172 420
173 &schedule; 421 &schedule;
174 } 422 }
175}; 423};
273=item schedule 521=item schedule
274 522
275Calls the scheduler. The scheduler will find the next coro that is 523Calls the scheduler. The scheduler will find the next coro that is
276to be run from the ready queue and switches to it. The next coro 524to be run from the ready queue and switches to it. The next coro
277to be run is simply the one with the highest priority that is longest 525to be run is simply the one with the highest priority that is longest
278in its ready queue. If there is no coro ready, it will clal the 526in its ready queue. If there is no coro ready, it will call the
279C<$Coro::idle> hook. 527C<$Coro::idle> hook.
280 528
281Please note that the current coro will I<not> be put into the ready 529Please note that the current coro will I<not> be put into the ready
282queue, so calling this function usually means you will never be called 530queue, so calling this function usually means you will never be called
283again unless something else (e.g. an event handler) calls C<< ->ready >>, 531again unless something else (e.g. an event handler) calls C<< ->ready >>,
309coro, regardless of priority. This is useful sometimes to ensure 557coro, regardless of priority. This is useful sometimes to ensure
310progress is made. 558progress is made.
311 559
312=item terminate [arg...] 560=item terminate [arg...]
313 561
314Terminates the current coro with the given status values (see L<cancel>). 562Terminates the current coro with the given status values (see
563L<cancel>). The values will not be copied, but referenced directly.
315 564
316=item Coro::on_enter BLOCK, Coro::on_leave BLOCK 565=item Coro::on_enter BLOCK, Coro::on_leave BLOCK
317 566
318These function install enter and leave winders in the current scope. The 567These function install enter and leave winders in the current scope. The
319enter block will be executed when on_enter is called and whenever the 568enter block will be executed when on_enter is called and whenever the
475To avoid this, it is best to put a suspended coro into the ready queue 724To avoid this, it is best to put a suspended coro into the ready queue
476unconditionally, as every synchronisation mechanism must protect itself 725unconditionally, as every synchronisation mechanism must protect itself
477against spurious wakeups, and the one in the Coro family certainly do 726against spurious wakeups, and the one in the Coro family certainly do
478that. 727that.
479 728
729=item $state->is_new
730
731Returns true iff this Coro object is "new", i.e. has never been run
732yet. Those states basically consist of only the code reference to call and
733the arguments, but consumes very little other resources. New states will
734automatically get assigned a perl interpreter when they are transfered to.
735
736=item $state->is_zombie
737
738Returns true iff the Coro object has been cancelled, i.e.
739it's resources freed because they were C<cancel>'ed, C<terminate>'d,
740C<safe_cancel>'ed or simply went out of scope.
741
742The name "zombie" stems from UNIX culture, where a process that has
743exited and only stores and exit status and no other resources is called a
744"zombie".
745
480=item $is_ready = $coro->is_ready 746=item $is_ready = $coro->is_ready
481 747
482Returns true iff the Coro object is in the ready queue. Unless the Coro 748Returns true iff the Coro object is in the ready queue. Unless the Coro
483object gets destroyed, it will eventually be scheduled by the scheduler. 749object gets destroyed, it will eventually be scheduled by the scheduler.
484 750
493Returns true iff this Coro object has been suspended. Suspended Coros will 759Returns true iff this Coro object has been suspended. Suspended Coros will
494not ever be scheduled. 760not ever be scheduled.
495 761
496=item $coro->cancel (arg...) 762=item $coro->cancel (arg...)
497 763
498Terminates the given Coro and makes it return the given arguments as 764Terminates the given Coro thread and makes it return the given arguments as
499status (default: the empty list). Never returns if the Coro is the 765status (default: an empty list). Never returns if the Coro is the
500current Coro. 766current Coro.
501 767
502=cut 768This is a rather brutal way to free a coro, with some limitations - if
769the thread is inside a C callback that doesn't expect to be canceled,
770bad things can happen, or if the cancelled thread insists on running
771complicated cleanup handlers that rely on its thread context, things will
772not work.
503 773
504sub cancel { 774Any cleanup code being run (e.g. from C<guard> blocks) will be run without
505 my $self = shift; 775a thread context, and is not allowed to switch to other threads. On the
776plus side, C<< ->cancel >> will always clean up the thread, no matter
777what. If your cleanup code is complex or you want to avoid cancelling a
778C-thread that doesn't know how to clean up itself, it can be better to C<<
779->throw >> an exception, or use C<< ->safe_cancel >>.
506 780
507 if ($current == $self) { 781The arguments to C<< ->cancel >> are not copied, but instead will
508 terminate @_; 782be referenced directly (e.g. if you pass C<$var> and after the call
509 } else { 783change that variable, then you might change the return values passed to
510 $self->{_status} = [@_]; 784e.g. C<join>, so don't do that).
511 Coro::State::cancel $self; 785
786The resources of the Coro are usually freed (or destructed) before this
787call returns, but this can be delayed for an indefinite amount of time, as
788in some cases the manager thread has to run first to actually destruct the
789Coro object.
790
791=item $coro->safe_cancel ($arg...)
792
793Works mostly like C<< ->cancel >>, but is inherently "safer", and
794consequently, can fail with an exception in cases the thread is not in a
795cancellable state.
796
797This method works a bit like throwing an exception that cannot be caught
798- specifically, it will clean up the thread from within itself, so
799all cleanup handlers (e.g. C<guard> blocks) are run with full thread
800context and can block if they wish. The downside is that there is no
801guarantee that the thread can be cancelled when you call this method, and
802therefore, it might fail. It is also considerably slower than C<cancel> or
803C<terminate>.
804
805A thread is in a safe-cancellable state if it either hasn't been run yet,
806or it has no C context attached and is inside an SLF function.
807
808The latter two basically mean that the thread isn't currently inside a
809perl callback called from some C function (usually via some XS modules)
810and isn't currently executing inside some C function itself (via Coro's XS
811API).
812
813This call returns true when it could cancel the thread, or croaks with an
814error otherwise (i.e. it either returns true or doesn't return at all).
815
816Why the weird interface? Well, there are two common models on how and
817when to cancel things. In the first, you have the expectation that your
818coro thread can be cancelled when you want to cancel it - if the thread
819isn't cancellable, this would be a bug somewhere, so C<< ->safe_cancel >>
820croaks to notify of the bug.
821
822In the second model you sometimes want to ask nicely to cancel a thread,
823but if it's not a good time, well, then don't cancel. This can be done
824relatively easy like this:
825
826 if (! eval { $coro->safe_cancel }) {
827 warn "unable to cancel thread: $@";
512 } 828 }
513} 829
830However, what you never should do is first try to cancel "safely" and
831if that fails, cancel the "hard" way with C<< ->cancel >>. That makes
832no sense: either you rely on being able to execute cleanup code in your
833thread context, or you don't. If you do, then C<< ->safe_cancel >> is the
834only way, and if you don't, then C<< ->cancel >> is always faster and more
835direct.
514 836
515=item $coro->schedule_to 837=item $coro->schedule_to
516 838
517Puts the current coro to sleep (like C<Coro::schedule>), but instead 839Puts the current coro to sleep (like C<Coro::schedule>), but instead
518of continuing with the next coro from the ready queue, always switch to 840of continuing with the next coro from the ready queue, always switch to
537inside the coro at the next convenient point in time. Otherwise 859inside the coro at the next convenient point in time. Otherwise
538clears the exception object. 860clears the exception object.
539 861
540Coro will check for the exception each time a schedule-like-function 862Coro will check for the exception each time a schedule-like-function
541returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down 863returns, i.e. after each C<schedule>, C<cede>, C<< Coro::Semaphore->down
542>>, C<< Coro::Handle->readable >> and so on. Most of these functions 864>>, C<< Coro::Handle->readable >> and so on. Most of those functions (all
543detect this case and return early in case an exception is pending. 865that are part of Coro itself) detect this case and return early in case an
866exception is pending.
544 867
545The exception object will be thrown "as is" with the specified scalar in 868The exception object will be thrown "as is" with the specified scalar in
546C<$@>, i.e. if it is a string, no line number or newline will be appended 869C<$@>, i.e. if it is a string, no line number or newline will be appended
547(unlike with C<die>). 870(unlike with C<die>).
548 871
549This can be used as a softer means than C<cancel> to ask a coro to 872This can be used as a softer means than either C<cancel> or C<safe_cancel
550end itself, although there is no guarantee that the exception will lead to 873>to ask a coro to end itself, although there is no guarantee that the
551termination, and if the exception isn't caught it might well end the whole 874exception will lead to termination, and if the exception isn't caught it
552program. 875might well end the whole program.
553 876
554You might also think of C<throw> as being the moral equivalent of 877You might also think of C<throw> as being the moral equivalent of
555C<kill>ing a coro with a signal (in this case, a scalar). 878C<kill>ing a coro with a signal (in this case, a scalar).
556 879
557=item $coro->join 880=item $coro->join
558 881
559Wait until the coro terminates and return any values given to the 882Wait until the coro terminates and return any values given to the
560C<terminate> or C<cancel> functions. C<join> can be called concurrently 883C<terminate> or C<cancel> functions. C<join> can be called concurrently
561from multiple coro, and all will be resumed and given the status 884from multiple threads, and all will be resumed and given the status
562return once the C<$coro> terminates. 885return once the C<$coro> terminates.
563 886
564=cut
565
566sub join {
567 my $self = shift;
568
569 unless ($self->{_status}) {
570 my $current = $current;
571
572 push @{$self->{_on_destroy}}, sub {
573 $current->ready;
574 undef $current;
575 };
576
577 &schedule while $current;
578 }
579
580 wantarray ? @{$self->{_status}} : $self->{_status}[0];
581}
582
583=item $coro->on_destroy (\&cb) 887=item $coro->on_destroy (\&cb)
584 888
585Registers a callback that is called when this coro gets destroyed, 889Registers a callback that is called when this coro thread gets destroyed,
586but before it is joined. The callback gets passed the terminate arguments, 890that is, after it's resources have been freed but before it is joined. The
891callback gets passed the terminate/cancel arguments, if any, and I<must
587if any, and I<must not> die, under any circumstances. 892not> die, under any circumstances.
588 893
589=cut 894There can be any number of C<on_destroy> callbacks per coro, and there is
590 895no way currently to remove a callback once added.
591sub on_destroy {
592 my ($self, $cb) = @_;
593
594 push @{ $self->{_on_destroy} }, $cb;
595}
596 896
597=item $oldprio = $coro->prio ($newprio) 897=item $oldprio = $coro->prio ($newprio)
598 898
599Sets (or gets, if the argument is missing) the priority of the 899Sets (or gets, if the argument is missing) the priority of the
600coro. Higher priority coro get run before lower priority 900coro thread. Higher priority coro get run before lower priority
601coro. Priorities are small signed integers (currently -4 .. +3), 901coros. Priorities are small signed integers (currently -4 .. +3),
602that you can refer to using PRIO_xxx constants (use the import tag :prio 902that you can refer to using PRIO_xxx constants (use the import tag :prio
603to get then): 903to get then):
604 904
605 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 905 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
606 3 > 1 > 0 > -1 > -3 > -4 906 3 > 1 > 0 > -1 > -3 > -4
607 907
608 # set priority to HIGH 908 # set priority to HIGH
609 current->prio (PRIO_HIGH); 909 current->prio (PRIO_HIGH);
610 910
611The idle coro ($Coro::idle) always has a lower priority than any 911The idle coro thread ($Coro::idle) always has a lower priority than any
612existing coro. 912existing coro.
613 913
614Changing the priority of the current coro will take effect immediately, 914Changing the priority of the current coro will take effect immediately,
615but changing the priority of coro in the ready queue (but not 915but changing the priority of a coro in the ready queue (but not running)
616running) will only take effect after the next schedule (of that 916will only take effect after the next schedule (of that coro). This is a
617coro). This is a bug that will be fixed in some future version. 917bug that will be fixed in some future version.
618 918
619=item $newprio = $coro->nice ($change) 919=item $newprio = $coro->nice ($change)
620 920
621Similar to C<prio>, but subtract the given value from the priority (i.e. 921Similar to C<prio>, but subtract the given value from the priority (i.e.
622higher values mean lower priority, just as in unix). 922higher values mean lower priority, just as in UNIX's nice command).
623 923
624=item $olddesc = $coro->desc ($newdesc) 924=item $olddesc = $coro->desc ($newdesc)
625 925
626Sets (or gets in case the argument is missing) the description for this 926Sets (or gets in case the argument is missing) the description for this
627coro. This is just a free-form string you can associate with a 927coro thread. This is just a free-form string you can associate with a
628coro. 928coro.
629 929
630This method simply sets the C<< $coro->{desc} >> member to the given 930This method simply sets the C<< $coro->{desc} >> member to the given
631string. You can modify this member directly if you wish. 931string. You can modify this member directly if you wish, and in fact, this
932is often preferred to indicate major processing states that cna then be
933seen for example in a L<Coro::Debug> session:
934
935 sub my_long_function {
936 local $Coro::current->{desc} = "now in my_long_function";
937 ...
938 $Coro::current->{desc} = "my_long_function: phase 1";
939 ...
940 $Coro::current->{desc} = "my_long_function: phase 2";
941 ...
942 }
632 943
633=cut 944=cut
634 945
635sub desc { 946sub desc {
636 my $old = $_[0]{desc}; 947 my $old = $_[0]{desc};
673returning a new coderef. Unblocking means that calling the new coderef 984returning a new coderef. Unblocking means that calling the new coderef
674will return immediately without blocking, returning nothing, while the 985will return immediately without blocking, returning nothing, while the
675original code ref will be called (with parameters) from within another 986original code ref will be called (with parameters) from within another
676coro. 987coro.
677 988
678The reason this function exists is that many event libraries (such as the 989The reason this function exists is that many event libraries (such as
679venerable L<Event|Event> module) are not thread-safe (a weaker form 990the venerable L<Event|Event> module) are not thread-safe (a weaker form
680of reentrancy). This means you must not block within event callbacks, 991of reentrancy). This means you must not block within event callbacks,
681otherwise you might suffer from crashes or worse. The only event library 992otherwise you might suffer from crashes or worse. The only event library
682currently known that is safe to use without C<unblock_sub> is L<EV>. 993currently known that is safe to use without C<unblock_sub> is L<EV> (but
994you might still run into deadlocks if all event loops are blocked).
995
996Coro will try to catch you when you block in the event loop
997("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
998only works when you do not run your own event loop.
683 999
684This function allows your callbacks to block by executing them in another 1000This function allows your callbacks to block by executing them in another
685coro where it is safe to block. One example where blocking is handy 1001coro where it is safe to block. One example where blocking is handy
686is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 1002is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
687disk, for example. 1003disk, for example.
729 unshift @unblock_queue, [$cb, @_]; 1045 unshift @unblock_queue, [$cb, @_];
730 $unblock_scheduler->ready; 1046 $unblock_scheduler->ready;
731 } 1047 }
732} 1048}
733 1049
734=item $cb = Coro::rouse_cb 1050=item $cb = rouse_cb
735 1051
736Create and return a "rouse callback". That's a code reference that, 1052Create and return a "rouse callback". That's a code reference that,
737when called, will remember a copy of its arguments and notify the owner 1053when called, will remember a copy of its arguments and notify the owner
738coro of the callback. 1054coro of the callback.
739 1055
740See the next function. 1056See the next function.
741 1057
742=item @args = Coro::rouse_wait [$cb] 1058=item @args = rouse_wait [$cb]
743 1059
744Wait for the specified rouse callback (or the last one that was created in 1060Wait for the specified rouse callback (or the last one that was created in
745this coro). 1061this coro).
746 1062
747As soon as the callback is invoked (or when the callback was invoked 1063As soon as the callback is invoked (or when the callback was invoked
753See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. 1069See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
754 1070
755=back 1071=back
756 1072
757=cut 1073=cut
1074
1075for my $module (qw(Channel RWLock Semaphore SemaphoreSet Signal Specific)) {
1076 my $old = defined &{"Coro::$module\::new"} && \&{"Coro::$module\::new"};
1077
1078 *{"Coro::$module\::new"} = sub {
1079 require "Coro/$module.pm";
1080
1081 # some modules have their new predefined in State.xs, some don't
1082 *{"Coro::$module\::new"} = $old
1083 if $old;
1084
1085 goto &{"Coro::$module\::new"};
1086 };
1087}
758 1088
7591; 10891;
760 1090
761=head1 HOW TO WAIT FOR A CALLBACK 1091=head1 HOW TO WAIT FOR A CALLBACK
762 1092
842future to allow per-thread schedulers, but Coro::State does not yet allow 1172future to allow per-thread schedulers, but Coro::State does not yet allow
843this). I recommend disabling thread support and using processes, as having 1173this). I recommend disabling thread support and using processes, as having
844the windows process emulation enabled under unix roughly halves perl 1174the windows process emulation enabled under unix roughly halves perl
845performance, even when not used. 1175performance, even when not used.
846 1176
1177Attempts to use threads created in another emulated process will crash
1178("cleanly", with a null pointer exception).
1179
847=item coro switching is not signal safe 1180=item coro switching is not signal safe
848 1181
849You must not switch to another coro from within a signal handler 1182You must not switch to another coro from within a signal handler (only
850(only relevant with %SIG - most event libraries provide safe signals). 1183relevant with %SIG - most event libraries provide safe signals), I<unless>
1184you are sure you are not interrupting a Coro function.
851 1185
852That means you I<MUST NOT> call any function that might "block" the 1186That means you I<MUST NOT> call any function that might "block" the
853current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 1187current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
854anything that calls those. Everything else, including calling C<ready>, 1188anything that calls those. Everything else, including calling C<ready>,
855works. 1189works.
865ithreads (for example, that memory or files would be shared), showing his 1199ithreads (for example, that memory or files would be shared), showing his
866lack of understanding of this area - if it is hard to understand for Chip, 1200lack of understanding of this area - if it is hard to understand for Chip,
867it is probably not obvious to everybody). 1201it is probably not obvious to everybody).
868 1202
869What follows is an ultra-condensed version of my talk about threads in 1203What follows is an ultra-condensed version of my talk about threads in
870scripting languages given onthe perl workshop 2009: 1204scripting languages given on the perl workshop 2009:
871 1205
872The so-called "ithreads" were originally implemented for two reasons: 1206The so-called "ithreads" were originally implemented for two reasons:
873first, to (badly) emulate unix processes on native win32 perls, and 1207first, to (badly) emulate unix processes on native win32 perls, and
874secondly, to replace the older, real thread model ("5.005-threads"). 1208secondly, to replace the older, real thread model ("5.005-threads").
875 1209

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines