blob: 7b4c33b767703b9364650c00b2c46bcf31d599be (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
* Copyright (c) 2020 Samsung Electronics Co., Ltd. All Rights Reserved
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef __ONERT_IR_SUBGRAPHS_H__
#define __ONERT_IR_SUBGRAPHS_H__
#include <memory>
#include <unordered_map>
#include "ir/Index.h"
#include "util/ObjectManager.h"
namespace onert
{
namespace ir
{
class Graph;
class Subgraphs
{
public:
Subgraphs() = default;
Subgraphs(const Subgraphs &obj) = default;
Subgraphs(Subgraphs &&) = default;
Subgraphs &operator=(const Subgraphs &) = default;
Subgraphs &operator=(Subgraphs &&) = default;
~Subgraphs() = default;
/**
* @brief Put subgraph in the container with a new Index for that
*
* @param[in] subg Subgraph to be pushed
* @param[in] index Index of subgraph to be pushed
* @return Created
*/
void push(SubgraphIndex index, const std::shared_ptr<Graph> &subg) { _subgraphs[index] = subg; }
/**
* @brief Remove the subgraph that is associated with the given index
*
* @param[in] index Index of the subgraph to be removed
* @return N/A
*/
void remove(const SubgraphIndex &index) { _subgraphs.erase(index); }
/**
* @brief Get the subgraph that is associated with the given index
*
* @param[in] index Index of the subgraph to be returned
* @return Graph
*/
const std::shared_ptr<Graph> &at(const SubgraphIndex &index) const
{
return _subgraphs.at(index);
}
/**
* @brief Get the subgraph that is associated with the given index
*
* @param[in] index Index of the subgraph to be returned
* @return Graph
*/
std::shared_ptr<Graph> &at(const SubgraphIndex &index) { return _subgraphs.at(index); }
/**
* @brief Get the subgraph that is associated with the given index
*
* @param[in] index Index of the subgraph to be returned
* @return true if such entry exists otherwise false
*/
bool exist(const SubgraphIndex &index) const
{
auto it = _subgraphs.find(index);
return it != _subgraphs.end();
}
/**
* @brief Iterate over the container with given function
*
* @param[in] fn Function to be run for every container entry
* @return N/A
*/
void iterate(const std::function<void(const SubgraphIndex &, const Graph &)> &fn) const
{
for (const auto &e : _subgraphs)
{
fn(e.first, *e.second);
}
}
/**
* @brief Iterate over the container with given function
*
* @param[in] fn Function to be run for every container entry
* @return N/A
*/
void iterate(const std::function<void(const SubgraphIndex &, Graph &)> &fn)
{
for (const auto &e : _subgraphs)
{
fn(e.first, *e.second);
}
}
/**
* @brief Get count of Subgraphs
*
* @return count of Subgraphs
*/
size_t count() { return _subgraphs.size(); }
/**
* @brief Return the primary subgraph
*
* @return std::shared_ptr<Graph> Primary sugraph
*/
std::shared_ptr<Graph> primary() const { return _subgraphs.at(SubgraphIndex{0}); }
private:
std::unordered_map<SubgraphIndex, std::shared_ptr<Graph>> _subgraphs;
};
} // namespace ir
} // namespace onert
#endif // __ONERT_IR_SUBGRAPHS_H__
|
