Lines Matching refs:ValNo

1295   VNInfo *ValNo = SrcInt.Query(CopyIdx).valueIn();  in reMaterializeTrivialDef()  local
1296 if (!ValNo) in reMaterializeTrivialDef()
1298 if (ValNo->isPHIDef() || ValNo->isUnused()) in reMaterializeTrivialDef()
1300 MachineInstr *DefMI = LIS->getInstructionFromIndex(ValNo->def); in reMaterializeTrivialDef()
1355 if (!allUsesAvailableAt(DefMI, ValNo->def, CopyIdx)) in reMaterializeTrivialDef()
2464 ConflictResolution analyzeValue(unsigned ValNo, JoinVals &Other);
2469 void computeAssignment(unsigned ValNo, JoinVals &Other);
2487 taintExtent(unsigned ValNo, LaneBitmask TaintedLanes, JoinVals &Other,
2500 bool isPrunedValue(unsigned ValNo, JoinVals &Other);
2655 JoinVals::analyzeValue(unsigned ValNo, JoinVals &Other) { in analyzeValue() argument
2656 Val &V = Vals[ValNo]; in analyzeValue()
2658 VNInfo *VNI = LR.getValNumInfo(ValNo); in analyzeValue()
2917 void JoinVals::computeAssignment(unsigned ValNo, JoinVals &Other) { in computeAssignment() argument
2918 Val &V = Vals[ValNo]; in computeAssignment()
2922 assert(Assignments[ValNo] != -1 && "Bad recursion?"); in computeAssignment()
2925 switch ((V.Resolution = analyzeValue(ValNo, Other))) { in computeAssignment()
2931 Assignments[ValNo] = Other.Assignments[V.OtherVNI->id]; in computeAssignment()
2932 LLVM_DEBUG(dbgs() << "\t\tmerge " << printReg(Reg) << ':' << ValNo << '@' in computeAssignment()
2933 << LR.getValNumInfo(ValNo)->def << " into " in computeAssignment()
2936 << NewVNInfo[Assignments[ValNo]]->def << '\n'); in computeAssignment()
2962 Assignments[ValNo] = NewVNInfo.size(); in computeAssignment()
2963 NewVNInfo.push_back(LR.getValNumInfo(ValNo)); in computeAssignment()
2981 taintExtent(unsigned ValNo, LaneBitmask TaintedLanes, JoinVals &Other, in taintExtent() argument
2983 VNInfo *VNI = LR.getValNumInfo(ValNo); in taintExtent()
3104 bool JoinVals::isPrunedValue(unsigned ValNo, JoinVals &Other) { in isPrunedValue() argument
3105 Val &V = Vals[ValNo]; in isPrunedValue()