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 28 // Flags: --allow-natives-syntax --noalways-opt 29 30 function mul(a, b) { 31 return a * b; 32 } 33 34 35 mul(-1, 2); 36 mul(-1, 2); 37 %OptimizeFunctionOnNextCall(mul); 38 assertEquals(-2, mul(-1, 2)); 39 assertOptimized(mul); 40 41 // Deopt on minus zero. 42 assertEquals(-0, mul(-1, 0)); 43 assertUnoptimized(mul); 44 45 46 function mul2(a, b) { 47 return a * b; 48 } 49 50 mul2(-1, 2); 51 mul2(-1, 2); 52 %OptimizeFunctionOnNextCall(mul2); 53 54 // 2^30 is a smi boundary on arm and ia32. 55 var two_30 = 1 << 30; 56 // 2^31 is a smi boundary on x64. 57 var two_31 = 2 * two_30; 58 59 if (%IsValidSmi(two_31)) { 60 // Deopt on two_31 on x64. 61 assertEquals(two_31, mul2(-two_31, -1)); 62 assertUnoptimized(mul2); 63 } else { 64 // Deopt on two_30 on ia32. 65 assertEquals(two_30, mul2(-two_30, -1)); 66 assertUnoptimized(mul2); 67 } 68
