| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 |
| (...skipping 12 matching lines...) Expand all Loading... |
| 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 // Ensure extending an empty packed smi array with a double initializes the | 28 // Ensure extending an empty packed smi array with a double initializes the |
| 29 // array with holes. | 29 // array with holes. |
| 30 var a = [1,2,3]; | 30 var a = [1,2,3]; |
| 31 a.length = 0; | 31 a.length = 0; |
| 32 a[0] = 1.4; | 32 a[0] = 1.4; |
| 33 assertEquals(1.4, a[0]); |
| 33 assertEquals(undefined, a[1]); | 34 assertEquals(undefined, a[1]); |
| 34 assertEquals(undefined, a[2]); | 35 assertEquals(undefined, a[2]); |
| 35 assertEquals(undefined, a[3]); | 36 assertEquals(undefined, a[3]); |
| 36 | 37 |
| 37 // Ensure the double array growstub initializes the array with holes. | 38 // Ensure the double array growstub initializes the array with holes. |
| 38 function grow_store(a,i,v) { | 39 function grow_store(a,i,v) { |
| 39 a[i] = v; | 40 a[i] = v; |
| 40 } | 41 } |
| 41 | 42 |
| 42 var a2 = [1.3]; | 43 var a2 = [1.3]; |
| 43 grow_store(a2,1,1.4); | 44 grow_store(a2,1,1.4); |
| 44 a2.length = 0; | 45 a2.length = 0; |
| 45 grow_store(a2,0,1.5); | 46 grow_store(a2,0,1.5); |
| 47 assertEquals(1.5, a2[0]); |
| 46 assertEquals(undefined, a2[1]); | 48 assertEquals(undefined, a2[1]); |
| 47 assertEquals(undefined, a2[2]); | 49 assertEquals(undefined, a2[2]); |
| 48 assertEquals(undefined, a2[3]); | 50 assertEquals(undefined, a2[3]); |
| 49 | 51 |
| 50 // Check storing objects using the double grow stub. | 52 // Check storing objects using the double grow stub. |
| 51 var a3 = [1.3]; | 53 var a3 = [1.3]; |
| 52 var o = {}; | 54 var o = {}; |
| 53 grow_store(a3, 1, o); | 55 grow_store(a3, 1, o); |
| 54 assertEquals(1.3, a3[0]); | 56 assertEquals(1.3, a3[0]); |
| 55 assertEquals(o, a3[1]); | 57 assertEquals(o, a3[1]); |
| 58 |
| 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]); |
| OLD | NEW |