159       Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,
378     Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,  in eliminateInstrViaWidening()  argument
382   parseWidenableGuard(Instr, ChecksToHoist);  in eliminateInstrViaWidening()
403     auto E = Instr->getParent() == CurBB ? find(GuardsInCurBB, Instr)  in eliminateInstrViaWidening()
420     assert((i == (e - 1)) == (Instr->getParent() == CurBB) && "Bad DFS?");  in eliminateInstrViaWidening()
428       auto Score = computeWideningScore(Instr, Candidate, *WideningPoint,  in eliminateInstrViaWidening()
430       LLVM_DEBUG(dbgs() << "Score between " << *Instr << " and " << *Candidate  in eliminateInstrViaWidening()
440     LLVM_DEBUG(dbgs() << "Did not eliminate guard " << *Instr << "\n");  in eliminateInstrViaWidening()
444   assert(BestSoFar != Instr && "Should have never visited same guard!");  in eliminateInstrViaWidening()
445   assert(DT.dominates(BestSoFar, Instr) && "Should be!");  in eliminateInstrViaWidening()
447   LLVM_DEBUG(dbgs() << "Widening " << *Instr << " into " << *BestSoFar  in eliminateInstrViaWidening()
453   auto NewGuardCondition = ConstantInt::getTrue(Instr->getContext());  in eliminateInstrViaWidening()
454   setCondition(Instr, NewGuardCondition);  in eliminateInstrViaWidening()
455   EliminatedGuardsAndBranches.push_back(Instr);  in eliminateInstrViaWidening()