Searched refs:VectorizableTree (Results 1 – 1 of 1) sorted by relevance
1201 return !VectorizableTree.empty() && in doesRootHaveInTreeUses()1202 !VectorizableTree.front()->UserTreeIndices.empty(); in doesRootHaveInTreeUses()1207 assert(!VectorizableTree.empty() && "No graph to get the first node from"); in getRootNodeScalars()1208 return VectorizableTree.front()->Scalars; in getRootNodeScalars()1214 return MinBWs.at(VectorizableTree.front().get()).second; in isSignedMinBitwidthRootNode()1229 VectorizableTree.clear(); in deleteTree()1251 unsigned getTreeSize() const { return VectorizableTree.size(); } in getTreeSize()3223 VectorizableTree.push_back(std::make_unique<TreeEntry>(VectorizableTree)); in newTreeEntry()3224 TreeEntry *Last = VectorizableTree.back().get(); in newTreeEntry()3225 Last->Idx = VectorizableTree.size() - 1; in newTreeEntry()[all …]