| 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/graph-inl.h" | 8 #include "src/compiler/graph-inl.h" |
| 9 #include "src/compiler/js-typed-lowering.h" | 9 #include "src/compiler/js-typed-lowering.h" |
| 10 #include "src/compiler/node-properties-inl.h" | 10 #include "src/compiler/node-properties-inl.h" |
| (...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 42 Typer typer; | 42 Typer typer; |
| 43 Node* context_node; | 43 Node* context_node; |
| 44 | 44 |
| 45 Node* Parameter(Type* t, int32_t index = 0) { | 45 Node* Parameter(Type* t, int32_t index = 0) { |
| 46 Node* n = graph.NewNode(common.Parameter(index), graph.start()); | 46 Node* n = graph.NewNode(common.Parameter(index), graph.start()); |
| 47 NodeProperties::SetBounds(n, Bounds(Type::None(), t)); | 47 NodeProperties::SetBounds(n, Bounds(Type::None(), t)); |
| 48 return n; | 48 return n; |
| 49 } | 49 } |
| 50 | 50 |
| 51 Node* reduce(Node* node) { | 51 Node* reduce(Node* node) { |
| 52 JSGraph jsgraph(&graph, &common, &typer); | 52 JSGraph jsgraph(&graph, &common, &javascript, &typer, &machine); |
| 53 JSTypedLowering reducer(&jsgraph); | 53 JSTypedLowering reducer(&jsgraph); |
| 54 Reduction reduction = reducer.Reduce(node); | 54 Reduction reduction = reducer.Reduce(node); |
| 55 if (reduction.Changed()) return reduction.replacement(); | 55 if (reduction.Changed()) return reduction.replacement(); |
| 56 return node; | 56 return node; |
| 57 } | 57 } |
| 58 | 58 |
| 59 Node* start() { return graph.start(); } | 59 Node* start() { return graph.start(); } |
| 60 | 60 |
| 61 Node* context() { | 61 Node* context() { |
| 62 if (context_node == NULL) { | 62 if (context_node == NULL) { |
| (...skipping 1280 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1343 CHECK_EQ(p1, r->InputAt(0)); | 1343 CHECK_EQ(p1, r->InputAt(0)); |
| 1344 CHECK_EQ(p0, r->InputAt(1)); | 1344 CHECK_EQ(p0, r->InputAt(1)); |
| 1345 } else { | 1345 } else { |
| 1346 CHECK_EQ(p0, r->InputAt(0)); | 1346 CHECK_EQ(p0, r->InputAt(0)); |
| 1347 CHECK_EQ(p1, r->InputAt(1)); | 1347 CHECK_EQ(p1, r->InputAt(1)); |
| 1348 } | 1348 } |
| 1349 } | 1349 } |
| 1350 } | 1350 } |
| 1351 } | 1351 } |
| 1352 } | 1352 } |
| OLD | NEW |