2002-09-27 05:49:07 +08:00
|
|
|
//===- AliasSetTracker.cpp - Alias Sets Tracker implementation-------------===//
|
2005-04-22 05:13:18 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:36:04 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2005-04-22 05:13:18 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-09-27 05:49:07 +08:00
|
|
|
//
|
|
|
|
// This file implements the AliasSetTracker and AliasSet classes.
|
2005-04-22 05:13:18 +08:00
|
|
|
//
|
2002-09-27 05:49:07 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Analysis/AliasSetTracker.h"
|
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
2004-07-30 01:30:56 +08:00
|
|
|
#include "llvm/Instructions.h"
|
2009-03-03 14:02:04 +08:00
|
|
|
#include "llvm/IntrinsicInst.h"
|
2003-02-25 04:37:56 +08:00
|
|
|
#include "llvm/Pass.h"
|
2005-03-17 23:38:16 +08:00
|
|
|
#include "llvm/Type.h"
|
2003-02-27 06:11:00 +08:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2003-02-25 04:37:56 +08:00
|
|
|
#include "llvm/Assembly/Writer.h"
|
2007-02-06 07:42:17 +08:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2003-02-25 04:37:56 +08:00
|
|
|
#include "llvm/Support/InstIterator.h"
|
2006-11-29 06:46:12 +08:00
|
|
|
#include "llvm/Support/Streams.h"
|
2003-12-14 12:52:11 +08:00
|
|
|
using namespace llvm;
|
2003-11-12 06:41:34 +08:00
|
|
|
|
2004-11-28 02:37:42 +08:00
|
|
|
/// mergeSetIn - Merge the specified alias set into this alias set.
|
2002-09-27 05:49:07 +08:00
|
|
|
///
|
2004-11-28 02:37:42 +08:00
|
|
|
void AliasSet::mergeSetIn(AliasSet &AS, AliasSetTracker &AST) {
|
2003-02-25 04:37:56 +08:00
|
|
|
assert(!AS.Forward && "Alias set is already forwarding!");
|
|
|
|
assert(!Forward && "This set is a forwarding set!!");
|
|
|
|
|
|
|
|
// Update the alias and access types of this set...
|
|
|
|
AccessTy |= AS.AccessTy;
|
|
|
|
AliasTy |= AS.AliasTy;
|
|
|
|
|
2004-11-28 02:37:42 +08:00
|
|
|
if (AliasTy == MustAlias) {
|
|
|
|
// Check that these two merged sets really are must aliases. Since both
|
|
|
|
// used to be must-alias sets, we can just check any pointer from each set
|
|
|
|
// for aliasing.
|
|
|
|
AliasAnalysis &AA = AST.getAliasAnalysis();
|
2009-03-09 13:11:09 +08:00
|
|
|
PointerRec *L = getSomePointer();
|
|
|
|
PointerRec *R = AS.getSomePointer();
|
2004-11-28 02:37:42 +08:00
|
|
|
|
|
|
|
// If the pointers are not a must-alias pair, this set becomes a may alias.
|
2009-03-09 13:11:09 +08:00
|
|
|
if (AA.alias(L->getValue(), L->getSize(), R->getValue(), R->getSize())
|
2004-11-28 02:37:42 +08:00
|
|
|
!= AliasAnalysis::MustAlias)
|
|
|
|
AliasTy = MayAlias;
|
|
|
|
}
|
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
if (CallSites.empty()) { // Merge call sites...
|
|
|
|
if (!AS.CallSites.empty())
|
|
|
|
std::swap(CallSites, AS.CallSites);
|
|
|
|
} else if (!AS.CallSites.empty()) {
|
|
|
|
CallSites.insert(CallSites.end(), AS.CallSites.begin(), AS.CallSites.end());
|
|
|
|
AS.CallSites.clear();
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
2005-04-22 05:13:18 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
AS.Forward = this; // Forward across AS now...
|
2004-07-22 15:58:18 +08:00
|
|
|
addRef(); // AS is now pointing to us...
|
2003-02-25 04:37:56 +08:00
|
|
|
|
|
|
|
// Merge the list of constituent pointers...
|
2003-12-18 16:11:56 +08:00
|
|
|
if (AS.PtrList) {
|
|
|
|
*PtrListEnd = AS.PtrList;
|
2009-03-09 13:11:09 +08:00
|
|
|
AS.PtrList->setPrevInList(PtrListEnd);
|
2003-12-18 16:11:56 +08:00
|
|
|
PtrListEnd = AS.PtrListEnd;
|
|
|
|
|
|
|
|
AS.PtrList = 0;
|
|
|
|
AS.PtrListEnd = &AS.PtrList;
|
2004-09-16 00:59:47 +08:00
|
|
|
assert(*AS.PtrListEnd == 0 && "End of list is not null?");
|
2003-12-18 16:11:56 +08:00
|
|
|
}
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
void AliasSetTracker::removeAliasSet(AliasSet *AS) {
|
2004-07-22 15:58:18 +08:00
|
|
|
if (AliasSet *Fwd = AS->Forward) {
|
|
|
|
Fwd->dropRef(*this);
|
|
|
|
AS->Forward = 0;
|
|
|
|
}
|
2003-02-25 04:37:56 +08:00
|
|
|
AliasSets.erase(AS);
|
|
|
|
}
|
2002-09-27 05:49:07 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
void AliasSet::removeFromTracker(AliasSetTracker &AST) {
|
|
|
|
assert(RefCount == 0 && "Cannot remove non-dead alias set from tracker!");
|
|
|
|
AST.removeAliasSet(this);
|
|
|
|
}
|
|
|
|
|
2009-03-09 13:11:09 +08:00
|
|
|
void AliasSet::addPointer(AliasSetTracker &AST, PointerRec &Entry,
|
2004-09-15 03:15:32 +08:00
|
|
|
unsigned Size, bool KnownMustAlias) {
|
2009-03-09 13:11:09 +08:00
|
|
|
assert(!Entry.hasAliasSet() && "Entry already in set!");
|
2003-02-25 04:37:56 +08:00
|
|
|
|
2004-09-15 03:15:32 +08:00
|
|
|
// Check to see if we have to downgrade to _may_ alias.
|
|
|
|
if (isMustAlias() && !KnownMustAlias)
|
2009-03-09 13:11:09 +08:00
|
|
|
if (PointerRec *P = getSomePointer()) {
|
2004-09-16 00:59:47 +08:00
|
|
|
AliasAnalysis &AA = AST.getAliasAnalysis();
|
2003-02-27 06:11:00 +08:00
|
|
|
AliasAnalysis::AliasResult Result =
|
2009-03-09 13:11:09 +08:00
|
|
|
AA.alias(P->getValue(), P->getSize(), Entry.getValue(), Size);
|
2003-02-27 06:11:00 +08:00
|
|
|
if (Result == AliasAnalysis::MayAlias)
|
2003-02-25 04:37:56 +08:00
|
|
|
AliasTy = MayAlias;
|
2003-02-27 06:11:00 +08:00
|
|
|
else // First entry of must alias must have maximum size!
|
2009-03-09 13:11:09 +08:00
|
|
|
P->updateSize(Size);
|
2003-02-27 06:11:00 +08:00
|
|
|
assert(Result != AliasAnalysis::NoAlias && "Cannot be part of must set!");
|
|
|
|
}
|
2003-02-25 04:37:56 +08:00
|
|
|
|
2009-03-09 13:11:09 +08:00
|
|
|
Entry.setAliasSet(this);
|
|
|
|
Entry.updateSize(Size);
|
2003-02-25 04:37:56 +08:00
|
|
|
|
|
|
|
// Add it to the end of the list...
|
2003-12-18 16:11:56 +08:00
|
|
|
assert(*PtrListEnd == 0 && "End of list is not null?");
|
|
|
|
*PtrListEnd = &Entry;
|
2009-03-09 13:11:09 +08:00
|
|
|
PtrListEnd = Entry.setPrevInList(PtrListEnd);
|
2004-09-16 00:59:47 +08:00
|
|
|
assert(*PtrListEnd == 0 && "End of list is not null?");
|
2004-07-22 15:58:18 +08:00
|
|
|
addRef(); // Entry points to alias set...
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
|
|
|
|
2004-03-15 12:08:36 +08:00
|
|
|
void AliasSet::addCallSite(CallSite CS, AliasAnalysis &AA) {
|
2003-02-25 04:37:56 +08:00
|
|
|
CallSites.push_back(CS);
|
2004-03-15 12:08:36 +08:00
|
|
|
|
2007-12-01 15:51:45 +08:00
|
|
|
AliasAnalysis::ModRefBehavior Behavior = AA.getModRefBehavior(CS);
|
|
|
|
if (Behavior == AliasAnalysis::DoesNotAccessMemory)
|
|
|
|
return;
|
|
|
|
else if (Behavior == AliasAnalysis::OnlyReadsMemory) {
|
|
|
|
AliasTy = MayAlias;
|
|
|
|
AccessTy |= Refs;
|
|
|
|
return;
|
2004-03-15 12:08:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// FIXME: This should use mod/ref information to make this not suck so bad
|
|
|
|
AliasTy = MayAlias;
|
2003-05-03 11:42:08 +08:00
|
|
|
AccessTy = ModRef;
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// aliasesPointer - Return true if the specified pointer "may" (or must)
|
2002-09-27 05:49:07 +08:00
|
|
|
/// alias one of the members in the set.
|
|
|
|
///
|
2003-02-27 06:11:00 +08:00
|
|
|
bool AliasSet::aliasesPointer(const Value *Ptr, unsigned Size,
|
|
|
|
AliasAnalysis &AA) const {
|
2003-02-25 04:37:56 +08:00
|
|
|
if (AliasTy == MustAlias) {
|
2004-03-15 14:28:07 +08:00
|
|
|
assert(CallSites.empty() && "Illegal must alias set!");
|
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
// If this is a set of MustAliases, only check to see if the pointer aliases
|
|
|
|
// SOME value in the set...
|
2009-03-09 13:11:09 +08:00
|
|
|
PointerRec *SomePtr = getSomePointer();
|
2003-02-25 04:37:56 +08:00
|
|
|
assert(SomePtr && "Empty must-alias set??");
|
2009-03-09 13:11:09 +08:00
|
|
|
return AA.alias(SomePtr->getValue(), SomePtr->getSize(), Ptr, Size);
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// If this is a may-alias set, we have to check all of the pointers in the set
|
|
|
|
// to be sure it doesn't alias the set...
|
|
|
|
for (iterator I = begin(), E = end(); I != E; ++I)
|
2004-07-22 15:58:18 +08:00
|
|
|
if (AA.alias(Ptr, Size, I.getPointer(), I.getSize()))
|
2002-09-27 05:49:07 +08:00
|
|
|
return true;
|
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
// Check the call sites list and invoke list...
|
2004-07-27 10:20:26 +08:00
|
|
|
if (!CallSites.empty()) {
|
|
|
|
if (AA.hasNoModRefInfoForCalls())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = CallSites.size(); i != e; ++i)
|
|
|
|
if (AA.getModRefInfo(CallSites[i], const_cast<Value*>(Ptr), Size)
|
|
|
|
!= AliasAnalysis::NoModRef)
|
|
|
|
return true;
|
|
|
|
}
|
2002-09-27 05:49:07 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
return false;
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
bool AliasSet::aliasesCallSite(CallSite CS, AliasAnalysis &AA) const {
|
2007-12-01 15:51:45 +08:00
|
|
|
if (AA.doesNotAccessMemory(CS))
|
|
|
|
return false;
|
2004-03-15 12:08:36 +08:00
|
|
|
|
2004-07-27 10:20:26 +08:00
|
|
|
if (AA.hasNoModRefInfoForCalls())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = CallSites.size(); i != e; ++i)
|
|
|
|
if (AA.getModRefInfo(CallSites[i], CS) != AliasAnalysis::NoModRef ||
|
|
|
|
AA.getModRefInfo(CS, CallSites[i]) != AliasAnalysis::NoModRef)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
for (iterator I = begin(), E = end(); I != E; ++I)
|
|
|
|
if (AA.getModRefInfo(CS, I.getPointer(), I.getSize()) !=
|
|
|
|
AliasAnalysis::NoModRef)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
2002-09-27 05:49:07 +08:00
|
|
|
|
2009-03-09 13:11:09 +08:00
|
|
|
void AliasSetTracker::clear() {
|
|
|
|
// Delete all the PointerRec entries.
|
|
|
|
for (DenseMap<Value*, AliasSet::PointerRec*>::iterator I = PointerMap.begin(),
|
|
|
|
E = PointerMap.end(); I != E; ++I)
|
|
|
|
I->second->eraseFromList();
|
|
|
|
|
|
|
|
PointerMap.clear();
|
|
|
|
|
|
|
|
// The alias sets should all be clear now.
|
|
|
|
AliasSets.clear();
|
|
|
|
}
|
|
|
|
|
2002-09-27 05:49:07 +08:00
|
|
|
|
|
|
|
/// findAliasSetForPointer - Given a pointer, find the one alias set to put the
|
|
|
|
/// instruction referring to the pointer into. If there are multiple alias sets
|
|
|
|
/// that may alias the pointer, merge them together and return the unified set.
|
|
|
|
///
|
2003-02-27 06:11:00 +08:00
|
|
|
AliasSet *AliasSetTracker::findAliasSetForPointer(const Value *Ptr,
|
|
|
|
unsigned Size) {
|
2002-09-27 05:49:07 +08:00
|
|
|
AliasSet *FoundSet = 0;
|
2003-02-25 04:37:56 +08:00
|
|
|
for (iterator I = begin(), E = end(); I != E; ++I)
|
2003-02-27 06:11:00 +08:00
|
|
|
if (!I->Forward && I->aliasesPointer(Ptr, Size, AA)) {
|
2004-11-28 02:37:42 +08:00
|
|
|
if (FoundSet == 0) { // If this is the first alias set ptr can go into.
|
2003-02-25 04:37:56 +08:00
|
|
|
FoundSet = I; // Remember it.
|
2004-11-28 02:37:42 +08:00
|
|
|
} else { // Otherwise, we must merge the sets.
|
|
|
|
FoundSet->mergeSetIn(*I, *this); // Merge in contents.
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return FoundSet;
|
|
|
|
}
|
|
|
|
|
2004-11-27 05:36:25 +08:00
|
|
|
/// containsPointer - Return true if the specified location is represented by
|
|
|
|
/// this alias set, false otherwise. This does not modify the AST object or
|
|
|
|
/// alias sets.
|
|
|
|
bool AliasSetTracker::containsPointer(Value *Ptr, unsigned Size) const {
|
|
|
|
for (const_iterator I = begin(), E = end(); I != E; ++I)
|
|
|
|
if (!I->Forward && I->aliasesPointer(Ptr, Size, AA))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
AliasSet *AliasSetTracker::findAliasSetForCallSite(CallSite CS) {
|
|
|
|
AliasSet *FoundSet = 0;
|
|
|
|
for (iterator I = begin(), E = end(); I != E; ++I)
|
2003-02-27 03:28:57 +08:00
|
|
|
if (!I->Forward && I->aliasesCallSite(CS, AA)) {
|
2004-11-28 02:37:42 +08:00
|
|
|
if (FoundSet == 0) { // If this is the first alias set ptr can go into.
|
2003-02-25 04:37:56 +08:00
|
|
|
FoundSet = I; // Remember it.
|
2004-11-28 02:37:42 +08:00
|
|
|
} else if (!I->Forward) { // Otherwise, we must merge the sets.
|
|
|
|
FoundSet->mergeSetIn(*I, *this); // Merge in contents.
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
|
|
|
}
|
2002-09-27 05:49:07 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
return FoundSet;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// getAliasSetForPointer - Return the alias set that the specified pointer
|
2009-03-09 13:11:09 +08:00
|
|
|
/// lives in.
|
2004-07-21 13:18:04 +08:00
|
|
|
AliasSet &AliasSetTracker::getAliasSetForPointer(Value *Pointer, unsigned Size,
|
|
|
|
bool *New) {
|
2009-03-09 13:11:09 +08:00
|
|
|
AliasSet::PointerRec &Entry = getEntryFor(Pointer);
|
2003-02-25 04:37:56 +08:00
|
|
|
|
|
|
|
// Check to see if the pointer is already known...
|
2009-03-09 13:11:09 +08:00
|
|
|
if (Entry.hasAliasSet()) {
|
|
|
|
Entry.updateSize(Size);
|
2003-02-25 04:37:56 +08:00
|
|
|
// Return the set!
|
2009-03-09 13:11:09 +08:00
|
|
|
return *Entry.getAliasSet(*this)->getForwardedTarget(*this);
|
2003-02-27 06:11:00 +08:00
|
|
|
} else if (AliasSet *AS = findAliasSetForPointer(Pointer, Size)) {
|
2003-02-25 04:37:56 +08:00
|
|
|
// Add it to the alias set it aliases...
|
2003-02-27 06:11:00 +08:00
|
|
|
AS->addPointer(*this, Entry, Size);
|
2003-02-25 04:37:56 +08:00
|
|
|
return *AS;
|
2002-09-27 05:49:07 +08:00
|
|
|
} else {
|
2004-07-21 13:18:04 +08:00
|
|
|
if (New) *New = true;
|
2003-02-25 04:37:56 +08:00
|
|
|
// Otherwise create a new alias set to hold the loaded pointer...
|
2004-07-22 15:58:18 +08:00
|
|
|
AliasSets.push_back(new AliasSet());
|
2003-02-27 06:11:00 +08:00
|
|
|
AliasSets.back().addPointer(*this, Entry, Size);
|
2003-02-25 04:37:56 +08:00
|
|
|
return AliasSets.back();
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-07-26 13:50:23 +08:00
|
|
|
bool AliasSetTracker::add(Value *Ptr, unsigned Size) {
|
|
|
|
bool NewPtr;
|
|
|
|
addPointer(Ptr, Size, AliasSet::NoModRef, NewPtr);
|
|
|
|
return NewPtr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2004-07-21 13:18:04 +08:00
|
|
|
bool AliasSetTracker::add(LoadInst *LI) {
|
|
|
|
bool NewPtr;
|
|
|
|
AliasSet &AS = addPointer(LI->getOperand(0),
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
AA.getTargetData().getTypeStoreSize(LI->getType()),
|
2004-07-21 13:18:04 +08:00
|
|
|
AliasSet::Refs, NewPtr);
|
2003-12-14 12:52:11 +08:00
|
|
|
if (LI->isVolatile()) AS.setVolatile();
|
2004-07-21 13:18:04 +08:00
|
|
|
return NewPtr;
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
|
|
|
|
2004-07-21 13:18:04 +08:00
|
|
|
bool AliasSetTracker::add(StoreInst *SI) {
|
|
|
|
bool NewPtr;
|
|
|
|
Value *Val = SI->getOperand(0);
|
|
|
|
AliasSet &AS = addPointer(SI->getOperand(1),
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
AA.getTargetData().getTypeStoreSize(Val->getType()),
|
2004-07-21 13:18:04 +08:00
|
|
|
AliasSet::Mods, NewPtr);
|
2003-12-14 12:52:11 +08:00
|
|
|
if (SI->isVolatile()) AS.setVolatile();
|
2004-07-21 13:18:04 +08:00
|
|
|
return NewPtr;
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
|
|
|
|
2004-07-25 15:57:37 +08:00
|
|
|
bool AliasSetTracker::add(FreeInst *FI) {
|
|
|
|
bool NewPtr;
|
2008-05-22 11:23:06 +08:00
|
|
|
addPointer(FI->getOperand(0), ~0, AliasSet::Mods, NewPtr);
|
2004-07-25 15:57:37 +08:00
|
|
|
return NewPtr;
|
|
|
|
}
|
|
|
|
|
2008-04-15 02:34:50 +08:00
|
|
|
bool AliasSetTracker::add(VAArgInst *VAAI) {
|
|
|
|
bool NewPtr;
|
2008-05-22 11:23:06 +08:00
|
|
|
addPointer(VAAI->getOperand(0), ~0, AliasSet::ModRef, NewPtr);
|
2008-04-15 02:34:50 +08:00
|
|
|
return NewPtr;
|
|
|
|
}
|
|
|
|
|
2003-12-14 12:52:11 +08:00
|
|
|
|
2004-07-21 13:18:04 +08:00
|
|
|
bool AliasSetTracker::add(CallSite CS) {
|
2009-03-03 14:02:04 +08:00
|
|
|
if (isa<DbgInfoIntrinsic>(CS.getInstruction()))
|
|
|
|
return true; // Ignore DbgInfo Intrinsics.
|
2007-12-01 15:51:45 +08:00
|
|
|
if (AA.doesNotAccessMemory(CS))
|
|
|
|
return true; // doesn't alias anything
|
2004-03-15 14:28:07 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
AliasSet *AS = findAliasSetForCallSite(CS);
|
|
|
|
if (!AS) {
|
2004-07-22 15:58:18 +08:00
|
|
|
AliasSets.push_back(new AliasSet());
|
2003-02-25 04:37:56 +08:00
|
|
|
AS = &AliasSets.back();
|
2004-07-21 13:18:04 +08:00
|
|
|
AS->addCallSite(CS, AA);
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
AS->addCallSite(CS, AA);
|
|
|
|
return false;
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-07-21 13:18:04 +08:00
|
|
|
bool AliasSetTracker::add(Instruction *I) {
|
2003-02-25 04:37:56 +08:00
|
|
|
// Dispatch to one of the other add methods...
|
|
|
|
if (LoadInst *LI = dyn_cast<LoadInst>(I))
|
2004-07-21 13:18:04 +08:00
|
|
|
return add(LI);
|
2003-02-25 04:37:56 +08:00
|
|
|
else if (StoreInst *SI = dyn_cast<StoreInst>(I))
|
2004-07-21 13:18:04 +08:00
|
|
|
return add(SI);
|
2003-02-25 04:37:56 +08:00
|
|
|
else if (CallInst *CI = dyn_cast<CallInst>(I))
|
2004-07-21 13:18:04 +08:00
|
|
|
return add(CI);
|
2003-02-25 04:37:56 +08:00
|
|
|
else if (InvokeInst *II = dyn_cast<InvokeInst>(I))
|
2004-07-21 13:18:04 +08:00
|
|
|
return add(II);
|
2004-07-25 15:57:37 +08:00
|
|
|
else if (FreeInst *FI = dyn_cast<FreeInst>(I))
|
|
|
|
return add(FI);
|
2008-04-15 02:34:50 +08:00
|
|
|
else if (VAArgInst *VAAI = dyn_cast<VAArgInst>(I))
|
|
|
|
return add(VAAI);
|
2004-07-21 13:18:04 +08:00
|
|
|
return true;
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
2002-09-27 05:49:07 +08:00
|
|
|
|
2003-03-04 07:28:05 +08:00
|
|
|
void AliasSetTracker::add(BasicBlock &BB) {
|
|
|
|
for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)
|
|
|
|
add(I);
|
|
|
|
}
|
|
|
|
|
|
|
|
void AliasSetTracker::add(const AliasSetTracker &AST) {
|
|
|
|
assert(&AA == &AST.AA &&
|
|
|
|
"Merging AliasSetTracker objects with different Alias Analyses!");
|
|
|
|
|
|
|
|
// Loop over all of the alias sets in AST, adding the pointers contained
|
|
|
|
// therein into the current alias sets. This can cause alias sets to be
|
|
|
|
// merged together in the current AST.
|
|
|
|
for (const_iterator I = AST.begin(), E = AST.end(); I != E; ++I)
|
|
|
|
if (!I->Forward) { // Ignore forwarding alias sets
|
|
|
|
AliasSet &AS = const_cast<AliasSet&>(*I);
|
|
|
|
|
|
|
|
// If there are any call sites in the alias set, add them to this AST.
|
|
|
|
for (unsigned i = 0, e = AS.CallSites.size(); i != e; ++i)
|
|
|
|
add(AS.CallSites[i]);
|
|
|
|
|
|
|
|
// Loop over all of the pointers in this alias set...
|
|
|
|
AliasSet::iterator I = AS.begin(), E = AS.end();
|
2004-07-21 13:18:04 +08:00
|
|
|
bool X;
|
2007-05-23 14:36:35 +08:00
|
|
|
for (; I != E; ++I) {
|
|
|
|
AliasSet &NewAS = addPointer(I.getPointer(), I.getSize(),
|
|
|
|
(AliasSet::AccessType)AS.AccessTy, X);
|
|
|
|
if (AS.isVolatile()) NewAS.setVolatile();
|
|
|
|
}
|
2003-03-04 07:28:05 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-07-21 15:04:26 +08:00
|
|
|
/// remove - Remove the specified (potentially non-empty) alias set from the
|
|
|
|
/// tracker.
|
|
|
|
void AliasSetTracker::remove(AliasSet &AS) {
|
2006-06-28 07:48:59 +08:00
|
|
|
// Drop all call sites.
|
|
|
|
AS.CallSites.clear();
|
|
|
|
|
|
|
|
// Clear the alias set.
|
|
|
|
unsigned NumRefs = 0;
|
|
|
|
while (!AS.empty()) {
|
2009-03-09 13:11:09 +08:00
|
|
|
AliasSet::PointerRec *P = AS.PtrList;
|
|
|
|
|
|
|
|
Value *ValToRemove = P->getValue();
|
2006-06-28 07:48:59 +08:00
|
|
|
|
2009-03-09 13:11:09 +08:00
|
|
|
// Unlink and delete entry from the list of values.
|
|
|
|
P->eraseFromList();
|
2006-06-28 07:48:59 +08:00
|
|
|
|
|
|
|
// Remember how many references need to be dropped.
|
|
|
|
++NumRefs;
|
|
|
|
|
|
|
|
// Finally, remove the entry.
|
2009-03-09 13:11:09 +08:00
|
|
|
PointerMap.erase(ValToRemove);
|
2006-06-28 07:48:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Stop using the alias set, removing it.
|
2006-06-28 07:56:13 +08:00
|
|
|
AS.RefCount -= NumRefs;
|
|
|
|
if (AS.RefCount == 0)
|
|
|
|
AS.removeFromTracker(*this);
|
2004-07-21 15:04:26 +08:00
|
|
|
}
|
|
|
|
|
2004-07-26 13:50:23 +08:00
|
|
|
bool AliasSetTracker::remove(Value *Ptr, unsigned Size) {
|
|
|
|
AliasSet *AS = findAliasSetForPointer(Ptr, Size);
|
|
|
|
if (!AS) return false;
|
|
|
|
remove(*AS);
|
|
|
|
return true;
|
|
|
|
}
|
2004-07-21 15:04:26 +08:00
|
|
|
|
|
|
|
bool AliasSetTracker::remove(LoadInst *LI) {
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
unsigned Size = AA.getTargetData().getTypeStoreSize(LI->getType());
|
2004-07-21 15:04:26 +08:00
|
|
|
AliasSet *AS = findAliasSetForPointer(LI->getOperand(0), Size);
|
|
|
|
if (!AS) return false;
|
|
|
|
remove(*AS);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool AliasSetTracker::remove(StoreInst *SI) {
|
Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize.
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment. This gives a primitive type for
which getTypeSize differed from getABITypeSize. For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).
This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition). Instead there is:
(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type. For a primitive type, this is the minimum number
of bits. For an i36 this is 36 bits. For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.
(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it). For an
i36 this is 40 bits, for an x86 long double it is 80 bits. This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes). There doesn't seem to be anything
corresponding to this in gcc.
(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment. For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS. This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes). This is
TYPE_SIZE in gcc.
Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize. This means that the size of an array
is the length times the getABITypeSize. It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize. Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case. So alloca's and mallocs should use getABITypeSize. Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.
Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.
In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases). I will get around to auditing these too at some point,
but I could do with some help.
Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize. I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers. If someone wants to pack these types more
tightly they can always use a packed struct.
llvm-svn: 43620
2007-11-02 04:53:16 +08:00
|
|
|
unsigned Size =
|
|
|
|
AA.getTargetData().getTypeStoreSize(SI->getOperand(0)->getType());
|
2004-07-21 15:04:26 +08:00
|
|
|
AliasSet *AS = findAliasSetForPointer(SI->getOperand(1), Size);
|
|
|
|
if (!AS) return false;
|
|
|
|
remove(*AS);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2004-07-25 15:57:37 +08:00
|
|
|
bool AliasSetTracker::remove(FreeInst *FI) {
|
|
|
|
AliasSet *AS = findAliasSetForPointer(FI->getOperand(0), ~0);
|
|
|
|
if (!AS) return false;
|
|
|
|
remove(*AS);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-04-15 02:34:50 +08:00
|
|
|
bool AliasSetTracker::remove(VAArgInst *VAAI) {
|
|
|
|
AliasSet *AS = findAliasSetForPointer(VAAI->getOperand(0), ~0);
|
|
|
|
if (!AS) return false;
|
|
|
|
remove(*AS);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2004-07-21 15:04:26 +08:00
|
|
|
bool AliasSetTracker::remove(CallSite CS) {
|
2007-12-01 15:51:45 +08:00
|
|
|
if (AA.doesNotAccessMemory(CS))
|
|
|
|
return false; // doesn't alias anything
|
2004-07-21 15:04:26 +08:00
|
|
|
|
|
|
|
AliasSet *AS = findAliasSetForCallSite(CS);
|
|
|
|
if (!AS) return false;
|
|
|
|
remove(*AS);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool AliasSetTracker::remove(Instruction *I) {
|
|
|
|
// Dispatch to one of the other remove methods...
|
|
|
|
if (LoadInst *LI = dyn_cast<LoadInst>(I))
|
|
|
|
return remove(LI);
|
|
|
|
else if (StoreInst *SI = dyn_cast<StoreInst>(I))
|
|
|
|
return remove(SI);
|
|
|
|
else if (CallInst *CI = dyn_cast<CallInst>(I))
|
|
|
|
return remove(CI);
|
2004-07-25 15:57:37 +08:00
|
|
|
else if (FreeInst *FI = dyn_cast<FreeInst>(I))
|
|
|
|
return remove(FI);
|
2008-04-15 02:34:50 +08:00
|
|
|
else if (VAArgInst *VAAI = dyn_cast<VAArgInst>(I))
|
|
|
|
return remove(VAAI);
|
2004-07-21 15:04:26 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2003-12-18 16:11:56 +08:00
|
|
|
|
2004-05-24 05:10:58 +08:00
|
|
|
// deleteValue method - This method is used to remove a pointer value from the
|
2003-12-18 16:11:56 +08:00
|
|
|
// AliasSetTracker entirely. It should be used when an instruction is deleted
|
|
|
|
// from the program to update the AST. If you don't use this, you would have
|
|
|
|
// dangling pointers to deleted instructions.
|
|
|
|
//
|
2004-05-24 05:10:58 +08:00
|
|
|
void AliasSetTracker::deleteValue(Value *PtrVal) {
|
2004-09-15 03:15:32 +08:00
|
|
|
// Notify the alias analysis implementation that this value is gone.
|
|
|
|
AA.deleteValue(PtrVal);
|
|
|
|
|
2006-06-27 03:20:48 +08:00
|
|
|
// If this is a call instruction, remove the callsite from the appropriate
|
|
|
|
// AliasSet.
|
|
|
|
CallSite CS = CallSite::get(PtrVal);
|
2007-12-01 15:51:45 +08:00
|
|
|
if (CS.getInstruction())
|
|
|
|
if (!AA.doesNotAccessMemory(CS))
|
2006-06-27 03:20:48 +08:00
|
|
|
if (AliasSet *AS = findAliasSetForCallSite(CS))
|
|
|
|
AS->removeCallSite(CS);
|
|
|
|
|
2004-09-15 03:15:32 +08:00
|
|
|
// First, look up the PointerRec for this pointer.
|
2009-03-09 13:11:09 +08:00
|
|
|
DenseMap<Value*, AliasSet::PointerRec*>::iterator I = PointerMap.find(PtrVal);
|
2003-12-18 16:11:56 +08:00
|
|
|
if (I == PointerMap.end()) return; // Noop
|
|
|
|
|
|
|
|
// If we found one, remove the pointer from the alias set it is in.
|
2009-03-09 13:11:09 +08:00
|
|
|
AliasSet::PointerRec *PtrValEnt = I->second;
|
|
|
|
AliasSet *AS = PtrValEnt->getAliasSet(*this);
|
2003-12-18 16:11:56 +08:00
|
|
|
|
2009-03-09 13:11:09 +08:00
|
|
|
// Unlink and delete from the list of values.
|
|
|
|
PtrValEnt->eraseFromList();
|
|
|
|
|
|
|
|
// Stop using the alias set.
|
2004-07-22 15:58:18 +08:00
|
|
|
AS->dropRef(*this);
|
2009-03-09 13:11:09 +08:00
|
|
|
|
2003-12-18 16:11:56 +08:00
|
|
|
PointerMap.erase(I);
|
|
|
|
}
|
|
|
|
|
2004-09-15 03:15:32 +08:00
|
|
|
// copyValue - This method should be used whenever a preexisting value in the
|
|
|
|
// program is copied or cloned, introducing a new value. Note that it is ok for
|
|
|
|
// clients that use this method to introduce the same value multiple times: if
|
|
|
|
// the tracker already knows about a value, it will ignore the request.
|
|
|
|
//
|
|
|
|
void AliasSetTracker::copyValue(Value *From, Value *To) {
|
|
|
|
// Notify the alias analysis implementation that this value is copied.
|
|
|
|
AA.copyValue(From, To);
|
|
|
|
|
|
|
|
// First, look up the PointerRec for this pointer.
|
2009-03-09 13:11:09 +08:00
|
|
|
DenseMap<Value*, AliasSet::PointerRec*>::iterator I = PointerMap.find(From);
|
|
|
|
if (I == PointerMap.end())
|
2004-09-15 03:15:32 +08:00
|
|
|
return; // Noop
|
2009-03-09 13:11:09 +08:00
|
|
|
assert(I->second->hasAliasSet() && "Dead entry?");
|
2004-09-15 03:15:32 +08:00
|
|
|
|
2009-03-09 13:11:09 +08:00
|
|
|
AliasSet::PointerRec &Entry = getEntryFor(To);
|
|
|
|
if (Entry.hasAliasSet()) return; // Already in the tracker!
|
2004-09-15 03:15:32 +08:00
|
|
|
|
|
|
|
// Add it to the alias set it aliases...
|
2009-03-31 02:34:47 +08:00
|
|
|
I = PointerMap.find(From);
|
2009-03-09 13:11:09 +08:00
|
|
|
AliasSet *AS = I->second->getAliasSet(*this);
|
|
|
|
AS->addPointer(*this, Entry, I->second->getSize(), true);
|
2004-09-15 03:15:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-12-18 16:11:56 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AliasSet/AliasSetTracker Printing Support
|
|
|
|
//===----------------------------------------------------------------------===//
|
2002-09-27 05:49:07 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
void AliasSet::print(std::ostream &OS) const {
|
|
|
|
OS << " AliasSet[" << (void*)this << "," << RefCount << "] ";
|
2008-04-22 03:48:48 +08:00
|
|
|
OS << (AliasTy == MustAlias ? "must" : "may") << " alias, ";
|
2003-02-25 04:37:56 +08:00
|
|
|
switch (AccessTy) {
|
|
|
|
case NoModRef: OS << "No access "; break;
|
|
|
|
case Refs : OS << "Ref "; break;
|
|
|
|
case Mods : OS << "Mod "; break;
|
|
|
|
case ModRef : OS << "Mod/Ref "; break;
|
|
|
|
default: assert(0 && "Bad value for AccessTy!");
|
|
|
|
}
|
2003-12-14 12:52:11 +08:00
|
|
|
if (isVolatile()) OS << "[volatile] ";
|
2003-02-25 04:37:56 +08:00
|
|
|
if (Forward)
|
|
|
|
OS << " forwarding to " << (void*)Forward;
|
2002-09-27 05:49:07 +08:00
|
|
|
|
|
|
|
|
2007-10-04 03:26:29 +08:00
|
|
|
if (!empty()) {
|
2003-02-25 04:37:56 +08:00
|
|
|
OS << "Pointers: ";
|
|
|
|
for (iterator I = begin(), E = end(); I != E; ++I) {
|
|
|
|
if (I != begin()) OS << ", ";
|
2004-07-22 15:58:18 +08:00
|
|
|
WriteAsOperand(OS << "(", I.getPointer());
|
|
|
|
OS << ", " << I.getSize() << ")";
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
2003-02-25 04:37:56 +08:00
|
|
|
if (!CallSites.empty()) {
|
|
|
|
OS << "\n " << CallSites.size() << " Call Sites: ";
|
|
|
|
for (unsigned i = 0, e = CallSites.size(); i != e; ++i) {
|
|
|
|
if (i) OS << ", ";
|
|
|
|
WriteAsOperand(OS, CallSites[i].getCalledValue());
|
2005-04-22 05:13:18 +08:00
|
|
|
}
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
|
|
|
OS << "\n";
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
void AliasSetTracker::print(std::ostream &OS) const {
|
|
|
|
OS << "Alias Set Tracker: " << AliasSets.size() << " alias sets for "
|
|
|
|
<< PointerMap.size() << " pointer values.\n";
|
|
|
|
for (const_iterator I = begin(), E = end(); I != E; ++I)
|
|
|
|
I->print(OS);
|
|
|
|
OS << "\n";
|
|
|
|
}
|
|
|
|
|
2006-12-07 09:30:32 +08:00
|
|
|
void AliasSet::dump() const { print (cerr); }
|
|
|
|
void AliasSetTracker::dump() const { print(cerr); }
|
2003-02-25 04:37:56 +08:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AliasSetPrinter Pass
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
namespace {
|
2007-02-06 07:42:17 +08:00
|
|
|
class VISIBILITY_HIDDEN AliasSetPrinter : public FunctionPass {
|
2003-02-25 04:37:56 +08:00
|
|
|
AliasSetTracker *Tracker;
|
|
|
|
public:
|
2007-05-06 21:37:16 +08:00
|
|
|
static char ID; // Pass identification, replacement for typeid
|
2008-09-05 01:05:41 +08:00
|
|
|
AliasSetPrinter() : FunctionPass(&ID) {}
|
2007-05-02 05:15:47 +08:00
|
|
|
|
2003-02-25 04:37:56 +08:00
|
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.setPreservesAll();
|
|
|
|
AU.addRequired<AliasAnalysis>();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual bool runOnFunction(Function &F) {
|
|
|
|
Tracker = new AliasSetTracker(getAnalysis<AliasAnalysis>());
|
|
|
|
|
|
|
|
for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
|
2004-04-27 23:13:33 +08:00
|
|
|
Tracker->add(&*I);
|
2006-12-07 09:30:32 +08:00
|
|
|
Tracker->print(cerr);
|
2003-02-25 04:37:56 +08:00
|
|
|
delete Tracker;
|
2006-01-03 14:05:22 +08:00
|
|
|
return false;
|
2003-02-25 04:37:56 +08:00
|
|
|
}
|
|
|
|
};
|
2002-09-27 05:49:07 +08:00
|
|
|
}
|
2008-05-13 08:00:25 +08:00
|
|
|
|
|
|
|
char AliasSetPrinter::ID = 0;
|
|
|
|
static RegisterPass<AliasSetPrinter>
|
|
|
|
X("print-alias-sets", "Alias Set Printer", false, true);
|