Chromium Code Reviews| 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 Node* accumulator = environment()->LookupAccumulator(); |
| 647 Handle<SharedFunctionInfo> shared_info( | |
| 648 OpParameter<Handle<SharedFunctionInfo>>(accumulator)); | |
|
Michael Starzinger
2015/11/20 17:11:43
Not sure what this OpParameter call is trying to a
oth
2015/11/21 14:19:47
A JSCreateClosure node taking a Handle<SharedFunct
| |
| 649 PretenureFlag pretenure = | |
| 650 iterator.GetImmediateOperand(0) ? TENURED : NOT_TENURED; | |
| 651 const Operator* op = javascript()->CreateClosure(shared_info, pretenure); | |
| 652 Node* closure = NewNode(op); | |
| 653 AddEmptyFrameStateInputs(closure); | |
| 654 environment()->BindAccumulator(closure); | |
| 647 } | 655 } |
| 648 | 656 |
| 649 | 657 |
| 650 void BytecodeGraphBuilder::VisitCreateMappedArguments( | 658 void BytecodeGraphBuilder::VisitCreateMappedArguments( |
| 651 const interpreter::BytecodeArrayIterator& iterator) { | 659 const interpreter::BytecodeArrayIterator& iterator) { |
| 652 UNIMPLEMENTED(); | 660 UNIMPLEMENTED(); |
| 653 } | 661 } |
| 654 | 662 |
| 655 | 663 |
| 656 void BytecodeGraphBuilder::VisitCreateUnmappedArguments( | 664 void BytecodeGraphBuilder::VisitCreateUnmappedArguments( |
| (...skipping 571 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 1228 | 1236 |
| 1229 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 1237 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 1230 if (environment()->IsMarkedAsUnreachable()) return; | 1238 if (environment()->IsMarkedAsUnreachable()) return; |
| 1231 environment()->MarkAsUnreachable(); | 1239 environment()->MarkAsUnreachable(); |
| 1232 exit_controls_.push_back(exit); | 1240 exit_controls_.push_back(exit); |
| 1233 } | 1241 } |
| 1234 | 1242 |
| 1235 } // namespace compiler | 1243 } // namespace compiler |
| 1236 } // namespace internal | 1244 } // namespace internal |
| 1237 } // namespace v8 | 1245 } // namespace v8 |
| OLD | NEW |