Lines Matching defs:TI
1919 Loop &L, Instruction &TI, ArrayRef<Value *> Invariants,
1923 auto *ParentBB = TI.getParent();
1924 BranchInst *BI = dyn_cast<BranchInst>(&TI);
1925 SwitchInst *SI = BI ? nullptr : cast<SwitchInst>(&TI);
2058 SplitBB->getInstList().splice(SplitBB->end(), ParentBB->getInstList(), TI);
2061 Instruction *NewTI = TI.clone();
2469 Instruction &TI, Loop &L, LoopInfo &LI, DominatorTree &DT,
2478 BasicBlock *CondBlock = TI.getParent();
2480 (isGuard(&TI) ||
2481 llvm::count_if(successors(&TI), [&L](BasicBlock *SuccBB) {
2536 << " for unswitch candidate: " << TI << "\n");
2689 auto ComputeUnswitchedCost = [&](Instruction &TI, bool FullUnswitch) {
2690 BasicBlock &BB = *TI.getParent();
2704 auto &BI = cast<BranchInst>(TI);
2738 int SuccessorsCount = isGuard(&TI) ? 2 : Visited.size();
2747 Instruction &TI = *TerminatorAndInvariants.first;
2749 BranchInst *BI = dyn_cast<BranchInst>(&TI);
2751 TI, /*FullUnswitch*/ !BI || (Invariants.size() == 1 &&
2757 calculateUnswitchCostMultiplier(TI, L, LI, DT, UnswitchCandidates);
2764 << " for unswitch candidate: " << TI << "\n");
2767 << " for unswitch candidate: " << TI << "\n");
2771 BestUnswitchTI = &TI;