Home
last modified time | relevance | path

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

1234

/freebsd-13.1/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-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopPredication.cpp264 bool isSupportedStep(const SCEV* Step);
502 bool LoopPredication::isSupportedStep(const SCEV* Step) { in isSupportedStep() argument
503 return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop); in isSupportedStep()
702 auto *Step = RangeCheckIV->getStepRecurrence(*SE); in widenICmpRangeCheck() local
705 if (!isSupportedStep(Step)) { in widenICmpRangeCheck()
721 assert(Step->getType() == in widenICmpRangeCheck()
729 if (Step->isOne()) in widenICmpRangeCheck()
886 auto *Step = Result->IV->getStepRecurrence(*SE); in parseLoopLatchICmp() local
887 if (!isSupportedStep(Step)) { in parseLoopLatchICmp()
893 if (Step->isOne()) { in parseLoopLatchICmp()
[all …]
H A DInductiveRangeCheckElimination.cpp146 const SCEV *Step = nullptr; member in __anon7f8b68160111::InductiveRangeCheck
161 const SCEV *getStep() const { return Step; } in getStep()
169 Step->print(OS); in print()
404 IRC.Step = IndexAddRec->getStepRecurrence(SE); in extractRangeChecksFromCond()
671 assert(SE.isKnownNegative(Step) && "expecting negative step"); in isSafeDecreasingBound()
675 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n"); in isSafeDecreasingBound()
693 const SCEV *StepPlusOne = SE.getAddExpr(Step, SE.getOne(Step->getType())); in isSafeDecreasingBound()
723 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n"); in isSafeIncreasingBound()
741 SE.getMinusSCEV(Step, SE.getOne(Step->getType())); in isSafeIncreasingBound()
872 const SCEV *Step = SE.getSCEV(StepCI); in parseLoopStructure() local
[all …]
/freebsd-13.1/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-13.1/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-13.1/contrib/llvm-project/llvm/lib/TableGen/
H A DSetTheory.cpp180 int Step = 1; in apply() local
186 Step = II->getValue(); in apply()
216 Step *= From <= To ? 1 : -1; in apply()
218 if (Step > 0 && From > To) in apply()
220 else if (Step < 0 && From < To) in apply()
235 From += Step; in apply()
/freebsd-13.1/contrib/llvm-project/clang/lib/Sema/
H A DSemaInit.cpp3574 Step S; in AddAddressOverloadResolutionStep()
3585 Step S; in AddDerivedToBaseCastStep()
3599 Step S; in AddReferenceBindingStep()
3606 Step S; in AddFinalCopy()
3613 Step S; in AddExtraneousCopyToTemporary()
3624 Step S; in AddUserConversionStep()
3635 Step S; in AddQualificationConversionStep()
3653 Step S; in AddFunctionReferenceConversionStep()
3660 Step S; in AddAtomicConversionStep()
3669 Step S; in AddConversionSequenceStep()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DIVDescriptors.cpp967 : StartValue(Start), IK(K), Step(Step), InductionBinOp(BOp) { in InductionDescriptor()
984 assert((IK == IK_FpInduction || Step->getType()->isIntegerTy()) && in InductionDescriptor()
987 assert((IK != IK_FpInduction || Step->getType()->isFloatingPointTy()) && in InductionDescriptor()
1003 if (isa<SCEVConstant>(Step)) in getConstIntStepValue()
1004 return dyn_cast<ConstantInt>(cast<SCEVConstant>(Step)->getValue()); in getConstIntStepValue()
1056 const SCEV *Step = SE->getUnknown(Addend); in isFPInductionPHI() local
1057 D = InductionDescriptor(StartValue, IK_FpInduction, Step, BOp); in isFPInductionPHI()
1245 const SCEV *Step = AR->getStepRecurrence(*SE); in isInductionPHI() local
1248 const SCEVConstant *ConstStep = dyn_cast<SCEVConstant>(Step); in isInductionPHI()
1249 if (!ConstStep && !SE->isLoopInvariant(Step, TheLoop)) in isInductionPHI()
[all …]
H A DScalarEvolution.cpp1395 if (Op != Step) in getPreStartForExtend()
1518 ID.AddPointer(Step); in proveNoWrapByVaryingStart()
3506 Operands.push_back(Step); in getAddRecExpr()
5889 Value *Start, *Step; in getRangeForUnknownRecurrence() local
6284 Step = Step.abs(); in getRangeForAffineARHelper()
6374 const SCEV *StepAbs = getUMinExpr(Step, getNegativeSCEV(Step)); in getRangeForAffineNoSelfWrappingAR()
9520 getUDivExpr(Distance, CountDown ? getNegativeSCEV(Step) : Step); in howFarToZero()
10090 if (Step != One && Step != MinusOne) in getLoopInvariantExitCondDuringFirstIterations()
10111 if (Step == MinusOne) in getLoopInvariantExitCondDuringFirstIterations()
12321 Sizes.push_back(Step); in findArrayDimensionsRec()
[all …]
H A DLoopCacheAnalysis.cpp90 const SCEV *Step = AR->getStepRecurrence(SE); in isOneDimensionalArray() local
91 if (isa<SCEVAddRecExpr>(Start) || isa<SCEVAddRecExpr>(Step)) in isOneDimensionalArray()
95 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
453 const SCEV *Step = AR->getStepRecurrence(SE); in isSimpleAddRecurrence() local
455 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
H A DLoopInfo.cpp213 const SCEV *Step = IndDesc.getStep(); in getBounds() local
217 if (SE.getSCEV(StepInstOp1) == Step) in getBounds()
219 else if (SE.getSCEV(StepInstOp0) == Step) in getBounds()
422 ConstantInt *Step = IndDesc.getConstIntStepValue(); in isCanonical() local
423 if (!Step || !Step->isOne()) in isCanonical()
H A DLoads.cpp296 auto* Step = dyn_cast<SCEVConstant>(AddRec->getStepRecurrence(SE)); in isDereferenceableAndAlignedInLoop() local
297 if (!Step) in isDereferenceableAndAlignedInLoop()
300 if (Step->getAPInt() != EltSize) in isDereferenceableAndAlignedInLoop()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DScalarEvolutionExpander.cpp344 const SCEV *Step = A->getStepRecurrence(SE); in FactorOutConstant() local
353 S = SE.getAddRecExpr(Start, Step, A->getLoop(), in FactorOutConstant()
1186 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNSW() local
1200 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNUW() local
1347 Step = SE.getNegativeSCEV(Step); in getAddRecExprPHILiterally()
1432 if (!SE.dominates(Step, L->getHeader())) { in expandAddRecExprLiterally()
1433 PostLoopScale = Step; in expandAddRecExprLiterally()
1434 Step = SE.getConstant(Normalized->getType(), 1); in expandAddRecExprLiterally()
1502 Step = SE.getNegativeSCEV(Step); in expandAddRecExprLiterally()
2509 const SCEV *Step = AR->getStepRecurrence(SE); in generateOverflowCheck() local
[all …]
H A DMatrixUtils.cpp24 Value *Bound, Value *Step, StringRef Name, in CreateLoop() argument
43 Value *Inc = B.CreateAdd(IV, Step, Name + ".step"); in CreateLoop()
H A DLoopPeel.cpp250 const SCEV *Step = LeftAR->getStepRecurrence(SE); in countToEliminateCompares() local
251 const SCEV *NextIterVal = SE.getAddExpr(IterVal, Step); in countToEliminateCompares()
252 auto PeelOneMoreIteration = [&IterVal, &NextIterVal, &SE, Step, in countToEliminateCompares()
255 NextIterVal = SE.getAddExpr(IterVal, Step); in countToEliminateCompares()
/freebsd-13.1/sys/contrib/device-tree/Bindings/iio/amplifiers/
H A Dadi,hmc425a.yaml7 title: HMC425A 6-bit Digital Step Attenuator
14 Digital Step Attenuator IIO device with gpio interface.
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp364 return Table[Pos][Step]; in ctl()
452 if (T[U][Step] != S && T[U][Step] != None) in route()
454 T[U][Step] = S; in route()
461 if (Step+1 < Log) { in route()
472 unsigned Pets = Log-1 - Step; in route()
533 if (Step+1 < Log) { in route()
570 T[I][Step] = Pass; in route()
572 T[CI][Step] = Switch; in route()
577 T[CI][Step] = Switch; in route()
579 T[I][Step] = Pass; in route()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIVDescriptors.h284 const SCEV *getStep() const { return Step; } in getStep()
341 InductionDescriptor(Value *Start, InductionKind K, const SCEV *Step,
350 const SCEV *Step = nullptr; variable
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1111 Step->getType(), in createStepForVF()
2289 Step = Builder.CreateTrunc(Step, TruncType); in createVectorIntOrFpInductionPHI()
2429 return Exp.expandCodeFor(Step, Step->getType(), in widenIntOrFpInduction()
2454 Step = Builder.CreateTrunc(Step, TruncType); in widenIntOrFpInduction()
2485 CreateSplatIV(ScalarIV, Step); in widenIntOrFpInduction()
2519 CreateSplatIV(ScalarIV, Step); in widenIntOrFpInduction()
2552 Step = Builder.CreateVectorSplat(VLen, Step); in getStepVector()
2556 Step = Builder.CreateMul(InitVec, Step); in getStepVector()
2564 Step = Builder.CreateVectorSplat(VLen, Step); in getStepVector()
3265 Value *Step = in emitMinimumIterationCountCheck() local
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp332 auto *Step = dyn_cast<SCEVConstant>(AddExpr->getOperand(1)); in IsSafeActiveMask() local
333 if (!Step) { in IsSafeActiveMask()
338 auto StepValue = Step->getValue()->getSExtValue(); in IsSafeActiveMask()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegalizerInfo.cpp322 LegalizeActionStep Step = getActionDefinitions(Query.Opcode).apply(Query); in getAction() local
323 if (Step.Action != LegalizeAction::UseLegacyRules) { in getAction()
324 return Step; in getAction()
/freebsd-13.1/contrib/llvm-project/clang/include/clang/AST/
H A DExprOpenMP.h281 Expr *Step = nullptr; member
300 Step = 2, enumerator
339 Expr *End, SourceLocation SecondColonLoc, Expr *Step);
/freebsd-13.1/sys/contrib/device-tree/src/arm/
H A Dmeson8b-ec100.dts148 * Synchronous Step Down Regulator.
181 * Synchronous Step Down Regulator. Also called
196 * Synchronous Step Down Regulator. Also called
231 * Synchronous Step Down Regulator. Also called VDDAO
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DMatrixUtils.h88 Value *Bound, Value *Step, StringRef Name,
/freebsd-13.1/contrib/llvm-project/clang/include/clang/Sema/
H A DInitialization.h924 class Step {
968 SmallVector<Step, 4> Steps;
1209 using step_iterator = SmallVectorImpl<Step>::const_iterator;

1234