| 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 458 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 469 UNIMPLEMENTED(); | 469 UNIMPLEMENTED(); |
| 470 } | 470 } |
| 471 | 471 |
| 472 | 472 |
| 473 void BytecodeGraphBuilder::VisitTypeOf( | 473 void BytecodeGraphBuilder::VisitTypeOf( |
| 474 const interpreter::BytecodeArrayIterator& iterator) { | 474 const interpreter::BytecodeArrayIterator& iterator) { |
| 475 UNIMPLEMENTED(); | 475 UNIMPLEMENTED(); |
| 476 } | 476 } |
| 477 | 477 |
| 478 | 478 |
| 479 void BytecodeGraphBuilder::VisitDeletePropertyStrict( |
| 480 const interpreter::BytecodeArrayIterator& iterator) { |
| 481 UNIMPLEMENTED(); |
| 482 } |
| 483 |
| 484 |
| 485 void BytecodeGraphBuilder::VisitDeletePropertySloppy( |
| 486 const interpreter::BytecodeArrayIterator& iterator) { |
| 487 UNIMPLEMENTED(); |
| 488 } |
| 489 |
| 490 |
| 479 void BytecodeGraphBuilder::VisitTestEqual( | 491 void BytecodeGraphBuilder::VisitTestEqual( |
| 480 const interpreter::BytecodeArrayIterator& iterator) { | 492 const interpreter::BytecodeArrayIterator& iterator) { |
| 481 UNIMPLEMENTED(); | 493 UNIMPLEMENTED(); |
| 482 } | 494 } |
| 483 | 495 |
| 484 | 496 |
| 485 void BytecodeGraphBuilder::VisitTestNotEqual( | 497 void BytecodeGraphBuilder::VisitTestNotEqual( |
| 486 const interpreter::BytecodeArrayIterator& iterator) { | 498 const interpreter::BytecodeArrayIterator& iterator) { |
| 487 UNIMPLEMENTED(); | 499 UNIMPLEMENTED(); |
| 488 } | 500 } |
| (...skipping 223 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 712 | 724 |
| 713 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 725 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 714 if (environment()->IsMarkedAsUnreachable()) return; | 726 if (environment()->IsMarkedAsUnreachable()) return; |
| 715 environment()->MarkAsUnreachable(); | 727 environment()->MarkAsUnreachable(); |
| 716 exit_controls_.push_back(exit); | 728 exit_controls_.push_back(exit); |
| 717 } | 729 } |
| 718 | 730 |
| 719 } // namespace compiler | 731 } // namespace compiler |
| 720 } // namespace internal | 732 } // namespace internal |
| 721 } // namespace v8 | 733 } // namespace v8 |
| OLD | NEW |