| 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 297 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 308 UNIMPLEMENTED(); | 308 UNIMPLEMENTED(); |
| 309 } | 309 } |
| 310 | 310 |
| 311 | 311 |
| 312 void BytecodeGraphBuilder::VisitKeyedStoreICStrict( | 312 void BytecodeGraphBuilder::VisitKeyedStoreICStrict( |
| 313 const interpreter::BytecodeArrayIterator& iterator) { | 313 const interpreter::BytecodeArrayIterator& iterator) { |
| 314 UNIMPLEMENTED(); | 314 UNIMPLEMENTED(); |
| 315 } | 315 } |
| 316 | 316 |
| 317 | 317 |
| 318 void BytecodeGraphBuilder::VisitKeyedStoreICGeneric( | |
| 319 const interpreter::BytecodeArrayIterator& iterator) { | |
| 320 UNIMPLEMENTED(); | |
| 321 } | |
| 322 | |
| 323 | |
| 324 void BytecodeGraphBuilder::VisitPushContext( | 318 void BytecodeGraphBuilder::VisitPushContext( |
| 325 const interpreter::BytecodeArrayIterator& iterator) { | 319 const interpreter::BytecodeArrayIterator& iterator) { |
| 326 UNIMPLEMENTED(); | 320 UNIMPLEMENTED(); |
| 327 } | 321 } |
| 328 | 322 |
| 329 | 323 |
| 330 void BytecodeGraphBuilder::VisitPopContext( | 324 void BytecodeGraphBuilder::VisitPopContext( |
| 331 const interpreter::BytecodeArrayIterator& iterator) { | 325 const interpreter::BytecodeArrayIterator& iterator) { |
| 332 UNIMPLEMENTED(); | 326 UNIMPLEMENTED(); |
| 333 } | 327 } |
| (...skipping 336 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 670 | 664 |
| 671 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 665 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 672 if (environment()->IsMarkedAsUnreachable()) return; | 666 if (environment()->IsMarkedAsUnreachable()) return; |
| 673 environment()->MarkAsUnreachable(); | 667 environment()->MarkAsUnreachable(); |
| 674 exit_controls_.push_back(exit); | 668 exit_controls_.push_back(exit); |
| 675 } | 669 } |
| 676 | 670 |
| 677 } // namespace compiler | 671 } // namespace compiler |
| 678 } // namespace internal | 672 } // namespace internal |
| 679 } // namespace v8 | 673 } // namespace v8 |
| OLD | NEW |