OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 13 matching lines...) Expand all Loading... |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "hydrogen-escape-analysis.h" | 28 #include "hydrogen-escape-analysis.h" |
29 | 29 |
30 namespace v8 { | 30 namespace v8 { |
31 namespace internal { | 31 namespace internal { |
32 | 32 |
33 | 33 |
34 void HEscapeAnalysis::CollectIfNoEscapingUses(HInstruction* instr) { | 34 void HEscapeAnalysisPhase::CollectIfNoEscapingUses(HInstruction* instr) { |
35 for (HUseIterator it(instr->uses()); !it.Done(); it.Advance()) { | 35 for (HUseIterator it(instr->uses()); !it.Done(); it.Advance()) { |
36 HValue* use = it.value(); | 36 HValue* use = it.value(); |
37 if (use->HasEscapingOperandAt(it.index())) { | 37 if (use->HasEscapingOperandAt(it.index())) { |
38 if (FLAG_trace_escape_analysis) { | 38 if (FLAG_trace_escape_analysis) { |
39 PrintF("#%d (%s) escapes through #%d (%s) @%d\n", instr->id(), | 39 PrintF("#%d (%s) escapes through #%d (%s) @%d\n", instr->id(), |
40 instr->Mnemonic(), use->id(), use->Mnemonic(), it.index()); | 40 instr->Mnemonic(), use->id(), use->Mnemonic(), it.index()); |
41 } | 41 } |
42 return; | 42 return; |
43 } | 43 } |
44 } | 44 } |
45 if (FLAG_trace_escape_analysis) { | 45 if (FLAG_trace_escape_analysis) { |
46 PrintF("#%d (%s) is being captured\n", instr->id(), instr->Mnemonic()); | 46 PrintF("#%d (%s) is being captured\n", instr->id(), instr->Mnemonic()); |
47 } | 47 } |
48 captured_.Add(instr, zone_); | 48 captured_.Add(instr, zone()); |
49 } | 49 } |
50 | 50 |
51 | 51 |
52 void HEscapeAnalysis::CollectCapturedValues() { | 52 void HEscapeAnalysisPhase::CollectCapturedValues() { |
53 int block_count = graph_->blocks()->length(); | 53 int block_count = graph()->blocks()->length(); |
54 for (int i = 0; i < block_count; ++i) { | 54 for (int i = 0; i < block_count; ++i) { |
55 HBasicBlock* block = graph_->blocks()->at(i); | 55 HBasicBlock* block = graph()->blocks()->at(i); |
56 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { | 56 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { |
57 HInstruction* instr = it.Current(); | 57 HInstruction* instr = it.Current(); |
58 if (instr->IsAllocate() || instr->IsAllocateObject()) { | 58 if (instr->IsAllocate() || instr->IsAllocateObject()) { |
59 CollectIfNoEscapingUses(instr); | 59 CollectIfNoEscapingUses(instr); |
60 } | 60 } |
61 } | 61 } |
62 } | 62 } |
63 } | 63 } |
64 | 64 |
65 | 65 |
66 void HEscapeAnalysis::Analyze() { | |
67 HPhase phase("H_Escape analysis", graph_); | |
68 CollectCapturedValues(); | |
69 } | |
70 | |
71 | |
72 } } // namespace v8::internal | 66 } } // namespace v8::internal |
OLD | NEW |