| /src/sys/external/bsd/acpica/dist/compiler/ |
| dtsubtable.c | 291 UINT8 Step;
315 Step = 5;
320 Step = 9;
325 Step = 10;
330 Step = 1;
334 for (i = 0; i < Step; i++)
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopPredication.cpp | 37 // Generally the facts SCEV provides about the increment step of add
58 // 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)
89 // Induction step. Assuming G(0) && M => G(I) on the subsequent
95 // So M = forall X . (G(X) && B(X)) => G(X + Step) implies G(I + Step).
264 bool isSupportedStep(const SCEV* Step);
502 bool LoopPredication::isSupportedStep(const SCEV* Step) {
503 return Step->isOne() || (Step->isAllOnesValue() && EnableCountDownLoop)
[all...] |
| InductiveRangeCheckElimination.cpp | 146 const SCEV *Step = nullptr;
161 const SCEV *getStep() const { return Step; }
168 OS << " Step: ";
169 Step->print(OS);
404 IRC.Step = IndexAddRec->getStepRecurrence(SE);
660 const SCEV *BoundSCEV, const SCEV *Step,
671 assert(SE.isKnownNegative(Step) && "expecting negative step");
675 LLVM_DEBUG(dbgs() << "irce: Step: " << *Step << "\n")
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| MatrixUtils.h | 88 Value *Bound, Value *Step, StringRef Name,
|
| /src/external/apache2/llvm/dist/llvm/lib/TableGen/ |
| SetTheory.cpp | 180 int Step = 1;
186 Step = II->getValue();
216 Step *= From <= To ? 1 : -1;
218 if (Step > 0 && From > To)
220 else if (Step < 0 && From < To)
235 From += Step;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| MatrixUtils.cpp | 24 Value *Bound, Value *Step, StringRef Name,
43 Value *Inc = B.CreateAdd(IV, Step, Name + ".step");
|
| /src/external/gpl3/gdb/dist/gdb/ |
| reverse.c | 30 reverse-step, reverse-next etc. */
58 exec_reverse_once ("step", args, from_tty);
285 = add_com ("reverse-step", class_run, reverse_step, _("\
286 Step program backward until it reaches the beginning of another source line.\n\
292 Step program backward, proceeding through subroutine calls.\n\
293 Like the \"reverse-step\" command as long as subroutine calls do not happen;\n\
300 Step backward exactly one instruction.\n\
306 Step backward one instruction, but proceed through called subroutines.\n\
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| reverse.c | 30 reverse-step, reverse-next etc. */
58 exec_reverse_once ("step", args, from_tty);
285 = add_com ("reverse-step", class_run, reverse_step, _("\
286 Step program backward until it reaches the beginning of another source line.\n\
292 Step program backward, proceeding through subroutine calls.\n\
293 Like the \"reverse-step\" command as long as subroutine calls do not happen;\n\
300 Step backward exactly one instruction.\n\
306 Step backward one instruction, but proceed through called subroutines.\n\
|
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerTracePC.h | 203 const size_t Step = sizeof(LargeType) / sizeof(uint8_t);
204 const size_t StepMask = Step - 1;
211 // Iterate by Step bytes at a time.
212 for (; P < End; P += Step)
214 for (size_t I = 0; I < Step; I++, Bundle >>= 8)
290 // Step function, grows similar to 8 * Log_2(A).
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| IVDescriptors.h | 272 IK_IntInduction, ///< Integer induction variable. Step = C.
273 IK_PtrInduction, ///< Pointer induction var. Step = C / sizeof(elem).
283 const SCEV *getStep() const { return Step; }
340 InductionDescriptor(Value *Start, InductionKind K, const SCEV *Step,
348 /// Step value.
349 const SCEV *Step = nullptr;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonISelDAGToDAGHVX.cpp | 43 // of inputs. In each step, an input can stay in place, or it can get
44 // routed to another position[1]. The step after that consists of two
46 // terms, in the given step, an input can go to either the upper or the
47 // lower network in the next step.
225 // in this step, create a work queue.
363 uint8_t ctl(ElemType Pos, unsigned Step) const {
364 return Table[Pos][Step];
391 bool route(ElemType *P, RowType *T, unsigned Size, unsigned Step);
405 bool route(ElemType *P, RowType *T, unsigned Size, unsigned Step);
421 bool route(ElemType *P, RowType *T, unsigned Size, unsigned Step);
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter1/ |
| toy.cpp | 221 std::unique_ptr<ExprAST> Start, End, Step, Body;
225 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
228 Step(std::move(Step)), Body(std::move(Body)) {}
441 // The step value is optional.
442 std::unique_ptr<ExprAST> Step;
445 Step = ParseExpression();
446 if (!Step)
459 std::move(Step), std::move(Body));
898 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter2/ |
| toy.cpp | 221 std::unique_ptr<ExprAST> Start, End, Step, Body;
225 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
228 Step(std::move(Step)), Body(std::move(Body)) {}
441 // The step value is optional.
442 std::unique_ptr<ExprAST> Step;
445 Step = ParseExpression();
446 if (!Step)
459 std::move(Step), std::move(Body));
898 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter3/ |
| toy.cpp | 221 std::unique_ptr<ExprAST> Start, End, Step, Body;
225 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
228 Step(std::move(Step)), Body(std::move(Body)) {}
441 // The step value is optional.
442 std::unique_ptr<ExprAST> Step;
445 Step = ParseExpression();
446 if (!Step)
459 std::move(Step), std::move(Body));
898 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter4/ |
| toy.cpp | 219 std::unique_ptr<ExprAST> Start, End, Step, Body;
223 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
226 Step(std::move(Step)), Body(std::move(Body)) {}
424 // The step value is optional.
425 std::unique_ptr<ExprAST> Step;
428 Step = ParseExpression();
429 if (!Step)
442 std::move(Step), std::move(Body));
881 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 198 std::unique_ptr<ExprAST> Start, End, Step, Body;
202 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
205 Step(std::move(Step)), Body(std::move(Body)) {}
390 // The step value is optional.
391 std::unique_ptr<ExprAST> Step;
394 Step = ParseExpression();
395 if (!Step)
408 std::move(Step), std::move(Body));
684 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter6/ |
| toy.cpp | 218 std::unique_ptr<ExprAST> Start, End, Step, Body;
222 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
225 Step(std::move(Step)), Body(std::move(Body)) {}
424 // The step value is optional.
425 std::unique_ptr<ExprAST> Step;
428 Step = ParseExpression();
429 if (!Step)
442 std::move(Step), std::move(Body));
796 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter7/ |
| toy.cpp | 226 std::unique_ptr<ExprAST> Start, End, Step, Body;
230 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
233 Step(std::move(Step)), Body(std::move(Body)) {}
446 // The step value is optional.
447 std::unique_ptr<ExprAST> Step;
450 Step = ParseExpression();
451 if (!Step)
464 std::move(Step), std::move(Body));
904 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter8/ |
| toy.cpp | 227 std::unique_ptr<ExprAST> Start, End, Step, Body;
231 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
234 Step(std::move(Step)), Body(std::move(Body)) {}
447 // The step value is optional.
448 std::unique_ptr<ExprAST> Step;
451 Step = ParseExpression();
452 if (!Step)
465 std::move(Step), std::move(Body));
903 // step = stepexp
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| IVDescriptors.cpp | 880 // isCorrectOpcode functions to step the right number of instruction, and
939 const SCEV *Step, BinaryOperator *BOp,
941 : StartValue(Start), IK(K), Step(Step), InductionBinOp(BOp) {
952 // Check the Step Value. It should be non-zero integer value.
954 "Step value is zero");
957 "Step value should be constant for pointer induction");
958 assert((IK == IK_FpInduction || Step->getType()->isIntegerTy()) &&
961 assert((IK != IK_FpInduction || Step->getType()->isFloatingPointTy()) &&
977 if (isa<SCEVConstant>(Step))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaInit.cpp | 3457 void InitializationSequence::Step::Destroy() {
3503 // There can be some lvalue adjustments after the SK_BindReference step.
3574 Step S;
3585 Step S;
3597 Step S;
3604 Step S;
3611 Step S;
3622 Step S;
3633 Step S;
3651 Step S
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| ExprOpenMP.h | 239 /// step 1.
242 /// calculated as VD = Begin + CounterVD * Step;
265 /// range-specification is of the form begin:end[:step], where begin and end are
266 /// expressions for which their types can be converted to iterator-type and step
277 /// Iterator range representation begin:end[:step].
281 Expr *Step = nullptr;
300 Step = 2,
336 /// Sets begin, end and optional step expressions for specified iterator
339 Expr *End, SourceLocation SecondColonLoc, Expr *Step);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| MVETailPredication.cpp | 332 auto *Step = dyn_cast<SCEVConstant>(AddExpr->getOperand(1));
333 if (!Step) {
334 LLVM_DEBUG(dbgs() << "ARM TP: induction step is not a constant: ";
338 auto StepValue = Step->getValue()->getSExtValue();
342 LLVM_DEBUG(dbgs() << "ARM TP: Step value " << StepValue
|
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter9/ |
| toy.cpp | 315 std::unique_ptr<ExprAST> Start, End, Step, Body;
319 std::unique_ptr<ExprAST> End, std::unique_ptr<ExprAST> Step,
322 Step(std::move(Step)), Body(std::move(Body)) {}
328 Step->dump(indent(out, ind) << "Step:", ind + 1);
558 // The step value is optional.
559 std::unique_ptr<ExprAST> Step;
562 Step = ParseExpression();
563 if (!Step)
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/cached/ |
| toy-jit.cpp | 192 ExprAST *Start, *End, *Step, *Body;
195 ExprAST *step, ExprAST *body)
196 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
387 // The step value is optional.
388 ExprAST *Step = 0;
391 Step = ParseExpression();
392 if (Step == 0) return 0;
402 return new ForExprAST(IdName, Start, End, Step, Body);
798 // step = stepexp
[all...] |
