/prebuilts/go/darwin-x86/src/math/ |
remainder_amd64.s | 7 TEXT ·Remainder(SB),NOSPLIT,$0 8 JMP ·remainder(SB)
|
remainder_arm.s | 7 TEXT ·Remainder(SB),NOSPLIT,$0 8 B ·remainder(SB)
|
remainder_386.s | 7 // func Remainder(x, y float64) float64 8 TEXT ·Remainder(SB),NOSPLIT,$0
|
stubs_arm64.s | 75 TEXT ·Remainder(SB),NOSPLIT,$0 76 B ·remainder(SB)
|
stubs_ppc64x.s | 75 TEXT ·Remainder(SB),NOSPLIT,$0 76 BR ·remainder(SB)
|
/prebuilts/go/linux-x86/src/math/ |
remainder_amd64.s | 7 TEXT ·Remainder(SB),NOSPLIT,$0 8 JMP ·remainder(SB)
|
remainder_arm.s | 7 TEXT ·Remainder(SB),NOSPLIT,$0 8 B ·remainder(SB)
|
remainder_386.s | 7 // func Remainder(x, y float64) float64 8 TEXT ·Remainder(SB),NOSPLIT,$0
|
stubs_arm64.s | 75 TEXT ·Remainder(SB),NOSPLIT,$0 76 B ·remainder(SB)
|
stubs_ppc64x.s | 75 TEXT ·Remainder(SB),NOSPLIT,$0 76 BR ·remainder(SB)
|
/external/llvm/unittests/Transforms/Utils/ |
IntegerDivision.cpp | 85 Module M("test remainder", C); 109 Instruction* Remainder = dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0)); 110 EXPECT_TRUE(Remainder && Remainder->getOpcode() == Instruction::Sub); 115 Module M("test remainder", C); 139 Instruction* Remainder = dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0)); 140 EXPECT_TRUE(Remainder && Remainder->getOpcode() == Instruction::Sub); 206 Module M("test remainder", C); 230 Instruction* Remainder = dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0)) [all...] |
/external/llvm/lib/Support/ |
APInt.cpp | [all...] |
ScaledNumber.cpp | 70 uint64_t Remainder = Dividend64 % Divisor; 77 return getRounded<uint32_t>(Quotient, Shift, Remainder >= getHalf(Divisor));
|
/external/mesa3d/src/gallium/drivers/radeon/ |
AMDGPUISelLowering.cpp | 229 // Remainder = Num - Num_S_Remainder 230 SDValue Remainder = DAG.getNode(ISD::SUB, DL, VT, Num, Num_S_Remainder); 232 // Remainder_GE_Den = (Remainder >= Den ? -1 : 0) 233 SDValue Remainder_GE_Den = DAG.getSelectCC(DL, Remainder, Den, 237 // Remainder_GE_Zero = (Remainder >= 0 ? -1 : 0) 238 SDValue Remainder_GE_Zero = DAG.getSelectCC(DL, Remainder, 267 // Remainder_S_Den = Remainder - Den 268 SDValue Remainder_S_Den = DAG.getNode(ISD::SUB, DL, VT, Remainder, Den); 270 // Remainder_A_Den = Remainder + Den 271 SDValue Remainder_A_Den = DAG.getNode(ISD::ADD, DL, VT, Remainder, Den) [all...] |
/art/runtime/interpreter/mterp/x86/ |
bindiv.S | 34 # Remainder in %ah, quotient in %al
|
/external/llvm/lib/Target/Mips/ |
Mips16InstrInfo.cpp | 216 int64_t Remainder = FrameSize - Base; 218 if (isInt<16>(-Remainder)) 219 BuildAddiuSpImm(MBB, I, -Remainder); 221 adjustStackPtrBig(SP, -Remainder, MBB, I, Mips::V0, Mips::V1); 240 int64_t Remainder = FrameSize - Base; 244 if (isInt<16>(Remainder)) 245 BuildAddiuSpImm(MBB, I, Remainder); 247 adjustStackPtrBig(SP, Remainder, MBB, I, Mips::A0, Mips::A1);
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/rsa/rsa/ |
common.py | 149 '''Chinese Remainder Theorem.
|
/external/llvm/lib/Transforms/Utils/ |
BypassSlowDivision.cpp | 40 PHINode *Remainder; 43 : Quotient(InQuotient), Remainder(InRemainder) {} 182 // reuseOrInsertFastDiv - Reuses previously computed dividend or remainder if 184 // the optimization and cache the resulting dividend and remainder. 209 // Replace all uses of rem instruction with remainder phi node 210 J->replaceAllUsesWith(Value.Remainder);
|
IntegerDivision.cpp | 28 /// Generate code to compute the remainder of two signed integers. Returns the 29 /// remainder, which will have the sign of the dividend. Builder's insert point 75 /// Generate code to compute the remainder of two unsigned integers. Returns the 76 /// remainder. Builder's insert point should be pointing where the caller wants 82 // Remainder = Dividend - Quotient*Divisor 88 // ; %remainder = sub i32 %dividend, %product 91 Value *Remainder = Builder.CreateSub(Dividend, Product); 96 return Remainder; 369 /// Generate code to calculate the remainder of two integers, replacing Rem with 379 "Trying to expand remainder from a non-remainder function") [all...] |
/external/llvm/lib/Analysis/ |
DependenceAnalysis.cpp | [all...] |
ScalarEvolutionExpander.cpp | 223 /// S need not be evenly divisible if a reasonable remainder can be 228 static bool FactorOutConstant(const SCEV *&S, const SCEV *&Remainder, 250 // If the quotient is zero and the remainder is non-zero, reject 256 Remainder = SE.getAddExpr( 257 Remainder, SE.getConstant(C->getAPInt().srem(FC->getAPInt()))); 287 if (!FactorOutConstant(Start, Remainder, Factor, SE, DL)) 418 const SCEV *Remainder = SE.getConstant(Ty, 0); 419 if (FactorOutConstant(Op, Remainder, ElSize, SE, DL)) { 422 if (!Remainder->isZero()) 423 NewOps.push_back(Remainder); [all...] |
/external/llvm/lib/Transforms/Scalar/ |
LoopStrengthReduce.cpp | 533 /// remainder is known to be zero, or null otherwise. If IgnoreSignificantBits [all...] |
/external/llvm/include/llvm/ADT/ |
BitVector.h | 143 if (unsigned Remainder = Size % BITWORD_SIZE) 144 return Bits[Size / BITWORD_SIZE] == (1UL << Remainder) - 1;
|
APInt.h | 181 unsigned rhsWords, APInt *Quotient, APInt *Remainder); 414 /// width without remainder. 919 /// \brief Unsigned remainder operation. 921 /// Perform an unsigned remainder operation on this APInt with RHS being the 923 /// of this operation. Note that this is a true remainder operation and not a 927 /// \returns a new APInt value containing the remainder result 930 /// \brief Function for signed remainder operation. 932 /// Signed remainder operation on APInt. 935 /// \brief Dual division/remainder interface. 938 /// quotient and remainder. This function does both operations in the sam [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineMulDivRem.cpp | 105 APInt Remainder(C1.getBitWidth(), /*Val=*/0ULL, IsSigned); 107 APInt::sdivrem(C1, C2, Quotient, Remainder); 109 APInt::udivrem(C1, C2, Quotient, Remainder); 111 return Remainder.isMinValue(); 715 /// Try to fold a divide or remainder of a select instruction. [all...] |