GenericDomTree.h

Go to the documentation of this file.

//===- GenericDomTree.h - Generic dominator trees for graphs ----*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
/// \file
///
/// This file defines a set of templates that efficiently compute a dominator
/// tree over a generic graph. This is used typically in LLVM for fast
/// dominance queries on the CFG, but is fully generic w.r.t. the underlying
/// graph types.
///
/// Unlike ADT/* graph algorithms, generic dominator tree has more requirements
/// on the graph's NodeRef. The NodeRef should be a pointer and,
/// either NodeRef->getParent() must return the parent node that is also a
/// pointer or DomTreeNodeTraits needs to be specialized.
///
/// FIXME: Maybe GenericDomTree needs a TreeTraits, instead of GraphTraits.
///
//===----------------------------------------------------------------------===//
 
#ifndef LLVM_SUPPORT_GENERICDOMTREE_H
#define LLVM_SUPPORT_GENERICDOMTREE_H
 
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/Support/Allocator.h"
#include "llvm/Support/CFGDiff.h"
#include "llvm/Support/CFGUpdate.h"
#include "llvm/Support/raw_ostream.h"
#include <algorithm>
#include <cassert>
#include <cstddef>
#include <memory>
#include <new>
#include <type_traits>
#include <utility>
 
namespace llvm {
 
template <typename NodeT, bool IsPostDom>
class DominatorTreeBase;
 
namespace DomTreeBuilder {
template <typename DomTreeT>
struct SemiNCAInfo;
}  // namespace DomTreeBuilder
 
/// Base class for the actual dominator tree node.
template <class NodeT> class DomTreeNodeBase {
  friend class PostDominatorTree;
  friend class DominatorTreeBase<NodeT, false>;
  friend class DominatorTreeBase<NodeT, true>;
  friend struct DomTreeBuilder::SemiNCAInfo<DominatorTreeBase<NodeT, false>>;
  friend struct DomTreeBuilder::SemiNCAInfo<DominatorTreeBase<NodeT, true>>;
 
  NodeT *TheBB;
  DomTreeNodeBase *IDom;
  unsigned Level;
  DomTreeNodeBase *FirstChild = nullptr;
  DomTreeNodeBase *Sibling = nullptr;
  DomTreeNodeBase **AppendPtr = &FirstChild;
  mutable unsigned DFSNumIn = ~0;
  mutable unsigned DFSNumOut = ~0;
 
 public:
  DomTreeNodeBase(NodeT *BB, DomTreeNodeBase *iDom)
      : TheBB(BB), IDom(iDom), Level(IDom ? IDom->Level + 1 : 0) {}
 
  DomTreeNodeBase(const DomTreeNodeBase &) = delete;
  DomTreeNodeBase &operator=(const DomTreeNodeBase &) = delete;
 
  class const_iterator
      : public iterator_facade_base<const_iterator, std::forward_iterator_tag,
                                    DomTreeNodeBase *> {
    DomTreeNodeBase *Node;
 
  public:
    const_iterator(DomTreeNodeBase *Node = nullptr) : Node(Node) {}
    bool operator==(const const_iterator &Other) const {
      return Other.Node == Node;
    }
    DomTreeNodeBase *operator*() const { return Node; }
    const_iterator &operator++() {
      Node = Node->Sibling;
      return *this;
    }
    const_iterator operator++(int) {
      const_iterator cp = *this;
      ++*this;
      return cp;
    }
  };
  // We don't permit modifications through the iterator.
  using iterator = const_iterator;
 
  iterator begin() const { return iterator{FirstChild}; }
  iterator end() const { return iterator{}; }
 
  iterator_range<iterator> children() { return make_range(begin(), end()); }
  iterator_range<const_iterator> children() const {
    return make_range(begin(), end());
  }
 
  NodeT *getBlock() const { return TheBB; }
  DomTreeNodeBase *getIDom() const { return IDom; }
  unsigned getLevel() const { return Level; }
 
  // TODO: make these private once NewGVN doesn't require these anymore.
  void addChild(DomTreeNodeBase *C) {
    assert(!C->Sibling && "cannot add child that already has siblings");
    assert(!*AppendPtr && "sibling of last child must be nullptr");
    *AppendPtr = C;
    AppendPtr = &C->Sibling;
  }
 
  // TODO: make these private once NewGVN doesn't require these anymore.
  void removeChild(DomTreeNodeBase *C) {
    DomTreeNodeBase **It = &FirstChild;
    while (*It != C) {
      assert(*It != nullptr && "Not in immediate dominator children list!");
      It = &(*It)->Sibling;
    }
    assert(!*AppendPtr && "sibling of last child must be nullptr");
    assert(C->Sibling || AppendPtr == &C->Sibling);
    *It = C->Sibling;
    if (C->Sibling)
      C->Sibling = nullptr;
    else
      AppendPtr = It;
  }
 
  bool isLeaf() const { return FirstChild == nullptr; }
 
  bool compare(const DomTreeNodeBase *Other) const {
    if (Level != Other->Level) return true;
 
    SmallPtrSet<const NodeT *, 4> OtherChildren;
    for (const DomTreeNodeBase *I : *Other) {
      const NodeT *Nd = I->getBlock();
      OtherChildren.insert(Nd);
    }
 
    size_t OwnCount = 0;
    for (const DomTreeNodeBase *I : *this) {
      const NodeT *N = I->getBlock();
      if (OtherChildren.count(N) == 0)
        return true;
      ++OwnCount;
    }
    return OwnCount != OtherChildren.size();
  }
 
  void setIDom(DomTreeNodeBase *NewIDom) {
    assert(IDom && "No immediate dominator?");
    if (IDom == NewIDom) return;
    IDom->removeChild(this);
 
    // Switch to new dominator
    IDom = NewIDom;
    IDom->addChild(this);
 
    UpdateLevel();
  }
 
  /// getDFSNumIn/getDFSNumOut - These return the DFS visitation order for nodes
  /// in the dominator tree. They are only guaranteed valid if
  /// updateDFSNumbers() has been called.
  unsigned getDFSNumIn() const { return DFSNumIn; }
  unsigned getDFSNumOut() const { return DFSNumOut; }
 
private:
  // Return true if this node is dominated by other. Use this only if DFS info
  // is valid.
  bool DominatedBy(const DomTreeNodeBase *other) const {
    return this->DFSNumIn >= other->DFSNumIn &&
           this->DFSNumOut <= other->DFSNumOut;
  }
 
  void UpdateLevel() {
    assert(IDom);
    if (Level == IDom->Level + 1) return;
 
    SmallVector<DomTreeNodeBase *, 64> WorkStack = {this};
 
    while (!WorkStack.empty()) {
      DomTreeNodeBase *Current = WorkStack.pop_back_val();
      Current->Level = Current->IDom->Level + 1;
 
      for (DomTreeNodeBase *C : *Current) {
        assert(C->IDom);
        if (C->Level != C->IDom->Level + 1) WorkStack.push_back(C);
      }
    }
  }
};
 
template <class NodeT>
raw_ostream &operator<<(raw_ostream &O, const DomTreeNodeBase<NodeT> *Node) {
  if (Node->getBlock())
    Node->getBlock()->printAsOperand(O, false);
  else
    O << " <<exit node>>";
 
  O << " {" << Node->getDFSNumIn() << "," << Node->getDFSNumOut() << "} ["
    << Node->getLevel() << "]\n";
 
  return O;
}
 
template <class NodeT>
void PrintDomTree(const DomTreeNodeBase<NodeT> *N, raw_ostream &O,
                  unsigned Lev) {
  O.indent(2 * Lev) << "[" << Lev << "] " << N;
  for (const auto &I : *N)
    PrintDomTree<NodeT>(I, O, Lev + 1);
}
 
namespace DomTreeBuilder {
// The routines below are provided in a separate header but referenced here.
template <typename DomTreeT>
void Calculate(DomTreeT &DT);
 
template <typename DomTreeT>
void CalculateWithUpdates(DomTreeT &DT,
                          ArrayRef<typename DomTreeT::UpdateType> Updates);
 
template <typename DomTreeT>
void InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
                typename DomTreeT::NodePtr To);
 
template <typename DomTreeT>
void DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From,
                typename DomTreeT::NodePtr To);
 
template <typename DomTreeT>
void ApplyUpdates(DomTreeT &DT,
                  GraphDiff<typename DomTreeT::NodePtr,
                            DomTreeT::IsPostDominator> &PreViewCFG,
                  GraphDiff<typename DomTreeT::NodePtr,
                            DomTreeT::IsPostDominator> *PostViewCFG);
 
template <typename DomTreeT>
bool Verify(const DomTreeT &DT, typename DomTreeT::VerificationLevel VL);
}  // namespace DomTreeBuilder
 
/// Default DomTreeNode traits for NodeT. The default implementation assume a
/// Function-like NodeT. Can be specialized to support different node types.
template <typename NodeT> struct DomTreeNodeTraits {
  using NodeType = NodeT;
  using NodePtr = NodeT *;
  using ParentPtr = decltype(std::declval<NodePtr>()->getParent());
  static_assert(std::is_pointer_v<ParentPtr>,
                "Currently NodeT's parent must be a pointer type");
  using ParentType = std::remove_pointer_t<ParentPtr>;
 
  static NodeT *getEntryNode(ParentPtr Parent) { return &Parent->front(); }
  static ParentPtr getParent(NodePtr BB) { return BB->getParent(); }
};
 
/// Core dominator tree base class.
///
/// This class is a generic template over graph nodes. It is instantiated for
/// various graphs in the LLVM IR or in the code generator.
template <typename NodeT, bool IsPostDom>
class DominatorTreeBase {
 public:
  static_assert(std::is_pointer_v<typename GraphTraits<NodeT *>::NodeRef>,
                "Currently DominatorTreeBase supports only pointer nodes");
  using NodeTrait = DomTreeNodeTraits<NodeT>;
  using NodeType = typename NodeTrait::NodeType;
  using NodePtr = typename NodeTrait::NodePtr;
  using ParentPtr = typename NodeTrait::ParentPtr;
  static_assert(std::is_pointer_v<ParentPtr>,
                "Currently NodeT's parent must be a pointer type");
  using ParentType = std::remove_pointer_t<ParentPtr>;
  static constexpr bool IsPostDominator = IsPostDom;
 
  using UpdateType = cfg::Update<NodePtr>;
  using UpdateKind = cfg::UpdateKind;
  static constexpr UpdateKind Insert = UpdateKind::Insert;
  static constexpr UpdateKind Delete = UpdateKind::Delete;
 
  enum class VerificationLevel { Fast, Basic, Full };
 
protected:
  // Dominators always have a single root, postdominators can have more.
  SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
 
  using DomTreeNodeStorageTy = SmallVector<DomTreeNodeBase<NodeT> *>;
  DomTreeNodeStorageTy DomTreeNodes;
  // For graphs where blocks don't have numbers, create a numbering here.
  // TODO: use an empty struct with [[no_unique_address]] in C++20.
  std::conditional_t<!GraphHasNodeNumbers<NodeT *>,
                     DenseMap<const NodeT *, unsigned>, std::tuple<>>
      NodeNumberMap;
  DomTreeNodeBase<NodeT> *RootNode = nullptr;
  ParentPtr Parent = nullptr;
 
  // Use small slab size to reduce memory waste for modules with many small
  // functions. Compensate with a short GrowthDelay. This is relevant for
  // ThinLTO on modules with many functions (not uncommon in C++), where all
  // dominator trees are live at the same time.
  static constexpr size_t SlabSize = 8 * sizeof(DomTreeNodeBase<NodeT>);
  BumpPtrAllocatorImpl<MallocAllocator, SlabSize, /*SizeThreshold=*/SlabSize,
                       /*GrowthDelay=*/2>
      NodeAllocator;
 
  mutable bool DFSInfoValid = false;
  mutable unsigned int SlowQueries = 0;
  unsigned BlockNumberEpoch = 0;
 
  friend struct DomTreeBuilder::SemiNCAInfo<DominatorTreeBase>;
 
 public:
  DominatorTreeBase() = default;
 
  DominatorTreeBase(const DominatorTreeBase &) = delete;
  DominatorTreeBase &operator=(const DominatorTreeBase &) = delete;
 
  DominatorTreeBase(DominatorTreeBase &&Arg) = default;
  DominatorTreeBase &operator=(DominatorTreeBase &&RHS) = default;
 
  /// Iteration over roots.
  ///
  /// This may include multiple blocks if we are computing post dominators.
  /// For forward dominators, this will always be a single block (the entry
  /// block).
  using root_iterator = typename SmallVectorImpl<NodeT *>::iterator;
  using const_root_iterator = typename SmallVectorImpl<NodeT *>::const_iterator;
 
  root_iterator root_begin() { return Roots.begin(); }
  const_root_iterator root_begin() const { return Roots.begin(); }
  root_iterator root_end() { return Roots.end(); }
  const_root_iterator root_end() const { return Roots.end(); }
 
  size_t root_size() const { return Roots.size(); }
 
  iterator_range<root_iterator> roots() {
    return make_range(root_begin(), root_end());
  }
  iterator_range<const_root_iterator> roots() const {
    return make_range(root_begin(), root_end());
  }
 
  /// isPostDominator - Returns true if analysis based of postdoms
  ///
  bool isPostDominator() const { return IsPostDominator; }
 
  /// compare - Return false if the other dominator tree base matches this
  /// dominator tree base. Otherwise return true.
  bool compare(const DominatorTreeBase &Other) const {
    if (Parent != Other.Parent) return true;
 
    if (Roots.size() != Other.Roots.size())
      return true;
 
    if (!std::is_permutation(Roots.begin(), Roots.end(), Other.Roots.begin()))
      return true;
 
    size_t NumNodes = 0;
    // All nodes we have must exist and be equal in the other tree.
    for (const auto &Node : DomTreeNodes) {
      if (!Node)
        continue;
      if (Node->compare(Other.getNode(Node->getBlock())))
        return true;
      NumNodes++;
    }
 
    // If the other tree has more nodes than we have, they're not equal.
    size_t NumOtherNodes = 0;
    for (const auto &OtherNode : Other.DomTreeNodes)
      if (OtherNode)
        NumOtherNodes++;
    return NumNodes != NumOtherNodes;
  }
 
private:
  std::optional<unsigned> getNodeIndex(const NodeT *BB) const {
    if constexpr (GraphHasNodeNumbers<NodeT *>) {
      assert(BlockNumberEpoch ==
                 GraphTraits<ParentPtr>::getNumberEpoch(Parent) &&
             "dominator tree used with outdated block numbers");
      if constexpr (IsPostDom) {
        if (!BB)
          return 0; // BB may be nullptr for post-dominator tree, map to 0.
      } else
        assert(BB && "dominator tree block must be non-null");
      return GraphTraits<const NodeT *>::getNumber(BB) + 1;
    } else {
      if (auto It = NodeNumberMap.find(BB); It != NodeNumberMap.end())
        return It->second;
      return std::nullopt;
    }
  }
 
  unsigned getNodeIndexForInsert(const NodeT *BB) {
    if constexpr (GraphHasNodeNumbers<NodeT *>) {
      // getNodeIndex will never fail if nodes have getNumber().
      unsigned Idx = *getNodeIndex(BB);
      if (Idx >= DomTreeNodes.size()) {
        unsigned Max = GraphTraits<ParentPtr>::getMaxNumber(Parent);
        DomTreeNodes.resize(Max > Idx + 1 ? Max : Idx + 1);
      }
      return Idx;
    } else {
      // We might already have a number stored for BB.
      unsigned Idx =
          NodeNumberMap.try_emplace(BB, DomTreeNodes.size()).first->second;
      if (Idx >= DomTreeNodes.size())
        DomTreeNodes.resize(Idx + 1);
      return Idx;
    }
  }
 
public:
  /// getNode - return the (Post)DominatorTree node for the specified basic
  /// block.  This is the same as using operator[] on this class.  The result
  /// may (but is not required to) be null for a forward (backwards)
  /// statically unreachable block.
  DomTreeNodeBase<NodeT> *getNode(const NodeT *BB) const {
    assert((!BB || Parent == NodeTrait::getParent(const_cast<NodeT *>(BB))) &&
           "cannot get DomTreeNode of block with different parent");
    if (auto Idx = getNodeIndex(BB); Idx && *Idx < DomTreeNodes.size())
      return DomTreeNodes[*Idx];
    return nullptr;
  }
 
  /// See getNode.
  DomTreeNodeBase<NodeT> *operator[](const NodeT *BB) const {
    return getNode(BB);
  }
 
  /// getRootNode - This returns the entry node for the CFG of the function.  If
  /// this tree represents the post-dominance relations for a function, however,
  /// this root may be a node with the block == NULL.  This is the case when
  /// there are multiple exit nodes from a particular function.  Consumers of
  /// post-dominance information must be capable of dealing with this
  /// possibility.
  ///
  DomTreeNodeBase<NodeT> *getRootNode() { return RootNode; }
  const DomTreeNodeBase<NodeT> *getRootNode() const { return RootNode; }
 
  /// Get all nodes dominated by R, including R itself.
  void getDescendants(NodeT *R, SmallVectorImpl<NodeT *> &Result) const {
    Result.clear();
    const DomTreeNodeBase<NodeT> *RN = getNode(R);
    if (!RN)
      return; // If R is unreachable, it will not be present in the DOM tree.
    SmallVector<const DomTreeNodeBase<NodeT> *, 8> WL;
    WL.push_back(RN);
 
    while (!WL.empty()) {
      const DomTreeNodeBase<NodeT> *N = WL.pop_back_val();
      Result.push_back(N->getBlock());
      WL.append(N->begin(), N->end());
    }
  }
 
  /// properlyDominates - Returns true iff A dominates B and A != B.
  /// Note that this is not a constant time operation!
  ///
  bool properlyDominates(const DomTreeNodeBase<NodeT> *A,
                         const DomTreeNodeBase<NodeT> *B) const {
    if (!A || !B)
      return false;
    if (A == B)
      return false;
    return dominates(A, B);
  }
 
  bool properlyDominates(const NodeT *A, const NodeT *B) const;
 
  /// isReachableFromEntry - Return true if A is dominated by the entry
  /// block of the function containing it.
  bool isReachableFromEntry(const NodeT *A) const {
    assert(!this->isPostDominator() &&
           "This is not implemented for post dominators");
    return isReachableFromEntry(getNode(A));
  }
 
  bool isReachableFromEntry(const DomTreeNodeBase<NodeT> *A) const { return A; }
 
  /// dominates - Returns true iff A dominates B.  Note that this is not a
  /// constant time operation!
  ///
  bool dominates(const DomTreeNodeBase<NodeT> *A,
                 const DomTreeNodeBase<NodeT> *B) const {
    // A node trivially dominates itself.
    if (B == A)
      return true;
 
    // An unreachable node is dominated by anything.
    if (!isReachableFromEntry(B))
      return true;
 
    // And dominates nothing.
    if (!isReachableFromEntry(A))
      return false;
 
    if (B->getIDom() == A) return true;
 
    if (A->getIDom() == B) return false;
 
    // A can only dominate B if it is higher in the tree.
    if (A->getLevel() >= B->getLevel()) return false;
 
    // Compare the result of the tree walk and the dfs numbers, if expensive
    // checks are enabled.
#ifdef EXPENSIVE_CHECKS
    assert((!DFSInfoValid ||
            (dominatedBySlowTreeWalk(A, B) == B->DominatedBy(A))) &&
           "Tree walk disagrees with dfs numbers!");
#endif
 
    if (DFSInfoValid)
      return B->DominatedBy(A);
 
    // If we end up with too many slow queries, just update the
    // DFS numbers on the theory that we are going to keep querying.
    SlowQueries++;
    if (SlowQueries > 32) {
      updateDFSNumbers();
      return B->DominatedBy(A);
    }
 
    return dominatedBySlowTreeWalk(A, B);
  }
 
  bool dominates(const NodeT *A, const NodeT *B) const;
 
  NodeT *getRoot() const {
    assert(this->Roots.size() == 1 && "Should always have entry node!");
    return this->Roots[0];
  }
 
  /// Find nearest common dominator basic block for basic block A and B. A and B
  /// must have tree nodes.
  NodeT *findNearestCommonDominator(NodeT *A, NodeT *B) const {
    assert(A && B && "Pointers are not valid");
    assert(NodeTrait::getParent(A) == NodeTrait::getParent(B) &&
           "Two blocks are not in same function");
 
    // If either A or B is a entry block then it is nearest common dominator
    // (for forward-dominators).
    if (!isPostDominator()) {
      NodeT &Entry =
          *DomTreeNodeTraits<NodeT>::getEntryNode(NodeTrait::getParent(A));
      if (A == &Entry || B == &Entry)
        return &Entry;
    }
 
    DomTreeNodeBase<NodeT> *NodeA = getNode(A);
    DomTreeNodeBase<NodeT> *NodeB = getNode(B);
    assert(NodeA && "A must be in the tree");
    assert(NodeB && "B must be in the tree");
 
    // Use level information to go up the tree until the levels match. Then
    // continue going up til we arrive at the same node.
    while (NodeA != NodeB) {
      if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
 
      NodeA = NodeA->IDom;
    }
 
    return NodeA->getBlock();
  }
 
  const NodeT *findNearestCommonDominator(const NodeT *A,
                                          const NodeT *B) const {
    // Cast away the const qualifiers here. This is ok since
    // const is re-introduced on the return type.
    return findNearestCommonDominator(const_cast<NodeT *>(A),
                                      const_cast<NodeT *>(B));
  }
 
  bool isVirtualRoot(const DomTreeNodeBase<NodeT> *A) const {
    return isPostDominator() && !A->getBlock();
  }
 
  template <typename IteratorTy>
  NodeT *findNearestCommonDominator(iterator_range<IteratorTy> Nodes) const {
    assert(!Nodes.empty() && "Nodes list is empty!");
 
    NodeT *NCD = *Nodes.begin();
    for (NodeT *Node : llvm::drop_begin(Nodes)) {
      NCD = findNearestCommonDominator(NCD, Node);
 
      // Stop when the root is reached.
      if (isVirtualRoot(getNode(NCD)))
        return nullptr;
    }
 
    return NCD;
  }
 
  //===--------------------------------------------------------------------===//
  // API to update (Post)DominatorTree information based on modifications to
  // the CFG...
 
  /// Inform the dominator tree about a sequence of CFG edge insertions and
  /// deletions and perform a batch update on the tree.
  ///
  /// This function should be used when there were multiple CFG updates after
  /// the last dominator tree update. It takes care of performing the updates
  /// in sync with the CFG and optimizes away the redundant operations that
  /// cancel each other.
  /// The functions expects the sequence of updates to be balanced. Eg.:
  ///  - {{Insert, A, B}, {Delete, A, B}, {Insert, A, B}} is fine, because
  ///    logically it results in a single insertions.
  ///  - {{Insert, A, B}, {Insert, A, B}} is invalid, because it doesn't make
  ///    sense to insert the same edge twice.
  ///
  /// What's more, the functions assumes that it's safe to ask every node in the
  /// CFG about its children and inverse children. This implies that deletions
  /// of CFG edges must not delete the CFG nodes before calling this function.
  ///
  /// The applyUpdates function can reorder the updates and remove redundant
  /// ones internally (as long as it is done in a deterministic fashion). The
  /// batch updater is also able to detect sequences of zero and exactly one
  /// update -- it's optimized to do less work in these cases.
  ///
  /// Note that for postdominators it automatically takes care of applying
  /// updates on reverse edges internally (so there's no need to swap the
  /// From and To pointers when constructing DominatorTree::UpdateType).
  /// The type of updates is the same for DomTreeBase<T> and PostDomTreeBase<T>
  /// with the same template parameter T.
  ///
  /// \param Updates An ordered sequence of updates to perform. The current CFG
  /// and the reverse of these updates provides the pre-view of the CFG.
  ///
  void applyUpdates(ArrayRef<UpdateType> Updates) {
    GraphDiff<NodePtr, IsPostDominator> PreViewCFG(
        Updates, /*ReverseApplyUpdates=*/true);
    DomTreeBuilder::ApplyUpdates(*this, PreViewCFG, nullptr);
  }
 
  /// \param Updates An ordered sequence of updates to perform. The current CFG
  /// and the reverse of these updates provides the pre-view of the CFG.
  /// \param PostViewUpdates An ordered sequence of update to perform in order
  /// to obtain a post-view of the CFG. The DT will be updated assuming the
  /// obtained PostViewCFG is the desired end state.
  void applyUpdates(ArrayRef<UpdateType> Updates,
                    ArrayRef<UpdateType> PostViewUpdates) {
    if (Updates.empty()) {
      GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates);
      DomTreeBuilder::ApplyUpdates(*this, PostViewCFG, &PostViewCFG);
    } else {
      // PreViewCFG needs to merge Updates and PostViewCFG. The updates in
      // Updates need to be reversed, and match the direction in PostViewCFG.
      // The PostViewCFG is created with updates reversed (equivalent to changes
      // made to the CFG), so the PreViewCFG needs all the updates reverse
      // applied.
      SmallVector<UpdateType> AllUpdates(Updates);
      append_range(AllUpdates, PostViewUpdates);
      GraphDiff<NodePtr, IsPostDom> PreViewCFG(AllUpdates,
                                               /*ReverseApplyUpdates=*/true);
      GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates);
      DomTreeBuilder::ApplyUpdates(*this, PreViewCFG, &PostViewCFG);
    }
  }
 
  /// Inform the dominator tree about a CFG edge insertion and update the tree.
  ///
  /// This function has to be called just before or just after making the update
  /// on the actual CFG. There cannot be any other updates that the dominator
  /// tree doesn't know about.
  ///
  /// Note that for postdominators it automatically takes care of inserting
  /// a reverse edge internally (so there's no need to swap the parameters).
  ///
  void insertEdge(NodeT *From, NodeT *To) {
    assert(From);
    assert(To);
    assert(NodeTrait::getParent(From) == Parent);
    assert(NodeTrait::getParent(To) == Parent);
    DomTreeBuilder::InsertEdge(*this, From, To);
  }
 
  /// Inform the dominator tree about a CFG edge deletion and update the tree.
  ///
  /// This function has to be called just after making the update on the actual
  /// CFG. An internal functions checks if the edge doesn't exist in the CFG in
  /// DEBUG mode. There cannot be any other updates that the
  /// dominator tree doesn't know about.
  ///
  /// Note that for postdominators it automatically takes care of deleting
  /// a reverse edge internally (so there's no need to swap the parameters).
  ///
  void deleteEdge(NodeT *From, NodeT *To) {
    assert(From);
    assert(To);
    assert(NodeTrait::getParent(From) == Parent);
    assert(NodeTrait::getParent(To) == Parent);
    DomTreeBuilder::DeleteEdge(*this, From, To);
  }
 
  /// Add a new node to the dominator tree information.
  ///
  /// This creates a new node as a child of DomBB dominator node, linking it
  /// into the children list of the immediate dominator.
  ///
  /// \param BB New node in CFG.
  /// \param DomBB CFG node that is dominator for BB.
  /// \returns New dominator tree node that represents new CFG node.
  ///
  DomTreeNodeBase<NodeT> *addNewBlock(NodeT *BB, NodeT *DomBB) {
    assert(getNode(BB) == nullptr && "Block already in dominator tree!");
    DomTreeNodeBase<NodeT> *IDomNode = getNode(DomBB);
    assert(IDomNode && "Not immediate dominator specified for block!");
    DFSInfoValid = false;
    return createNode(BB, IDomNode);
  }
 
  /// Add a new node to the forward dominator tree and make it a new root.
  ///
  /// \param BB New node in CFG.
  /// \returns New dominator tree node that represents new CFG node.
  ///
  DomTreeNodeBase<NodeT> *setNewRoot(NodeT *BB) {
    assert(getNode(BB) == nullptr && "Block already in dominator tree!");
    assert(!this->isPostDominator() &&
           "Cannot change root of post-dominator tree");
    DFSInfoValid = false;
    DomTreeNodeBase<NodeT> *NewNode = createNode(BB);
    if (Roots.empty()) {
      addRoot(BB);
    } else {
      assert(Roots.size() == 1);
      NodeT *OldRoot = Roots.front();
      DomTreeNodeBase<NodeT> *OldNode = getNode(OldRoot);
      NewNode->addChild(OldNode);
      OldNode->IDom = NewNode;
      OldNode->UpdateLevel();
      Roots[0] = BB;
    }
    return RootNode = NewNode;
  }
 
  /// changeImmediateDominator - This method is used to update the dominator
  /// tree information when a node's immediate dominator changes.
  ///
  void changeImmediateDominator(DomTreeNodeBase<NodeT> *N,
                                DomTreeNodeBase<NodeT> *NewIDom) {
    assert(N && NewIDom && "Cannot change null node pointers!");
    DFSInfoValid = false;
    N->setIDom(NewIDom);
  }
 
  void changeImmediateDominator(NodeT *BB, NodeT *NewBB) {
    changeImmediateDominator(getNode(BB), getNode(NewBB));
  }
 
  /// eraseNode - Removes a node from the dominator tree. Block must not
  /// dominate any other blocks. Removes node from its immediate dominator's
  /// children list. Deletes dominator node associated with basic block BB.
  void eraseNode(NodeT *BB) {
    std::optional<unsigned> IdxOpt = getNodeIndex(BB);
    assert(IdxOpt && DomTreeNodes[*IdxOpt] &&
           "Removing node that isn't in dominator tree.");
    DomTreeNodeBase<NodeT> *Node = DomTreeNodes[*IdxOpt];
    assert(Node->isLeaf() && "Node is not a leaf node.");
 
    DFSInfoValid = false;
 
    // Remove node from immediate dominator's children list.
    if (DomTreeNodeBase<NodeT> *IDom = Node->getIDom())
      IDom->removeChild(Node);
 
    DomTreeNodes[*IdxOpt] = nullptr;
    if constexpr (!GraphHasNodeNumbers<NodeT *>)
      NodeNumberMap.erase(BB);
 
    if (!IsPostDom) return;
 
    // Remember to update PostDominatorTree roots.
    auto RIt = llvm::find(Roots, BB);
    if (RIt != Roots.end()) {
      std::swap(*RIt, Roots.back());
      Roots.pop_back();
    }
  }
 
  /// splitBlock - BB is split and now it has one successor. Update dominator
  /// tree to reflect this change.
  void splitBlock(NodeT *NewBB) {
    if (IsPostDominator)
      Split<Inverse<NodeT *>>(NewBB);
    else
      Split<NodeT *>(NewBB);
  }
 
  /// print - Convert to human readable form
  ///
  void print(raw_ostream &O) const {
    O << "=============================--------------------------------\n";
    if (IsPostDominator)
      O << "Inorder PostDominator Tree: ";
    else
      O << "Inorder Dominator Tree: ";
    if (!DFSInfoValid)
      O << "DFSNumbers invalid: " << SlowQueries << " slow queries.";
    O << "\n";
 
    // The postdom tree can have a null root if there are no returns.
    if (getRootNode()) PrintDomTree<NodeT>(getRootNode(), O, 1);
    O << "Roots: ";
    for (const NodePtr Block : Roots) {
      Block->printAsOperand(O, false);
      O << " ";
    }
    O << "\n";
  }
 
public:
  /// updateDFSNumbers - Assign In and Out numbers to the nodes while walking
  /// dominator tree in dfs order.
  void updateDFSNumbers() const {
    if (DFSInfoValid) {
      SlowQueries = 0;
      return;
    }
 
    SmallVector<std::pair<const DomTreeNodeBase<NodeT> *,
                          typename DomTreeNodeBase<NodeT>::const_iterator>,
                32> WorkStack;
 
    const DomTreeNodeBase<NodeT> *ThisRoot = getRootNode();
    assert((!Parent || ThisRoot) && "Empty constructed DomTree");
    if (!ThisRoot)
      return;
 
    // Both dominators and postdominators have a single root node. In the case
    // case of PostDominatorTree, this node is a virtual root.
    WorkStack.push_back({ThisRoot, ThisRoot->begin()});
 
    unsigned DFSNum = 0;
    ThisRoot->DFSNumIn = DFSNum++;
 
    while (!WorkStack.empty()) {
      const DomTreeNodeBase<NodeT> *Node = WorkStack.back().first;
      const auto ChildIt = WorkStack.back().second;
 
      // If we visited all of the children of this node, "recurse" back up the
      // stack setting the DFOutNum.
      if (ChildIt == Node->end()) {
        Node->DFSNumOut = DFSNum++;
        WorkStack.pop_back();
      } else {
        // Otherwise, recursively visit this child.
        const DomTreeNodeBase<NodeT> *Child = *ChildIt;
        ++WorkStack.back().second;
 
        WorkStack.push_back({Child, Child->begin()});
        Child->DFSNumIn = DFSNum++;
      }
    }
 
    SlowQueries = 0;
    DFSInfoValid = true;
  }
 
private:
  void updateBlockNumberEpoch() {
    // Nothing to do for graphs that don't number their blocks.
    if constexpr (GraphHasNodeNumbers<NodeT *>)
      BlockNumberEpoch = GraphTraits<ParentPtr>::getNumberEpoch(Parent);
  }
 
public:
  /// recalculate - compute a dominator tree for the given function
  void recalculate(ParentType &Func) {
    Parent = &Func;
    updateBlockNumberEpoch();
    DomTreeBuilder::Calculate(*this);
  }
 
  void recalculate(ParentType &Func, ArrayRef<UpdateType> Updates) {
    Parent = &Func;
    updateBlockNumberEpoch();
    DomTreeBuilder::CalculateWithUpdates(*this, Updates);
  }
 
  /// Update dominator tree after renumbering blocks.
  template <typename T = NodeT>
  std::enable_if_t<GraphHasNodeNumbers<T *>, void> updateBlockNumbers() {
    updateBlockNumberEpoch();
 
    unsigned MaxNumber = GraphTraits<ParentPtr>::getMaxNumber(Parent);
    DomTreeNodeStorageTy NewVector;
    NewVector.resize(MaxNumber + 1); // +1, because index 0 is for nullptr
    for (auto &Node : DomTreeNodes) {
      if (!Node)
        continue;
      unsigned Idx = *getNodeIndex(Node->getBlock());
      // getMaxNumber is not necessarily supported
      if (Idx >= NewVector.size())
        NewVector.resize(Idx + 1);
      NewVector[Idx] = std::move(Node);
    }
    DomTreeNodes = std::move(NewVector);
  }
 
  /// verify - checks if the tree is correct. There are 3 level of verification:
  ///  - Full --  verifies if the tree is correct by making sure all the
  ///             properties (including the parent and the sibling property)
  ///             hold.
  ///             Takes O(N^3) time.
  ///
  ///  - Basic -- checks if the tree is correct, but compares it to a freshly
  ///             constructed tree instead of checking the sibling property.
  ///             Takes O(N^2) time.
  ///
  ///  - Fast  -- checks basic tree structure and compares it with a freshly
  ///             constructed tree.
  ///             Takes O(N^2) time worst case, but is faster in practise (same
  ///             as tree construction).
  bool verify(VerificationLevel VL = VerificationLevel::Full) const {
    return DomTreeBuilder::Verify(*this, VL);
  }
 
  void reset() {
    DomTreeNodes.clear();
    if constexpr (!GraphHasNodeNumbers<NodeT *>)
      NodeNumberMap.clear();
    Roots.clear();
    RootNode = nullptr;
    Parent = nullptr;
    DFSInfoValid = false;
    NodeAllocator.Reset();
    SlowQueries = 0;
  }
 
protected:
  inline void addRoot(NodeT *BB) { this->Roots.push_back(BB); }
 
  DomTreeNodeBase<NodeT> *createNode(NodeT *BB,
                                     DomTreeNodeBase<NodeT> *IDom = nullptr) {
    static_assert(std::is_trivially_destructible_v<DomTreeNodeBase<NodeT>>);
    auto *Node = new (NodeAllocator) DomTreeNodeBase<NodeT>(BB, IDom);
    unsigned NodeIdx = getNodeIndexForInsert(BB);
    DomTreeNodes[NodeIdx] = Node;
    if (IDom)
      IDom->addChild(Node);
    return Node;
  }
 
  // NewBB is split and now it has one successor. Update dominator tree to
  // reflect this change.
  template <class N>
  void Split(typename GraphTraits<N>::NodeRef NewBB) {
    using GraphT = GraphTraits<N>;
    using NodeRef = typename GraphT::NodeRef;
    assert(llvm::hasSingleElement(children<N>(NewBB)) &&
           "NewBB should have a single successor!");
    NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
 
    SmallVector<NodeRef, 4> PredBlocks(inverse_children<N>(NewBB));
 
    assert(!PredBlocks.empty() && "No predblocks?");
 
    bool NewBBDominatesNewBBSucc = true;
    for (auto *Pred : inverse_children<N>(NewBBSucc)) {
      if (Pred != NewBB && !dominates(NewBBSucc, Pred) &&
          isReachableFromEntry(Pred)) {
        NewBBDominatesNewBBSucc = false;
        break;
      }
    }
 
    // Find NewBB's immediate dominator and create new dominator tree node for
    // NewBB.
    NodeT *NewBBIDom = nullptr;
    unsigned i = 0;
    for (i = 0; i < PredBlocks.size(); ++i)
      if (isReachableFromEntry(PredBlocks[i])) {
        NewBBIDom = PredBlocks[i];
        break;
      }
 
    // It's possible that none of the predecessors of NewBB are reachable;
    // in that case, NewBB itself is unreachable, so nothing needs to be
    // changed.
    if (!NewBBIDom) return;
 
    for (i = i + 1; i < PredBlocks.size(); ++i) {
      if (isReachableFromEntry(PredBlocks[i]))
        NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
    }
 
    // Create the new dominator tree node... and set the idom of NewBB.
    DomTreeNodeBase<NodeT> *NewBBNode = addNewBlock(NewBB, NewBBIDom);
 
    // If NewBB strictly dominates other blocks, then it is now the immediate
    // dominator of NewBBSucc.  Update the dominator tree as appropriate.
    if (NewBBDominatesNewBBSucc) {
      DomTreeNodeBase<NodeT> *NewBBSuccNode = getNode(NewBBSucc);
      changeImmediateDominator(NewBBSuccNode, NewBBNode);
    }
  }
 
 private:
  bool dominatedBySlowTreeWalk(const DomTreeNodeBase<NodeT> *A,
                               const DomTreeNodeBase<NodeT> *B) const {
    assert(A != B);
    assert(isReachableFromEntry(B));
    assert(isReachableFromEntry(A));
 
    const unsigned ALevel = A->getLevel();
    const DomTreeNodeBase<NodeT> *IDom;
 
    // Don't walk nodes above A's subtree. When we reach A's level, we must
    // either find A or be in some other subtree not dominated by A.
    while ((IDom = B->getIDom()) != nullptr && IDom->getLevel() >= ALevel)
      B = IDom;  // Walk up the tree
 
    return B == A;
  }
};
 
template <typename T>
using DomTreeBase = DominatorTreeBase<T, false>;
 
template <typename T>
using PostDomTreeBase = DominatorTreeBase<T, true>;
 
// These two functions are declared out of line as a workaround for building
// with old (< r147295) versions of clang because of pr11642.
template <typename NodeT, bool IsPostDom>
bool DominatorTreeBase<NodeT, IsPostDom>::dominates(const NodeT *A,
                                                    const NodeT *B) const {
  if (A == B)
    return true;
 
  return dominates(getNode(A), getNode(B));
}
template <typename NodeT, bool IsPostDom>
bool DominatorTreeBase<NodeT, IsPostDom>::properlyDominates(
    const NodeT *A, const NodeT *B) const {
  if (A == B)
    return false;
 
  return dominates(getNode(A), getNode(B));
}
 
} // end namespace llvm
 
#endif // LLVM_SUPPORT_GENERICDOMTREE_H