Lines Matching full:accesses

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