OLD | NEW |
(Empty) | |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are |
| 4 // met: |
| 5 // |
| 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. |
| 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 27 |
| 28 // Flags: --allow-natives-syntax |
| 29 |
| 30 // Should not take a very long time (n^2 algorithms are bad) |
| 31 |
| 32 function do_slices() { |
| 33 var data = new Array(1024 * 12); // 12kB |
| 34 |
| 35 for (var i = 0; i < data.length; i++) { |
| 36 data[i] = 255; |
| 37 } |
| 38 |
| 39 var start = Date.now(); |
| 40 |
| 41 for (i = 0; i < 20000; i++) { |
| 42 data.slice(4, 1); |
| 43 } |
| 44 |
| 45 return Date.now() - start; |
| 46 } |
| 47 |
| 48 // Should never take more than 3 seconds (if the bug is fixed, the test takes |
| 49 // considerably less time than 3 seconds). |
| 50 assertTrue(do_slices() < (3 * 1000)); |
| 51 |
| 52 // Make sure that packed and unpacked array slices are still properly handled |
| 53 var holey_array = [1, 2, 3, 4, 5,,,,,,]; |
| 54 assertFalse(%HasFastHoleyElements(holey_array.slice(6, 1))); |
| 55 assertEquals(undefined, holey_array.slice(6, 7)[0]) |
| 56 assertFalse(%HasFastHoleyElements(holey_array.slice(2, 1))); |
| 57 assertEquals(3, holey_array.slice(2, 3)[0]) |
OLD | NEW |