147 lines · cpp
1//===-- Unittests for log10 -----------------------------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8 9#include "hdr/math_macros.h"10#include "hdr/stdint_proxy.h"11#include "src/__support/FPUtil/FPBits.h"12#include "src/__support/macros/optimization.h"13#include "src/math/log10.h"14#include "test/UnitTest/FPMatcher.h"15#include "test/UnitTest/Test.h"16#include "utils/MPFRWrapper/MPFRUtils.h"17 18#ifdef LIBC_MATH_HAS_SKIP_ACCURATE_PASS19#define TOLERANCE 120#else21#define TOLERANCE 022#endif // LIBC_MATH_HAS_SKIP_ACCURATE_PASS23 24using LlvmLibcLog10Test = LIBC_NAMESPACE::testing::FPTest<double>;25 26namespace mpfr = LIBC_NAMESPACE::testing::mpfr;27using LIBC_NAMESPACE::testing::tlog;28 29TEST_F(LlvmLibcLog10Test, SpecialNumbers) {30 EXPECT_FP_EQ(aNaN, LIBC_NAMESPACE::log10(aNaN));31 EXPECT_FP_EQ(inf, LIBC_NAMESPACE::log10(inf));32 EXPECT_FP_IS_NAN_WITH_EXCEPTION(LIBC_NAMESPACE::log10(neg_inf), FE_INVALID);33 EXPECT_FP_EQ_WITH_EXCEPTION(neg_inf, LIBC_NAMESPACE::log10(0.0),34 FE_DIVBYZERO);35 EXPECT_FP_EQ_WITH_EXCEPTION(neg_inf, LIBC_NAMESPACE::log10(-0.0),36 FE_DIVBYZERO);37 EXPECT_FP_IS_NAN_WITH_EXCEPTION(LIBC_NAMESPACE::log10(-1.0), FE_INVALID);38 EXPECT_FP_EQ_ALL_ROUNDING(zero, LIBC_NAMESPACE::log10(1.0));39}40 41TEST_F(LlvmLibcLog10Test, TrickyInputs) {42 constexpr int N = 36;43 constexpr uint64_t INPUTS[N] = {44 0x3ff0000000000000, // x = 1.045 0x4024000000000000, // x = 10.046 0x4059000000000000, // x = 10^247 0x408f400000000000, // x = 10^348 0x40c3880000000000, // x = 10^449 0x40f86a0000000000, // x = 10^550 0x412e848000000000, // x = 10^651 0x416312d000000000, // x = 10^752 0x4197d78400000000, // x = 10^853 0x41cdcd6500000000, // x = 10^954 0x4202a05f20000000, // x = 10^1055 0x42374876e8000000, // x = 10^1156 0x426d1a94a2000000, // x = 10^1257 0x42a2309ce5400000, // x = 10^1358 0x42d6bcc41e900000, // x = 10^1459 0x430c6bf526340000, // x = 10^1560 0x4341c37937e08000, // x = 10^1661 0x4376345785d8a000, // x = 10^1762 0x43abc16d674ec800, // x = 10^1863 0x43e158e460913d00, // x = 10^1964 0x4415af1d78b58c40, // x = 10^2065 0x444b1ae4d6e2ef50, // x = 10^2166 0x4480f0cf064dd592, // x = 10^2267 0x3fefffffffef06ad, 0x3fefde0f22c7d0eb, 0x225e7812faadb32f,68 0x3fee1076964c2903, 0x3fdfe93fff7fceb0, 0x3ff012631ad8df10,69 0x3fefbfdaa448ed98, 0x44b0c9705a25ce02, 0x2c88d301065c7f9b,70 0x30160580e7268a99, 0x5ca04103b7eaa345, 0x19ad77dc4a40093f,71 0x0000449fb5c8a96e};72 for (int i = 0; i < N; ++i) {73 double x = FPBits(INPUTS[i]).get_val();74 EXPECT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log10, x,75 LIBC_NAMESPACE::log10(x), TOLERANCE + 0.5);76 }77}78 79TEST_F(LlvmLibcLog10Test, AllExponents) {80 double x = 0x1.0p-1074;81 for (int i = -1074; i < 1024; ++i, x *= 2.0) {82 ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log10, x,83 LIBC_NAMESPACE::log10(x), 0.5);84 }85}86 87TEST_F(LlvmLibcLog10Test, InDoubleRange) {88 constexpr uint64_t COUNT = 1'001;89 constexpr uint64_t START = 0x3FD0'0000'0000'0000ULL; // 0.2590 constexpr uint64_t STOP = 0x4010'0000'0000'0000ULL; // 4.091 // constexpr uint64_t START = 0x3FF0'0000'0000'0000ULL; // 1.092 // constexpr uint64_t STOP = 0x4000'0000'0000'0000ULL; // 2.093 constexpr uint64_t STEP = (STOP - START) / COUNT;94 95 auto test = [&](mpfr::RoundingMode rounding_mode) {96 mpfr::ForceRoundingMode __r(rounding_mode);97 if (!__r.success)98 return;99 uint64_t fails = 0;100 uint64_t count = 0;101 uint64_t cc = 0;102 double mx, mr = 0.0;103 double tol = 0.5;104 105 for (uint64_t i = 0, v = START; i <= COUNT; ++i, v += STEP) {106 double x = FPBits(v).get_val();107 if (FPBits(v).is_nan() || FPBits(v).is_inf() || x < 0.0)108 continue;109 double result = LIBC_NAMESPACE::log10(x);110 ++cc;111 if (FPBits(result).is_nan() || FPBits(result).is_inf())112 continue;113 114 ++count;115 // ASSERT_MPFR_MATCH(mpfr::Operation::Log10, x, result, 0.5);116 if (!TEST_MPFR_MATCH_ROUNDING_SILENTLY(mpfr::Operation::Log10, x, result,117 0.5, rounding_mode)) {118 ++fails;119 while (!TEST_MPFR_MATCH_ROUNDING_SILENTLY(mpfr::Operation::Log10, x,120 result, tol, rounding_mode)) {121 mx = x;122 mr = result;123 tol *= 2.0;124 }125 }126 }127 if (fails) {128 tlog << " Log10 failed: " << fails << "/" << count << "/" << cc129 << " tests.\n";130 tlog << " Max ULPs is at most: " << static_cast<uint64_t>(tol) << ".\n";131 EXPECT_MPFR_MATCH(mpfr::Operation::Log10, mx, mr, 0.5, rounding_mode);132 }133 };134 135 tlog << " Test Rounding To Nearest...\n";136 test(mpfr::RoundingMode::Nearest);137 138 tlog << " Test Rounding Downward...\n";139 test(mpfr::RoundingMode::Downward);140 141 tlog << " Test Rounding Upward...\n";142 test(mpfr::RoundingMode::Upward);143 144 tlog << " Test Rounding Toward Zero...\n";145 test(mpfr::RoundingMode::TowardZero);146}147