HomeSort by relevance Sort by last modified time
    Searched refs:quotient (Results 1 - 25 of 80) sorted by null

1 2 3 4

  /external/compiler-rt/lib/builtins/
divdf3.c 135 rep_t quotient, quotientLo; local
136 wideMultiply(aSignificand << 2, reciprocal, &quotient, &quotientLo);
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, &quotient, &quotientLo);
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 296 static void division(BigInt dividend, BigInt divisor, BigInt quotient, BigInt remainder) {
298 if (quotient != null) {
299 quotient.makeValid();
300 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/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...]
  /external/guava/guava/src/com/google/common/primitives/
UnsignedLongs.java 197 * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
202 long quotient = ((dividend >>> 1) / divisor) << 1; local
203 long rem = dividend - quotient * divisor;
204 return quotient + (compare(rem, divisor) >= 0 ? 1 : 0);
231 * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is
236 long quotient = ((dividend >>> 1) / divisor) << 1; local
237 long rem = dividend - quotient * divisor;
368 long quotient = divide(x, radix); local
369 long rem = x - quotient * radix;
371 x = quotient;
    [all...]
  /external/compiler-rt/lib/builtins/arm/
divmodsi4.S 31 @ Calculate the quotient and remainder of the (signed) division. The return
32 @ value is the quotient, the remainder is placed in the variable.
53 // Set aside the sign of the quotient and modulus, and the address for the
65 // Apply the sign of quotient and modulus
divsi3.S 34 @ Calculate and return the quotient of the (signed) division.
51 // Set aside the sign of the quotient.
60 // Apply sign of quotient to result and return.
udivmodsi4.S 26 @ Calculate the quotient and remainder of the (unsigned) division. The return
27 @ value is the quotient, the remainder is placed in the variable.
60 * block(shift) implements the test-and-update-quotient core.
62 * that (r0 << shift) < 2 * r1. The quotient is stored in r3.
udivsi3.S 28 @ Calculate and return the quotient of the (unsigned) division.
60 * block(shift) implements the test-and-update-quotient core.
62 * that (r0 << shift) < 2 * r1. The quotient is stored in r3.
  /external/pdfium/xfa/src/fxbarcode/pdf417/
BC_PDF417ECModulusPoly.cpp 245 CBC_PDF417ECModulusPoly* quotient = new CBC_PDF417ECModulusPoly( local
251 delete quotient;
258 delete quotient;
270 delete quotient;
277 delete quotient;
282 CBC_PDF417ECModulusPoly* temp = quotient;
283 quotient = temp->add(iterationQuotient, e);
295 delete quotient;
300 modulusPoly->Add(quotient);
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
Grego.java 196 long quotient = ((numerator + 1) / denominator) - 1; local
197 remainder[0] = numerator - (quotient * denominator);
198 return quotient;
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
Grego.java 194 long quotient = ((numerator + 1) / denominator) - 1; local
195 remainder[0] = numerator - (quotient * denominator);
196 return quotient;
  /external/v8/src/compiler/
machine-operator-reducer.cc 94 Node* quotient = graph()->NewNode(machine()->Int32MulHigh(), dividend, local
97 quotient = Int32Add(quotient, dividend);
99 quotient = Int32Sub(quotient, dividend);
101 return Int32Add(Word32Sar(quotient, mag.shift), Word32Shr(dividend, 31));
115 Node* quotient = graph()->NewNode(machine()->Uint32MulHigh(), dividend, local
119 quotient = Word32Shr(
120 Int32Add(Word32Shr(Int32Sub(dividend, quotient), 1), quotient),
526 Node* quotient = dividend; local
606 Node* quotient = Int32Div(dividend, divisor); local
636 Node* quotient = Uint32Div(dividend, divisor); local
    [all...]
  /art/runtime/interpreter/mterp/x86/
bindiv.S 34 # Remainder in %ah, quotient in %al
  /external/pdfium/xfa/src/fxbarcode/common/reedsolomon/
BC_ReedSolomonGF256Poly.cpp 221 CBC_AutoPtr<CBC_ReedSolomonGF256Poly> quotient(rsg1);
243 quotient->AddOrSubtract(iteratorQuotient.get(), e);
246 quotient = temp;
253 tempPtrA->Add(quotient.release());
  /external/v8/src/
fixed-dtoa.cc 315 // The quotient delivers the first digits, and the remainder fits into a 64
322 uint32_t quotient; local
325 // Then need q (quotient) and r (remainder) as follows:
336 quotient = static_cast<uint32_t>(dividend / divisor);
340 quotient = static_cast<uint32_t>(dividend / divisor);
343 FillDigits32(quotient, buffer, length);
bignum.cc 505 int quotient = this_bigit / other_bigit;
506 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient;
507 result += quotient;
  /cts/tests/tests/renderscript/src/android/renderscript/cts/
Float16Utils.java 305 short quotient = (short) (positiveValue / MIN_VALUE); local
306 return (isNegative) ? (short) (0x8000 | quotient) : quotient;
  /external/skia/src/codec/
SkBmpStandardCodec.cpp 311 int quotient; local
313 SkTDivMod(srcX, 8, &quotient, &modulus);
315 uint32_t alphaBit = (fSrcBuffer.get()[quotient] >> shift) & 0x1;
  /external/v8/test/mjsunit/
top-level-assignments.js 90 Calculator.prototype.quotient = function() { return this.x / this.y; };
96 assertEquals(2, calc.quotient());
  /external/apache-commons-math/src/main/java/org/apache/commons/math/dfp/
Dfp.java 1580 int quotient[]; \/\/ quotient local
    [all...]

Completed in 479 milliseconds

1 2 3 4