/external/aac/libAACdec/src/ |
H A D | 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/chromium_org/third_party/WebKit/Source/modules/crypto/ |
H A D | RsaKeyGenParams.cpp | 46 const blink::WebVector<unsigned char>& exponent = m_algorithm.rsaKeyGenParams()->publicExponent(); local 47 m_publicExponent = Uint8Array::create(exponent.data(), exponent.size());
|
/external/compiler-rt/lib/ |
H A D | fixdfsi.c | 25 // Break a into sign, exponent, significand 29 const int exponent = (aAbs >> significandBits) - exponentBias; local 32 // If 0 < exponent < significandBits, right shift to get the result. 33 if ((unsigned int)exponent < significandBits) { 34 return sign * (significand >> (significandBits - exponent)); 37 // If exponent is negative, the result is zero. 38 else if (exponent < 0) { 42 // If significandBits < exponent, left shift to get the result. This shift 47 return sign * (significand << (exponent - significandBits));
|
H A D | 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));
|
H A D | floatsidf.c | 39 const int exponent = (aWidth - 1) - __builtin_clz(a); local 45 const int shift = significandBits - exponent; 48 // Insert the exponent 49 result += (rep_t)(exponent + exponentBias) << significandBits;
|
H A D | floatsisf.c | 39 const int exponent = (aWidth - 1) - __builtin_clz(a); local 43 if (exponent <= significandBits) { 44 const int shift = significandBits - exponent; 47 const int shift = exponent - significandBits; 54 // Insert the exponent 55 result += (rep_t)(exponent + exponentBias) << significandBits;
|
H A D | floatunsidf.c | 31 const int exponent = (aWidth - 1) - __builtin_clz(a); local 35 const int shift = significandBits - exponent; 38 // Insert the exponent 39 result += (rep_t)(exponent + exponentBias) << significandBits;
|
H A D | floatunsisf.c | 31 const int exponent = (aWidth - 1) - __builtin_clz(a); local 35 if (exponent <= significandBits) { 36 const int shift = significandBits - exponent; 39 const int shift = exponent - significandBits; 46 // Insert the exponent 47 result += (rep_t)(exponent + exponentBias) << significandBits;
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/ |
H A D | RSAKeyParameters.java | 9 private BigInteger exponent; field in class:RSAKeyParameters 14 BigInteger exponent) 19 this.exponent = exponent; 29 return exponent; 11 RSAKeyParameters( boolean isPrivate, BigInteger modulus, BigInteger exponent) argument
|
/external/bison/lib/ |
H A D | 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 [all...] |
H A D | float.in.h | 98 struct { unsigned int lo; unsigned int hi; unsigned int exponent; } xd; member in struct:gl_long_double_union::__anon315
|
H A D | 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 [all...] |
H A D | 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 [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | DecimalNumber.cpp | 34 // if the exponent is negative the number decimal representation is of the form: 87 int exponent = (m_exponent >= 0) ? m_exponent : -m_exponent; local 89 // Add the exponent 90 if (exponent >= 100) 92 if (exponent >= 10) 107 // if the exponent is negative the number decimal representation is of the form: 177 int exponent; local 180 exponent = m_exponent; 183 exponent = -m_exponent; 186 // Add the exponent [all...] |
H A D | DecimalNumber.h | 48 // Zero should always have exponent 0. 66 // Zero should always have exponent 0. 81 // Zero should always have exponent 0. 92 int exponent() const { return m_exponent; } function in class:WTF::DecimalNumber
|
/external/eigen/Eigen/src/Core/ |
H A D | GlobalFunctions.h | 54 pow(const Eigen::ArrayBase<Derived>& x, const typename Derived::Scalar& exponent) { argument 55 return x.derived().pow(exponent);
|
/external/chromium_org/media/cast/rtcp/ |
H A D | rtcp_sender.h | 99 uint8* exponent, 101 // 6 bit exponent and a 18 bit mantissa. 102 *exponent = 0; 105 *exponent = i; 109 *mantissa = (bitrate >> *exponent); 98 BitrateToRembExponentBitrate(uint32 bitrate, uint8* exponent, uint32* mantissa) const argument
|
/external/chromium_org/third_party/WebKit/Source/platform/graphics/filters/ |
H A D | FEComponentTransfer.h | 47 , exponent(0) 57 float exponent; member in struct:WebCore::ComponentTransferFunction
|
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
H A D | fast-dtoa.cc | 40 // The minimal and maximal target exponent define the range of w's binary 41 // exponent, where 'w' is the result of multiplying the input by a cached power 245 int* exponent) { 254 *exponent = 9; 262 *exponent = 8; 270 *exponent = 7; 279 *exponent = 6; 287 *exponent = 5; 295 *exponent = 4; 304 *exponent 242 BiggestPowerTen(uint32_t number, int number_bits, uint32_t* power, int* exponent) argument [all...] |
/external/chromium_org/third_party/freetype/src/psaux/ |
H A D | 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;
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | decNumber.h | 83 int32_t exponent; /* Unadjusted exponent, unbiased, in */ member in struct:__anon11700
|
H A D | nfrule.h | 62 double getDivisor() const { return uprv_pow(radix, exponent); } 97 int16_t exponent; member in class:NFRule
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
H A D | querymatrix.c | 25 * GLint exponent[16] ) 27 * format. exponent[16] contains the unbiased exponents applied to the 29 * is close to mantissa[i] * 2^exponent[i]. The function returns a status 93 extern GLbitfield GL_APIENTRY _es_QueryMatrixxOES(GLfixed mantissa[16], GLint exponent[16]); 99 GLbitfield GL_APIENTRY _es_QueryMatrixxOES(GLfixed mantissa[16], GLint exponent[16]) argument 167 exponent[i] = (GLint) exp; 182 exponent[i] = (GLint) 0; 196 exponent[i] = (GLint) 0; 205 exponent[i] = (GLint) 0;
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | 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/ |
H A D | sampler.h | 173 const int32_t exponent = ((x_high >> 20) & 0x7FF) - 1023; local 174 return exponent + log_table_[y];
|