Lines Matching full:ma
105 if (MemoryAccess *MA = MSSA->getMemoryAccess(BB)) in emitBasicBlockStartAnnot() local
106 OS << "; " << *MA << "\n"; in emitBasicBlockStartAnnot()
111 if (MemoryAccess *MA = MSSA->getMemoryAccess(I)) in emitInstructionAnnot() local
112 OS << "; " << *MA << "\n"; in emitInstructionAnnot()
129 if (MemoryAccess *MA = MSSA->getMemoryAccess(BB)) in emitBasicBlockStartAnnot() local
130 OS << "; " << *MA << "\n"; in emitBasicBlockStartAnnot()
135 if (MemoryAccess *MA = MSSA->getMemoryAccess(I)) { in emitInstructionAnnot() local
136 MemoryAccess *Clobber = Walker->getClobberingMemoryAccess(MA, BAA); in emitInstructionAnnot()
137 OS << "; " << *MA; in emitInstructionAnnot()
422 for (const auto *MA : def_chain(MAP.first)) { in checkClobberSanity() local
423 if (MA == ClobberAt) { in checkClobberSanity()
424 if (const auto *MD = dyn_cast<MemoryDef>(MA)) { in checkClobberSanity()
440 assert(!MSSA.isLiveOnEntryDef(MA) && "Hit liveOnEntry before clobber?"); in checkClobberSanity()
442 if (const auto *MD = dyn_cast<MemoryDef>(MA)) { in checkClobberSanity()
452 if (const auto *MU = dyn_cast<MemoryUse>(MA)) { in checkClobberSanity()
459 assert(isa<MemoryPhi>(MA)); in checkClobberSanity()
463 {const_cast<MemoryAccess *>(MA), MAP.second}, in checkClobberSanity()
874 for (auto *MA : def_chain(const_cast<MemoryAccess *>(Target))) in tryOptimizePhi() local
875 DefChainEnd = MA; in tryOptimizePhi()
1022 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, BatchAAResults &BAA, in getClobberingMemoryAccess() argument
1024 return Walker->getClobberingMemoryAccessBase(MA, BAA, UWL, false); in getClobberingMemoryAccess()
1026 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, in getClobberingMemoryAccess() argument
1029 return Walker->getClobberingMemoryAccessBase(MA, Loc, BAA, UWL); in getClobberingMemoryAccess()
1033 MemoryAccess *MA, BatchAAResults &BAA, unsigned &UWL) { in getClobberingMemoryAccessWithoutInvariantGroup() argument
1034 return Walker->getClobberingMemoryAccessBase(MA, BAA, UWL, false, false); in getClobberingMemoryAccessWithoutInvariantGroup()
1037 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, in getClobberingMemoryAccess() argument
1040 return getClobberingMemoryAccess(MA, BAA, UpwardWalkLimit); in getClobberingMemoryAccess()
1042 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, in getClobberingMemoryAccess() argument
1046 return getClobberingMemoryAccess(MA, Loc, BAA, UpwardWalkLimit); in getClobberingMemoryAccess()
1049 void invalidateInfo(MemoryAccess *MA) override { in invalidateInfo() argument
1050 if (auto *MUD = dyn_cast<MemoryUseOrDef>(MA)) in invalidateInfo()
1065 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, BatchAAResults &BAA, in getClobberingMemoryAccess() argument
1067 return Walker->getClobberingMemoryAccessBase(MA, BAA, UWL, true); in getClobberingMemoryAccess()
1069 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, in getClobberingMemoryAccess() argument
1072 return Walker->getClobberingMemoryAccessBase(MA, Loc, BAA, UWL); in getClobberingMemoryAccess()
1075 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, in getClobberingMemoryAccess() argument
1078 return getClobberingMemoryAccess(MA, BAA, UpwardWalkLimit); in getClobberingMemoryAccess()
1080 MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, in getClobberingMemoryAccess() argument
1084 return getClobberingMemoryAccess(MA, Loc, BAA, UpwardWalkLimit); in getClobberingMemoryAccess()
1087 void invalidateInfo(MemoryAccess *MA) override { in invalidateInfo() argument
1088 if (auto *MUD = dyn_cast<MemoryUseOrDef>(MA)) in invalidateInfo()
1275 for (MemoryAccess &MA : *Pair.second) in ~MemorySSA()
1276 MA.dropAllReferences(); in ~MemorySSA()
1378 for (MemoryAccess &MA : *Accesses) { in optimizeUsesInBlock()
1379 auto *MU = dyn_cast<MemoryUse>(&MA); in optimizeUsesInBlock()
1381 VersionStack.push_back(&MA); in optimizeUsesInBlock()
1631 *Accesses, [](const MemoryAccess &MA) { return isa<MemoryPhi>(MA); }); in insertIntoListsForBlock() argument
1636 *Defs, [](const MemoryAccess &MA) { return isa<MemoryPhi>(MA); }); in insertIntoListsForBlock() argument
1838 /// Properly remove \p MA from all of MemorySSA's lookup tables.
1839 void MemorySSA::removeFromLookups(MemoryAccess *MA) { in removeFromLookups() argument
1840 assert(MA->use_empty() && in removeFromLookups()
1842 BlockNumbering.erase(MA); in removeFromLookups()
1843 if (auto *MUD = dyn_cast<MemoryUseOrDef>(MA)) in removeFromLookups()
1846 if (!isa<MemoryUse>(MA)) in removeFromLookups()
1847 getWalker()->invalidateInfo(MA); in removeFromLookups()
1850 if (const auto *MUD = dyn_cast<MemoryUseOrDef>(MA)) in removeFromLookups()
1853 MemoryInst = MA->getBlock(); in removeFromLookups()
1856 if (VMA->second == MA) in removeFromLookups()
1860 /// Properly remove \p MA from all of MemorySSA's lists.
1866 void MemorySSA::removeFromLists(MemoryAccess *MA, bool ShouldDelete) { in removeFromLists() argument
1867 BasicBlock *BB = MA->getBlock(); in removeFromLists()
1870 if (!isa<MemoryUse>(MA)) { in removeFromLists()
1873 Defs->remove(*MA); in removeFromLists()
1883 Accesses->erase(MA); in removeFromLists()
1885 Accesses->remove(MA); in removeFromLists()
1997 for (const MemoryAccess &MA : *Accesses) { in verifyDominationNumbers()
1998 auto ThisNumberIter = BlockNumbering.find(&MA); in verifyDominationNumbers()
2054 MemoryUseOrDef *MA = getMemoryAccess(&I); in verifyOrderingDominationAndDefUses() local
2055 assert((!MA || (AL && (isa<MemoryUse>(MA) || DL))) && in verifyOrderingDominationAndDefUses()
2059 if (MA) { in verifyOrderingDominationAndDefUses()
2061 ActualAccesses.push_back(MA); in verifyOrderingDominationAndDefUses()
2062 if (MemoryAccess *MD = dyn_cast<MemoryDef>(MA)) { in verifyOrderingDominationAndDefUses()
2064 ActualDefs.push_back(MA); in verifyOrderingDominationAndDefUses()
2074 verifyUseInDefs(MA->getDefiningAccess(), MA); in verifyOrderingDominationAndDefUses()
2245 MemoryAccess *MA = cast<MemoryAccess>(Op); in print() local
2253 if (unsigned ID = MA->getID()) in print()
2553 MemoryAccess *MA, BatchAAResults &BAA, unsigned &UpwardWalkLimit, in getClobberingMemoryAccessBase() argument
2555 auto *StartingAccess = dyn_cast<MemoryUseOrDef>(MA); in getClobberingMemoryAccessBase()
2558 return MA; in getClobberingMemoryAccessBase()
2638 DoNothingMemorySSAWalker::getClobberingMemoryAccess(MemoryAccess *MA, in getClobberingMemoryAccess() argument
2640 if (auto *Use = dyn_cast<MemoryUseOrDef>(MA)) in getClobberingMemoryAccess()
2642 return MA; in getClobberingMemoryAccess()