| /libcore/luni/src/main/java/java/lang/ |
| HexStringParser.java | 69 private long exponent; field in class:HexStringParser
119 exponent <<= MANTISSA_WIDTH;
120 return sign | exponent | mantissa;
131 * Parses the exponent field.
141 exponent = expSign * Long.parseLong(exponentStr);
144 exponent = expSign * Long.MAX_VALUE;
165 if (exponent >= MAX_EXPONENT) {
170 if (exponent <= MIN_EXPONENT) {
182 if (exponent >= 1) {
191 exponent = MAX_EXPONENT
[all...] |
| /libcore/luni/src/main/java/java/security/spec/ |
| RSAPrivateKeySpec.java | 32 // Private Exponent
37 * private exponent.
42 * the private exponent {@code e}
59 * Returns the private exponent {@code e}.
61 * @return the private exponent {@code e}.
|
| RSAPublicKeySpec.java | 32 // Public Exponent
37 * public exponent.
42 * the public exponent {@code d}.
59 * Returns the public exponent {@code d}.
61 * @return the public exponent {@code d}.
|
| RSAMultiPrimePrivateCrtKeySpec.java | 31 // Public Exponent
37 // Prime Exponent P
39 // Prime Exponent Q
48 * modulus, public exponent, private exponent, prime factors, prime
54 * the public exponent {@code e}.
56 * the private exponent {@code d}.
62 * the exponent of the prime {@code p}.
64 * the exponent of the prime {@code q}.
159 * Returns the exponent of the prime {@code p}
[all...] |
| RSAOtherPrimeInfo.java | 24 * exponent, and a Chinese Remainder Theorem (CRT) coefficient.
33 // Prime Exponent
40 * exponent, and CRT coefficient.
45 * the prime exponent.
84 * Returns the exponent.
86 * @return the exponent.
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| 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...] |
| /external/aac/libFDK/include/ |
| fixpoint_math.h | 144 /* Correct odd exponent. */
155 /* Write back exponent */
261 * \param result_e pointer to an INT where the exponent of the result is stored into
286 * \return num/denum with exponent = 0
294 * \param result_e pointer to an INT where the exponent of the result is stored into
295 * \return num/denum with exponent = *result_e
303 * \return num/denum with exponent = 0
310 * \param arg_e exponent of the argument
311 * \param result_e pointer to an INT to store the exponent of the result
319 * \param exp_m mantissa of the exponent to 2.0
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_inline_literals.c | 15 * 30:23 exponent
20 * 3:6 exponent (bias 7)
29 int exponent = biased_exponent - 127; local
34 DBG("Raw exponent = %d\n", exponent);
36 if (exponent < -7 || exponent > 8) {
37 DBG("Failed exponent out of range\n\n");
49 r300_exponent = exponent + 7;
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_inline_literals.c | 15 * 30:23 exponent
20 * 3:6 exponent (bias 7)
29 int exponent = biased_exponent - 127; local
34 DBG("Raw exponent = %d\n", exponent);
36 if (exponent < -7 || exponent > 8) {
37 DBG("Failed exponent out of range\n\n");
49 r300_exponent = exponent + 7;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
| fixed-dtoa.cc | 224 // point at bit (-exponent).
226 // -128 <= exponent <= 0.
227 // 0 <= fractionals * 2^exponent < 1
234 static void FillFractionals(uint64_t fractionals, int exponent,
237 ASSERT(-128 <= exponent && exponent <= 0);
239 // (-exponent). Inside the function the non-converted remainder of fractionals
241 if (-exponent <= 64) {
244 int point = -exponent;
269 ASSERT(64 < -exponent && -exponent <= 128)
318 int exponent = Double(v).Exponent(); local
369 significand <<= exponent; local
[all...] |
| double-conversion.cc | 82 int exponent,
91 if (exponent < 0) {
93 exponent = -exponent;
99 if (exponent == 0) {
103 ASSERT(exponent < 1e4);
108 while (exponent > 0) {
109 buffer[--first_char_pos] = '0' + (exponent % 10);
110 exponent /= 10;
185 int exponent = decimal_point - 1 local
276 int exponent = decimal_point - 1; local
316 int exponent = decimal_point - 1; local
453 int exponent = 0; local
[all...] |
| double.h | 62 return DiyFp(Significand(), Exponent());
69 int e = Exponent();
101 int Exponent() const {
154 return DiyFp(Significand() * 2 + 1, Exponent() - 1);
159 // exponent as m_plus.
173 // Note: denormals have the same exponent as the smallest normals.
219 int exponent = diy_fp.e(); local
222 exponent++;
224 if (exponent >= kMaxExponent) {
227 if (exponent < kDenormalExponent)
[all...] |
| /external/chromium_org/v8/src/ |
| fixed-dtoa.cc | 225 // point at bit (-exponent).
227 // -128 <= exponent <= 0.
228 // 0 <= fractionals * 2^exponent < 1
235 static void FillFractionals(uint64_t fractionals, int exponent,
238 ASSERT(-128 <= exponent && exponent <= 0);
240 // (-exponent). Inside the function the non-converted remainder of fractionals
242 if (-exponent <= 64) {
245 int point = -exponent;
270 ASSERT(64 < -exponent && -exponent <= 128)
319 int exponent = Double(v).Exponent(); local
370 significand <<= exponent; local
[all...] |
| /external/v8/src/ |
| fixed-dtoa.cc | 225 // point at bit (-exponent).
227 // -128 <= exponent <= 0.
228 // 0 <= fractionals * 2^exponent < 1
235 static void FillFractionals(uint64_t fractionals, int exponent,
238 ASSERT(-128 <= exponent && exponent <= 0);
240 // (-exponent). Inside the function the non-converted remainder of fractionals
242 if (-exponent <= 64) {
245 int point = -exponent;
270 ASSERT(64 < -exponent && -exponent <= 128)
319 int exponent = Double(v).Exponent(); local
370 significand <<= exponent; local
[all...] |
| /libcore/luni/src/main/java/java/security/interfaces/ |
| RSAMultiPrimePrivateCrtKey.java | 65 * Returns the CRT exponent of the prime {@code p}.
67 * @return the CRT exponent of the prime {@code p}.
72 * Returns the CRT exponent of the prime {@code q}.
74 * @return the CRT exponent of the prime {@code q}.
79 * Returns the public exponent {@code e}.
81 * @return the public exponent {@code e}.
|
| /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...] |
| /frameworks/base/opengl/java/javax/microedition/khronos/opengles/ |
| GL10Ext.java | 27 int[] exponent,
33 java.nio.IntBuffer exponent
|
| /libcore/luni/src/main/native/ |
| cbigint.h | 27 /* IEEE floats consist of: sign bit, exponent field, significand field
28 single: 31 = sign bit, 30..23 = exponent (8 bits), 22..0 = significand (23 bits)
29 double: 63 = sign bit, 62..52 = exponent (11 bits), 51..0 = significand (52 bits)
30 inf == (all exponent bits set) and (all mantissa bits clear)
31 nan == (all exponent bits set) and (at least one mantissa bit set)
32 finite == (at least one exponent bit clear)
33 zero == (all exponent bits clear) and (all mantissa bits clear)
34 denormal == (all exponent bits clear) and (at least one mantissa bit set)
|
| /hardware/samsung_slsi/exynos5/libkeymaster/ |
| tlcTeeKeymaster_if.h | 97 * RSA private key metadata (Private modulus and exponent lengths)
101 uint32_t lenpriexp; /**< Private key exponent length */
106 * RSA CRT private key metadata (Private modulus and exponent lengths)
119 * Key metadata (public key hash, key size, modulus/exponent lengths, etc..)
125 uint32_t lenpubexp; /**< Public key exponent length */
143 * @param exponent [in] Exponent number
151 uint32_t exponent,
275 * |--key metadata--|--public modulus--|--public exponent--|--private exponent--
[all...] |
| /frameworks/opt/net/voip/src/jni/rtp/ |
| G711Codec.cpp | 60 int exponent = gExponents[sample >> 8]; local
61 int mantissa = (sample >> (exponent + 3)) & 0x0F;
62 ulaws[i] = ~(sign | (exponent << 4) | mantissa);
75 int exponent = (ulaw >> 4) & 0x07; local
77 int sample = (((mantissa << 3) + 132) << exponent) - 132;
110 int exponent = gExponents[sample >> 8]; local
111 int mantissa = (sample >> (exponent == 0 ? 4 : exponent + 3)) & 0x0F;
112 alaws[i] = (sign | (exponent << 4) | mantissa) ^ 0xD5;
125 int exponent = (alaw >> 4) & 0x07 local
[all...] |
| /external/chromium_org/media/cast/rtcp/ |
| 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);
|
| /external/compiler-rt/lib/ |
| floatsidf.c | 38 // Exponent of (fp_t)a is the width of abs(a).
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;
|
| floatunsidf.c | 30 // Exponent of (fp_t)a is the width of abs(a).
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;
|
| /frameworks/av/media/libstagefright/codecs/amrwbenc/src/ |
| log2.c | 41 * normalized, and exp is the normalisation exponent
48 * 1- exponent = 30-norm_exponent
59 Word16 *exponent, /* (o) : Integer part of Log2. (range: 0<=val<=30) */
67 *exponent = 0;
71 *exponent = (30 - exp);
100 Word16 *exponent, /* (o) : Integer part of Log2. (range: 0<=val<=30) */
107 Log2_norm ((L_x << exp), exp, exponent, fraction);
|
