| 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/raw-machine-assembler.h" | 5 #include "src/compiler/raw-machine-assembler.h" |
| 6 | 6 |
| 7 #include "src/code-factory.h" | 7 #include "src/code-factory.h" |
| 8 #include "src/compiler/node-properties.h" | 8 #include "src/compiler/node-properties.h" |
| 9 #include "src/compiler/pipeline.h" | 9 #include "src/compiler/pipeline.h" |
| 10 #include "src/compiler/scheduler.h" | 10 #include "src/compiler/scheduler.h" |
| (...skipping 17 matching lines...) Expand all Loading... |
| 28 int param_count = static_cast<int>(parameter_count()); | 28 int param_count = static_cast<int>(parameter_count()); |
| 29 // Add an extra input for the JSFunction parameter to the start node. | 29 // Add an extra input for the JSFunction parameter to the start node. |
| 30 graph->SetStart(graph->NewNode(common_.Start(param_count + 1))); | 30 graph->SetStart(graph->NewNode(common_.Start(param_count + 1))); |
| 31 for (size_t i = 0; i < parameter_count(); ++i) { | 31 for (size_t i = 0; i < parameter_count(); ++i) { |
| 32 parameters_[i] = | 32 parameters_[i] = |
| 33 AddNode(common()->Parameter(static_cast<int>(i)), graph->start()); | 33 AddNode(common()->Parameter(static_cast<int>(i)), graph->start()); |
| 34 } | 34 } |
| 35 graph->SetEnd(graph->NewNode(common_.End(0))); | 35 graph->SetEnd(graph->NewNode(common_.End(0))); |
| 36 } | 36 } |
| 37 | 37 |
| 38 Node* RawMachineAssembler::RelocatableIntPtrConstant(intptr_t value, | |
| 39 RelocInfo::Mode rmode) { | |
| 40 return kPointerSize == 8 | |
| 41 ? RelocatableInt64Constant(value, rmode) | |
| 42 : RelocatableInt32Constant(static_cast<int>(value), rmode); | |
| 43 } | |
| 44 | 38 |
| 45 Schedule* RawMachineAssembler::Export() { | 39 Schedule* RawMachineAssembler::Export() { |
| 46 // Compute the correct codegen order. | 40 // Compute the correct codegen order. |
| 47 DCHECK(schedule_->rpo_order()->empty()); | 41 DCHECK(schedule_->rpo_order()->empty()); |
| 48 OFStream os(stdout); | 42 OFStream os(stdout); |
| 49 if (FLAG_trace_turbo_scheduler) { | 43 if (FLAG_trace_turbo_scheduler) { |
| 50 PrintF("--- RAW SCHEDULE -------------------------------------------\n"); | 44 PrintF("--- RAW SCHEDULE -------------------------------------------\n"); |
| 51 os << *schedule_; | 45 os << *schedule_; |
| 52 } | 46 } |
| 53 schedule_->EnsureSplitEdgeForm(); | 47 schedule_->EnsureSplitEdgeForm(); |
| (...skipping 444 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 498 // The raw machine assembler nodes do not have effect and control inputs, | 492 // The raw machine assembler nodes do not have effect and control inputs, |
| 499 // so we disable checking input counts here. | 493 // so we disable checking input counts here. |
| 500 return graph()->NewNodeUnchecked(op, input_count, inputs); | 494 return graph()->NewNodeUnchecked(op, input_count, inputs); |
| 501 } | 495 } |
| 502 | 496 |
| 503 RawMachineLabel::~RawMachineLabel() { DCHECK(bound_ || !used_); } | 497 RawMachineLabel::~RawMachineLabel() { DCHECK(bound_ || !used_); } |
| 504 | 498 |
| 505 } // namespace compiler | 499 } // namespace compiler |
| 506 } // namespace internal | 500 } // namespace internal |
| 507 } // namespace v8 | 501 } // namespace v8 |
| OLD | NEW |