143                             Instruction *InsertPt, Type *Ty);
224   Instruction *InsertPt = nullptr;  in getInsertPointForUses()  local
230     if (!InsertPt) {  in getInsertPointForUses()
231       InsertPt = InsertBB->getTerminator();  in getInsertPointForUses()
234     InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);  in getInsertPointForUses()
235     InsertPt = InsertBB->getTerminator();  in getInsertPointForUses()
237   assert(InsertPt && "Missing phi operand");  in getInsertPointForUses()
241     return InsertPt;  in getInsertPointForUses()
243   assert(DT->dominates(DefI, InsertPt) && "def does not dominate all uses");  in getInsertPointForUses()
246   assert(!L || L->contains(LI->getLoopFor(InsertPt->getParent())));  in getInsertPointForUses()
248   for (auto *DTN = (*DT)[InsertPt->getParent()]; DTN; DTN = DTN->getIDom())  in getInsertPointForUses()
515                                           Loop *L, Instruction *InsertPt,  in expandSCEVIfNeeded()  argument
519   if (Value *ExistingValue = Rewriter.findExistingExpansion(S, InsertPt, L))  in expandSCEVIfNeeded()
524   return Rewriter.expandCodeFor(S, ResultTy, InsertPt);  in expandSCEVIfNeeded()
1402   Instruction *InsertPt = &L->getHeader()->front();  in createWideIV()  local
1403   WidePhi = cast<PHINode>(Rewriter.expandCodeFor(AddRec, WideType, InsertPt));  in createWideIV()
1998   Instruction *InsertPt = &*ExitBlock->getFirstInsertionPt();  in sinkUnusedInvariants()  local
2067     ToMove->moveBefore(InsertPt);  in sinkUnusedInvariants()
2069     InsertPt = ToMove;  in sinkUnusedInvariants()