Initial commit of OpenSPARC T2 design and verification files.

[OpenSPARC-T2-DV] / tools / perl-5.8.0 / man / man1 / perlthrtut.1

.\" Automatically generated by Pod::Man v1.34, Pod::Parser v1.13
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sh \" Subsection heading
.br
.if t .Sp
.ne 5
.PP
\fB\\$1\fR
.PP
..
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  | will give a
.\" real vertical bar.  \*(C+ will give a nicer C++.  Capital omega is used to
.\" do unbreakable dashes and therefore won't be available.  \*(C` and \*(C'
.\" expand to `' in nroff, nothing in troff, for use with C<>.
.tr \(*W-|\(bv\*(Tr
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
'br\}
.\"
.\" If the F register is turned on, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.if \nF \{\
.    de IX
.    tm Index:\\$1\t\\n%\t"\\$2"
..
.    nr % 0
.    rr F
.\}
.\"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.hy 0
.if n .na
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "PERLTHRTUT 1"
.TH PERLTHRTUT 1 "2002-06-08" "perl v5.8.0" "Perl Programmers Reference Guide"
.SH "NAME"
perlthrtut \- tutorial on threads in Perl
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
\&\fB\s-1NOTE\s0\fR: this tutorial describes the new Perl threading flavour
introduced in Perl 5.6.0 called interpreter threads, or \fBithreads\fR
for short.  In this model each thread runs in its own Perl interpreter,
and any data sharing between threads must be explicit.
.PP
There is another older Perl threading flavour called the 5.005 model,
unsurprisingly for 5.005 versions of Perl.  The old model is known to
have problems, deprecated, and will probably be removed around release
5.10. You are strongly encouraged to migrate any existing 5.005
threads code to the new model as soon as possible.
.PP
You can see which (or neither) threading flavour you have by
running \f(CW\*(C`perl \-V\*(C'\fR and looking at the \f(CW\*(C`Platform\*(C'\fR section.
If you have \f(CW\*(C`useithreads=define\*(C'\fR you have ithreads, if you
have \f(CW\*(C`use5005threads=define\*(C'\fR you have 5.005 threads.
If you have neither, you don't have any thread support built in.
If you have both, you are in trouble.
.PP
The user-level interface to the 5.005 threads was via the Threads
class, while ithreads uses the threads class. Note the change in case.
.SH "Status"
.IX Header "Status"
The ithreads code has been available since Perl 5.6.0, and is considered
stable. The user-level interface to ithreads (the threads classes)
appeared in the 5.8.0 release, and as of this time is considered stable
although it should be treated with caution as with all new features.
.SH "What Is A Thread Anyway?"
.IX Header "What Is A Thread Anyway?"
A thread is a flow of control through a program with a single
execution point.
.PP
Sounds an awful lot like a process, doesn't it? Well, it should.
Threads are one of the pieces of a process.  Every process has at least
one thread and, up until now, every process running Perl had only one
thread.  With 5.8, though, you can create extra threads.  We're going
to show you how, when, and why.
.SH "Threaded Program Models"
.IX Header "Threaded Program Models"
There are three basic ways that you can structure a threaded
program.  Which model you choose depends on what you need your program
to do.  For many non-trivial threaded programs you'll need to choose
different models for different pieces of your program.
.Sh "Boss/Worker"
.IX Subsection "Boss/Worker"
The boss/worker model usually has one `boss' thread and one or more
`worker' threads.  The boss thread gathers or generates tasks that need
to be done, then parcels those tasks out to the appropriate worker
thread.
.PP
This model is common in \s-1GUI\s0 and server programs, where a main thread
waits for some event and then passes that event to the appropriate
worker threads for processing.  Once the event has been passed on, the
boss thread goes back to waiting for another event.
.PP
The boss thread does relatively little work.  While tasks aren't
necessarily performed faster than with any other method, it tends to
have the best user-response times.
.Sh "Work Crew"
.IX Subsection "Work Crew"
In the work crew model, several threads are created that do
essentially the same thing to different pieces of data.  It closely
mirrors classical parallel processing and vector processors, where a
large array of processors do the exact same thing to many pieces of
data.
.PP
This model is particularly useful if the system running the program
will distribute multiple threads across different processors.  It can
also be useful in ray tracing or rendering engines, where the
individual threads can pass on interim results to give the user visual
feedback.
.Sh "Pipeline"
.IX Subsection "Pipeline"
The pipeline model divides up a task into a series of steps, and
passes the results of one step on to the thread processing the
next.  Each thread does one thing to each piece of data and passes the
results to the next thread in line.
.PP
This model makes the most sense if you have multiple processors so two
or more threads will be executing in parallel, though it can often
make sense in other contexts as well.  It tends to keep the individual
tasks small and simple, as well as allowing some parts of the pipeline
to block (on I/O or system calls, for example) while other parts keep
going.  If you're running different parts of the pipeline on different
processors you may also take advantage of the caches on each
processor.
.PP
This model is also handy for a form of recursive programming where,
rather than having a subroutine call itself, it instead creates
another thread.  Prime and Fibonacci generators both map well to this
form of the pipeline model. (A version of a prime number generator is
presented later on.)
.SH "Native threads"
.IX Header "Native threads"
There are several different ways to implement threads on a system.  How
threads are implemented depends both on the vendor and, in some cases,
the version of the operating system.  Often the first implementation
will be relatively simple, but later versions of the \s-1OS\s0 will be more
sophisticated.
.PP
While the information in this section is useful, it's not necessary,
so you can skip it if you don't feel up to it.
.PP
There are three basic categories of threads: user-mode threads, kernel
threads, and multiprocessor kernel threads.
.PP
User-mode threads are threads that live entirely within a program and
its libraries.  In this model, the \s-1OS\s0 knows nothing about threads.  As
far as it's concerned, your process is just a process.
.PP
This is the easiest way to implement threads, and the way most OSes
start.  The big disadvantage is that, since the \s-1OS\s0 knows nothing about
threads, if one thread blocks they all do.  Typical blocking activities
include most system calls, most I/O, and things like \fIsleep()\fR.
.PP
Kernel threads are the next step in thread evolution.  The \s-1OS\s0 knows
about kernel threads, and makes allowances for them.  The main
difference between a kernel thread and a user-mode thread is
blocking.  With kernel threads, things that block a single thread don't
block other threads.  This is not the case with user-mode threads,
where the kernel blocks at the process level and not the thread level.
.PP
This is a big step forward, and can give a threaded program quite a
performance boost over non-threaded programs.  Threads that block
performing I/O, for example, won't block threads that are doing other
things.  Each process still has only one thread running at once,
though, regardless of how many CPUs a system might have.
.PP
Since kernel threading can interrupt a thread at any time, they will
uncover some of the implicit locking assumptions you may make in your
program.  For example, something as simple as \f(CW\*(C`$a = $a + 2\*(C'\fR can behave
unpredictably with kernel threads if \f(CW$a\fR is visible to other
threads, as another thread may have changed \f(CW$a\fR between the time it
was fetched on the right hand side and the time the new value is
stored.
.PP
Multiprocessor kernel threads are the final step in thread
support.  With multiprocessor kernel threads on a machine with multiple
CPUs, the \s-1OS\s0 may schedule two or more threads to run simultaneously on
different CPUs.
.PP
This can give a serious performance boost to your threaded program,
since more than one thread will be executing at the same time.  As a
tradeoff, though, any of those nagging synchronization issues that
might not have shown with basic kernel threads will appear with a
vengeance.
.PP
In addition to the different levels of \s-1OS\s0 involvement in threads,
different OSes (and different thread implementations for a particular
\&\s-1OS\s0) allocate \s-1CPU\s0 cycles to threads in different ways.
.PP
Cooperative multitasking systems have running threads give up control
if one of two things happen.  If a thread calls a yield function, it
gives up control.  It also gives up control if the thread does
something that would cause it to block, such as perform I/O.  In a
cooperative multitasking implementation, one thread can starve all the
others for \s-1CPU\s0 time if it so chooses.
.PP
Preemptive multitasking systems interrupt threads at regular intervals
while the system decides which thread should run next.  In a preemptive
multitasking system, one thread usually won't monopolize the \s-1CPU\s0.
.PP
On some systems, there can be cooperative and preemptive threads
running simultaneously. (Threads running with realtime priorities
often behave cooperatively, for example, while threads running at
normal priorities behave preemptively.)
.SH "What kind of threads are Perl threads?"
.IX Header "What kind of threads are Perl threads?"
If you have experience with other thread implementations, you might
find that things aren't quite what you expect.  It's very important to
remember when dealing with Perl threads that Perl Threads Are Not X
Threads, for all values of X.  They aren't \s-1POSIX\s0 threads, or
DecThreads, or Java's Green threads, or Win32 threads.  There are
similarities, and the broad concepts are the same, but if you start
looking for implementation details you're going to be either
disappointed or confused.  Possibly both.
.PP
This is not to say that Perl threads are completely different from
everything that's ever come before\*(--they're not.  Perl's threading
model owes a lot to other thread models, especially \s-1POSIX\s0.  Just as
Perl is not C, though, Perl threads are not \s-1POSIX\s0 threads.  So if you
find yourself looking for mutexes, or thread priorities, it's time to
step back a bit and think about what you want to do and how Perl can
do it.
.PP
However it is important to remember that Perl threads cannot magically
do things unless your operating systems threads allows it. So if your
system blocks the entire process on \fIsleep()\fR, Perl usually will as well.
.PP
Perl Threads Are Different.
.SH "Thread-Safe Modules"
.IX Header "Thread-Safe Modules"
The addition of threads has changed Perl's internals
substantially. There are implications for people who write
modules with \s-1XS\s0 code or external libraries. However, since perl data is
not shared among threads by default, Perl modules stand a high chance of
being thread-safe or can be made thread-safe easily.  Modules that are not
tagged as thread-safe should be tested or code reviewed before being used
in production code.
.PP
Not all modules that you might use are thread\-safe, and you should
always assume a module is unsafe unless the documentation says
otherwise.  This includes modules that are distributed as part of the
core.  Threads are a new feature, and even some of the standard
modules aren't thread\-safe.
.PP
Even if a module is thread\-safe, it doesn't mean that the module is optimized
to work well with threads. A module could possibly be rewritten to utilize
the new features in threaded Perl to increase performance in a threaded
environment.
.PP
If you're using a module that's not thread-safe for some reason, you
can protect yourself by using it from one, and only one thread at all.
If you need multiple threads to access such a module, you can use semaphores and
lots of programming discipline to control access to it.  Semaphores
are covered in \*(L"Basic semaphores\*(R".
.PP
See also \*(L"Thread\-Safety of System Libraries\*(R".
.SH "Thread Basics"
.IX Header "Thread Basics"
The core threads module provides the basic functions you need to write
threaded programs.  In the following sections we'll cover the basics,
showing you what you need to do to create a threaded program.   After
that, we'll go over some of the features of the threads module that
make threaded programming easier.
.Sh "Basic Thread Support"
.IX Subsection "Basic Thread Support"
Thread support is a Perl compile-time option \- it's something that's
turned on or off when Perl is built at your site, rather than when
your programs are compiled. If your Perl wasn't compiled with thread
support enabled, then any attempt to use threads will fail.
.PP
Your programs can use the Config module to check whether threads are
enabled. If your program can't run without them, you can say something
like:
.PP
.Vb 1
\&    $Config{useithreads} or die "Recompile Perl with threads to run this program.";
.Ve
.PP
A possibly-threaded program using a possibly-threaded module might
have code like this:
.PP
.Vb 2
\&    use Config;
\&    use MyMod;
.Ve
.PP
.Vb 10
\&    BEGIN {
\&        if ($Config{useithreads}) {
\&            # We have threads
\&            require MyMod_threaded;
\&           import MyMod_threaded;
\&        } else {
\&           require MyMod_unthreaded;
\&           import MyMod_unthreaded;
\&        }
\&    }
.Ve
.PP
Since code that runs both with and without threads is usually pretty
messy, it's best to isolate the thread-specific code in its own
module.  In our example above, that's what MyMod_threaded is, and it's
only imported if we're running on a threaded Perl.
.Sh "A Note about the Examples"
.IX Subsection "A Note about the Examples"
Although thread support is considered to be stable, there are still a number
of quirks that may startle you when you try out any of the examples below.
In a real situation, care should be taken that all threads are finished
executing before the program exits.  That care has \fBnot\fR been taken in these
examples in the interest of simplicity.  Running these examples \*(L"as is\*(R" will
produce error messages, usually caused by the fact that there are still
threads running when the program exits.  You should not be alarmed by this.
Future versions of Perl may fix this problem.
.Sh "Creating Threads"
.IX Subsection "Creating Threads"
The threads package provides the tools you need to create new
threads.  Like any other module, you need to tell Perl that you want to use
it; \f(CW\*(C`use threads\*(C'\fR imports all the pieces you need to create basic
threads.
.PP
The simplest, most straightforward way to create a thread is with \fInew()\fR:
.PP
.Vb 1
\&    use threads;
.Ve
.PP
.Vb 1
\&    $thr = threads->new(\e&sub1);
.Ve
.PP
.Vb 3
\&    sub sub1 { 
\&        print "In the thread\en"; 
\&    }
.Ve
.PP
The \fInew()\fR method takes a reference to a subroutine and creates a new
thread, which starts executing in the referenced subroutine.  Control
then passes both to the subroutine and the caller.
.PP
If you need to, your program can pass parameters to the subroutine as
part of the thread startup.  Just include the list of parameters as
part of the \f(CW\*(C`threads::new\*(C'\fR call, like this:
.PP
.Vb 1
\&    use threads;
.Ve
.PP
.Vb 4
\&    $Param3 = "foo"; 
\&    $thr = threads->new(\e&sub1, "Param 1", "Param 2", $Param3); 
\&    $thr = threads->new(\e&sub1, @ParamList); 
\&    $thr = threads->new(\e&sub1, qw(Param1 Param2 Param3));
.Ve
.PP
.Vb 5
\&    sub sub1 { 
\&        my @InboundParameters = @_; 
\&        print "In the thread\en"; 
\&        print "got parameters >", join("<>", @InboundParameters), "<\en"; 
\&    }
.Ve
.PP
The last example illustrates another feature of threads.  You can spawn
off several threads using the same subroutine.  Each thread executes
the same subroutine, but in a separate thread with a separate
environment and potentially separate arguments.
.PP
\&\f(CW\*(C`create()\*(C'\fR is a synonym for \f(CW\*(C`new()\*(C'\fR.
.Sh "Giving up control"
.IX Subsection "Giving up control"
There are times when you may find it useful to have a thread
explicitly give up the \s-1CPU\s0 to another thread.  Your threading package
might not support preemptive multitasking for threads, for example, or
you may be doing something processor-intensive and want to make sure
that the user-interface thread gets called frequently.  Regardless,
there are times that you might want a thread to give up the processor.
.PP
Perl's threading package provides the \fIyield()\fR function that does
this. \fIyield()\fR is pretty straightforward, and works like this:
.PP
.Vb 1
\&    use threads;
.Ve
.PP
.Vb 8
\&    sub loop {
\&            my $thread = shift;
\&            my $foo = 50;
\&            while($foo--) { print "in thread $thread\en" }
\&            threads->yield;
\&            $foo = 50;
\&            while($foo--) { print "in thread $thread\en" }
\&    }
.Ve
.PP
.Vb 3
\&    my $thread1 = threads->new(\e&loop, 'first');
\&    my $thread2 = threads->new(\e&loop, 'second');
\&    my $thread3 = threads->new(\e&loop, 'third');
.Ve
.PP
It is important to remember that \fIyield()\fR is only a hint to give up the \s-1CPU\s0,
it depends on your hardware, \s-1OS\s0 and threading libraries what actually happens.
Therefore it is important to note that one should not build the scheduling of 
the threads around \fIyield()\fR calls. It might work on your platform but it won't
work on another platform.
.Sh "Waiting For A Thread To Exit"
.IX Subsection "Waiting For A Thread To Exit"
Since threads are also subroutines, they can return values.  To wait
for a thread to exit and extract any values it might return, you can
use the \fIjoin()\fR method:
.PP
.Vb 1
\&    use threads;
.Ve
.PP
.Vb 1
\&    $thr = threads->new(\e&sub1);
.Ve
.PP
.Vb 2
\&    @ReturnData = $thr->join; 
\&    print "Thread returned @ReturnData";
.Ve
.PP
.Vb 1
\&    sub sub1 { return "Fifty-six", "foo", 2; }
.Ve
.PP
In the example above, the \fIjoin()\fR method returns as soon as the thread
ends.  In addition to waiting for a thread to finish and gathering up
any values that the thread might have returned, \fIjoin()\fR also performs
any \s-1OS\s0 cleanup necessary for the thread.  That cleanup might be
important, especially for long-running programs that spawn lots of
threads.  If you don't want the return values and don't want to wait
for the thread to finish, you should call the \fIdetach()\fR method
instead, as described next.
.Sh "Ignoring A Thread"
.IX Subsection "Ignoring A Thread"
\&\fIjoin()\fR does three things: it waits for a thread to exit, cleans up
after it, and returns any data the thread may have produced.  But what
if you're not interested in the thread's return values, and you don't
really care when the thread finishes? All you want is for the thread
to get cleaned up after when it's done.
.PP
In this case, you use the \fIdetach()\fR method.  Once a thread is detached,
it'll run until it's finished, then Perl will clean up after it
automatically.
.PP
.Vb 1
\&    use threads;
.Ve
.PP
.Vb 1
\&    $thr = threads->new(\e&sub1); # Spawn the thread
.Ve
.PP
.Vb 1
\&    $thr->detach; # Now we officially don't care any more
.Ve
.PP
.Vb 8
\&    sub sub1 {
\&        $a = 0; 
\&        while (1) { 
\&            $a++; 
\&            print "\e$a is $a\en"; 
\&            sleep 1; 
\&        } 
\&    }
.Ve
.PP
Once a thread is detached, it may not be joined, and any return data
that it might have produced (if it was done and waiting for a join) is
lost.
.SH "Threads And Data"
.IX Header "Threads And Data"
Now that we've covered the basics of threads, it's time for our next
topic: data.  Threading introduces a couple of complications to data
access that non-threaded programs never need to worry about.
.Sh "Shared And Unshared Data"
.IX Subsection "Shared And Unshared Data"
The biggest difference between Perl ithreads and the old 5.005 style
threading, or for that matter, to most other threading systems out there,
is that by default, no data is shared. When a new perl thread is created,
all the data associated with the current thread is copied to the new
thread, and is subsequently private to that new thread!
This is similar in feel to what happens when a \s-1UNIX\s0 process forks,
except that in this case, the data is just copied to a different part of
memory within the same process rather than a real fork taking place.
.PP
To make use of threading however, one usually wants the threads to share
at least some data between themselves. This is done with the
threads::shared module and the \f(CW\*(C` : shared\*(C'\fR attribute:
.PP
.Vb 2
\&    use threads;
\&    use threads::shared;
.Ve
.PP
.Vb 3
\&    my $foo : shared = 1;
\&    my $bar = 1;
\&    threads->new(sub { $foo++; $bar++ })->join;
.Ve
.PP
.Vb 2
\&    print "$foo\en";  #prints 2 since $foo is shared
\&    print "$bar\en";  #prints 1 since $bar is not shared
.Ve
.PP
In the case of a shared array, all the array's elements are shared, and for
a shared hash, all the keys and values are shared. This places
restrictions on what may be assigned to shared array and hash elements: only
simple values or references to shared variables are allowed \- this is
so that a private variable can't accidentally become shared. A bad
assignment will cause the thread to die. For example:
.PP
.Vb 2
\&    use threads;
\&    use threads::shared;
.Ve
.PP
.Vb 3
\&    my $var           = 1;
\&    my $svar : shared = 2;
\&    my %hash : shared;
.Ve
.PP
.Vb 1
\&    ... create some threads ...
.Ve
.PP
.Vb 6
\&    $hash{a} = 1;       # all threads see exists($hash{a}) and $hash{a} == 1
\&    $hash{a} = $var     # okay - copy-by-value: same effect as previous
\&    $hash{a} = $svar    # okay - copy-by-value: same effect as previous
\&    $hash{a} = \e$svar   # okay - a reference to a shared variable
\&    $hash{a} = \e$var    # This will die
\&    delete $hash{a}     # okay - all threads will see !exists($hash{a})
.Ve
.PP
Note that a shared variable guarantees that if two or more threads try to
modify it at the same time, the internal state of the variable will not
become corrupted. However, there are no guarantees beyond this, as
explained in the next section.
.Sh "Thread Pitfalls: Races"
.IX Subsection "Thread Pitfalls: Races"
While threads bring a new set of useful tools, they also bring a
number of pitfalls.  One pitfall is the race condition:
.PP
.Vb 2
\&    use threads; 
\&    use threads::shared;
.Ve
.PP
.Vb 3
\&    my $a : shared = 1; 
\&    $thr1 = threads->new(\e&sub1); 
\&    $thr2 = threads->new(\e&sub2);
.Ve
.PP
.Vb 3
\&    $thr1->join;
\&    $thr2->join;
\&    print "$a\en";
.Ve
.PP
.Vb 2
\&    sub sub1 { my $foo = $a; $a = $foo + 1; }
\&    sub sub2 { my $bar = $a; $a = $bar + 1; }
.Ve
.PP
What do you think \f(CW$a\fR will be? The answer, unfortunately, is \*(L"it
depends.\*(R" Both \fIsub1()\fR and \fIsub2()\fR access the global variable \f(CW$a\fR, once
to read and once to write.  Depending on factors ranging from your
thread implementation's scheduling algorithm to the phase of the moon,
\&\f(CW$a\fR can be 2 or 3.
.PP
Race conditions are caused by unsynchronized access to shared
data.  Without explicit synchronization, there's no way to be sure that
nothing has happened to the shared data between the time you access it
and the time you update it.  Even this simple code fragment has the
possibility of error:
.PP
.Vb 8
\&    use threads; 
\&    my $a : shared = 2;
\&    my $b : shared;
\&    my $c : shared;
\&    my $thr1 = threads->create(sub { $b = $a; $a = $b + 1; }); 
\&    my $thr2 = threads->create(sub { $c = $a; $a = $c + 1; });
\&    $thr1->join;
\&    $thr2->join;
.Ve
.PP
Two threads both access \f(CW$a\fR.  Each thread can potentially be interrupted
at any point, or be executed in any order.  At the end, \f(CW$a\fR could be 3
or 4, and both \f(CW$b\fR and \f(CW$c\fR could be 2 or 3.
.PP
Even \f(CW\*(C`$a += 5\*(C'\fR or \f(CW\*(C`$a++\*(C'\fR are not guaranteed to be atomic.
.PP
Whenever your program accesses data or resources that can be accessed
by other threads, you must take steps to coordinate access or risk
data inconsistency and race conditions. Note that Perl will protect its
internals from your race conditions, but it won't protect you from you.
.SH "Synchronization and control"
.IX Header "Synchronization and control"
Perl provides a number of mechanisms to coordinate the interactions
between themselves and their data, to avoid race conditions and the like.
Some of these are designed to resemble the common techniques used in thread
libraries such as \f(CW\*(C`pthreads\*(C'\fR; others are Perl\-specific. Often, the
standard techniques are clumsy and difficult to get right (such as
condition waits). Where possible, it is usually easier to use Perlish
techniques such as queues, which remove some of the hard work involved.
.Sh "Controlling access: \fIlock()\fP"
.IX Subsection "Controlling access: lock()"
The \fIlock()\fR function takes a shared variable and puts a lock on it.  
No other thread may lock the variable until the the variable is unlocked
by the thread holding the lock. Unlocking happens automatically
when the locking thread exits the outermost block that contains
\&\f(CW\*(C`lock()\*(C'\fR function.  Using \fIlock()\fR is straightforward: this example has
several threads doing some calculations in parallel, and occasionally
updating a running total:
.PP
.Vb 2
\&    use threads;
\&    use threads::shared;
.Ve
.PP
.Vb 1
\&    my $total : shared = 0;
.Ve
.PP
.Vb 11
\&    sub calc {
\&        for (;;) {
\&            my $result;
\&            # (... do some calculations and set $result ...)
\&            {
\&                lock($total); # block until we obtain the lock
\&                $total += $result;
\&            } # lock implicitly released at end of scope
\&            last if $result == 0;
\&        }
\&    }
.Ve
.PP
.Vb 7
\&    my $thr1 = threads->new(\e&calc);
\&    my $thr2 = threads->new(\e&calc);
\&    my $thr3 = threads->new(\e&calc);
\&    $thr1->join;
\&    $thr2->join;
\&    $thr3->join;
\&    print "total=$total\en";
.Ve
.PP
\&\fIlock()\fR blocks the thread until the variable being locked is
available.  When \fIlock()\fR returns, your thread can be sure that no other
thread can lock that variable until the outermost block containing the
lock exits.
.PP
It's important to note that locks don't prevent access to the variable
in question, only lock attempts.  This is in keeping with Perl's
longstanding tradition of courteous programming, and the advisory file
locking that \fIflock()\fR gives you.  
.PP
You may lock arrays and hashes as well as scalars.  Locking an array,
though, will not block subsequent locks on array elements, just lock
attempts on the array itself.
.PP
Locks are recursive, which means it's okay for a thread to
lock a variable more than once.  The lock will last until the outermost
\&\fIlock()\fR on the variable goes out of scope. For example:
.PP
.Vb 2
\&    my $x : shared;
\&    doit();
.Ve
.PP
.Vb 15
\&    sub doit {
\&        {
\&            {
\&                lock($x); # wait for lock
\&                lock($x); # NOOP - we already have the lock
\&                {
\&                    lock($x); # NOOP
\&                    {
\&                        lock($x); # NOOP
\&                        lockit_some_more();
\&                    }
\&                }
\&            } # *** implicit unlock here ***
\&        }
\&    }
.Ve
.PP
.Vb 3
\&    sub lockit_some_more {
\&        lock($x); # NOOP
\&    } # nothing happens here
.Ve
.PP
Note that there is no \fIunlock()\fR function \- the only way to unlock a
variable is to allow it to go out of scope.  
.PP
A lock can either be used to guard the data contained within the variable
being locked, or it can be used to guard something else, like a section
of code. In this latter case, the variable in question does not hold any
useful data, and exists only for the purpose of being locked. In this
respect, the variable behaves like the mutexes and basic semaphores of
traditional thread libraries.
.Sh "A Thread Pitfall: Deadlocks"
.IX Subsection "A Thread Pitfall: Deadlocks"
Locks are a handy tool to synchronize access to data, and using them
properly is the key to safe shared data.  Unfortunately, locks aren't
without their dangers, especially when multiple locks are involved.
Consider the following code:
.PP
.Vb 1
\&    use threads;
.Ve
.PP
.Vb 14
\&    my $a : shared = 4; 
\&    my $b : shared = "foo"; 
\&    my $thr1 = threads->new(sub { 
\&        lock($a); 
\&        threads->yield; 
\&        sleep 20; 
\&        lock($b); 
\&    }); 
\&    my $thr2 = threads->new(sub { 
\&        lock($b); 
\&        threads->yield; 
\&        sleep 20; 
\&        lock($a); 
\&    });
.Ve
.PP
This program will probably hang until you kill it.  The only way it
won't hang is if one of the two threads acquires both locks
first.  A guaranteed-to-hang version is more complicated, but the
principle is the same.
.PP
The first thread will grab a lock on \f(CW$a\fR, then, after a pause during which
the second thread has probably had time to do some work, try to grab a
lock on \f(CW$b\fR.  Meanwhile, the second thread grabs a lock on \f(CW$b\fR, then later
tries to grab a lock on \f(CW$a\fR.  The second lock attempt for both threads will
block, each waiting for the other to release its lock.
.PP
This condition is called a deadlock, and it occurs whenever two or
more threads are trying to get locks on resources that the others
own.  Each thread will block, waiting for the other to release a lock
on a resource.  That never happens, though, since the thread with the
resource is itself waiting for a lock to be released.
.PP
There are a number of ways to handle this sort of problem.  The best
way is to always have all threads acquire locks in the exact same
order.  If, for example, you lock variables \f(CW$a\fR, \f(CW$b\fR, and \f(CW$c\fR, always lock
\&\f(CW$a\fR before \f(CW$b\fR, and \f(CW$b\fR before \f(CW$c\fR.  It's also best to hold on to locks for
as short a period of time to minimize the risks of deadlock.
.PP
The other synchronization primitives described below can suffer from
similar problems.
.Sh "Queues: Passing Data Around"
.IX Subsection "Queues: Passing Data Around"
A queue is a special thread-safe object that lets you put data in one
end and take it out the other without having to worry about
synchronization issues.  They're pretty straightforward, and look like
this:
.PP
.Vb 2
\&    use threads; 
\&    use Thread::Queue;
.Ve
.PP
.Vb 6
\&    my $DataQueue = Thread::Queue->new; 
\&    $thr = threads->new(sub { 
\&        while ($DataElement = $DataQueue->dequeue) { 
\&            print "Popped $DataElement off the queue\en";
\&        } 
\&    });
.Ve
.PP
.Vb 6
\&    $DataQueue->enqueue(12); 
\&    $DataQueue->enqueue("A", "B", "C"); 
\&    $DataQueue->enqueue(\e$thr); 
\&    sleep 10; 
\&    $DataQueue->enqueue(undef);
\&    $thr->join;
.Ve
.PP
You create the queue with \f(CW\*(C`new Thread::Queue\*(C'\fR.  Then you can
add lists of scalars onto the end with \fIenqueue()\fR, and pop scalars off
the front of it with \fIdequeue()\fR.  A queue has no fixed size, and can grow
as needed to hold everything pushed on to it.
.PP
If a queue is empty, \fIdequeue()\fR blocks until another thread enqueues
something.  This makes queues ideal for event loops and other
communications between threads.
.Sh "Semaphores: Synchronizing Data Access"
.IX Subsection "Semaphores: Synchronizing Data Access"
Semaphores are a kind of generic locking mechanism. In their most basic
form, they behave very much like lockable scalars, except that thay
can't hold data, and that they must be explicitly unlocked. In their
advanced form, they act like a kind of counter, and can allow multiple
threads to have the 'lock' at any one time.
.Sh "Basic semaphores"
.IX Subsection "Basic semaphores"
Semaphores have two methods, \fIdown()\fR and \fIup()\fR: \fIdown()\fR decrements the resource
count, while up increments it. Calls to \fIdown()\fR will block if the
semaphore's current count would decrement below zero.  This program
gives a quick demonstration:
.PP
.Vb 2
\&    use threads qw(yield); 
\&    use Thread::Semaphore;
.Ve
.PP
.Vb 2
\&    my $semaphore = new Thread::Semaphore; 
\&    my $GlobalVariable : shared = 0;
.Ve
.PP
.Vb 3
\&    $thr1 = new threads \e&sample_sub, 1; 
\&    $thr2 = new threads \e&sample_sub, 2; 
\&    $thr3 = new threads \e&sample_sub, 3;
.Ve
.PP
.Vb 16
\&    sub sample_sub { 
\&        my $SubNumber = shift @_; 
\&        my $TryCount = 10; 
\&        my $LocalCopy; 
\&        sleep 1; 
\&        while ($TryCount--) { 
\&            $semaphore->down; 
\&            $LocalCopy = $GlobalVariable; 
\&            print "$TryCount tries left for sub $SubNumber (\e$GlobalVariable is $GlobalVariable)\en"; 
\&            yield; 
\&            sleep 2; 
\&            $LocalCopy++; 
\&            $GlobalVariable = $LocalCopy; 
\&            $semaphore->up; 
\&        } 
\&    }
.Ve
.PP
.Vb 3
\&    $thr1->join;
\&    $thr2->join;
\&    $thr3->join;
.Ve
.PP
The three invocations of the subroutine all operate in sync.  The
semaphore, though, makes sure that only one thread is accessing the
global variable at once.
.Sh "Advanced Semaphores"
.IX Subsection "Advanced Semaphores"
By default, semaphores behave like locks, letting only one thread
\&\fIdown()\fR them at a time.  However, there are other uses for semaphores.
.PP
Each semaphore has a counter attached to it. By default, semaphores are
created with the counter set to one, \fIdown()\fR decrements the counter by
one, and \fIup()\fR increments by one. However, we can override any or all
of these defaults simply by passing in different values:
.PP
.Vb 4
\&    use threads;
\&    use Thread::Semaphore;
\&    my $semaphore = Thread::Semaphore->new(5);
\&                    # Creates a semaphore with the counter set to five
.Ve
.PP
.Vb 2
\&    $thr1 = threads->new(\e&sub1);
\&    $thr2 = threads->new(\e&sub1);
.Ve
.PP
.Vb 5
\&    sub sub1 {
\&        $semaphore->down(5); # Decrements the counter by five
\&        # Do stuff here
\&        $semaphore->up(5); # Increment the counter by five
\&    }
.Ve
.PP
.Vb 2
\&    $thr1->detach;
\&    $thr2->detach;
.Ve
.PP
If \fIdown()\fR attempts to decrement the counter below zero, it blocks until
the counter is large enough.  Note that while a semaphore can be created
with a starting count of zero, any \fIup()\fR or \fIdown()\fR always changes the
counter by at least one, and so \f(CW$semaphore\fR\->\fIdown\fR\|(0) is the same as
\&\f(CW$semaphore\fR\->\fIdown\fR\|(1).
.PP
The question, of course, is why would you do something like this? Why
create a semaphore with a starting count that's not one, or why
decrement/increment it by more than one? The answer is resource
availability.  Many resources that you want to manage access for can be
safely used by more than one thread at once.
.PP
For example, let's take a \s-1GUI\s0 driven program.  It has a semaphore that
it uses to synchronize access to the display, so only one thread is
ever drawing at once.  Handy, but of course you don't want any thread
to start drawing until things are properly set up.  In this case, you
can create a semaphore with a counter set to zero, and up it when
things are ready for drawing.
.PP
Semaphores with counters greater than one are also useful for
establishing quotas.  Say, for example, that you have a number of
threads that can do I/O at once.  You don't want all the threads
reading or writing at once though, since that can potentially swamp
your I/O channels, or deplete your process' quota of filehandles.  You
can use a semaphore initialized to the number of concurrent I/O
requests (or open files) that you want at any one time, and have your
threads quietly block and unblock themselves.
.PP
Larger increments or decrements are handy in those cases where a
thread needs to check out or return a number of resources at once.
.Sh "\fIcond_wait()\fP and \fIcond_signal()\fP"
.IX Subsection "cond_wait() and cond_signal()"
These two functions can be used in conjunction with locks to notify
co-operating threads that a resource has become available. They are
very similar in use to the functions found in \f(CW\*(C`pthreads\*(C'\fR. However
for most purposes, queues are simpler to use and more intuitive. See
threads::shared for more details.
.SH "General Thread Utility Routines"
.IX Header "General Thread Utility Routines"
We've covered the workhorse parts of Perl's threading package, and
with these tools you should be well on your way to writing threaded
code and packages.  There are a few useful little pieces that didn't
really fit in anyplace else.
.Sh "What Thread Am I In?"
.IX Subsection "What Thread Am I In?"
The \f(CW\*(C`threads\->self\*(C'\fR class method provides your program with a way to
get an object representing the thread it's currently in.  You can use this
object in the same way as the ones returned from thread creation.
.Sh "Thread IDs"
.IX Subsection "Thread IDs"
\&\fItid()\fR is a thread object method that returns the thread \s-1ID\s0 of the
thread the object represents.  Thread IDs are integers, with the main
thread in a program being 0.  Currently Perl assigns a unique tid to
every thread ever created in your program, assigning the first thread
to be created a tid of 1, and increasing the tid by 1 for each new
thread that's created.
.Sh "Are These Threads The Same?"
.IX Subsection "Are These Threads The Same?"
The \fIequal()\fR method takes two thread objects and returns true 
if the objects represent the same thread, and false if they don't.
.PP
Thread objects also have an overloaded == comparison so that you can do
comparison on them as you would with normal objects.
.Sh "What Threads Are Running?"
.IX Subsection "What Threads Are Running?"
\&\f(CW\*(C`threads\->list\*(C'\fR returns a list of thread objects, one for each thread
that's currently running and not detached.  Handy for a number of things,
including cleaning up at the end of your program:
.PP
.Vb 7
\&    # Loop through all the threads 
\&    foreach $thr (threads->list) { 
\&        # Don't join the main thread or ourselves 
\&        if ($thr->tid && !threads::equal($thr, threads->self)) { 
\&            $thr->join; 
\&        } 
\&    }
.Ve
.PP
If some threads have not finished running when the main Perl thread
ends, Perl will warn you about it and die, since it is impossible for Perl
to clean up itself while other threads are running
.SH "A Complete Example"
.IX Header "A Complete Example"
Confused yet? It's time for an example program to show some of the
things we've covered.  This program finds prime numbers using threads.
.PP
.Vb 34
\&    1  #!/usr/bin/perl -w
\&    2  # prime-pthread, courtesy of Tom Christiansen
\&    3
\&    4  use strict;
\&    5
\&    6  use threads;
\&    7  use Thread::Queue;
\&    8
\&    9  my $stream = new Thread::Queue;
\&    10 my $kid    = new threads(\e&check_num, $stream, 2);
\&    11
\&    12 for my $i ( 3 .. 1000 ) {
\&    13     $stream->enqueue($i);
\&    14 } 
\&    15
\&    16 $stream->enqueue(undef);
\&    17 $kid->join;
\&    18
\&    19 sub check_num {
\&    20     my ($upstream, $cur_prime) = @_;
\&    21     my $kid;
\&    22     my $downstream = new Thread::Queue;
\&    23     while (my $num = $upstream->dequeue) {
\&    24         next unless $num % $cur_prime;
\&    25         if ($kid) {
\&    26            $downstream->enqueue($num);
\&    27                  } else {
\&    28            print "Found prime $num\en";
\&    29                $kid = new threads(\e&check_num, $downstream, $num);
\&    30         }
\&    31     } 
\&    32     $downstream->enqueue(undef) if $kid;
\&    33     $kid->join           if $kid;
\&    34 }
.Ve
.PP
This program uses the pipeline model to generate prime numbers.  Each
thread in the pipeline has an input queue that feeds numbers to be
checked, a prime number that it's responsible for, and an output queue
into which it funnels numbers that have failed the check.  If the thread
has a number that's failed its check and there's no child thread, then
the thread must have found a new prime number.  In that case, a new
child thread is created for that prime and stuck on the end of the
pipeline.
.PP
This probably sounds a bit more confusing than it really is, so let's
go through this program piece by piece and see what it does.  (For
those of you who might be trying to remember exactly what a prime
number is, it's a number that's only evenly divisible by itself and 1)
.PP
The bulk of the work is done by the \fIcheck_num()\fR subroutine, which
takes a reference to its input queue and a prime number that it's
responsible for.  After pulling in the input queue and the prime that
the subroutine's checking (line 20), we create a new queue (line 22)
and reserve a scalar for the thread that we're likely to create later
(line 21).
.PP
The while loop from lines 23 to line 31 grabs a scalar off the input
queue and checks against the prime this thread is responsible
for.  Line 24 checks to see if there's a remainder when we modulo the
number to be checked against our prime.  If there is one, the number
must not be evenly divisible by our prime, so we need to either pass
it on to the next thread if we've created one (line 26) or create a
new thread if we haven't.
.PP
The new thread creation is line 29.  We pass on to it a reference to
the queue we've created, and the prime number we've found.
.PP
Finally, once the loop terminates (because we got a 0 or undef in the
queue, which serves as a note to die), we pass on the notice to our
child and wait for it to exit if we've created a child (lines 32 and
37).
.PP
Meanwhile, back in the main thread, we create a queue (line 9) and the
initial child thread (line 10), and pre-seed it with the first prime:
2.  Then we queue all the numbers from 3 to 1000 for checking (lines
12\-14), then queue a die notice (line 16) and wait for the first child
thread to terminate (line 17).  Because a child won't die until its
child has died, we know that we're done once we return from the join.
.PP
That's how it works.  It's pretty simple; as with many Perl programs,
the explanation is much longer than the program.
.SH "Performance considerations"
.IX Header "Performance considerations"
The main thing to bear in mind when comparing ithreads to other threading
models is the fact that for each new thread created, a complete copy of
all the variables and data of the parent thread has to be taken. Thus
thread creation can be quite expensive, both in terms of memory usage and
time spent in creation. The ideal way to reduce these costs is to have a
relatively short number of long-lived threads, all created fairly early
on \-  before the base thread has accumulated too much data. Of course, this
may not always be possible, so compromises have to be made. However, after
a thread has been created, its performance and extra memory usage should
be little different than ordinary code.
.PP
Also note that under the current implementation, shared variables
use a little more memory and are a little slower than ordinary variables.
.SH "Process-scope Changes"
.IX Header "Process-scope Changes"
Note that while threads themselves are separate execution threads and
Perl data is thread-private unless explicitly shared, the threads can
affect process-scope state, affecting all the threads.
.PP
The most common example of this is changing the current working
directory using \fIchdir()\fR.  One thread calls \fIchdir()\fR, and the working
directory of all the threads changes.
.PP
Even more drastic example of a process-scope change is \fIchroot()\fR:
the root directory of all the threads changes, and no thread can
undo it (as opposed to \fIchdir()\fR).
.PP
Further examples of process-scope changes include \fIumask()\fR and
changing uids/gids.
.PP
Thinking of mixing \fIfork()\fR and threads?  Please lie down and wait
until the feeling passes\*(-- but in case you really want to know,
the semantics is that \fIfork()\fR duplicates all the threads.
(In \s-1UNIX\s0, at least, other platforms will do something different.)
.PP
Similarly, mixing signals and threads should not be attempted.
Implementations are platform\-dependent, and even the \s-1POSIX\s0
semantics may not be what you expect (and Perl doesn't even
give you the full \s-1POSIX\s0 \s-1API\s0).
.SH "Thread-Safety of System Libraries"
.IX Header "Thread-Safety of System Libraries"
Whether various library calls are thread-safe is outside the control
of Perl.  Calls often suffering from not being thread-safe include:
\&\fIlocaltime()\fR, \fIgmtime()\fR, get{gr,host,net,proto,serv,pw}*(), \fIreaddir()\fR,
\&\fIrand()\fR, and \fIsrand()\fR \*(-- in general, calls that depend on some global
external state.
.PP
If the system Perl is compiled in has thread-safe variants of such
calls, they will be used.  Beyond that, Perl is at the mercy of
the thread-safety or \-unsafety of the calls.  Please consult your
C library call documentation.
.PP
In some platforms the thread-safe interfaces may fail if the result
buffer is too small (for example \fIgetgrent()\fR may return quite large
group member lists).  Perl will retry growing the result buffer
a few times, but only up to 64k (for safety reasons).
.SH "Conclusion"
.IX Header "Conclusion"
A complete thread tutorial could fill a book (and has, many times),
but with what we've covered in this introduction, you should be well
on your way to becoming a threaded Perl expert.
.SH "Bibliography"
.IX Header "Bibliography"