155 lines · cpp
1//===-- Unittests for 10^x ------------------------------------------------===//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/exp10.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 LlvmLibcExp10Test = LIBC_NAMESPACE::testing::FPTest<double>;25 26namespace mpfr = LIBC_NAMESPACE::testing::mpfr;27using LIBC_NAMESPACE::testing::tlog;28 29TEST_F(LlvmLibcExp10Test, SpecialNumbers) {30 EXPECT_FP_EQ(aNaN, LIBC_NAMESPACE::exp10(aNaN));31 EXPECT_FP_EQ(inf, LIBC_NAMESPACE::exp10(inf));32 EXPECT_FP_EQ_ALL_ROUNDING(zero, LIBC_NAMESPACE::exp10(neg_inf));33 EXPECT_FP_EQ_WITH_EXCEPTION(zero, LIBC_NAMESPACE::exp10(-0x1.0p20),34 FE_UNDERFLOW);35 EXPECT_FP_EQ_WITH_EXCEPTION(inf, LIBC_NAMESPACE::exp10(0x1.0p20),36 FE_OVERFLOW);37 EXPECT_FP_EQ_ALL_ROUNDING(1.0, LIBC_NAMESPACE::exp10(0.0));38 EXPECT_FP_EQ_ALL_ROUNDING(1.0, LIBC_NAMESPACE::exp10(-0.0));39}40 41TEST_F(LlvmLibcExp10Test, TrickyInputs) {42 constexpr int N = 41;43 constexpr uint64_t INPUTS[N] = {44 0x40033093317082F8, 0x3FD79289C6E6A5C0,45 0x3FD05DE80A173EA0, // 0x1.05de80a173eap-246 0xbf1eb7a4cb841fcc, // -0x1.eb7a4cb841fccp-1447 0xbf19a61fb925970d,48 0x3fda7b764e2cf47a, // 0x1.a7b764e2cf47ap-249 0xc04757852a4b93aa, // -0x1.757852a4b93aap+550 0x4044c19e5712e377, // x=0x1.4c19e5712e377p+551 0xbf19a61fb925970d, // x=-0x1.9a61fb925970dp-1452 0xc039a74cdab36c28, // x=-0x1.9a74cdab36c28p+453 0xc085b3e4e2e3bba9, // x=-0x1.5b3e4e2e3bba9p+954 0xc086960d591aec34, // x=-0x1.6960d591aec34p+955 0xc086232c09d58d91, // x=-0x1.6232c09d58d91p+956 0xc0874910d52d3051, // x=-0x1.74910d52d3051p957 0xc0867a172ceb0990, // x=-0x1.67a172ceb099p+958 0xc08ff80000000000, // x=-0x1.ff8p+959 0xbc971547652b82fe, // x=-0x1.71547652b82fep-5460 0x0000000000000000, // x = 061 0x3ff0000000000000, // x = 162 0x4000000000000000, // x = 263 0x4008000000000000, // x = 364 0x4010000000000000, // x = 465 0x4014000000000000, // x = 566 0x4018000000000000, // x = 667 0x401c000000000000, // x = 768 0x4020000000000000, // x = 869 0x4022000000000000, // x = 970 0x4024000000000000, // x = 1071 0x4026000000000000, // x = 1172 0x4028000000000000, // x = 1273 0x402a000000000000, // x = 1374 0x402c000000000000, // x = 1475 0x402e000000000000, // x = 1576 0x4030000000000000, // x = 1677 0x4031000000000000, // x = 1778 0x4032000000000000, // x = 1879 0x4033000000000000, // x = 1980 0x4034000000000000, // x = 2081 0x4035000000000000, // x = 2182 0x4036000000000000, // x = 2283 0x4037000000000000, // x = 2384 };85 for (int i = 0; i < N; ++i) {86 double x = FPBits(INPUTS[i]).get_val();87 EXPECT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Exp10, x,88 LIBC_NAMESPACE::exp10(x), TOLERANCE + 0.5);89 }90}91 92TEST_F(LlvmLibcExp10Test, InDoubleRange) {93 constexpr uint64_t COUNT = 1'231;94 uint64_t START = LIBC_NAMESPACE::fputil::FPBits<double>(0.25).uintval();95 uint64_t STOP = LIBC_NAMESPACE::fputil::FPBits<double>(4.0).uintval();96 uint64_t STEP = (STOP - START) / COUNT;97 98 auto test = [&](mpfr::RoundingMode rounding_mode) {99 mpfr::ForceRoundingMode __r(rounding_mode);100 if (!__r.success)101 return;102 103 uint64_t fails = 0;104 uint64_t count = 0;105 uint64_t cc = 0;106 double mx, mr = 0.0;107 double tol = 0.5;108 109 for (uint64_t i = 0, v = START; i <= COUNT; ++i, v += STEP) {110 double x = FPBits(v).get_val();111 if (FPBits(v).is_nan() || FPBits(v).is_inf() || x < 0.0)112 continue;113 double result = LIBC_NAMESPACE::exp10(x);114 ++cc;115 if (FPBits(result).is_nan() || FPBits(result).is_inf())116 continue;117 118 ++count;119 120 if (!TEST_MPFR_MATCH_ROUNDING_SILENTLY(mpfr::Operation::Exp10, x, result,121 TOLERANCE + 0.5, rounding_mode)) {122 ++fails;123 while (!TEST_MPFR_MATCH_ROUNDING_SILENTLY(mpfr::Operation::Exp10, x,124 result, tol, rounding_mode)) {125 mx = x;126 mr = result;127 128 if (tol > 1000.0)129 break;130 131 tol *= 2.0;132 }133 }134 }135 if (fails) {136 tlog << " Exp10 failed: " << fails << "/" << count << "/" << cc137 << " tests.\n";138 tlog << " Max ULPs is at most: " << static_cast<uint64_t>(tol) << ".\n";139 EXPECT_MPFR_MATCH(mpfr::Operation::Exp10, mx, mr, 0.5, rounding_mode);140 }141 };142 143 tlog << " Test Rounding To Nearest...\n";144 test(mpfr::RoundingMode::Nearest);145 146 tlog << " Test Rounding Downward...\n";147 test(mpfr::RoundingMode::Downward);148 149 tlog << " Test Rounding Upward...\n";150 test(mpfr::RoundingMode::Upward);151 152 tlog << " Test Rounding Toward Zero...\n";153 test(mpfr::RoundingMode::TowardZero);154}155