blob: 2b653c1665b70e74095d38409f2efa930929e04b [file] [log] [blame]
XNNPACK Teamb455b122019-09-27 18:10:33 -07001// Copyright (c) Facebook, Inc. and its affiliates.
2// All rights reserved.
3//
4// Copyright 2019 Google LLC
5//
6// This source code is licensed under the BSD-style license found in the
7// LICENSE file in the root directory of this source tree.
8
9#pragma once
10
11#include <gtest/gtest.h>
12
13#include <algorithm>
14#include <cassert>
15#include <cmath>
16#include <cstddef>
17#include <cstdlib>
18#include <functional>
19#include <random>
20#include <vector>
21
22#include <xnnpack.h>
23#include <xnnpack/AlignedAllocator.h>
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -070024#include <xnnpack/params-init.h>
Frank Barcharde0601b52019-10-25 17:43:34 -070025#include <xnnpack/params.h>
XNNPACK Teamb455b122019-09-27 18:10:33 -070026#include <xnnpack/requantization.h>
27
28
29class GAvgPoolMicrokernelTester {
30 public:
31 enum class Variant {
32 Native,
33 Scalar,
34 };
35
36 inline GAvgPoolMicrokernelTester& m(size_t m) {
37 assert(m != 0);
38 this->m_ = m;
39 return *this;
40 }
41
42 inline size_t m() const {
43 return this->m_;
44 }
45
46 inline GAvgPoolMicrokernelTester& n(size_t n) {
47 assert(n != 0);
48 this->n_ = n;
49 return *this;
50 }
51
52 inline size_t n() const {
53 return this->n_;
54 }
55
56 inline GAvgPoolMicrokernelTester& nr(size_t nr) {
57 assert(nr != 0);
58 this->nr_ = nr;
59 return *this;
60 }
61
62 inline size_t nr() const {
63 return this->nr_;
64 }
65
66 inline GAvgPoolMicrokernelTester& x_stride(size_t x_stride) {
67 assert(x_stride != 0);
68 this->x_stride_ = x_stride;
69 return *this;
70 }
71
72 inline size_t x_stride() const {
73 if (this->x_stride_ == 0) {
74 return n();
75 } else {
76 assert(this->x_stride_ >= n());
77 return this->x_stride_;
78 }
79 }
80
81 inline GAvgPoolMicrokernelTester& x_scale(float x_scale) {
82 assert(x_scale > 0.0f);
83 assert(std::isnormal(x_scale));
84 this->x_scale_ = x_scale;
85 return *this;
86 }
87
88 inline float x_scale() const {
89 return this->x_scale_;
90 }
91
92 inline GAvgPoolMicrokernelTester& x_zero_point(uint8_t x_zero_point) {
93 this->x_zero_point_ = x_zero_point;
94 return *this;
95 }
96
97 inline uint8_t x_zero_point() const {
98 return this->x_zero_point_;
99 }
100
101 inline GAvgPoolMicrokernelTester& y_scale(float y_scale) {
102 assert(y_scale > 0.0f);
103 assert(std::isnormal(y_scale));
104 this->y_scale_ = y_scale;
105 return *this;
106 }
107
108 inline float y_scale() const {
109 return this->y_scale_;
110 }
111
112 inline GAvgPoolMicrokernelTester& y_zero_point(uint8_t y_zero_point) {
113 this->y_zero_point_ = y_zero_point;
114 return *this;
115 }
116
117 inline uint8_t y_zero_point() const {
118 return this->y_zero_point_;
119 }
120
121 inline GAvgPoolMicrokernelTester& qmin(uint8_t qmin) {
122 this->qmin_ = qmin;
123 return *this;
124 }
125
126 inline uint8_t qmin() const {
127 return this->qmin_;
128 }
129
130 inline GAvgPoolMicrokernelTester& qmax(uint8_t qmax) {
131 this->qmax_ = qmax;
132 return *this;
133 }
134
135 inline uint8_t qmax() const {
136 return this->qmax_;
137 }
138
139 inline GAvgPoolMicrokernelTester& iterations(size_t iterations) {
140 this->iterations_ = iterations;
141 return *this;
142 }
143
144 inline size_t iterations() const {
145 return this->iterations_;
146 }
147
148 void Test(xnn_q8_gavgpool_up_ukernel_function gavgpool, Variant variant = Variant::Native) const {
149 std::random_device random_device;
150 auto rng = std::mt19937(random_device());
151 auto u8rng = std::bind(std::uniform_int_distribution<uint8_t>(), rng);
152
153 std::vector<uint8_t> x((m() - 1) * x_stride() + n() + XNN_EXTRA_BYTES / sizeof(uint8_t));
154 std::vector<uint8_t> zero(n() + XNN_EXTRA_BYTES / sizeof(uint8_t));
155 std::vector<uint8_t> y(n());
156 std::vector<uint8_t> y_ref(n());
157 std::vector<float> y_fp(n());
158 std::vector<int32_t> y_acc(n());
159 for (size_t iteration = 0; iteration < iterations(); iteration++) {
160 std::generate(x.begin(), x.end(), std::ref(u8rng));
161 std::fill(y.begin(), y.end(), 0xA5);
162
163 // Prepare quantization parameters.
164 union xnn_q8_avgpool_params quantization_params = { };
165 switch (variant) {
166 case Variant::Native:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700167 quantization_params = xnn_init_q8_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700168 -int32_t(x_zero_point()) * int32_t(m()),
169 x_scale() / (y_scale() * float(m())),
170 y_zero_point(), qmin(), qmax());
171 break;
172 case Variant::Scalar:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700173 quantization_params = xnn_init_scalar_q8_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700174 -int32_t(x_zero_point()) * int32_t(m()),
175 x_scale() / (y_scale() * float(m())),
176 y_zero_point(), qmin(), qmax());
177 break;
178 }
179 const union xnn_q8_avgpool_params scalar_quantization_params =
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700180 xnn_init_scalar_q8_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700181 -int32_t(x_zero_point()) * int32_t(m()),
182 x_scale() / (y_scale() * float(m())),
183 y_zero_point(), qmin(), qmax());
184
185 // Compute reference results.
186 for (size_t j = 0; j < n(); j++) {
187 int32_t acc = scalar_quantization_params.scalar.bias;
188 for (size_t i = 0; i < m(); i++) {
189 acc += x[i * x_stride() + j];
190 }
191 y_acc[j] = acc;
192 y_ref[j] = xnn_avgpool_quantize(acc, scalar_quantization_params);
193 y_fp[j] = float(acc) * (x_scale() / (y_scale() * float(m()))) + float(y_zero_point());
194 y_fp[j] = std::min<float>(y_fp[j], float(qmax()));
195 y_fp[j] = std::max<float>(y_fp[j], float(qmin()));
196 }
197
198 // Call optimized micro-kernel.
199 gavgpool(m(), n(),
200 x.data(), x_stride() * sizeof(uint8_t),
201 zero.data(),
202 y.data(),
203 &quantization_params);
204
205 // Verify results.
206 for (size_t i = 0; i < n(); i++) {
207 ASSERT_LE(uint32_t(y[i]), uint32_t(qmax()))
208 << "at position " << i << ", m = " << m() << ", n = " << n();
209 ASSERT_GE(uint32_t(y[i]), uint32_t(qmin()))
210 << "at position " << i << ", m = " << m() << ", n = " << n();
211 ASSERT_NEAR(float(int32_t(y[i])), y_fp[i], 0.5f)
212 << "at position " << i << ", m = " << m() << ", n = " << n() << ", acc = " << y_acc[i];
213 ASSERT_EQ(uint32_t(y_ref[i]), uint32_t(y[i]))
214 << "at position " << i << ", m = " << m() << ", n = " << n() << ", acc = " << y_acc[i];
215 }
216 }
217 }
218
219 void Test(xnn_q8_gavgpool_mp_ukernel_function gavgpool, Variant variant = Variant::Native) const {
220 std::random_device random_device;
221 auto rng = std::mt19937(random_device());
222 auto u8rng = std::bind(std::uniform_int_distribution<uint8_t>(), rng);
223
224 std::vector<uint8_t> x((m() - 1) * x_stride() + n() + XNN_EXTRA_BYTES / sizeof(uint8_t));
Marat Dukhan9594db02019-12-05 14:32:37 -0800225 std::vector<int32_t, AlignedAllocator<int32_t, 64>> buf(n() + XNN_EXTRA_BYTES / sizeof(uint8_t));
XNNPACK Teamb455b122019-09-27 18:10:33 -0700226 std::vector<uint8_t> zero(n() + XNN_EXTRA_BYTES / sizeof(uint8_t));
227 std::vector<uint8_t> y(n());
228 std::vector<uint8_t> y_ref(n());
229 std::vector<float> y_fp(n());
230 std::vector<int32_t> y_acc(n());
231 for (size_t iteration = 0; iteration < iterations(); iteration++) {
232 std::generate(x.begin(), x.end(), std::ref(u8rng));
233 std::fill(y.begin(), y.end(), 0xA5);
234
235 // Prepare quantization parameters.
236 union xnn_q8_avgpool_params quantization_params = { };
237 switch (variant) {
238 case Variant::Native:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700239 quantization_params = xnn_init_q8_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700240 -int32_t(x_zero_point()) * int32_t(m()),
241 x_scale() / (y_scale() * float(m())),
242 y_zero_point(), qmin(), qmax());
243 break;
244 case Variant::Scalar:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700245 quantization_params = xnn_init_scalar_q8_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700246 -int32_t(x_zero_point()) * int32_t(m()),
247 x_scale() / (y_scale() * float(m())),
248 y_zero_point(), qmin(), qmax());
249 break;
250 }
251 const union xnn_q8_avgpool_params scalar_quantization_params =
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700252 xnn_init_scalar_q8_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700253 -int32_t(x_zero_point()) * int32_t(m()),
254 x_scale() / (y_scale() * float(m())),
255 y_zero_point(), qmin(), qmax());
256
257 // Compute reference results.
258 for (size_t j = 0; j < n(); j++) {
259 int32_t acc = scalar_quantization_params.scalar.bias;
260 for (size_t i = 0; i < m(); i++) {
261 acc += x[i * x_stride() + j];
262 }
263
264 y_acc[j] = acc;
265 y_ref[j] = xnn_avgpool_quantize(acc, scalar_quantization_params);
266 y_fp[j] = float(acc) * (x_scale() / (y_scale() * float(m()))) + float(y_zero_point());
267 y_fp[j] = std::min<float>(y_fp[j], float(qmax()));
268 y_fp[j] = std::max<float>(y_fp[j], float(qmin()));
269 }
270
271 // Call optimized micro-kernel.
272 gavgpool(m(), n(),
273 x.data(), x_stride() * sizeof(uint8_t),
274 zero.data(),
275 buf.data(),
276 y.data(),
277 &quantization_params);
278
279 // Verify results.
280 for (size_t i = 0; i < n(); i++) {
281 ASSERT_LE(uint32_t(y[i]), uint32_t(qmax()))
282 << "at position " << i << ", m = " << m() << ", n = " << n();
283 ASSERT_GE(uint32_t(y[i]), uint32_t(qmin()))
284 << "at position " << i << ", m = " << m() << ", n = " << n();
285 ASSERT_NEAR(float(int32_t(y[i])), y_fp[i], 0.5f)
286 << "at position " << i << ", m = " << m() << ", n = " << n() << ", acc = " << y_acc[i];
287 ASSERT_EQ(uint32_t(y_ref[i]), uint32_t(y[i]))
288 << "at position " << i << ", m = " << m() << ", n = " << n() << ", acc = " << y_acc[i];
289 }
290 }
291 }
292
293 void Test(xnn_f32_gavgpool_up_ukernel_function gavgpool, Variant variant = Variant::Native) const {
294 std::random_device random_device;
295 auto rng = std::mt19937(random_device());
296 auto f32rng = std::bind(std::uniform_real_distribution<float>(), rng);
297
298 std::vector<float> x((m() - 1) * x_stride() + n() + XNN_EXTRA_BYTES / sizeof(float));
299 std::vector<float> zero(n() + XNN_EXTRA_BYTES / sizeof(float));
300 std::vector<float> y(n());
301 std::vector<float> y_ref(n());
302
303 std::fill(zero.begin(), zero.end(), 0.0f);
304 for (size_t iteration = 0; iteration < iterations(); iteration++) {
305 std::generate(x.begin(), x.end(), std::ref(f32rng));
306 std::fill(y.begin(), y.end(), std::nanf(""));
307
308 // Compute reference results, without clamping.
309 for (size_t j = 0; j < n(); j++) {
310 float acc = 0.0f;
311 for (size_t i = 0; i < m(); i++) {
312 acc += x[i * x_stride() + j];
313 }
314 y_ref[j] = acc / float(m());
315 }
316
317 // Compute clamping parameters.
318 const float accumulated_min = *std::min_element(y_ref.cbegin(), y_ref.cend());
319 const float accumulated_max = *std::max_element(y_ref.cbegin(), y_ref.cend());
320 const float accumulated_range = accumulated_max - accumulated_min;
321 const float y_min = accumulated_min + float(qmin()) / 255.0f * accumulated_range;
322 const float y_max = accumulated_max - float(255 - qmax()) / 255.0f * accumulated_range;
323
324 // Clamp reference results.
325 for (float& y_value : y_ref) {
326 y_value = std::max(std::min(y_value, y_max), y_min);
327 }
328
329 // Prepare micro-kernel parameters.
330 union xnn_f32_avgpool_params params = { };
331 switch (variant) {
332 case Variant::Native:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700333 params = xnn_init_f32_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700334 1.0f / float(m()), y_min, y_max);
335 break;
336 case Variant::Scalar:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700337 params = xnn_init_scalar_f32_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700338 1.0f / float(m()), y_min, y_max);
339 break;
340 }
341
342 // Call optimized micro-kernel.
343 gavgpool(m(), n(),
344 x.data(), x_stride() * sizeof(float),
345 zero.data(),
346 y.data(),
347 &params);
348
349 // Verify results.
350 for (size_t i = 0; i < n(); i++) {
351 ASSERT_LE(y[i], y_max)
352 << "at position " << i << ", m = " << m() << ", n = " << n();
353 ASSERT_GE(y[i], y_min)
354 << "at position " << i << ", m = " << m() << ", n = " << n();
355 ASSERT_NEAR(y[i], y_ref[i], std::abs(y_ref[i]) * 1.0e-6f)
356 << "at position " << i << ", m = " << m() << ", n = " << n();
357 }
358 }
359 }
360
361 void Test(xnn_f32_gavgpool_mp_ukernel_function gavgpool, Variant variant = Variant::Native) const {
362 std::random_device random_device;
363 auto rng = std::mt19937(random_device());
364 auto f32rng = std::bind(std::uniform_real_distribution<float>(), rng);
365
366 std::vector<float> x((m() - 1) * x_stride() + n() + XNN_EXTRA_BYTES / sizeof(float));
Marat Dukhan9594db02019-12-05 14:32:37 -0800367 std::vector<float, AlignedAllocator<float, 64>> buf(n() + XNN_EXTRA_BYTES / sizeof(float));
XNNPACK Teamb455b122019-09-27 18:10:33 -0700368 std::vector<float> zero(n() + XNN_EXTRA_BYTES / sizeof(float));
369 std::vector<float> y(n());
370 std::vector<float> y_ref(n());
371 for (size_t iteration = 0; iteration < iterations(); iteration++) {
372 std::generate(x.begin(), x.end(), std::ref(f32rng));
373 std::fill(y.begin(), y.end(), std::nanf(""));
374
375 // Compute reference results, without clamping.
376 for (size_t j = 0; j < n(); j++) {
377 float acc = 0.0f;
378 for (size_t i = 0; i < m(); i++) {
379 acc += x[i * x_stride() + j];
380 }
381 y_ref[j] = acc / float(m());
382 }
383
384 // Compute clamping parameters.
385 const float accumulated_min = *std::min_element(y_ref.cbegin(), y_ref.cend());
386 const float accumulated_max = *std::max_element(y_ref.cbegin(), y_ref.cend());
387 const float accumulated_range = accumulated_max - accumulated_min;
388 const float y_min = accumulated_min + float(qmin()) / 255.0f * accumulated_range;
389 const float y_max = accumulated_max - float(255 - qmax()) / 255.0f * accumulated_range;
390
391 // Prepare micro-kernel parameters.
392 union xnn_f32_avgpool_params params = { };
393 switch (variant) {
394 case Variant::Native:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700395 params = xnn_init_f32_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700396 1.0f / float(m()), y_min, y_max);
397 break;
398 case Variant::Scalar:
Marat Dukhaneeaa7bd2019-10-25 17:31:25 -0700399 params = xnn_init_scalar_f32_avgpool_params(
XNNPACK Teamb455b122019-09-27 18:10:33 -0700400 1.0f / float(m()), y_min, y_max);
401 break;
402 }
403
404 // Clamp reference results.
405 for (float& y_value : y_ref) {
406 y_value = std::max(std::min(y_value, y_max), y_min);
407 }
408
409 // Call optimized micro-kernel.
410 gavgpool(m(), n(),
411 x.data(), x_stride() * sizeof(float),
412 zero.data(),
413 buf.data(),
414 y.data(),
415 &params);
416
417 // Verify results.
418 for (size_t i = 0; i < n(); i++) {
419 ASSERT_LE(y[i], y_max)
420 << "at position " << i << ", m = " << m() << ", n = " << n();
421 ASSERT_GE(y[i], y_min)
422 << "at position " << i << ", m = " << m() << ", n = " << n();
423 ASSERT_NEAR(y[i], y_ref[i], std::abs(y_ref[i]) * 1.0e-6f)
424 << "at position " << i << ", m = " << m() << ", n = " << n();
425 }
426 }
427 }
428
429 private:
430 size_t m_{1};
431 size_t n_{1};
432 size_t nr_{1};
433 size_t x_stride_{0};
434 float x_scale_{1.25f};
435 float y_scale_{0.75f};
436 uint8_t x_zero_point_{121};
437 uint8_t y_zero_point_{133};
438 uint8_t qmin_{0};
439 uint8_t qmax_{255};
440 size_t iterations_{15};
441};