Searched refs:kBigitSize (Results 1 - 6 of 6) sorted by relevance

/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
H A Dbignum.cc52 ASSERT(kBigitSize >= BitSize(value));
68 int needed_bigits = kUInt64Size / kBigitSize + 1;
72 value = value >> kBigitSize;
139 int needed_bigits = length * 4 / kBigitSize + 1;
145 for (int j = 0; j < kBigitSize / 4; j++) {
200 carry = sum >> kBigitSize;
207 carry = sum >> kBigitSize;
244 exponent_ += shift_amount / kBigitSize;
245 int local_shift = shift_amount % kBigitSize;
259 // The product of a bigit with the factor is of size kBigitSize
272 carry >>= kBigitSize; local
[all...]
H A Dbignum.h106 static const int kBigitSize = 28; member in class:WTF::double_conversion::Bignum
107 static const Chunk kBigitMask = (1 << kBigitSize) - 1;
110 static const int kBigitCapacity = kMaxSignificantBits / kBigitSize;
123 // shift_amount must be < kBigitSize.
135 // The Bignum's value equals value(bigits_) * 2^(exponent_ * kBigitSize).
/external/chromium_org/v8/src/
H A Dbignum.cc51 ASSERT(kBigitSize >= BitSize(value));
67 int needed_bigits = kUInt64Size / kBigitSize + 1;
71 value = value >> kBigitSize;
138 int needed_bigits = length * 4 / kBigitSize + 1;
144 for (int j = 0; j < kBigitSize / 4; j++) {
199 carry = sum >> kBigitSize;
206 carry = sum >> kBigitSize;
243 exponent_ += shift_amount / kBigitSize;
244 int local_shift = shift_amount % kBigitSize;
258 // The product of a bigit with the factor is of size kBigitSize
271 carry >>= kBigitSize; local
[all...]
H A Dbignum.h104 static const int kBigitSize = 28; member in class:v8::internal::Bignum
105 static const Chunk kBigitMask = (1 << kBigitSize) - 1;
108 static const int kBigitCapacity = kMaxSignificantBits / kBigitSize;
121 // by must be < kBigitSize.
133 // The Bignum's value equals value(bigits_) * 2^(exponent_ * kBigitSize).
/external/v8/src/
H A Dbignum.cc50 ASSERT(kBigitSize >= BitSize(value));
66 int needed_bigits = kUInt64Size / kBigitSize + 1;
70 value = value >> kBigitSize;
137 int needed_bigits = length * 4 / kBigitSize + 1;
143 for (int j = 0; j < kBigitSize / 4; j++) {
198 carry = sum >> kBigitSize;
205 carry = sum >> kBigitSize;
242 exponent_ += shift_amount / kBigitSize;
243 int local_shift = shift_amount % kBigitSize;
257 // The product of a bigit with the factor is of size kBigitSize
270 carry >>= kBigitSize; local
[all...]
H A Dbignum.h104 static const int kBigitSize = 28; member in class:v8::internal::Bignum
105 static const Chunk kBigitMask = (1 << kBigitSize) - 1;
108 static const int kBigitCapacity = kMaxSignificantBits / kBigitSize;
121 // by must be < kBigitSize.
133 // The Bignum's value equals value(bigits_) * 2^(exponent_ * kBigitSize).

Completed in 70 milliseconds