HomeSort by relevance Sort by last modified time
    Searched refs:if_false1 (Results 1 - 10 of 10) 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);
effect-control-linearizer-unittest.cc 198 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
199 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
235 schedule.AddNode(f1block, 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/src/compiler/
simplified-lowering.cc 2231 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2308 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2472 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2499 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2598 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2625 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2736 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2763 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2866 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2943 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
2978 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
3054 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
    [all...]
effect-control-linearizer.cc 1376 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
1564 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
1624 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
    [all...]
js-intrinsic-lowering.cc 273 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
277 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1);
js-typed-lowering.cc 1008 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
1442 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); local
    [all...]
wasm-compiler.cc 2170 Node* if_false1 = graph()->NewNode(common->IfFalse(), branch1); local
    [all...]
  /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);

Completed in 265 milliseconds