1 //
2 // Copyright © 2017 Arm Ltd. All rights reserved.
3 // SPDX-License-Identifier: MIT
4 //
5 #include <boost/test/unit_test.hpp>
6
7
8 #include <armnn/Utils.hpp>
9 #include <armnn/Types.hpp>
10 #include <armnn/TypesUtils.hpp>
11 #include <armnn/Descriptors.hpp>
12 #include <armnnUtils/Permute.hpp>
13 #include <GraphTopologicalSort.hpp>
14 #include <Graph.hpp>
15 #include <ResolveType.hpp>
16
17 BOOST_AUTO_TEST_SUITE(Utils)
18
BOOST_AUTO_TEST_CASE(DataTypeSize)19 BOOST_AUTO_TEST_CASE(DataTypeSize)
20 {
21 BOOST_TEST(armnn::GetDataTypeSize(armnn::DataType::Float32) == 4);
22 BOOST_TEST(armnn::GetDataTypeSize(armnn::DataType::QAsymmU8) == 1);
23 BOOST_TEST(armnn::GetDataTypeSize(armnn::DataType::Signed32) == 4);
24 BOOST_TEST(armnn::GetDataTypeSize(armnn::DataType::Boolean) == 1);
25 }
26
BOOST_AUTO_TEST_CASE(PermuteDescriptorWithTooManyMappings)27 BOOST_AUTO_TEST_CASE(PermuteDescriptorWithTooManyMappings)
28 {
29 BOOST_CHECK_THROW(armnn::PermuteDescriptor({ 0u, 1u, 2u, 3u, 4u, 5u }), armnn::InvalidArgumentException);
30 }
31
BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings1d)32 BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings1d)
33 {
34 BOOST_CHECK_THROW(armnn::PermuteDescriptor({ 1u }), armnn::InvalidArgumentException);
35 }
36
BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings2d)37 BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings2d)
38 {
39 BOOST_CHECK_THROW(armnn::PermuteDescriptor({ 2u, 0u }), armnn::InvalidArgumentException);
40 }
41
BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings3d)42 BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings3d)
43 {
44 BOOST_CHECK_THROW(armnn::PermuteDescriptor({ 0u, 3u, 1u }), armnn::InvalidArgumentException);
45 }
46
BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings4d)47 BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings4d)
48 {
49 BOOST_CHECK_THROW(armnn::PermuteDescriptor({ 0u, 1u, 2u, 4u }), armnn::InvalidArgumentException);
50 }
51
BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings5d)52 BOOST_AUTO_TEST_CASE(PermuteDescriptorWithInvalidMappings5d)
53 {
54 BOOST_CHECK_THROW(armnn::PermuteDescriptor({ 0u, 1u, 2u, 3u, 5u }), armnn::InvalidArgumentException);
55 }
56
BOOST_AUTO_TEST_CASE(PermuteDescriptorWithDuplicatedMappings)57 BOOST_AUTO_TEST_CASE(PermuteDescriptorWithDuplicatedMappings)
58 {
59 BOOST_CHECK_THROW(armnn::PermuteDescriptor({ 1u, 1u, 0u }), armnn::InvalidArgumentException);
60 }
61
BOOST_AUTO_TEST_CASE(HalfType)62 BOOST_AUTO_TEST_CASE(HalfType)
63 {
64 using namespace half_float::literal;
65 armnn::Half a = 1.0_h;
66
67 float b = 1.0f;
68 armnn::Half c(b);
69
70 // Test half type
71 BOOST_CHECK_EQUAL(a, b);
72 BOOST_CHECK_EQUAL(sizeof(c), 2);
73
74 // Test half type is floating point type
75 BOOST_CHECK(std::is_floating_point<armnn::Half>::value);
76
77 // Test utility function returns correct type.
78 using ResolvedType = armnn::ResolveType<armnn::DataType::Float16>;
79 constexpr bool isHalfType = std::is_same<armnn::Half, ResolvedType>::value;
80 BOOST_CHECK(isHalfType);
81
82 //Test utility functions return correct size
83 BOOST_CHECK(GetDataTypeSize(armnn::DataType::Float16) == 2);
84
85 //Test utility functions return correct name
86 BOOST_CHECK((GetDataTypeName(armnn::DataType::Float16) == std::string("Float16")));
87 }
88
BOOST_AUTO_TEST_CASE(BFloatType)89 BOOST_AUTO_TEST_CASE(BFloatType)
90 {
91 uint16_t v = 16256;
92 armnn::BFloat16 a(v);
93 armnn::BFloat16 b(1.0f);
94 armnn::BFloat16 zero;
95
96 // Test BFloat16 type
97 BOOST_CHECK_EQUAL(sizeof(a), 2);
98 BOOST_CHECK_EQUAL(a, b);
99 BOOST_CHECK_EQUAL(a.Val(), v);
100 BOOST_CHECK_EQUAL(a, 1.0f);
101 BOOST_CHECK_EQUAL(zero, 0.0f);
102
103 // Infinity
104 float infFloat = std::numeric_limits<float>::infinity();
105 armnn::BFloat16 infBF(infFloat);
106 BOOST_CHECK_EQUAL(infBF, armnn::BFloat16::Inf());
107
108 // NaN
109 float nan = std::numeric_limits<float>::quiet_NaN();
110 armnn::BFloat16 nanBF(nan);
111 BOOST_CHECK_EQUAL(nanBF, armnn::BFloat16::Nan());
112
113 // Test utility function returns correct type.
114 using ResolvedType = armnn::ResolveType<armnn::DataType::BFloat16>;
115 constexpr bool isBFloat16Type = std::is_same<armnn::BFloat16, ResolvedType>::value;
116 BOOST_CHECK(isBFloat16Type);
117
118 //Test utility functions return correct size
119 BOOST_CHECK(GetDataTypeSize(armnn::DataType::BFloat16) == 2);
120
121 //Test utility functions return correct name
122 BOOST_CHECK((GetDataTypeName(armnn::DataType::BFloat16) == std::string("BFloat16")));
123 }
124
BOOST_AUTO_TEST_CASE(Float32ToBFloat16Test)125 BOOST_AUTO_TEST_CASE(Float32ToBFloat16Test)
126 {
127 // LSB = 0, R = 0 -> round down
128 armnn::BFloat16 roundDown0 = armnn::BFloat16::Float32ToBFloat16(1.704735E38f); // 0x7F004000
129 BOOST_CHECK_EQUAL(roundDown0.Val(), 0x7F00);
130 // LSB = 1, R = 0 -> round down
131 armnn::BFloat16 roundDown1 = armnn::BFloat16::Float32ToBFloat16(9.18355E-41f); // 0x00010000
132 BOOST_CHECK_EQUAL(roundDown1.Val(), 0x0001);
133 // LSB = 0, R = 1 all 0 -> round down
134 armnn::BFloat16 roundDown2 = armnn::BFloat16::Float32ToBFloat16(1.14794E-40f); // 0x00014000
135 BOOST_CHECK_EQUAL(roundDown2.Val(), 0x0001);
136 // LSB = 1, R = 1 -> round up
137 armnn::BFloat16 roundUp = armnn::BFloat16::Float32ToBFloat16(-2.0234377f); // 0xC0018001
138 BOOST_CHECK_EQUAL(roundUp.Val(), 0xC002);
139 // LSB = 0, R = 1 -> round up
140 armnn::BFloat16 roundUp1 = armnn::BFloat16::Float32ToBFloat16(4.843037E-35f); // 0x0680C000
141 BOOST_CHECK_EQUAL(roundUp1.Val(), 0x0681);
142 // Max positive value -> infinity
143 armnn::BFloat16 maxPositive = armnn::BFloat16::Float32ToBFloat16(std::numeric_limits<float>::max()); // 0x7F7FFFFF
144 BOOST_CHECK_EQUAL(maxPositive, armnn::BFloat16::Inf());
145 // Max negative value -> -infinity
146 armnn::BFloat16 maxNeg = armnn::BFloat16::Float32ToBFloat16(std::numeric_limits<float>::lowest()); // 0xFF7FFFFF
147 BOOST_CHECK_EQUAL(maxNeg.Val(), 0xFF80);
148 // Min positive value
149 armnn::BFloat16 minPositive = armnn::BFloat16::Float32ToBFloat16(1.1754942E-38f); // 0x007FFFFF
150 BOOST_CHECK_EQUAL(minPositive.Val(), 0x0080);
151 // Min negative value
152 armnn::BFloat16 minNeg = armnn::BFloat16::Float32ToBFloat16(-1.1754942E-38f); // 0x807FFFFF
153 BOOST_CHECK_EQUAL(minNeg.Val(), 0x8080);
154 }
155
BOOST_AUTO_TEST_CASE(BFloat16ToFloat32Test)156 BOOST_AUTO_TEST_CASE(BFloat16ToFloat32Test)
157 {
158 armnn::BFloat16 bf0(1.5f);
159 BOOST_CHECK_EQUAL(bf0.ToFloat32(), 1.5f);
160 armnn::BFloat16 bf1(-5.525308E-25f);
161 BOOST_CHECK_EQUAL(bf1.ToFloat32(), -5.525308E-25f);
162 armnn::BFloat16 bf2(-2.0625f);
163 BOOST_CHECK_EQUAL(bf2.ToFloat32(), -2.0625f);
164 uint16_t v = 32639;
165 armnn::BFloat16 bf3(v);
166 BOOST_CHECK_EQUAL(bf3.ToFloat32(), 3.3895314E38f);
167 // Infinity
168 BOOST_CHECK_EQUAL(armnn::BFloat16::Inf().ToFloat32(), std::numeric_limits<float>::infinity());
169 // NaN
170 BOOST_CHECK(std::isnan(armnn::BFloat16::Nan().ToFloat32()));
171 }
172
BOOST_AUTO_TEST_CASE(GraphTopologicalSortSimpleTest)173 BOOST_AUTO_TEST_CASE(GraphTopologicalSortSimpleTest)
174 {
175 std::map<int, std::vector<int>> graph;
176
177 graph[0] = {2};
178 graph[1] = {3};
179 graph[2] = {4};
180 graph[3] = {4};
181 graph[4] = {5};
182 graph[5] = {};
183
184 auto getNodeInputs = [graph](int node) -> std::vector<int>
185 {
186 return graph.find(node)->second;
187 };
188
189 std::vector<int> targetNodes = {0, 1};
190
191 std::vector<int> output;
192 bool sortCompleted = armnnUtils::GraphTopologicalSort<int>(targetNodes, getNodeInputs, output);
193
194 BOOST_TEST(sortCompleted);
195
196 std::vector<int> correctResult = {5, 4, 2, 0, 3, 1};
197 BOOST_CHECK_EQUAL_COLLECTIONS(output.begin(), output.end(), correctResult.begin(), correctResult.end());
198 }
199
BOOST_AUTO_TEST_CASE(GraphTopologicalSortVariantTest)200 BOOST_AUTO_TEST_CASE(GraphTopologicalSortVariantTest)
201 {
202 std::map<int, std::vector<int>> graph;
203
204 graph[0] = {2};
205 graph[1] = {2};
206 graph[2] = {3, 4};
207 graph[3] = {5};
208 graph[4] = {5};
209 graph[5] = {6};
210 graph[6] = {};
211
212 auto getNodeInputs = [graph](int node) -> std::vector<int>
213 {
214 return graph.find(node)->second;
215 };
216
217 std::vector<int> targetNodes = {0, 1};
218
219 std::vector<int> output;
220 bool sortCompleted = armnnUtils::GraphTopologicalSort<int>(targetNodes, getNodeInputs, output);
221
222 BOOST_TEST(sortCompleted);
223
224 std::vector<int> correctResult = {6, 5, 3, 4, 2, 0, 1};
225 BOOST_CHECK_EQUAL_COLLECTIONS(output.begin(), output.end(), correctResult.begin(), correctResult.end());
226 }
227
BOOST_AUTO_TEST_CASE(CyclicalGraphTopologicalSortTest)228 BOOST_AUTO_TEST_CASE(CyclicalGraphTopologicalSortTest)
229 {
230 std::map<int, std::vector<int>> graph;
231
232 graph[0] = {1};
233 graph[1] = {2};
234 graph[2] = {0};
235
236 auto getNodeInputs = [graph](int node) -> std::vector<int>
237 {
238 return graph.find(node)->second;
239 };
240
241 std::vector<int> targetNodes = {0};
242
243 std::vector<int> output;
244 bool sortCompleted = armnnUtils::GraphTopologicalSort<int>(targetNodes, getNodeInputs, output);
245
246 BOOST_TEST(!sortCompleted);
247 }
248
BOOST_AUTO_TEST_CASE(PermuteQuantizationDim)249 BOOST_AUTO_TEST_CASE(PermuteQuantizationDim)
250 {
251 std::vector<float> scales;
252
253 // Set QuantizationDim to be index 1
254 const armnn::TensorInfo info({ 1, 2, 3, 4 }, armnn::DataType::Float32, scales, 1U);
255 BOOST_CHECK(info.GetQuantizationDim().value() == 1U);
256
257 // Permute so that index 1 moves to final index i.e. index 3
258 armnn::PermutationVector mappings({ 0, 3, 2, 1 });
259 auto permutedPerChannel = armnnUtils::Permuted(info, mappings, true);
260 auto permuted = armnnUtils::Permuted(info, mappings);
261
262 // Check that QuantizationDim is in index 3
263 BOOST_CHECK(permutedPerChannel.GetQuantizationDim().value() == 3U);
264
265 // Check previous implementation unchanged
266 BOOST_CHECK(permuted.GetQuantizationDim().value() == 1U);
267 }
268
269 BOOST_AUTO_TEST_SUITE_END()
270