OutlinedHashTree.h

Go to the documentation of this file.

//===- OutlinedHashTree.h --------------------------------------*- 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
//
//===---------------------------------------------------------------------===//
//
// This defines the OutlinedHashTree class. It contains sequences of stable
// hash values of instructions that have been outlined. This OutlinedHashTree
// can be used to track the outlined instruction sequences across modules.
//
//===---------------------------------------------------------------------===//
 
#ifndef LLVM_CGDATA_OUTLINEDHASHTREE_H
#define LLVM_CGDATA_OUTLINEDHASHTREE_H
 
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/StableHashing.h"
#include "llvm/ObjectYAML/YAML.h"
#include "llvm/Support/Compiler.h"
#include "llvm/Support/raw_ostream.h"
 
#include <unordered_map>
#include <vector>
 
namespace llvm {
 
/// A HashNode is an entry in an OutlinedHashTree, holding a hash value
/// and a collection of Successors (other HashNodes). If a HashNode has
/// a positive terminal value (Terminals > 0), it signifies the end of
/// a hash sequence with that occurrence count.
struct HashNode {
  /// The hash value of the node.
  stable_hash Hash = 0;
  /// The number of terminals in the sequence ending at this node.
  std::optional<unsigned> Terminals;
  /// The successors of this node.
  /// We don't use DenseMap as a stable_hash value can be tombstone.
  std::unordered_map<stable_hash, std::unique_ptr<HashNode>> Successors;
};
 
class OutlinedHashTree {
 
  using EdgeCallbackFn =
      std::function<void(const HashNode *, const HashNode *)>;
  using NodeCallbackFn = std::function<void(const HashNode *)>;
 
  using HashSequence = SmallVector<stable_hash>;
  using HashSequencePair = std::pair<HashSequence, unsigned>;
 
public:
  /// Walks every edge and node in the OutlinedHashTree and calls CallbackEdge
  /// for the edges and CallbackNode for the nodes with the stable_hash for
  /// the source and the stable_hash of the sink for an edge. These generic
  /// callbacks can be used to traverse a OutlinedHashTree for the purpose of
  /// print debugging or serializing it.
  LLVM_ABI void walkGraph(NodeCallbackFn CallbackNode,
                          EdgeCallbackFn CallbackEdge = nullptr,
                          bool SortedWalk = false) const;
 
  /// Release all hash nodes except the root hash node.
  void clear() {
    assert(getRoot()->Hash == 0 && !getRoot()->Terminals);
    getRoot()->Successors.clear();
  }
 
  /// \returns true if the hash tree has only the root node.
  bool empty() { return size() == 1; }
 
  /// \returns the size of a OutlinedHashTree by traversing it. If
  /// \p GetTerminalCountOnly is true, it only counts the terminal nodes
  /// (meaning it returns the the number of hash sequences in the
  /// OutlinedHashTree).
  LLVM_ABI size_t size(bool GetTerminalCountOnly = false) const;
 
  /// \returns the depth of a OutlinedHashTree by traversing it.
  LLVM_ABI size_t depth() const;
 
  /// \returns the root hash node of a OutlinedHashTree.
  const HashNode *getRoot() const { return &Root; }
  HashNode *getRoot() { return &Root; }
 
  /// Inserts a \p Sequence into the this tree. The last node in the sequence
  /// will increase Terminals.
  LLVM_ABI void insert(const HashSequencePair &SequencePair);
 
  /// Merge a \p OtherTree into this Tree.
  LLVM_ABI void merge(const OutlinedHashTree *OtherTree);
 
  /// \returns the matching count if \p Sequence exists in the OutlinedHashTree.
  LLVM_ABI std::optional<unsigned> find(const HashSequence &Sequence) const;
 
private:
  HashNode Root;
};
 
} // namespace llvm
 
#endif