Home
last modified time | relevance | path

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

123

/freebsd-12.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-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DLoopPredication.cpp251 bool isSupportedStep(const SCEV* Step);
427 bool LoopPredication::isSupportedStep(const SCEV* Step) { in isSupportedStep() argument
428 return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop); in isSupportedStep()
540 auto *Step = RangeCheckIV->getStepRecurrence(*SE); in widenICmpRangeCheck() local
543 if (!isSupportedStep(Step)) { in widenICmpRangeCheck()
559 assert(Step->getType() == in widenICmpRangeCheck()
567 if (Step->isOne()) in widenICmpRangeCheck()
678 auto *Step = Result->IV->getStepRecurrence(*SE); in parseLoopLatchICmp() local
679 if (!isSupportedStep(Step)) { in parseLoopLatchICmp()
685 if (Step->isOne()) { in parseLoopLatchICmp()
[all …]
H A DInductiveRangeCheckElimination.cpp138 const SCEV *Step = nullptr; member in __anon72252c870111::InductiveRangeCheck
154 const SCEV *getStep() const { return Step; } in getStep()
163 Step->print(OS); in print()
381 IRC.Step = IndexAddRec->getStepRecurrence(SE); in extractRangeChecksFromCond()
663 assert(SE.isKnownNegative(Step) && "expecting negative step"); in isSafeDecreasingBound()
667 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n"); in isSafeDecreasingBound()
685 const SCEV *StepPlusOne = SE.getAddExpr(Step, SE.getOne(Step->getType())); in isSafeDecreasingBound()
715 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n"); in isSafeIncreasingBound()
733 SE.getMinusSCEV(Step, SE.getOne(Step->getType())); in isSafeIncreasingBound()
875 const SCEV *Step = SE.getSCEV(StepCI); in parseLoopStructure() local
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/
H A DSemaInit.cpp3347 Step S; in AddAddressOverloadResolutionStep()
3358 Step S; in AddDerivedToBaseCastStep()
3370 Step S; in AddReferenceBindingStep()
3377 Step S; in AddFinalCopy()
3384 Step S; in AddExtraneousCopyToTemporary()
3395 Step S; in AddUserConversionStep()
3406 Step S; in AddQualificationConversionStep()
3424 Step S; in AddAtomicConversionStep()
3433 Step S; in AddLValueToRValueStep()
3442 Step S; in AddConversionSequenceStep()
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DIVDescriptors.cpp772 const SCEV *Step, BinaryOperator *BOp, in InductionDescriptor() argument
774 : StartValue(Start), IK(K), Step(Step), InductionBinOp(BOp) { in InductionDescriptor()
791 assert((IK == IK_FpInduction || Step->getType()->isIntegerTy()) && in InductionDescriptor()
794 assert((IK != IK_FpInduction || Step->getType()->isFloatingPointTy()) && in InductionDescriptor()
817 if (isa<SCEVConstant>(Step)) in getConstIntStepValue()
818 return dyn_cast<ConstantInt>(cast<SCEVConstant>(Step)->getValue()); in getConstIntStepValue()
870 const SCEV *Step = SE->getUnknown(Addend); in isFPInductionPHI() local
871 D = InductionDescriptor(StartValue, IK_FpInduction, Step, BOp); in isFPInductionPHI()
1052 const SCEV *Step = AR->getStepRecurrence(*SE); in isInductionPHI() local
1055 const SCEVConstant *ConstStep = dyn_cast<SCEVConstant>(Step); in isInductionPHI()
[all …]
H A DScalarEvolutionExpander.cpp291 const SCEV *Step = A->getStepRecurrence(SE); in FactorOutConstant() local
300 S = SE.getAddRecExpr(Start, Step, A->getLoop(), in FactorOutConstant()
1114 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNSW() local
1128 const SCEV *Step = AR->getStepRecurrence(SE); in IsIncrementNUW() local
1263 Step = SE.getNegativeSCEV(Step); in getAddRecExprPHILiterally()
1347 if (!SE.dominates(Step, L->getHeader())) { in expandAddRecExprLiterally()
1348 PostLoopScale = Step; in expandAddRecExprLiterally()
1406 Step = SE.getNegativeSCEV(Step); in expandAddRecExprLiterally()
2159 const SCEV *Step = AR->getStepRecurrence(SE); in generateOverflowCheck() local
2179 Value *StepValue = expandCodeFor(Step, Ty, Loc); in generateOverflowCheck()
[all …]
H A DScalarEvolution.cpp1309 if (SE->isKnownPositive(Step)) { in getSignedOverflowLimitForStep()
1314 if (SE->isKnownNegative(Step)) { in getSignedOverflowLimitForStep()
1416 if (Op != Step) in getPreStartForExtend()
1539 ID.AddPointer(Step); in proveNoWrapByVaryingStart()
3362 Operands.push_back(Step); in getAddRecExpr()
5765 Step = Step.abs(); in getRangeForAffineARHelper()
8733 getUDivExpr(Distance, CountDown ? getNegativeSCEV(Step) : Step); in howFarToZero()
10971 const SCEV *Step = Terms[Last]; in findArrayDimensionsRec() local
10981 Step = SE.getMulExpr(Qs); in findArrayDimensionsRec()
10984 Sizes.push_back(Step); in findArrayDimensionsRec()
[all …]
/freebsd-12.1/contrib/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-12.1/contrib/llvm/lib/TableGen/
H A DSetTheory.cpp181 int Step = 1; in apply() local
187 Step = II->getValue(); in apply()
217 Step *= From <= To ? 1 : -1; in apply()
219 if (Step > 0 && From > To) in apply()
221 else if (Step < 0 && From < To) in apply()
236 From += Step; in apply()
/freebsd-12.1/contrib/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-12.1/contrib/compiler-rt/lib/fuzzer/
H A DFuzzerTracePC.h183 const size_t Step = sizeof(LargeType) / sizeof(uint8_t); in ForEachNonZeroByte() local
184 const size_t StepMask = Step - 1; in ForEachNonZeroByte()
192 for (; P < End; P += Step) in ForEachNonZeroByte()
194 for (size_t I = 0; I < Step; I++, Bundle >>= 8) in ForEachNonZeroByte()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DIVDescriptors.h276 const SCEV *getStep() const { return Step; } in getStep()
338 InductionDescriptor(Value *Start, InductionKind K, const SCEV *Step,
347 const SCEV *Step = nullptr; variable
H A DTargetTransformInfoImpl.h658 const SCEVConstant *Step = getConstantStrideStep(SE, Ptr); in isConstantStridedAccessLessThan() local
659 if (!Step) in isConstantStridedAccessLessThan()
661 APInt StrideVal = Step->getAPInt(); in isConstantStridedAccessLessThan()
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1523 Step = Builder.CreateTrunc(Step, TruncType); in createVectorIntOrFpInductionPHI()
1534 if (Step->getType()->isIntegerTy()) { in createVectorIntOrFpInductionPHI()
1661 Value *Step = nullptr; in widenIntOrFpInduction() local
1695 assert(Step->getType()->isIntegerTy() && in widenIntOrFpInduction()
1698 Step = Builder.CreateTrunc(Step, TruncType); in widenIntOrFpInduction()
1748 Step = Builder.CreateVectorSplat(VLen, Step); in getStepVector()
1752 Step = Builder.CreateMul(Cv, Step); in getStepVector()
1766 Step = Builder.CreateVectorSplat(VLen, Step); in getStepVector()
1791 assert(ScalarIVTy == Step->getType() && in buildScalarSteps()
2621 auto Step = ID.getStep(); in emitTransformedIndex() local
[all …]
/freebsd-12.1/contrib/gcc/config/arm/
H A DREADME-interworking657 *Step One
667 *Step Two
677 *Step Four
682 *Step Five
687 *Step Six
696 *Step Two
706 *Step Five
715 *Step One
719 *Step Two
726 *Step Four
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/GlobalISel/
H A DLegalizationArtifactCombiner.h319 auto Step = LI.getAction(Query); in isInstUnsupported() local
320 return Step.Action == Unsupported || Step.Action == NotFound; in isInstUnsupported()
/freebsd-12.1/contrib/gperf/src/
H A Dsearch.cc946 struct Step struct
962 Step * _next; argument
1120 Step *steps; in find_asso_values()
1176 Step *step = new Step(); in find_asso_values()
1244 for (Step *step = steps; step; step = step->_next) in find_asso_values()
1277 for (Step *step = steps; step; step = step->_next) in find_asso_values()
1463 Step *step = steps; in find_asso_values()
/freebsd-12.1/contrib/llvm/lib/CodeGen/GlobalISel/
H A DLegalizerHelper.cpp53 auto Step = LI.getAction(MI, MRI); in legalizeInstrStep() local
54 switch (Step.Action) { in legalizeInstrStep()
63 return narrowScalar(MI, Step.TypeIdx, Step.NewType); in legalizeInstrStep()
66 return widenScalar(MI, Step.TypeIdx, Step.NewType); in legalizeInstrStep()
69 return lower(MI, Step.TypeIdx, Step.NewType); in legalizeInstrStep()
72 return fewerElementsVector(MI, Step.TypeIdx, Step.NewType); in legalizeInstrStep()
H A DLegalizerInfo.cpp323 LegalizeActionStep Step = getActionDefinitions(Query.Opcode).apply(Query); in getAction() local
324 if (Step.Action != LegalizeAction::UseLegacyRules) { in getAction()
325 return Step; in getAction()
/freebsd-12.1/sys/gnu/dts/arm/
H A Dmeson8b-ec100.dts135 * Synchronous Step Down Regulator.
168 * Synchronous Step Down Regulator. Also called
183 * Synchronous Step Down Regulator. Also called
/freebsd-12.1/contrib/llvm/tools/lld/COFF/
H A DICF.cpp226 size_t Step = Chunks.size() / NumShards; in forEachClass() local
231 Boundaries[I] = findBoundary((I - 1) * Step, Chunks.size()); in forEachClass()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Sema/
H A DInitialization.h901 class Step {
945 SmallVector<Step, 4> Steps;
1180 using step_iterator = SmallVectorImpl<Step>::const_iterator;
/freebsd-12.1/contrib/gcc/config/ia64/
H A Dia64.md3224 ;; Step 1
3233 ;; Step 2
3240 ;; Step 3
3247 ;; Step 4
3254 ;; Step 5
3261 ;; Step 6
3268 ;; Step 7
3276 ;; Step 8
3722 ;; Step 1
3731 ;; Step 2
[all …]
/freebsd-12.1/contrib/llvm/tools/lld/ELF/
H A DICF.cpp410 size_t Step = Sections.size() / NumShards; in forEachClass() local
416 Boundaries[I] = findBoundary((I - 1) * Step, Sections.size()); in forEachClass()
/freebsd-12.1/sys/contrib/edk2/Include/Uefi/
H A DUefiInternalFormRepresentation.h1034 UINT8 Step; member
1039 UINT16 Step; member
1044 UINT32 Step; member
1049 UINT64 Step; member

123