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