Searched refs:UniqueValues (Results 1 – 2 of 2) sorted by relevance
112 SetVector<Value *> UniqueValues; in substituteOperandWithArgument() local114 UniqueValues.insert(Op->get()); in substituteOperandWithArgument()120 for (Value *V : UniqueValues) in substituteOperandWithArgument()147 for (auto Z : zip_first(UniqueValues, drop_begin(NewF->args(), ArgOffset))) { in substituteOperandWithArgument()
2045 SmallPtrSet<Value *, 4> UniqueValues; in reorder() local2048 UniqueValues.insert(Data.V); in reorder()2050 if (any_of(Op, [&UniqueValues](const OperandData &Data) { in reorder()2051 return !UniqueValues.contains(Data.V); in reorder()2057 return UniqueValues.size() != 2 && isPowerOf2_32(UniqueValues.size()); in reorder()4984 SmallVector<Value *> UniqueValues; in buildTree_rec() local4985 auto &&TryToFindDuplicates = [&VL, &ReuseShuffleIndicies, &UniqueValues, in buildTree_rec()4993 isa<UndefValue>(V) ? UndefMaskElem : UniqueValues.size()); in buildTree_rec()4994 UniqueValues.emplace_back(V); in buildTree_rec()4997 auto Res = UniquePositions.try_emplace(V, UniqueValues.size()); in buildTree_rec()[all …]