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 339 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
350 UNIMPLEMENTED(); | 350 UNIMPLEMENTED(); |
351 } | 351 } |
352 | 352 |
353 | 353 |
354 void BytecodeGraphBuilder::VisitCallRuntime( | 354 void BytecodeGraphBuilder::VisitCallRuntime( |
355 const interpreter::BytecodeArrayIterator& iterator) { | 355 const interpreter::BytecodeArrayIterator& iterator) { |
356 UNIMPLEMENTED(); | 356 UNIMPLEMENTED(); |
357 } | 357 } |
358 | 358 |
359 | 359 |
| 360 void BytecodeGraphBuilder::VisitNew( |
| 361 const interpreter::BytecodeArrayIterator& iterator) { |
| 362 UNIMPLEMENTED(); |
| 363 } |
| 364 |
| 365 |
360 void BytecodeGraphBuilder::BuildBinaryOp( | 366 void BytecodeGraphBuilder::BuildBinaryOp( |
361 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { | 367 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { |
362 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); | 368 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); |
363 Node* right = environment()->LookupAccumulator(); | 369 Node* right = environment()->LookupAccumulator(); |
364 Node* node = NewNode(js_op, left, right); | 370 Node* node = NewNode(js_op, left, right); |
365 | 371 |
366 // TODO(oth): Real frame state and environment check pointing. | 372 // TODO(oth): Real frame state and environment check pointing. |
367 int frame_state_count = | 373 int frame_state_count = |
368 OperatorProperties::GetFrameStateInputCount(node->op()); | 374 OperatorProperties::GetFrameStateInputCount(node->op()); |
369 for (int i = 0; i < frame_state_count; i++) { | 375 for (int i = 0; i < frame_state_count; i++) { |
(...skipping 318 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
688 | 694 |
689 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 695 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
690 if (environment()->IsMarkedAsUnreachable()) return; | 696 if (environment()->IsMarkedAsUnreachable()) return; |
691 environment()->MarkAsUnreachable(); | 697 environment()->MarkAsUnreachable(); |
692 exit_controls_.push_back(exit); | 698 exit_controls_.push_back(exit); |
693 } | 699 } |
694 | 700 |
695 } // namespace compiler | 701 } // namespace compiler |
696 } // namespace internal | 702 } // namespace internal |
697 } // namespace v8 | 703 } // namespace v8 |
OLD | NEW |