CallGraphDFSolver.hpp

Go to the documentation of this file.

#ifndef CallGraphDFSolver_h
#define CallGraphDFSolver_h

#include <OpenAnalysis/Utils/OA_ptr.hpp>
//#include <OpenAnalysis/DataFlow/DGraphIterativeDFP.hpp>
#include <OpenAnalysis/DataFlow/DGraphSolverDFP.hpp>
#include <OpenAnalysis/DataFlow/DataFlowSet.hpp>
#include <OpenAnalysis/DataFlow/CallGraphDFProblem.hpp>
#include <OpenAnalysis/CallGraph/CallGraphInterface.hpp>
#include <map>

namespace OA {
  namespace DataFlow {

  
//*********************************************************************
// class CallGraphDFProblemNew
//*********************************************************************
class CallGraphDFSolver  : private DataFlow::DGraphSolverDFP {
public:
  typedef enum { TopDown, BottomUp } CallGraphDirectionType;
private:
  OA_ptr<DataFlowSet> mTop;
//  OA_ptr<DataFlowSet> mBottom;
  CallGraphDirectionType mDirection;

public:
  //--------------------------------------------------------
  // constructor/destructor
  //--------------------------------------------------------
  CallGraphDFSolver(CallGraphDirectionType pDirection, CallGraphDFProblem& prob);
  virtual ~CallGraphDFSolver() {}

  void solve(OA_ptr<CallGraph::CallGraphInterface> callGraph, 
                    DFPImplement algorithm);

  //========================================================
  // implementation of DGraphIterativeDFP callbacks
  // These are implemented in CallGraphDFProblem.cpp for a 
  // CallGraph.
  //========================================================
  
  //--------------------------------------------------------
  // initialization upcall 
  //--------------------------------------------------------
  void initialize(OA_ptr<DGraph::DGraphInterface> dg);
  
  //--------------------------------------------------------
  // solver upcalls
  //--------------------------------------------------------
  bool atDGraphNode(OA_ptr<DGraph::NodeInterface> node, 
                    DGraph::DGraphEdgeDirection pOrient);
  bool atDGraphEdge(OA_ptr<DGraph::EdgeInterface>, 
                    DGraph::DGraphEdgeDirection);
  
  //--------------------------------------------------------
  // finalization upcalls
  //--------------------------------------------------------
  void finalizeNode(OA_ptr<DGraph::NodeInterface> node);
  void finalizeEdge(OA_ptr<DGraph::EdgeInterface> edge);


  //--------------------------------------------------------
  // debugging
  //--------------------------------------------------------
public:
  void dump(std::ostream& os, OA_ptr<IRHandlesIRInterface> ir);


private:
  // In and Out in this context refer to the data-flow direction
  // which in the case of bottom-up is in the reverse direction
  // of edges in the graph
  std::map<OA_ptr<CallGraph::NodeInterface>,OA_ptr<DataFlowSet> > 
      mNodeOutSetMap;
  std::map<OA_ptr<CallGraph::NodeInterface>,OA_ptr<DataFlowSet> > 
      mNodeInSetMap;
  std::map<OA_ptr<CallGraph::EdgeInterface>,OA_ptr<DataFlowSet> > 
      mEdgeOutSetMap;
  std::map<OA_ptr<CallGraph::EdgeInterface>,OA_ptr<DataFlowSet> > 
      mEdgeInSetMap;

  // whether or not the node has had the transfer function applied
  // to all statements at least once
  std::map<OA_ptr<CallGraph::NodeInterface>,bool> mNodeInitTransApp;

  CallGraphDFProblem& mDFProb;
};

  } // end of DataFlow namespace
}  // end of OA namespace

#endif