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/compiler/pipeline.h" | 5 #include "src/compiler/pipeline.h" |
6 #include "src/compiler/scheduler.h" | 6 #include "src/compiler/scheduler.h" |
7 #include "src/compiler/structured-machine-assembler.h" | 7 #include "src/compiler/structured-machine-assembler.h" |
8 | 8 |
9 namespace v8 { | 9 namespace v8 { |
10 namespace internal { | 10 namespace internal { |
11 namespace compiler { | 11 namespace compiler { |
12 | 12 |
13 Node* Variable::Get() const { return smasm_->GetVariable(offset_); } | 13 Node* Variable::Get() const { return smasm_->GetVariable(offset_); } |
14 | 14 |
15 | 15 |
16 void Variable::Set(Node* value) const { smasm_->SetVariable(offset_, value); } | 16 void Variable::Set(Node* value) const { smasm_->SetVariable(offset_, value); } |
17 | 17 |
18 | 18 |
19 StructuredMachineAssembler::StructuredMachineAssembler( | 19 StructuredMachineAssembler::StructuredMachineAssembler( |
20 Graph* graph, MachineCallDescriptorBuilder* call_descriptor_builder, | 20 Graph* graph, MachineCallDescriptorBuilder* call_descriptor_builder, |
21 MachineType word) | 21 MachineType word) |
22 : GraphBuilder(graph), | 22 : GraphBuilder(graph), |
23 schedule_(new (zone()) Schedule(zone())), | 23 schedule_(new (zone()) Schedule(zone())), |
24 machine_(zone(), word), | 24 machine_(zone(), word), |
25 common_(zone()), | 25 common_(zone()), |
26 call_descriptor_builder_(call_descriptor_builder), | 26 call_descriptor_builder_(call_descriptor_builder), |
27 parameters_(NULL), | 27 parameters_(NULL), |
28 current_environment_(new (zone()) | 28 current_environment_(new (zone()) |
29 Environment(zone(), schedule()->entry(), false)), | 29 Environment(zone(), schedule()->start(), false)), |
30 number_of_variables_(0) { | 30 number_of_variables_(0) { |
31 Node* s = graph->NewNode(common_.Start(parameter_count())); | 31 Node* s = graph->NewNode(common_.Start(parameter_count())); |
32 graph->SetStart(s); | 32 graph->SetStart(s); |
33 if (parameter_count() == 0) return; | 33 if (parameter_count() == 0) return; |
34 parameters_ = zone()->NewArray<Node*>(parameter_count()); | 34 parameters_ = zone()->NewArray<Node*>(parameter_count()); |
35 for (int i = 0; i < parameter_count(); ++i) { | 35 for (int i = 0; i < parameter_count(); ++i) { |
36 parameters_[i] = NewNode(common()->Parameter(i), graph->start()); | 36 parameters_[i] = NewNode(common()->Parameter(i), graph->start()); |
37 } | 37 } |
38 } | 38 } |
39 | 39 |
(...skipping 615 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
655 } | 655 } |
656 pending_header_merges_.clear(); | 656 pending_header_merges_.clear(); |
657 pending_exit_merges_.clear(); | 657 pending_exit_merges_.clear(); |
658 header_environment_ = NULL; | 658 header_environment_ = NULL; |
659 DCHECK(IsDone()); | 659 DCHECK(IsDone()); |
660 } | 660 } |
661 | 661 |
662 } // namespace compiler | 662 } // namespace compiler |
663 } // namespace internal | 663 } // namespace internal |
664 } // namespace v8 | 664 } // namespace v8 |
OLD | NEW |