//===-- Single-precision e^x function -------------------------------------===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// #include "src/math/expf.h" #include "common_constants.h" // Lookup tables EXP_M1 and EXP_M2. #include "src/__support/FPUtil/BasicOperations.h" #include "src/__support/FPUtil/FEnvImpl.h" #include "src/__support/FPUtil/FMA.h" #include "src/__support/FPUtil/FPBits.h" #include "src/__support/FPUtil/PolyEval.h" #include "src/__support/common.h" #include namespace __llvm_libc { INLINE_FMA LLVM_LIBC_FUNCTION(float, expf, (float x)) { using FPBits = typename fputil::FPBits; FPBits xbits(x); // When x < log(2^-150) or nan if (unlikely(xbits.uintval() >= 0xc2cf'f1b5U)) { // exp(-Inf) = 0 if (xbits.is_inf()) return 0.0f; // exp(nan) = nan if (xbits.is_nan()) return x; if (fputil::get_round() == FE_UPWARD) return static_cast(FPBits(FPBits::MIN_SUBNORMAL)); errno = ERANGE; return 0.0f; } // x >= 89 or nan if (unlikely(!xbits.get_sign() && (xbits.uintval() >= 0x42b2'0000))) { if (xbits.uintval() < 0x7f80'0000U) { int rounding = fputil::get_round(); if (rounding == FE_DOWNWARD || rounding == FE_TOWARDZERO) return static_cast(FPBits(FPBits::MAX_NORMAL)); errno = ERANGE; } return x + static_cast(FPBits::inf()); } // |x| < 2^-25 if (unlikely(xbits.get_unbiased_exponent() <= 101)) { return 1.0f + x; } // For -104 < x < 89, to compute exp(x), we perform the following range // reduction: find hi, mid, lo such that: // x = hi + mid + lo, in which // hi is an integer, // mid * 2^7 is an integer // -2^(-8) <= lo < 2^-8. // In particular, // hi + mid = round(x * 2^7) * 2^(-7). // Then, // exp(x) = exp(hi + mid + lo) = exp(hi) * exp(mid) * exp(lo). // We store exp(hi) and exp(mid) in the lookup tables EXP_M1 and EXP_M2 // respectively. exp(lo) is computed using a degree-7 minimax polynomial // generated by Sollya. // x_hi = hi + mid. int x_hi = static_cast(x * 0x1.0p7f); // Subtract (hi + mid) from x to get lo. x -= static_cast(x_hi) * 0x1.0p-7f; double xd = static_cast(x); // Make sure that -2^(-8) <= lo < 2^-8. if (x >= 0x1.0p-8f) { ++x_hi; xd -= 0x1.0p-7; } if (x < -0x1.0p-8f) { --x_hi; xd += 0x1.0p-7; } x_hi += 104 << 7; // hi = x_hi >> 7 double exp_hi = EXP_M1[x_hi >> 7]; // lo = x_hi & 0x0000'007fU; double exp_mid = EXP_M2[x_hi & 0x7f]; // Degree-7 minimax polynomial generated by Sollya with the following // commands: // > display = hexadecimal; // > Q = fpminimax(expm1(x)/x, 6, [|D...|], [-2^-8, 2^-8]); // > Q; double exp_lo = fputil::polyeval( xd, 0x1p0, 0x1p0, 0x1p-1, 0x1.5555555555555p-3, 0x1.55555555553ap-5, 0x1.1111111204dfcp-7, 0x1.6c16cb2da593ap-10, 0x1.9ff1648996d2ep-13); return static_cast(exp_hi * exp_mid * exp_lo); } } // namespace __llvm_libc