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 pops with various number of arguments. |
| 31 | (function() { |
| 32 | var a = []; |
| 33 | for (var i = 0; i < 7; i++) { |
| 34 | a = [7, 6, 5, 4, 3, 2, 1]; |
| 35 | |
| 36 | assertEquals(1, a.pop(), "1st pop"); |
| 37 | assertEquals(6, a.length, "length 1st pop"); |
| 38 | |
| 39 | assertEquals(2, a.pop(1), "2nd pop"); |
| 40 | assertEquals(5, a.length, "length 2nd pop"); |
| 41 | |
| 42 | assertEquals(3, a.pop(1, 2), "3rd pop"); |
| 43 | assertEquals(4, a.length, "length 3rd pop"); |
| 44 | |
| 45 | assertEquals(4, a.pop(1, 2, 3), "4th pop"); |
| 46 | assertEquals(3, a.length, "length 4th pop"); |
| 47 | |
| 48 | assertEquals(5, a.pop(), "5th pop"); |
| 49 | assertEquals(2, a.length, "length 5th pop"); |
| 50 | |
| 51 | assertEquals(6, a.pop(), "6th pop"); |
| 52 | assertEquals(1, a.length, "length 6th pop"); |
| 53 | |
| 54 | assertEquals(7, a.pop(), "7th pop"); |
| 55 | assertEquals(0, a.length, "length 7th pop"); |
| 56 | |
| 57 | assertEquals(undefined, a.pop(), "8th pop"); |
| 58 | assertEquals(0, a.length, "length 8th pop"); |
| 59 | |
| 60 | assertEquals(undefined, a.pop(1, 2, 3), "9th pop"); |
| 61 | assertEquals(0, a.length, "length 9th pop"); |
| 62 | } |
| 63 | |
| 64 | // Check that pop works on inherited properties. |
| 65 | for (var i = 0; i < 10 ;i++) { // Ensure ICs are stabilized. |
| 66 | Array.prototype[1] = 1; |
| 67 | Array.prototype[3] = 3; |
| 68 | Array.prototype[5] = 5; |
| 69 | Array.prototype[7] = 7; |
| 70 | Array.prototype[9] = 9; |
| 71 | a = [0,1,2,,4,,6,7,8,,]; |
| 72 | assertEquals(10, a.length, "inherit-initial-length"); |
| 73 | for (var j = 9; j >= 0; j--) { |
| 74 | assertEquals(j + 1, a.length, "inherit-pre-length-" + j); |
| 75 | assertTrue(j in a, "has property " + j); |
| 76 | var own = a.hasOwnProperty(j); |
| 77 | var inherited = Array.prototype.hasOwnProperty(j); |
| 78 | assertEquals(j, a.pop(), "inherit-pop"); |
| 79 | assertEquals(j, a.length, "inherit-post-length"); |
| 80 | assertFalse(a.hasOwnProperty(j), "inherit-deleted-own-" + j); |
| 81 | assertEquals(inherited, Array.prototype.hasOwnProperty(j), |
| 82 | "inherit-not-deleted-inherited" + j); |
| 83 | } |
| 84 | Array.prototype.length = 0; // Clean-up. |
| 85 | } |
Kristian Monsen | 25f6136 | 2010-05-21 11:50:48 +0100 | [diff] [blame] | 86 | |
| 87 | // Check that pop works on inherited properties for |
| 88 | // arrays with array prototype. |
| 89 | for (var i = 0; i < 10 ;i++) { // Ensure ICs are stabilized. |
| 90 | var array_proto = []; |
| 91 | array_proto[1] = 1; |
| 92 | array_proto[3] = 3; |
| 93 | array_proto[5] = 5; |
| 94 | array_proto[7] = 7; |
| 95 | array_proto[9] = 9; |
| 96 | a = [0,1,2,,4,,6,7,8,,]; |
| 97 | a.__proto__ = array_proto; |
| 98 | assertEquals(10, a.length, "array_proto-inherit-initial-length"); |
| 99 | for (var j = 9; j >= 0; j--) { |
| 100 | assertEquals(j + 1, a.length, "array_proto-inherit-pre-length-" + j); |
| 101 | assertTrue(j in a, "array_proto-has property " + j); |
| 102 | var own = a.hasOwnProperty(j); |
| 103 | var inherited = array_proto.hasOwnProperty(j); |
| 104 | assertEquals(j, a.pop(), "array_proto-inherit-pop"); |
| 105 | assertEquals(j, a.length, "array_proto-inherit-post-length"); |
| 106 | assertFalse(a.hasOwnProperty(j), "array_proto-inherit-deleted-own-" + j); |
| 107 | assertEquals(inherited, array_proto.hasOwnProperty(j), |
| 108 | "array_proto-inherit-not-deleted-inherited" + j); |
| 109 | } |
| 110 | } |
| 111 | |
| 112 | // Check that pop works on inherited properties for |
| 113 | // arrays with array prototype. |
Steve Block | 6ded16b | 2010-05-10 14:33:55 +0100 | [diff] [blame] | 114 | })(); |
| 115 | |
| 116 | // Test the case of not JSArray receiver. |
| 117 | // Regression test for custom call generators, see issue 684. |
| 118 | (function() { |
| 119 | var a = []; |
| 120 | for (var i = 0; i < 100; i++) a.push(i); |
| 121 | var x = {__proto__: a}; |
| 122 | for (var i = 0; i < 100; i++) { |
| 123 | assertEquals(99 - i, x.pop(), i + 'th iteration'); |
| 124 | } |
| 125 | })(); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 126 | |
| 127 | (function () { |
| 128 | function f(a, deopt) { |
| 129 | var v = a.pop() ? 1 : 2; |
| 130 | if (deopt) %DeoptimizeFunction(f); |
| 131 | return v; |
| 132 | } |
| 133 | |
| 134 | var a = [true, true, true, true] |
| 135 | assertEquals(1, f(a, false)); |
| 136 | assertEquals(1, f(a, false)); |
| 137 | %OptimizeFunctionOnNextCall(f); |
| 138 | assertEquals(1, f(a, false)); |
| 139 | assertEquals(1, f(a, true)); |
| 140 | })(); |