2004-01-15 18:34:11 +00:00
< !DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
"http://www.w3.org/TR/html4/strict.dtd">
< html >
< head >
2005-01-11 05:16:23 +00:00
< meta http-equiv = "Content-Type" content = "text/html; charset=utf-8" >
2004-01-15 18:34:11 +00:00
< title > Writing an LLVM Pass< / title >
2012-04-19 20:20:34 +00:00
< link rel = "stylesheet" href = "_static/llvm.css" type = "text/css" >
2004-01-15 18:34:11 +00:00
< / head >
< body >
2011-04-18 23:59:50 +00:00
< h1 >
2004-01-15 18:34:11 +00:00
Writing an LLVM Pass
2011-04-18 23:59:50 +00:00
< / h1 >
2002-08-08 20:11:18 +00:00
< ol >
2004-01-15 18:34:11 +00:00
< li > < a href = "#introduction" > Introduction - What is a pass?< / a > < / li >
2002-08-08 20:11:18 +00:00
< li > < a href = "#quickstart" > Quick Start - Writing hello world< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#makefile" > Setting up the build environment< / a > < / li >
< li > < a href = "#basiccode" > Basic code required< / a > < / li >
2006-08-27 23:18:52 +00:00
< li > < a href = "#running" > Running a pass with < tt > opt< / tt > < / a > < / li >
2004-01-15 18:34:11 +00:00
< / ul > < / li >
2002-08-08 20:11:18 +00:00
< li > < a href = "#passtype" > Pass classes and requirements< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#ImmutablePass" > The < tt > ImmutablePass< / tt > class< / a > < / li >
2004-09-20 04:36:29 +00:00
< li > < a href = "#ModulePass" > The < tt > ModulePass< / tt > class< / a >
2002-08-08 20:11:18 +00:00
< ul >
2004-09-20 04:36:29 +00:00
< li > < a href = "#runOnModule" > The < tt > runOnModule< / tt > method< / a > < / li >
2004-01-15 18:34:11 +00:00
< / ul > < / li >
2004-09-18 06:39:35 +00:00
< li > < a href = "#CallGraphSCCPass" > The < tt > CallGraphSCCPass< / tt > class< / a >
< ul >
2007-01-23 22:56:28 +00:00
< li > < a href = "#doInitialization_scc" > The < tt > doInitialization(CallGraph
2004-09-18 06:39:35 +00:00
& )< / tt > method< / a > < / li >
< li > < a href = "#runOnSCC" > The < tt > runOnSCC< / tt > method< / a > < / li >
2007-01-23 22:56:28 +00:00
< li > < a href = "#doFinalization_scc" > The < tt > doFinalization(CallGraph
2004-09-18 06:39:35 +00:00
& )< / tt > method< / a > < / li >
< / ul > < / li >
2002-08-08 20:11:18 +00:00
< li > < a href = "#FunctionPass" > The < tt > FunctionPass< / tt > class< / a >
< ul >
2002-09-12 17:06:43 +00:00
< li > < a href = "#doInitialization_mod" > The < tt > doInitialization(Module
2004-01-15 18:34:11 +00:00
& )< / tt > method< / a > < / li >
< li > < a href = "#runOnFunction" > The < tt > runOnFunction< / tt > method< / a > < / li >
2002-09-12 17:06:43 +00:00
< li > < a href = "#doFinalization_mod" > The < tt > doFinalization(Module
2004-01-15 18:34:11 +00:00
& )< / tt > method< / a > < / li >
< / ul > < / li >
2007-03-19 22:21:25 +00:00
< li > < a href = "#LoopPass" > The < tt > LoopPass< / tt > class< / a >
< ul >
< li > < a href = "#doInitialization_loop" > The < tt > doInitialization(Loop *,
LPPassManager & )< / tt > method< / a > < / li >
< li > < a href = "#runOnLoop" > The < tt > runOnLoop< / tt > method< / a > < / li >
< li > < a href = "#doFinalization_loop" > The < tt > doFinalization()
< / tt > method< / a > < / li >
< / ul > < / li >
2010-10-20 01:54:44 +00:00
< li > < a href = "#RegionPass" > The < tt > RegionPass< / tt > class< / a >
< ul >
< li > < a href = "#doInitialization_region" > The < tt > doInitialization(Region *,
RGPassManager & )< / tt > method< / a > < / li >
< li > < a href = "#runOnRegion" > The < tt > runOnRegion< / tt > method< / a > < / li >
< li > < a href = "#doFinalization_region" > The < tt > doFinalization()
< / tt > method< / a > < / li >
< / ul > < / li >
2002-08-08 20:11:18 +00:00
< li > < a href = "#BasicBlockPass" > The < tt > BasicBlockPass< / tt > class< / a >
< ul >
2002-09-12 17:06:43 +00:00
< li > < a href = "#doInitialization_fn" > The < tt > doInitialization(Function
2004-01-15 18:34:11 +00:00
& )< / tt > method< / a > < / li >
< li > < a href = "#runOnBasicBlock" > The < tt > runOnBasicBlock< / tt >
method< / a > < / li >
2002-09-12 17:06:43 +00:00
< li > < a href = "#doFinalization_fn" > The < tt > doFinalization(Function
2004-01-15 18:34:11 +00:00
& )< / tt > method< / a > < / li >
< / ul > < / li >
2003-07-17 18:53:20 +00:00
< li > < a href = "#MachineFunctionPass" > The < tt > MachineFunctionPass< / tt >
class< / a >
2003-07-22 20:53:20 +00:00
< ul >
< li > < a href = "#runOnMachineFunction" > The
2004-01-15 18:34:11 +00:00
< tt > runOnMachineFunction(MachineFunction & )< / tt > method< / a > < / li >
< / ul > < / li >
2002-08-08 20:11:18 +00:00
< / ul >
< li > < a href = "#registration" > Pass Registration< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#print" > The < tt > print< / tt > method< / a > < / li >
< / ul > < / li >
2002-08-08 20:11:18 +00:00
< li > < a href = "#interaction" > Specifying interactions between passes< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#getAnalysisUsage" > The < tt > getAnalysisUsage< / tt >
method< / a > < / li >
2004-03-17 21:09:55 +00:00
< li > < a href = "#AU::addRequired" > The < tt > AnalysisUsage::addRequired< > < / tt > and < tt > AnalysisUsage::addRequiredTransitive< > < / tt > methods< / a > < / li >
< li > < a href = "#AU::addPreserved" > The < tt > AnalysisUsage::addPreserved< > < / tt > method< / a > < / li >
< li > < a href = "#AU::examples" > Example implementations of < tt > getAnalysisUsage< / tt > < / a > < / li >
2009-01-28 13:14:17 +00:00
< li > < a href = "#getAnalysis" > The < tt > getAnalysis< > < / tt > and
< tt > getAnalysisIfAvailable< > < / tt > methods< / a > < / li >
2004-01-15 18:34:11 +00:00
< / ul > < / li >
2002-08-22 19:21:04 +00:00
< li > < a href = "#analysisgroup" > Implementing Analysis Groups< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#agconcepts" > Analysis Group Concepts< / a > < / li >
< li > < a href = "#registerag" > Using < tt > RegisterAnalysisGroup< / tt > < / a > < / li >
< / ul > < / li >
2004-11-19 01:25:14 +00:00
< li > < a href = "#passStatistics" > Pass Statistics< / a >
2002-08-08 20:11:18 +00:00
< li > < a href = "#passmanager" > What PassManager does< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#releaseMemory" > The < tt > releaseMemory< / tt > method< / a > < / li >
< / ul > < / li >
2006-08-04 18:10:12 +00:00
< li > < a href = "#registering" > Registering dynamically loaded passes< / a >
< ul >
< li > < a href = "#registering_existing" > Using existing registries< / a > < / li >
< li > < a href = "#registering_new" > Creating new registries< / a > < / li >
< / ul > < / li >
2002-09-06 02:02:58 +00:00
< li > < a href = "#debughints" > Using GDB with dynamically loaded passes< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#breakpoint" > Setting a breakpoint in your pass< / a > < / li >
< li > < a href = "#debugmisc" > Miscellaneous Problems< / a > < / li >
< / ul > < / li >
2002-08-08 20:11:18 +00:00
< li > < a href = "#future" > Future extensions planned< / a >
< ul >
2004-01-15 18:34:11 +00:00
< li > < a href = "#SMP" > Multithreaded LLVM< / a > < / li >
< / ul > < / li >
< / ol >
2004-05-23 21:07:27 +00:00
< div class = "doc_author" >
2006-08-11 16:37:02 +00:00
< p > Written by < a href = "mailto:sabre@nondot.org" > Chris Lattner< / a > and
2007-03-14 19:32:21 +00:00
< a href = "mailto:jlaskey@mac.com" > Jim Laskey< / a > < / p >
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "introduction" > Introduction - What is a pass?< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > The LLVM Pass Framework is an important part of the LLVM system, because LLVM
2004-09-18 06:39:35 +00:00
passes are where most of the interesting parts of the compiler exist. Passes
perform the transformations and optimizations that make up the compiler, they
build the analysis results that are used by these transformations, and they are,
above all, a structuring technique for compiler code.< / p >
2004-01-15 18:34:11 +00:00
< p > All LLVM passes are subclasses of the < tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1Pass.html">Pass< / a > < / tt >
2004-01-15 18:34:11 +00:00
class, which implement functionality by overriding virtual methods inherited
2004-09-20 04:36:29 +00:00
from < tt > Pass< / tt > . Depending on how your pass works, you should inherit from
the < tt > < a href = "#ModulePass" > ModulePass< / a > < / tt > , < tt > < a
href="#CallGraphSCCPass">CallGraphSCCPass< / a > < / tt > , < tt > < a
href="#FunctionPass">FunctionPass< / a > < / tt > , or < tt > < a
2007-03-19 22:21:25 +00:00
href="#LoopPass">LoopPass< / a > < / tt > , or < tt > < a
2010-10-20 01:54:44 +00:00
href="#RegionPass">RegionPass< / a > < / tt > , or < tt > < a
2004-09-18 06:39:35 +00:00
href="#BasicBlockPass">BasicBlockPass< / a > < / tt > classes, which gives the system
more information about what your pass does, and how it can be combined with
other passes. One of the main features of the LLVM Pass Framework is that it
schedules passes to run in an efficient way based on the constraints that your
pass meets (which are indicated by which class they derive from).< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > We start by showing you how to construct a pass, everything from setting up
the code, to compiling, loading, and executing it. After the basics are down,
more advanced features are discussed.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "quickstart" > Quick Start - Writing hello world< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > Here we describe how to write the "hello world" of passes. The "Hello" pass
is designed to simply print out the name of non-external functions that exist in
2004-09-18 06:39:35 +00:00
the program being compiled. It does not modify the program at all, it just
2002-08-08 20:11:18 +00:00
inspects it. The source code and files for this pass are available in the LLVM
2004-01-15 18:34:11 +00:00
source tree in the < tt > lib/Transforms/Hello< / tt > directory.< / p >
2002-08-08 20:11:18 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-01-15 18:34:11 +00:00
< a name = "makefile" > Setting up the build environment< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2011-01-01 17:28:49 +00:00
< p > First, configure and build LLVM. This needs to be done directly inside the
LLVM source tree rather than in a separate objects directory.
Next, you need to create a new directory somewhere in the LLVM source
2004-12-11 05:12:57 +00:00
base. For this example, we'll assume that you made
2011-01-01 17:28:49 +00:00
< tt > lib/Transforms/Hello< / tt > . Finally, you must set up a build script
2004-12-11 05:12:57 +00:00
(Makefile) that will compile the source code for the new pass. To do this,
copy the following into < tt > Makefile< / tt > :< / p >
2011-04-09 09:51:57 +00:00
< hr >
2004-01-15 18:34:11 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2002-08-08 20:11:18 +00:00
# Makefile for hello pass
2009-10-12 13:37:29 +00:00
# Path to top level of LLVM hierarchy
2002-08-14 20:07:01 +00:00
LEVEL = ../../..
2002-08-14 20:06:13 +00:00
# Name of the library to build
2005-01-11 05:16:23 +00:00
LIBRARYNAME = Hello
2002-08-14 20:06:13 +00:00
2005-01-11 05:16:23 +00:00
# Make the shared library become a loadable module so the tools can
# dlopen/dlsym on the resulting library.
2006-01-06 22:49:23 +00:00
LOADABLE_MODULE = 1
2005-01-11 05:16:23 +00:00
2002-08-14 20:06:13 +00:00
# Include the makefile implementation stuff
include $(LEVEL)/Makefile.common
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > This makefile specifies that all of the < tt > .cpp< / tt > files in the current
2011-01-01 17:21:58 +00:00
directory are to be compiled and linked together into a shared object
< tt > $(LEVEL)/Debug+Asserts/lib/Hello.so< / tt > that can be dynamically loaded by
2006-08-27 23:18:52 +00:00
the < tt > opt< / tt > or < tt > bugpoint< / tt > tools via their < tt > -load< / tt > options.
2005-01-11 05:16:23 +00:00
If your operating system uses a suffix other than .so (such as windows or
Mac OS/X), the appropriate extension will be used.< / p >
2004-01-26 21:26:54 +00:00
2011-04-12 19:40:35 +00:00
< p > If you are used CMake to build LLVM, see
< a href = "CMake.html#passdev" > Developing an LLVM pass with CMake< / a > .< / p >
2004-01-15 18:34:11 +00:00
< p > Now that we have the build scripts set up, we just need to write the code for
the pass itself.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-01-15 18:34:11 +00:00
< a name = "basiccode" > Basic code required< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Now that we have a way to compile our new pass, we just have to write it.
Start out with:< / p >
2002-08-08 20:11:18 +00:00
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
2006-03-14 05:39:39 +00:00
< b > #include< / b > "< a href = "http://llvm.org/doxygen/Pass_8h-source.html" > llvm/Pass.h< / a > "
< b > #include< / b > "< a href = "http://llvm.org/doxygen/Function_8h-source.html" > llvm/Function.h< / a > "
2009-09-08 05:14:44 +00:00
< b > #include< / b > "< a href = "http://llvm.org/doxygen/raw__ostream_8h.html" > llvm/Support/raw_ostream.h< / a > "
2011-10-11 07:03:52 +00:00
< / pre >
< / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Which are needed because we are writing a < tt > < a
2009-09-08 05:14:44 +00:00
href="http://llvm.org/doxygen/classllvm_1_1Pass.html">Pass< / a > < / tt > ,
2004-01-15 18:34:11 +00:00
we are operating on < tt > < a
2009-09-08 05:14:44 +00:00
href="http://llvm.org/doxygen/classllvm_1_1Function.html">Function< / a > < / tt > 's,
and we will be doing some printing.< / p >
2002-08-08 20:11:18 +00:00
2004-06-30 18:10:30 +00:00
< p > Next we have:< / p >
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
2004-06-30 18:10:30 +00:00
< b > using namespace llvm;< / b >
2011-10-11 07:03:52 +00:00
< / pre >
< / div >
2004-06-30 18:10:30 +00:00
< p > ... which is required because the functions from the include files
2011-10-11 07:03:52 +00:00
live in the llvm namespace.< / p >
2004-06-30 18:10:30 +00:00
2004-01-15 18:34:11 +00:00
< p > Next we have:< / p >
2002-08-08 20:11:18 +00:00
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
2002-08-08 20:11:18 +00:00
< b > namespace< / b > {
2011-10-11 07:03:52 +00:00
< / pre >
< / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > ... which starts out an anonymous namespace. Anonymous namespaces are to C++
2002-08-08 20:11:18 +00:00
what the "< tt > static< / tt > " keyword is to C (at global scope). It makes the
2011-10-11 07:03:52 +00:00
things declared inside of the anonymous namespace visible only to the current
2002-08-08 20:11:18 +00:00
file. If you're not familiar with them, consult a decent C++ book for more
2004-01-15 18:34:11 +00:00
information.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Next, we declare our pass itself:< / p >
2002-08-08 20:11:18 +00:00
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
2002-08-08 20:11:18 +00:00
< b > struct< / b > Hello : < b > public< / b > < a href = "#FunctionPass" > FunctionPass< / a > {
2011-10-11 07:03:52 +00:00
< / pre >
< / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > This declares a "< tt > Hello< / tt > " class that is a subclass of < tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1FunctionPass.html">FunctionPass< / a > < / tt > .
2002-09-09 03:48:46 +00:00
The different builtin pass subclasses are described in detail < a
2004-01-15 18:34:11 +00:00
href="#passtype">later< / a > , but for now, know that < a
2011-10-11 07:03:52 +00:00
href="#FunctionPass">< tt > FunctionPass< / tt > < / a > 's operate on a function at a
2004-01-15 18:34:11 +00:00
time.< / p >
2002-08-08 20:11:18 +00:00
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
static char ID;
2011-12-09 19:11:02 +00:00
Hello() : FunctionPass(ID) {}
2011-10-11 07:03:52 +00:00
< / pre >
< / div >
2007-05-01 20:55:38 +00:00
2011-10-11 07:03:52 +00:00
< p > This declares pass identifier used by LLVM to identify pass. This allows LLVM
to avoid using expensive C++ runtime information.< / p >
2007-05-01 20:55:38 +00:00
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
2004-01-15 18:34:11 +00:00
< b > virtual bool< / b > < a href = "#runOnFunction" > runOnFunction< / a > (Function & F) {
2011-10-11 07:03:52 +00:00
errs() < < "< i > Hello: < / i > ";
errs().write_escaped(F.getName()) < < "\n";
2002-08-08 20:11:18 +00:00
< b > return false< / b > ;
}
}; < i > // end of struct Hello< / i >
2011-10-11 07:03:52 +00:00
} < i > // end of anonymous namespace< / i >
< / pre >
< / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > We declare a "< a href = "#runOnFunction" > < tt > runOnFunction< / tt > < / a > " method,
which overloads an abstract virtual method inherited from < a
2002-08-08 20:11:18 +00:00
href="#FunctionPass">< tt > FunctionPass< / tt > < / a > . This is where we are supposed
to do our thing, so we just print out our message with the name of each
2004-01-15 18:34:11 +00:00
function.< / p >
2002-08-08 20:11:18 +00:00
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
char Hello::ID = 0;
< / pre >
< / div >
2007-05-01 20:55:38 +00:00
2011-10-11 07:03:52 +00:00
< p > We initialize pass ID here. LLVM uses ID's address to identify a pass, so
2007-05-01 20:55:38 +00:00
initialization value is not important.< / p >
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
static RegisterPass< Hello> X("< i > hello< / i > ", "< i > Hello World Pass< / i > ",
false /* Only looks at CFG */,
false /* Analysis Pass */);
< / pre >
< / div >
2002-08-08 20:11:18 +00:00
2011-10-11 07:03:52 +00:00
< p > Lastly, we < a href = "#registration" > register our class< / a > < tt > Hello< / tt > ,
giving it a command line argument "< tt > hello< / tt > ", and a name "< tt > Hello World
Pass< / tt > ". The last two arguments describe its behavior: if a pass walks CFG
without modifying it then the third argument is set to < tt > true< / tt > ; if a pass
is an analysis pass, for example dominator tree pass, then < tt > true< / tt > is
supplied as the fourth argument.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > As a whole, the < tt > .cpp< / tt > file looks like:< / p >
2002-08-08 20:11:18 +00:00
2011-10-11 07:03:52 +00:00
< div class = "doc_code" >
< pre >
2006-03-14 05:39:39 +00:00
< b > #include< / b > "< a href = "http://llvm.org/doxygen/Pass_8h-source.html" > llvm/Pass.h< / a > "
< b > #include< / b > "< a href = "http://llvm.org/doxygen/Function_8h-source.html" > llvm/Function.h< / a > "
2009-09-08 05:14:44 +00:00
< b > #include< / b > "< a href = "http://llvm.org/doxygen/raw__ostream_8h.html" > llvm/Support/raw_ostream.h< / a > "
2002-08-08 20:11:18 +00:00
2004-06-30 18:10:30 +00:00
< b > using namespace llvm;< / b >
2002-08-08 20:11:18 +00:00
< b > namespace< / b > {
< b > struct Hello< / b > : < b > public< / b > < a href = "#FunctionPass" > FunctionPass< / a > {
2007-05-01 20:55:38 +00:00
2007-05-03 01:11:54 +00:00
static char ID;
2011-12-09 19:11:02 +00:00
Hello() : FunctionPass(ID) {}
2007-05-01 20:55:38 +00:00
2004-01-15 18:34:11 +00:00
< b > virtual bool< / b > < a href = "#runOnFunction" > runOnFunction< / a > (Function & F) {
2011-10-11 07:03:52 +00:00
errs() < < "< i > Hello: < / i > ";
errs().write_escaped(F.getName()) < < '\n';
2002-08-08 20:11:18 +00:00
< b > return false< / b > ;
}
2011-10-11 07:03:52 +00:00
2002-08-08 20:11:18 +00:00
};
}
2011-10-11 07:03:52 +00:00
char Hello::ID = 0;
static RegisterPass< Hello> X("hello", "Hello World Pass", false, false);
< / pre >
< / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Now that it's all together, compile the file with a simple "< tt > gmake< / tt > "
2011-01-01 17:21:58 +00:00
command in the local directory and you should get a new file
"< tt > Debug+Asserts/lib/Hello.so< / tt > " under the top level directory of the LLVM
source tree (not in the local directory). Note that everything in this file is
2011-10-11 07:03:52 +00:00
contained in an anonymous namespace — this reflects the fact that passes
are self contained units that do not need external interfaces (although they can
have them) to be useful.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2006-08-27 23:18:52 +00:00
< a name = "running" > Running a pass with < tt > opt< / tt > < / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
2004-01-26 21:26:54 +00:00
< p > Now that you have a brand new shiny shared object file, we can use the
2002-08-08 20:11:18 +00:00
< tt > opt< / tt > command to run an LLVM program through your pass. Because you
2011-01-01 17:37:07 +00:00
registered your pass with < tt > RegisterPass< / tt > , you will be able to
2004-01-15 18:34:11 +00:00
use the < tt > opt< / tt > tool to access it, once loaded.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > To test it, follow the example at the end of the < a
2002-08-08 20:11:18 +00:00
href="GettingStarted.html">Getting Started Guide< / a > to compile "Hello World" to
2007-07-06 22:07:22 +00:00
LLVM. We can now run the bitcode file (< tt > hello.bc< / tt > ) for the program
through our transformation like this (or course, any bitcode file will
2004-01-15 18:34:11 +00:00
work):< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2010-07-08 08:27:18 +00:00
$ opt -load ../../../Debug+Asserts/lib/Hello.so -hello < hello.bc > /dev/null
2002-08-08 20:11:18 +00:00
Hello: __main
Hello: puts
Hello: main
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The '< tt > -load< / tt > ' option specifies that '< tt > opt< / tt > ' should load your
pass as a shared object, which makes '< tt > -hello< / tt > ' a valid command line
argument (which is one reason you need to < a href = "#registration" > register your
2002-08-08 20:11:18 +00:00
pass< / a > ). Because the hello pass does not modify the program in any
interesting way, we just throw away the result of < tt > opt< / tt > (sending it to
2004-01-15 18:34:11 +00:00
< tt > /dev/null< / tt > ).< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > To see what happened to the other string you registered, try running
2010-02-18 14:08:13 +00:00
< tt > opt< / tt > with the < tt > -help< / tt > option:< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2010-07-08 08:27:18 +00:00
$ opt -load ../../../Debug+Asserts/lib/Hello.so -help
2002-08-08 20:11:18 +00:00
OVERVIEW: llvm .bc -> .bc modular optimizer
2007-07-06 22:07:22 +00:00
USAGE: opt [options] < input bitcode>
2002-08-08 20:11:18 +00:00
OPTIONS:
Optimizations available:
...
2012-04-08 11:52:52 +00:00
-globalopt - Global Variable Optimizer
-globalsmodref-aa - Simple mod/ref analysis for globals
-gvn - Global Value Numbering
< b > -hello - Hello World Pass< / b >
-indvars - Induction Variable Simplification
-inline - Function Integration/Inlining
-insert-edge-profiling - Insert instrumentation for edge profiling
2002-08-08 20:11:18 +00:00
...
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2012-04-08 11:52:52 +00:00
< p > The pass name gets added as the information string for your pass, giving some
2002-08-08 20:11:18 +00:00
documentation to users of < tt > opt< / tt > . Now that you have a working pass, you
would go ahead and make it do the cool transformations you want. Once you get
it all working and tested, it may become useful to find out how fast your pass
is. The < a href = "#passManager" > < tt > PassManager< / tt > < / a > provides a nice command
line option (< tt > --time-passes< / tt > ) that allows you to get information about
the execution time of your pass along with the other passes you queue up. For
2004-01-15 18:34:11 +00:00
example:< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2010-07-08 08:27:18 +00:00
$ opt -load ../../../Debug+Asserts/lib/Hello.so -hello -time-passes < hello.bc > /dev/null
2002-08-08 20:11:18 +00:00
Hello: __main
Hello: puts
Hello: main
===============================================================================
... Pass execution timing report ...
===============================================================================
Total Execution Time: 0.02 seconds (0.0479059 wall clock)
---User Time--- --System Time-- --User+System-- ---Wall Time--- --- Pass Name ---
2007-07-06 22:07:22 +00:00
0.0100 (100.0%) 0.0000 ( 0.0%) 0.0100 ( 50.0%) 0.0402 ( 84.0%) Bitcode Writer
2002-08-08 20:11:18 +00:00
0.0000 ( 0.0%) 0.0100 (100.0%) 0.0100 ( 50.0%) 0.0031 ( 6.4%) Dominator Set Construction
0.0000 ( 0.0%) 0.0000 ( 0.0%) 0.0000 ( 0.0%) 0.0013 ( 2.7%) Module Verifier
< b > 0.0000 ( 0.0%) 0.0000 ( 0.0%) 0.0000 ( 0.0%) 0.0033 ( 6.9%) Hello World Pass< / b >
0.0100 (100.0%) 0.0100 (100.0%) 0.0200 (100.0%) 0.0479 (100.0%) TOTAL
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > As you can see, our implementation above is pretty fast :). The additional
2002-08-08 20:11:18 +00:00
passes listed are automatically inserted by the '< tt > opt< / tt > ' tool to verify
that the LLVM emitted by your pass is still valid and well formed LLVM, which
2004-01-15 18:34:11 +00:00
hasn't been broken somehow.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Now that you have seen the basics of the mechanics behind passes, we can talk
about some more details of how they work and how to use them.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "passtype" > Pass classes and requirements< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > One of the first things that you should do when designing a new pass is to
2002-08-08 20:11:18 +00:00
decide what class you should subclass for your pass. The < a
href="#basiccode">Hello World< / a > example uses the < tt > < a
href="#FunctionPass">FunctionPass< / a > < / tt > class for its implementation, but we
did not discuss why or when this should occur. Here we talk about the classes
2004-01-15 18:34:11 +00:00
available, from the most general to the most specific.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > When choosing a superclass for your Pass, you should choose the < b > most
2002-08-22 19:21:04 +00:00
specific< / b > class possible, while still being able to meet the requirements
2003-08-18 14:43:39 +00:00
listed. This gives the LLVM Pass Infrastructure information necessary to
2009-10-12 14:46:08 +00:00
optimize how passes are run, so that the resultant compiler isn't unnecessarily
2004-01-15 18:34:11 +00:00
slow.< / p >
2002-08-08 20:11:18 +00:00
2002-09-25 22:31:38 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-01-15 18:34:11 +00:00
< a name = "ImmutablePass" > The < tt > ImmutablePass< / tt > class< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > The most plain and boring type of pass is the "< tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1ImmutablePass.html">ImmutablePass< / a > < / tt > "
2002-09-25 22:31:38 +00:00
class. This pass type is used for passes that do not have to be run, do not
change state, and never need to be updated. This is not a normal type of
transformation or analysis, but can provide information about the current
2004-01-15 18:34:11 +00:00
compiler configuration.< / p >
2002-09-25 22:31:38 +00:00
2004-01-15 18:34:11 +00:00
< p > Although this pass class is very infrequently used, it is important for
2002-09-25 22:31:38 +00:00
providing information about the current target machine being compiled for, and
2004-01-15 18:34:11 +00:00
other static information that can affect the various transformations.< / p >
2002-09-25 22:31:38 +00:00
2004-01-15 18:34:11 +00:00
< p > < tt > ImmutablePass< / tt > es never invalidate other transformations, are never
invalidated, and are never "run".< / p >
2002-09-25 22:31:38 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-09-20 04:36:29 +00:00
< a name = "ModulePass" > The < tt > ModulePass< / tt > class< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > The "< tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1ModulePass.html">ModulePass< / a > < / tt > "
2002-08-08 20:11:18 +00:00
class is the most general of all superclasses that you can use. Deriving from
2004-09-20 04:36:29 +00:00
< tt > ModulePass< / tt > indicates that your pass uses the entire program as a unit,
2009-10-12 14:46:08 +00:00
referring to function bodies in no predictable order, or adding and removing
2004-09-20 04:36:29 +00:00
functions. Because nothing is known about the behavior of < tt > ModulePass< / tt >
2009-07-01 23:38:44 +00:00
subclasses, no optimization can be done for their execution.< / p >
< p > A module pass can use function level passes (e.g. dominators) using
the getAnalysis interface
< tt > getAnalysis< DominatorTree> (llvm::Function *)< / tt > to provide the
function to retrieve analysis result for, if the function pass does not require
2009-08-10 16:37:29 +00:00
any module or immutable passes. Note that this can only be done for functions for which the
2009-07-01 23:38:44 +00:00
analysis ran, e.g. in the case of dominators you should only ask for the
DominatorTree for function definitions, not declarations.< / p >
2004-01-15 18:34:11 +00:00
2004-09-20 04:36:29 +00:00
< p > To write a correct < tt > ModulePass< / tt > subclass, derive from
< tt > ModulePass< / tt > and overload the < tt > runOnModule< / tt > method with the
following signature:< / p >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-09-20 04:36:29 +00:00
< a name = "runOnModule" > The < tt > runOnModule< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > runOnModule(Module & M) = 0;
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2005-07-15 19:25:12 +00:00
< p > The < tt > runOnModule< / tt > method performs the interesting work of the pass.
It should return true if the module was modified by the transformation and
false otherwise.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2004-09-18 06:39:35 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-09-18 06:39:35 +00:00
< a name = "CallGraphSCCPass" > The < tt > CallGraphSCCPass< / tt > class< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2004-09-18 06:39:35 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-09-18 06:39:35 +00:00
< p > The "< tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1CallGraphSCCPass.html">CallGraphSCCPass< / a > < / tt > "
2004-09-18 06:39:35 +00:00
is used by passes that need to traverse the program bottom-up on the call graph
(callees before callers). Deriving from CallGraphSCCPass provides some
mechanics for building and traversing the CallGraph, but also allows the system
to optimize execution of CallGraphSCCPass's. If your pass meets the
requirements outlined below, and doesn't meet the requirements of a < tt > < a
href="#FunctionPass">FunctionPass< / a > < / tt > or < tt > < a
href="#BasicBlockPass">BasicBlockPass< / a > < / tt > , you should derive from
< tt > CallGraphSCCPass< / tt > .< / p >
< p > < b > TODO< / b > : explain briefly what SCC, Tarjan's algo, and B-U mean.< / p >
< p > To be explicit, < tt > CallGraphSCCPass< / tt > subclasses are:< / p >
< ol >
2011-01-03 06:16:07 +00:00
< li > ... < em > not allowed< / em > to inspect or modify any < tt > Function< / tt > s other
than those in the current SCC and the direct callers and direct callees of the
SCC.< / li >
2004-09-18 06:39:35 +00:00
< li > ... < em > required< / em > to preserve the current CallGraph object, updating it
to reflect any changes made to the program.< / li >
< li > ... < em > not allowed< / em > to add or remove SCC's from the current Module,
though they may change the contents of an SCC.< / li >
< li > ... < em > allowed< / em > to add or remove global variables from the current
Module.< / li >
< li > ... < em > allowed< / em > to maintain state across invocations of
< a href = "#runOnSCC" > < tt > runOnSCC< / tt > < / a > (including global data).< / li >
< / ol >
< p > Implementing a < tt > CallGraphSCCPass< / tt > is slightly tricky in some cases
because it has to handle SCCs with more than one node in it. All of the virtual
methods described below should return true if they modified the program, or
false if they didn't.< / p >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doInitialization_scc" >
The < tt > doInitialization(CallGraph & )< / tt > method
< / a >
< / h4 >
2004-09-18 06:39:35 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-09-18 06:39:35 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doInitialization(CallGraph & CG);
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2004-09-18 06:39:35 +00:00
< p > The < tt > doIninitialize< / tt > method is allowed to do most of the things that
< tt > CallGraphSCCPass< / tt > 's are not allowed to do. They can add and remove
functions, get pointers to functions, etc. The < tt > doInitialization< / tt > method
is designed to do simple initialization type of stuff that does not depend on
the SCCs being processed. The < tt > doInitialization< / tt > method call is not
scheduled to overlap with any other pass executions (thus it should be very
fast).< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-09-18 06:39:35 +00:00
< a name = "runOnSCC" > The < tt > runOnSCC< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-09-18 06:39:35 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-09-18 06:39:35 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > runOnSCC(CallGraphSCC & SCC) = 0;
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2004-09-18 06:39:35 +00:00
< p > The < tt > runOnSCC< / tt > method performs the interesting work of the pass, and
should return true if the module was modified by the transformation, false
otherwise.< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doFinalization_scc" >
The < tt > doFinalization(CallGraph & )< / tt > method
< / a >
< / h4 >
2004-09-18 06:39:35 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-09-18 06:39:35 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doFinalization(CallGraph & CG);
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2004-09-18 06:39:35 +00:00
< p > The < tt > doFinalization< / tt > method is an infrequently used method that is
called when the pass framework has finished calling < a
href="#runOnFunction">< tt > runOnFunction< / tt > < / a > for every function in the
program being compiled.< / p >
< / div >
2011-04-23 00:30:22 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-01-15 18:34:11 +00:00
< a name = "FunctionPass" > The < tt > FunctionPass< / tt > class< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
2004-09-20 04:36:29 +00:00
< p > In contrast to < tt > ModulePass< / tt > subclasses, < tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1Pass.html">FunctionPass< / a > < / tt >
2002-08-08 20:11:18 +00:00
subclasses do have a predictable, local behavior that can be expected by the
system. All < tt > FunctionPass< / tt > execute on each function in the program
2003-08-21 22:14:26 +00:00
independent of all of the other functions in the program.
2002-08-08 20:11:18 +00:00
< tt > FunctionPass< / tt > 's do not require that they are executed in a particular
2004-01-15 18:34:11 +00:00
order, and < tt > FunctionPass< / tt > 's do not modify external functions.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > To be explicit, < tt > FunctionPass< / tt > subclasses are not allowed to:< / p >
2002-08-08 20:11:18 +00:00
< ol >
2004-01-15 18:34:11 +00:00
< li > Modify a Function other than the one currently being processed.< / li >
< li > Add or remove Function's from the current Module.< / li >
< li > Add or remove global variables from the current Module.< / li >
2002-08-08 20:11:18 +00:00
< li > Maintain state across invocations of
2004-01-15 18:34:11 +00:00
< a href = "#runOnFunction" > < tt > runOnFunction< / tt > < / a > (including global data)< / li >
< / ol >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Implementing a < tt > FunctionPass< / tt > is usually straightforward (See the < a
2002-08-08 20:11:18 +00:00
href="#basiccode">Hello World< / a > pass for example). < tt > FunctionPass< / tt > 's
may overload three virtual methods to do their work. All of these methods
2004-01-15 18:34:11 +00:00
should return true if they modified the program, or false if they didn't.< / p >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doInitialization_mod" >
The < tt > doInitialization(Module & )< / tt > method
< / a >
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doInitialization(Module & M);
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > doIninitialize< / tt > method is allowed to do most of the things that
2002-08-08 20:11:18 +00:00
< tt > FunctionPass< / tt > 's are not allowed to do. They can add and remove
2002-09-12 17:06:43 +00:00
functions, get pointers to functions, etc. The < tt > doInitialization< / tt > method
is designed to do simple initialization type of stuff that does not depend on
the functions being processed. The < tt > doInitialization< / tt > method call is not
scheduled to overlap with any other pass executions (thus it should be very
2004-01-15 18:34:11 +00:00
fast).< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > A good example of how this method should be used is the < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/LowerAllocations_8cpp-source.html">LowerAllocations< / a >
2002-08-08 20:11:18 +00:00
pass. This pass converts < tt > malloc< / tt > and < tt > free< / tt > instructions into
2003-08-21 22:14:26 +00:00
platform dependent < tt > malloc()< / tt > and < tt > free()< / tt > function calls. It
2002-08-08 20:11:18 +00:00
uses the < tt > doInitialization< / tt > method to get a reference to the malloc and
2004-01-15 18:34:11 +00:00
free functions that it needs, adding prototypes to the module if necessary.< / p >
< / div >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "runOnFunction" > The < tt > runOnFunction< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > runOnFunction(Function & F) = 0;
2006-08-04 18:10:12 +00:00
< / pre > < / div > < p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > runOnFunction< / tt > method must be implemented by your subclass to do
the transformation or analysis work of your pass. As usual, a true value should
be returned if the function is modified.< / p >
< / div >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doFinalization_mod" >
The < tt > doFinalization(Module & )< / tt > method
< / a >
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doFinalization(Module & M);
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > doFinalization< / tt > method is an infrequently used method that is
called when the pass framework has finished calling < a
2002-08-08 20:11:18 +00:00
href="#runOnFunction">< tt > runOnFunction< / tt > < / a > for every function in the
2004-01-15 18:34:11 +00:00
program being compiled.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2007-03-19 22:21:25 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2007-03-19 22:21:25 +00:00
< a name = "LoopPass" > The < tt > LoopPass< / tt > class < / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2007-03-19 22:21:25 +00:00
2011-04-23 00:30:22 +00:00
< div >
2007-03-19 22:21:25 +00:00
< p > All < tt > LoopPass< / tt > execute on each loop in the function independent of
all of the other loops in the function. < tt > LoopPass< / tt > processes loops in
loop nest order such that outer most loop is processed last. < / p >
< p > < tt > LoopPass< / tt > subclasses are allowed to update loop nest using
< tt > LPPassManager< / tt > interface. Implementing a loop pass is usually
2011-04-07 12:41:09 +00:00
straightforward. < tt > LoopPass< / tt > 's may overload three virtual methods to
2007-03-19 22:21:25 +00:00
do their work. All these methods should return true if they modified the
program, or false if they didn't. < / p >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doInitialization_loop" >
The < tt > doInitialization(Loop *,LPPassManager & )< / tt > method
< / a >
< / h4 >
2007-03-19 22:21:25 +00:00
2011-04-23 00:30:22 +00:00
< div >
2007-03-19 22:21:25 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doInitialization(Loop *, LPPassManager & LPM);
2007-03-19 22:21:25 +00:00
< / pre > < / div >
2007-05-18 05:36:14 +00:00
< p > The < tt > doInitialization< / tt > method is designed to do simple initialization
2007-03-19 22:21:25 +00:00
type of stuff that does not depend on the functions being processed. The
< tt > doInitialization< / tt > method call is not scheduled to overlap with any
other pass executions (thus it should be very fast). LPPassManager
interface should be used to access Function or Module level analysis
information.< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2007-03-19 22:21:25 +00:00
< a name = "runOnLoop" > The < tt > runOnLoop< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2007-03-19 22:21:25 +00:00
2011-04-23 00:30:22 +00:00
< div >
2007-03-19 22:21:25 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > runOnLoop(Loop *, LPPassManager & LPM) = 0;
2007-03-19 22:21:25 +00:00
< / pre > < / div > < p >
< p > The < tt > runOnLoop< / tt > method must be implemented by your subclass to do
the transformation or analysis work of your pass. As usual, a true value should
be returned if the function is modified. < tt > LPPassManager< / tt > interface
should be used to update loop nest.< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2007-03-19 22:21:25 +00:00
< a name = "doFinalization_loop" > The < tt > doFinalization()< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2007-03-19 22:21:25 +00:00
2011-04-23 00:30:22 +00:00
< div >
2007-03-19 22:21:25 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doFinalization();
2007-03-19 22:21:25 +00:00
< / pre > < / div >
< p > The < tt > doFinalization< / tt > method is an infrequently used method that is
called when the pass framework has finished calling < a
href="#runOnLoop">< tt > runOnLoop< / tt > < / a > for every loop in the
program being compiled. < / p >
< / div >
2011-04-23 00:30:22 +00:00
< / div >
2010-10-20 01:54:44 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2010-10-20 01:54:44 +00:00
< a name = "RegionPass" > The < tt > RegionPass< / tt > class < / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2010-10-20 01:54:44 +00:00
2011-04-23 00:30:22 +00:00
< div >
2010-10-20 01:54:44 +00:00
< p > < tt > RegionPass< / tt > is similar to < a href = "#LoopPass" > < tt > LoopPass< / tt > < / a > ,
but executes on each single entry single exit region in the function.
< tt > RegionPass< / tt > processes regions in nested order such that the outer most
region is processed last. < / p >
< p > < tt > RegionPass< / tt > subclasses are allowed to update the region tree by using
the < tt > RGPassManager< / tt > interface. You may overload three virtual methods of
2011-04-07 12:41:09 +00:00
< tt > RegionPass< / tt > to implement your own region pass. All these
2010-10-20 01:54:44 +00:00
methods should return true if they modified the program, or false if they didn not.
< / p >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doInitialization_region" >
The < tt > doInitialization(Region *, RGPassManager & )< / tt > method
< / a >
< / h4 >
2010-10-20 01:54:44 +00:00
2011-04-23 00:30:22 +00:00
< div >
2010-10-20 01:54:44 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doInitialization(Region *, RGPassManager & RGM);
2010-10-20 01:54:44 +00:00
< / pre > < / div >
< p > The < tt > doInitialization< / tt > method is designed to do simple initialization
type of stuff that does not depend on the functions being processed. The
< tt > doInitialization< / tt > method call is not scheduled to overlap with any
other pass executions (thus it should be very fast). RPPassManager
interface should be used to access Function or Module level analysis
information.< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2010-10-20 01:54:44 +00:00
< a name = "runOnRegion" > The < tt > runOnRegion< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2010-10-20 01:54:44 +00:00
2011-04-23 00:30:22 +00:00
< div >
2010-10-20 01:54:44 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > runOnRegion(Region *, RGPassManager & RGM) = 0;
2010-10-20 01:54:44 +00:00
< / pre > < / div > < p >
< p > The < tt > runOnRegion< / tt > method must be implemented by your subclass to do
the transformation or analysis work of your pass. As usual, a true value should
be returned if the region is modified. < tt > RGPassManager< / tt > interface
should be used to update region tree.< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2010-10-20 01:54:44 +00:00
< a name = "doFinalization_region" > The < tt > doFinalization()< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2010-10-20 01:54:44 +00:00
2011-04-23 00:30:22 +00:00
< div >
2010-10-20 01:54:44 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doFinalization();
2010-10-20 01:54:44 +00:00
< / pre > < / div >
< p > The < tt > doFinalization< / tt > method is an infrequently used method that is
called when the pass framework has finished calling < a
href="#runOnRegion">< tt > runOnRegion< / tt > < / a > for every region in the
program being compiled. < / p >
< / div >
2011-04-23 00:30:22 +00:00
< / div >
2007-03-19 22:21:25 +00:00
2002-08-08 20:11:18 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-01-15 18:34:11 +00:00
< a name = "BasicBlockPass" > The < tt > BasicBlockPass< / tt > class< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > < tt > BasicBlockPass< / tt > 's are just like < a
2002-08-08 20:11:18 +00:00
href="#FunctionPass">< tt > FunctionPass< / tt > < / a > 's, except that they must limit
their scope of inspection and modification to a single basic block at a time.
2004-01-15 18:34:11 +00:00
As such, they are < b > not< / b > allowed to do any of the following:< / p >
2002-08-08 20:11:18 +00:00
< ol >
2004-01-15 18:34:11 +00:00
< li > Modify or inspect any basic blocks outside of the current one< / li >
2002-08-08 20:11:18 +00:00
< li > Maintain state across invocations of
2004-01-15 18:34:11 +00:00
< a href = "#runOnBasicBlock" > < tt > runOnBasicBlock< / tt > < / a > < / li >
2004-12-11 05:12:57 +00:00
< li > Modify the control flow graph (by altering terminator instructions)< / li >
< li > Any of the things forbidden for
2004-01-15 18:34:11 +00:00
< a href = "#FunctionPass" > < tt > FunctionPass< / tt > < / a > es.< / li >
< / ol >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > < tt > BasicBlockPass< / tt > es are useful for traditional local and "peephole"
2002-08-08 20:11:18 +00:00
optimizations. They may override the same < a
2002-09-12 17:06:43 +00:00
href="#doInitialization_mod">< tt > doInitialization(Module & )< / tt > < / a > and < a
href="#doFinalization_mod">< tt > doFinalization(Module & )< / tt > < / a > methods that < a
2004-01-15 18:34:11 +00:00
href="#FunctionPass">< tt > FunctionPass< / tt > < / a > 's have, but also have the following virtual methods that may also be implemented:< / p >
2002-09-12 17:06:43 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doInitialization_fn" >
The < tt > doInitialization(Function & )< / tt > method
< / a >
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-09-12 17:06:43 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doInitialization(Function & F);
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-09-12 17:06:43 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > doIninitialize< / tt > method is allowed to do most of the things that
2002-09-12 17:06:43 +00:00
< tt > BasicBlockPass< / tt > 's are not allowed to do, but that
< tt > FunctionPass< / tt > 's can. The < tt > doInitialization< / tt > method is designed
2004-12-11 05:12:57 +00:00
to do simple initialization that does not depend on the
2002-09-12 17:06:43 +00:00
BasicBlocks being processed. The < tt > doInitialization< / tt > method call is not
scheduled to overlap with any other pass executions (thus it should be very
2004-01-15 18:34:11 +00:00
fast).< / p >
2002-09-12 17:06:43 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "runOnBasicBlock" > The < tt > runOnBasicBlock< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > runOnBasicBlock(BasicBlock & BB) = 0;
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Override this function to do the work of the < tt > BasicBlockPass< / tt > . This
2002-08-08 20:11:18 +00:00
function is not allowed to inspect or modify basic blocks other than the
parameter, and are not allowed to modify the CFG. A true value must be returned
2004-01-15 18:34:11 +00:00
if the basic block is modified.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2002-09-12 17:06:43 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "doFinalization_fn" >
The < tt > doFinalization(Function & )< / tt > method
< / a >
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-09-12 17:06:43 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > doFinalization(Function & F);
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-09-12 17:06:43 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > doFinalization< / tt > method is an infrequently used method that is
called when the pass framework has finished calling < a
2002-09-12 17:06:43 +00:00
href="#runOnBasicBlock">< tt > runOnBasicBlock< / tt > < / a > for every BasicBlock in the
program being compiled. This can be used to perform per-function
2004-01-15 18:34:11 +00:00
finalization.< / p >
2002-09-12 17:06:43 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-09-12 17:06:43 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2003-07-17 18:53:20 +00:00
<!-- ======================================================================= -->
2011-04-18 23:59:50 +00:00
< h3 >
2004-01-15 18:34:11 +00:00
< a name = "MachineFunctionPass" > The < tt > MachineFunctionPass< / tt > class< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2003-07-17 18:53:20 +00:00
2004-03-17 21:09:55 +00:00
< p > A < tt > MachineFunctionPass< / tt > is a part of the LLVM code generator that
executes on the machine-dependent representation of each LLVM function in the
2010-03-10 01:29:39 +00:00
program.< / p >
< p > Code generator passes are registered and initialized specially by
< tt > TargetMachine::addPassesToEmitFile< / tt > and similar routines, so they
cannot generally be run from the < tt > opt< / tt > or < tt > bugpoint< / tt >
commands.< / p >
< p > A < tt > MachineFunctionPass< / tt > is also a < tt > FunctionPass< / tt > , so all
2003-07-17 18:53:20 +00:00
the restrictions that apply to a < tt > FunctionPass< / tt > also apply to it.
2004-03-17 21:09:55 +00:00
< tt > MachineFunctionPass< / tt > es also have additional restrictions. In particular,
< tt > MachineFunctionPass< / tt > es are not allowed to do any of the following:< / p >
2003-07-17 18:53:20 +00:00
< ol >
2010-03-10 01:29:39 +00:00
< li > Modify or create any LLVM IR Instructions, BasicBlocks, Arguments,
Functions, GlobalVariables, GlobalAliases, or Modules.< / li >
2004-01-15 18:34:11 +00:00
< li > Modify a MachineFunction other than the one currently being processed.< / li >
< li > Maintain state across invocations of < a
href="#runOnMachineFunction">< tt > runOnMachineFunction< / tt > < / a > (including global
data)< / li >
< / ol >
2003-07-17 18:53:20 +00:00
2003-07-22 20:53:20 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "runOnMachineFunction" >
The < tt > runOnMachineFunction(MachineFunction & MF)< / tt > method
< / a >
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2003-07-22 20:53:20 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual bool< / b > runOnMachineFunction(MachineFunction & MF) = 0;
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2003-07-22 20:53:20 +00:00
2004-01-15 18:34:11 +00:00
< p > < tt > runOnMachineFunction< / tt > can be considered the main entry point of a
< tt > MachineFunctionPass< / tt > ; that is, you should override this method to do the
work of your < tt > MachineFunctionPass< / tt > .< / p >
2003-07-22 20:53:20 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > runOnMachineFunction< / tt > method is called on every
2003-07-22 20:53:20 +00:00
< tt > MachineFunction< / tt > in a < tt > Module< / tt > , so that the
2004-01-15 18:34:11 +00:00
< tt > MachineFunctionPass< / tt > may perform optimizations on the machine-dependent
representation of the function. If you want to get at the LLVM < tt > Function< / tt >
for the < tt > MachineFunction< / tt > you're working on, use
< tt > MachineFunction< / tt > 's < tt > getFunction()< / tt > accessor method -- but
remember, you may not modify the LLVM < tt > Function< / tt > or its contents from a
< tt > MachineFunctionPass< / tt > .< / p >
< / div >
2003-07-22 20:53:20 +00:00
2011-04-23 00:30:22 +00:00
< / div >
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "registration" > Pass registration< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > In the < a href = "#basiccode" > Hello World< / a > example pass we illustrated how
pass registration works, and discussed some of the reasons that it is used and
what it does. Here we discuss how and why passes are registered.< / p >
2002-08-08 20:11:18 +00:00
2011-01-01 17:37:07 +00:00
< p > As we saw above, passes are registered with the < b > < tt > RegisterPass< / tt > < / b >
template. The template parameter is the name of the pass that is to be used on
2002-08-08 20:11:18 +00:00
the command line to specify that the pass should be added to a program (for
2011-01-01 17:37:07 +00:00
example, with < tt > opt< / tt > or < tt > bugpoint< / tt > ). The first argument is the
2010-02-18 14:08:13 +00:00
name of the pass, which is to be used for the < tt > -help< / tt > output of
2006-08-27 23:18:52 +00:00
programs, as
2004-01-15 18:34:11 +00:00
well as for debug output generated by the < tt > --debug-pass< / tt > option.< / p >
2002-08-08 20:11:18 +00:00
2006-08-27 23:18:52 +00:00
< p > If you want your pass to be easily dumpable, you should
implement the virtual < tt > print< / tt > method:< / p >
2004-01-15 18:34:11 +00:00
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "print" > The < tt > print< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual void< / b > print(std::ostream & O, < b > const< / b > Module *M) < b > const< / b > ;
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > print< / tt > method must be implemented by "analyses" in order to print
a human readable version of the analysis results. This is useful for debugging
an analysis itself, as well as for other people to figure out how an analysis
2006-08-27 23:18:52 +00:00
works. Use the < tt > opt -analyze< / tt > argument to invoke this method.< / p >
2002-08-08 20:11:18 +00:00
2006-12-07 20:04:42 +00:00
< p > The < tt > llvm::OStream< / tt > parameter specifies the stream to write the results on,
2004-01-15 18:34:11 +00:00
and the < tt > Module< / tt > parameter gives a pointer to the top level module of the
2002-08-08 20:11:18 +00:00
program that has been analyzed. Note however that this pointer may be null in
certain circumstances (such as calling the < tt > Pass::dump()< / tt > from a
debugger), so it should only be used to enhance debug output, it should not be
2004-01-15 18:34:11 +00:00
depended on.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "interaction" > Specifying interactions between passes< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
2007-12-03 19:34:25 +00:00
< p > One of the main responsibilities of the < tt > PassManager< / tt > is to make sure
2002-08-08 20:11:18 +00:00
that passes interact with each other correctly. Because < tt > PassManager< / tt >
tries to < a href = "#passmanager" > optimize the execution of passes< / a > it must
know how the passes interact with each other and what dependencies exist between
the various passes. To track this, each pass can declare the set of passes that
are required to be executed before the current pass, and the passes which are
2004-01-15 18:34:11 +00:00
invalidated by the current pass.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Typically this functionality is used to require that analysis results are
2002-08-08 20:11:18 +00:00
computed before your pass is run. Running arbitrary transformation passes can
invalidate the computed analysis results, which is what the invalidation set
specifies. If a pass does not implement the < tt > < a
href="#getAnalysisUsage">getAnalysisUsage< / a > < / tt > method, it defaults to not
2004-01-15 18:34:11 +00:00
having any prerequisite passes, and invalidating < b > all< / b > other passes.< / p >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "getAnalysisUsage" > The < tt > getAnalysisUsage< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > virtual void< / b > getAnalysisUsage(AnalysisUsage & Info) < b > const< / b > ;
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > By implementing the < tt > getAnalysisUsage< / tt > method, the required and
2002-08-08 20:11:18 +00:00
invalidated sets may be specified for your transformation. The implementation
should fill in the < tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1AnalysisUsage.html">AnalysisUsage< / a > < / tt >
2004-01-15 18:34:11 +00:00
object with information about which passes are required and not invalidated. To
2004-03-17 21:09:55 +00:00
do this, a pass may call any of the following methods on the AnalysisUsage
object:< / p >
< / div >
2002-08-08 20:11:18 +00:00
2004-03-17 21:09:55 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "AU::addRequired" >
The < tt > AnalysisUsage::addRequired< > < / tt >
and < tt > AnalysisUsage::addRequiredTransitive< > < / tt > methods
< / a >
< / h4 >
2004-03-17 21:09:55 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-03-17 21:09:55 +00:00
< p >
2004-12-11 05:12:57 +00:00
If your pass requires a previous pass to be executed (an analysis for example),
2004-03-17 21:09:55 +00:00
it can use one of these methods to arrange for it to be run before your pass.
LLVM has many different types of analyses and passes that can be required,
2004-12-11 05:12:57 +00:00
spanning the range from < tt > DominatorSet< / tt > to < tt > BreakCriticalEdges< / tt > .
Requiring < tt > BreakCriticalEdges< / tt > , for example, guarantees that there will
2004-03-17 21:09:55 +00:00
be no critical edges in the CFG when your pass has been run.
< / p >
< p >
Some analyses chain to other analyses to do their job. For example, an < a
href="AliasAnalysis.html">AliasAnalysis< / a > implementation is required to < a
href="AliasAnalysis.html#chaining">chain< / a > to other alias analysis passes. In
cases where analyses chain, the < tt > addRequiredTransitive< / tt > method should be
used instead of the < tt > addRequired< / tt > method. This informs the PassManager
that the transitively required pass should be alive as long as the requiring
pass is.
< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "AU::addPreserved" >
The < tt > AnalysisUsage::addPreserved< > < / tt > method
< / a >
< / h4 >
2004-03-17 21:09:55 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-03-17 21:09:55 +00:00
< p >
One of the jobs of the PassManager is to optimize how and when analyses are run.
In particular, it attempts to avoid recomputing data unless it needs to. For
this reason, passes are allowed to declare that they preserve (i.e., they don't
invalidate) an existing analysis if it's available. For example, a simple
2004-12-11 05:12:57 +00:00
constant folding pass would not modify the CFG, so it can't possibly affect the
2004-03-17 21:09:55 +00:00
results of dominator analysis. By default, all passes are assumed to invalidate
all others.
< / p >
< p >
The < tt > AnalysisUsage< / tt > class provides several methods which are useful in
certain circumstances that are related to < tt > addPreserved< / tt > . In particular,
the < tt > setPreservesAll< / tt > method can be called to indicate that the pass does
not modify the LLVM program at all (which is true for analyses), and the
< tt > setPreservesCFG< / tt > method can be used by transformations that change
instructions in the program but do not modify the CFG or terminator instructions
(note that this property is implicitly set for < a
href="#BasicBlockPass">BasicBlockPass< / a > 's).
< / p >
< p >
< tt > addPreserved< / tt > is particularly useful for transformations like
< tt > BreakCriticalEdges< / tt > . This pass knows how to update a small set of loop
and dominator related analyses if they exist, so it can preserve them, despite
the fact that it hacks on the CFG.
< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "AU::examples" >
Example implementations of < tt > getAnalysisUsage< / tt >
< / a >
< / h4 >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< i > // This example modifies the program, but does not modify the CFG< / i >
< b > void< / b > < a href = "http://llvm.org/doxygen/structLICM.html" > LICM< / a > ::getAnalysisUsage(AnalysisUsage & AU) < b > const< / b > {
AU.setPreservesCFG();
AU.addRequired< < a href = "http://llvm.org/doxygen/classllvm_1_1LoopInfo.html" > LoopInfo< / a > > ();
}
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
< a name = "getAnalysis" >
The < tt > getAnalysis< > < / tt > and
< tt > getAnalysisIfAvailable< > < / tt > methods
< / a >
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2004-03-17 21:09:55 +00:00
< p > The < tt > Pass::getAnalysis< > < / tt > method is automatically inherited by
your class, providing you with access to the passes that you declared that you
required with the < a href = "#getAnalysisUsage" > < tt > getAnalysisUsage< / tt > < / a >
method. It takes a single template argument that specifies which pass class you
want, and returns a reference to that pass. For example:< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
bool LICM::runOnFunction(Function & F) {
LoopInfo & LI = getAnalysis< LoopInfo> ();
...
}
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > This method call returns a reference to the pass desired. You may get a
runtime assertion failure if you attempt to get an analysis that you did not
declare as required in your < a
href="#getAnalysisUsage">< tt > getAnalysisUsage< / tt > < / a > implementation. This
method can be called by your < tt > run*< / tt > method implementation, or by any
2007-04-16 21:28:14 +00:00
other local method invoked by your < tt > run*< / tt > method.
A module level pass can use function level analysis info using this interface.
For example:< / p >
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
bool ModuleLevelPass::runOnModule(Module & M) {
...
DominatorTree & DT = getAnalysis< DominatorTree> (Func);
...
}
2007-04-16 21:28:14 +00:00
< / pre > < / div >
2007-05-18 05:36:14 +00:00
< p > In above example, runOnFunction for DominatorTree is called by pass manager
2007-04-16 21:28:14 +00:00
before returning a reference to the desired pass.< / p >
2004-01-15 18:34:11 +00:00
2004-03-17 21:09:55 +00:00
< p >
If your pass is capable of updating analyses if they exist (e.g.,
< tt > BreakCriticalEdges< / tt > , as described above), you can use the
2009-01-28 13:14:17 +00:00
< tt > getAnalysisIfAvailable< / tt > method, which returns a pointer to the analysis
if it is active. For example:< / p >
2004-03-17 21:09:55 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
...
if (DominatorSet *DS = getAnalysisIfAvailable< DominatorSet> ()) {
< i > // A DominatorSet is active. This code will update it.< / i >
}
...
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2004-03-17 21:09:55 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2002-08-22 19:21:04 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "analysisgroup" > Implementing Analysis Groups< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-22 19:21:04 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
2007-11-16 05:32:05 +00:00
< p > Now that we understand the basics of how passes are defined, how they are
2004-01-15 18:34:11 +00:00
used, and how they are required from other passes, it's time to get a little bit
2002-08-22 19:21:04 +00:00
fancier. All of the pass relationships that we have seen so far are very
simple: one pass depends on one other specific pass to be run before it can run.
For many applications, this is great, for others, more flexibility is
2004-01-15 18:34:11 +00:00
required.< / p >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< p > In particular, some analyses are defined such that there is a single simple
2002-08-22 19:21:04 +00:00
interface to the analysis results, but multiple ways of calculating them.
Consider alias analysis for example. The most trivial alias analysis returns
"may alias" for any alias query. The most sophisticated analysis a
flow-sensitive, context-sensitive interprocedural analysis that can take a
significant amount of time to execute (and obviously, there is a lot of room
between these two extremes for other implementations). To cleanly support
situations like this, the LLVM Pass Infrastructure supports the notion of
2004-01-15 18:34:11 +00:00
Analysis Groups.< / p >
2002-08-22 19:21:04 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "agconcepts" > Analysis Group Concepts< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< p > An Analysis Group is a single simple interface that may be implemented by
2002-08-22 19:21:04 +00:00
multiple different passes. Analysis Groups can be given human readable names
just like passes, but unlike passes, they need not derive from the < tt > Pass< / tt >
class. An analysis group may have one or more implementations, one of which is
2004-01-15 18:34:11 +00:00
the "default" implementation.< / p >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< p > Analysis groups are used by client passes just like other passes are: the
2002-08-22 19:21:04 +00:00
< tt > AnalysisUsage::addRequired()< / tt > and < tt > Pass::getAnalysis()< / tt > methods.
In order to resolve this requirement, the < a href = "#passmanager" > PassManager< / a >
scans the available passes to see if any implementations of the analysis group
are available. If none is available, the default implementation is created for
the pass to use. All standard rules for < A href = "#interaction" > interaction
2004-01-15 18:34:11 +00:00
between passes< / a > still apply.< / p >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< p > Although < a href = "#registration" > Pass Registration< / a > is optional for normal
2002-08-22 19:21:04 +00:00
passes, all analysis group implementations must be registered, and must use the
2010-07-21 23:07:00 +00:00
< A href = "#registerag" > < tt > INITIALIZE_AG_PASS< / tt > < / a > template to join the
2002-08-22 19:21:04 +00:00
implementation pool. Also, a default implementation of the interface
< b > must< / b > be registered with < A
2004-01-15 18:34:11 +00:00
href="#registerag">< tt > RegisterAnalysisGroup< / tt > < / a > .< / p >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< p > As a concrete example of an Analysis Group in action, consider the < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1AliasAnalysis.html">AliasAnalysis< / a >
2002-08-22 19:21:04 +00:00
analysis group. The default implementation of the alias analysis interface (the
< tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/structBasicAliasAnalysis.html">basicaa< / a > < / tt >
2002-08-22 19:21:04 +00:00
pass) just does a few simple checks that don't require significant analysis to
compute (such as: two different globals can never alias each other, etc).
Passes that use the < tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1AliasAnalysis.html">AliasAnalysis< / a > < / tt >
2002-08-22 19:21:04 +00:00
interface (for example the < tt > < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/structGCSE.html">gcse< / a > < / tt > pass), do
2004-01-15 18:34:11 +00:00
not care which implementation of alias analysis is actually provided, they just
use the designated interface.< / p >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< p > From the user's perspective, commands work just like normal. Issuing the
2002-08-22 19:21:04 +00:00
command '< tt > opt -gcse ...< / tt > ' will cause the < tt > basicaa< / tt > class to be
instantiated and added to the pass sequence. Issuing the command '< tt > opt
-somefancyaa -gcse ...< / tt > ' will cause the < tt > gcse< / tt > pass to use the
< tt > somefancyaa< / tt > alias analysis (which doesn't actually exist, it's just a
2004-01-15 18:34:11 +00:00
hypothetical example) instead.< / p >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-22 19:21:04 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "registerag" > Using < tt > RegisterAnalysisGroup< / tt > < / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2002-08-22 19:21:04 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > The < tt > RegisterAnalysisGroup< / tt > template is used to register the analysis
2010-07-21 23:07:00 +00:00
group itself, while the < tt > INITIALIZE_AG_PASS< / tt > is used to add pass
implementations to the analysis group. First,
an analysis group should be registered, with a human readable name
provided for it.
2002-08-22 19:21:04 +00:00
Unlike registration of passes, there is no command line argument to be specified
2004-01-15 18:34:11 +00:00
for the Analysis Group Interface itself, because it is "abstract":< / p >
2002-08-22 19:21:04 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< b > static< / b > RegisterAnalysisGroup< < a href = "http://llvm.org/doxygen/classllvm_1_1AliasAnalysis.html" > AliasAnalysis< / a > > A("< i > Alias Analysis< / i > ");
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-22 19:21:04 +00:00
2004-01-15 18:34:11 +00:00
< p > Once the analysis is registered, passes can declare that they are valid
implementations of the interface by using the following code:< / p >
2002-08-22 19:21:04 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2002-08-22 19:21:04 +00:00
< b > namespace< / b > {
//< i > Declare that we implement the AliasAnalysis interface< / i >
2010-07-21 23:07:00 +00:00
INITIALIZE_AG_PASS(FancyAA, < a href = "http://llvm.org/doxygen/classllvm_1_1AliasAnalysis.html" > AliasAnalysis< / a > , "< i > somefancyaa< / i > ",
"< i > A more complex alias analysis implementation< / i > ",
2012-04-08 11:52:52 +00:00
false, // < i > Is CFG Only?< / i >
true, // < i > Is Analysis?< / i >
false); // < i > Is default Analysis Group implementation?< / i >
2002-08-22 19:21:04 +00:00
}
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-22 19:21:04 +00:00
2010-07-21 23:07:00 +00:00
< p > This just shows a class < tt > FancyAA< / tt > that
uses the < tt > INITIALIZE_AG_PASS< / tt > macro both to register and
to "join" the < tt > < a href = "http://llvm.org/doxygen/classllvm_1_1AliasAnalysis.html" > AliasAnalysis< / a > < / tt >
2002-08-22 19:21:04 +00:00
analysis group. Every implementation of an analysis group should join using
2010-07-21 23:07:00 +00:00
this macro.< / p >
2002-08-22 19:21:04 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2002-08-22 19:21:04 +00:00
< b > namespace< / b > {
//< i > Declare that we implement the AliasAnalysis interface< / i >
2010-07-21 23:07:00 +00:00
INITIALIZE_AG_PASS(BasicAA, < a href = "http://llvm.org/doxygen/classllvm_1_1AliasAnalysis.html" > AliasAnalysis< / a > , "< i > basicaa< / i > ",
"< i > Basic Alias Analysis (default AA impl)< / i > ",
false, // < i > Is CFG Only?< / i >
true, // < i > Is Analysis?< / i >
2012-04-08 11:52:52 +00:00
true); // < i > Is default Analysis Group implementation?< / i >
2002-08-22 19:21:04 +00:00
}
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-22 19:21:04 +00:00
2010-07-21 23:07:00 +00:00
< p > Here we show how the default implementation is specified (using the final
argument to the < tt > INITIALIZE_AG_PASS< / tt > template). There must be exactly
2002-08-22 19:21:04 +00:00
one default implementation available at all times for an Analysis Group to be
2007-06-20 18:51:14 +00:00
used. Only default implementation can derive from < tt > ImmutablePass< / tt > .
Here we declare that the
< tt > < a href = "http://llvm.org/doxygen/structBasicAliasAnalysis.html" > BasicAliasAnalysis< / a > < / tt >
2004-01-15 18:34:11 +00:00
pass is the default implementation for the interface.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2004-11-19 01:25:14 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-11-19 01:25:14 +00:00
< a name = "passStatistics" > Pass Statistics< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2004-11-19 01:25:14 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-11-19 01:26:37 +00:00
< p > The < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/Statistic_8h-source.html">< tt > Statistic< / tt > < / a >
2005-11-28 23:25:41 +00:00
class is designed to be an easy way to expose various success
2004-11-19 01:25:14 +00:00
metrics from passes. These statistics are printed at the end of a
run, when the -stats command line option is enabled on the command
2004-11-19 01:26:37 +00:00
line. See the < a href = "http://llvm.org/docs/ProgrammersManual.html#Statistic" > Statistics section< / a > in the Programmer's Manual for details.
2004-11-19 01:25:14 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "passmanager" > What PassManager does< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > The < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/PassManager_8h-source.html">< tt > PassManager< / tt > < / a >
2004-01-15 18:34:11 +00:00
< a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1PassManager.html">class< / a >
2004-01-15 18:34:11 +00:00
takes a list of passes, ensures their < a href = "#interaction" > prerequisites< / a >
are set up correctly, and then schedules passes to run efficiently. All of the
LLVM tools that run passes use the < tt > PassManager< / tt > for execution of these
passes.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > PassManager< / tt > does two main things to try to reduce the execution
time of a series of passes:< / p >
2002-08-08 20:11:18 +00:00
< ol >
< li > < b > Share analysis results< / b > - The PassManager attempts to avoid
recomputing analysis results as much as possible. This means keeping track of
which analyses are available already, which analyses get invalidated, and which
analyses are needed to be run for a pass. An important part of work is that the
< tt > PassManager< / tt > tracks the exact lifetime of all analysis results, allowing
it to < a href = "#releaseMemory" > free memory< / a > allocated to holding analysis
2004-01-15 18:34:11 +00:00
results as soon as they are no longer needed.< / li >
2002-08-08 20:11:18 +00:00
< li > < b > Pipeline the execution of passes on the program< / b > - The
< tt > PassManager< / tt > attempts to get better cache and memory usage behavior out
of a series of passes by pipelining the passes together. This means that, given
2011-02-15 09:23:02 +00:00
a series of consecutive < a href = "#FunctionPass" > < tt > FunctionPass< / tt > < / a > 's, it
2002-08-08 20:11:18 +00:00
will execute all of the < a href = "#FunctionPass" > < tt > FunctionPass< / tt > < / a > 's on
the first function, then all of the < a
2004-01-15 18:34:11 +00:00
href="#FunctionPass">< tt > FunctionPass< / tt > < / a > es on the second function,
etc... until the entire program has been run through the passes.
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > This improves the cache behavior of the compiler, because it is only touching
2002-08-08 20:11:18 +00:00
the LLVM program representation for a single function at a time, instead of
traversing the entire program. It reduces the memory consumption of compiler,
because, for example, only one < a
2006-03-14 05:39:39 +00:00
href="http://llvm.org/doxygen/classllvm_1_1DominatorSet.html">< tt > DominatorSet< / tt > < / a >
2007-12-10 20:26:29 +00:00
needs to be calculated at a time. This also makes it possible to implement
some < a
2004-01-15 18:34:11 +00:00
href="#SMP">interesting enhancements< / a > in the future.< / p > < / li >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / ol >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The effectiveness of the < tt > PassManager< / tt > is influenced directly by how
much information it has about the behaviors of the passes it is scheduling. For
2002-08-08 20:11:18 +00:00
example, the "preserved" set is intentionally conservative in the face of an
unimplemented < a href = "#getAnalysisUsage" > < tt > getAnalysisUsage< / tt > < / a > method.
Not implementing when it should be implemented will have the effect of not
2004-01-15 18:34:11 +00:00
allowing any analysis results to live across the execution of your pass.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > PassManager< / tt > class exposes a < tt > --debug-pass< / tt > command line
2002-08-08 20:11:18 +00:00
options that is useful for debugging pass execution, seeing how things work, and
diagnosing when you should be preserving more analyses than you currently are
(To get information about all of the variants of the < tt > --debug-pass< / tt >
2010-02-18 14:08:13 +00:00
option, just type '< tt > opt -help-hidden< / tt > ').< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > By using the < tt > --debug-pass=Structure< / tt > option, for example, we can see
how our < a href = "#basiccode" > Hello World< / a > pass interacts with other passes.
Lets try it out with the < tt > gcse< / tt > and < tt > licm< / tt > passes:< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2010-07-08 08:27:18 +00:00
$ opt -load ../../../Debug+Asserts/lib/Hello.so -gcse -licm --debug-pass=Structure < hello.bc > /dev/null
2002-08-08 20:11:18 +00:00
Module Pass Manager
Function Pass Manager
Dominator Set Construction
Immediate Dominators Construction
Global Common Subexpression Elimination
-- Immediate Dominators Construction
-- Global Common Subexpression Elimination
Natural Loop Construction
Loop Invariant Code Motion
-- Natural Loop Construction
-- Loop Invariant Code Motion
Module Verifier
-- Dominator Set Construction
-- Module Verifier
2007-07-06 22:07:22 +00:00
Bitcode Writer
--Bitcode Writer
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > This output shows us when passes are constructed and when the analysis
results are known to be dead (prefixed with '< tt > --< / tt > '). Here we see that
GCSE uses dominator and immediate dominator information to do its job. The LICM
pass uses natural loop information, which uses dominator sets, but not immediate
2002-08-08 20:11:18 +00:00
dominators. Because immediate dominators are no longer useful after the GCSE
pass, it is immediately destroyed. The dominator sets are then reused to
2004-01-15 18:34:11 +00:00
compute natural loop information, which is then used by the LICM pass.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > After the LICM pass, the module verifier runs (which is automatically added
by the '< tt > opt< / tt > ' tool), which uses the dominator set to check that the
2002-08-08 20:11:18 +00:00
resultant LLVM code is well formed. After it finishes, the dominator set
information is destroyed, after being computed once, and shared by three
2004-01-15 18:34:11 +00:00
passes.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Lets see how this changes when we run the < a href = "#basiccode" > Hello
World< / a > pass in between the two passes:< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2010-07-08 08:27:18 +00:00
$ opt -load ../../../Debug+Asserts/lib/Hello.so -gcse -hello -licm --debug-pass=Structure < hello.bc > /dev/null
2002-08-08 20:11:18 +00:00
Module Pass Manager
Function Pass Manager
Dominator Set Construction
Immediate Dominators Construction
Global Common Subexpression Elimination
< b > -- Dominator Set Construction< / b >
-- Immediate Dominators Construction
-- Global Common Subexpression Elimination
< b > Hello World Pass
-- Hello World Pass
Dominator Set Construction< / b >
Natural Loop Construction
Loop Invariant Code Motion
-- Natural Loop Construction
-- Loop Invariant Code Motion
Module Verifier
-- Dominator Set Construction
-- Module Verifier
2007-07-06 22:07:22 +00:00
Bitcode Writer
--Bitcode Writer
2002-08-08 20:11:18 +00:00
Hello: __main
Hello: puts
Hello: main
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Here we see that the < a href = "#basiccode" > Hello World< / a > pass has killed the
2002-08-08 20:11:18 +00:00
Dominator Set pass, even though it doesn't modify the code at all! To fix this,
we need to add the following < a
2004-01-15 18:34:11 +00:00
href="#getAnalysisUsage">< tt > getAnalysisUsage< / tt > < / a > method to our pass:< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
< i > // We don't modify the program, so we preserve all analyses< / i >
< b > virtual void< / b > getAnalysisUsage(AnalysisUsage & AU) < b > const< / b > {
AU.setPreservesAll();
}
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Now when we run our pass, we get this output:< / p >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2010-07-08 08:27:18 +00:00
$ opt -load ../../../Debug+Asserts/lib/Hello.so -gcse -hello -licm --debug-pass=Structure < hello.bc > /dev/null
2002-08-08 20:11:18 +00:00
Pass Arguments: -gcse -hello -licm
Module Pass Manager
Function Pass Manager
Dominator Set Construction
Immediate Dominators Construction
Global Common Subexpression Elimination
-- Immediate Dominators Construction
-- Global Common Subexpression Elimination
Hello World Pass
-- Hello World Pass
Natural Loop Construction
Loop Invariant Code Motion
-- Loop Invariant Code Motion
-- Natural Loop Construction
Module Verifier
-- Dominator Set Construction
-- Module Verifier
2007-07-06 22:07:22 +00:00
Bitcode Writer
--Bitcode Writer
2002-08-08 20:11:18 +00:00
Hello: __main
Hello: puts
Hello: main
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > Which shows that we don't accidentally invalidate dominator information
anymore, and therefore do not have to compute it twice.< / p >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "releaseMemory" > The < tt > releaseMemory< / tt > method< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-08-08 20:11:18 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2002-08-08 20:11:18 +00:00
< b > virtual void< / b > releaseMemory();
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > The < tt > PassManager< / tt > automatically determines when to compute analysis
2002-08-08 20:11:18 +00:00
results, and how long to keep them around for. Because the lifetime of the pass
object itself is effectively the entire duration of the compilation process, we
need some way to free analysis results when they are no longer useful. The
2004-01-15 18:34:11 +00:00
< tt > releaseMemory< / tt > virtual method is the way to do this.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > If you are writing an analysis or any other pass that retains a significant
2002-08-08 20:11:18 +00:00
amount of state (for use by another pass which "requires" your pass and uses the
< a href = "#getAnalysis" > getAnalysis< / a > method) you should implement
2009-06-15 18:22:49 +00:00
< tt > releaseMemory< / tt > to, well, release the memory allocated to maintain this
2002-08-08 20:11:18 +00:00
internal state. This method is called after the < tt > run*< / tt > method for the
2004-01-15 18:34:11 +00:00
class, before the next call of < tt > run*< / tt > in your pass.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2006-08-04 18:10:12 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2006-08-04 18:10:12 +00:00
< a name = "registering" > Registering dynamically loaded passes< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2006-08-04 18:10:12 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2006-08-04 18:10:12 +00:00
< p > < i > Size matters< / i > when constructing production quality tools using llvm,
both for the purposes of distribution, and for regulating the resident code size
when running on the target system. Therefore, it becomes desirable to
selectively use some passes, while omitting others and maintain the flexibility
to change configurations later on. You want to be able to do all this, and,
provide feedback to the user. This is where pass registration comes into
play.< / p >
< p > The fundamental mechanisms for pass registration are the
< tt > MachinePassRegistry< / tt > class and subclasses of
< tt > MachinePassRegistryNode< / tt > .< / p >
< p > An instance of < tt > MachinePassRegistry< / tt > is used to maintain a list of
< tt > MachinePassRegistryNode< / tt > objects. This instance maintains the list and
communicates additions and deletions to the command line interface.< / p >
< p > An instance of < tt > MachinePassRegistryNode< / tt > subclass is used to maintain
information provided about a particular pass. This information includes the
command line name, the command help string and the address of the function used
to create an instance of the pass. A global static constructor of one of these
instances < i > registers< / i > with a corresponding < tt > MachinePassRegistry< / tt > ,
the static destructor < i > unregisters< / i > . Thus a pass that is statically linked
in the tool will be registered at start up. A dynamically loaded pass will
register on load and unregister at unload.< / p >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h3 >
2006-08-04 18:10:12 +00:00
< a name = "registering_existing" > Using existing registries< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2006-08-04 18:10:12 +00:00
2011-04-23 00:30:22 +00:00
< div >
2006-08-04 18:10:12 +00:00
< p > There are predefined registries to track instruction scheduling
(< tt > RegisterScheduler< / tt > ) and register allocation (< tt > RegisterRegAlloc< / tt > )
machine passes. Here we will describe how to < i > register< / i > a register
allocator machine pass.< / p >
< p > Implement your register allocator machine pass. In your register allocator
2012-04-08 11:52:52 +00:00
< tt > .cpp< / tt > file add the following include;< / p >
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
#include "llvm/CodeGen/RegAllocRegistry.h"
2006-08-04 18:10:12 +00:00
< / pre > < / div >
< p > Also in your register allocator .cpp file, define a creator function in the
form; < / p >
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
FunctionPass *createMyRegisterAllocator() {
return new MyRegisterAllocator();
}
2006-08-04 18:10:12 +00:00
< / pre > < / div >
< p > Note that the signature of this function should match the type of
< tt > RegisterRegAlloc::FunctionPassCtor< / tt > . In the same file add the
"installing" declaration, in the form;< / p >
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
static RegisterRegAlloc myRegAlloc("myregalloc",
"my register allocator help string",
createMyRegisterAllocator);
2006-08-04 18:10:12 +00:00
< / pre > < / div >
< p > Note the two spaces prior to the help string produces a tidy result on the
2010-02-18 14:08:13 +00:00
-help query.< / p >
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2010-02-18 14:08:13 +00:00
$ llc -help
2006-08-04 18:10:12 +00:00
...
2010-02-18 14:37:52 +00:00
-regalloc - Register allocator to use (default=linearscan)
2006-08-04 18:10:12 +00:00
=linearscan - linear scan register allocator
=local - local register allocator
=simple - simple register allocator
=myregalloc - my register allocator help string
...
< / pre > < / div >
< p > And that's it. The user is now free to use < tt > -regalloc=myregalloc< / tt > as
an option. Registering instruction schedulers is similar except use the
2006-08-11 16:37:02 +00:00
< tt > RegisterScheduler< / tt > class. Note that the
< tt > RegisterScheduler::FunctionPassCtor< / tt > is significantly different from
2006-08-04 18:10:12 +00:00
< tt > RegisterRegAlloc::FunctionPassCtor< / tt > .< / p >
< p > To force the load/linking of your register allocator into the llc/lli tools,
add your creator function's global declaration to "Passes.h" and add a "pseudo"
call line to < tt > llvm/Codegen/LinkAllCodegenComponents.h< / tt > .< / p >
< / div >
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h3 >
2006-08-04 18:10:12 +00:00
< a name = "registering_new" > Creating new registries< / a >
2011-04-18 23:59:50 +00:00
< / h3 >
2006-08-04 18:10:12 +00:00
2011-04-23 00:30:22 +00:00
< div >
2006-08-04 18:10:12 +00:00
< p > The easiest way to get started is to clone one of the existing registries; we
recommend < tt > llvm/CodeGen/RegAllocRegistry.h< / tt > . The key things to modify
are the class name and the < tt > FunctionPassCtor< / tt > type.< / p >
< p > Then you need to declare the registry. Example: if your pass registry is
< tt > RegisterMyPasses< / tt > then define;< / p >
< div class = "doc_code" > < pre >
MachinePassRegistry RegisterMyPasses::Registry;
< / pre > < / div >
< p > And finally, declare the command line option for your passes. Example:< / p >
< div class = "doc_code" > < pre >
2012-04-08 11:52:52 +00:00
cl::opt< RegisterMyPasses::FunctionPassCtor, false,
RegisterPassParser< RegisterMyPasses> >
MyPassOpt("mypass",
cl::init(& createDefaultMyPass),
cl::desc("my pass option help"));
2006-08-04 18:10:12 +00:00
< / pre > < / div >
< p > Here the command option is "mypass", with createDefaultMyPass as the default
creator.< / p >
< / div >
2011-04-23 00:30:22 +00:00
< / div >
2002-09-06 02:02:58 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "debughints" > Using GDB with dynamically loaded passes< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-09-06 02:02:58 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > Unfortunately, using GDB with dynamically loaded passes is not as easy as it
2002-09-06 02:02:58 +00:00
should be. First of all, you can't set a breakpoint in a shared object that has
not been loaded yet, and second of all there are problems with inlined functions
in shared objects. Here are some suggestions to debugging your pass with
2004-01-15 18:34:11 +00:00
GDB.< / p >
2002-09-06 02:02:58 +00:00
2004-01-15 18:34:11 +00:00
< p > For sake of discussion, I'm going to assume that you are debugging a
2002-09-06 02:02:58 +00:00
transformation invoked by < tt > opt< / tt > , although nothing described here depends
2004-01-15 18:34:11 +00:00
on that.< / p >
2002-09-06 02:02:58 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "breakpoint" > Setting a breakpoint in your pass< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-09-06 02:02:58 +00:00
2004-01-15 18:34:11 +00:00
< p > First thing you do is start < tt > gdb< / tt > on the < tt > opt< / tt > process:< / p >
2002-09-06 02:02:58 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2002-09-06 02:02:58 +00:00
$ < b > gdb opt< / b >
GNU gdb 5.0
Copyright 2000 Free Software Foundation, Inc.
GDB is free software, covered by the GNU General Public License, and you are
welcome to change it and/or distribute copies of it under certain conditions.
Type "show copying" to see the conditions.
There is absolutely no warranty for GDB. Type "show warranty" for details.
This GDB was configured as "sparc-sun-solaris2.6"...
(gdb)
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-09-06 02:02:58 +00:00
2004-01-15 18:34:11 +00:00
< p > Note that < tt > opt< / tt > has a lot of debugging information in it, so it takes
2002-09-06 02:02:58 +00:00
time to load. Be patient. Since we cannot set a breakpoint in our pass yet
(the shared object isn't loaded until runtime), we must execute the process, and
have it stop before it invokes our pass, but after it has loaded the shared
object. The most foolproof way of doing this is to set a breakpoint in
< tt > PassManager::run< / tt > and then run the process with the arguments you
2004-01-15 18:34:11 +00:00
want:< / p >
2002-09-06 02:02:58 +00:00
2006-08-04 18:10:12 +00:00
< div class = "doc_code" > < pre >
2006-09-28 16:53:47 +00:00
(gdb) < b > break llvm::PassManager::run< / b >
2002-09-06 02:02:58 +00:00
Breakpoint 1 at 0x2413bc: file Pass.cpp, line 70.
2010-07-08 08:27:18 +00:00
(gdb) < b > run test.bc -load $(LLVMTOP)/llvm/Debug+Asserts/lib/[libname].so -[passoption]< / b >
Starting program: opt test.bc -load $(LLVMTOP)/llvm/Debug+Asserts/lib/[libname].so -[passoption]
2002-09-06 02:02:58 +00:00
Breakpoint 1, PassManager::run (this=0xffbef174, M=@0x70b298) at Pass.cpp:70
70 bool PassManager::run(Module & M) { return PM-> run(M); }
(gdb)
2006-08-04 18:10:12 +00:00
< / pre > < / div >
2002-09-06 02:02:58 +00:00
2004-01-15 18:34:11 +00:00
< p > Once the < tt > opt< / tt > stops in the < tt > PassManager::run< / tt > method you are
now free to set breakpoints in your pass so that you can trace through execution
or do other standard debugging stuff.< / p >
2002-09-06 02:02:58 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-09-06 02:02:58 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "debugmisc" > Miscellaneous Problems< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2004-01-15 18:34:11 +00:00
2011-04-23 00:30:22 +00:00
< div >
2002-09-06 02:02:58 +00:00
2004-01-15 18:34:11 +00:00
< p > Once you have the basics down, there are a couple of problems that GDB has,
some with solutions, some without.< / p >
2002-09-06 02:02:58 +00:00
< ul >
< li > Inline functions have bogus stack information. In general, GDB does a
pretty good job getting stack traces and stepping through inline functions.
When a pass is dynamically loaded however, it somehow completely loses this
capability. The only solution I know of is to de-inline a function (move it
2004-01-15 18:34:11 +00:00
from the body of a class to a .cpp file).< / li >
2002-09-06 02:02:58 +00:00
< li > Restarting the program breaks breakpoints. After following the information
above, you have succeeded in getting some breakpoints planted in your pass. Nex
thing you know, you restart the program (i.e., you type '< tt > run< / tt > ' again),
and you start getting errors about breakpoints being unsettable. The only way I
have found to "fix" this problem is to < tt > delete< / tt > the breakpoints that are
already set in your pass, run the program, and re-set the breakpoints once
2004-01-15 18:34:11 +00:00
execution stops in < tt > PassManager::run< / tt > .< / li >
2002-09-06 02:02:58 +00:00
< / ul >
2004-01-15 18:34:11 +00:00
< p > Hopefully these tips will help with common case debugging situations. If
you'd like to contribute some tips of your own, just contact < a
href="mailto:sabre@nondot.org">Chris< / a > .< / p >
2002-09-06 02:02:58 +00:00
2004-01-15 18:34:11 +00:00
< / div >
2002-09-06 02:02:58 +00:00
2011-04-23 00:30:22 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-18 23:59:50 +00:00
< h2 >
2004-01-15 18:34:11 +00:00
< a name = "future" > Future extensions planned< / a >
2011-04-18 23:59:50 +00:00
< / h2 >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > Although the LLVM Pass Infrastructure is very capable as it stands, and does
2002-08-08 20:11:18 +00:00
some nifty stuff, there are things we'd like to add in the future. Here is
2004-01-15 18:34:11 +00:00
where we are going:< / p >
2002-08-08 20:11:18 +00:00
<!-- _______________________________________________________________________ -->
2011-04-18 23:59:50 +00:00
< h4 >
2004-01-15 18:34:11 +00:00
< a name = "SMP" > Multithreaded LLVM< / a >
2011-04-18 23:59:50 +00:00
< / h4 >
2002-08-08 20:11:18 +00:00
2011-04-23 00:30:22 +00:00
< div >
2004-01-15 18:34:11 +00:00
< p > Multiple CPU machines are becoming more common and compilation can never be
2002-08-08 20:11:18 +00:00
fast enough: obviously we should allow for a multithreaded compiler. Because of
the semantics defined for passes above (specifically they cannot maintain state
across invocations of their < tt > run*< / tt > methods), a nice clean way to
implement a multithreaded compiler would be for the < tt > PassManager< / tt > class
2003-07-14 17:20:40 +00:00
to create multiple instances of each pass object, and allow the separate
2004-01-15 18:34:11 +00:00
instances to be hacking on different parts of the program at the same time.< / p >
2002-08-08 20:11:18 +00:00
2004-01-15 18:34:11 +00:00
< p > This implementation would prevent each of the passes from having to implement
2002-08-08 20:11:18 +00:00
multithreaded constructs, requiring only the LLVM core to have locking in a few
places (for global resources). Although this is a simple extension, we simply
haven't had time (or multiprocessor machines, thus a reason) to implement this.
2004-01-15 18:34:11 +00:00
Despite that, we have kept the LLVM passes SMP ready, and you should too.< / p >
2002-08-08 20:11:18 +00:00
2007-05-18 05:36:14 +00:00
< / div >
2011-04-23 00:30:22 +00:00
< / div >
2002-08-08 20:11:18 +00:00
<!-- *********************************************************************** -->
2004-01-15 18:34:11 +00:00
< hr >
< address >
< a href = "http://jigsaw.w3.org/css-validator/check/referer" > < img
2008-12-11 17:34:48 +00:00
src="http://jigsaw.w3.org/css-validator/images/vcss-blue" alt="Valid CSS">< / a >
2004-01-15 18:34:11 +00:00
< a href = "http://validator.w3.org/check/referer" > < img
2008-12-11 18:23:24 +00:00
src="http://www.w3.org/Icons/valid-html401-blue" alt="Valid HTML 4.01">< / a >
2004-01-15 18:34:11 +00:00
< a href = "mailto:sabre@nondot.org" > Chris Lattner< / a > < br >
2011-04-09 02:13:37 +00:00
< a href = "http://llvm.org/" > The LLVM Compiler Infrastructure< / a > < br >
2004-01-15 18:34:11 +00:00
Last modified: $Date$
< / address >
< / body >
< / html >
