Lines Matching defs:MaybeDeadAccess

16 // 1. Get the next dominating clobbering MemoryDef (MaybeDeadAccess) by walking
18 // 2. Check that there are no reads between MaybeDeadAccess and the StartDef by
19 //    checking all uses starting at MaybeDeadAccess and walking until we see
1595     // they cover all paths from MaybeDeadAccess to any function exit.
1598     MemoryAccess *MaybeDeadAccess = Current;
1600     Instruction *MaybeDeadI = cast<MemoryDef>(MaybeDeadAccess)->getMemoryInst();
1601     LLVM_DEBUG(dbgs() << "  Checking for reads of " << *MaybeDeadAccess << " ("
1606     pushMemUses(MaybeDeadAccess, WorkList, Visited);
1683       if (MaybeDeadAccess == UseAccess &&
1688       // Otherwise, for the KillingDef and MaybeDeadAccess we only have to check
1692       if (KillingDef == UseAccess || MaybeDeadAccess == UseAccess) {
1711               PostOrderNumbers.find(MaybeDeadAccess->getBlock())->second) {
1729     // MaybeDeadAccess to the exit.
1745       // If the common post-dominator does not post-dominate MaybeDeadAccess,
1746       // there is a path from MaybeDeadAccess to an exit not going through a
1748       if (!PDT.dominates(CommonPred, MaybeDeadAccess->getBlock())) {
1759         return {MaybeDeadAccess};
1774       // killing blocks before reaching MaybeDeadAccess.
1780         if (Current == MaybeDeadAccess->getBlock())
1783         // MaybeDeadAccess is reachable from the entry, so we don't have to
1797     // No aliasing MemoryUses of MaybeDeadAccess found, MaybeDeadAccess is
1799     return {MaybeDeadAccess};
2372     std::optional<MemoryAccess *> MaybeDeadAccess = getDomMemoryDef(
2378     if (!MaybeDeadAccess) {
2382     MemoryAccess *DeadAccess = *MaybeDeadAccess;