Lines Matching refs:TI
121 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI, in getFeasibleSuccessors() argument
124 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
125 if (TI.getNumSuccessors() == 0) return; in getFeasibleSuccessors()
127 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { in getFeasibleSuccessors()
162 if (isa<InvokeInst>(TI)) { in getFeasibleSuccessors()
169 if (isa<IndirectBrInst>(TI)) { in getFeasibleSuccessors()
174 SwitchInst &SI = cast<SwitchInst>(TI); in getFeasibleSuccessors()
184 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
195 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
208 TerminatorInst *TI = From->getTerminator(); in isEdgeFeasible() local
209 getFeasibleSuccessors(*TI, SuccFeasible, AggressiveUndef); in isEdgeFeasible()
211 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
212 if (TI->getSuccessor(i) == To && SuccFeasible[i]) in isEdgeFeasible()
218 void SparseSolver::visitTerminatorInst(TerminatorInst &TI) { in visitTerminatorInst() argument
220 getFeasibleSuccessors(TI, SuccFeasible, true); in visitTerminatorInst()
222 BasicBlock *BB = TI.getParent(); in visitTerminatorInst()
227 markEdgeExecutable(BB, TI.getSuccessor(i)); in visitTerminatorInst()
289 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(&I)) in visitInst() local
290 visitTerminatorInst(*TI); in visitInst()