Home | History | Annotate | Download | only in regress
      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 var p = { f: function () { return "p"; } };
     31 var o = Object.create(p);
     32 o.x = true;
     33 delete o.x;  // slow case object
     34 
     35 var u = { x: 0, f: function () { return "u"; } };  // object with some other map
     36 
     37 function F(x) {
     38   return x.f();
     39 }
     40 
     41 // First make CALL IC in F go MEGAMORPHIC and ensure that we put the stub
     42 // that calls p.f (guarded by a negative dictionary lookup on the reciever)
     43 // into the stub cache
     44 assertEquals("p", F(o));
     45 assertEquals("p", F(o));
     46 assertEquals("u", F(u));
     47 assertEquals("p", F(o));
     48 assertEquals("u", F(u));
     49 
     50 // Optimize F. We will inline p.f into F guarded by map checked against
     51 // receiver which does not work for slow case objects.
     52 %OptimizeFunctionOnNextCall(F);
     53 assertEquals("p", F(o));
     54 
     55 // Add f to o. o's map will *not* change.
     56 o.f = function () { return "o"; };
     57 assertEquals("o", F(o));
     58