| 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 |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 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-mark-deoptimize.h" |
| 29 | 29 |
| 30 namespace v8 { | 30 namespace v8 { |
| 31 namespace internal { | 31 namespace internal { |
| 32 | 32 |
| 33 | 33 void HMarkDeoptimizeOnUndefinedPhase::Run() { |
| 34 void HEscapeAnalysisPhase::CollectIfNoEscapingUses(HInstruction* instr) { | 34 const ZoneList<HPhi*>* phi_list = graph()->phi_list(); |
| 35 for (HUseIterator it(instr->uses()); !it.Done(); it.Advance()) { | 35 for (int i = 0; i < phi_list->length(); i++) { |
| 36 HValue* use = it.value(); | 36 HPhi* phi = phi_list->at(i); |
| 37 if (use->HasEscapingOperandAt(it.index())) { | 37 if (phi->CheckFlag(HValue::kAllowUndefinedAsNaN)) { |
| 38 if (FLAG_trace_escape_analysis) { | 38 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) { |
| 39 PrintF("#%d (%s) escapes through #%d (%s) @%d\n", instr->id(), | 39 HValue* use_value = it.value(); |
| 40 instr->Mnemonic(), use->id(), use->Mnemonic(), it.index()); | 40 if (!use_value->CheckFlag(HValue::kAllowUndefinedAsNaN)) { |
| 41 } | 41 ProcessPhi(phi); |
| 42 return; | 42 break; |
| 43 } | 43 } |
| 44 } | |
| 45 if (FLAG_trace_escape_analysis) { | |
| 46 PrintF("#%d (%s) is being captured\n", instr->id(), instr->Mnemonic()); | |
| 47 } | |
| 48 captured_.Add(instr, zone()); | |
| 49 } | |
| 50 | |
| 51 | |
| 52 void HEscapeAnalysisPhase::CollectCapturedValues() { | |
| 53 int block_count = graph()->blocks()->length(); | |
| 54 for (int i = 0; i < block_count; ++i) { | |
| 55 HBasicBlock* block = graph()->blocks()->at(i); | |
| 56 for (HInstructionIterator it(block); !it.Done(); it.Advance()) { | |
| 57 HInstruction* instr = it.Current(); | |
| 58 if (instr->IsAllocate()) { | |
| 59 CollectIfNoEscapingUses(instr); | |
| 60 } | 44 } |
| 61 } | 45 } |
| 62 } | 46 } |
| 63 } | 47 } |
| 64 | 48 |
| 65 | 49 |
| 50 void HMarkDeoptimizeOnUndefinedPhase::ProcessPhi(HPhi* phi) { |
| 51 ASSERT(phi->CheckFlag(HValue::kAllowUndefinedAsNaN)); |
| 52 ASSERT(worklist_.is_empty()); |
| 53 |
| 54 // Push the phi onto the worklist |
| 55 phi->ClearFlag(HValue::kAllowUndefinedAsNaN); |
| 56 worklist_.Add(phi, zone()); |
| 57 |
| 58 // Process all phis that can reach this phi |
| 59 while (!worklist_.is_empty()) { |
| 60 phi = worklist_.RemoveLast(); |
| 61 for (int i = phi->OperandCount() - 1; i >= 0; --i) { |
| 62 HValue* input = phi->OperandAt(i); |
| 63 if (input->IsPhi() && input->CheckFlag(HValue::kAllowUndefinedAsNaN)) { |
| 64 input->ClearFlag(HValue::kAllowUndefinedAsNaN); |
| 65 worklist_.Add(HPhi::cast(input), zone()); |
| 66 } |
| 67 } |
| 68 } |
| 69 } |
| 70 |
| 66 } } // namespace v8::internal | 71 } } // namespace v8::internal |
| OLD | NEW |