| 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 231 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 242 } | 242 } |
| 243 | 243 |
| 244 | 244 |
| 245 void BytecodeGraphBuilder::VisitStar( | 245 void BytecodeGraphBuilder::VisitStar( |
| 246 const interpreter::BytecodeArrayIterator& iterator) { | 246 const interpreter::BytecodeArrayIterator& iterator) { |
| 247 Node* value = environment()->LookupAccumulator(); | 247 Node* value = environment()->LookupAccumulator(); |
| 248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); | 248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); |
| 249 } | 249 } |
| 250 | 250 |
| 251 | 251 |
| 252 void BytecodeGraphBuilder::VisitLdaGlobal( | 252 void BytecodeGraphBuilder::VisitLdaGlobalSloppy( |
| 253 const interpreter::BytecodeArrayIterator& iterator) { | 253 const interpreter::BytecodeArrayIterator& iterator) { |
| 254 UNIMPLEMENTED(); | 254 UNIMPLEMENTED(); |
| 255 } | 255 } |
| 256 |
| 257 |
| 258 void BytecodeGraphBuilder::VisitLdaGlobalStrict( |
| 259 const interpreter::BytecodeArrayIterator& iterator) { |
| 260 UNIMPLEMENTED(); |
| 261 } |
| 256 | 262 |
| 257 | 263 |
| 258 void BytecodeGraphBuilder::VisitStaGlobalSloppy( | 264 void BytecodeGraphBuilder::VisitStaGlobalSloppy( |
| 259 const interpreter::BytecodeArrayIterator& iterator) { | 265 const interpreter::BytecodeArrayIterator& iterator) { |
| 260 UNIMPLEMENTED(); | 266 UNIMPLEMENTED(); |
| 261 } | 267 } |
| 262 | 268 |
| 263 | 269 |
| 264 void BytecodeGraphBuilder::VisitStaGlobalStrict( | 270 void BytecodeGraphBuilder::VisitStaGlobalStrict( |
| 265 const interpreter::BytecodeArrayIterator& iterator) { | 271 const interpreter::BytecodeArrayIterator& iterator) { |
| (...skipping 452 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 718 | 724 |
| 719 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 725 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 720 if (environment()->IsMarkedAsUnreachable()) return; | 726 if (environment()->IsMarkedAsUnreachable()) return; |
| 721 environment()->MarkAsUnreachable(); | 727 environment()->MarkAsUnreachable(); |
| 722 exit_controls_.push_back(exit); | 728 exit_controls_.push_back(exit); |
| 723 } | 729 } |
| 724 | 730 |
| 725 } // namespace compiler | 731 } // namespace compiler |
| 726 } // namespace internal | 732 } // namespace internal |
| 727 } // namespace v8 | 733 } // namespace v8 |
| OLD | NEW |