PandA-2024.02
determine_memory_accesses.hpp
Go to the documentation of this file.
1 /*
2  *
3  * _/_/_/ _/_/ _/ _/ _/_/_/ _/_/
4  * _/ _/ _/ _/ _/_/ _/ _/ _/ _/ _/
5  * _/_/_/ _/_/_/_/ _/ _/_/ _/ _/ _/_/_/_/
6  * _/ _/ _/ _/ _/ _/ _/ _/ _/
7  * _/ _/ _/ _/ _/ _/_/_/ _/ _/
8  *
9  * ***********************************************
10  * PandA Project
11  * URL: http://panda.dei.polimi.it
12  * Politecnico di Milano - DEIB
13  * System Architectures Group
14  * ***********************************************
15  * Copyright (C) 2004-2024 Politecnico di Milano
16  *
17  * This file is part of the PandA framework.
18  *
19  * The PandA framework is free software; you can redistribute it and/or modify
20  * it under the terms of the GNU General Public License as published by
21  * the Free Software Foundation; either version 3 of the License, or
22  * (at your option) any later version.
23  *
24  * This program is distributed in the hope that it will be useful,
25  * but WITHOUT ANY WARRANTY; without even the implied warranty of
26  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27  * GNU General Public License for more details.
28  *
29  * You should have received a copy of the GNU General Public License
30  * along with this program. If not, see <http://www.gnu.org/licenses/>.
31  *
32  */
45 #ifndef DETERMINE_MEMORY_ACCESSES_HPP
46 #define DETERMINE_MEMORY_ACCESSES_HPP
47 
50 
52 #include "custom_map.hpp"
53 #include <list>
54 
56 #include "refcount.hpp"
57 
61 
63 {
64  private:
67 
70 
74 
78  void analyze_node(const tree_nodeConstRef& tn, bool left_p, bool dynamic_address, bool no_dynamic_address);
79 
85  ComputeFrontendRelationships(const DesignFlowStep::RelationshipType relationship_type) const override;
86 
87  public:
96  unsigned int _function_id, const DesignFlowManagerConstRef design_flow_manager);
97 
101  ~determine_memory_accesses() override;
102 
107 };
108 #endif
CustomUnorderedSet< unsigned int > already_visited_ae
Already visited address expression (used to avoid infinite recursion)
const BehavioralHelperConstRef behavioral_helper
The behavioral helper.
RelationshipType
The relationship type.
This class manages the tree structures extracted from the raw file.
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.
DesignFlowStep_Status InternalExec() override
Determines the variables that require a memory access.
This class contains the base representation for a generic frontend flow step which works on a single ...
redefinition of map to manage ordered/unordered structures
Abstract pure class for the tree structure.
Definition: tree_node.hpp:139
~determine_memory_accesses() override
Destructor.
determine_memory_accesses(const ParameterConstRef parameters, const application_managerRef AppM, unsigned int _function_id, const DesignFlowManagerConstRef design_flow_manager)
Constructor.
const Wrefcount< const DesignFlowManager > design_flow_manager
The design flow manager.
void analyze_node(const tree_nodeConstRef &tn, bool left_p, bool dynamic_address, bool no_dynamic_address)
Analyze the given node ID to determine which variables have to be referred in memory.
const ParameterConstRef parameters
Set of input parameters.
DesignFlowStep_Status
The status of a step.
Template definition of refcount.
const application_managerRef AppM
The application manager.
CustomUnorderedSet< unsigned int > already_visited
const tree_managerConstRef TM
The tree manager.
CONSTREF_FORWARD_DECL(BehavioralHelper)
Superclass include.

Generated on Mon Feb 12 2024 13:02:51 for PandA-2024.02 by doxygen 1.8.13