Home
last modified time | relevance | path

Searched refs:Rem (Results 1 – 25 of 48) sorted by relevance

12

/freebsd/crypto/krb5/src/config/
H A Drm.bat8 Rem
9 Rem rm.bat
10 Rem
11 Rem Copyright 1995 by the Massachusetts Institute of Technology.
12 Rem All Rights Reserved.
13 Rem
14 Rem Export of this software from the United States of America may
15 Rem require a specific license from the United States Government.
16 Rem It is the responsibility of any person or organization contemplating
17 Rem export to obtain such a license before exporting.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DIntegerDivision.cpp354 bool llvm::expandRemainder(BinaryOperator *Rem) { in expandRemainder() argument
355 assert((Rem->getOpcode() == Instruction::SRem || in expandRemainder()
356 Rem->getOpcode() == Instruction::URem) && in expandRemainder()
359 IRBuilder<> Builder(Rem); in expandRemainder()
361 assert(!Rem->getType()->isVectorTy() && "Div over vectors not supported"); in expandRemainder()
364 if (Rem->getOpcode() == Instruction::SRem) { in expandRemainder()
365 Value *Remainder = generateSignedRemainderCode(Rem->getOperand(0), in expandRemainder()
366 Rem->getOperand(1), Builder); in expandRemainder()
369 bool IsInsertPoint = Rem->getIterator() == Builder.GetInsertPoint(); in expandRemainder()
370 Rem->replaceAllUsesWith(Remainder); in expandRemainder()
[all …]
H A DSimplifyIndVar.cpp100 void simplifyIVRemainder(BinaryOperator *Rem, Instruction *IVOperand,
102 void replaceRemWithNumerator(BinaryOperator *Rem);
103 void replaceRemWithNumeratorOrZero(BinaryOperator *Rem);
104 void replaceSRemWithURem(BinaryOperator *Rem);
328 void SimplifyIndvar::replaceSRemWithURem(BinaryOperator *Rem) { in replaceSRemWithURem() argument
329 auto *N = Rem->getOperand(0), *D = Rem->getOperand(1); in replaceSRemWithURem()
331 Rem->getName() + ".urem", Rem->getIterator()); in replaceSRemWithURem()
332 Rem->replaceAllUsesWith(URem); in replaceSRemWithURem()
333 URem->setDebugLoc(Rem->getDebugLoc()); in replaceSRemWithURem()
334 LLVM_DEBUG(dbgs() << "INDVARS: Simplified srem: " << *Rem << '\n'); in replaceSRemWithURem()
[all …]
H A DAMDGPUEmitPrintf.cpp348 int Rem = (Str.size() % 8); in processConstantStringArg() local
349 if (Rem > 0 && Rem <= 4) in processConstantStringArg()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DStackFrameLayoutAnalysisPass.cpp115 MachineOptimizationRemarkAnalysis Rem(DEBUG_TYPE, "StackLayout", in run() local
118 Rem << ("\nFunction: " + MF.getName()).str(); in run()
119 emitStackFrameLayoutRemarks(MF, Rem); in run()
120 ORE.emit(Rem); in run()
142 MachineOptimizationRemarkAnalysis &Rem) { in emitStackSlotRemark()
173 Rem << Prefix << ore::NV("Offset", D.Offset.getFixed()); in emitStackSlotRemark()
176 Rem << ((D.Offset.getScalable() < 0) ? "" : "+") in emitStackSlotRemark()
180 Rem << "], Type: " << ore::NV("Type", getTypeString(D.SlotTy)) in emitStackSlotRemark()
186 MachineOptimizationRemarkAnalysis &Rem) { in emitSourceLocRemark()
190 Rem << "\n " << ore::NV("DataLoc", Loc); in emitSourceLocRemark()
[all …]
H A DMachineScheduler.cpp2581 Rem = rem; in init()
2811 unsigned OtherCritCount = Rem->RemIssueCount in getOtherResourceCount()
2817 unsigned OtherCount = getResourceCount(PIdx) + Rem->RemainingCounts[PIdx]; in getOtherResourceCount()
2945 assert(Rem->RemainingCounts[PIdx] >= Count && "resource double counted"); in countResource()
2946 Rem->RemainingCounts[PIdx] -= Count; in countResource()
3019 assert(Rem->RemIssueCount >= DecRemIssue && "MOps double counted"); in bumpNode()
3020 Rem->RemIssueCount -= DecRemIssue; in bumpNode()
3317 if (CurrZone.getCurrCycle() > Rem.CriticalPath) in shouldReduceLatency()
3327 return RemLatency + CurrZone.getCurrCycle() > Rem.CriticalPath; in shouldReduceLatency()
3364 << Rem.CriticalPath << "\n"); in setPolicy()
[all …]
H A DSelectOptimize.cpp949 DiagnosticInfoOptimizationBase &Rem) { in EmitAndPrintRemark() argument
950 LLVM_DEBUG(dbgs() << Rem.getMsg() << "\n"); in EmitAndPrintRemark()
951 ORE->emit(Rem); in EmitAndPrintRemark()
H A DCodeGenPrepare.cpp475 bool optimizeURem(Instruction *Rem);
2049 Instruction *Rem, const LoopInfo *LI, Value *&RemAmtOut, Value *&AddInstOut, in isRemOfLoopIncrementWithLoopInvariant() argument
2053 if (!match(Rem, m_URem(m_Value(Incr), m_Value(RemAmt)))) in isRemOfLoopIncrementWithLoopInvariant()
2092 if (!L->contains(Rem)) in isRemOfLoopIncrementWithLoopInvariant()
2137 static bool foldURemOfLoopIncrement(Instruction *Rem, const DataLayout *DL, in foldURemOfLoopIncrement() argument
2143 if (!isRemOfLoopIncrementWithLoopInvariant(Rem, LI, RemAmt, AddInst, in foldURemOfLoopIncrement()
2185 Type *Ty = Rem->getType(); in foldURemOfLoopIncrement()
2186 IRBuilder<> Builder(Rem->getContext()); in foldURemOfLoopIncrement()
2205 FreshBBs.insert(Rem->getParent()); in foldURemOfLoopIncrement()
2208 replaceAllUsesWith(Rem, NewRem, FreshBBs, IsHuge); in foldURemOfLoopIncrement()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DBranchProbability.cpp92 uint64_t Rem = (uint64_t(Upper32) << 32) | Mid32; in scale() local
93 uint64_t UpperQ = Rem / D; in scale()
99 Rem = ((Rem % D) << 32) | Lower32; in scale()
100 uint64_t LowerQ = Rem / D; in scale()
H A DAPInt.cpp2771 APInt Quo, Rem; in RoundingUDiv() local
2772 APInt::udivrem(A, B, Quo, Rem); in RoundingUDiv()
2773 if (Rem.isZero()) in RoundingUDiv()
2786 APInt Quo, Rem; in RoundingSDiv() local
2787 APInt::sdivrem(A, B, Quo, Rem); in RoundingSDiv()
2788 if (Rem.isZero()) in RoundingSDiv()
2796 if (Rem.isNegative() != B.isNegative()) in RoundingSDiv()
2800 if (Rem.isNegative() != B.isNegative()) in RoundingSDiv()
2952 APInt Rem; in SolveQuadraticEquationWrap() local
2961 APInt::sdivrem(-B - (SQ+InexactSQ), TwoA, X, Rem); in SolveQuadraticEquationWrap()
[all …]
H A DAPFixedPoint.cpp333 APInt Rem; in div() local
334 APInt::sdivrem(ThisVal, OtherVal, Result, Rem); in div()
337 if (ThisVal.isNegative() != OtherVal.isNegative() && !Rem.isZero()) in div()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DIntegerDivision.h34 LLVM_ABI bool expandRemainder(BinaryOperator *Rem);
51 LLVM_ABI bool expandRemainderUpTo32Bits(BinaryOperator *Rem);
57 LLVM_ABI bool expandRemainderUpTo64Bits(BinaryOperator *Rem);
/freebsd/contrib/llvm-project/llvm/lib/BinaryFormat/
H A DCOFF.cpp33 unsigned Rem = Value % 64; in encodeBase64StringEntry() local
35 *(Ptr--) = Alphabet[Rem]; in encodeBase64StringEntry()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp87 if (Rem.IsAcyclicLatencyLimited && !Zone->getCurrMOps() && in tryCandidate()
137 !Rem.IsAcyclicLatencyLimited && tryLatency(TryCand, Cand, *Zone)) in tryCandidate()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUPromoteAlloca.cpp442 uint64_t Rem; in GEPToVectorIndex() local
443 APInt::udivrem(ConstOffset, VecElemSize, IndexQuot, Rem); in GEPToVectorIndex()
444 if (Rem != 0) in GEPToVectorIndex()
453 APInt::udivrem(VarOffset.second, VecElemSize, OffsetQuot, Rem); in GEPToVectorIndex()
454 if (Rem != 0 || OffsetQuot.isZero()) in GEPToVectorIndex()
H A DAMDGPUISelLowering.cpp2059 SDValue Rem = DAG.getNode(ISD::MUL, DL, VT, Div, RHS); in LowerDIVREM24() local
2060 Rem = DAG.getNode(ISD::SUB, DL, VT, LHS, Rem); in LowerDIVREM24()
2067 Rem = DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT, Rem, InRegSize); in LowerDIVREM24()
2071 Rem = DAG.getNode(ISD::AND, DL, VT, Rem, TruncMask); in LowerDIVREM24()
2074 return DAG.getMergeValues({ Div, Rem }, DL); in LowerDIVREM24()
2240 SDValue Rem = DAG.getSelectCC(DL, C3, Zero, Sel2, Sub1, ISD::SETNE); in LowerUDIVREM64() local
2243 Results.push_back(Rem); in LowerUDIVREM64()
2391 SDValue Rem = Div.getValue(1); in LowerSDIVREM() local
2394 Rem = DAG.getNode(ISD::XOR, DL, VT, Rem, RSign); in LowerSDIVREM()
2397 Rem = DAG.getNode(ISD::SUB, DL, VT, Rem, RSign); in LowerSDIVREM()
[all …]
H A DAMDGPULowerModuleLDSPass.cpp1329 if (uint64_t Rem = CurrentOffset % DataAlignV) { in createLDSVariableReplacement() local
1330 uint64_t Padding = DataAlignV - Rem; in createLDSVariableReplacement()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp885 const APInt *Rem; in SimplifyDemandedUseBits() local
886 if (match(I->getOperand(1), m_APInt(Rem)) && Rem->isPowerOf2()) { in SimplifyDemandedUseBits()
887 if (DemandedMask.ult(*Rem)) // srem won't affect demanded bits in SimplifyDemandedUseBits()
890 APInt LowBits = *Rem - 1; in SimplifyDemandedUseBits()
894 Known = KnownBits::srem(LHSKnown, KnownBits::makeConstant(*Rem)); in SimplifyDemandedUseBits()
H A DInstCombineMulDivRem.cpp400 APInt Quot, Rem; in visitMul() local
401 APInt::sdivrem(C, *C1, Quot, Rem); in visitMul()
402 return Rem.isZero() && !Quot.isAllOnes(); in visitMul()
445 Value *Rem = Builder.CreateBinOp(RemOpc, XFreeze, DivOp1); in visitMul() local
447 return BinaryOperator::CreateSub(XFreeze, Rem); in visitMul()
448 return BinaryOperator::CreateSub(Rem, XFreeze); in visitMul()
H A DInstCombineAddSub.cpp1184 Value *Div, *Rem; in SimplifyAddWithRemainder() local
1188 if (!RHS->hasOneUse() || !MatchMul(RHS, Rem, C2)) in SimplifyAddWithRemainder()
1189 Rem = RHS, C2 = APInt(I.getType()->getScalarSizeInBits(), 1); in SimplifyAddWithRemainder()
1191 std::swap(Div, Rem); in SimplifyAddWithRemainder()
1196 if (MatchRem(Rem, X, C0, IsSigned) && in SimplifyAddWithRemainder()
1201 if (!NewC.isZero() && !Rem->hasOneUse()) in SimplifyAddWithRemainder()
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DStmtVisitor.h129 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem) in BINOP_FALLBACK()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h851 SchedRemainder *Rem = nullptr; variable
1197 SchedRemainder Rem; variable
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DExpandVariadics.cpp694 if (uint64_t Rem = CurrentOffset % DataAlignV) { in expandCall() local
696 uint64_t Padding = DataAlignV - Rem; in expandCall()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerMatrixIntrinsics.cpp2786 OptimizationRemark Rem(DEBUG_TYPE, "matrix-lowered", Loc, in emitRemarks() local
2789 Rem << "Lowered with "; in emitRemarks()
2790 Rem << ore::NV("NumStores", Counts.NumStores) << " stores, " in emitRemarks()
2799 Rem << ",\nadditionally " in emitRemarks()
2807 Rem << ("\n" + linearize(L, Shared, ExprsInSubprogram, DL)); in emitRemarks()
2808 ORE.emit(Rem); in emitRemarks()
H A DConstraintElimination.cpp1996 OptimizationRemark Rem(DEBUG_TYPE, "Reproducer", &F); in eliminateConstraints() local
1997 Rem << ore::NV("module") << S; in eliminateConstraints()
1998 ORE.emit(Rem); in eliminateConstraints()

12