1883         SmallPtrSet<Value *, 4> UniqueValues;  in reorder()  local
1886           UniqueValues.insert(Data.V);  in reorder()
1888           if (any_of(Op, [&UniqueValues](const OperandData &Data) {  in reorder()
1889                 return !UniqueValues.contains(Data.V);  in reorder()
1895         return UniqueValues.size() != 2 && isPowerOf2_32(UniqueValues.size());  in reorder()
4555   SmallVector<Value *> UniqueValues;  in buildTree_rec()  local
4556   auto &&TryToFindDuplicates = [&VL, &ReuseShuffleIndicies, &UniqueValues,  in buildTree_rec()
4564             isa<UndefValue>(V) ? UndefMaskElem : UniqueValues.size());  in buildTree_rec()
4565         UniqueValues.emplace_back(V);  in buildTree_rec()
4568       auto Res = UniquePositions.try_emplace(V, UniqueValues.size());  in buildTree_rec()
4571         UniqueValues.emplace_back(V);  in buildTree_rec()
4573     size_t NumUniqueScalarValues = UniqueValues.size();  in buildTree_rec()
4579           (UniquePositions.size() == 1 && all_of(UniqueValues,  in buildTree_rec()
4589       VL = UniqueValues;  in buildTree_rec()
7772   SmallVector<Value *> UniqueValues;  in createBuildVector()  local
7787         ReuseShuffleIndicies.emplace_back(UniqueValues.size());  in createBuildVector()
7788         UniqueValues.emplace_back(V);  in createBuildVector()
7791       auto Res = UniquePositions.try_emplace(V, UniqueValues.size());  in createBuildVector()
7794         UniqueValues.emplace_back(V);  in createBuildVector()
7798     if (UniqueVals == 1 && UniqueValues.size() == 1) {  in createBuildVector()
7802     } else if (UniqueValues.size() >= VF - 1 || UniqueValues.size() <= 1) {  in createBuildVector()
7803       if (UniqueValues.empty()) {  in createBuildVector()
7808       UniqueValues.clear();  in createBuildVector()
7809       UniqueValues.append(VL.begin(), std::next(VL.begin(), NumValues));  in createBuildVector()
7811     UniqueValues.append(VF - UniqueValues.size(),  in createBuildVector()
7813     VL = UniqueValues;  in createBuildVector()