145   std::pair<BasicBlock *, BasicBlock *> getBlockEdge(const ValueDFS &VD) const {  in getBlockEdge()
146     if (!VD.Def && VD.U) {  in getBlockEdge()
147       auto *PHI = cast<PHINode>(VD.U->getUser());  in getBlockEdge()
148       return std::make_pair(PHI->getIncomingBlock(*VD.U), PHI->getParent());  in getBlockEdge()
151     return ::getBlockEdge(VD.PInfo);  in getBlockEdge()
188   Value *getMiddleDef(const ValueDFS &VD) const {  in getMiddleDef()
189     if (VD.Def)  in getMiddleDef()
190       return VD.Def;  in getMiddleDef()
197     if (!VD.U) {  in getMiddleDef()
198       assert(VD.PInfo &&  in getMiddleDef()
200       assert(isa<PredicateAssume>(VD.PInfo) &&  in getMiddleDef()
202       return cast<PredicateAssume>(VD.PInfo)->AssumeInst->getNextNode();  in getMiddleDef()
320                                                  const ValueDFS &VD) {  in popStackUntilDFSScope()  argument
321   while (!Stack.empty() && !stackIsInScope(Stack, VD))  in popStackUntilDFSScope()
331       ValueDFS VD;  in convertUsesToDFSOrdered()  local
338         VD.LocalNum = LN_Last;  in convertUsesToDFSOrdered()
343         VD.LocalNum = LN_Middle;  in convertUsesToDFSOrdered()
349       VD.DFSIn = DomNode->getDFSNumIn();  in convertUsesToDFSOrdered()
350       VD.DFSOut = DomNode->getDFSNumOut();  in convertUsesToDFSOrdered()
351       VD.U = &U;  in convertUsesToDFSOrdered()
352       DFSOrderedSet.push_back(VD);  in convertUsesToDFSOrdered()
621       ValueDFS VD;  in renameUses()  local
628         VD.LocalNum = LN_Middle;  in renameUses()
632         VD.DFSIn = DomNode->getDFSNumIn();  in renameUses()
633         VD.DFSOut = DomNode->getDFSNumOut();  in renameUses()
634         VD.PInfo = PossibleCopy;  in renameUses()
635         OrderedUses.push_back(VD);  in renameUses()
642           VD.LocalNum = LN_Last;  in renameUses()
645             VD.DFSIn = DomNode->getDFSNumIn();  in renameUses()
646             VD.DFSOut = DomNode->getDFSNumOut();  in renameUses()
647             VD.PInfo = PossibleCopy;  in renameUses()
648             VD.EdgeOnly = true;  in renameUses()
649             OrderedUses.push_back(VD);  in renameUses()
655           VD.LocalNum = LN_First;  in renameUses()
658             VD.DFSIn = DomNode->getDFSNumIn();  in renameUses()
659             VD.DFSOut = DomNode->getDFSNumOut();  in renameUses()
660             VD.PInfo = PossibleCopy;  in renameUses()
661             OrderedUses.push_back(VD);  in renameUses()
677     for (auto &VD : OrderedUses) {  in renameUses()  local
680       bool PossibleCopy = VD.PInfo != nullptr;  in renameUses()
689       LLVM_DEBUG(dbgs() << "Current DFS numbers are (" << VD.DFSIn << ","  in renameUses()
690                         << VD.DFSOut << ")\n");  in renameUses()
692       bool ShouldPush = (VD.Def || PossibleCopy);  in renameUses()
693       bool OutOfScope = !stackIsInScope(RenameStack, VD);  in renameUses()
696         popStackUntilDFSScope(RenameStack, VD);  in renameUses()
698           RenameStack.push_back(VD);  in renameUses()
706       if (VD.Def || PossibleCopy)  in renameUses()
721                         << *VD.U->get() << " in " << *(VD.U->getUser())  in renameUses()
723       assert(DT.dominates(cast<Instruction>(Result.Def), *VD.U) &&  in renameUses()
725       VD.U->set(Result.Def);  in renameUses()