| 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 267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 278 UNIMPLEMENTED(); | 278 UNIMPLEMENTED(); |
| 279 } | 279 } |
| 280 | 280 |
| 281 | 281 |
| 282 void BytecodeGraphBuilder::VisitCall( | 282 void BytecodeGraphBuilder::VisitCall( |
| 283 const interpreter::BytecodeArrayIterator& iterator) { | 283 const interpreter::BytecodeArrayIterator& iterator) { |
| 284 UNIMPLEMENTED(); | 284 UNIMPLEMENTED(); |
| 285 } | 285 } |
| 286 | 286 |
| 287 | 287 |
| 288 void BytecodeGraphBuilder::VisitCallRuntime( |
| 289 const interpreter::BytecodeArrayIterator& iterator) { |
| 290 UNIMPLEMENTED(); |
| 291 } |
| 292 |
| 293 |
| 288 void BytecodeGraphBuilder::BuildBinaryOp( | 294 void BytecodeGraphBuilder::BuildBinaryOp( |
| 289 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { | 295 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { |
| 290 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); | 296 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); |
| 291 Node* right = environment()->LookupAccumulator(); | 297 Node* right = environment()->LookupAccumulator(); |
| 292 Node* node = NewNode(js_op, left, right); | 298 Node* node = NewNode(js_op, left, right); |
| 293 | 299 |
| 294 // TODO(oth): Real frame state and environment check pointing. | 300 // TODO(oth): Real frame state and environment check pointing. |
| 295 int frame_state_count = | 301 int frame_state_count = |
| 296 OperatorProperties::GetFrameStateInputCount(node->op()); | 302 OperatorProperties::GetFrameStateInputCount(node->op()); |
| 297 for (int i = 0; i < frame_state_count; i++) { | 303 for (int i = 0; i < frame_state_count; i++) { |
| (...skipping 240 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 538 | 544 |
| 539 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 545 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 540 if (environment()->IsMarkedAsUnreachable()) return; | 546 if (environment()->IsMarkedAsUnreachable()) return; |
| 541 environment()->MarkAsUnreachable(); | 547 environment()->MarkAsUnreachable(); |
| 542 exit_controls_.push_back(exit); | 548 exit_controls_.push_back(exit); |
| 543 } | 549 } |
| 544 | 550 |
| 545 } // namespace compiler | 551 } // namespace compiler |
| 546 } // namespace internal | 552 } // namespace internal |
| 547 } // namespace v8 | 553 } // namespace v8 |
| OLD | NEW |