| /external/v8/src/compiler/ |
| H A D | control-flow-optimizer.cc | 167 Node* branch1 = graph()->NewNode(common()->Branch(hint), cond1, control1); local
168 merge_true_inputs[index] = graph()->NewNode(common()->IfTrue(), branch1);
169 merge_false_inputs[index] = graph()->NewNode(common()->IfFalse(), branch1);
170 Enqueue(branch1);
231 Node* branch1 = *it++; local
232 if (branch1->opcode() != IrOpcode::kBranch) break;
233 if (BranchHintOf(branch1->op()) != BranchHint::kNone) break;
235 Node* cond1 = branch1->InputAt(0);
252 branch = branch1;
|
| H A D | simplified-lowering.cc | 1677 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0); local
1679 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
1682 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
1754 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_true0); local
1756 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
1759 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
1788 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), local
1791 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
1794 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
1865 Node* branch1 local
[all...] |
| H A D | change-lowering.cc | 337 Node* branch1 = local
340 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
357 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
|
| H A D | js-intrinsic-lowering.cc | 384 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0); local
386 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
392 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
|
| H A D | js-typed-lowering.cc | 916 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue), local
918 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
921 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
1375 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kFalse), local
1377 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
1378 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
2320 Node* branch1 = local
2323 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
2333 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
2470 Node* branch1 local
[all...] |
| H A D | js-generic-lowering.cc | 672 Node* branch1 = local
675 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
685 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
|
| /external/v8/test/unittests/compiler/ |
| H A D | control-flow-optimizer-unittest.cc | 49 Node* branch1 = graph()->NewNode( local
53 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
54 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
80 Node* branch1 = graph()->NewNode( local
84 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
85 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
|
| H A D | branch-elimination-unittest.cc | 128 Node* branch1 = local
130 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
131 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
155 EXPECT_THAT(branch1, IsBranch(condition, graph()->start()));
|
| H A D | js-intrinsic-lowering-unittest.cc | 432 Capture<Node*> branch0, if_false0, branch1, if_true1; local
442 AllOf(CaptureEq(&if_true1), IsIfTrue(CaptureEq(&branch1))),
444 CaptureEq(&branch1),
|
| H A D | node-matchers-unittest.cc | 937 Node* branch1 = local
941 Node* if_true = graph()->NewNode(common()->IfTrue(), branch1);
|
| /external/v8/test/cctest/compiler/ |
| H A D | test-osr.cc | 224 Node* branch1 = T.graph.NewNode(T.common.Branch(), T.p0, loop); local
225 Node* if_true1 = T.graph.NewNode(T.common.IfTrue(), branch1);
226 Node* if_false1 = T.graph.NewNode(T.common.IfFalse(), branch1);
243 CheckInputs(branch1, T.p0, loop);
245 CheckInputs(if_true1, branch1);
246 CheckInputs(if_false1, branch1);
262 Node* branch1 = T.graph.NewNode(T.common.Branch(), T.p0, loop); local
263 Node* if_true1 = T.graph.NewNode(T.common.IfTrue(), branch1);
264 Node* if_false1 = T.graph.NewNode(T.common.IfFalse(), branch1);
282 CheckInputs(branch1,
[all...] |
| H A D | test-loop-analysis.cc | 731 Node* branch1 = t.graph.NewNode(t.common.Branch(), cond1, loop1); local
732 Node* if_true1 = t.graph.NewNode(t.common.IfTrue(), branch1);
733 Node* exit1 = t.graph.NewNode(t.common.IfFalse(), branch1);
755 Node* body1[] = {cond1, branch1, if_true1, exit2, loop2,
807 Node* branch1 = t.graph.NewNode(t.common.Branch(), cond1, loop1); local
808 Node* if_true1 = t.graph.NewNode(t.common.IfTrue(), branch1);
809 Node* exit1 = t.graph.NewNode(t.common.IfFalse(), branch1);
864 Node* body1[] = {cond1, branch1, if_true1, exit2, loop2,
|