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
|
/*
* 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_REFERENCE_VALIDATION_H__
#define __ARM_COMPUTE_TEST_REFERENCE_VALIDATION_H__
#include "arm_compute/core/Types.h"
#include "arm_compute/runtime/Array.h"
#include "boost_wrapper.h"
#include <vector>
namespace arm_compute
{
class Tensor;
namespace test
{
class RawTensor;
class IAccessor;
namespace validation
{
template <typename T>
boost::test_tools::predicate_result compare_dimensions(const Dimensions<T> &dimensions1, const Dimensions<T> &dimensions2)
{
if(dimensions1.num_dimensions() != dimensions2.num_dimensions())
{
boost::test_tools::predicate_result result(false);
result.message() << "Different dimensionality [" << dimensions1.num_dimensions() << "!=" << dimensions2.num_dimensions() << "]";
return result;
}
for(unsigned int i = 0; i < dimensions1.num_dimensions(); ++i)
{
if(dimensions1[i] != dimensions2[i])
{
boost::test_tools::predicate_result result(false);
result.message() << "Mismatch in dimension " << i << " [" << dimensions1[i] << "!=" << dimensions2[i] << "]";
return result;
}
}
return true;
}
/** Validate valid regions.
*
* - Dimensionality has to be the same.
* - Anchors have to match.
* - Shapes have to match.
*/
void validate(const arm_compute::ValidRegion ®ion, const arm_compute::ValidRegion &reference);
/** Validate padding.
*
* Padding on all sides has to be the same.
*/
void validate(const arm_compute::PaddingSize &padding, const arm_compute::PaddingSize &reference);
/** Validate tensors.
*
* - Dimensionality has to be the same.
* - All values have to match.
*
* @note: wrap_range allows cases where reference tensor rounds up to the wrapping point, causing it to wrap around to
* zero while the test tensor stays at wrapping point to pass. This may permit true erroneous cases (difference between
* reference tensor and test tensor is multiple of wrap_range), but such errors would be detected by
* other test cases.
*/
void validate(const IAccessor &tensor, const RawTensor &reference, float tolerance_value = 0.f, float tolerance_number = 0.f, uint64_t wrap_range = 0);
/** Validate tensors with valid region.
*
* - Dimensionality has to be the same.
* - All values have to match.
*
* @note: wrap_range allows cases where reference tensor rounds up to the wrapping point, causing it to wrap around to
* zero while the test tensor stays at wrapping point to pass. This may permit true erroneous cases (difference between
* reference tensor and test tensor is multiple of wrap_range), but such errors would be detected by
* other test cases.
*/
void validate(const IAccessor &tensor, const RawTensor &reference, const ValidRegion &valid_region, float tolerance_value = 0.f, float tolerance_number = 0.f, uint64_t wrap_range = 0);
/** Validate tensors against constant value.
*
* - All values have to match.
*/
void validate(const IAccessor &tensor, const void *reference_value);
/** Validate border against a constant value.
*
* - All border values have to match the specified value if mode is CONSTANT.
* - All border values have to be replicated if mode is REPLICATE.
* - Nothing is validated for mode UNDEFINED.
*/
void validate(const IAccessor &tensor, BorderSize border_size, const BorderMode &border_mode, const void *border_value);
/** Validate classified labels against expected ones.
*
* - All values should match
*/
void validate(std::vector<unsigned int> classified_labels, std::vector<unsigned int> expected_labels);
/** Validate float value.
*
* - All values should match
*/
void validate(float target, float ref, float tolerance_abs_error = std::numeric_limits<float>::epsilon(), float tolerance_relative_error = 0.0001f);
/** Validate min max location.
*
* - All values should match
*/
template <typename T>
void validate_min_max_loc(T min, T ref_min, T max, T ref_max,
IArray<Coordinates2D> &min_loc, IArray<Coordinates2D> &ref_min_loc, IArray<Coordinates2D> &max_loc, IArray<Coordinates2D> &ref_max_loc,
uint32_t min_count, uint32_t ref_min_count, uint32_t max_count, uint32_t ref_max_count)
{
BOOST_TEST(min == ref_min);
BOOST_TEST(max == ref_max);
BOOST_TEST(min_count == min_loc.num_values());
BOOST_TEST(max_count == max_loc.num_values());
BOOST_TEST(ref_min_count == ref_min_loc.num_values());
BOOST_TEST(ref_max_count == ref_max_loc.num_values());
BOOST_TEST(min_count == ref_min_count);
BOOST_TEST(max_count == ref_max_count);
for(uint32_t i = 0; i < min_count; i++)
{
Coordinates2D *same_coords = std::find_if(ref_min_loc.buffer(), ref_min_loc.buffer() + min_count, [&min_loc, i](Coordinates2D coord)
{
return coord.x == min_loc.at(i).x && coord.y == min_loc.at(i).y;
});
BOOST_TEST(same_coords != ref_min_loc.buffer() + min_count);
}
for(uint32_t i = 0; i < max_count; i++)
{
Coordinates2D *same_coords = std::find_if(ref_max_loc.buffer(), ref_max_loc.buffer() + max_count, [&max_loc, i](Coordinates2D coord)
{
return coord.x == max_loc.at(i).x && coord.y == max_loc.at(i).y;
});
BOOST_TEST(same_coords != ref_max_loc.buffer() + max_count);
}
}
} // namespace validation
} // namespace test
} // namespace arm_compute
#endif /* __ARM_COMPUTE_TEST_REFERENCE_VALIDATION_H__ */
|
