893   InstructionCost getTreeCost(ArrayRef<Value *> VectorizedVals = None);
2124                              ArrayRef<Value *> VectorizedVals) const;
2128                                ArrayRef<Value *> VectorizedVals);
5646                                     ArrayRef<Value *> VectorizedVals) const {  in areAllUsersVectorized()
5647   return (I->hasOneUse() && is_contained(VectorizedVals, I)) ||  in areAllUsersVectorized()
5812                                       ArrayRef<Value *> VectorizedVals) {  in getEntryCost()  argument
5837                                VectorizedVals, E](InstructionCost &Cost) {  in getEntryCost()
5851           !areAllUsersVectorized(cast<Instruction>(V), VectorizedVals) ||  in getEntryCost()
7035 InstructionCost BoUpSLP::getTreeCost(ArrayRef<Value *> VectorizedVals) {  in getTreeCost()  argument
7045     InstructionCost C = getEntryCost(&TE, VectorizedVals);  in getTreeCost()
11049     DenseMap<Value *, unsigned> VectorizedVals;  in tryToReduce()  local
11201           unsigned NumOps = VectorizedVals.lookup(V) + NumUses[V];  in tryToReduce()
11209           unsigned NumOps = VectorizedVals.lookup(V) + NumUses[V];  in tryToReduce()
11292           ++VectorizedVals.try_emplace(TrackedToOrig.find(V)->second, 0)  in tryToReduce()
11338           unsigned NumOps = VectorizedVals.lookup(RdxVal);  in tryToReduce()