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 HeapStringAllocator allocator; | 35 OFStream os(stdout); |
36 StringStream stream(&allocator); | 36 os << "[MarkLive "; |
37 if (ref != NULL) { | 37 if (ref != NULL) { |
38 ref->PrintTo(&stream); | 38 os << *ref; |
39 } else { | 39 } else { |
40 stream.Add("root "); | 40 os << "root "; |
41 } | 41 } |
42 stream.Add(" -> "); | 42 os << " -> " << *instr << "]" << endl; |
43 instr->PrintTo(&stream); | |
44 PrintF("[MarkLive %s]\n", stream.ToCString().get()); | |
45 } | 43 } |
46 | 44 |
47 | 45 |
48 void HDeadCodeEliminationPhase::MarkLiveInstructions() { | 46 void HDeadCodeEliminationPhase::MarkLiveInstructions() { |
49 ZoneList<HValue*> worklist(10, zone()); | 47 ZoneList<HValue*> worklist(10, zone()); |
50 | 48 |
51 // Transitively mark all live instructions, starting from roots. | 49 // Transitively mark all live instructions, starting from roots. |
52 for (int i = 0; i < graph()->blocks()->length(); ++i) { | 50 for (int i = 0; i < graph()->blocks()->length(); ++i) { |
53 HBasicBlock* block = graph()->blocks()->at(i); | 51 HBasicBlock* block = graph()->blocks()->at(i); |
54 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { | 52 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { |
(...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
97 HPhi* phi = worklist.RemoveLast(); | 95 HPhi* phi = worklist.RemoveLast(); |
98 HBasicBlock* block = phi->block(); | 96 HBasicBlock* block = phi->block(); |
99 phi->DeleteAndReplaceWith(NULL); | 97 phi->DeleteAndReplaceWith(NULL); |
100 if (phi->HasMergedIndex()) { | 98 if (phi->HasMergedIndex()) { |
101 block->RecordDeletedPhi(phi->merged_index()); | 99 block->RecordDeletedPhi(phi->merged_index()); |
102 } | 100 } |
103 } | 101 } |
104 } | 102 } |
105 | 103 |
106 } } // namespace v8::internal | 104 } } // namespace v8::internal |
OLD | NEW |