Home
last modified time | relevance | path

Searched full:polynomial (Results 1 – 25 of 307) sorted by relevance

12345678910>>...13

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterleavedLoadCombinePass.cpp109 /// First Order Polynomial on an n-Bit Integer Value
111 /// Polynomial(Value) = Value * B + A + E*2^(n-e)
123 /// addition (see Proof(1) in Polynomial::mul). Further, both operations
165 class Polynomial { class
187 Polynomial(Value *V) : V(V) { in Polynomial() function in __anon71941b1b0111::Polynomial
196 Polynomial(const APInt &A, unsigned ErrorMSBs = 0) in Polynomial() function in __anon71941b1b0111::Polynomial
199 Polynomial(unsigned BitWidth, uint64_t A, unsigned ErrorMSBs = 0) in Polynomial() function in __anon71941b1b0111::Polynomial
202 Polynomial() = default;
225 /// Apply an add on the polynomial
226 Polynomial &add(const APInt &C) { in add()
[all …]
/freebsd/contrib/arm-optimized-routines/math/aarch64/sve/
H A Dasinf.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
27 For |x| in [0, 0.5], use order 4 polynomial P such that the final
28 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
50 /* Evaluate polynomial Q(x) = y + y * z * P(z) with in SV_NAME_F1()
57 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_F1()
59 /* Finalize polynomial: z + z * z2 * P(z2). */ in SV_NAME_F1()
H A Dacosf.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
28 For |x| in [0, 0.5], use order 4 polynomial P such that the final
29 approximation of asin is an odd polynomial:
52 /* Evaluate polynomial Q(x) = z + z * z2 * P(z2) with in SV_NAME_F1()
59 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_F1()
61 /* Finalize polynomial: z + z * z2 * P(z2). */ in SV_NAME_F1()
H A Dasin.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
33 For |x| in [0, 0.5], use an order 11 polynomial P such that the final
34 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
55 /* Evaluate polynomial Q(x) = y + y * z * P(z) with in SV_NAME_D1()
62 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_D1()
67 /* Finalize polynomial: z + z * z2 * P(z2). */ in SV_NAME_D1()
H A Dacos.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
30 For |x| in [0, 0.5], use an order 11 polynomial P such that the final
31 approximation of asin is an odd polynomial:
55 /* Evaluate polynomial Q(x) = z + z * z2 * P(z2) with in SV_NAME_D1()
62 /* Use a single polynomial approximation P for both intervals. */ in SV_NAME_D1()
68 /* Finalize polynomial: z + z * z2 * P(z2). */ in SV_NAME_D1()
H A Dsv_log1pf_inline.h21 /* Do not store first term of polynomial, which is -0.5, as
23 the main load-and-mla polynomial schedule. */
40 We approximate log1p(m) with a polynomial, then scale by in sv_log1pf_inline()
61 /* Evaluate polynomial on reduced interval. */ in sv_log1pf_inline()
/freebsd/contrib/arm-optimized-routines/math/
H A Dsincosf.h23 double c0, c1, c2, c3, c4; /* Cosine polynomial. */
24 double s1, s2, s3; /* Sine polynomial. */
27 /* Polynomial data (the cosine polynomial is negated in the 2nd entry). */
38 polynomial P and store the results in SINP and COSP. N is the quadrant,
67 /* Return the sine of inputs X and X2 (X squared) using the polynomial P.
68 N is the quadrant, and if odd the cosine polynomial is used. */
H A Dtgamma128.h2 * Polynomial coefficients and other constants for tgamma128.c.
11 /* Coefficients of the polynomial used in the tgamma_large() subroutine */
40 /* Coefficients of the polynomial used in the tgamma_tiny() subroutine */
68 /* Coefficients of the polynomial used in the tgamma_central() subroutine
105 /* Coefficients of the polynomial used in the tgamma_central() subroutine
/freebsd/contrib/arm-optimized-routines/math/aarch64/experimental/
H A Dacos_2u.c22 /* Fast implementation of double-precision acos(x) based on polynomial
32 and use an order 11 polynomial P such that the final approximation of asin
33 is an odd polynomial: asin(x) ~ x + x^3 * P(x^2).
69 /* Evaluate polynomial Q(|x|) = z + z * z2 * P(z2) with in acos()
75 /* Use a single polynomial approximation P for both intervals. */ in acos()
81 /* Finalize polynomial: z + z * z2 * P(z2). */ in acos()
H A Dasinf_2u5.c21 /* Fast implementation of single-precision asin(x) based on polynomial
26 For x in [Small, 0.5], use order 4 polynomial P such that the final
27 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
74 /* Evaluate polynomial Q(x) = y + y * z * P(z) with in asinf()
80 /* Use a single polynomial approximation P for both intervals. */ in asinf()
82 /* Finalize polynomial: z + z * z2 * P(z2). */ in asinf()
H A Dacosf_1u4.c22 /* Fast implementation of single-precision acos(x) based on polynomial
32 and use an order 4 polynomial P such that the final approximation of asin is
33 an odd polynomial: asin(x) ~ x + x^3 * P(x^2).
72 /* Evaluate polynomial Q(|x|) = z + z * z2 * P(z2) with in acosf()
78 /* Use a single polynomial approximation P for both intervals. */ in acosf()
80 /* Finalize polynomial: z + z * z2 * P(z2). */ in acosf()
H A Datanf_common.h2 * Single-precision polynomial evaluation function for scalar
15 /* Polynomial used in fast atanf(x) and atan2f(y,x) implementations
16 The order 7 polynomial P approximates (atan(sqrt(x))-sqrt(x))/x^(3/2). */
29 /* Then assemble polynomial. */ in eval_poly()
H A Dasin_3u.c21 /* Fast implementation of double-precision asin(x) based on polynomial
26 For x in [Small, 0.5], use an order 11 polynomial P such that the final
27 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
76 /* Evaluate polynomial Q(x) = y + y * z * P(z) with in asin()
82 /* Use a single polynomial approximation P for both intervals. */ in asin()
88 /* Finalize polynomial: z + z * z2 * P(z2). */ in asin()
H A Datan_common.h2 * Double-precision polynomial evaluation function for scalar
12 /* Polynomial used in fast atan(x) and atan2(y,x) implementations
13 The order 19 polynomial P approximates (atan(sqrt(x))-sqrt(x))/x^(3/2). */
/freebsd/contrib/arm-optimized-routines/math/aarch64/advsimd/
H A Dasinf.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
44 For |x| in [Small, 0.5], use order 4 polynomial P such that the final
45 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
75 /* Evaluate polynomial Q(x) = y + y * z * P(z) with in V_NAME_F1()
82 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_F1()
84 /* Finalize polynomial: z + z * z2 * P(z2). */ in V_NAME_F1()
H A Dacosf.c18 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x)) on
46 For |x| in [Small, 0.5], use order 4 polynomial P such that the final
47 approximation of asin is an odd polynomial:
79 /* Evaluate polynomial Q(x) = z + z * z2 * P(z2) with in V_NAME_F1()
86 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_F1()
88 /* Finalize polynomial: z + z * z2 * P(z2). */ in V_NAME_F1()
H A Dacos.c19 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
51 For |x| in [Small, 0.5], use an order 11 polynomial P such that the final
52 approximation of asin is an odd polynomial:
84 /* Evaluate polynomial Q(x) = z + z * z2 * P(z2) with in V_NAME_D1()
91 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_D1()
97 /* Finalize polynomial: z + z * z2 * P(z2). */ in V_NAME_D1()
H A Dasin.c19 /* Polynomial approximation of (asin(sqrt(x)) - sqrt(x)) / (x * sqrt(x))
48 For |x| in [Small, 0.5], use an order 11 polynomial P such that the final
49 approximation is an odd polynomial: asin(x) ~ x + x^3 P(x^2).
79 /* Evaluate polynomial Q(x) = y + y * z * P(z) with in V_NAME_D1()
86 /* Use a single polynomial approximation P for both intervals. */ in V_NAME_D1()
111 /* Finalize polynomial: z + z * z2 * P(z2). */ in V_NAME_D1()
/freebsd/contrib/arm-optimized-routines/math/tools/
H A Dcos.sollya1 // polynomial for approximating cos(x)
6 deg = 8; // polynomial degree
10 // find even polynomial with minimal abs error compared to cos(x)
H A Dremez.jl4 # remez.jl - implementation of the Remez algorithm for polynomial approximation
82 # Evaluate a polynomial.
85 # coeffs Array of BigFloats giving the coefficients of the polynomial.
88 # x Point at which to evaluate the polynomial.
126 # Format a polynomial into an arithmetic expression, for pasting into
130 # coeffs Array of BigFloats giving the coefficients of the polynomial.
332 # n Degree of the numerator polynomial of the desired rational
334 # d Degree of the denominator polynomial of the desired rational
404 # And marshal the results into two separate polynomial vectors to
627 # Special case: we're after a polynomial. In this case, we
[all …]
H A Dv_log.sollya1 // polynomial used for __v_log(x)
10 // find log(1+x)/x polynomial with minimal relative error
11 // (minimal relative error polynomial for log(1+x) is the same * x)
H A Dv_sin.sollya1 // polynomial for approximating sin(x)
6 deg = 15; // polynomial degree
10 // find even polynomial with minimal abs error compared to sin(x)/x
H A Dsincosf.sollya1 // polynomial for approximating cos(x)
8 deg = 8; // polynomial degree
12 // find even polynomial with minimal abs error compared to cos(x)
H A Dsinpi.sollya1 // polynomial for approximating sinpi(x)
6 deg = 19; // polynomial degree
10 // find even polynomial with minimal abs error compared to sinpi(x)
H A Dsincos.sollya1 // polynomial for approximating cos(x)
8 deg = 14; // polynomial degree
12 // find even polynomial with minimal abs error compared to cos(x)

12345678910>>...13