/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/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/CodeGen/ |
TargetSchedule.cpp | 39 static unsigned gcd(unsigned Dividend, unsigned Divisor) { 40 // Dividend and Divisor will be naturally swapped as needed. 42 unsigned Rem = Dividend % Divisor; 43 Dividend = Divisor; 46 return Dividend;
|
/external/llvm/include/llvm/Support/ |
ScaledNumber.h | 139 /// \pre \c Dividend and \c Divisor are non-zero. 140 std::pair<uint64_t, int16_t> divide64(uint64_t Dividend, uint64_t Divisor); 146 /// \pre \c Dividend and \c Divisor are non-zero. 147 std::pair<uint32_t, int16_t> divide32(uint32_t Dividend, uint32_t Divisor); 155 std::pair<DigitsT, int16_t> getQuotient(DigitsT Dividend, DigitsT Divisor) { 161 if (!Dividend) 167 return divide64(Dividend, Divisor); 168 return divide32(Dividend, Divisor); 172 inline std::pair<uint32_t, int16_t> getQuotient32(uint32_t Dividend, 174 return getQuotient(Dividend, Divisor) [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineMulDivRem.cpp | [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
ntddk.h | [all...] |
wdm.h | [all...] |
/external/llvm/lib/Analysis/ |
DependenceAnalysis.cpp | [all...] |
ScalarEvolution.cpp | 776 const SCEV *Dividend = SE.getTruncateOrZeroExtend(It, CalculationTy); 779 Dividend = SE.getMulExpr(Dividend, 784 const SCEV *DivResult = SE.getUDivExpr(Dividend, SE.getConstant(DivFactor)); [all...] |