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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/*
* Copyright (c) 2017 ARM Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef __ARM_COMPUTE_TEST_VALIDATION_HELPERS_H__
#define __ARM_COMPUTE_TEST_VALIDATION_HELPERS_H__
#include "arm_compute/core/Types.h"
#include "arm_compute/core/Utils.h"
#include "tests/Globals.h"
#include <random>
#include <type_traits>
#include <utility>
namespace arm_compute
{
namespace test
{
namespace validation
{
template <typename T>
struct is_floating_point : public std::is_floating_point<T>
{
};
template <>
struct is_floating_point<half> : public std::true_type
{
};
/** Helper function to get the testing range for each activation layer.
*
* @param[in] activation Activation function to test.
* @param[in] data_type Data type.
* @param[in] fixed_point_position Number of bits for the fractional part. Defaults to 1.
*
* @return A pair containing the lower upper testing bounds for a given function.
*/
template <typename T>
std::pair<T, T> get_activation_layer_test_bounds(ActivationLayerInfo::ActivationFunction activation, DataType data_type, int fixed_point_position = 0)
{
std::pair<T, T> bounds;
switch(data_type)
{
case DataType::F16:
{
using namespace half_float::literal;
switch(activation)
{
case ActivationLayerInfo::ActivationFunction::SQUARE:
case ActivationLayerInfo::ActivationFunction::LOGISTIC:
case ActivationLayerInfo::ActivationFunction::SOFT_RELU:
// Reduce range as exponent overflows
bounds = std::make_pair(-10._h, 10._h);
break;
case ActivationLayerInfo::ActivationFunction::SQRT:
// Reduce range as sqrt should take a non-negative number
bounds = std::make_pair(0._h, 255._h);
break;
default:
bounds = std::make_pair(-255._h, 255._h);
break;
}
break;
}
case DataType::F32:
switch(activation)
{
case ActivationLayerInfo::ActivationFunction::LOGISTIC:
case ActivationLayerInfo::ActivationFunction::SOFT_RELU:
// Reduce range as exponent overflows
bounds = std::make_pair(-40.f, 40.f);
break;
case ActivationLayerInfo::ActivationFunction::SQRT:
// Reduce range as sqrt should take a non-negative number
bounds = std::make_pair(0.f, 255.f);
break;
default:
bounds = std::make_pair(-255.f, 255.f);
break;
}
break;
case DataType::QS8:
case DataType::QS16:
switch(activation)
{
case ActivationLayerInfo::ActivationFunction::LOGISTIC:
case ActivationLayerInfo::ActivationFunction::SOFT_RELU:
case ActivationLayerInfo::ActivationFunction::TANH:
// Reduce range as exponent overflows
bounds = std::make_pair(-(1 << fixed_point_position), 1 << fixed_point_position);
break;
case ActivationLayerInfo::ActivationFunction::SQRT:
// Reduce range as sqrt should take a non-negative number
// Can't be zero either as inv_sqrt is used in NEON.
bounds = std::make_pair(1, std::numeric_limits<T>::max());
break;
default:
bounds = std::make_pair(std::numeric_limits<T>::lowest(), std::numeric_limits<T>::max());
break;
}
break;
default:
ARM_COMPUTE_ERROR("Unsupported data type");
}
return bounds;
}
/** Fill mask with the corresponding given pattern.
*
* @param[in,out] mask Mask to be filled according to pattern
* @param[in] cols Columns (width) of mask
* @param[in] rows Rows (height) of mask
* @param[in] pattern Pattern to fill the mask according to
*/
inline void fill_mask_from_pattern(uint8_t *mask, int cols, int rows, MatrixPattern pattern)
{
unsigned int v = 0;
std::mt19937 gen(library->seed());
std::bernoulli_distribution dist(0.5);
for(int r = 0; r < rows; ++r)
{
for(int c = 0; c < cols; ++c, ++v)
{
uint8_t val = 0;
switch(pattern)
{
case MatrixPattern::BOX:
val = 255;
break;
case MatrixPattern::CROSS:
val = ((r == (rows / 2)) || (c == (cols / 2))) ? 255 : 0;
break;
case MatrixPattern::DISK:
val = (((r - rows / 2.0f + 0.5f) * (r - rows / 2.0f + 0.5f)) / ((rows / 2.0f) * (rows / 2.0f)) + ((c - cols / 2.0f + 0.5f) * (c - cols / 2.0f + 0.5f)) / ((cols / 2.0f) *
(cols / 2.0f))) <= 1.0f ? 255 : 0;
break;
case MatrixPattern::OTHER:
val = (dist(gen) ? 0 : 255);
break;
default:
return;
}
mask[v] = val;
}
}
if(pattern == MatrixPattern::OTHER)
{
std::uniform_int_distribution<uint8_t> distribution_u8(0, ((cols * rows) - 1));
mask[distribution_u8(gen)] = 255;
}
}
/** Calculate output tensor shape give a vector of input tensor to concatenate
*
* @param[in] input_shapes Shapes of the tensors to concatenate across depth.
*
* @return The shape of output concatenated tensor.
*/
TensorShape calculate_depth_concatenate_shape(const std::vector<TensorShape> &input_shapes);
/** Helper function to fill the Lut random by a ILutAccessor.
*
* @param[in,out] table Accessor at the Lut.
*
*/
template <typename T>
void fill_lookuptable(T &&table)
{
std::mt19937 generator(library->seed());
std::uniform_int_distribution<typename T::value_type> distribution(std::numeric_limits<typename T::value_type>::min(), std::numeric_limits<typename T::value_type>::max());
for(int i = std::numeric_limits<typename T::value_type>::min(); i <= std::numeric_limits<typename T::value_type>::max(); i++)
{
table[i] = distribution(generator);
}
}
/** Helper function to get the testing range for batch normalization layer.
*
* @param[in] fixed_point_position (Optional) Number of bits for the fractional part. Defaults to 1.
*
* @return A pair containing the lower upper testing bounds.
*/
template <typename T>
std::pair<T, T> get_batchnormalization_layer_test_bounds(int fixed_point_position = 1)
{
bool is_float = std::is_floating_point<T>::value;
std::pair<T, T> bounds;
// Set initial values
if(is_float)
{
bounds = std::make_pair(-1.f, 1.f);
}
else
{
bounds = std::make_pair(1, 1 << (fixed_point_position));
}
return bounds;
}
} // namespace validation
} // namespace test
} // namespace arm_compute
#endif /* __ARM_COMPUTE_TEST_VALIDATION_HELPERS_H__ */
|
