2007-10-06 21:00:36 +00:00
|
|
|
//===-- Analysis.cpp ------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2007-10-06 21:00:36 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm-c/Analysis.h"
|
2011-08-19 01:36:54 +00:00
|
|
|
#include "llvm-c/Initialization.h"
|
2013-05-01 20:59:00 +00:00
|
|
|
#include "llvm/IR/Module.h"
|
2014-01-13 09:26:24 +00:00
|
|
|
#include "llvm/IR/Verifier.h"
|
2014-01-07 11:48:04 +00:00
|
|
|
#include "llvm/InitializePasses.h"
|
2013-05-01 20:59:00 +00:00
|
|
|
#include "llvm/PassRegistry.h"
|
2014-03-04 10:07:28 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2008-02-20 11:08:44 +00:00
|
|
|
#include <cstring>
|
2007-10-06 21:00:36 +00:00
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
2010-10-07 18:31:00 +00:00
|
|
|
/// initializeAnalysis - Initialize all passes linked into the Analysis library.
|
|
|
|
void llvm::initializeAnalysis(PassRegistry &Registry) {
|
|
|
|
initializeAliasAnalysisAnalysisGroup(Registry);
|
|
|
|
initializeAliasAnalysisCounterPass(Registry);
|
|
|
|
initializeAAEvalPass(Registry);
|
|
|
|
initializeAliasDebuggerPass(Registry);
|
|
|
|
initializeAliasSetPrinterPass(Registry);
|
|
|
|
initializeNoAAPass(Registry);
|
|
|
|
initializeBasicAliasAnalysisPass(Registry);
|
2011-07-25 19:25:40 +00:00
|
|
|
initializeBlockFrequencyInfoPass(Registry);
|
2011-06-04 01:16:30 +00:00
|
|
|
initializeBranchProbabilityInfoPass(Registry);
|
2012-11-02 21:48:17 +00:00
|
|
|
initializeCostModelAnalysisPass(Registry);
|
2010-10-07 18:31:00 +00:00
|
|
|
initializeCFGViewerPass(Registry);
|
|
|
|
initializeCFGPrinterPass(Registry);
|
|
|
|
initializeCFGOnlyViewerPass(Registry);
|
|
|
|
initializeCFGOnlyPrinterPass(Registry);
|
2014-09-02 21:43:13 +00:00
|
|
|
initializeCFLAliasAnalysisPass(Registry);
|
dependence analysis
Patch from Preston Briggs <preston.briggs@gmail.com>.
This is an updated version of the dependence-analysis patch, including an MIV
test based on Banerjee's inequalities.
It's a fairly complete implementation of the paper
Practical Dependence Testing
Gina Goff, Ken Kennedy, and Chau-Wen Tseng
PLDI 1991
It cannot yet propagate constraints between coupled RDIV subscripts (discussed
in Section 5.3.2 of the paper).
It's organized as a FunctionPass with a single entry point that supports testing
for dependence between two instructions in a function. If there's no dependence,
it returns null. If there's a dependence, it returns a pointer to a Dependence
which can be queried about details (what kind of dependence, is it loop
independent, direction and distance vector entries, etc). I haven't included
every imaginable feature, but there's a good selection that should be adequate
for supporting many loop transformations. Of course, it can be extended as
necessary.
Included in the patch file are many test cases, commented with C code showing
the loops and array references.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@165708 91177308-0d34-0410-b5e6-96231b3b80d8
2012-10-11 07:32:34 +00:00
|
|
|
initializeDependenceAnalysisPass(Registry);
|
2013-11-12 22:47:20 +00:00
|
|
|
initializeDelinearizationPass(Registry);
|
Divergence analysis for GPU programs
Summary:
Some optimizations such as jump threading and loop unswitching can negatively
affect performance when applied to divergent branches. The divergence analysis
added in this patch conservatively estimates which branches in a GPU program
can diverge. This information can then help LLVM to run certain optimizations
selectively.
Test Plan: test/Analysis/DivergenceAnalysis/NVPTX/diverge.ll
Reviewers: resistor, hfinkel, eliben, meheff, jholewinski
Subscribers: broune, bjarke.roune, madhur13490, tstellarAMD, dberlin, echristo, jholewinski, llvm-commits
Differential Revision: http://reviews.llvm.org/D8576
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@234567 91177308-0d34-0410-b5e6-96231b3b80d8
2015-04-10 05:03:50 +00:00
|
|
|
initializeDivergenceAnalysisPass(Registry);
|
2011-01-18 06:06:27 +00:00
|
|
|
initializeDominanceFrontierPass(Registry);
|
2010-10-07 18:31:00 +00:00
|
|
|
initializeDomViewerPass(Registry);
|
|
|
|
initializeDomPrinterPass(Registry);
|
|
|
|
initializeDomOnlyViewerPass(Registry);
|
|
|
|
initializePostDomViewerPass(Registry);
|
|
|
|
initializeDomOnlyPrinterPass(Registry);
|
|
|
|
initializePostDomPrinterPass(Registry);
|
|
|
|
initializePostDomOnlyViewerPass(Registry);
|
|
|
|
initializePostDomOnlyPrinterPass(Registry);
|
|
|
|
initializeIVUsersPass(Registry);
|
|
|
|
initializeInstCountPass(Registry);
|
|
|
|
initializeIntervalPartitionPass(Registry);
|
|
|
|
initializeLazyValueInfoPass(Registry);
|
|
|
|
initializeLibCallAliasAnalysisPass(Registry);
|
|
|
|
initializeLintPass(Registry);
|
2015-01-17 14:16:18 +00:00
|
|
|
initializeLoopInfoWrapperPassPass(Registry);
|
2010-10-07 18:31:00 +00:00
|
|
|
initializeMemDepPrinterPass(Registry);
|
2015-02-06 01:46:42 +00:00
|
|
|
initializeMemDerefPrinterPass(Registry);
|
2010-10-07 18:31:00 +00:00
|
|
|
initializeMemoryDependenceAnalysisPass(Registry);
|
|
|
|
initializeModuleDebugInfoPrinterPass(Registry);
|
|
|
|
initializePostDominatorTreePass(Registry);
|
2014-07-19 18:29:29 +00:00
|
|
|
initializeRegionInfoPassPass(Registry);
|
2010-10-07 18:31:00 +00:00
|
|
|
initializeRegionViewerPass(Registry);
|
|
|
|
initializeRegionPrinterPass(Registry);
|
|
|
|
initializeRegionOnlyViewerPass(Registry);
|
|
|
|
initializeRegionOnlyPrinterPass(Registry);
|
|
|
|
initializeScalarEvolutionPass(Registry);
|
|
|
|
initializeScalarEvolutionAliasAnalysisPass(Registry);
|
[PM] Change the core design of the TTI analysis to use a polymorphic
type erased interface and a single analysis pass rather than an
extremely complex analysis group.
The end result is that the TTI analysis can contain a type erased
implementation that supports the polymorphic TTI interface. We can build
one from a target-specific implementation or from a dummy one in the IR.
I've also factored all of the code into "mix-in"-able base classes,
including CRTP base classes to facilitate calling back up to the most
specialized form when delegating horizontally across the surface. These
aren't as clean as I would like and I'm planning to work on cleaning
some of this up, but I wanted to start by putting into the right form.
There are a number of reasons for this change, and this particular
design. The first and foremost reason is that an analysis group is
complete overkill, and the chaining delegation strategy was so opaque,
confusing, and high overhead that TTI was suffering greatly for it.
Several of the TTI functions had failed to be implemented in all places
because of the chaining-based delegation making there be no checking of
this. A few other functions were implemented with incorrect delegation.
The message to me was very clear working on this -- the delegation and
analysis group structure was too confusing to be useful here.
The other reason of course is that this is *much* more natural fit for
the new pass manager. This will lay the ground work for a type-erased
per-function info object that can look up the correct subtarget and even
cache it.
Yet another benefit is that this will significantly simplify the
interaction of the pass managers and the TargetMachine. See the future
work below.
The downside of this change is that it is very, very verbose. I'm going
to work to improve that, but it is somewhat an implementation necessity
in C++ to do type erasure. =/ I discussed this design really extensively
with Eric and Hal prior to going down this path, and afterward showed
them the result. No one was really thrilled with it, but there doesn't
seem to be a substantially better alternative. Using a base class and
virtual method dispatch would make the code much shorter, but as
discussed in the update to the programmer's manual and elsewhere,
a polymorphic interface feels like the more principled approach even if
this is perhaps the least compelling example of it. ;]
Ultimately, there is still a lot more to be done here, but this was the
huge chunk that I couldn't really split things out of because this was
the interface change to TTI. I've tried to minimize all the other parts
of this. The follow up work should include at least:
1) Improving the TargetMachine interface by having it directly return
a TTI object. Because we have a non-pass object with value semantics
and an internal type erasure mechanism, we can narrow the interface
of the TargetMachine to *just* do what we need: build and return
a TTI object that we can then insert into the pass pipeline.
2) Make the TTI object be fully specialized for a particular function.
This will include splitting off a minimal form of it which is
sufficient for the inliner and the old pass manager.
3) Add a new pass manager analysis which produces TTI objects from the
target machine for each function. This may actually be done as part
of #2 in order to use the new analysis to implement #2.
4) Work on narrowing the API between TTI and the targets so that it is
easier to understand and less verbose to type erase.
5) Work on narrowing the API between TTI and its clients so that it is
easier to understand and less verbose to forward.
6) Try to improve the CRTP-based delegation. I feel like this code is
just a bit messy and exacerbating the complexity of implementing
the TTI in each target.
Many thanks to Eric and Hal for their help here. I ended up blocked on
this somewhat more abruptly than I expected, and so I appreciate getting
it sorted out very quickly.
Differential Revision: http://reviews.llvm.org/D7293
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@227669 91177308-0d34-0410-b5e6-96231b3b80d8
2015-01-31 03:43:40 +00:00
|
|
|
initializeTargetTransformInfoWrapperPassPass(Registry);
|
2010-10-07 18:31:00 +00:00
|
|
|
initializeTypeBasedAliasAnalysisPass(Registry);
|
Add scoped-noalias metadata
This commit adds scoped noalias metadata. The primary motivations for this
feature are:
1. To preserve noalias function attribute information when inlining
2. To provide the ability to model block-scope C99 restrict pointers
Neither of these two abilities are added here, only the necessary
infrastructure. In fact, there should be no change to existing functionality,
only the addition of new features. The logic that converts noalias function
parameters into this metadata during inlining will come in a follow-up commit.
What is added here is the ability to generally specify noalias memory-access
sets. Regarding the metadata, alias-analysis scopes are defined similar to TBAA
nodes:
!scope0 = metadata !{ metadata !"scope of foo()" }
!scope1 = metadata !{ metadata !"scope 1", metadata !scope0 }
!scope2 = metadata !{ metadata !"scope 2", metadata !scope0 }
!scope3 = metadata !{ metadata !"scope 2.1", metadata !scope2 }
!scope4 = metadata !{ metadata !"scope 2.2", metadata !scope2 }
Loads and stores can be tagged with an alias-analysis scope, and also, with a
noalias tag for a specific scope:
... = load %ptr1, !alias.scope !{ !scope1 }
... = load %ptr2, !alias.scope !{ !scope1, !scope2 }, !noalias !{ !scope1 }
When evaluating an aliasing query, if one of the instructions is associated
with an alias.scope id that is identical to the noalias scope associated with
the other instruction, or is a descendant (in the scope hierarchy) of the
noalias scope associated with the other instruction, then the two memory
accesses are assumed not to alias.
Note that is the first element of the scope metadata is a string, then it can
be combined accross functions and translation units. The string can be replaced
by a self-reference to create globally unqiue scope identifiers.
[Note: This overview is slightly stylized, since the metadata nodes really need
to just be numbers (!0 instead of !scope0), and the scope lists are also global
unnamed metadata.]
Existing noalias metadata in a callee is "cloned" for use by the inlined code.
This is necessary because the aliasing scopes are unique to each call site
(because of possible control dependencies on the aliasing properties). For
example, consider a function: foo(noalias a, noalias b) { *a = *b; } that gets
inlined into bar() { ... if (...) foo(a1, b1); ... if (...) foo(a2, b2); } --
now just because we know that a1 does not alias with b1 at the first call site,
and a2 does not alias with b2 at the second call site, we cannot let inlining
these functons have the metadata imply that a1 does not alias with b2.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@213864 91177308-0d34-0410-b5e6-96231b3b80d8
2014-07-24 14:25:39 +00:00
|
|
|
initializeScopedNoAliasAAPass(Registry);
|
2010-10-07 18:31:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void LLVMInitializeAnalysis(LLVMPassRegistryRef R) {
|
|
|
|
initializeAnalysis(*unwrap(R));
|
|
|
|
}
|
|
|
|
|
2010-01-09 22:27:07 +00:00
|
|
|
LLVMBool LLVMVerifyModule(LLVMModuleRef M, LLVMVerifierFailureAction Action,
|
|
|
|
char **OutMessages) {
|
2014-04-15 04:59:12 +00:00
|
|
|
raw_ostream *DebugOS = Action != LLVMReturnStatusAction ? &errs() : nullptr;
|
2014-06-26 22:52:05 +00:00
|
|
|
std::string Messages;
|
|
|
|
raw_string_ostream MsgsOS(Messages);
|
2011-01-29 01:09:53 +00:00
|
|
|
|
2014-01-19 02:22:18 +00:00
|
|
|
LLVMBool Result = verifyModule(*unwrap(M), OutMessages ? &MsgsOS : DebugOS);
|
|
|
|
|
|
|
|
// Duplicate the output to stderr.
|
|
|
|
if (DebugOS && OutMessages)
|
|
|
|
*DebugOS << MsgsOS.str();
|
|
|
|
|
|
|
|
if (Action == LLVMAbortProcessAction && Result)
|
|
|
|
report_fatal_error("Broken module found, compilation aborted!");
|
2011-01-29 01:09:53 +00:00
|
|
|
|
2014-06-26 22:52:05 +00:00
|
|
|
if (OutMessages)
|
|
|
|
*OutMessages = strdup(MsgsOS.str().c_str());
|
2011-01-29 01:09:53 +00:00
|
|
|
|
2007-10-06 21:00:36 +00:00
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2010-01-09 22:27:07 +00:00
|
|
|
LLVMBool LLVMVerifyFunction(LLVMValueRef Fn, LLVMVerifierFailureAction Action) {
|
2014-01-19 02:22:18 +00:00
|
|
|
LLVMBool Result = verifyFunction(
|
2014-04-15 04:59:12 +00:00
|
|
|
*unwrap<Function>(Fn), Action != LLVMReturnStatusAction ? &errs()
|
|
|
|
: nullptr);
|
2014-01-19 02:22:18 +00:00
|
|
|
|
|
|
|
if (Action == LLVMAbortProcessAction && Result)
|
|
|
|
report_fatal_error("Broken function found, compilation aborted!");
|
|
|
|
|
|
|
|
return Result;
|
2007-10-06 21:00:36 +00:00
|
|
|
}
|
|
|
|
|
2008-03-31 16:22:09 +00:00
|
|
|
void LLVMViewFunctionCFG(LLVMValueRef Fn) {
|
|
|
|
Function *F = unwrap<Function>(Fn);
|
|
|
|
F->viewCFG();
|
|
|
|
}
|
|
|
|
|
|
|
|
void LLVMViewFunctionCFGOnly(LLVMValueRef Fn) {
|
|
|
|
Function *F = unwrap<Function>(Fn);
|
|
|
|
F->viewCFGOnly();
|
|
|
|
}
|