Home | History | Annotate | Download | only in compiler 
      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 --use-escape-analysis --max-opt-count=100
     29 
     30 // This tests that captured objects materialized through the deoptimizer
     31 // have field descriptors with a representation matching the values that
     32 // have actually been stored in the object.
     33 
     34 var values = [ function() { return {}; },
     35                function() { return 23; },
     36                function() { return 4.2; } ];
     37 
     38 function constructor(value_track) {
     39   this.x = value_track();
     40 }
     41 
     42 function access(value_track, value_break, deopt) {
     43   var o = new constructor(value_track);
     44   o.x = value_break;
     45   deopt.deopt
     46   assertEquals(value_break, o.x);
     47 }
     48 
     49 function test(value_track, value_break) {
     50   var deopt = { deopt:false };
     51 
     52   // Warm-up field tracking to a certain representation.
     53   access(value_track, value_track(), deopt);
     54   access(value_track, value_track(), deopt);
     55   %OptimizeFunctionOnNextCall(access);
     56   access(value_track, value_track(), deopt);
     57 
     58   // Deoptimize on a run with a different representation.
     59   delete deopt.deopt;
     60   access(value_track, value_break(), deopt);
     61 
     62   // Clear type feedback of the access function for next run.
     63   %ClearFunctionTypeFeedback(access);
     64 
     65   // Also make sure the initial map of the constructor is reset.
     66   constructor.prototype = {};
     67 }
     68 
     69 for (var i = 0; i < values.length; i++) {
     70   for (var j = 0; j < values.length; j++) {
     71     test(values[i], values[j])
     72   }
     73 }
     74