.\" 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 "PERLOTHRTUT 1"
.TH PERLOTHRTUT 1 "2002-11-24" "perl v5.8.0" "Perl Programmers Reference Guide"
.SH "NAME"
perlothrtut \- old tutorial on threads in Perl
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
\&\fB\s-1WARNING\s0\fR:
This tutorial describes the old-style thread model that was introduced in
release 5.005. This model is now deprecated, and will be removed, probably
in version 5.10. The interfaces described here were considered
experimental, and are likely to be buggy.
.PP
For information about the new interpreter threads (\*(L"ithreads\*(R") model, see
the \fIperlthrtut\fR tutorial, and the threads and threads::shared
modules.
.PP
You are strongly encouraged to migrate any existing threads code to the
new model as soon as possible.
.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.005, 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.
.SH "Threadsafe Modules"
.IX Header "Threadsafe Modules"
The addition of threads has changed Perl's internals
substantially. There are implications for people who write
modules\*(--especially modules with \s-1XS\s0 code or external libraries. While
most modules won't encounter any problems, modules that aren't
explicitly tagged as thread-safe should be tested 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 beta feature, and even some of the standard
modules aren't thread\-safe.
.PP
If you're using a module that's not thread-safe for some reason, you
can protect yourself by using semaphores and lots of programming
discipline to control access to the module. Semaphores are covered
later in the article. Perl Threads Are Different
.SH "Thread Basics"
.IX Header "Thread Basics"
The core Thread 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 Thread 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
Remember that the threading support in 5.005 is in beta release, and
should be treated as such. You should expect that it may not function
entirely properly, and the thread interface may well change some
before it is a fully supported, production release. The beta version
shouldn't be used for mission-critical projects. Having said that,
threaded Perl is pretty nifty, and worth a look.
.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{usethreads} 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 8
\& if ($Config{usethreads}) {
\& # 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 "Creating Threads"
.IX Subsection "Creating Threads"
The Thread package provides the tools you need to create new
threads. Like any other module, you need to tell Perl you want to use
it; use Thread imports all the pieces you need to create basic
threads.
.PP
The simplest, straightforward way to create a thread is with \fInew()\fR:
.PP
.Vb 1
\& use Thread;
.Ve
.PP
.Vb 1
\& $thr = new Thread \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`Thread::new\*(C'\fR call, like this:
.PP
.Vb 5
\& use Thread;
\& $Param3 = "foo";
\& $thr = new Thread \e&sub1, "Param 1", "Param 2", $Param3;
\& $thr = new Thread \e&sub1, @ParamList;
\& $thr = new Thread \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 subroutine runs like a normal Perl subroutine, and the call to new
Thread returns whatever the subroutine returns.
.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
The other way to spawn a new thread is with \fIasync()\fR, which is a way to
spin off a chunk of code like \fIeval()\fR, but into its own thread:
.PP
.Vb 1
\& use Thread qw(async);
.Ve
.PP
.Vb 1
\& $LineCount = 0;
.Ve
.PP
.Vb 4
\& $thr = async {
\& while(<>) {$LineCount++}
\& print "Got $LineCount lines\en";
\& };
.Ve
.PP
.Vb 3
\& print "Waiting for the linecount to end\en";
\& $thr->join;
\& print "All done\en";
.Ve
.PP
You'll notice we did a use Thread qw(async) in that example. async is
not exported by default, so if you want it, you'll either need to
import it before you use it or fully qualify it as
Thread::async. You'll also note that there's a semicolon after the
closing brace. That's because \fIasync()\fR treats the following block as an
anonymous subroutine, so the semicolon is necessary.
.PP
Like \fIeval()\fR, the code executes in the same context as it would if it
weren't spun off. Since both the code inside and after the async start
executing, you need to be careful with any shared resources. Locking
and other synchronization techniques are covered later.
.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 compute-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 15
\& use Thread qw(yield async);
\& async {
\& my $foo = 50;
\& while ($foo--) { print "first async\en" }
\& yield;
\& $foo = 50;
\& while ($foo--) { print "first async\en" }
\& };
\& async {
\& my $foo = 50;
\& while ($foo--) { print "second async\en" }
\& yield;
\& $foo = 50;
\& while ($foo--) { print "second async\en" }
\& };
.Ve
.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 scalars it might return, you can
use the \fIjoin()\fR method.
.PP
.Vb 2
\& use Thread;
\& $thr = new Thread \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. \fIdetach()\fR is covered later in the article.
.Sh "Errors In Threads"
.IX Subsection "Errors In Threads"
So what happens when an error occurs in a thread? Any errors that
could be caught with \fIeval()\fR are postponed until the thread is
joined. If your program never joins, the errors appear when your
program exits.
.PP
Errors deferred until a \fIjoin()\fR can be caught with \fIeval()\fR:
.PP
.Vb 8
\& use Thread qw(async);
\& $thr = async {$b = 3/0}; # Divide by zero error
\& $foo = eval {$thr->join};
\& if ($@) {
\& print "died with error $@\en";
\& } else {
\& print "Hey, why aren't you dead?\en";
\& }
.Ve
.PP
\&\fIeval()\fR passes any results from the joined thread back unmodified, so
if you want the return value of the thread, this is your only chance
to get them.
.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 2
\& use Thread;
\& $thr = new Thread \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 output 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 single most important thing to remember when using threads is that
all threads potentially have access to all the data anywhere in your
program. While this is true with a nonthreaded Perl program as well,
it's especially important to remember with a threaded program, since
more than one thread can be accessing this data at once.
.PP
Perl's scoping rules don't change because you're using threads. If a
subroutine (or block, in the case of \fIasync()\fR) could see a variable if
you weren't running with threads, it can see it if you are. This is
especially important for the subroutines that create, and makes \f(CW\*(C`my\*(C'\fR
variables even more important. Remember\*(--if your variables aren't
lexically scoped (declared with \f(CW\*(C`my\*(C'\fR) you're probably sharing them
between threads.
.Sh "Thread Pitfall: Races"
.IX Subsection "Thread Pitfall: 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 4
\& use Thread;
\& $a = 1;
\& $thr1 = Thread->new(\e&sub1);
\& $thr2 = Thread->new(\e&sub2);
.Ve
.PP
.Vb 2
\& sleep 10;
\& print "$a\en";
.Ve
.PP
.Vb 2
\& sub sub1 { $foo = $a; $a = $foo + 1; }
\& sub sub2 { $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 4
\& use Thread qw(async);
\& $a = 2;
\& async{ $b = $a; $a = $b + 1; };
\& async{ $c = $a; $a = $c + 1; };
.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
Whenever your program accesses data or resources that can be accessed
by other threads, you must take steps to coordinate access or risk
data corruption and race conditions.
.Sh "Controlling access: \fIlock()\fP"
.IX Subsection "Controlling access: lock()"
The \fIlock()\fR function takes a variable (or subroutine, but we'll get to
that later) and puts a lock on it. No other thread may lock the
variable until the locking thread exits the innermost block containing
the lock. Using \fIlock()\fR is straightforward:
.PP
.Vb 23
\& use Thread qw(async);
\& $a = 4;
\& $thr1 = async {
\& $foo = 12;
\& {
\& lock ($a); # Block until we get access to $a
\& $b = $a;
\& $a = $b * $foo;
\& }
\& print "\e$foo was $foo\en";
\& };
\& $thr2 = async {
\& $bar = 7;
\& {
\& lock ($a); # Block until we can get access to $a
\& $c = $a;
\& $a = $c * $bar;
\& }
\& print "\e$bar was $bar\en";
\& };
\& $thr1->join;
\& $thr2->join;
\& print "\e$a is $a\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 innermost 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. Locked subroutines behave differently,
however. We'll cover that later in the article.
.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
Finally, 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.
.Sh "Thread Pitfall: Deadlocks"
.IX Subsection "Thread Pitfall: Deadlocks"
Locks are a handy tool to synchronize access to data. Using them
properly is the key to safe shared data. Unfortunately, locks aren't
without their dangers. Consider the following code:
.PP
.Vb 15
\& use Thread qw(async yield);
\& $a = 4;
\& $b = "foo";
\& async {
\& lock($a);
\& yield;
\& sleep 20;
\& lock ($b);
\& };
\& async {
\& lock($b);
\& 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 \fIasync()\fR routines acquires both locks
first. A guaranteed-to-hang version is more complicated, but the
principle is the same.
.PP
The first thread spawned by \fIasync()\fR will grab a lock on \f(CW$a\fR then, a
second or two later, 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.
.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 Thread qw(async);
\& use Thread::Queue;
.Ve
.PP
.Vb 6
\& my $DataQueue = new Thread::Queue;
\& $thr = async {
\& while ($DataElement = $DataQueue->dequeue) {
\& print "Popped $DataElement off the queue\en";
\& }
\& };
.Ve
.PP
.Vb 5
\& $DataQueue->enqueue(12);
\& $DataQueue->enqueue("A", "B", "C");
\& $DataQueue->enqueue(\e$thr);
\& sleep 10;
\& $DataQueue->enqueue(undef);
.Ve
.PP
You create the queue with new Thread::Queue. 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 "Threads And Code"
.IX Header "Threads And Code"
In addition to providing thread-safe access to data via locks and
queues, threaded Perl also provides general-purpose semaphores for
coarser synchronization than locks provide and thread-safe access to
entire subroutines.
.Sh "Semaphores: Synchronizing Data Access"
.IX Subsection "Semaphores: Synchronizing Data Access"
Semaphores are a kind of generic locking mechanism. Unlike lock, which
gets a lock on a particular scalar, Perl doesn't associate any
particular thing with a semaphore so you can use them to control
access to anything you like. In addition, semaphores can allow more
than one thread to access a resource at once, though by default
semaphores only allow one thread access at a time.
.IP "Basic semaphores" 4
.IX Item "Basic semaphores"
Semaphores have two methods, down and up. down decrements the resource
count, while up increments it. down calls will block if the
semaphore's current count would decrement below zero. This program
gives a quick demonstration:
.Sp
.Vb 4
\& use Thread qw(yield);
\& use Thread::Semaphore;
\& my $semaphore = new Thread::Semaphore;
\& $GlobalVariable = 0;
.Ve
.Sp
.Vb 3
\& $thr1 = new Thread \e&sample_sub, 1;
\& $thr2 = new Thread \e&sample_sub, 2;
\& $thr3 = new Thread \e&sample_sub, 3;
.Ve
.Sp
.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
.Sp
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.
.IP "Advanced Semaphores" 4
.IX Item "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.
.Sp
Each semaphore has a counter attached to it. \fIdown()\fR decrements the
counter and \fIup()\fR increments the counter. By default, semaphores are
created with the counter set to one, \fIdown()\fR decrements by one, and
\&\fIup()\fR increments by one. 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. \f(CW$semaphore\fR\->\fIdown\fR\|(0) is the same as \f(CW$semaphore\fR\->\fIdown\fR\|(1).
.Sp
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.
.Sp
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.
.Sp
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.
.Sp
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 "Attributes: Restricting Access To Subroutines"
.IX Subsection "Attributes: Restricting Access To Subroutines"
In addition to synchronizing access to data or resources, you might
find it useful to synchronize access to subroutines. You may be
accessing a singular machine resource (perhaps a vector processor), or
find it easier to serialize calls to a particular subroutine than to
have a set of locks and semaphores.
.PP
One of the additions to Perl 5.005 is subroutine attributes. The
Thread package uses these to provide several flavors of
serialization. It's important to remember that these attributes are
used in the compilation phase of your program so you can't change a
subroutine's behavior while your program is actually running.
.Sh "Subroutine Locks"
.IX Subsection "Subroutine Locks"
The basic subroutine lock looks like this:
.PP
.Vb 2
\& sub test_sub :locked {
\& }
.Ve
.PP
This ensures that only one thread will be executing this subroutine at
any one time. Once a thread calls this subroutine, any other thread
that calls it will block until the thread in the subroutine exits
it. A more elaborate example looks like this:
.PP
.Vb 1
\& use Thread qw(yield);
.Ve
.PP
.Vb 4
\& new Thread \e&thread_sub, 1;
\& new Thread \e&thread_sub, 2;
\& new Thread \e&thread_sub, 3;
\& new Thread \e&thread_sub, 4;
.Ve
.PP
.Vb 7
\& sub sync_sub :locked {
\& my $CallingThread = shift @_;
\& print "In sync_sub for thread $CallingThread\en";
\& yield;
\& sleep 3;
\& print "Leaving sync_sub for thread $CallingThread\en";
\& }
.Ve
.PP
.Vb 6
\& sub thread_sub {
\& my $ThreadID = shift @_;
\& print "Thread $ThreadID calling sync_sub\en";
\& sync_sub($ThreadID);
\& print "$ThreadID is done with sync_sub\en";
\& }
.Ve
.PP
The \f(CW\*(C`locked\*(C'\fR attribute tells perl to lock \fIsync_sub()\fR, and if you run
this, you can see that only one thread is in it at any one time.
.Sh "Methods"
.IX Subsection "Methods"
Locking an entire subroutine can sometimes be overkill, especially
when dealing with Perl objects. When calling a method for an object,
for example, you want to serialize calls to a method, so that only one
thread will be in the subroutine for a particular object, but threads
calling that subroutine for a different object aren't blocked. The
method attribute indicates whether the subroutine is really a method.
.PP
.Vb 1
\& use Thread;
.Ve
.PP
.Vb 14
\& sub tester {
\& my $thrnum = shift @_;
\& my $bar = new Foo;
\& foreach (1..10) {
\& print "$thrnum calling per_object\en";
\& $bar->per_object($thrnum);
\& print "$thrnum out of per_object\en";
\& yield;
\& print "$thrnum calling one_at_a_time\en";
\& $bar->one_at_a_time($thrnum);
\& print "$thrnum out of one_at_a_time\en";
\& yield;
\& }
\& }
.Ve
.PP
.Vb 3
\& foreach my $thrnum (1..10) {
\& new Thread \e&tester, $thrnum;
\& }
.Ve
.PP
.Vb 5
\& package Foo;
\& sub new {
\& my $class = shift @_;
\& return bless [@_], $class;
\& }
.Ve
.PP
.Vb 7
\& sub per_object :locked :method {
\& my ($class, $thrnum) = @_;
\& print "In per_object for thread $thrnum\en";
\& yield;
\& sleep 2;
\& print "Exiting per_object for thread $thrnum\en";
\& }
.Ve
.PP
.Vb 7
\& sub one_at_a_time :locked {
\& my ($class, $thrnum) = @_;
\& print "In one_at_a_time for thread $thrnum\en";
\& yield;
\& sleep 2;
\& print "Exiting one_at_a_time for thread $thrnum\en";
\& }
.Ve
.PP
As you can see from the output (omitted for brevity; it's 800 lines)
all the threads can be in \fIper_object()\fR simultaneously, but only one
thread is ever in \fIone_at_a_time()\fR at once.
.Sh "Locking A Subroutine"
.IX Subsection "Locking A Subroutine"
You can lock a subroutine as you would lock a variable. Subroutine locks
work the same as specifying a \f(CW\*(C`locked\*(C'\fR attribute for the subroutine,
and block all access to the subroutine for other threads until the
lock goes out of scope. When the subroutine isn't locked, any number
of threads can be in it at once, and getting a lock on a subroutine
doesn't affect threads already in the subroutine. Getting a lock on a
subroutine looks like this:
.PP
.Vb 1
\& lock(\e&sub_to_lock);
.Ve
.PP
Simple enough. Unlike the \f(CW\*(C`locked\*(C'\fR attribute, which is a compile time
option, locking and unlocking a subroutine can be done at runtime at your
discretion. There is some runtime penalty to using lock(\e&sub) instead
of the \f(CW\*(C`locked\*(C'\fR attribute, so make sure you're choosing the proper
method to do the locking.
.PP
You'd choose lock(\e&sub) when writing modules and code to run on both
threaded and unthreaded Perl, especially for code that will run on
5.004 or earlier Perls. In that case, it's useful to have subroutines
that should be serialized lock themselves if they're running threaded,
like so:
.PP
.Vb 3
\& package Foo;
\& use Config;
\& $Running_Threaded = 0;
.Ve
.PP
.Vb 1
\& BEGIN { $Running_Threaded = $Config{'usethreads'} }
.Ve
.PP
.Vb 1
\& sub sub1 { lock(\e&sub1) if $Running_Threaded }
.Ve
.PP
This way you can ensure single-threadedness regardless of which
version of Perl you're running.
.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 Thread\->self 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 the 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.
.Sh "What Threads Are Running?"
.IX Subsection "What Threads Are Running?"
Thread\->list returns a list of thread objects, one for each thread
that's currently running. 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 (Thread->list) {
\& # Don't join the main thread or ourselves
\& if ($thr->tid && !Thread::equal($thr, Thread->self)) {
\& $thr->join;
\& }
\& }
.Ve
.PP
The example above is just for illustration. It isn't strictly
necessary to join all the threads you create, since Perl detaches all
the threads before it exits.
.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 Thread;
\& 7 use Thread::Queue;
\& 8
\& 9 my $stream = new Thread::Queue;
\& 10 my $kid = new Thread(\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 Thread(\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
that it funnels numbers that have failed the check into. 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 lets
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 "Conclusion"
.IX Header "Conclusion"
A complete thread tutorial could fill a book (and has, many times),
but this should get you well on your way. The final authority on how
Perl's threads behave is the documentation bundled with the Perl
distribution, but with what we've covered in this article, you should
be well on your way to becoming a threaded Perl expert.
.SH "Bibliography"
.IX Header "Bibliography"
Here's a short bibliography courtesy of J�n Christoffel:
.Sh "Introductory Texts"
.IX Subsection "Introductory Texts"
Birrell, Andrew D. An Introduction to Programming with
Threads. Digital Equipment Corporation, 1989, DEC-SRC Research Report
#35 online as
http://www.research.digital.com/SRC/staff/birrell/bib.html (highly
recommended)
.PP
Robbins, Kay. A., and Steven Robbins. Practical Unix Programming: A
Guide to Concurrency, Communication, and
Multithreading. Prentice\-Hall, 1996.
.PP
Lewis, Bill, and Daniel J. Berg. Multithreaded Programming with
Pthreads. Prentice Hall, 1997, \s-1ISBN\s0 0\-13\-443698\-9 (a well-written
introduction to threads).
.PP
Nelson, Greg (editor). Systems Programming with Modula\-3. Prentice
Hall, 1991, \s-1ISBN\s0 0\-13\-590464\-1.
.PP
Nichols, Bradford, Dick Buttlar, and Jacqueline Proulx Farrell.
Pthreads Programming. O'Reilly & Associates, 1996, \s-1ISBN\s0 156592\-115\-1
(covers \s-1POSIX\s0 threads).
.Sh "OS-Related References"
.IX Subsection "OS-Related References"
Boykin, Joseph, David Kirschen, Alan Langerman, and Susan
LoVerso. Programming under Mach. Addison\-Wesley, 1994, \s-1ISBN\s0
0\-201\-52739\-1.
.PP
Tanenbaum, Andrew S. Distributed Operating Systems. Prentice Hall,
1995, \s-1ISBN\s0 0\-13\-219908\-4 (great textbook).
.PP
Silberschatz, Abraham, and Peter B. Galvin. Operating System Concepts,
4th ed. Addison\-Wesley, 1995, \s-1ISBN\s0 0\-201\-59292\-4
.Sh "Other References"
.IX Subsection "Other References"
Arnold, Ken and James Gosling. The Java Programming Language, 2nd
ed. Addison\-Wesley, 1998, \s-1ISBN\s0 0\-201\-31006\-6.
.PP
Le Sergent, T. and B. Berthomieu. \*(L"Incremental MultiThreaded Garbage
Collection on Virtually Shared Memory Architectures\*(R" in Memory
Management: Proc. of the International Workshop \s-1IWMM\s0 92, St. Malo,
France, September 1992, Yves Bekkers and Jacques Cohen, eds. Springer,
1992, \s-1ISBN\s0 3540\-55940\-X (real\-life thread applications).
.SH "Acknowledgements"
.IX Header "Acknowledgements"
Thanks (in no particular order) to Chaim Frenkel, Steve Fink, Gurusamy
Sarathy, Ilya Zakharevich, Benjamin Sugars, J�n Christoffel, Joshua
Pritikin, and Alan Burlison, for their help in reality-checking and
polishing this article. Big thanks to Tom Christiansen for his rewrite
of the prime number generator.
.SH "AUTHOR"
.IX Header "AUTHOR"
Dan Sugalski <sugalskd@ous.edu>
.SH "Copyrights"
.IX Header "Copyrights"
This article originally appeared in The Perl Journal #10, and is
copyright 1998 The Perl Journal. It appears courtesy of Jon Orwant and
The Perl Journal. This document may be distributed under the same terms
as Perl itself.
|
