PandA-2024.02
weak_dominance.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  */
44 #ifndef WEAK_DOMINANCE_HPP
45 #define WEAK_DOMINANCE_HPP
46 
47 #include "custom_map.hpp"
48 #include "graph.hpp"
49 #include "refcount.hpp"
50 
52 
53 #define WD_SELECTOR 1
54 
59 {
60  private:
62  const graph* input;
63 
66 
69 
71  const int selector;
72 
75 
77  const int debug_level;
78 
86 
87  public:
96  weak_dominance(const graph* _input, vertex _start, vertex _end, const ParameterConstRef param,
97  int selector = WD_SELECTOR);
98 
102  ~weak_dominance() = default;
103 
112 };
113 #endif
string target
Definition: lenet_tvm.py:16
void calculate_weak_dominance_info(graphs_collection *output, CustomUnorderedMap< vertex, vertex > &i2o, CustomUnorderedMap< vertex, vertex > &o2i)
Compute weak dominance info.
Class specification of the graph structures.
const int debug_level
the debug level
void add_edge(vertex source, vertex target, graphs_collection *output)
Add a weak dominance edge between two nodes.
vertex end
the exit vertex
const ParameterConstRef param
The set of input parameters.
redefinition of map to manage ordered/unordered structures
volatile int output[DIM_Y][DIM_X]
Definition: los.h:1
CONSTREF_FORWARD_DECL(Parameter)
vertex start
the entry vertex
absl::flat_hash_map< T, U, Hash, Eq, Alloc > CustomUnorderedMap
Definition: custom_map.hpp:148
boost::graph_traits< graph >::vertex_descriptor vertex
vertex definition.
Definition: graph.hpp:1303
#define WD_SELECTOR
General class used to describe a graph in PandA.
Definition: graph.hpp:771
const int selector
the selector used in output graph
Template definition of refcount.
bulk graph.
Definition: graph.hpp:287
weak_dominance(const graph *_input, vertex _start, vertex _end, const ParameterConstRef param, int selector=WD_SELECTOR)
Constructor.
Template borrowed from the ANTLR library by Terence Parr (http://www.jGuru.com - Software rights: htt...
Definition: refcount.hpp:94
const graph * input
the input graph (not const since node info are copied in the new graph
~weak_dominance()=default
Destructor.
Class used to compute weak dominance.

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