Searched refs:isPostDominator (Results 1 – 11 of 11) sorted by relevance
50 bool isPostDominator() const { in isPostDominator() function51 return Base.isPostDominator(); in isPostDominator()
48 bool isPostDominator() const { in isPostDominator() function49 return Base.isPostDominator(); in isPostDominator()
314 bool isPostDominator() const { return IsPostDominator; }409 assert(!this->isPostDominator() &&478 if (!isPostDominator()) {509 return isPostDominator() && !A->getBlock();610 assert(!this->isPostDominator() &&
734 assert(NCDBlock || DT.isPostDominator()); in InsertReachable()978 assert(ToIDom || DT.isPostDominator()); in DeleteReachable()1079 assert(NCDBlock || DT.isPostDominator()); in DeleteUnreachable()1635 errs() << (DT.isPostDominator() ? "Post" : "") in IsSameAsFreshTree()1656 if (DT.isPostDominator()) std::swap(From, To); in InsertEdge()1663 if (DT.isPostDominator()) std::swap(From, To); in DeleteEdge()
62 bool isPostDominator() const { return IsPostDominators; } in isPostDominator() function428 assert(!this->isPostDominator() && in isReachableFromEntry()489 if (!this->isPostDominator()) { in findNearestCommonDominator()615 if (this->isPostDominator()) in print()
173 MultipleRoots |= (DT.isPostDominator() && N != GraphTraits<FuncT*>::size(&F)); in Calculate()
53 bool isPostDominator() const { return IsPostDominators; } in isPostDominator() function371 assert(!this->isPostDominator() && in isReachableFromEntry()433 if (!this->isPostDominator()) { in findNearestCommonDominator()552 if (this->isPostDominator()) in print()
52 bool isPostDominator() const { return IsPostDominators; } in isPostDominator() function
174 MultipleRoots |= (DT.isPostDominator() && N != F.size()); in Calculate()
63 bool isPostDominator() const { in isPostDominator() function
69 bool isPostDominator() const { in isPostDominator() function