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

Comparing Coro/Coro.pm (file contents):
Revision 1.251 by root, Mon Mar 16 22:22:12 2009 UTC vs.
Revision 1.267 by root, Wed Aug 26 08:14:09 2009 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
80 80
81our $idle; # idle handler 81our $idle; # idle handler
82our $main; # main coro 82our $main; # main coro
83our $current; # current coro 83our $current; # current coro
84 84
85our $VERSION = 5.131; 85our $VERSION = 5.17;
86 86
87our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub); 87our @EXPORT = qw(async async_pool cede schedule terminate current unblock_sub);
88our %EXPORT_TAGS = ( 88our %EXPORT_TAGS = (
89 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)],
90); 90);
206Example: Create a new coro that just prints its arguments. 206Example: Create a new coro that just prints its arguments.
207 207
208 async { 208 async {
209 print "@_\n"; 209 print "@_\n";
210 } 1,2,3,4; 210 } 1,2,3,4;
211
212=cut
213
214sub async(&@) {
215 my $coro = new Coro @_;
216 $coro->ready;
217 $coro
218}
219 211
220=item async_pool { ... } [@args...] 212=item async_pool { ... } [@args...]
221 213
222Similar to C<async>, but uses a coro pool, so you should not call 214Similar 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 215terminate or join on it (although you are allowed to), and you get a
338 330
339These functions implement the same concept as C<dynamic-wind> in scheme 331These 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 332does, and are useful when you want to localise some resource to a specific
341coro. 333coro.
342 334
343They slow down coro switching considerably for coros that use 335They slow down thread switching considerably for coros that use them
344them (But coro switching is still reasonably fast if the handlers are 336(about 40% for a BLOCK with a single assignment, so thread switching is
345fast). 337still reasonably fast if the handlers are fast).
346 338
347These functions are best understood by an example: The following function 339These functions are best understood by an example: The following function
348will change the current timezone to "Antarctica/South_Pole", which 340will 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>, 341requires 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 342which remember/change the current timezone and restore the previous
351value, respectively, the timezone is only changes for the coro that 343value, respectively, the timezone is only changed for the coro that
352installed those handlers. 344installed those handlers.
353 345
354 use POSIX qw(tzset); 346 use POSIX qw(tzset);
355 347
356 async { 348 async {
373 }; 365 };
374 366
375This can be used to localise about any resource (locale, uid, current 367This can be used to localise about any resource (locale, uid, current
376working directory etc.) to a block, despite the existance of other 368working directory etc.) to a block, despite the existance of other
377coros. 369coros.
370
371Another interesting example implements time-sliced multitasking using
372interval timers (this could obviously be optimised, but does the job):
373
374 # "timeslice" the given block
375 sub timeslice(&) {
376 use Time::HiRes ();
377
378 Coro::on_enter {
379 # on entering the thread, we set an VTALRM handler to cede
380 $SIG{VTALRM} = sub { cede };
381 # and then start the interval timer
382 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0.01, 0.01;
383 };
384 Coro::on_leave {
385 # on leaving the thread, we stop the interval timer again
386 Time::HiRes::setitimer &Time::HiRes::ITIMER_VIRTUAL, 0, 0;
387 };
388
389 &{+shift};
390 }
391
392 # use like this:
393 timeslice {
394 # The following is an endless loop that would normally
395 # monopolise the process. Since it runs in a timesliced
396 # environment, it will regularly cede to other threads.
397 while () { }
398 };
399
378 400
379=item killall 401=item killall
380 402
381Kills/terminates/cancels all coros except the currently running one. 403Kills/terminates/cancels all coros except the currently running one.
382 404
721Wait for the specified rouse callback (or the last one that was created in 743Wait for the specified rouse callback (or the last one that was created in
722this coro). 744this coro).
723 745
724As soon as the callback is invoked (or when the callback was invoked 746As soon as the callback is invoked (or when the callback was invoked
725before C<rouse_wait>), it will return the arguments originally passed to 747before C<rouse_wait>), it will return the arguments originally passed to
726the rouse callback. 748the rouse callback. In scalar context, that means you get the I<last>
749argument, just as if C<rouse_wait> had a C<return ($a1, $a2, $a3...)>
750statement at the end.
727 751
728See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example. 752See the section B<HOW TO WAIT FOR A CALLBACK> for an actual usage example.
729 753
730=back 754=back
731 755
830works. 854works.
831 855
832=back 856=back
833 857
834 858
859=head1 WINDOWS PROCESS EMULATION
860
861A great many people seem to be confused about ithreads (for example, Chip
862Salzenberg called me unintelligent, incapable, stupid and gullible,
863while in the same mail making rather confused statements about perl
864ithreads (for example, that memory or files would be shared), showing his
865lack of understanding of this area - if it is hard to understand for Chip,
866it is probably not obvious to everybody).
867
868What follows is an ultra-condensed version of my talk about threads in
869scripting languages given onthe perl workshop 2009:
870
871The so-called "ithreads" were originally implemented for two reasons:
872first, to (badly) emulate unix processes on native win32 perls, and
873secondly, to replace the older, real thread model ("5.005-threads").
874
875It does that by using threads instead of OS processes. The difference
876between processes and threads is that threads share memory (and other
877state, such as files) between threads within a single process, while
878processes do not share anything (at least not semantically). That
879means that modifications done by one thread are seen by others, while
880modifications by one process are not seen by other processes.
881
882The "ithreads" work exactly like that: when creating a new ithreads
883process, all state is copied (memory is copied physically, files and code
884is copied logically). Afterwards, it isolates all modifications. On UNIX,
885the same behaviour can be achieved by using operating system processes,
886except that UNIX typically uses hardware built into the system to do this
887efficiently, while the windows process emulation emulates this hardware in
888software (rather efficiently, but of course it is still much slower than
889dedicated hardware).
890
891As mentioned before, loading code, modifying code, modifying data
892structures and so on is only visible in the ithreads process doing the
893modification, not in other ithread processes within the same OS process.
894
895This is why "ithreads" do not implement threads for perl at all, only
896processes. What makes it so bad is that on non-windows platforms, you can
897actually take advantage of custom hardware for this purpose (as evidenced
898by the forks module, which gives you the (i-) threads API, just much
899faster).
900
901Sharing data is in the i-threads model is done by transfering data
902structures between threads using copying semantics, which is very slow -
903shared data simply does not exist. Benchmarks using i-threads which are
904communication-intensive show extremely bad behaviour with i-threads (in
905fact, so bad that Coro, which cannot take direct advantage of multiple
906CPUs, is often orders of magnitude faster because it shares data using
907real threads, refer to my talk for details).
908
909As summary, i-threads *use* threads to implement processes, while
910the compatible forks module *uses* processes to emulate, uhm,
911processes. I-threads slow down every perl program when enabled, and
912outside of windows, serve no (or little) practical purpose, but
913disadvantages every single-threaded Perl program.
914
915This is the reason that I try to avoid the name "ithreads", as it is
916misleading as it implies that it implements some kind of thread model for
917perl, and prefer the name "windows process emulation", which describes the
918actual use and behaviour of it much better.
919
835=head1 SEE ALSO 920=head1 SEE ALSO
836 921
837Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>. 922Event-Loop integration: L<Coro::AnyEvent>, L<Coro::EV>, L<Coro::Event>.
838 923
839Debugging: L<Coro::Debug>. 924Debugging: L<Coro::Debug>.

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines