Lines Matching defs:InsertPt
218 /// InsertPt is true then actually generate the resulting expression, make it
219 /// available at \p InsertPt and return it in \p Result (else no change to the
224 std::optional<BasicBlock::iterator> InsertPt);
227 /// it available at InsertPt
229 Value *OldCondition, BasicBlock::iterator InsertPt);
233 Value *freezeAndPush(Value *Orig, BasicBlock::iterator InsertPt);
299 return mergeChecks(ChecksToHoist, ChecksToWiden, /*InsertPt=*/std::nullopt)
307 auto InsertPt = findInsertionPointForWideCondition(ToWiden);
308 auto MergedCheck = mergeChecks(ChecksToHoist, ChecksToWiden, InsertPt);
311 getCondition(ToWiden), *InsertPt);
628 BasicBlock::iterator InsertPt) {
629 if (isGuaranteedNotToBePoison(Orig, nullptr, InsertPt, &DT))
635 FI->insertBefore(*InsertPt->getParent(), InsertPt);
639 BasicBlock::iterator InsertPt = *InsertPtAtDef;
641 FI->insertBefore(*InsertPt->getParent(), InsertPt);
660 if (isGuaranteedNotToBePoison(Def, nullptr, InsertPt, &DT))
662 BasicBlock::iterator InsertPt = *getFreezeInsertPt(Def, DT);
664 FI->insertBefore(*InsertPt->getParent(), InsertPt);
679 if (isGuaranteedNotToBePoison(V, nullptr, InsertPt, &DT))
722 std::optional<BasicBlock::iterator> InsertPt) {
752 if (InsertPt) {
754 ConstantInt::get((*InsertPt)->getContext(), NewRHSAP);
755 assert(canBeHoistedTo(LHS, *InsertPt) && "must be");
756 makeAvailableAt(LHS, *InsertPt);
757 Result = new ICmpInst(*InsertPt, Pred, LHS, NewRHS, "wide.chk");
770 if (InsertPt) {
772 makeAvailableAt(RC.getCheckInst(), *InsertPt);
775 *InsertPt);
781 Result = freezeAndPush(Result, *InsertPt);
793 BasicBlock::iterator InsertPt) {
795 IRBuilder<> Builder(InsertPt->getParent(), InsertPt);
796 makeAvailableAt(ChecksToHoist, InsertPt);
797 makeAvailableAt(OldCondition, InsertPt);
799 Result = freezeAndPush(Result, InsertPt);