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

/freebsd-10.0-release/sys/contrib/dev/acpica/compiler/
H A Ddtsubtable.c292 UINT8 Step; local
316 Step = 5;
321 Step = 9;
326 Step = 1;
330 for (i = 0; i < Step; i++)
/freebsd-10.0-release/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.0-release/contrib/llvm/utils/TableGen/
H A DSetTheory.cpp169 int Step = 1; local
175 Step = II->getValue();
205 Step *= From <= To ? 1 : -1;
207 if (Step > 0 && From > To)
209 else if (Step < 0 && From < To)
224 From += Step;
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DSemaInit.cpp2465 void InitializationSequence::Step::Destroy() {
2556 Step S;
2567 Step S;
2579 Step S;
2586 Step S;
2597 Step S;
2608 Step S;
2628 Step S;
2637 Step S;
2645 Step
4869 PerformConstructorInitialization(Sema &S, const InitializedEntity &Entity, const InitializationKind &Kind, MultiExprArg Args, const InitializationSequence::Step& Step, bool &ConstructorInitRequiresZeroInit, bool IsListInitialization) argument
[all...]
H A DSemaStmt.cpp2319 for (InitializationSequence::step_iterator Step = Seq.step_begin(),
2321 Step != StepEnd; ++Step) {
2322 if (Step->Kind != InitializationSequence::SK_ConstructorInitialization)
2326 = cast<CXXConstructorDecl>(Step->Function.Function);
H A DSemaExprCXX.cpp187 for (unsigned Step = 0; Step != 2; ++Step) {
192 if (Step == 0 && LookupCtx)
194 else if (Step == 1 && LookInScope && S)
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DScalarEvolutionExpander.cpp288 const SCEV *Step = A->getStepRecurrence(SE); local
289 const SCEV *StepRem = SE.getConstant(Step->getType(), 0);
290 if (!FactorOutConstant(Step, StepRem, Factor, SE, TD))
298 S = SE.getAddRecExpr(Start, Step, A->getLoop(), SCEV::FlagAnyWrap);
1105 const SCEV *Step = Normalized->getStepRecurrence(SE); local
1109 bool useSubtract = !ExpandTy->isPointerTy() && Step->isNonConstantNegative();
1111 Step = SE.getNegativeSCEV(Step);
1113 Value *StepV = expandCodeFor(Step, IntTy, L->getHeader()->begin());
1188 const SCEV *Step local
[all...]
H A DScalarEvolution.cpp944 const SCEV *Step = AR->getStepRecurrence(*this); local
952 getZeroExtendExpr(Step, Ty),
976 // Check whether Start+Step*MaxBECount has no unsigned overflow.
977 const SCEV *ZMul = getMulExpr(CastedMaxBECount, Step);
985 getZeroExtendExpr(Step, WideTy)));
991 getZeroExtendExpr(Step, Ty),
999 getSignExtendExpr(Step, WideTy)));
1006 getSignExtendExpr(Step, Ty),
1015 if (isKnownPositive(Step)) {
1017 getUnsignedRange(Step)
1060 getOverflowLimitForStep(const SCEV *Step, ICmpInst::Predicate *Pred, ScalarEvolution *SE) argument
1088 const SCEV *Step = AR->getStepRecurrence(*SE); local
1210 const SCEV *Step = AR->getStepRecurrence(*this); local
[all...]
H A DDependenceAnalysis.cpp809 const SCEV *Step = AddRec->getStepRecurrence(*SE); local
810 if (!isLoopInvariant(Step, LoopNest))
827 const SCEV *Step = AddRec->getStepRecurrence(*SE); local
828 if (!isLoopInvariant(Step, LoopNest))
/freebsd-10.0-release/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.0-release/contrib/llvm/tools/clang/include/clang/Sema/
H A DInitialization.h653 class Step { class in class:clang::InitializationSequence
697 SmallVector<Step, 4> Steps;
849 typedef SmallVector<Step, 4>::const_iterator step_iterator;
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DScalarEvolution.h434 const SCEV *Step,
617 const SCEV *getAddRecExpr(const SCEV *Start, const SCEV *Step,
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp358 IK_IntInduction, ///< Integer induction variable. Step = 1.
359 IK_ReverseIntInduction, ///< Reverse int induction variable. Step = -1.
360 IK_PtrInduction, ///< Pointer induction var. Step = sizeof(elem).
361 IK_ReversePtrInduction ///< Reverse ptr indvar. Step = - sizeof(elem).
911 const SCEV *Step = AR->getStepRecurrence(*SE); local
915 if (Step->isOne())
917 if (Step->isAllOnesValue())
1294 Constant *Step = ConstantInt::get(IdxTy, VF * UF); local
1316 Value *R = BypassBuilder.CreateURem(Count, Step, "n.mod.vf");
1466 Value *NextIdx = Builder.CreateAdd(Induction, Step, "inde
3129 const SCEV *Step = AR->getStepRecurrence(*SE); local
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp1420 const SCEV *Step = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); local
1421 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);

Completed in 331 milliseconds