| 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 297 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 308 UNIMPLEMENTED(); | 308 UNIMPLEMENTED(); |
| 309 } | 309 } |
| 310 | 310 |
| 311 | 311 |
| 312 void BytecodeGraphBuilder::VisitKeyedStoreICStrict( | 312 void BytecodeGraphBuilder::VisitKeyedStoreICStrict( |
| 313 const interpreter::BytecodeArrayIterator& iterator) { | 313 const interpreter::BytecodeArrayIterator& iterator) { |
| 314 UNIMPLEMENTED(); | 314 UNIMPLEMENTED(); |
| 315 } | 315 } |
| 316 | 316 |
| 317 | 317 |
| 318 void BytecodeGraphBuilder::VisitPushContext( |
| 319 const interpreter::BytecodeArrayIterator& iterator) { |
| 320 UNIMPLEMENTED(); |
| 321 } |
| 322 |
| 323 |
| 324 void BytecodeGraphBuilder::VisitPopContext( |
| 325 const interpreter::BytecodeArrayIterator& iterator) { |
| 326 UNIMPLEMENTED(); |
| 327 } |
| 328 |
| 329 |
| 318 void BytecodeGraphBuilder::VisitCall( | 330 void BytecodeGraphBuilder::VisitCall( |
| 319 const interpreter::BytecodeArrayIterator& iterator) { | 331 const interpreter::BytecodeArrayIterator& iterator) { |
| 320 UNIMPLEMENTED(); | 332 UNIMPLEMENTED(); |
| 321 } | 333 } |
| 322 | 334 |
| 323 | 335 |
| 324 void BytecodeGraphBuilder::VisitCallRuntime( | 336 void BytecodeGraphBuilder::VisitCallRuntime( |
| 325 const interpreter::BytecodeArrayIterator& iterator) { | 337 const interpreter::BytecodeArrayIterator& iterator) { |
| 326 UNIMPLEMENTED(); | 338 UNIMPLEMENTED(); |
| 327 } | 339 } |
| (...skipping 264 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 592 | 604 |
| 593 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 605 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 594 if (environment()->IsMarkedAsUnreachable()) return; | 606 if (environment()->IsMarkedAsUnreachable()) return; |
| 595 environment()->MarkAsUnreachable(); | 607 environment()->MarkAsUnreachable(); |
| 596 exit_controls_.push_back(exit); | 608 exit_controls_.push_back(exit); |
| 597 } | 609 } |
| 598 | 610 |
| 599 } // namespace compiler | 611 } // namespace compiler |
| 600 } // namespace internal | 612 } // namespace internal |
| 601 } // namespace v8 | 613 } // namespace v8 |
| OLD | NEW |