| /external/v8/test/unittests/compiler/ |
| control-flow-optimizer-unittest.cc | 53 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
56 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1);
84 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
87 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1);
|
| branch-elimination-unittest.cc | 130 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
132 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
|
| loop-peeling-unittest.cc | 154 Node* if_true1 = ExpectPeeled(w.if_true, peeled); local
158 EXPECT_THAT(if_true1, IsIfTrue(br1));
161 EXPECT_THAT(w.loop, IsLoop(if_true1, w.if_true));
175 Node* if_true1 = ExpectPeeled(w.if_true, peeled); local
179 EXPECT_THAT(if_true1, IsIfTrue(br1));
181 EXPECT_THAT(w.loop, IsLoop(if_true1, w.if_true));
|
| js-intrinsic-lowering-unittest.cc | 432 Capture<Node*> branch0, if_false0, branch1, if_true1; local
439 CaptureEq(&if_true1)),
442 AllOf(CaptureEq(&if_true1), IsIfTrue(CaptureEq(&branch1))),
|
| /external/v8/test/cctest/compiler/ |
| test-osr.cc | 225 Node* if_true1 = T.graph.NewNode(T.common.IfTrue(), branch1); local
228 Node* branch2 = T.graph.NewNode(T.common.Branch(), T.p0, if_true1);
244 CheckInputs(branch2, T.p0, if_true1);
245 CheckInputs(if_true1, branch1);
263 Node* if_true1 = T.graph.NewNode(T.common.IfTrue(), branch1); local
266 Node* branch2 = T.graph.NewNode(T.common.Branch(), T.p0, if_true1);
283 CheckInputs(branch2, T.p0, if_true1);
284 CheckInputs(if_true1, branch1);
|
| test-loop-analysis.cc | 732 Node* if_true1 = t.graph.NewNode(t.common.IfTrue(), branch1); local
736 Node* loop2 = t.graph.NewNode(t.common.Loop(2), if_true1, t.start);
755 Node* body1[] = {cond1, branch1, if_true1, exit2, loop2,
808 Node* if_true1 = t.graph.NewNode(t.common.IfTrue(), branch1); local
812 Node* loop2 = t.graph.NewNode(t.common.Loop(2), if_true1, t.start);
864 Node* body1[] = {cond1, branch1, if_true1, exit2, loop2,
|
| /external/v8/src/compiler/ |
| change-lowering.cc | 340 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
342 effect, if_true1);
346 Node* branch2 = graph()->NewNode(common()->Branch(), check2, if_true1);
354 if_true1 = graph()->NewNode(merge_op, if_true2, if_false2);
355 vtrue1 = graph()->NewNode(phi_op, vtrue2, vfalse2, if_true1);
361 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1);
|
| simplified-lowering.cc | 1679 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
1756 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
1791 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
1867 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
[all...] |
| js-intrinsic-lowering.cc | 386 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
389 value, effect, if_true1);
396 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1);
|
| js-typed-lowering.cc | 918 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
1377 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2323 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2473 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
[all...] |
| js-generic-lowering.cc | 675 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
706 if_true0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
[all...] |
