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/code-factory.h" | 5 #include "src/code-factory.h" |
6 #include "src/compiler/pipeline.h" | 6 #include "src/compiler/pipeline.h" |
7 #include "src/compiler/raw-machine-assembler.h" | 7 #include "src/compiler/raw-machine-assembler.h" |
8 #include "src/compiler/scheduler.h" | 8 #include "src/compiler/scheduler.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
11 namespace internal { | 11 namespace internal { |
12 namespace compiler { | 12 namespace compiler { |
13 | 13 |
14 RawMachineAssembler::RawMachineAssembler(Graph* graph, | 14 RawMachineAssembler::RawMachineAssembler(Graph* graph, |
15 MachineSignature* machine_sig, | 15 MachineSignature* machine_sig, |
16 MachineType word) | 16 MachineType word, |
| 17 MachineOperatorBuilder::Flags flags) |
17 : GraphBuilder(graph), | 18 : GraphBuilder(graph), |
18 schedule_(new (zone()) Schedule(zone())), | 19 schedule_(new (zone()) Schedule(zone())), |
19 machine_(word), | 20 machine_(word, flags), |
20 common_(zone()), | 21 common_(zone()), |
21 machine_sig_(machine_sig), | 22 machine_sig_(machine_sig), |
22 call_descriptor_( | 23 call_descriptor_( |
23 Linkage::GetSimplifiedCDescriptor(graph->zone(), machine_sig)), | 24 Linkage::GetSimplifiedCDescriptor(graph->zone(), machine_sig)), |
24 parameters_(NULL), | 25 parameters_(NULL), |
25 exit_label_(schedule()->end()), | 26 exit_label_(schedule()->end()), |
26 current_block_(schedule()->start()) { | 27 current_block_(schedule()->start()) { |
27 int param_count = static_cast<int>(parameter_count()); | 28 int param_count = static_cast<int>(parameter_count()); |
28 Node* s = graph->NewNode(common_.Start(param_count)); | 29 Node* s = graph->NewNode(common_.Start(param_count)); |
29 graph->SetStart(s); | 30 graph->SetStart(s); |
(...skipping 127 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
157 Node* node = graph()->NewNode(op, input_count, inputs, incomplete); | 158 Node* node = graph()->NewNode(op, input_count, inputs, incomplete); |
158 BasicBlock* block = op->opcode() == IrOpcode::kParameter ? schedule()->start() | 159 BasicBlock* block = op->opcode() == IrOpcode::kParameter ? schedule()->start() |
159 : CurrentBlock(); | 160 : CurrentBlock(); |
160 schedule()->AddNode(block, node); | 161 schedule()->AddNode(block, node); |
161 return node; | 162 return node; |
162 } | 163 } |
163 | 164 |
164 } // namespace compiler | 165 } // namespace compiler |
165 } // namespace internal | 166 } // namespace internal |
166 } // namespace v8 | 167 } // namespace v8 |
OLD | NEW |