/external/syslinux/gnu-efi/gnu-efi-3.0/lib/ia32/ |
H A D | math.c | 137 IN UINTN Divisor, 145 *Remainder = Dividend % Divisor; 146 return Dividend / Divisor; 151 ASSERT (Divisor != 0); 152 ASSERT ((Divisor >> 31) == 0); 166 cmp eax, Divisor ; Is Rem >= Divisor? 170 and eax, Divisor ; and 135 DivU64x32( IN UINT64 Dividend, IN UINTN Divisor, OUT UINTN *Remainder OPTIONAL ) argument
|
/external/syslinux/gnu-efi/gnu-efi-3.0/lib/ia64/ |
H A D | math.c | 75 IN UINTN Divisor, 81 ASSERT (Divisor != 0); 84 *Remainder = Dividend % Divisor; 87 return Dividend / Divisor; 73 DivU64x32( IN UINT64 Dividend, IN UINTN Divisor, OUT UINTN *Remainder OPTIONAL ) argument
|
/external/syslinux/gnu-efi/gnu-efi-3.0/lib/x86_64/ |
H A D | math.c | 137 IN UINTN Divisor, 145 *Remainder = Dividend % Divisor; 146 return Dividend / Divisor; 151 ASSERT (Divisor != 0); 152 ASSERT ((Divisor >> 31) == 0); 166 cmp eax, Divisor ; Is Rem >= Divisor? 170 and eax, Divisor ; and 135 DivU64x32( IN UINT64 Dividend, IN UINTN Divisor, OUT UINTN *Remainder OPTIONAL ) argument
|
/external/llvm/lib/Support/ |
H A D | ScaledNumber.cpp | 59 uint32_t Divisor) { 61 assert(Divisor && "expected non-zero divisor"); 70 uint64_t Quotient = Dividend64 / Divisor; 71 uint64_t Remainder = Dividend64 % Divisor; 78 return getRounded<uint32_t>(Quotient, Shift, Remainder >= getHalf(Divisor)); 82 uint64_t Divisor) { 84 assert(Divisor && "expected non-zero divisor"); 88 if (int Zeros = countTrailingZeros(Divisor)) { 90 Divisor >>= Zeros; 94 if (Divisor 58 divide32(uint32_t Dividend, uint32_t Divisor) argument 81 divide64(uint64_t Dividend, uint64_t Divisor) argument [all...] |
/external/llvm/lib/CodeGen/ |
H A D | TargetSchedule.cpp | 38 static unsigned gcd(unsigned Dividend, unsigned Divisor) { argument 39 // Dividend and Divisor will be naturally swapped as needed. 40 while(Divisor) { 41 unsigned Rem = Dividend % Divisor; 42 Dividend = Divisor; 43 Divisor = Rem;
|
/external/llvm/lib/Transforms/Utils/ |
H A D | BypassSlowDivision.cpp | 32 Value *Divisor; member in struct:__anon13427::DivOpInfo 35 : SignedOp(InSignedOp), Dividend(InDividend), Divisor(InDivisor) {} 53 Val1.Divisor == Val2.Divisor; 66 reinterpret_cast<uintptr_t>(Val.Divisor)) ^ 83 Value *Divisor = I->getOperand(1); local 85 if (isa<ConstantInt>(Divisor) || 86 (isa<ConstantInt>(Dividend) && isa<ConstantInt>(Divisor))) { 104 SlowQuotientV = SlowBuilder.CreateSDiv(Dividend, Divisor); 105 SlowRemainderV = SlowBuilder.CreateSRem(Dividend, Divisor); [all...] |
H A D | IntegerDivision.cpp | 34 static Value *generateSignedRemainderCode(Value *Dividend, Value *Divisor, argument 59 Value *DivisorSign = Builder.CreateAShr(Divisor, Shift); 61 Value *DvsXor = Builder.CreateXor(Divisor, DivisorSign); 80 static Value *generatedUnsignedRemainderCode(Value *Dividend, Value *Divisor, argument 82 // Remainder = Dividend - Quotient*Divisor 89 Value *Quotient = Builder.CreateUDiv(Dividend, Divisor); 90 Value *Product = Builder.CreateMul(Divisor, Quotient); 104 static Value *generateSignedDivisionCode(Value *Dividend, Value *Divisor, argument 132 Value *Tmp1 = Builder.CreateAShr(Divisor, Shift); 135 Value *Tmp3 = Builder.CreateXor(Tmp1, Divisor); 151 generateUnsignedDivisionCode(Value *Dividend, Value *Divisor, IRBuilder<> &Builder) argument [all...] |
/external/llvm/include/llvm/Support/ |
H A D | ScaledNumber.h | 138 /// \pre \c Dividend and \c Divisor are non-zero. 139 std::pair<uint64_t, int16_t> divide64(uint64_t Dividend, uint64_t Divisor); 145 /// \pre \c Dividend and \c Divisor are non-zero. 146 std::pair<uint32_t, int16_t> divide32(uint32_t Dividend, uint32_t Divisor); 154 std::pair<DigitsT, int16_t> getQuotient(DigitsT Dividend, DigitsT Divisor) { argument 162 if (!Divisor) 166 return divide64(Dividend, Divisor); 167 return divide32(Dividend, Divisor); 172 uint32_t Divisor) { 173 return getQuotient(Dividend, Divisor); 171 getQuotient32(uint32_t Dividend, uint32_t Divisor) argument 177 getQuotient64(uint64_t Dividend, uint64_t Divisor) argument 684 getQuotient(DigitsType Dividend, DigitsType Divisor) argument [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineMulDivRem.cpp | 1220 static Instruction *CvtFDivConstToReciprocal(Value *Dividend, Constant *Divisor, argument 1222 if (!isa<ConstantFP>(Divisor)) // TODO: handle vectors. 1225 const APFloat &FpVal = cast<ConstantFP>(Divisor)->getValueAPF();
|
/external/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 1584 const SCEVConstant *Divisor) { 1586 const APInt &ConstDivisor = Divisor->getAPInt(); 1583 isRemainderZero(const SCEVConstant *Dividend, const SCEVConstant *Divisor) argument
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | TargetLowering.cpp | 2817 SDValue TargetLowering::BuildSDIVPow2(SDNode *N, const APInt &Divisor, argument 2831 SDValue TargetLowering::BuildSDIV(SDNode *N, const APInt &Divisor, argument 2846 return BuildExactSDIV(*this, N->getOperand(0), Divisor, dl, DAG, *Created); 2848 APInt::ms magics = Divisor.magic(); 2865 if (Divisor.isStrictlyPositive() && magics.m.isNegative()) { 2870 if (Divisor.isNegative() && magics.m.isStrictlyPositive()) { 2895 SDValue TargetLowering::BuildUDIV(SDNode *N, const APInt &Divisor, argument 2911 APInt::mu magics = Divisor.magicu(); 2917 if (magics.a != 0 && !Divisor[0]) { 2918 unsigned Shift = Divisor [all...] |
/external/llvm/lib/Target/Mips/ |
H A D | MipsISelLowering.cpp | 948 MachineOperand &Divisor = MI.getOperand(2); local 951 .addReg(Divisor.getReg(), getKillRegState(Divisor.isKill())) 959 // Clear Divisor's kill flag. 960 Divisor.setIsKill(false);
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64ISelLowering.cpp | 7493 AArch64TargetLowering::BuildSDIVPow2(SDNode *N, const APInt &Divisor, argument 7503 !(Divisor.isPowerOf2() || (-Divisor).isPowerOf2())) 7508 unsigned Lg2 = Divisor.countTrailingZeros(); 7530 if (Divisor.isNonNegative())
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCISelLowering.cpp | 11202 PPCTargetLowering::BuildSDIVPow2(SDNode *N, const APInt &Divisor, argument 11210 !(Divisor.isPowerOf2() || (-Divisor).isPowerOf2())) 11216 bool IsNegPow2 = (-Divisor).isPowerOf2(); 11217 unsigned Lg2 = (IsNegPow2 ? -Divisor : Divisor).countTrailingZeros();
|