| H A D | SLPVectorizer.cpp | 1 //===- SLPVectorizer.cpp - A bottom up SLP Vectorizer -------- 388 const Value *Base = V; global() local 2301 TreeEntry *TE = nullptr; getVectorizedOperand() local 2859 const TreeEntry *TE = getTreeEntry(V); newTreeEntry() local 3160 TreeEntry *TE = nullptr; global() member 3326 if (TreeEntry *TE = BundleMember->TE) { schedule() local 3757 findReusedOrderedScalars(const BoUpSLP::TreeEntry & TE) findReusedOrderedScalars() argument 3948 __anon1d05f9c62102(auto &Base) clusterSortPtrAccesses() argument 3972 for (auto &Base : Bases) { clusterSortPtrAccesses() local 3991 for (auto &Base : Bases) { clusterSortPtrAccesses() local 4002 findPartiallyOrderedLoads(const BoUpSLP::TreeEntry & TE) findPartiallyOrderedLoads() argument 4074 getReorderingData(const TreeEntry & TE,bool TopToBottom) getReorderingData() argument 4279 reorderNodeWithReuses(TreeEntry & TE,ArrayRef<int> Mask) const reorderNodeWithReuses() argument 4331 __anon1d05f9c62e02( const std::unique_ptr<TreeEntry> &TE) reorderTopToBottom() argument 4577 if (TreeEntry *TE = getVectorizedOperand(UserTE, I)) { canReorderOperands() local 4601 __anon1d05f9c63602(TreeEntry *TE) canReorderOperands() argument 4630 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { reorderBottomToTop() local 4748 __anon1d05f9c63d02( const TreeEntry *TE) reorderBottomToTop() argument 4837 TreeEntry *TE = Op.second; reorderBottomToTop() local 5898 TreeEntry *TE = buildTree_rec() local 5978 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6000 TreeEntry *TE = nullptr; buildTree_rec() local 6055 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6074 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6123 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6151 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6217 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6224 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6238 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 6257 TreeEntry *TE = newTreeEntry(VL, Bundle /*vectorized*/, S, UserTreeIdx, buildTree_rec() local 7441 __anon1d05f9c66d02(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument 7706 if (const TreeEntry *TE = getTreeEntry(Op)) { getOperandEntry() local 7713 for (const TreeEntry *TE : MIt->second) { getOperandEntry() local 7722 __anon1d05f9c67702(const std::unique_ptr<TreeEntry> &TE) getOperandEntry() argument 8394 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) { getEntryCost() local 8493 __anon1d05f9c69102(const TreeEntry *TE, unsigned Limit) isFullyVectorizableTinyTree() argument 8622 __anon1d05f9c69402(const std::unique_ptr<TreeEntry> &TE) isTreeTinyAndNotFullyVectorizable() argument 8826 performExtractsShuffleAction(MutableArrayRef<std::pair<T *,SmallVector<int>>> ShuffleMask,Value * Base,function_ref<unsigned (T *)> GetVF,function_ref<std::pair<T *,bool> (T *,ArrayRef<int>,bool)> ResizeAction,function_ref<T * (ArrayRef<int>,ArrayRef<T * >)> Action) performExtractsShuffleAction() argument 8931 TreeEntry &TE = *VectorizableTree[I]; getTreeCost() local 9003 Value *Base = VU; getTreeCost() local 9102 __anon1d05f9c69b02(const TreeEntry *TE, ArrayRef<int> Mask, bool) getTreeCost() argument 9126 Value *Base = cast<Instruction>(FirstUsers[I].first)->getOperand(0); getTreeCost() local 9348 isGatherShuffledSingleRegisterEntry(const TreeEntry * TE,ArrayRef<Value * > VL,MutableArrayRef<int> Mask,SmallVectorImpl<const TreeEntry * > & Entries,unsigned Part) isGatherShuffledSingleRegisterEntry() argument 9540 for (const TreeEntry *TE : UsedTEs.front()) { isGatherShuffledSingleRegisterEntry() local 9556 for (const TreeEntry *TE : SecondEntries) { isGatherShuffledSingleRegisterEntry() local 9704 isGatherShuffledEntry(const TreeEntry * TE,ArrayRef<Value * > VL,SmallVectorImpl<int> & Mask,SmallVectorImpl<SmallVector<const TreeEntry * >> & Entries,unsigned NumParts) isGatherShuffledEntry() argument 10212 if (const TreeEntry *TE = R.getTreeEntry(VecBase)) adjustExtracts() local 10223 __anon1d05f9c6b502(const std::unique_ptr<TreeEntry> &TE) adjustExtracts() argument 10262 if (const TreeEntry *TE = R.getTreeEntry(VecOp)) adjustExtracts() local 10322 __anon1d05f9c6bb02(const TreeEntry *TE) needToDelay() argument 10521 __anon1d05f9c6bf02(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument 10531 __anon1d05f9c6c002(const TreeEntry *TE) vectorizeOperand() argument 10596 __anon1d05f9c6c302(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument 10612 __anon1d05f9c6c402(const std::unique_ptr<TreeEntry> &TE) vectorizeOperand() argument 10648 __anon1d05f9c6c702(const std::unique_ptr<TreeEntry> &TE) processBuildVector() argument 10695 if (const auto *TE = getTreeEntry( processBuildVector() local 10770 __anon1d05f9c6cc02(const TreeEntry *TE) processBuildVector() argument 10896 if (const auto *TE = getTreeEntry(VecOp)) processBuildVector() local 11184 if (const TreeEntry *TE = getTreeEntry(V)) vectorizeTree() local 11837 for (const std::unique_ptr<TreeEntry> &TE : VectorizableTree) vectorizeTree() local 11847 auto *TE = const_cast<TreeEntry *>(E); vectorizeTree() local 12063 Value *Base = VU; vectorizeTree() local 13302 auto *TE = getTreeEntry(Scalar); computeMinimumValueSizes() local [all...] |