42 #ifndef PROFILING_INFORMATION_HPP 43 #define PROFILING_INFORMATION_HPP 46 #include "config_HAVE_UNORDERED.hpp" 70 :
public CustomUnorderedMap<unsigned int, std::map<CustomOrderedSet<unsigned int>, long double>>
163 friend class hpp_profiling;
164 friend class LoopsProfiling;
165 friend class probability_path;
167 friend class read_profiling_data;
168 friend class tp_profiling;
213 unsigned long long int GetBBExecutions(
const vertex bb_vertex)
const;
220 unsigned long long int GetEdgeExecutions(
const EdgeDescriptor edge)
const;
227 long double GetLoopAvgIterations(
const unsigned int loop_id)
const;
234 unsigned long long int GetLoopMaxIterations(
const unsigned int loop_id)
const;
241 unsigned long long GetLoopAbsIterations(
const unsigned int loop_id)
const;
248 long double GetLoopAvgIterations(
const LoopConstRef loop)
const;
255 unsigned long long int GetLoopMaxIterations(
const LoopConstRef loop)
const;
262 unsigned long long GetLoopAbsIterations(
const LoopConstRef loop)
const;
Class specification of the graph structures.
Map storing number of executions of each basic block edge.
Map storing number of abs/max iterations.
redefinition of map to manage ordered/unordered structures
Class to perform profiling.
Class used to describe a particular graph with basic blocks as nodes.
unsigned map[NUM_VERTICES]
absl::flat_hash_map< T, U, Hash, Eq, Alloc > CustomUnorderedMap
redefinition of set to manage ordered/unordered structures
boost::graph_traits< graph >::vertex_descriptor vertex
vertex definition.
Template definition of refcount.
Map storing number of average iterations.
Class specification of the basic_block structure.
Map storing number of executions of each basic block.
Class to perform profiling.
boost::graph_traits< graph >::edge_descriptor EdgeDescriptor
edge definition.