OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/v8.h" | 5 #include "src/v8.h" |
6 #include "test/cctest/cctest.h" | 6 #include "test/cctest/cctest.h" |
7 | 7 |
8 #include "src/compiler/common-operator.h" | 8 #include "src/compiler/common-operator.h" |
9 #include "src/compiler/generic-node-inl.h" | 9 #include "src/compiler/generic-node-inl.h" |
10 #include "src/compiler/generic-node.h" | 10 #include "src/compiler/generic-node.h" |
(...skipping 1702 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1713 undef_node, // context | 1713 undef_node, // context |
1714 start_node, // effect | 1714 start_node, // effect |
1715 start_node); // control | 1715 start_node); // control |
1716 | 1716 |
1717 Node* cont_node = graph.NewNode(common.Continuation(), call_node); | 1717 Node* cont_node = graph.NewNode(common.Continuation(), call_node); |
1718 Node* lazy_deopt_node = graph.NewNode(common.LazyDeoptimization(), call_node); | 1718 Node* lazy_deopt_node = graph.NewNode(common.LazyDeoptimization(), call_node); |
1719 | 1719 |
1720 Node* parameters = graph.NewNode(common.StateValues(1), undef_node); | 1720 Node* parameters = graph.NewNode(common.StateValues(1), undef_node); |
1721 Node* locals = graph.NewNode(common.StateValues(0)); | 1721 Node* locals = graph.NewNode(common.StateValues(0)); |
1722 Node* stack = graph.NewNode(common.StateValues(0)); | 1722 Node* stack = graph.NewNode(common.StateValues(0)); |
| 1723 Node* context = undef_node; |
1723 | 1724 |
1724 Node* state_node = graph.NewNode(common.FrameState(BailoutId(1234)), | 1725 Node* state_node = graph.NewNode(common.FrameState(BailoutId(1234)), |
1725 parameters, locals, stack); | 1726 parameters, locals, stack, context); |
1726 | 1727 |
1727 Node* return_node = graph.NewNode(common.Return(), | 1728 Node* return_node = graph.NewNode(common.Return(), |
1728 undef_node, // return value | 1729 undef_node, // return value |
1729 call_node, // effect | 1730 call_node, // effect |
1730 cont_node); // control | 1731 cont_node); // control |
1731 Node* deoptimization_node = graph.NewNode(common.Deoptimize(), | 1732 Node* deoptimization_node = graph.NewNode(common.Deoptimize(), |
1732 state_node, // deopt environment | 1733 state_node, // deopt environment |
1733 call_node, // effect | 1734 call_node, // effect |
1734 lazy_deopt_node); // control | 1735 lazy_deopt_node); // control |
1735 | 1736 |
(...skipping 109 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1845 Node* d3 = CreateDiamond(&graph, &common, add); | 1846 Node* d3 = CreateDiamond(&graph, &common, add); |
1846 Node* ret = graph.NewNode(common.Return(), d3, start, start); | 1847 Node* ret = graph.NewNode(common.Return(), d3, start, start); |
1847 Node* end = graph.NewNode(common.End(), ret, start); | 1848 Node* end = graph.NewNode(common.End(), ret, start); |
1848 | 1849 |
1849 graph.SetEnd(end); | 1850 graph.SetEnd(end); |
1850 | 1851 |
1851 ComputeAndVerifySchedule(33, &graph); | 1852 ComputeAndVerifySchedule(33, &graph); |
1852 } | 1853 } |
1853 | 1854 |
1854 #endif | 1855 #endif |
OLD | NEW |