| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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/hydrogen-dce.h" | 5 #include "src/hydrogen-dce.h" |
| 6 #include "src/v8.h" | 6 #include "src/v8.h" |
| 7 | 7 |
| 8 namespace v8 { | 8 namespace v8 { |
| 9 namespace internal { | 9 namespace internal { |
| 10 | 10 |
| (...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 52 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { | 52 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { |
| 53 HInstruction* instr = it.Current(); | 53 HInstruction* instr = it.Current(); |
| 54 if (instr->CannotBeEliminated()) MarkLive(instr, &worklist); | 54 if (instr->CannotBeEliminated()) MarkLive(instr, &worklist); |
| 55 } | 55 } |
| 56 for (int j = 0; j < block->phis()->length(); j++) { | 56 for (int j = 0; j < block->phis()->length(); j++) { |
| 57 HPhi* phi = block->phis()->at(j); | 57 HPhi* phi = block->phis()->at(j); |
| 58 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist); | 58 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist); |
| 59 } | 59 } |
| 60 } | 60 } |
| 61 | 61 |
| 62 ASSERT(worklist.is_empty()); // Should have processed everything. | 62 DCHECK(worklist.is_empty()); // Should have processed everything. |
| 63 } | 63 } |
| 64 | 64 |
| 65 | 65 |
| 66 void HDeadCodeEliminationPhase::RemoveDeadInstructions() { | 66 void HDeadCodeEliminationPhase::RemoveDeadInstructions() { |
| 67 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone()); | 67 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone()); |
| 68 | 68 |
| 69 // Remove any instruction not marked kIsLive. | 69 // Remove any instruction not marked kIsLive. |
| 70 for (int i = 0; i < graph()->blocks()->length(); ++i) { | 70 for (int i = 0; i < graph()->blocks()->length(); ++i) { |
| 71 HBasicBlock* block = graph()->blocks()->at(i); | 71 HBasicBlock* block = graph()->blocks()->at(i); |
| 72 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { | 72 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { |
| (...skipping 22 matching lines...) Expand all Loading... |
| 95 HPhi* phi = worklist.RemoveLast(); | 95 HPhi* phi = worklist.RemoveLast(); |
| 96 HBasicBlock* block = phi->block(); | 96 HBasicBlock* block = phi->block(); |
| 97 phi->DeleteAndReplaceWith(NULL); | 97 phi->DeleteAndReplaceWith(NULL); |
| 98 if (phi->HasMergedIndex()) { | 98 if (phi->HasMergedIndex()) { |
| 99 block->RecordDeletedPhi(phi->merged_index()); | 99 block->RecordDeletedPhi(phi->merged_index()); |
| 100 } | 100 } |
| 101 } | 101 } |
| 102 } | 102 } |
| 103 | 103 |
| 104 } } // namespace v8::internal | 104 } } // namespace v8::internal |
| OLD | NEW |