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 var o = [ function f0() { throw new Error(); },
     29           function f1() { o[0](); },
     30           function f2() { o[1](); },
     31           function f3() { o[2](); } ];
     32 
     33 Error.prepareStackTrace = function(error, frames) {
     34   Error.prepareStackTrace = undefined;  // Prevent recursion.
     35   try {
     36     assertEquals(5, frames.length);
     37     // Don't check the last frame since that's the top-level code.
     38     for (var i = 0; i < frames.length - 1; i++) {
     39       assertEquals(o[i], frames[i].getFunction());
     40       assertEquals(o, frames[i].getThis());
     41       // Private fields are no longer accessible.
     42       assertEquals(undefined, frames[i].receiver);
     43       assertEquals(undefined, frames[i].fun);
     44       assertEquals(undefined, frames[i].pos);
     45     }
     46     return "success";
     47   } catch (e) {
     48     return "fail";
     49   }
     50 }
     51 
     52 try {
     53   o[3]();
     54 } catch (e) {
     55   assertEquals("success", e.stack);
     56 };
     57 
     58 
     59 var o = [ function f0() { throw new Error(); },
     60           function f1() { o[0](); },
     61           function f2() { "use strict"; o[1](); },
     62           function f3() { o[2](); } ];
     63 
     64 Error.prepareStackTrace = function(error, frames) {
     65   Error.prepareStackTrace = undefined;  // Prevent recursion.
     66   try {
     67     assertEquals(5, frames.length);
     68     for (var i = 0; i < 2; i++) {
     69       // The first two frames are still classic mode.
     70       assertEquals(o[i], frames[i].getFunction());
     71       assertEquals(o, frames[i].getThis());
     72     }
     73     for (var i = 2; i < frames.length; i++) {
     74       // The rest are poisoned by the first strict mode function.
     75       assertEquals(undefined, frames[i].getFunction());
     76       assertEquals(undefined, frames[i].getThis());
     77     }
     78     for (var i = 0; i < frames.length - 1; i++) {
     79       // Function name remains accessible.
     80       assertEquals("f"+i, frames[i].getFunctionName());
     81     }
     82     return "success";
     83   } catch (e) {
     84     return e;
     85   }
     86 }
     87 
     88 try {
     89   o[3]();
     90 } catch (e) {
     91   assertEquals("success", e.stack);
     92 };
     93 
     94 
     95 var o = [ function f0() { "use strict"; throw new Error(); },
     96           function f1() { o[0](); },
     97           function f2() { o[1](); },
     98           function f3() { o[2](); } ];
     99 
    100 Error.prepareStackTrace = function(error, frames) {
    101   Error.prepareStackTrace = undefined;  // Prevent recursion.
    102   try {
    103     assertEquals(5, frames.length);
    104     for (var i = 0; i < frames.length; i++) {
    105       // The rest are poisoned by the first strict mode function.
    106       assertEquals(undefined, frames[i].getFunction());
    107       assertEquals(undefined, frames[i].getThis());
    108       if (i < frames.length - 1) {  // Function name remains accessible.
    109         assertEquals("f"+i, frames[i].getFunctionName());
    110       }
    111     }
    112     return "success";
    113   } catch (e) {
    114     return e;
    115   }
    116 }
    117 
    118 try {
    119   o[3]();
    120 } catch (e) {
    121   assertEquals("success", e.stack);
    122 };
    123