Lines Matching defs:VectorizedVals

1402   InstructionCost getTreeCost(ArrayRef<Value *> VectorizedVals = {});
3028       const SmallDenseSet<Value *> *VectorizedVals = nullptr) const;
3048                                ArrayRef<Value *> VectorizedVals,
9012     Instruction *I, const SmallDenseSet<Value *> *VectorizedVals) const {
9013   return (I->hasOneUse() && (!VectorizedVals || VectorizedVals->contains(I))) ||
10124   SmallDenseSet<Value *> VectorizedVals;
10648                        ArrayRef<Value *> VectorizedVals, BoUpSLP &R,
10651         VectorizedVals(VectorizedVals.begin(), VectorizedVals.end()), R(R),
10703             !R.areAllUsersVectorized(cast<Instruction>(V), &VectorizedVals) ||
10708                                                      &VectorizedVals);
11073 BoUpSLP::getEntryCost(const TreeEntry *E, ArrayRef<Value *> VectorizedVals,
11104         E, ScalarTy, *TTI, VectorizedVals, *this, CheckedExtracts);
12443 InstructionCost BoUpSLP::getTreeCost(ArrayRef<Value *> VectorizedVals) {
12480     InstructionCost C = getEntryCost(&TE, VectorizedVals, CheckedExtracts);
12758   if (!VectorizedVals.empty()) {
19924     DenseMap<Value *, unsigned> VectorizedVals(ReducedVals.size());
19982         ++VectorizedVals.try_emplace(OrigV).first->getSecond();
19986           ++VectorizedVals.try_emplace(OrigV).first->getSecond();
20044           VectorizedVals.try_emplace(OrigV, Cnt);
20198               VectorizedVals.lookup(OrigV) + At(SameValuesCounter, OrigV);
20347             VectorizedVals.try_emplace(OrigV, At(SameValuesCounter, OrigV));
20350           ++VectorizedVals.try_emplace(OrigV).first->getSecond();
20366           VectorizedVals.try_emplace(P.first, P.second);
20452           unsigned NumOps = VectorizedVals.lookup(RdxVal);