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 315 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
326 UNIMPLEMENTED(); | 326 UNIMPLEMENTED(); |
327 } | 327 } |
328 | 328 |
329 | 329 |
330 void BytecodeGraphBuilder::VisitCallRuntime( | 330 void BytecodeGraphBuilder::VisitCallRuntime( |
331 const interpreter::BytecodeArrayIterator& iterator) { | 331 const interpreter::BytecodeArrayIterator& iterator) { |
332 UNIMPLEMENTED(); | 332 UNIMPLEMENTED(); |
333 } | 333 } |
334 | 334 |
335 | 335 |
| 336 void BytecodeGraphBuilder::VisitNew( |
| 337 const interpreter::BytecodeArrayIterator& iterator) { |
| 338 UNIMPLEMENTED(); |
| 339 } |
| 340 |
| 341 |
336 void BytecodeGraphBuilder::BuildBinaryOp( | 342 void BytecodeGraphBuilder::BuildBinaryOp( |
337 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { | 343 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { |
338 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); | 344 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); |
339 Node* right = environment()->LookupAccumulator(); | 345 Node* right = environment()->LookupAccumulator(); |
340 Node* node = NewNode(js_op, left, right); | 346 Node* node = NewNode(js_op, left, right); |
341 | 347 |
342 // TODO(oth): Real frame state and environment check pointing. | 348 // TODO(oth): Real frame state and environment check pointing. |
343 int frame_state_count = | 349 int frame_state_count = |
344 OperatorProperties::GetFrameStateInputCount(node->op()); | 350 OperatorProperties::GetFrameStateInputCount(node->op()); |
345 for (int i = 0; i < frame_state_count; i++) { | 351 for (int i = 0; i < frame_state_count; i++) { |
(...skipping 288 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
634 | 640 |
635 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 641 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
636 if (environment()->IsMarkedAsUnreachable()) return; | 642 if (environment()->IsMarkedAsUnreachable()) return; |
637 environment()->MarkAsUnreachable(); | 643 environment()->MarkAsUnreachable(); |
638 exit_controls_.push_back(exit); | 644 exit_controls_.push_back(exit); |
639 } | 645 } |
640 | 646 |
641 } // namespace compiler | 647 } // namespace compiler |
642 } // namespace internal | 648 } // namespace internal |
643 } // namespace v8 | 649 } // namespace v8 |
OLD | NEW |