Searched refs:exponent (Results 1 - 25 of 210) sorted by relevance

123456789

/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/
H A DRSAKeyParameters.java9 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/compiler-rt/lib/
H A Dfixdfsi.c25 // 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 Dfixsfsi.c23 // 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 Dfloatunsisf.c31 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;
H A Dfloatsidf.c39 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 Dfloatunsidf.c31 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 Dfloatsisf.c39 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;
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
H A Dstrtod.h39 double Strtod(Vector<const char> buffer, int exponent);
H A Dstrtod.cc116 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 < kExactPowersOfTenSiz
115 TrimToMaxSignificantDigits(Vector<const char> buffer, int exponent, char* significant_buffer, int* significant_exponent) argument
176 DoubleStrtod(Vector<const char> trimmed, int exponent, double* result) argument
230 AdjustmentPowerOfTen(int exponent) argument
[all...]
H A Dfixed-dtoa.cc226 // point at bit (-exponent).
228 // -128 <= exponent <= 0.
229 // 0 <= fractionals * 2^exponent < 1
236 static void FillFractionals(uint64_t fractionals, int exponent, argument
239 ASSERT(-128 <= exponent && exponent <= 0);
241 // (-exponent). Inside the function the non-converted remainder of fractionals
243 if (-exponent <= 64) {
246 int point = -exponent;
271 ASSERT(64 < -exponent
320 int exponent = Double(v).Exponent(); local
371 significand <<= exponent; local
[all...]
/external/chromium_org/v8/src/
H A Dstrtod.h36 double Strtod(Vector<const char> buffer, int exponent);
H A Dstrtod.cc115 int exponent,
128 exponent + (buffer.length() - kMaxSignificantDecimalDigits);
168 // Compute the binary exponent.
169 int exponent = 0; local
170 *result = DiyFp(significand, exponent);
177 int exponent,
192 // If the 10^exponent (resp. 10^-exponent) fits into a double too then we
197 if (exponent < 0 && -exponent < kExactPowersOfTenSiz
114 TrimToMaxSignificantDigits(Vector<const char> buffer, int exponent, char* significant_buffer, int* significant_exponent) argument
176 DoubleStrtod(Vector<const char> trimmed, int exponent, double* result) argument
231 AdjustmentPowerOfTen(int exponent) argument
[all...]
H A Dfixed-dtoa.cc225 // point at bit (-exponent).
227 // -128 <= exponent <= 0.
228 // 0 <= fractionals * 2^exponent < 1
235 static void FillFractionals(uint64_t fractionals, int exponent, argument
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
319 int exponent = Double(v).Exponent(); local
370 significand <<= exponent; local
[all...]
/external/v8/src/
H A Dstrtod.h36 double Strtod(Vector<const char> buffer, int exponent);
H A Dstrtod.cc115 int exponent,
128 exponent + (buffer.length() - kMaxSignificantDecimalDigits);
167 // Compute the binary exponent.
168 int exponent = 0; local
169 *result = DiyFp(significand, exponent);
176 int exponent,
192 // If the 10^exponent (resp. 10^-exponent) fits into a double too then we
197 if (exponent < 0 && -exponent < kExactPowersOfTenSiz
114 TrimToMaxSignificantDigits(Vector<const char> buffer, int exponent, char* significant_buffer, int* significant_exponent) argument
175 DoubleStrtod(Vector<const char> trimmed, int exponent, double* result) argument
231 AdjustmentPowerOfTen(int exponent) argument
[all...]
H A Dfixed-dtoa.cc225 // point at bit (-exponent).
227 // -128 <= exponent <= 0.
228 // 0 <= fractionals * 2^exponent < 1
235 static void FillFractionals(uint64_t fractionals, int exponent, argument
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
319 int exponent = Double(v).Exponent(); local
370 significand <<= exponent; local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_format_r11g11b10f.h59 /* Map exponent to the range [-127,128] */
60 int exponent = ((f32.ui >> 23) & 0xff) - 127; local
63 if (exponent == 128) { /* Infinity or NaN */
88 else if (exponent > -15) { /* Representable value */
89 exponent += UF11_EXPONENT_BIAS;
91 uf11 = exponent << UF11_EXPONENT_SHIFT | mantissa;
104 int exponent = (val & 0x07c0) >> UF11_EXPONENT_SHIFT; local
109 if (exponent == 0) {
115 else if (exponent == 31) {
120 exponent
146 int exponent = ((f32.ui >> 23) & 0xff) - 127; local
190 int exponent = (val & 0x03e0) >> UF10_EXPONENT_SHIFT; local
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_format_r11g11b10f.h59 /* Map exponent to the range [-127,128] */
60 int exponent = ((f32.ui >> 23) & 0xff) - 127; local
63 if (exponent == 128) { /* Infinity or NaN */
88 else if (exponent > -15) { /* Representable value */
89 exponent += UF11_EXPONENT_BIAS;
91 uf11 = exponent << UF11_EXPONENT_SHIFT | mantissa;
104 int exponent = (val & 0x07c0) >> UF11_EXPONENT_SHIFT; local
109 if (exponent == 0) {
115 else if (exponent == 31) {
120 exponent
146 int exponent = ((f32.ui >> 23) & 0xff) - 127; local
190 int exponent = (val & 0x03e0) >> UF10_EXPONENT_SHIFT; local
[all...]
/external/chromium_org/third_party/WebKit/Source/modules/crypto/
H A DRsaKeyGenParams.cpp46 const WebKit::WebVector<unsigned char>& exponent = m_algorithm.rsaKeyGenParams()->publicExponent(); local
47 m_publicExponent = Uint8Array::create(exponent.data(), exponent.size());
/external/bison/lib/
H A Dprintf-frexp.c69 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...]
H A Dfrexp.c61 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...]
/external/guava/guava/src/com/google/common/math/
H A DDoubleUtils.java55 // The mask for the exponent, according to the {@link
80 int exponent = (int) ((bits & EXPONENT_MASK) >> SIGNIFICAND_BITS);
81 exponent -= EXPONENT_BIAS;
82 return exponent;
90 int exponent = getExponent(d);
91 switch (exponent) {
97 int newExponent = exponent + scale;
111 int exponent = getExponent(d);
114 return (exponent == MIN_DOUBLE_EXPONENT - 1)
139 int exponent
[all...]
/external/chromium_org/chrome/common/extensions/docs/examples/apps/calculator/app/
H A Dmodel.js119 var exponent = Number(x.toExponential(this.precision - 1).split('e')[1]);
120 var digits = this.digits_(exponent);
122 var fixed = (Math.abs(exponent) < this.precision && exponent > -7);
132 Model.prototype.digits_ = function(exponent) {
133 return (isNaN(exponent) || exponent < -199 || exponent > 199) ? 0 :
134 (exponent < -99) ? (this.precision - 1 - 5) :
135 (exponent <
[all...]
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DDecimalNumber.cpp37 // if the exponent is negative the number decimal representation is of the form:
90 int exponent = (m_exponent >= 0) ? m_exponent : -m_exponent; local
92 // Add the exponent
93 if (exponent >= 100)
95 if (exponent >= 10)
110 // if the exponent is negative the number decimal representation is of the form:
180 int exponent; local
183 exponent = m_exponent;
186 exponent = -m_exponent;
189 // Add the exponent
[all...]
/external/chromium_org/v8/test/cctest/
H A Dtest-code-stubs.cc48 int32_t exponent = (((exponent_bits & shifted_mask) >> local
51 uint32_t unsigned_exponent = static_cast<uint32_t>(exponent);
56 if ((exponent - Double::kPhysicalSignificandSize) < 32) {
58 (exponent - Double::kPhysicalSignificandSize);
63 big_result = big_result >> (Double::kPhysicalSignificandSize - exponent);

Completed in 776 milliseconds

123456789