/external/compiler-rt/lib/builtins/ |
divsf3.c | 80 // [1, 2.0) and get a Q32 approximate reciprocal using a small minimax 81 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This 84 uint32_t reciprocal = UINT32_C(0x7504f333) - q31b; local 86 // Now refine the reciprocal estimate using a Newton-Raphson iteration: 94 correction = -((uint64_t)reciprocal * q31b >> 32); 95 reciprocal = (uint64_t)reciprocal * correction >> 31; 96 correction = -((uint64_t)reciprocal * q31b >> 32); 97 reciprocal = (uint64_t)reciprocal * correction >> 31 [all...] |
divdf3.c | 80 // [1, 2.0) and get a Q32 approximate reciprocal using a small minimax 81 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This 86 // Now refine the reciprocal estimate using a Newton-Raphson iteration: 110 uint64_t correction, reciprocal; local 114 reciprocal = (uint64_t)recip32*cHi + ((uint64_t)recip32*cLo >> 32); 117 // 64-bit reciprocal estimate downward to ensure that it is strictly smaller 118 // than the infinitely precise exact reciprocal. Because the computation 121 reciprocal -= 2; 123 // The numerical reciprocal is accurate to within 2^-56, lies in the 124 // interval [0.5, 1.0), and is strictly smaller than the true reciprocal [all...] |
divtf3.c | 78 // [1, 2.0) and get a Q64 approximate reciprocal using a small minimax 79 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This 85 // Now refine the reciprocal estimate using a Newton-Raphson iteration: 112 rep_t correction, reciprocal; local 128 reciprocal = r64cH + (r64cL >> 64); 131 // 128-bit reciprocal estimate downward to ensure that it is strictly smaller 132 // than the infinitely precise exact reciprocal. Because the computation 135 reciprocal -= 2; 137 // The numerical reciprocal is accurate to within 2^-112, lies in the 138 // interval [0.5, 1.0), and is strictly smaller than the true reciprocal [all...] |
/external/skia/src/pathops/ |
SkLineParameters.h | 131 double reciprocal = 1 / normal; local 132 fA *= reciprocal; 133 fB *= reciprocal; 134 fC *= reciprocal;
|
/external/libpng/ |
pngwrite.c | 1772 png_uint_32 reciprocal = 0; local 1924 png_uint_32 reciprocal = 0; local 2042 png_uint_32 reciprocal = 0; local [all...] |
/external/pdfium/samples/fx_lpng/lpng_v163/ |
fx_pngwrite.c | 1668 png_uint_32 reciprocal = 0; local 1818 png_uint_32 reciprocal = 0; local 1935 png_uint_32 reciprocal = 0; local [all...] |
/art/compiler/optimizing/ |
instruction_simplifier.cc | 415 HConstant* reciprocal = nullptr; local 419 reciprocal = GetGraph()->GetDoubleConstant(1.0 / value); 425 reciprocal = GetGraph()->GetFloatConstant(1.0f / value); 429 if (reciprocal != nullptr) { 431 instruction, new (GetGraph()->GetArena()) HMul(type, input_other, reciprocal));
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/fraction/ |
Fraction.java | 414 * @return the reciprocal fraction 416 public Fraction reciprocal() { method in class:Fraction 577 return multiply(fraction.reciprocal());
|
BigFraction.java | 670 return multiply(fraction.reciprocal()); 1008 public BigFraction reciprocal() { method in class:BigFraction [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/ |
multidigraph.py | 711 def to_undirected(self, reciprocal=False): 716 reciprocal : bool (optional) 745 if reciprocal is True:
|
digraph.py | [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/classes/tests/ |
test_digraph.py | 164 assert_false(G.to_undirected(reciprocal=True).has_edge(1,2)) 166 assert_true(G.to_undirected(reciprocal=True).has_edge(1,2))
|
test_multidigraph.py | 202 assert_false(G.to_undirected(reciprocal=True).has_edge(1,2)) 204 assert_true(G.to_undirected(reciprocal=True).has_edge(1,2))
|
/external/v8/src/ |
math.js | 152 // Division by 0x100000000 through multiplication by reciprocal.
|
/external/llvm/lib/Support/ |
APFloat.cpp | [all...] |
/frameworks/rs/api/ |
rs_math.spec | 759 summary: Reciprocal computed to 16 bit precision 761 Returns the approximate reciprocal of a value. 775 summary: Reciprocal of a square root computed to 16 bit precision [all...] |