HomeSort by relevance Sort by last modified time
    Searched full:dividend (Results 26 - 50 of 231) sorted by null

12 3 4 5 6 7 8 910

  /prebuilts/ndk/current/platforms/android-17/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-17/arch-mips/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-17/arch-x86/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-18/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-18/arch-mips/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-18/arch-x86/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-19/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-19/arch-mips/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-19/arch-x86/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-3/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-4/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-5/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-8/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-9/arch-arm/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-9/arch-mips/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /prebuilts/ndk/current/platforms/android-9/arch-x86/usr/include/linux/
calc64.h 19 #define div_long_long_rem(dividend, divisor, remainder) do_div_llr((dividend), divisor, remainder)
  /external/llvm/test/CodeGen/X86/
div8.ll 6 define signext i8 @test_div(i8 %dividend, i8 %divisor) nounwind ssp {
8 %dividend.addr = alloca i8, align 2
11 store i8 %dividend, i8* %dividend.addr, align 2
13 %tmp = load i8, i8* %dividend.addr, align 2
  /external/llvm/lib/Support/
ScaledNumber.cpp 57 std::pair<uint32_t, int16_t> ScaledNumbers::divide32(uint32_t Dividend,
59 assert(Dividend && "expected non-zero dividend");
62 // Use 64-bit math and canonicalize the dividend to gain precision.
63 uint64_t Dividend64 = Dividend;
80 std::pair<uint64_t, int16_t> ScaledNumbers::divide64(uint64_t Dividend,
82 assert(Dividend && "expected non-zero dividend");
94 return std::make_pair(Dividend, Shift);
96 // Maximize size of dividend
    [all...]
  /external/llvm/lib/Transforms/Utils/
BypassSlowDivision.cpp 31 Value *Dividend;
35 : SignedOp(InSignedOp), Dividend(InDividend), Divisor(InDivisor) {}
52 Val1.Dividend == Val2.Dividend &&
65 return (unsigned)(reinterpret_cast<uintptr_t>(Val.Dividend) ^
86 Value *Dividend = Instr->getOperand(0);
90 (isa<ConstantInt>(Dividend) && isa<ConstantInt>(Divisor))) {
109 SlowQuotientV = SlowBuilder.CreateSDiv(Dividend, Divisor);
110 SlowRemainderV = SlowBuilder.CreateSRem(Dividend, Divisor);
112 SlowQuotientV = SlowBuilder.CreateUDiv(Dividend, Divisor)
    [all...]
IntegerDivision.cpp 29 /// remainder, which will have the sign of the dividend. Builder's insert point
34 static Value *generateSignedRemainderCode(Value *Dividend, Value *Divisor,
36 unsigned BitWidth = Dividend->getType()->getIntegerBitWidth();
49 // ; %dividend_sgn = ashr i32 %dividend, 31
51 // ; %dvd_xor = xor i32 %dividend, %dividend_sgn
55 // ; %urem = urem i32 %dividend, %divisor
58 Value *DividendSign = Builder.CreateAShr(Dividend, Shift);
60 Value *DvdXor = Builder.CreateXor(Dividend, DividendSign);
80 static Value *generatedUnsignedRemainderCode(Value *Dividend, Value *Divisor,
82 // Remainder = Dividend - Quotient*Diviso
    [all...]
  /external/v8/test/mjsunit/compiler/
division-by-constant.js 33 return "return ((dividend | 0) / ((" + divisor + ") | 0)) | 0";
37 new Function("dividend", "divisor", ConstructDiv("divisor"));
44 return "return ((dividend | 0) % ((" + divisor + ") | 0)) | 0";
48 new Function("dividend", "divisor", ConstructMod("divisor"));
55 return "return Math.floor(dividend / (" + divisor + ")) | 0";
59 new Function("dividend", "divisor", ConstructFlooringDiv("divisor"));
107 var OptFun = new Function("dividend", construct(divisor));
115 function dude(dividend) {
117 if (dividend === -2147483648 && divisor === -1) return;
118 assertEquals(ref(dividend, divisor), OptFun(dividend))
    [all...]
  /external/guava/guava/src/com/google/common/primitives/
UnsignedLongs.java 175 * Returns dividend / divisor, where the dividend and divisor are treated as unsigned 64-bit
178 * @param dividend the dividend (numerator)
182 public static long divide(long dividend, long divisor) {
184 if (compare(dividend, divisor) < 0) {
185 return 0; // dividend < divisor
187 return 1; // dividend >= divisor
191 // Optimization - use signed division if dividend < 2^63
192 if (dividend >= 0)
    [all...]
UnsignedInts.java 173 * Returns dividend / divisor, where the dividend and divisor are treated as unsigned 32-bit
176 * @param dividend the dividend (numerator)
180 public static int divide(int dividend, int divisor) {
181 return (int) (toLong(dividend) / toLong(divisor));
185 * Returns dividend % divisor, where the dividend and divisor are treated as unsigned 32-bit
188 * @param dividend the dividend (numerator
    [all...]
  /external/guava/guava-tests/benchmark/com/google/common/primitives/
UnsignedLongsBenchmark.java 122 // to the given dividend, so that we don't have half of our divisions being
123 // trivial because the divisor is bigger than the dividend.
126 private static long randomDivisor(long dividend) {
128 if (dividend == -1) {
131 return UnsignedLongs.remainder(r, dividend + 1);
  /cts/tools/vm-tests-tf/src/dot/junit/opcodes/div_double/
Test_div_double.java 35 * @title Dividend = 0
43 * @title Dividend is negative
52 * @title Dividend is negative

Completed in 486 milliseconds

12 3 4 5 6 7 8 910