HomeSort by relevance Sort by last modified time
    Searched refs:if_false1 (Results 1 - 9 of 9) sorted by null

  /external/v8/test/unittests/compiler/
control-flow-optimizer-unittest.cc 54 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
56 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1);
85 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
87 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1);
branch-elimination-unittest.cc 131 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
132 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
loop-peeling-unittest.cc 155 Node* if_false1 = ExpectPeeled(w.exit, peeled); local
159 EXPECT_THAT(if_false1, IsIfFalse(br1));
162 EXPECT_THAT(r, IsReturn(p0, start(), IsMerge(w.exit, if_false1)));
176 Node* if_false1 = ExpectPeeled(w.exit, peeled); local
180 EXPECT_THAT(if_false1, IsIfFalse(br1));
188 AllOf(CaptureEq(&merge), IsMerge(w.exit, if_false1))),
  /external/v8/test/cctest/compiler/
test-osr.cc 226 Node* if_false1 = T.graph.NewNode(T.common.IfFalse(), branch1); local
236 Node* merge = T.graph.NewNode(T.common.Merge(2), if_false1, if_false2);
246 CheckInputs(if_false1, branch1);
252 CheckInputs(merge, if_false1, if_false2);
264 Node* if_false1 = T.graph.NewNode(T.common.IfFalse(), branch1); local
269 loop->ReplaceInput(2, if_false1);
281 CheckInputs(loop, T.start, if_false1, if_true2);
285 CheckInputs(if_false1, branch1);
  /external/v8/src/compiler/
simplified-lowering.cc 1682 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
1759 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
1794 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
1870 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
    [all...]
js-generic-lowering.cc 685 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
693 etrue0, if_false1);
698 efalse1, if_false1);
703 efalse1, if_false1);
706 if_true0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
    [all...]
js-typed-lowering.cc 921 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
1378 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2333 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2482 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
    [all...]
change-lowering.cc 357 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
361 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1);
js-intrinsic-lowering.cc 392 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
396 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1);

Completed in 522 milliseconds