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

123456

/macosx-10.10.1/WTF-7600.1.24/wtf/dtoa/
H A Dstrtod.h39 double Strtod(BufferReference<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(BufferReference<const char> buffer, int exponent, char* significant_buffer, int* significant_exponent) argument
176 DoubleStrtod(BufferReference<const char> trimmed, int exponent, double* result) argument
230 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-conversion.cc82 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 local
79 CreateExponentialRepresentation( const char* decimal_digits, int length, int exponent, StringBuilder* result_builder) const argument
276 int exponent = decimal_point - 1; local
316 int exponent = decimal_point - 1; local
453 int exponent = 0; local
[all...]
H A Ddouble.h159 // 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) {
230 while (exponent > kDenormalExponent && (significand & kHiddenBit) == 0) {
232 exponent--;
235 if (exponent == kDenormalExponent && (significand & kHiddenBit) == 0) {
238 biased_exponent = static_cast<uint64_t>(exponent
[all...]
H A Dbignum-dtoa.cc41 static int NormalizedExponent(uint64_t significand, int exponent) { argument
45 exponent = exponent - 1;
47 return exponent;
53 static int EstimatePower(int exponent);
97 int exponent = Double(v).Exponent(); local
98 int normalized_exponent = NormalizedExponent(significand, exponent);
268 // exponent (decimal_point), when rounding upwards.
356 // v = f * 2^exponent and 2^52 <= f < 2^53.
357 // v is hence a normalized double with the given exponent
370 EstimatePower(int exponent) argument
453 int exponent = Double(v).Exponent(); local
505 int exponent = Double(v).Exponent(); local
[all...]
/macosx-10.10.1/cxxfilt-11/cxxfilt/libiberty/
H A Dcopysign.c11 unsigned int exponent: 11; member in struct:__anon7729::__anon7730
21 unsigned int exponent: 11; member in struct:__anon7729::__anon7731
54 unsigned int exponent :11; member in struct:__anon7733::__anon7734
69 unsigned int exponent: 11; member in struct:__anon7733::__anon7735
91 unsigned int exponent: 8; member in struct:__anon7737::__anon7738
98 unsigned int exponent:8; member in struct:__anon7737::__anon7739
116 unsigned int exponent: 8; member in struct:__anon7740::__anon7741
124 unsigned int exponent:8; member in struct:__anon7740::__anon7742
H A Dfloatformat.c150 /* In the i387 double-extended format, if the exponent is all ones,
151 then the integer bit must be set. If the exponent is neither 0
152 nor ~0, the intbit must also be set. Only if the exponent is
154 unsigned long exponent, int_bit; local
157 exponent = get_field (ufrom, fmt->byteorder, fmt->totalsize,
162 if ((exponent == 0) != (int_bit == 0))
308 long exponent;
314 exponent = get_field (ufrom, fmt->byteorder, fmt->totalsize,
317 /* If the exponent indicates a NaN, we don't have information to
320 if ((unsigned long) exponent
307 long exponent; local
468 int exponent; local
[all...]
/macosx-10.10.1/bash-94.1.2/bash-3.2/lib/sh/
H A Dstrtod.c64 /* The exponent of the number. */
65 long int exponent; local
87 exponent = 0;
99 The exponent may reduce it to within range.
103 ++exponent;
110 --exponent;
125 /* Get the exponent specified after the `e' or `E'. */
135 /* The exponent overflowed a `long int'. It is probably a safe
136 assumption that an exponent that cannot be represented by
146 /* There was no exponent
[all...]
/macosx-10.10.1/ruby-106/ruby/benchmark/
H A Dbm_so_nsieve.rb29 n.downto(n-2) do |exponent|
30 break if exponent < 0
31 m = (1 << exponent) * 10_000
32 # m = (2 ** exponent) * 10_000
H A Dbm_so_nsieve_bits.rb37 n.step(n - 2, -1) do |exponent|
38 break if exponent < 0
39 m = 2 ** exponent * 10_000
/macosx-10.10.1/WTF-7600.1.24/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...]
/macosx-10.10.1/IOHIDFamily-606.1.7/IOHIDSystem/
H A DIOFixed64.cpp82 IOFixed64 exponent(const IOFixed64 original, const UInt8 power) function
146 IOFixed64 function_at_x = x * gains[0] + exponent(x * gains[1], 2);
150 function_at_x += exponent(x * gains[2], 3);
153 function_at_x += exponent(x * gains[3], 4);
162 IOFixed64 derivative_at_x = gains[0] + x * exponent(gains[1], 2) * 2LL;
166 derivative_at_x += exponent(x, 2) * exponent(gains[2], 3) * 3LL;
169 derivative_at_x += exponent(x, 3) * exponent(gains[3], 4) * 4LL;
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_ssl/Security/
H A DsslBER.h41 * modulus and public exponent.
51 SSLBuffer *exponent); /* data mallocd and RETURNED */
54 * Given a raw modulus and exponent, cook up a
60 const SSLBuffer *exponent,
65 * modulus and public exponent.
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_ssl/lib/
H A DsslBER.h41 * modulus and public exponent.
51 SSLBuffer *exponent); /* data mallocd and RETURNED */
54 * Given a raw modulus and exponent, cook up a
60 const SSLBuffer *exponent,
65 * modulus and public exponent.
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_ssl/security_ssl/
H A DsslBER.h41 * modulus and public exponent.
51 SSLBuffer *exponent); /* data mallocd and RETURNED */
54 * Given a raw modulus and exponent, cook up a
60 const SSLBuffer *exponent,
65 * modulus and public exponent.
/macosx-10.10.1/gnutar-453/gnutar/lib/
H A Dhuman.c167 int exponent = -1; local
244 exponent = 0;
249 exponent++;
251 while (e * base <= damt && exponent < exponent_max);
285 exponent = 0;
298 exponent++;
300 while (base <= amt && exponent < exponent_max);
337 && amt == base && exponent < exponent_max)
339 exponent++;
366 if (exponent <
[all...]
/macosx-10.10.1/JavaScriptCore-7600.1.17/runtime/
H A DBigInteger.h42 int32_t exponent; local
44 decomposeDouble(number, sign, exponent, mantissa);
45 ASSERT(!sign && exponent >= 0);
47 int32_t zeroBits = exponent - 52;
64 // Shift based on the remainder of the exponent.
/macosx-10.10.1/OpenSSL098-52/src/engines/vendor_defns/
H A Datalla.h5 * regular mod_exp using the supplied modulus and exponent - no CRT form is
29 Item exponent[2]; member in struct:RSAPrivateKeyStr
/macosx-10.10.1/ruby-106/ruby/ext/bigdecimal/lib/bigdecimal/
H A Dmath.rb68 while d.nonzero? && ((m = n - (y.exponent - d.exponent).abs) > 0)
104 while d.nonzero? && ((m = n - (y.exponent - d.exponent).abs) > 0)
134 while d.nonzero? && ((m = n - (y.exponent - d.exponent).abs) > 0)
164 while d.nonzero? && ((m = n - (pi.exponent - d.exponent).abs) > 0)
176 while d.nonzero? && ((m = n - (pi.exponent - d.exponent)
[all...]
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_apple_csp/lib/
H A DbsafePKCS1.cpp94 BS_snaccBigIntToItem(snaccPubKey.publicExponent, rsaKey.exponent);
107 /* get modulus/exponent info from BSAFE */
115 BS_ItemToSnaccBigInt(rsaKey->exponent, snaccPubKey.publicExponent);
118 size_t maxSize = 2 * (rsaKey->modulus.len + rsaKey->exponent.len);
/macosx-10.10.1/Security-57031.1.35/Security/sec/Security/
H A DSecRSAKey.h42 uint8_t *exponent; /* public exponent */ member in struct:SecRSAPublicKeyParams
/macosx-10.10.1/llvmCore-3425.0.34/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...]
/macosx-10.10.1/ICU-531.30/icuSources/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). */
398 /* Invalid is set if the decNumber does not have exponent==0 or if */
406 /* special or too many digits, or bad exponent */
407 if (dn->bits&DECSPECIAL || dn->digits>10 || dn->exponent!=0) ; /* bad */
441 /* special or too many digits, or bad exponent, o
512 Int exponent=0; /* working exponent [assume 0] */ local
4281 Int exponent; /* working exponent */ local
4872 Int exponent; /* work */ local
[all...]
/macosx-10.10.1/tcl-105/tcl/tcl/generic/
H A DtclStrToD.c41 * uniquely determined by radix and by the widths of significand and exponent.
148 mp_int *significand, int nSigDigs, int exponent);
151 int exponent);
154 static double Pow10TimesFrExp(int exponent, double fraction,
157 mp_int *exactSignificand, int exponent);
158 static double SafeLdExp(double fraction, int exponent);
311 int exponentSignum = 0; /* Signum of the exponent of a floating point
313 long exponent = 0; /* Exponent of a floating point number */
690 * not allowed; otherwise, it introduces the exponent. If at least
731 * Scanned the E at the start of an exponent
312 long exponent = 0; /* Exponent of a floating point number */ local
1307 MakeLowPrecisionDouble( int signum, Tcl_WideUInt significand, int numSigDigs, int exponent) argument
1431 MakeHighPrecisionDouble( int signum, mp_int *significand, int numSigDigs, int exponent) argument
1574 RefineApproximation( double approxResult, mp_int *exactSignificand, int exponent) argument
2597 Pow10TimesFrExp( int exponent, double fraction, int *machexp) argument
[all...]

Completed in 235 milliseconds

123456