Searched refs:Rem (Results 1 - 25 of 28) sorted by relevance

12

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DIntegerDivision.h25 /// Generate code to calculate the remainder of two integers, replacing Rem
31 /// Replace Rem with generated code.
32 bool expandRemainder(BinaryOperator *Rem);
43 /// Generate code to calculate the remainder of two integers, replacing Rem
44 /// with the generated code. Uses ExpandReminder with a 32bit Rem which
48 /// Replace Rem with generated code.
49 bool expandRemainderUpTo32Bits(BinaryOperator *Rem);
51 /// Generate code to calculate the remainder of two integers, replacing Rem
52 /// with the generated code. Uses ExpandReminder with a 64bit Rem.
54 /// Replace Rem wit
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DIntegerDivision.cpp368 /// Generate code to calculate the remainder of two integers, replacing Rem with
374 /// Replace Rem with generated code.
375 bool llvm::expandRemainder(BinaryOperator *Rem) { argument
376 assert((Rem->getOpcode() == Instruction::SRem ||
377 Rem->getOpcode() == Instruction::URem) &&
380 IRBuilder<> Builder(Rem);
382 assert(!Rem->getType()->isVectorTy() && "Div over vectors not supported");
383 assert((Rem->getType()->getIntegerBitWidth() == 32 ||
384 Rem->getType()->getIntegerBitWidth() == 64) &&
388 if (Rem
485 expandRemainderUpTo32Bits(BinaryOperator *Rem) argument
534 expandRemainderUpTo64Bits(BinaryOperator *Rem) argument
[all...]
H A DSimplifyIndVar.cpp91 void simplifyIVRemainder(BinaryOperator *Rem, Value *IVOperand,
93 void replaceRemWithNumerator(BinaryOperator *Rem);
94 void replaceRemWithNumeratorOrZero(BinaryOperator *Rem);
95 void replaceSRemWithURem(BinaryOperator *Rem);
322 void SimplifyIndvar::replaceSRemWithURem(BinaryOperator *Rem) { argument
323 auto *N = Rem->getOperand(0), *D = Rem->getOperand(1);
325 Rem->getName() + ".urem", Rem);
326 Rem
334 replaceRemWithNumerator(BinaryOperator *Rem) argument
343 replaceRemWithNumeratorOrZero(BinaryOperator *Rem) argument
358 simplifyIVRemainder(BinaryOperator *Rem, Value *IVOperand, bool IsSigned) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/
H A DBranchProbability.cpp91 uint64_t Rem = (uint64_t(Upper32) << 32) | Mid32;
92 uint64_t UpperQ = Rem / D;
98 Rem = ((Rem % D) << 32) | Lower32;
99 uint64_t LowerQ = Rem / D;
H A DAPInt.cpp2823 APInt Quo, Rem;
2824 APInt::udivrem(A, B, Quo, Rem);
2825 if (Rem == 0)
2838 APInt Quo, Rem;
2839 APInt::sdivrem(A, B, Quo, Rem);
2840 if (Rem == 0)
2848 if (Rem.isNegative() != B.isNegative())
2852 if (Rem.isNegative() != B.isNegative())
3004 APInt Rem;
3013 APInt::sdivrem(-B - (SQ+InexactSQ), TwoA, X, Rem);
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineScheduler.cpp1953 Rem = rem;
2109 unsigned OtherCritCount = Rem->RemIssueCount
2115 unsigned OtherCount = getResourceCount(PIdx) + Rem->RemainingCounts[PIdx];
2224 assert(Rem->RemainingCounts[PIdx] >= Count && "resource double counted");
2225 Rem->RemainingCounts[PIdx] -= Count;
2297 assert(Rem->RemIssueCount >= DecRemIssue && "MOps double counted");
2298 Rem->RemIssueCount -= DecRemIssue;
2542 if (CurrZone.getCurrCycle() > Rem.CriticalPath)
2552 return RemLatency + CurrZone.getCurrCycle() > Rem.CriticalPath;
2589 << Rem
[all...]
H A DTargetSchedule.cpp50 unsigned Rem = Dividend % Divisor; local
52 Divisor = Rem;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUPrintfRuntimeBinding.cpp261 size_t Rem = SizeStr % DWORD_ALIGN; local
265 if (Rem) {
266 NSizeStr = SizeStr + (DWORD_ALIGN - Rem);
446 size_t Rem = SizeStr % DWORD_ALIGN; local
448 if (Rem) {
449 NSizeStr = SizeStr + (DWORD_ALIGN - Rem);
H A DAMDGPUISelLowering.cpp1729 // Rem needs compensation, it's easier to recompute it
1730 SDValue Rem = DAG.getNode(ISD::MUL, DL, VT, Div, RHS); local
1731 Rem = DAG.getNode(ISD::SUB, DL, VT, LHS, Rem);
1738 Rem = DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT, Rem, InRegSize);
1742 Rem = DAG.getNode(ISD::AND, DL, VT, Rem, TruncMask);
1745 return DAG.getMergeValues({ Div, Rem }, DL);
1912 SDValue Rem local
2063 SDValue Rem = Div.getValue(1); local
[all...]
H A DAMDGPUCodeGenPrepare.cpp952 // Rem needs compensation, it's easier to recompute it
953 Value *Rem = Builder.CreateMul(Div, Den); local
954 Res = Builder.CreateSub(Num, Rem);
/freebsd-13-stable/contrib/llvm-project/clang/lib/Basic/
H A DFixedPoint.cpp281 llvm::APInt Rem; local
282 llvm::APInt::sdivrem(ThisVal, OtherVal, Result, Rem);
285 if (ThisVal.isNegative() != OtherVal.isNegative() && !Rem.isNullValue())
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/AST/
H A DStmtVisitor.h127 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem)
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h618 SchedRemainder *Rem = nullptr; member in class:llvm::SchedBoundary
900 SchedRemainder Rem; member in class:llvm::GenericSchedulerBase
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerMatrixIntrinsics.cpp1825 OptimizationRemark Rem(DEBUG_TYPE, "matrix-lowered", Loc,
1828 Rem << "Lowered with ";
1829 Rem << ore::NV("NumStores", Counts.NumStores) << " stores, "
1836 Rem << ",\nadditionally "
1844 Rem << ("\n" + linearize(L, Shared, ExprsInSubprogram, DL));
1845 ORE.emit(Rem);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp673 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
676 if (Rem->isMinusOne())
678 APInt RA = Rem->getValue().abs();
H A DInstCombineMulDivRem.cpp340 Value *Rem = Builder.CreateBinOp(RemOpc, X, DivOp1); local
342 return BinaryOperator::CreateSub(X, Rem);
343 return BinaryOperator::CreateSub(Rem, X);
H A DInstCombineShifts.cpp409 Value *Rem = Builder.CreateAnd(A, ConstantInt::get(I.getType(), *B - 1), local
411 return replaceOperand(I, 1, Rem);
/freebsd-13-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCGStmt.cpp1245 uint64_t Weight = Total / NCases, Rem = Total % NCases; local
1248 SwitchWeights->push_back(Weight + (Rem ? 1 : 0));
1249 if (Rem)
1250 Rem--;
H A DCGExprScalar.cpp56 /// and signed BO_{Div,Rem}. For these opcodes, and for unsigned BO_{Div,Rem},
814 HANDLEBINOP(Rem)
3198 // Rem in C can't be a floating point type: C99 6.5.5p2.
4762 COMPOUND_OP(Rem);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/MC/
H A DWinCOFFObjectWriter.cpp449 unsigned Rem = Value % 64; local
451 *(Ptr--) = Alphabet[Rem];
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp1107 int64_t Rem = StepVal % Size; local
1108 if (Rem)
H A DValueTracking.cpp1391 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1392 APInt RA = Rem->getValue().abs();
1425 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1426 const APInt &RA = Rem->getValue();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DAttributorAttributes.cpp188 uint64_t Idx, Rem; local
196 Rem = Offset - SL->getElementOffset(Idx);
205 Rem = Offset % ElementSize;
212 << " Idx: " << Idx << " Rem: " << Rem << "\n"); local
216 Offset = Rem;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DTargetLowering.cpp7582 SDValue Rem;
7591 Rem = Quot.getValue(1);
7596 Rem = DAG.getNode(ISD::SREM, dl, VT,
7600 SDValue RemNonZero = DAG.getSetCC(dl, BoolVT, Rem, Zero, ISD::SETNE);
H A DLegalizeDAG.cpp2245 SDValue Rem =
2248 Results.push_back(Rem);

Completed in 541 milliseconds

12