| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| APSInt.h | 121 *this = srem(RHS);
134 return IsUnsigned ? APSInt(urem(RHS), true) : APSInt(srem(RHS), false);
|
| APInt.h | 1093 APInt srem(const APInt &RHS) const;
1094 int64_t srem(int64_t RHS) const;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| ConstantRange.h | 422 ConstantRange srem(const ConstantRange &Other) const;
|
| /src/external/apache2/llvm/dist/llvm/utils/vim/syntax/ |
| llvm.vim | 34 syn keyword llvmStatement sext sge sgt shl shufflevector sitofp sle slt srem
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| KnownBits.h | 316 /// Compute known bits for srem(LHS, RHS).
317 static KnownBits srem(const KnownBits &LHS, const KnownBits &RHS);
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 1387 Remainder = Distance.srem(Two);
1429 R = Delta.srem(G);
1639 return ConstDividend.srem(ConstDivisor) == 0;
2396 APInt Remainder = ConstDelta.srem(RunningGCD);
2471 Remainder = ConstDelta.srem(RunningGCD);
3123 assert(Charlie.srem(Beta) == 0 && "C should be evenly divisible by B");
3138 assert(Charlie.srem(Alpha) == 0 && "C should be evenly divisible by A");
3152 assert(Charlie.srem(Alpha) == 0 && "C should be evenly divisible by A");
|
| BasicAliasAnalysis.cpp | 1177 APInt ModOffset = DecompGEP1.Offset.srem(GCD);
|
| InstructionSimplify.cpp | 925 /// This applies to all 4 opcodes (sdiv/udiv/srem/urem).
1102 /// These are simplifications common to SRem and URem.
1112 if ((Opcode == Instruction::SRem &&
1120 ((Opcode == Instruction::SRem &&
1139 if (isDivZero(Op0, Op1, Q, MaxRecurse, Opcode == Instruction::SRem))
1171 /// Given operands for an SRem, see if we can fold the result.
1176 // srem Op0, (sext i1 X) --> srem Op0, -1 --> 0
1185 return simplifyRem(Instruction::SRem, Op0, Op1, Q, MaxRecurse);
2789 *MulC != 0 && C->srem(*MulC) != 0))
[all...] |
| ValueTracking.cpp | 1252 case Instruction::SRem:
1255 Known = KnownBits::srem(Known, Known2);
2914 case Instruction::SRem: {
2918 // srem X, C -> we know that the result is within [-C+1,C) when C is a
4566 case Instruction::SRem: {
4973 case Instruction::SRem:
5350 case Instruction::SRem:
6757 case Instruction::SRem:
6759 // 'srem x, C' produces (-|C|, |C|).
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| KnownBits.cpp | 552 KnownBits KnownBits::srem(const KnownBits &LHS, const KnownBits &RHS) { function in class:KnownBits
558 // The low bits of the first operand are unchanged by the srem.
|
| APInt.cpp | 1763 APInt APInt::srem(const APInt &RHS) const {
1774 int64_t APInt::srem(int64_t RHS) const {
2951 C = C.srem(R);
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| ConstantRange.cpp | 814 case Instruction::SRem:
815 return srem(Other);
1233 ConstantRange ConstantRange::srem(const ConstantRange &RHS) const {
|
| ConstantFold.cpp | 1186 case Instruction::SRem:
1275 case Instruction::SRem:
1398 case Instruction::SRem:
1402 return ConstantInt::get(CI1->getContext(), C1V.srem(C2V));
1428 case Instruction::SRem:
1533 case Instruction::SRem:
|
| /src/external/apache2/llvm/dist/llvm/lib/AsmParser/ |
| LLLexer.cpp | 869 INSTKEYWORD(urem, URem); INSTKEYWORD(srem, SRem); INSTKEYWORD(frem, FRem);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| Utils.cpp | 486 return C1.srem(C2);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCLoopInstrFormPrep.cpp | 853 if (ConstInt.isSignedIntN(16) && ConstInt.srem(4) != 0)
|
| /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Interpreter/ |
| Execution.cpp | 754 // Additional macros to execute binary operations udiv/sdiv/urem/srem since
794 case Instruction::SRem: INTEGER_VECTOR_FUNCTION(srem) break;
836 case Instruction::SRem: R.IntVal = Src1.IntVal.srem(Src2.IntVal); break;
2080 case Instruction::SRem: Dest.IntVal = Op0.IntVal.srem(Op1.IntVal); break;
|
| /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/ |
| ExecutionEngine.cpp | 781 case Instruction::SRem:
799 case Instruction::SRem:GV.IntVal = LHS.IntVal.srem(RHS.IntVal); break;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| ScalarEvolutionExpander.cpp | 315 Remainder, SE.getConstant(C->getAPInt().srem(FC->getAPInt())));
328 if (!C->getAPInt().srem(FC->getAPInt())) {
|
| /src/sys/arch/m68k/060sp/dist/ |
| fplsp.s | 9351 # srem(): computes the fp (IEEE) REM of the input values X,Y. #
9434 global srem
9435 srem: label
10747 beq.l srem
10753 beq.l srem
|
| fpsp.s | 9710 # srem(): computes the fp (IEEE) REM of the input values X,Y. #
9793 global srem
9794 srem: label
10836 beq.l srem
10842 beq.l srem
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| AttributorAttributes.cpp | 7673 case Instruction::SRem:
7678 return LHS.srem(RHS);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineCompares.cpp | 1303 /// icmp eq/ne (urem/srem %x, %y), 0
1970 if (Mul->hasNoSignedWrap() && C.srem(*MulC).isNullValue()) {
2306 BinaryOperator *SRem,
2317 // because srem is not good for analysis or codegen.
2318 if (!SRem->hasOneUse())
2322 if (!C.isNullValue() || !match(SRem->getOperand(1), m_Power2(DivisorC)))
2326 Type *Ty = SRem->getType();
2329 Value *And = Builder.CreateAnd(SRem->getOperand(0), MaskC);
2932 case Instruction::SRem:
2998 case Instruction::SRem
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 697 if (LA.srem(RA) != 0)
|
| /src/external/apache2/llvm/dist/llvm/bindings/ocaml/llvm/ |
| llvm.mli | 223 | SRem
2289 [%name = srem %x, %y]
|
