| /external/chromium_org/v8/test/mjsunit/ |
| debug-stepin-positions.js | 40 var step = 0;
46 if (step++ > 0) return;
133 // Step in position, when the function call that we are standing at is already
148 // Step in position, when the function call that we are standing at is raising
164 // Step-in position, when already paused almost on the first call site.
176 // Step-in position, when already paused on the first call site.
|
| /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...] |
| /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/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/chromium_org/chrome/browser/history/ |
| download_database.cc | 335 bool result = select_max_id.Step();
370 while (statement_main.Step()) {
433 while (statement_chain.Step()) {
606 if (count_urls.Step()) {
667 statement.Step();
|
| history_backend_android.cc | 107 if (!statement->statement()->Step())
|
| top_sites_database.cc | 180 while (select_statement.Step()) {
454 while (statement.Step()) {
661 if (!statement.Step())
681 if (select_statement.Step())
|
| /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...] |
| /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/Events/ |
| SingleStepTest.java | 95 * breakpointTest method, sends a request for single step event, then
135 setRequestCommand.setNextValueAsByte(EventMod.ModKind.Step);
|
| /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/MultiSession/ |
| SingleStepTest.java | 102 setRequestCommand.setNextValueAsByte(EventMod.ModKind.Step);
|
| /external/chromium_org/ash/wm/ |
| window_cycle_list.cc | 131 void WindowCycleList::Step(WindowCycleController::Direction direction) {
146 // We're in a valid cycle, so step forward or backward.
|
| /external/chromium_org/chrome/browser/chromeos/first_run/ |
| first_run_controller.cc | 188 first_run::Step* FirstRunController::GetCurrentStep() const {
|
| /external/chromium_org/chrome/browser/extensions/activity_log/ |
| database_string_table_unittest.cc | 49 ASSERT_TRUE(query.Step());
|
| /external/chromium_org/content/browser/ |
| databases_table_unittest.cc | 32 return (statement.is_valid() && statement.Step() && !statement.ColumnInt(0));
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| task.cc | 86 void Task::Step() {
|
| taskrunner.cc | 92 tasks_[i]->Step();
|
| /external/chromium_org/third_party/webrtc/base/ |
| task.cc | 69 void Task::Step() {
|
| taskrunner.cc | 75 tasks_[i]->Step();
|
| /external/chromium_org/ui/compositor/ |
| layer_animator.h | 190 void Step(base::TimeTicks time_now);
|
| /external/chromium_org/v8/src/ |
| incremental-marking.h | 94 void Step(intptr_t allocated, CompletionAction action);
|
| /external/chromium_org/v8/tools/push-to-trunk/ |
| common_includes.py | 223 class Step(GitRecipesMixin):
238 # Convenience method to allow direct [] access on step classes for
243 # Convenience method to allow direct [] access on step classes for
256 # Skip step if requirement is not met.
260 print ">>> Step %d: %s" % (self._number, self._text)
450 class UploadStep(Step):
464 class DetermineV8Sheriff(Step):
498 def MakeStep(step_class=Step, number=0, state=None, config=None,
550 parser.add_argument("-s", "--step",
551 help="Specify the step where to start work. Default: 0."
[all...] |
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| debug-stepin-collections-foreach.js | 21 assertTrue(event_data.sourceLineText().indexOf("Expected to step") > 0);
31 print("element " + num); // Expected to step to this point.
36 print("key " + key + ", value " + val); // Expected to step to this point.
82 assertTrue(event_data.sourceLineText().indexOf("Expected to step") > 0);
83 // Step two steps further every four breaks to skip the
85 var step = (breaks % 4 == 1) ? 6 : 3;
86 exec_state.prepareStep(Debug.StepAction.StepIn, step);
|
