| // Copyright 2019 Google LLC | |
| // SPDX-License-Identifier: Apache-2.0 | |
| // | |
| // Licensed under the Apache License, Version 2.0 (the "License"); | |
| // you may not use this file except in compliance with the License. | |
| // You may obtain a copy of the License at | |
| // | |
| // http://www.apache.org/licenses/LICENSE-2.0 | |
| // | |
| // Unless required by applicable law or agreed to in writing, software | |
| // distributed under the License is distributed on an "AS IS" BASIS, | |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| // See the License for the specific language governing permissions and | |
| // limitations under the License. | |
| // For faster Arm builds. We still test SVE2_128, SVE and HWY_NEON_WITHOUT_AES | |
| // (HWY_NEON may already be disabled, which would leave only EMU128). | |
| #ifndef HWY_DISABLED_TARGETS | |
| #define HWY_DISABLED_TARGETS (HWY_SVE_256 | HWY_NEON | HWY_SVE2) | |
| #endif | |
| #undef HWY_TARGET_INCLUDE | |
| #define HWY_TARGET_INCLUDE "tests/minmax_test.cc" | |
| #include "hwy/foreach_target.h" // IWYU pragma: keep | |
| #include "hwy/highway.h" | |
| #include "hwy/nanobenchmark.h" // Unpredictable1 | |
| #include "hwy/tests/test_util-inl.h" | |
| HWY_BEFORE_NAMESPACE(); | |
| namespace hwy { | |
| namespace HWY_NAMESPACE { | |
| namespace { | |
| struct TestUnsignedMinMax { | |
| template <typename T, class D> | |
| HWY_NOINLINE void operator()(T /*unused*/, D d) { | |
| const Vec<D> v0 = Zero(d); | |
| // Leave headroom such that v1 < v2 even after wraparound. | |
| const Vec<D> mod = And(Iota(d, 0), Set(d, LimitsMax<T>() >> 1)); | |
| const Vec<D> v1 = Add(mod, Set(d, static_cast<T>(1))); | |
| const Vec<D> v2 = Add(mod, Set(d, static_cast<T>(2))); | |
| HWY_ASSERT_VEC_EQ(d, v1, Min(v1, v2)); | |
| HWY_ASSERT_VEC_EQ(d, v2, Max(v1, v2)); | |
| HWY_ASSERT_VEC_EQ(d, v0, Min(v1, v0)); | |
| HWY_ASSERT_VEC_EQ(d, v1, Max(v1, v0)); | |
| const Vec<D> vmin = Set(d, static_cast<T>(Unpredictable1() - 1)); // 0 | |
| const Vec<D> vmax = Set(d, LimitsMax<T>()); | |
| const Vec<D> actual_min1 = Min(vmin, vmax); | |
| const Vec<D> actual_min2 = Min(vmax, vmin); | |
| #if HWY_TARGET_IS_SVE | |
| // lvalue and `PreventElision` work around incorrect codegen on SVE2. | |
| PreventElision(GetLane(actual_min1)); | |
| PreventElision(GetLane(actual_min2)); | |
| #endif | |
| HWY_ASSERT_VEC_EQ(d, vmin, actual_min1); | |
| HWY_ASSERT_VEC_EQ(d, vmin, actual_min2); | |
| const Vec<D> actual_max1 = Max(vmin, vmax); | |
| const Vec<D> actual_max2 = Max(vmax, vmin); | |
| HWY_ASSERT_VEC_EQ(d, vmax, actual_max1); | |
| HWY_ASSERT_VEC_EQ(d, vmax, actual_max2); | |
| } | |
| }; | |
| HWY_NOINLINE void TestMinMaxU() { | |
| ForUnsignedTypes(ForPartialVectors<TestUnsignedMinMax>()); | |
| } | |
| struct TestSignedMinMax { | |
| template <typename T, class D> | |
| HWY_NOINLINE void operator()(T /*unused*/, D d) { | |
| // Leave headroom such that v1 < v2 even after wraparound. | |
| const Vec<D> mod = | |
| And(Iota(d, 0), Set(d, ConvertScalarTo<T>(LimitsMax<T>() >> 1))); | |
| const Vec<D> v1 = Add(mod, Set(d, ConvertScalarTo<T>(1))); | |
| const Vec<D> v2 = Add(mod, Set(d, ConvertScalarTo<T>(2))); | |
| const Vec<D> v_neg = Sub(Zero(d), v1); | |
| HWY_ASSERT_VEC_EQ(d, v1, Min(v1, v2)); | |
| HWY_ASSERT_VEC_EQ(d, v2, Max(v1, v2)); | |
| HWY_ASSERT_VEC_EQ(d, v_neg, Min(v1, v_neg)); | |
| HWY_ASSERT_VEC_EQ(d, v1, Max(v1, v_neg)); | |
| const Vec<D> v0 = Set(d, static_cast<T>(Unpredictable1() - 1)); | |
| const Vec<D> vmin = Or(v0, Set(d, LimitsMin<T>())); | |
| const Vec<D> vmax = Or(v0, Set(d, LimitsMax<T>())); | |
| HWY_ASSERT_VEC_EQ(d, vmin, Min(v0, vmin)); | |
| HWY_ASSERT_VEC_EQ(d, vmin, Min(vmin, v0)); | |
| HWY_ASSERT_VEC_EQ(d, v0, Max(v0, vmin)); | |
| HWY_ASSERT_VEC_EQ(d, v0, Max(vmin, v0)); | |
| const Vec<D> actual_min1 = Min(vmin, vmax); | |
| const Vec<D> actual_min2 = Min(vmax, vmin); | |
| HWY_ASSERT_VEC_EQ(d, vmin, actual_min1); | |
| HWY_ASSERT_VEC_EQ(d, vmin, actual_min2); | |
| HWY_ASSERT_VEC_EQ(d, vmax, Max(vmin, vmax)); | |
| HWY_ASSERT_VEC_EQ(d, vmax, Max(vmax, vmin)); | |
| } | |
| }; | |
| HWY_NOINLINE void TestMinMaxI() { | |
| ForSignedTypes(ForPartialVectors<TestSignedMinMax>()); | |
| } | |
| struct TestFloatMinMax { | |
| template <typename T, class D> | |
| HWY_NOINLINE void operator()(T /*unused*/, D d) { | |
| const Vec<D> v1 = Iota(d, Unpredictable1()); | |
| const Vec<D> v2 = Iota(d, Unpredictable1() + 1); | |
| const Vec<D> v_neg = Iota(d, -ConvertScalarTo<T>(Lanes(d))); | |
| HWY_ASSERT_VEC_EQ(d, v1, Min(v1, v2)); | |
| HWY_ASSERT_VEC_EQ(d, v2, Max(v1, v2)); | |
| HWY_ASSERT_VEC_EQ(d, v_neg, Min(v1, v_neg)); | |
| HWY_ASSERT_VEC_EQ(d, v1, Max(v1, v_neg)); | |
| const Vec<D> v0 = Zero(d); | |
| const Vec<D> vmin = Set(d, ConvertScalarTo<T>(-1E30)); | |
| const Vec<D> vmax = Set(d, ConvertScalarTo<T>(1E30)); | |
| HWY_ASSERT_VEC_EQ(d, vmin, Min(v0, vmin)); | |
| HWY_ASSERT_VEC_EQ(d, vmin, Min(vmin, v0)); | |
| HWY_ASSERT_VEC_EQ(d, v0, Max(v0, vmin)); | |
| HWY_ASSERT_VEC_EQ(d, v0, Max(vmin, v0)); | |
| HWY_ASSERT_VEC_EQ(d, vmin, Min(vmin, vmax)); | |
| HWY_ASSERT_VEC_EQ(d, vmin, Min(vmax, vmin)); | |
| HWY_ASSERT_VEC_EQ(d, vmax, Max(vmin, vmax)); | |
| HWY_ASSERT_VEC_EQ(d, vmax, Max(vmax, vmin)); | |
| } | |
| }; | |
| HWY_NOINLINE void TestMinMaxF() { | |
| ForFloatTypes(ForPartialVectors<TestFloatMinMax>()); | |
| } | |
| } // namespace | |
| // NOLINTNEXTLINE(google-readability-namespace-comments) | |
| } // namespace HWY_NAMESPACE | |
| } // namespace hwy | |
| HWY_AFTER_NAMESPACE(); | |
| #if HWY_ONCE | |
| namespace hwy { | |
| namespace { | |
| HWY_BEFORE_TEST(HwyMinMaxTest); | |
| HWY_EXPORT_AND_TEST_P(HwyMinMaxTest, TestMinMaxU); | |
| HWY_EXPORT_AND_TEST_P(HwyMinMaxTest, TestMinMaxI); | |
| HWY_EXPORT_AND_TEST_P(HwyMinMaxTest, TestMinMaxF); | |
| HWY_AFTER_TEST(); | |
| } // namespace | |
| } // namespace hwy | |
| HWY_TEST_MAIN(); | |
| #endif // HWY_ONCE |