/macosx-10.10/WTF-7600.1.24/wtf/dtoa/ |
H A D | strtod.h | 39 double Strtod(BufferReference<const char> buffer, int exponent);
|
H A D | strtod.cc | 116 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 D | 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, 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 D | 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 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 D | double.h | 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) { 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 D | bignum-dtoa.cc | 41 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/cxxfilt-11/cxxfilt/libiberty/ |
H A D | copysign.c | 11 unsigned int exponent: 11; member in struct:__anon8022::__anon8023 21 unsigned int exponent: 11; member in struct:__anon8022::__anon8024 54 unsigned int exponent :11; member in struct:__anon8026::__anon8027 69 unsigned int exponent: 11; member in struct:__anon8026::__anon8028 91 unsigned int exponent: 8; member in struct:__anon8030::__anon8031 98 unsigned int exponent:8; member in struct:__anon8030::__anon8032 116 unsigned int exponent: 8; member in struct:__anon8033::__anon8034 124 unsigned int exponent:8; member in struct:__anon8033::__anon8035
|
H A D | floatformat.c | 150 /* 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/bash-94.1.2/bash-3.2/lib/sh/ |
H A D | strtod.c | 64 /* 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/ruby-106/ruby/benchmark/ |
H A D | bm_so_nsieve.rb | 29 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 D | bm_so_nsieve_bits.rb | 37 n.step(n - 2, -1) do |exponent| 38 break if exponent < 0 39 m = 2 ** exponent * 10_000
|
/macosx-10.10/WTF-7600.1.24/wtf/ |
H A D | DecimalNumber.cpp | 37 // 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/WebCore-7600.1.25/crypto/keys/ |
H A D | CryptoKeyDataRSAComponents.cpp | 33 CryptoKeyDataRSAComponents::CryptoKeyDataRSAComponents(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent) argument 37 , m_exponent(exponent) 41 CryptoKeyDataRSAComponents::CryptoKeyDataRSAComponents(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent, const Vector<uint8_t>& privateExponent) argument 45 , m_exponent(exponent) 51 CryptoKeyDataRSAComponents::CryptoKeyDataRSAComponents(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent, const Vector<uint8_t>& privateExponent, const PrimeInfo& firstPrimeInfo, const PrimeInfo& secondPrimeInfo, const Vector<PrimeInfo>& otherPrimeInfos) argument 55 , m_exponent(exponent)
|
H A D | CryptoKeyDataRSAComponents.h | 49 static std::unique_ptr<CryptoKeyDataRSAComponents> createPublic(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent) argument 51 return std::unique_ptr<CryptoKeyDataRSAComponents>(new CryptoKeyDataRSAComponents(modulus, exponent)); 54 static std::unique_ptr<CryptoKeyDataRSAComponents> createPrivate(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent, const Vector<uint8_t>& privateExponent) argument 56 return std::unique_ptr<CryptoKeyDataRSAComponents>(new CryptoKeyDataRSAComponents(modulus, exponent, privateExponent)); 59 static std::unique_ptr<CryptoKeyDataRSAComponents> createPrivateWithAdditionalData(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent, const Vector<uint8_t>& privateExponent, const PrimeInfo& firstPrimeInfo, const PrimeInfo& secondPrimeInfo, const Vector<PrimeInfo>& otherPrimeInfos) argument 61 return std::unique_ptr<CryptoKeyDataRSAComponents>(new CryptoKeyDataRSAComponents(modulus, exponent, privateExponent, firstPrimeInfo, secondPrimeInfo, otherPrimeInfos)); 70 const Vector<uint8_t>& exponent() const { return m_exponent; } function in class:WebCore::final 80 CryptoKeyDataRSAComponents(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent); 81 CryptoKeyDataRSAComponents(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent, const Vector<uint8_t>& privateExponent); 82 CryptoKeyDataRSAComponents(const Vector<uint8_t>& modulus, const Vector<uint8_t>& exponent, cons [all...] |
/macosx-10.10/IOHIDFamily-606.1.7/IOHIDSystem/ |
H A D | IOFixed64.cpp | 82 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/Security-57031.1.35/Security/libsecurity_ssl/Security/ |
H A D | sslBER.h | 41 * 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/Security-57031.1.35/Security/libsecurity_ssl/lib/ |
H A D | sslBER.h | 41 * 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/Security-57031.1.35/Security/libsecurity_ssl/security_ssl/ |
H A D | sslBER.h | 41 * 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/WebCore-7600.1.25/platform/graphics/cpu/arm/filters/ |
H A D | FELightingNEON.cpp | 175 #define POWF_SQR(value, exponent, current, remaining) \ 176 "tst " exponent ", #" ASSTRING(current) NL \ 178 "tst " exponent ", #" ASSTRING(remaining) NL \ 181 #define POWF_SQRT(value, exponent, current, remaining) \ 182 "tst " exponent ", #" ASSTRING(remaining) NL \ 184 "tst " exponent ", #" ASSTRING(current) NL \ 188 #define POWF(value, exponent) \ 189 "tst " exponent ", #0xfc0" NL \ 191 "tst " exponent ", #0x03f" NL \ 195 POWF_SQR(value, exponent, 467 getPowerCoefficients(float exponent) argument [all...] |
/macosx-10.10/gnutar-453/gnutar/lib/ |
H A D | human.c | 167 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/JavaScriptCore-7600.1.17/runtime/ |
H A D | BigInteger.h | 42 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/OpenSSL098-52/src/engines/vendor_defns/ |
H A D | atalla.h | 5 * regular mod_exp using the supplied modulus and exponent - no CRT form is 29 Item exponent[2]; member in struct:RSAPrivateKeyStr
|
/macosx-10.10/ruby-106/ruby/ext/bigdecimal/lib/bigdecimal/ |
H A D | math.rb | 68 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/WebCore-7600.1.25/platform/ |
H A D | Decimal.cpp | 244 Decimal::EncodedData::EncodedData(Sign sign, int exponent, uint64_t coefficient) 248 if (exponent >= ExponentMin && exponent <= ExponentMax) { 251 ++exponent; 255 if (exponent > ExponentMax) { 262 if (exponent < ExponentMin) { 270 m_exponent = static_cast<int16_t>(exponent); 286 Decimal::Decimal(Sign sign, int exponent, uint64_t coefficient) 287 : m_data(sign, exponent, coefficient) 372 return Decimal(Positive, alignedOperands.exponent, [all...] |
H A D | Decimal.h | 63 EncodedData(Sign, int exponent, uint64_t coefficient); 70 int exponent() const { return m_exponent; } function in class:WebCore::Decimal::EncodedData 97 Decimal(Sign, int exponent, uint64_t coefficient); 120 int exponent() const function in class:WebCore::Decimal 123 return m_data.exponent(); 146 // number ::= sign? digit+ ('.' digit*) (exponent-marker sign? digit+)? 147 // | sign? '.' digit+ (exponent-marker sign? digit+)? 149 // exponent-marker ::= 'e' | 'E' 165 int exponent; member in struct:WebCore::Decimal::AlignedOperands
|