| /external/compiler-rt/lib/builtins/ |
| divdf3.c | 135 rep_t quotient, quotientLo; local
136 wideMultiply(aSignificand << 2, reciprocal, "ient, "ientLo);
138 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
149 // We also take this time to right shift quotient if it falls in the [1,2)
152 if (quotient < (implicitBit << 1)) {
153 residual = (aSignificand << 53) - quotient * bSignificand;
156 quotient >>= 1;
157 residual = (aSignificand << 52) - quotient * bSignificand;
176 rep_t absResult = quotient & significandMask
[all...] |
| divsf3.c | 121 rep_t quotient = (uint64_t)reciprocal*(aSignificand << 1) >> 32; local
123 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
134 // We also take this time to right shift quotient if it falls in the [1,2)
137 if (quotient < (implicitBit << 1)) {
138 residual = (aSignificand << 24) - quotient * bSignificand;
141 quotient >>= 1;
142 residual = (aSignificand << 23) - quotient * bSignificand;
161 rep_t absResult = quotient & significandMask;
|
| divtf3.c | 149 rep_t quotient, quotientLo; local
150 wideMultiply(aSignificand << 2, reciprocal, "ient, "ientLo);
152 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
163 // We also take this time to right shift quotient if it falls in the [1,2)
168 if (quotient < (implicitBit << 1)) {
169 wideMultiply(quotient, bSignificand, &dummy, &qb);
173 quotient >>= 1;
174 wideMultiply(quotient, bSignificand, &dummy, &qb);
192 rep_t absResult = quotient & significandMask
[all...] |
| /libcore/luni/src/main/java/java/math/ |
| Division.java | 49 static int divideArrayByInt(int[] quotient, int[] dividend, final int dividendLength,
64 * get the quotient an remainder and correct them properly
87 quotient[i] = (int) (quot & 0xffffffffL);
|
| BigInt.java | 300 static void division(BigInt dividend, BigInt divisor, BigInt quotient, BigInt remainder) {
302 if (quotient != null) {
303 quotient.makeValid();
304 quot = quotient.bignum;
|
| BigInteger.java | 922 BigInt quotient = new BigInt(); local
924 BigInt.division(getBigInt(), divisorBigInt, quotient, remainder); local
925 return new BigInteger[] {new BigInteger(quotient), new BigInteger(remainder) };
937 BigInt quotient = new BigInt(); local
938 BigInt.division(getBigInt(), divisor.getBigInt(), quotient, null); local
[all...] |
| BigDecimal.java | 1078 BigInteger quotient = quotAndRem[0]; local
1111 long quotient = scaledDividend \/ scaledDivisor; local
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| gregoimp.cpp | 34 double quotient; local
35 quotient = uprv_floor(numerator / denominator);
36 remainder = (int32_t) (numerator - (quotient * denominator));
37 return (int32_t) quotient;
44 double quotient = floorDivide(dividend, divisor); local
45 remainder = dividend - (quotient * divisor);
47 // is a bug such that the quotient is off by one. If you doubt
53 double q = quotient;
54 quotient += (remainder < 0) ? -1 : +1;
55 if (q == quotient) {
[all...] |
| /external/icu/icu4c/source/i18n/ |
| gregoimp.cpp | 34 double quotient; local
35 quotient = uprv_floor(numerator / denominator);
36 remainder = (int32_t) (numerator - (quotient * denominator));
37 return (int32_t) quotient;
44 double quotient = floorDivide(dividend, divisor); local
45 remainder = dividend - (quotient * divisor);
47 // is a bug such that the quotient is off by one. If you doubt
53 double q = quotient;
54 quotient += (remainder < 0) ? -1 : +1;
55 if (q == quotient) {
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Grego.java | 194 long quotient = ((numerator + 1) / denominator) - 1;
local
195 remainder[0] = numerator - (quotient * denominator);
196 return quotient;
|
| /external/guava/guava/src/com/google/common/primitives/ |
| UnsignedLongs.java | 193 * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
198 long quotient = ((dividend >>> 1) / divisor) << 1; local
199 long rem = dividend - quotient * divisor;
200 return quotient + (compare(rem, divisor) >= 0 ? 1 : 0);
227 * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
232 long quotient = ((dividend >>> 1) / divisor) << 1; local
233 long rem = dividend - quotient * divisor;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
| fixed-dtoa.cc | 336 // The quotient delivers the first digits, and the remainder fits into a 64
343 uint32_t quotient; local
346 // Then need q (quotient) and r (remainder) as follows:
357 quotient = static_cast<uint32_t>(dividend / divisor);
361 quotient = static_cast<uint32_t>(dividend / divisor);
364 FillDigits32(quotient, buffer, length);
|
| bignum.cc | 528 int quotient = this_bigit / other_bigit;
529 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient;
530 result += quotient;
|
| /external/chromium_org/v8/src/ |
| fixed-dtoa.cc | 314 // The quotient delivers the first digits, and the remainder fits into a 64
321 uint32_t quotient; local
324 // Then need q (quotient) and r (remainder) as follows:
335 quotient = static_cast<uint32_t>(dividend / divisor);
339 quotient = static_cast<uint32_t>(dividend / divisor);
342 FillDigits32(quotient, buffer, length);
|
| bignum.cc | 504 int quotient = this_bigit / other_bigit;
505 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient;
506 result += quotient;
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| Decimal.cpp | 166 uint32_t quotient[4]; local
171 quotient[i] = static_cast<uint32_t>(work / divisor);
173 m_low = makeUInt64(quotient[0], quotient[1]);
174 m_high = makeUInt64(quotient[2], quotient[3]);
897 const Decimal quotient = *this / rhs;
898 return quotient.isSpecial() ? quotient : *this - (quotient.isNegative() ? quotient.ceiling() : quotient.floor()) * rhs
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/cpu/arm/filters/ |
| FEBlendNEON.h | 42 uint16x8_t quotient = vshrq_n_u16(num, 8); local
43 uint16x8_t remainder = vaddq_u16(vsubq_u16(num, vmulq_u16(sixteenConst255, quotient)), sixteenConstOne);
44 return vaddq_u16(quotient, vshrq_n_u16(remainder, 8));
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/filters/ |
| FEBlend.cpp | 68 uint16_t quotient = value >> 8; local
69 uint16_t remainder = value - (quotient * 255) + 1;
70 return quotient + (remainder >> 8);
|
| /external/chromium_org/v8/test/mjsunit/ |
| top-level-assignments.js | 90 Calculator.prototype.quotient = function() { return this.x / this.y; };
96 assertEquals(2, calc.quotient());
|
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
| aggregate_results.js | 263 var quotient = Math.floor(scaledVal / mapLength);
264 var remainder = scaledVal - mapLength * quotient;
265 chartData += map.charAt(quotient) + map.charAt(remainder);
|
| /external/valgrind/main/exp-bbv/tests/arm-linux/ |
| ll.S | 407 @ r7=quotient r8=remainder
411 mov r7,#0 @ zero out quotient
414 add r7,r7,#1 @ increment quotient
|
| /external/freetype/src/smooth/ |
| ftgrays.c | 316 /* Compute `dividend / divisor' and return both its quotient and */
319 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
321 (quotient) = (type)( (dividend) / (divisor) ); \
325 (quotient)--; \
337 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
339 (quotient) = (type)( (dividend) / (divisor) ); \
340 (remainder) = (type)( (dividend) - (quotient) * (divisor) ); \
343 (quotient)--; \
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DateMath.cpp | 353 int quotient = difference / 28; local
354 int product = (quotient) * 28;
|
| /cts/tests/tests/renderscript/libcoremathtestcpp/ |
| CoreMathTestJni.cpp | 360 int quotient = 0; local
361 result.SetFloat("remainder", remquof(numerator, denominator, "ient));
362 result.SetInt("quotient", quotient);
|
| /external/chromium_org/v8/src/arm/ |
| lithium-codegen-arm.cc | 1241 LowDwVfpRegister quotient = double_scratch0(); local
1271 __ vmul(double_scratch0(), divisor, quotient); local
[all...] |
