Searched refs:InLoopSucc (Results 1 – 2 of 2) sorted by relevance
142 BasicBlock *InLoopSucc; member144 CompareDesc(BranchInst *Term, Value *Invariant, BasicBlock *InLoopSucc) in CompareDesc()145 : Term(Term), Invariant(Invariant), InLoopSucc(InLoopSucc) {} in CompareDesc()152 BasicBlock *InLoopSucc; member155 BasicBlock *InLoopSucc) in InjectedInvariant()156 : Pred(Pred), LHS(LHS), RHS(RHS), InLoopSucc(InLoopSucc) {} in InjectedInvariant()3101 auto *InLoopSucc = Candidate.PendingInjection->InLoopSucc; in injectPendingInvariantConditions() local3104 auto *OutOfLoopSucc = InLoopSucc == TI->getSuccessor(0) ? TI->getSuccessor(1) in injectPendingInvariantConditions()3107 assert(L.contains(InLoopSucc) && "Not supported yet!"); in injectPendingInvariantConditions()3127 BB->getParent(), InLoopSucc); in injectPendingInvariantConditions()[all …]
984 BasicBlock *InLoopSucc = nullptr; in addInfoForInductions() local986 InLoopSucc = cast<BranchInst>(BB.getTerminator())->getSuccessor(0); in addInfoForInductions()988 InLoopSucc = cast<BranchInst>(BB.getTerminator())->getSuccessor(1); in addInfoForInductions()992 if (!L->contains(InLoopSucc) || !L->isLoopExiting(&BB) || InLoopSucc == &BB) in addInfoForInductions()1009 DomTreeNode *DTN = DT.getNode(InLoopSucc); in addInfoForInductions()