CallGraphAnalyses.h

Go to the documentation of this file.

//===-- CallGraphAnalyses.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/Analysis/CallGraph.h"
#include "llzk/Dialect/Function/IR/Ops.h"
 
#include <mlir/Pass/AnalysisManager.h>
 
#include <llvm/ADT/DenseMap.h>
#include <llvm/ADT/DenseSet.h>
#include <llvm/ADT/SCCIterator.h>
#include <llvm/ADT/STLExtras.h>
 
namespace mlir {
 
class Operation;
 
} // namespace mlir
 
namespace llzk {

class CallGraphAnalysis {
  std::unique_ptr<llzk::CallGraph> cg;
 
public:
  CallGraphAnalysis(mlir::Operation *op);
 
  llzk::CallGraph &getCallGraph() { return *cg.get(); }
  const llzk::CallGraph &getCallGraph() const { return *cg.get(); }
};

class CallGraphReachabilityAnalysis {
 
  // Maps function -> callees
  using CalleeMapTy = mlir::DenseMap<function::FuncDefOp, mlir::DenseSet<function::FuncDefOp>>;
 
  mutable CalleeMapTy reachabilityMap;
 
  std::reference_wrapper<llzk::CallGraph> callGraph;
 
public:
  CallGraphReachabilityAnalysis(mlir::Operation *, mlir::AnalysisManager &am);
 
  static bool isInvalidated(const mlir::AnalysisManager::PreservedAnalyses &pa) {
    return !pa.isPreserved<CallGraphReachabilityAnalysis>() || !pa.isPreserved<CallGraphAnalysis>();
  }

  bool isReachable(function::FuncDefOp &A, function::FuncDefOp &B) const;
 
  const llzk::CallGraph &getCallGraph() const { return callGraph.get(); }
 
private:
  inline bool isReachableCached(function::FuncDefOp &A, function::FuncDefOp &B) const {
    auto it = reachabilityMap.find(A);
    return it != reachabilityMap.end() && it->second.find(B) != it->second.end();
  }
};
 
} // namespace llzk