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 625 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
636 | 636 |
637 | 637 |
638 void BytecodeGraphBuilder::VisitPopContext( | 638 void BytecodeGraphBuilder::VisitPopContext( |
639 const interpreter::BytecodeArrayIterator& iterator) { | 639 const interpreter::BytecodeArrayIterator& iterator) { |
640 UNIMPLEMENTED(); | 640 UNIMPLEMENTED(); |
641 } | 641 } |
642 | 642 |
643 | 643 |
644 void BytecodeGraphBuilder::VisitCreateClosure( | 644 void BytecodeGraphBuilder::VisitCreateClosure( |
645 const interpreter::BytecodeArrayIterator& iterator) { | 645 const interpreter::BytecodeArrayIterator& iterator) { |
646 UNIMPLEMENTED(); | 646 Handle<SharedFunctionInfo> shared_info = |
| 647 Handle<SharedFunctionInfo>::cast(iterator.GetConstantForIndexOperand(0)); |
| 648 PretenureFlag tenured = |
| 649 iterator.GetImmediateOperand(1) ? TENURED : NOT_TENURED; |
| 650 const Operator* op = javascript()->CreateClosure(shared_info, tenured); |
| 651 Node* closure = NewNode(op); |
| 652 AddEmptyFrameStateInputs(closure); |
| 653 environment()->BindAccumulator(closure); |
647 } | 654 } |
648 | 655 |
649 | 656 |
| 657 void BytecodeGraphBuilder::VisitCreateClosureWide( |
| 658 const interpreter::BytecodeArrayIterator& iterator) { |
| 659 VisitCreateClosure(iterator); |
| 660 } |
| 661 |
| 662 |
650 void BytecodeGraphBuilder::VisitCreateMappedArguments( | 663 void BytecodeGraphBuilder::VisitCreateMappedArguments( |
651 const interpreter::BytecodeArrayIterator& iterator) { | 664 const interpreter::BytecodeArrayIterator& iterator) { |
652 UNIMPLEMENTED(); | 665 UNIMPLEMENTED(); |
653 } | 666 } |
654 | 667 |
655 | 668 |
656 void BytecodeGraphBuilder::VisitCreateUnmappedArguments( | 669 void BytecodeGraphBuilder::VisitCreateUnmappedArguments( |
657 const interpreter::BytecodeArrayIterator& iterator) { | 670 const interpreter::BytecodeArrayIterator& iterator) { |
658 UNIMPLEMENTED(); | 671 UNIMPLEMENTED(); |
659 } | 672 } |
(...skipping 579 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1239 | 1252 |
1240 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 1253 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
1241 if (environment()->IsMarkedAsUnreachable()) return; | 1254 if (environment()->IsMarkedAsUnreachable()) return; |
1242 environment()->MarkAsUnreachable(); | 1255 environment()->MarkAsUnreachable(); |
1243 exit_controls_.push_back(exit); | 1256 exit_controls_.push_back(exit); |
1244 } | 1257 } |
1245 | 1258 |
1246 } // namespace compiler | 1259 } // namespace compiler |
1247 } // namespace internal | 1260 } // namespace internal |
1248 } // namespace v8 | 1261 } // namespace v8 |
OLD | NEW |