Home | History | Annotate | Download | only in regress 
      1 // Copyright 2011 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 // Deoptimization after a logical not in an effect context should not see a
     31 // value for the logical not expression.
     32 function test0(n) {
     33   var a = new Array(n);
     34   for (var i = 0; i < n; ++i) {
     35     // ~ of a non-numeric value is used to trigger deoptimization.
     36     a[i] = void(!(delete 'object')) % ~(delete 4);
     37   }
     38 }
     39 
     40 // OSR (after deoptimization) is used to observe the stack height mismatch.
     41 for (var i = 0; i < 5; ++i) {
     42   for (var j = 1; j < 12; ++j) {
     43     test0(j * 1000);
     44   }
     45 }
     46 
     47 
     48 // Similar test with a different subexpression of unary !.
     49 function test1(n) {
     50   var a = new Array(n);
     51   for (var i = 0; i < n; ++i) {
     52     a[i] = void(!(- 'object')) % ~(delete 4);
     53   }
     54 }
     55 
     56 for (i = 0; i < 5; ++i) {
     57   for (j = 1; j < 12; ++j) {
     58     test1(j * 1000);
     59   }
     60 }
     61 
     62 
     63 // A similar issue, different subexpression of unary ! (e0 !== e1 is
     64 // translated into !(e0 == e1)) and different effect context.
     65 function side_effect() { }
     66 function observe(x, y) { return x; }
     67 function test2(x) {
     68   return observe(this,
     69                  (((side_effect.observe <= side_effect.side_effect) !== false),
     70                   x + 1));
     71 }
     72 
     73 for (var i = 0; i < 5; ++i) test2(0);
     74 %OptimizeFunctionOnNextCall(test2);
     75 test2(0);
     76 test2(test2);
     77