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
|
/*
* 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 "luci/Pass/RemoveRedundantReshapePass.h"
#include <luci/IR/CircleNodes.h>
#include <gtest/gtest.h>
namespace
{
class RemoveRedundantReshape : public ::testing::Test
{
public:
RemoveRedundantReshape() {}
void createReshapeConst(luci::CircleReshape *target, const std::vector<int32_t> shape)
{
auto shape_const = g.nodes()->create<luci::CircleConst>();
shape_const->dtype(loco::DataType::S32);
shape_const->size<loco::DataType::S32>(shape.size());
shape_const->shape_status(luci::ShapeStatus::VALID);
shape_const->rank(1);
shape_const->dim(0).set(shape.size());
for (int32_t i = 0; i < shape.size(); i++)
{
shape_const->at<loco::DataType::S32>(i) = shape.at(i);
}
shape_const->name("shape_const");
target->shape(shape_const);
}
void buildGraph(const std::initializer_list<uint32_t> base_shape,
const std::vector<int32_t> first_shape, const std::vector<int32_t> second_shape)
{
// Input Create.
input = g.nodes()->create<luci::CircleInput>();
auto graph_input = g.inputs()->create();
input->index(graph_input->index());
input->shape_status(luci::ShapeStatus::VALID);
input->rank(base_shape.size());
input->shape(base_shape);
input->name("input");
// Create first reshape.
first_reshape = g.nodes()->create<luci::CircleReshape>();
first_reshape->tensor(input);
first_reshape->name("Reshape");
createReshapeConst(first_reshape, first_shape);
// Create second reshape.
second_reshape = g.nodes()->create<luci::CircleReshape>();
second_reshape->tensor(first_reshape);
second_reshape->name("second_reshape");
createReshapeConst(second_reshape, second_shape);
// Output Connect.
output = g.nodes()->create<luci::CircleOutput>();
output->from(second_reshape);
output->name("output");
auto graph_output = g.outputs()->create();
output->index(graph_output->index());
}
public:
loco::Graph g;
luci::CircleInput *input = nullptr;
luci::CircleReshape *first_reshape = nullptr;
luci::CircleReshape *second_reshape = nullptr;
luci::CircleOutput *output = nullptr;
};
} // namespace
TEST(RemoveRedundantReshapePassTest, name)
{
luci::RemoveRedundantReshapePass pass;
auto const name = pass.name();
ASSERT_NE(nullptr, name);
}
TEST_F(RemoveRedundantReshape, simple_case)
{
buildGraph({4, 6}, {-1, 4, 6}, {1, -1, 2, 3});
luci::RemoveRedundantReshapePass pass;
while (pass.run(&g))
;
int count = 0;
for (auto node : loco::active_nodes(loco::output_nodes(&g)))
{
if (auto reshape = dynamic_cast<luci::CircleReshape *>(node))
{
count++;
}
}
ASSERT_EQ(1, count);
}
|
