| /freebsd/lib/msun/man/ |
| H A D | clog.3 | 73 .It x + I*\*(If Ta +\*(If + I*\*(Pi/2 Ta For finite x
76 .It Ta Ta for finite x
77 .It -\*(If + I*y Ta +\*(If + I*\*(Pi Ta For finite positive-signed y
78 .It +\*(If + I*y Ta +\*(If + I*0 Ta For finite positive-signed y
84 .It Ta Ta for finite y
|
| H A D | ieee.3 | 54 finite x.
60 finite x = y then \*(If = 1/(x\-y) \(!= \-1/(y\-x) = \-\*(If.
66 or to any finite number.
411 the exact result would be finite but beyond the overflow threshold.
415 a function takes exactly infinite values at finite operands.
|
| H A D | hypot.3 | 96 .Em finite
108 finite or infinite.
|
| H A D | fenv.3 | 95 For example, dividing a finite non-zero number by zero or computing
112 .Em finite
|
| /freebsd/lib/msun/src/ |
| H A D | s_finite.c | 13 * finite(x) returns 1 is x is finite, else 0;
20 int finite(double x) in finite() function
|
| H A D | s_ccosh.c | 63 /* Handle the nearly-non-exceptional cases where x and y are finite. */ in ccosh()
111 * Raise the invalid floating-point exception for finite nonzero x. in ccosh()
114 * Optionally raises the invalid floating-point exception for finite in ccosh()
143 * Optionally raises the invalid floating-point exception for finite in ccosh()
|
| H A D | s_csinh.c | 63 /* Handle the nearly-non-exceptional cases where x and y are finite. */ in csinh()
108 * Raise the invalid floating-point exception for finite nonzero x. in csinh()
111 * Optionally raises the invalid floating-point exception for finite in csinh()
142 * Optionally raises the invalid floating-point exception for finite in csinh()
|
| H A D | s_finitef.c | 17 * finitef(x) returns 1 is x is finite, else 0;
|
| H A D | e_exp.c | 57 * for finite argument, only exp(0)=1 is exact.
111 /* filter out non-finite argument */ in exp()
|
| H A D | e_scalb.c | 34 if (!finite(fn)) { in scalb()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | PlaceSafepoints.cpp | 29 // are necessary to ensure a finite period between poll sites. This is not
42 // executing code reaches a safepoint poll in a finite amount of time.
82 "Number of loops without safepoints finite execution");
215 LLVM_DEBUG(dbgs() << "skipping safepoint placement in finite loop\n"); in runOnLoop()
232 // TODO: We can create an inner loop which runs a finite number of in runOnLoop()
445 /// Returns true if this loop is known to terminate in a finite number of
447 /// does actual terminate in a finite constant number of iterations due to
471 return /* not finite */ false; in mustBeFiniteCountedLoop()
528 // at least if they do, are leaf functions that cause only finite stack in doesNotRequireEntrySafepointBefore()
574 // easiest way to ensure finite execution between safepoints in the face of in findLocationForEntrySafepoint()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | DFAEmitter.h | 9 // states that represent a nondeterministic finite state automaton (NFA) and
32 /// Construct a deterministic finite state automaton from possible
40 /// finite state automaton (NFA). This is then converted to a DFA during
|
| /freebsd/lib/msun/i387/ |
| H A D | s_finite.S | 37 ENTRY(finite)
44 END(finite)
|
| /freebsd/lib/libc/gen/ |
| H A D | fpclassify.3 | 77 a finite (zero, subnormal, or normal) value.
94 .Fn finite
|
| /freebsd/lib/msun/tests/ |
| H A D | ctrig_test.c | 161 * finite,NaN NaN,NaN [inval] NaN,NaN [inval] NaN,NaN [inval] in ATF_TC_BODY()
162 * NaN,finite NaN,NaN [inval] NaN,NaN [inval] NaN,NaN [inval] in ATF_TC_BODY()
245 * Inf,finite Inf cis(finite) Inf cis(finite) 1,0 sin(2 finite) in ATF_TC_BODY()
247 * finite,Inf NaN,NaN inval NaN,NaN inval NaN,NaN inval in ATF_TC_BODY()
|
| H A D | invctrig_test.c | 152 * finite,NaN NaN,NaN* NaN,NaN* NaN,NaN* NaN,NaN* in ATF_TC_BODY()
153 * NaN,finite NaN,NaN* NaN,NaN* NaN,NaN* NaN,NaN* in ATF_TC_BODY()
231 * Inf,finite Inf,0 0,-Inf Inf,0 0,pi/2 in ATF_TC_BODY()
232 * -Inf,finite Inf,pi pi,-Inf --- --- in ATF_TC_BODY()
233 * finite,Inf Inf,pi/2 pi/2,-Inf Inf,pi/2 0,pi/2 in ATF_TC_BODY()
|
| /freebsd/contrib/arm-optimized-routines/math/ |
| H A D | powf.c | 109 the bit representation of a non-zero finite floating-point value. */
172 /* x and y are non-zero finite. */ in powf()
175 /* Finite x < 0. */ in powf()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
| H A D | PlaceSafepoints.h | 29 // are necessary to ensure a finite period between poll sites. This is not
42 // executing code reaches a safepoint poll in a finite amount of time.
|
| /freebsd/contrib/arm-optimized-routines/pl/math/ |
| H A D | v_erfinv_25u.c | 68 By using log here, instead of log1p, we return finite values for both in special()
70 acceptable optimisation at Ofast. To get correct behaviour for all finite in special()
72 will still be finite. */ in special()
|
| H A D | v_erfinvf_5u.c | 52 By using log here, instead of log1p, we return finite values for both in special()
54 acceptable optimisation at Ofast. To get correct behaviour for all finite in special()
56 will still be finite. */ in special()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/TableGen/ |
| H A D | Automaton.td | 10 // generic finite-state automaton.
15 // generic finite-state automaton over a set of actions and states.
|
| /freebsd/contrib/file/magic/Magdir/ |
| H A D | openfst | 4 # openfs: file(1) magic for OpenFST (Weighted finite-state tranducer library)
|
| /freebsd/crypto/openssl/doc/man7/ |
| H A D | EVP_PKEY-FFC.pod | 9 Finite field cryptography (FFC) is a method of implementing discrete logarithm
10 cryptography using finite field mathematics. DSA is an example of FFC and
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | APFloat.h | 106 /// Non-zero finite numbers are represented internally as a sign bit, a 16-bit
165 // NaN is represented as negative zero. (FN -> Finite, UZ -> unsigned zero).
180 // NaN is represented as negative zero. (FN -> Finite, UZ -> unsigned zero).
187 // NaN is represented as negative zero. (FN -> Finite, UZ -> unsigned zero).
455 /// Returns true if this is the smallest (by magnitude) normalized finite
459 /// Returns true if and only if the number has the largest possible finite
554 /// Returns the smallest (by magnitude) normalized finite number in the given
1041 /// Returns the largest finite number in the given semantics.
1050 /// Returns the smallest (by magnitude) finite number in the given semantics.
1060 /// Returns the smallest (by magnitude) normalized finite number in the given
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | BN_security_bits.pod | 18 of asymmetric algorithms: the FFC (Finite Field Cryptography) and IFC
|