1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
/*
* Single-precision polynomial evaluation function for scalar and vector
* atan(x) and atan2(y,x).
*
* Copyright (c) 2021-2022, Arm Limited.
* SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception
*/
#ifndef PL_MATH_ATANF_COMMON_H
#define PL_MATH_ATANF_COMMON_H
#include "math_config.h"
#if V_SUPPORTED
#include "v_math.h"
#define FLT_T v_f32_t
#define FMA v_fma_f32
#define P(i) v_f32 (__atanf_poly_data.poly[i])
#else
#define FLT_T double
#define FMA fma
#define P(i) __atanf_poly_data.poly[i]
#endif
/* Polynomial used in fast atanf(x) and atan2f(y,x) implementations
The order 7 polynomial P approximates (atan(sqrt(x))-sqrt(x))/x^(3/2). */
static inline FLT_T
eval_poly (FLT_T z, FLT_T az, FLT_T shift)
{
/* Use 2-level Estrin scheme for P(z^2) with deg(P)=7. However,
a standard implementation using z8 creates spurious underflow
in the very last fma (when z^8 is small enough).
Therefore, we split the last fma into a mul and and an fma.
Horner and single-level Estrin have higher errors that exceed
threshold. */
FLT_T z2 = z * z;
FLT_T z4 = z2 * z2;
/* Then assemble polynomial. */
FLT_T y
= FMA (z4,
z4 * FMA (z4, (FMA (z2, P (7), P (6))), (FMA (z2, P (5), P (4)))),
FMA (z4, (FMA (z2, P (3), P (2))), (FMA (z2, P (1), P (0)))));
/* Finalize:
y = shift + z * P(z^2). */
return FMA (y, z2 * az, az) + shift;
}
#endif // PL_MATH_ATANF_COMMON_H
|