| /external/chromium_org/v8/src/ |
| incremental-marking.cc | 838 Step(allocated * kFastMarking / kInitialMarkingSpeed, GC_VIA_STACK_GUARD);
843 void IncrementalMarking::Step(intptr_t allocated_bytes,
867 // invoked since last step directly to determine the amount of work to do.
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 155 ExprAST *Start, *End, *Step, *Body;
158 ExprAST *step, ExprAST *body)
159 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
325 // The step value is optional.
326 ExprAST *Step = 0;
329 Step = ParseExpression();
330 if (Step == 0) return 0;
340 return new ForExprAST(IdName, Start, End, Step, Body);
574 // step = stepexp
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
| XPathParser.java | [all...] |
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| toy.cpp | 170 ExprAST *Start, *End, *Step, *Body;
173 ExprAST *step, ExprAST *body)
174 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
353 // The step value is optional.
354 ExprAST *Step = 0;
357 Step = ParseExpression();
358 if (Step == 0) return 0;
368 return new ForExprAST(IdName, Start, End, Step, Body);
678 // step = stepexp
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| toy.cpp | 175 ExprAST *Start, *End, *Step, *Body;
178 ExprAST *step, ExprAST *body)
179 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
371 // The step value is optional.
372 ExprAST *Step = 0;
375 Step = ParseExpression();
376 if (Step == 0) return 0;
386 return new ForExprAST(IdName, Start, End, Step, Body);
775 // step = stepexp
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
| toy-jit.cpp | 193 ExprAST *Start, *End, *Step, *Body;
196 ExprAST *step, ExprAST *body)
197 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
388 // The step value is optional.
389 ExprAST *Step = 0;
392 Step = ParseExpression();
393 if (Step == 0) return 0;
403 return new ForExprAST(IdName, Start, End, Step, Body);
802 // step = stepexp
[all...] |
| toy.cpp | 199 ExprAST *Start, *End, *Step, *Body;
202 ExprAST *step, ExprAST *body)
203 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
394 // The step value is optional.
395 ExprAST *Step = 0;
398 Step = ParseExpression();
399 if (Step == 0) return 0;
409 return new ForExprAST(IdName, Start, End, Step, Body);
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
| toy-jit.cpp | 178 ExprAST *Start, *End, *Step, *Body;
181 ExprAST *step, ExprAST *body)
182 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
373 // The step value is optional.
374 ExprAST *Step = 0;
377 Step = ParseExpression();
378 if (Step == 0) return 0;
388 return new ForExprAST(IdName, Start, End, Step, Body);
784 // step = stepexp
[all...] |
| toy.cpp | 178 ExprAST *Start, *End, *Step, *Body;
181 ExprAST *step, ExprAST *body)
182 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
373 // The step value is optional.
374 ExprAST *Step = 0;
377 Step = ParseExpression();
378 if (Step == 0) return 0;
388 return new ForExprAST(IdName, Start, End, Step, Body);
1064 // step = stepexp
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | 282 // In an AddRec, check if both start and step are divisible.
284 const SCEV *Step = A->getStepRecurrence(SE);
285 const SCEV *StepRem = SE.getConstant(Step->getType(), 0);
286 if (!FactorOutConstant(Step, StepRem, Factor, SE, DL))
293 S = SE.getAddRecExpr(Start, Step, A->getLoop(),
[all...] |
| ScalarEvolution.cpp | 709 // to do is multiply by the inverse. Therefore, this step can be done at
713 // is done is by doing the multiplication step at a width of at least W + T
722 // a division step, whereas this formula only requires multiplies and shifts.
724 // It doesn't matter whether the subtraction step is done in the calculation
759 // We need at least W + T bits for the multiplication step
[all...] |
| DependenceAnalysis.cpp | 814 const SCEV *Step = AddRec->getStepRecurrence(*SE);
815 if (!isLoopInvariant(Step, LoopNest))
832 const SCEV *Step = AddRec->getStepRecurrence(*SE);
833 if (!isLoopInvariant(Step, LoopNest))
[all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| box2d.js | [all...] |
| /external/clang/include/clang/Sema/ |
| Initialization.h | 637 /// \brief Describes the kind of a particular step in an initialization
711 /// \brief A single step in the initialization sequence.
712 class Step {
714 /// \brief The kind of conversion or initialization step we are taking.
756 SmallVector<Step, 4> Steps;
[all...] |
| /external/clang/lib/Sema/ |
| SemaOpenMP.cpp | [all...] |
| TreeTransform.h | 61 /// can be replaced by a subclass. The "transform" step transforms an AST node
63 /// then passes the pieces on to the "rebuild" step, which constructs a new AST
519 /// \param Last An iterator one step past the last template argument.
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
| toy.cpp | 223 ExprAST *Start, *End, *Step, *Body;
226 ExprAST *step, ExprAST *body)
227 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
418 // The step value is optional.
419 ExprAST *Step = 0;
422 Step = ParseExpression();
423 if (Step == 0) return 0;
433 return new ForExprAST(IdName, Start, End, Step, Body);
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
| toy.cpp | 176 ExprAST *Start, *End, *Step, *Body;
179 ExprAST *step, ExprAST *body)
180 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
371 // The step value is optional.
372 ExprAST *Step = 0;
375 Step = ParseExpression();
376 if (Step == 0) return 0;
386 return new ForExprAST(IdName, Start, End, Step, Body);
1024 // step = stepexp
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 444 // First step. Check to see if there are any floating-point recurrences.
[all...] |
| LoopStrengthReduce.cpp | 562 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE,
564 if (!Step) return nullptr;
568 // FlagNW is independent of the start value, step direction, and is
571 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap);
[all...] |
| /external/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | 3205 static double step (double edge, double x) function in namespace:deqp::gls::BuiltinPrecisionTests::Functions
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | 565 IK_IntInduction, ///< Integer induction variable. Step = 1.
566 IK_ReverseIntInduction, ///< Reverse int induction variable. Step = -1.
567 IK_PtrInduction, ///< Pointer induction var. Step = sizeof(elem).
568 IK_ReversePtrInduction ///< Reverse ptr indvar. Step = - sizeof(elem).
[all...] |
| /prebuilts/tools/common/m2/repository/org/hamcrest/hamcrest-core/1.3/ |
| hamcrest-core-1.3.jar | |
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| jaxen-1.1.6.jar | |
| /prebuilts/tools/common/m2/repository/jaxen/jaxen/1.1.1/ |
| jaxen-1.1.1.jar | |
