| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 731 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 742 } else { | 742 } else { |
| 743 for (int j = 0; j < blocks_[i]->predecessors()->length(); ++j) { | 743 for (int j = 0; j < blocks_[i]->predecessors()->length(); ++j) { |
| 744 blocks_[i]->AssignCommonDominator(blocks_[i]->predecessors()->at(j)); | 744 blocks_[i]->AssignCommonDominator(blocks_[i]->predecessors()->at(j)); |
| 745 } | 745 } |
| 746 } | 746 } |
| 747 } | 747 } |
| 748 } | 748 } |
| 749 | 749 |
| 750 // Mark all blocks that are dominated by an unconditional soft deoptimize to | 750 // Mark all blocks that are dominated by an unconditional soft deoptimize to |
| 751 // prevent code motion across those blocks. | 751 // prevent code motion across those blocks. |
| 752 void HGraph::PropagateDeoptimizingMark() | 752 void HGraph::PropagateDeoptimizingMark() { |
| 753 { | |
| 754 HPhase phase("Propagate deoptimizing mark", this); | 753 HPhase phase("Propagate deoptimizing mark", this); |
| 755 MarkAsDeoptimizingRecursively(entry_block()); | 754 MarkAsDeoptimizingRecursively(entry_block()); |
| 756 } | 755 } |
| 757 | 756 |
| 758 void HGraph::MarkAsDeoptimizingRecursively(HBasicBlock* block) { | 757 void HGraph::MarkAsDeoptimizingRecursively(HBasicBlock* block) { |
| 759 for (int i = 0; i < block->dominated_blocks()->length(); ++i) { | 758 for (int i = 0; i < block->dominated_blocks()->length(); ++i) { |
| 760 HBasicBlock* dominated = block->dominated_blocks()->at(i); | 759 HBasicBlock* dominated = block->dominated_blocks()->at(i); |
| 761 if (block->IsDeoptimizing()) dominated->MarkAsDeoptimizing(); | 760 if (block->IsDeoptimizing()) dominated->MarkAsDeoptimizing(); |
| 762 MarkAsDeoptimizingRecursively(dominated); | 761 MarkAsDeoptimizingRecursively(dominated); |
| 763 } | 762 } |
| (...skipping 5968 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 6732 } | 6731 } |
| 6733 } | 6732 } |
| 6734 | 6733 |
| 6735 #ifdef DEBUG | 6734 #ifdef DEBUG |
| 6736 if (graph_ != NULL) graph_->Verify(); | 6735 if (graph_ != NULL) graph_->Verify(); |
| 6737 if (allocator_ != NULL) allocator_->Verify(); | 6736 if (allocator_ != NULL) allocator_->Verify(); |
| 6738 #endif | 6737 #endif |
| 6739 } | 6738 } |
| 6740 | 6739 |
| 6741 } } // namespace v8::internal | 6740 } } // namespace v8::internal |
| OLD | NEW |