SymbolUseGraph.h

Go to the documentation of this file.

//===-- SymbolUseGraph.h ----------------------------------------*- C++ -*-===//
//
// Part of the LLZK Project, under the Apache License v2.0.
// See LICENSE.txt for license information.
// Copyright 2025 Veridise Inc.
// SPDX-License-Identifier: Apache-2.0
//
//===----------------------------------------------------------------------===//
 
#pragma once
 
#include "llzk/Util/SymbolLookup.h"
 
#include <mlir/IR/BuiltinOps.h>
#include <mlir/IR/SymbolTable.h>
 
#include <llvm/ADT/GraphTraits.h>
#include <llvm/ADT/MapVector.h>
#include <llvm/ADT/SetVector.h>
#include <llvm/Support/DOTGraphTraits.h>
 
#include <utility>
 
namespace llzk {
 
class SymbolUseGraphNode {
  mlir::ModuleOp symbolPathRoot;
  mlir::SymbolRefAttr symbolPath;
  bool isStructConstParam;
 
  /* Tree structure. The SymbolUseGraph owns the nodes so just pointers here. */
  mlir::SetVector<SymbolUseGraphNode *> predecessors;
  mlir::SetVector<SymbolUseGraphNode *> successors;
 
  SymbolUseGraphNode(mlir::ModuleOp pathRoot, mlir::SymbolRefAttr path)
      : symbolPathRoot(pathRoot), symbolPath(path), isStructConstParam(false) {
    assert(pathRoot && "'pathRoot' cannot be nullptr");
    assert(path && "'path' cannot be nullptr");
  }

  SymbolUseGraphNode() : symbolPathRoot(nullptr), symbolPath(nullptr), isStructConstParam(false) {}

  static bool isRealNodeImpl(const SymbolUseGraphNode *node) { return node->symbolPath != nullptr; }

  void addSuccessor(SymbolUseGraphNode *node);

  void removeSuccessor(SymbolUseGraphNode *node);
 
  // Provide access to private members.
  friend class SymbolUseGraph;
 
public:
  bool isRealNode() const { return isRealNodeImpl(this); }

  mlir::ModuleOp getSymbolPathRoot() const { return symbolPathRoot; }

  mlir::SymbolRefAttr getSymbolPath() const { return symbolPath; }

  bool isStructParam() const { return isStructConstParam; }

  bool hasPredecessor() const {
    return llvm::find_if(predecessors, isRealNodeImpl) != predecessors.end();
  }
  size_t numPredecessors() const { return llvm::count_if(predecessors, isRealNodeImpl); }

  bool hasSuccessor() const {
    return llvm::find_if(successors, isRealNodeImpl) != successors.end();
  }
  size_t numSuccessors() const { return llvm::count_if(successors, isRealNodeImpl); }

  using iterator = llvm::filter_iterator<
      mlir::SetVector<SymbolUseGraphNode *>::const_iterator, bool (*)(const SymbolUseGraphNode *)>;
 
  inline iterator predecessors_begin() const { return predecessorIter().begin(); }
  inline iterator predecessors_end() const { return predecessorIter().end(); }
  inline iterator successors_begin() const { return successorIter().begin(); }
  inline iterator successors_end() const { return successorIter().end(); }

  llvm::iterator_range<iterator> predecessorIter() const {
    return llvm::make_filter_range(predecessors, isRealNodeImpl);
  }

  llvm::iterator_range<iterator> successorIter() const {
    return llvm::make_filter_range(successors, isRealNodeImpl);
  }
 
  mlir::FailureOr<SymbolLookupResultUntyped>
  lookupSymbol(mlir::SymbolTableCollection &tables, bool reportMissing = true) const;

  std::string toString() const;
  void print(llvm::raw_ostream &os) const;
};

class SymbolUseGraph {
  using NodeMapKeyT = std::pair<mlir::ModuleOp, mlir::SymbolRefAttr>;
  using NodeMapT = llvm::MapVector<NodeMapKeyT, std::unique_ptr<SymbolUseGraphNode>>;

  NodeMapT nodes;
 
  // The singleton artificial (i.e., no associated op) root/head and tail nodes of the graph. Every
  // newly created SymbolUseGraphNode is initially a successor of the root node until a real
  // successor (if any) is added. Similarly, all leaf nodes in the graph have the tail as successor.
  //
  // Implementation note: An actual SymbolUseGraphNode is used instead of lists of head/tail nodes
  // because the GraphTraits implementations require a single entry node. These nodes are not added
  // to the `nodes` set and should be transparent to users of this graph (other than through the
  // GraphTraits `getEntryNode()` function implementations).
  SymbolUseGraphNode root, tail;

  class NodeIterator final
      : public llvm::mapped_iterator<
            NodeMapT::const_iterator, SymbolUseGraphNode *(*)(const NodeMapT::value_type &)> {
    static SymbolUseGraphNode *unwrap(const NodeMapT::value_type &value) {
      return value.second.get();
    }
 
  public:
    NodeIterator(NodeMapT::const_iterator it)
        : llvm::mapped_iterator<
              NodeMapT::const_iterator, SymbolUseGraphNode *(*)(const NodeMapT::value_type &)>(
              it, &unwrap
          ) {}
  };

  SymbolUseGraphNode *getOrAddNode(
      mlir::ModuleOp pathRoot, mlir::SymbolRefAttr path, SymbolUseGraphNode *predecessorNode
  );
 
  SymbolUseGraphNode *getSymbolUserNode(const mlir::SymbolTable::SymbolUse &u);
  void buildGraph(mlir::SymbolOpInterface symbolOp);
 
  // Friend declarations for the specializations of GraphTraits
  friend struct llvm::GraphTraits<const llzk::SymbolUseGraph *>;
  friend struct llvm::GraphTraits<llvm::Inverse<const llzk::SymbolUseGraph *>>;
 
public:
  SymbolUseGraph(mlir::SymbolOpInterface rootSymbolOp);

  const SymbolUseGraphNode *lookupNode(mlir::ModuleOp pathRoot, mlir::SymbolRefAttr path) const;

  const SymbolUseGraphNode *lookupNode(mlir::SymbolOpInterface symbolDef) const;

  size_t size() const { return nodes.size(); }

  using roots_iterator = SymbolUseGraphNode::iterator;
  roots_iterator roots_begin() const { return root.successors_begin(); }
  roots_iterator roots_end() const { return root.successors_end(); }

  inline llvm::iterator_range<roots_iterator> rootsIter() const {
    return llvm::make_range(roots_begin(), roots_end());
  }

  using iterator = NodeIterator;
  iterator begin() const { return nodes.begin(); }
  iterator end() const { return nodes.end(); }

  inline llvm::iterator_range<iterator> nodesIter() const {
    return llvm::make_range(begin(), end());
  }

  inline void dump() const { print(llvm::errs()); }
  void print(llvm::raw_ostream &os) const;

  void dumpToDotFile(std::string filename = "") const;
};
 
} // namespace llzk
 
namespace llvm {
 
// Provide graph traits for traversing SymbolUseGraph using standard graph traversals.
template <> struct GraphTraits<const llzk::SymbolUseGraphNode *> {
  using NodeRef = const llzk::SymbolUseGraphNode *;
  static NodeRef getEntryNode(NodeRef node) { return node; }

  using ChildIteratorType = llzk::SymbolUseGraphNode::iterator;
  static ChildIteratorType child_begin(NodeRef node) { return node->successors_begin(); }
  static ChildIteratorType child_end(NodeRef node) { return node->successors_end(); }
};
 
template <>
struct GraphTraits<const llzk::SymbolUseGraph *>
    : public GraphTraits<const llzk::SymbolUseGraphNode *> {
  using GraphType = const llzk::SymbolUseGraph *;

  static NodeRef getEntryNode(GraphType g) { return &g->root; }

  using nodes_iterator = llzk::SymbolUseGraph::iterator;
  static nodes_iterator nodes_begin(GraphType g) { return g->begin(); }
  static nodes_iterator nodes_end(GraphType g) { return g->end(); }

  static unsigned size(GraphType g) { return g->size(); }
};
 
// Provide graph traits for traversing SymbolUseGraph using INVERSE graph traversals.
template <> struct GraphTraits<Inverse<const llzk::SymbolUseGraphNode *>> {
  using NodeRef = const llzk::SymbolUseGraphNode *;
  static NodeRef getEntryNode(Inverse<NodeRef> node) { return node.Graph; }
 
  using ChildIteratorType = llzk::SymbolUseGraphNode::iterator;
  static ChildIteratorType child_begin(NodeRef node) { return node->predecessors_begin(); }
  static ChildIteratorType child_end(NodeRef node) { return node->predecessors_end(); }
};
 
template <>
struct GraphTraits<Inverse<const llzk::SymbolUseGraph *>>
    : public GraphTraits<Inverse<const llzk::SymbolUseGraphNode *>> {
  using GraphType = Inverse<const llzk::SymbolUseGraph *>;

  static NodeRef getEntryNode(GraphType g) { return &g.Graph->tail; }

  using nodes_iterator = llzk::SymbolUseGraph::iterator;
  static nodes_iterator nodes_begin(GraphType g) { return g.Graph->begin(); }
  static nodes_iterator nodes_end(GraphType g) { return g.Graph->end(); }

  static unsigned size(GraphType g) { return g.Graph->size(); }
};
 
// Provide graph traits for printing SymbolUseGraph using dot graph printer.
template <> struct DOTGraphTraits<const llzk::SymbolUseGraphNode *> : public DefaultDOTGraphTraits {
  using NodeRef = const llzk::SymbolUseGraphNode *;
  using GraphType = const llzk::SymbolUseGraph *;
 
  DOTGraphTraits(bool isSimple = false) : DefaultDOTGraphTraits(isSimple) {}
 
  std::string getNodeLabel(NodeRef n, GraphType) { return n->toString(); }
};
 
template <>
struct DOTGraphTraits<const llzk::SymbolUseGraph *>
    : public DOTGraphTraits<const llzk::SymbolUseGraphNode *> {
 
  DOTGraphTraits(bool isSimple = false) : DOTGraphTraits<NodeRef>(isSimple) {}
 
  static std::string getGraphName(GraphType) { return "Symbol Use Graph"; }
 
  std::string getNodeLabel(NodeRef n, GraphType g) {
    return DOTGraphTraits<NodeRef>::getNodeLabel(n, g);
  }
};
 
} // namespace llvm