Lines Matching defs:TI
120 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
123 Succs.resize(TI.getNumSuccessors());
124 if (TI.getNumSuccessors() == 0) return;
126 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) {
161 if (isa<InvokeInst>(TI)) {
168 if (isa<IndirectBrInst>(TI)) {
173 SwitchInst &SI = cast<SwitchInst>(TI);
183 Succs.assign(TI.getNumSuccessors(), true);
194 Succs.assign(TI.getNumSuccessors(), true);
207 TerminatorInst *TI = From->getTerminator();
208 getFeasibleSuccessors(*TI, SuccFeasible, AggressiveUndef);
210 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
211 if (TI->getSuccessor(i) == To && SuccFeasible[i])
217 void SparseSolver::visitTerminatorInst(TerminatorInst &TI) {
219 getFeasibleSuccessors(TI, SuccFeasible, true);
221 BasicBlock *BB = TI.getParent();
226 markEdgeExecutable(BB, TI.getSuccessor(i));
288 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(&I))
289 visitTerminatorInst(*TI);
