| 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 327 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 338 UNIMPLEMENTED(); | 338 UNIMPLEMENTED(); |
| 339 } | 339 } |
| 340 | 340 |
| 341 | 341 |
| 342 void BytecodeGraphBuilder::VisitCreateClosure( | 342 void BytecodeGraphBuilder::VisitCreateClosure( |
| 343 const interpreter::BytecodeArrayIterator& iterator) { | 343 const interpreter::BytecodeArrayIterator& iterator) { |
| 344 UNIMPLEMENTED(); | 344 UNIMPLEMENTED(); |
| 345 } | 345 } |
| 346 | 346 |
| 347 | 347 |
| 348 void BytecodeGraphBuilder::VisitCreateArgumentsStrict( |
| 349 const interpreter::BytecodeArrayIterator& iterator) { |
| 350 UNIMPLEMENTED(); |
| 351 } |
| 352 |
| 353 |
| 354 void BytecodeGraphBuilder::VisitCreateArgumentsSloppy( |
| 355 const interpreter::BytecodeArrayIterator& iterator) { |
| 356 UNIMPLEMENTED(); |
| 357 } |
| 358 |
| 359 |
| 348 void BytecodeGraphBuilder::VisitCreateRegExpLiteral( | 360 void BytecodeGraphBuilder::VisitCreateRegExpLiteral( |
| 349 const interpreter::BytecodeArrayIterator& iterator) { | 361 const interpreter::BytecodeArrayIterator& iterator) { |
| 350 UNIMPLEMENTED(); | 362 UNIMPLEMENTED(); |
| 351 } | 363 } |
| 352 | 364 |
| 353 | 365 |
| 354 void BytecodeGraphBuilder::VisitCreateArrayLiteral( | 366 void BytecodeGraphBuilder::VisitCreateArrayLiteral( |
| 355 const interpreter::BytecodeArrayIterator& iterator) { | 367 const interpreter::BytecodeArrayIterator& iterator) { |
| 356 UNIMPLEMENTED(); | 368 UNIMPLEMENTED(); |
| 357 } | 369 } |
| (...skipping 360 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 718 | 730 |
| 719 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 731 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 720 if (environment()->IsMarkedAsUnreachable()) return; | 732 if (environment()->IsMarkedAsUnreachable()) return; |
| 721 environment()->MarkAsUnreachable(); | 733 environment()->MarkAsUnreachable(); |
| 722 exit_controls_.push_back(exit); | 734 exit_controls_.push_back(exit); |
| 723 } | 735 } |
| 724 | 736 |
| 725 } // namespace compiler | 737 } // namespace compiler |
| 726 } // namespace internal | 738 } // namespace internal |
| 727 } // namespace v8 | 739 } // namespace v8 |
| OLD | NEW |