541     VectorizableTree.clear();  in deleteTree()
554   unsigned getTreeSize() const { return VectorizableTree.size(); }  in getTreeSize()
710     VectorizableTree.emplace_back(VectorizableTree);  in newTreeEntry()
711     int idx = VectorizableTree.size() - 1;  in newTreeEntry()
712     TreeEntry *Last = &VectorizableTree[idx];  in newTreeEntry()
734   std::vector<TreeEntry> VectorizableTree;  member in llvm::slpvectorizer::BoUpSLP
739       return &VectorizableTree[I->second];  in getTreeEntry()
1254     std::vector<TreeEntry> &VectorizableTree;  member
1258         : ChildIteratorType::iterator_adaptor_base(W), VectorizableTree(VT) {}  in ChildIteratorType()
1260     NodeRef operator*() { return &VectorizableTree[*I]; }  in operator *()
1263   static NodeRef getEntryNode(BoUpSLP &R) { return &R.VectorizableTree[0]; }  in getEntryNode()
1278     return nodes_iterator(R->VectorizableTree.begin());  in nodes_begin()
1282     return nodes_iterator(R->VectorizableTree.end());  in nodes_end()
1285   static unsigned size(BoUpSLP *R) { return R->VectorizableTree.size(); }  in size()
1337   for (TreeEntry &EIdx : VectorizableTree) {  in buildTree()
2419                     << VectorizableTree.size() << " is fully vectorizable .\n");  in isFullyVectorizableTinyTree()
2422   if (VectorizableTree.size() == 1 && !VectorizableTree[0].NeedToGather)  in isFullyVectorizableTinyTree()
2425   if (VectorizableTree.size() != 2)  in isFullyVectorizableTinyTree()
2429   if (!VectorizableTree[0].NeedToGather &&  in isFullyVectorizableTinyTree()
2430       (allConstant(VectorizableTree[1].Scalars) ||  in isFullyVectorizableTinyTree()
2431        isSplat(VectorizableTree[1].Scalars)))  in isFullyVectorizableTinyTree()
2435   if (VectorizableTree[0].NeedToGather || VectorizableTree[1].NeedToGather)  in isFullyVectorizableTinyTree()
2444   if (VectorizableTree.size() >= MinTreeSize)  in isTreeTinyAndNotFullyVectorizable()
2452   assert(VectorizableTree.empty()  in isTreeTinyAndNotFullyVectorizable()
2466   unsigned BundleWidth = VectorizableTree.front().Scalars.size();  in getSpillCost()
2472   for (const auto &N : VectorizableTree) {  in getSpillCost()
2529                     << VectorizableTree.size() << ".\n");  in getTreeCost()
2531   unsigned BundleWidth = VectorizableTree[0].Scalars.size();  in getTreeCost()
2533   for (unsigned I = 0, E = VectorizableTree.size(); I < E; ++I) {  in getTreeCost()
2534     TreeEntry &TE = VectorizableTree[I];  in getTreeCost()
2549         std::any_of(std::next(VectorizableTree.begin(), I + 1),  in getTreeCost()
2550                     VectorizableTree.end(), [TE](TreeEntry &Entry) {  in getTreeCost()
2579     auto *ScalarRoot = VectorizableTree[0].Scalars[0];  in getTreeCost()
3582   auto *VectorRoot = vectorizeTree(&VectorizableTree[0]);  in vectorizeTree()
3587   auto *ScalarRoot = VectorizableTree[0].Scalars[0];  in vectorizeTree()
3591     auto BundleWidth = VectorizableTree[0].Scalars.size();  in vectorizeTree()
3595     VectorizableTree[0].VectorizedValue = Trunc;  in vectorizeTree()
3691   for (TreeEntry &EIdx : VectorizableTree) {  in vectorizeTree()
3725   return VectorizableTree[0].VectorizedValue;  in vectorizeTree()
4394   auto &TreeRoot = VectorizableTree[0].Scalars;  in computeMinimumValueSizes()
4415   for (auto &Entry : VectorizableTree)  in computeMinimumValueSizes()