26     const DominatorTree::UpdateType Update) const {  in isUpdateValid()
41   if (Kind == DominatorTree::Insert && !HasEdge)  in isUpdateValid()
45   if (Kind == DominatorTree::Delete && HasEdge)  in isUpdateValid()
52     const DominatorTree::UpdateType Update) const {  in isSelfDominance()
67     DT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E));  in applyDomTreeUpdates()
89     PDT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E));  in applyPostDomTreeUpdates()
230 void DomTreeUpdater::applyUpdates(ArrayRef<DominatorTree::UpdateType> Updates) {  in applyUpdates()
250     ArrayRef<DominatorTree::UpdateType> Updates) {  in applyUpdatesPermissive()
255   SmallVector<DominatorTree::UpdateType, 8> DeduplicatedUpdates;  in applyUpdatesPermissive()
303 DominatorTree &DomTreeUpdater::getDomTree() {  in getDomTree()
320   assert(isUpdateValid({DominatorTree::Insert, From, To}) &&  in insertEdge()
339   PendUpdates.push_back({DominatorTree::Insert, From, To});  in insertEdge()
349   if (!isUpdateValid({DominatorTree::Insert, From, To}))  in insertEdgeRelaxed()
360   PendUpdates.push_back({DominatorTree::Insert, From, To});  in insertEdgeRelaxed()
366   assert(isUpdateValid({DominatorTree::Delete, From, To}) &&  in deleteEdge()
385   PendUpdates.push_back({DominatorTree::Delete, From, To});  in deleteEdge()
395   if (!isUpdateValid({DominatorTree::Delete, From, To}))  in deleteEdgeRelaxed()
406   PendUpdates.push_back({DominatorTree::Delete, From, To});  in deleteEdgeRelaxed()
454       [&](ArrayRef<DominatorTree::UpdateType>::const_iterator begin,  in dump()
455           ArrayRef<DominatorTree::UpdateType>::const_iterator end) {  in dump()
463           if (U.getKind() == DominatorTree::Insert)  in dump()