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