reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
33 this->Roots.push_back(MBB);
include/llvm/Support/GenericDomTree.h257 : Roots(std::move(Arg.Roots)), 267 Roots = std::move(RHS.Roots); 267 Roots = std::move(RHS.Roots); 284 const SmallVectorImpl<NodeT *> &getRoots() const { return Roots; } 295 if (Roots.size() != Other.Roots.size()) 295 if (Roots.size() != Other.Roots.size()) 298 if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin())) 298 if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin())) 298 if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin())) 439 assert(this->Roots.size() == 1 && "Should always have entry node!"); 440 return this->Roots[0]; 589 if (Roots.empty()) { 592 assert(Roots.size() == 1); 593 NodeT *OldRoot = Roots.front(); 598 Roots[0] = BB; 642 auto RIt = llvm::find(Roots, BB); 643 if (RIt != Roots.end()) { 644 std::swap(*RIt, Roots.back()); 645 Roots.pop_back(); 673 for (const NodePtr Block : Roots) { 758 void addRoot(NodeT *BB) { this->Roots.push_back(BB); } 762 Roots.clear();include/llvm/Support/GenericDomTreeConstruction.h
57 using RootsT = decltype(DomTreeT::Roots); 552 assert(DT.Roots.size() == 1 && "Dominators should have a singe root"); 553 runDFS(DT.Roots[0], 0, DC, 0); 559 for (const NodePtr Root : DT.Roots) Num = runDFS(Root, Num, DC, 0); 571 DT.Roots = FindRoots(DT, nullptr); 581 if (DT.Roots.empty()) return; 586 NodePtr Root = IsPostDom ? nullptr : DT.Roots[0]; 668 DT.Roots.push_back(From); 690 auto RIt = llvm::find(DT.Roots, To->getBlock()); 691 if (RIt == DT.Roots.end()) 719 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { 719 if (std::none_of(DT.Roots.begin(), DT.Roots.end(), [BUI](const NodePtr N) { 726 if (!isPermutation(DT.Roots, Roots)) { 1051 DT.Roots.push_back(ToTN->getBlock()); 1265 if (!DT.Parent && !DT.Roots.empty()) { 1272 if (DT.Roots.empty()) { 1286 if (!isPermutation(DT.Roots, ComputedRoots)) { 1289 for (const NodePtr N : DT.Roots) errs() << BlockNamePrinter(N) << ", ";