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 | 6 |
7 #include "graph-tester.h" | 7 #include "graph-tester.h" |
| 8 #include "src/compiler/generic-node-inl.h" |
8 #include "src/compiler/graph-reducer.h" | 9 #include "src/compiler/graph-reducer.h" |
9 | 10 |
10 using namespace v8::internal; | 11 using namespace v8::internal; |
11 using namespace v8::internal::compiler; | 12 using namespace v8::internal::compiler; |
12 | 13 |
13 const uint8_t OPCODE_A0 = 10; | 14 const uint8_t OPCODE_A0 = 10; |
14 const uint8_t OPCODE_A1 = 11; | 15 const uint8_t OPCODE_A1 = 11; |
15 const uint8_t OPCODE_A2 = 12; | 16 const uint8_t OPCODE_A2 = 12; |
16 const uint8_t OPCODE_B0 = 20; | 17 const uint8_t OPCODE_B0 = 20; |
17 const uint8_t OPCODE_B1 = 21; | 18 const uint8_t OPCODE_B1 = 21; |
(...skipping 595 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
613 for (int i = 0; i < 3; i++) { | 614 for (int i = 0; i < 3; i++) { |
614 int before = graph.NodeCount(); | 615 int before = graph.NodeCount(); |
615 reducer.ReduceGraph(); | 616 reducer.ReduceGraph(); |
616 CHECK_EQ(before, graph.NodeCount()); | 617 CHECK_EQ(before, graph.NodeCount()); |
617 CHECK_EQ(&OPC0, n1->op()); | 618 CHECK_EQ(&OPC0, n1->op()); |
618 CHECK_EQ(&OPC1, end->op()); | 619 CHECK_EQ(&OPC1, end->op()); |
619 CHECK_EQ(n1, end->InputAt(0)); | 620 CHECK_EQ(n1, end->InputAt(0)); |
620 } | 621 } |
621 } | 622 } |
622 } | 623 } |
OLD | NEW |