#include "llvm/Analysis/AliasSetTracker.h"
#include "llvm/Analysis/AliasAnalysis.h"
-#include "llvm/iMemory.h"
-#include "llvm/iOther.h"
-#include "llvm/iTerminators.h"
+#include "llvm/Instructions.h"
#include "llvm/Pass.h"
#include "llvm/Target/TargetData.h"
#include "llvm/Assembly/Writer.h"
#include <iostream>
using namespace llvm;
-/// mergeSetIn - Merge the specified alias set into this alias set...
+/// mergeSetIn - Merge the specified alias set into this alias set.
///
-void AliasSet::mergeSetIn(AliasSet &AS) {
+void AliasSet::mergeSetIn(AliasSet &AS, AliasSetTracker &AST) {
assert(!AS.Forward && "Alias set is already forwarding!");
assert(!Forward && "This set is a forwarding set!!");
AccessTy |= AS.AccessTy;
AliasTy |= AS.AliasTy;
+ 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();
+ HashNodePair *L = getSomePointer();
+ HashNodePair *R = AS.getSomePointer();
+
+ // If the pointers are not a must-alias pair, this set becomes a may alias.
+ if (AA.alias(L->first, L->second.getSize(), R->first, R->second.getSize())
+ != AliasAnalysis::MustAlias)
+ AliasTy = MayAlias;
+ }
+
if (CallSites.empty()) { // Merge call sites...
if (!AS.CallSites.empty())
std::swap(CallSites, AS.CallSites);
AS.CallSites.clear();
}
- // FIXME: If AS's refcount is zero, nuke it now...
- assert(RefCount != 0);
-
AS.Forward = this; // Forward across AS now...
addRef(); // AS is now pointing to us...
AS.PtrList = 0;
AS.PtrListEnd = &AS.PtrList;
+ assert(*AS.PtrListEnd == 0 && "End of list is not null?");
}
}
}
void AliasSet::addPointer(AliasSetTracker &AST, HashNodePair &Entry,
- unsigned Size) {
+ unsigned Size, bool KnownMustAlias) {
assert(!Entry.second.hasAliasSet() && "Entry already in set!");
- AliasAnalysis &AA = AST.getAliasAnalysis();
-
- if (isMustAlias()) // Check to see if we have to downgrade to _may_ alias
+ // Check to see if we have to downgrade to _may_ alias.
+ if (isMustAlias() && !KnownMustAlias)
if (HashNodePair *P = getSomePointer()) {
+ AliasAnalysis &AA = AST.getAliasAnalysis();
AliasAnalysis::AliasResult Result =
AA.alias(P->first, P->second.getSize(), Entry.first, Size);
if (Result == AliasAnalysis::MayAlias)
assert(*PtrListEnd == 0 && "End of list is not null?");
*PtrListEnd = &Entry;
PtrListEnd = Entry.second.setPrevInList(PtrListEnd);
+ assert(*PtrListEnd == 0 && "End of list is not null?");
addRef(); // Entry points to alias set...
}
AliasSet *FoundSet = 0;
for (iterator I = begin(), E = end(); I != E; ++I)
if (!I->Forward && I->aliasesPointer(Ptr, Size, AA)) {
- if (FoundSet == 0) { // If this is the first alias set ptr can go into...
+ if (FoundSet == 0) { // If this is the first alias set ptr can go into.
FoundSet = I; // Remember it.
- } else { // Otherwise, we must merge the sets...
- FoundSet->mergeSetIn(*I); // Merge in contents...
+ } else { // Otherwise, we must merge the sets.
+ FoundSet->mergeSetIn(*I, *this); // Merge in contents.
}
}
return FoundSet;
}
+/// 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;
+}
+
+
+
AliasSet *AliasSetTracker::findAliasSetForCallSite(CallSite CS) {
AliasSet *FoundSet = 0;
for (iterator I = begin(), E = end(); I != E; ++I)
if (!I->Forward && I->aliasesCallSite(CS, AA)) {
- if (FoundSet == 0) { // If this is the first alias set ptr can go into...
+ if (FoundSet == 0) { // If this is the first alias set ptr can go into.
FoundSet = I; // Remember it.
- } else if (!I->Forward) { // Otherwise, we must merge the sets...
- FoundSet->mergeSetIn(*I); // Merge in contents...
+ } else if (!I->Forward) { // Otherwise, we must merge the sets.
+ FoundSet->mergeSetIn(*I, *this); // Merge in contents.
}
}
bool AliasSetTracker::add(CallSite CS) {
- bool NewPtr;
if (Function *F = CS.getCalledFunction())
if (AA.doesNotAccessMemory(F))
return true; // doesn't alias anything
// dangling pointers to deleted instructions.
//
void AliasSetTracker::deleteValue(Value *PtrVal) {
- // First, look up the PointerRec for this pointer...
+ // Notify the alias analysis implementation that this value is gone.
+ AA.deleteValue(PtrVal);
+
+ // First, look up the PointerRec for this pointer.
hash_map<Value*, AliasSet::PointerRec>::iterator I = PointerMap.find(PtrVal);
if (I == PointerMap.end()) return; // Noop
PointerMap.erase(I);
}
+// 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.
+ hash_map<Value*, AliasSet::PointerRec>::iterator I = PointerMap.find(From);
+ if (I == PointerMap.end() || !I->second.hasAliasSet())
+ return; // Noop
+
+ AliasSet::HashNodePair &Entry = getEntryFor(To);
+ if (Entry.second.hasAliasSet()) return; // Already in the tracker!
+
+ // Add it to the alias set it aliases...
+ AliasSet *AS = I->second.getAliasSet(*this);
+ AS->addPointer(*this, Entry, I->second.getSize(), true);
+}
+
+
//===----------------------------------------------------------------------===//
// AliasSet/AliasSetTracker Printing Support
}
/// print - Convert to human readable form
- virtual void print(std::ostream &OS) const {
+ virtual void print(std::ostream &OS, const Module* = 0) const {
Tracker->print(OS);
}