// Copyright 2019 Google LLC // // This source code is licensed under the BSD-style license found in the // LICENSE file in the root directory of this source tree. #pragma once #include #include #include #include #include #include #include #include #include #include #include class RAddStoreExpMinusMaxMicrokernelTester { public: inline RAddStoreExpMinusMaxMicrokernelTester& elements(size_t elements) { assert(elements != 0); this->elements_ = elements; return *this; } inline size_t elements() const { return this->elements_; } inline RAddStoreExpMinusMaxMicrokernelTester& iterations(size_t iterations) { this->iterations_ = iterations; return *this; } inline size_t iterations() const { return this->iterations_; } void Test(xnn_f32_raddstoreexpminusmax_ukernel_function raddstoreexpminusmax, xnn_init_f32_expminus_params_fn init_params) const { std::random_device random_device; auto rng = std::mt19937(random_device()); // Choose such range that expf(x[i]) overflows, but expf(x[i] - x_max) doesn't. // However, the range is still narrow enough that double-precision exp doesn't overflow. auto f32rng = std::bind(std::uniform_real_distribution(90.0f, 100.0f), rng); std::vector x(elements() + XNN_EXTRA_BYTES / sizeof(float)); std::vector y(elements()); std::vector y_ref(elements()); for (size_t iteration = 0; iteration < iterations(); iteration++) { std::generate(x.begin(), x.end(), std::ref(f32rng)); std::fill(y.begin(), y.end(), std::nanf("")); // Compute reference results. double sum_ref = 0.0f; const float x_max = *std::max_element(x.begin(), x.begin() + elements()); for (size_t i = 0; i < elements(); i++) { const double y_ref_value = exp(double(x[i]) - double(x_max)); y_ref[i] = y_ref_value; sum_ref += y_ref_value; } // Call optimized micro-kernel. float sum = std::nanf(""); xnn_f32_expminus_params params; init_params(¶ms); raddstoreexpminusmax(elements() * sizeof(float), x.data(), &x_max, y.data(), &sum, ¶ms); // Verify results. for (size_t i = 0; i < elements(); i++) { ASSERT_NEAR(y_ref[i], double(y[i]), std::abs(y_ref[i]) * 1.0e-6) << "i = " << i << ", elements = " << elements() << ", x_max = " << x_max; } ASSERT_NEAR(sum_ref, double(sum), std::abs(sum_ref) * 1.0e-6) << "elements = " << elements() << ", x_max = " << x_max; } } private: size_t elements_{1}; size_t iterations_{15}; };