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 --smi-only-arrays |
| 29 // Flags: --noparallel-recompilation |
| 30 |
| 31 // Test element kind of objects. |
| 32 // Since --smi-only-arrays affects builtins, its default setting at compile time |
| 33 // sticks if built with snapshot. If --smi-only-arrays is deactivated by |
| 34 // default, only a no-snapshot build actually has smi-only arrays enabled in |
| 35 // this test case. Depending on whether smi-only arrays are actually enabled, |
| 36 // this test takes the appropriate code path to check smi-only arrays. |
| 37 |
| 38 support_smi_only_arrays = %HasFastSmiElements([1,2,3,4,5,6,7,8,9,10]); |
| 39 |
| 40 if (support_smi_only_arrays) { |
| 41 print("Tests include smi-only arrays."); |
| 42 } else { |
| 43 print("Tests do NOT include smi-only arrays."); |
| 44 } |
| 45 |
| 46 // IC and Crankshaft support for smi-only elements in dynamic array literals. |
| 47 function get(foo) { return foo; } // Used to generate dynamic values. |
| 48 |
| 49 function array_natives_test() { |
| 50 |
| 51 // Ensure small array literals start in specific element kind mode. |
| 52 assertTrue(%HasFastSmiElements([])); |
| 53 assertTrue(%HasFastSmiElements([1])); |
| 54 assertTrue(%HasFastSmiElements([1,2])); |
| 55 assertTrue(%HasFastDoubleElements([1.1])); |
| 56 assertTrue(%HasFastDoubleElements([1.1,2])); |
| 57 |
| 58 // Push |
| 59 var a0 = [1, 2, 3]; |
| 60 assertTrue(%HasFastSmiElements(a0)); |
| 61 a0.push(4); |
| 62 assertTrue(%HasFastSmiElements(a0)); |
| 63 a0.push(1.3); |
| 64 assertTrue(%HasFastDoubleElements(a0)); |
| 65 a0.push(1.5); |
| 66 assertTrue(%HasFastDoubleElements(a0)); |
| 67 a0.push({}); |
| 68 assertTrue(%HasFastObjectElements(a0)); |
| 69 a0.push({}); |
| 70 assertTrue(%HasFastObjectElements(a0)); |
| 71 assertEquals([1,2,3,4,1.3,1.5,{},{}], a0); |
| 72 |
| 73 // Concat |
| 74 var a1; |
| 75 a1 = [1,2,3].concat([]); |
| 76 assertTrue(%HasFastSmiElements(a1)); |
| 77 assertEquals([1,2,3], a1); |
| 78 a1 = [1,2,3].concat([4,5,6]); |
| 79 assertTrue(%HasFastSmiElements(a1)); |
| 80 assertEquals([1,2,3,4,5,6], a1); |
| 81 a1 = [1,2,3].concat([4,5,6], [7,8,9]); |
| 82 assertTrue(%HasFastSmiElements(a1)); |
| 83 assertEquals([1,2,3,4,5,6,7,8,9], a1); |
| 84 a1 = [1.1,2,3].concat([]); |
| 85 assertTrue(%HasFastDoubleElements(a1)); |
| 86 assertEquals([1.1,2,3], a1); |
| 87 a1 = [1,2,3].concat([1.1, 2]); |
| 88 assertTrue(%HasFastDoubleElements(a1)); |
| 89 assertEquals([1,2,3,1.1,2], a1); |
| 90 a1 = [1.1,2,3].concat([1, 2]); |
| 91 assertTrue(%HasFastDoubleElements(a1)); |
| 92 assertEquals([1.1,2,3,1,2], a1); |
| 93 a1 = [1.1,2,3].concat([1.2, 2]); |
| 94 assertTrue(%HasFastDoubleElements(a1)); |
| 95 assertEquals([1.1,2,3,1.2,2], a1); |
| 96 |
| 97 a1 = [1,2,3].concat([{}]); |
| 98 assertTrue(%HasFastObjectElements(a1)); |
| 99 assertEquals([1,2,3,{}], a1); |
| 100 a1 = [1.1,2,3].concat([{}]); |
| 101 assertTrue(%HasFastObjectElements(a1)); |
| 102 assertEquals([1.1,2,3,{}], a1); |
| 103 a1 = [{}].concat([1,2,3]); |
| 104 assertTrue(%HasFastObjectElements(a1)); |
| 105 assertEquals([{},1,2,3], a1); |
| 106 a1 = [{}].concat([1.1,2,3]); |
| 107 assertTrue(%HasFastObjectElements(a1)); |
| 108 assertEquals([{},1.1,2,3], a1); |
| 109 |
| 110 // Slice |
| 111 var a2 = [1,2,3]; |
| 112 assertTrue(%HasFastSmiElements(a2.slice())); |
| 113 assertTrue(%HasFastSmiElements(a2.slice(1))); |
| 114 assertTrue(%HasFastSmiElements(a2.slice(1, 2))); |
| 115 assertEquals([1,2,3], a2.slice()); |
| 116 assertEquals([2,3], a2.slice(1)); |
| 117 assertEquals([2], a2.slice(1,2)); |
| 118 a2 = [1.1,2,3]; |
| 119 assertTrue(%HasFastDoubleElements(a2.slice())); |
| 120 assertTrue(%HasFastDoubleElements(a2.slice(1))); |
| 121 assertTrue(%HasFastDoubleElements(a2.slice(1, 2))); |
| 122 assertEquals([1.1,2,3], a2.slice()); |
| 123 assertEquals([2,3], a2.slice(1)); |
| 124 assertEquals([2], a2.slice(1,2)); |
| 125 a2 = [{},2,3]; |
| 126 assertTrue(%HasFastObjectElements(a2.slice())); |
| 127 assertTrue(%HasFastObjectElements(a2.slice(1))); |
| 128 assertTrue(%HasFastObjectElements(a2.slice(1, 2))); |
| 129 assertEquals([{},2,3], a2.slice()); |
| 130 assertEquals([2,3], a2.slice(1)); |
| 131 assertEquals([2], a2.slice(1,2)); |
| 132 |
| 133 // Splice |
| 134 var a3 = [1,2,3]; |
| 135 var a3r; |
| 136 a3r = a3.splice(0, 0); |
| 137 assertTrue(%HasFastSmiElements(a3r)); |
| 138 assertTrue(%HasFastSmiElements(a3)); |
| 139 assertEquals([], a3r); |
| 140 assertEquals([1, 2, 3], a3); |
| 141 a3 = [1,2,3]; |
| 142 a3r = a3.splice(0, 1); |
| 143 assertTrue(%HasFastSmiElements(a3r)); |
| 144 assertTrue(%HasFastSmiElements(a3)); |
| 145 assertEquals([1], a3r); |
| 146 assertEquals([2, 3], a3); |
| 147 a3 = [1,2,3]; |
| 148 a3r = a3.splice(0, 0, 2); |
| 149 assertTrue(%HasFastSmiElements(a3r)); |
| 150 assertTrue(%HasFastSmiElements(a3)); |
| 151 assertEquals([], a3r); |
| 152 assertEquals([2, 1, 2, 3], a3); |
| 153 a3 = [1,2,3]; |
| 154 a3r = a3.splice(0, 1, 2); |
| 155 assertTrue(%HasFastSmiElements(a3r)); |
| 156 assertTrue(%HasFastSmiElements(a3)); |
| 157 assertEquals([1], a3r); |
| 158 assertEquals([2, 2, 3], a3); |
| 159 |
| 160 a3 = [1.1,2,3]; |
| 161 a3r = a3.splice(0, 0); |
| 162 assertTrue(%HasFastDoubleElements(a3r)); |
| 163 assertTrue(%HasFastDoubleElements(a3)); |
| 164 assertEquals([], a3r); |
| 165 assertEquals([1.1, 2, 3], a3); |
| 166 a3 = [1.1,2,3]; |
| 167 a3r = a3.splice(0, 1); |
| 168 assertTrue(%HasFastDoubleElements(a3r)); |
| 169 assertTrue(%HasFastDoubleElements(a3)); |
| 170 assertEquals([1.1], a3r); |
| 171 assertEquals([2, 3], a3); |
| 172 a3 = [1.1,2,3]; |
| 173 a3r = a3.splice(0, 0, 2); |
| 174 // Commented out since handled in js, which takes the best fit. |
| 175 // assertTrue(%HasFastDoubleElements(a3r)); |
| 176 assertTrue(%HasFastSmiElements(a3r)); |
| 177 assertTrue(%HasFastDoubleElements(a3)); |
| 178 assertEquals([], a3r); |
| 179 assertEquals([2, 1.1, 2, 3], a3); |
| 180 a3 = [1.1,2,3]; |
| 181 a3r = a3.splice(0, 1, 2); |
| 182 assertTrue(%HasFastDoubleElements(a3r)); |
| 183 assertTrue(%HasFastDoubleElements(a3)); |
| 184 assertEquals([1.1], a3r); |
| 185 assertEquals([2, 2, 3], a3); |
| 186 a3 = [1.1,2,3]; |
| 187 a3r = a3.splice(0, 0, 2.1); |
| 188 // Commented out since handled in js, which takes the best fit. |
| 189 // assertTrue(%HasFastDoubleElements(a3r)); |
| 190 assertTrue(%HasFastSmiElements(a3r)); |
| 191 assertTrue(%HasFastDoubleElements(a3)); |
| 192 assertEquals([], a3r); |
| 193 assertEquals([2.1, 1.1, 2, 3], a3); |
| 194 a3 = [1.1,2,3]; |
| 195 a3r = a3.splice(0, 1, 2.2); |
| 196 assertTrue(%HasFastDoubleElements(a3r)); |
| 197 assertTrue(%HasFastDoubleElements(a3)); |
| 198 assertEquals([1.1], a3r); |
| 199 assertEquals([2.2, 2, 3], a3); |
| 200 a3 = [1,2,3]; |
| 201 a3r = a3.splice(0, 0, 2.1); |
| 202 // Commented out since handled in js, which takes the best fit. |
| 203 // assertTrue(%HasFastDoubleElements(a3r)); |
| 204 assertTrue(%HasFastSmiElements(a3r)); |
| 205 assertTrue(%HasFastDoubleElements(a3)); |
| 206 assertEquals([], a3r); |
| 207 assertEquals([2.1, 1, 2, 3], a3); |
| 208 a3 = [1,2,3]; |
| 209 a3r = a3.splice(0, 1, 2.2); |
| 210 assertTrue(%HasFastDoubleElements(a3r)); |
| 211 assertTrue(%HasFastDoubleElements(a3)); |
| 212 assertEquals([1], a3r); |
| 213 assertEquals([2.2, 2, 3], a3); |
| 214 |
| 215 a3 = [{},2,3]; |
| 216 a3r = a3.splice(0, 0); |
| 217 assertTrue(%HasFastObjectElements(a3r)); |
| 218 assertTrue(%HasFastObjectElements(a3)); |
| 219 assertEquals([], a3r); |
| 220 assertEquals([{}, 2, 3], a3); |
| 221 a3 = [1,2,{}]; |
| 222 a3r = a3.splice(0, 1); |
| 223 assertTrue(%HasFastObjectElements(a3r)); |
| 224 assertTrue(%HasFastObjectElements(a3)); |
| 225 assertEquals([1], a3r); |
| 226 assertEquals([2, {}], a3); |
| 227 a3 = [1,2,3]; |
| 228 a3r = a3.splice(0, 0, {}); |
| 229 assertTrue(%HasFastObjectElements(a3r)); |
| 230 assertTrue(%HasFastObjectElements(a3)); |
| 231 assertEquals([], a3r); |
| 232 assertEquals([{}, 1, 2, 3], a3); |
| 233 a3 = [1,2,3]; |
| 234 a3r = a3.splice(0, 1, {}); |
| 235 assertTrue(%HasFastObjectElements(a3r)); |
| 236 assertTrue(%HasFastObjectElements(a3)); |
| 237 assertEquals([1], a3r); |
| 238 assertEquals([{}, 2, 3], a3); |
| 239 |
| 240 a3 = [1.1,2,3]; |
| 241 a3r = a3.splice(0, 0, {}); |
| 242 assertTrue(%HasFastObjectElements(a3r)); |
| 243 assertTrue(%HasFastObjectElements(a3)); |
| 244 assertEquals([], a3r); |
| 245 assertEquals([{}, 1.1, 2, 3], a3); |
| 246 a3 = [1.1,2,3]; |
| 247 a3r = a3.splice(0, 1, {}); |
| 248 assertTrue(%HasFastObjectElements(a3r)); |
| 249 assertTrue(%HasFastObjectElements(a3)); |
| 250 assertEquals([1.1], a3r); |
| 251 assertEquals([{}, 2, 3], a3); |
| 252 |
| 253 // Pop |
| 254 var a4 = [1,2,3]; |
| 255 assertEquals(3, a4.pop()); |
| 256 assertTrue(%HasFastSmiElements(a4)); |
| 257 a4 = [1.1,2,3]; |
| 258 assertEquals(3, a4.pop()); |
| 259 assertTrue(%HasFastDoubleElements(a4)); |
| 260 a4 = [{},2,3]; |
| 261 assertEquals(3, a4.pop()); |
| 262 assertTrue(%HasFastObjectElements(a4)); |
| 263 |
| 264 // Shift |
| 265 var a4 = [1,2,3]; |
| 266 assertEquals(1, a4.shift()); |
| 267 assertTrue(%HasFastSmiElements(a4)); |
| 268 a4 = [1.1,2,3]; |
| 269 assertEquals(1.1, a4.shift()); |
| 270 assertTrue(%HasFastDoubleElements(a4)); |
| 271 a4 = [{},2,3]; |
| 272 assertEquals({}, a4.shift()); |
| 273 assertTrue(%HasFastObjectElements(a4)); |
| 274 |
| 275 // Unshift |
| 276 var a4 = [1,2,3]; |
| 277 a4.unshift(1); |
| 278 assertTrue(%HasFastSmiElements(a4)); |
| 279 assertEquals([1,1,2,3], a4); |
| 280 a4 = [1,2,3]; |
| 281 a4.unshift(1.1); |
| 282 // TODO(verwaest): We'll want to support double unshifting as well. |
| 283 // assertTrue(%HasFastDoubleElements(a4)); |
| 284 assertTrue(%HasFastObjectElements(a4)); |
| 285 assertEquals([1.1,1,2,3], a4); |
| 286 a4 = [1.1,2,3]; |
| 287 a4.unshift(1); |
| 288 // assertTrue(%HasFastDoubleElements(a4)); |
| 289 assertTrue(%HasFastObjectElements(a4)); |
| 290 assertEquals([1,1.1,2,3], a4); |
| 291 a4 = [{},2,3]; |
| 292 a4.unshift(1); |
| 293 assertTrue(%HasFastObjectElements(a4)); |
| 294 assertEquals([1,{},2,3], a4); |
| 295 a4 = [{},2,3]; |
| 296 a4.unshift(1.1); |
| 297 assertTrue(%HasFastObjectElements(a4)); |
| 298 assertEquals([1.1,{},2,3], a4); |
| 299 } |
| 300 |
| 301 if (support_smi_only_arrays) { |
| 302 for (var i = 0; i < 3; i++) { |
| 303 array_natives_test(); |
| 304 } |
| 305 %OptimizeFunctionOnNextCall(array_natives_test); |
| 306 array_natives_test(); |
| 307 } |
OLD | NEW |