| /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);
|
| js-intrinsic-lowering-unittest.cc | 231 Capture<Node*> branch0, if_false0, branch1, if_true1; local
238 CaptureEq(&if_true1)),
241 AllOf(CaptureEq(&if_true1), IsIfTrue(CaptureEq(&branch1))),
|
| effect-control-linearizer-unittest.cc | 197 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
199 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
232 schedule.AddNode(t1block, if_true1);
|
| 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));
|
| /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/ |
| simplified-lowering.cc | 2222 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2303 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2469 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2496 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2595 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2622 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2733 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2760 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2863 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2940 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
2975 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
3051 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
[all...] |
| effect-control-linearizer.cc | 1343 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
1560 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
1616 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
[all...] |
| js-intrinsic-lowering.cc | 267 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
270 value, effect, if_true1);
277 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1);
|
| wasm-compiler.cc | 2153 Node* if_true1 = graph()->NewNode(common->IfTrue(), branch1); local
[all...] |
| js-typed-lowering.cc | 1005 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
1441 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); local
[all...] |
