Searched refs:ReorderIndices (Results 1 – 1 of 1) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 1266 /// - just return ReorderIndices, otherwise check if the scalars can be
2848 /// true and populates \p ReorderIndices with the shuffle indices of the
2851 OrdersType &ReorderIndices) const;
2869 inversePermutation(ReorderIndices, Mask); in getCommonMask()
2887 if (!ReorderIndices.empty()) { in isSame()
2892 inversePermutation(ReorderIndices, Mask); in isSame()
2967 SmallVector<unsigned, 4> ReorderIndices; member
3098 if (!ReorderIndices.empty()) in findLaneForValue()
3099 FoundLane = ReorderIndices[FoundLane]; in findLaneForValue()
3173 dbgs() << "ReorderIndices in dump()
3206 newTreeEntry(ArrayRef<Value * > VL,std::optional<ScheduleData * > Bundle,const InstructionsState & S,const EdgeInfo & UserTreeIdx,ArrayRef<int> ReuseShuffleIndices=std::nullopt,ArrayRef<unsigned> ReorderIndices=std::nullopt) newTreeEntry() argument
3219 newTreeEntry(ArrayRef<Value * > VL,TreeEntry::EntryState EntryState,std::optional<ScheduleData * > Bundle,const InstructionsState & S,const EdgeInfo & UserTreeIdx,ArrayRef<int> ReuseShuffleIndices=std::nullopt,ArrayRef<unsigned> ReorderIndices=std::nullopt) newTreeEntry() argument
6043 OrdersType ReorderIndices; findExternalStoreUsersReorderIndices() local
[all...] |