1 // Copyright 2013 the V8 project authors. All rights reserved. 2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. 3 // 4 // Redistribution and use in source and binary forms, with or without 5 // modification, are permitted provided that the following conditions 6 // are met: 7 // 1. Redistributions of source code must retain the above copyright 8 // notice, this list of conditions and the following disclaimer. 9 // 2. Redistributions in binary form must reproduce the above copyright 10 // notice, this list of conditions and the following disclaimer in the 11 // documentation and/or other materials provided with the distribution. 12 // 13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY 14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY 17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON 20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 23 24 description( 25 "This test checks for a specific regression that caused function calls to allocate too many temporary registers." 26 ); 27 28 var message = "PASS: Recursion did not run out of stack space." 29 try { 30 // Call a function recursively. 31 (function f(g, x) { 32 if (x > 3000) 33 return; 34 35 // Do lots of function calls -- when the bug was present, each 36 // of these calls would allocate a new temporary register. We can 37 // detect profligate register allocation because it will substantially 38 // curtail our recursion limit. 39 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 40 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 41 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 42 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 43 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 44 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 45 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 46 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 47 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 48 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 49 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 50 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 51 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 52 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 53 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 54 g(); g(); g(); g(); g(); g(); g(); g(); g(); g(); 55 56 f(g, ++x); 57 })(function() {}, 0); 58 } catch(e) { 59 message = "FAIL: Recursion threw an exception: " + e; 60 } 61 62 debug(message); 63
