PtrAliasAnalysis.h

Go to the documentation of this file.

#ifndef PTR_ALIAS_ANALYSIS
#define PTR_ALIAS_ANALYSIS
#include "ClassHierarchyGraph.h"
#include "InterProcDataFlowAnalysis.h"
#include "IntraProcAliasAnalysis.h"


using namespace std;
using namespace boost;

class ROSE_DLL_API PtrAliasAnalysis : public InterProcDataFlowAnalysis{

protected:
    SgIncidenceDirectedGraph *callGraph;
    
    boost::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> intraAliases;
    
    boost::unordered_map<SgExpression *, std::vector<SgFunctionDeclaration*> > resolver;
    
    ClassHierarchyWrapper *classHierarchy;
    
    CallGraphBuilder *cgBuilder;
public:
    enum COLOR {WHITE=0, GREY, BLACK};
    enum TRAVERSAL_TYPE {TOPOLOGICAL=0, REVERSE_TOPOLOGICAL};
 
    PtrAliasAnalysis(SgProject *__project);
    ~PtrAliasAnalysis();
    void run();
    void getFunctionDeclarations(std::vector<SgFunctionDeclaration*> &);
    bool runAndCheckIntraProcAnalysis(SgFunctionDeclaration *);

private:
    void SortCallGraphRecursive(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
                boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction, boost::unordered_map<SgGraphNode*, 
                PtrAliasAnalysis::COLOR> &colors, std::vector<SgFunctionDeclaration*> &processingOrder, 
                PtrAliasAnalysis::TRAVERSAL_TYPE order) ;
    
    void SortCallGraphNodes(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
                boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction,
                std::vector<SgFunctionDeclaration*> &processingOrder, PtrAliasAnalysis::TRAVERSAL_TYPE order);

    void computeCallGraphNodes(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
                std::vector<SgFunctionDeclaration*> &processingOrder, PtrAliasAnalysis::TRAVERSAL_TYPE order);
  
    // Order of performing Dataflow Analysis
  TRAVERSAL_TYPE order;  
};

#endif