Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
|
Jakob Kummerow
2012/02/09 14:31:32
nit: 2012
| |
| 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 // Flags: --allow-natives-syntax --smi-only-arrays | 28 // Flags: --allow-natives-syntax --smi-only-arrays --expose-gc |
| 29 | 29 |
| 30 // Ensure that ElementsKind transitions in various situations are hoisted (or | 30 // Ensure that ElementsKind transitions in various situations are hoisted (or |
| 31 // not hoisted) correctly, don't change the semantics programs and don't trigger | 31 // not hoisted) correctly, don't change the semantics programs and don't trigger |
| 32 // deopt through hoisting in important situations. | 32 // deopt through hoisting in important situations. |
| 33 | 33 |
| 34 support_smi_only_arrays = %HasFastSmiOnlyElements(new Array(1,2,3,4,5,6)); | 34 support_smi_only_arrays = %HasFastSmiOnlyElements(new Array(1,2,3,4,5,6)); |
| 35 | 35 |
| 36 if (support_smi_only_arrays) { | 36 if (support_smi_only_arrays) { |
| 37 print("Tests include smi-only arrays."); | 37 print("Tests include smi-only arrays."); |
| 38 } else { | 38 } else { |
| 39 print("Tests do NOT include smi-only arrays."); | 39 print("Tests do NOT include smi-only arrays."); |
| 40 } | 40 } |
| 41 | 41 |
| 42 // Force existing ICs from previous stress runs to be flushed, otherwise the | |
| 43 // assumptions in this test about when deoptimizations get triggered are not | |
| 44 // valid. | |
| 45 gc(); | |
| 46 | |
| 42 if (support_smi_only_arrays) { | 47 if (support_smi_only_arrays) { |
| 43 // Make sure that a simple elements array transitions inside a loop before | 48 // Make sure that a simple elements array transitions inside a loop before |
| 44 // stores to an array gets hoisted in a way that doesn't generate a deopt in | 49 // stores to an array gets hoisted in a way that doesn't generate a deopt in |
| 45 // simple cases.} | 50 // simple cases.} |
| 46 function testDoubleConversion4(a) { | 51 function testDoubleConversion4(a) { |
| 47 var object = new Object(); | 52 var object = new Object(); |
| 48 a[0] = 0; | 53 a[0] = 0; |
| 49 var count = 3; | 54 var count = 3; |
| 50 do { | 55 do { |
| 51 a[0] = object; | 56 a[0] = object; |
| (...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 159 a[0] = object; | 164 a[0] = object; |
| 160 } while (--count > 3); | 165 } while (--count > 3); |
| 161 } | 166 } |
| 162 | 167 |
| 163 testHoistingWithSideEffect(new Array(5)); | 168 testHoistingWithSideEffect(new Array(5)); |
| 164 %OptimizeFunctionOnNextCall(testHoistingWithSideEffect); | 169 %OptimizeFunctionOnNextCall(testHoistingWithSideEffect); |
| 165 testHoistingWithSideEffect(new Array(5)); | 170 testHoistingWithSideEffect(new Array(5)); |
| 166 testHoistingWithSideEffect(new Array(5)); | 171 testHoistingWithSideEffect(new Array(5)); |
| 167 assertTrue(2 != %GetOptimizationStatus(testHoistingWithSideEffect)); | 172 assertTrue(2 != %GetOptimizationStatus(testHoistingWithSideEffect)); |
| 168 } | 173 } |
| OLD | NEW |