1 //===- AliasSetTracker.cpp - Alias Sets Tracker implementation-------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the AliasSetTracker and AliasSet classes.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Analysis/AliasSetTracker.h"
15 #include "llvm/Analysis/AliasAnalysis.h"
16 #include "llvm/Instructions.h"
17 #include "llvm/Pass.h"
18 #include "llvm/Type.h"
19 #include "llvm/Target/TargetData.h"
20 #include "llvm/Assembly/Writer.h"
21 #include "llvm/Support/Compiler.h"
22 #include "llvm/Support/InstIterator.h"
23 #include "llvm/Support/Streams.h"
26 /// mergeSetIn - Merge the specified alias set into this alias set.
28 void AliasSet::mergeSetIn(AliasSet &AS, AliasSetTracker &AST) {
29 assert(!AS.Forward && "Alias set is already forwarding!");
30 assert(!Forward && "This set is a forwarding set!!");
32 // Update the alias and access types of this set...
33 AccessTy |= AS.AccessTy;
34 AliasTy |= AS.AliasTy;
36 if (AliasTy == MustAlias) {
37 // Check that these two merged sets really are must aliases. Since both
38 // used to be must-alias sets, we can just check any pointer from each set
40 AliasAnalysis &AA = AST.getAliasAnalysis();
41 HashNodePair *L = getSomePointer();
42 HashNodePair *R = AS.getSomePointer();
44 // If the pointers are not a must-alias pair, this set becomes a may alias.
45 if (AA.alias(L->first, L->second.getSize(), R->first, R->second.getSize())
46 != AliasAnalysis::MustAlias)
50 if (CallSites.empty()) { // Merge call sites...
51 if (!AS.CallSites.empty())
52 std::swap(CallSites, AS.CallSites);
53 } else if (!AS.CallSites.empty()) {
54 CallSites.insert(CallSites.end(), AS.CallSites.begin(), AS.CallSites.end());
58 AS.Forward = this; // Forward across AS now...
59 addRef(); // AS is now pointing to us...
61 // Merge the list of constituent pointers...
63 *PtrListEnd = AS.PtrList;
64 AS.PtrList->second.setPrevInList(PtrListEnd);
65 PtrListEnd = AS.PtrListEnd;
68 AS.PtrListEnd = &AS.PtrList;
69 assert(*AS.PtrListEnd == 0 && "End of list is not null?");
73 void AliasSetTracker::removeAliasSet(AliasSet *AS) {
74 if (AliasSet *Fwd = AS->Forward) {
81 void AliasSet::removeFromTracker(AliasSetTracker &AST) {
82 assert(RefCount == 0 && "Cannot remove non-dead alias set from tracker!");
83 AST.removeAliasSet(this);
86 void AliasSet::addPointer(AliasSetTracker &AST, HashNodePair &Entry,
87 unsigned Size, bool KnownMustAlias) {
88 assert(!Entry.second.hasAliasSet() && "Entry already in set!");
90 // Check to see if we have to downgrade to _may_ alias.
91 if (isMustAlias() && !KnownMustAlias)
92 if (HashNodePair *P = getSomePointer()) {
93 AliasAnalysis &AA = AST.getAliasAnalysis();
94 AliasAnalysis::AliasResult Result =
95 AA.alias(P->first, P->second.getSize(), Entry.first, Size);
96 if (Result == AliasAnalysis::MayAlias)
98 else // First entry of must alias must have maximum size!
99 P->second.updateSize(Size);
100 assert(Result != AliasAnalysis::NoAlias && "Cannot be part of must set!");
103 Entry.second.setAliasSet(this);
104 Entry.second.updateSize(Size);
106 // Add it to the end of the list...
107 assert(*PtrListEnd == 0 && "End of list is not null?");
108 *PtrListEnd = &Entry;
109 PtrListEnd = Entry.second.setPrevInList(PtrListEnd);
110 assert(*PtrListEnd == 0 && "End of list is not null?");
111 addRef(); // Entry points to alias set...
114 void AliasSet::addCallSite(CallSite CS, AliasAnalysis &AA) {
115 CallSites.push_back(CS);
117 AliasAnalysis::ModRefBehavior Behavior = AA.getModRefBehavior(CS);
118 if (Behavior == AliasAnalysis::DoesNotAccessMemory)
120 else if (Behavior == AliasAnalysis::OnlyReadsMemory) {
126 // FIXME: This should use mod/ref information to make this not suck so bad
131 /// aliasesPointer - Return true if the specified pointer "may" (or must)
132 /// alias one of the members in the set.
134 bool AliasSet::aliasesPointer(const Value *Ptr, unsigned Size,
135 AliasAnalysis &AA) const {
136 if (AliasTy == MustAlias) {
137 assert(CallSites.empty() && "Illegal must alias set!");
139 // If this is a set of MustAliases, only check to see if the pointer aliases
140 // SOME value in the set...
141 HashNodePair *SomePtr = getSomePointer();
142 assert(SomePtr && "Empty must-alias set??");
143 return AA.alias(SomePtr->first, SomePtr->second.getSize(), Ptr, Size);
146 // If this is a may-alias set, we have to check all of the pointers in the set
147 // to be sure it doesn't alias the set...
148 for (iterator I = begin(), E = end(); I != E; ++I)
149 if (AA.alias(Ptr, Size, I.getPointer(), I.getSize()))
152 // Check the call sites list and invoke list...
153 if (!CallSites.empty()) {
154 if (AA.hasNoModRefInfoForCalls())
157 for (unsigned i = 0, e = CallSites.size(); i != e; ++i)
158 if (AA.getModRefInfo(CallSites[i], const_cast<Value*>(Ptr), Size)
159 != AliasAnalysis::NoModRef)
166 bool AliasSet::aliasesCallSite(CallSite CS, AliasAnalysis &AA) const {
167 if (AA.doesNotAccessMemory(CS))
170 if (AA.hasNoModRefInfoForCalls())
173 for (unsigned i = 0, e = CallSites.size(); i != e; ++i)
174 if (AA.getModRefInfo(CallSites[i], CS) != AliasAnalysis::NoModRef ||
175 AA.getModRefInfo(CS, CallSites[i]) != AliasAnalysis::NoModRef)
178 for (iterator I = begin(), E = end(); I != E; ++I)
179 if (AA.getModRefInfo(CS, I.getPointer(), I.getSize()) !=
180 AliasAnalysis::NoModRef)
187 /// findAliasSetForPointer - Given a pointer, find the one alias set to put the
188 /// instruction referring to the pointer into. If there are multiple alias sets
189 /// that may alias the pointer, merge them together and return the unified set.
191 AliasSet *AliasSetTracker::findAliasSetForPointer(const Value *Ptr,
193 AliasSet *FoundSet = 0;
194 for (iterator I = begin(), E = end(); I != E; ++I)
195 if (!I->Forward && I->aliasesPointer(Ptr, Size, AA)) {
196 if (FoundSet == 0) { // If this is the first alias set ptr can go into.
197 FoundSet = I; // Remember it.
198 } else { // Otherwise, we must merge the sets.
199 FoundSet->mergeSetIn(*I, *this); // Merge in contents.
206 /// containsPointer - Return true if the specified location is represented by
207 /// this alias set, false otherwise. This does not modify the AST object or
209 bool AliasSetTracker::containsPointer(Value *Ptr, unsigned Size) const {
210 for (const_iterator I = begin(), E = end(); I != E; ++I)
211 if (!I->Forward && I->aliasesPointer(Ptr, Size, AA))
218 AliasSet *AliasSetTracker::findAliasSetForCallSite(CallSite CS) {
219 AliasSet *FoundSet = 0;
220 for (iterator I = begin(), E = end(); I != E; ++I)
221 if (!I->Forward && I->aliasesCallSite(CS, AA)) {
222 if (FoundSet == 0) { // If this is the first alias set ptr can go into.
223 FoundSet = I; // Remember it.
224 } else if (!I->Forward) { // Otherwise, we must merge the sets.
225 FoundSet->mergeSetIn(*I, *this); // Merge in contents.
235 /// getAliasSetForPointer - Return the alias set that the specified pointer
237 AliasSet &AliasSetTracker::getAliasSetForPointer(Value *Pointer, unsigned Size,
239 AliasSet::HashNodePair &Entry = getEntryFor(Pointer);
241 // Check to see if the pointer is already known...
242 if (Entry.second.hasAliasSet()) {
243 Entry.second.updateSize(Size);
245 return *Entry.second.getAliasSet(*this)->getForwardedTarget(*this);
246 } else if (AliasSet *AS = findAliasSetForPointer(Pointer, Size)) {
247 // Add it to the alias set it aliases...
248 AS->addPointer(*this, Entry, Size);
251 if (New) *New = true;
252 // Otherwise create a new alias set to hold the loaded pointer...
253 AliasSets.push_back(new AliasSet());
254 AliasSets.back().addPointer(*this, Entry, Size);
255 return AliasSets.back();
259 bool AliasSetTracker::add(Value *Ptr, unsigned Size) {
261 addPointer(Ptr, Size, AliasSet::NoModRef, NewPtr);
266 bool AliasSetTracker::add(LoadInst *LI) {
268 AliasSet &AS = addPointer(LI->getOperand(0),
269 AA.getTargetData().getTypeStoreSize(LI->getType()),
270 AliasSet::Refs, NewPtr);
271 if (LI->isVolatile()) AS.setVolatile();
275 bool AliasSetTracker::add(StoreInst *SI) {
277 Value *Val = SI->getOperand(0);
278 AliasSet &AS = addPointer(SI->getOperand(1),
279 AA.getTargetData().getTypeStoreSize(Val->getType()),
280 AliasSet::Mods, NewPtr);
281 if (SI->isVolatile()) AS.setVolatile();
285 bool AliasSetTracker::add(FreeInst *FI) {
287 AliasSet &AS = addPointer(FI->getOperand(0), ~0,
288 AliasSet::Mods, NewPtr);
290 // Free operations are volatile ops (cannot be moved).
295 bool AliasSetTracker::add(VAArgInst *VAAI) {
297 addPointer(VAAI->getOperand(0), ~0, AliasSet::ModRef, NewPtr);
302 bool AliasSetTracker::add(CallSite CS) {
303 if (AA.doesNotAccessMemory(CS))
304 return true; // doesn't alias anything
306 AliasSet *AS = findAliasSetForCallSite(CS);
308 AliasSets.push_back(new AliasSet());
309 AS = &AliasSets.back();
310 AS->addCallSite(CS, AA);
313 AS->addCallSite(CS, AA);
318 bool AliasSetTracker::add(Instruction *I) {
319 // Dispatch to one of the other add methods...
320 if (LoadInst *LI = dyn_cast<LoadInst>(I))
322 else if (StoreInst *SI = dyn_cast<StoreInst>(I))
324 else if (CallInst *CI = dyn_cast<CallInst>(I))
326 else if (InvokeInst *II = dyn_cast<InvokeInst>(I))
328 else if (FreeInst *FI = dyn_cast<FreeInst>(I))
330 else if (VAArgInst *VAAI = dyn_cast<VAArgInst>(I))
335 void AliasSetTracker::add(BasicBlock &BB) {
336 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I)
340 void AliasSetTracker::add(const AliasSetTracker &AST) {
341 assert(&AA == &AST.AA &&
342 "Merging AliasSetTracker objects with different Alias Analyses!");
344 // Loop over all of the alias sets in AST, adding the pointers contained
345 // therein into the current alias sets. This can cause alias sets to be
346 // merged together in the current AST.
347 for (const_iterator I = AST.begin(), E = AST.end(); I != E; ++I)
348 if (!I->Forward) { // Ignore forwarding alias sets
349 AliasSet &AS = const_cast<AliasSet&>(*I);
351 // If there are any call sites in the alias set, add them to this AST.
352 for (unsigned i = 0, e = AS.CallSites.size(); i != e; ++i)
353 add(AS.CallSites[i]);
355 // Loop over all of the pointers in this alias set...
356 AliasSet::iterator I = AS.begin(), E = AS.end();
358 for (; I != E; ++I) {
359 AliasSet &NewAS = addPointer(I.getPointer(), I.getSize(),
360 (AliasSet::AccessType)AS.AccessTy, X);
361 if (AS.isVolatile()) NewAS.setVolatile();
366 /// remove - Remove the specified (potentially non-empty) alias set from the
368 void AliasSetTracker::remove(AliasSet &AS) {
369 // Drop all call sites.
370 AS.CallSites.clear();
372 // Clear the alias set.
373 unsigned NumRefs = 0;
374 while (!AS.empty()) {
375 AliasSet::HashNodePair *P = AS.PtrList;
377 // Unlink from the list of values.
378 P->second.removeFromList();
380 // Remember how many references need to be dropped.
383 // Finally, remove the entry.
384 Value *Remove = P->first; // Take a copy because it is invalid to pass
385 PointerMap.erase(Remove); // a reference to the data being erased.
388 // Stop using the alias set, removing it.
389 AS.RefCount -= NumRefs;
390 if (AS.RefCount == 0)
391 AS.removeFromTracker(*this);
394 bool AliasSetTracker::remove(Value *Ptr, unsigned Size) {
395 AliasSet *AS = findAliasSetForPointer(Ptr, Size);
396 if (!AS) return false;
401 bool AliasSetTracker::remove(LoadInst *LI) {
402 unsigned Size = AA.getTargetData().getTypeStoreSize(LI->getType());
403 AliasSet *AS = findAliasSetForPointer(LI->getOperand(0), Size);
404 if (!AS) return false;
409 bool AliasSetTracker::remove(StoreInst *SI) {
411 AA.getTargetData().getTypeStoreSize(SI->getOperand(0)->getType());
412 AliasSet *AS = findAliasSetForPointer(SI->getOperand(1), Size);
413 if (!AS) return false;
418 bool AliasSetTracker::remove(FreeInst *FI) {
419 AliasSet *AS = findAliasSetForPointer(FI->getOperand(0), ~0);
420 if (!AS) return false;
425 bool AliasSetTracker::remove(VAArgInst *VAAI) {
426 AliasSet *AS = findAliasSetForPointer(VAAI->getOperand(0), ~0);
427 if (!AS) return false;
432 bool AliasSetTracker::remove(CallSite CS) {
433 if (AA.doesNotAccessMemory(CS))
434 return false; // doesn't alias anything
436 AliasSet *AS = findAliasSetForCallSite(CS);
437 if (!AS) return false;
442 bool AliasSetTracker::remove(Instruction *I) {
443 // Dispatch to one of the other remove methods...
444 if (LoadInst *LI = dyn_cast<LoadInst>(I))
446 else if (StoreInst *SI = dyn_cast<StoreInst>(I))
448 else if (CallInst *CI = dyn_cast<CallInst>(I))
450 else if (FreeInst *FI = dyn_cast<FreeInst>(I))
452 else if (VAArgInst *VAAI = dyn_cast<VAArgInst>(I))
458 // deleteValue method - This method is used to remove a pointer value from the
459 // AliasSetTracker entirely. It should be used when an instruction is deleted
460 // from the program to update the AST. If you don't use this, you would have
461 // dangling pointers to deleted instructions.
463 void AliasSetTracker::deleteValue(Value *PtrVal) {
464 // Notify the alias analysis implementation that this value is gone.
465 AA.deleteValue(PtrVal);
467 // If this is a call instruction, remove the callsite from the appropriate
469 CallSite CS = CallSite::get(PtrVal);
470 if (CS.getInstruction())
471 if (!AA.doesNotAccessMemory(CS))
472 if (AliasSet *AS = findAliasSetForCallSite(CS))
473 AS->removeCallSite(CS);
475 // First, look up the PointerRec for this pointer.
476 hash_map<Value*, AliasSet::PointerRec>::iterator I = PointerMap.find(PtrVal);
477 if (I == PointerMap.end()) return; // Noop
479 // If we found one, remove the pointer from the alias set it is in.
480 AliasSet::HashNodePair &PtrValEnt = *I;
481 AliasSet *AS = PtrValEnt.second.getAliasSet(*this);
483 // Unlink from the list of values...
484 PtrValEnt.second.removeFromList();
485 // Stop using the alias set
490 // copyValue - This method should be used whenever a preexisting value in the
491 // program is copied or cloned, introducing a new value. Note that it is ok for
492 // clients that use this method to introduce the same value multiple times: if
493 // the tracker already knows about a value, it will ignore the request.
495 void AliasSetTracker::copyValue(Value *From, Value *To) {
496 // Notify the alias analysis implementation that this value is copied.
497 AA.copyValue(From, To);
499 // First, look up the PointerRec for this pointer.
500 hash_map<Value*, AliasSet::PointerRec>::iterator I = PointerMap.find(From);
501 if (I == PointerMap.end() || !I->second.hasAliasSet())
504 AliasSet::HashNodePair &Entry = getEntryFor(To);
505 if (Entry.second.hasAliasSet()) return; // Already in the tracker!
507 // Add it to the alias set it aliases...
508 AliasSet *AS = I->second.getAliasSet(*this);
509 AS->addPointer(*this, Entry, I->second.getSize(), true);
514 //===----------------------------------------------------------------------===//
515 // AliasSet/AliasSetTracker Printing Support
516 //===----------------------------------------------------------------------===//
518 void AliasSet::print(std::ostream &OS) const {
519 OS << " AliasSet[" << (void*)this << "," << RefCount << "] ";
520 OS << (AliasTy == MustAlias ? "must" : "may") << " alias, ";
522 case NoModRef: OS << "No access "; break;
523 case Refs : OS << "Ref "; break;
524 case Mods : OS << "Mod "; break;
525 case ModRef : OS << "Mod/Ref "; break;
526 default: assert(0 && "Bad value for AccessTy!");
528 if (isVolatile()) OS << "[volatile] ";
530 OS << " forwarding to " << (void*)Forward;
535 for (iterator I = begin(), E = end(); I != E; ++I) {
536 if (I != begin()) OS << ", ";
537 WriteAsOperand(OS << "(", I.getPointer());
538 OS << ", " << I.getSize() << ")";
541 if (!CallSites.empty()) {
542 OS << "\n " << CallSites.size() << " Call Sites: ";
543 for (unsigned i = 0, e = CallSites.size(); i != e; ++i) {
545 WriteAsOperand(OS, CallSites[i].getCalledValue());
551 void AliasSetTracker::print(std::ostream &OS) const {
552 OS << "Alias Set Tracker: " << AliasSets.size() << " alias sets for "
553 << PointerMap.size() << " pointer values.\n";
554 for (const_iterator I = begin(), E = end(); I != E; ++I)
559 void AliasSet::dump() const { print (cerr); }
560 void AliasSetTracker::dump() const { print(cerr); }
562 //===----------------------------------------------------------------------===//
563 // AliasSetPrinter Pass
564 //===----------------------------------------------------------------------===//
567 class VISIBILITY_HIDDEN AliasSetPrinter : public FunctionPass {
568 AliasSetTracker *Tracker;
570 static char ID; // Pass identification, replacement for typeid
571 AliasSetPrinter() : FunctionPass((intptr_t)&ID) {}
573 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
574 AU.setPreservesAll();
575 AU.addRequired<AliasAnalysis>();
578 virtual bool runOnFunction(Function &F) {
579 Tracker = new AliasSetTracker(getAnalysis<AliasAnalysis>());
581 for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
583 Tracker->print(cerr);
588 char AliasSetPrinter::ID = 0;
589 RegisterPass<AliasSetPrinter> X("print-alias-sets", "Alias Set Printer", false, true);