43 #ifndef CALL_GRAPH_COMPUTATION_HPP 44 #define CALL_GRAPH_COMPUTATION_HPP
CustomUnorderedSet< unsigned int > already_visited
Already visited tree node (used to avoid infinite recursion)
RelationshipType
The relationship type.
Build call graph structures starting from the tree_manager.
call_graph_computation(const ParameterConstRef _parameters, const application_managerRef AppM, const DesignFlowManagerConstRef design_flow_manager)
Constructor.
redefinition of set to manage ordered/unordered structures
const Wrefcount< const DesignFlowManager > design_flow_manager
The design flow manager.
DesignFlowStep_Status
The status of a step.
DesignFlowStep_Status Exec() override
Computes the call graph data structure.
const application_managerRef AppM
The application manager.
Template borrowed from the ANTLR library by Terence Parr (http://www.jGuru.com - Software rights: htt...
const CustomUnorderedSet< std::pair< FrontendFlowStepType, FunctionRelationship > > ComputeFrontendRelationships(const DesignFlowStep::RelationshipType relationship_type) const override
Return the set of analyses in relationship with this design step.
This class contains the base representation for a generic frontend flow step which works on the whole...
~call_graph_computation() override
Destructor.