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 536 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
547 UNIMPLEMENTED(); | 547 UNIMPLEMENTED(); |
548 } | 548 } |
549 | 549 |
550 | 550 |
551 void BytecodeGraphBuilder::VisitJumpIfFalseConstant( | 551 void BytecodeGraphBuilder::VisitJumpIfFalseConstant( |
552 const interpreter::BytecodeArrayIterator& iterator) { | 552 const interpreter::BytecodeArrayIterator& iterator) { |
553 UNIMPLEMENTED(); | 553 UNIMPLEMENTED(); |
554 } | 554 } |
555 | 555 |
556 | 556 |
| 557 void BytecodeGraphBuilder::VisitJumpIfToBooleanTrue( |
| 558 const interpreter::BytecodeArrayIterator& iterator) { |
| 559 UNIMPLEMENTED(); |
| 560 } |
| 561 |
| 562 |
| 563 void BytecodeGraphBuilder::VisitJumpIfToBooleanTrueConstant( |
| 564 const interpreter::BytecodeArrayIterator& iterator) { |
| 565 UNIMPLEMENTED(); |
| 566 } |
| 567 |
| 568 |
| 569 void BytecodeGraphBuilder::VisitJumpIfToBooleanFalse( |
| 570 const interpreter::BytecodeArrayIterator& iterator) { |
| 571 UNIMPLEMENTED(); |
| 572 } |
| 573 |
| 574 |
| 575 void BytecodeGraphBuilder::VisitJumpIfToBooleanFalseConstant( |
| 576 const interpreter::BytecodeArrayIterator& iterator) { |
| 577 UNIMPLEMENTED(); |
| 578 } |
| 579 |
| 580 |
557 void BytecodeGraphBuilder::VisitReturn( | 581 void BytecodeGraphBuilder::VisitReturn( |
558 const interpreter::BytecodeArrayIterator& iterator) { | 582 const interpreter::BytecodeArrayIterator& iterator) { |
559 Node* control = | 583 Node* control = |
560 NewNode(common()->Return(), environment()->LookupAccumulator()); | 584 NewNode(common()->Return(), environment()->LookupAccumulator()); |
561 UpdateControlDependencyToLeaveFunction(control); | 585 UpdateControlDependencyToLeaveFunction(control); |
562 } | 586 } |
563 | 587 |
564 | 588 |
565 Node** BytecodeGraphBuilder::EnsureInputBufferSize(int size) { | 589 Node** BytecodeGraphBuilder::EnsureInputBufferSize(int size) { |
566 if (size > input_buffer_size_) { | 590 if (size > input_buffer_size_) { |
(...skipping 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
658 | 682 |
659 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 683 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
660 if (environment()->IsMarkedAsUnreachable()) return; | 684 if (environment()->IsMarkedAsUnreachable()) return; |
661 environment()->MarkAsUnreachable(); | 685 environment()->MarkAsUnreachable(); |
662 exit_controls_.push_back(exit); | 686 exit_controls_.push_back(exit); |
663 } | 687 } |
664 | 688 |
665 } // namespace compiler | 689 } // namespace compiler |
666 } // namespace internal | 690 } // namespace internal |
667 } // namespace v8 | 691 } // namespace v8 |
OLD | NEW |