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/compiler/linkage.h" | 7 #include "src/compiler/linkage.h" |
8 #include "src/compiler/operator-properties.h" | 8 #include "src/compiler/operator-properties.h" |
9 #include "src/interpreter/bytecode-array-iterator.h" | 9 #include "src/interpreter/bytecode-array-iterator.h" |
10 | 10 |
(...skipping 170 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
181 | 181 |
182 void BytecodeGraphBuilder::VisitLdaZero( | 182 void BytecodeGraphBuilder::VisitLdaZero( |
183 const interpreter::BytecodeArrayIterator& iterator) { | 183 const interpreter::BytecodeArrayIterator& iterator) { |
184 Node* node = jsgraph()->ZeroConstant(); | 184 Node* node = jsgraph()->ZeroConstant(); |
185 environment()->BindAccumulator(node); | 185 environment()->BindAccumulator(node); |
186 } | 186 } |
187 | 187 |
188 | 188 |
189 void BytecodeGraphBuilder::VisitLdaSmi8( | 189 void BytecodeGraphBuilder::VisitLdaSmi8( |
190 const interpreter::BytecodeArrayIterator& iterator) { | 190 const interpreter::BytecodeArrayIterator& iterator) { |
191 Node* node = jsgraph()->Constant(iterator.GetSmi8Operand(0)); | 191 Node* node = jsgraph()->Constant(iterator.GetImmediateOperand(0)); |
192 environment()->BindAccumulator(node); | 192 environment()->BindAccumulator(node); |
193 } | 193 } |
194 | 194 |
195 | 195 |
196 void BytecodeGraphBuilder::VisitLdaConstant( | 196 void BytecodeGraphBuilder::VisitLdaConstant( |
197 const interpreter::BytecodeArrayIterator& iterator) { | 197 const interpreter::BytecodeArrayIterator& iterator) { |
198 Node* node = jsgraph()->Constant(iterator.GetConstantForIndexOperand(0)); | 198 Node* node = jsgraph()->Constant(iterator.GetConstantForIndexOperand(0)); |
199 environment()->BindAccumulator(node); | 199 environment()->BindAccumulator(node); |
200 } | 200 } |
201 | 201 |
(...skipping 336 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
538 | 538 |
539 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 539 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
540 if (environment()->IsMarkedAsUnreachable()) return; | 540 if (environment()->IsMarkedAsUnreachable()) return; |
541 environment()->MarkAsUnreachable(); | 541 environment()->MarkAsUnreachable(); |
542 exit_controls_.push_back(exit); | 542 exit_controls_.push_back(exit); |
543 } | 543 } |
544 | 544 |
545 } // namespace compiler | 545 } // namespace compiler |
546 } // namespace internal | 546 } // namespace internal |
547 } // namespace v8 | 547 } // namespace v8 |
OLD | NEW |