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 333 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
344 UNIMPLEMENTED(); | 344 UNIMPLEMENTED(); |
345 } | 345 } |
346 | 346 |
347 | 347 |
348 void BytecodeGraphBuilder::VisitCreateClosure( | 348 void BytecodeGraphBuilder::VisitCreateClosure( |
349 const interpreter::BytecodeArrayIterator& iterator) { | 349 const interpreter::BytecodeArrayIterator& iterator) { |
350 UNIMPLEMENTED(); | 350 UNIMPLEMENTED(); |
351 } | 351 } |
352 | 352 |
353 | 353 |
| 354 void BytecodeGraphBuilder::VisitCreateMappedArguments( |
| 355 const interpreter::BytecodeArrayIterator& iterator) { |
| 356 UNIMPLEMENTED(); |
| 357 } |
| 358 |
| 359 |
| 360 void BytecodeGraphBuilder::VisitCreateUnmappedArguments( |
| 361 const interpreter::BytecodeArrayIterator& iterator) { |
| 362 UNIMPLEMENTED(); |
| 363 } |
| 364 |
| 365 |
354 void BytecodeGraphBuilder::VisitCreateRegExpLiteral( | 366 void BytecodeGraphBuilder::VisitCreateRegExpLiteral( |
355 const interpreter::BytecodeArrayIterator& iterator) { | 367 const interpreter::BytecodeArrayIterator& iterator) { |
356 UNIMPLEMENTED(); | 368 UNIMPLEMENTED(); |
357 } | 369 } |
358 | 370 |
359 | 371 |
360 void BytecodeGraphBuilder::VisitCreateArrayLiteral( | 372 void BytecodeGraphBuilder::VisitCreateArrayLiteral( |
361 const interpreter::BytecodeArrayIterator& iterator) { | 373 const interpreter::BytecodeArrayIterator& iterator) { |
362 UNIMPLEMENTED(); | 374 UNIMPLEMENTED(); |
363 } | 375 } |
(...skipping 378 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
742 | 754 |
743 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 755 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
744 if (environment()->IsMarkedAsUnreachable()) return; | 756 if (environment()->IsMarkedAsUnreachable()) return; |
745 environment()->MarkAsUnreachable(); | 757 environment()->MarkAsUnreachable(); |
746 exit_controls_.push_back(exit); | 758 exit_controls_.push_back(exit); |
747 } | 759 } |
748 | 760 |
749 } // namespace compiler | 761 } // namespace compiler |
750 } // namespace internal | 762 } // namespace internal |
751 } // namespace v8 | 763 } // namespace v8 |
OLD | NEW |