Home | History | Annotate | Download | only in mjsunit
      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
     29 
     30 function a() {
     31   var sum = 0;
     32   for (var i = 0; i < 500; ++i) {
     33     sum = (i + sum) | 0;
     34   }
     35   return sum;
     36 }
     37 
     38 function b() {
     39   var sum = 0;
     40   for (var i = -500; i < 0; ++i) {
     41     sum = (i + sum) | 0;
     42   }
     43   return sum;
     44 }
     45 
     46 function c() {
     47   var sum = 0;
     48   for (var i = 0; i < 500; ++i) {
     49     sum += (i + -0x7fffffff) | 0;
     50   }
     51   return sum;
     52 }
     53 
     54 function d() {
     55   var sum = 0;
     56   for (var i = -501; i < 0; ++i) {
     57     sum += (i + 501) | 0;
     58   }
     59   return sum;
     60 }
     61 
     62 a();
     63 a();
     64 %OptimizeFunctionOnNextCall(a);
     65 assertEquals(124750, a());
     66 assertEquals(124750, a());
     67 
     68 b();
     69 b();
     70 %OptimizeFunctionOnNextCall(b);
     71 assertEquals(-125250, b());
     72 assertEquals(-125250, b());
     73 
     74 c();
     75 c();
     76 %OptimizeFunctionOnNextCall(c);
     77 assertEquals(-1073741698750, c());
     78 assertEquals(-1073741698750, c());
     79 
     80 d();
     81 d();
     82 %OptimizeFunctionOnNextCall(d);
     83 assertEquals(125250, d());
     84 assertEquals(125250, d());
     85