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 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
45 Linkage linkage; | 45 Linkage linkage; |
46 CommonOperatorBuilder common; | 46 CommonOperatorBuilder common; |
47 MachineOperatorBuilder machine; | 47 MachineOperatorBuilder machine; |
48 TestInstrSeq* code; | 48 TestInstrSeq* code; |
49 | 49 |
50 Zone* zone() { return main_zone(); } | 50 Zone* zone() { return main_zone(); } |
51 | 51 |
52 void allocCode() { | 52 void allocCode() { |
53 if (schedule.rpo_order()->size() == 0) { | 53 if (schedule.rpo_order()->size() == 0) { |
54 // Compute the RPO order. | 54 // Compute the RPO order. |
55 ZonePool zone_pool(isolate); | 55 Scheduler::ComputeSpecialRPO(main_zone(), &schedule); |
56 Scheduler::ComputeSpecialRPO(&zone_pool, &schedule); | |
57 DCHECK(schedule.rpo_order()->size() > 0); | 56 DCHECK(schedule.rpo_order()->size() > 0); |
58 } | 57 } |
59 InstructionBlocks* instruction_blocks = | 58 InstructionBlocks* instruction_blocks = |
60 TestInstrSeq::InstructionBlocksFor(main_zone(), &schedule); | 59 TestInstrSeq::InstructionBlocksFor(main_zone(), &schedule); |
61 code = new TestInstrSeq(main_zone(), instruction_blocks); | 60 code = new TestInstrSeq(main_zone(), instruction_blocks); |
62 } | 61 } |
63 | 62 |
64 Node* Int32Constant(int32_t val) { | 63 Node* Int32Constant(int32_t val) { |
65 Node* node = graph.NewNode(common.Int32Constant(val)); | 64 Node* node = graph.NewNode(common.Int32Constant(val)); |
66 schedule.AddNode(schedule.start(), node); | 65 schedule.AddNode(schedule.start(), node); |
(...skipping 292 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
359 CHECK_EQ(inputs[z], m->InputAt(z)); | 358 CHECK_EQ(inputs[z], m->InputAt(z)); |
360 } | 359 } |
361 | 360 |
362 for (size_t z = 0; z < k; z++) { | 361 for (size_t z = 0; z < k; z++) { |
363 CHECK_EQ(temps[z], m->TempAt(z)); | 362 CHECK_EQ(temps[z], m->TempAt(z)); |
364 } | 363 } |
365 } | 364 } |
366 } | 365 } |
367 } | 366 } |
368 } | 367 } |
OLD | NEW |