Lines Matching refs:ValNo
1299 VNInfo *ValNo = SrcInt.Query(CopyIdx).valueIn(); in reMaterializeTrivialDef() local
1300 if (!ValNo) in reMaterializeTrivialDef()
1302 if (ValNo->isPHIDef() || ValNo->isUnused()) in reMaterializeTrivialDef()
1304 MachineInstr *DefMI = LIS->getInstructionFromIndex(ValNo->def); in reMaterializeTrivialDef()
1359 if (!allUsesAvailableAt(DefMI, ValNo->def, CopyIdx)) in reMaterializeTrivialDef()
2469 ConflictResolution analyzeValue(unsigned ValNo, JoinVals &Other);
2474 void computeAssignment(unsigned ValNo, JoinVals &Other);
2492 taintExtent(unsigned ValNo, LaneBitmask TaintedLanes, JoinVals &Other,
2505 bool isPrunedValue(unsigned ValNo, JoinVals &Other);
2660 JoinVals::analyzeValue(unsigned ValNo, JoinVals &Other) { in analyzeValue() argument
2661 Val &V = Vals[ValNo]; in analyzeValue()
2663 VNInfo *VNI = LR.getValNumInfo(ValNo); in analyzeValue()
2922 void JoinVals::computeAssignment(unsigned ValNo, JoinVals &Other) { in computeAssignment() argument
2923 Val &V = Vals[ValNo]; in computeAssignment()
2927 assert(Assignments[ValNo] != -1 && "Bad recursion?"); in computeAssignment()
2930 switch ((V.Resolution = analyzeValue(ValNo, Other))) { in computeAssignment()
2936 Assignments[ValNo] = Other.Assignments[V.OtherVNI->id]; in computeAssignment()
2937 LLVM_DEBUG(dbgs() << "\t\tmerge " << printReg(Reg) << ':' << ValNo << '@' in computeAssignment()
2938 << LR.getValNumInfo(ValNo)->def << " into " in computeAssignment()
2941 << NewVNInfo[Assignments[ValNo]]->def << '\n'); in computeAssignment()
2967 Assignments[ValNo] = NewVNInfo.size(); in computeAssignment()
2968 NewVNInfo.push_back(LR.getValNumInfo(ValNo)); in computeAssignment()
2986 taintExtent(unsigned ValNo, LaneBitmask TaintedLanes, JoinVals &Other, in taintExtent() argument
2988 VNInfo *VNI = LR.getValNumInfo(ValNo); in taintExtent()
3109 bool JoinVals::isPrunedValue(unsigned ValNo, JoinVals &Other) { in isPrunedValue() argument
3110 Val &V = Vals[ValNo]; in isPrunedValue()