Home
last modified time | relevance | path

Searched refs:Step (Results 1 – 25 of 138) sorted by relevance

123456

/freebsd/sys/contrib/dev/acpica/compiler/
H A Ddtsubtable.c399 UINT8 Step; in DtGetSubtableLength() local
423 Step = 5; in DtGetSubtableLength()
428 Step = 9; in DtGetSubtableLength()
433 Step = 10; in DtGetSubtableLength()
438 Step = 1; in DtGetSubtableLength()
442 for (i = 0; i < Step; i++) in DtGetSubtableLength()
/freebsd/contrib/llvm-project/llvm/lib/MC/
H A DMCWin64EH.cpp1870 int Step = 0; in tryARMPackedUnwind()
1905 if (Step != 0) in tryARMPackedUnwind()
1907 Step = 1; in tryARMPackedUnwind()
1913 if (Step != 1 && Step != 2) in tryARMPackedUnwind()
1924 Step = 3; in tryARMPackedUnwind()
1928 if (Step == 1 && Inst.Register == 0x0f) { in tryARMPackedUnwind()
1931 Step = 2; in tryARMPackedUnwind()
1936 if (Step != 1 && Step ! in tryARMPackedUnwind()
1861 int Step = 0; tryARMPackedUnwind() local
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVGatherScatterLowering.cpp207 Value *Step, *Start; in matchStridedRecurrence() local
208 if (!matchSimpleRecurrence(Phi, Inc, Start, Step) || in matchStridedRecurrence()
217 if (!L->isLoopInvariant(Step)) in matchStridedRecurrence()
221 Step = getSplatValue(Step); in matchStridedRecurrence()
222 if (!Step) in matchStridedRecurrence()
233 Inc = BinaryOperator::CreateAdd(BasePtr, Step, Inc->getName() + ".scalar", in matchStridedRecurrence()
295 Value *Step = Inc->getOperand(StepIndex); in matchStridedRecurrence() local
315 Step = Builder.CreateMul(Step, SplatOp, "step"); in matchStridedRecurrence()
321 Step = Builder.CreateShl(Step, SplatOp, "step"); in matchStridedRecurrence()
327 Inc->setOperand(StepIndex, Step); in matchStridedRecurrence()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopPredication.cpp58 // I.INC = I + Step
70 // I.INC = I + Step
75 // One solution for M is M = forall X . (G(X) && B(X)) => G(X + Step)
95 // So M = forall X . (G(X) && B(X)) => G(X + Step) implies G(I + Step).
274 bool isSupportedStep(const SCEV* Step);
478 bool LoopPredication::isSupportedStep(const SCEV* Step) { in isSafeToTruncateWideIVType()
479 return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop); in isSafeToTruncateWideIVType()
680 auto *Step in normalizePredicate()
518 isSupportedStep(const SCEV * Step) isSupportedStep() argument
720 auto *Step = RangeCheckIV->getStepRecurrence(*SE); widenICmpRangeCheck() local
930 auto *Step = Result->IV->getStepRecurrence(*SE); parseLoopLatchICmp() local
936 __anon4970eb7f0202(const SCEV *Step, ICmpInst::Predicate Pred) parseLoopLatchICmp() argument
[all...]
H A DInductiveRangeCheckElimination.cpp148 const SCEV *Step = nullptr;
172 const SCEV *getStep() const { return Step; }
179 OS << " Step: "; in print()
180 Step->print(OS); in print()
520 IRC.Step = IndexAddRec->getStepRecurrence(SE); in extractRangeChecksFromCond()
151 const SCEV *Step = nullptr; global() member in __anona4c10e620111::InductiveRangeCheck
791 isSafeDecreasingBound(const SCEV * Start,const SCEV * BoundSCEV,const SCEV * Step,ICmpInst::Predicate Pred,unsigned LatchBrExitIdx,Loop * L,ScalarEvolution & SE) isSafeDecreasingBound() argument
840 isSafeIncreasingBound(const SCEV * Start,const SCEV * BoundSCEV,const SCEV * Step,ICmpInst::Predicate Pred,unsigned LatchBrExitIdx,Loop * L,ScalarEvolution & SE) isSafeIncreasingBound() argument
1021 const SCEV *Step = SE.getSCEV(StepCI); parseLoopStructure() local
/freebsd/contrib/llvm-project/lldb/source/Target/
H A DThreadPlanStepRange.cpp69 Log *log = GetLog(LLDBLog::Step); in ShouldReportStop()
102 Log *log = GetLog(LLDBLog::Step); in InRange()
298 Log *log = GetLog(LLDBLog::Step); in ClearNextBranchBreakpoint()
312 Log *log = GetLog(LLDBLog::Step); in SetNextBranchBreakpoint()
391 Log *log = GetLog(LLDBLog::Step); in NextRangeBreakpointExplainsStop()
458 Log *log = GetLog(LLDBLog::Step); in MischiefManaged()
469 Log *log = GetLog(LLDBLog::Step); in IsPlanStale()
H A DThreadPlanStepThrough.cpp64 Log *log = GetLog(LLDBLog::Step); in ThreadPlanStepThrough()
98 Log *log = GetLog(LLDBLog::Step); in LookForPlanToStepThroughFromCurrentPC()
231 Log *log = GetLog(LLDBLog::Step); in MischiefManaged()
256 Log *log = GetLog(LLDBLog::Step); in HitOurBackstopBreakpoint()
H A DThreadPlanCallFunction.cpp50 Log *log = GetLog(LLDBLog::Step); in ConstructorSetup()
153 Log *log = GetLog(LLDBLog::Step); in ReportRegisterState()
176 Log *log = GetLog(LLDBLog::Step); in DoTakedown()
252 Log *log(GetLog(LLDBLog::Step | LLDBLog::Process)); in DoPlanExplainsStop()
391 Log *log = GetLog(LLDBLog::Step); in MischiefManaged()
442 Log *log = GetLog(LLDBLog::Step); in BreakpointsExplainStop()
H A DThreadPlanStepInRange.cpp129 Log *log = GetLog(LLDBLog::Step); in ShouldStop()
273 log = GetLog(LLDBLog::Step); in ShouldStop()
345 LLDB_LOGF(GetLog(LLDBLog::Step), in FrameMatchesAvoidCriteria()
363 Log *log = GetLog(LLDBLog::Step); in DefaultShouldStopHereCallback()
445 Log *log = GetLog(LLDBLog::Step); in DoPlanExplainsStop()
468 Log *log = GetLog(LLDBLog::Step); in DoWillResume()
H A DThreadPlanShouldStopHere.cpp45 Log *log = GetLog(LLDBLog::Step); in InvokeShouldStopHereCallback()
66 Log *log = GetLog(LLDBLog::Step); in DefaultShouldStopHereCallback()
102 Log *log = GetLog(LLDBLog::Step); in DefaultStepFromHereCallback()
H A DThreadPlanStepInstruction.cpp99 Log *log = GetLog(LLDBLog::Step); in IsPlanStale()
131 Log *log = GetLog(LLDBLog::Step); in ShouldStop()
247 Log *log = GetLog(LLDBLog::Step); in MischiefManaged()
H A DThreadPlanStepOverBreakpoint.cpp55 Log *log = GetLog(LLDBLog::Step); in DoPlanExplainsStop()
138 Log *log = GetLog(LLDBLog::Step); in MischiefManaged()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopConstrainer.cpp20 const SCEV *Step, ICmpInst::Predicate Pred, in isSafeDecreasingBound() argument
30 assert(SE.isKnownNegative(Step) && "expecting negative step"); in isSafeDecreasingBound()
34 LLVM_DEBUG(dbgs() << "Step: " << *Step << "\n"); in isSafeDecreasingBound()
53 const SCEV *StepPlusOne = SE.getAddExpr(Step, SE.getOne(Step->getType())); in isSafeDecreasingBound()
69 const SCEV *Step, ICmpInst::Predicate Pred, in isSafeIncreasingBound() argument
81 LLVM_DEBUG(dbgs() << "Step: " << *Step << "\n"); in isSafeIncreasingBound()
100 const SCEV *StepMinusOne = SE.getMinusSCEV(Step, SE.getOne(Step->getType())); in isSafeIncreasingBound()
107 SE.getAddExpr(BoundLG, Step)) && in isSafeIncreasingBound()
252 const SCEV *Step = SE.getSCEV(StepCI); in parseLoopStructure() local
315 if (!isSafeIncreasingBound(IndVarStart, RightSCEV, Step, Pred, in parseLoopStructure()
[all …]
H A DScalarEvolutionExpander.cpp908 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNSW() local
909 const SCEV *OpAfterExtend = SE.getAddExpr(SE.getSignExtendExpr(Step, WideTy), in IsIncrementNSW()
912 SE.getSignExtendExpr(SE.getAddExpr(AR, Step), WideTy); in IsIncrementNSW()
922 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNUW() local
923 const SCEV *OpAfterExtend = SE.getAddExpr(SE.getZeroExtendExpr(Step, WideTy), in IsIncrementNUW()
926 SE.getZeroExtendExpr(SE.getAddExpr(AR, Step), WideTy); in IsIncrementNUW()
1053 const SCEV *Step = Normalized->getStepRecurrence(SE); in getAddRecExprPHILiterally() local
1058 bool useSubtract = !ExpandTy->isPointerTy() && Step->isNonConstantNegative(); in getAddRecExprPHILiterally()
1060 Step = SE.getNegativeSCEV(Step); in getAddRecExprPHILiterally()
1062 Value *StepV = expand(Step, L->getHeader()->getFirstInsertionPt()); in getAddRecExprPHILiterally()
[all …]
H A DLoopPeel.cpp359 const SCEV *Step, ICmpInst::Predicate Pred) { in countToEliminateCompares() argument
362 IterVal = SE.getAddExpr(IterVal, Step); in countToEliminateCompares()
428 const SCEV *Step = LeftAR->getStepRecurrence(SE); in countToEliminateCompares() local
429 if (!PeelWhilePredicateIsKnown(NewPeelCount, IterVal, RightSCEV, Step, in countToEliminateCompares()
436 const SCEV *NextIterVal = SE.getAddExpr(IterVal, Step); in countToEliminateCompares()
467 const SCEV *Step = AddRec->getStepRecurrence(SE); in countToEliminateCompares() local
472 if (SE.isKnownPositive(Step)) in countToEliminateCompares()
474 else if (SE.isKnownNegative(Step)) in countToEliminateCompares()
484 if (!PeelWhilePredicateIsKnown(NewPeelCount, IterVal, BoundSCEV, Step, in countToEliminateCompares()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaInit.cpp3750 void InitializationSequence::Step::Destroy() { in Destroy()
3798 for (const Step &S : llvm::reverse(Steps)) { in isDirectReferenceBinding()
3870 Step S; in AddAddressOverloadResolutionStep()
3881 Step S; in AddDerivedToBaseCastStep()
3895 Step S; in AddReferenceBindingStep()
3902 Step S; in AddFinalCopy()
3909 Step S; in AddExtraneousCopyToTemporary()
3920 Step S; in AddUserConversionStep()
3931 Step S; in AddQualificationConversionStep()
3949 Step S; in AddFunctionReferenceConversionStep()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerTracePC.h187 const size_t Step = sizeof(LargeType) / sizeof(uint8_t); in ForEachNonZeroByte() local
188 const size_t StepMask = Step - 1; in ForEachNonZeroByte()
196 for (; P + Step <= End; P += Step) in ForEachNonZeroByte()
199 for (size_t I = 0; I < Step; I++, Bundle >>= 8) in ForEachNonZeroByte()
/freebsd/contrib/llvm-project/llvm/lib/TableGen/
H A DSetTheory.cpp179 int Step = 1; in apply() local
185 Step = II->getValue(); in apply()
215 Step *= From <= To ? 1 : -1; in apply()
217 if (Step > 0 && From > To) in apply()
219 else if (Step < 0 && From < To) in apply()
234 From += Step; in apply()
/freebsd/share/examples/ipfilter/rules/
H A Dfirewall4 Step 1 - Block out "bad" IP packets.
14 Step 2 - Convert Network Security Policy to filter rules.
22 Step 3 - Create TCP "keep state" rules.
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDelinearization.cpp202 const SCEV *Step = Terms[Last]; in findArrayDimensionsRec() local
206 if (const SCEVMulExpr *M = dyn_cast<SCEVMulExpr>(Step)) { in findArrayDimensionsRec()
212 Step = SE.getMulExpr(Qs); in findArrayDimensionsRec()
215 Sizes.push_back(Step); in findArrayDimensionsRec()
222 SCEVDivision::divide(SE, Term, Step, &Q, &R); in findArrayDimensionsRec()
238 Sizes.push_back(Step); in findArrayDimensionsRec()
H A DIVDescriptors.cpp1234 const SCEV *Step, BinaryOperator *BOp, in InductionDescriptor() argument
1236 : StartValue(Start), IK(K), Step(Step), InductionBinOp(BOp) { in InductionDescriptor()
1251 assert((IK == IK_FpInduction || Step->getType()->isIntegerTy()) && in InductionDescriptor()
1254 assert((IK != IK_FpInduction || Step->getType()->isFloatingPointTy()) && in InductionDescriptor()
1270 if (isa<SCEVConstant>(Step)) in getConstIntStepValue()
1271 return dyn_cast<ConstantInt>(cast<SCEVConstant>(Step)->getValue()); in getConstIntStepValue()
1323 const SCEV *Step = SE->getUnknown(Addend); in isFPInductionPHI() local
1324 D = InductionDescriptor(StartValue, IK_FpInduction, Step, BOp); in isFPInductionPHI()
1516 const SCEV *Step = AR->getStepRecurrence(*SE); in isInductionPHI() local
1519 const SCEVConstant *ConstStep = dyn_cast<SCEVConstant>(Step); in isInductionPHI()
[all …]
H A DScalarEvolution.cpp1232 static const SCEV *getSignedOverflowLimitForStep(const SCEV *Step, in getSignedOverflowLimitForStep() argument
1235 unsigned BitWidth = SE->getTypeSizeInBits(Step->getType()); in getSignedOverflowLimitForStep()
1236 if (SE->isKnownPositive(Step)) { in getSignedOverflowLimitForStep()
1239 SE->getSignedRangeMax(Step)); in getSignedOverflowLimitForStep()
1241 if (SE->isKnownNegative(Step)) { in getSignedOverflowLimitForStep()
1244 SE->getSignedRangeMin(Step)); in getSignedOverflowLimitForStep()
1252 static const SCEV *getUnsignedOverflowLimitForStep(const SCEV *Step, in getUnsignedOverflowLimitForStep() argument
1255 unsigned BitWidth = SE->getTypeSizeInBits(Step->getType()); in getUnsignedOverflowLimitForStep()
1259 SE->getUnsignedRangeMax(Step)); in getUnsignedOverflowLimitForStep()
1288 static const SCEV *getOverflowLimitForStep(const SCEV *Step, in getOverflowLimitForStep()
[all …]
/freebsd/contrib/llvm-project/lldb/source/Utility/
H A DLLDBLog.cpp54 {{"step"}, {"log step related activities"}, LLDBLog::Step},
73 LLDBLog::Watchpoints | LLDBLog::Step |
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanRecipes.cpp457 Value *Step = in generatePerPart() local
459 Value *Sub = Builder.CreateSub(ScalarTC, Step); in generatePerPart()
460 Value *Cmp = Builder.CreateICmp(CmpInst::Predicate::ICMP_UGT, ScalarTC, Step); in generatePerPart()
496 Value *Step = createStepForVF(Builder, IV->getType(), State.VF, Part); in generatePerPart() local
497 return Builder.CreateAdd(IV, Step, Name, hasNoUnsignedWrap(), in generatePerPart()
1190 static Value *getStepVector(Value *Val, Value *StartIdx, Value *Step, in getStepVector() argument
1202 assert(Step->getType() == STy && "Step has wrong type"); in getStepVector()
1220 Step = Builder.CreateVectorSplat(VLen, Step); in getStepVector()
1221 assert(Step->getType() == Val->getType() && "Invalid step vec"); in getStepVector()
1224 Step = Builder.CreateMul(InitVec, Step); in getStepVector()
[all …]
/freebsd/contrib/llvm-project/lldb/source/Expression/
H A DFunctionCaller.cpp246 Log *log = GetLog(LLDBLog::Step); in InsertFunction()
257 Log *log(GetLog(LLDBLog::Expressions | LLDBLog::Step)); in GetThreadPlanToCallFunction()
295 Log *log(GetLog(LLDBLog::Expressions | LLDBLog::Step)); in FetchFunctionResults()
368 Log *log(GetLog(LLDBLog::Expressions | LLDBLog::Step)); in ExecuteFunction()

123456