| 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 255 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 266 UNIMPLEMENTED(); | 266 UNIMPLEMENTED(); |
| 267 } | 267 } |
| 268 | 268 |
| 269 | 269 |
| 270 void BytecodeGraphBuilder::VisitKeyedStoreIC( | 270 void BytecodeGraphBuilder::VisitKeyedStoreIC( |
| 271 const interpreter::BytecodeArrayIterator& iterator) { | 271 const interpreter::BytecodeArrayIterator& iterator) { |
| 272 UNIMPLEMENTED(); | 272 UNIMPLEMENTED(); |
| 273 } | 273 } |
| 274 | 274 |
| 275 | 275 |
| 276 void BytecodeGraphBuilder::VisitCall( |
| 277 const interpreter::BytecodeArrayIterator& iterator) { |
| 278 UNIMPLEMENTED(); |
| 279 } |
| 280 |
| 281 |
| 276 void BytecodeGraphBuilder::BuildBinaryOp( | 282 void BytecodeGraphBuilder::BuildBinaryOp( |
| 277 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { | 283 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { |
| 278 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); | 284 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); |
| 279 Node* right = environment()->LookupAccumulator(); | 285 Node* right = environment()->LookupAccumulator(); |
| 280 Node* node = NewNode(js_op, left, right); | 286 Node* node = NewNode(js_op, left, right); |
| 281 | 287 |
| 282 // TODO(oth): Real frame state and environment check pointing. | 288 // TODO(oth): Real frame state and environment check pointing. |
| 283 int frame_state_count = | 289 int frame_state_count = |
| 284 OperatorProperties::GetFrameStateInputCount(node->op()); | 290 OperatorProperties::GetFrameStateInputCount(node->op()); |
| 285 for (int i = 0; i < frame_state_count; i++) { | 291 for (int i = 0; i < frame_state_count; i++) { |
| (...skipping 138 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 424 | 430 |
| 425 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 431 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 426 if (environment()->IsMarkedAsUnreachable()) return; | 432 if (environment()->IsMarkedAsUnreachable()) return; |
| 427 environment()->MarkAsUnreachable(); | 433 environment()->MarkAsUnreachable(); |
| 428 exit_controls_.push_back(exit); | 434 exit_controls_.push_back(exit); |
| 429 } | 435 } |
| 430 | 436 |
| 431 } // namespace compiler | 437 } // namespace compiler |
| 432 } // namespace internal | 438 } // namespace internal |
| 433 } // namespace v8 | 439 } // namespace v8 |
| OLD | NEW |