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 357 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
368 UNIMPLEMENTED(); | 368 UNIMPLEMENTED(); |
369 } | 369 } |
370 | 370 |
371 | 371 |
372 void BytecodeGraphBuilder::VisitNew( | 372 void BytecodeGraphBuilder::VisitNew( |
373 const interpreter::BytecodeArrayIterator& iterator) { | 373 const interpreter::BytecodeArrayIterator& iterator) { |
374 UNIMPLEMENTED(); | 374 UNIMPLEMENTED(); |
375 } | 375 } |
376 | 376 |
377 | 377 |
| 378 void BytecodeGraphBuilder::VisitThrow( |
| 379 const interpreter::BytecodeArrayIterator& iterator) { |
| 380 UNIMPLEMENTED(); |
| 381 } |
| 382 |
| 383 |
378 void BytecodeGraphBuilder::BuildBinaryOp( | 384 void BytecodeGraphBuilder::BuildBinaryOp( |
379 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { | 385 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { |
380 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); | 386 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); |
381 Node* right = environment()->LookupAccumulator(); | 387 Node* right = environment()->LookupAccumulator(); |
382 Node* node = NewNode(js_op, left, right); | 388 Node* node = NewNode(js_op, left, right); |
383 | 389 |
384 // TODO(oth): Real frame state and environment check pointing. | 390 // TODO(oth): Real frame state and environment check pointing. |
385 int frame_state_count = | 391 int frame_state_count = |
386 OperatorProperties::GetFrameStateInputCount(node->op()); | 392 OperatorProperties::GetFrameStateInputCount(node->op()); |
387 for (int i = 0; i < frame_state_count; i++) { | 393 for (int i = 0; i < frame_state_count; i++) { |
(...skipping 318 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
706 | 712 |
707 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 713 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
708 if (environment()->IsMarkedAsUnreachable()) return; | 714 if (environment()->IsMarkedAsUnreachable()) return; |
709 environment()->MarkAsUnreachable(); | 715 environment()->MarkAsUnreachable(); |
710 exit_controls_.push_back(exit); | 716 exit_controls_.push_back(exit); |
711 } | 717 } |
712 | 718 |
713 } // namespace compiler | 719 } // namespace compiler |
714 } // namespace internal | 720 } // namespace internal |
715 } // namespace v8 | 721 } // namespace v8 |
OLD | NEW |