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

12345

/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/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...]
H A Ddouble.h159 // exponent as m_plus.
173 // Note: denormals have the same exponent as the smallest normals.
210 int exponent = diy_fp.e(); local
213 exponent++;
215 if (exponent >= kMaxExponent) {
218 if (exponent < kDenormalExponent) {
221 while (exponent > kDenormalExponent && (significand & kHiddenBit) == 0) {
223 exponent--;
226 if (exponent == kDenormalExponent && (significand & kHiddenBit) == 0) {
229 biased_exponent = static_cast<uint64_t>(exponent
[all...]
H A Dconversions-inl.h94 int exponent = d.Exponent();
95 if (exponent < 0) {
96 if (exponent <= -Double::kSignificandSize) return 0;
97 return d.Sign() * static_cast<int32_t>(d.Significand() >> -exponent);
99 if (exponent > 31) return 0;
100 return d.Sign() * static_cast<int32_t>(d.Significand() << exponent);
149 int exponent = 0; local
183 exponent = overflow_bits_count;
190 exponent += radix_log_2;
211 exponent
[all...]
H A Dconversions.cc113 int exponent = decimal_point - 1; local
114 if (exponent < 0) exponent = -exponent;
115 builder.AddDecimalInteger(exponent);
215 int exponent,
219 if (exponent < 0) {
221 exponent = -exponent;
225 // letter 'e', a minus or a plus depending on the exponent, an
214 CreateExponentialRepresentation(char* decimal_rep, int exponent, bool negative, int significant_digits) argument
284 int exponent = decimal_point - 1; local
317 int exponent = decimal_point - 1; local
[all...]
H A Dbignum-dtoa.cc42 static int NormalizedExponent(uint64_t significand, int exponent) { argument
46 exponent = exponent - 1;
48 return exponent;
54 static int EstimatePower(int exponent);
98 int exponent = Double(v).Exponent(); local
99 int normalized_exponent = NormalizedExponent(significand, exponent);
269 // exponent (decimal_point), when rounding upwards.
357 // v = f * 2^exponent and 2^52 <= f < 2^53.
358 // v is hence a normalized double with the given exponent
371 EstimatePower(int exponent) argument
454 int exponent = Double(v).Exponent(); local
506 int exponent = Double(v).Exponent(); local
[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...]
H A DDoubleMath.java163 int exponent = getExponent(x);
164 if (exponent < 0) {
168 BigInteger result = BigInteger.valueOf(significand).shiftLeft(exponent - SIGNIFICAND_BITS);
213 int exponent = getExponent(x);
231 increment = exponent < 0 & !isPowerOfTwo(x);
234 increment = exponent >= 0 & !isPowerOfTwo(x);
241 // so log2(x) is never exactly exponent + 0.5.
247 return increment ? exponent + 1 : exponent;
/external/webkit/Source/JavaScriptCore/wtf/
H A Ddtoa.h37 void dtoa(DtoaBuffer result, double dd, bool& sign, int& exponent, unsigned& precision);
38 void dtoaRoundSF(DtoaBuffer result, double dd, int ndigits, bool& sign, int& exponent, unsigned& precision);
39 void dtoaRoundDP(DtoaBuffer result, double dd, int ndigits, bool& sign, int& exponent, unsigned& precision);
41 // Size = 80 for sizeof(DtoaBuffer) + some sign bits, decimal point, 'e', exponent digits.
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/webkit/Source/WebCore/platform/graphics/filters/arm/
H A DFELightingNEON.cpp170 #define POWF_SQR(value, exponent, current, remaining) \
171 "tst " exponent ", #" ASSTRING(current) NL \
173 "tst " exponent ", #" ASSTRING(remaining) NL \
176 #define POWF_SQRT(value, exponent, current, remaining) \
177 "tst " exponent ", #" ASSTRING(remaining) NL \
179 "tst " exponent ", #" ASSTRING(current) NL \
183 #define POWF(value, exponent) \
184 "tst " exponent ", #0xfc0" NL \
186 "tst " exponent ", #0x03f" NL \
190 POWF_SQR(value, exponent,
[all...]
/external/webkit/Source/WebCore/html/parser/
H A DHTMLParserIdioms.cpp124 int exponent = 0; local
151 exponent = 19999; /* safe for 16 bit ints */
153 exponent = static_cast<int>(exponent32);
155 exponent = -exponent;
157 exponent = 0;
161 int intDecimalPlaces = baseDecimalPlaces - exponent;
/external/webkit/Source/WebCore/svg/
H A DSVGComponentTransferFunctionElement.h52 DECLARE_ANIMATED_NUMBER(Exponent, exponent)
/external/llvm/lib/Support/
H A DAPFloat.cpp125 /* Return the value of a decimal exponent of the form
128 If the exponent overflows, returns a large exponent with the
147 assert(absExponent < 10U && "Invalid character in exponent");
153 assert(value < 10U && "Invalid character in exponent");
164 assert(p == end && "Invalid exponent in exponent");
180 int exponent = 0;
196 assert(value < 10U && "Invalid character in exponent");
209 exponent
260 int exponent; member in struct:decimalInfo
[all...]
/external/icu4c/i18n/
H A DdecNumber.c60 /* precision (up to 999,999,999 digits) and arbitrary exponent */
69 /* be finite, positive, have an exponent of zero, and all digits */
71 /* which are 0 or 1 (and will have exponent=0 and a sign of 0). */
136 /* 4. Exponent checking is minimized by allowing the exponent to */
141 /* overflow (the most negative valid exponent is -1999999997, for */
142 /* a 999999999-digit number with adjusted exponent of -999999999). */
383 /* Invalid is set if the decNumber does not have exponent==0 or if */
391 /* special or too many digits, or bad exponent */
392 if (dn->bits&DECSPECIAL || dn->digits>10 || dn->exponent!=0) ; /* bad */
426 /* special or too many digits, or bad exponent, o
497 Int exponent=0; /* working exponent [assume 0] */ local
4264 Int exponent; /* working exponent */ local
4855 Int exponent; /* work */ local
[all...]
/external/kernel-headers/original/asm-x86/
H A Dsigcontext.h24 unsigned short exponent; member in struct:_fpreg
29 unsigned short exponent; member in struct:_fpxreg
/external/webkit/Source/WebCore/platform/graphics/filters/
H A DFEComponentTransfer.h48 , exponent(0)
58 float exponent; member in struct:WebCore::ComponentTransferFunction

Completed in 379 milliseconds

12345