blob: 85b9f2803c56835c6be9125ab9d8a1945b47354e (
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
|
//
// Copyright © 2017 Arm Ltd. All rights reserved.
// See LICENSE file in the project root for full license information.
//
#include "Optimizer.hpp"
#include "optimizations/All.hpp"
namespace armnn
{
const Optimizer& Optimizer::Get()
{
// Add optimizations here
static optimizations::SquashEqualPermuteSiblings squashEqualPermuteSiblings;
static optimizations::SquashEqualReshapeSiblings squashEqualReshapeSiblings;
static optimizations::OptimizeInversePermutes optimizeInversePermutes;
static optimizations::MovePermuteUp movePermuteUp;
static optimizations::PermuteAsReshape permuteAsReshape;
static optimizations::OptimizeConsecutiveReshapes optimizeConsecutiveReshapes;
// Set optimizations in desired order
static const Optimizer optimizer({
&squashEqualPermuteSiblings,
&squashEqualReshapeSiblings,
&optimizeInversePermutes,
&movePermuteUp,
&permuteAsReshape,
&optimizeConsecutiveReshapes,
});
return optimizer;
}
void Optimizer::Optimize(Graph& graph) const
{
auto it = graph.TopologicalSort().end();
// Call TopologicalSort() in every iteration to re-order the list in case layers where added/removed.
while (it != graph.TopologicalSort().begin())
{
--it;
for (auto&& optimization : m_Optimizations)
{
optimization->Run(graph, it);
if ((*it)->IsOutputUnconnected())
{
it = graph.EraseLayer(it);
break;
}
}
}
}
} // namespace armnn
|
