/external/compiler-rt/lib/ |
D | divdf3.c | 134 rep_t quotient, quotientLo; in ARM_EABI_FNALIAS() local 135 wideMultiply(aSignificand << 2, reciprocal, "ient, "ientLo); in ARM_EABI_FNALIAS() 151 if (quotient < (implicitBit << 1)) { in ARM_EABI_FNALIAS() 152 residual = (aSignificand << 53) - quotient * bSignificand; in ARM_EABI_FNALIAS() 155 quotient >>= 1; in ARM_EABI_FNALIAS() 156 residual = (aSignificand << 52) - quotient * bSignificand; in ARM_EABI_FNALIAS() 175 rep_t absResult = quotient & significandMask; in ARM_EABI_FNALIAS()
|
D | divsf3.c | 120 rep_t quotient = (uint64_t)reciprocal*(aSignificand << 1) >> 32; in ARM_EABI_FNALIAS() local 136 if (quotient < (implicitBit << 1)) { in ARM_EABI_FNALIAS() 137 residual = (aSignificand << 24) - quotient * bSignificand; in ARM_EABI_FNALIAS() 140 quotient >>= 1; in ARM_EABI_FNALIAS() 141 residual = (aSignificand << 23) - quotient * bSignificand; in ARM_EABI_FNALIAS() 160 rep_t absResult = quotient & significandMask; in ARM_EABI_FNALIAS()
|
/external/icu4c/i18n/ |
D | gregoimp.cpp | 34 double quotient; in floorDivide() local 35 quotient = uprv_floor(numerator / denominator); in floorDivide() 36 remainder = (int32_t) (numerator - (quotient * denominator)); in floorDivide() 37 return (int32_t) quotient; in floorDivide() 44 double quotient = floorDivide(dividend, divisor); in floorDivide() local 45 remainder = dividend - (quotient * divisor); in floorDivide() 53 double q = quotient; in floorDivide() 54 quotient += (remainder < 0) ? -1 : +1; in floorDivide() 55 if (q == quotient) { in floorDivide() 67 remainder = dividend - (quotient * divisor); in floorDivide() [all …]
|
/external/llvm/test/CodeGen/X86/ |
D | div8.ll | 10 %quotient = alloca i8, align 1 19 store i8 %div, i8* %quotient, align 1 20 %tmp4 = load i8* %quotient, align 1
|
D | inline-asm-R-constraint.ll | 7 define void @udiv8(i8* %quotient, i16 zeroext %a, i8 zeroext %b, i8 zeroext %c, i8* %remainder) nou… 15 …vb %ah, ($4)", "=*m,=*m,*m,*m,R,~{dirflag},~{fpsr},~{flags},~{ax}"(i8* %quotient, i8* %remainder, …
|
/external/guava/guava/src/com/google/common/primitives/ |
D | UnsignedLongs.java | 198 long quotient = ((dividend >>> 1) / divisor) << 1; in divide() local 199 long rem = dividend - quotient * divisor; in divide() 200 return quotient + (compare(rem, divisor) >= 0 ? 1 : 0); in divide() 232 long quotient = ((dividend >>> 1) / divisor) << 1; in remainder() local 233 long rem = dividend - quotient * divisor; in remainder()
|
/external/v8/test/mjsunit/ |
D | top-level-assignments.js | 90 Calculator.prototype.quotient = function() { return this.x / this.y; }; method in Calculator 96 assertEquals(2, calc.quotient());
|
/external/v8/src/ |
D | fixed-dtoa.cc | 344 uint32_t quotient; in FastFixedDtoa() local 358 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa() 362 quotient = static_cast<uint32_t>(dividend / divisor); in FastFixedDtoa() 365 FillDigits32(quotient, buffer, length); in FastFixedDtoa()
|
D | bignum.cc | 526 int quotient = this_bigit / other_bigit; in DivideModuloIntBignum() local 527 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient; in DivideModuloIntBignum() 528 result += quotient; in DivideModuloIntBignum()
|
/external/quake/quake/src/WinQuake/ |
D | mathlib.h | 64 void FloorDivMod (double numer, double denom, int *quotient,
|
D | mathlib.cpp | 500 void FloorDivMod (double numer, double denom, int *quotient, in FloorDivMod() argument 537 *quotient = q; in FloorDivMod()
|
D | d_polyse.cpp | 97 int quotient; member 508 ubasestep = ptemp->quotient; in D_PolysetSetUpForLineScan()
|
/external/quake/quake/src/QW/client/ |
D | mathlib.h | 64 void FloorDivMod (double numer, double denom, int *quotient,
|
D | mathlib.c | 498 void FloorDivMod (double numer, double denom, int *quotient, in FloorDivMod() argument 535 *quotient = q; in FloorDivMod()
|
D | d_polyse.c | 97 int quotient; member 508 ubasestep = ptemp->quotient; in D_PolysetSetUpForLineScan()
|
/external/valgrind/main/exp-bbv/tests/arm-linux/ |
D | ll.S | 407 @ r7=quotient r8=remainder 411 mov r7,#0 @ zero out quotient 414 add r7,r7,#1 @ increment quotient
|
/external/webkit/Source/JavaScriptCore/wtf/ |
D | DateMath.cpp | 380 int quotient = difference / 28; in equivalentYearForDST() local 381 int product = (quotient) * 28; in equivalentYearForDST()
|
/external/v8/src/arm/ |
D | lithium-codegen-arm.cc | 935 DwVfpRegister quotient = double_scratch0(); in DoModI() local 938 ASSERT(!dividend.is(quotient)); in DoModI() 939 ASSERT(!divisor.is(quotient)); in DoModI() 1009 __ vdiv(quotient, dividend, divisor); in DoModI() 1010 __ vcvt_s32_f64(quotient.low(), quotient); in DoModI() 1011 __ vcvt_f64_s32(quotient, quotient.low()); in DoModI() 1015 __ vmul(double_scratch, divisor, quotient); in DoModI()
|
/external/llvm/bindings/ocaml/llvm/ |
D | llvm.mli | 877 (** [const_udiv c1 c2] returns the constant quotient [c1 / c2] of two unsigned 882 (** [const_sdiv c1 c2] returns the constant quotient [c1 / c2] of two signed 887 (** [const_exact_sdiv c1 c2] returns the constant quotient [c1 / c2] of two 892 (** [const_fdiv c1 c2] returns the constant quotient [c1 / c2] of two floating
|
/external/dropbear/libtommath/ |
D | bn.tex | 1059 Which will divide $a$ by $2^b$, store the quotient in ``c'' and the remainder in ``d'. If $b \le 0… 1145 This divides $a$ by $b$ and stores the quotient in $c$ and $d$. The signed quotient is computed su…
|
/external/dropbear/libtomcrypt/ |
D | crypt.tex | 6178 @param c The quotient (can be NULL to signify don't care)
|
/external/srec/config/en.us/dictionary/ |
D | large.ok | 23397 quotient kwOS~t
|
/external/webkit/Source/WebCore/ |
D | ChangeLog-2010-12-06 | 122021 … (WebCore::WidthIterator::WidthIterator): Initialize m_padPerSpace to the quotient of the total
|