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
|
/*
* Copyright (c) 2018 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.
*/
#include "Verifier.h"
#include "ir/Graph.h"
#include "ir/OperationIndexMap.h"
#include "util/logging.h"
namespace onert
{
namespace ir
{
namespace verifier
{
//
// DAGChecker
//
bool DAGChecker::verify(const Graph &graph) const noexcept
{
auto &operations = graph.operations();
bool cyclic = false;
OperationIndexMap<bool> visited;
operations.iterate(
[&](const OperationIndex &index, const Operation &) { visited[index] = false; });
OperationIndexMap<bool> on_stack = visited; // Copy from visited
std::function<void(const OperationIndex &index, const Operation &)> dfs_recursive =
[&](const OperationIndex &index, const Operation &node) -> void {
if (on_stack[index])
cyclic = true;
if (visited[index])
return;
visited[index] = true;
on_stack[index] = true;
for (auto output : node.getOutputs() | Remove::DUPLICATED)
{
const auto &operand = graph.operands().at(output);
for (const auto &use : operand.getUses())
{
dfs_recursive(use, graph.operations().at(use));
}
}
on_stack[index] = false;
};
operations.iterate(dfs_recursive);
return !cyclic;
}
//
// EdgeConsistencyVerifier
//
bool EdgeConsistencyChecker::verify(const Graph &graph) const noexcept
{
auto &operations = graph.operations();
uint32_t errors = 0;
operations.iterate([&](const OperationIndex &index, const Operation &node) {
for (auto operand_index : node.getInputs() | ir::Remove::UNDEFINED)
{
try
{
auto &operand = graph.operands().at(operand_index);
bool operand_has_use = operand.getUses().contains(index);
if (!operand_has_use)
{
VERBOSE(EdgeConsistencyChecker) << "[ERROR] EDGE MISMATCH : Missing USE edge - Operand "
<< operand_index << " to Operation " << index
<< std::endl;
errors += 1;
}
}
catch (const std::out_of_range &e)
{
VERBOSE(EdgeConsistencyChecker)
<< "[ERROR] OPEARAND NOT FOUND : Operation " << index << " has Operand "
<< operand_index << ", but the operand object is not present in the graph" << std::endl;
errors += 1;
}
}
for (auto operand_index : node.getOutputs())
{
try
{
auto &operand = graph.operands().at(operand_index);
if (operand.getDef() != index)
{
VERBOSE(EdgeConsistencyChecker) << "[ERROR] EDGE MISMATCH : Missing DEF edge - Operand"
<< operand_index << " to Operation " << index
<< std::endl;
errors += 1;
}
}
catch (const std::out_of_range &e)
{
VERBOSE(EdgeConsistencyChecker)
<< "[ERROR] OPEARAND NOT FOUND : Operation " << index << " has Operand "
<< operand_index << ", but the operand object is not present in the graph" << std::endl;
errors += 1;
}
}
});
VERBOSE(EdgeConsistencyChecker) << "Total Number of errors : " << errors << std::endl;
return errors == 0;
}
} // namespace verifier
} // namespace ir
} // namespace onert
|
