Steve Block | 6ded16b | 2010-05-10 14:33:55 +0100 | [diff] [blame] | 1 | // Copyright 2010 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 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 28 | // Flags: --allow-natives-syntax |
| 29 | |
Steve Block | 6ded16b | 2010-05-10 14:33:55 +0100 | [diff] [blame] | 30 | // Check pushes with various number of arguments. |
| 31 | (function() { |
| 32 | var a = []; |
| 33 | for (var i = 0; i < 7; i++) { |
| 34 | a = []; |
| 35 | |
| 36 | assertEquals(0, a.push()); |
| 37 | assertEquals([], a, "after .push()"); |
| 38 | |
| 39 | assertEquals(1, a.push(1), "length after .push(1)"); |
| 40 | assertEquals([1], a, "after .push(1)"); |
| 41 | |
| 42 | assertEquals(3, a.push(2, 3), "length after .push(2, 3)"); |
| 43 | assertEquals([1, 2, 3], a, "after .push(2, 3)"); |
| 44 | |
| 45 | assertEquals(6, a.push(4, 5, 6), |
| 46 | "length after .push(4, 5, 6)"); |
| 47 | assertEquals([1, 2, 3, 4, 5, 6], a, |
| 48 | "after .push(4, 5, 5)"); |
| 49 | |
| 50 | assertEquals(10, a.push(7, 8, 9, 10), |
| 51 | "length after .push(7, 8, 9, 10)"); |
| 52 | assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], a, |
| 53 | "after .push(7, 8, 9, 10)"); |
| 54 | |
| 55 | assertEquals(15, a.push(11, 12, 13, 14, 15), |
| 56 | "length after .push(11, 12, 13, 14, 15)"); |
| 57 | assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15], a, |
| 58 | "after .push(11, 12, 13, 14, 15)"); |
| 59 | |
| 60 | assertEquals(21, a.push(16, 17, 18, 19, 20, 21), |
| 61 | "length after .push(16, 17, 18, 19, 20, 21)"); |
| 62 | assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21], a, |
| 63 | "after .push(16, 17, 18, 19, 20, 21)"); |
| 64 | |
| 65 | assertEquals(28, a.push(22, 23, 24, 25, 26, 27, 28), |
| 66 | "length hafter .push(22, 23, 24, 25, 26, 27, 28)"); |
| 67 | assertEquals([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28], a, |
| 68 | "after .push(22, 23, 24, 25, 26, 27, 28)"); |
| 69 | } |
| 70 | })(); |
| 71 | |
| 72 | // Excerises various pushes to the array at the end of new space. |
| 73 | (function() { |
| 74 | var a = undefined; |
| 75 | for (var i = 0; i < 7; i++) { |
| 76 | a = []; |
| 77 | assertEquals(1, a.push(1)); |
| 78 | assertEquals(2, a.push(2)); |
| 79 | assertEquals(3, a.push(3)); |
| 80 | assertEquals(4, a.push(4)); |
| 81 | assertEquals(5, a.push(5)); |
| 82 | assertEquals(6, a.push(6)); |
| 83 | assertEquals(7, a.push(7)); |
| 84 | assertEquals(8, a.push(8)); |
| 85 | assertEquals(9, a.push(9)); |
| 86 | assertEquals(10, a.push(10)); |
| 87 | assertEquals(11, a.push(11)); |
| 88 | assertEquals(12, a.push(12)); |
| 89 | assertEquals(13, a.push(13)); |
| 90 | assertEquals(14, a.push(14)); |
| 91 | assertEquals(15, a.push(15)); |
| 92 | assertEquals(16, a.push(16)); |
| 93 | assertEquals(17, a.push(17)); |
| 94 | assertEquals(18, a.push(18)); |
| 95 | assertEquals(19, a.push(19)); |
| 96 | assertEquals(20, a.push(20)); |
| 97 | assertEquals(21, a.push(21)); |
| 98 | assertEquals(22, a.push(22)); |
| 99 | assertEquals(23, a.push(23)); |
| 100 | assertEquals(24, a.push(24)); |
| 101 | assertEquals(25, a.push(25)); |
| 102 | assertEquals(26, a.push(26)); |
| 103 | assertEquals(27, a.push(27)); |
| 104 | assertEquals(28, a.push(28)); |
| 105 | assertEquals(29, a.push(29)); |
| 106 | } |
| 107 | })(); |
| 108 | |
| 109 | // Test the case of not JSArray receiver. |
| 110 | // Regression test for custom call generators, see issue 684. |
| 111 | (function() { |
| 112 | var x = {__proto__: []}; |
| 113 | for (var i = 0; i < 100; i++) { |
| 114 | x.push("a"); |
| 115 | assertEquals(i + 1, x.length, i + 'th iteration'); |
| 116 | } |
| 117 | })(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 118 | |
| 119 | (function() { |
| 120 | function f(a, i) { |
| 121 | a.push(i); |
| 122 | } |
| 123 | |
| 124 | var a = [1,2,3]; |
| 125 | a.f = function() { return 10; } |
| 126 | f(a, 4); |
| 127 | f(a, 5); |
| 128 | f(a, 6); |
| 129 | f(a, 7); |
| 130 | f(a, {}); |
| 131 | assertEquals(10, a.f()); |
| 132 | })(); |
| 133 | |
| 134 | (function() { |
| 135 | function f(a, i) { |
| 136 | a.push(i); |
| 137 | } |
| 138 | |
| 139 | var a = [1,2,3]; |
| 140 | a.f = function() { return 10; } |
| 141 | f(a, 4); |
| 142 | f(a, 5); |
| 143 | f(a, 6); |
| 144 | %OptimizeFunctionOnNextCall(f); |
| 145 | f(a, 7); |
| 146 | f(a, {}); |
| 147 | assertEquals(10, a.f()); |
| 148 | })(); |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame] | 149 | |
| 150 | |
| 151 | (function testDoubleArrayPush() { |
| 152 | var a = []; |
| 153 | var max = 1000; |
| 154 | for (var i = 0; i < max; i++) { |
| 155 | a.push(i + 0.1); |
| 156 | } |
| 157 | assertEquals(max, a.length); |
| 158 | for (var i = 0; i < max; i++) { |
| 159 | assertEquals(i+0.1, a[i]); |
| 160 | } |
| 161 | })(); |