87 lines · cpp
1//===-- Unittests for log1pf ----------------------------------------------===//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/log1pf.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 LlvmLibcLog1pfTest = LIBC_NAMESPACE::testing::FPTest<float>;25 26namespace mpfr = LIBC_NAMESPACE::testing::mpfr;27 28TEST_F(LlvmLibcLog1pfTest, SpecialNumbers) {29 EXPECT_FP_EQ(aNaN, LIBC_NAMESPACE::log1pf(aNaN));30 EXPECT_FP_EQ(inf, LIBC_NAMESPACE::log1pf(inf));31 EXPECT_FP_IS_NAN_WITH_EXCEPTION(LIBC_NAMESPACE::log1pf(neg_inf), FE_INVALID);32 EXPECT_FP_EQ(zero, LIBC_NAMESPACE::log1pf(0.0f));33 EXPECT_FP_EQ(neg_zero, LIBC_NAMESPACE::log1pf(-0.0f));34 EXPECT_FP_EQ_WITH_EXCEPTION(neg_inf, LIBC_NAMESPACE::log1pf(-1.0f),35 FE_DIVBYZERO);36}37 38TEST_F(LlvmLibcLog1pfTest, TrickyInputs) {39 constexpr int N = 27;40 constexpr uint32_t INPUTS[N] = {41 0x35c00006U, /*0x1.80000cp-20f*/42 0x35400003U, /*0x1.800006p-21f*/43 0x3640000cU, /*0x1.800018p-19f*/44 0x36c00018U, /*0x1.80003p-18f*/45 0x3710001bU, /*0x1.200036p-17f*/46 0x37400030U, /*0x1.80006p-17f*/47 0x3770004bU, /*0x1.e00096p-17f*/48 0x3b9315c8U, /*0x1.262b9p-8f*/49 0x3c6eb7afU, /*0x1.dd6f5ep-7f*/50 0x3ddbfec3U, /*0x1.b7fd86p-4f*/51 0x3efd81adU, /*0x1.fb035ap-2f*/52 0x41078febU, /*0x1.0f1fd6p+3f*/53 0x4cc1c80bU, /*0x1.839016p+26f*/54 0x5cd69e88U, /*0x1.ad3d1p+58f*/55 0x5ee8984eU, /*0x1.d1309cp+62f*/56 0x65d890d3U, /*0x1.b121a6p+76f*/57 0x665e7ca6U, /*0x1.bcf94cp+77f*/58 0x6f31a8ecU, /*0x1.6351d8p+95f*/59 0x79e7ec37U, /*0x1.cfd86ep+116f*/60 0x7a17f30aU, /*0x1.2fe614p+117f*/61 0xb53ffffdU, /*-0x1.7ffffap-21f*/62 0xb70fffe5U, /*-0x1.1fffcap-17f*/63 0xbb0ec8c4U, /*-0x1.1d9188p-9f*/64 0xbc4d092cU, /*-0x1.9a1258p-7f*/65 0xbc657728U, /*-0x1.caee5p-7f*/66 0xbd1d20afU, /*-0x1.3a415ep-5f*/67 0xbf800000U, /*-1.0f*/68 };69 for (int i = 0; i < N; ++i) {70 float x = FPBits(INPUTS[i]).get_val();71 EXPECT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log1p, x,72 LIBC_NAMESPACE::log1pf(x), TOLERANCE + 0.5);73 }74}75 76TEST_F(LlvmLibcLog1pfTest, InFloatRange) {77 constexpr uint32_t COUNT = 100'000;78 constexpr uint32_t STEP = UINT32_MAX / COUNT;79 for (uint32_t i = 0, v = 0; i <= COUNT; ++i, v += STEP) {80 float x = FPBits(v).get_val();81 if (FPBits(v).is_nan() || FPBits(v).is_inf())82 continue;83 ASSERT_MPFR_MATCH_ALL_ROUNDING(mpfr::Operation::Log1p, x,84 LIBC_NAMESPACE::log1pf(x), 0.5);85 }86}87