152   Instruction *findInsertionPoint(Instruction &User, unsigned OpNo);
165   bool isDominated(Instruction *NewPt, Instruction *User, unsigned OpNo,
181   bool tryAndMerge(Instruction *NewPt, Instruction *User, unsigned OpNo,
191   void computeInsertionPoint(Instruction *User, unsigned OpNo,
208                                              Instruction *User, unsigned OpNo,  in appendAndTransferDominatedUses()  argument
212     IPI->second.emplace_back(User, OpNo);  in appendAndTransferDominatedUses()
372                                                         unsigned OpNo) {  in findInsertionPoint()  argument
376     return PhiInst->getIncomingBlock(OpNo)->getTerminator();  in findInsertionPoint()
382                                          unsigned OpNo,  in isDominated()  argument
400       IPI.second.emplace_back(User, OpNo);  in isDominated()
408                                          unsigned OpNo,  in tryAndMerge()  argument
428       appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);  in tryAndMerge()
452     appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);  in tryAndMerge()
459     Instruction *User, unsigned OpNo, InsertionPoints &InsertPts) {  in computeInsertionPoint()  argument
460   LLVM_DEBUG(dbgs() << "Considered use, opidx " << OpNo << ":\n");  in computeInsertionPoint()
464   Instruction *InsertionPoint = findInsertionPoint(*User, OpNo);  in computeInsertionPoint()
470   if (isDominated(InsertionPoint, User, OpNo, InsertPts))  in computeInsertionPoint()
474   if (tryAndMerge(InsertionPoint, User, OpNo, InsertPts))  in computeInsertionPoint()
480   InsertPts[InsertionPoint].emplace_back(User, OpNo);  in computeInsertionPoint()
578       unsigned OpNo = &U - I.op_begin();  in runOnFunction()  local
579       if (!shouldConvertUse(Cst, &I, OpNo))  in runOnFunction()
582       Updates.emplace_back(Cst, &I, OpNo);  in runOnFunction()