2002-08-22 18:25:20 +00:00
|
|
|
//===- llvm/Analysis/AliasAnalysis.h - Alias Analysis Interface -*- C++ -*-===//
|
2003-10-20 20:19:47 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-08-22 18:25:20 +00:00
|
|
|
//
|
|
|
|
// This file defines the generic AliasAnalysis interface, which is used as the
|
|
|
|
// common interface used by all clients of alias analysis information, and
|
2003-02-26 19:24:47 +00:00
|
|
|
// implemented by all alias analysis implementations. Mod/Ref information is
|
|
|
|
// also captured by this interface.
|
2002-08-22 18:25:20 +00:00
|
|
|
//
|
|
|
|
// Implementations of this interface must implement the various virtual methods,
|
|
|
|
// which automatically provides functionality for the entire suite of client
|
|
|
|
// APIs.
|
|
|
|
//
|
2003-02-26 19:24:47 +00:00
|
|
|
// This API represents memory as a (Pointer, Size) pair. The Pointer component
|
|
|
|
// specifies the base memory address of the region, the Size specifies how large
|
|
|
|
// of an area is being queried. If Size is 0, two pointers only alias if they
|
|
|
|
// are exactly equal. If size is greater than zero, but small, the two pointers
|
|
|
|
// alias if the areas pointed to overlap. If the size is very large (ie, ~0U),
|
|
|
|
// then the two pointers alias if they may be pointing to components of the same
|
|
|
|
// memory object. Pointers that point to two completely different objects in
|
|
|
|
// memory never alias, regardless of the value of the Size component.
|
|
|
|
//
|
2002-08-22 18:25:20 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_ANALYSIS_ALIAS_ANALYSIS_H
|
|
|
|
#define LLVM_ANALYSIS_ALIAS_ANALYSIS_H
|
|
|
|
|
2003-02-26 19:24:47 +00:00
|
|
|
#include "llvm/Support/CallSite.h"
|
2004-02-10 21:19:49 +00:00
|
|
|
#include "llvm/Pass.h" // Need this for IncludeFile
|
2003-11-11 22:41:34 +00:00
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
|
2003-02-26 19:24:47 +00:00
|
|
|
class LoadInst;
|
|
|
|
class StoreInst;
|
|
|
|
class TargetData;
|
|
|
|
|
|
|
|
class AliasAnalysis {
|
|
|
|
protected:
|
2004-05-23 21:12:38 +00:00
|
|
|
const TargetData *TD;
|
|
|
|
AliasAnalysis *AA; // Previous Alias Analysis to chain to.
|
|
|
|
|
2003-02-26 19:24:47 +00:00
|
|
|
/// InitializeAliasAnalysis - Subclasses must call this method to initialize
|
|
|
|
/// the AliasAnalysis interface before any other methods are called. This is
|
|
|
|
/// typically called by the run* methods of these subclasses. This may be
|
|
|
|
/// called multiple times.
|
|
|
|
///
|
|
|
|
void InitializeAliasAnalysis(Pass *P);
|
|
|
|
|
|
|
|
// getAnalysisUsage - All alias analysis implementations should invoke this
|
|
|
|
// directly (using AliasAnalysis::getAnalysisUsage(AU)) to make sure that
|
|
|
|
// TargetData is required by the pass.
|
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const;
|
|
|
|
|
|
|
|
public:
|
2004-05-23 21:12:38 +00:00
|
|
|
AliasAnalysis() : TD(0), AA(0) {}
|
2003-02-26 19:24:47 +00:00
|
|
|
virtual ~AliasAnalysis(); // We want to be subclassed
|
|
|
|
|
|
|
|
/// getTargetData - Every alias analysis implementation depends on the size of
|
|
|
|
/// data items in the current Target. This provides a uniform way to handle
|
|
|
|
/// it.
|
2004-03-11 23:08:20 +00:00
|
|
|
///
|
2003-02-26 19:24:47 +00:00
|
|
|
const TargetData &getTargetData() const { return *TD; }
|
2002-08-22 18:25:20 +00:00
|
|
|
|
2003-02-26 19:24:47 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// Alias Queries...
|
|
|
|
///
|
2002-08-22 18:25:20 +00:00
|
|
|
|
2002-08-22 21:22:25 +00:00
|
|
|
/// Alias analysis result - Either we know for sure that it does not alias, we
|
|
|
|
/// know for sure it must alias, or we don't know anything: The two pointers
|
|
|
|
/// _might_ alias. This enum is designed so you can do things like:
|
|
|
|
/// if (AA.alias(P1, P2)) { ... }
|
|
|
|
/// to check to see if two pointers might alias.
|
|
|
|
///
|
2003-02-26 19:24:47 +00:00
|
|
|
enum AliasResult { NoAlias = 0, MayAlias = 1, MustAlias = 2 };
|
2002-08-22 18:25:20 +00:00
|
|
|
|
2002-08-22 21:22:25 +00:00
|
|
|
/// alias - The main low level interface to the alias analysis implementation.
|
|
|
|
/// Returns a Result indicating whether the two pointers are aliased to each
|
|
|
|
/// other. This is the interface that must be implemented by specific alias
|
|
|
|
/// analysis implementations.
|
|
|
|
///
|
2003-02-26 19:24:47 +00:00
|
|
|
virtual AliasResult alias(const Value *V1, unsigned V1Size,
|
2004-05-23 21:12:38 +00:00
|
|
|
const Value *V2, unsigned V2Size);
|
2002-08-22 18:25:20 +00:00
|
|
|
|
2003-06-29 00:23:11 +00:00
|
|
|
/// getMustAliases - If there are any pointers known that must alias this
|
|
|
|
/// pointer, return them now. This allows alias-set based alias analyses to
|
|
|
|
/// perform a form a value numbering (which is exposed by load-vn). If an
|
|
|
|
/// alias analysis supports this, it should ADD any must aliased pointers to
|
|
|
|
/// the specified vector.
|
|
|
|
///
|
2004-05-23 21:12:38 +00:00
|
|
|
virtual void getMustAliases(Value *P, std::vector<Value*> &RetVals);
|
2003-06-29 00:23:11 +00:00
|
|
|
|
2004-01-30 22:15:41 +00:00
|
|
|
/// pointsToConstantMemory - If the specified pointer is known to point into
|
|
|
|
/// constant global memory, return true. This allows disambiguation of store
|
|
|
|
/// instructions from constant pointers.
|
|
|
|
///
|
2004-05-23 21:12:38 +00:00
|
|
|
virtual bool pointsToConstantMemory(const Value *P);
|
2003-06-29 00:23:11 +00:00
|
|
|
|
2004-03-15 01:58:54 +00:00
|
|
|
/// doesNotAccessMemory - If the specified function is known to never read or
|
2004-03-15 04:07:59 +00:00
|
|
|
/// write memory, return true. If the function only reads from known-constant
|
2004-04-10 06:11:29 +00:00
|
|
|
/// memory, it is also legal to return true. Functions that unwind the stack
|
|
|
|
/// are not legal for this predicate.
|
2004-03-15 01:58:54 +00:00
|
|
|
///
|
|
|
|
/// Many optimizations (such as CSE and LICM) can be performed on calls to it,
|
|
|
|
/// without worrying about aliasing properties, and many functions have this
|
|
|
|
/// property (e.g. 'sin' and 'cos').
|
|
|
|
///
|
|
|
|
/// This property corresponds to the GCC 'const' attribute.
|
|
|
|
///
|
2004-05-23 21:12:38 +00:00
|
|
|
virtual bool doesNotAccessMemory(Function *F);
|
2004-03-15 01:58:54 +00:00
|
|
|
|
|
|
|
/// onlyReadsMemory - If the specified function is known to only read from
|
2004-04-10 06:11:29 +00:00
|
|
|
/// non-volatile memory (or not access memory at all), return true. Functions
|
|
|
|
/// that unwind the stack are not legal for this predicate.
|
2004-03-15 01:58:54 +00:00
|
|
|
///
|
|
|
|
/// This property allows many common optimizations to be performed in the
|
|
|
|
/// absence of interfering store instructions, such as CSE of strlen calls.
|
|
|
|
///
|
|
|
|
/// This property corresponds to the GCC 'pure' attribute.
|
|
|
|
///
|
2004-05-23 21:12:38 +00:00
|
|
|
virtual bool onlyReadsMemory(Function *F);
|
2004-03-15 01:58:54 +00:00
|
|
|
|
|
|
|
|
2003-02-26 19:24:47 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// Simple mod/ref information...
|
2002-08-22 21:22:25 +00:00
|
|
|
///
|
2002-08-22 18:25:20 +00:00
|
|
|
|
2003-02-26 19:24:47 +00:00
|
|
|
/// ModRefResult - Represent the result of a mod/ref query. Mod and Ref are
|
|
|
|
/// bits which may be or'd together.
|
2002-08-22 21:22:25 +00:00
|
|
|
///
|
2003-02-26 19:24:47 +00:00
|
|
|
enum ModRefResult { NoModRef = 0, Ref = 1, Mod = 2, ModRef = 3 };
|
|
|
|
|
|
|
|
/// getModRefInfo - Return information about whether or not an instruction may
|
|
|
|
/// read or write memory specified by the pointer operand. An instruction
|
|
|
|
/// that doesn't read or write memory may be trivially LICM'd for example.
|
|
|
|
|
|
|
|
/// getModRefInfo (for call sites) - Return whether information about whether
|
|
|
|
/// a particular call site modifies or reads the memory specified by the
|
|
|
|
/// pointer.
|
|
|
|
///
|
2004-03-15 04:07:59 +00:00
|
|
|
virtual ModRefResult getModRefInfo(CallSite CS, Value *P, unsigned Size);
|
2003-02-26 19:24:47 +00:00
|
|
|
|
|
|
|
/// getModRefInfo - Return information about whether two call sites may refer
|
|
|
|
/// to the same set of memory locations. This function returns NoModRef if
|
2004-04-11 16:42:50 +00:00
|
|
|
/// the two calls refer to disjoint memory locations, Ref if CS1 reads memory
|
|
|
|
/// written by CS2, Mod if CS1 writes to memory read or written by CS2, or
|
|
|
|
/// ModRef if CS1 might read or write memory accessed by CS2.
|
2003-02-26 19:24:47 +00:00
|
|
|
///
|
2004-03-15 04:07:59 +00:00
|
|
|
virtual ModRefResult getModRefInfo(CallSite CS1, CallSite CS2);
|
2003-02-26 19:24:47 +00:00
|
|
|
|
2004-04-11 16:35:30 +00:00
|
|
|
/// hasNoModRefInfoForCalls - Return true if the analysis has no mod/ref
|
2004-04-11 16:42:50 +00:00
|
|
|
/// information for pairs of function calls (other than "pure" and "const"
|
|
|
|
/// functions). This can be used by clients to avoid many pointless queries.
|
|
|
|
/// Remember that if you override this and chain to another analysis, you must
|
|
|
|
/// make sure that it doesn't have mod/ref info either.
|
2004-04-11 16:35:30 +00:00
|
|
|
///
|
2004-05-23 21:12:38 +00:00
|
|
|
virtual bool hasNoModRefInfoForCalls() const;
|
2004-04-11 16:35:30 +00:00
|
|
|
|
2003-02-26 19:24:47 +00:00
|
|
|
/// Convenience functions...
|
|
|
|
ModRefResult getModRefInfo(LoadInst *L, Value *P, unsigned Size);
|
2004-03-15 04:07:59 +00:00
|
|
|
ModRefResult getModRefInfo(StoreInst *S, Value *P, unsigned Size);
|
|
|
|
ModRefResult getModRefInfo(CallInst *C, Value *P, unsigned Size) {
|
2003-02-26 19:24:47 +00:00
|
|
|
return getModRefInfo(CallSite(C), P, Size);
|
|
|
|
}
|
2004-03-15 04:07:59 +00:00
|
|
|
ModRefResult getModRefInfo(InvokeInst *I, Value *P, unsigned Size) {
|
2003-02-26 19:24:47 +00:00
|
|
|
return getModRefInfo(CallSite(I), P, Size);
|
|
|
|
}
|
|
|
|
ModRefResult getModRefInfo(Instruction *I, Value *P, unsigned Size) {
|
|
|
|
switch (I->getOpcode()) {
|
|
|
|
case Instruction::Load: return getModRefInfo((LoadInst*)I, P, Size);
|
|
|
|
case Instruction::Store: return getModRefInfo((StoreInst*)I, P, Size);
|
|
|
|
case Instruction::Call: return getModRefInfo((CallInst*)I, P, Size);
|
|
|
|
case Instruction::Invoke: return getModRefInfo((InvokeInst*)I, P, Size);
|
|
|
|
default: return NoModRef;
|
|
|
|
}
|
|
|
|
}
|
2002-08-22 18:25:20 +00:00
|
|
|
|
2004-05-23 21:12:38 +00:00
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// Higher level methods for querying mod/ref information.
|
|
|
|
///
|
|
|
|
|
2002-08-22 21:22:25 +00:00
|
|
|
/// canBasicBlockModify - Return true if it is possible for execution of the
|
|
|
|
/// specified basic block to modify the value pointed to by Ptr.
|
|
|
|
///
|
2003-02-26 19:24:47 +00:00
|
|
|
bool canBasicBlockModify(const BasicBlock &BB, const Value *P, unsigned Size);
|
2002-08-22 18:25:20 +00:00
|
|
|
|
2002-08-22 21:22:25 +00:00
|
|
|
/// canInstructionRangeModify - Return true if it is possible for the
|
|
|
|
/// execution of the specified instructions to modify the value pointed to by
|
|
|
|
/// Ptr. The instructions to consider are all of the instructions in the
|
|
|
|
/// range of [I1,I2] INCLUSIVE. I1 and I2 must be in the same basic block.
|
|
|
|
///
|
2002-08-22 18:25:20 +00:00
|
|
|
bool canInstructionRangeModify(const Instruction &I1, const Instruction &I2,
|
2003-02-26 19:24:47 +00:00
|
|
|
const Value *Ptr, unsigned Size);
|
2004-05-23 21:12:38 +00:00
|
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
/// Methods that clients should call when they transform the program to allow
|
|
|
|
/// alias analyses to update their internal data structures. Note that these
|
|
|
|
/// methods may be called on any instruction, regardless of whether or not
|
|
|
|
/// they have pointer-analysis implications.
|
|
|
|
///
|
|
|
|
|
|
|
|
/// deleteValue - This method should be called whenever an LLVM Value is
|
|
|
|
/// deleted from the program, for example when an instruction is found to be
|
|
|
|
/// redundant and is eliminated.
|
|
|
|
///
|
|
|
|
virtual void deleteValue(Value *V);
|
|
|
|
|
|
|
|
/// copyValue - This method should be used whenever a preexisting value in the
|
|
|
|
/// program is copied or cloned, introducing a new value. Note that analysis
|
|
|
|
/// implementations should tolerate clients that use this method to introduce
|
|
|
|
/// the same value multiple times: if the analysis already knows about a
|
|
|
|
/// value, it should ignore the request.
|
|
|
|
///
|
|
|
|
virtual void copyValue(Value *From, Value *To);
|
|
|
|
|
|
|
|
/// replaceWithNewValue - This method is the obvious combination of the two
|
|
|
|
/// above, and it provided as a helper to simplify client code.
|
|
|
|
///
|
|
|
|
void replaceWithNewValue(Value *Old, Value *New) {
|
|
|
|
copyValue(Old, New);
|
|
|
|
deleteValue(Old);
|
|
|
|
}
|
2002-08-22 18:25:20 +00:00
|
|
|
};
|
|
|
|
|
2003-12-11 05:05:02 +00:00
|
|
|
// Because of the way .a files work, we must force the BasicAA implementation to
|
|
|
|
// be pulled in if the AliasAnalysis header is included. Otherwise we run
|
|
|
|
// the risk of AliasAnalysis being used, but the default implementation not
|
|
|
|
// being linked into the tool that uses it.
|
|
|
|
//
|
|
|
|
extern void BasicAAStub();
|
|
|
|
static IncludeFile HDR_INCLUDE_BASICAA_CPP((void*)&BasicAAStub);
|
|
|
|
|
2003-11-11 22:41:34 +00:00
|
|
|
} // End llvm namespace
|
|
|
|
|
2002-08-22 18:25:20 +00:00
|
|
|
#endif
|