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.249 by root, Mon Dec 15 15:21:25 2008 UTC vs.
Revision 1.280 by root, Thu Nov 11 15:07:16 2010 UTC

40points in your program, so locking and parallel access are rarely an 40points in your program, so locking and parallel access are rarely an
41issue, making thread programming much safer and easier than using other 41issue, making thread programming much safer and easier than using other
42thread models. 42thread models.
43 43
44Unlike the so-called "Perl threads" (which are not actually real threads 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 45but only the windows process emulation (see section of same name for more
46as processes), Coro provides a full shared address space, which makes 46details) ported to unix, and as such act as processes), Coro provides
47communication between threads very easy. And Coro's threads are fast, 47a full shared address space, which makes communication between threads
48too: disabling the Windows process emulation code in your perl and using 48very easy. And Coro's threads are fast, too: disabling the Windows
49Coro can easily result in a two to four times speed increase for your 49process emulation code in your perl and using Coro can easily result in
50programs. A parallel matrix multiplication benchmark runs over 300 times 50a two to four times speed increase for your programs. A parallel matrix
51faster on a single core than perl's pseudo-threads on a quad core using 51multiplication benchmark runs over 300 times faster on a single core than
52all four cores. 52perl's pseudo-threads on a quad core using 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
67 67
68=cut 68=cut
69 69
70package Coro; 70package Coro;
71 71
72use strict qw(vars subs); 72use common::sense;
73no warnings "uninitialized"; 73
74use Carp ();
74 75
75use Guard (); 76use Guard ();
76 77
77use Coro::State; 78use Coro::State;
78 79
80 81
81our $idle; # idle handler 82our $idle; # idle handler
82our $main; # main coro 83our $main; # main coro
83our $current; # current coro 84our $current; # current coro
84 85
85our $VERSION = 5.13; 86our $VERSION = 5.25;
86 87
87our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 88our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub rouse_cb rouse_wait);
88our %EXPORT_TAGS = ( 89our %EXPORT_TAGS = (
89 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)], 90 prio => [qw(PRIO_MAX PRIO_HIGH PRIO_NORMAL PRIO_LOW PRIO_IDLE PRIO_MIN)],
90); 91);
91our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready)); 92our @EXPORT_OK = (@{$EXPORT_TAGS{prio}}, qw(nready));
92 93
123 124
124This variable is mainly useful to integrate Coro into event loops. It is 125This 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 126usually better to rely on L<Coro::AnyEvent> or L<Coro::EV>, as this is
126pretty low-level functionality. 127pretty low-level functionality.
127 128
128This variable stores either a Coro object or a callback. 129This variable stores a Coro object that is put into the ready queue when
130there are no other ready threads (without invoking any ready hooks).
129 131
130If it is a callback, the it is called whenever the scheduler finds no 132The default implementation dies with "FATAL: deadlock detected.", followed
131ready coros to run. The default implementation prints "FATAL: 133by a thread listing, because the program has no other way to continue.
132deadlock detected" and exits, because the program has no other way to
133continue.
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 134
139This hook is overwritten by modules such as C<Coro::EV> and 135This hook is overwritten by modules such as C<Coro::EV> and
140C<Coro::AnyEvent> to wait on an external event that hopefully wake up a 136C<Coro::AnyEvent> to wait on an external event that hopefully wake up a
141coro so the scheduler can run it. 137coro so the scheduler can run it.
142 138
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 139See L<Coro::EV> or L<Coro::AnyEvent> for examples of using this technique.
150technique.
151 140
152Please note that if your callback recursively invokes perl (e.g. for event
153handlers), then it must be prepared to be called recursively itself.
154
155=cut 141=cut
156 142
157$idle = sub { 143# ||= because other modules could have provided their own by now
158 require Carp; 144$idle ||= new Coro sub {
159 Carp::croak ("FATAL: deadlock detected"); 145 require Coro::Debug;
146 die "FATAL: deadlock detected.\n"
147 . Coro::Debug::ps_listing ();
160}; 148};
161 149
162# this coro is necessary because a coro 150# this coro is necessary because a coro
163# cannot destroy itself. 151# cannot destroy itself.
164our @destroy; 152our @destroy;
206Example: Create a new coro that just prints its arguments. 194Example: Create a new coro that just prints its arguments.
207 195
208 async { 196 async {
209 print "@_\n"; 197 print "@_\n";
210 } 1,2,3,4; 198 } 1,2,3,4;
211
212=cut
213
214sub async(&@) {
215 my $coro = new Coro @_;
216 $coro->ready;
217 $coro
218}
219 199
220=item async_pool { ... } [@args...] 200=item async_pool { ... } [@args...]
221 201
222Similar to C<async>, but uses a coro pool, so you should not call 202Similar 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 203terminate or join on it (although you are allowed to), and you get a
280=item schedule 260=item schedule
281 261
282Calls the scheduler. The scheduler will find the next coro that is 262Calls 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 263to 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 264to 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 265in its ready queue. If there is no coro ready, it will call the
286C<$Coro::idle> hook. 266C<$Coro::idle> hook.
287 267
288Please note that the current coro will I<not> be put into the ready 268Please note that the current coro will I<not> be put into the ready
289queue, so calling this function usually means you will never be called 269queue, so calling this function usually means you will never be called
290again unless something else (e.g. an event handler) calls C<< ->ready >>, 270again unless something else (e.g. an event handler) calls C<< ->ready >>,
338 318
339These functions implement the same concept as C<dynamic-wind> in scheme 319These 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 320does, and are useful when you want to localise some resource to a specific
341coro. 321coro.
342 322
343They slow down coro switching considerably for coros that use 323They slow down thread switching considerably for coros that use them
344them (But coro switching is still reasonably fast if the handlers are 324(about 40% for a BLOCK with a single assignment, so thread switching is
345fast). 325still reasonably fast if the handlers are fast).
346 326
347These functions are best understood by an example: The following function 327These functions are best understood by an example: The following function
348will change the current timezone to "Antarctica/South_Pole", which 328will 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>, 329requires 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 330which remember/change the current timezone and restore the previous
351value, respectively, the timezone is only changes for the coro that 331value, respectively, the timezone is only changed for the coro that
352installed those handlers. 332installed those handlers.
353 333
354 use POSIX qw(tzset); 334 use POSIX qw(tzset);
355 335
356 async { 336 async {
373 }; 353 };
374 354
375This can be used to localise about any resource (locale, uid, current 355This can be used to localise about any resource (locale, uid, current
376working directory etc.) to a block, despite the existance of other 356working directory etc.) to a block, despite the existance of other
377coros. 357coros.
358
359Another interesting example implements time-sliced multitasking using
360interval timers (this could obviously be optimised, but does the job):
361
362 # "timeslice" the given block
363 sub timeslice(&) {
364 use Time::HiRes ();
365
366 Coro::on_enter {
367 # on entering the thread, we set an VTALRM handler to cede
368 $SIG{VTALRM} = sub { cede };
369 # and then start the interval timer
370 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0.01, 0.01;
371 };
372 Coro::on_leave {
373 # on leaving the thread, we stop the interval timer again
374 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0, 0;
375 };
376
377 &{+shift};
378 }
379
380 # use like this:
381 timeslice {
382 # The following is an endless loop that would normally
383 # monopolise the process. Since it runs in a timesliced
384 # environment, it will regularly cede to other threads.
385 while () { }
386 };
387
378 388
379=item killall 389=item killall
380 390
381Kills/terminates/cancels all coros except the currently running one. 391Kills/terminates/cancels all coros except the currently running one.
382 392
426the ready queue, do nothing and return false. 436the ready queue, do nothing and return false.
427 437
428This ensures that the scheduler will resume this coro automatically 438This ensures that the scheduler will resume this coro automatically
429once all the coro of higher priority and all coro of the same 439once all the coro of higher priority and all coro of the same
430priority that were put into the ready queue earlier have been resumed. 440priority that were put into the ready queue earlier have been resumed.
441
442=item $coro->suspend
443
444Suspends the specified coro. A suspended coro works just like any other
445coro, except that the scheduler will not select a suspended coro for
446execution.
447
448Suspending a coro can be useful when you want to keep the coro from
449running, but you don't want to destroy it, or when you want to temporarily
450freeze a coro (e.g. for debugging) to resume it later.
451
452A scenario for the former would be to suspend all (other) coros after a
453fork and keep them alive, so their destructors aren't called, but new
454coros can be created.
455
456=item $coro->resume
457
458If the specified coro was suspended, it will be resumed. Note that when
459the coro was in the ready queue when it was suspended, it might have been
460unreadied by the scheduler, so an activation might have been lost.
461
462To avoid this, it is best to put a suspended coro into the ready queue
463unconditionally, as every synchronisation mechanism must protect itself
464against spurious wakeups, and the one in the Coro family certainly do
465that.
431 466
432=item $is_ready = $coro->is_ready 467=item $is_ready = $coro->is_ready
433 468
434Returns true iff the Coro object is in the ready queue. Unless the Coro 469Returns true iff the Coro object is in the ready queue. Unless the Coro
435object gets destroyed, it will eventually be scheduled by the scheduler. 470object gets destroyed, it will eventually be scheduled by the scheduler.
578Sets (or gets in case the argument is missing) the description for this 613Sets (or gets in case the argument is missing) the description for this
579coro. This is just a free-form string you can associate with a 614coro. This is just a free-form string you can associate with a
580coro. 615coro.
581 616
582This method simply sets the C<< $coro->{desc} >> member to the given 617This method simply sets the C<< $coro->{desc} >> member to the given
583string. You can modify this member directly if you wish. 618string. You can modify this member directly if you wish, and in fact, this
619is often preferred to indicate major processing states that cna then be
620seen for example in a L<Coro::Debug> session:
621
622 sub my_long_function {
623 local $Coro::current->{desc} = "now in my_long_function";
624 ...
625 $Coro::current->{desc} = "my_long_function: phase 1";
626 ...
627 $Coro::current->{desc} = "my_long_function: phase 2";
628 ...
629 }
584 630
585=cut 631=cut
586 632
587sub desc { 633sub desc {
588 my $old = $_[0]{desc}; 634 my $old = $_[0]{desc};
630The reason this function exists is that many event libraries (such as the 676The reason this function exists is that many event libraries (such as the
631venerable L<Event|Event> module) are not thread-safe (a weaker form 677venerable L<Event|Event> module) are not thread-safe (a weaker form
632of reentrancy). This means you must not block within event callbacks, 678of reentrancy). This means you must not block within event callbacks,
633otherwise you might suffer from crashes or worse. The only event library 679otherwise 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>. 680currently known that is safe to use without C<unblock_sub> is L<EV>.
681
682Coro will try to catch you when you block in the event loop
683("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
684only works when you do not run your own event loop.
635 685
636This function allows your callbacks to block by executing them in another 686This function allows your callbacks to block by executing them in another
637coro where it is safe to block. One example where blocking is handy 687coro where it is safe to block. One example where blocking is handy
638is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 688is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
639disk, for example. 689disk, for example.
681 unshift @unblock_queue, [$cb, @_]; 731 unshift @unblock_queue, [$cb, @_];
682 $unblock_scheduler->ready; 732 $unblock_scheduler->ready;
683 } 733 }
684} 734}
685 735
686=item $cb = Coro::rouse_cb 736=item $cb = rouse_cb
687 737
688Create and return a "rouse callback". That's a code reference that, 738Create and return a "rouse callback". That's a code reference that,
689when called, will remember a copy of its arguments and notify the owner 739when called, will remember a copy of its arguments and notify the owner
690coro of the callback. 740coro of the callback.
691 741
692See the next function. 742See the next function.
693 743
694=item @args = Coro::rouse_wait [$cb] 744=item @args = rouse_wait [$cb]
695 745
696Wait for the specified rouse callback (or the last one that was created in 746Wait for the specified rouse callback (or the last one that was created in
697this coro). 747this coro).
698 748
699As soon as the callback is invoked (or when the callback was invoked 749As soon as the callback is invoked (or when the callback was invoked
700before C<rouse_wait>), it will return the arguments originally passed to 750before C<rouse_wait>), it will return the arguments originally passed to
701the rouse callback. 751the rouse callback. In scalar context, that means you get the I<last>
752argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
753statement at the end.
702 754
703See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. 755See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
704 756
705=back 757=back
706 758
794the windows process emulation enabled under unix roughly halves perl 846the windows process emulation enabled under unix roughly halves perl
795performance, even when not used. 847performance, even when not used.
796 848
797=item coro switching is not signal safe 849=item coro switching is not signal safe
798 850
799You must not switch to another coro from within a signal handler 851You must not switch to another coro from within a signal handler (only
800(only relevant with %SIG - most event libraries provide safe signals). 852relevant with %SIG - most event libraries provide safe signals), I<unless>
853you are sure you are not interrupting a Coro function.
801 854
802That means you I<MUST NOT> call any function that might "block" the 855That means you I<MUST NOT> call any function that might "block" the
803current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 856current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
804anything that calls those. Everything else, including calling C<ready>, 857anything that calls those. Everything else, including calling C<ready>,
805works. 858works.
806 859
807=back 860=back
808 861
809 862
863=head1 WINDOWS PROCESS EMULATION
864
865A great many people seem to be confused about ithreads (for example, Chip
866Salzenberg called me unintelligent, incapable, stupid and gullible,
867while in the same mail making rather confused statements about perl
868ithreads (for example, that memory or files would be shared), showing his
869lack of understanding of this area - if it is hard to understand for Chip,
870it is probably not obvious to everybody).
871
872What follows is an ultra-condensed version of my talk about threads in
873scripting languages given onthe perl workshop 2009:
874
875The so-called "ithreads" were originally implemented for two reasons:
876first, to (badly) emulate unix processes on native win32 perls, and
877secondly, to replace the older, real thread model ("5.005-threads").
878
879It does that by using threads instead of OS processes. The difference
880between processes and threads is that threads share memory (and other
881state, such as files) between threads within a single process, while
882processes do not share anything (at least not semantically). That
883means that modifications done by one thread are seen by others, while
884modifications by one process are not seen by other processes.
885
886The "ithreads" work exactly like that: when creating a new ithreads
887process, all state is copied (memory is copied physically, files and code
888is copied logically). Afterwards, it isolates all modifications. On UNIX,
889the same behaviour can be achieved by using operating system processes,
890except that UNIX typically uses hardware built into the system to do this
891efficiently, while the windows process emulation emulates this hardware in
892software (rather efficiently, but of course it is still much slower than
893dedicated hardware).
894
895As mentioned before, loading code, modifying code, modifying data
896structures and so on is only visible in the ithreads process doing the
897modification, not in other ithread processes within the same OS process.
898
899This is why "ithreads" do not implement threads for perl at all, only
900processes. What makes it so bad is that on non-windows platforms, you can
901actually take advantage of custom hardware for this purpose (as evidenced
902by the forks module, which gives you the (i-) threads API, just much
903faster).
904
905Sharing data is in the i-threads model is done by transfering data
906structures between threads using copying semantics, which is very slow -
907shared data simply does not exist. Benchmarks using i-threads which are
908communication-intensive show extremely bad behaviour with i-threads (in
909fact, so bad that Coro, which cannot take direct advantage of multiple
910CPUs, is often orders of magnitude faster because it shares data using
911real threads, refer to my talk for details).
912
913As summary, i-threads *use* threads to implement processes, while
914the compatible forks module *uses* processes to emulate, uhm,
915processes. I-threads slow down every perl program when enabled, and
916outside of windows, serve no (or little) practical purpose, but
917disadvantages every single-threaded Perl program.
918
919This is the reason that I try to avoid the name "ithreads", as it is
920misleading as it implies that it implements some kind of thread model for
921perl, and prefer the name "windows process emulation", which describes the
922actual use and behaviour of it much better.
923
810=head1 SEE ALSO 924=head1 SEE ALSO
811 925
812Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 926Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
813 927
814Debugging: L<Coro::Debug>. 928Debugging: L<Coro::Debug>.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines