Lines Matching refs:Vals
462 LiveInterval::iterator ValS =
464 if (ValS == IntB.end())
470 LIS->getInstructionFromIndex(ValS->end.getPrevSlot());
474 // Okay, we now know that ValS ends in the same block that the CopyMI
477 if (ValS+1 != BS) return false;
481 SlotIndex FillerStart = ValS->end, FillerEnd = BS->start;
488 // [ValS.end, BS.begin) of either value number, then we merge the
493 if (BValNo != ValS->valno)
494 IntB.MergeValueNumberInto(BValNo, ValS->valno);
1387 SmallVector<Val, 8> Vals;
1406 Assignments(LI.getNumValNums(), -1), Vals(LI.getNumValNums())
1468 /// Analyze ValNo in this live range, and set all fields of Vals[ValNo].
1477 Val &V = Vals[ValNo];
1514 V.ValidLanes |= Vals[V.RedefVNI->id].ValidLanes;
1548 Val &OtherV = Other.Vals[OtherVNI->id];
1575 Val &OtherV = Other.Vals[V.OtherVNI->id];
1681 Val &V = Vals[ValNo];
1693 assert(Other.Vals[V.OtherVNI->id].isAnalyzed() && "Missing recursion");
1705 Other.Vals[V.OtherVNI->id].Pruned = true;
1718 if (Vals[i].Resolution == CR_Impossible) {
1774 const Val &OV = Other.Vals[OtherI->valno->id];
1802 Val &V = Vals[i];
1811 const Val &OtherV = Other.Vals[V.OtherVNI->id];
1870 Val &V = Vals[ValNo];
1888 switch (Vals[i].Resolution) {
1898 Val &OtherV = Other.Vals[Vals[i].OtherVNI->id];
1944 switch (Vals[i].Resolution) {
1949 if (!Vals[i].ErasableImplicitDef || !Vals[i].Pruned)
