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/code-generator.h" | 8 #include "src/compiler/code-generator.h" |
9 #include "src/compiler/common-operator.h" | 9 #include "src/compiler/common-operator.h" |
10 #include "src/compiler/graph.h" | 10 #include "src/compiler/graph.h" |
(...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
49 Zone* zone() { return main_zone(); } | 49 Zone* zone() { return main_zone(); } |
50 | 50 |
51 void allocCode() { | 51 void allocCode() { |
52 if (schedule.rpo_order()->size() == 0) { | 52 if (schedule.rpo_order()->size() == 0) { |
53 // Compute the RPO order. | 53 // Compute the RPO order. |
54 ZonePool zone_pool(isolate); | 54 ZonePool zone_pool(isolate); |
55 Scheduler::ComputeSpecialRPO(&zone_pool, &schedule); | 55 Scheduler::ComputeSpecialRPO(&zone_pool, &schedule); |
56 DCHECK(schedule.rpo_order()->size() > 0); | 56 DCHECK(schedule.rpo_order()->size() > 0); |
57 } | 57 } |
58 InstructionBlocks* instruction_blocks = | 58 InstructionBlocks* instruction_blocks = |
59 InstructionSequence::InstructionBlocksFor(main_zone(), &schedule); | 59 TestInstrSeq::InstructionBlocksFor(main_zone(), &schedule); |
60 code = new TestInstrSeq(main_zone(), instruction_blocks); | 60 code = new TestInstrSeq(main_zone(), instruction_blocks); |
61 } | 61 } |
62 | 62 |
63 Node* Int32Constant(int32_t val) { | 63 Node* Int32Constant(int32_t val) { |
64 Node* node = graph.NewNode(common.Int32Constant(val)); | 64 Node* node = graph.NewNode(common.Int32Constant(val)); |
65 schedule.AddNode(schedule.start(), node); | 65 schedule.AddNode(schedule.start(), node); |
66 return node; | 66 return node; |
67 } | 67 } |
68 | 68 |
69 Node* Float64Constant(double val) { | 69 Node* Float64Constant(double val) { |
(...skipping 288 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
358 CHECK_EQ(inputs[z], m->InputAt(z)); | 358 CHECK_EQ(inputs[z], m->InputAt(z)); |
359 } | 359 } |
360 | 360 |
361 for (size_t z = 0; z < k; z++) { | 361 for (size_t z = 0; z < k; z++) { |
362 CHECK_EQ(temps[z], m->TempAt(z)); | 362 CHECK_EQ(temps[z], m->TempAt(z)); |
363 } | 363 } |
364 } | 364 } |
365 } | 365 } |
366 } | 366 } |
367 } | 367 } |
OLD | NEW |