Home | History | Annotate | Download | only in compiler 
      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 
     28 // Flags: --allow-natives-syntax
     29 
     30 // Test overflow checks in optimized code.
     31 function testMul(a, b) {
     32   a *= 2;
     33   b *= 2;
     34   if (a < 1 && b < 1) {
     35     return a * b;
     36   }
     37 }
     38 
     39 for (var i=0; i<5; i++) testMul(0,0);
     40 %OptimizeFunctionOnNextCall(testMul);
     41 assertEquals(4611686018427388000, testMul(-0x40000000, -0x40000000));
     42 
     43 function testAdd(a, b) {
     44   a *= 2;
     45   b *= 2;
     46   if (a < 1 && b < 1) {
     47     return a + b;
     48   }
     49 }
     50 
     51 for (var i=0; i<5; i++) testAdd(0,0);
     52 %OptimizeFunctionOnNextCall(testAdd);
     53 assertEquals(-4294967296, testAdd(-0x40000000, -0x40000000));
     54 
     55 
     56 function testSub(a, b) {
     57   a *= 2;
     58   b *= 2;
     59   if (b == 2) {print(a); print(b);}
     60   if (a < 1 && b < 3) {
     61     return a - b;
     62   }
     63 }
     64 
     65 for (var i=0; i<5; i++) testSub(0,0);
     66 %OptimizeFunctionOnNextCall(testSub);
     67 assertEquals(-2147483650, testSub(-0x40000000, 1));
     68