Searched refs:InsertMask (Results 1 – 4 of 4) sorted by relevance
227 SmallVector<int> InsertMask; in concatenate() local236 InsertMask.resize(NumElements); in concatenate()238 InsertMask[I] = I; in concatenate()262 InsertMask[I * VS.NumPacked + J] = NumElements + J; in concatenate()263 Res = Builder.CreateShuffleVector(Res, Fragment, InsertMask, in concatenate()266 InsertMask[I * VS.NumPacked + J] = I * VS.NumPacked + J; in concatenate()
273 bool detectOrAndInsertion(SDValue &Op, uint64_t InsertMask) const;733 uint64_t InsertMask) const { in detectOrAndInsertion()746 if (InsertMask & AndMask) in detectOrAndInsertion()752 if (Used != (AndMask | InsertMask)) { in detectOrAndInsertion()754 if (Used != (AndMask | InsertMask | Known.Zero.getZExtValue())) in detectOrAndInsertion()
8042 InsertMask[OffsetBeg] = 0; in getEntryCost()8049 InsertMask[Idx] = I + 1; in getEntryCost()11252 SmallVector<int> InsertMask(Mask); in vectorizeTree() local11262 InsertMask[*InsertIdx] = *InsertIdx; in vectorizeTree()11287 InsertMask[I] = NumScalars + Idx; in vectorizeTree()11291 InsertMask[I] = PoisonMaskElem; in vectorizeTree()11295 InsertMask = Mask; in vectorizeTree()11310 InsertMask[Offset + I] = I; in vectorizeTree()11325 InsertMask[I] = I + NumElts; in vectorizeTree()11342 if (InsertMask[I] == PoisonMaskElem) in vectorizeTree()[all …]
901 unsigned InsertMask = RKnown.Zero.getZExtValue(); in tryBitfieldInsert() local903 if ((TargetMask | InsertMask) == 0xFFFFFFFF) { in tryBitfieldInsert()908 InsertMask = ~InsertMask; in tryBitfieldInsert()919 std::swap(TargetMask, InsertMask); in tryBitfieldInsert()927 std::swap(TargetMask, InsertMask); in tryBitfieldInsert()932 if (isRunOfOnes(InsertMask, MB, ME)) { in tryBitfieldInsert()943 bool CanFoldMask = InsertMask == MKnown.One.getZExtValue(); in tryBitfieldInsert()