blob: 162c4e7ef6c5e64d65db0f20f726db6e59155d87 (
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
|
/*
* Copyright (c) 2021 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 "Pass.h"
#include "UnusedOperandEliminationPass.h"
#include "ir/Index.h"
#include "util/Set.h"
#include "ir/Graph.h"
/**
* @file UnusedOperandEliminationPass.cc
* @brief This file contains UnusedOperandEliminationPass class implementation
*/
namespace onert
{
namespace compiler
{
namespace pass
{
void UnusedOperandEliminationPass::run()
{
util::Set<ir::OperandIndex> used;
_graph.operations().iterate([&](const ir::OperationIndex &, const ir::IOperation &node) {
for (auto &&ind : (node.getInputs() + node.getOutputs()) | ir::Remove::UNDEFINED)
{
used.add(ind);
}
});
// Graph's inputs/outputs are always considered as used
for (auto &&ind : (_graph.getInputs() + _graph.getOutputs()) | ir::Remove::UNDEFINED)
{
used.add(ind);
}
_graph.operands().iterate([&](const ir::OperandIndex &ind, const ir::Operand &) {
if (!used.contains(ind))
{
VERBOSE() << "Remove unused operand " << ind << std::endl;
_graph.operands().remove(ind);
}
});
}
} // namespace pass
} // namespace compiler
} // namespace onert
|
