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