Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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/bytecode-graph-builder.h" | 5 #include "src/compiler/bytecode-graph-builder.h" |
| 6 | 6 |
| 7 #include "src/ast/ast.h" | 7 #include "src/ast/ast.h" |
| 8 #include "src/ast/scopes.h" | 8 #include "src/ast/scopes.h" |
| 9 #include "src/compilation-info.h" | 9 #include "src/compilation-info.h" |
| 10 #include "src/compiler/bytecode-branch-analysis.h" | 10 #include "src/compiler/bytecode-branch-analysis.h" |
| (...skipping 673 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 684 void BytecodeGraphBuilder::VisitLdaZero() { | 684 void BytecodeGraphBuilder::VisitLdaZero() { |
| 685 Node* node = jsgraph()->ZeroConstant(); | 685 Node* node = jsgraph()->ZeroConstant(); |
| 686 environment()->BindAccumulator(node); | 686 environment()->BindAccumulator(node); |
| 687 } | 687 } |
| 688 | 688 |
| 689 void BytecodeGraphBuilder::VisitLdaSmi() { | 689 void BytecodeGraphBuilder::VisitLdaSmi() { |
| 690 Node* node = jsgraph()->Constant(bytecode_iterator().GetImmediateOperand(0)); | 690 Node* node = jsgraph()->Constant(bytecode_iterator().GetImmediateOperand(0)); |
| 691 environment()->BindAccumulator(node); | 691 environment()->BindAccumulator(node); |
| 692 } | 692 } |
| 693 | 693 |
| 694 void BytecodeGraphBuilder::VisitLdaModuleVariable() { UNIMPLEMENTED(); } | |
| 695 void BytecodeGraphBuilder::VisitStaModuleVariable() { UNIMPLEMENTED(); } | |
|
rmcilroy
2016/11/03 13:58:06
Should these just call the runtime function for no
neis
2016/11/03 15:02:25
Good idea, just did that (and tested it manually).
| |
| 696 | |
| 694 void BytecodeGraphBuilder::VisitLdaConstant() { | 697 void BytecodeGraphBuilder::VisitLdaConstant() { |
| 695 Node* node = | 698 Node* node = |
| 696 jsgraph()->Constant(bytecode_iterator().GetConstantForIndexOperand(0)); | 699 jsgraph()->Constant(bytecode_iterator().GetConstantForIndexOperand(0)); |
| 697 environment()->BindAccumulator(node); | 700 environment()->BindAccumulator(node); |
| 698 } | 701 } |
| 699 | 702 |
| 700 void BytecodeGraphBuilder::VisitLdaUndefined() { | 703 void BytecodeGraphBuilder::VisitLdaUndefined() { |
| 701 Node* node = jsgraph()->UndefinedConstant(); | 704 Node* node = jsgraph()->UndefinedConstant(); |
| 702 environment()->BindAccumulator(node); | 705 environment()->BindAccumulator(node); |
| 703 } | 706 } |
| (...skipping 1529 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2233 source_positions_->set_current_position(it->source_position()); | 2236 source_positions_->set_current_position(it->source_position()); |
| 2234 it->Advance(); | 2237 it->Advance(); |
| 2235 } else { | 2238 } else { |
| 2236 DCHECK_GT(it->code_offset(), offset); | 2239 DCHECK_GT(it->code_offset(), offset); |
| 2237 } | 2240 } |
| 2238 } | 2241 } |
| 2239 | 2242 |
| 2240 } // namespace compiler | 2243 } // namespace compiler |
| 2241 } // namespace internal | 2244 } // namespace internal |
| 2242 } // namespace v8 | 2245 } // namespace v8 |
| OLD | NEW |