268     IntrinsicInst *GuardInst, const df_iterator<DomTreeNode *> &DFSI,  in eliminateGuardViaWidening()  argument
273   auto *GuardInstLoop = LI.getLoopFor(GuardInst->getParent());  in eliminateGuardViaWidening()
300     assert((i == (e - 1)) == (GuardInst->getParent() == CurBB) && "Bad DFS?");  in eliminateGuardViaWidening()
305       auto NewEnd = std::find(I, E, GuardInst);  in eliminateGuardViaWidening()
312           computeWideningScore(GuardInst, GuardInstLoop, Candidate, CurLoop);  in eliminateGuardViaWidening()
313       DEBUG(dbgs() << "Score between " << *GuardInst->getArgOperand(0)  in eliminateGuardViaWidening()
324     DEBUG(dbgs() << "Did not eliminate guard " << *GuardInst << "\n");  in eliminateGuardViaWidening()
328   assert(BestSoFar != GuardInst && "Should have never visited same guard!");  in eliminateGuardViaWidening()
329   assert(DT.dominates(BestSoFar, GuardInst) && "Should be!");  in eliminateGuardViaWidening()
331   DEBUG(dbgs() << "Widening " << *GuardInst << " into " << *BestSoFar  in eliminateGuardViaWidening()
333   widenGuard(BestSoFar, GuardInst->getArgOperand(0));  in eliminateGuardViaWidening()
334   GuardInst->setArgOperand(0, ConstantInt::getTrue(GuardInst->getContext()));  in eliminateGuardViaWidening()
335   EliminatedGuards.push_back(GuardInst);  in eliminateGuardViaWidening()