70   std::unique_ptr<DomTreeT> DT;  variable
88     if (!DT) DT.reset(new DomTreeT());  in getBase()
90     return *DT;  in getBase()
97     return DT->getRoot();  in getRoot()
102     return DT->getRootNode();  in getRootNode()
112     return DT->dominates(A, B);  in dominates()
117     return DT->dominates(A, B);  in dominates()
125     if (BBA != BBB) return DT->dominates(BBA, BBB);  in dominates()
138     return DT->properlyDominates(A, B);  in properlyDominates()
144     return DT->properlyDominates(A, B);  in properlyDominates()
152     return DT->findNearestCommonDominator(A, B);  in findNearestCommonDominator()
157     return DT->getNode(BB);
165     return DT->getNode(BB);  in getNode()
174     return DT->addNewBlock(BB, DomBB);  in addNewBlock()
183     DT->changeImmediateDominator(N, NewIDom);  in changeImmediateDominator()
189     DT->changeImmediateDominator(N, NewIDom);  in changeImmediateDominator()
197     DT->eraseNode(BB);  in eraseNode()
204     DT->splitBlock(NewBB);  in splitBlock()
211     return DT->isReachableFromEntry(A);  in isReachableFromEntry()
274   static NodeRef getEntryNode(MachineDominatorTree *DT) {
275     return DT->getRootNode();