1 /*
2 * Double-precision tanh(x) function.
3 *
4 * Copyright (c) 2023-2024, Arm Limited.
5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception
6 */
7 #include "math_config.h"
8 #include "poly_scalar_f64.h"
9 #include "test_sig.h"
10 #include "test_defs.h"
11
12 #define AbsMask 0x7fffffffffffffff
13 #define InvLn2 0x1.71547652b82fep0
14 #define Ln2hi 0x1.62e42fefa39efp-1
15 #define Ln2lo 0x1.abc9e3b39803fp-56
16 #define Shift 0x1.8p52
17
18 /* asuint64 (0x1.241bf835f9d5fp+4). */
19 #define BoringBound 0x403241bf835f9d5f
20 /* asuint64 (0x1p-27). */
21 #define TinyBound 0x3e40000000000000
22 #define One 0x3ff0000000000000
23
24 static inline double
expm1_inline(double x)25 expm1_inline (double x)
26 {
27 /* Helper routine for calculating exp(x) - 1. Copied from expm1_2u5.c, with
28 several simplifications:
29 - No special-case handling for tiny or special values.
30 - Simpler combination of p and t in final stage of the algorithm.
31 - Use shift-and-add instead of ldexp to calculate t. */
32
33 /* Reduce argument: f in [-ln2/2, ln2/2], i is exact. */
34 double j = fma (InvLn2, x, Shift) - Shift;
35 int64_t i = j;
36 double f = fma (j, -Ln2hi, x);
37 f = fma (j, -Ln2lo, f);
38
39 /* Approximate expm1(f) using polynomial. */
40 double f2 = f * f;
41 double f4 = f2 * f2;
42 double p = fma (f2, estrin_10_f64 (f, f2, f4, f4 * f4, __expm1_poly), f);
43
44 /* t = 2 ^ i. */
45 double t = asdouble ((uint64_t) (i + 1023) << 52);
46 /* expm1(x) = p * t + (t - 1). */
47 return fma (p, t, t - 1);
48 }
49
50 /* Approximation for double-precision tanh(x), using a simplified version of
51 expm1. The greatest observed error is 2.77 ULP:
52 tanh(-0x1.c4a4ca0f9f3b7p-3) got -0x1.bd6a21a163627p-3
53 want -0x1.bd6a21a163624p-3. */
54 double
tanh(double x)55 tanh (double x)
56 {
57 uint64_t ix = asuint64 (x);
58 uint64_t ia = ix & AbsMask;
59 uint64_t sign = ix & ~AbsMask;
60
61 if (unlikely (ia > BoringBound))
62 {
63 if (ia > 0x7ff0000000000000)
64 return __math_invalid (x);
65 return asdouble (One | sign);
66 }
67
68 if (unlikely (ia < TinyBound))
69 return x;
70
71 /* tanh(x) = (e^2x - 1) / (e^2x + 1). */
72 double q = expm1_inline (2 * x);
73 return q / (q + 2);
74 }
75
76 TEST_SIG (S, D, 1, tanh, -10.0, 10.0)
77 TEST_ULP (tanh, 2.27)
78 TEST_SYM_INTERVAL (tanh, 0, TinyBound, 1000)
79 TEST_SYM_INTERVAL (tanh, TinyBound, BoringBound, 100000)
80 TEST_SYM_INTERVAL (tanh, BoringBound, inf, 1000)
81