157       Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,
375     Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,  in eliminateInstrViaWidening()  argument
379   parseWidenableGuard(Instr, ChecksToHoist);  in eliminateInstrViaWidening()
400     auto E = Instr->getParent() == CurBB ? find(GuardsInCurBB, Instr)  in eliminateInstrViaWidening()
417     assert((i == (e - 1)) == (Instr->getParent() == CurBB) && "Bad DFS?");  in eliminateInstrViaWidening()
425       auto Score = computeWideningScore(Instr, Candidate, WideningPoint,  in eliminateInstrViaWidening()
427       LLVM_DEBUG(dbgs() << "Score between " << *Instr << " and " << *Candidate  in eliminateInstrViaWidening()
437     LLVM_DEBUG(dbgs() << "Did not eliminate guard " << *Instr << "\n");  in eliminateInstrViaWidening()
441   assert(BestSoFar != Instr && "Should have never visited same guard!");  in eliminateInstrViaWidening()
442   assert(DT.dominates(BestSoFar, Instr) && "Should be!");  in eliminateInstrViaWidening()
444   LLVM_DEBUG(dbgs() << "Widening " << *Instr << " into " << *BestSoFar  in eliminateInstrViaWidening()
450   auto NewGuardCondition = ConstantInt::getTrue(Instr->getContext());  in eliminateInstrViaWidening()
451   setCondition(Instr, NewGuardCondition);  in eliminateInstrViaWidening()
452   EliminatedGuardsAndBranches.push_back(Instr);  in eliminateInstrViaWidening()