Searched refs:if_true2 (Results 1 - 5 of 5) sorted by relevance
/external/v8/test/cctest/compiler/ |
H A D | test-osr.cc | 229 Node* if_true2 = T.graph.NewNode(T.common.IfTrue(), branch2); local 231 loop->ReplaceInput(2, if_true2); 242 CheckInputs(loop, T.start, if_true2); 247 CheckInputs(if_true2, branch2); 267 Node* if_true2 = T.graph.NewNode(T.common.IfTrue(), branch2); local 270 loop->ReplaceInput(3, if_true2); 281 CheckInputs(loop, T.start, if_false1, if_true2); 286 CheckInputs(if_true2, branch2);
|
H A D | test-loop-analysis.cc | 741 Node* if_true2 = t.graph.NewNode(t.common.IfTrue(), branch2); local 743 loop2->ReplaceInput(1, if_true2); 756 phi2, cond2, branch2, if_true2}; 760 Node* body2[] = {cond2, branch2, if_true2}; 817 Node* if_true2 = t.graph.NewNode(t.common.IfTrue(), branch2); local 821 Node* loop3 = t.graph.NewNode(t.common.Loop(2), if_true2, t.start); 865 phi2, cond2, branch2, if_true2, exit3, 870 Node* body2[] = {cond2, branch2, if_true2, exit3, loop3,
|
/external/v8/test/unittests/compiler/ |
H A D | branch-elimination-unittest.cc | 138 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); local 140 Node* merge2 = graph()->NewNode(common()->Merge(2), if_true2, if_false2);
|
/external/v8/src/compiler/ |
H A D | change-lowering.cc | 348 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); local 349 Node* vtrue2 = LoadHeapNumberValue(vtrue1, if_true2); 354 if_true1 = graph()->NewNode(merge_op, if_true2, if_false2);
|
H A D | simplified-lowering.cc | 1688 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); local 1694 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2); 1766 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2); local 1776 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2);
|
Completed in 57 milliseconds