Chromium Code Reviews| Index: test/mjsunit/regress/regress-2071.js | 
| diff --git a/test/mjsunit/regress/regress-2071.js b/test/mjsunit/regress/regress-2071.js | 
| new file mode 100644 | 
| index 0000000000000000000000000000000000000000..468cc12dd1ebca6bfe1836352e20dd4692bab7ce | 
| --- /dev/null | 
| +++ b/test/mjsunit/regress/regress-2071.js | 
| @@ -0,0 +1,80 @@ | 
| +// Copyright 2012 the V8 project authors. All rights reserved. | 
| +// Redistribution and use in source and binary forms, with or without | 
| +// modification, are permitted provided that the following conditions are | 
| +// met: | 
| +// | 
| +// * Redistributions of source code must retain the above copyright | 
| +// notice, this list of conditions and the following disclaimer. | 
| +// * Redistributions in binary form must reproduce the above | 
| +// copyright notice, this list of conditions and the following | 
| +// disclaimer in the documentation and/or other materials provided | 
| +// with the distribution. | 
| +// * Neither the name of Google Inc. nor the names of its | 
| +// contributors may be used to endorse or promote products derived | 
| +// from this software without specific prior written permission. | 
| +// | 
| +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 
| +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 
| +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 
| +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 
| +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 
| +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 
| +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
| +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
| +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
| +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 
| +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
| + | 
| +a = {}; | 
| + | 
| +a.b = 42; | 
| + | 
| +with(a) { | 
| + a.f = (function f1() { | 
| + function f2() { | 
| + print(b); | 
| 
 
Jakob Kummerow
2012/05/18 09:09:18
nit: is this print() statement needed?
 
 | 
| + return b; | 
| + }; | 
| + return f2; | 
| + })(); | 
| +} | 
| + | 
| +for(var i = 0; i < 10000; i++) { | 
| 
 
Jakob Kummerow
2012/05/18 09:09:18
nit: I think 1000 iterations is enough. Let's let
 
 | 
| + assertEquals(42, a.f()); | 
| +} | 
| + | 
| +with(a) { | 
| + a.g = (function f1() { | 
| + function f2() { | 
| + function f3() { | 
| + return b; | 
| + } | 
| + return f3; | 
| + }; | 
| + return f2(); | 
| + })(); | 
| +} | 
| + | 
| +for(var i = 0; i < 10000; i++) { | 
| + assertEquals(42, a.g()); | 
| +} | 
| + | 
| +function outer() { | 
| + with(a) { | 
| + a.h = (function f1() { | 
| + function f2() { | 
| + function f3() { | 
| + return b; | 
| + } | 
| + return f3; | 
| + }; | 
| + return f2(); | 
| + })(); | 
| + } | 
| +}; | 
| + | 
| +outer(); | 
| + | 
| +for(var i = 0; i < 10000; i++) { | 
| + assertEquals(42, a.h()); | 
| +} |