Lines Matching defs:ValNo

1300   VNInfo *ValNo = SrcInt.Query(CopyIdx).valueIn();
1301   if (!ValNo)
1303   if (ValNo->isPHIDef() || ValNo->isUnused())
1305   MachineInstr *DefMI = LIS->getInstructionFromIndex(ValNo->def);
1317   if (!Edit.checkRematerializable(ValNo, DefMI))
1364   LiveRangeEdit::Remat RM(ValNo);
1366   if (!Edit.canRematerializeAt(RM, ValNo, CopyIdx, true))
1558             // VNI is in ValNo - remove any segments in this SubRange that have
1559             // this ValNo
2543   /// Analyze ValNo in this live range, and set all fields of Vals[ValNo].
2550   ConflictResolution analyzeValue(unsigned ValNo, JoinVals &Other);
2552   /// Compute the value assignment for ValNo in RI.
2553   /// This may be called recursively by analyzeValue(), but never for a ValNo on
2555   void computeAssignment(unsigned ValNo, JoinVals &Other);
2557   /// Assuming ValNo is going to clobber some valid lanes in Other.LR, compute
2564   ///   2 %src = FOO             <-- ValNo to be joined with %dst:ssub0
2568   /// For each ValNo in Other that is affected, add an (EndIndex, TaintedLanes)
2573   taintExtent(unsigned ValNo, LaneBitmask TaintedLanes, JoinVals &Other,
2580   /// Determine if ValNo is a copy of a value number in LR or Other.LR that will
2586   bool isPrunedValue(unsigned ValNo, JoinVals &Other);
2741 JoinVals::analyzeValue(unsigned ValNo, JoinVals &Other) {
2742   Val &V = Vals[ValNo];
2744   VNInfo *VNI = LR.getValNumInfo(ValNo);
3021 void JoinVals::computeAssignment(unsigned ValNo, JoinVals &Other) {
3022   Val &V = Vals[ValNo];
3024     // Recursion should always move up the dominator tree, so ValNo is not
3026     assert(Assignments[ValNo] != -1 && "Bad recursion?");
3029   switch ((V.Resolution = analyzeValue(ValNo, Other))) {
3032     // Merge this ValNo into OtherVNI.
3035     Assignments[ValNo] = Other.Assignments[V.OtherVNI->id];
3036     LLVM_DEBUG(dbgs() << "\t\tmerge " << printReg(Reg) << ':' << ValNo << '@'
3037                       << LR.getValNumInfo(ValNo)->def << " into "
3040                       << NewVNInfo[Assignments[ValNo]]->def << '\n');
3052     Assignments[ValNo] = NewVNInfo.size();
3053     NewVNInfo.push_back(LR.getValNumInfo(ValNo));
3071 taintExtent(unsigned ValNo, LaneBitmask TaintedLanes, JoinVals &Other,
3073   VNInfo *VNI = LR.getValNumInfo(ValNo);
3194 bool JoinVals::isPrunedValue(unsigned ValNo, JoinVals &Other) {
3195   Val &V = Vals[ValNo];