PandA-2024.02
UnfoldedCallGraph.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) 2015-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  */
38 #ifndef UNFOLDED_CALL_GRAPH_HPP
39 #define UNFOLDED_CALL_GRAPH_HPP
40 
41 #include "graph.hpp"
42 
44 {
45  public:
46  explicit UnfoldedCallGraph(GraphInfoRef g_info) : RawGraph(g_info)
47  {
48  }
49 
50  ~UnfoldedCallGraph() = default;
51 };
52 
53 using UnfoldedVertexDescriptor = boost::graph_traits<UnfoldedCallGraph>::vertex_descriptor;
54 using UnfoldedVertexIterator = boost::graph_traits<UnfoldedCallGraph>::vertex_iterator;
55 #define UNFOLDED_NULL_VERTEX boost::graph_traits<UnfoldedCallGraph>::null_vertex()
56 
57 using UnfoldedInEdgeIterator = boost::graph_traits<UnfoldedCallGraph>::in_edge_iterator;
58 using UnfoldedOutEdgeIterator = boost::graph_traits<UnfoldedCallGraph>::out_edge_iterator;
59 using UnfoldedEdgeIterator = boost::graph_traits<UnfoldedCallGraph>::edge_iterator;
60 using UnfoldedEdgeDescriptor = boost::graph_traits<UnfoldedCallGraph>::edge_descriptor;
61 
64 #endif
boost::graph_traits< UnfoldedCallGraph >::edge_descriptor UnfoldedEdgeDescriptor
Class specification of the graph structures.
UnfoldedCallGraph(GraphInfoRef g_info)
boost::graph_traits< UnfoldedCallGraph >::vertex_descriptor UnfoldedVertexDescriptor
Template borrowed from the ANTLR library by Terence Parr (http://www.jGuru.com - Software rights: htt...
Definition: refcount.hpp:94
boost::graph_traits< UnfoldedCallGraph >::out_edge_iterator UnfoldedOutEdgeIterator
boost::graph_traits< UnfoldedCallGraph >::in_edge_iterator UnfoldedInEdgeIterator
~UnfoldedCallGraph()=default
boost::graph_traits< UnfoldedCallGraph >::edge_iterator UnfoldedEdgeIterator
boost::graph_traits< UnfoldedCallGraph >::vertex_iterator UnfoldedVertexIterator

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