Searched refs:TreeEntry (Results 1 – 3 of 3) sorted by relevance
539 struct TreeEntry;675 const TreeEntry *PNode = VectorizableTree.back().get(); in findRootOrder()676 SmallVector<const TreeEntry *, 4> Nodes(1, PNode); in findRootOrder()677 SmallPtrSet<const TreeEntry *, 4> Visited; in findRootOrder()679 const TreeEntry *PNode = Nodes.pop_back_val(); in findRootOrder()682 const TreeEntry &Node = *PNode; in findRootOrder()782 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) in EdgeInfo()785 TreeEntry *UserTE = nullptr;984 if (const TreeEntry *UserTE = R.getTreeEntry(U)) { in getExternalUsesCost()1486 int getEntryCost(TreeEntry *E);[all …]
527 struct TreeEntry;677 EdgeInfo(TreeEntry *UserTE, unsigned EdgeIdx) in EdgeInfo()680 TreeEntry *UserTE = nullptr;879 if (const TreeEntry *UserTE = R.getTreeEntry(U)) { in getExternalUsesCost()1381 int getEntryCost(TreeEntry *E);1396 Value *vectorizeTree(TreeEntry *E);1412 void setInsertPointAfterBundle(TreeEntry *E);1429 struct TreeEntry { struct in llvm::slpvectorizer::BoUpSLP1430 using VecTreeTy = SmallVector<std::unique_ptr<TreeEntry>, 8>; argument1431 TreeEntry(VecTreeTy &Container) : Container(Container) {} in TreeEntry() function[all …]
392 struct TreeEntry;395 int getEntryCost(TreeEntry *E);405 Value *vectorizeTree(TreeEntry *E);444 struct TreeEntry { struct in llvm::slpvectorizer::BoUpSLP445 TreeEntry() : Scalars(), VectorizedValue(nullptr), in TreeEntry() function465 TreeEntry *newTreeEntry(ArrayRef<Value *> VL, bool Vectorized) { in newTreeEntry()468 TreeEntry *Last = &VectorizableTree[idx]; in newTreeEntry()484 std::vector<TreeEntry> VectorizableTree;920 for (TreeEntry &EIdx : VectorizableTree) { in buildTree()921 TreeEntry *Entry = &EIdx; in buildTree()[all …]