Searched refs:MemoryPhi (Results 1 – 11 of 11) sorted by relevance
89 MemoryPhi *Phi = dyn_cast_or_null<MemoryPhi>(MSSA->getMemoryAccess(BB)); in getPreviousDefRecursive()192 if (MemoryPhi *UsePhi = dyn_cast<MemoryPhi>(&*U)) in recursePhi()279 if (MemoryPhi *Phi = cast_or_null<MemoryPhi>(MP)) in insertUse()448 MemoryPhi *Phi = dyn_cast_or_null<MemoryPhi>(MP); in insertDef()455 MemoryPhi *Phi = dyn_cast_or_null<MemoryPhi>(MP); in insertDef()474 if (MemoryPhi *Phi = dyn_cast<MemoryPhi>(NewDef)) in fixupDefs()588 MemoryPhi *DefPhi = cast<MemoryPhi>(InsnDefining); in getNewDefiningAccessForClone()1115 if (MemoryPhi *UsrPhi = dyn_cast<MemoryPhi>(Usr)) { in applyInsertUpdates()1145 if (MemoryPhi *PhiUser = dyn_cast<MemoryPhi>(U)) in moveTo()1286 if (MemoryPhi *MP = dyn_cast<MemoryPhi>(MA)) { in removeMemoryAccess()[all …]
456 assert(isa<MemoryPhi>(MA)); in checkClobberSanity()586 assert(isa<MemoryPhi>(Desc.Last) && in walkToPhiOrClobber()790 MemoryPhi *Current = Phi; in tryOptimizePhi()1582 if (isa<MemoryPhi>(NewAccess)) { in insertIntoListsForBlock()1659 if (isa<MemoryPhi>(What)) { in moveTo()1675 MemoryPhi *Phi = new MemoryPhi(BB->getContext(), BB, NextID++); in createMemoryPhi()1967 MemoryPhi *Phi = getMemoryAccess(&B); in verifyOrderingDominationAndDefUses()2125 if (MemoryPhi *MP = dyn_cast<MemoryPhi>(Dominatee.getUser())) { in dominates()2177 void MemoryPhi::print(raw_ostream &OS) const { in print()2589 void MemoryPhi::deleteMe(DerivedUser *Self) { in deleteMe()[all …]
210 friend class MemoryPhi; variable479 class MemoryPhi final : public MemoryAccess {662 assert((isa<MemoryDef>(this) || isa<MemoryPhi>(this)) &&666 return cast<MemoryPhi>(this)->getID();696 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(MemoryPhi, MemoryAccess)721 MemoryPhi *getMemoryAccess(const BasicBlock *BB) const {859 MemoryPhi *createMemoryPhi(BasicBlock *BB);1138 MemoryPhi *MP = dyn_cast<MemoryPhi>(Access);1147 if (const MemoryPhi *MP = dyn_cast<MemoryPhi>(Access))1155 if (const MemoryPhi *MP = dyn_cast<MemoryPhi>(Access)) {[all …]
51 using PhiToDefMap = SmallDenseMap<MemoryPhi *, MemoryAccess *>;63 SmallSet<AssertingVH<MemoryPhi>, 8> NonOptPhis;257 MemoryAccess *tryRemoveTrivialPhi(MemoryPhi *Phi);259 MemoryAccess *tryRemoveTrivialPhi(MemoryPhi *Phi, RangeType &Operands);
147 const MemoryPhi *Phi = cast<MemoryPhi>(MA); in isClobberedInFunction()
296 using MemoryMemberType = MemoryPhi;601 DenseMap<const MemoryPhi *, MemoryPhiState> MemoryPhiState;772 void valueNumberMemoryPhi(MemoryPhi *);865 MemoryPhi *getMemoryAccess(const BasicBlock *) const;956 auto *MP = dyn_cast<MemoryPhi>(V); in getBlockForValue()1669 if (auto *MP = dyn_cast<MemoryPhi>(From)) { in setMemoryClass()2164 return getMinDFSOfRange<const MemoryPhi>(CC->memory()); in getNextMemoryLeader()2903 const MemoryPhi *MP = cast<MemoryPhi>(&Def); in initializeCongruenceClasses()3037 void NewGVN::valueNumberMemoryPhi(MemoryPhi *MP) { in valueNumberMemoryPhi()3164 auto *MP = cast<MemoryPhi>(EndDef); in singleReachablePHIPath()[all …]
1185 if (isa<MemoryPhi>(UseAccess)) { in isWriteAtEndOfFunction()1192 PushMemUses(cast<MemoryPhi>(UseAccess)); in isWriteAtEndOfFunction()1383 if (isa<MemoryPhi>(Current)) { in getDomMemoryDef()1526 if (isa<MemoryPhi>(UseAccess)) { in getDomMemoryDef()1978 if (auto PhiAccess = dyn_cast<MemoryPhi>(Current)) { in storeIsNoop()2145 if (isa<MemoryPhi>(DeadAccess)) { in eliminateDeadStores()2147 for (Value *V : cast<MemoryPhi>(DeadAccess)->incoming_values()) { in eliminateDeadStores()
1003 SmallPtrSet<MemoryPhi *, 4> UsePhis; in raMPHIuw()1005 if (MemoryPhi *Phi = dyn_cast<MemoryPhi>(U)) in raMPHIuw()1008 for (MemoryPhi *Phi : UsePhis) { in raMPHIuw()
1124 if (isa<MemoryPhi>(&Acc)) in isOnlyMemoryAccess()2353 … !(InvariantGroup && Source->getBlock() == CurLoop->getHeader() && isa<MemoryPhi>(Source)); in pointerInvalidatedByLoop()
314 if (auto *MemPhi = dyn_cast<MemoryPhi>(DefiningAccess)) in buildPartialInvariantUnswitchConditionalBranch()1064 if (!isa<MemoryPhi>(*Defs->begin()) || (++Defs->begin() != Defs->end())) in unswitchAllTrivialConditions()
121 HANDLE_MEMORY_VALUE(MemoryPhi)