/external/openssl/crypto/rc4/asm/ |
rc4-ia64.pl | 336 #define Remainder r22 580 sub Remainder = 0, OutPtr 587 and Remainder = 0x7, Remainder 589 cmp.eq pAligned, pUnaligned = Remainder, r0 595 (pUnaligned) add Remainder = -1, Remainder 596 (pAligned) sub Remainder = EndPtr, InPtr 603 mov.i ar.lc = Remainder 614 sub Remainder = EndPtr, InPt [all...] |
/external/llvm/unittests/Transforms/Utils/ |
IntegerDivision.cpp | 84 Module M("test remainder", C); 108 Instruction* Remainder = dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0)); 109 EXPECT_TRUE(Remainder && Remainder->getOpcode() == Instruction::Sub); 114 Module M("test remainder", C); 138 Instruction* Remainder = dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0)); 139 EXPECT_TRUE(Remainder && Remainder->getOpcode() == Instruction::Sub);
|
/external/llvm/lib/Target/Mips/ |
Mips16InstrInfo.cpp | 184 int64_t Remainder = FrameSize - Base; 186 if (isInt<16>(-Remainder)) 187 BuildAddiuSpImm(MBB, I, -Remainder); 189 adjustStackPtrBig(SP, -Remainder, MBB, I, Mips::V0, Mips::V1); 226 int64_t Remainder = FrameSize - Base; 227 if (isInt<16>(Remainder)) 228 BuildAddiuSpImm(MBB, I, Remainder); 230 adjustStackPtrBig(SP, Remainder, MBB, I, Mips::A0, Mips::A1);
|
/external/llvm/lib/Target/R600/ |
AMDGPUISelLowering.cpp | 289 // Remainder = Num - Num_S_Remainder 290 SDValue Remainder = DAG.getNode(ISD::SUB, DL, VT, Num, Num_S_Remainder); 292 // Remainder_GE_Den = (Remainder >= Den ? -1 : 0) 293 SDValue Remainder_GE_Den = DAG.getSelectCC(DL, Remainder, Den, 297 // Remainder_GE_Zero = (Remainder >= 0 ? -1 : 0) 298 SDValue Remainder_GE_Zero = DAG.getSelectCC(DL, Remainder, 327 // Remainder_S_Den = Remainder - Den 328 SDValue Remainder_S_Den = DAG.getNode(ISD::SUB, DL, VT, Remainder, Den); 330 // Remainder_A_Den = Remainder + Den 331 SDValue Remainder_A_Den = DAG.getNode(ISD::ADD, DL, VT, Remainder, Den) [all...] |
/external/llvm/lib/Transforms/Utils/ |
BypassSlowDivision.cpp | 39 PHINode *Remainder; 42 : Quotient(InQuotient), Remainder(InRemainder) {} 181 // reuseOrInsertFastDiv - Reuses previously computed dividend or remainder if 183 // the optimization and cache the resulting dividend and remainder. 208 // Replace all uses of rem instruction with remainder phi node 209 J->replaceAllUsesWith(Value.Remainder);
|
IntegerDivision.cpp | 26 /// Generate code to compute the remainder of two signed integers. Returns the 27 /// remainder, which will have the sign of the dividend. Builder's insert point 62 /// Generate code to compute the remainder of two unsigned integers. Returns the 63 /// remainder. Builder's insert point should be pointing where the caller wants 69 // Remainder = Dividend - Quotient*Divisor 73 // ; %remainder = sub i32 %dividend, %product 76 Value *Remainder = Builder.CreateSub(Dividend, Product); 81 return Remainder; 326 /// Generate code to calculate the remainder of two integers, replacing Rem with 337 "Trying to expand remainder from a non-remainder function") [all...] |
/external/dropbear/libtommath/ |
bn.tex | [all...] |
/external/llvm/lib/Analysis/ |
ScalarEvolutionExpander.cpp | 206 /// S need not be evenly divisible if a reasonable remainder can be 212 const SCEV *&Remainder, 237 // If the quotient is zero and the remainder is non-zero, reject 243 Remainder = 244 SE.getAddExpr(Remainder, 274 const SCEV *Remainder = SE.getConstant(SOp->getType(), 0); 275 if (FactorOutConstant(SOp, Remainder, Factor, SE, TD) && 276 Remainder->isZero()) { 295 if (!FactorOutConstant(Start, Remainder, Factor, SE, TD)) 425 const SCEV *Remainder = SE.getConstant(Ty, 0) [all...] |
DependenceAnalysis.cpp | [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCISelDAGToDAG.cpp | [all...] |
/frameworks/av/media/libeffects/lvm/wrapper/Bundle/ |
EffectBundle.cpp | [all...] |
/external/llvm/lib/Transforms/Scalar/ |
LoopStrengthReduce.cpp | 462 /// and if the remainder is known to be zero, or null otherwise. If [all...] |