136       Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,
328     Instruction *Instr, const df_iterator<DomTreeNode *> &DFSI,  in eliminateInstrViaWidening()  argument
334   if (isa<ConstantInt>(getCondition(Instr)))  in eliminateInstrViaWidening()
350     auto E = Instr->getParent() == CurBB ? find(GuardsInCurBB, Instr)  in eliminateInstrViaWidening()
367     assert((i == (e - 1)) == (Instr->getParent() == CurBB) && "Bad DFS?");  in eliminateInstrViaWidening()
370       auto Score = computeWideningScore(Instr, Candidate, InvertCondition);  in eliminateInstrViaWidening()
371       LLVM_DEBUG(dbgs() << "Score between " << *getCondition(Instr)  in eliminateInstrViaWidening()
382     LLVM_DEBUG(dbgs() << "Did not eliminate guard " << *Instr << "\n");  in eliminateInstrViaWidening()
386   assert(BestSoFar != Instr && "Should have never visited same guard!");  in eliminateInstrViaWidening()
387   assert(DT.dominates(BestSoFar, Instr) && "Should be!");  in eliminateInstrViaWidening()
389   LLVM_DEBUG(dbgs() << "Widening " << *Instr << " into " << *BestSoFar  in eliminateInstrViaWidening()
392   widenGuard(BestSoFar, getCondition(Instr), InvertCondition);  in eliminateInstrViaWidening()
394                                ? ConstantInt::getFalse(Instr->getContext())  in eliminateInstrViaWidening()
395                                : ConstantInt::getTrue(Instr->getContext());  in eliminateInstrViaWidening()
396   setCondition(Instr, NewGuardCondition);  in eliminateInstrViaWidening()
397   EliminatedGuardsAndBranches.push_back(Instr);  in eliminateInstrViaWidening()