| /freebsd-src/contrib/arm-optimized-routines/pl/math/ |
| H A D | finite_pow.h | |
| H A D | exp.c | |
| H A D | cospi_3u1.c | |
| H A D | log10_2u.c | |
| /freebsd-src/contrib/arm-optimized-routines/math/ |
| H A D | tgamma128.c | 3 * for 128-bit long double. 5 * Copyright (c) 2006-2024, Arm Limited. 6 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 12 * maths libraries under the standard name tgammal, if long double is 13 * 128-bit. Such a library will probably want to check the error 34 static long double pol [all...] |
| H A D | exp.c | 2 * Double-precision e^x function. 4 * Copyright (c) 2018-2024, Arm Limited. 5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 21 #define C2 __exp_data.poly[5 - EXP_POLY_ORDER] 22 #define C3 __exp_data.poly[6 - EXP_POLY_ORDER] 23 #define C4 __exp_data.poly[7 - EXP_POLY_ORDE [all...] |
| H A D | exp2.c | 2 * Double-precision 2^x function. 4 * Copyright (c) 2018-2024, Arm Limited. 5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 29 a double. (int32_t)KI is the k used in the argument reduction and exponent 32 static inline double in specialcase() 40 sbits - in specialcase() [all...] |
| H A D | exp10.c | 2 * Double-precision 10^x function. 4 * Copyright (c) 2023-2024, Arm Limited. 5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 13 #define IndexMask (N - 1) 15 #define UFlowBound -0x1.5ep+8 /* -35 [all...] |
| H A D | pow.c | 2 * Double-precision x^y function. 4 * Copyright (c) 2018-2024, Arm Limited. 5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 15 Worst-case error: 0.54 ULP (~= ulperr_exp + 1024*Ln2*relerr_log*2^53) 16 relerr_log: 1.3 * 2^-68 (Relative error of log, 1.5 * 2^-6 [all...] |
| H A D | sincosf.h | 4 * Copyright (c) 2018-2024, Arm Limited. 5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 12 /* 2PI * 2^-64. */ 13 static const double pi63 = 0x1.921FB54442D18p-62; 15 static const float pio4f = 0x1.921FB6p-1f; 20 double sig [all...] |
| H A D | cosf.c | 2 * Single-precision cos function. 4 * Copyright (c) 2018-2024, Arm Limited. 5 * SPDX-License-Identifier: MIT OR Apache-2.0 WITH LLVM-exception 15 /* Fast cosf implementation. Worst-case ULP is 0.5607, maximum relative 16 error is 0.5303 * 2^-23. A single-step range reductio [all...] |
| /freebsd-src/contrib/llvm-project/compiler-rt/lib/builtins/ |
| H A D | README.txt | 1 Compiler-RT 7 Compiler-RT is open source software. You may freely distribute it under the 70 di_int __negdi2 (di_int a); // -a 71 ti_int __negti2 (ti_int a); // -a 101 si_int __negvsi2(si_int a); // -a 102 di_int __negvdi2(di_int a); // -a 103 ti_int __negvti2(ti_int a); // -a 109 si_int __subvsi3(si_int a, si_int b); // a - b 110 di_int __subvdi3(di_int a, di_int b); // a - b 111 ti_int __subvti3(ti_int a, ti_int b); // a - [all...] |
| /freebsd-src/contrib/llvm-project/clang/lib/Headers/ |
| H A D | pmmintrin.h | 1 /*===---- pmmintrin.h - SSE3 intrinsics ------------------------------------=== 5 * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 *===-----------------------------------------------------------------------=== 22 __target__("sse3,no-evex512"), __min_vector_width__(128))) 24 /// Loads data from an unaligned memory location to elements in a 128-bit 27 /// If the address of the data is not 16-byte aligned, the instruction may 36 /// A pointer to a 128-bit integer vector containing integer values. 37 /// \returns A 128-bit vector containing the moved values. 44 /// Adds the even-indexed values and subtracts the odd-indexed values of 45 /// two 128-bit vectors of [4 x float]. [all …]
|
| /freebsd-src/lib/msun/ld128/ |
| H A D | s_expl.c | 1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 4 * Copyright (c) 2009-2013 Steven G. Kargl 43 static const volatile long double 45 tiny = 0x1p-10000L; 47 static const long double 48 twom10000 = 0x1p-10000L; 50 static const long double 51 /* log(2**16384 - 0.5) rounded towards zero: */ 52 /* log(2**16384 - 0.5 + 1) rounded towards zero for expm1l() is the same: */ [all …]
|
| H A D | e_lgammal_r.c | 15 * Converted to long double by Steven G. Kargl. 22 static const volatile double vzero = 0; 24 static const double 29 static const long double 32 * Domain y in [0x1p-119, 0.28], range ~[-1.4065e-36, 1.4065e-36]: 33 * |(lgamma(2 - y) + y / 2) / y - a(y)| < 2**-119.1 35 static const long double 36 a0 = 7.72156649015328606065120900824024296e-02L, 37 a1 = 3.22467033424113218236207583323018498e-01L, 38 a2 = 6.73523010531980951332460538330282217e-02L, [all …]
|
| /freebsd-src/contrib/llvm-project/llvm/tools/llvm-xray/ |
| H A D | xray-color-helper.h | 1 //===-- xray-graph.h - XRay Function Call Graph Renderer --------*- C++ -*-===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 11 //===----------------------------------------------------------------------===// 23 /// color in a gradient. This is used to color-code edges in XRay-Graph tools. 26 /// - Sequential schemes, which are used to represent information from some 27 /// minimum to some maximum. These take an input in the range [0,1] 28 /// - Diverging schemes, which are used to represent information representing 29 /// differenes, or a range that goes from negative to positive. These take 30 /// an input in the range [-1,1]. [all …]
|
| H A D | xray-color-helper.cpp | 1 //===-- xray-graph.cpp: XRay Function Call Graph Renderer -----------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 11 //===----------------------------------------------------------------------===// 13 #include "xray-color-helper.h" 44 // Sequential Maps extend the last colors given out of range inputs. 58 // representing differenes, or a range that goes from negative to positive. 59 // These take an input in the range [-1,1]. 78 : MinIn(-1.0), MaxIn(1.0), ColorMap(DivergingCoeffs[static_cast<int>(S)]), in ColorHelper() 83 static std::tuple<double, double, double> [all …]
|
| /freebsd-src/lib/msun/man/ |
| H A D | ieee.3 | 33 .Nd IEEE standard 754 for floating-point arithmetic 35 The IEEE Standard 754 for Binary Floating-Point Arithmetic 36 defines representations of floating-point numbers and abstract 39 .Ss IEEE STANDARD 754 Floating-Point Arithmetic 43 .Bd -ragged -offset indent -compact 49 Zero is represented ambiguously as +0 or \-0. 50 .Bd -ragged -offset indent -compact 53 with like signs; but x\-x yields +0 for every 57 .Fn copysign x \(+-0 . 60 finite x = y then \*(If = 1/(x\-y) \(!= \-1/(y\-x) = \-\*(If. [all …]
|
| H A D | lgamma.3 | 54 .Fn lgamma "double x" 56 .Fn lgamma_r "double x" "int *signgamp" 62 .Fn lgammal "long double x" 64 .Fn lgammal_r "long double x" "int *signgamp" 66 .Fn gamma "double x" 68 .Fn gamma_r "double x" "int *signgamp" 74 .Fn tgamma "double x" 78 .Fn tgammal "long double x" 86 .Bd -unfilled -offset indent 87 \(*G(x) = \(is\d\s8\z0\s10\u\u\s8\(if\s10\d t\u\s8x\-1\s10\d e\u\s8\-t\s10\d dt for x > 0 and [all …]
|
| /freebsd-src/contrib/gdtoa/ |
| H A D | README | 1 This directory contains source for a library of binary -> decimal 2 and decimal -> binary conversion routines, for single-, double-, 3 and extended-precision IEEE binary floating-point arithmetic, and 4 other IEEE-like binary floating-point, including "double double", 7 T. J. Dekker, "A Floating-Point Technique for Extending the 8 Available Precision", Numer. Math. 18 (1971), pp. 224-242 12 "Inside Macintosh: PowerPC Numerics", Addison-Wesley, 1994 14 The conversion routines use double-precision floating-point arithmetic 18 David M. Gay, "Correctly Rounded Binary-Decimal and 19 Decimal-Binary Conversions", Numerical Analysis Manuscript [all …]
|
| /freebsd-src/lib/libc/quad/ |
| H A D | fixunsdfdi.c | 1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 8 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 38 #define ONE_FOURTH (1L << (LONG_BITS - 2)) 43 * Convert double to (unsigned) quad. 44 * Not sure what to do with negative numbers---for now, anything out 45 * of range becomes UQUAD_MAX. 48 __fixunsdfdi(double x) in __fixunsdfdi() 50 double toppart; in __fixunsdfdi() 58 #else /* so we wire in 2^64-1 instead */ in __fixunsdfdi() [all …]
|
| H A D | fixunssfdi.c | 1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 8 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 38 #define ONE_FOURTH (1L << (LONG_BITS - 2)) 43 * Convert float to (unsigned) quad. We do most of our work in double, 46 * Not sure what to do with negative numbers---for now, anything out 47 * of range becomes UQUAD_MAX. 54 double x, toppart; in __fixunssfdi() 62 #else /* so we wire in 2^64-1 instead */ in __fixunssfdi() 72 toppart = (x - ONE_HALF) / ONE; in __fixunssfdi() [all …]
|
| /freebsd-src/usr.bin/random/ |
| H A D | randomize_fd.h | 41 int randomize_fd(int fd, int type, int unique, double denom); 44 * Generates a random number uniformly in the range [0.0, 1.0). 46 static inline double 50 static const uint64_t mask = denom - 1; in random_unit_float() 58 * The double mantissa only has 53 bits, so we uniformly mask off the in random_unit_float() 59 * high 11 bits and then floating-point divide by 2^53 to achieve a in random_unit_float() 63 * the possible range of the preceeding step. in random_unit_float() 67 return ((double)rand64 / denom); in random_unit_float() 75 random_uniform_denom(double denom) in random_uniform_denom()
|
| /freebsd-src/usr.bin/jot/ |
| H A D | jot.c | 1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 33 * jot - print sequential or random data 64 #define is_default(s) (*(s) == 0 || strcmp((s), "-") == 0) 67 static int prec = -1; 77 static int putdata(double, bool); 92 double begin = BEGIN_DEF; in main() 93 double divisor; in main() 94 double ender = ENDER_DEF; in main() 95 double s = STEP_DEF; in main() [all …]
|
| /freebsd-src/lib/msun/src/ |
| H A D | s_sincosl.c | 1 /*- 2 * Copyright (c) 2007, 2010-2013 Steven G. Kargl 43 #error "Unsupported long double format" 47 sincosl(long double x, long double *sn, long double *cs) in sincosl() 51 long double y[2]; in sincosl() 58 /* Optimize the case where x is already within range. */ in sincosl() 61 * If x = +-0 or x is a subnormal number, then sin(x) = x and in sincosl() 74 *sn = x - x; in sincosl() 75 *cs = x - x; in sincosl() 79 /* Range reduction. */ in sincosl() [all …]
|