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/05/13 21:55:27
nit: 2012
danno
2012/05/22 11:05:21
Done.
| |
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. |
(...skipping 12 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 // Flags: --allow-natives-syntax --smi-only-arrays --expose-gc | 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 = %HasFastSmiElements(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 | 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 | 43 // assumptions in this test about when deoptimizations get triggered are not |
44 // valid. | 44 // valid. |
(...skipping 157 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
202 testStraightLineDupeElinination(new Array(5),.5,0,0,0,0); | 202 testStraightLineDupeElinination(new Array(5),.5,0,0,0,0); |
203 testStraightLineDupeElinination(new Array(5),0,.5,0,0,0); | 203 testStraightLineDupeElinination(new Array(5),0,.5,0,0,0); |
204 testStraightLineDupeElinination(new Array(5),0,0,.5,0,0); | 204 testStraightLineDupeElinination(new Array(5),0,0,.5,0,0); |
205 testStraightLineDupeElinination(new Array(5),0,0,0,.5,0); | 205 testStraightLineDupeElinination(new Array(5),0,0,0,.5,0); |
206 testStraightLineDupeElinination(new Array(5),0,0,0,0,.5); | 206 testStraightLineDupeElinination(new Array(5),0,0,0,0,.5); |
207 %OptimizeFunctionOnNextCall(testStraightLineDupeElinination); | 207 %OptimizeFunctionOnNextCall(testStraightLineDupeElinination); |
208 testStraightLineDupeElinination(new Array(5)); | 208 testStraightLineDupeElinination(new Array(5)); |
209 testStraightLineDupeElinination(new Array(5)); | 209 testStraightLineDupeElinination(new Array(5)); |
210 assertTrue(2 != %GetOptimizationStatus(testStraightLineDupeElinination)); | 210 assertTrue(2 != %GetOptimizationStatus(testStraightLineDupeElinination)); |
211 } | 211 } |
OLD | NEW |