Searched refs:Step (Results 1 - 15 of 15) sorted by relevance

/freebsd-10-stable/sys/contrib/dev/acpica/compiler/
H A Ddtsubtable.c292 UINT8 Step; local
316 Step = 5;
321 Step = 9;
326 Step = 10;
331 Step = 1;
335 for (i = 0; i < Step; i++)
/freebsd-10-stable/sys/boot/pc98/boot0.5/
H A Dboot.s39 # Step 1: Save parameters
63 # Step 2: Calculate the segment address of the bootstrap routine
72 # Step 3: Read bootstrap code
85 # Step 4: Set DA/UA into BIOS work area
93 # Step 5: Set registers
/freebsd-10-stable/contrib/llvm/utils/TableGen/
H A DSetTheory.cpp175 int Step = 1; local
181 Step = II->getValue();
211 Step *= From <= To ? 1 : -1;
213 if (Step > 0 && From > To)
215 else if (Step < 0 && From < To)
230 From += Step;
/freebsd-10-stable/contrib/llvm/tools/clang/lib/Sema/
H A DSemaInit.cpp2633 void InitializationSequence::Step::Destroy() {
2728 Step S;
2739 Step S;
2751 Step S;
2758 Step S;
2769 Step S;
2780 Step S;
2800 Step S;
2809 Step S;
2818 Step
5137 PerformConstructorInitialization(Sema &S, const InitializedEntity &Entity, const InitializationKind &Kind, MultiExprArg Args, const InitializationSequence::Step& Step, bool &ConstructorInitRequiresZeroInit, bool IsListInitialization, SourceLocation LBraceLoc, SourceLocation RBraceLoc) argument
[all...]
H A DSemaStmt.cpp2457 for (InitializationSequence::step_iterator Step = Seq.step_begin(),
2459 Step != StepEnd; ++Step) {
2460 if (Step->Kind != InitializationSequence::SK_ConstructorInitialization)
2464 = cast<CXXConstructorDecl>(Step->Function.Function);
H A DSemaExprCXX.cpp189 for (unsigned Step = 0; Step != 2; ++Step) {
194 if (Step == 0 && LookupCtx)
196 else if (Step == 1 && LookInScope && S)
/freebsd-10-stable/contrib/llvm/lib/Analysis/
H A DScalarEvolutionExpander.cpp285 const SCEV *Step = A->getStepRecurrence(SE); local
286 const SCEV *StepRem = SE.getConstant(Step->getType(), 0);
287 if (!FactorOutConstant(Step, StepRem, Factor, SE, TD))
294 S = SE.getAddRecExpr(Start, Step, A->getLoop(),
1096 const SCEV *Step = Normalized->getStepRecurrence(SE); local
1100 bool useSubtract = !ExpandTy->isPointerTy() && Step->isNonConstantNegative();
1102 Step = SE.getNegativeSCEV(Step);
1104 Value *StepV = expandCodeFor(Step, IntTy, L->getHeader()->begin());
1179 const SCEV *Step local
1730 const SCEV *Step = AR->getStepRecurrence(SE); local
[all...]
H A DScalarEvolution.cpp947 const SCEV *Step = AR->getStepRecurrence(*this); local
955 getZeroExtendExpr(Step, Ty),
979 // Check whether Start+Step*MaxBECount has no unsigned overflow.
980 const SCEV *ZMul = getMulExpr(CastedMaxBECount, Step);
988 getZeroExtendExpr(Step, WideTy)));
994 getZeroExtendExpr(Step, Ty),
1002 getSignExtendExpr(Step, WideTy)));
1009 getSignExtendExpr(Step, Ty),
1018 if (isKnownPositive(Step)) {
1020 getUnsignedRange(Step)
1063 getOverflowLimitForStep(const SCEV *Step, ICmpInst::Predicate *Pred, ScalarEvolution *SE) argument
1091 const SCEV *Step = AR->getStepRecurrence(*SE); local
1213 const SCEV *Step = AR->getStepRecurrence(*this); local
[all...]
H A DDependenceAnalysis.cpp814 const SCEV *Step = AddRec->getStepRecurrence(*SE); local
815 if (!isLoopInvariant(Step, LoopNest))
832 const SCEV *Step = AddRec->getStepRecurrence(*SE); local
833 if (!isLoopInvariant(Step, LoopNest))
/freebsd-10-stable/contrib/gperf/src/
H A Dsearch.cc86 Step 1 (Finding good byte positions):
90 Step 2 (Finding good alpha increments):
95 Step 3 (Finding good asso_values):
943 struct Step struct
959 Step * _next;
1117 Step *steps;
1173 Step *step = new Step();
1241 for (Step *step = steps; step; step = step->_next)
1244 fprintf (stderr, "Step
[all...]
/freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Sema/
H A DInitialization.h697 class Step { class in class:clang::InitializationSequence
741 SmallVector<Step, 4> Steps;
908 typedef SmallVectorImpl<Step>::const_iterator step_iterator;
/freebsd-10-stable/contrib/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp432 IK_IntInduction, ///< Integer induction variable. Step = 1.
433 IK_ReverseIntInduction, ///< Reverse int induction variable. Step = -1.
434 IK_PtrInduction, ///< Pointer induction var. Step = sizeof(elem).
435 IK_ReversePtrInduction ///< Reverse ptr indvar. Step = - sizeof(elem).
1152 const SCEV *Step = AR->getStepRecurrence(*SE); local
1156 if (Step->isOne())
1158 if (Step->isAllOnesValue())
1609 Constant *Step = ConstantInt::get(IdxTy, VF * UF); local
1633 Value *R = BypassBuilder.CreateURem(Count, Step, "n.mod.vf");
1810 Value *NextIdx = Builder.CreateAdd(Induction, Step, "inde
3609 const SCEV *Step = AR->getStepRecurrence(*SE); local
[all...]
/freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp1421 const SCEV *Step = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); local
1422 if (!Step || !Step->isOne())
H A DLoopStrengthReduce.cpp501 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, local
503 if (!Step) return 0;
510 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap);
/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/
H A DScalarEvolution.h616 const SCEV *getAddRecExpr(const SCEV *Start, const SCEV *Step,

Completed in 690 milliseconds