2010-08-02 23:11:01 +00:00
|
|
|
//===- TypeBasedAliasAnalysis.cpp - Type-Based Alias Analysis -------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the TypeBasedAliasAnalysis pass, which implements
|
|
|
|
// metadata-based TBAA.
|
|
|
|
//
|
|
|
|
// In LLVM IR, memory does not have types, so LLVM's own type system is not
|
|
|
|
// suitable for doing TBAA. Instead, metadata is added to the IR to describe
|
2010-10-21 21:55:35 +00:00
|
|
|
// a type system of a higher level language. This can be used to implement
|
|
|
|
// typical C/C++ TBAA, but it can also be used to implement custom alias
|
|
|
|
// analysis behavior for other languages.
|
2010-08-02 23:11:01 +00:00
|
|
|
//
|
2010-10-21 21:55:35 +00:00
|
|
|
// The current metadata format is very simple. TBAA MDNodes have up to
|
|
|
|
// three fields, e.g.:
|
|
|
|
// !0 = metadata !{ metadata !"an example type tree" }
|
|
|
|
// !1 = metadata !{ metadata !"int", metadata !0 }
|
|
|
|
// !2 = metadata !{ metadata !"float", metadata !0 }
|
|
|
|
// !3 = metadata !{ metadata !"const float", metadata !2, i64 1 }
|
2010-08-02 23:11:01 +00:00
|
|
|
//
|
2010-10-21 21:55:35 +00:00
|
|
|
// The first field is an identity field. It can be any value, usually
|
|
|
|
// an MDString, which uniquely identifies the type. The most important
|
|
|
|
// name in the tree is the name of the root node. Two trees with
|
|
|
|
// different root node names are entirely disjoint, even if they
|
|
|
|
// have leaves with common names.
|
|
|
|
//
|
|
|
|
// The second field identifies the type's parent node in the tree, or
|
|
|
|
// is null or omitted for a root node. A type is considered to alias
|
2011-04-15 05:18:47 +00:00
|
|
|
// all of its descendants and all of its ancestors in the tree. Also,
|
2010-10-25 19:47:25 +00:00
|
|
|
// a type is considered to alias all types in other trees, so that
|
|
|
|
// bitcode produced from multiple front-ends is handled conservatively.
|
2010-08-02 23:11:01 +00:00
|
|
|
//
|
2010-10-21 19:01:22 +00:00
|
|
|
// If the third field is present, it's an integer which if equal to 1
|
2010-10-21 21:55:35 +00:00
|
|
|
// indicates that the type is "constant" (meaning pointsToConstantMemory
|
|
|
|
// should return true; see
|
2010-10-21 19:45:09 +00:00
|
|
|
// http://llvm.org/docs/AliasAnalysis.html#OtherItfs).
|
2010-10-21 19:01:22 +00:00
|
|
|
//
|
2010-10-21 21:55:35 +00:00
|
|
|
// TODO: The current metadata format doesn't support struct
|
2010-10-21 19:01:22 +00:00
|
|
|
// fields. For example:
|
|
|
|
// struct X {
|
|
|
|
// double d;
|
|
|
|
// int i;
|
|
|
|
// };
|
|
|
|
// void foo(struct X *x, struct X *y, double *p) {
|
|
|
|
// *x = *y;
|
|
|
|
// *p = 0.0;
|
|
|
|
// }
|
|
|
|
// Struct X has a double member, so the store to *x can alias the store to *p.
|
|
|
|
// Currently it's not possible to precisely describe all the things struct X
|
|
|
|
// aliases, so struct assignments must use conservative TBAA nodes. There's
|
|
|
|
// no scheme for attaching metadata to @llvm.memcpy yet either.
|
2010-08-02 23:11:01 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
|
|
|
#include "llvm/Analysis/Passes.h"
|
2011-04-11 09:35:34 +00:00
|
|
|
#include "llvm/Constants.h"
|
2010-10-25 21:38:20 +00:00
|
|
|
#include "llvm/LLVMContext.h"
|
2010-08-02 23:11:01 +00:00
|
|
|
#include "llvm/Module.h"
|
|
|
|
#include "llvm/Metadata.h"
|
|
|
|
#include "llvm/Pass.h"
|
2010-10-18 18:17:47 +00:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
2010-08-02 23:11:01 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2010-12-16 02:55:10 +00:00
|
|
|
// A handy option for disabling TBAA functionality. The same effect can also be
|
|
|
|
// achieved by stripping the !tbaa tags from IR, but this option is sometimes
|
|
|
|
// more convenient.
|
2010-12-15 23:58:44 +00:00
|
|
|
static cl::opt<bool> EnableTBAA("enable-tbaa", cl::init(true));
|
2010-10-18 18:17:47 +00:00
|
|
|
|
2010-08-02 23:11:01 +00:00
|
|
|
namespace {
|
|
|
|
/// TBAANode - This is a simple wrapper around an MDNode which provides a
|
|
|
|
/// higher-level interface by hiding the details of how alias analysis
|
|
|
|
/// information is encoded in its operands.
|
|
|
|
class TBAANode {
|
|
|
|
const MDNode *Node;
|
|
|
|
|
|
|
|
public:
|
|
|
|
TBAANode() : Node(0) {}
|
2010-09-14 23:28:12 +00:00
|
|
|
explicit TBAANode(const MDNode *N) : Node(N) {}
|
2010-08-02 23:11:01 +00:00
|
|
|
|
|
|
|
/// getNode - Get the MDNode for this TBAANode.
|
|
|
|
const MDNode *getNode() const { return Node; }
|
|
|
|
|
2010-10-20 22:02:58 +00:00
|
|
|
/// getParent - Get this TBAANode's Alias tree parent.
|
2010-08-02 23:11:01 +00:00
|
|
|
TBAANode getParent() const {
|
|
|
|
if (Node->getNumOperands() < 2)
|
|
|
|
return TBAANode();
|
2010-10-14 22:55:57 +00:00
|
|
|
MDNode *P = dyn_cast_or_null<MDNode>(Node->getOperand(1));
|
2010-08-02 23:11:01 +00:00
|
|
|
if (!P)
|
|
|
|
return TBAANode();
|
|
|
|
// Ok, this node has a valid parent. Return it.
|
|
|
|
return TBAANode(P);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// TypeIsImmutable - Test if this TBAANode represents a type for objects
|
|
|
|
/// which are not modified (by any means) in the context where this
|
|
|
|
/// AliasAnalysis is relevant.
|
|
|
|
bool TypeIsImmutable() const {
|
|
|
|
if (Node->getNumOperands() < 3)
|
|
|
|
return false;
|
|
|
|
ConstantInt *CI = dyn_cast<ConstantInt>(Node->getOperand(2));
|
|
|
|
if (!CI)
|
|
|
|
return false;
|
2010-10-25 20:22:29 +00:00
|
|
|
return CI->getValue()[0];
|
2010-08-02 23:11:01 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
/// TypeBasedAliasAnalysis - This is a simple alias analysis
|
|
|
|
/// implementation that uses TypeBased to answer queries.
|
|
|
|
class TypeBasedAliasAnalysis : public ImmutablePass,
|
|
|
|
public AliasAnalysis {
|
|
|
|
public:
|
|
|
|
static char ID; // Class identification, replacement for typeinfo
|
2010-10-19 17:21:58 +00:00
|
|
|
TypeBasedAliasAnalysis() : ImmutablePass(ID) {
|
|
|
|
initializeTypeBasedAliasAnalysisPass(*PassRegistry::getPassRegistry());
|
|
|
|
}
|
2010-08-02 23:11:01 +00:00
|
|
|
|
2010-10-11 23:39:34 +00:00
|
|
|
virtual void initializePass() {
|
|
|
|
InitializeAliasAnalysis(this);
|
|
|
|
}
|
|
|
|
|
2010-08-02 23:11:01 +00:00
|
|
|
/// getAdjustedAnalysisPointer - This method is used when a pass implements
|
|
|
|
/// an analysis interface through multiple inheritance. If needed, it
|
|
|
|
/// should override this to adjust the this pointer as needed for the
|
|
|
|
/// specified pass info.
|
2010-08-06 18:33:48 +00:00
|
|
|
virtual void *getAdjustedAnalysisPointer(const void *PI) {
|
|
|
|
if (PI == &AliasAnalysis::ID)
|
2010-08-02 23:11:01 +00:00
|
|
|
return (AliasAnalysis*)this;
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
2010-10-20 22:11:14 +00:00
|
|
|
bool Aliases(const MDNode *A, const MDNode *B) const;
|
|
|
|
|
2010-08-02 23:11:01 +00:00
|
|
|
private:
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const;
|
2010-09-14 21:25:10 +00:00
|
|
|
virtual AliasResult alias(const Location &LocA, const Location &LocB);
|
2010-11-08 16:45:26 +00:00
|
|
|
virtual bool pointsToConstantMemory(const Location &Loc, bool OrLocal);
|
2010-11-08 17:10:22 +00:00
|
|
|
virtual ModRefBehavior getModRefBehavior(ImmutableCallSite CS);
|
|
|
|
virtual ModRefBehavior getModRefBehavior(const Function *F);
|
2010-10-25 21:38:20 +00:00
|
|
|
virtual ModRefResult getModRefInfo(ImmutableCallSite CS,
|
|
|
|
const Location &Loc);
|
|
|
|
virtual ModRefResult getModRefInfo(ImmutableCallSite CS1,
|
|
|
|
ImmutableCallSite CS2);
|
2010-08-02 23:11:01 +00:00
|
|
|
};
|
|
|
|
} // End of anonymous namespace
|
|
|
|
|
|
|
|
// Register this pass...
|
|
|
|
char TypeBasedAliasAnalysis::ID = 0;
|
|
|
|
INITIALIZE_AG_PASS(TypeBasedAliasAnalysis, AliasAnalysis, "tbaa",
|
2010-10-07 22:25:06 +00:00
|
|
|
"Type-Based Alias Analysis", false, true, false)
|
2010-08-02 23:11:01 +00:00
|
|
|
|
|
|
|
ImmutablePass *llvm::createTypeBasedAliasAnalysisPass() {
|
|
|
|
return new TypeBasedAliasAnalysis();
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TypeBasedAliasAnalysis::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesAll();
|
|
|
|
AliasAnalysis::getAnalysisUsage(AU);
|
|
|
|
}
|
|
|
|
|
2010-10-20 22:11:14 +00:00
|
|
|
/// Aliases - Test whether the type represented by A may alias the
|
|
|
|
/// type represented by B.
|
|
|
|
bool
|
|
|
|
TypeBasedAliasAnalysis::Aliases(const MDNode *A,
|
|
|
|
const MDNode *B) const {
|
2010-08-02 23:11:01 +00:00
|
|
|
// Keep track of the root node for A and B.
|
|
|
|
TBAANode RootA, RootB;
|
|
|
|
|
2010-10-20 22:02:58 +00:00
|
|
|
// Climb the tree from A to see if we reach B.
|
2010-10-20 22:11:14 +00:00
|
|
|
for (TBAANode T(A); ; ) {
|
|
|
|
if (T.getNode() == B)
|
2010-08-02 23:11:01 +00:00
|
|
|
// B is an ancestor of A.
|
2010-10-20 22:11:14 +00:00
|
|
|
return true;
|
2010-08-02 23:11:01 +00:00
|
|
|
|
|
|
|
RootA = T;
|
|
|
|
T = T.getParent();
|
|
|
|
if (!T.getNode())
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2010-10-20 22:02:58 +00:00
|
|
|
// Climb the tree from B to see if we reach A.
|
2010-10-20 22:11:14 +00:00
|
|
|
for (TBAANode T(B); ; ) {
|
|
|
|
if (T.getNode() == A)
|
2010-08-02 23:11:01 +00:00
|
|
|
// A is an ancestor of B.
|
2010-10-20 22:11:14 +00:00
|
|
|
return true;
|
2010-08-02 23:11:01 +00:00
|
|
|
|
|
|
|
RootB = T;
|
|
|
|
T = T.getParent();
|
|
|
|
if (!T.getNode())
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Neither node is an ancestor of the other.
|
|
|
|
|
|
|
|
// If they have different roots, they're part of different potentially
|
|
|
|
// unrelated type systems, so we must be conservative.
|
2010-10-20 22:11:14 +00:00
|
|
|
if (RootA.getNode() != RootB.getNode())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// If they have the same root, then we've proved there's no alias.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
AliasAnalysis::AliasResult
|
|
|
|
TypeBasedAliasAnalysis::alias(const Location &LocA,
|
|
|
|
const Location &LocB) {
|
|
|
|
if (!EnableTBAA)
|
|
|
|
return AliasAnalysis::alias(LocA, LocB);
|
|
|
|
|
|
|
|
// Get the attached MDNodes. If either value lacks a tbaa MDNode, we must
|
|
|
|
// be conservative.
|
|
|
|
const MDNode *AM = LocA.TBAATag;
|
|
|
|
if (!AM) return AliasAnalysis::alias(LocA, LocB);
|
|
|
|
const MDNode *BM = LocB.TBAATag;
|
|
|
|
if (!BM) return AliasAnalysis::alias(LocA, LocB);
|
|
|
|
|
|
|
|
// If they may alias, chain to the next AliasAnalysis.
|
|
|
|
if (Aliases(AM, BM))
|
|
|
|
return AliasAnalysis::alias(LocA, LocB);
|
|
|
|
|
|
|
|
// Otherwise return a definitive result.
|
|
|
|
return NoAlias;
|
2010-08-02 23:11:01 +00:00
|
|
|
}
|
|
|
|
|
2010-11-08 16:45:26 +00:00
|
|
|
bool TypeBasedAliasAnalysis::pointsToConstantMemory(const Location &Loc,
|
|
|
|
bool OrLocal) {
|
2010-10-18 18:17:47 +00:00
|
|
|
if (!EnableTBAA)
|
2010-11-08 16:45:26 +00:00
|
|
|
return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
|
2010-10-18 18:17:47 +00:00
|
|
|
|
2010-09-14 23:28:12 +00:00
|
|
|
const MDNode *M = Loc.TBAATag;
|
2010-11-08 16:45:26 +00:00
|
|
|
if (!M) return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
|
2010-08-02 23:11:01 +00:00
|
|
|
|
|
|
|
// If this is an "immutable" type, we can assume the pointer is pointing
|
|
|
|
// to constant memory.
|
2010-10-18 18:10:31 +00:00
|
|
|
if (TBAANode(M).TypeIsImmutable())
|
|
|
|
return true;
|
|
|
|
|
2010-11-08 16:45:26 +00:00
|
|
|
return AliasAnalysis::pointsToConstantMemory(Loc, OrLocal);
|
2010-08-02 23:11:01 +00:00
|
|
|
}
|
2010-10-25 21:38:20 +00:00
|
|
|
|
2010-11-08 17:10:22 +00:00
|
|
|
AliasAnalysis::ModRefBehavior
|
|
|
|
TypeBasedAliasAnalysis::getModRefBehavior(ImmutableCallSite CS) {
|
|
|
|
if (!EnableTBAA)
|
|
|
|
return AliasAnalysis::getModRefBehavior(CS);
|
|
|
|
|
|
|
|
ModRefBehavior Min = UnknownModRefBehavior;
|
|
|
|
|
|
|
|
// If this is an "immutable" type, we can assume the call doesn't write
|
|
|
|
// to memory.
|
|
|
|
if (const MDNode *M = CS.getInstruction()->getMetadata(LLVMContext::MD_tbaa))
|
|
|
|
if (TBAANode(M).TypeIsImmutable())
|
|
|
|
Min = OnlyReadsMemory;
|
|
|
|
|
2010-11-10 01:02:18 +00:00
|
|
|
return ModRefBehavior(AliasAnalysis::getModRefBehavior(CS) & Min);
|
2010-11-08 17:10:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
AliasAnalysis::ModRefBehavior
|
|
|
|
TypeBasedAliasAnalysis::getModRefBehavior(const Function *F) {
|
2010-11-10 01:02:18 +00:00
|
|
|
// Functions don't have metadata. Just chain to the next implementation.
|
2010-11-08 17:10:22 +00:00
|
|
|
return AliasAnalysis::getModRefBehavior(F);
|
|
|
|
}
|
|
|
|
|
2010-10-25 21:38:20 +00:00
|
|
|
AliasAnalysis::ModRefResult
|
|
|
|
TypeBasedAliasAnalysis::getModRefInfo(ImmutableCallSite CS,
|
|
|
|
const Location &Loc) {
|
|
|
|
if (!EnableTBAA)
|
|
|
|
return AliasAnalysis::getModRefInfo(CS, Loc);
|
|
|
|
|
|
|
|
if (const MDNode *L = Loc.TBAATag)
|
|
|
|
if (const MDNode *M =
|
|
|
|
CS.getInstruction()->getMetadata(LLVMContext::MD_tbaa))
|
|
|
|
if (!Aliases(L, M))
|
|
|
|
return NoModRef;
|
|
|
|
|
|
|
|
return AliasAnalysis::getModRefInfo(CS, Loc);
|
|
|
|
}
|
|
|
|
|
|
|
|
AliasAnalysis::ModRefResult
|
|
|
|
TypeBasedAliasAnalysis::getModRefInfo(ImmutableCallSite CS1,
|
|
|
|
ImmutableCallSite CS2) {
|
|
|
|
if (!EnableTBAA)
|
|
|
|
return AliasAnalysis::getModRefInfo(CS1, CS2);
|
|
|
|
|
|
|
|
if (const MDNode *M1 =
|
|
|
|
CS1.getInstruction()->getMetadata(LLVMContext::MD_tbaa))
|
|
|
|
if (const MDNode *M2 =
|
|
|
|
CS2.getInstruction()->getMetadata(LLVMContext::MD_tbaa))
|
|
|
|
if (!Aliases(M1, M2))
|
|
|
|
return NoModRef;
|
|
|
|
|
|
|
|
return AliasAnalysis::getModRefInfo(CS1, CS2);
|
|
|
|
}
|