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
|
/***************************************************************************
* Copyright (c) Johan Mabille, Sylvain Corlay, Wolf Vollprecht and *
* Martin Renou *
* Copyright (c) QuantStack *
* Copyright (c) Serge Guelton *
* *
* Distributed under the terms of the BSD 3-Clause License. *
* *
* The full license is in the file LICENSE, distributed with this software. *
****************************************************************************/
#include "xsimd/xsimd.hpp"
#ifndef XSIMD_NO_SUPPORTED_ARCHITECTURE
#include "test_utils.hpp"
template <class B>
struct select_test
{
using batch_type = B;
using batch_bool_type = typename B::batch_bool_type;
using value_type = typename B::value_type;
using arch_type = typename B::arch_type;
static constexpr size_t size = B::size;
static constexpr size_t nb_input = size * 10000;
using vector_type = std::array<value_type, nb_input>;
using vector_bool_type = std::array<bool, nb_input>;
vector_type lhs_input;
vector_type rhs_input;
vector_type expected;
vector_type res;
vector_bool_type lhs_input_b;
vector_bool_type rhs_input_b;
vector_bool_type expected_b;
vector_bool_type res_b;
select_test()
{
auto clamp = [](double v)
{
return static_cast<value_type>(std::min(v, static_cast<double>(std::numeric_limits<value_type>::max())));
};
for (size_t i = 0; i < nb_input; ++i)
{
lhs_input[i] = clamp(i / 4 + 1.2 * std::sqrt(i + 0.25));
rhs_input[i] = clamp(10.2 / (i + 2) + 0.25);
lhs_input_b[i] = (int)lhs_input[i] % 2;
rhs_input_b[i] = (int)rhs_input[i] % 2;
}
}
void test_select_dynamic()
{
for (size_t i = 0; i < nb_input; ++i)
{
expected[i] = lhs_input[i] > value_type(3) ? lhs_input[i] : rhs_input[i];
expected_b[i] = lhs_input[i] > value_type(3) ? lhs_input_b[i] : rhs_input_b[i];
}
batch_type lhs_in, rhs_in;
batch_bool_type lhs_in_b, rhs_in_b;
for (size_t i = 0; i < nb_input; i += size)
{
detail::load_batch(lhs_in, lhs_input, i);
detail::load_batch(rhs_in, rhs_input, i);
const auto out = xsimd::select(lhs_in > value_type(3), lhs_in, rhs_in);
detail::store_batch(out, res, i);
detail::load_batch(lhs_in_b, lhs_input_b, i);
detail::load_batch(rhs_in_b, rhs_input_b, i);
const auto out_b = xsimd::select(lhs_in > value_type(3), lhs_in_b, rhs_in_b);
detail::store_batch(out_b, res_b, i);
}
size_t diff = detail::get_nb_diff(res, expected);
size_t diff_b = detail::get_nb_diff(res_b, expected_b);
CHECK_EQ(diff, 0);
CHECK_EQ(diff_b, 0);
}
struct pattern
{
static constexpr bool get(std::size_t i, std::size_t) { return i % 2; }
};
void test_select_static()
{
constexpr auto mask = xsimd::make_batch_bool_constant<value_type, pattern, arch_type>();
for (size_t i = 0; i < nb_input; ++i)
{
expected[i] = mask.get(i % size) ? lhs_input[i] : rhs_input[i];
expected_b[i] = mask.get(i % size) ? lhs_input_b[i] : rhs_input_b[i];
}
batch_type lhs_in, rhs_in;
batch_bool_type lhs_in_b, rhs_in_b;
for (size_t i = 0; i < nb_input; i += size)
{
detail::load_batch(lhs_in, lhs_input, i);
detail::load_batch(rhs_in, rhs_input, i);
const auto out = xsimd::select(mask, lhs_in, rhs_in);
detail::store_batch(out, res, i);
detail::load_batch(lhs_in_b, lhs_input_b, i);
detail::load_batch(rhs_in_b, rhs_input_b, i);
const auto out_b = xsimd::select(mask, lhs_in_b, rhs_in_b);
detail::store_batch(out_b, res_b, i);
}
size_t diff = detail::get_nb_diff(res, expected);
size_t diff_b = detail::get_nb_diff(res_b, expected_b);
CHECK_EQ(diff, 0);
CHECK_EQ(diff_b, 0);
}
};
TEST_CASE_TEMPLATE("[select]", B, BATCH_TYPES)
{
// Allocate on heap to avoid stack overflow from excessively large object.
std::unique_ptr<select_test<B>> Test { new select_test<B> };
SUBCASE("select_dynamic") { Test->test_select_dynamic(); }
SUBCASE("select_static") { Test->test_select_static(); }
}
#endif
|