1732   SmallVector<Val, 8> Vals;  member in __anon6ac1a90d0211::JoinVals
1796       TRI(TRI), Assignments(LR.getNumValNums(), -1), Vals(LR.getNumValNums())  in JoinVals()
1909   Val &V = Vals[ValNo];  in analyzeValue()
1958           V.ValidLanes |= Vals[V.RedefVNI->id].ValidLanes;  in analyzeValue()
1994     Val &OtherV = Other.Vals[OtherVNI->id];  in analyzeValue()
2021   Val &OtherV = Other.Vals[V.OtherVNI->id];  in analyzeValue()
2130   Val &V = Vals[ValNo];  in computeAssignment()
2142     assert(Other.Vals[V.OtherVNI->id].isAnalyzed() && "Missing recursion");  in computeAssignment()
2154     Val &OtherV = Other.Vals[V.OtherVNI->id];  in computeAssignment()
2173     if (Vals[i].Resolution == CR_Impossible) {  in mapValues()
2214     const Val &OV = Other.Vals[OtherI->valno->id];  in taintExtent()
2240     Val &V = Vals[i];  in resolveConflicts()
2252     const Val &OtherV = Other.Vals[V.OtherVNI->id];  in resolveConflicts()
2304   Val &V = Vals[ValNo];  in isPrunedValue()
2323     switch (Vals[i].Resolution) {  in pruneValues()
2333       Val &OtherV = Other.Vals[Vals[i].OtherVNI->id];  in pruneValues()
2382     if (Vals[i].Resolution != CR_Erase)  in pruneSubRegValues()
2417     Val &V = Vals[i];  in removeImplicitDefs()
2432     switch (Vals[i].Resolution) {  in eraseInstrs()
2437       if (!Vals[i].ErasableImplicitDef || !Vals[i].Pruned)  in eraseInstrs()