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 14 matching lines...) Expand all Loading... |
25 input->SetFlag(HValue::kIsLive); | 25 input->SetFlag(HValue::kIsLive); |
26 worklist->Add(input, zone()); | 26 worklist->Add(input, zone()); |
27 if (FLAG_trace_dead_code_elimination) PrintLive(instr, input); | 27 if (FLAG_trace_dead_code_elimination) PrintLive(instr, input); |
28 } | 28 } |
29 } | 29 } |
30 } | 30 } |
31 } | 31 } |
32 | 32 |
33 | 33 |
34 void HDeadCodeEliminationPhase::PrintLive(HValue* ref, HValue* instr) { | 34 void HDeadCodeEliminationPhase::PrintLive(HValue* ref, HValue* instr) { |
| 35 AllowHandleDereference allow_deref; |
35 OFStream os(stdout); | 36 OFStream os(stdout); |
36 os << "[MarkLive "; | 37 os << "[MarkLive "; |
37 if (ref != NULL) { | 38 if (ref != NULL) { |
38 os << *ref; | 39 os << *ref; |
39 } else { | 40 } else { |
40 os << "root "; | 41 os << "root"; |
41 } | 42 } |
42 os << " -> " << *instr << "]" << std::endl; | 43 os << " -> " << *instr << "]" << std::endl; |
43 } | 44 } |
44 | 45 |
45 | 46 |
46 void HDeadCodeEliminationPhase::MarkLiveInstructions() { | 47 void HDeadCodeEliminationPhase::MarkLiveInstructions() { |
47 ZoneList<HValue*> worklist(10, zone()); | 48 ZoneList<HValue*> worklist(10, zone()); |
48 | 49 |
49 // Transitively mark all live instructions, starting from roots. | 50 // Transitively mark all live instructions, starting from roots. |
50 for (int i = 0; i < graph()->blocks()->length(); ++i) { | 51 for (int i = 0; i < graph()->blocks()->length(); ++i) { |
(...skipping 44 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
95 HPhi* phi = worklist.RemoveLast(); | 96 HPhi* phi = worklist.RemoveLast(); |
96 HBasicBlock* block = phi->block(); | 97 HBasicBlock* block = phi->block(); |
97 phi->DeleteAndReplaceWith(NULL); | 98 phi->DeleteAndReplaceWith(NULL); |
98 if (phi->HasMergedIndex()) { | 99 if (phi->HasMergedIndex()) { |
99 block->RecordDeletedPhi(phi->merged_index()); | 100 block->RecordDeletedPhi(phi->merged_index()); |
100 } | 101 } |
101 } | 102 } |
102 } | 103 } |
103 | 104 |
104 } } // namespace v8::internal | 105 } } // namespace v8::internal |
OLD | NEW |