Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 1 | // Copyright 2012 the V8 project authors. All rights reserved. |
Steve Block | 1e0659c | 2011-05-24 12:43:12 +0100 | [diff] [blame] | 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 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 28 | // Ensure extending an empty packed smi array with a double initializes the |
| 29 | // array with holes. |
| 30 | var a = [1,2,3]; |
| 31 | a.length = 0; |
| 32 | a[0] = 1.4; |
| 33 | assertEquals(1.4, a[0]); |
| 34 | assertEquals(undefined, a[1]); |
| 35 | assertEquals(undefined, a[2]); |
| 36 | assertEquals(undefined, a[3]); |
Steve Block | 1e0659c | 2011-05-24 12:43:12 +0100 | [diff] [blame] | 37 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 38 | // Ensure the double array growstub initializes the array with holes. |
| 39 | function grow_store(a,i,v) { |
| 40 | a[i] = v; |
| 41 | } |
Ben Murdoch | e0cee9b | 2011-05-25 10:26:03 +0100 | [diff] [blame] | 42 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 43 | var a2 = [1.3]; |
| 44 | grow_store(a2,1,1.4); |
| 45 | a2.length = 0; |
| 46 | grow_store(a2,0,1.5); |
| 47 | assertEquals(1.5, a2[0]); |
| 48 | assertEquals(undefined, a2[1]); |
| 49 | assertEquals(undefined, a2[2]); |
| 50 | assertEquals(undefined, a2[3]); |
Ben Murdoch | 85b7179 | 2012-04-11 18:30:58 +0100 | [diff] [blame] | 51 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 52 | // Check storing objects using the double grow stub. |
| 53 | var a3 = [1.3]; |
| 54 | var o = {}; |
| 55 | grow_store(a3, 1, o); |
| 56 | assertEquals(1.3, a3[0]); |
| 57 | assertEquals(o, a3[1]); |
Ben Murdoch | 3ef787d | 2012-04-12 10:51:47 +0100 | [diff] [blame] | 58 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 59 | // Ensure the double array growstub initializes the array with holes. |
| 60 | function grow_store2(a,i,v) { |
| 61 | a[i] = v; |
| 62 | } |
| 63 | |
| 64 | var a4 = [1.3]; |
| 65 | grow_store2(a4,1,1.4); |
| 66 | a4.length = 0; |
| 67 | grow_store2(a4,0,1); |
| 68 | assertEquals(1, a4[0]); |
| 69 | assertEquals(undefined, a4[1]); |
| 70 | assertEquals(undefined, a4[2]); |
| 71 | assertEquals(undefined, a4[3]); |