blob: 7bd8ac51277773490de2faddf121f64459a71fba (
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
|
/*
* 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 neurun
{
namespace ir
{
namespace verifier
{
//
// DAGChecker
//
bool DAGChecker::verify(const Graph &graph) const
{
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())
{
const auto &operand = graph.operands().at(output);
for (const auto &use : operand.getUses().list())
{
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
{
auto &operations = graph.operations();
uint32_t mismatches = 0;
operations.iterate([&](const OperationIndex &index, const Operation &node) {
for (auto operand_index : node.getInputs())
{
auto &operand = graph.operands().at(operand_index);
mismatches += (operand.getUses().contains(index) ? 0 : 1);
}
for (auto operand_index : node.getOutputs())
{
auto &operand = graph.operands().at(operand_index);
mismatches += (operand.getDef().contains(index) ? 0 : 1);
}
});
return mismatches == 0;
}
} // namespace verifier
} // namespace ir
} // namespace neurun
|
