HomeSort by relevance Sort by last modified time
    Searched defs:exponent (Results 1 - 25 of 156) sorted by null

1 2 3 4 5 6 7

  /external/aac/libAACdec/src/
block.h 188 * \brief find a common exponent (shift factor) for all sfb in each Spectral window, and store them into
230 * \return the exponent of the result (mantissa) stored into *pValue.
238 UINT exponent; local
242 exponent = DFRACT_BITS - freeBits ;
243 FDK_ASSERT (exponent < 14);
258 *pValue = fMultDiv2 (invQVal, MantissaTable [lsb][exponent]) ;
261 return ExponentTable [lsb][exponent] + 1;
  /external/compiler-rt/lib/builtins/
fixdfsi.c 26 // Break a into sign, exponent, significand
30 const int exponent = (aAbs >> significandBits) - exponentBias; local
33 // If 0 < exponent < significandBits, right shift to get the result.
34 if ((unsigned int)exponent < significandBits) {
35 return sign * (significand >> (significandBits - exponent));
38 // If exponent is negative, the result is zero.
39 else if (exponent < 0) {
43 // If significandBits < exponent, left shift to get the result. This shift
48 return sign * (significand << (exponent - significandBits));
fixsfsi.c 23 // Break a into sign, exponent, significand
27 const int exponent = (aAbs >> significandBits) - exponentBias; local
30 // If 0 < exponent < significandBits, right shift to get the result.
31 if ((unsigned int)exponent < significandBits) {
32 return sign * (significand >> (significandBits - exponent));
35 // If exponent is negative, the result is zero.
36 else if (exponent < 0) {
40 // If significandBits < exponent, left shift to get the result. This shift
45 return sign * (significand << (exponent - significandBits));
floatsidf.c 39 // Exponent of (fp_t)a is the width of abs(a).
40 const int exponent = (aWidth - 1) - __builtin_clz(a); local
46 const int shift = significandBits - exponent;
49 // Insert the exponent
50 result += (rep_t)(exponent + exponentBias) << significandBits;
floatsisf.c 39 // Exponent of (fp_t)a is the width of abs(a).
40 const int exponent = (aWidth - 1) - __builtin_clz(a); local
44 if (exponent <= significandBits) {
45 const int shift = significandBits - exponent;
48 const int shift = exponent - significandBits;
55 // Insert the exponent
56 result += (rep_t)(exponent + exponentBias) << significandBits;
floatunsidf.c 31 // Exponent of (fp_t)a is the width of abs(a).
32 const int exponent = (aWidth - 1) - __builtin_clz(a); local
36 const int shift = significandBits - exponent;
39 // Insert the exponent
40 result += (rep_t)(exponent + exponentBias) << significandBits;
floatunsisf.c 31 // Exponent of (fp_t)a is the width of abs(a).
32 const int exponent = (aWidth - 1) - __builtin_clz(a); local
36 if (exponent <= significandBits) {
37 const int shift = significandBits - exponent;
40 const int shift = exponent - significandBits;
47 // Insert the exponent
48 result += (rep_t)(exponent + exponentBias) << significandBits;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/
RSAKeyParameters.java 9 private BigInteger exponent; field in class:RSAKeyParameters
14 BigInteger exponent)
19 this.exponent = exponent;
29 return exponent;
  /external/nanopb-c/examples/using_double_on_avr/
double_conversion.c 21 int16_t exponent; local
26 exponent = ((in.i >> 23) & 0xFF) - 127;
29 if (exponent == 128)
32 exponent = 1024;
34 else if (exponent == -127)
39 exponent = -1023;
48 exponent--;
56 mantissa |= (uint64_t)(exponent + 1023) << 52;
65 int16_t exponent; local
71 exponent = ((value >> 52) & 0x7FF) - 1023
    [all...]
  /external/bison/lib/
frexp.c 61 int exponent; local
81 /* Since the exponent is an 'int', it fits in 64 bits. Therefore the
87 exponent = 0;
90 /* A positive exponent. */
95 x * 2^exponent = argument, x >= 1.0. */
102 exponent += (1 << i);
118 exponent += (1 << i);
124 /* A negative or zero exponent. */
129 x * 2^exponent = argument, x < 1.0. */
136 exponent -= (1 << i)
    [all...]
isnan.c 91 - exponent = 0x0001..0x7FFF, mantissa bit 63 = 0,
92 - exponent = 0x0000, mantissa bit 63 = 1.
94 - exponent = 0x7FFF, mantissa >= 0x8000000000000001. */
96 unsigned int exponent; local
99 exponent = (m.word[EXPBIT0_WORD] >> EXPBIT0_BIT) & EXP_MASK;
102 if (exponent == 0)
104 else if (exponent == EXP_MASK)
110 if (exponent == 0)
112 else if (exponent == EXP_MASK)
143 /* A NaN can be recognized through its exponent. But exclude +Infinity an
    [all...]
printf-frexp.c 69 int exponent; local
76 x = FREXP (x, &exponent);
79 exponent -= 1;
81 if (exponent < MIN_EXP - 1)
83 x = LDEXP (x, exponent - (MIN_EXP - 1));
84 exponent = MIN_EXP - 1;
88 /* Since the exponent is an 'int', it fits in 64 bits. Therefore the
94 exponent = 0;
97 /* A nonnegative exponent. */
103 x * 2^exponent = argument, x >= 1.0. *
    [all...]
float.in.h 98 struct { unsigned int lo; unsigned int hi; unsigned int exponent; } xd; member in struct:gl_long_double_union::__anon4943
  /external/chromium_org/third_party/WebKit/Source/core/svg/
SVGComponentTransferFunctionElement.h 43 SVGAnimatedNumber* exponent() { return m_exponent.get(); } function in class:blink::SVGComponentTransferFunctionElement
  /external/chromium_org/third_party/tcmalloc/chromium/src/
sampler.h 173 const int32_t exponent = ((x_high >> 20) & 0x7FF) - 1023; local
174 return exponent + log_table_[y];
  /external/chromium_org/third_party/tcmalloc/vendor/src/
sampler.h 173 const int32_t exponent = ((x_high >> 20) & 0x7FF) - 1023; local
174 return exponent + log_table_[y];
  /external/chromium_org/v8/src/ia32/
interface-descriptors-ia32.cc 48 const Register MathPowTaggedDescriptor::exponent() { return eax; } function in class:v8::internal::MathPowTaggedDescriptor
51 const Register MathPowIntegerDescriptor::exponent() { function in class:v8::internal::MathPowIntegerDescriptor
52 return MathPowTaggedDescriptor::exponent();
  /external/chromium_org/v8/src/mips/
interface-descriptors-mips.cc 46 const Register MathPowTaggedDescriptor::exponent() { return a2; } function in class:v8::internal::MathPowTaggedDescriptor
49 const Register MathPowIntegerDescriptor::exponent() { function in class:v8::internal::MathPowIntegerDescriptor
50 return MathPowTaggedDescriptor::exponent();
  /external/chromium_org/v8/src/mips64/
interface-descriptors-mips64.cc 46 const Register MathPowTaggedDescriptor::exponent() { return a2; } function in class:v8::internal::MathPowTaggedDescriptor
49 const Register MathPowIntegerDescriptor::exponent() { function in class:v8::internal::MathPowIntegerDescriptor
50 return MathPowTaggedDescriptor::exponent();
  /external/chromium_org/v8/src/x64/
interface-descriptors-x64.cc 48 const Register MathPowTaggedDescriptor::exponent() { return rdx; } function in class:v8::internal::MathPowTaggedDescriptor
51 const Register MathPowIntegerDescriptor::exponent() { function in class:v8::internal::MathPowIntegerDescriptor
52 return MathPowTaggedDescriptor::exponent();
  /external/chromium_org/v8/src/x87/
interface-descriptors-x87.cc 48 const Register MathPowTaggedDescriptor::exponent() { return eax; } function in class:v8::internal::MathPowTaggedDescriptor
51 const Register MathPowIntegerDescriptor::exponent() { function in class:v8::internal::MathPowIntegerDescriptor
52 return MathPowTaggedDescriptor::exponent();
  /external/chromium_org/net/quic/
quic_data_reader.cc 74 // normalized (hidden bit set, exponent offset by one) with exponent zero.
75 // Zero exponent offset by one sets the bit exactly where the hidden bit is.
80 uint16 exponent = value >> kUFloat16MantissaBits; // No sign extend on uint! local
81 // After the fast pass, the exponent is at least one (offset by one).
82 // Un-offset the exponent.
83 --exponent;
84 DCHECK_GE(exponent, 1);
85 DCHECK_LE(exponent, kUFloat16MaxExponent);
86 // Here we need to clear the exponent and set the hidden bit. We have alread
90 *result <<= exponent; local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/platform/graphics/filters/
FEComponentTransfer.h 47 , exponent(0)
57 float exponent; member in struct:blink::ComponentTransferFunction
  /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
strtod.cc 116 int exponent,
129 exponent + (buffer.length() - kMaxSignificantDecimalDigits);
168 // Compute the binary exponent.
169 int exponent = 0; local
170 *result = DiyFp(significand, exponent);
177 int exponent,
191 // If the 10^exponent (resp. 10^-exponent) fits into a double too then we
196 if (exponent < 0 && -exponent < kExactPowersOfTenSize)
    [all...]
  /external/chromium_org/third_party/freetype/src/psaux/
psconv.c 265 /* read exponent, if any */
268 FT_Long exponent; local
274 exponent = PS_Conv_ToInt( &p, limit );
279 /* arbitrarily limit exponent */
280 if ( exponent > 1000 )
282 else if ( exponent < -1000 )
285 power_ten += exponent;

Completed in 8332 milliseconds

1 2 3 4 5 6 7