57                : RegionNode(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}  in Region()
85   assert(DT->getNode(BB) && "BB not part of the dominance tree");  in contains()
93   return (DT->dominates(entry, BB)  in contains()
94     && !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));  in contains()
143     if (DT->getNode(Pred) && !contains(Pred)) {  in getEnteringBlock()
372     if (!DT->dominates(getEntry(), *PI))  in getExpandedRegion()
379       return new Region(getEntry(), *succ_begin(exit), RI, DT);  in getExpandedRegion()
387   if (!DT->dominates(getEntry(), R->getExit()))  in getExpandedRegion()
390     if (!DT->dominates(R->getExit(), *PI))  in getExpandedRegion()
393   return new Region(getEntry(), R->getExit(), RI, DT);  in getExpandedRegion()
454     if (DT->dominates(entry, P) && !DT->dominates(exit, P))  in isCommonDomFrontier()
468   if (!DT->dominates(entry, exit)) {  in isRegion()
493     if (DT->properlyDominates(entry, *SI) && *SI != exit)  in isRegion()
552   Region *region = new Region(entry, exit, this, DT);  in createRegion()
595     if (!DT->dominates(entry, exit))  in findRegionsWithEntry()
607   DomTreeNode *N = DT->getNode(entry);  in scanForRegions()
673   buildRegionsTree(DT->getNode(BB), TopLevelRegion);  in Calculate()
679   DT = &getAnalysis<DominatorTree>();  in runOnFunction()
683   TopLevelRegion = new Region(&F.getEntryBlock(), 0, this, DT, 0);  in runOnFunction()
757     if (DT->dominates(Exit, BB))  in getMaxRegionExit()