91 /// disambiguate accesses.
185     AccessList *Accesses = It->second.get();  in renameBlock()  local
186     for (MemoryAccess &L : *Accesses) {  in renameBlock()
212     AccessList *Accesses = It->second.get();  in renameBlock()  local
213     auto *Phi = cast<MemoryPhi>(&Accesses->front());  in renameBlock()
222 /// We walk the dominator tree in preorder, renaming accesses, and then filling
256 /// \brief This handles unreachable block accesses by deleting phi nodes in
274     AccessList *Accesses = It->second.get();  in markUnreachableAsLiveOnEntry()  local
275     auto *Phi = cast<MemoryPhi>(&Accesses->front());  in markUnreachableAsLiveOnEntry()
283   auto &Accesses = It->second;  in markUnreachableAsLiveOnEntry()  local
284   for (auto AI = Accesses->begin(), AE = Accesses->end(); AI != AE;) {  in markUnreachableAsLiveOnEntry()
291       Accesses->erase(AI);  in markUnreachableAsLiveOnEntry()
339   // We maintain lists of memory accesses per-block, trading memory for time. We  in buildMemorySSA()
345   // the accesses.  in buildMemorySSA()
348     AccessList *Accesses = nullptr;  in buildMemorySSA()  local
355       if (!Accesses)  in buildMemorySSA()
356         Accesses = getOrCreateAccessList(&B);  in buildMemorySSA()
357       Accesses->push_back(MUD);  in buildMemorySSA()
361     if (Accesses)  in buildMemorySSA()
408     AccessList *Accesses = getOrCreateAccessList(BB);  in buildMemorySSA()  local
412     Accesses->push_front(Phi);  in buildMemorySSA()
431     AccessList *Accesses = AI->second.get();  in buildMemorySSA()  local
432     for (auto &MA : *Accesses) {  in buildMemorySSA()
457   AccessList *Accesses = getOrCreateAccessList(BB);  in createMemoryPhi()  local
461   Accesses->push_front(Phi);  in createMemoryPhi()
481   auto *Accesses = getOrCreateAccessList(BB);  in createMemoryAccessInBB()  local
485         Accesses->begin(), Accesses->end(),  in createMemoryAccessInBB()
488     Accesses->insert(AI, NewAccess);  in createMemoryAccessInBB()
490     Accesses->push_back(NewAccess);  in createMemoryAccessInBB()
501   auto *Accesses = getOrCreateAccessList(InsertPt->getBlock());  in createMemoryAccessBefore()  local
502   Accesses->insert(AccessList::iterator(InsertPt), NewAccess);  in createMemoryAccessBefore()
512   auto *Accesses = getOrCreateAccessList(InsertPt->getBlock());  in createMemoryAccessAfter()  local
513   Accesses->insertAfter(AccessList::iterator(InsertPt), NewAccess);  in createMemoryAccessAfter()
517 /// \brief Helper function to create new memory accesses
565       auto &Accesses = It->second;  in findDominatingDef()  local
566       for (MemoryAccess &RA : reverse(*Accesses)) {  in findDominatingDef()
630   std::unique_ptr<AccessList> &Accesses = AccessIt->second;  in removeFromLookups()  local
631   Accesses->erase(MA);  in removeFromLookups()
632   if (Accesses->empty())  in removeFromLookups()
699     // Either we hit the assert, really have no accesses, or we have both  in verifyOrdering()
700     // accesses and an access list  in verifyOrdering()
704            "We don't have the same number of accesses in the block as on the "  in verifyOrdering()
709       assert(&*ALI == *AAI && "Not the same accesses in the same order");  in verifyOrdering()
787 /// accesses and verifying that, for each use, it appears in the
818 /// \brief Determine, for two memory accesses in the same block,
825          "Asking for local domination when accesses are in different blocks!");  in locallyDominates()
997   // Vector of visited call accesses for this query. This is separated out