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