Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2013 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 | // Flags: --allow-natives-syntax |
| 28 | |
| 29 | // Test adding undefined from hole in double-holey to string. |
| 30 | var a = [1.5, , 1.8]; |
| 31 | |
| 32 | function f(a, i, l) { |
| 33 | var v = a[i]; |
| 34 | return l + v; |
| 35 | } |
| 36 | |
| 37 | assertEquals("test1.5", f(a, 0, "test")); |
| 38 | assertEquals("test1.5", f(a, 0, "test")); |
| 39 | %OptimizeFunctionOnNextCall(f); |
| 40 | assertEquals("testundefined", f(a, 1, "test")); |
| 41 | |
| 42 | // Test double-hole going through a phi to a string-add. |
| 43 | function f2(b, a1, a2) { |
| 44 | var v; |
| 45 | if (b) { |
| 46 | v = a1[0]; |
| 47 | } else { |
| 48 | v = a2[0]; |
| 49 | } |
| 50 | x = v * 2; |
| 51 | return "test" + v + x; |
| 52 | } |
| 53 | |
| 54 | f2(true, [1.4,1.8,,1.9], [1.4,1.8,,1.9]); |
| 55 | f2(true, [1.4,1.8,,1.9], [1.4,1.8,,1.9]); |
| 56 | f2(false, [1.4,1.8,,1.9], [1.4,1.8,,1.9]); |
| 57 | f2(false, [1.4,1.8,,1.9], [1.4,1.8,,1.9]); |
| 58 | %OptimizeFunctionOnNextCall(f2); |
| 59 | assertEquals("testundefinedNaN", f2(false, [,1.8,,1.9], [,1.9,,1.9])); |
| 60 | |
| 61 | // Test converting smi-hole to double-hole. |
| 62 | function t_smi(a) { |
| 63 | a[0] = 1.5; |
| 64 | } |
| 65 | |
| 66 | t_smi([1,,3]); |
| 67 | t_smi([1,,3]); |
| 68 | t_smi([1,,3]); |
| 69 | %OptimizeFunctionOnNextCall(t_smi); |
| 70 | var ta = [1,,3]; |
| 71 | t_smi(ta); |
| 72 | ta.__proto__ = [6,6,6]; |
| 73 | assertEquals([1.5,6,3], ta); |
| 74 | |
| 75 | // Test converting double-hole to tagged-hole. |
| 76 | function t(b) { |
| 77 | b[1] = {}; |
| 78 | } |
| 79 | |
| 80 | t([1.4, 1.6,,1.8, NaN]); |
| 81 | t([1.4, 1.6,,1.8, NaN]); |
| 82 | %OptimizeFunctionOnNextCall(t); |
| 83 | var a = [1.6, 1.8,,1.9, NaN]; |
| 84 | t(a); |
| 85 | a.__proto__ = [6,6,6,6,6]; |
| 86 | assertEquals([1.6, {}, 6, 1.9, NaN], a); |