Lines Matching full:accesses

475   // We do have accesses that claim they're optimized, but could be optimized  in checkClobberSanity()
1009 /// A MemorySSAWalker that does AA walks to disambiguate accesses. It no
1103 AccessList *Accesses = It->second.get(); in renameSuccessorPhis() local
1104 auto *Phi = cast<MemoryPhi>(&Accesses->front()); in renameSuccessorPhis()
1127 AccessList *Accesses = It->second.get(); in renameBlock() local
1128 for (MemoryAccess &L : *Accesses) { in renameBlock()
1144 /// We walk the dominator tree in preorder, renaming accesses, and then filling
1149 assert(Root && "Trying to rename accesses in an unreachable block"); in renamePass()
1193 /// This handles unreachable block accesses by deleting phi nodes in
1211 AccessList *Accesses = It->second.get(); in markUnreachableAsLiveOnEntry() local
1212 auto *Phi = cast<MemoryPhi>(&Accesses->front()); in markUnreachableAsLiveOnEntry()
1220 auto &Accesses = It->second; in markUnreachableAsLiveOnEntry() local
1221 for (auto AI = Accesses->begin(), AE = Accesses->end(); AI != AE;) { in markUnreachableAsLiveOnEntry()
1228 Accesses->erase(AI); in markUnreachableAsLiveOnEntry()
1359 /// If no accesses, nothing to do. in optimizeUsesInBlock()
1360 MemorySSA::AccessList *Accesses = MSSA->getWritableBlockAccesses(BB); in optimizeUsesInBlock() local
1361 if (Accesses == nullptr) in optimizeUsesInBlock()
1378 for (MemoryAccess &MA : *Accesses) { in optimizeUsesInBlock()
1530 // We maintain lists of memory accesses per-block, trading memory for time. We in buildMemorySSA()
1535 // the accesses. in buildMemorySSA()
1538 AccessList *Accesses = nullptr; in buildMemorySSA() local
1545 if (!Accesses) in buildMemorySSA()
1546 Accesses = getOrCreateAccessList(&B); in buildMemorySSA()
1547 Accesses->push_back(MUD); in buildMemorySSA()
1572 // Now rename accesses in the loop. Populate Visited with the exit blocks of in buildMemorySSA()
1621 auto *Accesses = getOrCreateAccessList(BB); in insertIntoListsForBlock() local
1626 Accesses->push_front(NewAccess); in insertIntoListsForBlock()
1631 *Accesses, [](const MemoryAccess &MA) { return isa<MemoryPhi>(MA); }); in insertIntoListsForBlock()
1632 Accesses->insert(AI, NewAccess); in insertIntoListsForBlock()
1641 Accesses->push_back(NewAccess); in insertIntoListsForBlock()
1652 auto *Accesses = getWritableBlockAccesses(BB); in insertIntoListsBefore() local
1653 bool WasEnd = InsertPt == Accesses->end(); in insertIntoListsBefore()
1654 Accesses->insert(AccessList::iterator(InsertPt), What); in insertIntoListsBefore()
1666 while (InsertPt != Accesses->end() && !isa<MemoryDef>(InsertPt)) in insertIntoListsBefore()
1669 if (InsertPt == Accesses->end()) in insertIntoListsBefore()
1756 /// Helper function to create new memory accesses
1795 // Memory accesses should only be reduced and can not be increased since AA in createNewAccess()
1798 "Memory accesses should only be reduced"); in createNewAccess()
1881 std::unique_ptr<AccessList> &Accesses = AccessIt->second; in removeFromLists() local
1883 Accesses->erase(MA); in removeFromLists()
1885 Accesses->remove(MA); in removeFromLists()
1887 if (Accesses->empty()) { in removeFromLists()
1990 const AccessList *Accesses = getBlockAccesses(&BB); in verifyDominationNumbers() local
1992 if (!Accesses) in verifyDominationNumbers()
1997 for (const MemoryAccess &MA : *Accesses) { in verifyDominationNumbers()
2018 /// accesses and verifying that, for each use, it appears in the appropriate
2077 // Either we hit the assert, really have no accesses, or we have both in verifyOrderingDominationAndDefUses()
2078 // accesses and an access list. Same with defs. in verifyOrderingDominationAndDefUses()
2083 "We don't have the same number of accesses in the block as on the " in verifyOrderingDominationAndDefUses()
2093 assert(&*ALI == *AAI && "Not the same accesses in the same order"); in verifyOrderingDominationAndDefUses()
2139 /// Determine, for two memory accesses in the same block,
2147 "Asking for local domination when accesses are in different blocks!"); in locallyDominates()