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.264 by root, Thu Aug 13 02:35:41 2009 UTC vs.
Revision 1.285 by root, Thu Feb 17 01:32:18 2011 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.162; 86our $VERSION = 5.26;
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 wakes 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;
272=item schedule 260=item schedule
273 261
274Calls the scheduler. The scheduler will find the next coro that is 262Calls the scheduler. The scheduler will find the next coro that is
275to 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
276to 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
277in 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
278C<$Coro::idle> hook. 266C<$Coro::idle> hook.
279 267
280Please 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
281queue, so calling this function usually means you will never be called 269queue, so calling this function usually means you will never be called
282again unless something else (e.g. an event handler) calls C<< ->ready >>, 270again unless something else (e.g. an event handler) calls C<< ->ready >>,
579 wantarray ? @{$self->{_status}} : $self->{_status}[0]; 567 wantarray ? @{$self->{_status}} : $self->{_status}[0];
580} 568}
581 569
582=item $coro->on_destroy (\&cb) 570=item $coro->on_destroy (\&cb)
583 571
584Registers a callback that is called when this coro gets destroyed, 572Registers a callback that is called when this coro thread gets destroyed,
585but before it is joined. The callback gets passed the terminate arguments, 573but before it is joined. The callback gets passed the terminate arguments,
586if any, and I<must not> die, under any circumstances. 574if any, and I<must not> die, under any circumstances.
587 575
576There can be any number of C<on_destroy> callbacks per coro.
577
588=cut 578=cut
589 579
590sub on_destroy { 580sub on_destroy {
591 my ($self, $cb) = @_; 581 my ($self, $cb) = @_;
592 582
594} 584}
595 585
596=item $oldprio = $coro->prio ($newprio) 586=item $oldprio = $coro->prio ($newprio)
597 587
598Sets (or gets, if the argument is missing) the priority of the 588Sets (or gets, if the argument is missing) the priority of the
599coro. Higher priority coro get run before lower priority 589coro thread. Higher priority coro get run before lower priority
600coro. Priorities are small signed integers (currently -4 .. +3), 590coros. Priorities are small signed integers (currently -4 .. +3),
601that you can refer to using PRIO_xxx constants (use the import tag :prio 591that you can refer to using PRIO_xxx constants (use the import tag :prio
602to get then): 592to get then):
603 593
604 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN 594 PRIO_MAX > PRIO_HIGH > PRIO_NORMAL > PRIO_LOW > PRIO_IDLE > PRIO_MIN
605 3 > 1 > 0 > -1 > -3 > -4 595 3 > 1 > 0 > -1 > -3 > -4
606 596
607 # set priority to HIGH 597 # set priority to HIGH
608 current->prio (PRIO_HIGH); 598 current->prio (PRIO_HIGH);
609 599
610The idle coro ($Coro::idle) always has a lower priority than any 600The idle coro thread ($Coro::idle) always has a lower priority than any
611existing coro. 601existing coro.
612 602
613Changing the priority of the current coro will take effect immediately, 603Changing the priority of the current coro will take effect immediately,
614but changing the priority of coro in the ready queue (but not 604but changing the priority of a coro in the ready queue (but not running)
615running) will only take effect after the next schedule (of that 605will only take effect after the next schedule (of that coro). This is a
616coro). This is a bug that will be fixed in some future version. 606bug that will be fixed in some future version.
617 607
618=item $newprio = $coro->nice ($change) 608=item $newprio = $coro->nice ($change)
619 609
620Similar to C<prio>, but subtract the given value from the priority (i.e. 610Similar to C<prio>, but subtract the given value from the priority (i.e.
621higher values mean lower priority, just as in unix). 611higher values mean lower priority, just as in UNIX's nice command).
622 612
623=item $olddesc = $coro->desc ($newdesc) 613=item $olddesc = $coro->desc ($newdesc)
624 614
625Sets (or gets in case the argument is missing) the description for this 615Sets (or gets in case the argument is missing) the description for this
626coro. This is just a free-form string you can associate with a 616coro thread. This is just a free-form string you can associate with a
627coro. 617coro.
628 618
629This method simply sets the C<< $coro->{desc} >> member to the given 619This method simply sets the C<< $coro->{desc} >> member to the given
630string. You can modify this member directly if you wish. 620string. You can modify this member directly if you wish, and in fact, this
621is often preferred to indicate major processing states that cna then be
622seen for example in a L<Coro::Debug> session:
623
624 sub my_long_function {
625 local $Coro::current->{desc} = "now in my_long_function";
626 ...
627 $Coro::current->{desc} = "my_long_function: phase 1";
628 ...
629 $Coro::current->{desc} = "my_long_function: phase 2";
630 ...
631 }
631 632
632=cut 633=cut
633 634
634sub desc { 635sub desc {
635 my $old = $_[0]{desc}; 636 my $old = $_[0]{desc};
672returning a new coderef. Unblocking means that calling the new coderef 673returning a new coderef. Unblocking means that calling the new coderef
673will return immediately without blocking, returning nothing, while the 674will return immediately without blocking, returning nothing, while the
674original code ref will be called (with parameters) from within another 675original code ref will be called (with parameters) from within another
675coro. 676coro.
676 677
677The reason this function exists is that many event libraries (such as the 678The reason this function exists is that many event libraries (such as
678venerable L<Event|Event> module) are not thread-safe (a weaker form 679the venerable L<Event|Event> module) are not thread-safe (a weaker form
679of reentrancy). This means you must not block within event callbacks, 680of reentrancy). This means you must not block within event callbacks,
680otherwise you might suffer from crashes or worse. The only event library 681otherwise you might suffer from crashes or worse. The only event library
681currently known that is safe to use without C<unblock_sub> is L<EV>. 682currently known that is safe to use without C<unblock_sub> is L<EV> (but
683you might still run into deadlocks if all event loops are blocked).
684
685Coro will try to catch you when you block in the event loop
686("FATAL:$Coro::IDLE blocked itself"), but this is just best effort and
687only works when you do not run your own event loop.
682 688
683This function allows your callbacks to block by executing them in another 689This function allows your callbacks to block by executing them in another
684coro where it is safe to block. One example where blocking is handy 690coro where it is safe to block. One example where blocking is handy
685is when you use the L<Coro::AIO|Coro::AIO> functions to save results to 691is when you use the L<Coro::AIO|Coro::AIO> functions to save results to
686disk, for example. 692disk, for example.
728 unshift @unblock_queue, [$cb, @_]; 734 unshift @unblock_queue, [$cb, @_];
729 $unblock_scheduler->ready; 735 $unblock_scheduler->ready;
730 } 736 }
731} 737}
732 738
733=item $cb = Coro::rouse_cb 739=item $cb = rouse_cb
734 740
735Create and return a "rouse callback". That's a code reference that, 741Create and return a "rouse callback". That's a code reference that,
736when called, will remember a copy of its arguments and notify the owner 742when called, will remember a copy of its arguments and notify the owner
737coro of the callback. 743coro of the callback.
738 744
739See the next function. 745See the next function.
740 746
741=item @args = Coro::rouse_wait [$cb] 747=item @args = rouse_wait [$cb]
742 748
743Wait for the specified rouse callback (or the last one that was created in 749Wait for the specified rouse callback (or the last one that was created in
744this coro). 750this coro).
745 751
746As soon as the callback is invoked (or when the callback was invoked 752As soon as the callback is invoked (or when the callback was invoked
752See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. 758See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
753 759
754=back 760=back
755 761
756=cut 762=cut
763
764for my $module (qw(Channel RWLock Semaphore SemaphoreSet Signal Specific)) {
765 my $old = defined &{"Coro::$module\::new"} && \&{"Coro::$module\::new"};
766
767 *{"Coro::$module\::new"} = sub {
768 require "Coro/$module.pm";
769
770 # some modules have their new predefined in State.xs, some don't
771 *{"Coro::$module\::new"} = $old
772 if $old;
773
774 goto &{"Coro::$module\::new"};
775 };
776}
757 777
7581; 7781;
759 779
760=head1 HOW TO WAIT FOR A CALLBACK 780=head1 HOW TO WAIT FOR A CALLBACK
761 781
843the windows process emulation enabled under unix roughly halves perl 863the windows process emulation enabled under unix roughly halves perl
844performance, even when not used. 864performance, even when not used.
845 865
846=item coro switching is not signal safe 866=item coro switching is not signal safe
847 867
848You must not switch to another coro from within a signal handler 868You must not switch to another coro from within a signal handler (only
849(only relevant with %SIG - most event libraries provide safe signals). 869relevant with %SIG - most event libraries provide safe signals), I<unless>
870you are sure you are not interrupting a Coro function.
850 871
851That means you I<MUST NOT> call any function that might "block" the 872That means you I<MUST NOT> call any function that might "block" the
852current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or 873current coro - C<cede>, C<schedule> C<< Coro::Semaphore->down >> or
853anything that calls those. Everything else, including calling C<ready>, 874anything that calls those. Everything else, including calling C<ready>,
854works. 875works.
855 876
856=back 877=back
857 878
858 879
880=head1 WINDOWS PROCESS EMULATION
881
882A great many people seem to be confused about ithreads (for example, Chip
883Salzenberg called me unintelligent, incapable, stupid and gullible,
884while in the same mail making rather confused statements about perl
885ithreads (for example, that memory or files would be shared), showing his
886lack of understanding of this area - if it is hard to understand for Chip,
887it is probably not obvious to everybody).
888
889What follows is an ultra-condensed version of my talk about threads in
890scripting languages given on the perl workshop 2009:
891
892The so-called "ithreads" were originally implemented for two reasons:
893first, to (badly) emulate unix processes on native win32 perls, and
894secondly, to replace the older, real thread model ("5.005-threads").
895
896It does that by using threads instead of OS processes. The difference
897between processes and threads is that threads share memory (and other
898state, such as files) between threads within a single process, while
899processes do not share anything (at least not semantically). That
900means that modifications done by one thread are seen by others, while
901modifications by one process are not seen by other processes.
902
903The "ithreads" work exactly like that: when creating a new ithreads
904process, all state is copied (memory is copied physically, files and code
905is copied logically). Afterwards, it isolates all modifications. On UNIX,
906the same behaviour can be achieved by using operating system processes,
907except that UNIX typically uses hardware built into the system to do this
908efficiently, while the windows process emulation emulates this hardware in
909software (rather efficiently, but of course it is still much slower than
910dedicated hardware).
911
912As mentioned before, loading code, modifying code, modifying data
913structures and so on is only visible in the ithreads process doing the
914modification, not in other ithread processes within the same OS process.
915
916This is why "ithreads" do not implement threads for perl at all, only
917processes. What makes it so bad is that on non-windows platforms, you can
918actually take advantage of custom hardware for this purpose (as evidenced
919by the forks module, which gives you the (i-) threads API, just much
920faster).
921
922Sharing data is in the i-threads model is done by transfering data
923structures between threads using copying semantics, which is very slow -
924shared data simply does not exist. Benchmarks using i-threads which are
925communication-intensive show extremely bad behaviour with i-threads (in
926fact, so bad that Coro, which cannot take direct advantage of multiple
927CPUs, is often orders of magnitude faster because it shares data using
928real threads, refer to my talk for details).
929
930As summary, i-threads *use* threads to implement processes, while
931the compatible forks module *uses* processes to emulate, uhm,
932processes. I-threads slow down every perl program when enabled, and
933outside of windows, serve no (or little) practical purpose, but
934disadvantages every single-threaded Perl program.
935
936This is the reason that I try to avoid the name "ithreads", as it is
937misleading as it implies that it implements some kind of thread model for
938perl, and prefer the name "windows process emulation", which describes the
939actual use and behaviour of it much better.
940
859=head1 SEE ALSO 941=head1 SEE ALSO
860 942
861Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 943Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
862 944
863Debugging: L<Coro::Debug>. 945Debugging: L<Coro::Debug>.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines